\n\nint main() {\n\t// C++ uses double quotes for strings and single quotes for characters.\n\tstd::string simple_string = \"This is a simple string\";\n\tchar letter = 'A';\n\tstd::cout << simple_string << \" \" << letter << std::endl;\n\n\t// C++ can implement multiline strings.\n\tstd::string multiline_string = R\"(\n\t\t\tAn example of multi-line string.\n\t\t\t\tText formatting is preserved.\n\t\t\tThis is a raw string literal, introduced in C++ 11.)\";\n\tstd::cout << multiline_string << std::endl;\n\n\t// C++'s primitive data types: bool, char, double, float, int, long, short,\n // can be used to to store data, for example,\n\tconst int block_length = 64;\n\tstd::cout << \"block length = \" << block_length << std::endl;\n\n\t// Vectors of these data types are also possible, for example,\n\tstd::vector<double> state = { 1.0, 2.0, 3.0 };\n}\n","language":"C++"},{"code":"module test {\n @Inject Console console;\n void run() {\n // characters are single quoted\n Char ch = 'x';\n console.print( $\"ch={ch.quoted()}\");\n\n // strings are double quoted\n String greeting = \"Hello\";\n console.print( $\"greeting={greeting.quoted()}\");\n\n // multi-line strings use '|' as a left column\n // the start of the first line escapes the '|' to indicate the start of the multiline\n // a trailing escape indicates that the current line continues without a linefeed\n String lines = \\|first line\n |second line\\\n | continued\n ;\n console.print($|lines=\n |{lines}\n );\n\n // the $\"...\" is a template string, containing {expressions}\n // the multi-line form of the template string uses $|\n String name = \"Bob\";\n String msg = $|{greeting} {name},\n |Have a nice day!\n |{ch}{ch}{ch}\n ;\n console.print($|msg=\n |{msg}\n );\n }\n}\n","language":"Ecstasy"},{"code":"'In FB there is no substr function, then\n'Function taken fron the https://www.freebasic.net/forum/index.php\n\nFunction substr(Byref soriginal As String, Byref spattern As Const String, Byref sreplacement As Const String) As String\n ' in <soriginal> replace all occurrences of <spattern> by <sreplacement>\n Dim As Uinteger p, q\n\n If sreplacement <> spattern Then\n p = Instr(soriginal, spattern)\n If p Then\n q = Len(sreplacement)\n If q = 0 Then q = 1\n Do\n soriginal = Left(soriginal, p - 1) + sreplacement + Mid(soriginal, p + Len(spattern))\n p = Instr(p + q, soriginal, spattern)\n Loop Until p = 0\n End If\n End If\n Return soriginal\nEnd Function\n\nDim As String text(1 To 3)\ntext(1) = \"This is 'first' example for quoting\"\ntext(2) = \"This is second 'example' for quoting\"\ntext(3) = \"This is third example 'for' quoting\"\n\nFor n As Integer = 1 To Ubound(text)\n Print !\"text for quoting:\\n\"; text(n)\n Print !\"quoted text:\\n\"; substr(text(n),\"'\",\"\"); !\"\\n\"\nNext n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"os\"\n \"regexp\"\n \"strconv\"\n)\n\n/* Quoting constructs in Go. */\n\n// In Go a Unicode codepoint, expressed as a 32-bit integer, is referred to as a 'rune'\n// but the more familiar term 'character' will be used instead here.\n\n// Character literal (single quotes).\n// Can contain any single character including an escaped character.\nvar (\n rl1 = 'a'\n rl2 = '\\'' // single quote can only be included in escaped form\n)\n\n// Interpreted string literal (double quotes).\n// A sequence of characters including escaped characters.\nvar (\n is1 = \"abc\"\n is2 = \"\\\"ab\\tc\\\"\" // double quote can only be included in escaped form\n)\n\n// Raw string literal(single back quotes).\n// Can contain any character including a 'physical' new line but excluding back quote.\n// Escaped characters are interpreted literally i.e. `\\n` is backslash followed by n.\n// Raw strings are typically used for hard-coding pieces of text perhaps\n// including single and/or double quotes without the need to escape them.\n// They are particularly useful for regular expressions.\nvar (\n rs1 = `\nfirst\"\nsecond'\nthird\"\n`\n rs2 = `This is one way of including a ` + \"`\" + ` in a raw string literal.`\n rs3 = `\\d+` // a sequence of one or more digits in a regular expression\n)\n\nfunc main() {\n fmt.Println(rl1, rl2) // prints the code point value not the character itself\n fmt.Println(is1, is2)\n fmt.Println(rs1)\n fmt.Println(rs2)\n re := regexp.MustCompile(rs3)\n fmt.Println(re.FindString(\"abcd1234efgh\"))\n\n /* None of the above quoting constructs can deal directly with interpolation.\n This is done instead using library functions.\n */\n\n // C-style using %d, %f, %s etc. within a 'printf' type function.\n n := 3\n fmt.Printf(\"\\nThere are %d quoting constructs in Go.\\n\", n)\n\n // Using a function such as fmt.Println which can take a variable\n // number of arguments, of any type, and print then out separated by spaces.\n s := \"constructs\"\n fmt.Println(\"There are\", n, \"quoting\", s, \"in Go.\")\n\n // Using the function os.Expand which requires a mapper function to fill placeholders\n // denoted by ${...} within a string.\n mapper := func(placeholder string) string {\n switch placeholder {\n case \"NUMBER\":\n return strconv.Itoa(n)\n case \"TYPES\":\n return s\n }\n return \"\"\n }\n fmt.Println(os.Expand(\"There are ${NUMBER} quoting ${TYPES} in Go.\", mapper))\n}\n","language":"Go"},{"code":"0 :0\n 1 2 3\n 4 5 6\n)\n","language":"J"},{"code":"{{)n\n 1 2 3\n 4 5 6\n}}\n","language":"J"},{"code":"NB. no trailing linefeed\nA=: '1 2 3'\n\nNB. removing linefeed\nA=: 0 : 0-.LF\n1 2 3\n)\n\nNB. removing linefeed\nA=: {{)n\n1 2 3\n}}-.LF\n","language":"J"},{"code":"{{\n {{\n A=: {{)n\n1 2 3\n}}-.LF\n }}''\n}}''\n","language":"J"},{"code":"import java.util.List;\n\npublic final class QuotingConstructs {\n\n\tpublic static void main(String[] args) {\n\t\t// Java uses double quotes for strings and single quotes for characters.\n\t\tString simple = \"This is a simple string\";\n\t\tchar letter = 'A';\n\t\t\n\t\t// A Text Block is denoted by triple quotes.\n\t\tString multiLineString = \"\"\"\n This is an example of multi-line string.\n Text formatting is preserved.\n Text blocks can be used for a multi-line string.\n \"\"\";\n\t\tSystem.out.println(multiLineString);\n\t\t\n\t\t// Java's primitive data types: boolean, byte, char, double, float, int, long, short,\n\t\t// can be used to to store data, for example,\n\t\tfinal int blockLength = 64;\n\t\t\n\t\t// Arrays or lists of these data types are possible, for example,\n\t\tdouble[] state = new double[] { 1.0, 2.0, 3.0 };\n\t\t\n\t\t// Custom data types can be stored in a record or a class, for example,\n\t\trecord Circle(int centreX, int centreY, double radius) {}\n\t\t\n\t\t// A list of custom data types:\n\t\tList<Circle> circles = List.of( new Circle(1, 2, 1.25), new Circle(-2, 3, 2.50) );\n\t}\n\n}\n","language":"Java"},{"code":"def data:\n \"A string\", 1, {\"a\":0}, [1,2,[3]]\n;\n","language":"Jq"},{"code":"\"This is not such a \"\n+ \"long string after all.\"\n","language":"Jq"},{"code":"julia> str = \"Hello, world.\\n\"\n\"Hello, world.\\n\"\n\njulia> \"\"\"Contains \"quote\" characters and\na newline\"\"\"\n\"Contains \\\"quote\\\" characters and \\na newline\"\n","language":"Julia"},{"code":"julia> str = \"\"\"\n Hello,\n world.\n \"\"\"\n\" Hello,\\n world.\\n\"\n","language":"Julia"},{"code":"julia> \"$greet, $whom.\\n\"\n\"Hello, world.\\n\"\n","language":"Julia"},{"code":"julia> \"1 + 2 = $(1 + 2)\"\n\"1 + 2 = 3\"\n","language":"Julia"},{"code":"julia> 'π'\n'π': Unicode U+03C0 (category Ll: Letter, lowercase)\n","language":"Julia"},{"code":"julia> mycommand = `echo hello`\n`echo hello`\n\njulia> typeof(mycommand)\nCmd\n\njulia> run(mycommand);\nhello\n","language":"Julia"},{"code":"julia> a = :+\n:+\n\njulia> typeof(a)\nSymbol\n\njulia> b = quote + end\nquote\n #= REPL[3]:1 =#\n +\nend\n\njulia> typeof(b)\nExpr\n\njulia> eval(a) == eval(b)\ntrue\n\njulia> c = :(2 + 3)\n:(2 + 3)\n\njulia> eval(c)\n5\n","language":"Julia"},{"code":"s1 = \"This is a double-quoted 'string' with embedded single-quotes.\"\ns2 = 'This is a single-quoted \"string\" with embedded double-quotes.'\ns3 = \"this is a double-quoted \\\"string\\\" with escaped double-quotes.\"\ns4 = 'this is a single-quoted \\'string\\' with escaped single-quotes.'\ns5 = [[This is a long-bracket \"'string'\" with embedded single- and double-quotes.]]\ns6 = [=[This is a level 1 long-bracket ]]string[[ with [[embedded]] long-brackets.]=]\ns7 = [==[This is a level 2 long-bracket ]=]string[=[ with [=[embedded]=] level 1 long-brackets, etc.]==]\ns8 = [[This is\na long-bracket string\nwith embedded\nline feeds]]\ns9 = \"any \\0 form \\1 of \\2 string \\3 may \\4 contain \\5 raw \\6 binary \\7 data \\xDB\"\nprint(s1)\nprint(s2)\nprint(s3)\nprint(s4)\nprint(s5)\nprint(s6)\nprint(s7)\nprint(s8)\nprint(s9) -- with audible \"bell\" from \\7 if supported by os\nprint(\"some raw binary:\", #s9, s9:byte(5), s9:byte(12), s9:byte(17))\n","language":"Lua"},{"code":"echo \"A simple string.\"\necho \"A simple string including tabulation special character \\\\t: \\t.\"\n\necho \"\"\"\nFirst part of a multiple string,\nfollowed by second part\nand third part.\n\"\"\"\n\necho r\"A raw string containing a \\.\"\n\n# Interpolation in strings.\nimport strformat\nconst C = \"constant\"\nconst S = fmt\"A string with interpolation of a {C}.\"\necho S\nvar x = 3\necho fmt\"A string with interpolation of expression “2 * x + 3”: {2 * x + 3}.\"\necho fmt\"Displaying “x” with an embedded format: {x:05}.\"\n\n# Regular expression string.\nimport re\nlet r = re\"\\d+\"\n\n# Pegs string.\nimport pegs\nlet e = peg\"\\d+\"\n\n# Array literal.\necho [1, 2, 3] # Element type if implicit (\"int\" here).\necho [byte(1), 2, 3] # Element type is specified by the first element type.\necho [byte 1, 2, 3] # An equivalent way to specify the type.\n\necho @[1, 2, 3] # Sequence of ints.\n\n# Tuples.\necho ('a', 1, true) # Tuple without explicit field names.\necho (x: 1, y: 2) # Tuple with two int fields \"x\" and \"y\".\n","language":"Nim"},{"code":"# 20221202 Perl programming solution\n\nuse strict;\nuse warnings;\n\nprint <<`EXEC` # superfluous alternative to qx/ / and ` `\nsleep 2; ls /etc/resolv.conf\nEXEC\n;\n # only with quoted begin tag then you can have spaces in between\nprint <<END # so << 'END' or << \"END\" and semi-colon is always optional\nMake sure that the end tag must be exactly the same as the begin tag.\nEND\n; # the above wouldn't have worked had it been something like\n # END␣ ␣ ␣ (with redundant trailing spaces)\n\nprint <<\"HERE1\", <<\"HERE2\" # it is also possible to stack heredocs\nHello from HERE1\nHERE1\nHello from HERE2\nHERE2\n;\n\nmy $haystack = 'Santa says HoHoHo'; # a quoted pattern expanded before\nmy $needle = \"\\x48\\x6F\"; # the regex is interpreted\nprint \"1) Found.\\n\" if $haystack =~ /$needle{3}/; # Matches Hooo\nprint \"2) Found.\\n\" if $haystack =~ /($needle){3}/; # Do what you mean\n\n # due to autoconversion, things may still work the same\n{ use Benchmark; # under (usually overlooked) scalar interpolation\n my ( $iterations, $x, $y ) = 1e7, rand, rand;\n timethese( $iterations, { 'normal' => ' $x + $y',\n 'useless' => '\"$x\" + \"$y\"' } );\n} # however in the 2nd case the boxing and unboxing are unnecessary\n\n{ # the following illustrate some behaviors under array interpolation\n my @Y_M_D = sub{$_[5]+1900,$_[4]+1,$_[3]}->(localtime(time));\n local $\\ = \"\\n\";\n print @Y_M_D; # YMD\n print \"@Y_M_D\"; # Y M D\n local $, = '-'; # output field separator\n print @Y_M_D; # Y-M-D\n print \"@Y_M_D\"; # Y M D\n local $\" = '_'; # interpolated list separator\n print \"@Y_M_D\"; # Y_M_D\n}\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">t123</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">`\n one\n two\n three\n `</span>\n<!--\n","language":"Phix"},{"code":"-->\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">t123</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n one\n two\n three\n \"\"\"</span>\n<!--\n","language":"Phix"},{"code":"-->\n <span style=\"color: #000000;\">x</span><span style=\"color: #008000;\">\"1 2 34 5678_AbC\"</span> <span style=\"color: #000080;font-style:italic;\">-- same as {0x01, 0x02, 0x34, 0x56, 0x78, 0xAB, 0x0C}\n -- note however it displays as {1,2,52,86,120,171,12}\n -- whereas x\"414243\" displays as \"ABC\" (as all chars)</span>\n<!--\n","language":"Phix"},{"code":"{2, 3, 5, 7, 11, 13, 17, 19}\n{1, 2, {3, 3, 3}, 4, {5, {6}}}\n{{\"John\", \"Smith\"}, 52389, 97.25}\n{} -- the 0-element sequence\n","language":"Phix"},{"code":"/*REXX program demonstrates various ways to express a string of characters or numbers.*/\na= 'This is one method of including a '' (an apostrophe) within a string.'\nb= \"This is one method of including a ' (an apostrophe) within a string.\"\n\n /*sometimes, an apostrophe is called */\n /*a quote. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nc= \"This is one method of including a \"\" (a double quote) within a string.\"\nd= 'This is one method of including a \" (a double quote) within a string.'\n\n /*sometimes, a double quote is also */\n /*called a quote, which can make for */\n /*some confusion and bewilderment. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nf= 'This is one method of expressing a long literal by concatenations, the ' || ,\n 'trailing character of the above clause must contain a trailing ' || ,\n 'comma (,) === note the embedded trailing blank in the above 2 statements.'\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ng= 'This is another method of expressing a long literal by ' ,\n \"abutments, the trailing character of the above clause must \" ,\n 'contain a trailing comma (,)'\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nh= 'This is another method of expressing a long literal by ' , /*still continued.*/\n \"abutments, the trailing character of the above clause must \" ,\n 'contain a trailing comma (,) --- in this case, the comment /* ... */ is ' ,\n 'essentially is not considered to be \"part of\" the REXX clause.'\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ni= 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109\n\n /*This is one way to express a list of */\n /*numbers that don't have a sign. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nj= 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109,\n 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181\n\n /*This is one way to express a long */\n /*list of numbers that don't have a */\n /*sign. */\n /*Note that this form of continuation */\n /*implies a blank is abutted to first */\n /*part of the REXX statement. */\n /*Also note that some REXXs have a */\n /*maximum clause length. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nk= 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109,\n 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181\n\n /*The J and K values are identical,*/\n /*superfluous and extraneous blanks are*/\n /*ignored. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nl= '-2 3 +5 7 -11 13 17 19 -23 29 -31 37 -41 43 47 -53 59 -61 67 -71 73 79 -83 89 97 -101'\n\n /*This is one way to express a list of */\n /*numbers that have a sign. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nm= a b c d f g h i j k l /*this will create a list of all the */\n /*listed strings used (so far) into */\n /*the variable L (with an */\n /*intervening blank between each */\n /*variable's value. */\n","language":"REXX"},{"code":"text = list(3)\n\ntext[1] = \"This is 'first' example for quoting\"\ntext[2] = \"This is second 'example' for quoting\"\ntext[3] = \"This is third example 'for' quoting\"\n\nfor n = 1 to len(text)\n see \"text for quoting: \" + nl + text[n] + nl\n str = substr(text[n],\"'\",\"\")\n see \"quoted text:\" + nl + str + nl + nl\nnext\n","language":"Ring"},{"code":"$a\n$Å\n$日\n","language":"Smalltalk"},{"code":"aBlock value. \"evaluate the block, passing no argument\"\nanotherBlock value:1 value:2. \"evaluate the block, passing two arguments\"\n","language":"Smalltalk"},{"code":"in the True class:\nifTrue: aBlock\n ^ aBlock value \"I am true, so I evaluate the block\"\n\nin the False class:\nifTrue: aBlock\n ^ nil \"I am false, so I ignore the block\"\n","language":"Smalltalk"},{"code":"#{\n foo: <someConstant>\n bar: <someConstant>\n}\n","language":"Smalltalk"},{"code":"#u16( 1 2 3 ). \" an array of unsigned int16s \"\n#u32( 1 2 3 ). \" an array of unsigned int32s \"\n#u64( 1 2 3 ). \" an array of unsigned int64s \"\n#s16( -1 2 3 ). \" an array of signed int16s \"\n#s32( -1 2 3 ). \" an array of signed int32s \"\n#s64( -1 2 3 ). \" an array of signed int64s \"\n#f16( -1 2.0 3 ). \" an array of float16s \"\n#f32( -1 2.0 3 ). \" an array of float32s \"\n#f64( -1 2.0 3 ). \" an array of float64s \"\n#b( 1 0 1 1 0 0 ). \" an array of bits \"\n#B( true false true true ). \" an array of booleans \"\n","language":"Smalltalk"},{"code":"'hello'\n'日本語\n","language":"Smalltalk"},{"code":"c'hello\\nthis\\tis a C string\\0x0D'\n","language":"Smalltalk"},{"code":"e'hello world; it is now {Time now}\\n'\n","language":"Smalltalk"},{"code":"#( 1 1.234 (1/2) foo 'hello' #(9 8 7) (99 88 77) $λ '日本語' true [1 2 3] false)\n","language":"Smalltalk"},{"code":"#[ 1 2 16rFF 2r0101010 ]\n","language":"Smalltalk"},{"code":"#'foo'\n#'foo bar baz'\n#foo. \" same as #'foo' \"\n#'++'\n#++ \" same as #'++' \"\n#a:b:c: \" same as #'a:b:c:' \"\n","language":"Smalltalk"},{"code":"[ expression . expression ... expression ]\n","language":"Smalltalk"},{"code":"[:arg1 :arg2 :... :argN | expression . expression ... expression ]\n","language":"Smalltalk"},{"code":"import \"./fmt\" for Fmt\n\n// simple string literal\nSystem.print(\"Hello world!\")\n\n// string literal including an escape sequence\nSystem.print(\"Hello tabbed\\tworld!\")\n\n// interpolated string literal\nvar w = \"world\"\nSystem.print(\"Hello interpolated %(w)!\")\n\n// 'printf' style\nFmt.print(\"Hello 'printf' style $s!\", w)\n\n// more complicated interpolated string literal\nvar h = \"Hello\"\nSystem.print(\"%(Fmt.s(-8, h)) more complicated interpolated %(w.map { |c| \"%(c + \"\\%\")\" }.join())!\")\n\n// more complicated 'printf' style\nFmt.print(\"$-8s more complicated 'printf' style $s\\%!\", h, w.join(\"\\%\"))\n\n// raw string literal\nvar r = \"\"\"\nHello, raw string literal which interpets a control code such as \"\\n\" and an\ninterpolation such as %(h) as verbatim text.\nSingle (\") or dual (\"\") double-quotes can be included without problem.\n\"\"\"\nSystem.print(r)\n","language":"Wren"},{"code":"MyString:\n byte \"Hello World\",0 ;a null-terminated string\nLookupTable:\n byte &03,&06,&09,&0C ;a pre-defined sequence of bytes (similar in concept to enum in C)\nTileGfx:\n incbin \"Z:\\game\\gfx\\tilemap.bmp\" ;a file containing bitmap graphics data\n","language":"Z80-Assembly"},{"code":"word $ABCD\nword $CD,$AB\n","language":"Z80-Assembly"},{"code":"lookup_table_lo:\nbyte <Table00,<Table01,<Table02\nlookup_table_hi:\nbyte >Table00,>Table01,>Table02\n","language":"Z80-Assembly"},{"code":"#<<<\ntext:=\n\"\nA\n\";\n#<<<\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Quoting_constructs\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Pretty much every programming language has some form of quoting construct to allow embedding of data in a program, be it literal strings, numeric data or some combination thereof.\\n\\nShow examples of the quoting constructs in your language. Explain where they would likely be used, what their primary use is, what limitations they have and why one might be preferred over another. Is one style [https://www.dictionary.com/browse/interpolate interpolating] and another not? Are there restrictions on the size of the quoted data? The type? The format?\\n\\nThis is intended to be open-ended and free form. If you find yourself writing more than a few thousand words of explanation, summarize and provide links to relevant documentation; but do provide at least a fairly comprehensive summary here, on this page, '''NOT''' just a link to [See the language docs].\\n\\nNote: This is primarily for quoting constructs for data to be \\\"embedded\\\" in some way into a program. If there is some special format for external data, it may be mentioned but that isn't the focus of this task.\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"LookUpTable: db $00,$03,$06,$09,$12 ;a sequence of pre-defined bytes\\n\\nMyString: db \\\"Hello World!\\\",0 ;a null-terminated string\\n\\nGraphicsData: incbin \\\"C:\\\\game\\\\gfx\\\\tilemap.chr\\\" ;a file containing the game's graphics\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"dw $ABCD\\ndb $CD,$AB\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"lookup_table_lo:\\nbyte <Table00,<Table01,<Table02\\nlookup_table_hi:\\nbyte >Table00,>Table01,>Table02\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"ByteData:\\nDC.B $01,$02,$03,$04,$05\\neven\\nWordData:\\nDC.W $01,$02\\nDC.W $03,$04\\n;the above was the same as DC.W $0001,$0002,$0003,$0004\\nLongData:\\nDC.L $00000001,$00000002,$00000004,$00000008\\n\\nMyString:\\nDC.B \\\"Hello World!\\\",0 ;a null terminator will not be automatically placed.\\neven\\n\",\n \"language\": \"68000-Assembly\"\n },\n {\n \"code\": \"DS.B 8 ;8 bytes, each equals 0\\nDS.W 16 ;16 words, each equals zero\\nDS.L 20 ;20 longs, each equals zero\\n\",\n \"language\": \"68000-Assembly\"\n },\n {\n \"code\": \"ScreenSize equ $1200\\n\\nMOVE.W (MyData),D0\\n\\nMyData\\nDC.W ScreenSize\\n\",\n \"language\": \"68000-Assembly\"\n },\n {\n \"code\": \"Printstring:\\n;insert your code here\\n\\nFunctionTable:\\nDC.L PrintString ;represents the address of the function \\\"PrintString\\\"\\n\",\n \"language\": \"68000-Assembly\"\n },\n {\n \"code\": \"DC.B $0200>>3 ;evaluates to $0040. As long as the final result fits within the designated storage size, you're good.\\nDC.W 4+5 ;evaluates to $0009\\nDC.W (40*30)-1 ;evaluates to $1199\\nDC.L MyFunction+4 ;evaluates to the address of MyFunction, plus 4.\\n\",\n \"language\": \"68000-Assembly\"\n },\n {\n \"code\": \"TilemapCollision:\\n\\tDC.B $11,$11,$11,$11,$11,$11,$11,$11,$11,$11\\n\\tDC.B $10,$00,$00,$00,$00,$00,$00,$00,$00,$01\\n\\tDC.B $10,$00,$00,$00,$00,$00,$00,$00,$00,$01\\n\\tDC.B $10,$00,$00,$00,$00,$00,$00,$00,$00,$01\\n\\tDC.B $10,$00,$00,$00,$00,$00,$00,$00,$00,$01\\n\\tDC.B $10,$00,$00,$00,$00,$00,$00,$00,$00,$01\\n\\tDC.B $11,$00,$00,$00,$00,$00,$00,$00,$00,$01\\n\\tDC.B $10,$00,$00,$00,$00,$00,$00,$00,$00,$01\\n\\tDC.B $10,$00,$00,$00,$00,$00,$00,$00,$00,$01\\n\\tDC.B $10,$00,$00,$00,$00,$00,$00,$00,$00,$01\\n\\tDC.B $10,$00,$00,$00,$00,$00,$00,$00,$00,$01\\n\\tDC.B $10,$00,$00,$00,$00,$00,$00,$00,$00,$01\\n\\tDC.B $10,$00,$00,$00,$00,$00,$00,$00,$00,$01\\n\\tDC.B $11,$11,$11,$11,$11,$11,$11,$11,$11,$11\\nTilemapCollisionEnd:\\n\\nMOVE.W #(TilemapCollisionEnd-TilemapCollision)-1,D0\\n;gets the length of this region of memory, minus 1, into D0.\\n; Again, even though the \\\"operands\\\" of this expression are longs,\\n; their difference fits in 16 bits and that's all that matters.\\n\",\n \"language\": \"68000-Assembly\"\n },\n {\n \"code\": \"? 0 : ? -326.12E-5 : ? HELLO : ? \\\"HELLO\\\" : ? \\\"HELLO\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \" 10 DATA 0,-326.12E-5,HELLO,\\\"HELLO\\\",\\\"HELLO\\n 20 READ A%: PRINT A%: READ A: PRINT A: READ A$: PRINT A$: READ A$: PRINT A$: READ A$: PRINT A$\\n 30 DATA AB\\\"C\\n 40 READ A$: PRINT A$\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"'a'\\n'b'\\n@\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"123\\n1.23\\n123E5\\n¯1234\\n∞\\nπ\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"⟨1, 2, 3⟩\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"1‿2‿3\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"\\\"Hello World\\\"\\n\\\"Quoted \\\"\\\" String\\\"\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n\\nint main() {\\n\\t// C++ uses double quotes for strings and single quotes for characters.\\n\\tstd::string simple_string = \\\"This is a simple string\\\";\\n\\tchar letter = 'A';\\n\\tstd::cout << simple_string << \\\" \\\" << letter << std::endl;\\n\\n\\t// C++ can implement multiline strings.\\n\\tstd::string multiline_string = R\\\"(\\n\\t\\t\\tAn example of multi-line string.\\n\\t\\t\\t\\tText formatting is preserved.\\n\\t\\t\\tThis is a raw string literal, introduced in C++ 11.)\\\";\\n\\tstd::cout << multiline_string << std::endl;\\n\\n\\t// C++'s primitive data types: bool, char, double, float, int, long, short,\\n // can be used to to store data, for example,\\n\\tconst int block_length = 64;\\n\\tstd::cout << \\\"block length = \\\" << block_length << std::endl;\\n\\n\\t// Vectors of these data types are also possible, for example,\\n\\tstd::vector<double> state = { 1.0, 2.0, 3.0 };\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"module test {\\n @Inject Console console;\\n void run() {\\n // characters are single quoted\\n Char ch = 'x';\\n console.print( $\\\"ch={ch.quoted()}\\\");\\n\\n // strings are double quoted\\n String greeting = \\\"Hello\\\";\\n console.print( $\\\"greeting={greeting.quoted()}\\\");\\n\\n // multi-line strings use '|' as a left column\\n // the start of the first line escapes the '|' to indicate the start of the multiline\\n // a trailing escape indicates that the current line continues without a linefeed\\n String lines = \\\\|first line\\n |second line\\\\\\n | continued\\n ;\\n console.print($|lines=\\n |{lines}\\n );\\n\\n // the $\\\"...\\\" is a template string, containing {expressions}\\n // the multi-line form of the template string uses $|\\n String name = \\\"Bob\\\";\\n String msg = $|{greeting} {name},\\n |Have a nice day!\\n |{ch}{ch}{ch}\\n ;\\n console.print($|msg=\\n |{msg}\\n );\\n }\\n}\\n\",\n \"language\": \"Ecstasy\"\n },\n {\n \"code\": \"'In FB there is no substr function, then\\n'Function taken fron the https://www.freebasic.net/forum/index.php\\n\\nFunction substr(Byref soriginal As String, Byref spattern As Const String, Byref sreplacement As Const String) As String\\n ' in <soriginal> replace all occurrences of <spattern> by <sreplacement>\\n Dim As Uinteger p, q\\n\\n If sreplacement <> spattern Then\\n p = Instr(soriginal, spattern)\\n If p Then\\n q = Len(sreplacement)\\n If q = 0 Then q = 1\\n Do\\n soriginal = Left(soriginal, p - 1) + sreplacement + Mid(soriginal, p + Len(spattern))\\n p = Instr(p + q, soriginal, spattern)\\n Loop Until p = 0\\n End If\\n End If\\n Return soriginal\\nEnd Function\\n\\nDim As String text(1 To 3)\\ntext(1) = \\\"This is 'first' example for quoting\\\"\\ntext(2) = \\\"This is second 'example' for quoting\\\"\\ntext(3) = \\\"This is third example 'for' quoting\\\"\\n\\nFor n As Integer = 1 To Ubound(text)\\n Print !\\\"text for quoting:\\\\n\\\"; text(n)\\n Print !\\\"quoted text:\\\\n\\\"; substr(text(n),\\\"'\\\",\\\"\\\"); !\\\"\\\\n\\\"\\nNext n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"os\\\"\\n \\\"regexp\\\"\\n \\\"strconv\\\"\\n)\\n\\n/* Quoting constructs in Go. */\\n\\n// In Go a Unicode codepoint, expressed as a 32-bit integer, is referred to as a 'rune'\\n// but the more familiar term 'character' will be used instead here.\\n\\n// Character literal (single quotes).\\n// Can contain any single character including an escaped character.\\nvar (\\n rl1 = 'a'\\n rl2 = '\\\\'' // single quote can only be included in escaped form\\n)\\n\\n// Interpreted string literal (double quotes).\\n// A sequence of characters including escaped characters.\\nvar (\\n is1 = \\\"abc\\\"\\n is2 = \\\"\\\\\\\"ab\\\\tc\\\\\\\"\\\" // double quote can only be included in escaped form\\n)\\n\\n// Raw string literal(single back quotes).\\n// Can contain any character including a 'physical' new line but excluding back quote.\\n// Escaped characters are interpreted literally i.e. `\\\\n` is backslash followed by n.\\n// Raw strings are typically used for hard-coding pieces of text perhaps\\n// including single and/or double quotes without the need to escape them.\\n// They are particularly useful for regular expressions.\\nvar (\\n rs1 = `\\nfirst\\\"\\nsecond'\\nthird\\\"\\n`\\n rs2 = `This is one way of including a ` + \\\"`\\\" + ` in a raw string literal.`\\n rs3 = `\\\\d+` // a sequence of one or more digits in a regular expression\\n)\\n\\nfunc main() {\\n fmt.Println(rl1, rl2) // prints the code point value not the character itself\\n fmt.Println(is1, is2)\\n fmt.Println(rs1)\\n fmt.Println(rs2)\\n re := regexp.MustCompile(rs3)\\n fmt.Println(re.FindString(\\\"abcd1234efgh\\\"))\\n\\n /* None of the above quoting constructs can deal directly with interpolation.\\n This is done instead using library functions.\\n */\\n\\n // C-style using %d, %f, %s etc. within a 'printf' type function.\\n n := 3\\n fmt.Printf(\\\"\\\\nThere are %d quoting constructs in Go.\\\\n\\\", n)\\n\\n // Using a function such as fmt.Println which can take a variable\\n // number of arguments, of any type, and print then out separated by spaces.\\n s := \\\"constructs\\\"\\n fmt.Println(\\\"There are\\\", n, \\\"quoting\\\", s, \\\"in Go.\\\")\\n\\n // Using the function os.Expand which requires a mapper function to fill placeholders\\n // denoted by ${...} within a string.\\n mapper := func(placeholder string) string {\\n switch placeholder {\\n case \\\"NUMBER\\\":\\n return strconv.Itoa(n)\\n case \\\"TYPES\\\":\\n return s\\n }\\n return \\\"\\\"\\n }\\n fmt.Println(os.Expand(\\\"There are ${NUMBER} quoting ${TYPES} in Go.\\\", mapper))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"0 :0\\n 1 2 3\\n 4 5 6\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"{{)n\\n 1 2 3\\n 4 5 6\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"NB. no trailing linefeed\\nA=: '1 2 3'\\n\\nNB. removing linefeed\\nA=: 0 : 0-.LF\\n1 2 3\\n)\\n\\nNB. removing linefeed\\nA=: {{)n\\n1 2 3\\n}}-.LF\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"{{\\n {{\\n A=: {{)n\\n1 2 3\\n}}-.LF\\n }}''\\n}}''\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.List;\\n\\npublic final class QuotingConstructs {\\n\\n\\tpublic static void main(String[] args) {\\n\\t\\t// Java uses double quotes for strings and single quotes for characters.\\n\\t\\tString simple = \\\"This is a simple string\\\";\\n\\t\\tchar letter = 'A';\\n\\t\\t\\n\\t\\t// A Text Block is denoted by triple quotes.\\n\\t\\tString multiLineString = \\\"\\\"\\\"\\n This is an example of multi-line string.\\n Text formatting is preserved.\\n Text blocks can be used for a multi-line string.\\n \\\"\\\"\\\";\\n\\t\\tSystem.out.println(multiLineString);\\n\\t\\t\\n\\t\\t// Java's primitive data types: boolean, byte, char, double, float, int, long, short,\\n\\t\\t// can be used to to store data, for example,\\n\\t\\tfinal int blockLength = 64;\\n\\t\\t\\n\\t\\t// Arrays or lists of these data types are possible, for example,\\n\\t\\tdouble[] state = new double[] { 1.0, 2.0, 3.0 };\\n\\t\\t\\n\\t\\t// Custom data types can be stored in a record or a class, for example,\\n\\t\\trecord Circle(int centreX, int centreY, double radius) {}\\n\\t\\t\\n\\t\\t// A list of custom data types:\\n\\t\\tList<Circle> circles = List.of( new Circle(1, 2, 1.25), new Circle(-2, 3, 2.50) );\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"def data:\\n \\\"A string\\\", 1, {\\\"a\\\":0}, [1,2,[3]]\\n;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"\\\"This is not such a \\\"\\n+ \\\"long string after all.\\\"\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"julia> str = \\\"Hello, world.\\\\n\\\"\\n\\\"Hello, world.\\\\n\\\"\\n\\njulia> \\\"\\\"\\\"Contains \\\"quote\\\" characters and\\na newline\\\"\\\"\\\"\\n\\\"Contains \\\\\\\"quote\\\\\\\" characters and \\\\na newline\\\"\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"julia> str = \\\"\\\"\\\"\\n Hello,\\n world.\\n \\\"\\\"\\\"\\n\\\" Hello,\\\\n world.\\\\n\\\"\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"julia> \\\"$greet, $whom.\\\\n\\\"\\n\\\"Hello, world.\\\\n\\\"\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"julia> \\\"1 + 2 = $(1 + 2)\\\"\\n\\\"1 + 2 = 3\\\"\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"julia> 'π'\\n'π': Unicode U+03C0 (category Ll: Letter, lowercase)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"julia> mycommand = `echo hello`\\n`echo hello`\\n\\njulia> typeof(mycommand)\\nCmd\\n\\njulia> run(mycommand);\\nhello\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"julia> a = :+\\n:+\\n\\njulia> typeof(a)\\nSymbol\\n\\njulia> b = quote + end\\nquote\\n #= REPL[3]:1 =#\\n +\\nend\\n\\njulia> typeof(b)\\nExpr\\n\\njulia> eval(a) == eval(b)\\ntrue\\n\\njulia> c = :(2 + 3)\\n:(2 + 3)\\n\\njulia> eval(c)\\n5\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"s1 = \\\"This is a double-quoted 'string' with embedded single-quotes.\\\"\\ns2 = 'This is a single-quoted \\\"string\\\" with embedded double-quotes.'\\ns3 = \\\"this is a double-quoted \\\\\\\"string\\\\\\\" with escaped double-quotes.\\\"\\ns4 = 'this is a single-quoted \\\\'string\\\\' with escaped single-quotes.'\\ns5 = [[This is a long-bracket \\\"'string'\\\" with embedded single- and double-quotes.]]\\ns6 = [=[This is a level 1 long-bracket ]]string[[ with [[embedded]] long-brackets.]=]\\ns7 = [==[This is a level 2 long-bracket ]=]string[=[ with [=[embedded]=] level 1 long-brackets, etc.]==]\\ns8 = [[This is\\na long-bracket string\\nwith embedded\\nline feeds]]\\ns9 = \\\"any \\\\0 form \\\\1 of \\\\2 string \\\\3 may \\\\4 contain \\\\5 raw \\\\6 binary \\\\7 data \\\\xDB\\\"\\nprint(s1)\\nprint(s2)\\nprint(s3)\\nprint(s4)\\nprint(s5)\\nprint(s6)\\nprint(s7)\\nprint(s8)\\nprint(s9) -- with audible \\\"bell\\\" from \\\\7 if supported by os\\nprint(\\\"some raw binary:\\\", #s9, s9:byte(5), s9:byte(12), s9:byte(17))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"echo \\\"A simple string.\\\"\\necho \\\"A simple string including tabulation special character \\\\\\\\t: \\\\t.\\\"\\n\\necho \\\"\\\"\\\"\\nFirst part of a multiple string,\\nfollowed by second part\\nand third part.\\n\\\"\\\"\\\"\\n\\necho r\\\"A raw string containing a \\\\.\\\"\\n\\n# Interpolation in strings.\\nimport strformat\\nconst C = \\\"constant\\\"\\nconst S = fmt\\\"A string with interpolation of a {C}.\\\"\\necho S\\nvar x = 3\\necho fmt\\\"A string with interpolation of expression “2 * x + 3”: {2 * x + 3}.\\\"\\necho fmt\\\"Displaying “x” with an embedded format: {x:05}.\\\"\\n\\n# Regular expression string.\\nimport re\\nlet r = re\\\"\\\\d+\\\"\\n\\n# Pegs string.\\nimport pegs\\nlet e = peg\\\"\\\\d+\\\"\\n\\n# Array literal.\\necho [1, 2, 3] # Element type if implicit (\\\"int\\\" here).\\necho [byte(1), 2, 3] # Element type is specified by the first element type.\\necho [byte 1, 2, 3] # An equivalent way to specify the type.\\n\\necho @[1, 2, 3] # Sequence of ints.\\n\\n# Tuples.\\necho ('a', 1, true) # Tuple without explicit field names.\\necho (x: 1, y: 2) # Tuple with two int fields \\\"x\\\" and \\\"y\\\".\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"# 20221202 Perl programming solution\\n\\nuse strict;\\nuse warnings;\\n\\nprint <<`EXEC` # superfluous alternative to qx/ / and ` `\\nsleep 2; ls /etc/resolv.conf\\nEXEC\\n;\\n # only with quoted begin tag then you can have spaces in between\\nprint <<END # so << 'END' or << \\\"END\\\" and semi-colon is always optional\\nMake sure that the end tag must be exactly the same as the begin tag.\\nEND\\n; # the above wouldn't have worked had it been something like\\n # END␣ ␣ ␣ (with redundant trailing spaces)\\n\\nprint <<\\\"HERE1\\\", <<\\\"HERE2\\\" # it is also possible to stack heredocs\\nHello from HERE1\\nHERE1\\nHello from HERE2\\nHERE2\\n;\\n\\nmy $haystack = 'Santa says HoHoHo'; # a quoted pattern expanded before\\nmy $needle = \\\"\\\\x48\\\\x6F\\\"; # the regex is interpreted\\nprint \\\"1) Found.\\\\n\\\" if $haystack =~ /$needle{3}/; # Matches Hooo\\nprint \\\"2) Found.\\\\n\\\" if $haystack =~ /($needle){3}/; # Do what you mean\\n\\n # due to autoconversion, things may still work the same\\n{ use Benchmark; # under (usually overlooked) scalar interpolation\\n my ( $iterations, $x, $y ) = 1e7, rand, rand;\\n timethese( $iterations, { 'normal' => ' $x + $y',\\n 'useless' => '\\\"$x\\\" + \\\"$y\\\"' } );\\n} # however in the 2nd case the boxing and unboxing are unnecessary\\n\\n{ # the following illustrate some behaviors under array interpolation\\n my @Y_M_D = sub{$_[5]+1900,$_[4]+1,$_[3]}->(localtime(time));\\n local $\\\\ = \\\"\\\\n\\\";\\n print @Y_M_D; # YMD\\n print \\\"@Y_M_D\\\"; # Y M D\\n local $, = '-'; # output field separator\\n print @Y_M_D; # Y-M-D\\n print \\\"@Y_M_D\\\"; # Y M D\\n local $\\\" = '_'; # interpolated list separator\\n print \\\"@Y_M_D\\\"; # Y_M_D\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">t123</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">`\\n one\\n two\\n three\\n `</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">t123</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n one\\n two\\n three\\n \\\"\\\"\\\"</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #008000;\\\">\\\"1 2 34 5678_AbC\\\"</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- same as {0x01, 0x02, 0x34, 0x56, 0x78, 0xAB, 0x0C}\\n -- note however it displays as {1,2,52,86,120,171,12}\\n -- whereas x\\\"414243\\\" displays as \\\"ABC\\\" (as all chars)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"{2, 3, 5, 7, 11, 13, 17, 19}\\n{1, 2, {3, 3, 3}, 4, {5, {6}}}\\n{{\\\"John\\\", \\\"Smith\\\"}, 52389, 97.25}\\n{} -- the 0-element sequence\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"/*REXX program demonstrates various ways to express a string of characters or numbers.*/\\na= 'This is one method of including a '' (an apostrophe) within a string.'\\nb= \\\"This is one method of including a ' (an apostrophe) within a string.\\\"\\n\\n /*sometimes, an apostrophe is called */\\n /*a quote. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nc= \\\"This is one method of including a \\\"\\\" (a double quote) within a string.\\\"\\nd= 'This is one method of including a \\\" (a double quote) within a string.'\\n\\n /*sometimes, a double quote is also */\\n /*called a quote, which can make for */\\n /*some confusion and bewilderment. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nf= 'This is one method of expressing a long literal by concatenations, the ' || ,\\n 'trailing character of the above clause must contain a trailing ' || ,\\n 'comma (,) === note the embedded trailing blank in the above 2 statements.'\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ng= 'This is another method of expressing a long literal by ' ,\\n \\\"abutments, the trailing character of the above clause must \\\" ,\\n 'contain a trailing comma (,)'\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nh= 'This is another method of expressing a long literal by ' , /*still continued.*/\\n \\\"abutments, the trailing character of the above clause must \\\" ,\\n 'contain a trailing comma (,) --- in this case, the comment /* ... */ is ' ,\\n 'essentially is not considered to be \\\"part of\\\" the REXX clause.'\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ni= 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109\\n\\n /*This is one way to express a list of */\\n /*numbers that don't have a sign. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nj= 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109,\\n 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181\\n\\n /*This is one way to express a long */\\n /*list of numbers that don't have a */\\n /*sign. */\\n /*Note that this form of continuation */\\n /*implies a blank is abutted to first */\\n /*part of the REXX statement. */\\n /*Also note that some REXXs have a */\\n /*maximum clause length. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nk= 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109,\\n 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181\\n\\n /*The J and K values are identical,*/\\n /*superfluous and extraneous blanks are*/\\n /*ignored. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nl= '-2 3 +5 7 -11 13 17 19 -23 29 -31 37 -41 43 47 -53 59 -61 67 -71 73 79 -83 89 97 -101'\\n\\n /*This is one way to express a list of */\\n /*numbers that have a sign. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nm= a b c d f g h i j k l /*this will create a list of all the */\\n /*listed strings used (so far) into */\\n /*the variable L (with an */\\n /*intervening blank between each */\\n /*variable's value. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"text = list(3)\\n\\ntext[1] = \\\"This is 'first' example for quoting\\\"\\ntext[2] = \\\"This is second 'example' for quoting\\\"\\ntext[3] = \\\"This is third example 'for' quoting\\\"\\n\\nfor n = 1 to len(text)\\n see \\\"text for quoting: \\\" + nl + text[n] + nl\\n str = substr(text[n],\\\"'\\\",\\\"\\\")\\n see \\\"quoted text:\\\" + nl + str + nl + nl\\nnext\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"$a\\n$Å\\n$日\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"aBlock value. \\\"evaluate the block, passing no argument\\\"\\nanotherBlock value:1 value:2. \\\"evaluate the block, passing two arguments\\\"\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"in the True class:\\nifTrue: aBlock\\n ^ aBlock value \\\"I am true, so I evaluate the block\\\"\\n\\nin the False class:\\nifTrue: aBlock\\n ^ nil \\\"I am false, so I ignore the block\\\"\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"#{\\n foo: <someConstant>\\n bar: <someConstant>\\n}\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"#u16( 1 2 3 ). \\\" an array of unsigned int16s \\\"\\n#u32( 1 2 3 ). \\\" an array of unsigned int32s \\\"\\n#u64( 1 2 3 ). \\\" an array of unsigned int64s \\\"\\n#s16( -1 2 3 ). \\\" an array of signed int16s \\\"\\n#s32( -1 2 3 ). \\\" an array of signed int32s \\\"\\n#s64( -1 2 3 ). \\\" an array of signed int64s \\\"\\n#f16( -1 2.0 3 ). \\\" an array of float16s \\\"\\n#f32( -1 2.0 3 ). \\\" an array of float32s \\\"\\n#f64( -1 2.0 3 ). \\\" an array of float64s \\\"\\n#b( 1 0 1 1 0 0 ). \\\" an array of bits \\\"\\n#B( true false true true ). \\\" an array of booleans \\\"\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"'hello'\\n'日本語\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"c'hello\\\\nthis\\\\tis a C string\\\\0x0D'\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"e'hello world; it is now {Time now}\\\\n'\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"#( 1 1.234 (1/2) foo 'hello' #(9 8 7) (99 88 77) $λ '日本語' true [1 2 3] false)\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"#[ 1 2 16rFF 2r0101010 ]\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"#'foo'\\n#'foo bar baz'\\n#foo. \\\" same as #'foo' \\\"\\n#'++'\\n#++ \\\" same as #'++' \\\"\\n#a:b:c: \\\" same as #'a:b:c:' \\\"\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"[ expression . expression ... expression ]\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"[:arg1 :arg2 :... :argN | expression . expression ... expression ]\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\n// simple string literal\\nSystem.print(\\\"Hello world!\\\")\\n\\n// string literal including an escape sequence\\nSystem.print(\\\"Hello tabbed\\\\tworld!\\\")\\n\\n// interpolated string literal\\nvar w = \\\"world\\\"\\nSystem.print(\\\"Hello interpolated %(w)!\\\")\\n\\n// 'printf' style\\nFmt.print(\\\"Hello 'printf' style $s!\\\", w)\\n\\n// more complicated interpolated string literal\\nvar h = \\\"Hello\\\"\\nSystem.print(\\\"%(Fmt.s(-8, h)) more complicated interpolated %(w.map { |c| \\\"%(c + \\\"\\\\%\\\")\\\" }.join())!\\\")\\n\\n// more complicated 'printf' style\\nFmt.print(\\\"$-8s more complicated 'printf' style $s\\\\%!\\\", h, w.join(\\\"\\\\%\\\"))\\n\\n// raw string literal\\nvar r = \\\"\\\"\\\"\\nHello, raw string literal which interpets a control code such as \\\"\\\\n\\\" and an\\ninterpolation such as %(h) as verbatim text.\\nSingle (\\\") or dual (\\\"\\\") double-quotes can be included without problem.\\n\\\"\\\"\\\"\\nSystem.print(r)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"MyString:\\n byte \\\"Hello World\\\",0 ;a null-terminated string\\nLookupTable:\\n byte &03,&06,&09,&0C ;a pre-defined sequence of bytes (similar in concept to enum in C)\\nTileGfx:\\n incbin \\\"Z:\\\\game\\\\gfx\\\\tilemap.bmp\\\" ;a file containing bitmap graphics data\\n\",\n \"language\": \"Z80-Assembly\"\n },\n {\n \"code\": \"word $ABCD\\nword $CD,$AB\\n\",\n \"language\": \"Z80-Assembly\"\n },\n {\n \"code\": \"lookup_table_lo:\\nbyte <Table00,<Table01,<Table02\\nlookup_table_hi:\\nbyte >Table00,>Table01,>Table02\\n\",\n \"language\": \"Z80-Assembly\"\n },\n {\n \"code\": \"#<<<\\ntext:=\\n\\\"\\nA\\n\\\";\\n#<<<\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Quoting-constructs"}}},{"rowIdx":1552,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Radical_of_an_integer\n","language":"00-META"},{"code":";Definition\nThe '''radical''' of a positive integer is defined as the product of its distinct prime factors.\n\nAlthough the integer 1 has no prime factors, its radical is regarded as 1 by convention. \n\n;Example\nThe radical of 504 = 2³ x 3² x 7 is: 2 x 3 x 7 = 42.\n\n;Task\n1. Find and show on this page the radicals of the first '''50''' positive integers.\n\n2. Find and show the radicals of the integers: '''99999, 499999''' and '''999999'''.\n\n3. By considering their radicals, show the distribution of the first '''one million''' positive integers by numbers of distinct prime factors (hint: the maximum number of distinct factors is 7). \n\n;Bonus\n\nBy (preferably) using an independent method, calculate the number of primes and the number of powers of primes less than or equal to '''one million''' and hence check that your answer in 3. above for numbers with one distinct prime is correct.\n\n;Related tasks\n* [[Square-free integers]]\n* [[Almost prime]]\n\n;References\n* Wikipedia article [[wp:Radical_of_an_integer|Radical of an integer]] \n* OEIS sequence [[oeis:A007947|A007947: Largest square free number dividing n]] \n<br>\n\n","language":"00-TASK"},{"code":"BEGIN # find the radicals of some integers - the radical of n is the product #\n # of thr the distinct prime factors of n, the radical of 1 is 1 #\n\n INT max number = 1 000 000; # maximum number we will consider #\n [ 1 : max number ]INT upfc; # unique prime factor counts #\n [ 1 : max number ]INT radical; # table of radicals #\n FOR i TO UPB upfc DO upfc[ i ] := 0; radical[ i ] := 1 OD;\n FOR i FROM 2 TO UPB upfc DO\n IF upfc[ i ] = 0 THEN\n radical[ i ] := i;\n upfc[ i ] := 1;\n FOR j FROM i + i BY i TO UPB upfc DO\n upfc[ j ] +:= 1;\n radical[ j ] *:= i\n OD\n FI\n OD;\n # show the radicals of the first 50 positive integers #\n print( ( \"Radicals of 1 to 50:\", newline ) );\n FOR i TO 50 DO\n print( ( whole( radical[ i ], -5 ) ) );\n IF i MOD 10 = 0 THEN print( ( newline ) ) FI\n OD;\n # radicals of some specific numbers #\n print( ( newline ) );\n print( ( \"Radical of 99999: \", whole( radical[ 99999 ], 0 ), newline ) );\n print( ( \"Radical of 499999: \", whole( radical[ 499999 ], 0 ), newline ) );\n print( ( \"Radical of 999999: \", whole( radical[ 999999 ], 0 ), newline ) );\n print( ( newline ) );\n # find the maximum number of unique prime factors #\n INT max upfc := 0;\n # show the distribution of the unique prime factor counts #\n FOR i TO UPB upfc DO IF upfc[ i ] > max upfc THEN max upfc := upfc[ i ] FI OD;\n [ 0 : max upfc ]INT dpfc; FOR i FROM LWB dpfc TO UPB dpfc DO dpfc[ i ] := 0 OD;\n FOR i TO UPB upfc DO\n dpfc[ upfc[ i ] ] +:= 1\n OD;\n print( ( \"Distribution of radicals:\", newline ) );\n FOR i FROM LWB dpfc TO UPB dpfc DO\n print( ( whole( i, -2 ), \": \", whole( dpfc[ i ], 0 ), newline ) )\n OD\nEND\n","language":"ALGOL-68"},{"code":"#include <stdio.h>\n\nint radical(int num, int *dps_out) {\n int rad = 1, dps = 0, div;\n\n if ((num & 1) == 0) {\n while ((num & 1) == 0) num >>= 1;\n rad *= 2;\n dps++;\n }\n\n for (div = 3; div <= num; div += 2) {\n if (num % div != 0) continue;\n rad *= div;\n dps++;\n while (num % div == 0) num /= div;\n }\n\n if (dps_out != NULL) *dps_out = dps;\n return rad;\n}\n\n\nvoid show_first_50() {\n int n;\n printf(\"Radicals of 1..50:\\n\");\n for (n = 1; n <= 50; n++) {\n printf(\"%5d\", radical(n, NULL));\n if (n % 5 == 0) printf(\"\\n\");\n }\n}\n\nvoid show_rad(int n) {\n printf(\"The radical of %d is %d.\\n\", n, radical(n, NULL));\n}\n\nvoid find_distribution() {\n int n, dps, dist[8] = {0};\n\n for (n = 1; n <= 1000000; n++) {\n printf(\"%d\\r\", n);\n radical(n, &dps);\n dist[dps]++;\n }\n\n printf(\"Distribution of radicals:\\n\");\n for (dps = 0; dps < 8; dps++) {\n printf(\"%d: %d\\n\", dps, dist[dps]);\n }\n}\n\nint main() {\n show_first_50();\n printf(\"\\n\");\n show_rad(99999);\n show_rad(499999);\n show_rad(999999);\n printf(\"\\n\");\n find_distribution();\n return 0;\n}\n","language":"C"},{"code":"#include <iomanip>\n#include <iostream>\n#include <map>\n#include <vector>\n\nint radical(int n, int& count) {\n if (n == 1) {\n count = 1;\n return 1;\n }\n int product = 1;\n count = 0;\n if ((n & 1) == 0) {\n product *= 2;\n ++count;\n while ((n & 1) == 0)\n n >>= 1;\n }\n for (int p = 3, sq = 9; sq <= n; p += 2) {\n if (n % p == 0) {\n product *= p;\n ++count;\n while (n % p == 0)\n n /= p;\n }\n sq += (p + 1) << 2;\n }\n if (n > 1) {\n product *= n;\n ++count;\n }\n return product;\n}\n\nstd::vector<bool> prime_sieve(int limit) {\n std::vector<bool> sieve(limit, true);\n if (limit > 0)\n sieve[0] = false;\n if (limit > 1)\n sieve[1] = false;\n for (int i = 4; i < limit; i += 2)\n sieve[i] = false;\n for (int p = 3, sq = 9; sq < limit; p += 2) {\n if (sieve[p]) {\n for (int q = sq; q < limit; q += p << 1)\n sieve[q] = false;\n }\n sq += (p + 1) << 2;\n }\n return sieve;\n}\n\nint main() {\n std::cout.imbue(std::locale(\"\"));\n std::cout << \"Radicals of the first 50 positive integers:\\n\";\n int count = 0;\n for (int i = 1; i <= 50; ++i) {\n std::cout << std::setw(2) << radical(i, count)\n << (i % 10 == 0 ? '\\n' : ' ');\n }\n std::cout << '\\n';\n for (int i : {99999, 499999, 999999}) {\n std::cout << \"Radical of \" << std::setw(7) << i << \" is \"\n << std::setw(7) << radical(i, count) << \".\\n\";\n }\n std::map<int, int> prime_factors;\n const int limit = 1000000;\n for (int i = 1; i <= limit; ++i) {\n radical(i, count);\n ++prime_factors[count];\n }\n std::cout << \"\\nRadical factor count breakdown up to \" << limit << \":\\n\";\n for (const auto& [count, total] : prime_factors) {\n std::cout << count << \": \" << std::setw(7) << total << '\\n';\n }\n auto sieve = prime_sieve(limit + 1);\n int primes = 0, prime_powers = 0;\n for (int i = 1; i <= limit; ++i) {\n if (sieve[i]) {\n ++primes;\n int n = limit;\n while (i <= n / i) {\n ++prime_powers;\n n /= i;\n }\n }\n }\n std::cout << \"\\nUp to \" << limit << \":\\n\";\n std::cout << \"Primes: \" << std::setw(6) << primes\n << \"\\nPowers: \" << std::setw(6) << prime_powers\n << \"\\nPlus 1: \" << std::setw(6) << 1\n << \"\\nTotal: \" << std::setw(6) << primes + prime_powers + 1\n << '\\n';\n}\n","language":"C++"},{"code":"distinct_factors = iter (n: int) yields (int)\n if n // 2 = 0 then\n yield(2)\n while n // 2 = 0 do n := n / 2 end\n end\n\n div: int := 3\n while div <= n do\n if n // div = 0 then\n yield(div)\n while n // div = 0 do n := n / div end\n end\n div := div + 2\n end\nend distinct_factors\n\nradical = proc (n: int) returns (int)\n rad: int := 1\n for fac: int in distinct_factors(n) do\n rad := rad * fac\n end\n return(rad)\nend radical\n\ndpf_count = proc (n: int) returns (int)\n count: int := 0\n for fac: int in distinct_factors(n) do\n count := count + 1\n end\n return(count)\nend dpf_count\n\nshow_first_50 = proc (out: stream)\n stream$putl(out, \"Radicals of 1..50:\")\n for n: int in int$from_to(1, 50) do\n stream$putright(out, int$unparse(radical(n)), 5)\n if n // 10 = 0 then stream$putl(out, \"\") end\n end\nend show_first_50\n\nshow_radical = proc (out: stream, n: int)\n stream$puts(out, \"The radical of \")\n stream$puts(out, int$unparse(n))\n stream$puts(out, \" is \")\n stream$puts(out, int$unparse(radical(n)))\n stream$putl(out, \".\")\nend show_radical\n\nfind_distribution = proc (out: stream)\n dist: array[int] := array[int]$fill(0, 8, 0)\n for n: int in int$from_to(1, 1000000) do\n stream$putright(out, int$unparse(n) || \"\\r\", 8)\n dpf: int := dpf_count(n)\n dist[dpf] := dist[dpf] + 1\n end\n\n stream$putl(out, \"Distribution of radicals:\")\n for dpf: int in array[int]$indexes(dist) do\n stream$putright(out, int$unparse(dpf), 1)\n stream$puts(out, \": \")\n stream$putright(out, int$unparse(dist[dpf]), 8)\n stream$putl(out, \"\")\n end\nend find_distribution\n\nstart_up = proc ()\n po: stream := stream$primary_output()\n\n show_first_50(po)\n stream$putl(po, \"\")\n\n for n: int in array[int]$elements(array[int]$[99999, 499999, 999999]) do\n show_radical(po, n)\n end\n stream$putl(po, \"\")\n\n find_distribution(po)\nend start_up\n","language":"CLU"},{"code":"include \"cowgol.coh\";\n\nsub radical(n: uint32): (rad: uint32, dpf: uint8) is\n dpf := 0;\n rad := 1;\n\n # Handle factors of 2 first\n if n & 1 == 0 then\n dpf := 1;\n rad := 2;\n while n > 0 and n & 1 == 0 loop\n n := n >> 1;\n end loop;\n end if;\n\n # Divide out odd prime factors\n var div: uint32 := 3;\n while div <= n loop\n if n % div == 0 then\n dpf := dpf + 1;\n rad := rad * div;\n while n % div == 0 loop\n n := n / div;\n end loop;\n end if;\n div := div + 2;\n end loop;\nend sub;\n\nsub first50() is\n print(\"Radicals of 1..50:\\n\");\n var n: uint32 := 1;\n var dpf: uint8;\n var rad: uint32;\n while n <= 50 loop\n (rad, dpf) := radical(n);\n print_i32(rad);\n if n % 5 != 0 then\n print_char('\\t');\n else\n print_nl();\n end if;\n n := n + 1;\n end loop;\nend sub;\n\nsub print_rad(n: uint32) is\n var dpf: uint8;\n var rad: uint32;\n print(\"The radical of \");\n print_i32(n);\n print(\" is \");\n (rad, dpf) := radical(n);\n print_i32(rad);\n print(\".\\n\");\nend sub;\n\nsub find_distribution() is\n var dist: uint32[8];\n MemZero(&dist[0] as [uint8], @bytesof dist);\n\n var n: uint32 := 1;\n var dpf: uint8;\n var rad: uint32;\n while n <= 1000000 loop\n print_i32(n);\n print_char('\\r');\n (rad, dpf) := radical(n);\n dist[dpf] := dist[dpf] + 1;\n n := n + 1;\n end loop;\n\n print(\"Distribution of radicals:\\n\");\n dpf := 0;\n while dpf < 8 loop\n print_i8(dpf);\n print(\": \");\n print_i32(dist[dpf]);\n print_nl();\n dpf := dpf + 1;\n end loop;\nend sub;\n\nfirst50();\nprint_nl();\nprint_rad(99999);\nprint_rad(499999);\nprint_rad(999999);\nprint_nl();\nfind_distribution();\n","language":"Cowgol"},{"code":"fastfunc radnf num .\n d = 2\n while d <= sqrt num\n if num mod d = 0\n nf += 1\n while num mod d = 0\n num /= d\n .\n .\n d += 1\n .\n if d <= num\n nf += 1\n .\n return nf\n.\nfunc rad num .\n r = 1\n d = 2\n while d <= sqrt num\n if num mod d = 0\n r *= d\n while num mod d = 0\n num /= d\n .\n .\n d += 1\n .\n if d <= num\n r *= num\n .\n return r\n.\nproc show50 . .\n write \"First 50 radicals:\"\n for n = 1 to 50\n write \" \" & rad n\n .\n print \"\"\n.\nproc show n . .\n print \"radical(\" & n & \") = \" & rad n\n.\nproc dist . .\n len dist[] 7\n for n = 2 to 1000000\n dist[radnf n] += 1\n .\n print \"\"\n print \"Distribution of radicals:\"\n print \"0: 1\"\n for i = 1 to 7\n print i & \": \" & dist[i]\n .\n.\nshow50\nprint \"\"\nshow 99999\nshow 499999\nshow 999999\nprint \"\"\ndist\n","language":"EasyLang"},{"code":"program Radical;\n{$IFDEF FPC} {$MODE DELPHI}{$Optimization ON,ALL} {$ENDIF}\n{$IFDEF WINDOWS}{$APPTYPE CONSOLE}{$ENDIF}\n//much faster would be\n//https://rosettacode.org/wiki/Factors_of_an_integer#using_Prime_decomposition\nconst\n LIMIT = 1000*1000;\n DeltaMod235 : array[0..7] of Uint32 = (4, 2, 4, 2, 4, 6, 2, 6);\n\ntype\n tRadical = record\n number,radical,PrFacCnt: Uint64;\n isPrime : boolean;\n end;\n function GetRadical(n: UInt32):tRadical;forward;\n\nfunction CommaUint(n : Uint64):AnsiString;\n//commatize only positive Integers\nvar\n fromIdx,toIdx :Int32;\n pRes : pChar;\nBegin\n str(n,result);\n fromIdx := length(result);\n toIdx := fromIdx-1;\n if toIdx < 3 then\n exit;\n\n toIdx := 4*(toIdx DIV 3)+toIdx MOD 3 +1 ;\n setlength(result,toIdx);\n pRes := @result[1];\n dec(pRes);\n repeat\n pRes[toIdx] := pRes[FromIdx];\n pRes[toIdx-1] := pRes[FromIdx-1];\n pRes[toIdx-2] := pRes[FromIdx-2];\n pRes[toIdx-3] := ',';\n dec(toIdx,4);\n dec(FromIdx,3);\n until FromIdx<=3;\n while fromIdx>=1 do\n Begin\n pRes[toIdx] := pRes[FromIdx];\n dec(toIdx);\n dec(fromIdx);\n end;\nend;\n\nprocedure OutRadical(n: Uint32);\nBegin\n writeln('Radical for ',CommaUint(n):8,':',CommaUint(GetRadical(n).radical):8);\nend;\n\nfunction GetRadical(n: UInt32):tRadical;\nvar\n q,divisor, rest: UInt32;\n nxt : Uint32;\nbegin\n with result do\n Begin\n number := n;\n radical := n;\n PrFacCnt := 1;\n isPrime := false;\n end;\n\n if n <= 1 then\n EXIT;\n\n if n in [2,3,5,7,11,13,17,19,23,29,31] then\n Begin\n with result do\n Begin\n isprime := true;\n PrFacCnt := 1;\n end;\n EXIT;\n end;\n\n with result do\n Begin\n radical := 1;\n PrFacCnt := 0;\n end;\n\n rest := n;\n if rest AND 1 = 0 then\n begin\n with result do begin radical := 2; PrFacCnt:= 1;end;\n repeat\n rest := rest shr 1;\n until rest AND 1 <> 0;\n end;\n\n if rest < 3 then\n EXIT;\n q := rest DIV 3;\n if rest-q*3= 0 then\n begin\n with result do begin radical *= 3; inc(PrFacCnt);end;\n repeat\n rest := q;\n q := rest DIV 3;\n until rest-q*3 <> 0;\n end;\n\n if rest < 5 then\n EXIT;\n q := rest DIV 5;\n if rest-q*5= 0 then\n begin\n with result do begin radical *= 5;inc(PrFacCnt);end;\n repeat\n rest := q;\n q := rest DIV 5;\n until rest-q*5 <> 0;\n end;\n\n divisor := 7;\n nxt := 0;\n repeat;\n if rest < sqr(divisor) then\n BREAK;\n q := rest DIV divisor;\n if rest-q*divisor= 0 then\n begin\n with result do begin radical *= divisor; inc(PrFacCnt);end;\n repeat\n rest := q;\n q := rest DIV divisor;\n until rest-q*divisor <> 0;\n end;\n divisor += DeltaMod235[nxt];\n nxt := (nxt+1) AND 7;\n until false;\n //prime ?\n if rest = n then\n with result do begin radical := n;PrFacCnt:=1;isPrime := true; end\n else\n if rest >1 then\n with result do begin radical *= rest;inc(PrFacCnt);end;\nend;\n\nvar\n Rad:tRadical;\n CntOfPrFac : array[0..9] of Uint32;\n j,sum,countOfPrimes,CountOfPrimePowers: integer;\n\nbegin\n writeln('The radicals for the first 50 positive integers are:');\n for j := 1 to 50 do\n Begin\n write (GetRadical(j).radical:4);\n if j mod 10 = 0 then\n Writeln;\n end;\n writeln;\n\n OutRadical( 99999);\n OutRadical(499999);\n OutRadical(999999);\n writeln;\n\n writeln('Breakdown of numbers of distinct prime factors');\n writeln('for positive integers from 1 to ',CommaUint(LIMIT));\n\n countOfPrimes:=0;\n CountOfPrimePowers :=0;\n For j := Low(CntOfPrFac) to High(CntOfPrFac) do\n CntOfPrFac[j] := 0;\n For j := 1 to LIMIT do\n Begin\n Rad := GetRadical(j);\n with rad do\n Begin\n IF isPrime then\n inc(countOfPrimes)\n else\n if (j>1)AND(PrFacCnt= 1) then\n inc(CountOfPrimePowers);\n end;\n inc(CntOfPrFac[Rad.PrFacCnt]);\n end;\n\n sum := 0;\n For j := Low(CntOfPrFac) to High(CntOfPrFac) do\n if CntOfPrFac[j] > 0 then\n Begin\n writeln(j:3,': ',CommaUint(CntOfPrFac[j]):10);\n inc(sum,CntOfPrFac[j]);\n end;\n writeln('sum: ',CommaUint(sum):10);\n writeln;\n sum := countOfPrimes+CountOfPrimePowers+1;\n writeln('For primes or powers (>1) there of <= ',CommaUint(LIMIT));\n Writeln(' Number of primes =',CommaUint(countOfPrimes):8);\n Writeln(' Number of prime powers =',CommaUint(CountOfPrimePowers):8);\n Writeln(' Add 1 for number = 1');\n Writeln(' sums to =',CommaUint(sum):8);\n {$IFDEF WINDOWS}readln;{$ENDIF}\nend.\n","language":"Free-Pascal-Lazarus"},{"code":"'#include \"isprime.bas\"\n\nFunction Radical(n As Integer) As Integer 'Return radical of n\n Dim As Integer d = 2, d0 = 0, p = 1\n While n >= d*d\n While n Mod d = 0\n If d <> d0 Then\n p *= d\n d0 = d\n End If\n n /= d\n Wend\n d += 1\n Wend\n If d <> d0 Then p *= n\n Return p\nEnd Function\n\nFunction DistinctFactors(n As Integer) As Integer 'Return count of distinct factors of n\n Dim As Integer d = 2, d0 = 0, c = 0\n While n >= d*d\n While n Mod d = 0\n If d <> d0 Then\n c += 1\n d0 = d\n End If\n n = n/d\n Wend\n d += 1\n Wend\n If d <> d0 And n <> 1 Then c += 1\n Return c\nEnd Function\n\nDim As Integer n, c, count(0 To 9), pcount, ppcount, p2, p\nPrint \"The radicals for the first 50 positive integers are:\"\nFor n = 1 To 50\n Print Using \"####\"; Radical(n);\n If n Mod 10 = 0 Then Print\nNext\nPrint Using !\"\\nRadical for ###,###: ###,###\"; 99999; Radical(99999)\nPrint Using \"Radical for ###,###: ###,###\"; 499999; Radical(499999)\nPrint Using \"Radical for ###,###: ###,###\"; 999999; Radical(999999)\n\nFor n = 0 To 9\n count(n) = 0\nNext\nFor n = 1 To 1e6\n c = DistinctFactors(n)\n count(c) += 1\nNext\nPrint !\"\\nBreakdown of numbers of distinct prime factors \\nfor positive integers from 1 to 1,000,000:\"\nc = 0\nFor n = 0 To 9\n If count(n) > 0 Then Print Using \" #: ###,###\"; n; count(n)\n c += count(n)\nNext\nPrint Using !\" ---------\\n #,###,###\"; c\n\nPrint !\"\\nor graphically:\\n\"; String(50, \"-\")\nFor n = 0 To 9\n If count(n) > 0 Then Print n; \" \"; String(count(n)/1e4, Chr(177)); \" \"; count(n)\n c += count(n)\nNext\nPrint String(50, \"-\")\n\n'Bonus (algorithm from Wren):\npcount = 0\nFor n = 1 To 1e6\n If isPrime(n) Then pcount += 1\nNext\nPrint !\"\\nFor primes or powers (>1) thereof <= 1,000,000:\"\nPrint Using \" Number of primes: ##,###\"; pcount\nppcount = 0\nFor p = 1 To Sqr(1e6)\n If isPrime(p) Then\n p2 = p\n Do\n p2 *= p\n If p2 > 1e6 Then Exit Do\n ppcount += 1\n Loop\n End If\nNext\nPrint Using \" Number of powers: ##,###\"; ppcount\nPrint Using \"Add 1 for number 1: ##,###\"; 1\nIf isPrime(n) Then pcount += 1\nPrint Spc(19); \"-------\"\nPrint Spc(13); Using !\"Total: ##,###\"; pcount + ppcount + 1\n\nSleep\n","language":"FreeBASIC"},{"code":" ~.&.q: 1+i.5 10 NB. radicals of first 50 positive integers\n 1 2 3 2 5 6 7 2 3 10\n11 6 13 14 15 2 17 6 19 10\n21 22 23 6 5 26 3 14 29 30\n31 2 33 34 35 6 37 38 39 10\n41 42 43 22 15 46 47 6 7 10\n ~.&.q: 99999 499999 999999 NB. radicals of these three...\n33333 3937 111111\n (~.,.#/.~) 1>.#@~.@q: 1+i.1e6 NB. distribution of number of prime factors of first million positive integers\n1 78735\n2 288726\n3 379720\n4 208034\n5 42492\n6 2285\n7 8\n p:inv 1e6 NB. number of primes not exceeding 1 million\n78498\n +/_1+<.(i.&.(p:inv) 1000)^.1e6 NB. count of prime powers (square or above) up to 1 million\n236\n 78498+236+1 NB. and we \"claimed\" that 1 had a prime factor\n78735\n","language":"J"},{"code":"import java.util.ArrayList;\nimport java.util.List;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\npublic final class RadicalOfAnInteger {\n\n\tpublic static void main(String[] aArgs) {\n\t\tsievePrimes();\n\t\tdistinctPrimeFactors();\n\t\t\n\t\tSystem.out.println(\"Radical of first 50 positive integers:\");\n\t\tfor ( int n = 1; n <= 50; n++ ) {\n\t\t\tSystem.out.print(String.format(\"%3d%s\", radical(n), ( n % 10 == 0 ? \"\\n\" : \"\" )));\n\t\t}\n\t\tSystem.out.println();\n\t\t\n\t\tfor ( int n : List.of( 99_999, 499_999, 999_999 ) ) {\n\t\t\tSystem.out.println(String.format(\"%s%7d%s%7d\", \"Radical for \", n, \":\", radical(n)));\n\t\t}\n\t\tSystem.out.println();\n\t\t\n\t\tSystem.out.print(\"Distribution of the first one million positive \");\n\t\tSystem.out.println(\"integers by numbers of distinct prime factors:\");\n\t\tList<Integer> counts = IntStream.rangeClosed(0, 7).boxed().map( i -> 0 ).collect(Collectors.toList());\n\t\tfor ( int n = 1; n <= LIMIT; n++ ) {\n\t\t\tcounts.set(distinctPrimeFactorCount(n), counts.get(distinctPrimeFactorCount(n)) + 1);\n\t\t}\t\t\n\t\tfor ( int n = 0; n < counts.size(); n++ ) {\n\t\t\tSystem.out.println(String.format(\"%d%s%7d\", n, \":\", counts.get(n)));\n\t\t}\n\t\tSystem.out.println();\n\t\t\n\t\tSystem.out.println(\"Number of primes and powers of primes less than or equal to one million:\");\n\t\tint count = 0;\n\t\tfinal double logOfLimit = Math.log(LIMIT);\n\t\tfor ( int p : primes ) {\n\t\t count += logOfLimit / Math.log(p);\n\t\t}\n\t\tSystem.out.println(count);\n\t}\n\t\n\tprivate static int radical(int aNumber) {\n\t\treturn distinctPrimeFactors.get(aNumber).stream().reduce(1, Math::multiplyExact);\n\t}\n\t\n\tprivate static int distinctPrimeFactorCount(int aNumber) {\n\t\treturn distinctPrimeFactors.get(aNumber).size();\n\t}\n\t\n\tprivate static void distinctPrimeFactors() {\n\t\tdistinctPrimeFactors = IntStream.rangeClosed(0, LIMIT).boxed()\n\t\t\t.map( i -> new ArrayList<Integer>() ).collect(Collectors.toList());\n\t\tfor ( int p : primes ) {\n\t\t for ( int n = p; n <= LIMIT; n += p ) {\n\t\t\t distinctPrimeFactors.get(n).add(p);\n\t\t }\n\t\t}\n\t}\n\t\n\tprivate static void sievePrimes() {\n\t\tList<Boolean> markedPrime = IntStream.rangeClosed(0, LIMIT).boxed()\n\t\t\t.map( i -> true ).collect(Collectors.toList());\n for ( int p = 2; p * p <= LIMIT; p++ ) {\n if ( markedPrime.get(p) ) {\n for ( int i = p * p; i <= LIMIT; i += p ) {\n markedPrime.set(i, false);\n }\n }\n }\n\n primes = new ArrayList<Integer>();\n for ( int p = 2; p <= LIMIT; p++ ) {\n if ( markedPrime.get(p) ) {\n primes.add(p);\n }\n }\n }\n\n\tprivate static List<Integer> primes;\n\tprivate static List<List<Integer>> distinctPrimeFactors;\n\t\n\tprivate static final int LIMIT = 1_000_000;\n\n}\n","language":"Java"},{"code":"# Utility functions\ndef lpad($len): tostring | ($len - length) as $l | (\" \" * $l) + .;\n\ndef prod(s): reduce s as $x (1; . * $x);\n\ndef sum(s): reduce s as $x (0; . + $x);\n\ndef uniq(s):\n foreach s as $x (null;\n if . and $x == .[0] then .[1] = false\n else [$x, true]\n end;\n if .[1] then .[0] else empty end);\n\n\n# Prime number functions\n\n# Returns the prime factors of . in order using a wheel with basis [2, 3, 5].\ndef primeFactors:\n def out($i): until (.n % $i != 0; .factors += [$i] | .n = ((.n/$i)|floor) );\n if . < 2 then []\n else [4, 2, 4, 2, 4, 6, 2, 6] as $inc\n | { n: .,\n factors: [] }\n | out(2)\n | out(3)\n | out(5)\n | .k = 7\n | .i = 0\n | until(.k * .k > .n;\n if .n % .k == 0\n then .factors += [.k]\n | .n = ((.n/.k)|floor)\n else .k += $inc[.i]\n | .i = ((.i + 1) % 8)\n end)\n | if .n > 1 then .factors += [.n] else . end\n\n | .factors\n end;\n\n# Input: a positive integer\n# Output: an array, $a, of length .+1 such that\n# $a[$i] is $i if $i is prime, and false otherwise.\ndef primeSieve:\n # erase(i) sets .[i*j] to false for integral j > 1\n def erase($i):\n if .[$i] then\n reduce (range(2*$i; length; $i)) as $j (.; .[$j] = false)\n else .\n end;\n (. + 1) as $n\n | (($n|sqrt) / 2) as $s\n | [null, null, range(2; $n)]\n | reduce (2, 1 + (2 * range(1; $s))) as $i (.; erase($i)) ;\n\n# Number of primes up to and including .\ndef primeCount:\n sum(primeSieve[] | select(.) | 1);\n\n\n## Radicals\n\ndef task1:\n{ radicals: [0],\n counts: [range(0;8)|0] }\n| .radicals[1] = 1\n| .counts[1] = 1\n| foreach range(2; 1+1e6) as $i (.;\n .factors = [uniq($i|primeFactors[])]\n | (.factors|length) as $fc\n | .counts[$fc] += 1\n | if $i <= 50 then .radicals[$i] = prod(.factors[]) else . end ;\n\n if $i == 50\n then \"The radicals for the first 50 positive integers are:\",\n (.radicals[1:] | _nwise(10) | map(lpad(4)) | join(\" \")),\n\t \"\"\n\n elif $i | IN( 99999, 499999, 999999)\n then \"Radical for \\($i|lpad(8)): \\(prod(.factors[])|lpad(8))\"\n elif $i == 1e6\n then \"\\nBreakdown of numbers of distinct prime factors\",\n \"for positive integers from 1 to 1,000,000:\",\n (range(1; 8) as $i\n | \" \\($i): \\(.counts[$i]|lpad(8))\"),\n \" ---------\",\n \" \\(sum(.counts[]))\"\n else empty\n end);\n\ndef task2:\n def pad: lpad(6);\n\n (1000|primeSieve|map(select(.))) as $primes1k\n | { pcount: (1e6|primeCount),\n ppcount: 0 }\n | reduce $primes1k[] as $p (.;\n .p2 = $p\n | .done = false\n | until(.done;\n .p2 *= $p\n | if .p2 > 1e6 then .done = true\n\t else .ppcount += 1\n\t end ) )\n | \"\\nFor primes or powers (>1) thereof <= 1,000,000:\",\n \" Number of primes = \\(.pcount|pad)\",\n \" Number of powers = \\(.ppcount|pad)\",\n \" Add 1 for number 1 = \\(1|pad)\",\n \" ------\",\n \" \\( (.pcount + .ppcount + 1)|pad)\" ;\n\ntask1, task2\n","language":"Jq"},{"code":"using Formatting, Primes, UnicodePlots\n\nradical(n) = prod(map(first, factor(n).pe))\nradicallength(n) = length(factor(n).pe)\n\nprintln(\"The radicals for the first 50 positive integers are:\")\nforeach(p -> print(rpad(p[2], 4), p[1] % 10 == 0 ? \"\\n\" : \"\"), enumerate(map(radical, 1:50)))\n\nfor i in [99999, 499999, 999999]\n println(\"\\nRadical for \", format(i, commas=true), \": \", format(radical(i), commas=true))\nend\n\nprintln(\"\\nBreakdown of numbers of distinct prime factors for positive integers from 1 to 1,000,000:\")\nhistogram(map(radicallength, 1:1_000_000), nbins = 8)\n\nprintln(\"\\nCheck on breakdown:\")\nprimecount = length(primes(1_000_000)) # count of primes to 1 million\npowerscount = mapreduce(p -> Int(floor(6 / log10(p)) - 1), +, primes(1000))\nprintln(\"Prime count to 1 million: \", lpad(primecount, 6))\nprintln(\"Prime powers less than 1 million: \", lpad(powerscount, 6))\nprintln(\"Subtotal:\", lpad(primecount + powerscount, 32))\nprintln(\"The integer 1 has 0 prime factors: \", lpad(1, 6))\nprintln(\"-\"^41, \"\\n\", \"Overall total:\", lpad(primecount + powerscount + 1, 27))\n","language":"Julia"},{"code":"do -- find the radicals of some integers - the radical of n is the product\n -- of the distinct prime factors of n, the radical of 1 is 1\n\n local maxNumber = 1000000; -- maximum number we will consider\n local upfc, radical = {}, {} -- unique prime factor counts and radicals\n for i = 1, maxNumber do\n upfc[ i ] = 0\n radical[ i ] = 1\n end\n for i = 2, maxNumber do\n if upfc[ i ] == 0 then\n radical[ i ] = i\n upfc[ i ] = 1\n for j = i + i, maxNumber, i do\n upfc[ j ] = upfc[ j ] + 1\n radical[ j ] = radical[ j ] * i\n end\n end\n end\n -- show the radicals of the first 50 positive integers\n io.write( \"Radicals of 1 to 50:\\n\" )\n for i = 1, 50 do\n io.write( string.format( \"%5d\", radical[ i ] ), ( i % 10 == 0 and \"\\n\" or \"\" ) )\n end\n -- radicals of some specific numbers\n io.write( \"\\n\" )\n io.write( \"Radical of 99999: \", radical[ 99999 ], \"\\n\" )\n io.write( \"Radical of 499999: \", radical[ 499999 ], \"\\n\" )\n io.write( \"Radical of 999999: \", radical[ 999999 ], \"\\n\" )\n io.write( \"\\n\" )\n -- show the distribution of the unique prime factor counts\n local dpfc = {}\n for i = 1, maxNumber do\n local count = dpfc[ upfc[ i ] ]\n dpfc[ upfc[ i ] ] = ( count == nil and 1 or count + 1 )\n end\n io.write( \"Distribution of radicals:\\n\" )\n for i = 0, #dpfc do\n io.write( string.format( \"%2d\", i ), \": \", dpfc[ i ], \"\\n\" )\n end\nend\n","language":"Lua"},{"code":" NORMAL MODE IS INTEGER\n\n INTERNAL FUNCTION(A,B)\n ENTRY TO REM.\n FUNCTION RETURN A-A/B*B\n END OF FUNCTION\n\n INTERNAL FUNCTION(NN)\n ENTRY TO RADIC.\n KN = NN\n DPF = 0\n RAD = 1\n WHENEVER KN.E.0, FUNCTION RETURN 0\n WHENEVER REM.(KN,2).E.0\n DPF = 1\n RAD = 2\n THROUGH DIV2, FOR KN=KN, 0, REM.(KN,2).NE.0\nDIV2 KN = KN / 2\n END OF CONDITIONAL\n THROUGH ODD, FOR FAC=3, 2, FAC.G.KN\n WHENEVER REM.(KN,FAC).E.0\n DPF = DPF + 1\n RAD = RAD * FAC\n THROUGH DIVP, FOR KN=KN, 0, REM.(KN,FAC).NE.0\nDIVP KN = KN / FAC\n END OF CONDITIONAL\nODD CONTINUE\n FUNCTION RETURN RAD\n END OF FUNCTION\n\n R PRINT RADICALS FOR 1..50\n VECTOR VALUES RADLIN = $10(I5)*$\n PRINT COMMENT $ RADICALS OF 1 TO 50$\n THROUGH RADL, FOR L=0, 10, L.GE.50\nRADL PRINT FORMAT RADLIN,\n 0 RADIC.(L+1),RADIC.(L+2),RADIC.(L+3),RADIC.(L+4),\n 1 RADIC.(L+5),RADIC.(L+6),RADIC.(L+7),RADIC.(L+8),\n 2 RADIC.(L+9),RADIC.(L+10)\n\n R PRINT RADICALS OF TASK NUMBERS\n PRINT COMMENT $ $\n VECTOR VALUES RADNUM = $14HTHE RADICAL OF,I7,S1,2HIS,I7*$\n THROUGH RADN, FOR VALUES OF N = 99999, 499999, 999999\nRADN PRINT FORMAT RADNUM,N,RADIC.(N)\n\n R FIND DISTRIBUTION\n PRINT COMMENT $ $\n DIMENSION DIST(8)\n THROUGH ZERO, FOR D = 0, 1, D.G.7\nZERO DIST(D) = 0\n\n THROUGH CNTDST, FOR N = 1, 1, N.G.1000000\n RADIC.(N)\nCNTDST DIST(DPF) = DIST(DPF) + 1\n\n PRINT COMMENT $ DISTRIBUTION OF RADICALS$\n VECTOR VALUES DISTLN = $I1,2H: ,I8*$\n THROUGH SHWDST, FOR D = 0, 1, D.G.7\nSHWDST PRINT FORMAT DISTLN,D,DIST(D)\n\n END OF PROGRAM\n","language":"MAD"},{"code":"import std/[math, strformat, strutils]\n\nconst N = 1_000_000\n\n### Build list of primes.\n\nfunc isPrime(n: Natural): bool =\n ## Return true if \"n\" is prime.\n ## \"n\" should not be a mutiple of 2 or 3.\n var k = 5\n var delta = 2\n while k * k <= n:\n if n mod k == 0: return false\n inc k, delta\n delta = 6 - delta\n result = true\n\nvar primes = @[2, 3]\nvar n = 5\nvar step = 2\nwhile n <= N:\n if n.isPrime:\n primes.add n\n inc n, step\n step = 6 - step\n\n\n### Build list of distinct prime factors to\n### compute radical and distinct factor count.\n\nvar primeFactors: array[1..N, seq[int]]\nfor p in primes:\n for n in countup(p, N, p):\n primeFactors[n].add p\n\ntemplate radical(n: int): int = prod(primeFactors[n])\n\ntemplate factorCount(n: int): int = primeFactors[n].len\n\n\n### Task ###\n\necho \"Radical of first 50 positive integers:\"\nfor n in 1..50:\n stdout.write &\"{radical(n):2}\"\n stdout.write if n mod 10 == 0: '\\n' else: ' '\necho()\n\nfor n in [99_999, 499_999, 999_999]:\n echo &\"Radical for {insertSep($n):>7}: {insertSep($radical(n)):>7}\"\necho()\n\necho \"Distribution of the first one million positive\"\necho \"integers by numbers of distinct prime factors:\"\nvar counts: array[0..7, int]\nfor n in 1..1_000_000:\n inc counts[factorCount(n)]\nfor n, count in counts:\n echo &\"{n}: {insertSep($count):>7}\"\necho()\n\n\n### Bonus ###\n\necho \"Number of primes and powers of primes\"\necho \"less than or equal to one million:\"\nvar count = 0\nconst LogN = ln(N.toFloat)\nfor p in primes:\n inc count, int(LogN / ln(p.toFloat))\necho insertSep($count)\n","language":"Nim"},{"code":"use strict;\nuse warnings;\nuse feature <say signatures>;\nno warnings 'experimental::signatures';\n\nuse List::Util 'uniq';\nuse ntheory <primes vecprod factor>;\n\nsub comma { reverse ((reverse shift) =~ s/.{3}\\K/,/gr) =~ s/^,//r }\nsub table (@V) { ( sprintf( ('%3d')x@V, @V) ) =~ s/.{1,30}\\K/\\n/gr }\n\nsub radical ($n) { vecprod uniq factor $n }\n\nmy $limit = 1e6;\n\nmy $primes = primes(1,$limit);\n\nmy %rad;\n$rad{1} = 1;\n$rad{ uniq factor $_ }++ for 2..$limit;\n\nmy $powers;\nmy $upto = int sqrt $limit;\nfor my $p ( grep { $_< $upto} @$primes ) {\n for (2..$upto) { ($p ** $_) < $limit ? ++$powers : last }\n}\n\nsay 'First fifty radicals:';\nsay table map { radical $_ } 1..50;\nprintf \"Radical for %7s => %7s\\n\", comma($_), comma radical($_) for 99999, 499999, 999999;\nprintf \"\\nRadical factor count breakdown, 1 through %s:\\n\", comma $limit;\nsay \"$_ => \" . comma $rad{$_} for sort keys %rad;\nsay <<~\"END\";\n\n Up to @{[comma $limit]}:\n Primes: @{[comma 0+@$primes]}\n Powers: $powers\n Plus 1: 1\n Total: @{[comma 1 + $powers + @$primes]}\n END\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">radicals</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">reinstate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">50</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">counts</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">reinstate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">1e6</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">f</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">vslice</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">prime_powers</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">counts</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">)]</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">50</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">radicals</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">product</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">50</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"The radicals for the first 50 positive integers are:\\n%s\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">join_by</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">radicals</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">fmt</span><span style=\"color: #0000FF;\">:=</span><span style=\"color: #008000;\">\"%3d\"</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">99999</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">499999</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">999999</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Radical for %,7d: %,7d\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">product</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1e6</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\nBreakdown of numbers of distinct prime factors\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"for positive integers from 1 to 1,000,000:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">7</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" %d: %,8d\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">counts</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" ---------\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" %,8d\\n\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">counts</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">pcount</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">get_primes_le</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1e6</span><span style=\"color: #0000FF;\">)),</span>\n <span style=\"color: #000000;\">ppcount</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">p</span> <span style=\"color: #008080;\">in</span> <span style=\"color: #7060A8;\">get_primes_le</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1000</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">p2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">p</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">p2</span> <span style=\"color: #0000FF;\">*=</span> <span style=\"color: #000000;\">p</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">1e6</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">ppcount</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"For primes or powers (>1) thereof <= 1,000,000:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" Number of primes = %,6d\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pcount</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" Number of powers = %,6d\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ppcount</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" Add 1 for number 1 = %,6d\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" ------\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" %,6d\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pcount</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">ppcount</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"# int_radicals.py by Xing216\n\ndef radical(n):\n product = 1\n if (n % 2 == 0):\n product *= 2\n while (n%2 == 0):\n n = n/2\n for i in range (3, int((n)**0.5), 2):\n if (n % i == 0):\n product = product * i\n while (n%i == 0):\n n = n/i\n if (n > 2):\n product = product * n\n return int(product)\ndef distinctPrimeFactors(N):\n factors = []\n if (N < 2):\n factors.append(-1)\n return factors\n if N == 2:\n factors.append(2)\n return factors\n visited = {}\n i = 2\n while(i * i <= N):\n while(N % i == 0):\n if(i not in visited):\n factors.append(i)\n visited[i] = 1\n N //= i\n i+=1\n if(N > 2):\n factors.append(N)\n return factors\nif __name__ == \"__main__\":\n print(\"Radical of first 50 positive integers:\")\n for i in range(1,51):\n print(f\"{radical(i):>2}\", end=\" \")\n if (i % 10 == 0):\n print()\n print()\n for n in [99999, 499999, 999999]:\n print(f\"Radical of {n:>6}: {radical(n)}\")\n distDict = {1:0,2:0,3:0,4:0,5:0,6:0,7:0}\n for i in range(1,1000000):\n distinctPrimeFactorCount = len(distinctPrimeFactors(i))\n distDict[distinctPrimeFactorCount] += 1\n print(\"\\nDistribution of the first one million positive integers by numbers of distinct prime factors:\")\n for key, value in distDict.items():\n print(f\"{key}: {value:>6}\")\n print(\"\\nNumber of primes and powers of primes less than or equal to one million:\")\n print(distDict[1])\n","language":"Python"},{"code":"use Prime::Factor;\nuse List::Divvy;\nuse Lingua::EN::Numbers;\n\nsub radical ($_) { [×] unique .&prime-factors }\n\nsay \"First fifty radicals:\\n\" ~\n (1..50).map({.&radical}).batch(10)».fmt(\"%2d\").join: \"\\n\";\nsay '';\n\nprintf \"Radical for %7s => %7s\\n\", .&comma, comma .&radical\n for 99999, 499999, 999999;\n\nmy %rad = 1 => 1;\nmy $limit = 1e6.Int;\n\n%rad.push: $_ for (2..$limit).race(:1000batch).map: {(unique .&prime-factors).elems => $_};\n\nsay \"\\nRadical factor count breakdown, 1 through {comma $limit}:\";\nsay .key ~ \" => {comma +.value}\" for sort %rad;\n\nmy @primes = (2..$limit).grep: &is-prime;\n\nmy int $powers;\n@primes.&upto($limit.sqrt.floor).map: -> $p {\n for (2..*) { ($p ** $_) < $limit ?? ++$powers !! last }\n}\n\nsay qq:to/RADICAL/;\n\n Up to {comma $limit}:\n Primes: {comma +@primes}\n Powers: $powers\n Plus 1: 1\n Total: {comma 1 + $powers + @primes}\n RADICAL\n","language":"Raku"},{"code":"/* REXX */\ncall setp\nNumeric Digits 100\n/* 1. Radicals from 1 to 50 */\nSay 'Radicals of 1..50:'\nol=''\nDo n=1 To 50\n ol=ol||right(rad(n),5)\n If n//10=0 then Do\n Say ol\n ol=''\n End\n End\n\nSay ''\nCall radt 99999\nCall radt 499999\nCall radt 999999\n\nSay ''\nSay 'Distribution of radicals:'\nCall time 'R'\ncnt.=0\nDo v=1 To 1000000\n If v//100000=1 Then Do\n ti=v%100000\n etime.ti=format(time('E'),4,1)\n End\n p=rad(v,'cnt')\n cnt.p+=1\n /**************************************\n If p=7 Then\n Say v':' rad(v,'lstx') '=' rad(v)\n **************************************/\n End\netime.10=format(time('E'),4,1)\nDo d=0 To 20\n If cnt.d>0 Then\n Say d':' right(cnt.d,8)\n End\nSay ''\nSay 'Timings:'\nDo ti=1 To 10\n Say right(ti,2) etime.ti 'seconds'\n End\nExit\n\nradt:\n Parse Arg u\n Say 'The radical of' u 'is' rad(u)'.'\n Return\n\nrad:\n Parse Arg z,what\n zz=z\n plist=''\n exp.=0\n Do Until p*p>z\n Do pi=1 By 1 Until p*p>z\n p=word(primzahlen,pi)\n exp.p=0\n Do while z//p=0\n exp.p+=1\n If pos(p,plist)=0 Then\n plist=plist p\n z=z%p\n End\n End\n End\n exp.z+=1\n If pos(z,plist)=0 &z<>1 Then\n plist=plist z\n Select\n When what='lst' Then\n Return plist\n When what='lstx' Then Do\n s=''\n Do While plist<>''\n Parse Var plist p plist\n if exp.p=1 Then\n s=s'*'p\n Else\n s=s'*'p'**'exp.p\n End\n Return strip(s,,'*')\n End\n When what='cnt' Then\n Return words(plist)\n Otherwise Do\n rad=1\n Do while plist>''\n Parse Var plist p plist\n rad=rad*p\n End\n Return rad\n End\n End\n\nsetp:\nprimzahlen=,\n2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101,\n103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197,\n199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311,\n313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431,\n433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557,\n563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659 661,\n673 677 683 691 701 709 719 727 733 739 743 751 757 761 769 773 787 797 809,\n811 821 823 827 829 839 853 857 859 863 877 881 883 887 907 911 919 929 937,\n941 947 953 967 971 977 983 991 997 1009 1013 1019 1021 1031 1033 1039 1049\nReturn\n","language":"REXX"},{"code":"module Radical\n refine Integer do\n require 'prime'\n\n def radical = self == 1 ? 1 : prime_division.map(&:first).inject(&:*)\n def num_uniq_prime_factors = prime_division.size\n def prime_pow? = prime_division.size == 1\n\n end\nend\n\nusing Radical\n\nn = 50 # task 1\nputs \"The radicals for the first #{n} positive integers are:\"\n(1..n).map(&:radical).each_slice(10){|s| puts \"%4d\"*s.size % s}\nputs # task 2\n[99999, 499999 , 999999].each{|n| puts \"Radical for %6d: %6d\" % [n, n.radical]}\nn = 1_000_000 # task 3 & bonus\nputs \"\\nNumbers of distinct prime factors for integers from 1 to #{n}\"\n(1..n).map(&:num_uniq_prime_factors).tally.each{|kv| puts \"%d: %8d\" % kv }\nputs \"\\nNumber of primes and powers of primes less than or equal to #{n}: #{(1..n).count(&:prime_pow?)}\"\n","language":"Ruby"},{"code":"with (50) {|n|\n say \"Radicals of the first #{n} positive integers:\"\n 1..n -> map { .rad }.each_slice(10, {|*s|\n say s.map { '%2s' % _ }.join(' ')\n })\n}\n\nsay ''; [99999, 499999, 999999].map {|n|\n say \"rad(#{n}) = #{rad(n)}\"\n}\n\nfor limit in (1e6, 1e7, 1e8, 1e9) {\n say \"\\nCounting of k-omega primes <= #{limit.commify}:\"\n for k in (1..Inf) {\n break if (pn_primorial(k) > limit)\n var c = k.omega_prime_count(limit)\n say \"#{k}: #{c}\"\n assert_eq(c, limit.prime_power_count) if (k == 1)\n }\n}\n","language":"Sidef"},{"code":"import \"./math\" for Int, Nums\nimport \"./seq\" for Lst\nimport \"./fmt\" for Fmt\n\nvar radicals = List.filled(51, 0)\nradicals[1] = 1\nvar counts = List.filled(8, 0)\ncounts[1] = 1\nfor (i in 2..1e6) {\n var factors = Lst.prune(Int.primeFactors(i))\n var fc = factors.count\n counts[fc] = counts[fc] + 1\n if (i <= 50) radicals[i] = Nums.prod(factors)\n if (i == 50) {\n System.print(\"The radicals for the first 50 positive integers are:\")\n Fmt.tprint(\"$2d \", radicals.skip(1), 10)\n System.print()\n } else if (i == 99999 || i == 499999 || i == 999999) {\n Fmt.print(\"Radical for $,7d: $,7d\", i, Nums.prod(factors))\n } else if (i == 1e6) {\n System.print(\"\\nBreakdown of numbers of distinct prime factors\")\n System.print(\"for positive integers from 1 to 1,000,000:\")\n for (i in 1..7) {\n Fmt.print(\" $d: $,8d\", i, counts[i])\n }\n Fmt.print(\" ---------\")\n Fmt.print(\" $,8d\", Nums.sum(counts))\n Fmt.print(\"\\nor graphically:\")\n Nums.barChart(\"\", 50, Nums.toStrings(1..7), counts[1..-1])\n }\n}\nvar pcount = Int.primeCount(1e6)\nvar ppcount = 0\nvar primes1k = Int.primeSieve(1000)\nfor (p in primes1k) {\n var p2 = p\n while (true) {\n p2 = p2 * p\n if (p2 > 1e6) break\n ppcount = ppcount + 1\n }\n}\nFmt.print(\"\\nFor primes or powers (>1) thereof <= 1,000,000:\")\nFmt.print(\" Number of primes = $,6d\", pcount)\nFmt.print(\" Number of powers = $,6d\", ppcount)\nFmt.print(\" Add 1 for number 1 = $,6d\", 1)\nFmt.print(\" ------\")\nFmt.print(\" $,6d\", pcount + ppcount + 1)\n","language":"Wren"},{"code":"include xpllib; \\for Print and IsPrime\n\nproc Radical(N); \\Return radical of N\nint N, D, D0, P;\n[D:= 2; D0:= 0; P:= 1;\nwhile N >= D*D do\n [while rem(N/D) = 0 do\n [if D # D0 then\n [P:= P*D;\n D0:= D;\n ];\n N:= N/D;\n ];\n D:= D+1;\n ];\nif D # D0 then P:= P*N;\nreturn P;\n];\n\nfunc DistinctFactors(N); \\Return count of distinct factors of N\nint N, D, D0, C;\n[D:= 2; D0:= 0; C:= 0;\nwhile N >= D*D do\n [while rem(N/D) = 0 do\n [if D # D0 then\n [C:= C+1;\n D0:= D;\n ];\n N:= N/D;\n ];\n D:= D+1;\n ];\nif D # D0 and N # 1 then C:= C+1;\nreturn C;\n];\n\nint N, C, A(10), PC, PPC, P2, P;\n[Print(\"The radicals for the first 50 positive integers are:\\n\");\nfor N:= 1 to 50 do\n [Print(\"%4d\", Radical(N));\n if rem(N/10) = 0 then CrLf(0);\n ];\nPrint(\"\\n\");\nPrint(\"Radical for %6,d: %6,d\\n\", 99_999, Radical( 99_999));\nPrint(\"Radical for %6,d: %6,d\\n\", 499_999, Radical(499_999));\nPrint(\"Radical for %6,d: %6,d\\n\", 999_999, Radical(999_999));\n\nfor N:= 0 to 9 do A(N):= 0;\nfor N:= 1 to 1_000_000 do\n [C:= DistinctFactors(N);\n A(C):= A(C)+1;\n ];\nPrint(\"\\nBreakdown of numbers of distinct prime factors\nfor positive integers from 1 to 1,000,000:\\n\");\nC:= 0;\nfor N:= 0 to 9 do\n [if A(N) > 0 then\n Print(\" %d: %6,d\\n\", N, A(N));\n C:= C + A(N);\n ];\nPrint(\" ---------\\n %,d\\n\", C);\n\n\\Bonus (algorithm from Wren):\nPC:= 0;\nfor N:= 1 to 1_000_000 do\n if IsPrime(N) then PC:= PC+1;\nPrint(\"\\nNumber of primes: %5,d\\n\", PC);\nPPC:= 0;\nfor P:= 1 to sqrt(1_000_000) do\n [if IsPrime(P) then\n [P2:= P;\n loop [P2:= P2 * P;\n if P2 > 1_000_000 then quit;\n PPC:= PPC+1;\n ];\n ];\n ];\nPrint(\"Number of powers: %5,d\\n\", PPC);\n if IsPrime(N) then PC:= PC+1;\nPrint(\"Total : %5,d\\n\", PC+PPC);\n]\n","language":"XPL0"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Radical_of_an_integer\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Definition\\nThe '''radical''' of a positive integer is defined as the product of its distinct prime factors.\\n\\nAlthough the integer 1 has no prime factors, its radical is regarded as 1 by convention. \\n\\n;Example\\nThe radical of 504 = 2³ x 3² x 7 is: 2 x 3 x 7 = 42.\\n\\n;Task\\n1. Find and show on this page the radicals of the first '''50''' positive integers.\\n\\n2. Find and show the radicals of the integers: '''99999, 499999''' and '''999999'''.\\n\\n3. By considering their radicals, show the distribution of the first '''one million''' positive integers by numbers of distinct prime factors (hint: the maximum number of distinct factors is 7). \\n\\n;Bonus\\n\\nBy (preferably) using an independent method, calculate the number of primes and the number of powers of primes less than or equal to '''one million''' and hence check that your answer in 3. above for numbers with one distinct prime is correct.\\n\\n;Related tasks\\n* [[Square-free integers]]\\n* [[Almost prime]]\\n\\n;References\\n* Wikipedia article [[wp:Radical_of_an_integer|Radical of an integer]] \\n* OEIS sequence [[oeis:A007947|A007947: Largest square free number dividing n]] \\n<br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"BEGIN # find the radicals of some integers - the radical of n is the product #\\n # of thr the distinct prime factors of n, the radical of 1 is 1 #\\n\\n INT max number = 1 000 000; # maximum number we will consider #\\n [ 1 : max number ]INT upfc; # unique prime factor counts #\\n [ 1 : max number ]INT radical; # table of radicals #\\n FOR i TO UPB upfc DO upfc[ i ] := 0; radical[ i ] := 1 OD;\\n FOR i FROM 2 TO UPB upfc DO\\n IF upfc[ i ] = 0 THEN\\n radical[ i ] := i;\\n upfc[ i ] := 1;\\n FOR j FROM i + i BY i TO UPB upfc DO\\n upfc[ j ] +:= 1;\\n radical[ j ] *:= i\\n OD\\n FI\\n OD;\\n # show the radicals of the first 50 positive integers #\\n print( ( \\\"Radicals of 1 to 50:\\\", newline ) );\\n FOR i TO 50 DO\\n print( ( whole( radical[ i ], -5 ) ) );\\n IF i MOD 10 = 0 THEN print( ( newline ) ) FI\\n OD;\\n # radicals of some specific numbers #\\n print( ( newline ) );\\n print( ( \\\"Radical of 99999: \\\", whole( radical[ 99999 ], 0 ), newline ) );\\n print( ( \\\"Radical of 499999: \\\", whole( radical[ 499999 ], 0 ), newline ) );\\n print( ( \\\"Radical of 999999: \\\", whole( radical[ 999999 ], 0 ), newline ) );\\n print( ( newline ) );\\n # find the maximum number of unique prime factors #\\n INT max upfc := 0;\\n # show the distribution of the unique prime factor counts #\\n FOR i TO UPB upfc DO IF upfc[ i ] > max upfc THEN max upfc := upfc[ i ] FI OD;\\n [ 0 : max upfc ]INT dpfc; FOR i FROM LWB dpfc TO UPB dpfc DO dpfc[ i ] := 0 OD;\\n FOR i TO UPB upfc DO\\n dpfc[ upfc[ i ] ] +:= 1\\n OD;\\n print( ( \\\"Distribution of radicals:\\\", newline ) );\\n FOR i FROM LWB dpfc TO UPB dpfc DO\\n print( ( whole( i, -2 ), \\\": \\\", whole( dpfc[ i ], 0 ), newline ) )\\n OD\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nint radical(int num, int *dps_out) {\\n int rad = 1, dps = 0, div;\\n\\n if ((num & 1) == 0) {\\n while ((num & 1) == 0) num >>= 1;\\n rad *= 2;\\n dps++;\\n }\\n\\n for (div = 3; div <= num; div += 2) {\\n if (num % div != 0) continue;\\n rad *= div;\\n dps++;\\n while (num % div == 0) num /= div;\\n }\\n\\n if (dps_out != NULL) *dps_out = dps;\\n return rad;\\n}\\n\\n\\nvoid show_first_50() {\\n int n;\\n printf(\\\"Radicals of 1..50:\\\\n\\\");\\n for (n = 1; n <= 50; n++) {\\n printf(\\\"%5d\\\", radical(n, NULL));\\n if (n % 5 == 0) printf(\\\"\\\\n\\\");\\n }\\n}\\n\\nvoid show_rad(int n) {\\n printf(\\\"The radical of %d is %d.\\\\n\\\", n, radical(n, NULL));\\n}\\n\\nvoid find_distribution() {\\n int n, dps, dist[8] = {0};\\n\\n for (n = 1; n <= 1000000; n++) {\\n printf(\\\"%d\\\\r\\\", n);\\n radical(n, &dps);\\n dist[dps]++;\\n }\\n\\n printf(\\\"Distribution of radicals:\\\\n\\\");\\n for (dps = 0; dps < 8; dps++) {\\n printf(\\\"%d: %d\\\\n\\\", dps, dist[dps]);\\n }\\n}\\n\\nint main() {\\n show_first_50();\\n printf(\\\"\\\\n\\\");\\n show_rad(99999);\\n show_rad(499999);\\n show_rad(999999);\\n printf(\\\"\\\\n\\\");\\n find_distribution();\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iomanip>\\n#include <iostream>\\n#include <map>\\n#include <vector>\\n\\nint radical(int n, int& count) {\\n if (n == 1) {\\n count = 1;\\n return 1;\\n }\\n int product = 1;\\n count = 0;\\n if ((n & 1) == 0) {\\n product *= 2;\\n ++count;\\n while ((n & 1) == 0)\\n n >>= 1;\\n }\\n for (int p = 3, sq = 9; sq <= n; p += 2) {\\n if (n % p == 0) {\\n product *= p;\\n ++count;\\n while (n % p == 0)\\n n /= p;\\n }\\n sq += (p + 1) << 2;\\n }\\n if (n > 1) {\\n product *= n;\\n ++count;\\n }\\n return product;\\n}\\n\\nstd::vector<bool> prime_sieve(int limit) {\\n std::vector<bool> sieve(limit, true);\\n if (limit > 0)\\n sieve[0] = false;\\n if (limit > 1)\\n sieve[1] = false;\\n for (int i = 4; i < limit; i += 2)\\n sieve[i] = false;\\n for (int p = 3, sq = 9; sq < limit; p += 2) {\\n if (sieve[p]) {\\n for (int q = sq; q < limit; q += p << 1)\\n sieve[q] = false;\\n }\\n sq += (p + 1) << 2;\\n }\\n return sieve;\\n}\\n\\nint main() {\\n std::cout.imbue(std::locale(\\\"\\\"));\\n std::cout << \\\"Radicals of the first 50 positive integers:\\\\n\\\";\\n int count = 0;\\n for (int i = 1; i <= 50; ++i) {\\n std::cout << std::setw(2) << radical(i, count)\\n << (i % 10 == 0 ? '\\\\n' : ' ');\\n }\\n std::cout << '\\\\n';\\n for (int i : {99999, 499999, 999999}) {\\n std::cout << \\\"Radical of \\\" << std::setw(7) << i << \\\" is \\\"\\n << std::setw(7) << radical(i, count) << \\\".\\\\n\\\";\\n }\\n std::map<int, int> prime_factors;\\n const int limit = 1000000;\\n for (int i = 1; i <= limit; ++i) {\\n radical(i, count);\\n ++prime_factors[count];\\n }\\n std::cout << \\\"\\\\nRadical factor count breakdown up to \\\" << limit << \\\":\\\\n\\\";\\n for (const auto& [count, total] : prime_factors) {\\n std::cout << count << \\\": \\\" << std::setw(7) << total << '\\\\n';\\n }\\n auto sieve = prime_sieve(limit + 1);\\n int primes = 0, prime_powers = 0;\\n for (int i = 1; i <= limit; ++i) {\\n if (sieve[i]) {\\n ++primes;\\n int n = limit;\\n while (i <= n / i) {\\n ++prime_powers;\\n n /= i;\\n }\\n }\\n }\\n std::cout << \\\"\\\\nUp to \\\" << limit << \\\":\\\\n\\\";\\n std::cout << \\\"Primes: \\\" << std::setw(6) << primes\\n << \\\"\\\\nPowers: \\\" << std::setw(6) << prime_powers\\n << \\\"\\\\nPlus 1: \\\" << std::setw(6) << 1\\n << \\\"\\\\nTotal: \\\" << std::setw(6) << primes + prime_powers + 1\\n << '\\\\n';\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"distinct_factors = iter (n: int) yields (int)\\n if n // 2 = 0 then\\n yield(2)\\n while n // 2 = 0 do n := n / 2 end\\n end\\n\\n div: int := 3\\n while div <= n do\\n if n // div = 0 then\\n yield(div)\\n while n // div = 0 do n := n / div end\\n end\\n div := div + 2\\n end\\nend distinct_factors\\n\\nradical = proc (n: int) returns (int)\\n rad: int := 1\\n for fac: int in distinct_factors(n) do\\n rad := rad * fac\\n end\\n return(rad)\\nend radical\\n\\ndpf_count = proc (n: int) returns (int)\\n count: int := 0\\n for fac: int in distinct_factors(n) do\\n count := count + 1\\n end\\n return(count)\\nend dpf_count\\n\\nshow_first_50 = proc (out: stream)\\n stream$putl(out, \\\"Radicals of 1..50:\\\")\\n for n: int in int$from_to(1, 50) do\\n stream$putright(out, int$unparse(radical(n)), 5)\\n if n // 10 = 0 then stream$putl(out, \\\"\\\") end\\n end\\nend show_first_50\\n\\nshow_radical = proc (out: stream, n: int)\\n stream$puts(out, \\\"The radical of \\\")\\n stream$puts(out, int$unparse(n))\\n stream$puts(out, \\\" is \\\")\\n stream$puts(out, int$unparse(radical(n)))\\n stream$putl(out, \\\".\\\")\\nend show_radical\\n\\nfind_distribution = proc (out: stream)\\n dist: array[int] := array[int]$fill(0, 8, 0)\\n for n: int in int$from_to(1, 1000000) do\\n stream$putright(out, int$unparse(n) || \\\"\\\\r\\\", 8)\\n dpf: int := dpf_count(n)\\n dist[dpf] := dist[dpf] + 1\\n end\\n\\n stream$putl(out, \\\"Distribution of radicals:\\\")\\n for dpf: int in array[int]$indexes(dist) do\\n stream$putright(out, int$unparse(dpf), 1)\\n stream$puts(out, \\\": \\\")\\n stream$putright(out, int$unparse(dist[dpf]), 8)\\n stream$putl(out, \\\"\\\")\\n end\\nend find_distribution\\n\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n\\n show_first_50(po)\\n stream$putl(po, \\\"\\\")\\n\\n for n: int in array[int]$elements(array[int]$[99999, 499999, 999999]) do\\n show_radical(po, n)\\n end\\n stream$putl(po, \\\"\\\")\\n\\n find_distribution(po)\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\nsub radical(n: uint32): (rad: uint32, dpf: uint8) is\\n dpf := 0;\\n rad := 1;\\n\\n # Handle factors of 2 first\\n if n & 1 == 0 then\\n dpf := 1;\\n rad := 2;\\n while n > 0 and n & 1 == 0 loop\\n n := n >> 1;\\n end loop;\\n end if;\\n\\n # Divide out odd prime factors\\n var div: uint32 := 3;\\n while div <= n loop\\n if n % div == 0 then\\n dpf := dpf + 1;\\n rad := rad * div;\\n while n % div == 0 loop\\n n := n / div;\\n end loop;\\n end if;\\n div := div + 2;\\n end loop;\\nend sub;\\n\\nsub first50() is\\n print(\\\"Radicals of 1..50:\\\\n\\\");\\n var n: uint32 := 1;\\n var dpf: uint8;\\n var rad: uint32;\\n while n <= 50 loop\\n (rad, dpf) := radical(n);\\n print_i32(rad);\\n if n % 5 != 0 then\\n print_char('\\\\t');\\n else\\n print_nl();\\n end if;\\n n := n + 1;\\n end loop;\\nend sub;\\n\\nsub print_rad(n: uint32) is\\n var dpf: uint8;\\n var rad: uint32;\\n print(\\\"The radical of \\\");\\n print_i32(n);\\n print(\\\" is \\\");\\n (rad, dpf) := radical(n);\\n print_i32(rad);\\n print(\\\".\\\\n\\\");\\nend sub;\\n\\nsub find_distribution() is\\n var dist: uint32[8];\\n MemZero(&dist[0] as [uint8], @bytesof dist);\\n\\n var n: uint32 := 1;\\n var dpf: uint8;\\n var rad: uint32;\\n while n <= 1000000 loop\\n print_i32(n);\\n print_char('\\\\r');\\n (rad, dpf) := radical(n);\\n dist[dpf] := dist[dpf] + 1;\\n n := n + 1;\\n end loop;\\n\\n print(\\\"Distribution of radicals:\\\\n\\\");\\n dpf := 0;\\n while dpf < 8 loop\\n print_i8(dpf);\\n print(\\\": \\\");\\n print_i32(dist[dpf]);\\n print_nl();\\n dpf := dpf + 1;\\n end loop;\\nend sub;\\n\\nfirst50();\\nprint_nl();\\nprint_rad(99999);\\nprint_rad(499999);\\nprint_rad(999999);\\nprint_nl();\\nfind_distribution();\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"fastfunc radnf num .\\n d = 2\\n while d <= sqrt num\\n if num mod d = 0\\n nf += 1\\n while num mod d = 0\\n num /= d\\n .\\n .\\n d += 1\\n .\\n if d <= num\\n nf += 1\\n .\\n return nf\\n.\\nfunc rad num .\\n r = 1\\n d = 2\\n while d <= sqrt num\\n if num mod d = 0\\n r *= d\\n while num mod d = 0\\n num /= d\\n .\\n .\\n d += 1\\n .\\n if d <= num\\n r *= num\\n .\\n return r\\n.\\nproc show50 . .\\n write \\\"First 50 radicals:\\\"\\n for n = 1 to 50\\n write \\\" \\\" & rad n\\n .\\n print \\\"\\\"\\n.\\nproc show n . .\\n print \\\"radical(\\\" & n & \\\") = \\\" & rad n\\n.\\nproc dist . .\\n len dist[] 7\\n for n = 2 to 1000000\\n dist[radnf n] += 1\\n .\\n print \\\"\\\"\\n print \\\"Distribution of radicals:\\\"\\n print \\\"0: 1\\\"\\n for i = 1 to 7\\n print i & \\\": \\\" & dist[i]\\n .\\n.\\nshow50\\nprint \\\"\\\"\\nshow 99999\\nshow 499999\\nshow 999999\\nprint \\\"\\\"\\ndist\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"program Radical;\\n{$IFDEF FPC} {$MODE DELPHI}{$Optimization ON,ALL} {$ENDIF}\\n{$IFDEF WINDOWS}{$APPTYPE CONSOLE}{$ENDIF}\\n//much faster would be\\n//https://rosettacode.org/wiki/Factors_of_an_integer#using_Prime_decomposition\\nconst\\n LIMIT = 1000*1000;\\n DeltaMod235 : array[0..7] of Uint32 = (4, 2, 4, 2, 4, 6, 2, 6);\\n\\ntype\\n tRadical = record\\n number,radical,PrFacCnt: Uint64;\\n isPrime : boolean;\\n end;\\n function GetRadical(n: UInt32):tRadical;forward;\\n\\nfunction CommaUint(n : Uint64):AnsiString;\\n//commatize only positive Integers\\nvar\\n fromIdx,toIdx :Int32;\\n pRes : pChar;\\nBegin\\n str(n,result);\\n fromIdx := length(result);\\n toIdx := fromIdx-1;\\n if toIdx < 3 then\\n exit;\\n\\n toIdx := 4*(toIdx DIV 3)+toIdx MOD 3 +1 ;\\n setlength(result,toIdx);\\n pRes := @result[1];\\n dec(pRes);\\n repeat\\n pRes[toIdx] := pRes[FromIdx];\\n pRes[toIdx-1] := pRes[FromIdx-1];\\n pRes[toIdx-2] := pRes[FromIdx-2];\\n pRes[toIdx-3] := ',';\\n dec(toIdx,4);\\n dec(FromIdx,3);\\n until FromIdx<=3;\\n while fromIdx>=1 do\\n Begin\\n pRes[toIdx] := pRes[FromIdx];\\n dec(toIdx);\\n dec(fromIdx);\\n end;\\nend;\\n\\nprocedure OutRadical(n: Uint32);\\nBegin\\n writeln('Radical for ',CommaUint(n):8,':',CommaUint(GetRadical(n).radical):8);\\nend;\\n\\nfunction GetRadical(n: UInt32):tRadical;\\nvar\\n q,divisor, rest: UInt32;\\n nxt : Uint32;\\nbegin\\n with result do\\n Begin\\n number := n;\\n radical := n;\\n PrFacCnt := 1;\\n isPrime := false;\\n end;\\n\\n if n <= 1 then\\n EXIT;\\n\\n if n in [2,3,5,7,11,13,17,19,23,29,31] then\\n Begin\\n with result do\\n Begin\\n isprime := true;\\n PrFacCnt := 1;\\n end;\\n EXIT;\\n end;\\n\\n with result do\\n Begin\\n radical := 1;\\n PrFacCnt := 0;\\n end;\\n\\n rest := n;\\n if rest AND 1 = 0 then\\n begin\\n with result do begin radical := 2; PrFacCnt:= 1;end;\\n repeat\\n rest := rest shr 1;\\n until rest AND 1 <> 0;\\n end;\\n\\n if rest < 3 then\\n EXIT;\\n q := rest DIV 3;\\n if rest-q*3= 0 then\\n begin\\n with result do begin radical *= 3; inc(PrFacCnt);end;\\n repeat\\n rest := q;\\n q := rest DIV 3;\\n until rest-q*3 <> 0;\\n end;\\n\\n if rest < 5 then\\n EXIT;\\n q := rest DIV 5;\\n if rest-q*5= 0 then\\n begin\\n with result do begin radical *= 5;inc(PrFacCnt);end;\\n repeat\\n rest := q;\\n q := rest DIV 5;\\n until rest-q*5 <> 0;\\n end;\\n\\n divisor := 7;\\n nxt := 0;\\n repeat;\\n if rest < sqr(divisor) then\\n BREAK;\\n q := rest DIV divisor;\\n if rest-q*divisor= 0 then\\n begin\\n with result do begin radical *= divisor; inc(PrFacCnt);end;\\n repeat\\n rest := q;\\n q := rest DIV divisor;\\n until rest-q*divisor <> 0;\\n end;\\n divisor += DeltaMod235[nxt];\\n nxt := (nxt+1) AND 7;\\n until false;\\n //prime ?\\n if rest = n then\\n with result do begin radical := n;PrFacCnt:=1;isPrime := true; end\\n else\\n if rest >1 then\\n with result do begin radical *= rest;inc(PrFacCnt);end;\\nend;\\n\\nvar\\n Rad:tRadical;\\n CntOfPrFac : array[0..9] of Uint32;\\n j,sum,countOfPrimes,CountOfPrimePowers: integer;\\n\\nbegin\\n writeln('The radicals for the first 50 positive integers are:');\\n for j := 1 to 50 do\\n Begin\\n write (GetRadical(j).radical:4);\\n if j mod 10 = 0 then\\n Writeln;\\n end;\\n writeln;\\n\\n OutRadical( 99999);\\n OutRadical(499999);\\n OutRadical(999999);\\n writeln;\\n\\n writeln('Breakdown of numbers of distinct prime factors');\\n writeln('for positive integers from 1 to ',CommaUint(LIMIT));\\n\\n countOfPrimes:=0;\\n CountOfPrimePowers :=0;\\n For j := Low(CntOfPrFac) to High(CntOfPrFac) do\\n CntOfPrFac[j] := 0;\\n For j := 1 to LIMIT do\\n Begin\\n Rad := GetRadical(j);\\n with rad do\\n Begin\\n IF isPrime then\\n inc(countOfPrimes)\\n else\\n if (j>1)AND(PrFacCnt= 1) then\\n inc(CountOfPrimePowers);\\n end;\\n inc(CntOfPrFac[Rad.PrFacCnt]);\\n end;\\n\\n sum := 0;\\n For j := Low(CntOfPrFac) to High(CntOfPrFac) do\\n if CntOfPrFac[j] > 0 then\\n Begin\\n writeln(j:3,': ',CommaUint(CntOfPrFac[j]):10);\\n inc(sum,CntOfPrFac[j]);\\n end;\\n writeln('sum: ',CommaUint(sum):10);\\n writeln;\\n sum := countOfPrimes+CountOfPrimePowers+1;\\n writeln('For primes or powers (>1) there of <= ',CommaUint(LIMIT));\\n Writeln(' Number of primes =',CommaUint(countOfPrimes):8);\\n Writeln(' Number of prime powers =',CommaUint(CountOfPrimePowers):8);\\n Writeln(' Add 1 for number = 1');\\n Writeln(' sums to =',CommaUint(sum):8);\\n {$IFDEF WINDOWS}readln;{$ENDIF}\\nend.\\n\",\n \"language\": \"Free-Pascal-Lazarus\"\n },\n {\n \"code\": \"'#include \\\"isprime.bas\\\"\\n\\nFunction Radical(n As Integer) As Integer 'Return radical of n\\n Dim As Integer d = 2, d0 = 0, p = 1\\n While n >= d*d\\n While n Mod d = 0\\n If d <> d0 Then\\n p *= d\\n d0 = d\\n End If\\n n /= d\\n Wend\\n d += 1\\n Wend\\n If d <> d0 Then p *= n\\n Return p\\nEnd Function\\n\\nFunction DistinctFactors(n As Integer) As Integer 'Return count of distinct factors of n\\n Dim As Integer d = 2, d0 = 0, c = 0\\n While n >= d*d\\n While n Mod d = 0\\n If d <> d0 Then\\n c += 1\\n d0 = d\\n End If\\n n = n/d\\n Wend\\n d += 1\\n Wend\\n If d <> d0 And n <> 1 Then c += 1\\n Return c\\nEnd Function\\n\\nDim As Integer n, c, count(0 To 9), pcount, ppcount, p2, p\\nPrint \\\"The radicals for the first 50 positive integers are:\\\"\\nFor n = 1 To 50\\n Print Using \\\"####\\\"; Radical(n);\\n If n Mod 10 = 0 Then Print\\nNext\\nPrint Using !\\\"\\\\nRadical for ###,###: ###,###\\\"; 99999; Radical(99999)\\nPrint Using \\\"Radical for ###,###: ###,###\\\"; 499999; Radical(499999)\\nPrint Using \\\"Radical for ###,###: ###,###\\\"; 999999; Radical(999999)\\n\\nFor n = 0 To 9\\n count(n) = 0\\nNext\\nFor n = 1 To 1e6\\n c = DistinctFactors(n)\\n count(c) += 1\\nNext\\nPrint !\\\"\\\\nBreakdown of numbers of distinct prime factors \\\\nfor positive integers from 1 to 1,000,000:\\\"\\nc = 0\\nFor n = 0 To 9\\n If count(n) > 0 Then Print Using \\\" #: ###,###\\\"; n; count(n)\\n c += count(n)\\nNext\\nPrint Using !\\\" ---------\\\\n #,###,###\\\"; c\\n\\nPrint !\\\"\\\\nor graphically:\\\\n\\\"; String(50, \\\"-\\\")\\nFor n = 0 To 9\\n If count(n) > 0 Then Print n; \\\" \\\"; String(count(n)/1e4, Chr(177)); \\\" \\\"; count(n)\\n c += count(n)\\nNext\\nPrint String(50, \\\"-\\\")\\n\\n'Bonus (algorithm from Wren):\\npcount = 0\\nFor n = 1 To 1e6\\n If isPrime(n) Then pcount += 1\\nNext\\nPrint !\\\"\\\\nFor primes or powers (>1) thereof <= 1,000,000:\\\"\\nPrint Using \\\" Number of primes: ##,###\\\"; pcount\\nppcount = 0\\nFor p = 1 To Sqr(1e6)\\n If isPrime(p) Then\\n p2 = p\\n Do\\n p2 *= p\\n If p2 > 1e6 Then Exit Do\\n ppcount += 1\\n Loop\\n End If\\nNext\\nPrint Using \\\" Number of powers: ##,###\\\"; ppcount\\nPrint Using \\\"Add 1 for number 1: ##,###\\\"; 1\\nIf isPrime(n) Then pcount += 1\\nPrint Spc(19); \\\"-------\\\"\\nPrint Spc(13); Using !\\\"Total: ##,###\\\"; pcount + ppcount + 1\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \" ~.&.q: 1+i.5 10 NB. radicals of first 50 positive integers\\n 1 2 3 2 5 6 7 2 3 10\\n11 6 13 14 15 2 17 6 19 10\\n21 22 23 6 5 26 3 14 29 30\\n31 2 33 34 35 6 37 38 39 10\\n41 42 43 22 15 46 47 6 7 10\\n ~.&.q: 99999 499999 999999 NB. radicals of these three...\\n33333 3937 111111\\n (~.,.#/.~) 1>.#@~.@q: 1+i.1e6 NB. distribution of number of prime factors of first million positive integers\\n1 78735\\n2 288726\\n3 379720\\n4 208034\\n5 42492\\n6 2285\\n7 8\\n p:inv 1e6 NB. number of primes not exceeding 1 million\\n78498\\n +/_1+<.(i.&.(p:inv) 1000)^.1e6 NB. count of prime powers (square or above) up to 1 million\\n236\\n 78498+236+1 NB. and we \\\"claimed\\\" that 1 had a prime factor\\n78735\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.List;\\nimport java.util.stream.Collectors;\\nimport java.util.stream.IntStream;\\n\\npublic final class RadicalOfAnInteger {\\n\\n\\tpublic static void main(String[] aArgs) {\\n\\t\\tsievePrimes();\\n\\t\\tdistinctPrimeFactors();\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"Radical of first 50 positive integers:\\\");\\n\\t\\tfor ( int n = 1; n <= 50; n++ ) {\\n\\t\\t\\tSystem.out.print(String.format(\\\"%3d%s\\\", radical(n), ( n % 10 == 0 ? \\\"\\\\n\\\" : \\\"\\\" )));\\n\\t\\t}\\n\\t\\tSystem.out.println();\\n\\t\\t\\n\\t\\tfor ( int n : List.of( 99_999, 499_999, 999_999 ) ) {\\n\\t\\t\\tSystem.out.println(String.format(\\\"%s%7d%s%7d\\\", \\\"Radical for \\\", n, \\\":\\\", radical(n)));\\n\\t\\t}\\n\\t\\tSystem.out.println();\\n\\t\\t\\n\\t\\tSystem.out.print(\\\"Distribution of the first one million positive \\\");\\n\\t\\tSystem.out.println(\\\"integers by numbers of distinct prime factors:\\\");\\n\\t\\tList<Integer> counts = IntStream.rangeClosed(0, 7).boxed().map( i -> 0 ).collect(Collectors.toList());\\n\\t\\tfor ( int n = 1; n <= LIMIT; n++ ) {\\n\\t\\t\\tcounts.set(distinctPrimeFactorCount(n), counts.get(distinctPrimeFactorCount(n)) + 1);\\n\\t\\t}\\t\\t\\n\\t\\tfor ( int n = 0; n < counts.size(); n++ ) {\\n\\t\\t\\tSystem.out.println(String.format(\\\"%d%s%7d\\\", n, \\\":\\\", counts.get(n)));\\n\\t\\t}\\n\\t\\tSystem.out.println();\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"Number of primes and powers of primes less than or equal to one million:\\\");\\n\\t\\tint count = 0;\\n\\t\\tfinal double logOfLimit = Math.log(LIMIT);\\n\\t\\tfor ( int p : primes ) {\\n\\t\\t count += logOfLimit / Math.log(p);\\n\\t\\t}\\n\\t\\tSystem.out.println(count);\\n\\t}\\n\\t\\n\\tprivate static int radical(int aNumber) {\\n\\t\\treturn distinctPrimeFactors.get(aNumber).stream().reduce(1, Math::multiplyExact);\\n\\t}\\n\\t\\n\\tprivate static int distinctPrimeFactorCount(int aNumber) {\\n\\t\\treturn distinctPrimeFactors.get(aNumber).size();\\n\\t}\\n\\t\\n\\tprivate static void distinctPrimeFactors() {\\n\\t\\tdistinctPrimeFactors = IntStream.rangeClosed(0, LIMIT).boxed()\\n\\t\\t\\t.map( i -> new ArrayList<Integer>() ).collect(Collectors.toList());\\n\\t\\tfor ( int p : primes ) {\\n\\t\\t for ( int n = p; n <= LIMIT; n += p ) {\\n\\t\\t\\t distinctPrimeFactors.get(n).add(p);\\n\\t\\t }\\n\\t\\t}\\n\\t}\\n\\t\\n\\tprivate static void sievePrimes() {\\n\\t\\tList<Boolean> markedPrime = IntStream.rangeClosed(0, LIMIT).boxed()\\n\\t\\t\\t.map( i -> true ).collect(Collectors.toList());\\n for ( int p = 2; p * p <= LIMIT; p++ ) {\\n if ( markedPrime.get(p) ) {\\n for ( int i = p * p; i <= LIMIT; i += p ) {\\n markedPrime.set(i, false);\\n }\\n }\\n }\\n\\n primes = new ArrayList<Integer>();\\n for ( int p = 2; p <= LIMIT; p++ ) {\\n if ( markedPrime.get(p) ) {\\n primes.add(p);\\n }\\n }\\n }\\n\\n\\tprivate static List<Integer> primes;\\n\\tprivate static List<List<Integer>> distinctPrimeFactors;\\n\\t\\n\\tprivate static final int LIMIT = 1_000_000;\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# Utility functions\\ndef lpad($len): tostring | ($len - length) as $l | (\\\" \\\" * $l) + .;\\n\\ndef prod(s): reduce s as $x (1; . * $x);\\n\\ndef sum(s): reduce s as $x (0; . + $x);\\n\\ndef uniq(s):\\n foreach s as $x (null;\\n if . and $x == .[0] then .[1] = false\\n else [$x, true]\\n end;\\n if .[1] then .[0] else empty end);\\n\\n\\n# Prime number functions\\n\\n# Returns the prime factors of . in order using a wheel with basis [2, 3, 5].\\ndef primeFactors:\\n def out($i): until (.n % $i != 0; .factors += [$i] | .n = ((.n/$i)|floor) );\\n if . < 2 then []\\n else [4, 2, 4, 2, 4, 6, 2, 6] as $inc\\n | { n: .,\\n factors: [] }\\n | out(2)\\n | out(3)\\n | out(5)\\n | .k = 7\\n | .i = 0\\n | until(.k * .k > .n;\\n if .n % .k == 0\\n then .factors += [.k]\\n | .n = ((.n/.k)|floor)\\n else .k += $inc[.i]\\n | .i = ((.i + 1) % 8)\\n end)\\n | if .n > 1 then .factors += [.n] else . end\\n\\n | .factors\\n end;\\n\\n# Input: a positive integer\\n# Output: an array, $a, of length .+1 such that\\n# $a[$i] is $i if $i is prime, and false otherwise.\\ndef primeSieve:\\n # erase(i) sets .[i*j] to false for integral j > 1\\n def erase($i):\\n if .[$i] then\\n reduce (range(2*$i; length; $i)) as $j (.; .[$j] = false)\\n else .\\n end;\\n (. + 1) as $n\\n | (($n|sqrt) / 2) as $s\\n | [null, null, range(2; $n)]\\n | reduce (2, 1 + (2 * range(1; $s))) as $i (.; erase($i)) ;\\n\\n# Number of primes up to and including .\\ndef primeCount:\\n sum(primeSieve[] | select(.) | 1);\\n\\n\\n## Radicals\\n\\ndef task1:\\n{ radicals: [0],\\n counts: [range(0;8)|0] }\\n| .radicals[1] = 1\\n| .counts[1] = 1\\n| foreach range(2; 1+1e6) as $i (.;\\n .factors = [uniq($i|primeFactors[])]\\n | (.factors|length) as $fc\\n | .counts[$fc] += 1\\n | if $i <= 50 then .radicals[$i] = prod(.factors[]) else . end ;\\n\\n if $i == 50\\n then \\\"The radicals for the first 50 positive integers are:\\\",\\n (.radicals[1:] | _nwise(10) | map(lpad(4)) | join(\\\" \\\")),\\n\\t \\\"\\\"\\n\\n elif $i | IN( 99999, 499999, 999999)\\n then \\\"Radical for \\\\($i|lpad(8)): \\\\(prod(.factors[])|lpad(8))\\\"\\n elif $i == 1e6\\n then \\\"\\\\nBreakdown of numbers of distinct prime factors\\\",\\n \\\"for positive integers from 1 to 1,000,000:\\\",\\n (range(1; 8) as $i\\n | \\\" \\\\($i): \\\\(.counts[$i]|lpad(8))\\\"),\\n \\\" ---------\\\",\\n \\\" \\\\(sum(.counts[]))\\\"\\n else empty\\n end);\\n\\ndef task2:\\n def pad: lpad(6);\\n\\n (1000|primeSieve|map(select(.))) as $primes1k\\n | { pcount: (1e6|primeCount),\\n ppcount: 0 }\\n | reduce $primes1k[] as $p (.;\\n .p2 = $p\\n | .done = false\\n | until(.done;\\n .p2 *= $p\\n | if .p2 > 1e6 then .done = true\\n\\t else .ppcount += 1\\n\\t end ) )\\n | \\\"\\\\nFor primes or powers (>1) thereof <= 1,000,000:\\\",\\n \\\" Number of primes = \\\\(.pcount|pad)\\\",\\n \\\" Number of powers = \\\\(.ppcount|pad)\\\",\\n \\\" Add 1 for number 1 = \\\\(1|pad)\\\",\\n \\\" ------\\\",\\n \\\" \\\\( (.pcount + .ppcount + 1)|pad)\\\" ;\\n\\ntask1, task2\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Formatting, Primes, UnicodePlots\\n\\nradical(n) = prod(map(first, factor(n).pe))\\nradicallength(n) = length(factor(n).pe)\\n\\nprintln(\\\"The radicals for the first 50 positive integers are:\\\")\\nforeach(p -> print(rpad(p[2], 4), p[1] % 10 == 0 ? \\\"\\\\n\\\" : \\\"\\\"), enumerate(map(radical, 1:50)))\\n\\nfor i in [99999, 499999, 999999]\\n println(\\\"\\\\nRadical for \\\", format(i, commas=true), \\\": \\\", format(radical(i), commas=true))\\nend\\n\\nprintln(\\\"\\\\nBreakdown of numbers of distinct prime factors for positive integers from 1 to 1,000,000:\\\")\\nhistogram(map(radicallength, 1:1_000_000), nbins = 8)\\n\\nprintln(\\\"\\\\nCheck on breakdown:\\\")\\nprimecount = length(primes(1_000_000)) # count of primes to 1 million\\npowerscount = mapreduce(p -> Int(floor(6 / log10(p)) - 1), +, primes(1000))\\nprintln(\\\"Prime count to 1 million: \\\", lpad(primecount, 6))\\nprintln(\\\"Prime powers less than 1 million: \\\", lpad(powerscount, 6))\\nprintln(\\\"Subtotal:\\\", lpad(primecount + powerscount, 32))\\nprintln(\\\"The integer 1 has 0 prime factors: \\\", lpad(1, 6))\\nprintln(\\\"-\\\"^41, \\\"\\\\n\\\", \\\"Overall total:\\\", lpad(primecount + powerscount + 1, 27))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"do -- find the radicals of some integers - the radical of n is the product\\n -- of the distinct prime factors of n, the radical of 1 is 1\\n\\n local maxNumber = 1000000; -- maximum number we will consider\\n local upfc, radical = {}, {} -- unique prime factor counts and radicals\\n for i = 1, maxNumber do\\n upfc[ i ] = 0\\n radical[ i ] = 1\\n end\\n for i = 2, maxNumber do\\n if upfc[ i ] == 0 then\\n radical[ i ] = i\\n upfc[ i ] = 1\\n for j = i + i, maxNumber, i do\\n upfc[ j ] = upfc[ j ] + 1\\n radical[ j ] = radical[ j ] * i\\n end\\n end\\n end\\n -- show the radicals of the first 50 positive integers\\n io.write( \\\"Radicals of 1 to 50:\\\\n\\\" )\\n for i = 1, 50 do\\n io.write( string.format( \\\"%5d\\\", radical[ i ] ), ( i % 10 == 0 and \\\"\\\\n\\\" or \\\"\\\" ) )\\n end\\n -- radicals of some specific numbers\\n io.write( \\\"\\\\n\\\" )\\n io.write( \\\"Radical of 99999: \\\", radical[ 99999 ], \\\"\\\\n\\\" )\\n io.write( \\\"Radical of 499999: \\\", radical[ 499999 ], \\\"\\\\n\\\" )\\n io.write( \\\"Radical of 999999: \\\", radical[ 999999 ], \\\"\\\\n\\\" )\\n io.write( \\\"\\\\n\\\" )\\n -- show the distribution of the unique prime factor counts\\n local dpfc = {}\\n for i = 1, maxNumber do\\n local count = dpfc[ upfc[ i ] ]\\n dpfc[ upfc[ i ] ] = ( count == nil and 1 or count + 1 )\\n end\\n io.write( \\\"Distribution of radicals:\\\\n\\\" )\\n for i = 0, #dpfc do\\n io.write( string.format( \\\"%2d\\\", i ), \\\": \\\", dpfc[ i ], \\\"\\\\n\\\" )\\n end\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \" NORMAL MODE IS INTEGER\\n\\n INTERNAL FUNCTION(A,B)\\n ENTRY TO REM.\\n FUNCTION RETURN A-A/B*B\\n END OF FUNCTION\\n\\n INTERNAL FUNCTION(NN)\\n ENTRY TO RADIC.\\n KN = NN\\n DPF = 0\\n RAD = 1\\n WHENEVER KN.E.0, FUNCTION RETURN 0\\n WHENEVER REM.(KN,2).E.0\\n DPF = 1\\n RAD = 2\\n THROUGH DIV2, FOR KN=KN, 0, REM.(KN,2).NE.0\\nDIV2 KN = KN / 2\\n END OF CONDITIONAL\\n THROUGH ODD, FOR FAC=3, 2, FAC.G.KN\\n WHENEVER REM.(KN,FAC).E.0\\n DPF = DPF + 1\\n RAD = RAD * FAC\\n THROUGH DIVP, FOR KN=KN, 0, REM.(KN,FAC).NE.0\\nDIVP KN = KN / FAC\\n END OF CONDITIONAL\\nODD CONTINUE\\n FUNCTION RETURN RAD\\n END OF FUNCTION\\n\\n R PRINT RADICALS FOR 1..50\\n VECTOR VALUES RADLIN = $10(I5)*$\\n PRINT COMMENT $ RADICALS OF 1 TO 50$\\n THROUGH RADL, FOR L=0, 10, L.GE.50\\nRADL PRINT FORMAT RADLIN,\\n 0 RADIC.(L+1),RADIC.(L+2),RADIC.(L+3),RADIC.(L+4),\\n 1 RADIC.(L+5),RADIC.(L+6),RADIC.(L+7),RADIC.(L+8),\\n 2 RADIC.(L+9),RADIC.(L+10)\\n\\n R PRINT RADICALS OF TASK NUMBERS\\n PRINT COMMENT $ $\\n VECTOR VALUES RADNUM = $14HTHE RADICAL OF,I7,S1,2HIS,I7*$\\n THROUGH RADN, FOR VALUES OF N = 99999, 499999, 999999\\nRADN PRINT FORMAT RADNUM,N,RADIC.(N)\\n\\n R FIND DISTRIBUTION\\n PRINT COMMENT $ $\\n DIMENSION DIST(8)\\n THROUGH ZERO, FOR D = 0, 1, D.G.7\\nZERO DIST(D) = 0\\n\\n THROUGH CNTDST, FOR N = 1, 1, N.G.1000000\\n RADIC.(N)\\nCNTDST DIST(DPF) = DIST(DPF) + 1\\n\\n PRINT COMMENT $ DISTRIBUTION OF RADICALS$\\n VECTOR VALUES DISTLN = $I1,2H: ,I8*$\\n THROUGH SHWDST, FOR D = 0, 1, D.G.7\\nSHWDST PRINT FORMAT DISTLN,D,DIST(D)\\n\\n END OF PROGRAM\\n\",\n \"language\": \"MAD\"\n },\n {\n \"code\": \"import std/[math, strformat, strutils]\\n\\nconst N = 1_000_000\\n\\n### Build list of primes.\\n\\nfunc isPrime(n: Natural): bool =\\n ## Return true if \\\"n\\\" is prime.\\n ## \\\"n\\\" should not be a mutiple of 2 or 3.\\n var k = 5\\n var delta = 2\\n while k * k <= n:\\n if n mod k == 0: return false\\n inc k, delta\\n delta = 6 - delta\\n result = true\\n\\nvar primes = @[2, 3]\\nvar n = 5\\nvar step = 2\\nwhile n <= N:\\n if n.isPrime:\\n primes.add n\\n inc n, step\\n step = 6 - step\\n\\n\\n### Build list of distinct prime factors to\\n### compute radical and distinct factor count.\\n\\nvar primeFactors: array[1..N, seq[int]]\\nfor p in primes:\\n for n in countup(p, N, p):\\n primeFactors[n].add p\\n\\ntemplate radical(n: int): int = prod(primeFactors[n])\\n\\ntemplate factorCount(n: int): int = primeFactors[n].len\\n\\n\\n### Task ###\\n\\necho \\\"Radical of first 50 positive integers:\\\"\\nfor n in 1..50:\\n stdout.write &\\\"{radical(n):2}\\\"\\n stdout.write if n mod 10 == 0: '\\\\n' else: ' '\\necho()\\n\\nfor n in [99_999, 499_999, 999_999]:\\n echo &\\\"Radical for {insertSep($n):>7}: {insertSep($radical(n)):>7}\\\"\\necho()\\n\\necho \\\"Distribution of the first one million positive\\\"\\necho \\\"integers by numbers of distinct prime factors:\\\"\\nvar counts: array[0..7, int]\\nfor n in 1..1_000_000:\\n inc counts[factorCount(n)]\\nfor n, count in counts:\\n echo &\\\"{n}: {insertSep($count):>7}\\\"\\necho()\\n\\n\\n### Bonus ###\\n\\necho \\\"Number of primes and powers of primes\\\"\\necho \\\"less than or equal to one million:\\\"\\nvar count = 0\\nconst LogN = ln(N.toFloat)\\nfor p in primes:\\n inc count, int(LogN / ln(p.toFloat))\\necho insertSep($count)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature <say signatures>;\\nno warnings 'experimental::signatures';\\n\\nuse List::Util 'uniq';\\nuse ntheory <primes vecprod factor>;\\n\\nsub comma { reverse ((reverse shift) =~ s/.{3}\\\\K/,/gr) =~ s/^,//r }\\nsub table (@V) { ( sprintf( ('%3d')x@V, @V) ) =~ s/.{1,30}\\\\K/\\\\n/gr }\\n\\nsub radical ($n) { vecprod uniq factor $n }\\n\\nmy $limit = 1e6;\\n\\nmy $primes = primes(1,$limit);\\n\\nmy %rad;\\n$rad{1} = 1;\\n$rad{ uniq factor $_ }++ for 2..$limit;\\n\\nmy $powers;\\nmy $upto = int sqrt $limit;\\nfor my $p ( grep { $_< $upto} @$primes ) {\\n for (2..$upto) { ($p ** $_) < $limit ? ++$powers : last }\\n}\\n\\nsay 'First fifty radicals:';\\nsay table map { radical $_ } 1..50;\\nprintf \\\"Radical for %7s => %7s\\\\n\\\", comma($_), comma radical($_) for 99999, 499999, 999999;\\nprintf \\\"\\\\nRadical factor count breakdown, 1 through %s:\\\\n\\\", comma $limit;\\nsay \\\"$_ => \\\" . comma $rad{$_} for sort keys %rad;\\nsay <<~\\\"END\\\";\\n\\n Up to @{[comma $limit]}:\\n Primes: @{[comma 0+@$primes]}\\n Powers: $powers\\n Plus 1: 1\\n Total: @{[comma 1 + $powers + @$primes]}\\n END\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">radicals</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">reinstate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">50</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">counts</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">reinstate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">1e6</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">f</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">vslice</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">prime_powers</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">counts</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">)]</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">50</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">radicals</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">product</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">50</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"The radicals for the first 50 positive integers are:\\\\n%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">join_by</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">radicals</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">:=</span><span style=\\\"color: #008000;\\\">\\\"%3d\\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">99999</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">499999</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">999999</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Radical for %,7d: %,7d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">product</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1e6</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\nBreakdown of numbers of distinct prime factors\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"for positive integers from 1 to 1,000,000:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">7</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" %d: %,8d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">counts</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">]})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" ---------\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" %,8d\\\\n\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">counts</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">pcount</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">get_primes_le</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1e6</span><span style=\\\"color: #0000FF;\\\">)),</span>\\n <span style=\\\"color: #000000;\\\">ppcount</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #008080;\\\">in</span> <span style=\\\"color: #7060A8;\\\">get_primes_le</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1000</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">p2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">p</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">p2</span> <span style=\\\"color: #0000FF;\\\">*=</span> <span style=\\\"color: #000000;\\\">p</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">1e6</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">ppcount</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"For primes or powers (>1) thereof <= 1,000,000:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" Number of primes = %,6d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pcount</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" Number of powers = %,6d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ppcount</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" Add 1 for number 1 = %,6d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" ------\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" %,6d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pcount</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">ppcount</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"# int_radicals.py by Xing216\\n\\ndef radical(n):\\n product = 1\\n if (n % 2 == 0):\\n product *= 2\\n while (n%2 == 0):\\n n = n/2\\n for i in range (3, int((n)**0.5), 2):\\n if (n % i == 0):\\n product = product * i\\n while (n%i == 0):\\n n = n/i\\n if (n > 2):\\n product = product * n\\n return int(product)\\ndef distinctPrimeFactors(N):\\n factors = []\\n if (N < 2):\\n factors.append(-1)\\n return factors\\n if N == 2:\\n factors.append(2)\\n return factors\\n visited = {}\\n i = 2\\n while(i * i <= N):\\n while(N % i == 0):\\n if(i not in visited):\\n factors.append(i)\\n visited[i] = 1\\n N //= i\\n i+=1\\n if(N > 2):\\n factors.append(N)\\n return factors\\nif __name__ == \\\"__main__\\\":\\n print(\\\"Radical of first 50 positive integers:\\\")\\n for i in range(1,51):\\n print(f\\\"{radical(i):>2}\\\", end=\\\" \\\")\\n if (i % 10 == 0):\\n print()\\n print()\\n for n in [99999, 499999, 999999]:\\n print(f\\\"Radical of {n:>6}: {radical(n)}\\\")\\n distDict = {1:0,2:0,3:0,4:0,5:0,6:0,7:0}\\n for i in range(1,1000000):\\n distinctPrimeFactorCount = len(distinctPrimeFactors(i))\\n distDict[distinctPrimeFactorCount] += 1\\n print(\\\"\\\\nDistribution of the first one million positive integers by numbers of distinct prime factors:\\\")\\n for key, value in distDict.items():\\n print(f\\\"{key}: {value:>6}\\\")\\n print(\\\"\\\\nNumber of primes and powers of primes less than or equal to one million:\\\")\\n print(distDict[1])\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"use Prime::Factor;\\nuse List::Divvy;\\nuse Lingua::EN::Numbers;\\n\\nsub radical ($_) { [×] unique .&prime-factors }\\n\\nsay \\\"First fifty radicals:\\\\n\\\" ~\\n (1..50).map({.&radical}).batch(10)».fmt(\\\"%2d\\\").join: \\\"\\\\n\\\";\\nsay '';\\n\\nprintf \\\"Radical for %7s => %7s\\\\n\\\", .&comma, comma .&radical\\n for 99999, 499999, 999999;\\n\\nmy %rad = 1 => 1;\\nmy $limit = 1e6.Int;\\n\\n%rad.push: $_ for (2..$limit).race(:1000batch).map: {(unique .&prime-factors).elems => $_};\\n\\nsay \\\"\\\\nRadical factor count breakdown, 1 through {comma $limit}:\\\";\\nsay .key ~ \\\" => {comma +.value}\\\" for sort %rad;\\n\\nmy @primes = (2..$limit).grep: &is-prime;\\n\\nmy int $powers;\\n@primes.&upto($limit.sqrt.floor).map: -> $p {\\n for (2..*) { ($p ** $_) < $limit ?? ++$powers !! last }\\n}\\n\\nsay qq:to/RADICAL/;\\n\\n Up to {comma $limit}:\\n Primes: {comma +@primes}\\n Powers: $powers\\n Plus 1: 1\\n Total: {comma 1 + $powers + @primes}\\n RADICAL\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/* REXX */\\ncall setp\\nNumeric Digits 100\\n/* 1. Radicals from 1 to 50 */\\nSay 'Radicals of 1..50:'\\nol=''\\nDo n=1 To 50\\n ol=ol||right(rad(n),5)\\n If n//10=0 then Do\\n Say ol\\n ol=''\\n End\\n End\\n\\nSay ''\\nCall radt 99999\\nCall radt 499999\\nCall radt 999999\\n\\nSay ''\\nSay 'Distribution of radicals:'\\nCall time 'R'\\ncnt.=0\\nDo v=1 To 1000000\\n If v//100000=1 Then Do\\n ti=v%100000\\n etime.ti=format(time('E'),4,1)\\n End\\n p=rad(v,'cnt')\\n cnt.p+=1\\n /**************************************\\n If p=7 Then\\n Say v':' rad(v,'lstx') '=' rad(v)\\n **************************************/\\n End\\netime.10=format(time('E'),4,1)\\nDo d=0 To 20\\n If cnt.d>0 Then\\n Say d':' right(cnt.d,8)\\n End\\nSay ''\\nSay 'Timings:'\\nDo ti=1 To 10\\n Say right(ti,2) etime.ti 'seconds'\\n End\\nExit\\n\\nradt:\\n Parse Arg u\\n Say 'The radical of' u 'is' rad(u)'.'\\n Return\\n\\nrad:\\n Parse Arg z,what\\n zz=z\\n plist=''\\n exp.=0\\n Do Until p*p>z\\n Do pi=1 By 1 Until p*p>z\\n p=word(primzahlen,pi)\\n exp.p=0\\n Do while z//p=0\\n exp.p+=1\\n If pos(p,plist)=0 Then\\n plist=plist p\\n z=z%p\\n End\\n End\\n End\\n exp.z+=1\\n If pos(z,plist)=0 &z<>1 Then\\n plist=plist z\\n Select\\n When what='lst' Then\\n Return plist\\n When what='lstx' Then Do\\n s=''\\n Do While plist<>''\\n Parse Var plist p plist\\n if exp.p=1 Then\\n s=s'*'p\\n Else\\n s=s'*'p'**'exp.p\\n End\\n Return strip(s,,'*')\\n End\\n When what='cnt' Then\\n Return words(plist)\\n Otherwise Do\\n rad=1\\n Do while plist>''\\n Parse Var plist p plist\\n rad=rad*p\\n End\\n Return rad\\n End\\n End\\n\\nsetp:\\nprimzahlen=,\\n2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101,\\n103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197,\\n199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311,\\n313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431,\\n433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557,\\n563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659 661,\\n673 677 683 691 701 709 719 727 733 739 743 751 757 761 769 773 787 797 809,\\n811 821 823 827 829 839 853 857 859 863 877 881 883 887 907 911 919 929 937,\\n941 947 953 967 971 977 983 991 997 1009 1013 1019 1021 1031 1033 1039 1049\\nReturn\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"module Radical\\n refine Integer do\\n require 'prime'\\n\\n def radical = self == 1 ? 1 : prime_division.map(&:first).inject(&:*)\\n def num_uniq_prime_factors = prime_division.size\\n def prime_pow? = prime_division.size == 1\\n\\n end\\nend\\n\\nusing Radical\\n\\nn = 50 # task 1\\nputs \\\"The radicals for the first #{n} positive integers are:\\\"\\n(1..n).map(&:radical).each_slice(10){|s| puts \\\"%4d\\\"*s.size % s}\\nputs # task 2\\n[99999, 499999 , 999999].each{|n| puts \\\"Radical for %6d: %6d\\\" % [n, n.radical]}\\nn = 1_000_000 # task 3 & bonus\\nputs \\\"\\\\nNumbers of distinct prime factors for integers from 1 to #{n}\\\"\\n(1..n).map(&:num_uniq_prime_factors).tally.each{|kv| puts \\\"%d: %8d\\\" % kv }\\nputs \\\"\\\\nNumber of primes and powers of primes less than or equal to #{n}: #{(1..n).count(&:prime_pow?)}\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"with (50) {|n|\\n say \\\"Radicals of the first #{n} positive integers:\\\"\\n 1..n -> map { .rad }.each_slice(10, {|*s|\\n say s.map { '%2s' % _ }.join(' ')\\n })\\n}\\n\\nsay ''; [99999, 499999, 999999].map {|n|\\n say \\\"rad(#{n}) = #{rad(n)}\\\"\\n}\\n\\nfor limit in (1e6, 1e7, 1e8, 1e9) {\\n say \\\"\\\\nCounting of k-omega primes <= #{limit.commify}:\\\"\\n for k in (1..Inf) {\\n break if (pn_primorial(k) > limit)\\n var c = k.omega_prime_count(limit)\\n say \\\"#{k}: #{c}\\\"\\n assert_eq(c, limit.prime_power_count) if (k == 1)\\n }\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"import \\\"./math\\\" for Int, Nums\\nimport \\\"./seq\\\" for Lst\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar radicals = List.filled(51, 0)\\nradicals[1] = 1\\nvar counts = List.filled(8, 0)\\ncounts[1] = 1\\nfor (i in 2..1e6) {\\n var factors = Lst.prune(Int.primeFactors(i))\\n var fc = factors.count\\n counts[fc] = counts[fc] + 1\\n if (i <= 50) radicals[i] = Nums.prod(factors)\\n if (i == 50) {\\n System.print(\\\"The radicals for the first 50 positive integers are:\\\")\\n Fmt.tprint(\\\"$2d \\\", radicals.skip(1), 10)\\n System.print()\\n } else if (i == 99999 || i == 499999 || i == 999999) {\\n Fmt.print(\\\"Radical for $,7d: $,7d\\\", i, Nums.prod(factors))\\n } else if (i == 1e6) {\\n System.print(\\\"\\\\nBreakdown of numbers of distinct prime factors\\\")\\n System.print(\\\"for positive integers from 1 to 1,000,000:\\\")\\n for (i in 1..7) {\\n Fmt.print(\\\" $d: $,8d\\\", i, counts[i])\\n }\\n Fmt.print(\\\" ---------\\\")\\n Fmt.print(\\\" $,8d\\\", Nums.sum(counts))\\n Fmt.print(\\\"\\\\nor graphically:\\\")\\n Nums.barChart(\\\"\\\", 50, Nums.toStrings(1..7), counts[1..-1])\\n }\\n}\\nvar pcount = Int.primeCount(1e6)\\nvar ppcount = 0\\nvar primes1k = Int.primeSieve(1000)\\nfor (p in primes1k) {\\n var p2 = p\\n while (true) {\\n p2 = p2 * p\\n if (p2 > 1e6) break\\n ppcount = ppcount + 1\\n }\\n}\\nFmt.print(\\\"\\\\nFor primes or powers (>1) thereof <= 1,000,000:\\\")\\nFmt.print(\\\" Number of primes = $,6d\\\", pcount)\\nFmt.print(\\\" Number of powers = $,6d\\\", ppcount)\\nFmt.print(\\\" Add 1 for number 1 = $,6d\\\", 1)\\nFmt.print(\\\" ------\\\")\\nFmt.print(\\\" $,6d\\\", pcount + ppcount + 1)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"include xpllib; \\\\for Print and IsPrime\\n\\nproc Radical(N); \\\\Return radical of N\\nint N, D, D0, P;\\n[D:= 2; D0:= 0; P:= 1;\\nwhile N >= D*D do\\n [while rem(N/D) = 0 do\\n [if D # D0 then\\n [P:= P*D;\\n D0:= D;\\n ];\\n N:= N/D;\\n ];\\n D:= D+1;\\n ];\\nif D # D0 then P:= P*N;\\nreturn P;\\n];\\n\\nfunc DistinctFactors(N); \\\\Return count of distinct factors of N\\nint N, D, D0, C;\\n[D:= 2; D0:= 0; C:= 0;\\nwhile N >= D*D do\\n [while rem(N/D) = 0 do\\n [if D # D0 then\\n [C:= C+1;\\n D0:= D;\\n ];\\n N:= N/D;\\n ];\\n D:= D+1;\\n ];\\nif D # D0 and N # 1 then C:= C+1;\\nreturn C;\\n];\\n\\nint N, C, A(10), PC, PPC, P2, P;\\n[Print(\\\"The radicals for the first 50 positive integers are:\\\\n\\\");\\nfor N:= 1 to 50 do\\n [Print(\\\"%4d\\\", Radical(N));\\n if rem(N/10) = 0 then CrLf(0);\\n ];\\nPrint(\\\"\\\\n\\\");\\nPrint(\\\"Radical for %6,d: %6,d\\\\n\\\", 99_999, Radical( 99_999));\\nPrint(\\\"Radical for %6,d: %6,d\\\\n\\\", 499_999, Radical(499_999));\\nPrint(\\\"Radical for %6,d: %6,d\\\\n\\\", 999_999, Radical(999_999));\\n\\nfor N:= 0 to 9 do A(N):= 0;\\nfor N:= 1 to 1_000_000 do\\n [C:= DistinctFactors(N);\\n A(C):= A(C)+1;\\n ];\\nPrint(\\\"\\\\nBreakdown of numbers of distinct prime factors\\nfor positive integers from 1 to 1,000,000:\\\\n\\\");\\nC:= 0;\\nfor N:= 0 to 9 do\\n [if A(N) > 0 then\\n Print(\\\" %d: %6,d\\\\n\\\", N, A(N));\\n C:= C + A(N);\\n ];\\nPrint(\\\" ---------\\\\n %,d\\\\n\\\", C);\\n\\n\\\\Bonus (algorithm from Wren):\\nPC:= 0;\\nfor N:= 1 to 1_000_000 do\\n if IsPrime(N) then PC:= PC+1;\\nPrint(\\\"\\\\nNumber of primes: %5,d\\\\n\\\", PC);\\nPPC:= 0;\\nfor P:= 1 to sqrt(1_000_000) do\\n [if IsPrime(P) then\\n [P2:= P;\\n loop [P2:= P2 * P;\\n if P2 > 1_000_000 then quit;\\n PPC:= PPC+1;\\n ];\\n ];\\n ];\\nPrint(\\\"Number of powers: %5,d\\\\n\\\", PPC);\\n if IsPrime(N) then PC:= PC+1;\\nPrint(\\\"Total : %5,d\\\\n\\\", PC+PPC);\\n]\\n\",\n \"language\": \"XPL0\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Radical-of-an-integer"}}},{"rowIdx":1553,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Ramanujan's_constant\n","language":"00-META"},{"code":"Calculate Ramanujan's constant (as described on the [http://oeis.org/wiki/Ramanujan%27s_constant OEIS site]) with at least\n32 digits of precision, by the method of your choice. Optionally, if using the 𝑒**(π*√''x'') approach,\nshow that when evaluated with the last four [https://en.wikipedia.org/wiki/Heegner_number Heegner numbers]\nthe result is ''almost'' an integer.\n\n","language":"00-TASK"},{"code":"#include <iomanip>\n#include <iostream>\n#include <boost/math/constants/constants.hpp>\n#include <boost/multiprecision/cpp_dec_float.hpp>\n\nusing big_float = boost::multiprecision::cpp_dec_float_100;\n\nbig_float f(unsigned int n) {\n big_float pi(boost::math::constants::pi<big_float>());\n return exp(sqrt(big_float(n)) * pi);\n}\n\nint main() {\n std::cout << \"Ramanujan's constant using formula f(N) = exp(pi*sqrt(N)):\\n\"\n << std::setprecision(80) << f(163) << '\\n';\n std::cout << \"\\nResult with last four Heegner numbers:\\n\";\n std::cout << std::setprecision(30);\n for (unsigned int n : {19, 43, 67, 163}) {\n auto x = f(n);\n auto c = ceil(x);\n auto pc = 100.0 * (x/c);\n std::cout << \"f(\" << n << \") = \" << x << \" = \"\n << pc << \"% of \" << c << '\\n';\n }\n return 0;\n}\n","language":"C++"},{"code":"package main\n\nimport (\n \"fmt\"\n \"github.com/ALTree/bigfloat\"\n \"math/big\"\n)\n\nconst (\n prec = 256 // say\n ps = \"3.1415926535897932384626433832795028841971693993751058209749445923078164\"\n)\n\nfunc q(d int64) *big.Float {\n pi, _ := new(big.Float).SetPrec(prec).SetString(ps)\n t := new(big.Float).SetPrec(prec).SetInt64(d)\n t.Sqrt(t)\n t.Mul(pi, t)\n return bigfloat.Exp(t)\n}\n\nfunc main() {\n fmt.Println(\"Ramanujan's constant to 32 decimal places is:\")\n fmt.Printf(\"%.32f\\n\", q(163))\n heegners := [4][2]int64{\n {19, 96},\n {43, 960},\n {67, 5280},\n {163, 640320},\n }\n fmt.Println(\"\\nHeegner numbers yielding 'almost' integers:\")\n t := new(big.Float).SetPrec(prec)\n for _, h := range heegners {\n qh := q(h[0])\n c := h[1]*h[1]*h[1] + 744\n t.SetInt64(c)\n t.Sub(t, qh)\n fmt.Printf(\"%3d: %51.32f ≈ %18d (diff: %.32f)\\n\", h[0], qh, c, t)\n }\n}\n","language":"Go"},{"code":"import Control.Monad (forM_)\nimport Data.Number.CReal (CReal, showCReal)\nimport Text.Printf (printf)\n\nramfun :: CReal -> CReal\nramfun x = exp (pi * sqrt x)\n\n-- Ramanujan's constant.\nramanujan :: CReal\nramanujan = ramfun 163\n\n-- The last four Heegner numbers.\nheegners :: [Int]\nheegners = [19, 43, 67, 163]\n\n-- The absolute distance to the nearest integer.\nintDist :: CReal -> CReal\nintDist x = abs (x - fromIntegral (round x))\n\nmain :: IO ()\nmain = do\n let n = 35\n printf \"Ramanujan's constant: %s\\n\\n\" (showCReal n ramanujan)\n printf \"%3s %34s%20s%s\\n\\n\" \" h \" \"e^(pi*sqrt(h))\" \"\" \" Dist. to integer\"\n forM_ heegners $ \\h ->\n let r = ramfun (fromIntegral h)\n d = intDist r\n in printf \"%3d %54s %s\\n\" h (showCReal n r) (showCReal 15 d)\n","language":"Haskell"},{"code":" NB. takes the constant beyond the repeat 9s.\n S=: cf_sqrt&163 Digits 34\n P=: pi Digits 34\n Y=: 1e_36 cf 1r8*P*S\n f=: exp&Y M. NB. memoize\n 59j40 \": 8 ^~ f Digits 34\n262537412640768743.9999999999992500711164316586918409066184\n NB. ^\n","language":"J"},{"code":"import java.math.BigDecimal;\nimport java.math.MathContext;\nimport java.util.Arrays;\nimport java.util.List;\n\npublic class RamanujanConstant {\n\n public static void main(String[] args) {\n System.out.printf(\"Ramanujan's Constant to 100 digits = %s%n%n\", ramanujanConstant(163, 100));\n System.out.printf(\"Heegner numbers yielding 'almost' integers:%n\");\n List<Integer> heegnerNumbers = Arrays.asList(19, 43, 67, 163);\n List<Integer> heegnerVals = Arrays.asList(96, 960, 5280, 640320);\n for ( int i = 0 ; i < heegnerNumbers.size() ; i++ ) {\n int heegnerNumber = heegnerNumbers.get(i);\n int heegnerVal = heegnerVals.get(i);\n BigDecimal integer = BigDecimal.valueOf(heegnerVal).pow(3).add(BigDecimal.valueOf(744));\n BigDecimal compute = ramanujanConstant(heegnerNumber, 50);\n System.out.printf(\"%3d : %50s ~ %18s (diff ~ %s)%n\", heegnerNumber, compute, integer, integer.subtract(compute, new MathContext(30)).toPlainString());\n }\n }\n\n public static BigDecimal ramanujanConstant(int sqrt, int digits) {\n // For accuracy on lat digit, computations with a few extra digits\n MathContext mc = new MathContext(digits + 5);\n return bigE(bigPi(mc).multiply(bigSquareRoot(BigDecimal.valueOf(sqrt), mc), mc), mc).round(new MathContext(digits));\n }\n\n // e = 1 + x/1! + x^2/2! + x^3/3! + ...\n public static BigDecimal bigE(BigDecimal exponent, MathContext mc) {\n BigDecimal e = BigDecimal.ONE;\n BigDecimal ak = e;\n int k = 0;\n BigDecimal min = BigDecimal.ONE.divide(BigDecimal.TEN.pow(mc.getPrecision()));\n while ( true ) {\n k++;\n ak = ak.multiply(exponent).divide(BigDecimal.valueOf(k), mc);\n e = e.add(ak, mc);\n if ( ak.compareTo(min) < 0 ) {\n break;\n }\n }\n return e;\n\n }\n\n // See : https://www.craig-wood.com/nick/articles/pi-chudnovsky/\n public static BigDecimal bigPi(MathContext mc) {\n int k = 0;\n BigDecimal ak = BigDecimal.ONE;\n BigDecimal a = ak;\n BigDecimal b = BigDecimal.ZERO;\n BigDecimal c = BigDecimal.valueOf(640320);\n BigDecimal c3 = c.pow(3);\n double digitePerTerm = Math.log10(c.pow(3).divide(BigDecimal.valueOf(24), mc).doubleValue()) - Math.log10(72);\n double digits = 0;\n while ( digits < mc.getPrecision() ) {\n k++;\n digits += digitePerTerm;\n BigDecimal top = BigDecimal.valueOf(-24).multiply(BigDecimal.valueOf(6*k-5)).multiply(BigDecimal.valueOf(2*k-1)).multiply(BigDecimal.valueOf(6*k-1));\n BigDecimal term = top.divide(BigDecimal.valueOf(k*k*k).multiply(c3), mc);\n ak = ak.multiply(term, mc);\n a = a.add(ak, mc);\n b = b.add(BigDecimal.valueOf(k).multiply(ak, mc), mc);\n }\n BigDecimal total = BigDecimal.valueOf(13591409).multiply(a, mc).add(BigDecimal.valueOf(545140134).multiply(b, mc), mc);\n return BigDecimal.valueOf(426880).multiply(bigSquareRoot(BigDecimal.valueOf(10005), mc), mc).divide(total, mc);\n }\n\n // See : https://en.wikipedia.org/wiki/Newton's_method#Square_root_of_a_number\n public static BigDecimal bigSquareRoot(BigDecimal squareDecimal, MathContext mc) {\n // Estimate\n double sqrt = Math.sqrt(squareDecimal.doubleValue());\n BigDecimal x0 = new BigDecimal(sqrt, mc);\n BigDecimal two = BigDecimal.valueOf(2);\n while ( true ) {\n BigDecimal x1 = x0.subtract(x0.multiply(x0, mc).subtract(squareDecimal).divide(two.multiply(x0, mc), mc), mc);\n String x1String = x1.toPlainString();\n String x0String = x0.toPlainString();\n if ( x1String.substring(0, x1String.length()-1).compareTo(x0String.substring(0, x0String.length()-1)) == 0 ) {\n break;\n }\n x0 = x1;\n }\n return x0;\n }\n\n}\n","language":"Java"},{"code":"julia> a = BigFloat(MathConstants.e^(BigFloat(pi)))^(BigFloat(163.0)^0.5)\n2.625374126407687439999999999992500725971981856888793538563373369908627075373427e+17\n\njulia> 262537412640768744 - a\n7.499274028018143111206461436626630091372924626572825942241598957614307213309258e-13\n","language":"Julia"},{"code":"First[RealDigits[N[Exp[Pi Sqrt[163]], 200]]]\nTable[\n c = N[Exp[Pi Sqrt[h]], 40];\n Log10[1 - FractionalPart[c]]\n ,\n {h, {19, 43, 67, 163}}\n]\n","language":"Mathematica"},{"code":"import strformat, strutils\nimport decimal\n\nsetPrec(75)\nlet pi = newDecimal(\"3.1415926535897932384626433832795028841971693993751058209749445923078164\")\n\nproc eval(n: int): DecimalType =\n result = exp(pi * sqrt(newDecimal(n)))\n\nfunc format(n: DecimalType; d: Positive): string =\n ## Return the representation of \"n\" with \"d\" digits of precision.\n let parts = ($n).split('.')\n result = parts[0] & '.' & parts[1][0..<d]\n\n\necho \"Ramanujan’s constant with 50 digits of precision:\"\necho eval(163).format(50)\n\nsetPrec(50)\necho()\necho \"Heegner numbers yielding 'almost' integers:\"\nfor n in [19, 43, 67, 163]:\n let x = eval(n)\n let k = x.roundToInt\n let d = x - k\n let s = if d > 0: \"+ \" & $d else: \"- \" & $(-d)\n echo &\"{n:3}: {x}... = {k:>18} {s}...\"\n","language":"Nim"},{"code":"\\p 50\nexp(Pi*sqrt(163))\n","language":"PARI-GP"},{"code":"use strict;\nuse warnings;\nuse Math::AnyNum;\n\nsub ramanujan_const {\n my ($x, $decimals) = @_;\n\n $x = Math::AnyNum->new($x);\n my $prec = (Math::AnyNum->pi * $x->sqrt)/log(10) + $decimals + 1;\n local $Math::AnyNum::PREC = 4*$prec->round->numify;\n\n exp(Math::AnyNum->pi * $x->sqrt)->round(-$decimals)->stringify;\n}\n\nmy $decimals = 100;\nprintf(\"Ramanujan's constant to $decimals decimals:\\n%s\\n\\n\",\n ramanujan_const(163, $decimals));\n\nprint \"Heegner numbers yielding 'almost' integers:\\n\";\nmy @tests = (19, 96, 43, 960, 67, 5280, 163, 640320);\n\nwhile (@tests) {\n my ($h, $x) = splice(@tests, 0, 2);\n my $c = ramanujan_const($h, 32);\n my $n = Math::AnyNum::ipow($x, 3) + 744;\n printf(\"%3s: %51s ≈ %18s (diff: %s)\\n\", $h, $c, $n, ($n - $c)->round(-32));\n}\n","language":"Perl"},{"code":"use strict;\nuse Math::AnyNum <as_dec rat>;\n\nsub continued_fr {\n my ($a, $b, $n) = (@_[0,1], $_[2] // 100);\n $a->() + ($n && $b->() / continued_fr($a, $b, $n-1));\n}\n\nmy $r163 = continued_fr do {my $n; sub {$n++ ? 2*12 : 12 }}, do {my $n; sub { rat 19 }}, 40;\nmy $pi = continued_fr do {my $n; sub {$n++ ? 1 + 2*($n-2) : 0 }}, do {my $n; sub { rat($n++ ? ($n>2 ? ($n-1)**2 : 1) : 4)}}, 140;\nmy $p = $pi * $r163;\nmy $R = 1 + $p / continued_fr do { my $n; sub { $n++ ? $p+($n+0) : 1 } }, do {my $n; sub { $n++; -1*$n*$p }}, 180;\n\nprintf \"Ramanujan's constant\\n%s\\n\", as_dec($R,58);\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">javascript_semantics</span> <span style=\"color: #000080;font-style:italic;\">-- no mpfr_exp() under p2js (yet), sorry</span>\n <span style=\"color: #7060A8;\">requires</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1.0.0\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (mpfr_set_default_prec[ision] has been renamed)</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #004080;\">mpfr</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #7060A8;\">mpfr_set_default_precision</span><span style=\"color: #0000FF;\">(-</span><span style=\"color: #000000;\">120</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (18 before, 100 after, plus 2 for kicks.)</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">mpfr</span> <span style=\"color: #000000;\">pi</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpfr_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">mpfr_const_pi</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pi</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">mpfr</span> <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpfr_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_sqrt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pi</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">mpfr_exp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">t</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Ramanujan's constant to 100 decimal places is:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">mpfr_get_fixed</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">163</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">100</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">heegners</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #000000;\">19</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">96</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">43</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">960</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">67</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5280</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">163</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">640320</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\nHeegner numbers yielding 'almost' integers:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">mpfr</span> <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpfr_init</span><span style=\"color: #0000FF;\">(),</span> <span style=\"color: #000000;\">qh</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">heegners</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">h0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">h1</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">heegners</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">qh</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">h0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_ui_pow_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">h1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_add_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">744</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_set_z</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpfr_sub</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">qh</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">qhs</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpfr_get_fixed</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">qh</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">cs</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_get_str</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">ts</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpfr_get_fixed</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%3d: %51s ~= %18s (diff: %s)\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">h0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">qhs</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">cs</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ts</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"from mpmath import mp\nheegner = [19,43,67,163]\nmp.dps = 50\nx = mp.exp(mp.pi*mp.sqrt(163))\nprint(\"calculated Ramanujan's constant: {}\".format(x))\nprint(\"Heegner numbers yielding 'almost' integers:\")\nfor i in heegner:\n print(\" for {}: {} ~ {} error: {}\".format(str(i),mp.exp(mp.pi*mp.sqrt(i)),round(mp.exp(mp.pi*mp.sqrt(i))),(mp.pi*mp.sqrt(i)) - round(mp.pi*mp.sqrt(i))))\n","language":"Python"},{"code":"use Rat::Precise;\n\n# set the degree of precision for calculations\nconstant D = 54;\nconstant d = 15;\n\n# two versions of exponentiation where base and exponent are both FatRat\nmulti infix:<**> (FatRat $base, FatRat $exp where * >= 1 --> FatRat) {\n 2 R** $base**($exp/2);\n}\n\nmulti infix:<**> (FatRat $base, FatRat $exp where * < 1 --> FatRat) {\n constant ε = 10**-D;\n my $low = 0.FatRat;\n my $high = 1.FatRat;\n my $mid = $high / 2;\n my $acc = my $sqr = sqrt($base);\n\n while (abs($mid - $exp) > ε) {\n $sqr = sqrt($sqr);\n if ($mid <= $exp) { $low = $mid; $acc ×= $sqr }\n else { $high = $mid; $acc ××= 1/$sqr }\n $mid = ($low + $high) / 2;\n }\n $acc.substr(0, D).FatRat;\n}\n\n# calculation of π\nsub π (--> FatRat) {\n my ($a, $n) = 1, 1;\n my $g = sqrt 1/2.FatRat;\n my $z = .25;\n my $pi;\n\n for ^d {\n given [ ($a + $g)/2, sqrt $a × $g ] {\n $z -= (.[0] - $a)**2 × $n;\n $n += $n;\n ($a, $g) = @$_;\n $pi = ($a ** 2 / $z).substr: 0, 2 + D;\n }\n }\n $pi.FatRat;\n}\n\nmulti sqrt(FatRat $r --> FatRat) {\n FatRat.new: sqrt($r.nude[0] × 10**(D×2) div $r.nude[1]), 10**D;\n}\n\n# integer roots\nmulti sqrt(Int $n) {\n my $guess = 10**($n.chars div 2);\n my $iterator = { ( $^x + $n div ($^x) ) div 2 };\n my $endpoint = { $^x == $^y|$^z };\n min ($guess, $iterator … $endpoint)[*-1, *-2];\n}\n\n# 'cosmetic' cover to upgrade input to FatRat sqrt\nsub prefix:<√> (Int $n) { sqrt($n.FatRat) }\n\n# calculation of 𝑒\nsub postfix:<!> (Int $n) { (constant f = 1, |[\\×] 1..*)[$n] }\nsub 𝑒 (--> FatRat) { sum map { FatRat.new(1,.!) }, ^D }\n\n# inputs, and their difference, formatted decimal-aligned\nsub format ($a,$b) {\n sub pad ($s) { ' ' x ((34 - d - 1) - ($s.split(/\\./)[0]).chars) }\n my $c = $b.precise(d, :z);\n my $d = ($a-$b).precise(d, :z);\n join \"\\n\",\n (sprintf \"%11s {pad($a)}%s\\n\", 'Int', $a) ~\n (sprintf \"%11s {pad($c)}%s\\n\", 'Heegner', $c) ~\n (sprintf \"%11s {pad($d)}%s\\n\", 'Difference', $d)\n}\n\n# override built-in definitions\nconstant π = &π();\nconstant 𝑒 = &𝑒();\n\nmy $Ramanujan = 𝑒**(π × √163);\nsay \"Ramanujan's constant to 32 decimal places:\\nActual: \" ~\n \"262537412640768743.99999999999925007259719818568888\\n\" ~\n \"Calculated: \", $Ramanujan.precise(32, :z), \"\\n\";\n\nsay \"Heegner numbers yielding 'almost' integers\";\nfor 19, 96, 43, 960, 67, 5280, 163, 640320 -> $heegner, $x {\n my $almost = 𝑒**(π × √$heegner);\n my $exact = $x³ + 744;\n say format($exact, $almost);\n}\n","language":"Raku"},{"code":"use Rat::Precise;\n\nsub continued-fraction($n, :@a, :@b) {\n my $x = @a[0].FatRat;\n $x = @a[$_ - 1] + @b[$_] / $x for reverse 1 ..^ $n;\n $x;\n}\n\n#`{ √163 } my $r163 = continued-fraction( 50, :a(12,|((2*12) xx *)), :b(19 xx *));\n#`{ π } my $pi = 4*continued-fraction(140, :a( 0,|(1, 3 ... *)), :b(4, 1, |((1, 2, 3 ... *) X** 2)));\n#`{ e**x } my $R = 1 + ($_ / continued-fraction(170, :a( 1,|(2+$_, 3+$_ ... *)), :b(Nil, |(-1*$_, -2*$_ ... *) ))) given $r163*$pi;\n\nsay \"Ramanujan's constant to 32 decimal places:\\n\", $R.precise(32);\n","language":"Raku"},{"code":"/*REXX pgm displays Ramanujan's constant to at least 100 decimal digits of precision. */\nd= min( length(pi()), length(e()) ) - length(.) /*calculate max #decimal digs supported*/\nparse arg digs sDigs . 1 . . $ /*obtain optional arguments from the CL*/\nif digs=='' | digs==\",\" then digs= d /*Not specified? Then use the default.*/\nif sDigs=='' | sDigs==\",\" then sDigs= d % 2 /* \" \" \" \" \" \" */\nif $='' | $=\",\" then $= 19 43 67 163 /* \" \" \" \" \" \" */\n digs= min( digs, d) /*the minimum decimal digs for calc. */\nsDigs= min(sDigs, d) /* \" \" \" \" display.*/\nnumeric digits digs /*inform REXX how many dec digs to use.*/\nsay \"The value of Ramanujan's constant calculated with \" d ' decimal digits of precision.'\nsay \"shown with \" sDigs ' decimal digits past the decimal point:'\nsay\n do j=1 for words($); #= word($, j) /*process each of the Heegner numbers. */\n say 'When using the Heegner number: ' # /*display which Heegner # is being used*/\n z= exp(pi * sqrt(#) ) /*perform some heavy lifting here. */\n say format(z, 25, sDigs); say /*display a limited amount of dec digs.*/\n end /*j*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\npi: pi= 3.1415926535897932384626433832795028841971693993751058209749445923078164062862,\n || 089986280348253421170679821480865132823066470938446095505822317253594081284,\n || 8111745028410270193852110555964462294895493038196; return pi\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ne: e = 2.7182818284590452353602874713526624977572470936999595749669676277240766303535,\n || 475945713821785251664274274663919320030599218174135966290435729003342952605,\n || 9563073813232862794349076323382988075319525101901; return e\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nexp: procedure; parse arg x; ix= x%1; if abs(x-ix)>.5 then ix= ix + sign(x); x= x-ix\n z=1; _=1; w=z; do j=1; _= _*x/j; z=(z+_)/1; if z==w then leave; w=z; end\n if z\\==0 then z= z * e() ** ix; return z/1\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nsqrt: procedure; parse arg x; if x=0 then return 0; d=digits(); h=d+6; numeric digits\n numeric form; m.=9; parse value format(x,2,1,,0) 'E0' with g 'E' _ .; g=g*.5'e'_%2\n do j=0 while h>9; m.j=h; h=h % 2 + 1; end /*j*/\n do k=j+5 to 0 by -1; numeric digits m.k; g=(g+x/g) * .5; end /*k*/; return g\n","language":"REXX"},{"code":"require \"bigdecimal/math\"\ninclude BigMath\n\ne, pi = E(200), PI(200)\n[19, 43, 67, 163].each do |x|\n puts \"#{x}: #{(e ** (pi * BigMath.sqrt(BigDecimal(x), 200))).round(100).to_s(\"F\")}\"\nend\n","language":"Ruby"},{"code":"func ramanujan_const(x, decimals=32) {\n local Num!PREC = *\"#{4*round((Num.pi*√x)/log(10) + decimals + 1)}\"\n exp(Num.pi * √x) -> round(-decimals).to_s\n}\n\nvar decimals = 100\nprintf(\"Ramanujan's constant to #{decimals} decimals:\\n%s\\n\\n\",\n ramanujan_const(163, decimals))\n\nsay \"Heegner numbers yielding 'almost' integers:\"\n[19, 96, 43, 960, 67, 5280, 163, 640320].each_slice(2, {|h,x|\n var c = ramanujan_const(h, 32)\n var n = (x**3 + 744)\n printf(\"%3s: %51s ≈ %18s (diff: %s)\\n\", h, c, n, n-Num(c))\n})\n","language":"Sidef"},{"code":"import \"./big\" for BigRat\nimport \"./fmt\" for Fmt\n\nvar pi = \"3.1415926535897932384626433832795028841971693993751058209749445923078164\"\nvar bigPi = BigRat.fromDecimal(pi)\n\nvar exp = Fn.new { |x, p|\n var sum = x + 1\n var prevTerm = x\n var k = 2\n var eps = BigRat.fromDecimal(\"0.5e-%(p)\")\n while (true) {\n var nextTerm = prevTerm * x / k\n sum = sum + nextTerm\n if (nextTerm < eps) break\n // speed up calculations by limiting precision to 'p' places\n prevTerm = BigRat.fromDecimal(nextTerm.toDecimal(p))\n k = k + 1\n }\n return sum\n}\n\nvar ramanujan = Fn.new { |n, dp|\n var e = bigPi * BigRat.new(n, 1).sqrt(70)\n return exp.call(e, 70)\n}\n\nSystem.print(\"Ramanujan's constant to 32 decimal places is:\")\nSystem.print(ramanujan.call(163, 32).toDecimal(32))\nvar heegner = [19, 43, 67, 163]\nSystem.print(\"\\nHeegner numbers yielding almost integers:\")\nfor (h in heegner) {\n var r = ramanujan.call(h, 32)\n var rc = r.ceil\n var diff = (rc - r).toDecimal(32)\n r = r.toDecimal(32)\n rc = rc.toDecimal(32)\n Fmt.print(\"$3d: $51s ≈ $18s (diff: $s)\", h, r, rc, diff)\n}\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Ramanujan's_constant\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Calculate Ramanujan's constant (as described on the [http://oeis.org/wiki/Ramanujan%27s_constant OEIS site]) with at least\\n32 digits of precision, by the method of your choice. Optionally, if using the 𝑒**(π*√''x'') approach,\\nshow that when evaluated with the last four [https://en.wikipedia.org/wiki/Heegner_number Heegner numbers]\\nthe result is ''almost'' an integer.\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"#include <iomanip>\\n#include <iostream>\\n#include <boost/math/constants/constants.hpp>\\n#include <boost/multiprecision/cpp_dec_float.hpp>\\n\\nusing big_float = boost::multiprecision::cpp_dec_float_100;\\n\\nbig_float f(unsigned int n) {\\n big_float pi(boost::math::constants::pi<big_float>());\\n return exp(sqrt(big_float(n)) * pi);\\n}\\n\\nint main() {\\n std::cout << \\\"Ramanujan's constant using formula f(N) = exp(pi*sqrt(N)):\\\\n\\\"\\n << std::setprecision(80) << f(163) << '\\\\n';\\n std::cout << \\\"\\\\nResult with last four Heegner numbers:\\\\n\\\";\\n std::cout << std::setprecision(30);\\n for (unsigned int n : {19, 43, 67, 163}) {\\n auto x = f(n);\\n auto c = ceil(x);\\n auto pc = 100.0 * (x/c);\\n std::cout << \\\"f(\\\" << n << \\\") = \\\" << x << \\\" = \\\"\\n << pc << \\\"% of \\\" << c << '\\\\n';\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"github.com/ALTree/bigfloat\\\"\\n \\\"math/big\\\"\\n)\\n\\nconst (\\n prec = 256 // say\\n ps = \\\"3.1415926535897932384626433832795028841971693993751058209749445923078164\\\"\\n)\\n\\nfunc q(d int64) *big.Float {\\n pi, _ := new(big.Float).SetPrec(prec).SetString(ps)\\n t := new(big.Float).SetPrec(prec).SetInt64(d)\\n t.Sqrt(t)\\n t.Mul(pi, t)\\n return bigfloat.Exp(t)\\n}\\n\\nfunc main() {\\n fmt.Println(\\\"Ramanujan's constant to 32 decimal places is:\\\")\\n fmt.Printf(\\\"%.32f\\\\n\\\", q(163))\\n heegners := [4][2]int64{\\n {19, 96},\\n {43, 960},\\n {67, 5280},\\n {163, 640320},\\n }\\n fmt.Println(\\\"\\\\nHeegner numbers yielding 'almost' integers:\\\")\\n t := new(big.Float).SetPrec(prec)\\n for _, h := range heegners {\\n qh := q(h[0])\\n c := h[1]*h[1]*h[1] + 744\\n t.SetInt64(c)\\n t.Sub(t, qh)\\n fmt.Printf(\\\"%3d: %51.32f ≈ %18d (diff: %.32f)\\\\n\\\", h[0], qh, c, t)\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Control.Monad (forM_)\\nimport Data.Number.CReal (CReal, showCReal)\\nimport Text.Printf (printf)\\n\\nramfun :: CReal -> CReal\\nramfun x = exp (pi * sqrt x)\\n\\n-- Ramanujan's constant.\\nramanujan :: CReal\\nramanujan = ramfun 163\\n\\n-- The last four Heegner numbers.\\nheegners :: [Int]\\nheegners = [19, 43, 67, 163]\\n\\n-- The absolute distance to the nearest integer.\\nintDist :: CReal -> CReal\\nintDist x = abs (x - fromIntegral (round x))\\n\\nmain :: IO ()\\nmain = do\\n let n = 35\\n printf \\\"Ramanujan's constant: %s\\\\n\\\\n\\\" (showCReal n ramanujan)\\n printf \\\"%3s %34s%20s%s\\\\n\\\\n\\\" \\\" h \\\" \\\"e^(pi*sqrt(h))\\\" \\\"\\\" \\\" Dist. to integer\\\"\\n forM_ heegners $ \\\\h ->\\n let r = ramfun (fromIntegral h)\\n d = intDist r\\n in printf \\\"%3d %54s %s\\\\n\\\" h (showCReal n r) (showCReal 15 d)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" NB. takes the constant beyond the repeat 9s.\\n S=: cf_sqrt&163 Digits 34\\n P=: pi Digits 34\\n Y=: 1e_36 cf 1r8*P*S\\n f=: exp&Y M. NB. memoize\\n 59j40 \\\": 8 ^~ f Digits 34\\n262537412640768743.9999999999992500711164316586918409066184\\n NB. ^\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.math.BigDecimal;\\nimport java.math.MathContext;\\nimport java.util.Arrays;\\nimport java.util.List;\\n\\npublic class RamanujanConstant {\\n\\n public static void main(String[] args) {\\n System.out.printf(\\\"Ramanujan's Constant to 100 digits = %s%n%n\\\", ramanujanConstant(163, 100));\\n System.out.printf(\\\"Heegner numbers yielding 'almost' integers:%n\\\");\\n List<Integer> heegnerNumbers = Arrays.asList(19, 43, 67, 163);\\n List<Integer> heegnerVals = Arrays.asList(96, 960, 5280, 640320);\\n for ( int i = 0 ; i < heegnerNumbers.size() ; i++ ) {\\n int heegnerNumber = heegnerNumbers.get(i);\\n int heegnerVal = heegnerVals.get(i);\\n BigDecimal integer = BigDecimal.valueOf(heegnerVal).pow(3).add(BigDecimal.valueOf(744));\\n BigDecimal compute = ramanujanConstant(heegnerNumber, 50);\\n System.out.printf(\\\"%3d : %50s ~ %18s (diff ~ %s)%n\\\", heegnerNumber, compute, integer, integer.subtract(compute, new MathContext(30)).toPlainString());\\n }\\n }\\n\\n public static BigDecimal ramanujanConstant(int sqrt, int digits) {\\n // For accuracy on lat digit, computations with a few extra digits\\n MathContext mc = new MathContext(digits + 5);\\n return bigE(bigPi(mc).multiply(bigSquareRoot(BigDecimal.valueOf(sqrt), mc), mc), mc).round(new MathContext(digits));\\n }\\n\\n // e = 1 + x/1! + x^2/2! + x^3/3! + ...\\n public static BigDecimal bigE(BigDecimal exponent, MathContext mc) {\\n BigDecimal e = BigDecimal.ONE;\\n BigDecimal ak = e;\\n int k = 0;\\n BigDecimal min = BigDecimal.ONE.divide(BigDecimal.TEN.pow(mc.getPrecision()));\\n while ( true ) {\\n k++;\\n ak = ak.multiply(exponent).divide(BigDecimal.valueOf(k), mc);\\n e = e.add(ak, mc);\\n if ( ak.compareTo(min) < 0 ) {\\n break;\\n }\\n }\\n return e;\\n\\n }\\n\\n // See : https://www.craig-wood.com/nick/articles/pi-chudnovsky/\\n public static BigDecimal bigPi(MathContext mc) {\\n int k = 0;\\n BigDecimal ak = BigDecimal.ONE;\\n BigDecimal a = ak;\\n BigDecimal b = BigDecimal.ZERO;\\n BigDecimal c = BigDecimal.valueOf(640320);\\n BigDecimal c3 = c.pow(3);\\n double digitePerTerm = Math.log10(c.pow(3).divide(BigDecimal.valueOf(24), mc).doubleValue()) - Math.log10(72);\\n double digits = 0;\\n while ( digits < mc.getPrecision() ) {\\n k++;\\n digits += digitePerTerm;\\n BigDecimal top = BigDecimal.valueOf(-24).multiply(BigDecimal.valueOf(6*k-5)).multiply(BigDecimal.valueOf(2*k-1)).multiply(BigDecimal.valueOf(6*k-1));\\n BigDecimal term = top.divide(BigDecimal.valueOf(k*k*k).multiply(c3), mc);\\n ak = ak.multiply(term, mc);\\n a = a.add(ak, mc);\\n b = b.add(BigDecimal.valueOf(k).multiply(ak, mc), mc);\\n }\\n BigDecimal total = BigDecimal.valueOf(13591409).multiply(a, mc).add(BigDecimal.valueOf(545140134).multiply(b, mc), mc);\\n return BigDecimal.valueOf(426880).multiply(bigSquareRoot(BigDecimal.valueOf(10005), mc), mc).divide(total, mc);\\n }\\n\\n // See : https://en.wikipedia.org/wiki/Newton's_method#Square_root_of_a_number\\n public static BigDecimal bigSquareRoot(BigDecimal squareDecimal, MathContext mc) {\\n // Estimate\\n double sqrt = Math.sqrt(squareDecimal.doubleValue());\\n BigDecimal x0 = new BigDecimal(sqrt, mc);\\n BigDecimal two = BigDecimal.valueOf(2);\\n while ( true ) {\\n BigDecimal x1 = x0.subtract(x0.multiply(x0, mc).subtract(squareDecimal).divide(two.multiply(x0, mc), mc), mc);\\n String x1String = x1.toPlainString();\\n String x0String = x0.toPlainString();\\n if ( x1String.substring(0, x1String.length()-1).compareTo(x0String.substring(0, x0String.length()-1)) == 0 ) {\\n break;\\n }\\n x0 = x1;\\n }\\n return x0;\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"julia> a = BigFloat(MathConstants.e^(BigFloat(pi)))^(BigFloat(163.0)^0.5)\\n2.625374126407687439999999999992500725971981856888793538563373369908627075373427e+17\\n\\njulia> 262537412640768744 - a\\n7.499274028018143111206461436626630091372924626572825942241598957614307213309258e-13\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"First[RealDigits[N[Exp[Pi Sqrt[163]], 200]]]\\nTable[\\n c = N[Exp[Pi Sqrt[h]], 40];\\n Log10[1 - FractionalPart[c]]\\n ,\\n {h, {19, 43, 67, 163}}\\n]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import strformat, strutils\\nimport decimal\\n\\nsetPrec(75)\\nlet pi = newDecimal(\\\"3.1415926535897932384626433832795028841971693993751058209749445923078164\\\")\\n\\nproc eval(n: int): DecimalType =\\n result = exp(pi * sqrt(newDecimal(n)))\\n\\nfunc format(n: DecimalType; d: Positive): string =\\n ## Return the representation of \\\"n\\\" with \\\"d\\\" digits of precision.\\n let parts = ($n).split('.')\\n result = parts[0] & '.' & parts[1][0..<d]\\n\\n\\necho \\\"Ramanujan’s constant with 50 digits of precision:\\\"\\necho eval(163).format(50)\\n\\nsetPrec(50)\\necho()\\necho \\\"Heegner numbers yielding 'almost' integers:\\\"\\nfor n in [19, 43, 67, 163]:\\n let x = eval(n)\\n let k = x.roundToInt\\n let d = x - k\\n let s = if d > 0: \\\"+ \\\" & $d else: \\\"- \\\" & $(-d)\\n echo &\\\"{n:3}: {x}... = {k:>18} {s}...\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"\\\\p 50\\nexp(Pi*sqrt(163))\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse Math::AnyNum;\\n\\nsub ramanujan_const {\\n my ($x, $decimals) = @_;\\n\\n $x = Math::AnyNum->new($x);\\n my $prec = (Math::AnyNum->pi * $x->sqrt)/log(10) + $decimals + 1;\\n local $Math::AnyNum::PREC = 4*$prec->round->numify;\\n\\n exp(Math::AnyNum->pi * $x->sqrt)->round(-$decimals)->stringify;\\n}\\n\\nmy $decimals = 100;\\nprintf(\\\"Ramanujan's constant to $decimals decimals:\\\\n%s\\\\n\\\\n\\\",\\n ramanujan_const(163, $decimals));\\n\\nprint \\\"Heegner numbers yielding 'almost' integers:\\\\n\\\";\\nmy @tests = (19, 96, 43, 960, 67, 5280, 163, 640320);\\n\\nwhile (@tests) {\\n my ($h, $x) = splice(@tests, 0, 2);\\n my $c = ramanujan_const($h, 32);\\n my $n = Math::AnyNum::ipow($x, 3) + 744;\\n printf(\\\"%3s: %51s ≈ %18s (diff: %s)\\\\n\\\", $h, $c, $n, ($n - $c)->round(-32));\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use strict;\\nuse Math::AnyNum <as_dec rat>;\\n\\nsub continued_fr {\\n my ($a, $b, $n) = (@_[0,1], $_[2] // 100);\\n $a->() + ($n && $b->() / continued_fr($a, $b, $n-1));\\n}\\n\\nmy $r163 = continued_fr do {my $n; sub {$n++ ? 2*12 : 12 }}, do {my $n; sub { rat 19 }}, 40;\\nmy $pi = continued_fr do {my $n; sub {$n++ ? 1 + 2*($n-2) : 0 }}, do {my $n; sub { rat($n++ ? ($n>2 ? ($n-1)**2 : 1) : 4)}}, 140;\\nmy $p = $pi * $r163;\\nmy $R = 1 + $p / continued_fr do { my $n; sub { $n++ ? $p+($n+0) : 1 } }, do {my $n; sub { $n++; -1*$n*$p }}, 180;\\n\\nprintf \\\"Ramanujan's constant\\\\n%s\\\\n\\\", as_dec($R,58);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- no mpfr_exp() under p2js (yet), sorry</span>\\n <span style=\\\"color: #7060A8;\\\">requires</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1.0.0\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (mpfr_set_default_prec[ision] has been renamed)</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #004080;\\\">mpfr</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_set_default_precision</span><span style=\\\"color: #0000FF;\\\">(-</span><span style=\\\"color: #000000;\\\">120</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (18 before, 100 after, plus 2 for kicks.)</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">mpfr</span> <span style=\\\"color: #000000;\\\">pi</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpfr_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_const_pi</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pi</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">mpfr</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpfr_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_sqrt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pi</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">mpfr_exp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">t</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Ramanujan's constant to 100 decimal places is:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">mpfr_get_fixed</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">163</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">100</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">heegners</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #000000;\\\">19</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">96</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">43</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">960</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">67</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5280</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">163</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">640320</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\nHeegner numbers yielding 'almost' integers:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">mpfr</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpfr_init</span><span style=\\\"color: #0000FF;\\\">(),</span> <span style=\\\"color: #000000;\\\">qh</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">heegners</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">h0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">h1</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">heegners</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">qh</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">h0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_ui_pow_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">h1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">744</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_set_z</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpfr_sub</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">qh</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">qhs</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpfr_get_fixed</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">qh</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">cs</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_get_str</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">ts</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpfr_get_fixed</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%3d: %51s ~= %18s (diff: %s)\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">h0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">qhs</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">cs</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ts</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"from mpmath import mp\\nheegner = [19,43,67,163]\\nmp.dps = 50\\nx = mp.exp(mp.pi*mp.sqrt(163))\\nprint(\\\"calculated Ramanujan's constant: {}\\\".format(x))\\nprint(\\\"Heegner numbers yielding 'almost' integers:\\\")\\nfor i in heegner:\\n print(\\\" for {}: {} ~ {} error: {}\\\".format(str(i),mp.exp(mp.pi*mp.sqrt(i)),round(mp.exp(mp.pi*mp.sqrt(i))),(mp.pi*mp.sqrt(i)) - round(mp.pi*mp.sqrt(i))))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"use Rat::Precise;\\n\\n# set the degree of precision for calculations\\nconstant D = 54;\\nconstant d = 15;\\n\\n# two versions of exponentiation where base and exponent are both FatRat\\nmulti infix:<**> (FatRat $base, FatRat $exp where * >= 1 --> FatRat) {\\n 2 R** $base**($exp/2);\\n}\\n\\nmulti infix:<**> (FatRat $base, FatRat $exp where * < 1 --> FatRat) {\\n constant ε = 10**-D;\\n my $low = 0.FatRat;\\n my $high = 1.FatRat;\\n my $mid = $high / 2;\\n my $acc = my $sqr = sqrt($base);\\n\\n while (abs($mid - $exp) > ε) {\\n $sqr = sqrt($sqr);\\n if ($mid <= $exp) { $low = $mid; $acc ×= $sqr }\\n else { $high = $mid; $acc ××= 1/$sqr }\\n $mid = ($low + $high) / 2;\\n }\\n $acc.substr(0, D).FatRat;\\n}\\n\\n# calculation of π\\nsub π (--> FatRat) {\\n my ($a, $n) = 1, 1;\\n my $g = sqrt 1/2.FatRat;\\n my $z = .25;\\n my $pi;\\n\\n for ^d {\\n given [ ($a + $g)/2, sqrt $a × $g ] {\\n $z -= (.[0] - $a)**2 × $n;\\n $n += $n;\\n ($a, $g) = @$_;\\n $pi = ($a ** 2 / $z).substr: 0, 2 + D;\\n }\\n }\\n $pi.FatRat;\\n}\\n\\nmulti sqrt(FatRat $r --> FatRat) {\\n FatRat.new: sqrt($r.nude[0] × 10**(D×2) div $r.nude[1]), 10**D;\\n}\\n\\n# integer roots\\nmulti sqrt(Int $n) {\\n my $guess = 10**($n.chars div 2);\\n my $iterator = { ( $^x + $n div ($^x) ) div 2 };\\n my $endpoint = { $^x == $^y|$^z };\\n min ($guess, $iterator … $endpoint)[*-1, *-2];\\n}\\n\\n# 'cosmetic' cover to upgrade input to FatRat sqrt\\nsub prefix:<√> (Int $n) { sqrt($n.FatRat) }\\n\\n# calculation of 𝑒\\nsub postfix:<!> (Int $n) { (constant f = 1, |[\\\\×] 1..*)[$n] }\\nsub 𝑒 (--> FatRat) { sum map { FatRat.new(1,.!) }, ^D }\\n\\n# inputs, and their difference, formatted decimal-aligned\\nsub format ($a,$b) {\\n sub pad ($s) { ' ' x ((34 - d - 1) - ($s.split(/\\\\./)[0]).chars) }\\n my $c = $b.precise(d, :z);\\n my $d = ($a-$b).precise(d, :z);\\n join \\\"\\\\n\\\",\\n (sprintf \\\"%11s {pad($a)}%s\\\\n\\\", 'Int', $a) ~\\n (sprintf \\\"%11s {pad($c)}%s\\\\n\\\", 'Heegner', $c) ~\\n (sprintf \\\"%11s {pad($d)}%s\\\\n\\\", 'Difference', $d)\\n}\\n\\n# override built-in definitions\\nconstant π = &π();\\nconstant 𝑒 = &𝑒();\\n\\nmy $Ramanujan = 𝑒**(π × √163);\\nsay \\\"Ramanujan's constant to 32 decimal places:\\\\nActual: \\\" ~\\n \\\"262537412640768743.99999999999925007259719818568888\\\\n\\\" ~\\n \\\"Calculated: \\\", $Ramanujan.precise(32, :z), \\\"\\\\n\\\";\\n\\nsay \\\"Heegner numbers yielding 'almost' integers\\\";\\nfor 19, 96, 43, 960, 67, 5280, 163, 640320 -> $heegner, $x {\\n my $almost = 𝑒**(π × √$heegner);\\n my $exact = $x³ + 744;\\n say format($exact, $almost);\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"use Rat::Precise;\\n\\nsub continued-fraction($n, :@a, :@b) {\\n my $x = @a[0].FatRat;\\n $x = @a[$_ - 1] + @b[$_] / $x for reverse 1 ..^ $n;\\n $x;\\n}\\n\\n#`{ √163 } my $r163 = continued-fraction( 50, :a(12,|((2*12) xx *)), :b(19 xx *));\\n#`{ π } my $pi = 4*continued-fraction(140, :a( 0,|(1, 3 ... *)), :b(4, 1, |((1, 2, 3 ... *) X** 2)));\\n#`{ e**x } my $R = 1 + ($_ / continued-fraction(170, :a( 1,|(2+$_, 3+$_ ... *)), :b(Nil, |(-1*$_, -2*$_ ... *) ))) given $r163*$pi;\\n\\nsay \\\"Ramanujan's constant to 32 decimal places:\\\\n\\\", $R.precise(32);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm displays Ramanujan's constant to at least 100 decimal digits of precision. */\\nd= min( length(pi()), length(e()) ) - length(.) /*calculate max #decimal digs supported*/\\nparse arg digs sDigs . 1 . . $ /*obtain optional arguments from the CL*/\\nif digs=='' | digs==\\\",\\\" then digs= d /*Not specified? Then use the default.*/\\nif sDigs=='' | sDigs==\\\",\\\" then sDigs= d % 2 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif $='' | $=\\\",\\\" then $= 19 43 67 163 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n digs= min( digs, d) /*the minimum decimal digs for calc. */\\nsDigs= min(sDigs, d) /* \\\" \\\" \\\" \\\" display.*/\\nnumeric digits digs /*inform REXX how many dec digs to use.*/\\nsay \\\"The value of Ramanujan's constant calculated with \\\" d ' decimal digits of precision.'\\nsay \\\"shown with \\\" sDigs ' decimal digits past the decimal point:'\\nsay\\n do j=1 for words($); #= word($, j) /*process each of the Heegner numbers. */\\n say 'When using the Heegner number: ' # /*display which Heegner # is being used*/\\n z= exp(pi * sqrt(#) ) /*perform some heavy lifting here. */\\n say format(z, 25, sDigs); say /*display a limited amount of dec digs.*/\\n end /*j*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\npi: pi= 3.1415926535897932384626433832795028841971693993751058209749445923078164062862,\\n || 089986280348253421170679821480865132823066470938446095505822317253594081284,\\n || 8111745028410270193852110555964462294895493038196; return pi\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ne: e = 2.7182818284590452353602874713526624977572470936999595749669676277240766303535,\\n || 475945713821785251664274274663919320030599218174135966290435729003342952605,\\n || 9563073813232862794349076323382988075319525101901; return e\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nexp: procedure; parse arg x; ix= x%1; if abs(x-ix)>.5 then ix= ix + sign(x); x= x-ix\\n z=1; _=1; w=z; do j=1; _= _*x/j; z=(z+_)/1; if z==w then leave; w=z; end\\n if z\\\\==0 then z= z * e() ** ix; return z/1\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nsqrt: procedure; parse arg x; if x=0 then return 0; d=digits(); h=d+6; numeric digits\\n numeric form; m.=9; parse value format(x,2,1,,0) 'E0' with g 'E' _ .; g=g*.5'e'_%2\\n do j=0 while h>9; m.j=h; h=h % 2 + 1; end /*j*/\\n do k=j+5 to 0 by -1; numeric digits m.k; g=(g+x/g) * .5; end /*k*/; return g\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"require \\\"bigdecimal/math\\\"\\ninclude BigMath\\n\\ne, pi = E(200), PI(200)\\n[19, 43, 67, 163].each do |x|\\n puts \\\"#{x}: #{(e ** (pi * BigMath.sqrt(BigDecimal(x), 200))).round(100).to_s(\\\"F\\\")}\\\"\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"func ramanujan_const(x, decimals=32) {\\n local Num!PREC = *\\\"#{4*round((Num.pi*√x)/log(10) + decimals + 1)}\\\"\\n exp(Num.pi * √x) -> round(-decimals).to_s\\n}\\n\\nvar decimals = 100\\nprintf(\\\"Ramanujan's constant to #{decimals} decimals:\\\\n%s\\\\n\\\\n\\\",\\n ramanujan_const(163, decimals))\\n\\nsay \\\"Heegner numbers yielding 'almost' integers:\\\"\\n[19, 96, 43, 960, 67, 5280, 163, 640320].each_slice(2, {|h,x|\\n var c = ramanujan_const(h, 32)\\n var n = (x**3 + 744)\\n printf(\\\"%3s: %51s ≈ %18s (diff: %s)\\\\n\\\", h, c, n, n-Num(c))\\n})\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"import \\\"./big\\\" for BigRat\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar pi = \\\"3.1415926535897932384626433832795028841971693993751058209749445923078164\\\"\\nvar bigPi = BigRat.fromDecimal(pi)\\n\\nvar exp = Fn.new { |x, p|\\n var sum = x + 1\\n var prevTerm = x\\n var k = 2\\n var eps = BigRat.fromDecimal(\\\"0.5e-%(p)\\\")\\n while (true) {\\n var nextTerm = prevTerm * x / k\\n sum = sum + nextTerm\\n if (nextTerm < eps) break\\n // speed up calculations by limiting precision to 'p' places\\n prevTerm = BigRat.fromDecimal(nextTerm.toDecimal(p))\\n k = k + 1\\n }\\n return sum\\n}\\n\\nvar ramanujan = Fn.new { |n, dp|\\n var e = bigPi * BigRat.new(n, 1).sqrt(70)\\n return exp.call(e, 70)\\n}\\n\\nSystem.print(\\\"Ramanujan's constant to 32 decimal places is:\\\")\\nSystem.print(ramanujan.call(163, 32).toDecimal(32))\\nvar heegner = [19, 43, 67, 163]\\nSystem.print(\\\"\\\\nHeegner numbers yielding almost integers:\\\")\\nfor (h in heegner) {\\n var r = ramanujan.call(h, 32)\\n var rc = r.ceil\\n var diff = (rc - r).toDecimal(32)\\n r = r.toDecimal(32)\\n rc = rc.toDecimal(32)\\n Fmt.print(\\\"$3d: $51s ≈ $18s (diff: $s)\\\", h, r, rc, diff)\\n}\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Ramanujans-constant"}}},{"rowIdx":1554,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Geometry\n- Recursion\nfrom: http://rosettacode.org/wiki/Ramer-Douglas-Peucker_line_simplification\n","language":"00-META"},{"code":"The '''Ramer–Douglas–Peucker''' algorithm is a line simplification algorithm for reducing the number of points used to define its shape. \n\n\n;Task:\nUsing the '''Ramer–Douglas–Peucker''' algorithm, simplify the 2D line defined by the points:\n (0,0) (1,0.1) (2,-0.1) (3,5) (4,6) (5,7) (6,8.1) (7,9) (8,9) (9,9) \n\nThe error threshold to be used is: '''1.0'''. \n\nDisplay the remaining points here.\n\n\n;Reference:\n:* the Wikipedia article: [https://en.wikipedia.org/wiki/Ramer%E2%80%93Douglas%E2%80%93Peucker_algorithm Ramer-Douglas-Peucker algorithm].\n<br><br>\n\n","language":"00-TASK"},{"code":"F rdp(l, ε) -> [(Float, Float)]\n V x = 0\n V dMax = -1.0\n V p1 = l[0]\n V p2 = l.last\n V p21 = p2 - p1\n\n L(p) l[1.<(len)-1]\n V d = abs(cross(p, p21) + cross(p2, p1))\n I d > dMax\n x = L.index + 1\n dMax = d\n\n I dMax > ε\n R rdp(l[0..x], ε) [+] rdp(l[x..], ε)[1..]\n\n R [l[0], l.last]\n\nprint(rdp([(0.0, 0.0),\n (1.0, 0.1),\n (2.0,-0.1),\n (3.0, 5.0),\n (4.0, 6.0),\n (5.0, 7.0),\n (6.0, 8.1),\n (7.0, 9.0),\n (8.0, 9.0),\n (9.0, 9.0)], 1.0))\n","language":"11l"},{"code":"BEGIN # Ramer Douglas Peucker algotithm - translated from the Go sample #\n\n MODE POINT = STRUCT( REAL x, y );\n\n PRIO APPEND = 1;\n OP APPEND = ( []POINT a, b )[]POINT: # append two POINT arrays #\n BEGIN\n INT len a = ( UPB a - LWB a ) + 1;\n INT len b = ( UPB b - LWB b ) + 1;\n [ 1 : lena + len b ]POINT result;\n result[ : len a ] := a;\n result[ len a + 1 : ] := b;\n result\n END # APPEND # ;\n\n PROC rdp = ( []POINT l, REAL epsilon )[]POINT: # Ramer Douglas Peucker #\n BEGIN # algorithm #\n INT x := 0;\n REAL d max := -1;\n POINT p1 = l[ LWB l ];\n POINT p2 = l[ UPB l ];\n REAL x21 = x OF p2 - x OF p1;\n REAL y21 = y OF p2 - y OF p1;\n REAL p2xp1y = x OF p2 * y OF p1;\n REAL p2yp1x = y OF p2 * x OF p1;\n FOR i FROM LWB l TO UPB l DO\n POINT p = l[ i ];\n IF REAL d := ABS ( y21 * x OF p - x21 * y OF p + p2xp1y - p2yp1x); d > d max\n THEN\n x := i;\n d max := d\n FI\n OD;\n IF d max > epsilon THEN\n rdp( l[ : x ], epsilon ) APPEND rdp( l[ x + 1 : ], epsilon )\n ELSE\n []POINT( l[ LWB l ], l[ UPB l ] )\n FI\n END # rdp # ;\n\n OP FMT = ( REAL v )STRING: # formsts v with up to 2 decimals #\n BEGIN\n STRING result := fixed( ABS v, 0, 2 );\n IF result[ LWB result ] = \".\" THEN \"0\" +=: result FI;\n WHILE result[ UPB result ] = \"0\" DO result := result[ : UPB result - 1 ] OD;\n IF result[ UPB result ] = \".\" THEN result := result[ : UPB result - 1 ] FI;\n IF v < 0 THEN \"-\" + result ELSE result FI\n END # FMT # ;\n OP SHOW = ( []POINT a )VOID: # prints an array of points #\n BEGIN\n print( ( \"[\" ) );\n FOR i FROM LWB a TO UPB a DO\n print( ( \" ( \", FMT x OF a[ i ], \", \", FMT y OF a[ i ], \" )\" ) )\n OD;\n print( ( \" ]\" ) )\n END # SHOW # ;\n\n SHOW rdp( ( ( 0, 0 ), ( 1, 0.1 ), ( 2, -0.1 ), ( 3, 5 ), ( 4, 6 )\n , ( 5, 7 ), ( 6, 8.1 ), ( 7, 9 ), ( 8, 9 ), ( 9, 9 )\n )\n , 1\n )\nEND\n","language":"ALGOL-68"},{"code":"#include <assert.h>\n#include <math.h>\n#include <stdio.h>\n\ntypedef struct point_tag {\n double x;\n double y;\n} point_t;\n\n// Returns the distance from point p to the line between p1 and p2\ndouble perpendicular_distance(point_t p, point_t p1, point_t p2) {\n double dx = p2.x - p1.x;\n double dy = p2.y - p1.y;\n double d = sqrt(dx * dx + dy * dy);\n return fabs(p.x * dy - p.y * dx + p2.x * p1.y - p2.y * p1.x)/d;\n}\n\n// Simplify an array of points using the Ramer–Douglas–Peucker algorithm.\n// Returns the number of output points.\nsize_t douglas_peucker(const point_t* points, size_t n, double epsilon,\n point_t* dest, size_t destlen) {\n assert(n >= 2);\n assert(epsilon >= 0);\n double max_dist = 0;\n size_t index = 0;\n for (size_t i = 1; i + 1 < n; ++i) {\n double dist = perpendicular_distance(points[i], points[0], points[n - 1]);\n if (dist > max_dist) {\n max_dist = dist;\n index = i;\n }\n }\n if (max_dist > epsilon) {\n size_t n1 = douglas_peucker(points, index + 1, epsilon, dest, destlen);\n if (destlen >= n1 - 1) {\n destlen -= n1 - 1;\n dest += n1 - 1;\n } else {\n destlen = 0;\n }\n size_t n2 = douglas_peucker(points + index, n - index, epsilon, dest, destlen);\n return n1 + n2 - 1;\n }\n if (destlen >= 2) {\n dest[0] = points[0];\n dest[1] = points[n - 1];\n }\n return 2;\n}\n\nvoid print_points(const point_t* points, size_t n) {\n for (size_t i = 0; i < n; ++i) {\n if (i > 0)\n printf(\" \");\n printf(\"(%g, %g)\", points[i].x, points[i].y);\n }\n printf(\"\\n\");\n}\n\nint main() {\n point_t points[] = {\n {0,0}, {1,0.1}, {2,-0.1}, {3,5}, {4,6},\n {5,7}, {6,8.1}, {7,9}, {8,9}, {9,9}\n };\n const size_t len = sizeof(points)/sizeof(points[0]);\n point_t out[len];\n size_t n = douglas_peucker(points, len, 1.0, out, len);\n print_points(out, n);\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <cmath>\n#include <utility>\n#include <vector>\n#include <stdexcept>\nusing namespace std;\n\ntypedef std::pair<double, double> Point;\n\ndouble PerpendicularDistance(const Point &pt, const Point &lineStart, const Point &lineEnd)\n{\n\tdouble dx = lineEnd.first - lineStart.first;\n\tdouble dy = lineEnd.second - lineStart.second;\n\n\t//Normalise\n\tdouble mag = pow(pow(dx,2.0)+pow(dy,2.0),0.5);\n\tif(mag > 0.0)\n\t{\n\t\tdx /= mag; dy /= mag;\n\t}\n\n\tdouble pvx = pt.first - lineStart.first;\n\tdouble pvy = pt.second - lineStart.second;\n\n\t//Get dot product (project pv onto normalized direction)\n\tdouble pvdot = dx * pvx + dy * pvy;\n\n\t//Scale line direction vector\n\tdouble dsx = pvdot * dx;\n\tdouble dsy = pvdot * dy;\n\n\t//Subtract this from pv\n\tdouble ax = pvx - dsx;\n\tdouble ay = pvy - dsy;\n\n\treturn pow(pow(ax,2.0)+pow(ay,2.0),0.5);\n}\n\nvoid RamerDouglasPeucker(const vector<Point> &pointList, double epsilon, vector<Point> &out)\n{\n\tif(pointList.size()<2)\n\t\tthrow invalid_argument(\"Not enough points to simplify\");\n\n\t// Find the point with the maximum distance from line between start and end\n\tdouble dmax = 0.0;\n\tsize_t index = 0;\n\tsize_t end = pointList.size()-1;\n\tfor(size_t i = 1; i < end; i++)\n\t{\n\t\tdouble d = PerpendicularDistance(pointList[i], pointList[0], pointList[end]);\n\t\tif (d > dmax)\n\t\t{\n\t\t\tindex = i;\n\t\t\tdmax = d;\n\t\t}\n\t}\n\n\t// If max distance is greater than epsilon, recursively simplify\n\tif(dmax > epsilon)\n\t{\n\t\t// Recursive call\n\t\tvector<Point> recResults1;\n\t\tvector<Point> recResults2;\n\t\tvector<Point> firstLine(pointList.begin(), pointList.begin()+index+1);\n\t\tvector<Point> lastLine(pointList.begin()+index, pointList.end());\n\t\tRamerDouglasPeucker(firstLine, epsilon, recResults1);\n\t\tRamerDouglasPeucker(lastLine, epsilon, recResults2);\n\n\t\t// Build the result list\n\t\tout.assign(recResults1.begin(), recResults1.end()-1);\n\t\tout.insert(out.end(), recResults2.begin(), recResults2.end());\n\t\tif(out.size()<2)\n\t\t\tthrow runtime_error(\"Problem assembling output\");\n\t}\n\telse\n\t{\n\t\t//Just return start and end points\n\t\tout.clear();\n\t\tout.push_back(pointList[0]);\n\t\tout.push_back(pointList[end]);\n\t}\n}\n\nint main()\n{\n\tvector<Point> pointList;\n\tvector<Point> pointListOut;\n\n\tpointList.push_back(Point(0.0, 0.0));\n\tpointList.push_back(Point(1.0, 0.1));\n\tpointList.push_back(Point(2.0, -0.1));\n\tpointList.push_back(Point(3.0, 5.0));\n\tpointList.push_back(Point(4.0, 6.0));\n\tpointList.push_back(Point(5.0, 7.0));\n\tpointList.push_back(Point(6.0, 8.1));\n\tpointList.push_back(Point(7.0, 9.0));\n\tpointList.push_back(Point(8.0, 9.0));\n\tpointList.push_back(Point(9.0, 9.0));\n\n\tRamerDouglasPeucker(pointList, 1.0, pointListOut);\n\n\tcout << \"result\" << endl;\n\tfor(size_t i=0;i< pointListOut.size();i++)\n\t{\n\t\tcout << pointListOut[i].first << \",\" << pointListOut[i].second << endl;\n\t}\n\n\treturn 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nnamespace LineSimplification {\n using Point = Tuple<double, double>;\n\n class Program {\n static double PerpendicularDistance(Point pt, Point lineStart, Point lineEnd) {\n double dx = lineEnd.Item1 - lineStart.Item1;\n double dy = lineEnd.Item2 - lineStart.Item2;\n\n // Normalize\n double mag = Math.Sqrt(dx * dx + dy * dy);\n if (mag > 0.0) {\n dx /= mag;\n dy /= mag;\n }\n double pvx = pt.Item1 - lineStart.Item1;\n double pvy = pt.Item2 - lineStart.Item2;\n\n // Get dot product (project pv onto normalized direction)\n double pvdot = dx * pvx + dy * pvy;\n\n // Scale line direction vector and subtract it from pv\n double ax = pvx - pvdot * dx;\n double ay = pvy - pvdot * dy;\n\n return Math.Sqrt(ax * ax + ay * ay);\n }\n\n static void RamerDouglasPeucker(List<Point> pointList, double epsilon, List<Point> output) {\n if (pointList.Count < 2) {\n throw new ArgumentOutOfRangeException(\"Not enough points to simplify\");\n }\n\n // Find the point with the maximum distance from line between the start and end\n double dmax = 0.0;\n int index = 0;\n int end = pointList.Count - 1;\n for (int i = 1; i < end; ++i) {\n double d = PerpendicularDistance(pointList[i], pointList[0], pointList[end]);\n if (d > dmax) {\n index = i;\n dmax = d;\n }\n }\n\n // If max distance is greater than epsilon, recursively simplify\n if (dmax > epsilon) {\n List<Point> recResults1 = new List<Point>();\n List<Point> recResults2 = new List<Point>();\n List<Point> firstLine = pointList.Take(index + 1).ToList();\n List<Point> lastLine = pointList.Skip(index).ToList();\n RamerDouglasPeucker(firstLine, epsilon, recResults1);\n RamerDouglasPeucker(lastLine, epsilon, recResults2);\n\n // build the result list\n output.AddRange(recResults1.Take(recResults1.Count - 1));\n output.AddRange(recResults2);\n if (output.Count < 2) throw new Exception(\"Problem assembling output\");\n }\n else {\n // Just return start and end points\n output.Clear();\n output.Add(pointList[0]);\n output.Add(pointList[pointList.Count - 1]);\n }\n }\n\n static void Main(string[] args) {\n List<Point> pointList = new List<Point>() {\n new Point(0.0,0.0),\n new Point(1.0,0.1),\n new Point(2.0,-0.1),\n new Point(3.0,5.0),\n new Point(4.0,6.0),\n new Point(5.0,7.0),\n new Point(6.0,8.1),\n new Point(7.0,9.0),\n new Point(8.0,9.0),\n new Point(9.0,9.0),\n };\n List<Point> pointListOut = new List<Point>();\n RamerDouglasPeucker(pointList, 1.0, pointListOut);\n Console.WriteLine(\"Points remaining after simplification:\");\n pointListOut.ForEach(p => Console.WriteLine(p));\n }\n }\n}\n","language":"C-sharp"},{"code":"import std.algorithm;\nimport std.exception : enforce;\nimport std.math;\nimport std.stdio;\n\nvoid main() {\n creal[] pointList = [\n 0.0 + 0.0i,\n 1.0 + 0.1i,\n 2.0 + -0.1i,\n 3.0 + 5.0i,\n 4.0 + 6.0i,\n 5.0 + 7.0i,\n 6.0 + 8.1i,\n 7.0 + 9.0i,\n 8.0 + 9.0i,\n 9.0 + 9.0i\n ];\n creal[] pointListOut;\n\n ramerDouglasPeucker(pointList, 1.0, pointListOut);\n\n writeln(\"result\");\n for (size_t i=0; i< pointListOut.length; i++) {\n writeln(pointListOut[i].re, \",\", pointListOut[i].im);\n }\n}\n\nreal perpendicularDistance(const creal pt, const creal lineStart, const creal lineEnd) {\n creal d = lineEnd - lineStart;\n\n //Normalise\n real mag = hypot(d.re, d.im);\n if (mag > 0.0) {\n d /= mag;\n }\n\n creal pv = pt - lineStart;\n\n //Get dot product (project pv onto normalized direction)\n real pvdot = d.re * pv.re + d.im * pv.im;\n\n //Scale line direction vector\n creal ds = pvdot * d;\n\n //Subtract this from pv\n creal a = pv - ds;\n\n return hypot(a.re, a.im);\n}\n\nvoid ramerDouglasPeucker(const creal[] pointList, real epsilon, ref creal[] output) {\n enforce(pointList.length >= 2, \"Not enough points to simplify\");\n\n // Find the point with the maximum distance from line between start and end\n real dmax = 0.0;\n size_t index = 0;\n size_t end = pointList.length-1;\n for (size_t i=1; i<end; i++) {\n real d = perpendicularDistance(pointList[i], pointList[0], pointList[end]);\n if (d > dmax) {\n index = i;\n dmax = d;\n }\n }\n\n // If max distance is greater than epsilon, recursively simplify\n if (dmax > epsilon) {\n // Recursive call\n creal[] firstLine = pointList[0..index+1].dup;\n creal[] lastLine = pointList[index+1..$].dup;\n\n creal[] recResults1;\n ramerDouglasPeucker(firstLine, epsilon, recResults1);\n\n creal[] recResults2;\n ramerDouglasPeucker(lastLine, epsilon, recResults2);\n\n // Build the result list\n output = recResults1 ~ recResults2;\n\n enforce(output.length>=2, \"Problem assembling output\");\n } else {\n //Just return start and end points\n output.length = 0;\n output ~= pointList[0];\n output ~= pointList[end];\n }\n}\n","language":"D"},{"code":"func perpdist px py p1x p1y p2x p2y .\n dx = p2x - p1x\n dy = p2y - p1y\n d = sqrt (dx * dx + dy * dy)\n return abs (px * dy - py * dx + p2x * p1y - p2y * p1x) / d\n.\nproc peucker eps . ptx[] pty[] outx[] outy[] .\n n = len ptx[]\n idx = 1\n for i = 2 to n - 1\n dist = perpdist ptx[i] pty[i] ptx[1] pty[1] ptx[n] pty[n]\n if dist > dmax\n dmax = dist\n idx = i\n .\n .\n if dmax > eps\n for i to idx\n px[] &= ptx[i]\n py[] &= pty[i]\n .\n peucker eps px[] py[] outx[] outy[]\n #\n for i = idx to n\n p2x[] &= ptx[i]\n p2y[] &= pty[i]\n .\n peucker eps p2x[] p2y[] ox[] oy[]\n for i = 2 to len ox[]\n outx[] &= ox[i]\n outy[] &= oy[i]\n .\n else\n outx[] = [ ptx[1] ptx[n] ]\n outy[] = [ pty[1] pty[n] ]\n .\n.\nproc prpts px[] py[] . .\n for i to len px[]\n write \"(\" & px[i] & \" \" & py[i] & \") \"\n .\n print \"\"\n.\npx[] = [ 0 1 2 3 4 5 6 7 8 9 ]\npy[] = [ 0 0.1 -0.1 5 6 7 8.1 9 9 9 ]\npeucker 1 px[] py[] ox[] oy[]\nprpts ox[] oy[]\n","language":"EasyLang"},{"code":"Function DistanciaPerpendicular(tabla() As Double, i As Integer, ini As Integer, fin As Integer) As Double\n Dim As Double dx, dy, mag, pvx, pvy, pvdot, dsx, dsy, ax, ay\n\n dx = tabla(fin, 1) - tabla(ini, 1)\n dy = tabla(fin, 2) - tabla(ini, 2)\n\n 'Normaliza\n mag = (dx^2 + dy^2)^0.5\n If mag > 0 Then dx /= mag : dy /= mag\n\n pvx = tabla(i, 1) - tabla(ini, 1)\n pvy = tabla(i, 2) - tabla(ini, 2)\n\n 'Producto escalado (proyecto pv en dirección normalizada)\n pvdot = dx * pvx + dy * pvy\n\n 'Vector de dirección de línea de escala\n dsx = pvdot * dx\n dsy = pvdot * dy\n\n 'Reste esto de pv\n ax = pvx - dsx\n ay = pvy - dsy\n\n Return (ax^2 + ay^2)^0.5\nEnd Function\n\nSub DRDP(ListaDePuntos() As Double, ini As Integer, fin As Integer, epsilon As Double)\n Dim As Double dmax, d\n Dim As Integer indice, i\n ' Encuentra el punto con la distancia máxima\n\n If Ubound(ListaDePuntos) < 2 Then Print \"No hay suficientes puntos para simplificar \" : Sleep : End\n\n For i = ini + 1 To fin\n d = DistanciaPerpendicular(ListaDePuntos(), i, ini, fin)\n If d > dmax Then indice = i : dmax = d\n Next\n\n ' Si la distancia máxima es mayor que épsilon, simplifique de forma recursiva\n If dmax > epsilon Then\n ListaDePuntos(indice, 3) = True\n DRDP(ListaDePuntos(), ini, indice, epsilon)\n DRDP(ListaDePuntos(), indice, fin, epsilon)\n End If\nEnd Sub\n\nDim As Double matriz(1 To 10, 1 To 3)\nData 0, 0, 1, 0.1, 2, -0.1, 3, 5, 4, 6, 5, 7, 6, 8.1, 7, 9, 8, 9, 9, 9\nFor i As Integer = Lbound(matriz) To Ubound(matriz)\n Read matriz(i, 1), matriz(i, 2)\nNext i\n\nDRDP(matriz(), 1, 10, 1)\n\nPrint \"Puntos restantes tras de simplificar:\"\nmatriz(1, 3) = True : matriz(10, 3) = True\nFor i As Integer = Lbound(matriz) To Ubound(matriz)\n If matriz(i, 3) Then Print \"(\";matriz(i, 1);\", \"; matriz(i, 2);\") \";\nNext i\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n)\n\ntype point struct{ x, y float64 }\n\nfunc RDP(l []point, ε float64) []point {\n x := 0\n dMax := -1.\n last := len(l) - 1\n p1 := l[0]\n p2 := l[last]\n x21 := p2.x - p1.x\n y21 := p2.y - p1.y\n for i, p := range l[1:last] {\n if d := math.Abs(y21*p.x - x21*p.y + p2.x*p1.y - p2.y*p1.x); d > dMax {\n x = i + 1\n dMax = d\n }\n }\n if dMax > ε {\n return append(RDP(l[:x+1], ε), RDP(l[x:], ε)[1:]...)\n }\n return []point{l[0], l[len(l)-1]}\n}\n\nfunc main() {\n fmt.Println(RDP([]point{{0, 0}, {1, 0.1}, {2, -0.1},\n {3, 5}, {4, 6}, {5, 7}, {6, 8.1}, {7, 9}, {8, 9}, {9, 9}}, 1))\n}\n","language":"Go"},{"code":"mp=: +/ .* NB. matrix product\nnorm=: +/&.:*: NB. vector norm\nnormalize=: (% norm)^:(0 < norm)\n\ndxy=. normalize@({: - {.)\npv=. -\"1 {.\nNB.*perpDist v Calculate perpendicular distance of points from a line\nperpDist=: norm\"1@(pv ([ -\"1 mp\"1~ */ ]) dxy) f.\n\nrdp=: verb define\n 1 rdp y\n :\n points=. ,:^:(2 > #@$) y\n epsilon=. x\n if. 2 > # points do. points return. end.\n\n NB. point with the maximum distance from line between start and end\n 'imax dmax'=. ((i. , ]) >./) perpDist points\n if. dmax > epsilon do.\n epsilon ((}:@rdp (1+imax)&{.) , (rdp imax&}.)) points\n else.\n ({. ,: {:) points\n end.\n)\n","language":"J"},{"code":" Points=: 0 0,1 0.1,2 _0.1,3 5,4 6,5 7,6 8.1,7 9,8 9,:9 9\n 1.0 rdp Points\n0 0\n2 _0.1\n3 5\n7 9\n9 9\n","language":"J"},{"code":"import javafx.util.Pair;\n\nimport java.util.ArrayList;\nimport java.util.List;\n\npublic class LineSimplification {\n private static class Point extends Pair<Double, Double> {\n Point(Double key, Double value) {\n super(key, value);\n }\n\n @Override\n public String toString() {\n return String.format(\"(%f, %f)\", getKey(), getValue());\n }\n }\n\n private static double perpendicularDistance(Point pt, Point lineStart, Point lineEnd) {\n double dx = lineEnd.getKey() - lineStart.getKey();\n double dy = lineEnd.getValue() - lineStart.getValue();\n\n // Normalize\n double mag = Math.hypot(dx, dy);\n if (mag > 0.0) {\n dx /= mag;\n dy /= mag;\n }\n double pvx = pt.getKey() - lineStart.getKey();\n double pvy = pt.getValue() - lineStart.getValue();\n\n // Get dot product (project pv onto normalized direction)\n double pvdot = dx * pvx + dy * pvy;\n\n // Scale line direction vector and subtract it from pv\n double ax = pvx - pvdot * dx;\n double ay = pvy - pvdot * dy;\n\n return Math.hypot(ax, ay);\n }\n\n private static void ramerDouglasPeucker(List<Point> pointList, double epsilon, List<Point> out) {\n if (pointList.size() < 2) throw new IllegalArgumentException(\"Not enough points to simplify\");\n\n // Find the point with the maximum distance from line between the start and end\n double dmax = 0.0;\n int index = 0;\n int end = pointList.size() - 1;\n for (int i = 1; i < end; ++i) {\n double d = perpendicularDistance(pointList.get(i), pointList.get(0), pointList.get(end));\n if (d > dmax) {\n index = i;\n dmax = d;\n }\n }\n\n // If max distance is greater than epsilon, recursively simplify\n if (dmax > epsilon) {\n List<Point> recResults1 = new ArrayList<>();\n List<Point> recResults2 = new ArrayList<>();\n List<Point> firstLine = pointList.subList(0, index + 1);\n List<Point> lastLine = pointList.subList(index, pointList.size());\n ramerDouglasPeucker(firstLine, epsilon, recResults1);\n ramerDouglasPeucker(lastLine, epsilon, recResults2);\n\n // build the result list\n out.addAll(recResults1.subList(0, recResults1.size() - 1));\n out.addAll(recResults2);\n if (out.size() < 2) throw new RuntimeException(\"Problem assembling output\");\n } else {\n // Just return start and end points\n out.clear();\n out.add(pointList.get(0));\n out.add(pointList.get(pointList.size() - 1));\n }\n }\n\n public static void main(String[] args) {\n List<Point> pointList = List.of(\n new Point(0.0, 0.0),\n new Point(1.0, 0.1),\n new Point(2.0, -0.1),\n new Point(3.0, 5.0),\n new Point(4.0, 6.0),\n new Point(5.0, 7.0),\n new Point(6.0, 8.1),\n new Point(7.0, 9.0),\n new Point(8.0, 9.0),\n new Point(9.0, 9.0)\n );\n List<Point> pointListOut = new ArrayList<>();\n ramerDouglasPeucker(pointList, 1.0, pointListOut);\n System.out.println(\"Points remaining after simplification:\");\n pointListOut.forEach(System.out::println);\n }\n}\n","language":"Java"},{"code":"/**\n * @typedef {{\n * x: (!number),\n * y: (!number)\n * }}\n */\nlet pointType;\n\n/**\n * @param {!Array<pointType>} l\n * @param {number} eps\n */\nconst RDP = (l, eps) => {\n const last = l.length - 1;\n const p1 = l[0];\n const p2 = l[last];\n const x21 = p2.x - p1.x;\n const y21 = p2.y - p1.y;\n\n const [dMax, x] = l.slice(1, last)\n .map(p => Math.abs(y21 * p.x - x21 * p.y + p2.x * p1.y - p2.y * p1.x))\n .reduce((p, c, i) => {\n const v = Math.max(p[0], c);\n return [v, v === p[0] ? p[1] : i + 1];\n }, [-1, 0]);\n\n if (dMax > eps) {\n return [...RDP(l.slice(0, x + 1), eps), ...RDP(l.slice(x), eps).slice(1)];\n }\n return [l[0], l[last]]\n};\n\nconst points = [\n {x: 0, y: 0},\n {x: 1, y: 0.1},\n {x: 2, y: -0.1},\n {x: 3, y: 5},\n {x: 4, y: 6},\n {x: 5, y: 7},\n {x: 6, y: 8.1},\n {x: 7, y: 9},\n {x: 8, y: 9},\n {x: 9, y: 9}];\n\nconsole.log(RDP(points, 1));\n","language":"JavaScript"},{"code":"const Point = Vector{Float64}\n\nfunction perpdist(pt::Point, lnstart::Point, lnend::Point)\n d = normalize!(lnend .- lnstart)\n\n pv = pt .- lnstart\n # Get dot product (project pv onto normalized direction)\n pvdot = dot(d, pv)\n # Scale line direction vector\n ds = pvdot .* d\n # Subtract this from pv\n return norm(pv .- ds)\nend\n\nfunction rdp(plist::Vector{Point}, ϵ::Float64 = 1.0)\n if length(plist) < 2\n throw(ArgumentError(\"not enough points to simplify\"))\n end\n\n # Find the point with the maximum distance from line between start and end\n distances = collect(perpdist(pt, plist[1], plist[end]) for pt in plist)\n dmax, imax = findmax(distances)\n\n # If max distance is greater than epsilon, recursively simplify\n if dmax > ϵ\n fstline = plist[1:imax]\n lstline = plist[imax:end]\n\n recrst1 = rdp(fstline, ϵ)\n recrst2 = rdp(lstline, ϵ)\n\n out = vcat(recrst1, recrst2)\n else\n out = [plist[1], plist[end]]\n end\n\n return out\nend\n\nplist = Point[[0.0, 0.0], [1.0, 0.1], [2.0, -0.1], [3.0, 5.0], [4.0, 6.0], [5.0, 7.0], [6.0, 8.1], [7.0, 9.0], [8.0, 9.0], [9.0, 9.0]]\n@show plist\n@show rdp(plist)\n","language":"Julia"},{"code":"// version 1.1.0\n\ntypealias Point = Pair<Double, Double>\n\nfun perpendicularDistance(pt: Point, lineStart: Point, lineEnd: Point): Double {\n var dx = lineEnd.first - lineStart.first\n var dy = lineEnd.second - lineStart.second\n\n // Normalize\n val mag = Math.hypot(dx, dy)\n if (mag > 0.0) { dx /= mag; dy /= mag }\n val pvx = pt.first - lineStart.first\n val pvy = pt.second - lineStart.second\n\n // Get dot product (project pv onto normalized direction)\n val pvdot = dx * pvx + dy * pvy\n\n // Scale line direction vector and substract it from pv\n val ax = pvx - pvdot * dx\n val ay = pvy - pvdot * dy\n\n return Math.hypot(ax, ay)\n}\n\nfun RamerDouglasPeucker(pointList: List<Point>, epsilon: Double, out: MutableList<Point>) {\n if (pointList.size < 2) throw IllegalArgumentException(\"Not enough points to simplify\")\n\n // Find the point with the maximum distance from line between start and end\n var dmax = 0.0\n var index = 0\n val end = pointList.size - 1\n for (i in 1 until end) {\n val d = perpendicularDistance(pointList[i], pointList[0], pointList[end])\n if (d > dmax) { index = i; dmax = d }\n }\n\n // If max distance is greater than epsilon, recursively simplify\n if (dmax > epsilon) {\n val recResults1 = mutableListOf<Point>()\n val recResults2 = mutableListOf<Point>()\n val firstLine = pointList.take(index + 1)\n val lastLine = pointList.drop(index)\n RamerDouglasPeucker(firstLine, epsilon, recResults1)\n RamerDouglasPeucker(lastLine, epsilon, recResults2)\n\n // build the result list\n out.addAll(recResults1.take(recResults1.size - 1))\n out.addAll(recResults2)\n if (out.size < 2) throw RuntimeException(\"Problem assembling output\")\n }\n else {\n // Just return start and end points\n out.clear()\n out.add(pointList.first())\n out.add(pointList.last())\n }\n}\n\nfun main(args: Array<String>) {\n val pointList = listOf(\n Point(0.0, 0.0),\n Point(1.0, 0.1),\n Point(2.0, -0.1),\n Point(3.0, 5.0),\n Point(4.0, 6.0),\n Point(5.0, 7.0),\n Point(6.0, 8.1),\n\tPoint(7.0, 9.0),\n\tPoint(8.0, 9.0),\n Point(9.0, 9.0)\n )\n val pointListOut = mutableListOf<Point>()\n RamerDouglasPeucker(pointList, 1.0, pointListOut)\n println(\"Points remaining after simplification:\")\n for (p in pointListOut) println(p)\n}\n","language":"Kotlin"},{"code":"import math\n\ntype\n Point = tuple[x, y: float64]\n\nproc pointLineDistance(pt, lineStart, lineEnd: Point): float64 =\n var n, d, dx, dy: float64\n dx = lineEnd.x - lineStart.x\n dy = lineEnd.y - lineStart.y\n n = abs(dx * (lineStart.y - pt.y) - (lineStart.x - pt.x) * dy)\n d = sqrt(dx * dx + dy * dy)\n n / d\n\nproc rdp(points: seq[Point], startIndex, lastIndex: int, ε: float64 = 1.0): seq[Point] =\n var dmax = 0.0\n var index = startIndex\n\n for i in index+1..<lastIndex:\n var d = pointLineDistance(points[i], points[startIndex], points[lastIndex])\n if d > dmax:\n index = i\n dmax = d\n\n if dmax > ε:\n var res1 = rdp(points, startIndex, index, ε)\n var res2 = rdp(points, index, lastIndex, ε)\n\n var finalRes: seq[Point] = @[]\n finalRes.add(res1[0..^2])\n finalRes.add(res2[0..^1])\n\n result = finalRes\n else:\n result = @[points[startIndex], points[lastIndex]]\n\nvar line: seq[Point] = @[(0.0, 0.0), (1.0, 0.1), (2.0, -0.1), (3.0, 5.0), (4.0, 6.0),\n (5.0, 7.0), (6.0, 8.1), (7.0, 9.0), (8.0, 9.0), (9.0, 9.0)]\necho rdp(line, line.low, line.high)\n","language":"Nim"},{"code":"/*REXX program uses the Ramer-Douglas-Peucker (RDP) line simplification algorithm for*/\n/*--------------------------- reducing the number of points used to define its shape. */\nParse Arg epsilon pl /*obtain optional arguments from the CL*/\nIf epsilon='' | epsilon=',' then epsilon= 1 /*Not specified? Then use the default.*/\nIf pl='' Then pl= '(0,0) (1,0.1) (2,-0.1) (3,5) (4,6) (5,7) (6,8.1) (7,9) (8,9) (9,9)'\nSay ' error threshold:' epsilon\nSay ' points specified:' pl\nSay 'points simplified:' dlp(pl)\nExit\ndlp: Procedure Expose epsilon\n Parse Arg pl\n plc=pl\n Do i=1 By 1 While plc<>''\n Parse Var plc '(' X ',' y ')' plc\n p.i=.point~new(x,y)\n End\n end=i-1\n dmax=0\n index=0\n Do i=2 To end-1\n d=distpg(p.i,.line~new(p.1,p.end))\n If d>dmax Then Do\n index=i\n dmax=d\n End\n End\n If dmax>epsilon Then Do\n rla=dlp(subword(pl,1,index))\n rlb=dlp(subword(pl,index,end))\n rl=subword(rla,1,words(rla)-1) rlb\n End\n Else\n rl=word(pl,1) word(pl,end)\n Return rl\n\n::CLASS point public\n::ATTRIBUTE X\n::ATTRIBUTE Y\n::METHOD init PUBLIC\n Expose X Y\n Use Arg X,Y\n\n::CLASS line public\n::ATTRIBUTE A\n::ATTRIBUTE B\n::METHOD init PUBLIC\n Expose A B\n Use Arg A,B\n If A~x=B~x & A~y=B~y Then Do\n Say 'not a line'\n Return .nil\n End\n\n::METHOD k PUBLIC\n Expose A B\n ax=A~x; ay=A~y; bx=B~x; by=B~y\n If ax=bx Then\n res='infinite'\n Else\n res=(by-ay)/(bx-ax)\n Return res\n\n::METHOD d PUBLIC\n Expose A B\n ax=A~x; ay=A~y\n If self~k='infinite' Then\n res='indeterminate'\n Else\n res=round(ay-ax*self~k)\n Return res\n\n::ROUTINE distpg PUBLIC --Compute the distance from a point to a line\n/***********************************************************************\n* Compute the distance from a point to a line\n***********************************************************************/\n Use Arg A,g\n ax=A~x; ay=A~y\n k=g~k\n If k='infinite' Then Do\n Parse Value g~kxd With 'x='gx\n res=gx-ax\n End\n Else\n res=(ay-k*ax-g~d)/rxCalcsqrt(1+k**2)\n Return abs(res)\n\n::ROUTINE round PUBLIC --Round a number to 3 decimal digits\n/***********************************************************************\n* Round a nmber to 3 decimal digits\n***********************************************************************/\n Use Arg z,d\n Numeric Digits 30\n res=z+0\n If d>'' Then\n res=format(res,9,6)\n Return strip(res)\n\n::requires rxMath library\n","language":"OoRexx"},{"code":"function slice(a, v) = [ for (i = v) a[i] ];\n\n// Find the distance from the point to the line\nfunction perpendicular_distance(pt, start, end) =\n let (\n d = end - start,\n dn = d / norm(d),\n dp = pt - start,\n // Dot-product of two vectors\n ddot = dn * dp,\n ds = dn * ddot\n )\n norm(dp - ds);\n\n// Find the point with the maximum distance from line between start and end.\n// Returns a vector of [dmax, point_index]\nfunction max_distance(pts, cindex=1, iresult=[0,0]) =\n let (\n d = perpendicular_distance(pts[cindex], pts[0],pts[len(pts)-1]),\n result = (d > iresult[0] ? [d, cindex] : iresult)\n )\n (cindex == len(pts) - 1 ?\n iresult :\n max_distance(pts, cindex+1, result));\n\n// Tail recursion optimization is not possible with tree recursion.\n//\n// It's probably possible to optimize this with tail recursion by converting to\n// iterative approach, see\n// https://namekdev.net/2014/06/iterative-version-of-ramer-douglas-peucker-line-simplification-algorithm/ .\n// It's not possible to use iterative approach without recursion at all because\n// of static nature of OpenSCAD arrays.\nfunction ramer_douglas_peucker(points, epsilon=1) =\n let (dmax = max_distance(points))\n // Simplify the line recursively if the max distance is greater than epsilon\n (dmax[0] > epsilon ?\n let (\n lo = ramer_douglas_peucker(\n slice(points, [0:dmax[1]]), epsilon),\n hi = ramer_douglas_peucker(\n slice(points, [dmax[1]:len(points)-1]), epsilon)\n )\n concat(slice(lo, [0:len(lo)-2]), hi) :\n [points[0],points[len(points)-1]]);\n\n/* -- Demo -- */\n\nmodule line(points, thickness=1, dot=2) {\n for (idx = [0:len(points)-2]) {\n translate(points[idx])\n sphere(d=dot);\n hull() {\n translate(points[idx])\n sphere(d=thickness);\n translate(points[idx+1])\n sphere(d=thickness);\n }\n }\n translate(points[len(points)-1])\n sphere(d=dot);\n}\n\nfunction addz(pts, z=0) = [ for (p = pts) [p.x, p.y, z] ];\n\nmodule demo(pts) {\n rdp = ramer_douglas_peucker(points=pts, epsilon=1);\n echo(rdp);\n color(\"gray\")\n line(points=addz(pts, 0), thickness=0.1, dot=0.3);\n color(\"red\")\n line(points=addz(rdp, 1), thickness=0.1, dot=0.3);\n}\n\n$fn=16;\npoints = [[0,0], [1,0.1], [2,-0.1], [3,5], [4,6], [5,7], [6,8.1], [7,9], [8,9], [9,9]];\ndemo(points);\n","language":"Openscad"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\nuse List::MoreUtils qw(firstidx minmax);\n\nmy $epsilon = 1;\n\nsub norm {\n my(@list) = @_;\n my $sum;\n $sum += $_**2 for @list;\n sqrt($sum)\n}\n\nsub perpendicular_distance {\n our(@start,@end,@point);\n local(*start,*end,*point) = (shift, shift, shift);\n return 0 if $start[0]==$point[0] && $start[1]==$point[1]\n or $end[0]==$point[0] && $end[1]==$point[1];\n my ( $dx, $dy) = ( $end[0]-$start[0], $end[1]-$start[1]);\n my ($dpx, $dpy) = ($point[0]-$start[0],$point[1]-$start[1]);\n my $t = norm($dx, $dy);\n $dx /= $t;\n $dy /= $t;\n norm($dpx - $dx*($dx*$dpx + $dy*$dpy), $dpy - $dy*($dx*$dpx + $dy*$dpy));\n}\n\nsub Ramer_Douglas_Peucker {\n my(@points) = @_;\n return @points if @points == 2;\n my @d;\n push @d, perpendicular_distance(@points[0, -1, $_]) for 0..@points-1;\n my(undef,$dmax) = minmax @d;\n my $index = firstidx { $_ == $dmax } @d;\n if ($dmax > $epsilon) {\n my @lo = Ramer_Douglas_Peucker( @points[0..$index]);\n my @hi = Ramer_Douglas_Peucker( @points[$index..$#points]);\n return @lo[0..@lo-2], @hi;\n }\n @points[0, -1];\n}\n\nsay '(' . join(' ', @$_) . ') '\n for Ramer_Douglas_Peucker( [0,0],[1,0.1],[2,-0.1],[3,5],[4,6],[5,7],[6,8.1],[7,9],[8,9],[9,9] )\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">rdp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">)<</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"not enough points to simplify\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">idx</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">dMax</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">p1x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p1y</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">p2x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p2y</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">[$],</span>\n <span style=\"color: #000000;\">x21</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">p2x</span> <span style=\"color: #0000FF;\">-</span> <span style=\"color: #000000;\">p1x</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">y21</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">p2y</span> <span style=\"color: #0000FF;\">-</span> <span style=\"color: #000000;\">p1y</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">px</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">py</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">abs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y21</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">px</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">x21</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">py</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">p2x</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">p1y</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">p2y</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">p1x</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">dMax</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">idx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">i</span>\n <span style=\"color: #000000;\">dMax</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">d</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">dMax</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">e</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">rdp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">idx</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">&</span> <span style=\"color: #000000;\">rdp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">idx</span><span style=\"color: #0000FF;\">..$],</span> <span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">)[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">..$]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">[$]}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">points</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.1</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">0.1</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8.1</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">}}</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">rdp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">points</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"function perpendicular_distance(array $pt, array $line) {\n // Calculate the normalized delta x and y of the line.\n $dx = $line[1][0] - $line[0][0];\n $dy = $line[1][1] - $line[0][1];\n $mag = sqrt($dx * $dx + $dy * $dy);\n if ($mag > 0) {\n $dx /= $mag;\n $dy /= $mag;\n }\n\n // Calculate dot product, projecting onto normalized direction.\n $pvx = $pt[0] - $line[0][0];\n $pvy = $pt[1] - $line[0][1];\n $pvdot = $dx * $pvx + $dy * $pvy;\n\n // Scale line direction vector and subtract from pv.\n $dsx = $pvdot * $dx;\n $dsy = $pvdot * $dy;\n $ax = $pvx - $dsx;\n $ay = $pvy - $dsy;\n\n return sqrt($ax * $ax + $ay * $ay);\n}\n\nfunction ramer_douglas_peucker(array $points, $epsilon) {\n if (count($points) < 2) {\n throw new InvalidArgumentException('Not enough points to simplify');\n }\n\n // Find the point with the maximum distance from the line between start/end.\n $dmax = 0;\n $index = 0;\n $end = count($points) - 1;\n $start_end_line = [$points[0], $points[$end]];\n for ($i = 1; $i < $end; $i++) {\n $dist = perpendicular_distance($points[$i], $start_end_line);\n if ($dist > $dmax) {\n $index = $i;\n $dmax = $dist;\n }\n }\n\n // If max distance is larger than epsilon, recursively simplify.\n if ($dmax > $epsilon) {\n $new_start = ramer_douglas_peucker(array_slice($points, 0, $index + 1), $epsilon);\n $new_end = ramer_douglas_peucker(array_slice($points, $index), $epsilon);\n array_pop($new_start);\n return array_merge($new_start, $new_end);\n }\n\n // Max distance is below epsilon, so return a line from with just the\n // start and end points.\n return [ $points[0], $points[$end]];\n}\n\n$polyline = [\n [0,0],\n [1,0.1],\n [2,-0.1],\n [3,5],\n [4,6],\n [5,7],\n [6,8.1],\n [7,9],\n [8,9],\n [9,9],\n];\n\n$result = ramer_douglas_peucker($polyline, 1.0);\nprint \"Result:\\n\";\nforeach ($result as $point) {\n print $point[0] . ',' . $point[1] . \"\\n\";\n}\n","language":"PHP"},{"code":"from __future__ import print_function\nfrom shapely.geometry import LineString\n\nif __name__==\"__main__\":\n\tline = LineString([(0,0),(1,0.1),(2,-0.1),(3,5),(4,6),(5,7),(6,8.1),(7,9),(8,9),(9,9)])\n\tprint (line.simplify(1.0, preserve_topology=False))\n","language":"Python"},{"code":"#lang racket\n(require math/flonum)\n;; points are lists of x y (maybe extensible to z)\n;; x+y gets both parts as values\n(define (x+y p) (values (first p) (second p)))\n\n;; https://en.wikipedia.org/wiki/Distance_from_a_point_to_a_line\n(define (⊥-distance P1 P2)\n (let*-values\n ([(x1 y1) (x+y P1)]\n [(x2 y2) (x+y P2)]\n [(dx dy) (values (- x2 x1) (- y2 y1))]\n [(h) (sqrt (+ (sqr dy) (sqr dx)))])\n (λ (P0)\n (let-values (((x0 y0) (x+y P0)))\n (/ (abs (+ (* dy x0) (* -1 dx y0) (* x2 y1) (* -1 y2 x1))) h)))))\n\n(define (douglas-peucker points-in ϵ)\n (let recur ((ps points-in))\n ;; curried distance function which will be applicable to all points\n (let*-values\n ([(p0) (first ps)]\n [(pz) (last ps)]\n [(p-d) (⊥-distance p0 pz)]\n ;; Find the point with the maximum distance\n [(dmax index)\n (for/fold ((dmax 0) (index 0))\n ((i (in-range 1 (sub1 (length ps))))) ; skips the first, stops before the last\n (define d (p-d (list-ref ps i)))\n (if (> d dmax) (values d i) (values dmax index)))])\n ;; If max distance is greater than epsilon, recursively simplify\n (if (> dmax ϵ)\n ;; recursive call\n (let-values ([(l r) (split-at ps index)])\n (append (drop-right (recur l) 1) (recur r)))\n (list p0 pz))))) ;; else we can return this simplification\n\n(module+ main\n (douglas-peucker\n '((0 0) (1 0.1) (2 -0.1) (3 5) (4 6) (5 7) (6 8.1) (7 9) (8 9) (9 9))\n 1.0))\n\n(module+ test\n (require rackunit)\n (check-= ((⊥-distance '(0 0) '(0 1)) '(1 0)) 1 epsilon.0))\n","language":"Racket"},{"code":"sub norm (*@list) { @list»².sum.sqrt }\n\nsub perpendicular-distance (@start, @end where @end !eqv @start, @point) {\n return 0 if @point eqv any(@start, @end);\n my ( $Δx, $Δy ) = @end «-» @start;\n my ($Δpx, $Δpy) = @point «-» @start;\n ($Δx, $Δy) «/=» norm $Δx, $Δy;\n norm ($Δpx, $Δpy) «-» ($Δx, $Δy) «*» ($Δx*$Δpx + $Δy*$Δpy);\n}\n\nsub Ramer-Douglas-Peucker(@points where * > 1, \\ε = 1) {\n return @points if @points == 2;\n my @d = (^@points).map: { perpendicular-distance |@points[0, *-1, $_] };\n my ($index, $dmax) = @d.first: @d.max, :kv;\n return flat\n Ramer-Douglas-Peucker( @points[0..$index], ε )[^(*-1)],\n Ramer-Douglas-Peucker( @points[$index..*], ε )\n if $dmax > ε;\n @points[0, *-1];\n}\n\n# TESTING\nsay Ramer-Douglas-Peucker(\n [(0,0),(1,0.1),(2,-0.1),(3,5),(4,6),(5,7),(6,8.1),(7,9),(8,9),(9,9)]\n);\n","language":"Raku"},{"code":"/*REXX program uses the Ramer─Douglas─Peucker (RDP) line simplification algorithm for*/\n/*───────────────────────────── reducing the number of points used to define its shape. */\nparse arg epsilon pts /*obtain optional arguments from the CL*/\nif epsilon='' | epsilon=\",\" then epsilon= 1 /*Not specified? Then use the default.*/\nif pts='' then pts= '(0,0) (1,0.1) (2,-0.1) (3,5) (4,6) (5,7) (6,8.1) (7,9) (8,9) (9,9)'\npts= space(pts) /*elide all superfluous blanks. */\n say ' error threshold: ' epsilon /*echo the error threshold to the term.*/\n say ' points specified: ' pts /* \" \" shape points \" \" \" */\n$= RDP(pts) /*invoke Ramer─Douglas─Peucker function*/\n say 'points simplified: ' rez($) /*display points with () ───► terminal.*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nbld: parse arg _; #= words(_); dMax=-#; idx=1; do j=1 for #; @.j= word(_, j); end; return\npx: parse arg _; return word( translate(_, , ','), 1) /*obtain the X coörd.*/\npy: parse arg _; return word( translate(_, , ','), 2) /* \" \" Y \" */\nreb: parse arg a,b,,_; do k=a to b; _= _ @.k; end; return strip(_)\nrez: parse arg z,_; do k=1 for words(z); _= _ '('word(z, k)\") \"; end; return strip(_)\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nRDP: procedure expose epsilon; call bld space( translate(arg(1), , ')(][}{') )\n L= px(@.#) - px(@.1)\n H= py(@.#) - py(@.1) /* [↓] find point IDX with max distance*/\n do i=2 to #-1\n d= abs(H*px(@.i) - L*py(@.i) + px(@.#)*py(@.1) - py(@.#)*px(@.1))\n if d>dMax then do; idx= i; dMax= d\n end\n end /*i*/ /* [↑] D is the perpendicular distance*/\n\n if dMax>epsilon then do; r= RDP( reb(1, idx) )\n return subword(r, 1, words(r) - 1) RDP( reb(idx, #) )\n end\n return @.1 @.#\n","language":"REXX"},{"code":"/*REXX program uses the Ramer-Douglas-Peucker (RDP) line simplification algorithm for*/\n/*--------------------------- reducing the number of points used to define its shape. */\nParse Arg epsilon pl /*obtain optional arguments from the CL*/\nIf epsilon='' | epsilon=',' then epsilon= 1 /*Not specified? Then use the default.*/\nIf pl='' Then pl= '(0,0) (1,0.1) (2,-0.1) (3,5) (4,6) (5,7) (6,8.1) (7,9) (8,9) (9,9)'\nSay ' error threshold:' epsilon\nSay ' points specified:' pl\nSay 'points simplified:' dlp(pl)\nExit\ndlp: Procedure Expose epsilon\n Parse Arg pl\n plc=pl\n Do i=1 By 1 While plc<>''\n Parse Var plc '(' x ',' y ')' plc\n p.i=x y\n End\n end=i-1\n dmax=0\n index=0\n Do i=2 To end-1\n d=distpg(p.i,p.1,p.end)\n If d>dmax Then Do\n index=i\n dmax=d\n End\n End\n If dmax>epsilon Then Do\n rla=dlp(subword(pl,1,index))\n rlb=dlp(subword(pl,index,end))\n rl=subword(rla,1,words(rla)-1) rlb\n End\n Else\n rl=word(pl,1) word(pl,end)\n Return rl\n\ndistpg: Procedure\n/**********************************************************************\n* compute the distance of point P from the line giveb by A and B\n**********************************************************************/\n Parse Arg P,A,B\n Parse Var P px py\n Parse Var A ax ay\n Parse Var B bx by\n If ax=bx Then\n res=px-ax\n Else Do\n k=(by-ay)/(bx-ax)\n d=(ay-ax*k)\n res=(py-k*px-d)/sqrt(1+k**2)\n End\n Return abs(res)\nsqrt: Procedure\n/* REXX ***************************************************************\n* EXEC to calculate the square root of a = 2 with high precision\n**********************************************************************/\n Parse Arg x,prec\n If prec<9 Then prec=9\n prec1=2*prec\n eps=10**(-prec1)\n k = 1\n Numeric Digits 3\n r0= x\n r = 1\n Do i=1 By 1 Until r=r0 | (abs(r*r-x)<eps)\n r0 = r\n r = (r + x/r) / 2\n k = min(prec1,2*k)\n Numeric Digits (k + 5)\n End\n Numeric Digits prec\n r=r+0\n Return r\n","language":"REXX"},{"code":"#[derive(Copy, Clone)]\nstruct Point {\n x: f64,\n y: f64,\n}\n\nuse std::fmt;\n\nimpl fmt::Display for Point {\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n write!(f, \"({}, {})\", self.x, self.y)\n }\n}\n\n// Returns the distance from point p to the line between p1 and p2\nfn perpendicular_distance(p: &Point, p1: &Point, p2: &Point) -> f64 {\n let dx = p2.x - p1.x;\n let dy = p2.y - p1.y;\n (p.x * dy - p.y * dx + p2.x * p1.y - p2.y * p1.x).abs() / dx.hypot(dy)\n}\n\nfn rdp(points: &[Point], epsilon: f64, result: &mut Vec<Point>) {\n let n = points.len();\n if n < 2 {\n return;\n }\n let mut max_dist = 0.0;\n let mut index = 0;\n for i in 1..n - 1 {\n let dist = perpendicular_distance(&points[i], &points[0], &points[n - 1]);\n if dist > max_dist {\n max_dist = dist;\n index = i;\n }\n }\n if max_dist > epsilon {\n rdp(&points[0..=index], epsilon, result);\n rdp(&points[index..n], epsilon, result);\n } else {\n result.push(points[n - 1]);\n }\n}\n\nfn ramer_douglas_peucker(points: &[Point], epsilon: f64) -> Vec<Point> {\n let mut result = Vec::new();\n if points.len() > 0 && epsilon >= 0.0 {\n result.push(points[0]);\n rdp(points, epsilon, &mut result);\n }\n result\n}\n\nfn main() {\n let points = vec![\n Point { x: 0.0, y: 0.0 },\n Point { x: 1.0, y: 0.1 },\n Point { x: 2.0, y: -0.1 },\n Point { x: 3.0, y: 5.0 },\n Point { x: 4.0, y: 6.0 },\n Point { x: 5.0, y: 7.0 },\n Point { x: 6.0, y: 8.1 },\n Point { x: 7.0, y: 9.0 },\n Point { x: 8.0, y: 9.0 },\n Point { x: 9.0, y: 9.0 },\n ];\n for p in ramer_douglas_peucker(&points, 1.0) {\n println!(\"{}\", p);\n }\n}\n","language":"Rust"},{"code":"// [dependencies]\n// geo = \"0.14\"\n\nuse geo::algorithm::simplify::Simplify;\nuse geo::line_string;\n\nfn main() {\n let points = line_string![\n (x: 0.0, y: 0.0),\n (x: 1.0, y: 0.1),\n (x: 2.0, y: -0.1),\n (x: 3.0, y: 5.0),\n (x: 4.0, y: 6.0),\n (x: 5.0, y: 7.0),\n (x: 6.0, y: 8.1),\n (x: 7.0, y: 9.0),\n (x: 8.0, y: 9.0),\n (x: 9.0, y: 9.0),\n ];\n for p in points.simplify(&1.0) {\n println!(\"({}, {})\", p.x, p.y);\n }\n}\n","language":"Rust"},{"code":"// version 1.1.0\n\nobject SimplifyPolyline extends App {\n type Point = (Double, Double)\n\n def perpendicularDistance(\n pt: Point,\n lineStart: Point,\n lineEnd: Point\n ): Double = {\n var dx = lineEnd._1 - lineStart._1\n var dy = lineEnd._2 - lineStart._2\n\n // Normalize\n val mag = math.hypot(dx, dy)\n if (mag > 0.0) { dx /= mag; dy /= mag }\n val pvx = pt._1 - lineStart._1\n val pvy = pt._2 - lineStart._2\n\n // Get dot product (project pv onto normalized direction)\n val pvdot = dx * pvx + dy * pvy\n\n // Scale line direction vector and subtract it from pv\n val ax = pvx - pvdot * dx\n val ay = pvy - pvdot * dy\n\n math.hypot(ax, ay)\n }\n\n def RamerDouglasPeucker(\n pointList: List[Point],\n epsilon: Double\n ): List[Point] = {\n if (pointList.length < 2)\n throw new IllegalArgumentException(\"Not enough points to simplify\")\n\n // Check if there are points to process\n if (pointList.length > 2) {\n // Find the point with the maximum distance from the line between the first and last\n val (dmax, index) = pointList.zipWithIndex\n .slice(1, pointList.length - 1)\n .map { case (point, i) =>\n (perpendicularDistance(point, pointList.head, pointList.last), i)\n }\n .maxBy(_._1)\n\n // If max distance is greater than epsilon, recursively simplify\n if (dmax > epsilon) {\n val firstLine = pointList.take(index + 1)\n val lastLine = pointList.drop(index)\n val recResults1 = RamerDouglasPeucker(firstLine, epsilon)\n val recResults2 = RamerDouglasPeucker(lastLine, epsilon)\n\n // Combine the results\n (recResults1.init ++ recResults2).distinct\n } else {\n // If no point is further than epsilon, return the endpoints\n List(pointList.head, pointList.last)\n }\n } else {\n // If there are only two points, just return them\n pointList\n }\n }\n\n val pointList = List(\n (0.0, 0.0),\n (1.0, 0.1),\n (2.0, -0.1),\n (3.0, 5.0),\n (4.0, 6.0),\n (5.0, 7.0),\n (6.0, 8.1),\n (7.0, 9.0),\n (8.0, 9.0),\n (9.0, 9.0)\n )\n\n val simplifiedPointList = RamerDouglasPeucker(pointList, 1.0)\n println(\"Points remaining after simplification:\")\n simplifiedPointList.foreach(println)\n}\n","language":"Scala"},{"code":"func perpendicular_distance(Arr start, Arr end, Arr point) {\n ((point == start) || (point == end)) && return 0\n var (Δx, Δy ) = ( end »-« start)...\n var (Δpx, Δpy) = (point »-« start)...\n var h = hypot(Δx, Δy)\n [\\Δx, \\Δy].map { *_ /= h }\n (([Δpx, Δpy] »-« ([Δx, Δy] »*» (Δx*Δpx + Δy*Δpy))) »**» 2).sum.sqrt.round(-20)\n}\n\nfunc Ramer_Douglas_Peucker(Arr points { .all { .len > 1 } }, ε = 1) {\n points.len == 2 && return points\n\n var d = (^points -> map {\n perpendicular_distance(points[0], points[-1], points[_])\n })\n\n if (d.max > ε) {\n var i = d.index(d.max)\n return [Ramer_Douglas_Peucker(points.first(i), ε).first(-1)...,\n Ramer_Douglas_Peucker(points.slice(i), ε)...]\n }\n\n return [points[0,-1]]\n}\n\nsay Ramer_Douglas_Peucker(\n [[0,0],[1,0.1],[2,-0.1],[3,5],[4,6],[5,7],[6,8.1],[7,9],[8,9],[9,9]]\n)\n","language":"Sidef"},{"code":"struct Point: CustomStringConvertible {\n let x: Double, y: Double\n\n var description: String {\n return \"(\\(x), \\(y))\"\n }\n}\n\n// Returns the distance from point p to the line between p1 and p2\nfunc perpendicularDistance(p: Point, p1: Point, p2: Point) -> Double {\n let dx = p2.x - p1.x\n let dy = p2.y - p1.y\n let d = (p.x * dy - p.y * dx + p2.x * p1.y - p2.y * p1.x)\n return abs(d)/(dx * dx + dy * dy).squareRoot()\n}\n\nfunc ramerDouglasPeucker(points: [Point], epsilon: Double) -> [Point] {\n var result : [Point] = []\n func rdp(begin: Int, end: Int) {\n guard end > begin else {\n return\n }\n var maxDist = 0.0\n var index = 0\n for i in begin+1..<end {\n let dist = perpendicularDistance(p: points[i], p1: points[begin],\n p2: points[end])\n if dist > maxDist {\n maxDist = dist\n index = i\n }\n }\n if maxDist > epsilon {\n rdp(begin: begin, end: index)\n rdp(begin: index, end: end)\n } else {\n result.append(points[end])\n }\n }\n if points.count > 0 && epsilon >= 0.0 {\n result.append(points[0])\n rdp(begin: 0, end: points.count - 1)\n }\n return result\n}\n\nlet points = [\n Point(x: 0.0, y: 0.0),\n Point(x: 1.0, y: 0.1),\n Point(x: 2.0, y: -0.1),\n Point(x: 3.0, y: 5.0),\n Point(x: 4.0, y: 6.0),\n Point(x: 5.0, y: 7.0),\n Point(x: 6.0, y: 8.1),\n Point(x: 7.0, y: 9.0),\n Point(x: 8.0, y: 9.0),\n Point(x: 9.0, y: 9.0)\n]\nprint(\"\\(ramerDouglasPeucker(points: points, epsilon: 1.0))\")\n","language":"Swift"},{"code":"import \"./dynamic\" for Tuple\n\nvar Point = Tuple.create(\"Point\", [\"x\", \"y\"])\n\nvar rdp // recursive\nrdp = Fn.new { |l, eps|\n var x = 0\n var dMax = -1\n var p1 = l[0]\n var p2 = l[-1]\n var x21 = p2.x - p1.x\n var y21 = p2.y - p1.y\n var i = 0\n for (p in l[1..-1]) {\n var d = (y21*p.x - x21*p.y + p2.x*p1.y - p2.y*p1.x).abs\n if (d > dMax) {\n x = i + 1\n dMax = d\n }\n i = i + 1\n }\n if (dMax > eps) {\n return rdp.call(l[0..x], eps) + rdp.call(l[x..-1], eps)[1..-1]\n }\n return [l[0], l[-1]]\n}\n\nvar points = [\n Point.new(0, 0), Point.new(1, 0.1), Point.new(2, -0.1), Point.new(3, 5), Point.new(4, 6),\n Point.new(5, 7), Point.new(6, 8.1), Point.new(7, 9), Point.new(8, 9), Point.new(9, 9)\n]\nSystem.print(rdp.call(points, 1))\n","language":"Wren"},{"code":"include xpllib; \\for PerpDist and Print\n\nfunc RDP(Points, Size, Epsilon, RemPoints);\n\\Reduce array Points using Ramer-Douglas-Peucker algorithm\n\\Return array of remaining points in RemPoints and its size\nreal Points; int Size; real Epsilon, RemPoints;\nreal Dist, DistMax;\nint Index, I, Size1, Size2;\n[\\Find Index of point farthest from line between first and last points\nDistMax:= 0.; Index:= 0;\nfor I:= 1 to Size-2 do\n [Dist:= PerpDist(Points(I), Points(0), Points(Size-1));\n if Dist > DistMax then\n [DistMax:= Dist;\n Index:= I;\n ];\n ];\nif DistMax <= Epsilon then \\replace in-between points with first and last points\n [RemPoints(0):= Points(0);\n RemPoints(1):= Points(Size-1);\n return 2;\n ]\nelse \\recursively check sub-line-segments\n [Size1:= RDP(Points, Index+1, Epsilon, RemPoints);\n RemPoints:= @RemPoints(Size1-1); \\add retained points to array\n Size2:= RDP(@Points(Index), Size-Index, Epsilon, RemPoints);\n return Size1 + Size2 - 1; \\for point at Index\n ];\n];\n\nreal Points, RemPoints;\nint Size, I;\n[Points:= [ [0.0, 0.0], [1.0, 0.1], [2.0, -0.1], [3.0, 5.0], [4.0, 6.0],\n [5.0, 7.0], [6.0, 8.1], [7.0, 9.0], [8.0, 9.0], [9.0, 9.0] ];\nSize:= 10;\nRemPoints:= RlRes(Size);\nSize:= RDP(Points, Size, 1.0, RemPoints);\nfor I:= 0 to Size-1 do\n [if I > 0 then Print(\", \");\n Print(\"[%1.1g, %1.1g]\", RemPoints(I,0), RemPoints(I,1));\n ];\nCrLf(0);\n]\n","language":"XPL0"},{"code":"sub perpendicularDistance(tabla(), i, ini, fin)\n local dx, cy, mag, pvx, pvy, pvdot, dsx, dsy, ax, ay\n\n dx = tabla(fin, 1) - tabla(ini, 1)\n dy = tabla(fin, 2) - tabla(ini, 2)\n\n //Normalise\n mag = (dx^2 + dy^2)^0.5\n if mag > 0 dx = dx / mag : dy = dy / mag\n\n pvx = tabla(i, 1) - tabla(ini, 1)\n pvy = tabla(i, 2) - tabla(ini, 2)\n\n //Get dot product (project pv onto normalized direction)\n pvdot = dx * pvx + dy * pvy\n\n //Scale line direction vector\n dsx = pvdot * dx\n dsy = pvdot * dy\n\n //Subtract this from pv\n ax = pvx - dsx\n ay = pvy - dsy\n\n return (ax^2 + ay^2)^0.5\nend sub\n\nsub DouglasPeucker(PointList(), ini, fin, epsilon)\n local dmax, index, i, d\n // Find the point with the maximum distance\n\n for i = ini + 1 to fin\n d = perpendicularDistance(PointList(), i, ini, fin)\n if d > dmax index = i : dmax = d\n next\n\n // If max distance is greater than epsilon, recursively simplify\n if dmax > epsilon then\n PointList(index, 3) = true\n // Recursive call\n DouglasPeucker(PointList(), ini, index, epsilon)\n DouglasPeucker(PointList(), index, fin, epsilon)\n end if\nend sub\n\n\ndata 0,0, 1,0.1, 2,-0.1, 3,5, 4,6, 5,7, 6,8.1, 7,9, 8,9, 9,9\n\ndim matriz(10, 3)\n\nfor i = 1 to 10\n read matriz(i, 1), matriz(i, 2)\nnext\n\nDouglasPeucker(matriz(), 1, 10, 1)\n\nmatriz(1, 3) = true : matriz(10, 3) = true\nfor i = 1 to 10\n if matriz(i, 3) print matriz(i, 1), matriz(i, 2)\nnext\n","language":"Yabasic"},{"code":"fcn perpendicularDistance(start,end, point){ // all are tuples: (x,y) -->|d|\n dx,dy := end .zipWith('-,start);\t// deltas\n dpx,dpy := point.zipWith('-,start);\n mag := (dx*dx + dy*dy).sqrt();\n if(mag>0.0){ dx/=mag; dy/=mag; }\n p,dsx,dsy := dx*dpx + dy*dpy, p*dx, p*dy;\n ((dpx - dsx).pow(2) + (dpy - dsy).pow(2)).sqrt()\n}\n\nfcn RamerDouglasPeucker(points,epsilon=1.0){ // list of tuples --> same\n if(points.len()==2) return(points); // but we'll do one point\n d:=points.pump(List, // first result/element is always zero\n fcn(p, s,e){ perpendicularDistance(s,e,p) }.fp1(points[0],points[-1]));\n index,dmax := (0.0).minMaxNs(d)[1], d[index]; // minMaxNs-->index of min & max\n if(dmax>epsilon){\n return(RamerDouglasPeucker(points[0,index],epsilon)[0,-1].extend(\n RamerDouglasPeucker(points[index,*],epsilon)))\n } else return(points[0],points[-1]);\n}\n","language":"Zkl"},{"code":"RamerDouglasPeucker(\n T( T(0.0, 0.0), T(1.0, 0.1), T(2.0, -0.1), T(3.0, 5.0), T(4.0, 6.0),\n T(5.0, 7.0), T(6.0, 8.1), T(7.0, 9.0), T(8.0, 9.0), T(9.0, 9.0) ))\n.println();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Geometry\\n- Recursion\\nfrom: http://rosettacode.org/wiki/Ramer-Douglas-Peucker_line_simplification\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"The '''Ramer–Douglas–Peucker''' algorithm is a line simplification algorithm for reducing the number of points used to define its shape. \\n\\n\\n;Task:\\nUsing the '''Ramer–Douglas–Peucker''' algorithm, simplify the 2D line defined by the points:\\n (0,0) (1,0.1) (2,-0.1) (3,5) (4,6) (5,7) (6,8.1) (7,9) (8,9) (9,9) \\n\\nThe error threshold to be used is: '''1.0'''. \\n\\nDisplay the remaining points here.\\n\\n\\n;Reference:\\n:* the Wikipedia article: [https://en.wikipedia.org/wiki/Ramer%E2%80%93Douglas%E2%80%93Peucker_algorithm Ramer-Douglas-Peucker algorithm].\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F rdp(l, ε) -> [(Float, Float)]\\n V x = 0\\n V dMax = -1.0\\n V p1 = l[0]\\n V p2 = l.last\\n V p21 = p2 - p1\\n\\n L(p) l[1.<(len)-1]\\n V d = abs(cross(p, p21) + cross(p2, p1))\\n I d > dMax\\n x = L.index + 1\\n dMax = d\\n\\n I dMax > ε\\n R rdp(l[0..x], ε) [+] rdp(l[x..], ε)[1..]\\n\\n R [l[0], l.last]\\n\\nprint(rdp([(0.0, 0.0),\\n (1.0, 0.1),\\n (2.0,-0.1),\\n (3.0, 5.0),\\n (4.0, 6.0),\\n (5.0, 7.0),\\n (6.0, 8.1),\\n (7.0, 9.0),\\n (8.0, 9.0),\\n (9.0, 9.0)], 1.0))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"BEGIN # Ramer Douglas Peucker algotithm - translated from the Go sample #\\n\\n MODE POINT = STRUCT( REAL x, y );\\n\\n PRIO APPEND = 1;\\n OP APPEND = ( []POINT a, b )[]POINT: # append two POINT arrays #\\n BEGIN\\n INT len a = ( UPB a - LWB a ) + 1;\\n INT len b = ( UPB b - LWB b ) + 1;\\n [ 1 : lena + len b ]POINT result;\\n result[ : len a ] := a;\\n result[ len a + 1 : ] := b;\\n result\\n END # APPEND # ;\\n\\n PROC rdp = ( []POINT l, REAL epsilon )[]POINT: # Ramer Douglas Peucker #\\n BEGIN # algorithm #\\n INT x := 0;\\n REAL d max := -1;\\n POINT p1 = l[ LWB l ];\\n POINT p2 = l[ UPB l ];\\n REAL x21 = x OF p2 - x OF p1;\\n REAL y21 = y OF p2 - y OF p1;\\n REAL p2xp1y = x OF p2 * y OF p1;\\n REAL p2yp1x = y OF p2 * x OF p1;\\n FOR i FROM LWB l TO UPB l DO\\n POINT p = l[ i ];\\n IF REAL d := ABS ( y21 * x OF p - x21 * y OF p + p2xp1y - p2yp1x); d > d max\\n THEN\\n x := i;\\n d max := d\\n FI\\n OD;\\n IF d max > epsilon THEN\\n rdp( l[ : x ], epsilon ) APPEND rdp( l[ x + 1 : ], epsilon )\\n ELSE\\n []POINT( l[ LWB l ], l[ UPB l ] )\\n FI\\n END # rdp # ;\\n\\n OP FMT = ( REAL v )STRING: # formsts v with up to 2 decimals #\\n BEGIN\\n STRING result := fixed( ABS v, 0, 2 );\\n IF result[ LWB result ] = \\\".\\\" THEN \\\"0\\\" +=: result FI;\\n WHILE result[ UPB result ] = \\\"0\\\" DO result := result[ : UPB result - 1 ] OD;\\n IF result[ UPB result ] = \\\".\\\" THEN result := result[ : UPB result - 1 ] FI;\\n IF v < 0 THEN \\\"-\\\" + result ELSE result FI\\n END # FMT # ;\\n OP SHOW = ( []POINT a )VOID: # prints an array of points #\\n BEGIN\\n print( ( \\\"[\\\" ) );\\n FOR i FROM LWB a TO UPB a DO\\n print( ( \\\" ( \\\", FMT x OF a[ i ], \\\", \\\", FMT y OF a[ i ], \\\" )\\\" ) )\\n OD;\\n print( ( \\\" ]\\\" ) )\\n END # SHOW # ;\\n\\n SHOW rdp( ( ( 0, 0 ), ( 1, 0.1 ), ( 2, -0.1 ), ( 3, 5 ), ( 4, 6 )\\n , ( 5, 7 ), ( 6, 8.1 ), ( 7, 9 ), ( 8, 9 ), ( 9, 9 )\\n )\\n , 1\\n )\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <assert.h>\\n#include <math.h>\\n#include <stdio.h>\\n\\ntypedef struct point_tag {\\n double x;\\n double y;\\n} point_t;\\n\\n// Returns the distance from point p to the line between p1 and p2\\ndouble perpendicular_distance(point_t p, point_t p1, point_t p2) {\\n double dx = p2.x - p1.x;\\n double dy = p2.y - p1.y;\\n double d = sqrt(dx * dx + dy * dy);\\n return fabs(p.x * dy - p.y * dx + p2.x * p1.y - p2.y * p1.x)/d;\\n}\\n\\n// Simplify an array of points using the Ramer–Douglas–Peucker algorithm.\\n// Returns the number of output points.\\nsize_t douglas_peucker(const point_t* points, size_t n, double epsilon,\\n point_t* dest, size_t destlen) {\\n assert(n >= 2);\\n assert(epsilon >= 0);\\n double max_dist = 0;\\n size_t index = 0;\\n for (size_t i = 1; i + 1 < n; ++i) {\\n double dist = perpendicular_distance(points[i], points[0], points[n - 1]);\\n if (dist > max_dist) {\\n max_dist = dist;\\n index = i;\\n }\\n }\\n if (max_dist > epsilon) {\\n size_t n1 = douglas_peucker(points, index + 1, epsilon, dest, destlen);\\n if (destlen >= n1 - 1) {\\n destlen -= n1 - 1;\\n dest += n1 - 1;\\n } else {\\n destlen = 0;\\n }\\n size_t n2 = douglas_peucker(points + index, n - index, epsilon, dest, destlen);\\n return n1 + n2 - 1;\\n }\\n if (destlen >= 2) {\\n dest[0] = points[0];\\n dest[1] = points[n - 1];\\n }\\n return 2;\\n}\\n\\nvoid print_points(const point_t* points, size_t n) {\\n for (size_t i = 0; i < n; ++i) {\\n if (i > 0)\\n printf(\\\" \\\");\\n printf(\\\"(%g, %g)\\\", points[i].x, points[i].y);\\n }\\n printf(\\\"\\\\n\\\");\\n}\\n\\nint main() {\\n point_t points[] = {\\n {0,0}, {1,0.1}, {2,-0.1}, {3,5}, {4,6},\\n {5,7}, {6,8.1}, {7,9}, {8,9}, {9,9}\\n };\\n const size_t len = sizeof(points)/sizeof(points[0]);\\n point_t out[len];\\n size_t n = douglas_peucker(points, len, 1.0, out, len);\\n print_points(out, n);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <cmath>\\n#include <utility>\\n#include <vector>\\n#include <stdexcept>\\nusing namespace std;\\n\\ntypedef std::pair<double, double> Point;\\n\\ndouble PerpendicularDistance(const Point &pt, const Point &lineStart, const Point &lineEnd)\\n{\\n\\tdouble dx = lineEnd.first - lineStart.first;\\n\\tdouble dy = lineEnd.second - lineStart.second;\\n\\n\\t//Normalise\\n\\tdouble mag = pow(pow(dx,2.0)+pow(dy,2.0),0.5);\\n\\tif(mag > 0.0)\\n\\t{\\n\\t\\tdx /= mag; dy /= mag;\\n\\t}\\n\\n\\tdouble pvx = pt.first - lineStart.first;\\n\\tdouble pvy = pt.second - lineStart.second;\\n\\n\\t//Get dot product (project pv onto normalized direction)\\n\\tdouble pvdot = dx * pvx + dy * pvy;\\n\\n\\t//Scale line direction vector\\n\\tdouble dsx = pvdot * dx;\\n\\tdouble dsy = pvdot * dy;\\n\\n\\t//Subtract this from pv\\n\\tdouble ax = pvx - dsx;\\n\\tdouble ay = pvy - dsy;\\n\\n\\treturn pow(pow(ax,2.0)+pow(ay,2.0),0.5);\\n}\\n\\nvoid RamerDouglasPeucker(const vector<Point> &pointList, double epsilon, vector<Point> &out)\\n{\\n\\tif(pointList.size()<2)\\n\\t\\tthrow invalid_argument(\\\"Not enough points to simplify\\\");\\n\\n\\t// Find the point with the maximum distance from line between start and end\\n\\tdouble dmax = 0.0;\\n\\tsize_t index = 0;\\n\\tsize_t end = pointList.size()-1;\\n\\tfor(size_t i = 1; i < end; i++)\\n\\t{\\n\\t\\tdouble d = PerpendicularDistance(pointList[i], pointList[0], pointList[end]);\\n\\t\\tif (d > dmax)\\n\\t\\t{\\n\\t\\t\\tindex = i;\\n\\t\\t\\tdmax = d;\\n\\t\\t}\\n\\t}\\n\\n\\t// If max distance is greater than epsilon, recursively simplify\\n\\tif(dmax > epsilon)\\n\\t{\\n\\t\\t// Recursive call\\n\\t\\tvector<Point> recResults1;\\n\\t\\tvector<Point> recResults2;\\n\\t\\tvector<Point> firstLine(pointList.begin(), pointList.begin()+index+1);\\n\\t\\tvector<Point> lastLine(pointList.begin()+index, pointList.end());\\n\\t\\tRamerDouglasPeucker(firstLine, epsilon, recResults1);\\n\\t\\tRamerDouglasPeucker(lastLine, epsilon, recResults2);\\n\\n\\t\\t// Build the result list\\n\\t\\tout.assign(recResults1.begin(), recResults1.end()-1);\\n\\t\\tout.insert(out.end(), recResults2.begin(), recResults2.end());\\n\\t\\tif(out.size()<2)\\n\\t\\t\\tthrow runtime_error(\\\"Problem assembling output\\\");\\n\\t}\\n\\telse\\n\\t{\\n\\t\\t//Just return start and end points\\n\\t\\tout.clear();\\n\\t\\tout.push_back(pointList[0]);\\n\\t\\tout.push_back(pointList[end]);\\n\\t}\\n}\\n\\nint main()\\n{\\n\\tvector<Point> pointList;\\n\\tvector<Point> pointListOut;\\n\\n\\tpointList.push_back(Point(0.0, 0.0));\\n\\tpointList.push_back(Point(1.0, 0.1));\\n\\tpointList.push_back(Point(2.0, -0.1));\\n\\tpointList.push_back(Point(3.0, 5.0));\\n\\tpointList.push_back(Point(4.0, 6.0));\\n\\tpointList.push_back(Point(5.0, 7.0));\\n\\tpointList.push_back(Point(6.0, 8.1));\\n\\tpointList.push_back(Point(7.0, 9.0));\\n\\tpointList.push_back(Point(8.0, 9.0));\\n\\tpointList.push_back(Point(9.0, 9.0));\\n\\n\\tRamerDouglasPeucker(pointList, 1.0, pointListOut);\\n\\n\\tcout << \\\"result\\\" << endl;\\n\\tfor(size_t i=0;i< pointListOut.size();i++)\\n\\t{\\n\\t\\tcout << pointListOut[i].first << \\\",\\\" << pointListOut[i].second << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\nnamespace LineSimplification {\\n using Point = Tuple<double, double>;\\n\\n class Program {\\n static double PerpendicularDistance(Point pt, Point lineStart, Point lineEnd) {\\n double dx = lineEnd.Item1 - lineStart.Item1;\\n double dy = lineEnd.Item2 - lineStart.Item2;\\n\\n // Normalize\\n double mag = Math.Sqrt(dx * dx + dy * dy);\\n if (mag > 0.0) {\\n dx /= mag;\\n dy /= mag;\\n }\\n double pvx = pt.Item1 - lineStart.Item1;\\n double pvy = pt.Item2 - lineStart.Item2;\\n\\n // Get dot product (project pv onto normalized direction)\\n double pvdot = dx * pvx + dy * pvy;\\n\\n // Scale line direction vector and subtract it from pv\\n double ax = pvx - pvdot * dx;\\n double ay = pvy - pvdot * dy;\\n\\n return Math.Sqrt(ax * ax + ay * ay);\\n }\\n\\n static void RamerDouglasPeucker(List<Point> pointList, double epsilon, List<Point> output) {\\n if (pointList.Count < 2) {\\n throw new ArgumentOutOfRangeException(\\\"Not enough points to simplify\\\");\\n }\\n\\n // Find the point with the maximum distance from line between the start and end\\n double dmax = 0.0;\\n int index = 0;\\n int end = pointList.Count - 1;\\n for (int i = 1; i < end; ++i) {\\n double d = PerpendicularDistance(pointList[i], pointList[0], pointList[end]);\\n if (d > dmax) {\\n index = i;\\n dmax = d;\\n }\\n }\\n\\n // If max distance is greater than epsilon, recursively simplify\\n if (dmax > epsilon) {\\n List<Point> recResults1 = new List<Point>();\\n List<Point> recResults2 = new List<Point>();\\n List<Point> firstLine = pointList.Take(index + 1).ToList();\\n List<Point> lastLine = pointList.Skip(index).ToList();\\n RamerDouglasPeucker(firstLine, epsilon, recResults1);\\n RamerDouglasPeucker(lastLine, epsilon, recResults2);\\n\\n // build the result list\\n output.AddRange(recResults1.Take(recResults1.Count - 1));\\n output.AddRange(recResults2);\\n if (output.Count < 2) throw new Exception(\\\"Problem assembling output\\\");\\n }\\n else {\\n // Just return start and end points\\n output.Clear();\\n output.Add(pointList[0]);\\n output.Add(pointList[pointList.Count - 1]);\\n }\\n }\\n\\n static void Main(string[] args) {\\n List<Point> pointList = new List<Point>() {\\n new Point(0.0,0.0),\\n new Point(1.0,0.1),\\n new Point(2.0,-0.1),\\n new Point(3.0,5.0),\\n new Point(4.0,6.0),\\n new Point(5.0,7.0),\\n new Point(6.0,8.1),\\n new Point(7.0,9.0),\\n new Point(8.0,9.0),\\n new Point(9.0,9.0),\\n };\\n List<Point> pointListOut = new List<Point>();\\n RamerDouglasPeucker(pointList, 1.0, pointListOut);\\n Console.WriteLine(\\\"Points remaining after simplification:\\\");\\n pointListOut.ForEach(p => Console.WriteLine(p));\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"import std.algorithm;\\nimport std.exception : enforce;\\nimport std.math;\\nimport std.stdio;\\n\\nvoid main() {\\n creal[] pointList = [\\n 0.0 + 0.0i,\\n 1.0 + 0.1i,\\n 2.0 + -0.1i,\\n 3.0 + 5.0i,\\n 4.0 + 6.0i,\\n 5.0 + 7.0i,\\n 6.0 + 8.1i,\\n 7.0 + 9.0i,\\n 8.0 + 9.0i,\\n 9.0 + 9.0i\\n ];\\n creal[] pointListOut;\\n\\n ramerDouglasPeucker(pointList, 1.0, pointListOut);\\n\\n writeln(\\\"result\\\");\\n for (size_t i=0; i< pointListOut.length; i++) {\\n writeln(pointListOut[i].re, \\\",\\\", pointListOut[i].im);\\n }\\n}\\n\\nreal perpendicularDistance(const creal pt, const creal lineStart, const creal lineEnd) {\\n creal d = lineEnd - lineStart;\\n\\n //Normalise\\n real mag = hypot(d.re, d.im);\\n if (mag > 0.0) {\\n d /= mag;\\n }\\n\\n creal pv = pt - lineStart;\\n\\n //Get dot product (project pv onto normalized direction)\\n real pvdot = d.re * pv.re + d.im * pv.im;\\n\\n //Scale line direction vector\\n creal ds = pvdot * d;\\n\\n //Subtract this from pv\\n creal a = pv - ds;\\n\\n return hypot(a.re, a.im);\\n}\\n\\nvoid ramerDouglasPeucker(const creal[] pointList, real epsilon, ref creal[] output) {\\n enforce(pointList.length >= 2, \\\"Not enough points to simplify\\\");\\n\\n // Find the point with the maximum distance from line between start and end\\n real dmax = 0.0;\\n size_t index = 0;\\n size_t end = pointList.length-1;\\n for (size_t i=1; i<end; i++) {\\n real d = perpendicularDistance(pointList[i], pointList[0], pointList[end]);\\n if (d > dmax) {\\n index = i;\\n dmax = d;\\n }\\n }\\n\\n // If max distance is greater than epsilon, recursively simplify\\n if (dmax > epsilon) {\\n // Recursive call\\n creal[] firstLine = pointList[0..index+1].dup;\\n creal[] lastLine = pointList[index+1..$].dup;\\n\\n creal[] recResults1;\\n ramerDouglasPeucker(firstLine, epsilon, recResults1);\\n\\n creal[] recResults2;\\n ramerDouglasPeucker(lastLine, epsilon, recResults2);\\n\\n // Build the result list\\n output = recResults1 ~ recResults2;\\n\\n enforce(output.length>=2, \\\"Problem assembling output\\\");\\n } else {\\n //Just return start and end points\\n output.length = 0;\\n output ~= pointList[0];\\n output ~= pointList[end];\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"func perpdist px py p1x p1y p2x p2y .\\n dx = p2x - p1x\\n dy = p2y - p1y\\n d = sqrt (dx * dx + dy * dy)\\n return abs (px * dy - py * dx + p2x * p1y - p2y * p1x) / d\\n.\\nproc peucker eps . ptx[] pty[] outx[] outy[] .\\n n = len ptx[]\\n idx = 1\\n for i = 2 to n - 1\\n dist = perpdist ptx[i] pty[i] ptx[1] pty[1] ptx[n] pty[n]\\n if dist > dmax\\n dmax = dist\\n idx = i\\n .\\n .\\n if dmax > eps\\n for i to idx\\n px[] &= ptx[i]\\n py[] &= pty[i]\\n .\\n peucker eps px[] py[] outx[] outy[]\\n #\\n for i = idx to n\\n p2x[] &= ptx[i]\\n p2y[] &= pty[i]\\n .\\n peucker eps p2x[] p2y[] ox[] oy[]\\n for i = 2 to len ox[]\\n outx[] &= ox[i]\\n outy[] &= oy[i]\\n .\\n else\\n outx[] = [ ptx[1] ptx[n] ]\\n outy[] = [ pty[1] pty[n] ]\\n .\\n.\\nproc prpts px[] py[] . .\\n for i to len px[]\\n write \\\"(\\\" & px[i] & \\\" \\\" & py[i] & \\\") \\\"\\n .\\n print \\\"\\\"\\n.\\npx[] = [ 0 1 2 3 4 5 6 7 8 9 ]\\npy[] = [ 0 0.1 -0.1 5 6 7 8.1 9 9 9 ]\\npeucker 1 px[] py[] ox[] oy[]\\nprpts ox[] oy[]\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"Function DistanciaPerpendicular(tabla() As Double, i As Integer, ini As Integer, fin As Integer) As Double\\n Dim As Double dx, dy, mag, pvx, pvy, pvdot, dsx, dsy, ax, ay\\n\\n dx = tabla(fin, 1) - tabla(ini, 1)\\n dy = tabla(fin, 2) - tabla(ini, 2)\\n\\n 'Normaliza\\n mag = (dx^2 + dy^2)^0.5\\n If mag > 0 Then dx /= mag : dy /= mag\\n\\n pvx = tabla(i, 1) - tabla(ini, 1)\\n pvy = tabla(i, 2) - tabla(ini, 2)\\n\\n 'Producto escalado (proyecto pv en dirección normalizada)\\n pvdot = dx * pvx + dy * pvy\\n\\n 'Vector de dirección de línea de escala\\n dsx = pvdot * dx\\n dsy = pvdot * dy\\n\\n 'Reste esto de pv\\n ax = pvx - dsx\\n ay = pvy - dsy\\n\\n Return (ax^2 + ay^2)^0.5\\nEnd Function\\n\\nSub DRDP(ListaDePuntos() As Double, ini As Integer, fin As Integer, epsilon As Double)\\n Dim As Double dmax, d\\n Dim As Integer indice, i\\n ' Encuentra el punto con la distancia máxima\\n\\n If Ubound(ListaDePuntos) < 2 Then Print \\\"No hay suficientes puntos para simplificar \\\" : Sleep : End\\n\\n For i = ini + 1 To fin\\n d = DistanciaPerpendicular(ListaDePuntos(), i, ini, fin)\\n If d > dmax Then indice = i : dmax = d\\n Next\\n\\n ' Si la distancia máxima es mayor que épsilon, simplifique de forma recursiva\\n If dmax > epsilon Then\\n ListaDePuntos(indice, 3) = True\\n DRDP(ListaDePuntos(), ini, indice, epsilon)\\n DRDP(ListaDePuntos(), indice, fin, epsilon)\\n End If\\nEnd Sub\\n\\nDim As Double matriz(1 To 10, 1 To 3)\\nData 0, 0, 1, 0.1, 2, -0.1, 3, 5, 4, 6, 5, 7, 6, 8.1, 7, 9, 8, 9, 9, 9\\nFor i As Integer = Lbound(matriz) To Ubound(matriz)\\n Read matriz(i, 1), matriz(i, 2)\\nNext i\\n\\nDRDP(matriz(), 1, 10, 1)\\n\\nPrint \\\"Puntos restantes tras de simplificar:\\\"\\nmatriz(1, 3) = True : matriz(10, 3) = True\\nFor i As Integer = Lbound(matriz) To Ubound(matriz)\\n If matriz(i, 3) Then Print \\\"(\\\";matriz(i, 1);\\\", \\\"; matriz(i, 2);\\\") \\\";\\nNext i\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n)\\n\\ntype point struct{ x, y float64 }\\n\\nfunc RDP(l []point, ε float64) []point {\\n x := 0\\n dMax := -1.\\n last := len(l) - 1\\n p1 := l[0]\\n p2 := l[last]\\n x21 := p2.x - p1.x\\n y21 := p2.y - p1.y\\n for i, p := range l[1:last] {\\n if d := math.Abs(y21*p.x - x21*p.y + p2.x*p1.y - p2.y*p1.x); d > dMax {\\n x = i + 1\\n dMax = d\\n }\\n }\\n if dMax > ε {\\n return append(RDP(l[:x+1], ε), RDP(l[x:], ε)[1:]...)\\n }\\n return []point{l[0], l[len(l)-1]}\\n}\\n\\nfunc main() {\\n fmt.Println(RDP([]point{{0, 0}, {1, 0.1}, {2, -0.1},\\n {3, 5}, {4, 6}, {5, 7}, {6, 8.1}, {7, 9}, {8, 9}, {9, 9}}, 1))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"mp=: +/ .* NB. matrix product\\nnorm=: +/&.:*: NB. vector norm\\nnormalize=: (% norm)^:(0 < norm)\\n\\ndxy=. normalize@({: - {.)\\npv=. -\\\"1 {.\\nNB.*perpDist v Calculate perpendicular distance of points from a line\\nperpDist=: norm\\\"1@(pv ([ -\\\"1 mp\\\"1~ */ ]) dxy) f.\\n\\nrdp=: verb define\\n 1 rdp y\\n :\\n points=. ,:^:(2 > #@$) y\\n epsilon=. x\\n if. 2 > # points do. points return. end.\\n\\n NB. point with the maximum distance from line between start and end\\n 'imax dmax'=. ((i. , ]) >./) perpDist points\\n if. dmax > epsilon do.\\n epsilon ((}:@rdp (1+imax)&{.) , (rdp imax&}.)) points\\n else.\\n ({. ,: {:) points\\n end.\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" Points=: 0 0,1 0.1,2 _0.1,3 5,4 6,5 7,6 8.1,7 9,8 9,:9 9\\n 1.0 rdp Points\\n0 0\\n2 _0.1\\n3 5\\n7 9\\n9 9\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import javafx.util.Pair;\\n\\nimport java.util.ArrayList;\\nimport java.util.List;\\n\\npublic class LineSimplification {\\n private static class Point extends Pair<Double, Double> {\\n Point(Double key, Double value) {\\n super(key, value);\\n }\\n\\n @Override\\n public String toString() {\\n return String.format(\\\"(%f, %f)\\\", getKey(), getValue());\\n }\\n }\\n\\n private static double perpendicularDistance(Point pt, Point lineStart, Point lineEnd) {\\n double dx = lineEnd.getKey() - lineStart.getKey();\\n double dy = lineEnd.getValue() - lineStart.getValue();\\n\\n // Normalize\\n double mag = Math.hypot(dx, dy);\\n if (mag > 0.0) {\\n dx /= mag;\\n dy /= mag;\\n }\\n double pvx = pt.getKey() - lineStart.getKey();\\n double pvy = pt.getValue() - lineStart.getValue();\\n\\n // Get dot product (project pv onto normalized direction)\\n double pvdot = dx * pvx + dy * pvy;\\n\\n // Scale line direction vector and subtract it from pv\\n double ax = pvx - pvdot * dx;\\n double ay = pvy - pvdot * dy;\\n\\n return Math.hypot(ax, ay);\\n }\\n\\n private static void ramerDouglasPeucker(List<Point> pointList, double epsilon, List<Point> out) {\\n if (pointList.size() < 2) throw new IllegalArgumentException(\\\"Not enough points to simplify\\\");\\n\\n // Find the point with the maximum distance from line between the start and end\\n double dmax = 0.0;\\n int index = 0;\\n int end = pointList.size() - 1;\\n for (int i = 1; i < end; ++i) {\\n double d = perpendicularDistance(pointList.get(i), pointList.get(0), pointList.get(end));\\n if (d > dmax) {\\n index = i;\\n dmax = d;\\n }\\n }\\n\\n // If max distance is greater than epsilon, recursively simplify\\n if (dmax > epsilon) {\\n List<Point> recResults1 = new ArrayList<>();\\n List<Point> recResults2 = new ArrayList<>();\\n List<Point> firstLine = pointList.subList(0, index + 1);\\n List<Point> lastLine = pointList.subList(index, pointList.size());\\n ramerDouglasPeucker(firstLine, epsilon, recResults1);\\n ramerDouglasPeucker(lastLine, epsilon, recResults2);\\n\\n // build the result list\\n out.addAll(recResults1.subList(0, recResults1.size() - 1));\\n out.addAll(recResults2);\\n if (out.size() < 2) throw new RuntimeException(\\\"Problem assembling output\\\");\\n } else {\\n // Just return start and end points\\n out.clear();\\n out.add(pointList.get(0));\\n out.add(pointList.get(pointList.size() - 1));\\n }\\n }\\n\\n public static void main(String[] args) {\\n List<Point> pointList = List.of(\\n new Point(0.0, 0.0),\\n new Point(1.0, 0.1),\\n new Point(2.0, -0.1),\\n new Point(3.0, 5.0),\\n new Point(4.0, 6.0),\\n new Point(5.0, 7.0),\\n new Point(6.0, 8.1),\\n new Point(7.0, 9.0),\\n new Point(8.0, 9.0),\\n new Point(9.0, 9.0)\\n );\\n List<Point> pointListOut = new ArrayList<>();\\n ramerDouglasPeucker(pointList, 1.0, pointListOut);\\n System.out.println(\\\"Points remaining after simplification:\\\");\\n pointListOut.forEach(System.out::println);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"/**\\n * @typedef {{\\n * x: (!number),\\n * y: (!number)\\n * }}\\n */\\nlet pointType;\\n\\n/**\\n * @param {!Array<pointType>} l\\n * @param {number} eps\\n */\\nconst RDP = (l, eps) => {\\n const last = l.length - 1;\\n const p1 = l[0];\\n const p2 = l[last];\\n const x21 = p2.x - p1.x;\\n const y21 = p2.y - p1.y;\\n\\n const [dMax, x] = l.slice(1, last)\\n .map(p => Math.abs(y21 * p.x - x21 * p.y + p2.x * p1.y - p2.y * p1.x))\\n .reduce((p, c, i) => {\\n const v = Math.max(p[0], c);\\n return [v, v === p[0] ? p[1] : i + 1];\\n }, [-1, 0]);\\n\\n if (dMax > eps) {\\n return [...RDP(l.slice(0, x + 1), eps), ...RDP(l.slice(x), eps).slice(1)];\\n }\\n return [l[0], l[last]]\\n};\\n\\nconst points = [\\n {x: 0, y: 0},\\n {x: 1, y: 0.1},\\n {x: 2, y: -0.1},\\n {x: 3, y: 5},\\n {x: 4, y: 6},\\n {x: 5, y: 7},\\n {x: 6, y: 8.1},\\n {x: 7, y: 9},\\n {x: 8, y: 9},\\n {x: 9, y: 9}];\\n\\nconsole.log(RDP(points, 1));\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"const Point = Vector{Float64}\\n\\nfunction perpdist(pt::Point, lnstart::Point, lnend::Point)\\n d = normalize!(lnend .- lnstart)\\n\\n pv = pt .- lnstart\\n # Get dot product (project pv onto normalized direction)\\n pvdot = dot(d, pv)\\n # Scale line direction vector\\n ds = pvdot .* d\\n # Subtract this from pv\\n return norm(pv .- ds)\\nend\\n\\nfunction rdp(plist::Vector{Point}, ϵ::Float64 = 1.0)\\n if length(plist) < 2\\n throw(ArgumentError(\\\"not enough points to simplify\\\"))\\n end\\n\\n # Find the point with the maximum distance from line between start and end\\n distances = collect(perpdist(pt, plist[1], plist[end]) for pt in plist)\\n dmax, imax = findmax(distances)\\n\\n # If max distance is greater than epsilon, recursively simplify\\n if dmax > ϵ\\n fstline = plist[1:imax]\\n lstline = plist[imax:end]\\n\\n recrst1 = rdp(fstline, ϵ)\\n recrst2 = rdp(lstline, ϵ)\\n\\n out = vcat(recrst1, recrst2)\\n else\\n out = [plist[1], plist[end]]\\n end\\n\\n return out\\nend\\n\\nplist = Point[[0.0, 0.0], [1.0, 0.1], [2.0, -0.1], [3.0, 5.0], [4.0, 6.0], [5.0, 7.0], [6.0, 8.1], [7.0, 9.0], [8.0, 9.0], [9.0, 9.0]]\\n@show plist\\n@show rdp(plist)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.0\\n\\ntypealias Point = Pair<Double, Double>\\n\\nfun perpendicularDistance(pt: Point, lineStart: Point, lineEnd: Point): Double {\\n var dx = lineEnd.first - lineStart.first\\n var dy = lineEnd.second - lineStart.second\\n\\n // Normalize\\n val mag = Math.hypot(dx, dy)\\n if (mag > 0.0) { dx /= mag; dy /= mag }\\n val pvx = pt.first - lineStart.first\\n val pvy = pt.second - lineStart.second\\n\\n // Get dot product (project pv onto normalized direction)\\n val pvdot = dx * pvx + dy * pvy\\n\\n // Scale line direction vector and substract it from pv\\n val ax = pvx - pvdot * dx\\n val ay = pvy - pvdot * dy\\n\\n return Math.hypot(ax, ay)\\n}\\n\\nfun RamerDouglasPeucker(pointList: List<Point>, epsilon: Double, out: MutableList<Point>) {\\n if (pointList.size < 2) throw IllegalArgumentException(\\\"Not enough points to simplify\\\")\\n\\n // Find the point with the maximum distance from line between start and end\\n var dmax = 0.0\\n var index = 0\\n val end = pointList.size - 1\\n for (i in 1 until end) {\\n val d = perpendicularDistance(pointList[i], pointList[0], pointList[end])\\n if (d > dmax) { index = i; dmax = d }\\n }\\n\\n // If max distance is greater than epsilon, recursively simplify\\n if (dmax > epsilon) {\\n val recResults1 = mutableListOf<Point>()\\n val recResults2 = mutableListOf<Point>()\\n val firstLine = pointList.take(index + 1)\\n val lastLine = pointList.drop(index)\\n RamerDouglasPeucker(firstLine, epsilon, recResults1)\\n RamerDouglasPeucker(lastLine, epsilon, recResults2)\\n\\n // build the result list\\n out.addAll(recResults1.take(recResults1.size - 1))\\n out.addAll(recResults2)\\n if (out.size < 2) throw RuntimeException(\\\"Problem assembling output\\\")\\n }\\n else {\\n // Just return start and end points\\n out.clear()\\n out.add(pointList.first())\\n out.add(pointList.last())\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val pointList = listOf(\\n Point(0.0, 0.0),\\n Point(1.0, 0.1),\\n Point(2.0, -0.1),\\n Point(3.0, 5.0),\\n Point(4.0, 6.0),\\n Point(5.0, 7.0),\\n Point(6.0, 8.1),\\n\\tPoint(7.0, 9.0),\\n\\tPoint(8.0, 9.0),\\n Point(9.0, 9.0)\\n )\\n val pointListOut = mutableListOf<Point>()\\n RamerDouglasPeucker(pointList, 1.0, pointListOut)\\n println(\\\"Points remaining after simplification:\\\")\\n for (p in pointListOut) println(p)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"import math\\n\\ntype\\n Point = tuple[x, y: float64]\\n\\nproc pointLineDistance(pt, lineStart, lineEnd: Point): float64 =\\n var n, d, dx, dy: float64\\n dx = lineEnd.x - lineStart.x\\n dy = lineEnd.y - lineStart.y\\n n = abs(dx * (lineStart.y - pt.y) - (lineStart.x - pt.x) * dy)\\n d = sqrt(dx * dx + dy * dy)\\n n / d\\n\\nproc rdp(points: seq[Point], startIndex, lastIndex: int, ε: float64 = 1.0): seq[Point] =\\n var dmax = 0.0\\n var index = startIndex\\n\\n for i in index+1..<lastIndex:\\n var d = pointLineDistance(points[i], points[startIndex], points[lastIndex])\\n if d > dmax:\\n index = i\\n dmax = d\\n\\n if dmax > ε:\\n var res1 = rdp(points, startIndex, index, ε)\\n var res2 = rdp(points, index, lastIndex, ε)\\n\\n var finalRes: seq[Point] = @[]\\n finalRes.add(res1[0..^2])\\n finalRes.add(res2[0..^1])\\n\\n result = finalRes\\n else:\\n result = @[points[startIndex], points[lastIndex]]\\n\\nvar line: seq[Point] = @[(0.0, 0.0), (1.0, 0.1), (2.0, -0.1), (3.0, 5.0), (4.0, 6.0),\\n (5.0, 7.0), (6.0, 8.1), (7.0, 9.0), (8.0, 9.0), (9.0, 9.0)]\\necho rdp(line, line.low, line.high)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"/*REXX program uses the Ramer-Douglas-Peucker (RDP) line simplification algorithm for*/\\n/*--------------------------- reducing the number of points used to define its shape. */\\nParse Arg epsilon pl /*obtain optional arguments from the CL*/\\nIf epsilon='' | epsilon=',' then epsilon= 1 /*Not specified? Then use the default.*/\\nIf pl='' Then pl= '(0,0) (1,0.1) (2,-0.1) (3,5) (4,6) (5,7) (6,8.1) (7,9) (8,9) (9,9)'\\nSay ' error threshold:' epsilon\\nSay ' points specified:' pl\\nSay 'points simplified:' dlp(pl)\\nExit\\ndlp: Procedure Expose epsilon\\n Parse Arg pl\\n plc=pl\\n Do i=1 By 1 While plc<>''\\n Parse Var plc '(' X ',' y ')' plc\\n p.i=.point~new(x,y)\\n End\\n end=i-1\\n dmax=0\\n index=0\\n Do i=2 To end-1\\n d=distpg(p.i,.line~new(p.1,p.end))\\n If d>dmax Then Do\\n index=i\\n dmax=d\\n End\\n End\\n If dmax>epsilon Then Do\\n rla=dlp(subword(pl,1,index))\\n rlb=dlp(subword(pl,index,end))\\n rl=subword(rla,1,words(rla)-1) rlb\\n End\\n Else\\n rl=word(pl,1) word(pl,end)\\n Return rl\\n\\n::CLASS point public\\n::ATTRIBUTE X\\n::ATTRIBUTE Y\\n::METHOD init PUBLIC\\n Expose X Y\\n Use Arg X,Y\\n\\n::CLASS line public\\n::ATTRIBUTE A\\n::ATTRIBUTE B\\n::METHOD init PUBLIC\\n Expose A B\\n Use Arg A,B\\n If A~x=B~x & A~y=B~y Then Do\\n Say 'not a line'\\n Return .nil\\n End\\n\\n::METHOD k PUBLIC\\n Expose A B\\n ax=A~x; ay=A~y; bx=B~x; by=B~y\\n If ax=bx Then\\n res='infinite'\\n Else\\n res=(by-ay)/(bx-ax)\\n Return res\\n\\n::METHOD d PUBLIC\\n Expose A B\\n ax=A~x; ay=A~y\\n If self~k='infinite' Then\\n res='indeterminate'\\n Else\\n res=round(ay-ax*self~k)\\n Return res\\n\\n::ROUTINE distpg PUBLIC --Compute the distance from a point to a line\\n/***********************************************************************\\n* Compute the distance from a point to a line\\n***********************************************************************/\\n Use Arg A,g\\n ax=A~x; ay=A~y\\n k=g~k\\n If k='infinite' Then Do\\n Parse Value g~kxd With 'x='gx\\n res=gx-ax\\n End\\n Else\\n res=(ay-k*ax-g~d)/rxCalcsqrt(1+k**2)\\n Return abs(res)\\n\\n::ROUTINE round PUBLIC --Round a number to 3 decimal digits\\n/***********************************************************************\\n* Round a nmber to 3 decimal digits\\n***********************************************************************/\\n Use Arg z,d\\n Numeric Digits 30\\n res=z+0\\n If d>'' Then\\n res=format(res,9,6)\\n Return strip(res)\\n\\n::requires rxMath library\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"function slice(a, v) = [ for (i = v) a[i] ];\\n\\n// Find the distance from the point to the line\\nfunction perpendicular_distance(pt, start, end) =\\n let (\\n d = end - start,\\n dn = d / norm(d),\\n dp = pt - start,\\n // Dot-product of two vectors\\n ddot = dn * dp,\\n ds = dn * ddot\\n )\\n norm(dp - ds);\\n\\n// Find the point with the maximum distance from line between start and end.\\n// Returns a vector of [dmax, point_index]\\nfunction max_distance(pts, cindex=1, iresult=[0,0]) =\\n let (\\n d = perpendicular_distance(pts[cindex], pts[0],pts[len(pts)-1]),\\n result = (d > iresult[0] ? [d, cindex] : iresult)\\n )\\n (cindex == len(pts) - 1 ?\\n iresult :\\n max_distance(pts, cindex+1, result));\\n\\n// Tail recursion optimization is not possible with tree recursion.\\n//\\n// It's probably possible to optimize this with tail recursion by converting to\\n// iterative approach, see\\n// https://namekdev.net/2014/06/iterative-version-of-ramer-douglas-peucker-line-simplification-algorithm/ .\\n// It's not possible to use iterative approach without recursion at all because\\n// of static nature of OpenSCAD arrays.\\nfunction ramer_douglas_peucker(points, epsilon=1) =\\n let (dmax = max_distance(points))\\n // Simplify the line recursively if the max distance is greater than epsilon\\n (dmax[0] > epsilon ?\\n let (\\n lo = ramer_douglas_peucker(\\n slice(points, [0:dmax[1]]), epsilon),\\n hi = ramer_douglas_peucker(\\n slice(points, [dmax[1]:len(points)-1]), epsilon)\\n )\\n concat(slice(lo, [0:len(lo)-2]), hi) :\\n [points[0],points[len(points)-1]]);\\n\\n/* -- Demo -- */\\n\\nmodule line(points, thickness=1, dot=2) {\\n for (idx = [0:len(points)-2]) {\\n translate(points[idx])\\n sphere(d=dot);\\n hull() {\\n translate(points[idx])\\n sphere(d=thickness);\\n translate(points[idx+1])\\n sphere(d=thickness);\\n }\\n }\\n translate(points[len(points)-1])\\n sphere(d=dot);\\n}\\n\\nfunction addz(pts, z=0) = [ for (p = pts) [p.x, p.y, z] ];\\n\\nmodule demo(pts) {\\n rdp = ramer_douglas_peucker(points=pts, epsilon=1);\\n echo(rdp);\\n color(\\\"gray\\\")\\n line(points=addz(pts, 0), thickness=0.1, dot=0.3);\\n color(\\\"red\\\")\\n line(points=addz(rdp, 1), thickness=0.1, dot=0.3);\\n}\\n\\n$fn=16;\\npoints = [[0,0], [1,0.1], [2,-0.1], [3,5], [4,6], [5,7], [6,8.1], [7,9], [8,9], [9,9]];\\ndemo(points);\\n\",\n \"language\": \"Openscad\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\nuse List::MoreUtils qw(firstidx minmax);\\n\\nmy $epsilon = 1;\\n\\nsub norm {\\n my(@list) = @_;\\n my $sum;\\n $sum += $_**2 for @list;\\n sqrt($sum)\\n}\\n\\nsub perpendicular_distance {\\n our(@start,@end,@point);\\n local(*start,*end,*point) = (shift, shift, shift);\\n return 0 if $start[0]==$point[0] && $start[1]==$point[1]\\n or $end[0]==$point[0] && $end[1]==$point[1];\\n my ( $dx, $dy) = ( $end[0]-$start[0], $end[1]-$start[1]);\\n my ($dpx, $dpy) = ($point[0]-$start[0],$point[1]-$start[1]);\\n my $t = norm($dx, $dy);\\n $dx /= $t;\\n $dy /= $t;\\n norm($dpx - $dx*($dx*$dpx + $dy*$dpy), $dpy - $dy*($dx*$dpx + $dy*$dpy));\\n}\\n\\nsub Ramer_Douglas_Peucker {\\n my(@points) = @_;\\n return @points if @points == 2;\\n my @d;\\n push @d, perpendicular_distance(@points[0, -1, $_]) for 0..@points-1;\\n my(undef,$dmax) = minmax @d;\\n my $index = firstidx { $_ == $dmax } @d;\\n if ($dmax > $epsilon) {\\n my @lo = Ramer_Douglas_Peucker( @points[0..$index]);\\n my @hi = Ramer_Douglas_Peucker( @points[$index..$#points]);\\n return @lo[0..@lo-2], @hi;\\n }\\n @points[0, -1];\\n}\\n\\nsay '(' . join(' ', @$_) . ') '\\n for Ramer_Douglas_Peucker( [0,0],[1,0.1],[2,-0.1],[3,5],[4,6],[5,7],[6,8.1],[7,9],[8,9],[9,9] )\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">rdp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">)<</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"not enough points to simplify\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">idx</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">dMax</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">p1x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p1y</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">p2x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p2y</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">[$],</span>\\n <span style=\\\"color: #000000;\\\">x21</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">p2x</span> <span style=\\\"color: #0000FF;\\\">-</span> <span style=\\\"color: #000000;\\\">p1x</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">y21</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">p2y</span> <span style=\\\"color: #0000FF;\\\">-</span> <span style=\\\"color: #000000;\\\">p1y</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">px</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">py</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">abs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y21</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">px</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">x21</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">py</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">p2x</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">p1y</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">p2y</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">p1x</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">dMax</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">idx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">i</span>\\n <span style=\\\"color: #000000;\\\">dMax</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">d</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">dMax</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">e</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">rdp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">idx</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">&</span> <span style=\\\"color: #000000;\\\">rdp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">idx</span><span style=\\\"color: #0000FF;\\\">..$],</span> <span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">)[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">..$]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">[$]}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">points</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.1</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">0.1</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8.1</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">}}</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">rdp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">points</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"function perpendicular_distance(array $pt, array $line) {\\n // Calculate the normalized delta x and y of the line.\\n $dx = $line[1][0] - $line[0][0];\\n $dy = $line[1][1] - $line[0][1];\\n $mag = sqrt($dx * $dx + $dy * $dy);\\n if ($mag > 0) {\\n $dx /= $mag;\\n $dy /= $mag;\\n }\\n\\n // Calculate dot product, projecting onto normalized direction.\\n $pvx = $pt[0] - $line[0][0];\\n $pvy = $pt[1] - $line[0][1];\\n $pvdot = $dx * $pvx + $dy * $pvy;\\n\\n // Scale line direction vector and subtract from pv.\\n $dsx = $pvdot * $dx;\\n $dsy = $pvdot * $dy;\\n $ax = $pvx - $dsx;\\n $ay = $pvy - $dsy;\\n\\n return sqrt($ax * $ax + $ay * $ay);\\n}\\n\\nfunction ramer_douglas_peucker(array $points, $epsilon) {\\n if (count($points) < 2) {\\n throw new InvalidArgumentException('Not enough points to simplify');\\n }\\n\\n // Find the point with the maximum distance from the line between start/end.\\n $dmax = 0;\\n $index = 0;\\n $end = count($points) - 1;\\n $start_end_line = [$points[0], $points[$end]];\\n for ($i = 1; $i < $end; $i++) {\\n $dist = perpendicular_distance($points[$i], $start_end_line);\\n if ($dist > $dmax) {\\n $index = $i;\\n $dmax = $dist;\\n }\\n }\\n\\n // If max distance is larger than epsilon, recursively simplify.\\n if ($dmax > $epsilon) {\\n $new_start = ramer_douglas_peucker(array_slice($points, 0, $index + 1), $epsilon);\\n $new_end = ramer_douglas_peucker(array_slice($points, $index), $epsilon);\\n array_pop($new_start);\\n return array_merge($new_start, $new_end);\\n }\\n\\n // Max distance is below epsilon, so return a line from with just the\\n // start and end points.\\n return [ $points[0], $points[$end]];\\n}\\n\\n$polyline = [\\n [0,0],\\n [1,0.1],\\n [2,-0.1],\\n [3,5],\\n [4,6],\\n [5,7],\\n [6,8.1],\\n [7,9],\\n [8,9],\\n [9,9],\\n];\\n\\n$result = ramer_douglas_peucker($polyline, 1.0);\\nprint \\\"Result:\\\\n\\\";\\nforeach ($result as $point) {\\n print $point[0] . ',' . $point[1] . \\\"\\\\n\\\";\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"from __future__ import print_function\\nfrom shapely.geometry import LineString\\n\\nif __name__==\\\"__main__\\\":\\n\\tline = LineString([(0,0),(1,0.1),(2,-0.1),(3,5),(4,6),(5,7),(6,8.1),(7,9),(8,9),(9,9)])\\n\\tprint (line.simplify(1.0, preserve_topology=False))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n(require math/flonum)\\n;; points are lists of x y (maybe extensible to z)\\n;; x+y gets both parts as values\\n(define (x+y p) (values (first p) (second p)))\\n\\n;; https://en.wikipedia.org/wiki/Distance_from_a_point_to_a_line\\n(define (⊥-distance P1 P2)\\n (let*-values\\n ([(x1 y1) (x+y P1)]\\n [(x2 y2) (x+y P2)]\\n [(dx dy) (values (- x2 x1) (- y2 y1))]\\n [(h) (sqrt (+ (sqr dy) (sqr dx)))])\\n (λ (P0)\\n (let-values (((x0 y0) (x+y P0)))\\n (/ (abs (+ (* dy x0) (* -1 dx y0) (* x2 y1) (* -1 y2 x1))) h)))))\\n\\n(define (douglas-peucker points-in ϵ)\\n (let recur ((ps points-in))\\n ;; curried distance function which will be applicable to all points\\n (let*-values\\n ([(p0) (first ps)]\\n [(pz) (last ps)]\\n [(p-d) (⊥-distance p0 pz)]\\n ;; Find the point with the maximum distance\\n [(dmax index)\\n (for/fold ((dmax 0) (index 0))\\n ((i (in-range 1 (sub1 (length ps))))) ; skips the first, stops before the last\\n (define d (p-d (list-ref ps i)))\\n (if (> d dmax) (values d i) (values dmax index)))])\\n ;; If max distance is greater than epsilon, recursively simplify\\n (if (> dmax ϵ)\\n ;; recursive call\\n (let-values ([(l r) (split-at ps index)])\\n (append (drop-right (recur l) 1) (recur r)))\\n (list p0 pz))))) ;; else we can return this simplification\\n\\n(module+ main\\n (douglas-peucker\\n '((0 0) (1 0.1) (2 -0.1) (3 5) (4 6) (5 7) (6 8.1) (7 9) (8 9) (9 9))\\n 1.0))\\n\\n(module+ test\\n (require rackunit)\\n (check-= ((⊥-distance '(0 0) '(0 1)) '(1 0)) 1 epsilon.0))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub norm (*@list) { @list»².sum.sqrt }\\n\\nsub perpendicular-distance (@start, @end where @end !eqv @start, @point) {\\n return 0 if @point eqv any(@start, @end);\\n my ( $Δx, $Δy ) = @end «-» @start;\\n my ($Δpx, $Δpy) = @point «-» @start;\\n ($Δx, $Δy) «/=» norm $Δx, $Δy;\\n norm ($Δpx, $Δpy) «-» ($Δx, $Δy) «*» ($Δx*$Δpx + $Δy*$Δpy);\\n}\\n\\nsub Ramer-Douglas-Peucker(@points where * > 1, \\\\ε = 1) {\\n return @points if @points == 2;\\n my @d = (^@points).map: { perpendicular-distance |@points[0, *-1, $_] };\\n my ($index, $dmax) = @d.first: @d.max, :kv;\\n return flat\\n Ramer-Douglas-Peucker( @points[0..$index], ε )[^(*-1)],\\n Ramer-Douglas-Peucker( @points[$index..*], ε )\\n if $dmax > ε;\\n @points[0, *-1];\\n}\\n\\n# TESTING\\nsay Ramer-Douglas-Peucker(\\n [(0,0),(1,0.1),(2,-0.1),(3,5),(4,6),(5,7),(6,8.1),(7,9),(8,9),(9,9)]\\n);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program uses the Ramer─Douglas─Peucker (RDP) line simplification algorithm for*/\\n/*───────────────────────────── reducing the number of points used to define its shape. */\\nparse arg epsilon pts /*obtain optional arguments from the CL*/\\nif epsilon='' | epsilon=\\\",\\\" then epsilon= 1 /*Not specified? Then use the default.*/\\nif pts='' then pts= '(0,0) (1,0.1) (2,-0.1) (3,5) (4,6) (5,7) (6,8.1) (7,9) (8,9) (9,9)'\\npts= space(pts) /*elide all superfluous blanks. */\\n say ' error threshold: ' epsilon /*echo the error threshold to the term.*/\\n say ' points specified: ' pts /* \\\" \\\" shape points \\\" \\\" \\\" */\\n$= RDP(pts) /*invoke Ramer─Douglas─Peucker function*/\\n say 'points simplified: ' rez($) /*display points with () ───► terminal.*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nbld: parse arg _; #= words(_); dMax=-#; idx=1; do j=1 for #; @.j= word(_, j); end; return\\npx: parse arg _; return word( translate(_, , ','), 1) /*obtain the X coörd.*/\\npy: parse arg _; return word( translate(_, , ','), 2) /* \\\" \\\" Y \\\" */\\nreb: parse arg a,b,,_; do k=a to b; _= _ @.k; end; return strip(_)\\nrez: parse arg z,_; do k=1 for words(z); _= _ '('word(z, k)\\\") \\\"; end; return strip(_)\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nRDP: procedure expose epsilon; call bld space( translate(arg(1), , ')(][}{') )\\n L= px(@.#) - px(@.1)\\n H= py(@.#) - py(@.1) /* [↓] find point IDX with max distance*/\\n do i=2 to #-1\\n d= abs(H*px(@.i) - L*py(@.i) + px(@.#)*py(@.1) - py(@.#)*px(@.1))\\n if d>dMax then do; idx= i; dMax= d\\n end\\n end /*i*/ /* [↑] D is the perpendicular distance*/\\n\\n if dMax>epsilon then do; r= RDP( reb(1, idx) )\\n return subword(r, 1, words(r) - 1) RDP( reb(idx, #) )\\n end\\n return @.1 @.#\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program uses the Ramer-Douglas-Peucker (RDP) line simplification algorithm for*/\\n/*--------------------------- reducing the number of points used to define its shape. */\\nParse Arg epsilon pl /*obtain optional arguments from the CL*/\\nIf epsilon='' | epsilon=',' then epsilon= 1 /*Not specified? Then use the default.*/\\nIf pl='' Then pl= '(0,0) (1,0.1) (2,-0.1) (3,5) (4,6) (5,7) (6,8.1) (7,9) (8,9) (9,9)'\\nSay ' error threshold:' epsilon\\nSay ' points specified:' pl\\nSay 'points simplified:' dlp(pl)\\nExit\\ndlp: Procedure Expose epsilon\\n Parse Arg pl\\n plc=pl\\n Do i=1 By 1 While plc<>''\\n Parse Var plc '(' x ',' y ')' plc\\n p.i=x y\\n End\\n end=i-1\\n dmax=0\\n index=0\\n Do i=2 To end-1\\n d=distpg(p.i,p.1,p.end)\\n If d>dmax Then Do\\n index=i\\n dmax=d\\n End\\n End\\n If dmax>epsilon Then Do\\n rla=dlp(subword(pl,1,index))\\n rlb=dlp(subword(pl,index,end))\\n rl=subword(rla,1,words(rla)-1) rlb\\n End\\n Else\\n rl=word(pl,1) word(pl,end)\\n Return rl\\n\\ndistpg: Procedure\\n/**********************************************************************\\n* compute the distance of point P from the line giveb by A and B\\n**********************************************************************/\\n Parse Arg P,A,B\\n Parse Var P px py\\n Parse Var A ax ay\\n Parse Var B bx by\\n If ax=bx Then\\n res=px-ax\\n Else Do\\n k=(by-ay)/(bx-ax)\\n d=(ay-ax*k)\\n res=(py-k*px-d)/sqrt(1+k**2)\\n End\\n Return abs(res)\\nsqrt: Procedure\\n/* REXX ***************************************************************\\n* EXEC to calculate the square root of a = 2 with high precision\\n**********************************************************************/\\n Parse Arg x,prec\\n If prec<9 Then prec=9\\n prec1=2*prec\\n eps=10**(-prec1)\\n k = 1\\n Numeric Digits 3\\n r0= x\\n r = 1\\n Do i=1 By 1 Until r=r0 | (abs(r*r-x)<eps)\\n r0 = r\\n r = (r + x/r) / 2\\n k = min(prec1,2*k)\\n Numeric Digits (k + 5)\\n End\\n Numeric Digits prec\\n r=r+0\\n Return r\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"#[derive(Copy, Clone)]\\nstruct Point {\\n x: f64,\\n y: f64,\\n}\\n\\nuse std::fmt;\\n\\nimpl fmt::Display for Point {\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n write!(f, \\\"({}, {})\\\", self.x, self.y)\\n }\\n}\\n\\n// Returns the distance from point p to the line between p1 and p2\\nfn perpendicular_distance(p: &Point, p1: &Point, p2: &Point) -> f64 {\\n let dx = p2.x - p1.x;\\n let dy = p2.y - p1.y;\\n (p.x * dy - p.y * dx + p2.x * p1.y - p2.y * p1.x).abs() / dx.hypot(dy)\\n}\\n\\nfn rdp(points: &[Point], epsilon: f64, result: &mut Vec<Point>) {\\n let n = points.len();\\n if n < 2 {\\n return;\\n }\\n let mut max_dist = 0.0;\\n let mut index = 0;\\n for i in 1..n - 1 {\\n let dist = perpendicular_distance(&points[i], &points[0], &points[n - 1]);\\n if dist > max_dist {\\n max_dist = dist;\\n index = i;\\n }\\n }\\n if max_dist > epsilon {\\n rdp(&points[0..=index], epsilon, result);\\n rdp(&points[index..n], epsilon, result);\\n } else {\\n result.push(points[n - 1]);\\n }\\n}\\n\\nfn ramer_douglas_peucker(points: &[Point], epsilon: f64) -> Vec<Point> {\\n let mut result = Vec::new();\\n if points.len() > 0 && epsilon >= 0.0 {\\n result.push(points[0]);\\n rdp(points, epsilon, &mut result);\\n }\\n result\\n}\\n\\nfn main() {\\n let points = vec![\\n Point { x: 0.0, y: 0.0 },\\n Point { x: 1.0, y: 0.1 },\\n Point { x: 2.0, y: -0.1 },\\n Point { x: 3.0, y: 5.0 },\\n Point { x: 4.0, y: 6.0 },\\n Point { x: 5.0, y: 7.0 },\\n Point { x: 6.0, y: 8.1 },\\n Point { x: 7.0, y: 9.0 },\\n Point { x: 8.0, y: 9.0 },\\n Point { x: 9.0, y: 9.0 },\\n ];\\n for p in ramer_douglas_peucker(&points, 1.0) {\\n println!(\\\"{}\\\", p);\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"// [dependencies]\\n// geo = \\\"0.14\\\"\\n\\nuse geo::algorithm::simplify::Simplify;\\nuse geo::line_string;\\n\\nfn main() {\\n let points = line_string![\\n (x: 0.0, y: 0.0),\\n (x: 1.0, y: 0.1),\\n (x: 2.0, y: -0.1),\\n (x: 3.0, y: 5.0),\\n (x: 4.0, y: 6.0),\\n (x: 5.0, y: 7.0),\\n (x: 6.0, y: 8.1),\\n (x: 7.0, y: 9.0),\\n (x: 8.0, y: 9.0),\\n (x: 9.0, y: 9.0),\\n ];\\n for p in points.simplify(&1.0) {\\n println!(\\\"({}, {})\\\", p.x, p.y);\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"// version 1.1.0\\n\\nobject SimplifyPolyline extends App {\\n type Point = (Double, Double)\\n\\n def perpendicularDistance(\\n pt: Point,\\n lineStart: Point,\\n lineEnd: Point\\n ): Double = {\\n var dx = lineEnd._1 - lineStart._1\\n var dy = lineEnd._2 - lineStart._2\\n\\n // Normalize\\n val mag = math.hypot(dx, dy)\\n if (mag > 0.0) { dx /= mag; dy /= mag }\\n val pvx = pt._1 - lineStart._1\\n val pvy = pt._2 - lineStart._2\\n\\n // Get dot product (project pv onto normalized direction)\\n val pvdot = dx * pvx + dy * pvy\\n\\n // Scale line direction vector and subtract it from pv\\n val ax = pvx - pvdot * dx\\n val ay = pvy - pvdot * dy\\n\\n math.hypot(ax, ay)\\n }\\n\\n def RamerDouglasPeucker(\\n pointList: List[Point],\\n epsilon: Double\\n ): List[Point] = {\\n if (pointList.length < 2)\\n throw new IllegalArgumentException(\\\"Not enough points to simplify\\\")\\n\\n // Check if there are points to process\\n if (pointList.length > 2) {\\n // Find the point with the maximum distance from the line between the first and last\\n val (dmax, index) = pointList.zipWithIndex\\n .slice(1, pointList.length - 1)\\n .map { case (point, i) =>\\n (perpendicularDistance(point, pointList.head, pointList.last), i)\\n }\\n .maxBy(_._1)\\n\\n // If max distance is greater than epsilon, recursively simplify\\n if (dmax > epsilon) {\\n val firstLine = pointList.take(index + 1)\\n val lastLine = pointList.drop(index)\\n val recResults1 = RamerDouglasPeucker(firstLine, epsilon)\\n val recResults2 = RamerDouglasPeucker(lastLine, epsilon)\\n\\n // Combine the results\\n (recResults1.init ++ recResults2).distinct\\n } else {\\n // If no point is further than epsilon, return the endpoints\\n List(pointList.head, pointList.last)\\n }\\n } else {\\n // If there are only two points, just return them\\n pointList\\n }\\n }\\n\\n val pointList = List(\\n (0.0, 0.0),\\n (1.0, 0.1),\\n (2.0, -0.1),\\n (3.0, 5.0),\\n (4.0, 6.0),\\n (5.0, 7.0),\\n (6.0, 8.1),\\n (7.0, 9.0),\\n (8.0, 9.0),\\n (9.0, 9.0)\\n )\\n\\n val simplifiedPointList = RamerDouglasPeucker(pointList, 1.0)\\n println(\\\"Points remaining after simplification:\\\")\\n simplifiedPointList.foreach(println)\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"func perpendicular_distance(Arr start, Arr end, Arr point) {\\n ((point == start) || (point == end)) && return 0\\n var (Δx, Δy ) = ( end »-« start)...\\n var (Δpx, Δpy) = (point »-« start)...\\n var h = hypot(Δx, Δy)\\n [\\\\Δx, \\\\Δy].map { *_ /= h }\\n (([Δpx, Δpy] »-« ([Δx, Δy] »*» (Δx*Δpx + Δy*Δpy))) »**» 2).sum.sqrt.round(-20)\\n}\\n\\nfunc Ramer_Douglas_Peucker(Arr points { .all { .len > 1 } }, ε = 1) {\\n points.len == 2 && return points\\n\\n var d = (^points -> map {\\n perpendicular_distance(points[0], points[-1], points[_])\\n })\\n\\n if (d.max > ε) {\\n var i = d.index(d.max)\\n return [Ramer_Douglas_Peucker(points.first(i), ε).first(-1)...,\\n Ramer_Douglas_Peucker(points.slice(i), ε)...]\\n }\\n\\n return [points[0,-1]]\\n}\\n\\nsay Ramer_Douglas_Peucker(\\n [[0,0],[1,0.1],[2,-0.1],[3,5],[4,6],[5,7],[6,8.1],[7,9],[8,9],[9,9]]\\n)\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"struct Point: CustomStringConvertible {\\n let x: Double, y: Double\\n\\n var description: String {\\n return \\\"(\\\\(x), \\\\(y))\\\"\\n }\\n}\\n\\n// Returns the distance from point p to the line between p1 and p2\\nfunc perpendicularDistance(p: Point, p1: Point, p2: Point) -> Double {\\n let dx = p2.x - p1.x\\n let dy = p2.y - p1.y\\n let d = (p.x * dy - p.y * dx + p2.x * p1.y - p2.y * p1.x)\\n return abs(d)/(dx * dx + dy * dy).squareRoot()\\n}\\n\\nfunc ramerDouglasPeucker(points: [Point], epsilon: Double) -> [Point] {\\n var result : [Point] = []\\n func rdp(begin: Int, end: Int) {\\n guard end > begin else {\\n return\\n }\\n var maxDist = 0.0\\n var index = 0\\n for i in begin+1..<end {\\n let dist = perpendicularDistance(p: points[i], p1: points[begin],\\n p2: points[end])\\n if dist > maxDist {\\n maxDist = dist\\n index = i\\n }\\n }\\n if maxDist > epsilon {\\n rdp(begin: begin, end: index)\\n rdp(begin: index, end: end)\\n } else {\\n result.append(points[end])\\n }\\n }\\n if points.count > 0 && epsilon >= 0.0 {\\n result.append(points[0])\\n rdp(begin: 0, end: points.count - 1)\\n }\\n return result\\n}\\n\\nlet points = [\\n Point(x: 0.0, y: 0.0),\\n Point(x: 1.0, y: 0.1),\\n Point(x: 2.0, y: -0.1),\\n Point(x: 3.0, y: 5.0),\\n Point(x: 4.0, y: 6.0),\\n Point(x: 5.0, y: 7.0),\\n Point(x: 6.0, y: 8.1),\\n Point(x: 7.0, y: 9.0),\\n Point(x: 8.0, y: 9.0),\\n Point(x: 9.0, y: 9.0)\\n]\\nprint(\\\"\\\\(ramerDouglasPeucker(points: points, epsilon: 1.0))\\\")\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"import \\\"./dynamic\\\" for Tuple\\n\\nvar Point = Tuple.create(\\\"Point\\\", [\\\"x\\\", \\\"y\\\"])\\n\\nvar rdp // recursive\\nrdp = Fn.new { |l, eps|\\n var x = 0\\n var dMax = -1\\n var p1 = l[0]\\n var p2 = l[-1]\\n var x21 = p2.x - p1.x\\n var y21 = p2.y - p1.y\\n var i = 0\\n for (p in l[1..-1]) {\\n var d = (y21*p.x - x21*p.y + p2.x*p1.y - p2.y*p1.x).abs\\n if (d > dMax) {\\n x = i + 1\\n dMax = d\\n }\\n i = i + 1\\n }\\n if (dMax > eps) {\\n return rdp.call(l[0..x], eps) + rdp.call(l[x..-1], eps)[1..-1]\\n }\\n return [l[0], l[-1]]\\n}\\n\\nvar points = [\\n Point.new(0, 0), Point.new(1, 0.1), Point.new(2, -0.1), Point.new(3, 5), Point.new(4, 6),\\n Point.new(5, 7), Point.new(6, 8.1), Point.new(7, 9), Point.new(8, 9), Point.new(9, 9)\\n]\\nSystem.print(rdp.call(points, 1))\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"include xpllib; \\\\for PerpDist and Print\\n\\nfunc RDP(Points, Size, Epsilon, RemPoints);\\n\\\\Reduce array Points using Ramer-Douglas-Peucker algorithm\\n\\\\Return array of remaining points in RemPoints and its size\\nreal Points; int Size; real Epsilon, RemPoints;\\nreal Dist, DistMax;\\nint Index, I, Size1, Size2;\\n[\\\\Find Index of point farthest from line between first and last points\\nDistMax:= 0.; Index:= 0;\\nfor I:= 1 to Size-2 do\\n [Dist:= PerpDist(Points(I), Points(0), Points(Size-1));\\n if Dist > DistMax then\\n [DistMax:= Dist;\\n Index:= I;\\n ];\\n ];\\nif DistMax <= Epsilon then \\\\replace in-between points with first and last points\\n [RemPoints(0):= Points(0);\\n RemPoints(1):= Points(Size-1);\\n return 2;\\n ]\\nelse \\\\recursively check sub-line-segments\\n [Size1:= RDP(Points, Index+1, Epsilon, RemPoints);\\n RemPoints:= @RemPoints(Size1-1); \\\\add retained points to array\\n Size2:= RDP(@Points(Index), Size-Index, Epsilon, RemPoints);\\n return Size1 + Size2 - 1; \\\\for point at Index\\n ];\\n];\\n\\nreal Points, RemPoints;\\nint Size, I;\\n[Points:= [ [0.0, 0.0], [1.0, 0.1], [2.0, -0.1], [3.0, 5.0], [4.0, 6.0],\\n [5.0, 7.0], [6.0, 8.1], [7.0, 9.0], [8.0, 9.0], [9.0, 9.0] ];\\nSize:= 10;\\nRemPoints:= RlRes(Size);\\nSize:= RDP(Points, Size, 1.0, RemPoints);\\nfor I:= 0 to Size-1 do\\n [if I > 0 then Print(\\\", \\\");\\n Print(\\\"[%1.1g, %1.1g]\\\", RemPoints(I,0), RemPoints(I,1));\\n ];\\nCrLf(0);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"sub perpendicularDistance(tabla(), i, ini, fin)\\n local dx, cy, mag, pvx, pvy, pvdot, dsx, dsy, ax, ay\\n\\n dx = tabla(fin, 1) - tabla(ini, 1)\\n dy = tabla(fin, 2) - tabla(ini, 2)\\n\\n //Normalise\\n mag = (dx^2 + dy^2)^0.5\\n if mag > 0 dx = dx / mag : dy = dy / mag\\n\\n pvx = tabla(i, 1) - tabla(ini, 1)\\n pvy = tabla(i, 2) - tabla(ini, 2)\\n\\n //Get dot product (project pv onto normalized direction)\\n pvdot = dx * pvx + dy * pvy\\n\\n //Scale line direction vector\\n dsx = pvdot * dx\\n dsy = pvdot * dy\\n\\n //Subtract this from pv\\n ax = pvx - dsx\\n ay = pvy - dsy\\n\\n return (ax^2 + ay^2)^0.5\\nend sub\\n\\nsub DouglasPeucker(PointList(), ini, fin, epsilon)\\n local dmax, index, i, d\\n // Find the point with the maximum distance\\n\\n for i = ini + 1 to fin\\n d = perpendicularDistance(PointList(), i, ini, fin)\\n if d > dmax index = i : dmax = d\\n next\\n\\n // If max distance is greater than epsilon, recursively simplify\\n if dmax > epsilon then\\n PointList(index, 3) = true\\n // Recursive call\\n DouglasPeucker(PointList(), ini, index, epsilon)\\n DouglasPeucker(PointList(), index, fin, epsilon)\\n end if\\nend sub\\n\\n\\ndata 0,0, 1,0.1, 2,-0.1, 3,5, 4,6, 5,7, 6,8.1, 7,9, 8,9, 9,9\\n\\ndim matriz(10, 3)\\n\\nfor i = 1 to 10\\n read matriz(i, 1), matriz(i, 2)\\nnext\\n\\nDouglasPeucker(matriz(), 1, 10, 1)\\n\\nmatriz(1, 3) = true : matriz(10, 3) = true\\nfor i = 1 to 10\\n if matriz(i, 3) print matriz(i, 1), matriz(i, 2)\\nnext\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"fcn perpendicularDistance(start,end, point){ // all are tuples: (x,y) -->|d|\\n dx,dy := end .zipWith('-,start);\\t// deltas\\n dpx,dpy := point.zipWith('-,start);\\n mag := (dx*dx + dy*dy).sqrt();\\n if(mag>0.0){ dx/=mag; dy/=mag; }\\n p,dsx,dsy := dx*dpx + dy*dpy, p*dx, p*dy;\\n ((dpx - dsx).pow(2) + (dpy - dsy).pow(2)).sqrt()\\n}\\n\\nfcn RamerDouglasPeucker(points,epsilon=1.0){ // list of tuples --> same\\n if(points.len()==2) return(points); // but we'll do one point\\n d:=points.pump(List, // first result/element is always zero\\n fcn(p, s,e){ perpendicularDistance(s,e,p) }.fp1(points[0],points[-1]));\\n index,dmax := (0.0).minMaxNs(d)[1], d[index]; // minMaxNs-->index of min & max\\n if(dmax>epsilon){\\n return(RamerDouglasPeucker(points[0,index],epsilon)[0,-1].extend(\\n RamerDouglasPeucker(points[index,*],epsilon)))\\n } else return(points[0],points[-1]);\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"RamerDouglasPeucker(\\n T( T(0.0, 0.0), T(1.0, 0.1), T(2.0, -0.1), T(3.0, 5.0), T(4.0, 6.0),\\n T(5.0, 7.0), T(6.0, 8.1), T(7.0, 9.0), T(8.0, 9.0), T(9.0, 9.0) ))\\n.println();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Ramer-Douglas-Peucker-line-simplification"}}},{"rowIdx":1555,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Random_Latin_squares\n","language":"00-META"},{"code":"A Latin square of size <code>n</code> is an arrangement of <code>n</code> symbols in an <code>n-by-n</code> square in such a way that each row and column has each symbol appearing exactly once.<br>\nFor the purposes of this task, a random Latin square of size <code>n</code> is a Latin square constructed or generated by a probabilistic procedure such that the probability of any particular Latin square of size <code>n</code> being produced is non-zero.\n\n;Example n=4 randomised Latin square:\n<pre>0 2 3 1\n2 1 0 3\n3 0 1 2\n1 3 2 0</pre>\n\n;Task:\n# Create a function/routine/procedure/method/... that given <code>n</code> generates a randomised Latin square of size <code>n</code>.\n# Use the function to generate ''and show here'', two randomly generated squares of size 5.\n\n;Note: \nStrict ''uniformity'' in the random generation is a hard problem and '''not''' a requirement of the task.\n\n;Related tasks:\n* [[Latin Squares in reduced form/Randomizing using Jacobson and Matthews’ Technique]]\n* [[Latin Squares in reduced form]]\n\n;Reference:\n* [[wp:Latin_square|Wikipedia: Latin square]]\n* [[oeis:A002860|OEIS: A002860]]\n<br>\n\n","language":"00-TASK"},{"code":"F _transpose(matrix)\n assert(matrix.len == matrix[0].len)\n V r = [[0] * matrix.len] * matrix.len\n L(i) 0 .< matrix.len\n L(j) 0 .< matrix.len\n r[i][j] = matrix[j][i]\n R r\n\nF _shuffle_transpose_shuffle(matrix)\n V square = copy(matrix)\n random:shuffle(&square)\n V trans = _transpose(square)\n random:shuffle(&trans)\n R trans\n\nF _rls(&symbols)\n V n = symbols.len\n I n == 1\n R [symbols]\n E\n V sym = random:choice(symbols)\n symbols.remove(sym)\n V square = _rls(&symbols)\n square.append(copy(square[0]))\n L(i) 0 .< n\n square[i].insert(i, sym)\n R square\n\nF rls(n)\n V symbols = Array(0 .< n)\n V square = _rls(&symbols)\n R _shuffle_transpose_shuffle(square)\n\nF _check_rows(square)\n V set_row0 = Set(square[0])\n R all(square.map(row -> row.len == Set(row).len & Set(row) == @set_row0))\n\nF _check(square)\n V transpose = _transpose(square)\n assert(_check_rows(square) & _check_rows(transpose), ‘Not a Latin square’)\n\nL(i) [3, 3, 5, 5]\n V square = rls(i)\n print(square.map(row -> row.join(‘ ’)).join(\"\\n\"))\n _check(square)\n print()\n","language":"11l"},{"code":"DEFINE PTR=\"CARD\"\nDEFINE DIMENSION=\"5\"\n\nTYPE Matrix=[\n PTR data ;BYTE ARRAY\n BYTE dim]\n\nPTR FUNC GetPtr(Matrix POINTER mat BYTE x,y)\nRETURN (mat.data+x+y*mat.dim)\n\nPROC PrintMatrix(Matrix POINTER mat)\n BYTE x,y\n BYTE POINTER d\n\n d=GetPtr(mat,0,0)\n FOR y=0 TO mat.dim-1\n DO\n FOR x=0 TO mat.dim-1\n DO\n PrintB(d^) Put(32)\n d==+1\n OD\n PutE()\n OD\nRETURN\n\nPROC KnuthShuffle(BYTE ARRAY tab BYTE size)\n BYTE i,j,tmp\n\n i=size-1\n WHILE i>0\n DO\n j=Rand(i+1)\n tmp=tab(i)\n tab(i)=tab(j)\n tab(j)=tmp\n i==-1\n OD\nRETURN\n\nPROC LatinSquare(Matrix POINTER mat)\n BYTE x,y,yy,shuffled\n BYTE POINTER ptr1,ptr2\n BYTE ARRAY used(DIMENSION)\n\n ptr1=GetPtr(mat,0,0)\n FOR y=0 TO mat.dim-1\n DO\n FOR x=0 TO mat.dim-1\n DO\n ptr1^=x\n ptr1==+1\n OD\n OD\n\n ;first row\n ptr1=GetPtr(mat,0,0)\n KnuthShuffle(ptr1,mat.dim)\n\n ;middle rows\n FOR y=1 TO mat.dim-2\n DO\n shuffled=0\n WHILE shuffled=0\n DO\n ptr1=GetPtr(mat,0,y)\n KnuthShuffle(ptr1,mat.dim)\n\n shuffled=1\n yy=0\n WHILE shuffled=1 AND yy<y\n DO\n x=0\n WHILE shuffled=1 AND x<mat.dim\n DO\n ptr1=GetPtr(mat,x,yy)\n ptr2=GetPtr(mat,x,y)\n IF ptr1^=ptr2^ THEN\n shuffled=0\n FI\n x==+1\n OD\n yy==+1\n OD\n OD\n OD\n\n ;last row\n FOR x=0 TO mat.dim-1\n DO\n Zero(used,mat.dim)\n\n FOR y=0 TO mat.dim-2\n DO\n ptr1=GetPtr(mat,x,y)\n yy=ptr1^ used(yy)=1\n OD\n\n FOR y=0 TO mat.dim-1\n DO\n IF used(y)=0 THEN\n ptr1=GetPtr(mat,x,mat.dim-1)\n ptr1^=y\n EXIT\n FI\n OD\n OD\nRETURN\n\nPROC Main()\n BYTE ARRAY d(25)\n BYTE i\n Matrix mat\n\n mat.data=d\n mat.dim=DIMENSION\n\n FOR i=1 TO 2\n DO\n LatinSquare(mat)\n PrintMatrix(mat)\n PutE()\n OD\nRETURN\n","language":"Action-"},{"code":"BEGIN # generate random latin squares #\n\n # Knuth Shuffle routine from the Knuth Shuffle Task #\n # modified to shufflw a row of a [,]CHAR array #\n PROC knuth shuffle = (REF[,]CHAR a, INT row)VOID:\n (\n PROC between = (INT a, b)INT :\n (\n ENTIER (random * ABS (b-a+1) + (a<b|a|b))\n );\n FOR i FROM LWB a TO UPB a DO\n INT j = between(LWB a, UPB a);\n CHAR t = a[row, i];\n a[row, i] := a[row, j];\n a[row, j] := t\n OD\n );\n\n # generates a random latin square #\n PROC latin square = ( INT n )[,]CHAR:\n BEGIN\n [ 1 : n ]CHAR letters;\n [ 1 : n, 1 : n ]CHAR result;\n FOR col TO n DO\n letters[ col ] := REPR ( ABS \"A\" + ( col - 1 ) )\n OD;\n FOR row TO n DO\n result[ row, : ] := letters\n OD;\n knuth shuffle( result, 1 );\n FOR row FROM 2 TO n - 1 DO\n BOOL ok := FALSE;\n WHILE\n knuth shuffle( result, row );\n BOOL all different := TRUE;\n FOR prev TO row - 1 WHILE all different DO\n FOR col TO n\n WHILE all different :=\n result[ row, col ] /= result[ prev, col ]\n DO SKIP OD\n OD;\n NOT all different\n DO SKIP OD\n OD;\n # the final row, there is only one possibility for each column #\n FOR col TO n DO\n [ 1 : n ]CHAR free := letters;\n FOR row TO n - 1 DO\n free[ ( ABS result[ row, col ] - ABS \"A\" ) + 1 ] := REPR 0\n OD;\n BOOL found := FALSE;\n FOR row FROM 1 LWB result TO 1 UPB result WHILE NOT found DO\n IF free[ row ] /= REPR 0 THEN\n found := TRUE;\n result[ n, col ] := free[ row ]\n FI\n OD\n OD;\n result\n END # latin suare # ;\n\n # prints a latin square #\n PROC print square = ( [,]CHAR square )VOID:\n FOR row FROM 1 LWB square TO 1 UPB square DO\n IF 2 LWB square <= 2 UPB square THEN\n print( ( square[ row, 2 LWB square ] ) );\n FOR col FROM 2 LWB square + 1 TO 2 UPB square DO\n print( ( \" \", square[ row, col ] ) )\n OD;\n print( ( newline ) )\n FI\n OD # print square # ;\n\n next random;\n print square( latin square( 5 ) );\n print( ( newline ) );\n print square( latin square( 5 ) );\n print( ( newline ) );\n print square( latin square( 10 ) )\n\nEND\n","language":"ALGOL-68"},{"code":"latinSquare: function [n][\n square: new []\n variants: shuffle permutate 0..n-1\n while -> n > size square [\n row: sample variants\n 'square ++ @[row]\n filter 'variants 'variant [\n reject: false\n loop.with:'i variant 'col [\n if col = row\\[i] ->\n reject: true\n ]\n reject\n ]\n ]\n return square\n]\n\nloop 2 'x [\n ls: latinSquare 5\n loop ls 'row ->\n print row\n print \"---------\"\n]\n","language":"Arturo"},{"code":"#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <time.h>\n\n// low <= num < high\nint randInt(int low, int high) {\n return (rand() % (high - low)) + low;\n}\n\n// shuffle an array of n elements\nvoid shuffle(int *const array, const int n) {\n if (n > 1) {\n int i;\n for (i = 0; i < n - 1; i++) {\n int j = randInt(i, n);\n\n int t = array[i];\n array[i] = array[j];\n array[j] = t;\n }\n }\n}\n\n// print an n * n array\nvoid printSquare(const int *const latin, const int n) {\n int i, j;\n for (i = 0; i < n; i++) {\n printf(\"[\");\n for (j = 0; j < n; j++) {\n if (j > 0) {\n printf(\", \");\n }\n printf(\"%d\", latin[i * n + j]);\n }\n printf(\"]\\n\");\n }\n printf(\"\\n\");\n}\n\nvoid latinSquare(const int n) {\n int *latin, *used;\n int i, j, k;\n\n if (n <= 0) {\n printf(\"[]\\n\");\n return;\n }\n\n // allocate\n latin = (int *)malloc(n * n * sizeof(int));\n if (!latin) {\n printf(\"Failed to allocate memory.\");\n return;\n }\n\n // initialize\n for (i = 0; i < n; i++) {\n for (j = 0; j < n; j++) {\n latin[i * n + j] = j;\n }\n }\n\n // first row\n shuffle(latin, n);\n\n // middle row(s)\n for (i = 1; i < n - 1; i++) {\n bool shuffled = false;\n\n while (!shuffled) {\n shuffle(&latin[i * n], n);\n\n for (k = 0; k < i; k++) {\n for (j = 0; j < n; j++) {\n if (latin[k * n + j] == latin[i * n + j]) {\n goto shuffling;\n }\n }\n }\n shuffled = true;\n\n shuffling: {}\n }\n }\n\n //last row\n used = (int *)malloc(n * sizeof(int));\n for (j = 0; j < n; j++) {\n memset(used, 0, n * sizeof(int));\n for (i = 0; i < n - 1; i++) {\n used[latin[i * n + j]] = 1;\n }\n for (k = 0; k < n; k++) {\n if (used[k] == 0) {\n latin[(n - 1) * n + j] = k;\n break;\n }\n }\n }\n free(used);\n\n // print the result\n printSquare(latin, n);\n free(latin);\n}\n\nint main() {\n // initialze the random number generator\n srand((unsigned int)time((time_t)0));\n\n latinSquare(5);\n latinSquare(5);\n latinSquare(10);\n\n return 0;\n}\n","language":"C"},{"code":"#include <algorithm>\n#include <chrono>\n#include <iostream>\n#include <random>\n#include <vector>\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n auto it = v.cbegin();\n auto end = v.cend();\n\n os << '[';\n if (it != end) {\n os << *it;\n it = std::next(it);\n }\n while (it != end) {\n os << \", \";\n os << *it;\n it = std::next(it);\n }\n return os << ']';\n}\n\nvoid printSquare(const std::vector<std::vector<int>> &latin) {\n for (auto &row : latin) {\n std::cout << row << '\\n';\n }\n std::cout << '\\n';\n}\n\nvoid latinSquare(int n) {\n if (n <= 0) {\n std::cout << \"[]\\n\";\n return;\n }\n\n // obtain a time-based seed:\n unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();\n auto g = std::default_random_engine(seed);\n\n std::vector<std::vector<int>> latin;\n for (int i = 0; i < n; ++i) {\n std::vector<int> inner;\n for (int j = 0; j < n; ++j) {\n inner.push_back(j);\n }\n latin.push_back(inner);\n }\n // first row\n std::shuffle(latin[0].begin(), latin[0].end(), g);\n\n // middle row(s)\n for (int i = 1; i < n - 1; ++i) {\n bool shuffled = false;\n\n while (!shuffled) {\n std::shuffle(latin[i].begin(), latin[i].end(), g);\n for (int k = 0; k < i; ++k) {\n for (int j = 0; j < n; ++j) {\n if (latin[k][j] == latin[i][j]) {\n goto shuffling;\n }\n }\n }\n shuffled = true;\n\n shuffling: {}\n }\n }\n\n // last row\n for (int j = 0; j < n; ++j) {\n std::vector<bool> used(n, false);\n for (int i = 0; i < n - 1; ++i) {\n used[latin[i][j]] = true;\n }\n for (int k = 0; k < n; ++k) {\n if (!used[k]) {\n latin[n - 1][j] = k;\n break;\n }\n }\n }\n\n printSquare(latin);\n}\n\nint main() {\n latinSquare(5);\n latinSquare(5);\n latinSquare(10);\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\n\nnamespace RandomLatinSquares {\n using Matrix = List<List<int>>;\n\n // Taken from https://stackoverflow.com/a/1262619\n static class Helper {\n private static readonly Random rng = new Random();\n\n public static void Shuffle<T>(this IList<T> list) {\n int n = list.Count;\n while (n > 1) {\n n--;\n int k = rng.Next(n + 1);\n T value = list[k];\n list[k] = list[n];\n list[n] = value;\n }\n }\n }\n\n class Program {\n static void PrintSquare(Matrix latin) {\n foreach (var row in latin) {\n Console.Write('[');\n\n var it = row.GetEnumerator();\n if (it.MoveNext()) {\n Console.Write(it.Current);\n }\n while (it.MoveNext()) {\n Console.Write(\", \");\n Console.Write(it.Current);\n }\n\n Console.WriteLine(']');\n }\n Console.WriteLine();\n }\n\n static void LatinSquare(int n) {\n if (n <= 0) {\n Console.WriteLine(\"[]\");\n return;\n }\n\n var latin = new Matrix();\n for (int i = 0; i < n; i++) {\n List<int> temp = new List<int>();\n for (int j = 0; j < n; j++) {\n temp.Add(j);\n }\n latin.Add(temp);\n }\n // first row\n latin[0].Shuffle();\n\n // middle row(s)\n for (int i = 1; i < n - 1; i++) {\n bool shuffled = false;\n\n while (!shuffled) {\n latin[i].Shuffle();\n for (int k = 0; k < i; k++) {\n for (int j = 0; j < n; j++) {\n if (latin[k][j] == latin[i][j]) {\n goto shuffling;\n }\n }\n }\n shuffled = true;\n\n shuffling: { }\n }\n }\n\n // last row\n for (int j = 0; j < n; j++) {\n List<bool> used = new List<bool>();\n for (int i = 0; i < n; i++) {\n used.Add(false);\n }\n\n for (int i = 0; i < n-1; i++) {\n used[latin[i][j]] = true;\n }\n for (int k = 0; k < n; k++) {\n if (!used[k]) {\n latin[n - 1][j] = k;\n break;\n }\n }\n }\n\n PrintSquare(latin);\n }\n\n static void Main() {\n LatinSquare(5);\n LatinSquare(5);\n LatinSquare(10); // for good measure\n }\n }\n}\n","language":"C-sharp"},{"code":"import std.array;\nimport std.random;\nimport std.stdio;\n\nalias Matrix = int[][];\n\nvoid latinSquare(int n) {\n if (n <= 0) {\n writeln(\"[]\");\n return;\n }\n\n Matrix latin = uninitializedArray!Matrix(n, n);\n foreach (row; latin) {\n for (int i = 0; i < n; i++) {\n row[i] = i;\n }\n }\n // first row\n latin[0].randomShuffle;\n\n // middle row(s)\n for (int i = 1; i < n - 1; i++) {\n bool shuffled = false;\n\n shuffling:\n while (!shuffled) {\n latin[i].randomShuffle;\n for (int k = 0; k < i; k++) {\n for (int j = 0; j < n; j++) {\n if (latin[k][j] == latin[i][j]) {\n continue shuffling;\n }\n }\n }\n shuffled = true;\n }\n }\n\n // last row\n for (int j = 0; j < n; j++) {\n bool[] used = uninitializedArray!(bool[])(n);\n used[] = false;\n\n for (int i = 0; i < n - 1; i++) {\n used[latin[i][j]] = true;\n }\n for (int k = 0; k < n; k++) {\n if (!used[k]) {\n latin[n - 1][j] = k;\n break;\n }\n }\n }\n\n printSquare(latin);\n}\n\nvoid printSquare(Matrix latin) {\n foreach (row; latin) {\n writeln(row);\n }\n}\n\nvoid main() {\n latinSquare(5);\n writeln;\n\n latinSquare(5);\n writeln;\n\n latinSquare(10);\n}\n","language":"D"},{"code":"proc shuffle . a[] .\n for i = len a[] downto 2\n r = randint i\n swap a[r] a[i]\n .\n.\nproc prsquare . lat[][] .\n n = len lat[][]\n for i to n\n for j to n\n write lat[i][j] & \" \"\n .\n print \"\"\n .\n print \"\"\n.\nproc square n . .\n for i to n\n lat[][] &= [ ]\n for j to n\n lat[i][] &= j\n .\n .\n shuffle lat[1][]\n for i = 2 to n - 1\n repeat\n shuffle lat[i][]\n for k to i - 1\n for j to n\n if lat[k][j] = lat[i][j]\n break 2\n .\n .\n .\n until k = i\n .\n .\n len used0[] n\n for j to n\n used[] = used0[]\n for i to n - 1\n used[lat[i][j]] = 1\n .\n for k to n\n if used[k] = 0\n lat[n][j] = k\n break 1\n .\n .\n .\n prsquare lat[][]\n.\nsquare 5\nsquare 5\n","language":"EasyLang"},{"code":"// Generate 2 Random Latin Squares of order 5. Nigel Galloway: July 136th., 2019\nlet N=let N=System.Random() in (fun n->N.Next(n))\nlet rc()=let β=lN2p [|0;N 4;N 3;N 2|] [|0..4|] in Seq.item (N 56) (normLS 5) |> List.map(lN2p [|N 5;N 4;N 3;N 2|]) |> List.permute(fun n->β.[n]) |> List.iter(printfn \"%A\")\nrc(); printfn \"\"; rc()\n","language":"F-Sharp"},{"code":"USING: arrays combinators.extras fry io kernel math.matrices\nprettyprint random sequences sets ;\nIN: rosetta-code.random-latin-squares\n\n: rand-permutation ( n -- seq ) <iota> >array randomize ;\n: ls? ( n -- ? ) [ all-unique? ] column-map t [ and ] reduce ;\n: (ls) ( n -- m ) dup '[ _ rand-permutation ] replicate ;\n: ls ( n -- m ) dup (ls) dup ls? [ nip ] [ drop ls ] if ;\n: random-latin-squares ( -- ) [ 5 ls simple-table. nl ] twice ;\n\nMAIN: random-latin-squares\n","language":"Factor"},{"code":"Randomize Timer\n\nSub printSquare(latin() As Integer, n As Integer)\n For i As Integer = 0 To n - 1\n Print \"[\";\n For j As Integer = 0 To n - 1\n Print latin(i, j); \",\";\n Next j\n Print Chr(8); \" ]\"\n Next i\n Print\nEnd Sub\n\nSub latinSquare(n As Integer)\n Dim As Integer i, j, k\n\n If n <= 0 Then\n Print \"[]\"\n Exit Sub\n End If\n Dim latin(n - 1, n - 1) As Integer\n For i = 0 To n - 1\n For j = 0 To n - 1\n latin(i, j) = j\n Next j\n Next i\n\n ' first row\n For i = 0 To n - 1\n Dim j As Integer = Int(Rnd * n)\n Swap latin(0, i), latin(0, j)\n Next i\n\n ' middle row(s)\n For i = 1 To n - 2\n Dim shuffled As Integer = 0\n While shuffled = 0\n For j = 0 To n - 1\n Dim k As Integer = Int(Rnd * n)\n Swap latin(i, j), latin(i, k)\n Next j\n shuffled = 1\n For k As Integer = 0 To i - 1\n For j = 0 To n - 1\n If latin(k, j) = latin(i, j) Then\n shuffled = 0\n Exit For\n End If\n Next j\n If shuffled = 0 Then Exit For\n Next k\n Wend\n Next i\n\n ' last row\n For j = 0 To n - 1\n Dim used(n - 1) As Integer\n For i = 0 To n - 2\n used(latin(i, j)) = 1\n Next i\n For k = 0 To n - 1\n If used(k) = 0 Then\n latin(n - 1, j) = k\n Exit For\n End If\n Next k\n Next j\n printSquare(latin(), n)\nEnd Sub\n\nlatinSquare(5)\nlatinSquare(5)\nlatinSquare(10) ' for good measure\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/rand\"\n \"time\"\n)\n\ntype matrix [][]int\n\nfunc shuffle(row []int, n int) {\n rand.Shuffle(n, func(i, j int) {\n row[i], row[j] = row[j], row[i]\n })\n}\n\nfunc latinSquare(n int) {\n if n <= 0 {\n fmt.Println(\"[]\\n\")\n return\n }\n latin := make(matrix, n)\n for i := 0; i < n; i++ {\n latin[i] = make([]int, n)\n if i == n-1 {\n break\n }\n for j := 0; j < n; j++ {\n latin[i][j] = j\n }\n }\n // first row\n shuffle(latin[0], n)\n\n // middle row(s)\n for i := 1; i < n-1; i++ {\n shuffled := false\n shuffling:\n for !shuffled {\n shuffle(latin[i], n)\n for k := 0; k < i; k++ {\n for j := 0; j < n; j++ {\n if latin[k][j] == latin[i][j] {\n continue shuffling\n }\n }\n }\n shuffled = true\n }\n }\n\n // last row\n for j := 0; j < n; j++ {\n used := make([]bool, n)\n for i := 0; i < n-1; i++ {\n used[latin[i][j]] = true\n }\n for k := 0; k < n; k++ {\n if !used[k] {\n latin[n-1][j] = k\n break\n }\n }\n }\n printSquare(latin, n)\n}\n\nfunc printSquare(latin matrix, n int) {\n for i := 0; i < n; i++ {\n fmt.Println(latin[i])\n }\n fmt.Println()\n}\n\nfunc main() {\n rand.Seed(time.Now().UnixNano())\n latinSquare(5)\n latinSquare(5)\n latinSquare(10) // for good measure\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/rand\"\n \"sort\"\n \"time\"\n)\n\ntype matrix [][]int\n\n// generate derangements of first n numbers, with 'start' in first place.\nfunc dList(n, start int) (r matrix) {\n start-- // use 0 basing\n a := make([]int, n)\n for i := range a {\n a[i] = i\n }\n a[0], a[start] = start, a[0]\n sort.Ints(a[1:])\n first := a[1]\n // recursive closure permutes a[1:]\n var recurse func(last int)\n recurse = func(last int) {\n if last == first {\n // bottom of recursion. you get here once for each permutation.\n // test if permutation is deranged.\n for j, v := range a[1:] { // j starts from 0, not 1\n if j+1 == v {\n return // no, ignore it\n }\n }\n // yes, save a copy\n b := make([]int, n)\n copy(b, a)\n for i := range b {\n b[i]++ // change back to 1 basing\n }\n r = append(r, b)\n return\n }\n for i := last; i >= 1; i-- {\n a[i], a[last] = a[last], a[i]\n recurse(last - 1)\n a[i], a[last] = a[last], a[i]\n }\n }\n recurse(n - 1)\n return\n}\n\nfunc reducedLatinSquares(n int) []matrix {\n var rls []matrix\n if n < 0 {\n n = 0\n }\n rlatin := make(matrix, n)\n for i := 0; i < n; i++ {\n rlatin[i] = make([]int, n)\n }\n if n <= 1 {\n return append(rls, rlatin)\n }\n // first row\n for j := 0; j < n; j++ {\n rlatin[0][j] = j + 1\n }\n // recursive closure to compute reduced latin squares\n var recurse func(i int)\n recurse = func(i int) {\n rows := dList(n, i) // get derangements of first n numbers, with 'i' first.\n outer:\n for r := 0; r < len(rows); r++ {\n copy(rlatin[i-1], rows[r])\n for k := 0; k < i-1; k++ {\n for j := 1; j < n; j++ {\n if rlatin[k][j] == rlatin[i-1][j] {\n if r < len(rows)-1 {\n continue outer\n } else if i > 2 {\n return\n }\n }\n }\n }\n if i < n {\n recurse(i + 1)\n } else {\n rl := copyMatrix(rlatin)\n rls = append(rls, rl)\n }\n }\n return\n }\n\n // remaining rows\n recurse(2)\n return rls\n}\n\nfunc copyMatrix(m matrix) matrix {\n le := len(m)\n cpy := make(matrix, le)\n for i := 0; i < le; i++ {\n cpy[i] = make([]int, le)\n copy(cpy[i], m[i])\n }\n return cpy\n}\n\nfunc printSquare(latin matrix, n int) {\n for i := 0; i < n; i++ {\n for j := 0; j < n; j++ {\n fmt.Printf(\"%d \", latin[i][j]-1)\n }\n fmt.Println()\n }\n fmt.Println()\n}\n\nfunc factorial(n uint64) uint64 {\n if n == 0 {\n return 1\n }\n prod := uint64(1)\n for i := uint64(2); i <= n; i++ {\n prod *= i\n }\n return prod\n}\n\n// generate permutations of first n numbers, starting from 0.\nfunc pList(n int) matrix {\n fact := factorial(uint64(n))\n perms := make(matrix, fact)\n a := make([]int, n)\n for i := 0; i < n; i++ {\n a[i] = i\n }\n t := make([]int, n)\n copy(t, a)\n perms[0] = t\n n--\n var i, j int\n for c := uint64(1); c < fact; c++ {\n i = n - 1\n j = n\n for a[i] > a[i+1] {\n i--\n }\n for a[j] < a[i] {\n j--\n }\n a[i], a[j] = a[j], a[i]\n j = n\n i++\n for i < j {\n a[i], a[j] = a[j], a[i]\n i++\n j--\n }\n t := make([]int, n+1)\n copy(t, a)\n perms[c] = t\n }\n return perms\n}\n\nfunc generateLatinSquares(n, tests, echo int) {\n rls := reducedLatinSquares(n)\n perms := pList(n)\n perms2 := pList(n - 1)\n for test := 0; test < tests; test++ {\n rn := rand.Intn(len(rls))\n rl := rls[rn] // select reduced random square at random\n rn = rand.Intn(len(perms))\n rp := perms[rn] // select a random permuation of 'rl's columns\n // permute columns\n t := make(matrix, n)\n for i := 0; i < n; i++ {\n t[i] = make([]int, n)\n }\n for i := 0; i < n; i++ {\n for j := 0; j < n; j++ {\n t[i][j] = rl[i][rp[j]]\n }\n }\n rn = rand.Intn(len(perms2))\n rp = perms2[rn] // select a random permutation of 't's rows 2 to n\n // permute rows 2 to n\n u := make(matrix, n)\n for i := 0; i < n; i++ {\n u[i] = make([]int, n)\n }\n for i := 0; i < n; i++ {\n for j := 0; j < n; j++ {\n if i == 0 {\n u[i][j] = t[i][j]\n } else {\n u[i][j] = t[rp[i-1]+1][j]\n }\n }\n }\n if test < echo {\n printSquare(u, n)\n }\n if n == 4 {\n for i := 0; i < 4; i++ {\n for j := 0; j < 4; j++ {\n u[i][j]--\n }\n }\n for i := 0; i < 4; i++ {\n copy(a[4*i:], u[i])\n }\n for i := 0; i < 4; i++ {\n if testSquares[i] == a {\n counts[i]++\n break\n }\n }\n }\n }\n}\n\nvar testSquares = [4][16]int{\n {0, 1, 2, 3, 1, 0, 3, 2, 2, 3, 0, 1, 3, 2, 1, 0},\n {0, 1, 2, 3, 1, 0, 3, 2, 2, 3, 1, 0, 3, 2, 0, 1},\n {0, 1, 2, 3, 1, 2, 3, 0, 2, 3, 0, 1, 3, 0, 1, 2},\n {0, 1, 2, 3, 1, 3, 0, 2, 2, 0, 3, 1, 3, 2, 1, 0},\n}\n\nvar (\n counts [4]int\n a [16]int\n)\n\nfunc main() {\n rand.Seed(time.Now().UnixNano())\n fmt.Println(\"Two randomly generated latin squares of order 5 are:\\n\")\n generateLatinSquares(5, 2, 2)\n\n fmt.Println(\"Out of 1,000,000 randomly generated latin squares of order 4, \")\n fmt.Println(\"of which there are 576 instances ( => expected 1736 per instance),\")\n fmt.Println(\"the following squares occurred the number of times shown:\\n\")\n generateLatinSquares(4, 1e6, 0)\n for i := 0; i < 4; i++ {\n fmt.Println(testSquares[i][:], \":\", counts[i])\n }\n\n fmt.Println(\"\\nA randomly generated latin square of order 6 is:\\n\")\n generateLatinSquares(6, 1, 1)\n}\n","language":"Go"},{"code":"import Data.List (permutations, (\\\\))\n\nlatinSquare :: Eq a => [a] -> [a] -> [[a]]\nlatinSquare [] [] = []\nlatinSquare c r\n | head r /= head c = []\n | otherwise = reverse <$> foldl addRow firstRow perms\n where\n -- permutations grouped by the first element\n perms =\n tail $\n fmap\n (fmap . (:) <*> (permutations . (r \\\\) . return))\n c\n firstRow = pure <$> r\n addRow tbl rows =\n head\n [ zipWith (:) row tbl\n | row <- rows,\n and $ different (tail row) (tail tbl)\n ]\n different = zipWith $ (not .) . elem\n\nprintTable :: Show a => [[a]] -> IO ()\nprintTable tbl =\n putStrLn $\n unlines $\n unwords . map show <$> tbl\n","language":"Haskell"},{"code":"randomLatinSquare :: Eq a => [a] -> Random [[a]]\nrandomLatinSquare set = do\n r <- randomPermutation set\n c <- randomPermutation (tail r)\n return $ latinSquare r (head r:c)\n","language":"Haskell"},{"code":"import Control.Monad.State\n\ntype Random a = State Int a\n\nrandom :: Integral a => a -> Random a\nrandom k = rescale <$> modify iter\n where\n iter x = (x * a + c) `mod` m\n (a, c, m) = (1103515245, 12345, 2^31-1)\n rescale x = fromIntegral x `mod` k\n\nrandomPermutation :: Eq a => [a] -> Random [a]\nrandomPermutation = go\n where\n go [] = pure []\n go lst = do\n x <- randomSample lst\n (x :) <$> go (lst \\\\ [x])\n\nrandomSample :: [a] -> Random a\nrandomSample lst = (lst !!) <$> random (length lst)\n","language":"Haskell"},{"code":"rls=: 3 : 0\n s=. ?~ y NB. \"deal\" y unique integers from 0 to y\n for_ijk. i.<:y do.\n NB. deal a new row. subtract it from all previous rows\n NB. if you get a 0, some column has a matching integer, deal again\n whilst. 0 = */ */ s -\"1 r do.\n r=. ?~ y\n end.\n s=. s ,,: r NB. \"laminate\" successful row to the square\n end.\n)\n","language":"J"},{"code":"import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.Iterator;\nimport java.util.List;\nimport java.util.Objects;\n\npublic class RandomLatinSquares {\n private static void printSquare(List<List<Integer>> latin) {\n for (List<Integer> row : latin) {\n Iterator<Integer> it = row.iterator();\n\n System.out.print(\"[\");\n if (it.hasNext()) {\n Integer col = it.next();\n System.out.print(col);\n }\n while (it.hasNext()) {\n Integer col = it.next();\n System.out.print(\", \");\n System.out.print(col);\n }\n System.out.println(\"]\");\n }\n System.out.println();\n }\n\n private static void latinSquare(int n) {\n if (n <= 0) {\n System.out.println(\"[]\");\n return;\n }\n\n List<List<Integer>> latin = new ArrayList<>(n);\n for (int i = 0; i < n; ++i) {\n List<Integer> inner = new ArrayList<>(n);\n for (int j = 0; j < n; ++j) {\n inner.add(j);\n }\n latin.add(inner);\n }\n // first row\n Collections.shuffle(latin.get(0));\n\n // middle row(s)\n for (int i = 1; i < n - 1; ++i) {\n boolean shuffled = false;\n shuffling:\n while (!shuffled) {\n Collections.shuffle(latin.get(i));\n for (int k = 0; k < i; ++k) {\n for (int j = 0; j < n; ++j) {\n if (Objects.equals(latin.get(k).get(j), latin.get(i).get(j))) {\n continue shuffling;\n }\n }\n }\n shuffled = true;\n }\n }\n\n // last row\n for (int j = 0; j < n; ++j) {\n List<Boolean> used = new ArrayList<>(n);\n for (int i = 0; i < n; ++i) {\n used.add(false);\n }\n for (int i = 0; i < n - 1; ++i) {\n used.set(latin.get(i).get(j), true);\n }\n for (int k = 0; k < n; ++k) {\n if (!used.get(k)) {\n latin.get(n - 1).set(j, k);\n break;\n }\n }\n }\n\n printSquare(latin);\n }\n\n public static void main(String[] args) {\n latinSquare(5);\n latinSquare(5);\n latinSquare(10);\n }\n}\n","language":"Java"},{"code":"class Latin {\n constructor(size = 3) {\n this.size = size;\n this.mst = [...Array(this.size)].map((v, i) => i + 1);\n this.square = Array(this.size).fill(0).map(() => Array(this.size).fill(0));\n\n if (this.create(0, 0)) {\n console.table(this.square);\n }\n }\n\n create(c, r) {\n const d = [...this.mst];\n let s;\n while (true) {\n do {\n s = d.splice(Math.floor(Math.random() * d.length), 1)[0];\n if (!s) return false;\n } while (this.check(s, c, r));\n\n this.square[c][r] = s;\n if (++c >= this.size) {\n c = 0;\n if (++r >= this.size) {\n return true;\n }\n }\n if (this.create(c, r)) return true;\n if (--c < 0) {\n c = this.size - 1;\n if (--r < 0) {\n return false;\n }\n }\n }\n }\n\n check(d, c, r) {\n for (let a = 0; a < this.size; a++) {\n if (c - a > -1) {\n if (this.square[c - a][r] === d)\n return true;\n }\n if (r - a > -1) {\n if (this.square[c][r - a] === d)\n return true;\n }\n }\n return false;\n }\n}\nnew Latin(5);\n","language":"JavaScript"},{"code":"#!/bin/bash\n< /dev/random tr -cd '0-9' | fold -w 1 | jq -Mcnr -f random-latin-squares.jq\n","language":"Jq"},{"code":"'''Generic Utility Functions'''\n# For inclusion using jq's `include` directive:\n# Output: a PRN in range(0;$n) where $n is .\ndef prn:\n if . == 1 then 0\n else . as $n\n | (($n-1)|tostring|length) as $w\n | [limit($w; inputs)] | join(\"\") | tonumber\n | if . < $n then . else ($n | prn) end\n end;\n\ndef knuthShuffle:\n length as $n\n | if $n <= 1 then .\n else {i: $n, a: .}\n | until(.i == 0;\n .i += -1\n | (.i + 1 | prn) as $j\n | .a[.i] as $t\n | .a[.i] = .a[$j]\n | .a[$j] = $t)\n | .a\n end;\n\ndef lpad($len): tostring | ($len - length) as $l | (\" \" * $l)[:$l] + .;\n\n# If the input array is not rectangular, let nulls fall where they may\ndef column($j):\n [.[] | .[$j]];\n\n# Emit a stream of [value, frequency] pairs\ndef histogram(stream):\n reduce stream as $s ({};\n ($s|type) as $t\n | (if $t == \"string\" then $s else ($s|tojson) end) as $y\n | .[$t][$y][0] = $s\n | .[$t][$y][1] += 1 )\n | .[][] ;\n\ndef ss(s): reduce s as $x (0; . + ($x * $x));\n\ndef chiSquared($expected): ss( .[] - $expected ) / $expected;\n","language":"Jq"},{"code":"# Include the utilities e.g. by\n# include \"random-latin-squares.utilities\" {search: \".\"};\n\n# Determine orthogonality of two arrays, confining attention\n# to the first $n elements in each:\ndef orthogonal($a; $b; $n):\n first( (range(0; $n) | if $a[.] == $b[.] then 0 else empty end) // 1) | . == 1;\n\n# Are the two arrays orthogonal up to the length of the shorter?\ndef orthogonal($a; $b):\n ([$a, $b | length] | min) as $min\n | orthogonal($a; $b; $min);\n\n# Is row $i orthogonal to all the previous rows?\ndef orthogonal($i):\n . as $in\n | .[$i] as $row\n | all(range(0;$i); orthogonal($row; $in[.]));\n\n# verify columnwise orthogonality\ndef columnwise:\n length as $n\n | transpose as $t\n | all( range(1;$n); . as $i | $t | orthogonal($i)) ;\n\ndef addLast:\n (.[0] | length) as $n\n | [range(0; $n)] as $range\n | [range(0; $n) as $i\n | ($range - column($i))[0] ] as $last\n | . + [$last] ;\n\n# input: an array being a permutation of [range(0;$n)] for some $n\n# output: a Latin Square selected at random from all the candidates\ndef extend:\n (.[0] | length) as $n\n | if length >= $n then .\n elif length == $n - 1 then addLast\n else ([range(0; $n)] | knuthShuffle) as $row\n | (. + [$row] )\n | if orthogonal(length - 1) and columnwise then extend else empty end\n end ;\n\n# Generate a Latin Square.\n# The input should be an integer specifying its size.\ndef latinSquare:\n . as $n\n | if $n <= 0 then []\n else\n [ [range(0; $n)] | knuthShuffle]\n | first(repeat(extend))\n # | (if columnwise then . else debug end) # internal check\n end ;\n\n# If the input is a positive integer, $n, generate and print an $n x $n Latin Square.\n# If it is not number, echo it.\ndef printLatinSquare:\n if type == \"number\"\n then latinSquare\n | .[] | map(lpad(3)) | join(\" \")\n else .\n end;\n\n# $order should be in 1 .. 5 inclusive\n# If $n is null, then use 10 * $counts[$order]\ndef stats($order; $n):\n # table of counts:\n [0,1,2,12,576,161280] as $counts\n | $counts[$order] as $possibilities\n | (if $n then $n else 10 * $possibilities end) as $n\n | reduce range(0;$n) as $i ({};\n ($order|latinSquare|flatten|join(\"\")) as $row\n | .[$row] += 1)\n | # ([histogram(.[])] | sort[] | join(\" \")),\n \"Number of LS(\\($order)): \\($n)\",\n (if length == $possibilities\n then \"All \\($possibilities) possibilities have been generated.\"\n else \"Of \\($possibilities) possibilities, only \\(length) were generated.\"\n end),\n \"Chi-squared statistic (df=\\($possibilities-1)): \\( [.[]] | chiSquared( $n / $possibilities))\";\n\n\nstats(3;null), \"\",\nstats(4;5760), \"\"\nstats(4;5760)\n","language":"Jq"},{"code":"# Include the utilities e.g. by\n# include \"random-latin-squares.utilities\" {search: \".\"};\n\n# Select an element at random from [range(0;$n)] - column($j)\ndef candidate($j):\n (.[0] | length) as $n\n | [range(0;$n)] - column($j)\n | .[length|prn];\n\n# Input: the first row or rows of a Latin Square\ndef extend:\n # The input to ext should be several rows of a Latin Square\n # optionally followed by a candidate for an additional row.\n def ext:\n .[0] as $first\n | length as $length\n | ($first|length) as $n\n | .[-1] as $last\n | if ($last|length) < $n # then extend the last row\n then ( ([range(0;$n)] - column($last|length)) - $last) as $candidates\n | .[:$length-1] as $good\n | ($candidates|length) as $cl\n\n # if we can complete the row, then there is no need for another backtrack point!\n | if $cl == 1 and ($last|length) == $n - 1\n then ($good + [ $last + $candidates]) | ext # n.b. or use `extend` to speed things up at the cost of more bias\n else\n if $cl == 1 then ($good + [ $last + $candidates]) | ext\n elif $cl == 0\n then empty\n else ($candidates[$cl | prn] as $add\n | ($good + [$last + [$add]]) | ext)\n end\n end\n elif length < $n then ((. + [[candidate(0)]]) | ext)\n else .\n end;\n # If at first you do not succeed ...\n first( repeat( ext ));\n\n# Generate a Latin Square.\n# The input should be an integer specifying its size.\ndef latinSquare:\n . as $n\n | if $n <= 0 then []\n else\n [ [range(0; $n)] | knuthShuffle]\n | extend\n end ;\n\n# If the input is a positive integer, $n, generate and print an $n x $n Latin Square.\n# Otherwise, simply echo it.\ndef printLatinSquare:\n if type == \"number\"\n then latinSquare\n | .[] | map(lpad(3)) | join(\" \")\n else .\n end;\n\n\"Five\", 5, \"\\nFive\", 5, \"\\nTen\", 10, \"\\nForty\", 40\n| printLatinSquare\n'\n","language":"Jq"},{"code":"using Random\n\nshufflerows(mat) = mat[shuffle(1:end), :]\nshufflecols(mat) = mat[:, shuffle(1:end)]\n\nfunction addatdiagonal(mat)\n n = size(mat)[1] + 1\n newmat = similar(mat, size(mat) .+ 1)\n for j in 1:n, i in 1:n\n newmat[i, j] = (i == n && j < n) ? mat[1, j] : (i == j) ? n - 1 :\n (i < j) ? mat[i, j - 1] : mat[i, j]\n end\n newmat\nend\n\nfunction makelatinsquare(N)\n mat = [0 1; 1 0]\n for i in 3:N\n mat = addatdiagonal(mat)\n end\n shufflecols(shufflerows(mat))\nend\n\nfunction printlatinsquare(N)\n mat = makelatinsquare(N)\n for i in 1:N, j in 1:N\n print(rpad(mat[i, j], 3), j == N ? \"\\n\" : \"\")\n end\nend\n\nprintlatinsquare(5), println(\"\\n\"), printlatinsquare(5)\n","language":"Julia"},{"code":"typealias matrix = MutableList<MutableList<Int>>\n\nfun printSquare(latin: matrix) {\n for (row in latin) {\n println(row)\n }\n println()\n}\n\nfun latinSquare(n: Int) {\n if (n <= 0) {\n println(\"[]\")\n return\n }\n\n val latin = MutableList(n) { MutableList(n) { it } }\n // first row\n latin[0].shuffle()\n\n // middle row(s)\n for (i in 1 until n - 1) {\n var shuffled = false\n shuffling@\n while (!shuffled) {\n latin[i].shuffle()\n for (k in 0 until i) {\n for (j in 0 until n) {\n if (latin[k][j] == latin[i][j]) {\n continue@shuffling\n }\n }\n }\n shuffled = true\n }\n }\n\n // last row\n for (j in 0 until n) {\n val used = MutableList(n) { false }\n for (i in 0 until n - 1) {\n used[latin[i][j]] = true\n }\n for (k in 0 until n) {\n if (!used[k]) {\n latin[n - 1][j] = k\n break\n }\n }\n }\n\n printSquare(latin)\n}\n\nfun main() {\n latinSquare(5)\n latinSquare(5)\n latinSquare(10) // for good measure\n}\n","language":"Kotlin"},{"code":"Module FastLatinSquare {\n\tn=5\n\tFor k=1 To 2\n\t\tlatin()\n\tNext\n\tn=40\n\tlatin()\n\tSub latin()\n\t\tLocal i,a, a(1 To n), b, k\n\t\tProfiler\n\t\tflush\n\t\tPrint \"latin square \";n;\" by \";n\n\t\tFor i=1 To n\n\t\t\tPush i\n\t\tNext i\n\t\tFor i=1 To n div 2\n\t\t\tShiftback random(2, n)\n\t\tNext i\n\t\ta=[]\n\t\tPush ! stack(a)\n\t\ta=array(a) ' change a from stack to array\n\t\tFor i=1 To n*10\n\t\t\tShiftback random(2, n)\n\t\tNext i\n\t\tFor i=0 To n-1\n\t\t\tData number ' rotate by one the stack items\n\t\t\tb=[] ' move stack To b, leave empty stack\n\t\t\ta(a#val(i))=b\n\t\t\tPush ! stack(b) ' Push from a copy of b all items To stack\n\t\tNext i\n\t\tflush\n\t\tFor k=1 To n div 2\n\t\t\tz=random(2, n)\n\t\t\tFor i=1 To n\n\t\t\t\ta=a(i)\n\t\t\t\tstack a {\n\t\t\t\t\tshift z\n\t\t\t\t}\n\t\t\tNext\n\t\tNext\n\t\tFor i=1 To n\n\t\t\ta=a(i)\n\t\t\ta(i)=array(a) ' change To array from stack\n\t\tNext i\n\t\tFor i=1 To n\n\t\t\tPrint a(i)\n\t\tNext i\n\t\tPrint TimeCount\n\tEnd Sub\n}\nFastLatinSquare\n","language":"M2000-Interpreter"},{"code":"Module LatinSquare (n, z=1, f$=\"latin.dat\", NewFile As Boolean=False) {\n\tIf Not Exist(f$) Or NewFile Then\n\t\tOpen f$ For Wide Output As f\n\tElse\n\t\tOpen f$ For Wide Append As f\n\tEnd If\n\tArrayToString=Lambda -> {\n\t\tShift 2 ' swap two top values in stack\n\t\tPush Letter$+Str$(Number)\n\t}\n\tDim line(1 to n)\n\tflush ' erase current stack of value\n\tz=if(z<1->1, z)\n\tnewColumn()\n\tFor j=1 To z\n\t\tProfiler\n\t\tResetColumns()\n\t\tFor i=1 To n\n\t\t\tplaceColumn()\n\t\tNext\n\t\tPrint \"A latin square of \";n;\" by \";n\n\t\tFor i=1 To n\n\t\t\tPrint line(i)\n\t\t\tPrint #f, line(i)#Fold$(ArrayToString)\n\t\tNext\n\t\tPrint TimeCount\n\t\tRefresh\n\tNext\n\tclose #f\n\tFlush ' empty stack again\n\tEnd\n\tSub ResetColumns()\n\t\tLocal i\n\t\tFor i=1 To n:line(i)=(,):Next\n\tEnd Sub\n\tSub newColumn()\n\t\tLocal i\n\t\tFor i=1 To n : Push i: Next\n\tEnd Sub\n\tSub shuffle()\n\t\tLocal i\n\t\tFor i=1 To n div 2: Shift Random(2, n): Next\n\tEnd Sub\n\tSub shuffleLocal(x)\n\t\tIf Stack.size<=x Then Exit Sub\n\t\tShift Random(x+1, Stack.size)\n\t\tShiftback x\n\tEnd Sub\n\tSub PlaceColumn()\n\t\tLocal i, a, b, k\n\t\tshuffle()\n\t\tDo\n\t\t\tdata number ' rotate one position\n\t\t\tk=0\n\t\t\tFor i=1 To n\n\t\t\t\ta=line(i) ' get the pointer\n\t\t\t\tDo\n\t\t\t\tIf a#Pos(Stackitem(i))=-1 Then k=0 :Exit Do\n\t\t\t\tshuffleLocal(i)\n\t\t\t\tk++\n\t\t\t\tUntil k>Stack.size-i\n\t\t\t\tIf k>0 Then Exit For\n\t\t\tNext\n\t\tUntil k=0\n\t\tFor i=1 To n\n\t\t\ta=line(i)\n\t\t\tAppend a, (Stackitem(i),)\n\t\tNext\n\tEnd Sub\n}\nForm 100,50\nLatinSquare 5, 2, True\nLatinSquare 16\n","language":"M2000-Interpreter"},{"code":"Clear[RandomLatinSquare]\nRandomLatinSquare[n_] := Module[{out, ord},\n out = Table[RotateLeft[Range[n], i], {i, n}];\n out = RandomSample[out];\n ord = RandomSample[Range[n]];\n out = out[[All, ord]];\n out\n ]\nRandomLatinSquare[5] // Grid\n","language":"Mathematica"},{"code":"import random, sequtils, strutils\n\ntype LatinSquare = seq[seq[char]]\n\nproc get[T](s: set[T]): T =\n ## Return the first element of a set.\n for n in s:\n return n\n\nproc letterAt(n: Natural): char {.inline.} = chr(ord('A') - 1 + n)\n\n\nproc latinSquare(n: Positive): LatinSquare =\n result = newSeqWith(n, toSeq(letterAt(1)..letterAt(n)))\n result[0].shuffle()\n\n for row in 1..(n - 2):\n var ok = false\n while not ok:\n block shuffling:\n result[row].shuffle()\n for prev in 0..<row:\n for col in 0..<n:\n if result[row][col] == result[prev][col]:\n break shuffling\n ok = true\n\n for col in 0..<n:\n var s = {letterAt(1)..letterAt(n)}\n for row in 0..(n - 2):\n s.excl result[row][col]\n result[^1][col] = s.get()\n\n\nproc `$`(s: LatinSquare): string =\n let n = s.len\n for row in 0..<n:\n result.add s[row].join(\" \") & '\\n'\n\n\nrandomize()\necho latinSquare(5)\necho latinSquare(5)\necho latinSquare(10)\n","language":"Nim"},{"code":"{$APPTYPE CONSOLE}\n\nconst\n Alpha = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ';\n\n\nType\nIncidenceCube = Array of Array Of Array of Integer;\n\nVar\nCube : IncidenceCube;\nDIM : Integer;\n\n\nProcedure InitIncidenceCube(Var c:IncidenceCube; const Size:Integer);\nvar i, j, k : integer;\nbegin\nDIM := Size;\nSetLength(c,DIM,DIM,DIM);\nfor i := 0 to DIM-1 do\nfor j := 0 to DIM-1 do\nfor k := 0 to DIM-1 do c[i,j,k] := 0 ;\n\nfor i := 0 to DIM-1 do\nfor j := 0 to DIM-1 do c[i,j,(i+j) mod DIM] := 1;\nend;\n\n\nProcedure FreeIncidenceCube(Var c:IncidenceCube);\nbegin\nFinalize(c);\nend;\n\n\nprocedure PrintIncidenceCube(var c:IncidenceCube);\nvar i, j, k : integer;\nbegin\n for i := 0 to DIM-1 do begin\n for j := 0 to DIM-1 do begin\n for k := 0 to DIM-1 do begin\n if (c[i,j,k]=1) then begin\n write(Alpha[k+1],' ');\n break;\n end;\n end;\n end;\n Writeln;\n end;\n Writeln;\n\tWriteLn;\nend;\n\n\nprocedure ShuffleIncidenceCube(var c:IncidenceCube);\nvar i, j, rx, ry, rz, ox, oy, oz : integer;\nbegin\n\n for i := 0 to (DIM*DIM*DIM)-1 do begin\n\n repeat\n rx := Random(DIM);\n ry := Random(DIM);\n rz := Random(DIM);\n until (c[rx,ry,rz]=0);\n\n for j := 0 to DIM-1 do begin\n if (c[j,ry,rz]=1) then ox := j;\n if (c[rx,j,rz]=1) then oy := j;\n if (c[rx,ry,j]=1) then oz := j;\n end;\n\n Inc(c[rx,ry,rz]);\n Inc(c[rx,oy,oz]);\n Inc(c[ox,ry,oz]);\n Inc(c[ox,oy,rz]);\n\n Dec(c[rx,ry,oz]);\n Dec(c[rx,oy,rz]);\n Dec(c[ox,ry,rz]);\n Dec(c[ox,oy,oz]);\n\n while (c[ox,oy,oz] < 0) do begin\n\n rx := ox ;\n ry := oy ;\n rz := oz ;\n\n if (random(2)=0) then begin\n for j := 0 to DIM-1 do begin\n if (c[j,ry,rz]=1) then ox := j;\n end;\n end else begin\n for j := DIM-1 downto 0 do begin\n if (c[j,ry,rz]=1) then ox := j;\n end;\n end;\n\n if (random(2)=0) then begin\n for j := 0 to DIM-1 do begin\n if (c[rx,j,rz]=1) then oy := j;\n end;\n end else begin\n for j := DIM-1 downto 0 do begin\n if (c[rx,j,rz]=1) then oy := j;\n end;\n end;\n\n if (random(2)=0) then begin\n for j := 0 to DIM-1 do begin\n if (c[rx,ry,j]=1) then oz := j;\n end;\n end else begin\n for j := DIM-1 downto 0 do begin\n if (c[rx,ry,j]=1) then oz := j;\n end;\n end;\n\n Inc(c[rx,ry,rz]);\n Inc(c[rx,oy,oz]);\n Inc(c[ox,ry,oz]);\n Inc(c[ox,oy,rz]);\n\n Dec(c[rx,ry,oz]);\n Dec(c[rx,oy,rz]);\n Dec(c[ox,ry,rz]);\n Dec(c[ox,oy,oz]);\n end;\n\n end;\nend;\n\nbegin\n Randomize;\n InitIncidenceCube(cube, 5); ShuffleIncidenceCube(cube); PrintIncidenceCube(cube); FreeIncidenceCube(Cube);\n InitIncidenceCube(cube, 5); ShuffleIncidenceCube(cube); PrintIncidenceCube(cube); FreeIncidenceCube(Cube);\n InitIncidenceCube(cube,10); ShuffleIncidenceCube(cube); PrintIncidenceCube(cube); FreeIncidenceCube(Cube);\t\n InitIncidenceCube(cube,26); ShuffleIncidenceCube(cube); PrintIncidenceCube(cube); FreeIncidenceCube(Cube);\nend.\n","language":"Pascal"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\nuse List::Util 'shuffle';\n\nsub random_ls {\n my($n) = @_;\n my(@cols,@symbols,@ls_sym);\n\n # build n-sized latin square\n my @ls = [0,];\n for my $i (1..$n-1) {\n @{$ls[$i]} = @{$ls[0]};\n splice(@{$ls[$_]}, $_, 0, $i) for 0..$i;\n }\n\n # shuffle rows and columns\n @cols = shuffle 0..$n-1;\n @ls = map [ @{$_}[@cols] ], @ls[shuffle 0..$n-1];\n\n # replace numbers with symbols\n @symbols = shuffle( ('A'..'Z')[0..$n-1] );\n push @ls_sym, [@symbols[@$_]] for @ls;\n @ls_sym\n}\n\nsub display {\n my $str;\n $str .= join(' ', @$_) . \"\\n\" for @_;\n $str\n}\n\nsay display random_ls($_) for 2..5, 5;\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">aleph</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\"</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">ls</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">></span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">aleph</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span> <span style=\"color: #000080;font-style:italic;\">-- too big...</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">t1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">tn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000080;font-style:italic;\">-- {1..n}</span>\n <span style=\"color: #000000;\">vcs</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000080;font-style:italic;\">-- valid for cols</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">clashes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)<</span><span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">rn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span> <span style=\"color: #000080;font-style:italic;\">-- next row</span>\n <span style=\"color: #000000;\">vr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000080;font-style:italic;\">-- valid for row (ie all)</span>\n <span style=\"color: #000000;\">vc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">deep_copy</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">vcs</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- copy (in case of clash)</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">clash</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">v</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000080;font-style:italic;\">-- collect all still valid options</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">vr</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">vc</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">v</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">k</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">={}</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">clash</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">z</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">))]</span>\n <span style=\"color: #000000;\">rn</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">z</span>\n <span style=\"color: #000000;\">vr</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span> <span style=\"color: #000080;font-style:italic;\">-- no longer valid</span>\n <span style=\"color: #000000;\">vc</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span> <span style=\"color: #000080;font-style:italic;\">-- \"\"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">clash</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">vcs</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">vc</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">clashes</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()></span><span style=\"color: #000000;\">t1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"rows completed:%d/%d, clashes:%d\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">clashes</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">t1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">line</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">line</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">aleph</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">]]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">line</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">latin_square</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">t0</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ls</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">e</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">elapsed</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()-</span><span style=\"color: #000000;\">t0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Latin square of order %d (%s):\\n%s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n <span style=\"color: #000000;\">latin_square</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">latin_square</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">latin_square</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">latin_square</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()!=</span><span style=\"color: #004600;\">JS</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">latin_square</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">42</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n<!--\n","language":"Phix"},{"code":"main =>\n _ = random2(), % random seed\n N = 5,\n foreach(_ in 1..2)\n latin_square(N, X),\n pretty_print(X)\n end,\n % A larger random instance\n latin_square(62,X),\n pretty_print(X).\n\n% Latin square\nlatin_square(N, X) =>\n X = new_array(N,N),\n X :: 1..N,\n foreach(I in 1..N)\n all_different([X[I,J] : J in 1..N]),\n all_different([X[J,I] : J in 1..N])\n end,\n % rand_val for randomness\n solve($[ff,rand_val],X).\n\npretty_print(X) =>\n N = X.len,\n Alpha = \"1234567890abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\",\n foreach(I in 1..N)\n foreach(J in 1..N)\n if N > 20 then\n printf(\"%w\",Alpha[X[I,J]])\n else\n printf(\"%2w \",X[I,J])\n end\n end,\n nl\n end,\n nl.\n","language":"Picat"},{"code":"main =>\n foreach(N in 1..6)\n Count = count_all(latin_square(N,_)),\n println(N=Count)\n end.\n","language":"Picat"},{"code":"from random import choice, shuffle\nfrom copy import deepcopy\n\ndef rls(n):\n if n <= 0:\n return []\n else:\n symbols = list(range(n))\n square = _rls(symbols)\n return _shuffle_transpose_shuffle(square)\n\n\ndef _shuffle_transpose_shuffle(matrix):\n square = deepcopy(matrix)\n shuffle(square)\n trans = list(zip(*square))\n shuffle(trans)\n return trans\n\n\ndef _rls(symbols):\n n = len(symbols)\n if n == 1:\n return [symbols]\n else:\n sym = choice(symbols)\n symbols.remove(sym)\n square = _rls(symbols)\n square.append(square[0].copy())\n for i in range(n):\n square[i].insert(i, sym)\n return square\n\ndef _to_text(square):\n if square:\n width = max(len(str(sym)) for row in square for sym in row)\n txt = '\\n'.join(' '.join(f\"{sym:>{width}}\" for sym in row)\n for row in square)\n else:\n txt = ''\n return txt\n\ndef _check(square):\n transpose = list(zip(*square))\n assert _check_rows(square) and _check_rows(transpose), \\\n \"Not a Latin square\"\n\ndef _check_rows(square):\n if not square:\n return True\n set_row0 = set(square[0])\n return all(len(row) == len(set(row)) and set(row) == set_row0\n for row in square)\n\n\nif __name__ == '__main__':\n for i in [3, 3, 5, 5, 12]:\n square = rls(i)\n print(_to_text(square))\n _check(square)\n print()\n","language":"Python"},{"code":" [ [] []\n rot times\n [ i join ]\n dup size times\n [ tuck\n nested join\n swap\n behead join ]\n drop\n shuffle\n transpose\n shuffle ] is rls ( n --> [ )\n\n 2 times\n [ 5 rls\n witheach\n [ witheach\n [ echo sp ]\n cr ]\n cr ]\n","language":"Quackery"},{"code":"sub latin-square { [[0],] };\n\nsub random ( @ls, :$size = 5 ) {\n\n # Build\n for 1 ..^ $size -> $i {\n @ls[$i] = @ls[0].clone;\n @ls[$_].splice($_, 0, $i) for 0 .. $i;\n }\n\n # Shuffle\n @ls = @ls[^$size .pick(*)];\n my @cols = ^$size .pick(*);\n @ls[$_] = @ls[$_][@cols] for ^@ls;\n\n # Some random Latin glyphs\n my @symbols = ('A' .. 'Z').pick($size);\n\n @ls.deepmap: { $_ = @symbols[$_] };\n\n}\n\nsub display ( @array ) { $_.fmt(\"%2s \").put for |@array, '' }\n\n\n# The Task\n\n# Default size 5\ndisplay random latin-square;\n\n# Specified size\ndisplay random :size($_), latin-square for 5, 3, 9;\n\n# Or, if you'd prefer:\ndisplay random latin-square, :size($_) for 12, 2, 1;\n","language":"Raku"},{"code":"/*REXX program generates and displays a randomized Latin square. */\nparse arg N seed . /*obtain the optional argument from CL.*/\nif N=='' | N==\",\" then N= 5 /*Not specified? Then use the default.*/\nif datatype(seed, 'W') then call random ,,seed /*Seed numeric? Then use it for seed.*/\nw= length(N - 1) /*get the length of the largest number.*/\n$= /*initialize $ string to null. */\n do i=0 for N; $= $ right(i, w, '_') /*build a string of numbers (from zero)*/\n end /*i*/ /* [↑] $ string is (so far) in order.*/\nz= /*Z: will be the 1st row of the square*/\n do N; ?= random(1,words($)) /*gen a random number from the $ string*/\n z= z word($, ?); $= delword($, ?, 1) /*add the number to string; del from $.*/\n end /*r*/\nzz= z||z /*build a double-length string of Z. */\n do j=1 for N /* [↓] display rows of random Latin sq*/\n say translate(subword(zz, j, N), , '_') /*translate leading underbar to blank. */\n end /*j*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"load \"stdlib.ring\"\nload \"guilib.ring\"\n\n###====================================================================================\n\nsize = 10\n\ntime1 = 0\nbwidth = 0\nbheight = 0\t\n\t\t\t\t\na2DSquare = newlist(size,size)\na2DFinal = newlist(size,size)\n\naList = 1:size\naList2 = RandomList(aList)\n\nGenerateRows(aList2)\nShuffleCols(a2DSquare, a2DFinal)\n\nC_SPACING = 1\nButton = newlist(size,size)\nLayoutButtonRow = list(size)\nC_ButtonOrangeStyle = 'border-radius:1x;color:black; background-color: orange'\n\n###====================================================================================\n\nMyApp = New qApp {\n\n\tStyleFusion()\n\n\twin = new qWidget() {\n\n\t\tworkHeight = win.height()\n\t\tfontSize = 8 + (300/size)\n\n\t wwidth = win.width()\n\t wheight = win.height()\n\t bwidth = wwidth/size\n\t bheight = wheight/size\n\n\t\tsetwindowtitle(\"Random Latin Squares\")\n\t\tmove(555,0)\n\t\tsetfixedsize(1000,1000)\n\n\t\tmyfilter = new qallevents(win)\n\t\tmyfilter.setResizeEvent(\"resizeBoard()\")\n\t\tinstalleventfilter(myfilter)\n\n\t\tLayoutButtonMain = new QVBoxLayout() {\n\t\t\tsetSpacing(C_SPACING)\n\t\t\tsetContentsmargins(50,50,50,50)\n\t\t}\n\n\t\tLayoutButtonStart = new QHBoxLayout() {\n\t\t\tsetSpacing(C_SPACING)\n\t\t\tsetContentsmargins(0,0,0,0)\n\t\t}\n\n\t\tbtnStart = new qPushButton(win) {\n\t\t\tsetFont(new qFont(\"Calibri\",fontsize,2100,0))\n\t\t\tresize(bwidth,bheight)\n\t\t\tsettext(\" Start \")\n\t\t\tsetstylesheet(C_ButtonOrangeStyle)\n\t\t\tsetclickevent(\"gameSolution()\")\n\t\t}\n\n\t\tsizeBtn = new qlabel(win)\n\t\t{\n\t\t\tsetFont(new qFont(\"Calibri\",fontsize,2100,0))\n\t\t\tresize(bwidth,bheight)\n\t\t\tsetStyleSheet(\"background-color:rgb(255,255,204)\")\n\t\t\tsetText(\" Size: \")\n\t\t}\t\n\n\t\tlineSize = new qLineEdit(win)\n\t\t{\n\t\t\tsetFont(new qFont(\"Calibri\",fontsize,2100,0))\n\t\t\tresize(bwidth,bheight)\n\t\t\tsetStyleSheet(\"background-color:rgb(255,255,204)\")\n\t\t\tsetAlignment( Qt_AlignHCenter)\n\t\t\tsetAlignment( Qt_AlignVCenter)\n\t\t\tsetreturnPressedEvent(\"newBoardSize()\")\n\t\t\tsetText(string(size))\n\t\t}\n\n\t\tbtnExit = new qPushButton(win) {\n\t\t\tsetFont(new qFont(\"Calibri\",fontsize,2100,0))\n\t\t\tresize(bwidth,bheight)\n\t\t\tsettext(\" Exit \")\n\t\t\tsetstylesheet(C_ButtonOrangeStyle)\n\t\t\tsetclickevent(\"pExit()\")\n\t\t}\n\n\t\tLayoutButtonStart.AddWidget(btnStart)\n\t\tLayoutButtonStart.AddWidget(sizeBtn)\n\t\tLayoutButtonStart.AddWidget(lineSize)\n\t\tLayoutButtonStart.AddWidget(btnExit)\n\t\n\t\tLayoutButtonMain.AddLayout(LayoutButtonStart)\n\n\t\tfor Row = 1 to size\n\n\t\t\tLayoutButtonRow[Row] = new QHBoxLayout() {\n\t\t\t\tsetSpacing(C_SPACING)\n\t\t\t\tsetContentsmargins(0,0,0,0)\n\t\t\t}\n\n\t\t\tfor Col = 1 to size\n\t\t\t\tButton[Row][Col] = new qlabel(win) {\n\t\t\t\t\tsetFont(new qFont(\"Calibri\",fontsize,2100,0))\n\t\t\t\t\tresize(bwidth,bheight)\n\t\t\t\t}\n\t\t\t\tLayoutButtonRow[Row].AddWidget(Button[Row][Col])\n\t\t\tnext\n\t\t\tLayoutButtonMain.AddLayout(LayoutButtonRow[Row])\n\n\t\tnext\n\n\t\tsetLayout(LayoutButtonMain)\n\n\t\t show()\n\n\t}\n\n\texec()\n}\n\n###====================================================================================\n\nfunc newBoardSize()\n\n\tnrSize = number(lineSize.text())\n\n\tif nrSize = 1\n\t\t? \"Enter: Size > 1\"\n\t\treturn\n\tok\n\n\tfor Row = 1 to size\n\t\tfor Col = 1 to size\n\t\t\tButton[Row][Col].settext(\"\")\n\t\tnext\n\tnext\n\n\tnewWindow(nrSize)\n\n###====================================================================================\n\nfunc newWindow(newSize)\n\n\ttime1 = clock()\n\n\tfor Row = 1 to size\n\t\tfor Col = 1 to size\n\t\t\tButton[Row][Col].delete()\n\t\tnext\n\tnext\n\n\tsize = newSize\n\n\tbwidth = ceil((win.width() - 8) / size)\n\tbheight = ceil((win.height() - 32) / size)\n\n\tfontSize = 8 + (300/size)\n\n\tif size > 16\n\t\tfontSize = 8 + (150/size)\n\tok\n\n\tif size < 8\n\t\tfontSize = 30 + (150/size)\n\tok\n\n\tif size = 2\n\t\tfontSize = 10 + (100/size)\n\tok\n\n\tbtnStart.setFont(new qFont(\"Calibri\",fontsize,2100,0))\n\tsizeBtn.setFont(new qFont(\"Calibri\",fontsize,2100,0))\n\tlineSize.setFont(new qFont(\"Calibri\",fontsize,2100,0))\n\tbtnExit.setFont(new qFont(\"Calibri\",fontsize,2100,0))\n\n\tLayoutButtonStart = new QHBoxLayout() {\n\t\tsetSpacing(C_SPACING)\n\t\tsetContentsmargins(0,0,0,0)\n\t}\n\n\tButton = newlist(size,size)\n\tLayoutButtonRow = list(size)\n\n\tfor Row = 1 to size\n\n\t\tLayoutButtonRow[Row] = new QHBoxLayout() {\n\t\t\tsetSpacing(C_SPACING)\n\t\t\tsetContentsmargins(0,0,0,0)\n\t\t}\n\n\t\tfor Col = 1 to size\n\n\t\t\tButton[Row][Col] = new qlabel(win) {\n\t\t\t\tsetFont(new qFont(\"Calibri\",fontsize,2100,0))\n\t\t\t\tresize(bwidth,bheight)\n\t\t\t}\n\t\t\tLayoutButtonRow[Row].AddWidget(Button[Row][Col])\n\n\t\tnext\n\n\t\tLayoutButtonMain.AddLayout(LayoutButtonRow[Row])\n\n\tnext\n\n\twin.setLayout(LayoutButtonMain)\n\n\treturn\n\n###====================================================================================\n\nfunc resizeBoard\n\n\tbwidth = ceil((win.width() - 8) / size)\n\tbheight = ceil((win.height() - 32) / size)\n\n\tfor Row = 1 to size\n\t\tfor Col = 1 to size\n\t\t\tButton[Row][Col].resize(bwidth,bheight)\n\t\tnext\n\tnext\n\n###====================================================================================\n\nFunc pExit\n\n\tMyApp.quit()\n\n###====================================================================================\n\nfunc gameSolution()\n\n\ta2DSquare = newlist(size,size)\n\ta2DFinal = newlist(size,size)\n\n\taList = 1:size\n\taList2 = RandomList(aList)\n\n\tGenerateRows(aList2)\n\tShuffleCols(a2DSquare, a2DFinal)\n\n\tfor nRow = 1 to size\n\t\tfor nCol = 1 to size\n\t\t\tButton[nRow][nCol].settext(\"-\")\n\t\tnext\n\tnext\n\n\tfor nRow = 1 to size\n\t\tfor nCol = 1 to size\n\t\t\tButton[nRow][nCol].resize(bwidth,bheight)\n\t\t\tButton[nRow][nCol].settext(string(a2DSquare[nRow][nCol]))\n\t\tnext\n\tnext\n\n\ttime2 = clock()\n\ttime3 = (time2 - time1)/1000\n\t? \"Elapsed time: \" + time3 + \" ms at size = \" + size + nl\n\n###====================================================================================\n\n// Scramble the numbers in the List\n// Uniq random picks, then shorten list by each pick\n\nFunc RandomList(aInput)\n\n aOutput = []\n\n while len(aInput) > 1\n nIndex = random(len(aInput)-1)\n nIndex++\n\n aOutput + aInput[nIndex]\n del(aInput,nIndex)\n end\n\n aOutput + aInput[1]\n\nreturn aOutput\n\n###====================================================================================\n// Generate Rows of data. Put them in the 2DArray\n\nFunc GenerateRows(aInput)\n\n\taOutput = []\n\tsize = len(aInput)\n shift = 1\n\n\tfor k = 1 to size\t\t\t\t\t\t\t\t\t// Make 8 Rows of lists\n\t\taOutput = []\n\t\t\n\t\tfor i = 1 to size \t\t\t\t\t// make a list\n\t\t\t pick = i + shift \t\t\t\t\t// shift every Row by +1 more\n\t\t\tif pick > size pick = pick - size ok\n\t\n\t\t\taOutput + aInput[pick]\n\t\tnext\n\t\n\t\ta2DSquare[k] = aOutput\t\t\t\t\t\t\t// Row of Output to a2DSquare\n\n\t\tshift++ \t\t\t\t\t\t// shift next line by +1 more\n\t\tif shift > size shift = 1 ok\n\tnext\n\n\treturn\n\n###====================================================================================\n// Shift random Rows into a2DFinal, then random Cols\n\nFunc ShuffleCols(a2DSquare, a2DFinal)\n\n\taSuffle = 1:size\n aSuffle2 = RandomList(aSuffle)\t// Pick random Col to insert in a2DFinal\n\t\n\tfor i = 1 to size \t// Row\t\t\n\t\tpick = aSuffle2[i]\n\n for j = 1 to size\t\t\t// Col\n\t\t\ta2DFinal[i][j] = a2DSquare[pick][j] // i-Row-Col j-Horz-Vert\n\t\tnext\n\tnext\n\n\ta2DSquare = a2DFinal\t\t\t// Now do the verticals\n\taSuffle = 1:size\n\taSuffle2 = RandomList(aSuffle)\n\n\tfor i = 1 to size \t// Row\t\t\n\t\tpick = aSuffle2[i]\n\n for j = 1 to size\t\t\t// Col\n\t\t\ta2DFinal[j][i] = a2DSquare[j][pick] //Reverse i-j , i-Row-Col j-Horz-Vert\n\t\tnext\n\tnext\n\n\treturn\n\n###====================================================================================\n","language":"Ring"},{"code":"N = 5\n\ndef generate_square\n perms = (1..N).to_a.permutation(N).to_a.shuffle\n square = []\n N.times do\n square << perms.pop\n perms.reject!{|perm| perm.zip(square.last).any?{|el1, el2| el1 == el2} }\n end\n square\nend\n\ndef print_square(square)\n cell_size = N.digits.size + 1\n strings = square.map!{|row| row.map!{|el| el.to_s.rjust(cell_size)}.join }\n puts strings, \"\\n\"\nend\n\n2.times{print_square( generate_square)}\n","language":"Ruby"},{"code":"import \"random\" for Random\n\nvar rand = Random.new()\n\nvar printSquare = Fn.new { |latin|\n for (row in latin) System.print(row)\n System.print()\n}\n\nvar latinSquare = Fn.new { |n|\n if (n <= 0) {\n System.print(\"[]\\n\")\n return\n }\n var latin = List.filled(n, null)\n for (i in 0...n) {\n latin[i] = List.filled(n, 0)\n if (i == n - 1) break\n for (j in 0...n) latin[i][j] = j\n }\n\n // first row\n rand.shuffle(latin[0])\n\n // middle row(s)\n for (i in 1...n-1) {\n var shuffled = false\n while (!shuffled) {\n rand.shuffle(latin[i])\n var shuffling = false\n for (k in 0...i) {\n for (j in 0...n) {\n if (latin[k][j] == latin[i][j]) {\n shuffling = true\n break\n }\n }\n if (shuffling) break\n }\n if (!shuffling) shuffled = true\n }\n }\n\n // last row\n for (j in 0...n) {\n var used = List.filled(n, false)\n for (i in 0...n-1) used[latin[i][j]] = true\n for (k in 0...n) {\n if (!used[k]) {\n latin[n-1][j] = k\n break\n }\n }\n }\n printSquare.call(latin)\n}\n\nlatinSquare.call(5)\nlatinSquare.call(5)\nlatinSquare.call(10) // for good measure\n","language":"Wren"},{"code":"import \"random\" for Random\nimport \"./sort\" for Sort\nimport \"./fmt\" for Fmt\nimport \"./math\" for Int\n\nvar rand = Random.new()\nvar counts = List.filled(4, 0)\nvar aa = List.filled(16, 0)\n\nvar testSquares = [\n [0, 1, 2, 3, 1, 0, 3, 2, 2, 3, 0, 1, 3, 2, 1, 0],\n [0, 1, 2, 3, 1, 0, 3, 2, 2, 3, 1, 0, 3, 2, 0, 1],\n [0, 1, 2, 3, 1, 2, 3, 0, 2, 3, 0, 1, 3, 0, 1, 2],\n [0, 1, 2, 3, 1, 3, 0, 2, 2, 0, 3, 1, 3, 2, 1, 0]\n]\n\n// Checks whether two lists contain the same elements in the same order\nvar areSame = Fn.new { |l1, l2|\n if (l1.count != l2.count) return false\n for (i in 0...l1.count) {\n if (l1[i] != l2[i]) return false\n }\n return true\n}\n\n// generate derangements of first n numbers, with 'start' in first place.\nvar dList = Fn.new { |n, start|\n var r = []\n start = start - 1 // use 0 basing\n var a = List.filled(n, 0)\n for (i in 0...n) a[i] = i\n var t = a[0]\n a[0] = start\n a[start] = t\n Sort.quick(a, 1, a.count-1, null)\n var first = a[1]\n var recurse // recursive closure permutes a[1..-1]\n recurse = Fn.new { |last|\n if (last == first) {\n // bottom of recursion. you get here once for each permutation.\n // test if permutation is deranged.\n var j = 0 // j starts from 0, not 1\n for (v in a.skip(1)) {\n if (j+1 == v) return r // no, ignore it\n j = j + 1\n }\n // yes, save a copy\n var b = a.toList\n for (i in 0...b.count) b[i] = b[i] + 1 // change back to 1 basing\n r.add(b)\n return r\n }\n var i = last\n while (i >= 1) {\n a.swap(i, last)\n recurse.call(last - 1)\n a.swap(i, last)\n i = i - 1\n }\n }\n recurse.call(n - 1)\n return r\n}\n\nvar copyMatrix = Fn.new { |m|\n var le = m.count\n var cpy = List.filled(le, null)\n for (i in 0...le) cpy[i] = m[i].toList\n return cpy\n}\n\nvar reducedLatinSquares = Fn.new { |n|\n var rls = []\n if (n < 0) n = 0\n var rlatin = List.filled(n, null)\n for (i in 0...n) rlatin[i] = List.filled(n, 0)\n if (n <= 1) {\n rls.add(rlatin)\n return rls\n }\n\n // first row\n for (j in 0...n) rlatin[0][j] = j + 1\n\n // recursive closure to compute reduced latin squares\n var recurse\n recurse = Fn.new { |i|\n var rows = dList.call(n, i) // get derangements of first n numbers, with 'i' first.\n for (r in 0...rows.count) {\n var outer = false\n rlatin[i-1] = rows[r].toList\n for (k in 0...i-1) {\n for (j in 1...n) {\n if (rlatin[k][j] == rlatin[i-1][j]) {\n if (r < rows.count-1) {\n outer = true\n break\n } else if (i > 2) {\n return\n }\n }\n }\n if (outer) break\n }\n if (outer) continue\n if (i < n) {\n recurse.call(i + 1)\n } else {\n var rl = copyMatrix.call(rlatin)\n rls.add(rl)\n }\n }\n return\n }\n\n // remaining rows\n recurse.call(2)\n return rls\n}\n\nvar printSquare = Fn.new { |latin, n|\n for (i in 0...n) {\n for (j in 0...n) Fmt.write(\"$d \", latin[i][j]-1)\n System.print()\n }\n System.print()\n}\n\n// generate permutations of first n numbers, starting from 0.\nvar pList = Fn.new { |n|\n var fact = Int.factorial(n)\n var perms = List.filled(fact, null)\n var a = List.filled(n, 0)\n for (i in 0...n) a[i] = i\n var t = a.toList\n perms[0] = t\n n = n - 1\n for (c in 1...fact) {\n var i = n - 1\n var j = n\n while (a[i] > a[i+1]) i = i - 1\n while (a[j] < a[i]) j = j - 1\n a.swap(i, j)\n j = n\n i = i + 1\n while (i < j) {\n a.swap(i, j)\n i = i + 1\n j = j - 1\n }\n var t = a.toList\n t.add(0)\n perms[c] = t\n }\n return perms\n}\n\nvar generateLatinSquares = Fn.new { |n, tests, echo|\n var rls = reducedLatinSquares.call(n)\n var perms = pList.call(n)\n var perms2 = pList.call(n - 1)\n for (test in 0...tests) {\n var rn = rand.int(rls.count)\n var rl = rls[rn] // select reduced random square at random\n rn = rand.int(perms.count)\n var rp = perms[rn] // select a random permuation of 'rl's columns\n // permute columns\n var t = List.filled(n, null)\n for (i in 0...n) {\n t[i] = List.filled(n, 0)\n for (j in 0...n) t[i][j] = rl[i][rp[j]]\n }\n rn = rand.int(perms2.count)\n rp = perms2[rn] // select a random permutation of 't's rows 2 to n\n // permute rows 2 to n\n var u = List.filled(n, null)\n for (i in 0...n) {\n u[i] = List.filled(n, 0)\n for (j in 0...n) {\n if (i == 0) {\n u[i][j] = t[i][j]\n } else {\n u[i][j] = t[rp[i-1]+1][j]\n }\n }\n }\n if (test < echo) printSquare.call(u, n)\n if (n == 4) {\n for (i in 0..3) {\n for (j in 0..3) u[i][j] = u[i][j] - 1\n }\n for (i in 0..3) {\n for (j in 4*i...4*i+4) {\n aa[j] = u[i][j - 4*i]\n }\n }\n for (i in 0..3) {\n if (areSame.call(testSquares[i], aa)) {\n counts[i] = counts[i] + 1\n break\n }\n }\n }\n }\n}\n\nSystem.print(\"Two randomly generated latin squares of order 5 are:\\n\")\ngenerateLatinSquares.call(5, 2, 2)\n\nSystem.print(\"Out of 1,000,000 randomly generated latin squares of order 4, \")\nSystem.print(\"of which there are 576 instances ( => expected 1736 per instance),\")\nSystem.print(\"the following squares occurred the number of times shown:\\n\")\ngenerateLatinSquares.call(4, 1e6, 0)\nfor (i in 0..3) System.print(\"%(testSquares[i]) : %(counts[i])\")\nSystem.print(\"\\nA randomly generated latin square of order 6 is:\\n\")\ngenerateLatinSquares.call(6, 1, 1)\n","language":"Wren"},{"code":"fcn randomLatinSquare(n,symbols=[1..]){ //--> list of lists\n if(n<=0) return(T);\n square,syms := List(), symbols.walker().walk(n);\n do(n){ syms=syms.copy(); square.append(syms.append(syms.pop(0))) }\n // shuffle rows, transpose & shuffle columns\n T.zip(square.shuffle().xplode()).shuffle();\n}\nfcn rls2String(square){ square.apply(\"concat\",\" \").concat(\"\\n\") }\n","language":"Zkl"},{"code":"foreach n in (T(1,2,5)){ randomLatinSquare(n) : rls2String(_).println(\"\\n\") }\nrandomLatinSquare(5, [\"A\"..\"Z\"]) : rls2String(_).println(\"\\n\");\nrandomLatinSquare(10,\"!@#$%^&*()\") : rls2String(_).println(\"\\n\");\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Random_Latin_squares\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"A Latin square of size <code>n</code> is an arrangement of <code>n</code> symbols in an <code>n-by-n</code> square in such a way that each row and column has each symbol appearing exactly once.<br>\\nFor the purposes of this task, a random Latin square of size <code>n</code> is a Latin square constructed or generated by a probabilistic procedure such that the probability of any particular Latin square of size <code>n</code> being produced is non-zero.\\n\\n;Example n=4 randomised Latin square:\\n<pre>0 2 3 1\\n2 1 0 3\\n3 0 1 2\\n1 3 2 0</pre>\\n\\n;Task:\\n# Create a function/routine/procedure/method/... that given <code>n</code> generates a randomised Latin square of size <code>n</code>.\\n# Use the function to generate ''and show here'', two randomly generated squares of size 5.\\n\\n;Note: \\nStrict ''uniformity'' in the random generation is a hard problem and '''not''' a requirement of the task.\\n\\n;Related tasks:\\n* [[Latin Squares in reduced form/Randomizing using Jacobson and Matthews’ Technique]]\\n* [[Latin Squares in reduced form]]\\n\\n;Reference:\\n* [[wp:Latin_square|Wikipedia: Latin square]]\\n* [[oeis:A002860|OEIS: A002860]]\\n<br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F _transpose(matrix)\\n assert(matrix.len == matrix[0].len)\\n V r = [[0] * matrix.len] * matrix.len\\n L(i) 0 .< matrix.len\\n L(j) 0 .< matrix.len\\n r[i][j] = matrix[j][i]\\n R r\\n\\nF _shuffle_transpose_shuffle(matrix)\\n V square = copy(matrix)\\n random:shuffle(&square)\\n V trans = _transpose(square)\\n random:shuffle(&trans)\\n R trans\\n\\nF _rls(&symbols)\\n V n = symbols.len\\n I n == 1\\n R [symbols]\\n E\\n V sym = random:choice(symbols)\\n symbols.remove(sym)\\n V square = _rls(&symbols)\\n square.append(copy(square[0]))\\n L(i) 0 .< n\\n square[i].insert(i, sym)\\n R square\\n\\nF rls(n)\\n V symbols = Array(0 .< n)\\n V square = _rls(&symbols)\\n R _shuffle_transpose_shuffle(square)\\n\\nF _check_rows(square)\\n V set_row0 = Set(square[0])\\n R all(square.map(row -> row.len == Set(row).len & Set(row) == @set_row0))\\n\\nF _check(square)\\n V transpose = _transpose(square)\\n assert(_check_rows(square) & _check_rows(transpose), ‘Not a Latin square’)\\n\\nL(i) [3, 3, 5, 5]\\n V square = rls(i)\\n print(square.map(row -> row.join(‘ ’)).join(\\\"\\\\n\\\"))\\n _check(square)\\n print()\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"DEFINE PTR=\\\"CARD\\\"\\nDEFINE DIMENSION=\\\"5\\\"\\n\\nTYPE Matrix=[\\n PTR data ;BYTE ARRAY\\n BYTE dim]\\n\\nPTR FUNC GetPtr(Matrix POINTER mat BYTE x,y)\\nRETURN (mat.data+x+y*mat.dim)\\n\\nPROC PrintMatrix(Matrix POINTER mat)\\n BYTE x,y\\n BYTE POINTER d\\n\\n d=GetPtr(mat,0,0)\\n FOR y=0 TO mat.dim-1\\n DO\\n FOR x=0 TO mat.dim-1\\n DO\\n PrintB(d^) Put(32)\\n d==+1\\n OD\\n PutE()\\n OD\\nRETURN\\n\\nPROC KnuthShuffle(BYTE ARRAY tab BYTE size)\\n BYTE i,j,tmp\\n\\n i=size-1\\n WHILE i>0\\n DO\\n j=Rand(i+1)\\n tmp=tab(i)\\n tab(i)=tab(j)\\n tab(j)=tmp\\n i==-1\\n OD\\nRETURN\\n\\nPROC LatinSquare(Matrix POINTER mat)\\n BYTE x,y,yy,shuffled\\n BYTE POINTER ptr1,ptr2\\n BYTE ARRAY used(DIMENSION)\\n\\n ptr1=GetPtr(mat,0,0)\\n FOR y=0 TO mat.dim-1\\n DO\\n FOR x=0 TO mat.dim-1\\n DO\\n ptr1^=x\\n ptr1==+1\\n OD\\n OD\\n\\n ;first row\\n ptr1=GetPtr(mat,0,0)\\n KnuthShuffle(ptr1,mat.dim)\\n\\n ;middle rows\\n FOR y=1 TO mat.dim-2\\n DO\\n shuffled=0\\n WHILE shuffled=0\\n DO\\n ptr1=GetPtr(mat,0,y)\\n KnuthShuffle(ptr1,mat.dim)\\n\\n shuffled=1\\n yy=0\\n WHILE shuffled=1 AND yy<y\\n DO\\n x=0\\n WHILE shuffled=1 AND x<mat.dim\\n DO\\n ptr1=GetPtr(mat,x,yy)\\n ptr2=GetPtr(mat,x,y)\\n IF ptr1^=ptr2^ THEN\\n shuffled=0\\n FI\\n x==+1\\n OD\\n yy==+1\\n OD\\n OD\\n OD\\n\\n ;last row\\n FOR x=0 TO mat.dim-1\\n DO\\n Zero(used,mat.dim)\\n\\n FOR y=0 TO mat.dim-2\\n DO\\n ptr1=GetPtr(mat,x,y)\\n yy=ptr1^ used(yy)=1\\n OD\\n\\n FOR y=0 TO mat.dim-1\\n DO\\n IF used(y)=0 THEN\\n ptr1=GetPtr(mat,x,mat.dim-1)\\n ptr1^=y\\n EXIT\\n FI\\n OD\\n OD\\nRETURN\\n\\nPROC Main()\\n BYTE ARRAY d(25)\\n BYTE i\\n Matrix mat\\n\\n mat.data=d\\n mat.dim=DIMENSION\\n\\n FOR i=1 TO 2\\n DO\\n LatinSquare(mat)\\n PrintMatrix(mat)\\n PutE()\\n OD\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"BEGIN # generate random latin squares #\\n\\n # Knuth Shuffle routine from the Knuth Shuffle Task #\\n # modified to shufflw a row of a [,]CHAR array #\\n PROC knuth shuffle = (REF[,]CHAR a, INT row)VOID:\\n (\\n PROC between = (INT a, b)INT :\\n (\\n ENTIER (random * ABS (b-a+1) + (a<b|a|b))\\n );\\n FOR i FROM LWB a TO UPB a DO\\n INT j = between(LWB a, UPB a);\\n CHAR t = a[row, i];\\n a[row, i] := a[row, j];\\n a[row, j] := t\\n OD\\n );\\n\\n # generates a random latin square #\\n PROC latin square = ( INT n )[,]CHAR:\\n BEGIN\\n [ 1 : n ]CHAR letters;\\n [ 1 : n, 1 : n ]CHAR result;\\n FOR col TO n DO\\n letters[ col ] := REPR ( ABS \\\"A\\\" + ( col - 1 ) )\\n OD;\\n FOR row TO n DO\\n result[ row, : ] := letters\\n OD;\\n knuth shuffle( result, 1 );\\n FOR row FROM 2 TO n - 1 DO\\n BOOL ok := FALSE;\\n WHILE\\n knuth shuffle( result, row );\\n BOOL all different := TRUE;\\n FOR prev TO row - 1 WHILE all different DO\\n FOR col TO n\\n WHILE all different :=\\n result[ row, col ] /= result[ prev, col ]\\n DO SKIP OD\\n OD;\\n NOT all different\\n DO SKIP OD\\n OD;\\n # the final row, there is only one possibility for each column #\\n FOR col TO n DO\\n [ 1 : n ]CHAR free := letters;\\n FOR row TO n - 1 DO\\n free[ ( ABS result[ row, col ] - ABS \\\"A\\\" ) + 1 ] := REPR 0\\n OD;\\n BOOL found := FALSE;\\n FOR row FROM 1 LWB result TO 1 UPB result WHILE NOT found DO\\n IF free[ row ] /= REPR 0 THEN\\n found := TRUE;\\n result[ n, col ] := free[ row ]\\n FI\\n OD\\n OD;\\n result\\n END # latin suare # ;\\n\\n # prints a latin square #\\n PROC print square = ( [,]CHAR square )VOID:\\n FOR row FROM 1 LWB square TO 1 UPB square DO\\n IF 2 LWB square <= 2 UPB square THEN\\n print( ( square[ row, 2 LWB square ] ) );\\n FOR col FROM 2 LWB square + 1 TO 2 UPB square DO\\n print( ( \\\" \\\", square[ row, col ] ) )\\n OD;\\n print( ( newline ) )\\n FI\\n OD # print square # ;\\n\\n next random;\\n print square( latin square( 5 ) );\\n print( ( newline ) );\\n print square( latin square( 5 ) );\\n print( ( newline ) );\\n print square( latin square( 10 ) )\\n\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"latinSquare: function [n][\\n square: new []\\n variants: shuffle permutate 0..n-1\\n while -> n > size square [\\n row: sample variants\\n 'square ++ @[row]\\n filter 'variants 'variant [\\n reject: false\\n loop.with:'i variant 'col [\\n if col = row\\\\[i] ->\\n reject: true\\n ]\\n reject\\n ]\\n ]\\n return square\\n]\\n\\nloop 2 'x [\\n ls: latinSquare 5\\n loop ls 'row ->\\n print row\\n print \\\"---------\\\"\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"#include <stdbool.h>\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <time.h>\\n\\n// low <= num < high\\nint randInt(int low, int high) {\\n return (rand() % (high - low)) + low;\\n}\\n\\n// shuffle an array of n elements\\nvoid shuffle(int *const array, const int n) {\\n if (n > 1) {\\n int i;\\n for (i = 0; i < n - 1; i++) {\\n int j = randInt(i, n);\\n\\n int t = array[i];\\n array[i] = array[j];\\n array[j] = t;\\n }\\n }\\n}\\n\\n// print an n * n array\\nvoid printSquare(const int *const latin, const int n) {\\n int i, j;\\n for (i = 0; i < n; i++) {\\n printf(\\\"[\\\");\\n for (j = 0; j < n; j++) {\\n if (j > 0) {\\n printf(\\\", \\\");\\n }\\n printf(\\\"%d\\\", latin[i * n + j]);\\n }\\n printf(\\\"]\\\\n\\\");\\n }\\n printf(\\\"\\\\n\\\");\\n}\\n\\nvoid latinSquare(const int n) {\\n int *latin, *used;\\n int i, j, k;\\n\\n if (n <= 0) {\\n printf(\\\"[]\\\\n\\\");\\n return;\\n }\\n\\n // allocate\\n latin = (int *)malloc(n * n * sizeof(int));\\n if (!latin) {\\n printf(\\\"Failed to allocate memory.\\\");\\n return;\\n }\\n\\n // initialize\\n for (i = 0; i < n; i++) {\\n for (j = 0; j < n; j++) {\\n latin[i * n + j] = j;\\n }\\n }\\n\\n // first row\\n shuffle(latin, n);\\n\\n // middle row(s)\\n for (i = 1; i < n - 1; i++) {\\n bool shuffled = false;\\n\\n while (!shuffled) {\\n shuffle(&latin[i * n], n);\\n\\n for (k = 0; k < i; k++) {\\n for (j = 0; j < n; j++) {\\n if (latin[k * n + j] == latin[i * n + j]) {\\n goto shuffling;\\n }\\n }\\n }\\n shuffled = true;\\n\\n shuffling: {}\\n }\\n }\\n\\n //last row\\n used = (int *)malloc(n * sizeof(int));\\n for (j = 0; j < n; j++) {\\n memset(used, 0, n * sizeof(int));\\n for (i = 0; i < n - 1; i++) {\\n used[latin[i * n + j]] = 1;\\n }\\n for (k = 0; k < n; k++) {\\n if (used[k] == 0) {\\n latin[(n - 1) * n + j] = k;\\n break;\\n }\\n }\\n }\\n free(used);\\n\\n // print the result\\n printSquare(latin, n);\\n free(latin);\\n}\\n\\nint main() {\\n // initialze the random number generator\\n srand((unsigned int)time((time_t)0));\\n\\n latinSquare(5);\\n latinSquare(5);\\n latinSquare(10);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <chrono>\\n#include <iostream>\\n#include <random>\\n#include <vector>\\n\\ntemplate <typename T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n auto it = v.cbegin();\\n auto end = v.cend();\\n\\n os << '[';\\n if (it != end) {\\n os << *it;\\n it = std::next(it);\\n }\\n while (it != end) {\\n os << \\\", \\\";\\n os << *it;\\n it = std::next(it);\\n }\\n return os << ']';\\n}\\n\\nvoid printSquare(const std::vector<std::vector<int>> &latin) {\\n for (auto &row : latin) {\\n std::cout << row << '\\\\n';\\n }\\n std::cout << '\\\\n';\\n}\\n\\nvoid latinSquare(int n) {\\n if (n <= 0) {\\n std::cout << \\\"[]\\\\n\\\";\\n return;\\n }\\n\\n // obtain a time-based seed:\\n unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();\\n auto g = std::default_random_engine(seed);\\n\\n std::vector<std::vector<int>> latin;\\n for (int i = 0; i < n; ++i) {\\n std::vector<int> inner;\\n for (int j = 0; j < n; ++j) {\\n inner.push_back(j);\\n }\\n latin.push_back(inner);\\n }\\n // first row\\n std::shuffle(latin[0].begin(), latin[0].end(), g);\\n\\n // middle row(s)\\n for (int i = 1; i < n - 1; ++i) {\\n bool shuffled = false;\\n\\n while (!shuffled) {\\n std::shuffle(latin[i].begin(), latin[i].end(), g);\\n for (int k = 0; k < i; ++k) {\\n for (int j = 0; j < n; ++j) {\\n if (latin[k][j] == latin[i][j]) {\\n goto shuffling;\\n }\\n }\\n }\\n shuffled = true;\\n\\n shuffling: {}\\n }\\n }\\n\\n // last row\\n for (int j = 0; j < n; ++j) {\\n std::vector<bool> used(n, false);\\n for (int i = 0; i < n - 1; ++i) {\\n used[latin[i][j]] = true;\\n }\\n for (int k = 0; k < n; ++k) {\\n if (!used[k]) {\\n latin[n - 1][j] = k;\\n break;\\n }\\n }\\n }\\n\\n printSquare(latin);\\n}\\n\\nint main() {\\n latinSquare(5);\\n latinSquare(5);\\n latinSquare(10);\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\n\\nnamespace RandomLatinSquares {\\n using Matrix = List<List<int>>;\\n\\n // Taken from https://stackoverflow.com/a/1262619\\n static class Helper {\\n private static readonly Random rng = new Random();\\n\\n public static void Shuffle<T>(this IList<T> list) {\\n int n = list.Count;\\n while (n > 1) {\\n n--;\\n int k = rng.Next(n + 1);\\n T value = list[k];\\n list[k] = list[n];\\n list[n] = value;\\n }\\n }\\n }\\n\\n class Program {\\n static void PrintSquare(Matrix latin) {\\n foreach (var row in latin) {\\n Console.Write('[');\\n\\n var it = row.GetEnumerator();\\n if (it.MoveNext()) {\\n Console.Write(it.Current);\\n }\\n while (it.MoveNext()) {\\n Console.Write(\\\", \\\");\\n Console.Write(it.Current);\\n }\\n\\n Console.WriteLine(']');\\n }\\n Console.WriteLine();\\n }\\n\\n static void LatinSquare(int n) {\\n if (n <= 0) {\\n Console.WriteLine(\\\"[]\\\");\\n return;\\n }\\n\\n var latin = new Matrix();\\n for (int i = 0; i < n; i++) {\\n List<int> temp = new List<int>();\\n for (int j = 0; j < n; j++) {\\n temp.Add(j);\\n }\\n latin.Add(temp);\\n }\\n // first row\\n latin[0].Shuffle();\\n\\n // middle row(s)\\n for (int i = 1; i < n - 1; i++) {\\n bool shuffled = false;\\n\\n while (!shuffled) {\\n latin[i].Shuffle();\\n for (int k = 0; k < i; k++) {\\n for (int j = 0; j < n; j++) {\\n if (latin[k][j] == latin[i][j]) {\\n goto shuffling;\\n }\\n }\\n }\\n shuffled = true;\\n\\n shuffling: { }\\n }\\n }\\n\\n // last row\\n for (int j = 0; j < n; j++) {\\n List<bool> used = new List<bool>();\\n for (int i = 0; i < n; i++) {\\n used.Add(false);\\n }\\n\\n for (int i = 0; i < n-1; i++) {\\n used[latin[i][j]] = true;\\n }\\n for (int k = 0; k < n; k++) {\\n if (!used[k]) {\\n latin[n - 1][j] = k;\\n break;\\n }\\n }\\n }\\n\\n PrintSquare(latin);\\n }\\n\\n static void Main() {\\n LatinSquare(5);\\n LatinSquare(5);\\n LatinSquare(10); // for good measure\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"import std.array;\\nimport std.random;\\nimport std.stdio;\\n\\nalias Matrix = int[][];\\n\\nvoid latinSquare(int n) {\\n if (n <= 0) {\\n writeln(\\\"[]\\\");\\n return;\\n }\\n\\n Matrix latin = uninitializedArray!Matrix(n, n);\\n foreach (row; latin) {\\n for (int i = 0; i < n; i++) {\\n row[i] = i;\\n }\\n }\\n // first row\\n latin[0].randomShuffle;\\n\\n // middle row(s)\\n for (int i = 1; i < n - 1; i++) {\\n bool shuffled = false;\\n\\n shuffling:\\n while (!shuffled) {\\n latin[i].randomShuffle;\\n for (int k = 0; k < i; k++) {\\n for (int j = 0; j < n; j++) {\\n if (latin[k][j] == latin[i][j]) {\\n continue shuffling;\\n }\\n }\\n }\\n shuffled = true;\\n }\\n }\\n\\n // last row\\n for (int j = 0; j < n; j++) {\\n bool[] used = uninitializedArray!(bool[])(n);\\n used[] = false;\\n\\n for (int i = 0; i < n - 1; i++) {\\n used[latin[i][j]] = true;\\n }\\n for (int k = 0; k < n; k++) {\\n if (!used[k]) {\\n latin[n - 1][j] = k;\\n break;\\n }\\n }\\n }\\n\\n printSquare(latin);\\n}\\n\\nvoid printSquare(Matrix latin) {\\n foreach (row; latin) {\\n writeln(row);\\n }\\n}\\n\\nvoid main() {\\n latinSquare(5);\\n writeln;\\n\\n latinSquare(5);\\n writeln;\\n\\n latinSquare(10);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"proc shuffle . a[] .\\n for i = len a[] downto 2\\n r = randint i\\n swap a[r] a[i]\\n .\\n.\\nproc prsquare . lat[][] .\\n n = len lat[][]\\n for i to n\\n for j to n\\n write lat[i][j] & \\\" \\\"\\n .\\n print \\\"\\\"\\n .\\n print \\\"\\\"\\n.\\nproc square n . .\\n for i to n\\n lat[][] &= [ ]\\n for j to n\\n lat[i][] &= j\\n .\\n .\\n shuffle lat[1][]\\n for i = 2 to n - 1\\n repeat\\n shuffle lat[i][]\\n for k to i - 1\\n for j to n\\n if lat[k][j] = lat[i][j]\\n break 2\\n .\\n .\\n .\\n until k = i\\n .\\n .\\n len used0[] n\\n for j to n\\n used[] = used0[]\\n for i to n - 1\\n used[lat[i][j]] = 1\\n .\\n for k to n\\n if used[k] = 0\\n lat[n][j] = k\\n break 1\\n .\\n .\\n .\\n prsquare lat[][]\\n.\\nsquare 5\\nsquare 5\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"// Generate 2 Random Latin Squares of order 5. Nigel Galloway: July 136th., 2019\\nlet N=let N=System.Random() in (fun n->N.Next(n))\\nlet rc()=let β=lN2p [|0;N 4;N 3;N 2|] [|0..4|] in Seq.item (N 56) (normLS 5) |> List.map(lN2p [|N 5;N 4;N 3;N 2|]) |> List.permute(fun n->β.[n]) |> List.iter(printfn \\\"%A\\\")\\nrc(); printfn \\\"\\\"; rc()\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: arrays combinators.extras fry io kernel math.matrices\\nprettyprint random sequences sets ;\\nIN: rosetta-code.random-latin-squares\\n\\n: rand-permutation ( n -- seq ) <iota> >array randomize ;\\n: ls? ( n -- ? ) [ all-unique? ] column-map t [ and ] reduce ;\\n: (ls) ( n -- m ) dup '[ _ rand-permutation ] replicate ;\\n: ls ( n -- m ) dup (ls) dup ls? [ nip ] [ drop ls ] if ;\\n: random-latin-squares ( -- ) [ 5 ls simple-table. nl ] twice ;\\n\\nMAIN: random-latin-squares\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Randomize Timer\\n\\nSub printSquare(latin() As Integer, n As Integer)\\n For i As Integer = 0 To n - 1\\n Print \\\"[\\\";\\n For j As Integer = 0 To n - 1\\n Print latin(i, j); \\\",\\\";\\n Next j\\n Print Chr(8); \\\" ]\\\"\\n Next i\\n Print\\nEnd Sub\\n\\nSub latinSquare(n As Integer)\\n Dim As Integer i, j, k\\n\\n If n <= 0 Then\\n Print \\\"[]\\\"\\n Exit Sub\\n End If\\n Dim latin(n - 1, n - 1) As Integer\\n For i = 0 To n - 1\\n For j = 0 To n - 1\\n latin(i, j) = j\\n Next j\\n Next i\\n\\n ' first row\\n For i = 0 To n - 1\\n Dim j As Integer = Int(Rnd * n)\\n Swap latin(0, i), latin(0, j)\\n Next i\\n\\n ' middle row(s)\\n For i = 1 To n - 2\\n Dim shuffled As Integer = 0\\n While shuffled = 0\\n For j = 0 To n - 1\\n Dim k As Integer = Int(Rnd * n)\\n Swap latin(i, j), latin(i, k)\\n Next j\\n shuffled = 1\\n For k As Integer = 0 To i - 1\\n For j = 0 To n - 1\\n If latin(k, j) = latin(i, j) Then\\n shuffled = 0\\n Exit For\\n End If\\n Next j\\n If shuffled = 0 Then Exit For\\n Next k\\n Wend\\n Next i\\n\\n ' last row\\n For j = 0 To n - 1\\n Dim used(n - 1) As Integer\\n For i = 0 To n - 2\\n used(latin(i, j)) = 1\\n Next i\\n For k = 0 To n - 1\\n If used(k) = 0 Then\\n latin(n - 1, j) = k\\n Exit For\\n End If\\n Next k\\n Next j\\n printSquare(latin(), n)\\nEnd Sub\\n\\nlatinSquare(5)\\nlatinSquare(5)\\nlatinSquare(10) ' for good measure\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/rand\\\"\\n \\\"time\\\"\\n)\\n\\ntype matrix [][]int\\n\\nfunc shuffle(row []int, n int) {\\n rand.Shuffle(n, func(i, j int) {\\n row[i], row[j] = row[j], row[i]\\n })\\n}\\n\\nfunc latinSquare(n int) {\\n if n <= 0 {\\n fmt.Println(\\\"[]\\\\n\\\")\\n return\\n }\\n latin := make(matrix, n)\\n for i := 0; i < n; i++ {\\n latin[i] = make([]int, n)\\n if i == n-1 {\\n break\\n }\\n for j := 0; j < n; j++ {\\n latin[i][j] = j\\n }\\n }\\n // first row\\n shuffle(latin[0], n)\\n\\n // middle row(s)\\n for i := 1; i < n-1; i++ {\\n shuffled := false\\n shuffling:\\n for !shuffled {\\n shuffle(latin[i], n)\\n for k := 0; k < i; k++ {\\n for j := 0; j < n; j++ {\\n if latin[k][j] == latin[i][j] {\\n continue shuffling\\n }\\n }\\n }\\n shuffled = true\\n }\\n }\\n\\n // last row\\n for j := 0; j < n; j++ {\\n used := make([]bool, n)\\n for i := 0; i < n-1; i++ {\\n used[latin[i][j]] = true\\n }\\n for k := 0; k < n; k++ {\\n if !used[k] {\\n latin[n-1][j] = k\\n break\\n }\\n }\\n }\\n printSquare(latin, n)\\n}\\n\\nfunc printSquare(latin matrix, n int) {\\n for i := 0; i < n; i++ {\\n fmt.Println(latin[i])\\n }\\n fmt.Println()\\n}\\n\\nfunc main() {\\n rand.Seed(time.Now().UnixNano())\\n latinSquare(5)\\n latinSquare(5)\\n latinSquare(10) // for good measure\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/rand\\\"\\n \\\"sort\\\"\\n \\\"time\\\"\\n)\\n\\ntype matrix [][]int\\n\\n// generate derangements of first n numbers, with 'start' in first place.\\nfunc dList(n, start int) (r matrix) {\\n start-- // use 0 basing\\n a := make([]int, n)\\n for i := range a {\\n a[i] = i\\n }\\n a[0], a[start] = start, a[0]\\n sort.Ints(a[1:])\\n first := a[1]\\n // recursive closure permutes a[1:]\\n var recurse func(last int)\\n recurse = func(last int) {\\n if last == first {\\n // bottom of recursion. you get here once for each permutation.\\n // test if permutation is deranged.\\n for j, v := range a[1:] { // j starts from 0, not 1\\n if j+1 == v {\\n return // no, ignore it\\n }\\n }\\n // yes, save a copy\\n b := make([]int, n)\\n copy(b, a)\\n for i := range b {\\n b[i]++ // change back to 1 basing\\n }\\n r = append(r, b)\\n return\\n }\\n for i := last; i >= 1; i-- {\\n a[i], a[last] = a[last], a[i]\\n recurse(last - 1)\\n a[i], a[last] = a[last], a[i]\\n }\\n }\\n recurse(n - 1)\\n return\\n}\\n\\nfunc reducedLatinSquares(n int) []matrix {\\n var rls []matrix\\n if n < 0 {\\n n = 0\\n }\\n rlatin := make(matrix, n)\\n for i := 0; i < n; i++ {\\n rlatin[i] = make([]int, n)\\n }\\n if n <= 1 {\\n return append(rls, rlatin)\\n }\\n // first row\\n for j := 0; j < n; j++ {\\n rlatin[0][j] = j + 1\\n }\\n // recursive closure to compute reduced latin squares\\n var recurse func(i int)\\n recurse = func(i int) {\\n rows := dList(n, i) // get derangements of first n numbers, with 'i' first.\\n outer:\\n for r := 0; r < len(rows); r++ {\\n copy(rlatin[i-1], rows[r])\\n for k := 0; k < i-1; k++ {\\n for j := 1; j < n; j++ {\\n if rlatin[k][j] == rlatin[i-1][j] {\\n if r < len(rows)-1 {\\n continue outer\\n } else if i > 2 {\\n return\\n }\\n }\\n }\\n }\\n if i < n {\\n recurse(i + 1)\\n } else {\\n rl := copyMatrix(rlatin)\\n rls = append(rls, rl)\\n }\\n }\\n return\\n }\\n\\n // remaining rows\\n recurse(2)\\n return rls\\n}\\n\\nfunc copyMatrix(m matrix) matrix {\\n le := len(m)\\n cpy := make(matrix, le)\\n for i := 0; i < le; i++ {\\n cpy[i] = make([]int, le)\\n copy(cpy[i], m[i])\\n }\\n return cpy\\n}\\n\\nfunc printSquare(latin matrix, n int) {\\n for i := 0; i < n; i++ {\\n for j := 0; j < n; j++ {\\n fmt.Printf(\\\"%d \\\", latin[i][j]-1)\\n }\\n fmt.Println()\\n }\\n fmt.Println()\\n}\\n\\nfunc factorial(n uint64) uint64 {\\n if n == 0 {\\n return 1\\n }\\n prod := uint64(1)\\n for i := uint64(2); i <= n; i++ {\\n prod *= i\\n }\\n return prod\\n}\\n\\n// generate permutations of first n numbers, starting from 0.\\nfunc pList(n int) matrix {\\n fact := factorial(uint64(n))\\n perms := make(matrix, fact)\\n a := make([]int, n)\\n for i := 0; i < n; i++ {\\n a[i] = i\\n }\\n t := make([]int, n)\\n copy(t, a)\\n perms[0] = t\\n n--\\n var i, j int\\n for c := uint64(1); c < fact; c++ {\\n i = n - 1\\n j = n\\n for a[i] > a[i+1] {\\n i--\\n }\\n for a[j] < a[i] {\\n j--\\n }\\n a[i], a[j] = a[j], a[i]\\n j = n\\n i++\\n for i < j {\\n a[i], a[j] = a[j], a[i]\\n i++\\n j--\\n }\\n t := make([]int, n+1)\\n copy(t, a)\\n perms[c] = t\\n }\\n return perms\\n}\\n\\nfunc generateLatinSquares(n, tests, echo int) {\\n rls := reducedLatinSquares(n)\\n perms := pList(n)\\n perms2 := pList(n - 1)\\n for test := 0; test < tests; test++ {\\n rn := rand.Intn(len(rls))\\n rl := rls[rn] // select reduced random square at random\\n rn = rand.Intn(len(perms))\\n rp := perms[rn] // select a random permuation of 'rl's columns\\n // permute columns\\n t := make(matrix, n)\\n for i := 0; i < n; i++ {\\n t[i] = make([]int, n)\\n }\\n for i := 0; i < n; i++ {\\n for j := 0; j < n; j++ {\\n t[i][j] = rl[i][rp[j]]\\n }\\n }\\n rn = rand.Intn(len(perms2))\\n rp = perms2[rn] // select a random permutation of 't's rows 2 to n\\n // permute rows 2 to n\\n u := make(matrix, n)\\n for i := 0; i < n; i++ {\\n u[i] = make([]int, n)\\n }\\n for i := 0; i < n; i++ {\\n for j := 0; j < n; j++ {\\n if i == 0 {\\n u[i][j] = t[i][j]\\n } else {\\n u[i][j] = t[rp[i-1]+1][j]\\n }\\n }\\n }\\n if test < echo {\\n printSquare(u, n)\\n }\\n if n == 4 {\\n for i := 0; i < 4; i++ {\\n for j := 0; j < 4; j++ {\\n u[i][j]--\\n }\\n }\\n for i := 0; i < 4; i++ {\\n copy(a[4*i:], u[i])\\n }\\n for i := 0; i < 4; i++ {\\n if testSquares[i] == a {\\n counts[i]++\\n break\\n }\\n }\\n }\\n }\\n}\\n\\nvar testSquares = [4][16]int{\\n {0, 1, 2, 3, 1, 0, 3, 2, 2, 3, 0, 1, 3, 2, 1, 0},\\n {0, 1, 2, 3, 1, 0, 3, 2, 2, 3, 1, 0, 3, 2, 0, 1},\\n {0, 1, 2, 3, 1, 2, 3, 0, 2, 3, 0, 1, 3, 0, 1, 2},\\n {0, 1, 2, 3, 1, 3, 0, 2, 2, 0, 3, 1, 3, 2, 1, 0},\\n}\\n\\nvar (\\n counts [4]int\\n a [16]int\\n)\\n\\nfunc main() {\\n rand.Seed(time.Now().UnixNano())\\n fmt.Println(\\\"Two randomly generated latin squares of order 5 are:\\\\n\\\")\\n generateLatinSquares(5, 2, 2)\\n\\n fmt.Println(\\\"Out of 1,000,000 randomly generated latin squares of order 4, \\\")\\n fmt.Println(\\\"of which there are 576 instances ( => expected 1736 per instance),\\\")\\n fmt.Println(\\\"the following squares occurred the number of times shown:\\\\n\\\")\\n generateLatinSquares(4, 1e6, 0)\\n for i := 0; i < 4; i++ {\\n fmt.Println(testSquares[i][:], \\\":\\\", counts[i])\\n }\\n\\n fmt.Println(\\\"\\\\nA randomly generated latin square of order 6 is:\\\\n\\\")\\n generateLatinSquares(6, 1, 1)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List (permutations, (\\\\\\\\))\\n\\nlatinSquare :: Eq a => [a] -> [a] -> [[a]]\\nlatinSquare [] [] = []\\nlatinSquare c r\\n | head r /= head c = []\\n | otherwise = reverse <$> foldl addRow firstRow perms\\n where\\n -- permutations grouped by the first element\\n perms =\\n tail $\\n fmap\\n (fmap . (:) <*> (permutations . (r \\\\\\\\) . return))\\n c\\n firstRow = pure <$> r\\n addRow tbl rows =\\n head\\n [ zipWith (:) row tbl\\n | row <- rows,\\n and $ different (tail row) (tail tbl)\\n ]\\n different = zipWith $ (not .) . elem\\n\\nprintTable :: Show a => [[a]] -> IO ()\\nprintTable tbl =\\n putStrLn $\\n unlines $\\n unwords . map show <$> tbl\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"randomLatinSquare :: Eq a => [a] -> Random [[a]]\\nrandomLatinSquare set = do\\n r <- randomPermutation set\\n c <- randomPermutation (tail r)\\n return $ latinSquare r (head r:c)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Control.Monad.State\\n\\ntype Random a = State Int a\\n\\nrandom :: Integral a => a -> Random a\\nrandom k = rescale <$> modify iter\\n where\\n iter x = (x * a + c) `mod` m\\n (a, c, m) = (1103515245, 12345, 2^31-1)\\n rescale x = fromIntegral x `mod` k\\n\\nrandomPermutation :: Eq a => [a] -> Random [a]\\nrandomPermutation = go\\n where\\n go [] = pure []\\n go lst = do\\n x <- randomSample lst\\n (x :) <$> go (lst \\\\\\\\ [x])\\n\\nrandomSample :: [a] -> Random a\\nrandomSample lst = (lst !!) <$> random (length lst)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"rls=: 3 : 0\\n s=. ?~ y NB. \\\"deal\\\" y unique integers from 0 to y\\n for_ijk. i.<:y do.\\n NB. deal a new row. subtract it from all previous rows\\n NB. if you get a 0, some column has a matching integer, deal again\\n whilst. 0 = */ */ s -\\\"1 r do.\\n r=. ?~ y\\n end.\\n s=. s ,,: r NB. \\\"laminate\\\" successful row to the square\\n end.\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.Collections;\\nimport java.util.Iterator;\\nimport java.util.List;\\nimport java.util.Objects;\\n\\npublic class RandomLatinSquares {\\n private static void printSquare(List<List<Integer>> latin) {\\n for (List<Integer> row : latin) {\\n Iterator<Integer> it = row.iterator();\\n\\n System.out.print(\\\"[\\\");\\n if (it.hasNext()) {\\n Integer col = it.next();\\n System.out.print(col);\\n }\\n while (it.hasNext()) {\\n Integer col = it.next();\\n System.out.print(\\\", \\\");\\n System.out.print(col);\\n }\\n System.out.println(\\\"]\\\");\\n }\\n System.out.println();\\n }\\n\\n private static void latinSquare(int n) {\\n if (n <= 0) {\\n System.out.println(\\\"[]\\\");\\n return;\\n }\\n\\n List<List<Integer>> latin = new ArrayList<>(n);\\n for (int i = 0; i < n; ++i) {\\n List<Integer> inner = new ArrayList<>(n);\\n for (int j = 0; j < n; ++j) {\\n inner.add(j);\\n }\\n latin.add(inner);\\n }\\n // first row\\n Collections.shuffle(latin.get(0));\\n\\n // middle row(s)\\n for (int i = 1; i < n - 1; ++i) {\\n boolean shuffled = false;\\n shuffling:\\n while (!shuffled) {\\n Collections.shuffle(latin.get(i));\\n for (int k = 0; k < i; ++k) {\\n for (int j = 0; j < n; ++j) {\\n if (Objects.equals(latin.get(k).get(j), latin.get(i).get(j))) {\\n continue shuffling;\\n }\\n }\\n }\\n shuffled = true;\\n }\\n }\\n\\n // last row\\n for (int j = 0; j < n; ++j) {\\n List<Boolean> used = new ArrayList<>(n);\\n for (int i = 0; i < n; ++i) {\\n used.add(false);\\n }\\n for (int i = 0; i < n - 1; ++i) {\\n used.set(latin.get(i).get(j), true);\\n }\\n for (int k = 0; k < n; ++k) {\\n if (!used.get(k)) {\\n latin.get(n - 1).set(j, k);\\n break;\\n }\\n }\\n }\\n\\n printSquare(latin);\\n }\\n\\n public static void main(String[] args) {\\n latinSquare(5);\\n latinSquare(5);\\n latinSquare(10);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"class Latin {\\n constructor(size = 3) {\\n this.size = size;\\n this.mst = [...Array(this.size)].map((v, i) => i + 1);\\n this.square = Array(this.size).fill(0).map(() => Array(this.size).fill(0));\\n\\n if (this.create(0, 0)) {\\n console.table(this.square);\\n }\\n }\\n\\n create(c, r) {\\n const d = [...this.mst];\\n let s;\\n while (true) {\\n do {\\n s = d.splice(Math.floor(Math.random() * d.length), 1)[0];\\n if (!s) return false;\\n } while (this.check(s, c, r));\\n\\n this.square[c][r] = s;\\n if (++c >= this.size) {\\n c = 0;\\n if (++r >= this.size) {\\n return true;\\n }\\n }\\n if (this.create(c, r)) return true;\\n if (--c < 0) {\\n c = this.size - 1;\\n if (--r < 0) {\\n return false;\\n }\\n }\\n }\\n }\\n\\n check(d, c, r) {\\n for (let a = 0; a < this.size; a++) {\\n if (c - a > -1) {\\n if (this.square[c - a][r] === d)\\n return true;\\n }\\n if (r - a > -1) {\\n if (this.square[c][r - a] === d)\\n return true;\\n }\\n }\\n return false;\\n }\\n}\\nnew Latin(5);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"#!/bin/bash\\n< /dev/random tr -cd '0-9' | fold -w 1 | jq -Mcnr -f random-latin-squares.jq\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"'''Generic Utility Functions'''\\n# For inclusion using jq's `include` directive:\\n# Output: a PRN in range(0;$n) where $n is .\\ndef prn:\\n if . == 1 then 0\\n else . as $n\\n | (($n-1)|tostring|length) as $w\\n | [limit($w; inputs)] | join(\\\"\\\") | tonumber\\n | if . < $n then . else ($n | prn) end\\n end;\\n\\ndef knuthShuffle:\\n length as $n\\n | if $n <= 1 then .\\n else {i: $n, a: .}\\n | until(.i == 0;\\n .i += -1\\n | (.i + 1 | prn) as $j\\n | .a[.i] as $t\\n | .a[.i] = .a[$j]\\n | .a[$j] = $t)\\n | .a\\n end;\\n\\ndef lpad($len): tostring | ($len - length) as $l | (\\\" \\\" * $l)[:$l] + .;\\n\\n# If the input array is not rectangular, let nulls fall where they may\\ndef column($j):\\n [.[] | .[$j]];\\n\\n# Emit a stream of [value, frequency] pairs\\ndef histogram(stream):\\n reduce stream as $s ({};\\n ($s|type) as $t\\n | (if $t == \\\"string\\\" then $s else ($s|tojson) end) as $y\\n | .[$t][$y][0] = $s\\n | .[$t][$y][1] += 1 )\\n | .[][] ;\\n\\ndef ss(s): reduce s as $x (0; . + ($x * $x));\\n\\ndef chiSquared($expected): ss( .[] - $expected ) / $expected;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Include the utilities e.g. by\\n# include \\\"random-latin-squares.utilities\\\" {search: \\\".\\\"};\\n\\n# Determine orthogonality of two arrays, confining attention\\n# to the first $n elements in each:\\ndef orthogonal($a; $b; $n):\\n first( (range(0; $n) | if $a[.] == $b[.] then 0 else empty end) // 1) | . == 1;\\n\\n# Are the two arrays orthogonal up to the length of the shorter?\\ndef orthogonal($a; $b):\\n ([$a, $b | length] | min) as $min\\n | orthogonal($a; $b; $min);\\n\\n# Is row $i orthogonal to all the previous rows?\\ndef orthogonal($i):\\n . as $in\\n | .[$i] as $row\\n | all(range(0;$i); orthogonal($row; $in[.]));\\n\\n# verify columnwise orthogonality\\ndef columnwise:\\n length as $n\\n | transpose as $t\\n | all( range(1;$n); . as $i | $t | orthogonal($i)) ;\\n\\ndef addLast:\\n (.[0] | length) as $n\\n | [range(0; $n)] as $range\\n | [range(0; $n) as $i\\n | ($range - column($i))[0] ] as $last\\n | . + [$last] ;\\n\\n# input: an array being a permutation of [range(0;$n)] for some $n\\n# output: a Latin Square selected at random from all the candidates\\ndef extend:\\n (.[0] | length) as $n\\n | if length >= $n then .\\n elif length == $n - 1 then addLast\\n else ([range(0; $n)] | knuthShuffle) as $row\\n | (. + [$row] )\\n | if orthogonal(length - 1) and columnwise then extend else empty end\\n end ;\\n\\n# Generate a Latin Square.\\n# The input should be an integer specifying its size.\\ndef latinSquare:\\n . as $n\\n | if $n <= 0 then []\\n else\\n [ [range(0; $n)] | knuthShuffle]\\n | first(repeat(extend))\\n # | (if columnwise then . else debug end) # internal check\\n end ;\\n\\n# If the input is a positive integer, $n, generate and print an $n x $n Latin Square.\\n# If it is not number, echo it.\\ndef printLatinSquare:\\n if type == \\\"number\\\"\\n then latinSquare\\n | .[] | map(lpad(3)) | join(\\\" \\\")\\n else .\\n end;\\n\\n# $order should be in 1 .. 5 inclusive\\n# If $n is null, then use 10 * $counts[$order]\\ndef stats($order; $n):\\n # table of counts:\\n [0,1,2,12,576,161280] as $counts\\n | $counts[$order] as $possibilities\\n | (if $n then $n else 10 * $possibilities end) as $n\\n | reduce range(0;$n) as $i ({};\\n ($order|latinSquare|flatten|join(\\\"\\\")) as $row\\n | .[$row] += 1)\\n | # ([histogram(.[])] | sort[] | join(\\\" \\\")),\\n \\\"Number of LS(\\\\($order)): \\\\($n)\\\",\\n (if length == $possibilities\\n then \\\"All \\\\($possibilities) possibilities have been generated.\\\"\\n else \\\"Of \\\\($possibilities) possibilities, only \\\\(length) were generated.\\\"\\n end),\\n \\\"Chi-squared statistic (df=\\\\($possibilities-1)): \\\\( [.[]] | chiSquared( $n / $possibilities))\\\";\\n\\n\\nstats(3;null), \\\"\\\",\\nstats(4;5760), \\\"\\\"\\nstats(4;5760)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Include the utilities e.g. by\\n# include \\\"random-latin-squares.utilities\\\" {search: \\\".\\\"};\\n\\n# Select an element at random from [range(0;$n)] - column($j)\\ndef candidate($j):\\n (.[0] | length) as $n\\n | [range(0;$n)] - column($j)\\n | .[length|prn];\\n\\n# Input: the first row or rows of a Latin Square\\ndef extend:\\n # The input to ext should be several rows of a Latin Square\\n # optionally followed by a candidate for an additional row.\\n def ext:\\n .[0] as $first\\n | length as $length\\n | ($first|length) as $n\\n | .[-1] as $last\\n | if ($last|length) < $n # then extend the last row\\n then ( ([range(0;$n)] - column($last|length)) - $last) as $candidates\\n | .[:$length-1] as $good\\n | ($candidates|length) as $cl\\n\\n # if we can complete the row, then there is no need for another backtrack point!\\n | if $cl == 1 and ($last|length) == $n - 1\\n then ($good + [ $last + $candidates]) | ext # n.b. or use `extend` to speed things up at the cost of more bias\\n else\\n if $cl == 1 then ($good + [ $last + $candidates]) | ext\\n elif $cl == 0\\n then empty\\n else ($candidates[$cl | prn] as $add\\n | ($good + [$last + [$add]]) | ext)\\n end\\n end\\n elif length < $n then ((. + [[candidate(0)]]) | ext)\\n else .\\n end;\\n # If at first you do not succeed ...\\n first( repeat( ext ));\\n\\n# Generate a Latin Square.\\n# The input should be an integer specifying its size.\\ndef latinSquare:\\n . as $n\\n | if $n <= 0 then []\\n else\\n [ [range(0; $n)] | knuthShuffle]\\n | extend\\n end ;\\n\\n# If the input is a positive integer, $n, generate and print an $n x $n Latin Square.\\n# Otherwise, simply echo it.\\ndef printLatinSquare:\\n if type == \\\"number\\\"\\n then latinSquare\\n | .[] | map(lpad(3)) | join(\\\" \\\")\\n else .\\n end;\\n\\n\\\"Five\\\", 5, \\\"\\\\nFive\\\", 5, \\\"\\\\nTen\\\", 10, \\\"\\\\nForty\\\", 40\\n| printLatinSquare\\n'\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Random\\n\\nshufflerows(mat) = mat[shuffle(1:end), :]\\nshufflecols(mat) = mat[:, shuffle(1:end)]\\n\\nfunction addatdiagonal(mat)\\n n = size(mat)[1] + 1\\n newmat = similar(mat, size(mat) .+ 1)\\n for j in 1:n, i in 1:n\\n newmat[i, j] = (i == n && j < n) ? mat[1, j] : (i == j) ? n - 1 :\\n (i < j) ? mat[i, j - 1] : mat[i, j]\\n end\\n newmat\\nend\\n\\nfunction makelatinsquare(N)\\n mat = [0 1; 1 0]\\n for i in 3:N\\n mat = addatdiagonal(mat)\\n end\\n shufflecols(shufflerows(mat))\\nend\\n\\nfunction printlatinsquare(N)\\n mat = makelatinsquare(N)\\n for i in 1:N, j in 1:N\\n print(rpad(mat[i, j], 3), j == N ? \\\"\\\\n\\\" : \\\"\\\")\\n end\\nend\\n\\nprintlatinsquare(5), println(\\\"\\\\n\\\"), printlatinsquare(5)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"typealias matrix = MutableList<MutableList<Int>>\\n\\nfun printSquare(latin: matrix) {\\n for (row in latin) {\\n println(row)\\n }\\n println()\\n}\\n\\nfun latinSquare(n: Int) {\\n if (n <= 0) {\\n println(\\\"[]\\\")\\n return\\n }\\n\\n val latin = MutableList(n) { MutableList(n) { it } }\\n // first row\\n latin[0].shuffle()\\n\\n // middle row(s)\\n for (i in 1 until n - 1) {\\n var shuffled = false\\n shuffling@\\n while (!shuffled) {\\n latin[i].shuffle()\\n for (k in 0 until i) {\\n for (j in 0 until n) {\\n if (latin[k][j] == latin[i][j]) {\\n continue@shuffling\\n }\\n }\\n }\\n shuffled = true\\n }\\n }\\n\\n // last row\\n for (j in 0 until n) {\\n val used = MutableList(n) { false }\\n for (i in 0 until n - 1) {\\n used[latin[i][j]] = true\\n }\\n for (k in 0 until n) {\\n if (!used[k]) {\\n latin[n - 1][j] = k\\n break\\n }\\n }\\n }\\n\\n printSquare(latin)\\n}\\n\\nfun main() {\\n latinSquare(5)\\n latinSquare(5)\\n latinSquare(10) // for good measure\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"Module FastLatinSquare {\\n\\tn=5\\n\\tFor k=1 To 2\\n\\t\\tlatin()\\n\\tNext\\n\\tn=40\\n\\tlatin()\\n\\tSub latin()\\n\\t\\tLocal i,a, a(1 To n), b, k\\n\\t\\tProfiler\\n\\t\\tflush\\n\\t\\tPrint \\\"latin square \\\";n;\\\" by \\\";n\\n\\t\\tFor i=1 To n\\n\\t\\t\\tPush i\\n\\t\\tNext i\\n\\t\\tFor i=1 To n div 2\\n\\t\\t\\tShiftback random(2, n)\\n\\t\\tNext i\\n\\t\\ta=[]\\n\\t\\tPush ! stack(a)\\n\\t\\ta=array(a) ' change a from stack to array\\n\\t\\tFor i=1 To n*10\\n\\t\\t\\tShiftback random(2, n)\\n\\t\\tNext i\\n\\t\\tFor i=0 To n-1\\n\\t\\t\\tData number ' rotate by one the stack items\\n\\t\\t\\tb=[] ' move stack To b, leave empty stack\\n\\t\\t\\ta(a#val(i))=b\\n\\t\\t\\tPush ! stack(b) ' Push from a copy of b all items To stack\\n\\t\\tNext i\\n\\t\\tflush\\n\\t\\tFor k=1 To n div 2\\n\\t\\t\\tz=random(2, n)\\n\\t\\t\\tFor i=1 To n\\n\\t\\t\\t\\ta=a(i)\\n\\t\\t\\t\\tstack a {\\n\\t\\t\\t\\t\\tshift z\\n\\t\\t\\t\\t}\\n\\t\\t\\tNext\\n\\t\\tNext\\n\\t\\tFor i=1 To n\\n\\t\\t\\ta=a(i)\\n\\t\\t\\ta(i)=array(a) ' change To array from stack\\n\\t\\tNext i\\n\\t\\tFor i=1 To n\\n\\t\\t\\tPrint a(i)\\n\\t\\tNext i\\n\\t\\tPrint TimeCount\\n\\tEnd Sub\\n}\\nFastLatinSquare\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Module LatinSquare (n, z=1, f$=\\\"latin.dat\\\", NewFile As Boolean=False) {\\n\\tIf Not Exist(f$) Or NewFile Then\\n\\t\\tOpen f$ For Wide Output As f\\n\\tElse\\n\\t\\tOpen f$ For Wide Append As f\\n\\tEnd If\\n\\tArrayToString=Lambda -> {\\n\\t\\tShift 2 ' swap two top values in stack\\n\\t\\tPush Letter$+Str$(Number)\\n\\t}\\n\\tDim line(1 to n)\\n\\tflush ' erase current stack of value\\n\\tz=if(z<1->1, z)\\n\\tnewColumn()\\n\\tFor j=1 To z\\n\\t\\tProfiler\\n\\t\\tResetColumns()\\n\\t\\tFor i=1 To n\\n\\t\\t\\tplaceColumn()\\n\\t\\tNext\\n\\t\\tPrint \\\"A latin square of \\\";n;\\\" by \\\";n\\n\\t\\tFor i=1 To n\\n\\t\\t\\tPrint line(i)\\n\\t\\t\\tPrint #f, line(i)#Fold$(ArrayToString)\\n\\t\\tNext\\n\\t\\tPrint TimeCount\\n\\t\\tRefresh\\n\\tNext\\n\\tclose #f\\n\\tFlush ' empty stack again\\n\\tEnd\\n\\tSub ResetColumns()\\n\\t\\tLocal i\\n\\t\\tFor i=1 To n:line(i)=(,):Next\\n\\tEnd Sub\\n\\tSub newColumn()\\n\\t\\tLocal i\\n\\t\\tFor i=1 To n : Push i: Next\\n\\tEnd Sub\\n\\tSub shuffle()\\n\\t\\tLocal i\\n\\t\\tFor i=1 To n div 2: Shift Random(2, n): Next\\n\\tEnd Sub\\n\\tSub shuffleLocal(x)\\n\\t\\tIf Stack.size<=x Then Exit Sub\\n\\t\\tShift Random(x+1, Stack.size)\\n\\t\\tShiftback x\\n\\tEnd Sub\\n\\tSub PlaceColumn()\\n\\t\\tLocal i, a, b, k\\n\\t\\tshuffle()\\n\\t\\tDo\\n\\t\\t\\tdata number ' rotate one position\\n\\t\\t\\tk=0\\n\\t\\t\\tFor i=1 To n\\n\\t\\t\\t\\ta=line(i) ' get the pointer\\n\\t\\t\\t\\tDo\\n\\t\\t\\t\\tIf a#Pos(Stackitem(i))=-1 Then k=0 :Exit Do\\n\\t\\t\\t\\tshuffleLocal(i)\\n\\t\\t\\t\\tk++\\n\\t\\t\\t\\tUntil k>Stack.size-i\\n\\t\\t\\t\\tIf k>0 Then Exit For\\n\\t\\t\\tNext\\n\\t\\tUntil k=0\\n\\t\\tFor i=1 To n\\n\\t\\t\\ta=line(i)\\n\\t\\t\\tAppend a, (Stackitem(i),)\\n\\t\\tNext\\n\\tEnd Sub\\n}\\nForm 100,50\\nLatinSquare 5, 2, True\\nLatinSquare 16\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Clear[RandomLatinSquare]\\nRandomLatinSquare[n_] := Module[{out, ord},\\n out = Table[RotateLeft[Range[n], i], {i, n}];\\n out = RandomSample[out];\\n ord = RandomSample[Range[n]];\\n out = out[[All, ord]];\\n out\\n ]\\nRandomLatinSquare[5] // Grid\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import random, sequtils, strutils\\n\\ntype LatinSquare = seq[seq[char]]\\n\\nproc get[T](s: set[T]): T =\\n ## Return the first element of a set.\\n for n in s:\\n return n\\n\\nproc letterAt(n: Natural): char {.inline.} = chr(ord('A') - 1 + n)\\n\\n\\nproc latinSquare(n: Positive): LatinSquare =\\n result = newSeqWith(n, toSeq(letterAt(1)..letterAt(n)))\\n result[0].shuffle()\\n\\n for row in 1..(n - 2):\\n var ok = false\\n while not ok:\\n block shuffling:\\n result[row].shuffle()\\n for prev in 0..<row:\\n for col in 0..<n:\\n if result[row][col] == result[prev][col]:\\n break shuffling\\n ok = true\\n\\n for col in 0..<n:\\n var s = {letterAt(1)..letterAt(n)}\\n for row in 0..(n - 2):\\n s.excl result[row][col]\\n result[^1][col] = s.get()\\n\\n\\nproc `$`(s: LatinSquare): string =\\n let n = s.len\\n for row in 0..<n:\\n result.add s[row].join(\\\" \\\") & '\\\\n'\\n\\n\\nrandomize()\\necho latinSquare(5)\\necho latinSquare(5)\\necho latinSquare(10)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"{$APPTYPE CONSOLE}\\n\\nconst\\n Alpha = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ';\\n\\n\\nType\\nIncidenceCube = Array of Array Of Array of Integer;\\n\\nVar\\nCube : IncidenceCube;\\nDIM : Integer;\\n\\n\\nProcedure InitIncidenceCube(Var c:IncidenceCube; const Size:Integer);\\nvar i, j, k : integer;\\nbegin\\nDIM := Size;\\nSetLength(c,DIM,DIM,DIM);\\nfor i := 0 to DIM-1 do\\nfor j := 0 to DIM-1 do\\nfor k := 0 to DIM-1 do c[i,j,k] := 0 ;\\n\\nfor i := 0 to DIM-1 do\\nfor j := 0 to DIM-1 do c[i,j,(i+j) mod DIM] := 1;\\nend;\\n\\n\\nProcedure FreeIncidenceCube(Var c:IncidenceCube);\\nbegin\\nFinalize(c);\\nend;\\n\\n\\nprocedure PrintIncidenceCube(var c:IncidenceCube);\\nvar i, j, k : integer;\\nbegin\\n for i := 0 to DIM-1 do begin\\n for j := 0 to DIM-1 do begin\\n for k := 0 to DIM-1 do begin\\n if (c[i,j,k]=1) then begin\\n write(Alpha[k+1],' ');\\n break;\\n end;\\n end;\\n end;\\n Writeln;\\n end;\\n Writeln;\\n\\tWriteLn;\\nend;\\n\\n\\nprocedure ShuffleIncidenceCube(var c:IncidenceCube);\\nvar i, j, rx, ry, rz, ox, oy, oz : integer;\\nbegin\\n\\n for i := 0 to (DIM*DIM*DIM)-1 do begin\\n\\n repeat\\n rx := Random(DIM);\\n ry := Random(DIM);\\n rz := Random(DIM);\\n until (c[rx,ry,rz]=0);\\n\\n for j := 0 to DIM-1 do begin\\n if (c[j,ry,rz]=1) then ox := j;\\n if (c[rx,j,rz]=1) then oy := j;\\n if (c[rx,ry,j]=1) then oz := j;\\n end;\\n\\n Inc(c[rx,ry,rz]);\\n Inc(c[rx,oy,oz]);\\n Inc(c[ox,ry,oz]);\\n Inc(c[ox,oy,rz]);\\n\\n Dec(c[rx,ry,oz]);\\n Dec(c[rx,oy,rz]);\\n Dec(c[ox,ry,rz]);\\n Dec(c[ox,oy,oz]);\\n\\n while (c[ox,oy,oz] < 0) do begin\\n\\n rx := ox ;\\n ry := oy ;\\n rz := oz ;\\n\\n if (random(2)=0) then begin\\n for j := 0 to DIM-1 do begin\\n if (c[j,ry,rz]=1) then ox := j;\\n end;\\n end else begin\\n for j := DIM-1 downto 0 do begin\\n if (c[j,ry,rz]=1) then ox := j;\\n end;\\n end;\\n\\n if (random(2)=0) then begin\\n for j := 0 to DIM-1 do begin\\n if (c[rx,j,rz]=1) then oy := j;\\n end;\\n end else begin\\n for j := DIM-1 downto 0 do begin\\n if (c[rx,j,rz]=1) then oy := j;\\n end;\\n end;\\n\\n if (random(2)=0) then begin\\n for j := 0 to DIM-1 do begin\\n if (c[rx,ry,j]=1) then oz := j;\\n end;\\n end else begin\\n for j := DIM-1 downto 0 do begin\\n if (c[rx,ry,j]=1) then oz := j;\\n end;\\n end;\\n\\n Inc(c[rx,ry,rz]);\\n Inc(c[rx,oy,oz]);\\n Inc(c[ox,ry,oz]);\\n Inc(c[ox,oy,rz]);\\n\\n Dec(c[rx,ry,oz]);\\n Dec(c[rx,oy,rz]);\\n Dec(c[ox,ry,rz]);\\n Dec(c[ox,oy,oz]);\\n end;\\n\\n end;\\nend;\\n\\nbegin\\n Randomize;\\n InitIncidenceCube(cube, 5); ShuffleIncidenceCube(cube); PrintIncidenceCube(cube); FreeIncidenceCube(Cube);\\n InitIncidenceCube(cube, 5); ShuffleIncidenceCube(cube); PrintIncidenceCube(cube); FreeIncidenceCube(Cube);\\n InitIncidenceCube(cube,10); ShuffleIncidenceCube(cube); PrintIncidenceCube(cube); FreeIncidenceCube(Cube);\\t\\n InitIncidenceCube(cube,26); ShuffleIncidenceCube(cube); PrintIncidenceCube(cube); FreeIncidenceCube(Cube);\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\nuse List::Util 'shuffle';\\n\\nsub random_ls {\\n my($n) = @_;\\n my(@cols,@symbols,@ls_sym);\\n\\n # build n-sized latin square\\n my @ls = [0,];\\n for my $i (1..$n-1) {\\n @{$ls[$i]} = @{$ls[0]};\\n splice(@{$ls[$_]}, $_, 0, $i) for 0..$i;\\n }\\n\\n # shuffle rows and columns\\n @cols = shuffle 0..$n-1;\\n @ls = map [ @{$_}[@cols] ], @ls[shuffle 0..$n-1];\\n\\n # replace numbers with symbols\\n @symbols = shuffle( ('A'..'Z')[0..$n-1] );\\n push @ls_sym, [@symbols[@$_]] for @ls;\\n @ls_sym\\n}\\n\\nsub display {\\n my $str;\\n $str .= join(' ', @$_) . \\\"\\\\n\\\" for @_;\\n $str\\n}\\n\\nsay display random_ls($_) for 2..5, 5;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">aleph</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\"</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">ls</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">aleph</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- too big...</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">tn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- {1..n}</span>\\n <span style=\\\"color: #000000;\\\">vcs</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- valid for cols</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">clashes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)<</span><span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">rn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- next row</span>\\n <span style=\\\"color: #000000;\\\">vr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- valid for row (ie all)</span>\\n <span style=\\\"color: #000000;\\\">vc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">deep_copy</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">vcs</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- copy (in case of clash)</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">clash</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">v</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- collect all still valid options</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">vr</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">vc</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">v</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">={}</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">clash</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">z</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">))]</span>\\n <span style=\\\"color: #000000;\\\">rn</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">z</span>\\n <span style=\\\"color: #000000;\\\">vr</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- no longer valid</span>\\n <span style=\\\"color: #000000;\\\">vc</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- \\\"\\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">clash</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">vcs</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">vc</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">clashes</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()></span><span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"rows completed:%d/%d, clashes:%d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">clashes</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">line</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">line</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">aleph</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">line</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">latin_square</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">t0</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ls</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">e</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">elapsed</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()-</span><span style=\\\"color: #000000;\\\">t0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Latin square of order %d (%s):\\\\n%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n <span style=\\\"color: #000000;\\\">latin_square</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">latin_square</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">latin_square</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">latin_square</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()!=</span><span style=\\\"color: #004600;\\\">JS</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">latin_square</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">42</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"main =>\\n _ = random2(), % random seed\\n N = 5,\\n foreach(_ in 1..2)\\n latin_square(N, X),\\n pretty_print(X)\\n end,\\n % A larger random instance\\n latin_square(62,X),\\n pretty_print(X).\\n\\n% Latin square\\nlatin_square(N, X) =>\\n X = new_array(N,N),\\n X :: 1..N,\\n foreach(I in 1..N)\\n all_different([X[I,J] : J in 1..N]),\\n all_different([X[J,I] : J in 1..N])\\n end,\\n % rand_val for randomness\\n solve($[ff,rand_val],X).\\n\\npretty_print(X) =>\\n N = X.len,\\n Alpha = \\\"1234567890abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",\\n foreach(I in 1..N)\\n foreach(J in 1..N)\\n if N > 20 then\\n printf(\\\"%w\\\",Alpha[X[I,J]])\\n else\\n printf(\\\"%2w \\\",X[I,J])\\n end\\n end,\\n nl\\n end,\\n nl.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"main =>\\n foreach(N in 1..6)\\n Count = count_all(latin_square(N,_)),\\n println(N=Count)\\n end.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"from random import choice, shuffle\\nfrom copy import deepcopy\\n\\ndef rls(n):\\n if n <= 0:\\n return []\\n else:\\n symbols = list(range(n))\\n square = _rls(symbols)\\n return _shuffle_transpose_shuffle(square)\\n\\n\\ndef _shuffle_transpose_shuffle(matrix):\\n square = deepcopy(matrix)\\n shuffle(square)\\n trans = list(zip(*square))\\n shuffle(trans)\\n return trans\\n\\n\\ndef _rls(symbols):\\n n = len(symbols)\\n if n == 1:\\n return [symbols]\\n else:\\n sym = choice(symbols)\\n symbols.remove(sym)\\n square = _rls(symbols)\\n square.append(square[0].copy())\\n for i in range(n):\\n square[i].insert(i, sym)\\n return square\\n\\ndef _to_text(square):\\n if square:\\n width = max(len(str(sym)) for row in square for sym in row)\\n txt = '\\\\n'.join(' '.join(f\\\"{sym:>{width}}\\\" for sym in row)\\n for row in square)\\n else:\\n txt = ''\\n return txt\\n\\ndef _check(square):\\n transpose = list(zip(*square))\\n assert _check_rows(square) and _check_rows(transpose), \\\\\\n \\\"Not a Latin square\\\"\\n\\ndef _check_rows(square):\\n if not square:\\n return True\\n set_row0 = set(square[0])\\n return all(len(row) == len(set(row)) and set(row) == set_row0\\n for row in square)\\n\\n\\nif __name__ == '__main__':\\n for i in [3, 3, 5, 5, 12]:\\n square = rls(i)\\n print(_to_text(square))\\n _check(square)\\n print()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ [] []\\n rot times\\n [ i join ]\\n dup size times\\n [ tuck\\n nested join\\n swap\\n behead join ]\\n drop\\n shuffle\\n transpose\\n shuffle ] is rls ( n --> [ )\\n\\n 2 times\\n [ 5 rls\\n witheach\\n [ witheach\\n [ echo sp ]\\n cr ]\\n cr ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"sub latin-square { [[0],] };\\n\\nsub random ( @ls, :$size = 5 ) {\\n\\n # Build\\n for 1 ..^ $size -> $i {\\n @ls[$i] = @ls[0].clone;\\n @ls[$_].splice($_, 0, $i) for 0 .. $i;\\n }\\n\\n # Shuffle\\n @ls = @ls[^$size .pick(*)];\\n my @cols = ^$size .pick(*);\\n @ls[$_] = @ls[$_][@cols] for ^@ls;\\n\\n # Some random Latin glyphs\\n my @symbols = ('A' .. 'Z').pick($size);\\n\\n @ls.deepmap: { $_ = @symbols[$_] };\\n\\n}\\n\\nsub display ( @array ) { $_.fmt(\\\"%2s \\\").put for |@array, '' }\\n\\n\\n# The Task\\n\\n# Default size 5\\ndisplay random latin-square;\\n\\n# Specified size\\ndisplay random :size($_), latin-square for 5, 3, 9;\\n\\n# Or, if you'd prefer:\\ndisplay random latin-square, :size($_) for 12, 2, 1;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program generates and displays a randomized Latin square. */\\nparse arg N seed . /*obtain the optional argument from CL.*/\\nif N=='' | N==\\\",\\\" then N= 5 /*Not specified? Then use the default.*/\\nif datatype(seed, 'W') then call random ,,seed /*Seed numeric? Then use it for seed.*/\\nw= length(N - 1) /*get the length of the largest number.*/\\n$= /*initialize $ string to null. */\\n do i=0 for N; $= $ right(i, w, '_') /*build a string of numbers (from zero)*/\\n end /*i*/ /* [↑] $ string is (so far) in order.*/\\nz= /*Z: will be the 1st row of the square*/\\n do N; ?= random(1,words($)) /*gen a random number from the $ string*/\\n z= z word($, ?); $= delword($, ?, 1) /*add the number to string; del from $.*/\\n end /*r*/\\nzz= z||z /*build a double-length string of Z. */\\n do j=1 for N /* [↓] display rows of random Latin sq*/\\n say translate(subword(zz, j, N), , '_') /*translate leading underbar to blank. */\\n end /*j*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"load \\\"stdlib.ring\\\"\\nload \\\"guilib.ring\\\"\\n\\n###====================================================================================\\n\\nsize = 10\\n\\ntime1 = 0\\nbwidth = 0\\nbheight = 0\\t\\n\\t\\t\\t\\t\\na2DSquare = newlist(size,size)\\na2DFinal = newlist(size,size)\\n\\naList = 1:size\\naList2 = RandomList(aList)\\n\\nGenerateRows(aList2)\\nShuffleCols(a2DSquare, a2DFinal)\\n\\nC_SPACING = 1\\nButton = newlist(size,size)\\nLayoutButtonRow = list(size)\\nC_ButtonOrangeStyle = 'border-radius:1x;color:black; background-color: orange'\\n\\n###====================================================================================\\n\\nMyApp = New qApp {\\n\\n\\tStyleFusion()\\n\\n\\twin = new qWidget() {\\n\\n\\t\\tworkHeight = win.height()\\n\\t\\tfontSize = 8 + (300/size)\\n\\n\\t wwidth = win.width()\\n\\t wheight = win.height()\\n\\t bwidth = wwidth/size\\n\\t bheight = wheight/size\\n\\n\\t\\tsetwindowtitle(\\\"Random Latin Squares\\\")\\n\\t\\tmove(555,0)\\n\\t\\tsetfixedsize(1000,1000)\\n\\n\\t\\tmyfilter = new qallevents(win)\\n\\t\\tmyfilter.setResizeEvent(\\\"resizeBoard()\\\")\\n\\t\\tinstalleventfilter(myfilter)\\n\\n\\t\\tLayoutButtonMain = new QVBoxLayout() {\\n\\t\\t\\tsetSpacing(C_SPACING)\\n\\t\\t\\tsetContentsmargins(50,50,50,50)\\n\\t\\t}\\n\\n\\t\\tLayoutButtonStart = new QHBoxLayout() {\\n\\t\\t\\tsetSpacing(C_SPACING)\\n\\t\\t\\tsetContentsmargins(0,0,0,0)\\n\\t\\t}\\n\\n\\t\\tbtnStart = new qPushButton(win) {\\n\\t\\t\\tsetFont(new qFont(\\\"Calibri\\\",fontsize,2100,0))\\n\\t\\t\\tresize(bwidth,bheight)\\n\\t\\t\\tsettext(\\\" Start \\\")\\n\\t\\t\\tsetstylesheet(C_ButtonOrangeStyle)\\n\\t\\t\\tsetclickevent(\\\"gameSolution()\\\")\\n\\t\\t}\\n\\n\\t\\tsizeBtn = new qlabel(win)\\n\\t\\t{\\n\\t\\t\\tsetFont(new qFont(\\\"Calibri\\\",fontsize,2100,0))\\n\\t\\t\\tresize(bwidth,bheight)\\n\\t\\t\\tsetStyleSheet(\\\"background-color:rgb(255,255,204)\\\")\\n\\t\\t\\tsetText(\\\" Size: \\\")\\n\\t\\t}\\t\\n\\n\\t\\tlineSize = new qLineEdit(win)\\n\\t\\t{\\n\\t\\t\\tsetFont(new qFont(\\\"Calibri\\\",fontsize,2100,0))\\n\\t\\t\\tresize(bwidth,bheight)\\n\\t\\t\\tsetStyleSheet(\\\"background-color:rgb(255,255,204)\\\")\\n\\t\\t\\tsetAlignment( Qt_AlignHCenter)\\n\\t\\t\\tsetAlignment( Qt_AlignVCenter)\\n\\t\\t\\tsetreturnPressedEvent(\\\"newBoardSize()\\\")\\n\\t\\t\\tsetText(string(size))\\n\\t\\t}\\n\\n\\t\\tbtnExit = new qPushButton(win) {\\n\\t\\t\\tsetFont(new qFont(\\\"Calibri\\\",fontsize,2100,0))\\n\\t\\t\\tresize(bwidth,bheight)\\n\\t\\t\\tsettext(\\\" Exit \\\")\\n\\t\\t\\tsetstylesheet(C_ButtonOrangeStyle)\\n\\t\\t\\tsetclickevent(\\\"pExit()\\\")\\n\\t\\t}\\n\\n\\t\\tLayoutButtonStart.AddWidget(btnStart)\\n\\t\\tLayoutButtonStart.AddWidget(sizeBtn)\\n\\t\\tLayoutButtonStart.AddWidget(lineSize)\\n\\t\\tLayoutButtonStart.AddWidget(btnExit)\\n\\t\\n\\t\\tLayoutButtonMain.AddLayout(LayoutButtonStart)\\n\\n\\t\\tfor Row = 1 to size\\n\\n\\t\\t\\tLayoutButtonRow[Row] = new QHBoxLayout() {\\n\\t\\t\\t\\tsetSpacing(C_SPACING)\\n\\t\\t\\t\\tsetContentsmargins(0,0,0,0)\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor Col = 1 to size\\n\\t\\t\\t\\tButton[Row][Col] = new qlabel(win) {\\n\\t\\t\\t\\t\\tsetFont(new qFont(\\\"Calibri\\\",fontsize,2100,0))\\n\\t\\t\\t\\t\\tresize(bwidth,bheight)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tLayoutButtonRow[Row].AddWidget(Button[Row][Col])\\n\\t\\t\\tnext\\n\\t\\t\\tLayoutButtonMain.AddLayout(LayoutButtonRow[Row])\\n\\n\\t\\tnext\\n\\n\\t\\tsetLayout(LayoutButtonMain)\\n\\n\\t\\t show()\\n\\n\\t}\\n\\n\\texec()\\n}\\n\\n###====================================================================================\\n\\nfunc newBoardSize()\\n\\n\\tnrSize = number(lineSize.text())\\n\\n\\tif nrSize = 1\\n\\t\\t? \\\"Enter: Size > 1\\\"\\n\\t\\treturn\\n\\tok\\n\\n\\tfor Row = 1 to size\\n\\t\\tfor Col = 1 to size\\n\\t\\t\\tButton[Row][Col].settext(\\\"\\\")\\n\\t\\tnext\\n\\tnext\\n\\n\\tnewWindow(nrSize)\\n\\n###====================================================================================\\n\\nfunc newWindow(newSize)\\n\\n\\ttime1 = clock()\\n\\n\\tfor Row = 1 to size\\n\\t\\tfor Col = 1 to size\\n\\t\\t\\tButton[Row][Col].delete()\\n\\t\\tnext\\n\\tnext\\n\\n\\tsize = newSize\\n\\n\\tbwidth = ceil((win.width() - 8) / size)\\n\\tbheight = ceil((win.height() - 32) / size)\\n\\n\\tfontSize = 8 + (300/size)\\n\\n\\tif size > 16\\n\\t\\tfontSize = 8 + (150/size)\\n\\tok\\n\\n\\tif size < 8\\n\\t\\tfontSize = 30 + (150/size)\\n\\tok\\n\\n\\tif size = 2\\n\\t\\tfontSize = 10 + (100/size)\\n\\tok\\n\\n\\tbtnStart.setFont(new qFont(\\\"Calibri\\\",fontsize,2100,0))\\n\\tsizeBtn.setFont(new qFont(\\\"Calibri\\\",fontsize,2100,0))\\n\\tlineSize.setFont(new qFont(\\\"Calibri\\\",fontsize,2100,0))\\n\\tbtnExit.setFont(new qFont(\\\"Calibri\\\",fontsize,2100,0))\\n\\n\\tLayoutButtonStart = new QHBoxLayout() {\\n\\t\\tsetSpacing(C_SPACING)\\n\\t\\tsetContentsmargins(0,0,0,0)\\n\\t}\\n\\n\\tButton = newlist(size,size)\\n\\tLayoutButtonRow = list(size)\\n\\n\\tfor Row = 1 to size\\n\\n\\t\\tLayoutButtonRow[Row] = new QHBoxLayout() {\\n\\t\\t\\tsetSpacing(C_SPACING)\\n\\t\\t\\tsetContentsmargins(0,0,0,0)\\n\\t\\t}\\n\\n\\t\\tfor Col = 1 to size\\n\\n\\t\\t\\tButton[Row][Col] = new qlabel(win) {\\n\\t\\t\\t\\tsetFont(new qFont(\\\"Calibri\\\",fontsize,2100,0))\\n\\t\\t\\t\\tresize(bwidth,bheight)\\n\\t\\t\\t}\\n\\t\\t\\tLayoutButtonRow[Row].AddWidget(Button[Row][Col])\\n\\n\\t\\tnext\\n\\n\\t\\tLayoutButtonMain.AddLayout(LayoutButtonRow[Row])\\n\\n\\tnext\\n\\n\\twin.setLayout(LayoutButtonMain)\\n\\n\\treturn\\n\\n###====================================================================================\\n\\nfunc resizeBoard\\n\\n\\tbwidth = ceil((win.width() - 8) / size)\\n\\tbheight = ceil((win.height() - 32) / size)\\n\\n\\tfor Row = 1 to size\\n\\t\\tfor Col = 1 to size\\n\\t\\t\\tButton[Row][Col].resize(bwidth,bheight)\\n\\t\\tnext\\n\\tnext\\n\\n###====================================================================================\\n\\nFunc pExit\\n\\n\\tMyApp.quit()\\n\\n###====================================================================================\\n\\nfunc gameSolution()\\n\\n\\ta2DSquare = newlist(size,size)\\n\\ta2DFinal = newlist(size,size)\\n\\n\\taList = 1:size\\n\\taList2 = RandomList(aList)\\n\\n\\tGenerateRows(aList2)\\n\\tShuffleCols(a2DSquare, a2DFinal)\\n\\n\\tfor nRow = 1 to size\\n\\t\\tfor nCol = 1 to size\\n\\t\\t\\tButton[nRow][nCol].settext(\\\"-\\\")\\n\\t\\tnext\\n\\tnext\\n\\n\\tfor nRow = 1 to size\\n\\t\\tfor nCol = 1 to size\\n\\t\\t\\tButton[nRow][nCol].resize(bwidth,bheight)\\n\\t\\t\\tButton[nRow][nCol].settext(string(a2DSquare[nRow][nCol]))\\n\\t\\tnext\\n\\tnext\\n\\n\\ttime2 = clock()\\n\\ttime3 = (time2 - time1)/1000\\n\\t? \\\"Elapsed time: \\\" + time3 + \\\" ms at size = \\\" + size + nl\\n\\n###====================================================================================\\n\\n// Scramble the numbers in the List\\n// Uniq random picks, then shorten list by each pick\\n\\nFunc RandomList(aInput)\\n\\n aOutput = []\\n\\n while len(aInput) > 1\\n nIndex = random(len(aInput)-1)\\n nIndex++\\n\\n aOutput + aInput[nIndex]\\n del(aInput,nIndex)\\n end\\n\\n aOutput + aInput[1]\\n\\nreturn aOutput\\n\\n###====================================================================================\\n// Generate Rows of data. Put them in the 2DArray\\n\\nFunc GenerateRows(aInput)\\n\\n\\taOutput = []\\n\\tsize = len(aInput)\\n shift = 1\\n\\n\\tfor k = 1 to size\\t\\t\\t\\t\\t\\t\\t\\t\\t// Make 8 Rows of lists\\n\\t\\taOutput = []\\n\\t\\t\\n\\t\\tfor i = 1 to size \\t\\t\\t\\t\\t// make a list\\n\\t\\t\\t pick = i + shift \\t\\t\\t\\t\\t// shift every Row by +1 more\\n\\t\\t\\tif pick > size pick = pick - size ok\\n\\t\\n\\t\\t\\taOutput + aInput[pick]\\n\\t\\tnext\\n\\t\\n\\t\\ta2DSquare[k] = aOutput\\t\\t\\t\\t\\t\\t\\t// Row of Output to a2DSquare\\n\\n\\t\\tshift++ \\t\\t\\t\\t\\t\\t// shift next line by +1 more\\n\\t\\tif shift > size shift = 1 ok\\n\\tnext\\n\\n\\treturn\\n\\n###====================================================================================\\n// Shift random Rows into a2DFinal, then random Cols\\n\\nFunc ShuffleCols(a2DSquare, a2DFinal)\\n\\n\\taSuffle = 1:size\\n aSuffle2 = RandomList(aSuffle)\\t// Pick random Col to insert in a2DFinal\\n\\t\\n\\tfor i = 1 to size \\t// Row\\t\\t\\n\\t\\tpick = aSuffle2[i]\\n\\n for j = 1 to size\\t\\t\\t// Col\\n\\t\\t\\ta2DFinal[i][j] = a2DSquare[pick][j] // i-Row-Col j-Horz-Vert\\n\\t\\tnext\\n\\tnext\\n\\n\\ta2DSquare = a2DFinal\\t\\t\\t// Now do the verticals\\n\\taSuffle = 1:size\\n\\taSuffle2 = RandomList(aSuffle)\\n\\n\\tfor i = 1 to size \\t// Row\\t\\t\\n\\t\\tpick = aSuffle2[i]\\n\\n for j = 1 to size\\t\\t\\t// Col\\n\\t\\t\\ta2DFinal[j][i] = a2DSquare[j][pick] //Reverse i-j , i-Row-Col j-Horz-Vert\\n\\t\\tnext\\n\\tnext\\n\\n\\treturn\\n\\n###====================================================================================\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"N = 5\\n\\ndef generate_square\\n perms = (1..N).to_a.permutation(N).to_a.shuffle\\n square = []\\n N.times do\\n square << perms.pop\\n perms.reject!{|perm| perm.zip(square.last).any?{|el1, el2| el1 == el2} }\\n end\\n square\\nend\\n\\ndef print_square(square)\\n cell_size = N.digits.size + 1\\n strings = square.map!{|row| row.map!{|el| el.to_s.rjust(cell_size)}.join }\\n puts strings, \\\"\\\\n\\\"\\nend\\n\\n2.times{print_square( generate_square)}\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"import \\\"random\\\" for Random\\n\\nvar rand = Random.new()\\n\\nvar printSquare = Fn.new { |latin|\\n for (row in latin) System.print(row)\\n System.print()\\n}\\n\\nvar latinSquare = Fn.new { |n|\\n if (n <= 0) {\\n System.print(\\\"[]\\\\n\\\")\\n return\\n }\\n var latin = List.filled(n, null)\\n for (i in 0...n) {\\n latin[i] = List.filled(n, 0)\\n if (i == n - 1) break\\n for (j in 0...n) latin[i][j] = j\\n }\\n\\n // first row\\n rand.shuffle(latin[0])\\n\\n // middle row(s)\\n for (i in 1...n-1) {\\n var shuffled = false\\n while (!shuffled) {\\n rand.shuffle(latin[i])\\n var shuffling = false\\n for (k in 0...i) {\\n for (j in 0...n) {\\n if (latin[k][j] == latin[i][j]) {\\n shuffling = true\\n break\\n }\\n }\\n if (shuffling) break\\n }\\n if (!shuffling) shuffled = true\\n }\\n }\\n\\n // last row\\n for (j in 0...n) {\\n var used = List.filled(n, false)\\n for (i in 0...n-1) used[latin[i][j]] = true\\n for (k in 0...n) {\\n if (!used[k]) {\\n latin[n-1][j] = k\\n break\\n }\\n }\\n }\\n printSquare.call(latin)\\n}\\n\\nlatinSquare.call(5)\\nlatinSquare.call(5)\\nlatinSquare.call(10) // for good measure\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"import \\\"random\\\" for Random\\nimport \\\"./sort\\\" for Sort\\nimport \\\"./fmt\\\" for Fmt\\nimport \\\"./math\\\" for Int\\n\\nvar rand = Random.new()\\nvar counts = List.filled(4, 0)\\nvar aa = List.filled(16, 0)\\n\\nvar testSquares = [\\n [0, 1, 2, 3, 1, 0, 3, 2, 2, 3, 0, 1, 3, 2, 1, 0],\\n [0, 1, 2, 3, 1, 0, 3, 2, 2, 3, 1, 0, 3, 2, 0, 1],\\n [0, 1, 2, 3, 1, 2, 3, 0, 2, 3, 0, 1, 3, 0, 1, 2],\\n [0, 1, 2, 3, 1, 3, 0, 2, 2, 0, 3, 1, 3, 2, 1, 0]\\n]\\n\\n// Checks whether two lists contain the same elements in the same order\\nvar areSame = Fn.new { |l1, l2|\\n if (l1.count != l2.count) return false\\n for (i in 0...l1.count) {\\n if (l1[i] != l2[i]) return false\\n }\\n return true\\n}\\n\\n// generate derangements of first n numbers, with 'start' in first place.\\nvar dList = Fn.new { |n, start|\\n var r = []\\n start = start - 1 // use 0 basing\\n var a = List.filled(n, 0)\\n for (i in 0...n) a[i] = i\\n var t = a[0]\\n a[0] = start\\n a[start] = t\\n Sort.quick(a, 1, a.count-1, null)\\n var first = a[1]\\n var recurse // recursive closure permutes a[1..-1]\\n recurse = Fn.new { |last|\\n if (last == first) {\\n // bottom of recursion. you get here once for each permutation.\\n // test if permutation is deranged.\\n var j = 0 // j starts from 0, not 1\\n for (v in a.skip(1)) {\\n if (j+1 == v) return r // no, ignore it\\n j = j + 1\\n }\\n // yes, save a copy\\n var b = a.toList\\n for (i in 0...b.count) b[i] = b[i] + 1 // change back to 1 basing\\n r.add(b)\\n return r\\n }\\n var i = last\\n while (i >= 1) {\\n a.swap(i, last)\\n recurse.call(last - 1)\\n a.swap(i, last)\\n i = i - 1\\n }\\n }\\n recurse.call(n - 1)\\n return r\\n}\\n\\nvar copyMatrix = Fn.new { |m|\\n var le = m.count\\n var cpy = List.filled(le, null)\\n for (i in 0...le) cpy[i] = m[i].toList\\n return cpy\\n}\\n\\nvar reducedLatinSquares = Fn.new { |n|\\n var rls = []\\n if (n < 0) n = 0\\n var rlatin = List.filled(n, null)\\n for (i in 0...n) rlatin[i] = List.filled(n, 0)\\n if (n <= 1) {\\n rls.add(rlatin)\\n return rls\\n }\\n\\n // first row\\n for (j in 0...n) rlatin[0][j] = j + 1\\n\\n // recursive closure to compute reduced latin squares\\n var recurse\\n recurse = Fn.new { |i|\\n var rows = dList.call(n, i) // get derangements of first n numbers, with 'i' first.\\n for (r in 0...rows.count) {\\n var outer = false\\n rlatin[i-1] = rows[r].toList\\n for (k in 0...i-1) {\\n for (j in 1...n) {\\n if (rlatin[k][j] == rlatin[i-1][j]) {\\n if (r < rows.count-1) {\\n outer = true\\n break\\n } else if (i > 2) {\\n return\\n }\\n }\\n }\\n if (outer) break\\n }\\n if (outer) continue\\n if (i < n) {\\n recurse.call(i + 1)\\n } else {\\n var rl = copyMatrix.call(rlatin)\\n rls.add(rl)\\n }\\n }\\n return\\n }\\n\\n // remaining rows\\n recurse.call(2)\\n return rls\\n}\\n\\nvar printSquare = Fn.new { |latin, n|\\n for (i in 0...n) {\\n for (j in 0...n) Fmt.write(\\\"$d \\\", latin[i][j]-1)\\n System.print()\\n }\\n System.print()\\n}\\n\\n// generate permutations of first n numbers, starting from 0.\\nvar pList = Fn.new { |n|\\n var fact = Int.factorial(n)\\n var perms = List.filled(fact, null)\\n var a = List.filled(n, 0)\\n for (i in 0...n) a[i] = i\\n var t = a.toList\\n perms[0] = t\\n n = n - 1\\n for (c in 1...fact) {\\n var i = n - 1\\n var j = n\\n while (a[i] > a[i+1]) i = i - 1\\n while (a[j] < a[i]) j = j - 1\\n a.swap(i, j)\\n j = n\\n i = i + 1\\n while (i < j) {\\n a.swap(i, j)\\n i = i + 1\\n j = j - 1\\n }\\n var t = a.toList\\n t.add(0)\\n perms[c] = t\\n }\\n return perms\\n}\\n\\nvar generateLatinSquares = Fn.new { |n, tests, echo|\\n var rls = reducedLatinSquares.call(n)\\n var perms = pList.call(n)\\n var perms2 = pList.call(n - 1)\\n for (test in 0...tests) {\\n var rn = rand.int(rls.count)\\n var rl = rls[rn] // select reduced random square at random\\n rn = rand.int(perms.count)\\n var rp = perms[rn] // select a random permuation of 'rl's columns\\n // permute columns\\n var t = List.filled(n, null)\\n for (i in 0...n) {\\n t[i] = List.filled(n, 0)\\n for (j in 0...n) t[i][j] = rl[i][rp[j]]\\n }\\n rn = rand.int(perms2.count)\\n rp = perms2[rn] // select a random permutation of 't's rows 2 to n\\n // permute rows 2 to n\\n var u = List.filled(n, null)\\n for (i in 0...n) {\\n u[i] = List.filled(n, 0)\\n for (j in 0...n) {\\n if (i == 0) {\\n u[i][j] = t[i][j]\\n } else {\\n u[i][j] = t[rp[i-1]+1][j]\\n }\\n }\\n }\\n if (test < echo) printSquare.call(u, n)\\n if (n == 4) {\\n for (i in 0..3) {\\n for (j in 0..3) u[i][j] = u[i][j] - 1\\n }\\n for (i in 0..3) {\\n for (j in 4*i...4*i+4) {\\n aa[j] = u[i][j - 4*i]\\n }\\n }\\n for (i in 0..3) {\\n if (areSame.call(testSquares[i], aa)) {\\n counts[i] = counts[i] + 1\\n break\\n }\\n }\\n }\\n }\\n}\\n\\nSystem.print(\\\"Two randomly generated latin squares of order 5 are:\\\\n\\\")\\ngenerateLatinSquares.call(5, 2, 2)\\n\\nSystem.print(\\\"Out of 1,000,000 randomly generated latin squares of order 4, \\\")\\nSystem.print(\\\"of which there are 576 instances ( => expected 1736 per instance),\\\")\\nSystem.print(\\\"the following squares occurred the number of times shown:\\\\n\\\")\\ngenerateLatinSquares.call(4, 1e6, 0)\\nfor (i in 0..3) System.print(\\\"%(testSquares[i]) : %(counts[i])\\\")\\nSystem.print(\\\"\\\\nA randomly generated latin square of order 6 is:\\\\n\\\")\\ngenerateLatinSquares.call(6, 1, 1)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn randomLatinSquare(n,symbols=[1..]){ //--> list of lists\\n if(n<=0) return(T);\\n square,syms := List(), symbols.walker().walk(n);\\n do(n){ syms=syms.copy(); square.append(syms.append(syms.pop(0))) }\\n // shuffle rows, transpose & shuffle columns\\n T.zip(square.shuffle().xplode()).shuffle();\\n}\\nfcn rls2String(square){ square.apply(\\\"concat\\\",\\\" \\\").concat(\\\"\\\\n\\\") }\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"foreach n in (T(1,2,5)){ randomLatinSquare(n) : rls2String(_).println(\\\"\\\\n\\\") }\\nrandomLatinSquare(5, [\\\"A\\\"..\\\"Z\\\"]) : rls2String(_).println(\\\"\\\\n\\\");\\nrandomLatinSquare(10,\\\"!@#$%^&*()\\\") : rls2String(_).println(\\\"\\\\n\\\");\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Random-Latin-squares"}}},{"rowIdx":1556,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Random_number_generator_(included)\n","language":"00-META"},{"code":"The task is to:\n: State the type of random number generator algorithm used in a language's built-in random number generator. If the language or its immediate libraries don't provide a random number generator, skip this task.\n: If possible, give a link to a wider [[wp:List of random number generators|explanation]] of the algorithm used.\n\n<small>Note: the task is ''not'' to create an RNG, but to report on the languages in-built RNG that would be the most likely RNG used.</small>\n\nThe main types of pseudo-random number generator ([[wp:PRNG|PRNG]]) that are in use are the [[linear congruential generator|Linear Congruential Generator]] ([[wp:Linear congruential generator|LCG]]), and the Generalized Feedback Shift Register ([[wp:Generalised_feedback_shift_register#Non-binary_Galois_LFSR|GFSR]]), (of which the [[wp:Mersenne twister|Mersenne twister]] generator is a subclass). The last main type is where the output of one of the previous ones (typically a Mersenne twister) is fed through a [[cryptographic hash function]] to maximize unpredictability of individual bits. \n\nNote that neither LCGs nor GFSRs should be used for the most demanding applications (cryptography) without additional steps.\n\n","language":"00-TASK"},{"code":"PROC ℒ next random = (REF ℒ INT a)ℒ REAL: ( a :=\n¢ the next pseudo-random ℒ integral value after 'a' from a\nuniformly distributed sequence on the interval [ℒ 0,ℒ maxint] ¢;\n\n¢ the real value corresponding to 'a' according to some mapping of\nintegral values [ℒ 0, ℒ max int] into real values [ℒ 0, ℒ 1)\ni.e. such that -0 <= x < 1 such that the sequence of real\nvalues so produced preserves the properties of pseudo-randomness\nand uniform distribution of the sequence of integral values ¢);\n\nINT ℒ last random := # some initial random number #;\nPROC ℒ random = ℒ REAL: ℒ next random(ℒ last random);\n","language":"ALGOL-68"},{"code":"PROC long next random = (REF LONG INT a)LONG REAL: # some suitable next random number #;\nINT long last random := # some initial random number #;\nPROC long random = LONG REAL: long next random(long last random);\n","language":"ALGOL-68"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n\n/* Flip a coin, 10 times. */\nint\nmain()\n{\n\tint i;\n\tsrand(time(NULL));\n\tfor (i = 0; i < 10; i++)\n\t\tputs((rand() % 2) ? \"heads\" : \"tails\");\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <string>\n#include <random>\n\nint main()\n{\n std::random_device rd;\n std::uniform_int_distribution<int> dist(1, 10);\n std::mt19937 mt(rd());\n\n std::cout << \"Random Number (hardware): \" << dist(rd) << std::endl;\n std::cout << \"Mersenne twister (hardware seeded): \" << dist(mt) << std::endl;\n}\n","language":"C++"},{"code":"# Show random integer from 0 to 9999.\nstring(RANDOM LENGTH 4 ALPHABET 0123456789 number)\nmath(EXPR number \"${number} + 0\") # Remove extra leading 0s.\nmessage(STATUS ${number})\n","language":"CMake"},{"code":"(setf *random-state* (make-random-state t))\n(random 10)\n","language":"Common-Lisp"},{"code":"unit delphicompatiblerandom;\n{$ifdef fpc}{$mode objfpc}{$endif}\n\ninterface\n\nfunction LCGRandom: extended; overload;inline;\nfunction LCGRandom(const range:longint):longint;overload;inline;\n\nimplementation\n\nfunction IM:cardinal;inline;\nbegin\n RandSeed := RandSeed * 134775813 + 1;\n Result := RandSeed;\nend;\n\nfunction LCGRandom: extended; overload;inline;\nbegin\n Result := IM * 2.32830643653870e-10;\nend;\n\nfunction LCGRandom(const range:longint):longint;overload;inline;\nbegin\n Result := IM * range shr 32;\nend;\n\nend.\n","language":"Delphi"},{"code":"(random-seed \"albert\")\n(random) → 0.9672510261922906 ; random float in [0 ... 1[\n(random 1000) → 726 ; random integer in [0 ... 1000 [\n(random -1000) → -936 ; random integer in ]-1000 1000[\n\n(lib 'bigint)\n(random 1e200) → 48635656441292641677...3917639734865662239925...9490799697903133046309616766848265781368\n","language":"EchoLisp"},{"code":"import extensions;\n\npublic program()\n{\n console.printLine(randomGenerator.nextReal());\n console.printLine(randomGenerator.nextInt(0,100))\n}\n","language":"Elena"},{"code":"# Seed the RNG\n:random.seed(:erlang.now())\n\n# Integer in the range 1..10\n:random.uniform(10)\n\n# Float between 0.0 and 1.0\n:random.uniform()\n","language":"Elixir"},{"code":"random:seed(A1, A2, A3)\n","language":"Erlang"},{"code":"...\n{A1,A2,A3} = erlang:now(),\nrandom:seed(A1, A2, A3),\n...sequence of randoms used\nrandom:seed(A1, A2, A3),\n...same sequence of randoms used\n","language":"Erlang"},{"code":"Rfloat = random:uniform(),\n","language":"Erlang"},{"code":"Rint = random:uniform(N),\n","language":"Erlang"},{"code":"program rosetta_random\n implicit none\n\n integer, parameter :: rdp = kind(1.d0)\n real(rdp) :: num\n integer, allocatable :: seed(:)\n integer :: un,n, istat\n\n call random_seed(size = n)\n allocate(seed(n))\n\n ! Seed with the OS random number generator\n open(newunit=un, file=\"/dev/urandom\", access=\"stream\", &\n form=\"unformatted\", action=\"read\", status=\"old\", iostat=istat)\n if (istat == 0) then\n read(un) seed\n close(un)\n end if\n call random_seed (put=seed)\n call random_number(num)\n write(*,'(E24.16)') num\nend program rosetta_random\n","language":"Fortran"},{"code":"program RandomNumbers;\n// Program to demonstrate the Random and Randomize functions.\nvar\n RandomInteger: integer;\n RandomFloat: double;\nbegin\n Randomize; // generate a new sequence every time the program is run\n RandomFloat := Random(); // 0 <= RandomFloat < 1\n Writeln('Random float between 0 and 1: ', RandomFloat: 5: 3);\n RandomFloat := Random() * 10; // 0 <= RandomFloat < 10\n Writeln('Random float between 0 and 10: ', RandomFloat: 5: 3);\n RandomInteger := Random(10); // 0 <= RandomInteger < 10\n Writeln('Random integer between 0 and 9: ', RandomInteger);\n // Wait for <enter>\n Readln;\nend.\n","language":"Free-Pascal-Lazarus"},{"code":"# Creating a random source\nrs := RandomSource(IsMersenneTwister);\n\n# Generate a random number between 1 and 10\nRandom(rs, 1, 10);\n\n# Same with default random source\nRandom(1, 10);\n","language":"GAP"},{"code":"Random([1, 10, 100]);\n\n# Random permutation of 1..200\nRandom(SymmetricGroup(200));\n\n# Random element of Z/23Z :\nRandom(Integers mod 23);\n","language":"GAP"},{"code":"setrand(3)\nrandom(6)+1\n\\\\ chosen by fair dice roll.\n\\\\ guaranteed to the random.\n","language":"PARI-GP"},{"code":"seed(x) = mod(950706376 * seed(x-1), 2147483647)\nrandom(x) = seed(x) / 2147483647\n","language":"PL-I"},{"code":"DBMS_RANDOM.RANDOM --produces integers in [-2^^31, 2^^31).\nDBMS_RANDOM.VALUE --produces numbers in [0,1) with 38 digits of precision.\nDBMS_RANDOM.NORMAL --produces normal distributed numbers with a mean of 0 and a variance of 1\n","language":"PL-SQL"},{"code":"DBMS_CRYPTO.RANDOMBYTES --returns RAW value\nDBMS_CRYPTO.RANDOMINTEGER --produces integers in the BINARY_INTEGER datatype\nDBMS_CRYPTO.RANDOMNUMBER --produces integer in the NUMBER datatype in the range of [0..2**128-1]\n","language":"PL-SQL"},{"code":"typedef unsigned long long u8;\ntypedef struct ranctx { u8 a; u8 b; u8 c; u8 d; } ranctx;\n\n#define rot(x,k) (((x)<<(k))|((x)>>(64-(k))))\nu8 ranval( ranctx *x ) {\n u8 e = x->a - rot(x->b, 7);\n x->a = x->b ^ rot(x->c, 13);\n x->b = x->c + rot(x->d, 37);\n x->c = x->d + e;\n x->d = e + x->a;\n return x->d;\n}\n\nvoid raninit( ranctx *x, u8 seed ) {\n u8 i;\n x->a = 0xf1ea5eed, x->b = x->c = x->d = seed;\n for (i=0; i<20; ++i) {\n (void)ranval(x);\n }\n}\n","language":"Quackery"},{"code":"?RNG\nhelp.search(\"Distribution\", package=\"stats\")\n","language":"R"},{"code":"import util::Math;\narbInt(int limit); // generates an arbitrary integer below limit\narbRat(int limit, int limit); // generates an arbitrary rational number between the limits\narbReal(); // generates an arbitrary real value in the interval [0.0, 1.0]\narbSeed(int seed);\n","language":"Rascal"},{"code":"rascal>import List;\nok\nrascal>getOneFrom([\"zebra\", \"elephant\", \"snake\", \"owl\"]);\nstr: \"owl\"\n","language":"Rascal"},{"code":" /*(below) returns a random integer between 100 & 200, inclusive.*/\n\ny = random(100, 200)\n","language":"REXX"},{"code":"call random ,,44 /*the seed in this case is \"44\". */\n .\n .\n .\ny = random(100, 200)\n","language":"REXX"},{"code":"/* REXX ***************************************************************\n* 08.09.2013 Walter Pachl\n* Please add the output from other REXXes\n* 10.09.2013 Walter Pachl added REXX/TSO\n* 01.08.2014 Walter Pachl show what ooRexx supports\n**********************************************************************/\nParse Version v\nCall random ,,44\nol=v':'\nDo i=1 To 10\n ol=ol random(1,10)\n End\nIf left(v,11)='REXX-ooRexx' Then\n ol=ol random(-999999999,0) /* ooRexx supports negative limits */\nSay ol\n","language":"REXX"},{"code":"nr = 10\nfor i = 1 to nr\n see random(i) + nl\nnext\n","language":"Ring"},{"code":"rmd(0)\n","language":"Run-BASIC"},{"code":"import scala.util.Random\n\n/**\n * Histogram of 200 throws with two dices.\n */\nobject Throws extends App {\n Stream.continually(Random.nextInt(6) + Random.nextInt(6) + 2)\n .take(200).groupBy(identity).toList.sortBy(_._1)\n .foreach {\n case (a, b) => println(f\"$a%2d:\" + \"X\" * b.size)\n }\n}\n","language":"Scala"},{"code":"say 1.rand # random float in the interval [0,1)\nsay 100.irand # random integer in the interval [0,100)\n","language":"Sidef"},{"code":"rand\n","language":"TI-83-BASIC"},{"code":" echo $RANDOM\n","language":"UNIX-Shell"},{"code":"include c:\\cxpl\\codes; \\intrinsic 'code' declarations\nint I;\n[RanSeed(12345); \\set random number generator seed to 12345\nfor I:= 1 to 5 do\n [IntOut(0, Ran(1_000_000)); CrLf(0)];\n]\n","language":"XPL0"},{"code":"ld a,r\n","language":"Z80-Assembly"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Random_number_generator_(included)\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"The task is to:\\n: State the type of random number generator algorithm used in a language's built-in random number generator. If the language or its immediate libraries don't provide a random number generator, skip this task.\\n: If possible, give a link to a wider [[wp:List of random number generators|explanation]] of the algorithm used.\\n\\n<small>Note: the task is ''not'' to create an RNG, but to report on the languages in-built RNG that would be the most likely RNG used.</small>\\n\\nThe main types of pseudo-random number generator ([[wp:PRNG|PRNG]]) that are in use are the [[linear congruential generator|Linear Congruential Generator]] ([[wp:Linear congruential generator|LCG]]), and the Generalized Feedback Shift Register ([[wp:Generalised_feedback_shift_register#Non-binary_Galois_LFSR|GFSR]]), (of which the [[wp:Mersenne twister|Mersenne twister]] generator is a subclass). The last main type is where the output of one of the previous ones (typically a Mersenne twister) is fed through a [[cryptographic hash function]] to maximize unpredictability of individual bits. \\n\\nNote that neither LCGs nor GFSRs should be used for the most demanding applications (cryptography) without additional steps.\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"PROC ℒ next random = (REF ℒ INT a)ℒ REAL: ( a :=\\n¢ the next pseudo-random ℒ integral value after 'a' from a\\nuniformly distributed sequence on the interval [ℒ 0,ℒ maxint] ¢;\\n\\n¢ the real value corresponding to 'a' according to some mapping of\\nintegral values [ℒ 0, ℒ max int] into real values [ℒ 0, ℒ 1)\\ni.e. such that -0 <= x < 1 such that the sequence of real\\nvalues so produced preserves the properties of pseudo-randomness\\nand uniform distribution of the sequence of integral values ¢);\\n\\nINT ℒ last random := # some initial random number #;\\nPROC ℒ random = ℒ REAL: ℒ next random(ℒ last random);\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"PROC long next random = (REF LONG INT a)LONG REAL: # some suitable next random number #;\\nINT long last random := # some initial random number #;\\nPROC long random = LONG REAL: long next random(long last random);\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n\\n/* Flip a coin, 10 times. */\\nint\\nmain()\\n{\\n\\tint i;\\n\\tsrand(time(NULL));\\n\\tfor (i = 0; i < 10; i++)\\n\\t\\tputs((rand() % 2) ? \\\"heads\\\" : \\\"tails\\\");\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <string>\\n#include <random>\\n\\nint main()\\n{\\n std::random_device rd;\\n std::uniform_int_distribution<int> dist(1, 10);\\n std::mt19937 mt(rd());\\n\\n std::cout << \\\"Random Number (hardware): \\\" << dist(rd) << std::endl;\\n std::cout << \\\"Mersenne twister (hardware seeded): \\\" << dist(mt) << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"# Show random integer from 0 to 9999.\\nstring(RANDOM LENGTH 4 ALPHABET 0123456789 number)\\nmath(EXPR number \\\"${number} + 0\\\") # Remove extra leading 0s.\\nmessage(STATUS ${number})\\n\",\n \"language\": \"CMake\"\n },\n {\n \"code\": \"(setf *random-state* (make-random-state t))\\n(random 10)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"unit delphicompatiblerandom;\\n{$ifdef fpc}{$mode objfpc}{$endif}\\n\\ninterface\\n\\nfunction LCGRandom: extended; overload;inline;\\nfunction LCGRandom(const range:longint):longint;overload;inline;\\n\\nimplementation\\n\\nfunction IM:cardinal;inline;\\nbegin\\n RandSeed := RandSeed * 134775813 + 1;\\n Result := RandSeed;\\nend;\\n\\nfunction LCGRandom: extended; overload;inline;\\nbegin\\n Result := IM * 2.32830643653870e-10;\\nend;\\n\\nfunction LCGRandom(const range:longint):longint;overload;inline;\\nbegin\\n Result := IM * range shr 32;\\nend;\\n\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"(random-seed \\\"albert\\\")\\n(random) → 0.9672510261922906 ; random float in [0 ... 1[\\n(random 1000) → 726 ; random integer in [0 ... 1000 [\\n(random -1000) → -936 ; random integer in ]-1000 1000[\\n\\n(lib 'bigint)\\n(random 1e200) → 48635656441292641677...3917639734865662239925...9490799697903133046309616766848265781368\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"import extensions;\\n\\npublic program()\\n{\\n console.printLine(randomGenerator.nextReal());\\n console.printLine(randomGenerator.nextInt(0,100))\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"# Seed the RNG\\n:random.seed(:erlang.now())\\n\\n# Integer in the range 1..10\\n:random.uniform(10)\\n\\n# Float between 0.0 and 1.0\\n:random.uniform()\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"random:seed(A1, A2, A3)\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"...\\n{A1,A2,A3} = erlang:now(),\\nrandom:seed(A1, A2, A3),\\n...sequence of randoms used\\nrandom:seed(A1, A2, A3),\\n...same sequence of randoms used\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"Rfloat = random:uniform(),\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"Rint = random:uniform(N),\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"program rosetta_random\\n implicit none\\n\\n integer, parameter :: rdp = kind(1.d0)\\n real(rdp) :: num\\n integer, allocatable :: seed(:)\\n integer :: un,n, istat\\n\\n call random_seed(size = n)\\n allocate(seed(n))\\n\\n ! Seed with the OS random number generator\\n open(newunit=un, file=\\\"/dev/urandom\\\", access=\\\"stream\\\", &\\n form=\\\"unformatted\\\", action=\\\"read\\\", status=\\\"old\\\", iostat=istat)\\n if (istat == 0) then\\n read(un) seed\\n close(un)\\n end if\\n call random_seed (put=seed)\\n call random_number(num)\\n write(*,'(E24.16)') num\\nend program rosetta_random\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"program RandomNumbers;\\n// Program to demonstrate the Random and Randomize functions.\\nvar\\n RandomInteger: integer;\\n RandomFloat: double;\\nbegin\\n Randomize; // generate a new sequence every time the program is run\\n RandomFloat := Random(); // 0 <= RandomFloat < 1\\n Writeln('Random float between 0 and 1: ', RandomFloat: 5: 3);\\n RandomFloat := Random() * 10; // 0 <= RandomFloat < 10\\n Writeln('Random float between 0 and 10: ', RandomFloat: 5: 3);\\n RandomInteger := Random(10); // 0 <= RandomInteger < 10\\n Writeln('Random integer between 0 and 9: ', RandomInteger);\\n // Wait for <enter>\\n Readln;\\nend.\\n\",\n \"language\": \"Free-Pascal-Lazarus\"\n },\n {\n \"code\": \"# Creating a random source\\nrs := RandomSource(IsMersenneTwister);\\n\\n# Generate a random number between 1 and 10\\nRandom(rs, 1, 10);\\n\\n# Same with default random source\\nRandom(1, 10);\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"Random([1, 10, 100]);\\n\\n# Random permutation of 1..200\\nRandom(SymmetricGroup(200));\\n\\n# Random element of Z/23Z :\\nRandom(Integers mod 23);\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"setrand(3)\\nrandom(6)+1\\n\\\\\\\\ chosen by fair dice roll.\\n\\\\\\\\ guaranteed to the random.\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"seed(x) = mod(950706376 * seed(x-1), 2147483647)\\nrandom(x) = seed(x) / 2147483647\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"DBMS_RANDOM.RANDOM --produces integers in [-2^^31, 2^^31).\\nDBMS_RANDOM.VALUE --produces numbers in [0,1) with 38 digits of precision.\\nDBMS_RANDOM.NORMAL --produces normal distributed numbers with a mean of 0 and a variance of 1\\n\",\n \"language\": \"PL-SQL\"\n },\n {\n \"code\": \"DBMS_CRYPTO.RANDOMBYTES --returns RAW value\\nDBMS_CRYPTO.RANDOMINTEGER --produces integers in the BINARY_INTEGER datatype\\nDBMS_CRYPTO.RANDOMNUMBER --produces integer in the NUMBER datatype in the range of [0..2**128-1]\\n\",\n \"language\": \"PL-SQL\"\n },\n {\n \"code\": \"typedef unsigned long long u8;\\ntypedef struct ranctx { u8 a; u8 b; u8 c; u8 d; } ranctx;\\n\\n#define rot(x,k) (((x)<<(k))|((x)>>(64-(k))))\\nu8 ranval( ranctx *x ) {\\n u8 e = x->a - rot(x->b, 7);\\n x->a = x->b ^ rot(x->c, 13);\\n x->b = x->c + rot(x->d, 37);\\n x->c = x->d + e;\\n x->d = e + x->a;\\n return x->d;\\n}\\n\\nvoid raninit( ranctx *x, u8 seed ) {\\n u8 i;\\n x->a = 0xf1ea5eed, x->b = x->c = x->d = seed;\\n for (i=0; i<20; ++i) {\\n (void)ranval(x);\\n }\\n}\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"?RNG\\nhelp.search(\\\"Distribution\\\", package=\\\"stats\\\")\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"import util::Math;\\narbInt(int limit); // generates an arbitrary integer below limit\\narbRat(int limit, int limit); // generates an arbitrary rational number between the limits\\narbReal(); // generates an arbitrary real value in the interval [0.0, 1.0]\\narbSeed(int seed);\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"rascal>import List;\\nok\\nrascal>getOneFrom([\\\"zebra\\\", \\\"elephant\\\", \\\"snake\\\", \\\"owl\\\"]);\\nstr: \\\"owl\\\"\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \" /*(below) returns a random integer between 100 & 200, inclusive.*/\\n\\ny = random(100, 200)\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"call random ,,44 /*the seed in this case is \\\"44\\\". */\\n .\\n .\\n .\\ny = random(100, 200)\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/* REXX ***************************************************************\\n* 08.09.2013 Walter Pachl\\n* Please add the output from other REXXes\\n* 10.09.2013 Walter Pachl added REXX/TSO\\n* 01.08.2014 Walter Pachl show what ooRexx supports\\n**********************************************************************/\\nParse Version v\\nCall random ,,44\\nol=v':'\\nDo i=1 To 10\\n ol=ol random(1,10)\\n End\\nIf left(v,11)='REXX-ooRexx' Then\\n ol=ol random(-999999999,0) /* ooRexx supports negative limits */\\nSay ol\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"nr = 10\\nfor i = 1 to nr\\n see random(i) + nl\\nnext\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"rmd(0)\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"import scala.util.Random\\n\\n/**\\n * Histogram of 200 throws with two dices.\\n */\\nobject Throws extends App {\\n Stream.continually(Random.nextInt(6) + Random.nextInt(6) + 2)\\n .take(200).groupBy(identity).toList.sortBy(_._1)\\n .foreach {\\n case (a, b) => println(f\\\"$a%2d:\\\" + \\\"X\\\" * b.size)\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"say 1.rand # random float in the interval [0,1)\\nsay 100.irand # random integer in the interval [0,100)\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"rand\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \" echo $RANDOM\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"include c:\\\\cxpl\\\\codes; \\\\intrinsic 'code' declarations\\nint I;\\n[RanSeed(12345); \\\\set random number generator seed to 12345\\nfor I:= 1 to 5 do\\n [IntOut(0, Ran(1_000_000)); CrLf(0)];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"ld a,r\\n\",\n \"language\": \"Z80-Assembly\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Random-number-generator-included-"}}},{"rowIdx":1557,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Probability and statistics\n- Randomness\nfrom: http://rosettacode.org/wiki/Random_numbers\nnote: Basic language learning\n","language":"00-META"},{"code":";Task:\nGenerate a collection filled with '''1000''' normally distributed random (or pseudo-random) numbers \nwith a mean of '''1.0''' and a [[wp:Standard_deviation|standard deviation]] of '''0.5'''\n\nMany libraries only generate uniformly distributed random numbers. If so, you may use [[wp:Normal_distribution#Generating_values_from_normal_distribution|one of these algorithms]].\n\n;Related task:\n* [[Standard deviation]]\n<br><br>\n\n","language":"00-TASK"},{"code":"with Ada.Numerics; use Ada.Numerics;\nwith Ada.Numerics.Float_Random; use Ada.Numerics.Float_Random;\nwith Ada.Numerics.Elementary_Functions; use Ada.Numerics.Elementary_Functions;\n\nprocedure Normal_Random is\n function Normal_Distribution\n ( Seed : Generator;\n Mu : Float := 1.0;\n Sigma : Float := 0.5\n ) return Float is\n begin\n return\n Mu + (Sigma * Sqrt (-2.0 * Log (Random (Seed), 10.0)) * Cos (2.0 * Pi * Random (Seed)));\n end Normal_Distribution;\n\n Seed : Generator;\n Distribution : array (1..1_000) of Float;\nbegin\n Reset (Seed);\n for I in Distribution'Range loop\n Distribution (I) := Normal_Distribution (Seed);\n end loop;\nend Normal_Random;\n","language":"Ada"},{"code":"PROC random normal = REAL: # normal distribution, centered on 0, std dev 1 #\n(\n sqrt(-2*log(random)) * cos(2*pi*random)\n);\n\ntest:(\n [1000]REAL rands;\n FOR i TO UPB rands DO\n rands[i] := 1 + random normal/2\n OD;\n INT limit=10;\n printf(($\"(\"n(limit-1)(-d.6d\",\")-d.5d\" ... )\"$, rands[:limit]))\n)\n","language":"ALGOL-68"},{"code":"rnd: function []-> (random 0 10000)//10000\n\nrands: map 1..1000 'x [\n 1 + (sqrt neg 2 * ln rnd) * (cos 2 * pi * rnd)\n]\n\nprint rands\n","language":"Arturo"},{"code":"Loop 40\n R .= RandN(1,0.5) \"`n\" ; mean = 1.0, standard deviation = 0.5\nMsgBox %R%\n\nRandN(m,s) { ; Normally distributed random numbers of mean = m, std.dev = s by Box-Muller method\n Static i, Y\n If (i := !i) { ; every other call\n Random U, 0, 1.0\n Random V, 0, 6.2831853071795862\n U := sqrt(-2*ln(U))*s\n Y := m + U*sin(V)\n Return m + U*cos(V)\n }\n Return Y\n}\n","language":"AutoHotkey"},{"code":"Method \"U(_,_)\" is\n[\n\tlower : number,\n\tupper : number\n|\n\tdivisor ::= ((1<<32)) ÷ (upper - lower)→double;\n\tmap a pRNG through [i : integer | (i ÷ divisor) + lower]\n];\n\nMethod \"a Marsaglia polar sampler\" is\n[\n\tgenerator for\n\t\t[\n\t\t\tyield : [double]→⊤\n\t\t|\n\t\t\tsource ::= U(-1, 1);\n\t\t\tRepeat [\n\t\t\t\tx ::= take 1 from source[1];\n\t\t\t\ty ::= take 1 from source[1];\n\t\t\t\ts ::= x^2 + y^2;\n\t\t\t\tIf 0 < s < 1 then\n\t\t\t\t[\n\t\t\t\t\tfactor ::= ((-2 × ln s) ÷ s) ^ 0.5;\n\t\t\t\t\tyield(x × factor);\n\t\t\t\t\tyield(y × factor);\n\t\t\t\t];\n\t\t\t]\n\t\t]\n];\n\n// the default distribution has mean 0 and std dev 1.0, so we scale the values\nsampler ::= map a Marsaglia polar sampler through [d : double | d ÷ 2.0 + 1.0];\nvalues ::= take 1000 from sampler;\n","language":"Avail"},{"code":"$ awk 'func r(){return sqrt(-2*log(rand()))*cos(6.2831853*rand())}BEGIN{for(i=0;i<1000;i++)s=s\" \"1+0.5*r();print s}'\n","language":"AWK"},{"code":"function r() {\n return sqrt( -2*log( rand() ) ) * cos(6.2831853*rand() )\n}\n\nBEGIN {\n n=1000\n for(i=0;i<n;i++) {\n x = 1 + 0.5*r()\n s = s\" \"x\n }\n print s\n}\n","language":"AWK"},{"code":"# Generates normally distributed random numbers with mean 0 and standard deviation 1\nfunction randomNormal()\n\treturn cos(2.0 * pi * rand) * sqr(-2.0 * log(rand))\nend function\n\ndim r(1000)\nsum = 0.0\n# Generate 1000 normally distributed random numbers\n# with mean 1 and standard deviation 0.5\n# and calculate their sum\nfor i = 0 to 999\n\tr[i] = 1.0 + randomNormal() / 2.0\n\tsum += r[i]\nnext i\n\nmean = sum / 1000.0\nsum = 0.0\n# Now calculate their standard deviation\nfor i = 0 to 999\n\tsum += (r[i] - mean) ^ 2.0\nnext i\nsd = sqr(sum/1000.0)\n\nprint \"Mean is \"; mean\nprint \"Standard Deviation is \"; sd\nend\n","language":"BASIC256"},{"code":" DIM array(999)\n FOR number% = 0 TO 999\n array(number%) = 1.0 + 0.5 * SQR(-2*LN(RND(1))) * COS(2*PI*RND(1))\n NEXT\n\n mean = SUM(array()) / (DIM(array(),1) + 1)\n array() -= mean\n stdev = MOD(array()) / SQR(DIM(array(),1) + 1)\n\n PRINT \"Mean = \" ; mean\n PRINT \"Standard deviation = \" ; stdev\n","language":"BBC-BASIC"},{"code":"#include <stdlib.h>\n#include <math.h>\n#ifndef M_PI\n#define M_PI 3.14159265358979323846\n#endif\n\ndouble drand() /* uniform distribution, (0..1] */\n{\n return (rand()+1.0)/(RAND_MAX+1.0);\n}\ndouble random_normal() /* normal distribution, centered on 0, std dev 1 */\n{\n return sqrt(-2*log(drand())) * cos(2*M_PI*drand());\n}\nint main()\n{\n int i;\n double rands[1000];\n for (i=0; i<1000; i++)\n rands[i] = 1.0 + 0.5*random_normal();\n return 0;\n}\n","language":"C"},{"code":"#include <random>\n#include <functional>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main()\n{\n random_device seed;\n mt19937 engine(seed());\n normal_distribution<double> dist(1.0, 0.5);\n auto rnd = bind(dist, engine);\n\n vector<double> v(1000);\n generate(v.begin(), v.end(), rnd);\n return 0;\n}\n","language":"C++"},{"code":"#include <cstdlib> // for rand\n#include <cmath> // for atan, sqrt, log, cos\n#include <algorithm> // for generate_n\n\ndouble const pi = 4*std::atan(1.0);\n\n// simple functor for normal distribution\nclass normal_distribution\n{\npublic:\n normal_distribution(double m, double s): mu(m), sigma(s) {}\n double operator() const // returns a single normally distributed number\n {\n double r1 = (std::rand() + 1.0)/(RAND_MAX + 1.0); // gives equal distribution in (0, 1]\n double r2 = (std::rand() + 1.0)/(RAND_MAX + 1.0);\n return mu + sigma * std::sqrt(-2*std::log(r1))*std::cos(2*pi*r2);\n }\nprivate:\n const double mu, sigma;\n};\n\nint main()\n{\n double array[1000];\n std::generate_n(array, 1000, normal_distribution(1.0, 0.5));\n return 0;\n}\n","language":"C++"},{"code":"#include <vector>\n#include \"boost/random.hpp\"\n#include \"boost/generator_iterator.hpp\"\n#include <boost/random/normal_distribution.hpp>\n#include <algorithm>\n\ntypedef boost::mt19937 RNGType; ///< mersenne twister generator\n\nint main() {\n RNGType rng;\n boost::normal_distribution<> rdist(1.0,0.5); /**< normal distribution\n with mean of 1.0 and standard deviation of 0.5 */\n\n boost::variate_generator< RNGType, boost::normal_distribution<> >\n get_rand(rng, rdist);\n\n std::vector<double> v(1000);\n generate(v.begin(),v.end(),get_rand);\n return 0;\n}\n","language":"C++"},{"code":"private static double randomNormal()\n{\n\treturn Math.Cos(2 * Math.PI * tRand.NextDouble()) * Math.Sqrt(-2 * Math.Log(tRand.NextDouble()));\n}\n","language":"C-sharp"},{"code":"static Random tRand = new Random();\n\nstatic void Main(string[] args)\n{\n\tdouble[] a = new double[1000];\n\n\tdouble tAvg = 0;\n\tfor (int x = 0; x < a.Length; x++)\n\t{\n\t\ta[x] = randomNormal() / 2 + 1;\n\t\ttAvg += a[x];\n\t}\n\n\ttAvg /= a.Length;\n\tConsole.WriteLine(\"Average: \" + tAvg.ToString());\n\n\tdouble s = 0;\n\tfor (int x = 0; x < a.Length; x++)\n\t{\n\t\ts += Math.Pow((a[x] - tAvg), 2);\n\t}\n\ts = Math.Sqrt(s / 1000);\n\n\tConsole.WriteLine(\"Standard Deviation: \" + s.ToString());\n\n\tConsole.ReadLine();\n}\n","language":"C-sharp"},{"code":"10 ' Random numbers\n20 randomize timer\n30 dim r(999)\n40 sum = 0\n50 for i = 0 to 999\n60 r(i) = 1+randomnormal()/2\n70 sum = sum+r(i)\n80 next\n90 mean = sum/1000\n100 sum = 0\n110 for i = 0 to 999\n120 sum = sum+(r(i)-mean)^2\n130 next\n140 sd = sqr(sum/1000)\n150 print \"Mean is \";mean\n160 print \"Standard Deviation is \";sd\n170 print\n180 end\n\n500 sub randomnormal()\n510 randomnormal = cos(2*pi*rnd(1))*sqr(-2*log(rnd(1)))\n520 end sub\n","language":"Chipmunk-Basic"},{"code":"(import '(java.util Random))\n(def normals\n (let [r (Random.)]\n (take 1000 (repeatedly #(-> r .nextGaussian (* 0.5) (+ 1.0))))))\n","language":"Clojure"},{"code":" IDENTIFICATION DIVISION.\n PROGRAM-ID. RANDOM.\n AUTHOR. Bill Gunshannon\n INSTALLATION. Home.\n DATE-WRITTEN. 14 January 2022.\n ************************************************************\n ** Program Abstract:\n ** Able to get the Mean to be really close to 1.0 but\n ** couldn't get the Standard Deviation any closer than\n ** .3 to .4.\n ************************************************************\n\n DATA DIVISION.\n\n WORKING-STORAGE SECTION.\n\n 01 Sample-Size PIC 9(5) VALUE 1000.\n 01 Total PIC 9(10)V9(5) VALUE 0.0.\n 01 Arith-Mean PIC 999V999 VALUE 0.0.\n 01 Std-Dev PIC 999V999 VALUE 0.0.\n 01 Seed PIC 999V999.\n 01 TI PIC 9(8).\n\n 01 Idx PIC 99999 VALUE 0.\n 01 Intermediate PIC 9(10)V9(5) VALUE 0.0.\n 01 Rnd-Work.\n 05 Rnd-Tbl\n OCCURS 1 TO 99999 TIMES DEPENDING ON Sample-Size.\n 10 Rnd PIC 9V9999999 VALUE 0.0.\n\n PROCEDURE DIVISION.\n\n Main-Program.\n ACCEPT TI FROM TIME.\n MOVE FUNCTION RANDOM(TI) TO Seed.\n PERFORM WITH TEST AFTER VARYING Idx\n FROM 1 BY 1\n UNTIL Idx = Sample-Size\n COMPUTE Intermediate =\n (FUNCTION RANDOM() * 2.01)\n MOVE Intermediate TO Rnd(Idx)\n END-PERFORM.\n PERFORM WITH TEST AFTER VARYING Idx\n FROM 1 BY 1\n UNTIL Idx = Sample-Size\n COMPUTE Total = Total + Rnd(Idx)\n END-PERFORM.\n\n\n COMPUTE Arith-Mean = Total / Sample-Size.\n DISPLAY \"Mean: \" Arith-Mean.\n\n\n PERFORM WITH TEST AFTER VARYING Idx\n FROM 1 BY 1\n UNTIL Idx = Sample-Size\n COMPUTE Intermediate =\n Intermediate + (Rnd(Idx) - Arith-Mean) ** 2\n END-PERFORM.\n COMPUTE Std-Dev = Intermediate / Sample-Size.\n\n\n DISPLAY \"Std-Dev: \" Std-Dev.\n\n STOP RUN.\n\n END PROGRAM RANDOM.\n","language":"COBOL"},{"code":"10 DIM AR(999): DIM DE(999)\n20 FOR N = 0 TO 999\n30 AR(N)= 0 + SQR(-1.3*LOG(RND(1))) * COS(1.2*PI*RND(1))\n40 NEXT N\n50 :\n60 REM SUM\n70 LET SU = 0\n80 FOR N = 0 TO 999\n90 LET SU = SU + AR(N)\n100 NEXT N\n110 :\n120 REM MEAN\n130 LET ME= 0\n140 LET ME = SU/1000\n150 :\n160 REM DEVIATION\n170 FOR N = 0 TO 999\n180 T = AR(N)-ME: REM SUBTRACT MEAN FROM NUMBER\n190 T = T * T: REM SQUARE THE RESULT\n200 DE(N) = T : REM STORE IN DEVIATION ARRAY\n210 NEXT N\n220 LET DS=0: REM SUM OF DEVIATION ARRAY\n230 FOR N = 0 TO 999\n240 LET DS = DS + DE(N)\n250 NEXT N\n260 LET DM=0: REM MEAN OF DEVIATION ARRAY\n270 LET DM = DS / 1000\n280 LET DE = 0:\n290 LET DE = SQR(DM)\n300 :\n310 PRINT \"MEAN = \"ME\n320 PRINT \"STANDARD DEVIATION =\"DE\n330 END\n","language":"Commodore-BASIC"},{"code":"(loop for i from 1 to 1000\n collect (1+ (* (sqrt (* -2 (log (random 1.0)))) (cos (* 2 pi (random 1.0))) 0.5)))\n","language":"Common-Lisp"},{"code":"n, mean, sd, tau = 1000, 1, 0.5, (2 * Math::PI)\narray = Array.new(n) { mean + sd * Math.sqrt(-2 * Math.log(rand)) * Math.cos(tau * rand) }\n\nmean = array.sum / array.size\nstandev = Math.sqrt( array.sum{ |x| (x - mean) ** 2 } / array.size )\nputs \"mean = #{mean}, standard deviation = #{standev}\"\n","language":"Crystal"},{"code":"import std.stdio, std.random, std.math;\n\nstruct NormalRandom {\n double mean, stdDev;\n\n // Necessary because it also defines an opCall.\n this(in double mean_, in double stdDev_) pure nothrow {\n this.mean = mean_;\n this.stdDev = stdDev_;\n }\n\n double opCall() const /*nothrow*/ {\n immutable r1 = uniform01, r2 = uniform01; // Not nothrow.\n return mean + stdDev * sqrt(-2 * r1.log) * cos(2 * PI * r2);\n }\n}\n\nvoid main() {\n double[1000] array;\n auto nRnd = NormalRandom(1.0, 0.5);\n foreach (ref x; array)\n //x = nRnd;\n x = nRnd();\n}\n","language":"D"},{"code":"import tango.math.random.Random;\n\nvoid main() {\n double[1000] list;\n auto r = new Random();\n foreach (ref l; list) {\n r.normalSource!(double)()(l);\n l = 1.0 + 0.5 * l;\n }\n}\n","language":"D"},{"code":"program Randoms;\n\n{$APPTYPE CONSOLE}\n\nuses\n Math;\n\nvar\n Values: array[0..999] of Double;\n I: Integer;\n\nbegin\n// Randomize; Commented to obtain reproducible results\n for I:= Low(Values) to High(Values) do\n Values[I]:= RandG(1.0, 0.5); // Mean = 1.0, StdDev = 0.5\n Writeln('Mean = ', Mean(Values):6:4);\n Writeln('Std Deviation = ', StdDev(Values):6:4);\n Readln;\nend.\n","language":"Delphi"},{"code":"var values : array [0..999] of Float;\nvar i : Integer;\n\nfor i := values.Low to values.High do\n values[i] := RandG(1, 0.5);\n","language":"DWScript"},{"code":"accum [] for _ in 1..1000 { _.with(entropy.nextGaussian()) }\n","language":"E"},{"code":"numfmt 5 0\ne = 2.7182818284590452354\nfor i = 1 to 1000\n a[] &= 1 + 0.5 * sqrt (-2 * log10 randomf / log10 e) * cos (360 * randomf)\n.\nfor v in a[]\n avg += v / len a[]\n.\nprint \"Average: \" & avg\nfor v in a[]\n s += pow (v - avg) 2\n.\ns = sqrt (s / len a[])\nprint \"Std deviation: \" & s\n","language":"EasyLang"},{"code":"class\n\tAPPLICATION\n\ninherit\n\tARGUMENTS\n\ncreate\n\tmake\n\nfeature {NONE} -- Initialization\n\n\tl_time: TIME\n\tl_seed: INTEGER\n\tmath:DOUBLE_MATH\n\trnd:RANDOM\n\tSize:INTEGER\n\t\tonce\n\t\t\tResult:= 1000\n\t\tend\n\n\tmake\n\t\t\t-- Run application.\n\t\tlocal\n\t\t\tergebnis:ARRAY[DOUBLE]\n\t\t\ttavg: DOUBLE\n\t\t\tx: INTEGER\n\t\t\ttmp: DOUBLE\n\t\t\ttext : STRING\n\n\t\tdo\n\t\t\t-- initialize random generator\n\t\t\tcreate l_time.make_now\n \t\t l_seed := l_time.hour\n \t\t l_seed := l_seed * 60 + l_time.minute\n \t\t l_seed := l_seed * 60 + l_time.second\n \t\t l_seed := l_seed * 1000 + l_time.milli_second\n \t\t create rnd.set_seed (l_seed)\n\n\t\t\t-- initialize random number container and math\n\t\t\tcreate ergebnis.make_filled (0.0, 1, size)\n\t\t\ttavg := 0;\n\t\t\tcreate math\n\n\t\t\tfrom\n\t\t\t\tx := 1\n\t\t\tuntil\n\t\t\t\tx > ergebnis.count\n\t\t\tloop\n\t\t\t\ttmp := randomNormal / 2 + 1\n\t\t\t\ttavg := tavg + tmp\n\t\t\t\tergebnis.enter (tmp , x)\n\t\t\t\tx := x + 1\n\t\t\tend\n\n\t\t\ttavg := tavg / ergebnis.count\n\t\t\ttext := \"Average: \"\n\t\t\ttext.append_double (tavg)\n\t\t\ttext.append (\"%N\")\n\t\t\tprint(text)\n\n\t\t\ttmp := 0\n\t\t\tfrom\n\t\t\t\tx:= 1\n\t\t\tuntil\n\t\t\t\tx > ergebnis.count\n\t\t\tloop\n\t\t\t\ttmp := tmp + (ergebnis.item (x) - tavg)^2\n\t\t\t\tx := x + 1\n\t\t\tend\n\n\t\t\ttmp := math.sqrt (tmp / ergebnis.count)\n\t\t\ttext := \"Standard Deviation: \"\n\t\t\ttext.append_double (tmp)\n\t\t\ttext.append (\"%N\")\n\t\t\tprint(text)\n\n\t\tend\n\n\trandomNormal:DOUBLE\n\n\t\tlocal\n\n \t\t first: DOUBLE\n \t\t second: DOUBLE\n\n\t\tdo\n rnd.forth\n first := rnd.double_item\n rnd.forth\n second := rnd.double_item\n\n Result := math.cosine (2 * math.pi * first) * math.sqrt (-2 * math.log (second))\n\n\t\tend\nend\n","language":"Eiffel"},{"code":"import extensions;\nimport extensions'math;\n\nrandomNormal()\n{\n ^ cos(2 * Pi_value * randomGenerator.nextReal())\n * sqrt(-2 * ln(randomGenerator.nextReal()))\n}\n\npublic program()\n{\n real[] a := new real[](1000);\n\n real tAvg := 0;\n for (int x := 0; x < a.Length; x += 1)\n {\n a[x] := (randomNormal()) / 2 + 1;\n tAvg += a[x]\n };\n\n tAvg /= a.Length;\n console.printLine(\"Average: \", tAvg);\n\n real s := 0;\n for (int x := 0; x < a.Length; x += 1)\n {\n s += power(a[x] - tAvg, 2)\n };\n\n s := sqrt(s / 1000);\n\n console.printLine(\"Standard Deviation: \", s);\n\n console.readChar()\n}\n","language":"Elena"},{"code":"defmodule Random do\n def normal(mean, sd) do\n {a, b} = {:rand.uniform, :rand.uniform}\n mean + sd * (:math.sqrt(-2 * :math.log(a)) * :math.cos(2 * :math.pi * b))\n end\nend\n\nstd_dev = fn (list) ->\n mean = Enum.sum(list) / length(list)\n sd = Enum.reduce(list, 0, fn x,acc -> acc + (x-mean)*(x-mean) end) / length(list)\n |> :math.sqrt\n IO.puts \"Mean: #{mean},\\tStdDev: #{sd}\"\n end\n\nxs = for _ <- 1..1000, do: Random.normal(1.0, 0.5)\nstd_dev.(xs)\n","language":"Elixir"},{"code":"xs = for _ <- 1..1000, do: 1.0 + :rand.normal * 0.5\nstd_dev.(xs)\n","language":"Elixir"},{"code":"mean(Values) ->\n mean(tl(Values), hd(Values), 1).\n\nmean([], Acc, Length) ->\n Acc / Length;\nmean(Values, Acc, Length) ->\n mean(tl(Values), hd(Values)+Acc, Length+1).\n\nvariance(Values) ->\n Mean = mean(Values),\n variance(Values, Mean, 0) / length(Values).\n\nvariance([], _, Acc) ->\n Acc;\nvariance(Values, Mean, Acc) ->\n Diff = hd(Values) - Mean,\n DiffSqr = Diff * Diff,\n variance(tl(Values), Mean, Acc + DiffSqr).\n\nstddev(Values) ->\n math:sqrt(variance(Values)).\n\nnormal(Mean, StdDev) ->\n U = random:uniform(),\n V = random:uniform(),\n Mean + StdDev * ( math:sqrt(-2 * math:log(U)) * math:cos(2 * math:pi() * V) ). % Erlang's math:log is the natural logarithm.\n\nmain(_) ->\n X = [ normal(1.0, 0.5) || _ <- lists:seq(1, 1000) ],\n io:format(\"mean = ~w\\n\", [mean(X)]),\n io:format(\"stddev = ~w\\n\", [stddev(X)]).\n","language":"Erlang"},{"code":"PROGRAM DISTRIBUTION\n\n!\n! for rosettacode.org\n!\n\n! formulas taken from TI-59 Master Library manual\n\nCONST NUM_ITEM=1000\n\n!VAR SUMX#,SUMX2#,R1#,R2#,Z#,I%\n\nDIM A#[1000]\n\nBEGIN\n! seeds random number generator with system time\n RANDOMIZE(TIMER)\n\n PRINT(CHR$(12);) !CLS\n SUMX#=0 SUMX2#=0\n\n FOR I%=1 TO NUM_ITEM DO\n R1#=RND(1) R2#=RND(1)\n Z#=SQR(-2*LOG(R1#))*COS(2*π*R2#)\n A#[I%]=Z#/2+1 ! I want a normal distribution with\n ! mean=1 and std.dev=0.5\n SUMX#+=A#[I%] SUMX2#+=A#[I%]*A#[I%]\n END FOR\n\n Z#=SUMX#/NUM_ITEM\n\n PRINT(\"Average is\";Z#)\n PRINT(\"Standard dev. is\";SQR(SUMX2#/NUM_ITEM-Z#*Z#))\n\nEND PROGRAM\n","language":"ERRE"},{"code":">v=normal(1,1000)*0.5+1;\n>mean(v), dev(v)\n 1.00291801071\n 0.498226876528\n","language":"Euler"},{"code":"include misc.e\n\nfunction RandomNormal()\n atom x1, x2\n x1 = rand(999999) / 1000000\n x2 = rand(999999) / 1000000\n return sqrt(-2*log(x1)) * cos(2*PI*x2)\nend function\n\nconstant n = 1000\nsequence s\ns = repeat(0,n)\nfor i = 1 to n do\n s[i] = 1 + 0.5 * RandomNormal()\nend for\n","language":"Euphoria"},{"code":"let n = MathNet.Numerics.Distributions.Normal(1.0,0.5)\nList.init 1000 (fun _->n.Sample())\n","language":"F-Sharp"},{"code":"let gaussianRand count =\n let o = new System.Random()\n let pi = System.Math.PI\n let gaussrnd =\n (fun _ -> 1. + 0.5 * sqrt(-2. * log(o.NextDouble())) * cos(2. * pi * o.NextDouble()))\n [ for i in {0 .. (int count)} -> gaussrnd() ]\n","language":"F-Sharp"},{"code":"USING: random ;\n1000 [ 1.0 0.5 normal-random-float ] replicate\n","language":"Factor"},{"code":"a = []\nfor i in [0:1000] : a+= norm_rand_num()\n\nfunction norm_rand_num()\n pi = 2*acos(0)\n return 1 + (cos(2 * pi * random()) * pow(-2 * log(random()) ,1/2)) /2\nend\n","language":"Falcon"},{"code":"class Main\n{\n static const Float PI := 0.0f.acos * 2 // we need to precompute PI\n\n static Float randomNormal ()\n {\n return (Float.random * PI * 2).cos * (Float.random.log * -2).sqrt\n }\n\n public static Void main ()\n {\n mean := 1.0f\n sd := 0.5f\n Float[] values := [,] // this is the collection to fill with random numbers\n 1000.times { values.add (randomNormal * sd + mean) }\n }\n}\n","language":"Fantom"},{"code":"using [java] java.util::Random\n\nclass Main\n{\n Random generator := Random()\n\n Float randomNormal ()\n {\n return generator.nextGaussian\n }\n\n public static Void main ()\n {\n rnd := Main() // create an instance of Main class, which holds the generator\n mean := 1.0f\n sd := 0.5f\n Float[] values := [,] // this is the collection to fill with random numbers\n 1000.times { values.add (rnd.randomNormal * sd + mean) }\n }\n}\n","language":"Fantom"},{"code":"require random.fs\nhere to seed\n\n-1. 1 rshift 2constant MAX-D\t\\ or s\" MAX-D\" ENVIRONMENT? drop\n\n: frnd ( -- f )\t\t\t\\ uniform distribution 0..1\n rnd rnd dabs d>f MAX-D d>f f/ ;\n\n: frnd-normal ( -- f )\t\t\\ centered on 0, std dev 1\n frnd pi f* 2e f* fcos\n frnd fln -2e f* fsqrt f* ;\n\n: ,normals ( n -- )\t\t\\ store many, centered on 1, std dev 0.5\n 0 do frnd-normal 0.5e f* 1e f+ f, loop ;\n\ncreate rnd-array 1000 ,normals\n","language":"Forth"},{"code":"rnd rnd dabs d>f\n","language":"Forth"},{"code":"PROGRAM Random\n\n INTEGER, PARAMETER :: n = 1000\n INTEGER :: i\n REAL :: array(n), pi, temp, mean = 1.0, sd = 0.5\n\n pi = 4.0*ATAN(1.0)\n CALL RANDOM_NUMBER(array) ! Uniform distribution\n\n! Now convert to normal distribution\n DO i = 1, n-1, 2\n temp = sd * SQRT(-2.0*LOG(array(i))) * COS(2*pi*array(i+1)) + mean\n array(i+1) = sd * SQRT(-2.0*LOG(array(i))) * SIN(2*pi*array(i+1)) + mean\n array(i) = temp\n END DO\n\n! Check mean and standard deviation\n mean = SUM(array)/n\n sd = SQRT(SUM((array - mean)**2)/n)\n\n WRITE(*, \"(A,F8.6)\") \"Mean = \", mean\n WRITE(*, \"(A,F8.6)\") \"Standard Deviation = \", sd\n\nEND PROGRAM Random\n","language":"Fortran"},{"code":"function randg(mean,stddev: float): float;\n","language":"Free-Pascal-Lazarus"},{"code":"' FB 1.05.0 Win64\n\nConst pi As Double = 3.141592653589793\nRandomize\n\n' Generates normally distributed random numbers with mean 0 and standard deviation 1\nFunction randomNormal() As Double\n Return Cos(2.0 * pi * Rnd) * Sqr(-2.0 * Log(Rnd))\nEnd Function\n\nDim r(0 To 999) As Double\nDim sum As Double = 0.0\n\n' Generate 1000 normally distributed random numbers\n' with mean 1 and standard deviation 0.5\n' and calculate their sum\nFor i As Integer = 0 To 999\n r(i) = 1.0 + randomNormal/2.0\n sum += r(i)\nNext\n\nDim mean As Double = sum / 1000.0\n\nDim sd As Double\nsum = 0.0\n' Now calculate their standard deviation\nFor i As Integer = 0 To 999\n sum += (r(i) - mean) ^ 2.0\nNext\nsd = Sqr(sum/1000.0)\n\nPrint \"Mean is \"; mean\nPrint \"Standard Deviation is\"; sd\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"a = new array[[1000], {|x| randomGaussian[1, 0.5]}]\n","language":"Frink"},{"code":"window 1\n\nlocal fn RandomZeroToOne as double\n double result\n cln result = (double)( (rand() % 100000 ) * 0.00001 );\nend fn = result\n\nlocal fn RandomGaussian as double\n double r = fn RandomZeroToOne\nend fn = 1 + .5 * ( sqr( -2 * log(r) ) * cos( 2 * pi * r ) )\n\nlong i\ndouble mean, std, a(1000)\n\nfor i = 1 to 1000\n a(i) = fn RandomGaussian\n mean += a(i)\nnext\nmean = mean / 1000\n\nfor i = 1 to 1000\n std += ( a(i) - mean )^2\nnext\nstd = std / 1000\n\nprint \" Average: \"; mean\nprint \"Standard Deviation: \"; std\n\nHandleEvents\n","language":"FutureBasic"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n \"math/rand\"\n \"strings\"\n \"time\"\n)\n\nconst mean = 1.0\nconst stdv = .5\nconst n = 1000\n\nfunc main() {\n var list [n]float64\n rand.Seed(time.Now().UnixNano())\n for i := range list {\n list[i] = mean + stdv*rand.NormFloat64()\n }\n // show computed mean and stdv of list\n var s, sq float64\n for _, v := range list {\n s += v\n }\n cm := s / n\n for _, v := range list {\n d := v - cm\n sq += d * d\n }\n fmt.Printf(\"mean %.3f, stdv %.3f\\n\", cm, math.Sqrt(sq/(n-1)))\n // show histogram by hdiv divisions per stdv over +/-hrange stdv\n const hdiv = 3\n const hrange = 2\n var h [1 + 2*hrange*hdiv]int\n for _, v := range list {\n bin := hrange*hdiv + int(math.Floor((v-mean)/stdv*hdiv+.5))\n if bin >= 0 && bin < len(h) {\n h[bin]++\n }\n }\n const hscale = 10\n for _, c := range h {\n fmt.Println(strings.Repeat(\"*\", (c+hscale/2)/hscale))\n }\n}\n","language":"Go"},{"code":"rnd = new Random()\nresult = (1..1000).inject([]) { r, i -> r << rnd.nextGaussian() }\n","language":"Groovy"},{"code":"import System.Random\n\npairs :: [a] -> [(a,a)]\npairs (x:y:zs) = (x,y):pairs zs\npairs _ = []\n\ngauss mu sigma (r1,r2) =\n mu + sigma * sqrt (-2 * log r1) * cos (2 * pi * r2)\n\ngaussians :: (RandomGen g, Random a, Floating a) => Int -> g -> [a]\ngaussians n g = take n $ map (gauss 1.0 0.5) $ pairs $ randoms g\n\nresult :: IO [Double]\nresult = getStdGen >>= \\g -> return $ gaussians 1000 g\n","language":"Haskell"},{"code":"replicateM 1000 $ normal 1 0.5\n","language":"Haskell"},{"code":"import Data.Random\nimport Control.Monad\n\nthousandRandomNumbers :: RVar [Double]\nthousandRandomNumbers = replicateM 1000 $ normal 1 0.5\n\nmain = do\n x <- sample thousandRandomNumbers\n print x\n","language":"Haskell"},{"code":"REAL :: n=1000, m=1, s=0.5, array(n)\n\npi = 4 * ATAN(1)\narray = s * (-2*LOG(RAN(1)))^0.5 * COS(2*pi*RAN(1)) + m\n","language":"HicEst"},{"code":"procedure main()\n local L\n L := list(1000)\n every L[1 to 1000] := 1.0 + 0.5 * sqrt(-2.0 * log(?0)) * cos(2.0 * &pi * ?0)\n\n every write(!L)\nend\n","language":"Icon"},{"code":"result = 1.0 + 0.5*randomn(seed,1000)\n","language":"IDL"},{"code":"urand=: ?@$ 0:\nzrand=: (2 o. 2p1 * urand) * [: %: _2 * [: ^. urand\n\n1 + 0.5 * zrand 100\n","language":"J"},{"code":" require 'stats/distribs/normal'\n 1 0.5 rnorm 1000\n1.44868803 1.21548637 0.812460657 1.54295452 1.2470606 ...\n","language":"J"},{"code":"double[] list = new double[1000];\ndouble mean = 1.0, std = 0.5;\nRandom rng = new Random();\nfor(int i = 0;i<list.length;i++) {\n list[i] = mean + std * rng.nextGaussian();\n}\n","language":"Java"},{"code":"function randomNormal() {\n return Math.cos(2 * Math.PI * Math.random()) * Math.sqrt(-2 * Math.log(Math.random()))\n}\n\nvar a = []\nfor (var i=0; i < 1000; i++){\n a[i] = randomNormal() / 2 + 1\n}\n","language":"JavaScript"},{"code":"# 15-bit integers generated using the same formula as rand() from the Microsoft C Runtime.\n# The random numbers are in [0 -- 32767] inclusive.\n# Input: an array of length at least 2 interpreted as [count, state, ...]\n# Output: [count+1, newstate, r] where r is the next pseudo-random number.\ndef next_rand_Microsoft:\n .[0] as $count | .[1] as $state\n | ( (214013 * $state) + 2531011) % 2147483648 # mod 2^31\n | [$count+1 , ., (. / 65536 | floor) ] ;\n","language":"Jq"},{"code":"# Generate a single number following the normal distribution with mean 0, variance 1,\n# using the Box-Muller method: X = sqrt(-2 ln U) * cos(2 pi V) where U and V are uniform on [0,1].\n# Input: [n, state]\n# Output [n+1, nextstate, r]\ndef next_rand_normal:\n def u: next_rand_Microsoft | .[2] /= 32767;\n u as $u1\n | ($u1 | u) as $u2\n | ((( (8*(1|atan)) * $u1[2]) | cos)\n * ((-2 * (($u2[2]) | log)) | sqrt)) as $r\n | [ (.[0]+1), $u2[1], $r] ;\n\n# Generate \"count\" arrays, each containing a random normal variate with the given mean and standard deviation.\n# Input: [count, state]\n# Output: [updatedcount, updatedstate, rnv]\n# where \"state\" is a seed and \"updatedstate\" can be used as a seed.\ndef random_normal_variate(mean; sd; count):\n next_rand_normal\n | recurse( if .[0] < count then next_rand_normal else empty end)\n | .[2] = (.[2] * sd) + mean;\n","language":"Jq"},{"code":"def summary:\n length as $l | add as $sum | ($sum/$l) as $a\n | reduce .[] as $x (0; . + ( ($x - $a) | .*. ))\n | [ $a, (./$l | sqrt)] ;\n\n[ [0,1] | random_normal_variate(1; 0.5; 1000) | .[2] ] | summary\n","language":"Jq"},{"code":"randn(1000) * 0.5 + 1\n","language":"Julia"},{"code":"// version 1.0.6\n\nimport java.util.Random\n\nfun main(args: Array<String>) {\n val r = Random()\n val da = DoubleArray(1000)\n for (i in 0 until 1000) da[i] = 1.0 + 0.5 * r.nextGaussian()\n // now check actual mean and SD\n val mean = da.average()\n val sd = Math.sqrt(da.map { (it - mean) * (it - mean) }.average())\n println(\"Mean is $mean\")\n println(\"S.D. is $sd\")\n}\n","language":"Kotlin"},{"code":"dim a(1000)\nmean =1\nsd =0.5\nfor i = 1 to 1000 ' throw 1000 normal variates\n a( i) =mean +sd *( sqr( -2 * log( rnd( 0))) * cos( 2 * pi * rnd( 0)))\nnext i\n","language":"Liberty-BASIC"},{"code":"-- Returns a random float value in range 0..1\non randf ()\n n = random(the maxinteger)-1\n return n / float(the maxinteger-1)\nend\n","language":"Lingo"},{"code":"normal = []\nrepeat with i = 1 to 1000\n normal.add(1 + sqrt(-2 * log(randf())) * cos(2 * PI * randf()) / 2)\nend repeat\n","language":"Lingo"},{"code":"let mean = 1.0\nlet stdv = 0.5\nlet count = 1000\n\n// stats computes a running mean and variance\n// See Knuth TAOCP vol 2, 3rd edition, page 232\n\ndef stats(xs: [float]) -> float, float: // variance, mean\n var M = xs[0]\n var S = 0.0\n var n = 1.0\n for(xs.length - 1) i:\n let x = xs[i + 1]\n n = n + 1.0\n let mm = (x - M)\n M += mm / n\n S += mm * (x - M)\n return (if n > 0.0: S / n else: 0.0), M\n\ndef test_random_normal() -> [float]:\n rnd_seed(floor(seconds_elapsed() * 1000000))\n let r = vector_reserve(typeof return, count)\n for (count):\n r.push(rnd_gaussian() * stdv + mean)\n let cvar, cmean = stats(r)\n let cstdv = sqrt(cvar)\n print concat_string([\"Mean: \", string(cmean), \", Std.Deviation: \", string(cstdv)], \"\")\n\ntest_random_normal()\n","language":"Lobster"},{"code":"to random.float ; 0..1\n localmake \"max.int lshift -1 -1\n output quotient random :max.int :max.int\nend\n\nto random.gaussian\n output product cos random 360 sqrt -2 / ln random.float\nend\n\nmake \"randoms cascade 1000 [fput random.gaussian / 2 + 1 ?] []\n","language":"Logo"},{"code":"local list = {}\nfor i = 1, 1000 do\n list[i] = 1 + math.sqrt(-2 * math.log(math.random())) * math.cos(2 * math.pi * math.random()) / 2\nend\n","language":"Lua"},{"code":"Module CheckIt {\n Function StdDev (A()) {\n \\\\ A() has a copy of values\n N=Len(A())\n if N<1 then Error \"Empty Array\"\n M=Each(A())\n k=0\n \\\\ make sum, dev same type as A(k)\n sum=A(k)-A(k)\n dev=sum\n \\\\ find mean\n While M {\n sum+=Array(M)\n }\n Mean=sum/N\n \\\\ make a pointet to A()\n P=A()\n \\\\ subtruct from each item\n P-=Mean\n\n M=Each(P)\n While M {\n dev+=Array(M)*Array(M)\n }\n \\\\ as pointer to arrray\n =(if(dev>0->Sqrt(dev/N), 0), Mean)\n }\n Function randomNormal {\n \\\\ by default all numbers are double\n \\\\ cos() get degrees\n =1+Cos(360 * rnd) * Sqrt(-2 * Ln(rnd)) /2\n }\n \\\\ fill array calling randomNormal() for each item\n Dim A(1000)<<randomNormal()\n \\\\ we can pass a pointer to array and place it to stack of values\n DisplayMeanAndStdDeviation(A()) ' mean ~ 1 std deviation ~0.5\n \\\\ check M2000 rnd only\n Dim B(1000)<<rnd\n DisplayMeanAndStdDeviation(B()) ' mean ~ 0.5 std deviation ~0.28\n\n\n DisplayMeanAndStdDeviation((0,0,14,14)) ' mean = 7 std deviation = 7\n DisplayMeanAndStdDeviation((0,6,8,14)) ' mean = 7 std deviation = 5\n DisplayMeanAndStdDeviation((6,6,8,8)) ' mean = 7 std deviation = 1\n\n Sub DisplayMeanAndStdDeviation(A)\n \\\\ push to stack all items of an array (need an array pointer)\n Push ! StdDev(A)\n \\\\ read from strack two numbers\n Print \"Mean is \"; Number\n Print \"Standard Deviation is \"; Number\n End Sub\n}\nCheckit\n","language":"M2000-Interpreter"},{"code":"with(Statistics):\nSample(Normal(1, 0.5), 1000);\n","language":"Maple"},{"code":"1+0.5*ArrayTools[RandomArray](1000,1,distribution=normal);\n","language":"Maple"},{"code":"RandomReal[NormalDistribution[1, 1/2], 1000]\n","language":"Mathematica"},{"code":" mu = 1; sd = 0.5;\n x = randn(1000,1) * sd + mu;\n","language":"MATLAB"},{"code":" x = normrnd(mu, sd, [1000,1]);\n","language":"MATLAB"},{"code":"function randNum = randNorm(mu0,chi2, sz)\n\n radiusSquared = +Inf;\n\n while (radiusSquared >= 1)\n u = ( 2 * rand(sz) ) - 1;\n v = ( 2 * rand(sz) ) - 1;\n\n radiusSquared = u.^2 + v.^2;\n end\n\n scaleFactor = sqrt( ( -2*log(radiusSquared) )./ radiusSquared );\n randNum = (v .* scaleFactor .* chi2) + mu0;\n\nend\n","language":"MATLAB"},{"code":">> randNorm(1,.5, [1000,1])\n\nans =\n\n 0.693984121077029\n","language":"MATLAB"},{"code":"load(distrib)$\n\nrandom_normal(1.0, 0.5, 1000);\n","language":"Maxima"},{"code":"arr = #()\nfor i in 1 to 1000 do\n(\n a = random 0.0 1.0\n b = random 0.0 1.0\n c = 1.0 + 0.5 * sqrt (-2*log a) * cos (360*b) -- Maxscript cos takes degrees\n append arr c\n)\n","language":"MAXScript"},{"code":"numeric col[];\n\nm := 0; % m holds the mean, for testing purposes\nfor i = 1 upto 1000:\n col[i] := 1 + .5normaldeviate;\n m := m + col[i];\nendfor\n\n% testing\nm := m / 1000; % finalize the computation of the mean\n\ns := 0; % in s we compute the standard deviation\nfor i = 1 upto 1000:\n s := s + (col[i] - m)**2;\nendfor\ns := sqrt(s / 1000);\n\nshow m, s; % and let's show that really they get what we wanted\nend\n","language":"Metafont"},{"code":"10 REM Random numbers\n20 LET P = 4*ATN(1)\n30 RANDOMIZE\n40 DEF FNN = COS(2*P*RND)*SQR(-2*LOG(RND))\n50 DIM R(999)\n60 LET S = 0\n70 FOR I = 0 TO 999\n80 LET R(I) = 1+FNN/2\n90 LET S = S+R(I)\n100 NEXT I\n110 LET M = S/1000\n120 LET S = 0\n130 FOR I = 0 TO 999\n140 LET S = S+(R(I)-M)^2\n150 NEXT I\n160 LET D = SQR(S/1000)\n170 PRINT \"Mean is \"; M\n180 PRINT \"Standard Deviation is\"; D\n190 PRINT\n200 END\n","language":"Minimal-BASIC"},{"code":"randNormal = function(mean=0, stddev=1)\n return mean + sqrt(-2 * log(rnd,2.7182818284)) * cos(2*pi*rnd) * stddev\nend function\n\nx = []\nfor i in range(1,1000)\n x.push randNormal(1, 0.5)\nend for\n","language":"MiniScript"},{"code":"import java.util.Random\n\nlist = double[999]\nmean = 1.0\nstd = 0.5\nrng = Random.new\n0.upto(998) do | i |\n list[i] = mean + std * rng.nextGaussian\nend\n","language":"Mirah"},{"code":"MODULE Rand EXPORTS Main;\n\nIMPORT Random;\nFROM Math IMPORT log, cos, sqrt, Pi;\n\nVAR rands: ARRAY [1..1000] OF LONGREAL;\n\n(* Normal distribution. *)\nPROCEDURE RandNorm(): LONGREAL =\n BEGIN\n WITH rand = NEW(Random.Default).init() DO\n RETURN\n sqrt(-2.0D0 * log(rand.longreal())) * cos(2.0D0 * Pi * rand.longreal());\n END;\n END RandNorm;\n\nBEGIN\n FOR i := FIRST(rands) TO LAST(rands) DO\n rands[i] := 1.0D0 + 0.5D0 * RandNorm();\n END;\nEND Rand.\n","language":"Modula-3"},{"code":"list = {0} * 1000\nmean = 1.0; std = 0.5\nrng = new(Nanoquery.Util.Random)\n\nfor i in range(0, len(list) - 1)\n list[i] = mean + std * rng.getGaussian()\nend\n","language":"Nanoquery"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary\n\nimport java.math.BigDecimal\nimport java.math.MathContext\n\n-- prologue\nnumeric digits 20\n\n-- get input, set defaults\nparse arg dp mu sigma ec .\nif mu = '' | mu = '.' then mean = 1.0; else mean = mu\nif sigma = '' | sigma = '.' then stdDeviation = 0.5; else stdDeviation = sigma\nif dp = '' | dp = '.' then displayPrecision = 1; else displayPrecision = dp\nif ec = '' | ec = '.' then elements = 1000; else elements = ec\n\n-- set up\nRNG = Random()\nnumberList = java.util.List\nnumberList = ArrayList()\n\n-- generate list of random numbers\nloop for elements\n rn = mean + stdDeviation * RNG.nextGaussian()\n numberList.add(BigDecimal(rn, MathContext.DECIMAL128))\n end\n\n-- report\nsay \"Mean: \" mean\nsay \"Standard Deviation:\" stdDeviation\nsay \"Precision: \" displayPrecision\nsay\ndrawBellCurve(numberList, displayPrecision)\n\nreturn\n\n-- -----------------------------------------------------------------------------\nmethod drawBellCurve(numberList = java.util.List, precision) static\n Collections.sort(numberList)\n val = BigDecimal\n lastN = ''\n nextN = ''\n loop val over numberList\n nextN = Rexx(val.toPlainString()).format(5, precision)\n select\n when lastN = '' then nop\n when lastN \\= nextN then say lastN\n otherwise nop\n end\n say '*\\-'\n lastN = nextN\n end val\n say lastN\n\n return\n","language":"NetRexx"},{"code":"(normal 1 .5 1000)\n","language":"NewLISP"},{"code":"import random, stats, strformat\n\nvar rs: RunningStat\n\nrandomize()\n\nfor _ in 1..5:\n for _ in 1..1000: rs.push gauss(1.0, 0.5)\n echo &\"mean: {rs.mean:.5f} stdDev: {rs.standardDeviation:.5f}\"\n","language":"Nim"},{"code":"bundle Default {\n class RandomNumbers {\n function : Main(args : String[]) ~ Nil {\n rands := Float->New[1000];\n for(i := 0; i < rands->Size(); i += 1;) {\n rands[i] := 1.0 + 0.5 * RandomNormal();\n };\n\n each(i : rands) {\n rands[i]->PrintLine();\n };\n }\n\n function : native : RandomNormal() ~ Float {\n return (2 * Float->Pi() * Float->Random())->Cos() * (-2 * (Float->Random()->Log()))->SquareRoot();\n }\n }\n}\n","language":"Objeck"},{"code":"let pi = 4. *. atan 1.;;\nlet random_gaussian () =\n 1. +. sqrt (-2. *. log (Random.float 1.)) *. cos (2. *. pi *. Random.float 1.);;\nlet a = Array.init 1000 (fun _ -> random_gaussian ());;\n","language":"OCaml"},{"code":"p = normrnd(1.0, 0.5, 1000, 1);\ndisp(mean(p));\ndisp(sqrt(sum((p - mean(p)).^2)/numel(p)));\n","language":"Octave"},{"code":"/*REXX pgm gens 1,000 normally distributed #s: mean=1, standard dev.=0.5*/\n pi=RxCalcPi() /* get value of pi */\n Parse Arg n seed . /* allow specification of N & seed*/\n If n==''|n==',' Then\n n=1000 /* N is the size of the array. */\n If seed\\=='' Then\n Call random,,seed /* use seed for repeatable RANDOM#*/\n mean=1 /* desired new mean (arith. avg.) */\n sd=1/2 /* desired new standard deviation.*/\n Do g=1 For n /* generate N uniform random nums.*/\n n.g=random(0,1e5)/1e5 /* REXX gens uniform rand integers*/\n End\n\n Say ' old mean=' mean()\n Say 'old standard deviation=' stddev()\n Say\n Do j=1 To n-1 By 2\n m=j+1\n /*use Box-Muller method */\n _=sd*RxCalcPower(-2*RxCalcLog(n.j),.5)*RxCalcCos(2*pi*n.m,,'R')+mean\n n.m=sd*RxCalcpower(-2*RxCalcLog(n.j),.5)*RxCalcSin(2*pi*n.m,,'R')+,\n mean /* rand # must be 0???1. */\n n.j=_\n End /* j */\n Say ' new mean=' mean()\n Say 'new standard deviation=' stddev()\n Exit\nmean:\n _=0\n Do k=1 For n\n _=_+n.k\n End\n Return _/n\nstddev:\n _avg=mean()\n _=0\n Do k=1 For n\n _=_+(n.k-_avg)**2\n End\n Return RxCalcPower(_/n,.5)\n\n:: requires rxmath library\n","language":"OoRexx"},{"code":"/*REXX pgm gens 1,000 normally distributed #s: mean=1, standard dev.=0.5*/\n pi=RxCalcPi() /* get value of pi */\n Parse Arg n seed . /* allow specification of N & seed*/\n If n==''|n==',' Then\n n=1000 /* N is the size of the array. */\n If seed\\=='' Then\n Call random,,seed /* use seed for repeatable RANDOM#*/\n mean=1 /* desired new mean (arith. avg.) */\n sd=1/2 /* desired new standard deviation.*/\n Do g=1 For n /* generate N uniform random nums.*/\n n.g=random(0,1e5)/1e5 /* REXX gens uniform rand integers*/\n End\n\n Say ' old mean=' mean()\n Say 'old standard deviation=' stddev()\n Say\n Do j=1 To n-1 By 2\n m=j+1\n /*use Box-Muller method */\n _=sd*sqrt(-2*ln(n.j))*cos(2*pi*n.m)+mean\n n.m=sd*sqrt(-2*ln(n.j))*sin(2*pi*n.m)+mean\n n.j=_\n End\n Say ' new mean=' mean()\n Say 'new standard deviation=' stddev()\n Exit\nmean:\n _=0\n Do k=1 For n\n _=_+n.k\n End\n Return _/n\nstddev:\n _avg=mean()\n _=0\n Do k=1 For n\n _=_+(n.k-_avg)**2\n End\n Return sqrt(_/n)\n\nsqrt: Return RxCalcSqrt(arg(1))\nln: Return RxCalcLog(arg(1))\ncos: Return RxCalcCos(arg(1),,'R')\nsin: Return RxCalcSin(arg(1),,'R')\n\n:: requires rxmath library\n","language":"OoRexx"},{"code":"rnormal()={\n\tmy(pr=32*ceil(default(realprecision)*log(10)/log(4294967296)),u1=random(2^pr)*1.>>pr,u2=random(2^pr)*1.>>pr);\n\tsqrt(-2*log(u1))*cos(2*Pi*u2) \\\\ in previous version \"u1\" instead of \"u2\" was used --> has given crap distribution\n\t\\\\ Could easily be extended with a second normal at very little cost.\n};\nvector(1000,unused,rnormal()/2+1)\n","language":"PARI-GP"},{"code":"function rnorm (mean, sd: real): real;\n {Calculates Gaussian random numbers according to the Box-Müller approach}\nvar\n u1, u2: real;\nbegin\n u1 := random;\n u2 := random;\n rnorm := mean * abs(1 + sqrt(-2 * (ln(u1))) * cos(2 * pi * u2) * sd);\n /* error !?! Shouldn't it be \"mean +\" instead of \"mean *\" ? */\nend;\n","language":"Pascal"},{"code":"my $PI = 2 * atan2 1, 0;\n\nmy @nums = map {\n 1 + 0.5 * sqrt(-2 * log rand) * cos(2 * $PI * rand)\n} 1..1000;\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">RandomNormal</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">sqrt</span><span style=\"color: #0000FF;\">(-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #7060A8;\">log</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">rnd</span><span style=\"color: #0000FF;\">()))</span> <span style=\"color: #0000FF;\">*</span> <span style=\"color: #7060A8;\">cos</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">PI</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #7060A8;\">rnd</span><span style=\"color: #0000FF;\">())</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1000</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">0.5</span> <span style=\"color: #0000FF;\">*</span> <span style=\"color: #000000;\">RandomNormal</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"include ..\\Utilitys.pmt\n\ndef RandomNormal\n drop rand log -2 * sqrt 2 pi * rand * cos * 0.5 * 1 +\nenddef\n\n1000 var n\n0 n repeat\n\ngetid RandomNormal map\n\ndup\nsum n / var mean\n\"Mean: \" print mean print nl\n\n0 swap n for\n get mean - 2 power rot + swap\nendfor\nswap n / sqrt \"Standard deviation: \" print print\n","language":"Phixmonti"},{"code":"function random() {\n return mt_rand() / mt_getrandmax();\n}\n\n$pi \t= pi(); // Set PI\n\n$a = array();\nfor ($i = 0; $i < 1000; $i++) {\n $a[$i] = 1.0 + ((sqrt(-2 * log(random())) * cos(2 * $pi * random())) * 0.5);\n\n}\n","language":"PHP"},{"code":"main =>\n _ = random2(), % random seed\n G = [gaussian_dist(1,0.5) : _ in 1..1000],\n println(first_10=G[1..10]),\n println([mean=avg(G),stdev=stdev(G)]),\n nl.\n\n% Gaussian (Normal) distribution, Box-Muller algorithm\ngaussian01() = Y =>\n U = frand(0,1),\n V = frand(0,1),\n Y = sqrt(-2*log(U))*sin(2*math.pi*V).\n\ngaussian_dist(Mean,Stdev) = Mean + (gaussian01() * Stdev).\n\n% Variance of Xs\nvariance(Xs) = Variance =>\n Mu = avg(Xs),\n N = Xs.len,\n Variance = sum([ (X-Mu)**2 : X in Xs ]) / N.\n\n% Standard deviation\nstdev(Xs) = sqrt(variance(Xs)).\n","language":"Picat"},{"code":"(load \"@lib/math.l\")\n\n(de randomNormal () # Normal distribution, centered on 0, std dev 1\n (*/\n (sqrt (* -2.0 (log (rand 0 1.0))))\n (cos (*/ 2.0 pi (rand 0 1.0) `(* 1.0 1.0)))\n 1.0 ) )\n\n(seed (time)) # Randomize\n\n(let Result\n (make # Build list\n (do 1000 # of 1000 elements\n (link (+ 1.0 (/ (randomNormal) 2))) ) )\n (for N (head 7 Result) # Print first 7 results\n (prin (format N *Scl) \" \") ) )\n","language":"PicoLisp"},{"code":"/* CONVERTED FROM WIKI FORTRAN */\nNormal_Random: procedure options (main);\n declare (array(1000), pi, temp,\n mean initial (1.0), sd initial (0.5)) float (18);\n declare (i, n) fixed binary;\n\n n = hbound(array, 1);\n pi = 4.0*ATAN(1.0);\n array = random(); /* Uniform distribution */\n /* Now convert to normal distribution */\n DO i = 1 to n-1 by 2;\n temp = sd * SQRT(-2.0*LOG(array(i))) * COS(2*pi*array(i+1)) + mean;\n array(i+1) = sd * SQRT(-2.0*LOG(array(i))) * SIN(2*pi*array(i+1)) + mean;\n array(i) = temp;\n END;\n /* Check mean and standard deviation */\n mean = SUM(array)/n;\n sd = SQRT(SUM((array - mean)**2)/n);\n put skip edit ( \"Mean = \", mean ) (a, F(18,16) );\n put skip edit ( \"Standard Deviation = \", sd) (a, F(18,16));\nEND Normal_Random;\n","language":"PL-I"},{"code":"DECLARE\n --The desired collection\n type t_coll is table of number index by binary_integer;\n l_coll t_coll;\n\n c_max pls_integer := 1000;\nBEGIN\n FOR l_counter IN 1 .. c_max\n LOOP\n -- dbms_random.normal delivers normal distributed random numbers with a mean of 0 and a variance of 1\n -- We just adjust the values and get the desired result:\n l_coll(l_counter) := DBMS_RANDOM.normal * 0.5 + 1;\n DBMS_OUTPUT.put_line (l_coll(l_counter));\n END LOOP;\nEND;\n","language":"PL-SQL"},{"code":";;; Choose radians as arguments to trigonometic functions\ntrue -> popradians;\n\n;;; procedure generating standard normal distribution\ndefine random_normal() -> result;\nlvars r1 = random0(1.0), r2 = random0(1.0);\n cos(2*pi*r1)*sqrt(-2*log(r2)) -> result\nenddefine;\n\nlvars array, i;\n\n;;; Put numbers on the stack\nfor i from 1 to 1000 do 1.0+0.5*random_normal() endfor;\n;;; collect them into array\nconsvector(1000) -> array;\n","language":"Pop11"},{"code":"function Get-RandomNormal\n {\n [CmdletBinding()]\n Param ( [double]$Mean, [double]$StandardDeviation )\n\n $RandomNormal = $Mean + $StandardDeviation * [math]::Sqrt( -2 * [math]::Log( ( Get-Random -Minimum 0.0 -Maximum 1.0 ) ) ) * [math]::Cos( 2 * [math]::PI * ( Get-Random -Minimum 0.0 -Maximum 1.0 ) )\n\n return $RandomNormal\n }\n\n# Standard deviation function for testing\nfunction Get-StandardDeviation\n {\n [CmdletBinding()]\n param ( [double[]]$Numbers )\n\n $Measure = $Numbers | Measure-Object -Average\n $PopulationDeviation = 0\n ForEach ($Number in $Numbers) { $PopulationDeviation += [math]::Pow( ( $Number - $Measure.Average ), 2 ) }\n $StandardDeviation = [math]::Sqrt( $PopulationDeviation / ( $Measure.Count - 1 ) )\n return $StandardDeviation\n }\n\n# Test\n$RandomNormalNumbers = 1..1000 | ForEach { Get-RandomNormal -Mean 1 -StandardDeviation 0.5 }\n\n$Measure = $RandomNormalNumbers | Measure-Object -Average\n\n$Stats = [PSCustomObject]@{\n Count = $Measure.Count\n Average = $Measure.Average\n StandardDeviation = Get-StandardDeviation -Numbers $RandomNormalNumbers\n}\n\n$Stats | Format-List\n","language":"PowerShell"},{"code":"Procedure.f RandomNormal()\n ; This procedure can return any real number.\n Protected.f x1, x2\n\n ; random numbers from the open interval ]0, 1[\n x1 = (Random(999998)+1) / 1000000 ; must be > 0 because of Log(x1)\n x2 = (Random(999998)+1) / 1000000\n\n ProcedureReturn Sqr(-2*Log(x1)) * Cos(2*#PI*x2)\nEndProcedure\n\nDefine i, n=1000\n\nDim a.q(n-1)\nFor i = 0 To n-1\n a(i) = 1 + 0.5 * RandomNormal()\nNext\n","language":"PureBasic"},{"code":">>> import random\n>>> values = [random.gauss(1, .5) for i in range(1000)]\n>>>\n","language":"Python"},{"code":">>> def quick_check(numbers):\n count = len(numbers)\n mean = sum(numbers) / count\n sdeviation = (sum((i - mean)**2 for i in numbers) / count)**0.5\n return mean, sdeviation\n\n>>> quick_check(values)\n(1.0140373306786599, 0.49943411329234066)\n>>>\n","language":"Python"},{"code":">>> values = [ random.normalvariate(1, 0.5) for i in range(1000)]\n>>> quick_check(values)\n(0.990099111944864, 0.5029847005836282)\n>>>\n","language":"Python"},{"code":"# For reproducibility, set the seed:\nset.seed(12345L)\n\nresult <- rnorm(1000, mean = 1, sd = 0.5)\n","language":"R"},{"code":"#lang racket\n(for/list ([i 1000])\n (add1 (* (sqrt (* -2 (log (random)))) (cos (* 2 pi (random))) 0.5)))\n","language":"Racket"},{"code":"#lang racket\n(require math/distributions)\n(sample (normal-dist 1.0 0.5) 1000)\n","language":"Racket"},{"code":"sub randnorm ($mean, $stddev) {\n $mean + $stddev * sqrt(-2 * log rand) * cos(2 * pi * rand)\n}\n\nmy @nums = randnorm(1, 0.5) xx 1000;\n\n# Checking\nsay my $mean = @nums R/ [+] @nums;\nsay my $stddev = sqrt $mean**2 R- @nums R/ [+] @nums X** 2;\n","language":"Raku"},{"code":"define PI\n -1 acos\n\ndefine rand1\n 9999999 choose 1 + 10000000.0 /\n\ndefine randNormal\n rand1 PI * 2 * cos\n rand1 log -2 * sqrt\n *\n 2 / 1 +\n\n1000 each drop randNormal \"%f\\n\" print\n","language":"Raven"},{"code":"raven rand.rv | awk '{sum+=$1; sumsq+=$1*$1;} END {print \"stdev = \" sqrt(sumsq/NR - (sum/NR)**2); print \"mean = \" sum/NR}'\nstdev = 0.497773\nmean = 1.01497\n","language":"Raven"},{"code":"let pi = 4.0 *. atan(1.0)\n\nlet random_gaussian = () => {\n 1.0 +.\n sqrt(-2.0 *. log(Random.float(1.0))) *.\n cos(2.0 *. pi *. Random.float(1.0))\n}\n\nlet a = Belt.Array.makeBy(1000, (_) => random_gaussian ())\n\nfor i in 0 to 10 {\n Js.log(a[i])\n}\n","language":"ReScript"},{"code":"/*REXX pgm generates 1,000 normally distributed numbers: mean=1, standard deviation=½.*/\nnumeric digits 20 /*the default decimal digit precision=9*/\nparse arg n seed . /*allow specification of N and the seed*/\nif n=='' | n==\",\" then n=1000 /*N: is the size of the array. */\nif datatype(seed,'W') then call random ,,seed /*SEED: for repeatable random numbers. */\nnewMean=1 /*the desired new mean (arithmetic avg)*/\nsd=1/2 /*the desired new standard deviation. */\n do g=1 for n /*generate N uniform random #'s (0,1].*/\n #.g = random(1, 1e5) / 1e5 /*REXX's RANDOM BIF generates integers.*/\n end /*g*/ /* [↑] random integers ──► fractions. */\nsay ' old mean=' mean()\nsay 'old standard deviation=' stdDev()\ncall pi; pi2=pi * 2 /*define pi and also 2 * pi. */\nsay\n do j=1 to n-1 by 2; m=j+1 /*step through the iterations by two. */\n _=sd * sqrt(ln(#.j) * -2) /*calculate the used-twice expression.*/\n #.j=_ * cos(pi2 * #.m) + newMean /*utilize the Box─Muller method. */\n #.m=_ * sin(pi2 * #.m) + newMean /*random number must be: (0,1] */\n end /*j*/\nsay ' new mean=' mean()\nsay 'new standard deviation=' stdDev()\nexit /*stick a fork in it, we're all done. */\n/*───────────────────────────────────────────────────────────────────────────────────────────────────────────────────*/\nmean: _=0; do k=1 for n; _=_ + #.k; end; return _/n\nstdDev: _avg=mean(); _=0; do k=1 for n; _=_ + (#.k - _avg)**2; end; return sqrt(_/n)\ne: e =2.7182818284590452353602874713526624977572470936999595749669676277240766303535; return e /*digs overkill*/\npi: pi=3.1415926535897932384626433832795028841971693993751058209749445923078164062862; return pi /* \" \" */\nr2r: return arg(1) // (pi() * 2) /*normalize ang*/\nsin: procedure; parse arg x;x=r2r(x);numeric fuzz min(5,digits()-3);if abs(x)=pi then return 0;return .sincos(x,x,1)\n.sincos:parse arg z,_,i; x=x*x; p=z; do k=2 by 2; _=-_*x/(k*(k+i)); z=z+_; if z=p then leave; p=z; end; return z\n/*───────────────────────────────────────────────────────────────────────────────────────────────────────────────────*/\nln: procedure; parse arg x,f; call e; ig= x>1.5; is=1 - 2 * (ig\\==1); ii=0; xx=x\n do while ig&xx>1.5|\\ig&xx<.5;_=e;do k=-1;iz=xx*_**-is;if k>=0&(ig&iz<1|\\ig&iz>.5) then leave;_=_*_;izz=iz;end\n xx=izz;ii=ii+is*2**k;end;x=x*e**-ii-1;z=0;_=-1;p=z;do k=1;_=-_*x;z=z+_/k;if z=p then leave;p=z;end; return z+ii\n/*───────────────────────────────────────────────────────────────────────────────────────────────────────────────────*/\ncos: procedure; parse arg x; x=r2r(x); a=abs(x); hpi=pi * .5\n numeric fuzz min(6, digits() - 3); if a=pi then return -1\n if a=hpi | a=hpi*3 then return 0; if a=pi/3 then return .5\n if a=pi * 2/3 then return -.5; return .sinCos(1,1,-1)\n/*───────────────────────────────────────────────────────────────────────────────────────────────────────────────────*/\nsqrt: procedure; parse arg x; if x=0 then return 0; d=digits(); numeric digits; h=d+6\n numeric form; parse value format(x,2,1,,0) 'E0' with g 'E' _ .; g=g * .5'e'_ %2\n m.=9; do j=0 while h>9; m.j=h; h=h%2 + 1; end /*j*/\n do k=j+5 to 0 by -1; numeric digits m.k; g=(g+x/g)*.5; end /*k*/\n numeric digits d; return g/1\n","language":"REXX"},{"code":"for i = 1 to 10\n see random(i) + nl\nnext i\n","language":"Ring"},{"code":"Array.new(1000) { 1 + Math.sqrt(-2 * Math.log(rand)) * Math.cos(2 * Math::PI * rand) }\n","language":"Ruby"},{"code":"dim a(1000)\npi = 22/7\nfor i = 1 to 1000\n a( i) = 1 + .5 * (sqr(-2 * log(rnd(0))) * cos(2 * pi * rnd(0)))\nnext i\n","language":"Run-BASIC"},{"code":"extern crate rand;\nuse rand::distributions::{Normal, IndependentSample};\n\nfn main() {\n let mut rands = [0.0; 1000];\n let normal = Normal::new(1.0, 0.5);\n let mut rng = rand::thread_rng();\n for num in rands.iter_mut() {\n *num = normal.ind_sample(&mut rng);\n }\n}\n","language":"Rust"},{"code":"extern crate rand;\nuse rand::distributions::{Normal, IndependentSample};\n\nfn main() {\n let rands: Vec<_> = {\n let normal = Normal::new(1.0, 0.5);\n let mut rng = rand::thread_rng();\n (0..1000).map(|_| normal.ind_sample(&mut rng)).collect()\n };\n}\n","language":"Rust"},{"code":"/* Generate 1000 random numbers with mean 1 and standard deviation 0.5.\n SAS version 9.2 was used to create this code.*/\n\ndata norm1000;\n call streaminit(123456);\n/* Set the starting point, so we can replicate results.\n If you want different results each time, comment the above line. */\n do i=1 to 1000;\n r=rand('normal',1,0.5);\n output;\n end;\nrun;\n","language":"SAS"},{"code":"class MAIN is\n main is\n a:ARRAY{FLTD} := #(1000);\n i:INT;\n\n RND::seed(2010);\n loop i := 1.upto!(1000) - 1;\n a[i] := 1.0d + 0.5d * RND::standard_normal;\n end;\n\n -- testing the distribution\n mean ::= a.reduce(bind(_.plus(_))) / a.size.fltd;\n #OUT + \"mean \" + mean + \"\\n\";\n a.map(bind(_.minus(mean)));\n a.map(bind(_.pow(2.0d)));\n dev ::= (a.reduce(bind(_.plus(_))) / a.size.fltd).sqrt;\n #OUT + \"dev \" + dev + \"\\n\";\n end;\nend;\n","language":"Sather"},{"code":"List.fill(1000)(1.0 + 0.5 * scala.util.Random.nextGaussian)\n","language":"Scala"},{"code":"object RandomNumbers extends App {\n\n val distribution: LazyList[Double] = {\n def randomNormal: Double = 1.0 + 0.5 * scala.util.Random.nextGaussian\n\n def normalDistribution(a: Double): LazyList[Double] = a #:: normalDistribution(randomNormal)\n\n normalDistribution(randomNormal)\n }\n\n /*\n * Let's test it\n */\n def calcAvgAndStddev[T](ts: Iterable[T])(implicit num: Fractional[T]): (T, Double) = {\n val mean: T =\n num.div(ts.sum, num.fromInt(ts.size)) // Leaving with type of function T\n\n // Root of mean diffs\n val stdDev = Math.sqrt(ts.map { x =>\n val diff = num.toDouble(num.minus(x, mean))\n diff * diff\n }.sum / ts.size)\n\n (mean, stdDev)\n }\n\n println(calcAvgAndStddev(distribution.take(1000))) // e.g. (1.0061433267806525,0.5291834867560893)\n}\n","language":"Scala"},{"code":"; linear congruential generator given in C99 section 7.20.2.1\n(define ((c-rand seed)) (set! seed (remainder (+ (* 1103515245 seed) 12345) 2147483648)) (quotient seed 65536))\n\n; uniform real numbers in open interval (0, 1)\n(define (unif-rand seed) (let ((r (c-rand seed))) (lambda () (/ (+ (r) 1) 32769.0))))\n\n; Box-Muller method to generate normal distribution\n(define (normal-rand unif m s)\n(let ((? #t) (! 0.0) (twopi (* 2.0 (acos -1.0))))\n(lambda ()\n (set! ? (not ?))\n (if ? !\n (let ((a (sqrt (* -2.0 (log (unif))))) (b (* twopi (unif))))\n (set! ! (+ m (* s a (sin b))))\n (+ m (* s a (cos b))))))))\n\n(define rnorm (normal-rand (unif-rand 0) 1.0 0.5))\n\n; auxiliary function to get a list of 'n random numbers from generator 'r\n(define (rand-list r n) = (if (zero? n) '() (cons (r) (rand-list r (- n 1)))))\n\n(define v (rand-list rnorm 1000))\n\nv\n#|\n(-0.27965824722565835\n -0.8870860825789542\n 0.6499618744638194\n 0.31336141955110863\n ...\n 0.5648743998193049\n 0.8282656735558756\n 0.6399951934564637\n 0.7699535302478072)\n|#\n\n; check mean and standard deviation\n(define (mean-sdev v)\n(let loop ((v v) (a 0) (b 0) (n 0))\n(if (null? v)\n (let ((mean (/ a n)))\n (list mean (sqrt (/ (- b (* n mean mean)) (- n 1)))))\n (let ((x (car v)))\n (loop (cdr v) (+ a x) (+ b (* x x)) (+ n 1))))))\n\n(mean-sdev v)\n; (0.9562156817697293 0.5097087109575911)\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n include \"float.s7i\";\n include \"math.s7i\";\n\nconst func float: frand is func # Uniform distribution, (0..1]\n result\n var float: frand is 0.0;\n begin\n repeat\n frand := rand(0.0, 1.0);\n until frand <> 0.0;\n end func;\n\nconst func float: randomNormal is # Normal distribution, centered on 0, std dev 1\n return sqrt(-2.0 * log(frand)) * cos(2.0 * PI * frand);\n\nconst proc: main is func\n local\n var integer: i is 0;\n var array float: rands is 1000 times 0.0;\n begin\n for i range 1 to length(rands) do\n rands[i] := 1.0 + 0.5 * randomNormal;\n end for;\n end func;\n","language":"Seed7"},{"code":"var arr = 1000.of { 1 + (0.5 * sqrt(-2 * 1.rand.log) * cos(Num.tau * 1.rand)) }\narr.each { .say }\n","language":"Sidef"},{"code":"val seed = 0w42;\nval gen = Rand.mkRandom seed;\nfun random_gaussian () =\n 1.0 + Math.sqrt (~2.0 * Math.ln (Rand.norm (gen ()))) * Math.cos (2.0 * Math.pi * Rand.norm (gen ()));\nval a = List.tabulate (1000, fn _ => random_gaussian ());\n","language":"Standard-ML"},{"code":"val seed = (47,42);\nval gen = Random.rand seed;\nfun random_gaussian () =\n 1.0 + Math.sqrt (~2.0 * Math.ln (Random.randReal gen)) * Math.cos (2.0 * Math.pi * Random.randReal gen);\nval a = List.tabulate (1000, fn _ => random_gaussian ());\n","language":"Standard-ML"},{"code":"val urandomlist = fn seed => fn n =>\nlet\n\tval uniformdeviate = fn seed =>\n\tlet\n\t val in31m = (Real.fromInt o Int32.toInt ) (getOpt (Int32.maxInt,0) );\n\t val in31 = in31m +1.0;\n\t val s1 = 41160.0;\n\t val s2 = 950665216.0;\n\t val v = Real.realFloor seed;\n\t val val1 = v*s1;\n\t val val2 = v*s2;\n\t val next1 = Real.fromLargeInt (Real.toLargeInt IEEEReal.TO_NEGINF (val1/in31)) ;\n\t val next2 = Real.rem(Real.realFloor(val2/in31) , in31m );\n\t val valt = val1+val2 - (next1+next2)*in31m;\n\t val nextt = Real.realFloor(valt/in31m);\n\t val valt = valt - nextt*in31m;\n\tin\n\t (valt/in31m,valt)\n\tend;\nval store = ref (0.0,0.0);\nval rec u = fn S => fn 0 => [] | n=> (store:=uniformdeviate S; (#1 (!store)):: (u (#2 (!store)) (n-1))) ;\nin\n\tu seed n\nend;\n\nlocal\n\topen Math\nin\n\tval bmconv = fn urand => fn vrand => 1.0+0.5*(sqrt(~2.0*ln urand)*cos (2.0*pi*vrand) )\nend;\n\nval rec makeNormals = fn once => fn u::v::[] => [once u v] |\n\tu::v::rm => (once u v )::(makeNormals once rm );\n\nval anyrealseed=1009.0 ;\nmakeNormals bmconv (urandomlist anyrealseed 2000);\n","language":"Standard-ML"},{"code":"clear all\nset obs 1000\ngen x=rnormal(1,0.5)\n","language":"Stata"},{"code":"a = rnormal(1000,1,1,0.5)\n","language":"Stata"},{"code":"package require Tcl 8.5\nvariable ::pi [expr acos(0)]\nproc ::tcl::mathfunc::nrand {} {\n expr {sqrt(-2*log(rand())) * cos(2*$::pi*rand())}\n}\n\nset mean 1.0\nset stddev 0.5\nfor {set i 0} {$i < 1000} {incr i} {\n lappend result [expr {$mean + $stddev*nrand()}]\n}\n","language":"Tcl"},{"code":"for (%i = 0; %i < 1000; %i++)\n\t%list[%i] = 1 + mSqrt(-2 * mLog(getRandom())) * mCos(2 * $pi * getRandom());\n","language":"TorqueScript"},{"code":"#import nat\n#import flo\n\npop_stats(\"mu\",\"sigma\") = plus/*\"mu\"+ times/*\"sigma\"+ Z*+ iota\n\nsample_stats(\"mu\",\"sigma\") = plus^*D(minus/\"mu\"+ mean,~&)+ vid^*D(div\\\"sigma\"+ stdev,~&)+ Z*+ iota\n\n#cast %eWL\n\ntest =\n\n^(mean,stdev)* <\n pop_stats(1.,0.5) 1000,\n sample_stats(1.,0.5) 1000>\n","language":"Ursala"},{"code":"import crypto.rand\n\nfn main() {\n\tmut nums := []u64{}\n\tfor _ in 0..1000 {\n\t\tnums << rand.int_u64(10000) or {0} // returns random unsigned 64-bit integer from real OS source of entropy\n\t}\n\tprintln(nums)\n}\n","language":"V-(Vlang)"},{"code":"LOCAL i As Integer, m As Double, n As Integer, sd As Double\npy = PI()\nSET TALK OFF\nSET DECIMALS TO 6\nCREATE CURSOR gdev (deviate B(6))\nRAND(-1)\nn = 1000\nm = 1\nsd = 0.5\nCLEAR\nFOR i = 1 TO n\n\tINSERT INTO gdev VALUES (GaussDev(m, 1/sd))\nENDFOR\nCALCULATE AVG(deviate), STD(deviate) TO m, sd\n? \"Mean\", m, \"Std Dev\", sd\nSET TALK ON\nSET DECIMALS TO\n\nFUNCTION GaussDev(mean As Double, sdev As Double) As Double\nLOCAL z As Double\nz = SQRT(-2*LOG(RAND()))*COS(py*RAND())\nIF sdev # 0\n\tz = mean + z/sdev\nENDIF\nRETURN z\t\nENDFUNC\n","language":"Visual-FoxPro"},{"code":"import \"random\" for Random\n\nvar rand = Random.new()\n\nvar randNormal = Fn.new { (-2 * rand.float().log).sqrt * (2 * Num.pi * rand.float()).cos }\n\nvar stdDev = Fn.new { |a, m|\n var c = a.count\n return ((a.reduce(0) { |acc, x| acc + x*x } - m*m*c) / c).sqrt\n}\n\nvar n = 1000\nvar numbers = List.filled(n, 0)\nvar mu = 1\nvar sigma = 0.5\nvar sum = 0\nfor (i in 0...n) {\n numbers[i] = mu + sigma*randNormal.call()\n sum = sum + numbers[i]\n}\nvar mean = sum / n\nSystem.print(\"Actual mean : %(mean)\")\nSystem.print(\"Actual std dev: %(stdDev.call(numbers, mean))\")\n","language":"Wren"},{"code":"define PI = 3.14159265358979323846;\n\nfunc real DRand; \\Uniform distribution, [0..1]\nreturn float(Ran(1_000_000)) / 1e6;\n\nfunc real RandomNormal; \\Normal distribution, centered on 0, std dev 1\nreturn sqrt(-2.*Log(DRand)) * Cos(2.*PI*DRand);\n\nint I;\nreal Rands(1000);\nfor I:= 0 to 1000-1 do\n Rands(I):= 1.0 + 0.5*RandomNormal\n","language":"XPL0"},{"code":"func random_normal(count) {\n return sqrt(-2*log(random(count))) * cos(2*pi*random(count));\n}\n","language":"Yorick"},{"code":"fcn mkRand(mean,sd){ //normally distributed random w/mean & standard deviation\n pi:=(0.0).pi; // using the Box–Muller transform\n rz1:=fcn{1.0-(0.0).random(1)} // from [0,1) to (0,1]\n return('wrap(){((-2.0*rz1().log()).sqrt() * (2.0*pi*rz1()).cos())*sd + mean })\n}\n","language":"Zkl"},{"code":"var g=mkRand(1,0.5);\nns:=(0).pump(1000,List,g); // 1000 rands with mean==1 & sd==1/2\nmean:=(ns.sum(0.0)/1000); //-->1.00379\n // calc sd of list of numbers:\n(ns.reduce('wrap(p,n){p+(n-mean).pow(2)},0.0)/1000).sqrt() //-->0.494844\n","language":"Zkl"},{"code":"10 RANDOMIZE 0 : REM seeds random number generator based on uptime\n20 DIM a(1000)\n30 CLS\n40 FOR i = 1 TO 1000\n50 LET a(i) = 1 + SQR(-2 * LN(RND)) * COS(2 * PI * RND)\n60 NEXT i\n","language":"ZX-Spectrum-Basic"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Probability and statistics\\n- Randomness\\nfrom: http://rosettacode.org/wiki/Random_numbers\\nnote: Basic language learning\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nGenerate a collection filled with '''1000''' normally distributed random (or pseudo-random) numbers \\nwith a mean of '''1.0''' and a [[wp:Standard_deviation|standard deviation]] of '''0.5'''\\n\\nMany libraries only generate uniformly distributed random numbers. If so, you may use [[wp:Normal_distribution#Generating_values_from_normal_distribution|one of these algorithms]].\\n\\n;Related task:\\n* [[Standard deviation]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"with Ada.Numerics; use Ada.Numerics;\\nwith Ada.Numerics.Float_Random; use Ada.Numerics.Float_Random;\\nwith Ada.Numerics.Elementary_Functions; use Ada.Numerics.Elementary_Functions;\\n\\nprocedure Normal_Random is\\n function Normal_Distribution\\n ( Seed : Generator;\\n Mu : Float := 1.0;\\n Sigma : Float := 0.5\\n ) return Float is\\n begin\\n return\\n Mu + (Sigma * Sqrt (-2.0 * Log (Random (Seed), 10.0)) * Cos (2.0 * Pi * Random (Seed)));\\n end Normal_Distribution;\\n\\n Seed : Generator;\\n Distribution : array (1..1_000) of Float;\\nbegin\\n Reset (Seed);\\n for I in Distribution'Range loop\\n Distribution (I) := Normal_Distribution (Seed);\\n end loop;\\nend Normal_Random;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"PROC random normal = REAL: # normal distribution, centered on 0, std dev 1 #\\n(\\n sqrt(-2*log(random)) * cos(2*pi*random)\\n);\\n\\ntest:(\\n [1000]REAL rands;\\n FOR i TO UPB rands DO\\n rands[i] := 1 + random normal/2\\n OD;\\n INT limit=10;\\n printf(($\\\"(\\\"n(limit-1)(-d.6d\\\",\\\")-d.5d\\\" ... )\\\"$, rands[:limit]))\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"rnd: function []-> (random 0 10000)//10000\\n\\nrands: map 1..1000 'x [\\n 1 + (sqrt neg 2 * ln rnd) * (cos 2 * pi * rnd)\\n]\\n\\nprint rands\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"Loop 40\\n R .= RandN(1,0.5) \\\"`n\\\" ; mean = 1.0, standard deviation = 0.5\\nMsgBox %R%\\n\\nRandN(m,s) { ; Normally distributed random numbers of mean = m, std.dev = s by Box-Muller method\\n Static i, Y\\n If (i := !i) { ; every other call\\n Random U, 0, 1.0\\n Random V, 0, 6.2831853071795862\\n U := sqrt(-2*ln(U))*s\\n Y := m + U*sin(V)\\n Return m + U*cos(V)\\n }\\n Return Y\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"Method \\\"U(_,_)\\\" is\\n[\\n\\tlower : number,\\n\\tupper : number\\n|\\n\\tdivisor ::= ((1<<32)) ÷ (upper - lower)→double;\\n\\tmap a pRNG through [i : integer | (i ÷ divisor) + lower]\\n];\\n\\nMethod \\\"a Marsaglia polar sampler\\\" is\\n[\\n\\tgenerator for\\n\\t\\t[\\n\\t\\t\\tyield : [double]→⊤\\n\\t\\t|\\n\\t\\t\\tsource ::= U(-1, 1);\\n\\t\\t\\tRepeat [\\n\\t\\t\\t\\tx ::= take 1 from source[1];\\n\\t\\t\\t\\ty ::= take 1 from source[1];\\n\\t\\t\\t\\ts ::= x^2 + y^2;\\n\\t\\t\\t\\tIf 0 < s < 1 then\\n\\t\\t\\t\\t[\\n\\t\\t\\t\\t\\tfactor ::= ((-2 × ln s) ÷ s) ^ 0.5;\\n\\t\\t\\t\\t\\tyield(x × factor);\\n\\t\\t\\t\\t\\tyield(y × factor);\\n\\t\\t\\t\\t];\\n\\t\\t\\t]\\n\\t\\t]\\n];\\n\\n// the default distribution has mean 0 and std dev 1.0, so we scale the values\\nsampler ::= map a Marsaglia polar sampler through [d : double | d ÷ 2.0 + 1.0];\\nvalues ::= take 1000 from sampler;\\n\",\n \"language\": \"Avail\"\n },\n {\n \"code\": \"$ awk 'func r(){return sqrt(-2*log(rand()))*cos(6.2831853*rand())}BEGIN{for(i=0;i<1000;i++)s=s\\\" \\\"1+0.5*r();print s}'\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"function r() {\\n return sqrt( -2*log( rand() ) ) * cos(6.2831853*rand() )\\n}\\n\\nBEGIN {\\n n=1000\\n for(i=0;i<n;i++) {\\n x = 1 + 0.5*r()\\n s = s\\\" \\\"x\\n }\\n print s\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"# Generates normally distributed random numbers with mean 0 and standard deviation 1\\nfunction randomNormal()\\n\\treturn cos(2.0 * pi * rand) * sqr(-2.0 * log(rand))\\nend function\\n\\ndim r(1000)\\nsum = 0.0\\n# Generate 1000 normally distributed random numbers\\n# with mean 1 and standard deviation 0.5\\n# and calculate their sum\\nfor i = 0 to 999\\n\\tr[i] = 1.0 + randomNormal() / 2.0\\n\\tsum += r[i]\\nnext i\\n\\nmean = sum / 1000.0\\nsum = 0.0\\n# Now calculate their standard deviation\\nfor i = 0 to 999\\n\\tsum += (r[i] - mean) ^ 2.0\\nnext i\\nsd = sqr(sum/1000.0)\\n\\nprint \\\"Mean is \\\"; mean\\nprint \\\"Standard Deviation is \\\"; sd\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \" DIM array(999)\\n FOR number% = 0 TO 999\\n array(number%) = 1.0 + 0.5 * SQR(-2*LN(RND(1))) * COS(2*PI*RND(1))\\n NEXT\\n\\n mean = SUM(array()) / (DIM(array(),1) + 1)\\n array() -= mean\\n stdev = MOD(array()) / SQR(DIM(array(),1) + 1)\\n\\n PRINT \\\"Mean = \\\" ; mean\\n PRINT \\\"Standard deviation = \\\" ; stdev\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdlib.h>\\n#include <math.h>\\n#ifndef M_PI\\n#define M_PI 3.14159265358979323846\\n#endif\\n\\ndouble drand() /* uniform distribution, (0..1] */\\n{\\n return (rand()+1.0)/(RAND_MAX+1.0);\\n}\\ndouble random_normal() /* normal distribution, centered on 0, std dev 1 */\\n{\\n return sqrt(-2*log(drand())) * cos(2*M_PI*drand());\\n}\\nint main()\\n{\\n int i;\\n double rands[1000];\\n for (i=0; i<1000; i++)\\n rands[i] = 1.0 + 0.5*random_normal();\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <random>\\n#include <functional>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nint main()\\n{\\n random_device seed;\\n mt19937 engine(seed());\\n normal_distribution<double> dist(1.0, 0.5);\\n auto rnd = bind(dist, engine);\\n\\n vector<double> v(1000);\\n generate(v.begin(), v.end(), rnd);\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <cstdlib> // for rand\\n#include <cmath> // for atan, sqrt, log, cos\\n#include <algorithm> // for generate_n\\n\\ndouble const pi = 4*std::atan(1.0);\\n\\n// simple functor for normal distribution\\nclass normal_distribution\\n{\\npublic:\\n normal_distribution(double m, double s): mu(m), sigma(s) {}\\n double operator() const // returns a single normally distributed number\\n {\\n double r1 = (std::rand() + 1.0)/(RAND_MAX + 1.0); // gives equal distribution in (0, 1]\\n double r2 = (std::rand() + 1.0)/(RAND_MAX + 1.0);\\n return mu + sigma * std::sqrt(-2*std::log(r1))*std::cos(2*pi*r2);\\n }\\nprivate:\\n const double mu, sigma;\\n};\\n\\nint main()\\n{\\n double array[1000];\\n std::generate_n(array, 1000, normal_distribution(1.0, 0.5));\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <vector>\\n#include \\\"boost/random.hpp\\\"\\n#include \\\"boost/generator_iterator.hpp\\\"\\n#include <boost/random/normal_distribution.hpp>\\n#include <algorithm>\\n\\ntypedef boost::mt19937 RNGType; ///< mersenne twister generator\\n\\nint main() {\\n RNGType rng;\\n boost::normal_distribution<> rdist(1.0,0.5); /**< normal distribution\\n with mean of 1.0 and standard deviation of 0.5 */\\n\\n boost::variate_generator< RNGType, boost::normal_distribution<> >\\n get_rand(rng, rdist);\\n\\n std::vector<double> v(1000);\\n generate(v.begin(),v.end(),get_rand);\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"private static double randomNormal()\\n{\\n\\treturn Math.Cos(2 * Math.PI * tRand.NextDouble()) * Math.Sqrt(-2 * Math.Log(tRand.NextDouble()));\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"static Random tRand = new Random();\\n\\nstatic void Main(string[] args)\\n{\\n\\tdouble[] a = new double[1000];\\n\\n\\tdouble tAvg = 0;\\n\\tfor (int x = 0; x < a.Length; x++)\\n\\t{\\n\\t\\ta[x] = randomNormal() / 2 + 1;\\n\\t\\ttAvg += a[x];\\n\\t}\\n\\n\\ttAvg /= a.Length;\\n\\tConsole.WriteLine(\\\"Average: \\\" + tAvg.ToString());\\n\\n\\tdouble s = 0;\\n\\tfor (int x = 0; x < a.Length; x++)\\n\\t{\\n\\t\\ts += Math.Pow((a[x] - tAvg), 2);\\n\\t}\\n\\ts = Math.Sqrt(s / 1000);\\n\\n\\tConsole.WriteLine(\\\"Standard Deviation: \\\" + s.ToString());\\n\\n\\tConsole.ReadLine();\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"10 ' Random numbers\\n20 randomize timer\\n30 dim r(999)\\n40 sum = 0\\n50 for i = 0 to 999\\n60 r(i) = 1+randomnormal()/2\\n70 sum = sum+r(i)\\n80 next\\n90 mean = sum/1000\\n100 sum = 0\\n110 for i = 0 to 999\\n120 sum = sum+(r(i)-mean)^2\\n130 next\\n140 sd = sqr(sum/1000)\\n150 print \\\"Mean is \\\";mean\\n160 print \\\"Standard Deviation is \\\";sd\\n170 print\\n180 end\\n\\n500 sub randomnormal()\\n510 randomnormal = cos(2*pi*rnd(1))*sqr(-2*log(rnd(1)))\\n520 end sub\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"(import '(java.util Random))\\n(def normals\\n (let [r (Random.)]\\n (take 1000 (repeatedly #(-> r .nextGaussian (* 0.5) (+ 1.0))))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. RANDOM.\\n AUTHOR. Bill Gunshannon\\n INSTALLATION. Home.\\n DATE-WRITTEN. 14 January 2022.\\n ************************************************************\\n ** Program Abstract:\\n ** Able to get the Mean to be really close to 1.0 but\\n ** couldn't get the Standard Deviation any closer than\\n ** .3 to .4.\\n ************************************************************\\n\\n DATA DIVISION.\\n\\n WORKING-STORAGE SECTION.\\n\\n 01 Sample-Size PIC 9(5) VALUE 1000.\\n 01 Total PIC 9(10)V9(5) VALUE 0.0.\\n 01 Arith-Mean PIC 999V999 VALUE 0.0.\\n 01 Std-Dev PIC 999V999 VALUE 0.0.\\n 01 Seed PIC 999V999.\\n 01 TI PIC 9(8).\\n\\n 01 Idx PIC 99999 VALUE 0.\\n 01 Intermediate PIC 9(10)V9(5) VALUE 0.0.\\n 01 Rnd-Work.\\n 05 Rnd-Tbl\\n OCCURS 1 TO 99999 TIMES DEPENDING ON Sample-Size.\\n 10 Rnd PIC 9V9999999 VALUE 0.0.\\n\\n PROCEDURE DIVISION.\\n\\n Main-Program.\\n ACCEPT TI FROM TIME.\\n MOVE FUNCTION RANDOM(TI) TO Seed.\\n PERFORM WITH TEST AFTER VARYING Idx\\n FROM 1 BY 1\\n UNTIL Idx = Sample-Size\\n COMPUTE Intermediate =\\n (FUNCTION RANDOM() * 2.01)\\n MOVE Intermediate TO Rnd(Idx)\\n END-PERFORM.\\n PERFORM WITH TEST AFTER VARYING Idx\\n FROM 1 BY 1\\n UNTIL Idx = Sample-Size\\n COMPUTE Total = Total + Rnd(Idx)\\n END-PERFORM.\\n\\n\\n COMPUTE Arith-Mean = Total / Sample-Size.\\n DISPLAY \\\"Mean: \\\" Arith-Mean.\\n\\n\\n PERFORM WITH TEST AFTER VARYING Idx\\n FROM 1 BY 1\\n UNTIL Idx = Sample-Size\\n COMPUTE Intermediate =\\n Intermediate + (Rnd(Idx) - Arith-Mean) ** 2\\n END-PERFORM.\\n COMPUTE Std-Dev = Intermediate / Sample-Size.\\n\\n\\n DISPLAY \\\"Std-Dev: \\\" Std-Dev.\\n\\n STOP RUN.\\n\\n END PROGRAM RANDOM.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"10 DIM AR(999): DIM DE(999)\\n20 FOR N = 0 TO 999\\n30 AR(N)= 0 + SQR(-1.3*LOG(RND(1))) * COS(1.2*PI*RND(1))\\n40 NEXT N\\n50 :\\n60 REM SUM\\n70 LET SU = 0\\n80 FOR N = 0 TO 999\\n90 LET SU = SU + AR(N)\\n100 NEXT N\\n110 :\\n120 REM MEAN\\n130 LET ME= 0\\n140 LET ME = SU/1000\\n150 :\\n160 REM DEVIATION\\n170 FOR N = 0 TO 999\\n180 T = AR(N)-ME: REM SUBTRACT MEAN FROM NUMBER\\n190 T = T * T: REM SQUARE THE RESULT\\n200 DE(N) = T : REM STORE IN DEVIATION ARRAY\\n210 NEXT N\\n220 LET DS=0: REM SUM OF DEVIATION ARRAY\\n230 FOR N = 0 TO 999\\n240 LET DS = DS + DE(N)\\n250 NEXT N\\n260 LET DM=0: REM MEAN OF DEVIATION ARRAY\\n270 LET DM = DS / 1000\\n280 LET DE = 0:\\n290 LET DE = SQR(DM)\\n300 :\\n310 PRINT \\\"MEAN = \\\"ME\\n320 PRINT \\\"STANDARD DEVIATION =\\\"DE\\n330 END\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"(loop for i from 1 to 1000\\n collect (1+ (* (sqrt (* -2 (log (random 1.0)))) (cos (* 2 pi (random 1.0))) 0.5)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"n, mean, sd, tau = 1000, 1, 0.5, (2 * Math::PI)\\narray = Array.new(n) { mean + sd * Math.sqrt(-2 * Math.log(rand)) * Math.cos(tau * rand) }\\n\\nmean = array.sum / array.size\\nstandev = Math.sqrt( array.sum{ |x| (x - mean) ** 2 } / array.size )\\nputs \\\"mean = #{mean}, standard deviation = #{standev}\\\"\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio, std.random, std.math;\\n\\nstruct NormalRandom {\\n double mean, stdDev;\\n\\n // Necessary because it also defines an opCall.\\n this(in double mean_, in double stdDev_) pure nothrow {\\n this.mean = mean_;\\n this.stdDev = stdDev_;\\n }\\n\\n double opCall() const /*nothrow*/ {\\n immutable r1 = uniform01, r2 = uniform01; // Not nothrow.\\n return mean + stdDev * sqrt(-2 * r1.log) * cos(2 * PI * r2);\\n }\\n}\\n\\nvoid main() {\\n double[1000] array;\\n auto nRnd = NormalRandom(1.0, 0.5);\\n foreach (ref x; array)\\n //x = nRnd;\\n x = nRnd();\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import tango.math.random.Random;\\n\\nvoid main() {\\n double[1000] list;\\n auto r = new Random();\\n foreach (ref l; list) {\\n r.normalSource!(double)()(l);\\n l = 1.0 + 0.5 * l;\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Randoms;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n Math;\\n\\nvar\\n Values: array[0..999] of Double;\\n I: Integer;\\n\\nbegin\\n// Randomize; Commented to obtain reproducible results\\n for I:= Low(Values) to High(Values) do\\n Values[I]:= RandG(1.0, 0.5); // Mean = 1.0, StdDev = 0.5\\n Writeln('Mean = ', Mean(Values):6:4);\\n Writeln('Std Deviation = ', StdDev(Values):6:4);\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"var values : array [0..999] of Float;\\nvar i : Integer;\\n\\nfor i := values.Low to values.High do\\n values[i] := RandG(1, 0.5);\\n\",\n \"language\": \"DWScript\"\n },\n {\n \"code\": \"accum [] for _ in 1..1000 { _.with(entropy.nextGaussian()) }\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"numfmt 5 0\\ne = 2.7182818284590452354\\nfor i = 1 to 1000\\n a[] &= 1 + 0.5 * sqrt (-2 * log10 randomf / log10 e) * cos (360 * randomf)\\n.\\nfor v in a[]\\n avg += v / len a[]\\n.\\nprint \\\"Average: \\\" & avg\\nfor v in a[]\\n s += pow (v - avg) 2\\n.\\ns = sqrt (s / len a[])\\nprint \\\"Std deviation: \\\" & s\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"class\\n\\tAPPLICATION\\n\\ninherit\\n\\tARGUMENTS\\n\\ncreate\\n\\tmake\\n\\nfeature {NONE} -- Initialization\\n\\n\\tl_time: TIME\\n\\tl_seed: INTEGER\\n\\tmath:DOUBLE_MATH\\n\\trnd:RANDOM\\n\\tSize:INTEGER\\n\\t\\tonce\\n\\t\\t\\tResult:= 1000\\n\\t\\tend\\n\\n\\tmake\\n\\t\\t\\t-- Run application.\\n\\t\\tlocal\\n\\t\\t\\tergebnis:ARRAY[DOUBLE]\\n\\t\\t\\ttavg: DOUBLE\\n\\t\\t\\tx: INTEGER\\n\\t\\t\\ttmp: DOUBLE\\n\\t\\t\\ttext : STRING\\n\\n\\t\\tdo\\n\\t\\t\\t-- initialize random generator\\n\\t\\t\\tcreate l_time.make_now\\n \\t\\t l_seed := l_time.hour\\n \\t\\t l_seed := l_seed * 60 + l_time.minute\\n \\t\\t l_seed := l_seed * 60 + l_time.second\\n \\t\\t l_seed := l_seed * 1000 + l_time.milli_second\\n \\t\\t create rnd.set_seed (l_seed)\\n\\n\\t\\t\\t-- initialize random number container and math\\n\\t\\t\\tcreate ergebnis.make_filled (0.0, 1, size)\\n\\t\\t\\ttavg := 0;\\n\\t\\t\\tcreate math\\n\\n\\t\\t\\tfrom\\n\\t\\t\\t\\tx := 1\\n\\t\\t\\tuntil\\n\\t\\t\\t\\tx > ergebnis.count\\n\\t\\t\\tloop\\n\\t\\t\\t\\ttmp := randomNormal / 2 + 1\\n\\t\\t\\t\\ttavg := tavg + tmp\\n\\t\\t\\t\\tergebnis.enter (tmp , x)\\n\\t\\t\\t\\tx := x + 1\\n\\t\\t\\tend\\n\\n\\t\\t\\ttavg := tavg / ergebnis.count\\n\\t\\t\\ttext := \\\"Average: \\\"\\n\\t\\t\\ttext.append_double (tavg)\\n\\t\\t\\ttext.append (\\\"%N\\\")\\n\\t\\t\\tprint(text)\\n\\n\\t\\t\\ttmp := 0\\n\\t\\t\\tfrom\\n\\t\\t\\t\\tx:= 1\\n\\t\\t\\tuntil\\n\\t\\t\\t\\tx > ergebnis.count\\n\\t\\t\\tloop\\n\\t\\t\\t\\ttmp := tmp + (ergebnis.item (x) - tavg)^2\\n\\t\\t\\t\\tx := x + 1\\n\\t\\t\\tend\\n\\n\\t\\t\\ttmp := math.sqrt (tmp / ergebnis.count)\\n\\t\\t\\ttext := \\\"Standard Deviation: \\\"\\n\\t\\t\\ttext.append_double (tmp)\\n\\t\\t\\ttext.append (\\\"%N\\\")\\n\\t\\t\\tprint(text)\\n\\n\\t\\tend\\n\\n\\trandomNormal:DOUBLE\\n\\n\\t\\tlocal\\n\\n \\t\\t first: DOUBLE\\n \\t\\t second: DOUBLE\\n\\n\\t\\tdo\\n rnd.forth\\n first := rnd.double_item\\n rnd.forth\\n second := rnd.double_item\\n\\n Result := math.cosine (2 * math.pi * first) * math.sqrt (-2 * math.log (second))\\n\\n\\t\\tend\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"import extensions;\\nimport extensions'math;\\n\\nrandomNormal()\\n{\\n ^ cos(2 * Pi_value * randomGenerator.nextReal())\\n * sqrt(-2 * ln(randomGenerator.nextReal()))\\n}\\n\\npublic program()\\n{\\n real[] a := new real[](1000);\\n\\n real tAvg := 0;\\n for (int x := 0; x < a.Length; x += 1)\\n {\\n a[x] := (randomNormal()) / 2 + 1;\\n tAvg += a[x]\\n };\\n\\n tAvg /= a.Length;\\n console.printLine(\\\"Average: \\\", tAvg);\\n\\n real s := 0;\\n for (int x := 0; x < a.Length; x += 1)\\n {\\n s += power(a[x] - tAvg, 2)\\n };\\n\\n s := sqrt(s / 1000);\\n\\n console.printLine(\\\"Standard Deviation: \\\", s);\\n\\n console.readChar()\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"defmodule Random do\\n def normal(mean, sd) do\\n {a, b} = {:rand.uniform, :rand.uniform}\\n mean + sd * (:math.sqrt(-2 * :math.log(a)) * :math.cos(2 * :math.pi * b))\\n end\\nend\\n\\nstd_dev = fn (list) ->\\n mean = Enum.sum(list) / length(list)\\n sd = Enum.reduce(list, 0, fn x,acc -> acc + (x-mean)*(x-mean) end) / length(list)\\n |> :math.sqrt\\n IO.puts \\\"Mean: #{mean},\\\\tStdDev: #{sd}\\\"\\n end\\n\\nxs = for _ <- 1..1000, do: Random.normal(1.0, 0.5)\\nstd_dev.(xs)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"xs = for _ <- 1..1000, do: 1.0 + :rand.normal * 0.5\\nstd_dev.(xs)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"mean(Values) ->\\n mean(tl(Values), hd(Values), 1).\\n\\nmean([], Acc, Length) ->\\n Acc / Length;\\nmean(Values, Acc, Length) ->\\n mean(tl(Values), hd(Values)+Acc, Length+1).\\n\\nvariance(Values) ->\\n Mean = mean(Values),\\n variance(Values, Mean, 0) / length(Values).\\n\\nvariance([], _, Acc) ->\\n Acc;\\nvariance(Values, Mean, Acc) ->\\n Diff = hd(Values) - Mean,\\n DiffSqr = Diff * Diff,\\n variance(tl(Values), Mean, Acc + DiffSqr).\\n\\nstddev(Values) ->\\n math:sqrt(variance(Values)).\\n\\nnormal(Mean, StdDev) ->\\n U = random:uniform(),\\n V = random:uniform(),\\n Mean + StdDev * ( math:sqrt(-2 * math:log(U)) * math:cos(2 * math:pi() * V) ). % Erlang's math:log is the natural logarithm.\\n\\nmain(_) ->\\n X = [ normal(1.0, 0.5) || _ <- lists:seq(1, 1000) ],\\n io:format(\\\"mean = ~w\\\\n\\\", [mean(X)]),\\n io:format(\\\"stddev = ~w\\\\n\\\", [stddev(X)]).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"PROGRAM DISTRIBUTION\\n\\n!\\n! for rosettacode.org\\n!\\n\\n! formulas taken from TI-59 Master Library manual\\n\\nCONST NUM_ITEM=1000\\n\\n!VAR SUMX#,SUMX2#,R1#,R2#,Z#,I%\\n\\nDIM A#[1000]\\n\\nBEGIN\\n! seeds random number generator with system time\\n RANDOMIZE(TIMER)\\n\\n PRINT(CHR$(12);) !CLS\\n SUMX#=0 SUMX2#=0\\n\\n FOR I%=1 TO NUM_ITEM DO\\n R1#=RND(1) R2#=RND(1)\\n Z#=SQR(-2*LOG(R1#))*COS(2*π*R2#)\\n A#[I%]=Z#/2+1 ! I want a normal distribution with\\n ! mean=1 and std.dev=0.5\\n SUMX#+=A#[I%] SUMX2#+=A#[I%]*A#[I%]\\n END FOR\\n\\n Z#=SUMX#/NUM_ITEM\\n\\n PRINT(\\\"Average is\\\";Z#)\\n PRINT(\\\"Standard dev. is\\\";SQR(SUMX2#/NUM_ITEM-Z#*Z#))\\n\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \">v=normal(1,1000)*0.5+1;\\n>mean(v), dev(v)\\n 1.00291801071\\n 0.498226876528\\n\",\n \"language\": \"Euler\"\n },\n {\n \"code\": \"include misc.e\\n\\nfunction RandomNormal()\\n atom x1, x2\\n x1 = rand(999999) / 1000000\\n x2 = rand(999999) / 1000000\\n return sqrt(-2*log(x1)) * cos(2*PI*x2)\\nend function\\n\\nconstant n = 1000\\nsequence s\\ns = repeat(0,n)\\nfor i = 1 to n do\\n s[i] = 1 + 0.5 * RandomNormal()\\nend for\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"let n = MathNet.Numerics.Distributions.Normal(1.0,0.5)\\nList.init 1000 (fun _->n.Sample())\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"let gaussianRand count =\\n let o = new System.Random()\\n let pi = System.Math.PI\\n let gaussrnd =\\n (fun _ -> 1. + 0.5 * sqrt(-2. * log(o.NextDouble())) * cos(2. * pi * o.NextDouble()))\\n [ for i in {0 .. (int count)} -> gaussrnd() ]\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: random ;\\n1000 [ 1.0 0.5 normal-random-float ] replicate\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"a = []\\nfor i in [0:1000] : a+= norm_rand_num()\\n\\nfunction norm_rand_num()\\n pi = 2*acos(0)\\n return 1 + (cos(2 * pi * random()) * pow(-2 * log(random()) ,1/2)) /2\\nend\\n\",\n \"language\": \"Falcon\"\n },\n {\n \"code\": \"class Main\\n{\\n static const Float PI := 0.0f.acos * 2 // we need to precompute PI\\n\\n static Float randomNormal ()\\n {\\n return (Float.random * PI * 2).cos * (Float.random.log * -2).sqrt\\n }\\n\\n public static Void main ()\\n {\\n mean := 1.0f\\n sd := 0.5f\\n Float[] values := [,] // this is the collection to fill with random numbers\\n 1000.times { values.add (randomNormal * sd + mean) }\\n }\\n}\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \"using [java] java.util::Random\\n\\nclass Main\\n{\\n Random generator := Random()\\n\\n Float randomNormal ()\\n {\\n return generator.nextGaussian\\n }\\n\\n public static Void main ()\\n {\\n rnd := Main() // create an instance of Main class, which holds the generator\\n mean := 1.0f\\n sd := 0.5f\\n Float[] values := [,] // this is the collection to fill with random numbers\\n 1000.times { values.add (rnd.randomNormal * sd + mean) }\\n }\\n}\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \"require random.fs\\nhere to seed\\n\\n-1. 1 rshift 2constant MAX-D\\t\\\\ or s\\\" MAX-D\\\" ENVIRONMENT? drop\\n\\n: frnd ( -- f )\\t\\t\\t\\\\ uniform distribution 0..1\\n rnd rnd dabs d>f MAX-D d>f f/ ;\\n\\n: frnd-normal ( -- f )\\t\\t\\\\ centered on 0, std dev 1\\n frnd pi f* 2e f* fcos\\n frnd fln -2e f* fsqrt f* ;\\n\\n: ,normals ( n -- )\\t\\t\\\\ store many, centered on 1, std dev 0.5\\n 0 do frnd-normal 0.5e f* 1e f+ f, loop ;\\n\\ncreate rnd-array 1000 ,normals\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"rnd rnd dabs d>f\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"PROGRAM Random\\n\\n INTEGER, PARAMETER :: n = 1000\\n INTEGER :: i\\n REAL :: array(n), pi, temp, mean = 1.0, sd = 0.5\\n\\n pi = 4.0*ATAN(1.0)\\n CALL RANDOM_NUMBER(array) ! Uniform distribution\\n\\n! Now convert to normal distribution\\n DO i = 1, n-1, 2\\n temp = sd * SQRT(-2.0*LOG(array(i))) * COS(2*pi*array(i+1)) + mean\\n array(i+1) = sd * SQRT(-2.0*LOG(array(i))) * SIN(2*pi*array(i+1)) + mean\\n array(i) = temp\\n END DO\\n\\n! Check mean and standard deviation\\n mean = SUM(array)/n\\n sd = SQRT(SUM((array - mean)**2)/n)\\n\\n WRITE(*, \\\"(A,F8.6)\\\") \\\"Mean = \\\", mean\\n WRITE(*, \\\"(A,F8.6)\\\") \\\"Standard Deviation = \\\", sd\\n\\nEND PROGRAM Random\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"function randg(mean,stddev: float): float;\\n\",\n \"language\": \"Free-Pascal-Lazarus\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nConst pi As Double = 3.141592653589793\\nRandomize\\n\\n' Generates normally distributed random numbers with mean 0 and standard deviation 1\\nFunction randomNormal() As Double\\n Return Cos(2.0 * pi * Rnd) * Sqr(-2.0 * Log(Rnd))\\nEnd Function\\n\\nDim r(0 To 999) As Double\\nDim sum As Double = 0.0\\n\\n' Generate 1000 normally distributed random numbers\\n' with mean 1 and standard deviation 0.5\\n' and calculate their sum\\nFor i As Integer = 0 To 999\\n r(i) = 1.0 + randomNormal/2.0\\n sum += r(i)\\nNext\\n\\nDim mean As Double = sum / 1000.0\\n\\nDim sd As Double\\nsum = 0.0\\n' Now calculate their standard deviation\\nFor i As Integer = 0 To 999\\n sum += (r(i) - mean) ^ 2.0\\nNext\\nsd = Sqr(sum/1000.0)\\n\\nPrint \\\"Mean is \\\"; mean\\nPrint \\\"Standard Deviation is\\\"; sd\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"a = new array[[1000], {|x| randomGaussian[1, 0.5]}]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"window 1\\n\\nlocal fn RandomZeroToOne as double\\n double result\\n cln result = (double)( (rand() % 100000 ) * 0.00001 );\\nend fn = result\\n\\nlocal fn RandomGaussian as double\\n double r = fn RandomZeroToOne\\nend fn = 1 + .5 * ( sqr( -2 * log(r) ) * cos( 2 * pi * r ) )\\n\\nlong i\\ndouble mean, std, a(1000)\\n\\nfor i = 1 to 1000\\n a(i) = fn RandomGaussian\\n mean += a(i)\\nnext\\nmean = mean / 1000\\n\\nfor i = 1 to 1000\\n std += ( a(i) - mean )^2\\nnext\\nstd = std / 1000\\n\\nprint \\\" Average: \\\"; mean\\nprint \\\"Standard Deviation: \\\"; std\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n \\\"math/rand\\\"\\n \\\"strings\\\"\\n \\\"time\\\"\\n)\\n\\nconst mean = 1.0\\nconst stdv = .5\\nconst n = 1000\\n\\nfunc main() {\\n var list [n]float64\\n rand.Seed(time.Now().UnixNano())\\n for i := range list {\\n list[i] = mean + stdv*rand.NormFloat64()\\n }\\n // show computed mean and stdv of list\\n var s, sq float64\\n for _, v := range list {\\n s += v\\n }\\n cm := s / n\\n for _, v := range list {\\n d := v - cm\\n sq += d * d\\n }\\n fmt.Printf(\\\"mean %.3f, stdv %.3f\\\\n\\\", cm, math.Sqrt(sq/(n-1)))\\n // show histogram by hdiv divisions per stdv over +/-hrange stdv\\n const hdiv = 3\\n const hrange = 2\\n var h [1 + 2*hrange*hdiv]int\\n for _, v := range list {\\n bin := hrange*hdiv + int(math.Floor((v-mean)/stdv*hdiv+.5))\\n if bin >= 0 && bin < len(h) {\\n h[bin]++\\n }\\n }\\n const hscale = 10\\n for _, c := range h {\\n fmt.Println(strings.Repeat(\\\"*\\\", (c+hscale/2)/hscale))\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"rnd = new Random()\\nresult = (1..1000).inject([]) { r, i -> r << rnd.nextGaussian() }\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import System.Random\\n\\npairs :: [a] -> [(a,a)]\\npairs (x:y:zs) = (x,y):pairs zs\\npairs _ = []\\n\\ngauss mu sigma (r1,r2) =\\n mu + sigma * sqrt (-2 * log r1) * cos (2 * pi * r2)\\n\\ngaussians :: (RandomGen g, Random a, Floating a) => Int -> g -> [a]\\ngaussians n g = take n $ map (gauss 1.0 0.5) $ pairs $ randoms g\\n\\nresult :: IO [Double]\\nresult = getStdGen >>= \\\\g -> return $ gaussians 1000 g\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"replicateM 1000 $ normal 1 0.5\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Random\\nimport Control.Monad\\n\\nthousandRandomNumbers :: RVar [Double]\\nthousandRandomNumbers = replicateM 1000 $ normal 1 0.5\\n\\nmain = do\\n x <- sample thousandRandomNumbers\\n print x\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"REAL :: n=1000, m=1, s=0.5, array(n)\\n\\npi = 4 * ATAN(1)\\narray = s * (-2*LOG(RAN(1)))^0.5 * COS(2*pi*RAN(1)) + m\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"procedure main()\\n local L\\n L := list(1000)\\n every L[1 to 1000] := 1.0 + 0.5 * sqrt(-2.0 * log(?0)) * cos(2.0 * &pi * ?0)\\n\\n every write(!L)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"result = 1.0 + 0.5*randomn(seed,1000)\\n\",\n \"language\": \"IDL\"\n },\n {\n \"code\": \"urand=: ?@$ 0:\\nzrand=: (2 o. 2p1 * urand) * [: %: _2 * [: ^. urand\\n\\n1 + 0.5 * zrand 100\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" require 'stats/distribs/normal'\\n 1 0.5 rnorm 1000\\n1.44868803 1.21548637 0.812460657 1.54295452 1.2470606 ...\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"double[] list = new double[1000];\\ndouble mean = 1.0, std = 0.5;\\nRandom rng = new Random();\\nfor(int i = 0;i<list.length;i++) {\\n list[i] = mean + std * rng.nextGaussian();\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function randomNormal() {\\n return Math.cos(2 * Math.PI * Math.random()) * Math.sqrt(-2 * Math.log(Math.random()))\\n}\\n\\nvar a = []\\nfor (var i=0; i < 1000; i++){\\n a[i] = randomNormal() / 2 + 1\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# 15-bit integers generated using the same formula as rand() from the Microsoft C Runtime.\\n# The random numbers are in [0 -- 32767] inclusive.\\n# Input: an array of length at least 2 interpreted as [count, state, ...]\\n# Output: [count+1, newstate, r] where r is the next pseudo-random number.\\ndef next_rand_Microsoft:\\n .[0] as $count | .[1] as $state\\n | ( (214013 * $state) + 2531011) % 2147483648 # mod 2^31\\n | [$count+1 , ., (. / 65536 | floor) ] ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Generate a single number following the normal distribution with mean 0, variance 1,\\n# using the Box-Muller method: X = sqrt(-2 ln U) * cos(2 pi V) where U and V are uniform on [0,1].\\n# Input: [n, state]\\n# Output [n+1, nextstate, r]\\ndef next_rand_normal:\\n def u: next_rand_Microsoft | .[2] /= 32767;\\n u as $u1\\n | ($u1 | u) as $u2\\n | ((( (8*(1|atan)) * $u1[2]) | cos)\\n * ((-2 * (($u2[2]) | log)) | sqrt)) as $r\\n | [ (.[0]+1), $u2[1], $r] ;\\n\\n# Generate \\\"count\\\" arrays, each containing a random normal variate with the given mean and standard deviation.\\n# Input: [count, state]\\n# Output: [updatedcount, updatedstate, rnv]\\n# where \\\"state\\\" is a seed and \\\"updatedstate\\\" can be used as a seed.\\ndef random_normal_variate(mean; sd; count):\\n next_rand_normal\\n | recurse( if .[0] < count then next_rand_normal else empty end)\\n | .[2] = (.[2] * sd) + mean;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def summary:\\n length as $l | add as $sum | ($sum/$l) as $a\\n | reduce .[] as $x (0; . + ( ($x - $a) | .*. ))\\n | [ $a, (./$l | sqrt)] ;\\n\\n[ [0,1] | random_normal_variate(1; 0.5; 1000) | .[2] ] | summary\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"randn(1000) * 0.5 + 1\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nimport java.util.Random\\n\\nfun main(args: Array<String>) {\\n val r = Random()\\n val da = DoubleArray(1000)\\n for (i in 0 until 1000) da[i] = 1.0 + 0.5 * r.nextGaussian()\\n // now check actual mean and SD\\n val mean = da.average()\\n val sd = Math.sqrt(da.map { (it - mean) * (it - mean) }.average())\\n println(\\\"Mean is $mean\\\")\\n println(\\\"S.D. is $sd\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"dim a(1000)\\nmean =1\\nsd =0.5\\nfor i = 1 to 1000 ' throw 1000 normal variates\\n a( i) =mean +sd *( sqr( -2 * log( rnd( 0))) * cos( 2 * pi * rnd( 0)))\\nnext i\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"-- Returns a random float value in range 0..1\\non randf ()\\n n = random(the maxinteger)-1\\n return n / float(the maxinteger-1)\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"normal = []\\nrepeat with i = 1 to 1000\\n normal.add(1 + sqrt(-2 * log(randf())) * cos(2 * PI * randf()) / 2)\\nend repeat\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"let mean = 1.0\\nlet stdv = 0.5\\nlet count = 1000\\n\\n// stats computes a running mean and variance\\n// See Knuth TAOCP vol 2, 3rd edition, page 232\\n\\ndef stats(xs: [float]) -> float, float: // variance, mean\\n var M = xs[0]\\n var S = 0.0\\n var n = 1.0\\n for(xs.length - 1) i:\\n let x = xs[i + 1]\\n n = n + 1.0\\n let mm = (x - M)\\n M += mm / n\\n S += mm * (x - M)\\n return (if n > 0.0: S / n else: 0.0), M\\n\\ndef test_random_normal() -> [float]:\\n rnd_seed(floor(seconds_elapsed() * 1000000))\\n let r = vector_reserve(typeof return, count)\\n for (count):\\n r.push(rnd_gaussian() * stdv + mean)\\n let cvar, cmean = stats(r)\\n let cstdv = sqrt(cvar)\\n print concat_string([\\\"Mean: \\\", string(cmean), \\\", Std.Deviation: \\\", string(cstdv)], \\\"\\\")\\n\\ntest_random_normal()\\n\",\n \"language\": \"Lobster\"\n },\n {\n \"code\": \"to random.float ; 0..1\\n localmake \\\"max.int lshift -1 -1\\n output quotient random :max.int :max.int\\nend\\n\\nto random.gaussian\\n output product cos random 360 sqrt -2 / ln random.float\\nend\\n\\nmake \\\"randoms cascade 1000 [fput random.gaussian / 2 + 1 ?] []\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"local list = {}\\nfor i = 1, 1000 do\\n list[i] = 1 + math.sqrt(-2 * math.log(math.random())) * math.cos(2 * math.pi * math.random()) / 2\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module CheckIt {\\n Function StdDev (A()) {\\n \\\\\\\\ A() has a copy of values\\n N=Len(A())\\n if N<1 then Error \\\"Empty Array\\\"\\n M=Each(A())\\n k=0\\n \\\\\\\\ make sum, dev same type as A(k)\\n sum=A(k)-A(k)\\n dev=sum\\n \\\\\\\\ find mean\\n While M {\\n sum+=Array(M)\\n }\\n Mean=sum/N\\n \\\\\\\\ make a pointet to A()\\n P=A()\\n \\\\\\\\ subtruct from each item\\n P-=Mean\\n\\n M=Each(P)\\n While M {\\n dev+=Array(M)*Array(M)\\n }\\n \\\\\\\\ as pointer to arrray\\n =(if(dev>0->Sqrt(dev/N), 0), Mean)\\n }\\n Function randomNormal {\\n \\\\\\\\ by default all numbers are double\\n \\\\\\\\ cos() get degrees\\n =1+Cos(360 * rnd) * Sqrt(-2 * Ln(rnd)) /2\\n }\\n \\\\\\\\ fill array calling randomNormal() for each item\\n Dim A(1000)<<randomNormal()\\n \\\\\\\\ we can pass a pointer to array and place it to stack of values\\n DisplayMeanAndStdDeviation(A()) ' mean ~ 1 std deviation ~0.5\\n \\\\\\\\ check M2000 rnd only\\n Dim B(1000)<<rnd\\n DisplayMeanAndStdDeviation(B()) ' mean ~ 0.5 std deviation ~0.28\\n\\n\\n DisplayMeanAndStdDeviation((0,0,14,14)) ' mean = 7 std deviation = 7\\n DisplayMeanAndStdDeviation((0,6,8,14)) ' mean = 7 std deviation = 5\\n DisplayMeanAndStdDeviation((6,6,8,8)) ' mean = 7 std deviation = 1\\n\\n Sub DisplayMeanAndStdDeviation(A)\\n \\\\\\\\ push to stack all items of an array (need an array pointer)\\n Push ! StdDev(A)\\n \\\\\\\\ read from strack two numbers\\n Print \\\"Mean is \\\"; Number\\n Print \\\"Standard Deviation is \\\"; Number\\n End Sub\\n}\\nCheckit\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"with(Statistics):\\nSample(Normal(1, 0.5), 1000);\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"1+0.5*ArrayTools[RandomArray](1000,1,distribution=normal);\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"RandomReal[NormalDistribution[1, 1/2], 1000]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \" mu = 1; sd = 0.5;\\n x = randn(1000,1) * sd + mu;\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \" x = normrnd(mu, sd, [1000,1]);\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"function randNum = randNorm(mu0,chi2, sz)\\n\\n radiusSquared = +Inf;\\n\\n while (radiusSquared >= 1)\\n u = ( 2 * rand(sz) ) - 1;\\n v = ( 2 * rand(sz) ) - 1;\\n\\n radiusSquared = u.^2 + v.^2;\\n end\\n\\n scaleFactor = sqrt( ( -2*log(radiusSquared) )./ radiusSquared );\\n randNum = (v .* scaleFactor .* chi2) + mu0;\\n\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \">> randNorm(1,.5, [1000,1])\\n\\nans =\\n\\n 0.693984121077029\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"load(distrib)$\\n\\nrandom_normal(1.0, 0.5, 1000);\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"arr = #()\\nfor i in 1 to 1000 do\\n(\\n a = random 0.0 1.0\\n b = random 0.0 1.0\\n c = 1.0 + 0.5 * sqrt (-2*log a) * cos (360*b) -- Maxscript cos takes degrees\\n append arr c\\n)\\n\",\n \"language\": \"MAXScript\"\n },\n {\n \"code\": \"numeric col[];\\n\\nm := 0; % m holds the mean, for testing purposes\\nfor i = 1 upto 1000:\\n col[i] := 1 + .5normaldeviate;\\n m := m + col[i];\\nendfor\\n\\n% testing\\nm := m / 1000; % finalize the computation of the mean\\n\\ns := 0; % in s we compute the standard deviation\\nfor i = 1 upto 1000:\\n s := s + (col[i] - m)**2;\\nendfor\\ns := sqrt(s / 1000);\\n\\nshow m, s; % and let's show that really they get what we wanted\\nend\\n\",\n \"language\": \"Metafont\"\n },\n {\n \"code\": \"10 REM Random numbers\\n20 LET P = 4*ATN(1)\\n30 RANDOMIZE\\n40 DEF FNN = COS(2*P*RND)*SQR(-2*LOG(RND))\\n50 DIM R(999)\\n60 LET S = 0\\n70 FOR I = 0 TO 999\\n80 LET R(I) = 1+FNN/2\\n90 LET S = S+R(I)\\n100 NEXT I\\n110 LET M = S/1000\\n120 LET S = 0\\n130 FOR I = 0 TO 999\\n140 LET S = S+(R(I)-M)^2\\n150 NEXT I\\n160 LET D = SQR(S/1000)\\n170 PRINT \\\"Mean is \\\"; M\\n180 PRINT \\\"Standard Deviation is\\\"; D\\n190 PRINT\\n200 END\\n\",\n \"language\": \"Minimal-BASIC\"\n },\n {\n \"code\": \"randNormal = function(mean=0, stddev=1)\\n return mean + sqrt(-2 * log(rnd,2.7182818284)) * cos(2*pi*rnd) * stddev\\nend function\\n\\nx = []\\nfor i in range(1,1000)\\n x.push randNormal(1, 0.5)\\nend for\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"import java.util.Random\\n\\nlist = double[999]\\nmean = 1.0\\nstd = 0.5\\nrng = Random.new\\n0.upto(998) do | i |\\n list[i] = mean + std * rng.nextGaussian\\nend\\n\",\n \"language\": \"Mirah\"\n },\n {\n \"code\": \"MODULE Rand EXPORTS Main;\\n\\nIMPORT Random;\\nFROM Math IMPORT log, cos, sqrt, Pi;\\n\\nVAR rands: ARRAY [1..1000] OF LONGREAL;\\n\\n(* Normal distribution. *)\\nPROCEDURE RandNorm(): LONGREAL =\\n BEGIN\\n WITH rand = NEW(Random.Default).init() DO\\n RETURN\\n sqrt(-2.0D0 * log(rand.longreal())) * cos(2.0D0 * Pi * rand.longreal());\\n END;\\n END RandNorm;\\n\\nBEGIN\\n FOR i := FIRST(rands) TO LAST(rands) DO\\n rands[i] := 1.0D0 + 0.5D0 * RandNorm();\\n END;\\nEND Rand.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"list = {0} * 1000\\nmean = 1.0; std = 0.5\\nrng = new(Nanoquery.Util.Random)\\n\\nfor i in range(0, len(list) - 1)\\n list[i] = mean + std * rng.getGaussian()\\nend\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary\\n\\nimport java.math.BigDecimal\\nimport java.math.MathContext\\n\\n-- prologue\\nnumeric digits 20\\n\\n-- get input, set defaults\\nparse arg dp mu sigma ec .\\nif mu = '' | mu = '.' then mean = 1.0; else mean = mu\\nif sigma = '' | sigma = '.' then stdDeviation = 0.5; else stdDeviation = sigma\\nif dp = '' | dp = '.' then displayPrecision = 1; else displayPrecision = dp\\nif ec = '' | ec = '.' then elements = 1000; else elements = ec\\n\\n-- set up\\nRNG = Random()\\nnumberList = java.util.List\\nnumberList = ArrayList()\\n\\n-- generate list of random numbers\\nloop for elements\\n rn = mean + stdDeviation * RNG.nextGaussian()\\n numberList.add(BigDecimal(rn, MathContext.DECIMAL128))\\n end\\n\\n-- report\\nsay \\\"Mean: \\\" mean\\nsay \\\"Standard Deviation:\\\" stdDeviation\\nsay \\\"Precision: \\\" displayPrecision\\nsay\\ndrawBellCurve(numberList, displayPrecision)\\n\\nreturn\\n\\n-- -----------------------------------------------------------------------------\\nmethod drawBellCurve(numberList = java.util.List, precision) static\\n Collections.sort(numberList)\\n val = BigDecimal\\n lastN = ''\\n nextN = ''\\n loop val over numberList\\n nextN = Rexx(val.toPlainString()).format(5, precision)\\n select\\n when lastN = '' then nop\\n when lastN \\\\= nextN then say lastN\\n otherwise nop\\n end\\n say '*\\\\-'\\n lastN = nextN\\n end val\\n say lastN\\n\\n return\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"(normal 1 .5 1000)\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"import random, stats, strformat\\n\\nvar rs: RunningStat\\n\\nrandomize()\\n\\nfor _ in 1..5:\\n for _ in 1..1000: rs.push gauss(1.0, 0.5)\\n echo &\\\"mean: {rs.mean:.5f} stdDev: {rs.standardDeviation:.5f}\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"bundle Default {\\n class RandomNumbers {\\n function : Main(args : String[]) ~ Nil {\\n rands := Float->New[1000];\\n for(i := 0; i < rands->Size(); i += 1;) {\\n rands[i] := 1.0 + 0.5 * RandomNormal();\\n };\\n\\n each(i : rands) {\\n rands[i]->PrintLine();\\n };\\n }\\n\\n function : native : RandomNormal() ~ Float {\\n return (2 * Float->Pi() * Float->Random())->Cos() * (-2 * (Float->Random()->Log()))->SquareRoot();\\n }\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"let pi = 4. *. atan 1.;;\\nlet random_gaussian () =\\n 1. +. sqrt (-2. *. log (Random.float 1.)) *. cos (2. *. pi *. Random.float 1.);;\\nlet a = Array.init 1000 (fun _ -> random_gaussian ());;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"p = normrnd(1.0, 0.5, 1000, 1);\\ndisp(mean(p));\\ndisp(sqrt(sum((p - mean(p)).^2)/numel(p)));\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"/*REXX pgm gens 1,000 normally distributed #s: mean=1, standard dev.=0.5*/\\n pi=RxCalcPi() /* get value of pi */\\n Parse Arg n seed . /* allow specification of N & seed*/\\n If n==''|n==',' Then\\n n=1000 /* N is the size of the array. */\\n If seed\\\\=='' Then\\n Call random,,seed /* use seed for repeatable RANDOM#*/\\n mean=1 /* desired new mean (arith. avg.) */\\n sd=1/2 /* desired new standard deviation.*/\\n Do g=1 For n /* generate N uniform random nums.*/\\n n.g=random(0,1e5)/1e5 /* REXX gens uniform rand integers*/\\n End\\n\\n Say ' old mean=' mean()\\n Say 'old standard deviation=' stddev()\\n Say\\n Do j=1 To n-1 By 2\\n m=j+1\\n /*use Box-Muller method */\\n _=sd*RxCalcPower(-2*RxCalcLog(n.j),.5)*RxCalcCos(2*pi*n.m,,'R')+mean\\n n.m=sd*RxCalcpower(-2*RxCalcLog(n.j),.5)*RxCalcSin(2*pi*n.m,,'R')+,\\n mean /* rand # must be 0???1. */\\n n.j=_\\n End /* j */\\n Say ' new mean=' mean()\\n Say 'new standard deviation=' stddev()\\n Exit\\nmean:\\n _=0\\n Do k=1 For n\\n _=_+n.k\\n End\\n Return _/n\\nstddev:\\n _avg=mean()\\n _=0\\n Do k=1 For n\\n _=_+(n.k-_avg)**2\\n End\\n Return RxCalcPower(_/n,.5)\\n\\n:: requires rxmath library\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"/*REXX pgm gens 1,000 normally distributed #s: mean=1, standard dev.=0.5*/\\n pi=RxCalcPi() /* get value of pi */\\n Parse Arg n seed . /* allow specification of N & seed*/\\n If n==''|n==',' Then\\n n=1000 /* N is the size of the array. */\\n If seed\\\\=='' Then\\n Call random,,seed /* use seed for repeatable RANDOM#*/\\n mean=1 /* desired new mean (arith. avg.) */\\n sd=1/2 /* desired new standard deviation.*/\\n Do g=1 For n /* generate N uniform random nums.*/\\n n.g=random(0,1e5)/1e5 /* REXX gens uniform rand integers*/\\n End\\n\\n Say ' old mean=' mean()\\n Say 'old standard deviation=' stddev()\\n Say\\n Do j=1 To n-1 By 2\\n m=j+1\\n /*use Box-Muller method */\\n _=sd*sqrt(-2*ln(n.j))*cos(2*pi*n.m)+mean\\n n.m=sd*sqrt(-2*ln(n.j))*sin(2*pi*n.m)+mean\\n n.j=_\\n End\\n Say ' new mean=' mean()\\n Say 'new standard deviation=' stddev()\\n Exit\\nmean:\\n _=0\\n Do k=1 For n\\n _=_+n.k\\n End\\n Return _/n\\nstddev:\\n _avg=mean()\\n _=0\\n Do k=1 For n\\n _=_+(n.k-_avg)**2\\n End\\n Return sqrt(_/n)\\n\\nsqrt: Return RxCalcSqrt(arg(1))\\nln: Return RxCalcLog(arg(1))\\ncos: Return RxCalcCos(arg(1),,'R')\\nsin: Return RxCalcSin(arg(1),,'R')\\n\\n:: requires rxmath library\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"rnormal()={\\n\\tmy(pr=32*ceil(default(realprecision)*log(10)/log(4294967296)),u1=random(2^pr)*1.>>pr,u2=random(2^pr)*1.>>pr);\\n\\tsqrt(-2*log(u1))*cos(2*Pi*u2) \\\\\\\\ in previous version \\\"u1\\\" instead of \\\"u2\\\" was used --> has given crap distribution\\n\\t\\\\\\\\ Could easily be extended with a second normal at very little cost.\\n};\\nvector(1000,unused,rnormal()/2+1)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"function rnorm (mean, sd: real): real;\\n {Calculates Gaussian random numbers according to the Box-Müller approach}\\nvar\\n u1, u2: real;\\nbegin\\n u1 := random;\\n u2 := random;\\n rnorm := mean * abs(1 + sqrt(-2 * (ln(u1))) * cos(2 * pi * u2) * sd);\\n /* error !?! Shouldn't it be \\\"mean +\\\" instead of \\\"mean *\\\" ? */\\nend;\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"my $PI = 2 * atan2 1, 0;\\n\\nmy @nums = map {\\n 1 + 0.5 * sqrt(-2 * log rand) * cos(2 * $PI * rand)\\n} 1..1000;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">RandomNormal</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">sqrt</span><span style=\\\"color: #0000FF;\\\">(-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #7060A8;\\\">log</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">rnd</span><span style=\\\"color: #0000FF;\\\">()))</span> <span style=\\\"color: #0000FF;\\\">*</span> <span style=\\\"color: #7060A8;\\\">cos</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">PI</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #7060A8;\\\">rnd</span><span style=\\\"color: #0000FF;\\\">())</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1000</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">0.5</span> <span style=\\\"color: #0000FF;\\\">*</span> <span style=\\\"color: #000000;\\\">RandomNormal</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\ndef RandomNormal\\n drop rand log -2 * sqrt 2 pi * rand * cos * 0.5 * 1 +\\nenddef\\n\\n1000 var n\\n0 n repeat\\n\\ngetid RandomNormal map\\n\\ndup\\nsum n / var mean\\n\\\"Mean: \\\" print mean print nl\\n\\n0 swap n for\\n get mean - 2 power rot + swap\\nendfor\\nswap n / sqrt \\\"Standard deviation: \\\" print print\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"function random() {\\n return mt_rand() / mt_getrandmax();\\n}\\n\\n$pi \\t= pi(); // Set PI\\n\\n$a = array();\\nfor ($i = 0; $i < 1000; $i++) {\\n $a[$i] = 1.0 + ((sqrt(-2 * log(random())) * cos(2 * $pi * random())) * 0.5);\\n\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"main =>\\n _ = random2(), % random seed\\n G = [gaussian_dist(1,0.5) : _ in 1..1000],\\n println(first_10=G[1..10]),\\n println([mean=avg(G),stdev=stdev(G)]),\\n nl.\\n\\n% Gaussian (Normal) distribution, Box-Muller algorithm\\ngaussian01() = Y =>\\n U = frand(0,1),\\n V = frand(0,1),\\n Y = sqrt(-2*log(U))*sin(2*math.pi*V).\\n\\ngaussian_dist(Mean,Stdev) = Mean + (gaussian01() * Stdev).\\n\\n% Variance of Xs\\nvariance(Xs) = Variance =>\\n Mu = avg(Xs),\\n N = Xs.len,\\n Variance = sum([ (X-Mu)**2 : X in Xs ]) / N.\\n\\n% Standard deviation\\nstdev(Xs) = sqrt(variance(Xs)).\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(load \\\"@lib/math.l\\\")\\n\\n(de randomNormal () # Normal distribution, centered on 0, std dev 1\\n (*/\\n (sqrt (* -2.0 (log (rand 0 1.0))))\\n (cos (*/ 2.0 pi (rand 0 1.0) `(* 1.0 1.0)))\\n 1.0 ) )\\n\\n(seed (time)) # Randomize\\n\\n(let Result\\n (make # Build list\\n (do 1000 # of 1000 elements\\n (link (+ 1.0 (/ (randomNormal) 2))) ) )\\n (for N (head 7 Result) # Print first 7 results\\n (prin (format N *Scl) \\\" \\\") ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"/* CONVERTED FROM WIKI FORTRAN */\\nNormal_Random: procedure options (main);\\n declare (array(1000), pi, temp,\\n mean initial (1.0), sd initial (0.5)) float (18);\\n declare (i, n) fixed binary;\\n\\n n = hbound(array, 1);\\n pi = 4.0*ATAN(1.0);\\n array = random(); /* Uniform distribution */\\n /* Now convert to normal distribution */\\n DO i = 1 to n-1 by 2;\\n temp = sd * SQRT(-2.0*LOG(array(i))) * COS(2*pi*array(i+1)) + mean;\\n array(i+1) = sd * SQRT(-2.0*LOG(array(i))) * SIN(2*pi*array(i+1)) + mean;\\n array(i) = temp;\\n END;\\n /* Check mean and standard deviation */\\n mean = SUM(array)/n;\\n sd = SQRT(SUM((array - mean)**2)/n);\\n put skip edit ( \\\"Mean = \\\", mean ) (a, F(18,16) );\\n put skip edit ( \\\"Standard Deviation = \\\", sd) (a, F(18,16));\\nEND Normal_Random;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"DECLARE\\n --The desired collection\\n type t_coll is table of number index by binary_integer;\\n l_coll t_coll;\\n\\n c_max pls_integer := 1000;\\nBEGIN\\n FOR l_counter IN 1 .. c_max\\n LOOP\\n -- dbms_random.normal delivers normal distributed random numbers with a mean of 0 and a variance of 1\\n -- We just adjust the values and get the desired result:\\n l_coll(l_counter) := DBMS_RANDOM.normal * 0.5 + 1;\\n DBMS_OUTPUT.put_line (l_coll(l_counter));\\n END LOOP;\\nEND;\\n\",\n \"language\": \"PL-SQL\"\n },\n {\n \"code\": \";;; Choose radians as arguments to trigonometic functions\\ntrue -> popradians;\\n\\n;;; procedure generating standard normal distribution\\ndefine random_normal() -> result;\\nlvars r1 = random0(1.0), r2 = random0(1.0);\\n cos(2*pi*r1)*sqrt(-2*log(r2)) -> result\\nenddefine;\\n\\nlvars array, i;\\n\\n;;; Put numbers on the stack\\nfor i from 1 to 1000 do 1.0+0.5*random_normal() endfor;\\n;;; collect them into array\\nconsvector(1000) -> array;\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \"function Get-RandomNormal\\n {\\n [CmdletBinding()]\\n Param ( [double]$Mean, [double]$StandardDeviation )\\n\\n $RandomNormal = $Mean + $StandardDeviation * [math]::Sqrt( -2 * [math]::Log( ( Get-Random -Minimum 0.0 -Maximum 1.0 ) ) ) * [math]::Cos( 2 * [math]::PI * ( Get-Random -Minimum 0.0 -Maximum 1.0 ) )\\n\\n return $RandomNormal\\n }\\n\\n# Standard deviation function for testing\\nfunction Get-StandardDeviation\\n {\\n [CmdletBinding()]\\n param ( [double[]]$Numbers )\\n\\n $Measure = $Numbers | Measure-Object -Average\\n $PopulationDeviation = 0\\n ForEach ($Number in $Numbers) { $PopulationDeviation += [math]::Pow( ( $Number - $Measure.Average ), 2 ) }\\n $StandardDeviation = [math]::Sqrt( $PopulationDeviation / ( $Measure.Count - 1 ) )\\n return $StandardDeviation\\n }\\n\\n# Test\\n$RandomNormalNumbers = 1..1000 | ForEach { Get-RandomNormal -Mean 1 -StandardDeviation 0.5 }\\n\\n$Measure = $RandomNormalNumbers | Measure-Object -Average\\n\\n$Stats = [PSCustomObject]@{\\n Count = $Measure.Count\\n Average = $Measure.Average\\n StandardDeviation = Get-StandardDeviation -Numbers $RandomNormalNumbers\\n}\\n\\n$Stats | Format-List\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Procedure.f RandomNormal()\\n ; This procedure can return any real number.\\n Protected.f x1, x2\\n\\n ; random numbers from the open interval ]0, 1[\\n x1 = (Random(999998)+1) / 1000000 ; must be > 0 because of Log(x1)\\n x2 = (Random(999998)+1) / 1000000\\n\\n ProcedureReturn Sqr(-2*Log(x1)) * Cos(2*#PI*x2)\\nEndProcedure\\n\\nDefine i, n=1000\\n\\nDim a.q(n-1)\\nFor i = 0 To n-1\\n a(i) = 1 + 0.5 * RandomNormal()\\nNext\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \">>> import random\\n>>> values = [random.gauss(1, .5) for i in range(1000)]\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \">>> def quick_check(numbers):\\n count = len(numbers)\\n mean = sum(numbers) / count\\n sdeviation = (sum((i - mean)**2 for i in numbers) / count)**0.5\\n return mean, sdeviation\\n\\n>>> quick_check(values)\\n(1.0140373306786599, 0.49943411329234066)\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \">>> values = [ random.normalvariate(1, 0.5) for i in range(1000)]\\n>>> quick_check(values)\\n(0.990099111944864, 0.5029847005836282)\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"# For reproducibility, set the seed:\\nset.seed(12345L)\\n\\nresult <- rnorm(1000, mean = 1, sd = 0.5)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(for/list ([i 1000])\\n (add1 (* (sqrt (* -2 (log (random)))) (cos (* 2 pi (random))) 0.5)))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#lang racket\\n(require math/distributions)\\n(sample (normal-dist 1.0 0.5) 1000)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub randnorm ($mean, $stddev) {\\n $mean + $stddev * sqrt(-2 * log rand) * cos(2 * pi * rand)\\n}\\n\\nmy @nums = randnorm(1, 0.5) xx 1000;\\n\\n# Checking\\nsay my $mean = @nums R/ [+] @nums;\\nsay my $stddev = sqrt $mean**2 R- @nums R/ [+] @nums X** 2;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"define PI\\n -1 acos\\n\\ndefine rand1\\n 9999999 choose 1 + 10000000.0 /\\n\\ndefine randNormal\\n rand1 PI * 2 * cos\\n rand1 log -2 * sqrt\\n *\\n 2 / 1 +\\n\\n1000 each drop randNormal \\\"%f\\\\n\\\" print\\n\",\n \"language\": \"Raven\"\n },\n {\n \"code\": \"raven rand.rv | awk '{sum+=$1; sumsq+=$1*$1;} END {print \\\"stdev = \\\" sqrt(sumsq/NR - (sum/NR)**2); print \\\"mean = \\\" sum/NR}'\\nstdev = 0.497773\\nmean = 1.01497\\n\",\n \"language\": \"Raven\"\n },\n {\n \"code\": \"let pi = 4.0 *. atan(1.0)\\n\\nlet random_gaussian = () => {\\n 1.0 +.\\n sqrt(-2.0 *. log(Random.float(1.0))) *.\\n cos(2.0 *. pi *. Random.float(1.0))\\n}\\n\\nlet a = Belt.Array.makeBy(1000, (_) => random_gaussian ())\\n\\nfor i in 0 to 10 {\\n Js.log(a[i])\\n}\\n\",\n \"language\": \"ReScript\"\n },\n {\n \"code\": \"/*REXX pgm generates 1,000 normally distributed numbers: mean=1, standard deviation=½.*/\\nnumeric digits 20 /*the default decimal digit precision=9*/\\nparse arg n seed . /*allow specification of N and the seed*/\\nif n=='' | n==\\\",\\\" then n=1000 /*N: is the size of the array. */\\nif datatype(seed,'W') then call random ,,seed /*SEED: for repeatable random numbers. */\\nnewMean=1 /*the desired new mean (arithmetic avg)*/\\nsd=1/2 /*the desired new standard deviation. */\\n do g=1 for n /*generate N uniform random #'s (0,1].*/\\n #.g = random(1, 1e5) / 1e5 /*REXX's RANDOM BIF generates integers.*/\\n end /*g*/ /* [↑] random integers ──► fractions. */\\nsay ' old mean=' mean()\\nsay 'old standard deviation=' stdDev()\\ncall pi; pi2=pi * 2 /*define pi and also 2 * pi. */\\nsay\\n do j=1 to n-1 by 2; m=j+1 /*step through the iterations by two. */\\n _=sd * sqrt(ln(#.j) * -2) /*calculate the used-twice expression.*/\\n #.j=_ * cos(pi2 * #.m) + newMean /*utilize the Box─Muller method. */\\n #.m=_ * sin(pi2 * #.m) + newMean /*random number must be: (0,1] */\\n end /*j*/\\nsay ' new mean=' mean()\\nsay 'new standard deviation=' stdDev()\\nexit /*stick a fork in it, we're all done. */\\n/*───────────────────────────────────────────────────────────────────────────────────────────────────────────────────*/\\nmean: _=0; do k=1 for n; _=_ + #.k; end; return _/n\\nstdDev: _avg=mean(); _=0; do k=1 for n; _=_ + (#.k - _avg)**2; end; return sqrt(_/n)\\ne: e =2.7182818284590452353602874713526624977572470936999595749669676277240766303535; return e /*digs overkill*/\\npi: pi=3.1415926535897932384626433832795028841971693993751058209749445923078164062862; return pi /* \\\" \\\" */\\nr2r: return arg(1) // (pi() * 2) /*normalize ang*/\\nsin: procedure; parse arg x;x=r2r(x);numeric fuzz min(5,digits()-3);if abs(x)=pi then return 0;return .sincos(x,x,1)\\n.sincos:parse arg z,_,i; x=x*x; p=z; do k=2 by 2; _=-_*x/(k*(k+i)); z=z+_; if z=p then leave; p=z; end; return z\\n/*───────────────────────────────────────────────────────────────────────────────────────────────────────────────────*/\\nln: procedure; parse arg x,f; call e; ig= x>1.5; is=1 - 2 * (ig\\\\==1); ii=0; xx=x\\n do while ig&xx>1.5|\\\\ig&xx<.5;_=e;do k=-1;iz=xx*_**-is;if k>=0&(ig&iz<1|\\\\ig&iz>.5) then leave;_=_*_;izz=iz;end\\n xx=izz;ii=ii+is*2**k;end;x=x*e**-ii-1;z=0;_=-1;p=z;do k=1;_=-_*x;z=z+_/k;if z=p then leave;p=z;end; return z+ii\\n/*───────────────────────────────────────────────────────────────────────────────────────────────────────────────────*/\\ncos: procedure; parse arg x; x=r2r(x); a=abs(x); hpi=pi * .5\\n numeric fuzz min(6, digits() - 3); if a=pi then return -1\\n if a=hpi | a=hpi*3 then return 0; if a=pi/3 then return .5\\n if a=pi * 2/3 then return -.5; return .sinCos(1,1,-1)\\n/*───────────────────────────────────────────────────────────────────────────────────────────────────────────────────*/\\nsqrt: procedure; parse arg x; if x=0 then return 0; d=digits(); numeric digits; h=d+6\\n numeric form; parse value format(x,2,1,,0) 'E0' with g 'E' _ .; g=g * .5'e'_ %2\\n m.=9; do j=0 while h>9; m.j=h; h=h%2 + 1; end /*j*/\\n do k=j+5 to 0 by -1; numeric digits m.k; g=(g+x/g)*.5; end /*k*/\\n numeric digits d; return g/1\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"for i = 1 to 10\\n see random(i) + nl\\nnext i\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"Array.new(1000) { 1 + Math.sqrt(-2 * Math.log(rand)) * Math.cos(2 * Math::PI * rand) }\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"dim a(1000)\\npi = 22/7\\nfor i = 1 to 1000\\n a( i) = 1 + .5 * (sqr(-2 * log(rnd(0))) * cos(2 * pi * rnd(0)))\\nnext i\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"extern crate rand;\\nuse rand::distributions::{Normal, IndependentSample};\\n\\nfn main() {\\n let mut rands = [0.0; 1000];\\n let normal = Normal::new(1.0, 0.5);\\n let mut rng = rand::thread_rng();\\n for num in rands.iter_mut() {\\n *num = normal.ind_sample(&mut rng);\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"extern crate rand;\\nuse rand::distributions::{Normal, IndependentSample};\\n\\nfn main() {\\n let rands: Vec<_> = {\\n let normal = Normal::new(1.0, 0.5);\\n let mut rng = rand::thread_rng();\\n (0..1000).map(|_| normal.ind_sample(&mut rng)).collect()\\n };\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"/* Generate 1000 random numbers with mean 1 and standard deviation 0.5.\\n SAS version 9.2 was used to create this code.*/\\n\\ndata norm1000;\\n call streaminit(123456);\\n/* Set the starting point, so we can replicate results.\\n If you want different results each time, comment the above line. */\\n do i=1 to 1000;\\n r=rand('normal',1,0.5);\\n output;\\n end;\\nrun;\\n\",\n \"language\": \"SAS\"\n },\n {\n \"code\": \"class MAIN is\\n main is\\n a:ARRAY{FLTD} := #(1000);\\n i:INT;\\n\\n RND::seed(2010);\\n loop i := 1.upto!(1000) - 1;\\n a[i] := 1.0d + 0.5d * RND::standard_normal;\\n end;\\n\\n -- testing the distribution\\n mean ::= a.reduce(bind(_.plus(_))) / a.size.fltd;\\n #OUT + \\\"mean \\\" + mean + \\\"\\\\n\\\";\\n a.map(bind(_.minus(mean)));\\n a.map(bind(_.pow(2.0d)));\\n dev ::= (a.reduce(bind(_.plus(_))) / a.size.fltd).sqrt;\\n #OUT + \\\"dev \\\" + dev + \\\"\\\\n\\\";\\n end;\\nend;\\n\",\n \"language\": \"Sather\"\n },\n {\n \"code\": \"List.fill(1000)(1.0 + 0.5 * scala.util.Random.nextGaussian)\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"object RandomNumbers extends App {\\n\\n val distribution: LazyList[Double] = {\\n def randomNormal: Double = 1.0 + 0.5 * scala.util.Random.nextGaussian\\n\\n def normalDistribution(a: Double): LazyList[Double] = a #:: normalDistribution(randomNormal)\\n\\n normalDistribution(randomNormal)\\n }\\n\\n /*\\n * Let's test it\\n */\\n def calcAvgAndStddev[T](ts: Iterable[T])(implicit num: Fractional[T]): (T, Double) = {\\n val mean: T =\\n num.div(ts.sum, num.fromInt(ts.size)) // Leaving with type of function T\\n\\n // Root of mean diffs\\n val stdDev = Math.sqrt(ts.map { x =>\\n val diff = num.toDouble(num.minus(x, mean))\\n diff * diff\\n }.sum / ts.size)\\n\\n (mean, stdDev)\\n }\\n\\n println(calcAvgAndStddev(distribution.take(1000))) // e.g. (1.0061433267806525,0.5291834867560893)\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"; linear congruential generator given in C99 section 7.20.2.1\\n(define ((c-rand seed)) (set! seed (remainder (+ (* 1103515245 seed) 12345) 2147483648)) (quotient seed 65536))\\n\\n; uniform real numbers in open interval (0, 1)\\n(define (unif-rand seed) (let ((r (c-rand seed))) (lambda () (/ (+ (r) 1) 32769.0))))\\n\\n; Box-Muller method to generate normal distribution\\n(define (normal-rand unif m s)\\n(let ((? #t) (! 0.0) (twopi (* 2.0 (acos -1.0))))\\n(lambda ()\\n (set! ? (not ?))\\n (if ? !\\n (let ((a (sqrt (* -2.0 (log (unif))))) (b (* twopi (unif))))\\n (set! ! (+ m (* s a (sin b))))\\n (+ m (* s a (cos b))))))))\\n\\n(define rnorm (normal-rand (unif-rand 0) 1.0 0.5))\\n\\n; auxiliary function to get a list of 'n random numbers from generator 'r\\n(define (rand-list r n) = (if (zero? n) '() (cons (r) (rand-list r (- n 1)))))\\n\\n(define v (rand-list rnorm 1000))\\n\\nv\\n#|\\n(-0.27965824722565835\\n -0.8870860825789542\\n 0.6499618744638194\\n 0.31336141955110863\\n ...\\n 0.5648743998193049\\n 0.8282656735558756\\n 0.6399951934564637\\n 0.7699535302478072)\\n|#\\n\\n; check mean and standard deviation\\n(define (mean-sdev v)\\n(let loop ((v v) (a 0) (b 0) (n 0))\\n(if (null? v)\\n (let ((mean (/ a n)))\\n (list mean (sqrt (/ (- b (* n mean mean)) (- n 1)))))\\n (let ((x (car v)))\\n (loop (cdr v) (+ a x) (+ b (* x x)) (+ n 1))))))\\n\\n(mean-sdev v)\\n; (0.9562156817697293 0.5097087109575911)\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"float.s7i\\\";\\n include \\\"math.s7i\\\";\\n\\nconst func float: frand is func # Uniform distribution, (0..1]\\n result\\n var float: frand is 0.0;\\n begin\\n repeat\\n frand := rand(0.0, 1.0);\\n until frand <> 0.0;\\n end func;\\n\\nconst func float: randomNormal is # Normal distribution, centered on 0, std dev 1\\n return sqrt(-2.0 * log(frand)) * cos(2.0 * PI * frand);\\n\\nconst proc: main is func\\n local\\n var integer: i is 0;\\n var array float: rands is 1000 times 0.0;\\n begin\\n for i range 1 to length(rands) do\\n rands[i] := 1.0 + 0.5 * randomNormal;\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"var arr = 1000.of { 1 + (0.5 * sqrt(-2 * 1.rand.log) * cos(Num.tau * 1.rand)) }\\narr.each { .say }\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"val seed = 0w42;\\nval gen = Rand.mkRandom seed;\\nfun random_gaussian () =\\n 1.0 + Math.sqrt (~2.0 * Math.ln (Rand.norm (gen ()))) * Math.cos (2.0 * Math.pi * Rand.norm (gen ()));\\nval a = List.tabulate (1000, fn _ => random_gaussian ());\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"val seed = (47,42);\\nval gen = Random.rand seed;\\nfun random_gaussian () =\\n 1.0 + Math.sqrt (~2.0 * Math.ln (Random.randReal gen)) * Math.cos (2.0 * Math.pi * Random.randReal gen);\\nval a = List.tabulate (1000, fn _ => random_gaussian ());\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"val urandomlist = fn seed => fn n =>\\nlet\\n\\tval uniformdeviate = fn seed =>\\n\\tlet\\n\\t val in31m = (Real.fromInt o Int32.toInt ) (getOpt (Int32.maxInt,0) );\\n\\t val in31 = in31m +1.0;\\n\\t val s1 = 41160.0;\\n\\t val s2 = 950665216.0;\\n\\t val v = Real.realFloor seed;\\n\\t val val1 = v*s1;\\n\\t val val2 = v*s2;\\n\\t val next1 = Real.fromLargeInt (Real.toLargeInt IEEEReal.TO_NEGINF (val1/in31)) ;\\n\\t val next2 = Real.rem(Real.realFloor(val2/in31) , in31m );\\n\\t val valt = val1+val2 - (next1+next2)*in31m;\\n\\t val nextt = Real.realFloor(valt/in31m);\\n\\t val valt = valt - nextt*in31m;\\n\\tin\\n\\t (valt/in31m,valt)\\n\\tend;\\nval store = ref (0.0,0.0);\\nval rec u = fn S => fn 0 => [] | n=> (store:=uniformdeviate S; (#1 (!store)):: (u (#2 (!store)) (n-1))) ;\\nin\\n\\tu seed n\\nend;\\n\\nlocal\\n\\topen Math\\nin\\n\\tval bmconv = fn urand => fn vrand => 1.0+0.5*(sqrt(~2.0*ln urand)*cos (2.0*pi*vrand) )\\nend;\\n\\nval rec makeNormals = fn once => fn u::v::[] => [once u v] |\\n\\tu::v::rm => (once u v )::(makeNormals once rm );\\n\\nval anyrealseed=1009.0 ;\\nmakeNormals bmconv (urandomlist anyrealseed 2000);\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"clear all\\nset obs 1000\\ngen x=rnormal(1,0.5)\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"a = rnormal(1000,1,1,0.5)\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"package require Tcl 8.5\\nvariable ::pi [expr acos(0)]\\nproc ::tcl::mathfunc::nrand {} {\\n expr {sqrt(-2*log(rand())) * cos(2*$::pi*rand())}\\n}\\n\\nset mean 1.0\\nset stddev 0.5\\nfor {set i 0} {$i < 1000} {incr i} {\\n lappend result [expr {$mean + $stddev*nrand()}]\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"for (%i = 0; %i < 1000; %i++)\\n\\t%list[%i] = 1 + mSqrt(-2 * mLog(getRandom())) * mCos(2 * $pi * getRandom());\\n\",\n \"language\": \"TorqueScript\"\n },\n {\n \"code\": \"#import nat\\n#import flo\\n\\npop_stats(\\\"mu\\\",\\\"sigma\\\") = plus/*\\\"mu\\\"+ times/*\\\"sigma\\\"+ Z*+ iota\\n\\nsample_stats(\\\"mu\\\",\\\"sigma\\\") = plus^*D(minus/\\\"mu\\\"+ mean,~&)+ vid^*D(div\\\\\\\"sigma\\\"+ stdev,~&)+ Z*+ iota\\n\\n#cast %eWL\\n\\ntest =\\n\\n^(mean,stdev)* <\\n pop_stats(1.,0.5) 1000,\\n sample_stats(1.,0.5) 1000>\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"import crypto.rand\\n\\nfn main() {\\n\\tmut nums := []u64{}\\n\\tfor _ in 0..1000 {\\n\\t\\tnums << rand.int_u64(10000) or {0} // returns random unsigned 64-bit integer from real OS source of entropy\\n\\t}\\n\\tprintln(nums)\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"LOCAL i As Integer, m As Double, n As Integer, sd As Double\\npy = PI()\\nSET TALK OFF\\nSET DECIMALS TO 6\\nCREATE CURSOR gdev (deviate B(6))\\nRAND(-1)\\nn = 1000\\nm = 1\\nsd = 0.5\\nCLEAR\\nFOR i = 1 TO n\\n\\tINSERT INTO gdev VALUES (GaussDev(m, 1/sd))\\nENDFOR\\nCALCULATE AVG(deviate), STD(deviate) TO m, sd\\n? \\\"Mean\\\", m, \\\"Std Dev\\\", sd\\nSET TALK ON\\nSET DECIMALS TO\\n\\nFUNCTION GaussDev(mean As Double, sdev As Double) As Double\\nLOCAL z As Double\\nz = SQRT(-2*LOG(RAND()))*COS(py*RAND())\\nIF sdev # 0\\n\\tz = mean + z/sdev\\nENDIF\\nRETURN z\\t\\nENDFUNC\\n\",\n \"language\": \"Visual-FoxPro\"\n },\n {\n \"code\": \"import \\\"random\\\" for Random\\n\\nvar rand = Random.new()\\n\\nvar randNormal = Fn.new { (-2 * rand.float().log).sqrt * (2 * Num.pi * rand.float()).cos }\\n\\nvar stdDev = Fn.new { |a, m|\\n var c = a.count\\n return ((a.reduce(0) { |acc, x| acc + x*x } - m*m*c) / c).sqrt\\n}\\n\\nvar n = 1000\\nvar numbers = List.filled(n, 0)\\nvar mu = 1\\nvar sigma = 0.5\\nvar sum = 0\\nfor (i in 0...n) {\\n numbers[i] = mu + sigma*randNormal.call()\\n sum = sum + numbers[i]\\n}\\nvar mean = sum / n\\nSystem.print(\\\"Actual mean : %(mean)\\\")\\nSystem.print(\\\"Actual std dev: %(stdDev.call(numbers, mean))\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"define PI = 3.14159265358979323846;\\n\\nfunc real DRand; \\\\Uniform distribution, [0..1]\\nreturn float(Ran(1_000_000)) / 1e6;\\n\\nfunc real RandomNormal; \\\\Normal distribution, centered on 0, std dev 1\\nreturn sqrt(-2.*Log(DRand)) * Cos(2.*PI*DRand);\\n\\nint I;\\nreal Rands(1000);\\nfor I:= 0 to 1000-1 do\\n Rands(I):= 1.0 + 0.5*RandomNormal\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"func random_normal(count) {\\n return sqrt(-2*log(random(count))) * cos(2*pi*random(count));\\n}\\n\",\n \"language\": \"Yorick\"\n },\n {\n \"code\": \"fcn mkRand(mean,sd){ //normally distributed random w/mean & standard deviation\\n pi:=(0.0).pi; // using the Box–Muller transform\\n rz1:=fcn{1.0-(0.0).random(1)} // from [0,1) to (0,1]\\n return('wrap(){((-2.0*rz1().log()).sqrt() * (2.0*pi*rz1()).cos())*sd + mean })\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"var g=mkRand(1,0.5);\\nns:=(0).pump(1000,List,g); // 1000 rands with mean==1 & sd==1/2\\nmean:=(ns.sum(0.0)/1000); //-->1.00379\\n // calc sd of list of numbers:\\n(ns.reduce('wrap(p,n){p+(n-mean).pow(2)},0.0)/1000).sqrt() //-->0.494844\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"10 RANDOMIZE 0 : REM seeds random number generator based on uptime\\n20 DIM a(1000)\\n30 CLS\\n40 FOR i = 1 TO 1000\\n50 LET a(i) = 1 + SQR(-2 * LN(RND)) * COS(2 * PI * RND)\\n60 NEXT i\\n\",\n \"language\": \"ZX-Spectrum-Basic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Random-numbers"}}},{"rowIdx":1558,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Random_sentence_from_book\n","language":"00-META"},{"code":"* Read in the book \"[http://www.gutenberg.org/files/36/36-0.txt The War of the Worlds]\", by H. G. Wells.\n* Skip to the start of the book, proper.\n* Remove extraneous punctuation, but keep at least sentence-ending punctuation characters . ! and ?\n* Keep account of what words follow words and how many times it is seen, (treat sentence terminators as words too).\n* Keep account of what words follow ''two'' words and how many times it is seen, (again treating sentence terminators as words too).\n* Assume that a sentence starts with a not to be shown full-stop character then ''use a weighted random choice'' of the possible words that may follow a full-stop to add to the sentence.\n* Then repeatedly add words to the sentence based on weighted random choices of what words my follow the last two words to extend the sentence.\n* Stop after adding a sentence ending punctuation character.\n* Tidy and then print the sentence.\n\n\nShow examples of random sentences generated.\n\n;Related task\n* [[Markov_chain_text_generator]]\n\n\n","language":"00-TASK"},{"code":"# generate random sentences using text from a book as a basis #\n\n# use the associative array in the Associate array/iteration task #\nPR read \"aArray.a68\" PR\n\n# returns s with chars removed #\nPRIO REMOVE = 1;\nOP REMOVE = ( STRING s, chars )STRING:\n BEGIN\n [ LWB s : UPB s ]CHAR result;\n INT r pos := LWB result - 1;\n FOR s pos FROM LWB s TO UPB s DO\n IF NOT char in string( s[ s pos ], NIL, chars ) THEN\n # have a character that needn't be removed #\n r pos +:= 1;\n result[ r pos ] := s[ s pos ]\n FI\n OD;\n result[ LWB s : r pos ]\n END # REMOVE # ;\n# returns text converted to an INT or -1 if text is not a number #\nOP TOINT = ( STRING text )INT:\n BEGIN\n INT result := 0;\n BOOL is numeric := TRUE;\n FOR ch pos FROM LWB text TO UPB text WHILE is numeric DO\n CHAR c = text[ ch pos ];\n is numeric := ( c >= \"0\" AND c <= \"9\" );\n IF is numeric THEN ( result *:= 10 ) +:= ABS c - ABS \"0\" FI\n OD;\n IF is numeric THEN result ELSE -1 FI\n END # TOINT # ;\n\n# get the file name and number of words for the prefix and #\n# max number of words and sentences from the command line #\nSTRING file name := \"twotw.txt\";\nSTRING start word := \"\";\nINT prefix length := 2;\nINT number of sentences := 10;\nINT max words := 1 000 000;\nFOR arg pos TO argc - 1 DO\n STRING arg upper := argv( arg pos );\n FOR ch pos FROM LWB arg upper TO UPB arg upper DO\n IF is lower( arg upper[ ch pos ] ) THEN arg upper[ ch pos ] := to upper( arg upper[ ch pos ] ) FI\n OD;\n IF arg upper = \"FILE\" THEN\n file name := argv( arg pos + 1 )\n ELIF arg upper = \"PREFIX\" THEN\n prefix length := TOINT argv( arg pos + 1 )\n ELIF arg upper = \"SENTENCES\" THEN\n number of sentences := TOINT argv( arg pos + 1 )\n ELIF arg upper = \"MAXWORDS\" THEN\n max words := TOINT argv( arg pos + 1 )\n ELIF arg upper = \"STARTWORD\" THEN\n start word := argv( arg pos + 1 )\n FI\nOD;\n\n# delimiter for separating suffixes - must not appear in the text #\nCHAR suffix delimiter = REPR 1; # ^A #\nSTRING punctuation = \"\"\"'@,/;:(){}[]*&^%$£\";\n\nIF FILE input file;\n open( input file, file name, stand in channel ) /= 0\nTHEN\n # failed to open the file #\n print( ( \"Unable to open \"\"\" + file name + \"\"\"\", newline ) )\nELSE\n # file opened OK #\n BOOL at eof := FALSE;\n BOOL at eol := FALSE;\n # set the EOF handler for the file #\n on logical file end( input file\n , ( REF FILE f )BOOL:\n BEGIN\n # note that we reached EOF on the #\n # latest read #\n at eof := TRUE;\n # return TRUE so processing can continue #\n TRUE\n END\n );\n # set the end-of-line handler for the file so get word can see line boundaries #\n on line end( input file\n , ( REF FILE f )BOOL:\n BEGIN\n # note we reached end-of-line #\n at eol := TRUE;\n # return FALSE to use the default eol handling #\n # i.e. just get the next charactefr #\n FALSE\n END\n );\n CHAR c := \" \";\n # returns the next word from input file #\n # a word is any sequence of characters separated by spaces and #\n # suffix delimiters, or one of the characters \".\", \"!\" or \"?\" #\n PROC get word = STRING:\n IF at eof THEN \"\"\n ELSE # not at end of file #\n STRING word := \"\";\n at eol := FALSE;\n IF c = \".\" OR c = \"!\" OR c = \"?\" THEN\n # sentence ending \"word\" #\n word := c;\n get( input file, ( c ) )\n ELSE\n # \"normal\" word #\n WHILE ( c = \" \" OR c = suffix delimiter ) AND NOT at eof DO get( input file, ( c ) ) OD;\n WHILE c /= \" \"\n AND c /= \".\"\n AND c /= \"!\"\n AND c /= \"?\"\n AND c /= suffix delimiter\n AND NOT at eol\n AND NOT at eof\n DO\n word +:= c;\n get( input file, ( c ) )\n OD\n FI;\n at eol := FALSE;\n word\n FI # get word # ;\n\n # returns a random number between 1 and n inclusive #\n PROC random choice = ( INT n )INT: IF n < 2 THEN n ELSE ENTIER ( ( next random * n ) + 1 ) FI;\n\n # chooses a suffix at random to continue a sentence #\n PROC choose suffix = ( STRING sfxs )STRING:\n BEGIN\n # count the number of suffixes #\n INT suffix max := 0;\n FOR s pos FROM LWB sfxs TO UPB sfxs DO\n IF sfxs[ s pos ] = suffix delimiter THEN suffix max +:= 1 FI\n OD;\n # select a random suffix to continue the text with #\n STRING sfx := \"\";\n INT prev pos := LWB sfxs - 1;\n INT suffix count := random choice( suffix max );\n FOR s pos FROM LWB sfxs TO UPB sfxs WHILE suffix count > 0 DO\n IF sfxs[ s pos ] = suffix delimiter THEN\n # found the end of a suffix #\n sfx := sfxs[ prev pos + 1 : s pos - 1 @ 1 ];\n prev pos := s pos;\n suffix count -:= 1\n FI\n OD;\n sfx\n END # choose suffix # ;\n\n # skip to the start word, if there is one #\n IF start word /= \"\" THEN WHILE NOT at eof AND get word /= start word DO SKIP OD FI;\n # get the first prefix from the file #\n [ prefix length ]STRING prefix;\n FOR p pos TO prefix length WHILE NOT at eof DO prefix[ p pos ] := get word OD;\n IF at eof THEN\n # not enough words in the file #\n print( ( file name, \" contains less than \", whole( prefix length, 0 ), \" words\", newline ) )\n ELSE\n # have some words #\n INT word count := prefix length;\n # store the prefixes and suffixes in the associatibe array #\n # we store the suffix as a single concatenated #\n # string delimited by suffix delimiters, the string will #\n # have a leading delimiter #\n # suffixes that appear multiple times in the input text will #\n # appear multiple time in the array, this will allow them to #\n # have a higher probability than suffixes that appear fewer #\n # times #\n # this will use more memory than storing the sufixes and a #\n # count, but simplifies the generation #\n # with a prefix length of 2 (as required by the task), #\n # the War Of The Worlds can be processed - for longer prefix #\n # lengths a less memory hungry algorithm would be needed #\n REF AARRAY suffixes := INIT LOC AARRAY;\n INT prefix count := 0;\n WHILE NOT at eof AND word count <= max words\n DO\n # concatenate the prefix words to a single string #\n STRING prefix text := prefix[ 1 ];\n FOR p pos FROM 2 TO prefix length DO prefix text +:= ( \" \" + prefix[ p pos ] ) OD;\n STRING suffix := get word;\n # if the prefix has no lower case, ignore it as it is #\n # probably a chapter heading or similar #\n IF BOOL has lowercase := FALSE;\n FOR s pos FROM LWB prefix text TO UPB prefix text\n WHILE NOT ( has lowercase := is lower( prefix text[ s pos ] ) )\n DO SKIP OD;\n has lowercase\n THEN\n # the prefix contains some lower case #\n # store the suffixes associated with the prefix #\n IF NOT ( suffixes CONTAINSKEY prefix text ) THEN\n # first time this prefix has appeared #\n prefix count +:= 1\n FI;\n IF prefix[ 1 ] = \".\" OR prefix[ 1 ] = \"!\" OR prefix[ 1 ] = \"?\" THEN\n # have the start of a sentence #\n suffixes // \"*.\" +:= ( suffix delimiter + prefix text )\n FI;\n STRING prefix without punctuation = prefix text REMOVE punctuation;\n IF prefix without punctuation /= \"\" THEN prefix text := prefix without punctuation FI;\n suffixes // prefix text +:= ( suffix delimiter + suffix )\n FI;\n # shuffle the prefixes down one and add the new suffix #\n # as the final prefix #\n FOR p pos FROM 2 TO prefix length DO prefix[ p pos - 1 ] := prefix[ p pos ] OD;\n prefix[ prefix length ] := suffix;\n IF NOT at eof THEN word count +:= 1 FI\n OD;\n\n # generate text #\n TO number of sentences DO\n print( ( newline ) );\n # start with a random prefix #\n STRING pfx := choose suffix( suffixes // \"*.\" );\n STRING line := pfx[ @ 1 ][ 3 : ]; # remove the leading #\n # \". \" from the line #\n pfx := pfx REMOVE punctuation;\n BOOL finished := FALSE;\n WHILE NOT finished DO\n IF STRING sfxs := ( suffixes // pfx );\n IF LWB sfxs <= UPB sfxs THEN\n IF sfxs[ LWB sfxs ] = suffix delimiter THEN sfxs := sfxs[ LWB sfxs + 1 : ] FI\n FI;\n sfxs +:= suffix delimiter;\n sfxs = suffix delimiter\n THEN\n # no suffix - reached the end of the generated text #\n line +:= \" (\" + pfx + \" has no suffix)\";\n finished := TRUE\n ELSE\n # can continue to generate text #\n STRING sfx = choose suffix( sfxs );\n IF sfx = \".\" OR sfx = \"!\" OR sfx = \"?\"\n THEN\n # reached the end of a sentence #\n finished := TRUE;\n # if the line ends with \",;:\", remove it #\n INT line end := UPB line;\n IF CHAR c = line[ line end ]; c = \",\" OR c = \";\" OR c = \":\" THEN\n line end -:= 1\n FI;\n # remove trailing spaces #\n WHILE line[ line end ] = \" \" AND line end > LWB line DO line end -:= 1 OD;\n line := line[ LWB line : line end ] + sfx\n ELSE\n # not at the end of the sentence #\n line +:= \" \" + sfx;\n # remove the first word from the prefix and add #\n # the suffix #\n IF INT space pos := 0;\n NOT char in string( \" \", space pos, pfx )\n THEN\n # the prefix is only one word #\n pfx := sfx\n ELSE\n # have multiple words #\n pfx := ( pfx[ space pos + 1 : ] + \" \" + sfx )[ @ 1 ]\n FI;\n STRING pfx without punctuation = pfx REMOVE punctuation;\n IF pfx without punctuation /= \"\" THEN pfx := pfx without punctuation FI\n FI\n FI\n OD;\n print( ( line, newline ) )\n OD\n FI;\n close( input file )\nFI\n","language":"ALGOL-68"},{"code":"#NoEnv\n#SingleInstance, force\n\t\t\t\t; press Esc to stop and display the output text\n\t\t\t\t; (a debug file describing ongoing steps will be created in the end)\nFileEncoding, UTF-8\nFileRead, warWords, war of words.txt ; wrapped booktext\nglobal textOut := \" \"\nglobal warWords := strreplace(warWords,\"`r`n\", \" \")\nwarWords := strreplace(warWords,\"`r\", \" \")\nwarWords := strreplace(warWords,\"`n\", \" \")\nwarWords := strreplace(warWords,\"-\", \" \")\nwarWords := strreplace(warWords,\"—\", \" \")\nwarWords := strreplace(warWords,\"`t\", \" \")\nwarWords := strreplace(warWords,\"“\")\nwarWords := strreplace(warWords,\"_\")\nwarWords := strreplace(warWords,\"”\")\nwarWords := strreplace(warWords,\"’\")\nwarWords := strreplace(warWords,\"'\")\nwarWords := strreplace(warWords,\"\"\"\")\nwarWords := strreplace(warWords,\")\")\nwarWords := strreplace(warWords,\"(\")\nwarWords := strreplace(warWords,\"[\")\nwarWords := strreplace(warWords,\"]\")\nwarWords := strreplace(warWords,\"{\")\nwarWords := strreplace(warWords,\"}\")\nwarWords := strreplace(warWords,\"»\")\nwarWords := strreplace(warWords,\"«\")\nwarWords := trim(warWords)\nLoop\n{\n\twarWords := strreplace(warWords,\" \", \" \")\n\tif (Errorlevel = 0)\n\t\tbreak\n}\nFileDelete, debug.txt\nInputBox, fOne, War of Words, Choice a punctuation to start ( . or ! or ? or `, ),,,,,,,,.\ntreco := NextPunct(fOne)\nLoop\n{\nloop,parse,treco,\" \"\n\tif A_LoopField\n\t\tfOne := trim(A_LoopField)\ntextOut .= fOne . \" \"\ntremPos := InStr(textOut,\" \",,0,3)\ntremText := trim(substr(textOut,tremPos))\nif tremText\n\t{\n\t\ttremText := strreplace(tremText,\".\",\"\\.\")\n\t\ttremText := strreplace(tremText,\";\",\"\\;\")\n\t\ttremText := strreplace(tremText,\",\",\"\\,\")\n\t\ttremText := strreplace(tremText,\"!\",\"\\!\")\n\t\ttremText := \" \" . strreplace(tremText,\"?\",\"\\?\")\n\t\ttreco := NextWord(tremText)\n\t}\nelse\n\ttreco := NextWord(fOne)\n}\n\nNextPunct(punct) {\nxpos := 1\nprox := []\nLoop\n{\n\tspos := RegExMatch(warWords, \"(*UCP)\\\" . punct . \" \\w+.\",gg,xpos)\n\tif (spos = 0)\n\t\tbreak\n\tprox[a_index] := gg\n\txpos := spos + 1\n}\nproximas := \"\"\nloop, % prox.MaxIndex()\n\tproximas .= a_index . \" -> \" . prox[a_index] . \"`n\"\nFileAppend, %proximas%, debug.txt, UTF-8\nRandom, linha, 1, prox.MaxIndex()\nFileAppend, % \"---------------`nescolhido = \" . linha . \" -> \" . prox[linha] . \" -> \" . textOut . \"`n----------------`n\", debug.txt, UTF-8\nreturn prox[linha]\n}\n\nNextWord(word) {\nxpos := 1\nprox := []\nloop\n{\n\tspos := RegExMatch(warWords, \"(*UCP)\" . word . \" \\w+.\",gg,xpos)\n\tif !spos\n\t\tbreak\n\tprox[a_index] := gg\n\txpos := spos + 1\n}\n\nif (prox.MaxIndex() > 0)\n{\nproximas := \"\"\nloop, % prox.MaxIndex()\n\tproximas .= a_index . \" -> \" . prox[a_index] . \"`n\"\nFileAppend, %proximas%, debug.txt, UTF-8\nRandom, linha, 1, prox.MaxIndex()\nFileAppend, % \"---------------`nescolhido = \" . linha . \" -> \" . prox[linha] . \" -> \" . textOut . \"`n----------------`n\", debug.txt, UTF-8\nreturn % prox[linha]\n}\t\n\nloop,parse,word,\" \"\n\twrd := A_LoopField\nword := wrd\nspos := xpos := 1\nprox := []\nloop\n{\n\tspos := RegExMatch(warWords, \"(*UCP)\" . word . \" \\w+.\",gg,xpos)\n\tif (spos = 0)\n\t\tbreak\n\tprox[a_index] := gg\n\txpos := spos + 1\n}\nproximas := \"\"\nloop, % prox.MaxIndex()\n\tproximas .= a_index . \" -> \" . prox[a_index] . \"`n\"\nFileAppend, %proximas%, debug.txt, UTF-8\nRandom, linha, 1, prox.MaxIndex()\nFileAppend, % \"---------------`nescolhido = \" . linha . \" -> \" . prox[linha] . \" -> \" . textOut . \"`n----------------`n\", debug.txt, UTF-8\nreturn % prox[linha]\n}\n\nExitApp\n\n~Esc::\nmsgbox % textOut . \"...\"\nExitApp\n","language":"ALGOL-68"},{"code":"\"\"\" weighted random pick of items in a Dict{String, Int} where keys are words, values counts \"\"\"\nfunction weightedrandompick(dict, total)\n n = rand(1:total)\n for (key, value) in dict\n n -= value\n if n <= 0\n return key\n end\n end\n return last(keys(dict))\nend\n\nlet\n \"\"\" Read in the book \"The War of the Worlds\", by H. G. Wells. \"\"\"\n wotw_uri = \"http://www.gutenberg.org/files/36/36-0.txt\"\n wfile = \"war_of_the_worlds.txt\"\n stat(wfile).size == 0 && download(wotw_uri, wfile) # download if file not here already\n text = read(wfile, String)\n\n \"\"\"skip to start of book and prune end \"\"\"\n startphrase, endphrase = \"No one would have believed\", \"she has counted me, among the dead\"\n text = text[findfirst(startphrase, text).start:findlast(endphrase, text).stop]\n\n \"\"\" Remove extraneous punctuation, but keep at least sentence-ending punctuation characters . ! and ? \"\"\"\n text = replace(replace(text, r\"[^01-9a-zA-Z\\.\\?\\!’,]\" => \" \"), r\"([.?!])\" => s\" \\1\")\n words = split(text, r\"\\s+\")\n for (i, w) in enumerate(words)\n w != \"I\" && i > 1 && words[i - 1] in [\".\", \"?\", \"!\"] && (words[i] = lowercase(words[i]))\n end\n\n \"\"\" Keep account of what words follow words and how many times it is seen. Treat sentence terminators\n (?.!) as words too. Keep account of what words follow two words and how many times it is seen.\n \"\"\"\n follows, follows2 = Dict{String, Dict{String, Int}}(), Dict{String, Dict{String, Int}}()\n afterstop, wlen = Dict{String, Int}(), length(words)\n for (i, w) in enumerate(@view words[1:end-1])\n d = get!(follows, w, Dict(words[i + 1] => 0))\n get!(d, words[i + 1], 0)\n d[words[i + 1]] += 1\n if w in [\".\", \"?\", \"!\"]\n d = get!(afterstop, words[i + 1], 0)\n afterstop[words[i + 1]] += 1\n end\n (i > wlen - 2) && continue\n w2 = w * \" \" * words[i + 1]\n d = get!(follows2, w2, Dict(words[i + 2] => 0))\n get!(d, words[i + 2], 0)\n d[words[i + 2]] += 1\n end\n followsums = Dict(key => sum(values(follows[key])) for key in keys(follows))\n follow2sums = Dict(key => sum(values(follows2[key])) for key in keys(follows2))\n afterstopsum = sum(values(afterstop))\n\n \"\"\" Assume that a sentence starts with a not to be shown full-stop character then use a weighted\n random choice of the possible words that may follow a full-stop to add to the sentence.\n \"\"\"\n function makesentence()\n firstword = weightedrandompick(afterstop, afterstopsum)\n sentencewords = [firstword, weightedrandompick(follows[firstword], followsums[firstword])]\n while !(sentencewords[end] in [\".\", \"?\", \"!\"])\n w2 = sentencewords[end-1] * \" \" * sentencewords[end]\n if haskey(follows2, w2)\n push!(sentencewords, weightedrandompick(follows2[w2], follow2sums[w2]))\n else\n push!(sentencewords, weightedrandompick(afterstop, afterstopsum))\n end\n end\n sentencewords[1] = uppercase(firstword[1]) * (length(firstword) > 1 ? firstword[2:end] : \"\")\n println(join(sentencewords[1:end-1], \" \") * sentencewords[end] * \"\\n\")\n end\n # Print 3 weighted random pick sentences\n makesentence(); makesentence(); makesentence()\nend\n","language":"Julia"},{"code":"import random, sequtils, strutils, tables\nfrom unicode import utf8\n\nconst StopChars = [\".\", \"?\", \"!\"]\n\nproc weightedChoice(choices: CountTable[string]; totalCount: int): string =\n ## Return a string from \"choices\" key using counts as weights.\n var n = rand(1..totalCount)\n for word, count in choices.pairs:\n dec n, count\n if n <= 0: return word\n assert false, \"internal error\"\n\nproc finalFilter(words: seq[string]): seq[string] =\n ## Eliminate words of length one (except those of a given list)\n ## and words containing only uppercase letters (words from titles).\n for word in words:\n if word in [\".\", \"?\", \"!\", \"I\", \"A\", \"a\"]:\n result.add word\n elif word.len > 1 and any(word, isLowerAscii):\n result.add word\n\n\nrandomize()\n\nvar text = readFile(\"The War of the Worlds.txt\")\n\n# Extract the actual text from the book.\nconst\n StartText = \"BOOK ONE\\r\\nTHE COMING OF THE MARTIANS\"\n EndText = \"End of the Project Gutenberg EBook\"\nlet startIndex = text.find(StartText)\nlet endIndex = text.find(EndText)\ntext = text[startIndex..<endIndex]\n\n# Clean the text by removing some characters and replacing others.\n# As there are some non ASCII characters, we have to apply special rules.\nvar processedText: string\nfor uchar in text.utf8():\n if uchar.len == 1:\n # ASCII character.\n let ch = uchar[0]\n case ch\n of '0'..'9', 'a'..'z', 'A'..'Z', ' ': processedText.add ch # Keep as is.\n of '\\n': processedText.add ' ' # Replace with a space.\n of '.', '?', '!': processedText.add ' ' & ch # Make sure these characters are isolated.\n else: discard # Remove others.\n else:\n # Some UTF-8 representation of a non ASCII character.\n case uchar\n of \"—\": processedText.add ' ' # Replace EM DASH with space.\n of \"ç\", \"æ\", \"’\": processedText.add uchar # Keep these characters as they are parts of words.\n of \"“\", \"”\", \"‘\": discard # Removed these ones.\n else: echo \"encountered: \", uchar # Should not go here.\n\n# Extract words and filter them.\nlet words = processedText.splitWhitespace().finalFilter()\n\n# Build count tables.\nvar followCount, followCount2: Table[string, CountTable[string]]\nfor i in 1..words.high:\n followCount.mgetOrPut(words[i - 1], initCountTable[string]()).inc(words[i])\nfor i in 2..words.high:\n followCount2.mgetOrPut(words[i - 2] & ' ' & words[i - 1], initCountTable[string]()).inc words[i]\n\n# Build sum tables.\nvar followSum, followSum2: CountTable[string]\nfor key in followCount.keys:\n for count in followCount[key].values:\n followSum.inc key, count\nfor key in followCount2.keys:\n for count in followCount2[key].values:\n followSum2.inc key, count\n\n# Build table of starting words and compute the sum.\nvar\n startingWords: CountTable[string]\n startingSum: int\nfor stopChar in StopChars:\n for word, count in followCount[stopChar].pairs:\n startingWords.inc word, count\n inc startingSum, count\n\n# Build a sentence.\nlet firstWord = weightedChoice(startingWords, startingSum)\nvar sentence = @[firstWord]\nvar lastWord = weightedChoice(followCount[firstWord], followSum[firstWord])\nwhile lastWord notin StopChars:\n sentence.add lastWord\n let key = sentence[^2] & ' ' & lastWord\n lastWord = if key in followCount2:\n weightedChoice(followCount2[key], followSum2[key])\n else:\n weightedChoice(followCount[lastWord], followSum[lastWord])\necho sentence.join(\" \") & lastWord\n","language":"Nim"},{"code":"#!/usr/bin/perl\n\nuse strict; # https://rosettacode.org/wiki/Random_sentence_from_book\nuse warnings;\n\nmy $book = do { local (@ARGV, $/) = 'waroftheworlds.txt'; <> };\nmy (%one, %two);\n\ns/^.*?START OF THIS\\N*\\n//s, s/END OF THIS.*//s,\n tr/a-zA-Z.!?/ /c, tr/ / /s for $book;\n\nmy $qr = qr/(\\b\\w+\\b|[.!?])/;\n$one{$1}{$2}++, $two{$1}{$2}{$3}++ while $book =~ /$qr(?= *$qr *$qr)/g;\n\nsub weightedpick\n {\n my $href = shift;\n my @weightedpick = map { ($_) x $href->{$_} } keys %$href;\n $weightedpick[rand @weightedpick];\n }\n\nsub sentence\n {\n my @sentence = qw( . ! ? )[rand 3];\n push @sentence, weightedpick( $one{ $sentence[0] } );\n push @sentence, weightedpick( $two{ $sentence[-2] }{ $sentence[-1] } )\n while $sentence[-1] =~ /\\w/;\n shift @sentence;\n \"@sentence\\n\\n\" =~ s/\\w\\K (?=[st]\\b)/'/gr =~ s/ (?=[.!?]\\n)//r\n =~ s/.{60,}?\\K /\\n/gr;\n }\n\nprint sentence() for 1 .. 10;\n","language":"Perl"},{"code":"(notonline)-->\n <span style=\"color: #000080;font-style:italic;\">-- demo/rosetta/RandomSentence.exw</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">builtins</span><span style=\"color: #0000FF;\">\\</span><span style=\"color: #000000;\">libcurl</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">url</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"http://www.gutenberg.org/files/36/36-0.txt\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">filename</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"war_of_the_worlds.txt\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">fsent</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"No one would have believed\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">lasts</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"End of the Project Gutenberg EBook\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">unicodes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">utf32_to_utf8</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">#2019</span><span style=\"color: #0000FF;\">}),</span> <span style=\"color: #000080;font-style:italic;\">-- rsquo</span>\n <span style=\"color: #7060A8;\">utf32_to_utf8</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">#2014</span><span style=\"color: #0000FF;\">})},</span> <span style=\"color: #000080;font-style:italic;\">-- hyphen</span>\n <span style=\"color: #000000;\">asciis</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"'\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"-\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000000;\">aleph</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">'Z'</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">'A'</span><span style=\"color: #0000FF;\">)&</span><span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">'z'</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">'a'</span><span style=\"color: #0000FF;\">)&</span><span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">'9'</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">'0'</span><span style=\"color: #0000FF;\">)&</span><span style=\"color: #008000;\">\",'.?! \"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">follow</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">new_dict</span><span style=\"color: #0000FF;\">(),</span> <span style=\"color: #000080;font-style:italic;\">-- {word} -> {words,counts}</span>\n <span style=\"color: #000000;\">follow2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">new_dict</span><span style=\"color: #0000FF;\">()</span> <span style=\"color: #000080;font-style:italic;\">-- {word,word} -> {words,counts}</span>\n\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">file_exists</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Downloading %s...\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #004080;\">CURLcode</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">curl_easy_get_file</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">url</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #004600;\">CURLE_OK</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"cannot download\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">text</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">get_text</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">text</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #7060A8;\">match</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fsent</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">)..</span><span style=\"color: #7060A8;\">match</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lasts</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">text</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute_all</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">unicodes</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">asciis</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">text</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute_all</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\".?!-\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\" .\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" ? \"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" ! \"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">text</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">filter</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"in\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">aleph</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">words</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">account</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">next</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[$]</span>\n <span style=\"color: #000000;\">words</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..$-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">follow</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">follow2</span><span style=\"color: #0000FF;\">}[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">getdd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">,{{},{}},</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">tk</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">next</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">tk</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">next</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">tk</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">setd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">words</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">..$]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">!={</span><span style=\"color: #008000;\">\".\"</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span> <span style=\"color: #000080;font-style:italic;\">-- (may as well quit)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">],{</span><span style=\"color: #008000;\">\".\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"?\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"!\"</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">lower</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">account</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #7060A8;\">max</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)..</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">weighted_random_pick</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">dict</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">getd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dict</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">total</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]),</span>\n <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">total</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">5</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">sentence</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\".\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">weighted_random_pick</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #008000;\">\".\"</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #000000;\">follow</span><span style=\"color: #0000FF;\">)}</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">next</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">weighted_random_pick</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sentence</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">..-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">follow2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">sentence</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sentence</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">next</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">next</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\".\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"?\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"!\"</span><span style=\"color: #0000FF;\">})</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #000000;\">sentence</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">upper</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sentence</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sentence</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">..$-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])&</span><span style=\"color: #000000;\">sentence</span><span style=\"color: #0000FF;\">[$]})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #0000FF;\">{}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">wait_key</span><span style=\"color: #0000FF;\">()</span>\n<!--\n","language":"Phix"},{"code":"from urllib.request import urlopen\nimport re\nfrom string import punctuation\nfrom collections import Counter, defaultdict\nimport random\n\n\n# The War of the Worlds, by H. G. Wells\ntext_url = 'http://www.gutenberg.org/files/36/36-0.txt'\ntext_start = 'No one would have believed'\n\nsentence_ending = '.!?'\nsentence_pausing = ',;:'\n\ndef read_book(text_url, text_start) -> str:\n with urlopen(text_url) as book:\n text = book.read().decode('utf-8')\n return text[text.index(text_start):]\n\ndef remove_punctuation(text: str, keep=sentence_ending+sentence_pausing)-> str:\n \"Remove punctuation, keeping some\"\n to_remove = ''.join(set(punctuation) - set(keep))\n text = text.translate(str.maketrans(to_remove, ' ' * len(to_remove))).strip()\n text = re.sub(fr\"[^a-zA-Z0-9{keep}\\n ]+\", ' ', text)\n # Remove duplicates and put space around remaining punctuation\n if keep:\n text = re.sub(f\"([{keep}])+\", r\" \\1 \", text).strip()\n if text[-1] not in sentence_ending:\n text += ' .'\n return text.lower()\n\ndef word_follows_words(txt_with_pauses_and_endings):\n \"return dict of freq of words following one/two words\"\n words = ['.'] + txt_with_pauses_and_endings.strip().split()\n\n # count of what word follows this\n word2next = defaultdict(lambda :defaultdict(int))\n word2next2 = defaultdict(lambda :defaultdict(int))\n for lh, rh in zip(words, words[1:]):\n word2next[lh][rh] += 1\n for lh, mid, rh in zip(words, words[1:], words[2:]):\n word2next2[(lh, mid)][rh] += 1\n\n return dict(word2next), dict(word2next2)\n\ndef gen_sentence(word2next, word2next2) -> str:\n\n s = ['.']\n s += random.choices(*zip(*word2next[s[-1]].items()))\n while True:\n s += random.choices(*zip(*word2next2[(s[-2], s[-1])].items()))\n if s[-1] in sentence_ending:\n break\n\n s = ' '.join(s[1:]).capitalize()\n s = re.sub(fr\" ([{sentence_ending+sentence_pausing}])\", r'\\1', s)\n s = re.sub(r\" re\\b\", \"'re\", s)\n s = re.sub(r\" s\\b\", \"'s\", s)\n s = re.sub(r\"\\bi\\b\", \"I\", s)\n\n return s\n\nif __name__ == \"__main__\":\n txt_with_pauses_and_endings = remove_punctuation(read_book(text_url, text_start))\n word2next, word2next2 = word_follows_words(txt_with_pauses_and_endings)\n #%%\n sentence = gen_sentence(word2next, word2next2)\n print(sentence)\n","language":"Python"},{"code":"my $text = '36-0.txt'.IO.slurp.subst(/.+ '*** START OF THIS' .+? \\n (.*?) 'End of the Project Gutenberg EBook' .*/, {$0} );\n\n$text.=subst(/ <+punct-[.!?\\’,]> /, ' ', :g);\n$text.=subst(/ (\\s) '’' (\\s) /, '', :g);\n$text.=subst(/ (\\w) '’' (\\s) /, {$0~$1}, :g);\n$text.=subst(/ (\\s) '’' (\\w) /, {$0~$1}, :g);\n\nmy (%one, %two);\n\nfor $text.comb(/[\\w+(\\’\\w+)?]','?|<punct>/).rotor(3 => -2) {\n %two{.[0]}{.[1]}{.[2]}++;\n %one{.[0]}{.[1]}++;\n}\n\nsub weightedpick (%hash) { %hash.keys.map( { $_ xx %hash{$_} } ).pick }\n\nsub sentence {\n my @sentence = <. ! ?>.roll;\n @sentence.push: weightedpick( %one{ @sentence[0] } );\n @sentence.push: weightedpick( %two{ @sentence[*-2] }{ @sentence[*-1] } // %('.' => 1) )[0]\n until @sentence[*-1] ∈ <. ! ?>;\n @sentence.=squish;\n shift @sentence;\n redo if @sentence < 7;\n @sentence.join(' ').tc.subst(/\\s(<:punct>)/, {$0}, :g);\n}\n\nsay sentence() ~ \"\\n\" for ^10;\n","language":"Raku"},{"code":"import \"io\" for File\nimport \"random\" for Random\nimport \"./seq\" for Lst\n\n// puctuation to keep (also keep hyphen and apostrophe but don't count as words)\nvar ending = \".!?\"\nvar pausing = \",:;\"\n\n// puctuation to remove\nvar removing = \"\\\"#$\\%&()*+/<=>@[\\\\]^_`{|}~“”\"\n\n// read in book\nvar fileName = \"36-0.txt\" // local copy of http://www.gutenberg.org/files/36/36-0.txt\nvar text = File.read(fileName)\n\n// skip to start\nvar ix = text.indexOf(\"No one would have believed\")\ntext = text[ix..-1]\n\n// remove extraneous punctuation\nfor (r in removing) text = text.replace(r, \"\")\n\n// replace EM DASH (unicode 8212) with a space\ntext = text.replace(\"—\", \" \")\n\n// split into words\nvar words = text.split(\" \").where { |w| w != \"\" }.toList\n// treat 'ending' and 'pausing' punctuation as words\nfor (i in 0...words.count) {\n var w = words[i]\n for (p in ending + pausing) if (w.endsWith(p)) words[i] = [w[0...-1], w[-1]]\n}\nwords = Lst.flatten(words)\n\n// Keep account of what words follow words and how many times it is seen\nvar dict1 = {}\nfor (i in 0...words.count-1) {\n var w1 = words[i]\n var w2 = words[i+1]\n if (dict1[w1]) {\n dict1[w1].add(w2)\n } else {\n dict1[w1] = [w2]\n }\n}\nfor (key in dict1.keys) dict1[key] = [dict1[key].count, Lst.individuals(dict1[key])]\n\n// Keep account of what words follow two words and how many times it is seen\nvar dict2 = {}\nfor (i in 0...words.count-2) {\n var w12 = words[i] + \" \" + words[i+1]\n var w3 = words[i+2]\n if (dict2[w12]) {\n dict2[w12].add(w3)\n } else {\n dict2[w12] = [w3]\n }\n}\nfor (key in dict2.keys) dict2[key] = [dict2[key].count, Lst.individuals(dict2[key])]\n\nvar rand = Random.new()\n\nvar weightedRandomChoice = Fn.new { |value|\n var n = value[0]\n var indivs = value[1]\n var r = rand.int(n)\n var sum = 0\n for (indiv in indivs) {\n sum = sum + indiv[1]\n if (r < sum) return indiv[0]\n }\n}\n\n// build 5 random sentences say\nfor (i in 1..5) {\n var sentence = weightedRandomChoice.call(dict1[\".\"])\n var lastOne = sentence\n var lastTwo = \". \" + sentence\n while (true) {\n var nextOne = weightedRandomChoice.call(dict2[lastTwo])\n sentence = sentence + \" \" + nextOne\n if (ending.contains(nextOne)) break // stop on reaching ending punctuation\n lastTwo = lastOne + \" \" + nextOne\n lastOne = nextOne\n }\n\n // tidy up sentence\n for (p in ending + pausing) sentence = sentence.replace(\" %(p)\", \"%(p)\")\n sentence = sentence.replace(\"\\n\", \" \")\n System.print(sentence)\n System.print()\n}\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Random_sentence_from_book\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"* Read in the book \\\"[http://www.gutenberg.org/files/36/36-0.txt The War of the Worlds]\\\", by H. G. Wells.\\n* Skip to the start of the book, proper.\\n* Remove extraneous punctuation, but keep at least sentence-ending punctuation characters . ! and ?\\n* Keep account of what words follow words and how many times it is seen, (treat sentence terminators as words too).\\n* Keep account of what words follow ''two'' words and how many times it is seen, (again treating sentence terminators as words too).\\n* Assume that a sentence starts with a not to be shown full-stop character then ''use a weighted random choice'' of the possible words that may follow a full-stop to add to the sentence.\\n* Then repeatedly add words to the sentence based on weighted random choices of what words my follow the last two words to extend the sentence.\\n* Stop after adding a sentence ending punctuation character.\\n* Tidy and then print the sentence.\\n\\n\\nShow examples of random sentences generated.\\n\\n;Related task\\n* [[Markov_chain_text_generator]]\\n\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"# generate random sentences using text from a book as a basis #\\n\\n# use the associative array in the Associate array/iteration task #\\nPR read \\\"aArray.a68\\\" PR\\n\\n# returns s with chars removed #\\nPRIO REMOVE = 1;\\nOP REMOVE = ( STRING s, chars )STRING:\\n BEGIN\\n [ LWB s : UPB s ]CHAR result;\\n INT r pos := LWB result - 1;\\n FOR s pos FROM LWB s TO UPB s DO\\n IF NOT char in string( s[ s pos ], NIL, chars ) THEN\\n # have a character that needn't be removed #\\n r pos +:= 1;\\n result[ r pos ] := s[ s pos ]\\n FI\\n OD;\\n result[ LWB s : r pos ]\\n END # REMOVE # ;\\n# returns text converted to an INT or -1 if text is not a number #\\nOP TOINT = ( STRING text )INT:\\n BEGIN\\n INT result := 0;\\n BOOL is numeric := TRUE;\\n FOR ch pos FROM LWB text TO UPB text WHILE is numeric DO\\n CHAR c = text[ ch pos ];\\n is numeric := ( c >= \\\"0\\\" AND c <= \\\"9\\\" );\\n IF is numeric THEN ( result *:= 10 ) +:= ABS c - ABS \\\"0\\\" FI\\n OD;\\n IF is numeric THEN result ELSE -1 FI\\n END # TOINT # ;\\n\\n# get the file name and number of words for the prefix and #\\n# max number of words and sentences from the command line #\\nSTRING file name := \\\"twotw.txt\\\";\\nSTRING start word := \\\"\\\";\\nINT prefix length := 2;\\nINT number of sentences := 10;\\nINT max words := 1 000 000;\\nFOR arg pos TO argc - 1 DO\\n STRING arg upper := argv( arg pos );\\n FOR ch pos FROM LWB arg upper TO UPB arg upper DO\\n IF is lower( arg upper[ ch pos ] ) THEN arg upper[ ch pos ] := to upper( arg upper[ ch pos ] ) FI\\n OD;\\n IF arg upper = \\\"FILE\\\" THEN\\n file name := argv( arg pos + 1 )\\n ELIF arg upper = \\\"PREFIX\\\" THEN\\n prefix length := TOINT argv( arg pos + 1 )\\n ELIF arg upper = \\\"SENTENCES\\\" THEN\\n number of sentences := TOINT argv( arg pos + 1 )\\n ELIF arg upper = \\\"MAXWORDS\\\" THEN\\n max words := TOINT argv( arg pos + 1 )\\n ELIF arg upper = \\\"STARTWORD\\\" THEN\\n start word := argv( arg pos + 1 )\\n FI\\nOD;\\n\\n# delimiter for separating suffixes - must not appear in the text #\\nCHAR suffix delimiter = REPR 1; # ^A #\\nSTRING punctuation = \\\"\\\"\\\"'@,/;:(){}[]*&^%$£\\\";\\n\\nIF FILE input file;\\n open( input file, file name, stand in channel ) /= 0\\nTHEN\\n # failed to open the file #\\n print( ( \\\"Unable to open \\\"\\\"\\\" + file name + \\\"\\\"\\\"\\\", newline ) )\\nELSE\\n # file opened OK #\\n BOOL at eof := FALSE;\\n BOOL at eol := FALSE;\\n # set the EOF handler for the file #\\n on logical file end( input file\\n , ( REF FILE f )BOOL:\\n BEGIN\\n # note that we reached EOF on the #\\n # latest read #\\n at eof := TRUE;\\n # return TRUE so processing can continue #\\n TRUE\\n END\\n );\\n # set the end-of-line handler for the file so get word can see line boundaries #\\n on line end( input file\\n , ( REF FILE f )BOOL:\\n BEGIN\\n # note we reached end-of-line #\\n at eol := TRUE;\\n # return FALSE to use the default eol handling #\\n # i.e. just get the next charactefr #\\n FALSE\\n END\\n );\\n CHAR c := \\\" \\\";\\n # returns the next word from input file #\\n # a word is any sequence of characters separated by spaces and #\\n # suffix delimiters, or one of the characters \\\".\\\", \\\"!\\\" or \\\"?\\\" #\\n PROC get word = STRING:\\n IF at eof THEN \\\"\\\"\\n ELSE # not at end of file #\\n STRING word := \\\"\\\";\\n at eol := FALSE;\\n IF c = \\\".\\\" OR c = \\\"!\\\" OR c = \\\"?\\\" THEN\\n # sentence ending \\\"word\\\" #\\n word := c;\\n get( input file, ( c ) )\\n ELSE\\n # \\\"normal\\\" word #\\n WHILE ( c = \\\" \\\" OR c = suffix delimiter ) AND NOT at eof DO get( input file, ( c ) ) OD;\\n WHILE c /= \\\" \\\"\\n AND c /= \\\".\\\"\\n AND c /= \\\"!\\\"\\n AND c /= \\\"?\\\"\\n AND c /= suffix delimiter\\n AND NOT at eol\\n AND NOT at eof\\n DO\\n word +:= c;\\n get( input file, ( c ) )\\n OD\\n FI;\\n at eol := FALSE;\\n word\\n FI # get word # ;\\n\\n # returns a random number between 1 and n inclusive #\\n PROC random choice = ( INT n )INT: IF n < 2 THEN n ELSE ENTIER ( ( next random * n ) + 1 ) FI;\\n\\n # chooses a suffix at random to continue a sentence #\\n PROC choose suffix = ( STRING sfxs )STRING:\\n BEGIN\\n # count the number of suffixes #\\n INT suffix max := 0;\\n FOR s pos FROM LWB sfxs TO UPB sfxs DO\\n IF sfxs[ s pos ] = suffix delimiter THEN suffix max +:= 1 FI\\n OD;\\n # select a random suffix to continue the text with #\\n STRING sfx := \\\"\\\";\\n INT prev pos := LWB sfxs - 1;\\n INT suffix count := random choice( suffix max );\\n FOR s pos FROM LWB sfxs TO UPB sfxs WHILE suffix count > 0 DO\\n IF sfxs[ s pos ] = suffix delimiter THEN\\n # found the end of a suffix #\\n sfx := sfxs[ prev pos + 1 : s pos - 1 @ 1 ];\\n prev pos := s pos;\\n suffix count -:= 1\\n FI\\n OD;\\n sfx\\n END # choose suffix # ;\\n\\n # skip to the start word, if there is one #\\n IF start word /= \\\"\\\" THEN WHILE NOT at eof AND get word /= start word DO SKIP OD FI;\\n # get the first prefix from the file #\\n [ prefix length ]STRING prefix;\\n FOR p pos TO prefix length WHILE NOT at eof DO prefix[ p pos ] := get word OD;\\n IF at eof THEN\\n # not enough words in the file #\\n print( ( file name, \\\" contains less than \\\", whole( prefix length, 0 ), \\\" words\\\", newline ) )\\n ELSE\\n # have some words #\\n INT word count := prefix length;\\n # store the prefixes and suffixes in the associatibe array #\\n # we store the suffix as a single concatenated #\\n # string delimited by suffix delimiters, the string will #\\n # have a leading delimiter #\\n # suffixes that appear multiple times in the input text will #\\n # appear multiple time in the array, this will allow them to #\\n # have a higher probability than suffixes that appear fewer #\\n # times #\\n # this will use more memory than storing the sufixes and a #\\n # count, but simplifies the generation #\\n # with a prefix length of 2 (as required by the task), #\\n # the War Of The Worlds can be processed - for longer prefix #\\n # lengths a less memory hungry algorithm would be needed #\\n REF AARRAY suffixes := INIT LOC AARRAY;\\n INT prefix count := 0;\\n WHILE NOT at eof AND word count <= max words\\n DO\\n # concatenate the prefix words to a single string #\\n STRING prefix text := prefix[ 1 ];\\n FOR p pos FROM 2 TO prefix length DO prefix text +:= ( \\\" \\\" + prefix[ p pos ] ) OD;\\n STRING suffix := get word;\\n # if the prefix has no lower case, ignore it as it is #\\n # probably a chapter heading or similar #\\n IF BOOL has lowercase := FALSE;\\n FOR s pos FROM LWB prefix text TO UPB prefix text\\n WHILE NOT ( has lowercase := is lower( prefix text[ s pos ] ) )\\n DO SKIP OD;\\n has lowercase\\n THEN\\n # the prefix contains some lower case #\\n # store the suffixes associated with the prefix #\\n IF NOT ( suffixes CONTAINSKEY prefix text ) THEN\\n # first time this prefix has appeared #\\n prefix count +:= 1\\n FI;\\n IF prefix[ 1 ] = \\\".\\\" OR prefix[ 1 ] = \\\"!\\\" OR prefix[ 1 ] = \\\"?\\\" THEN\\n # have the start of a sentence #\\n suffixes // \\\"*.\\\" +:= ( suffix delimiter + prefix text )\\n FI;\\n STRING prefix without punctuation = prefix text REMOVE punctuation;\\n IF prefix without punctuation /= \\\"\\\" THEN prefix text := prefix without punctuation FI;\\n suffixes // prefix text +:= ( suffix delimiter + suffix )\\n FI;\\n # shuffle the prefixes down one and add the new suffix #\\n # as the final prefix #\\n FOR p pos FROM 2 TO prefix length DO prefix[ p pos - 1 ] := prefix[ p pos ] OD;\\n prefix[ prefix length ] := suffix;\\n IF NOT at eof THEN word count +:= 1 FI\\n OD;\\n\\n # generate text #\\n TO number of sentences DO\\n print( ( newline ) );\\n # start with a random prefix #\\n STRING pfx := choose suffix( suffixes // \\\"*.\\\" );\\n STRING line := pfx[ @ 1 ][ 3 : ]; # remove the leading #\\n # \\\". \\\" from the line #\\n pfx := pfx REMOVE punctuation;\\n BOOL finished := FALSE;\\n WHILE NOT finished DO\\n IF STRING sfxs := ( suffixes // pfx );\\n IF LWB sfxs <= UPB sfxs THEN\\n IF sfxs[ LWB sfxs ] = suffix delimiter THEN sfxs := sfxs[ LWB sfxs + 1 : ] FI\\n FI;\\n sfxs +:= suffix delimiter;\\n sfxs = suffix delimiter\\n THEN\\n # no suffix - reached the end of the generated text #\\n line +:= \\\" (\\\" + pfx + \\\" has no suffix)\\\";\\n finished := TRUE\\n ELSE\\n # can continue to generate text #\\n STRING sfx = choose suffix( sfxs );\\n IF sfx = \\\".\\\" OR sfx = \\\"!\\\" OR sfx = \\\"?\\\"\\n THEN\\n # reached the end of a sentence #\\n finished := TRUE;\\n # if the line ends with \\\",;:\\\", remove it #\\n INT line end := UPB line;\\n IF CHAR c = line[ line end ]; c = \\\",\\\" OR c = \\\";\\\" OR c = \\\":\\\" THEN\\n line end -:= 1\\n FI;\\n # remove trailing spaces #\\n WHILE line[ line end ] = \\\" \\\" AND line end > LWB line DO line end -:= 1 OD;\\n line := line[ LWB line : line end ] + sfx\\n ELSE\\n # not at the end of the sentence #\\n line +:= \\\" \\\" + sfx;\\n # remove the first word from the prefix and add #\\n # the suffix #\\n IF INT space pos := 0;\\n NOT char in string( \\\" \\\", space pos, pfx )\\n THEN\\n # the prefix is only one word #\\n pfx := sfx\\n ELSE\\n # have multiple words #\\n pfx := ( pfx[ space pos + 1 : ] + \\\" \\\" + sfx )[ @ 1 ]\\n FI;\\n STRING pfx without punctuation = pfx REMOVE punctuation;\\n IF pfx without punctuation /= \\\"\\\" THEN pfx := pfx without punctuation FI\\n FI\\n FI\\n OD;\\n print( ( line, newline ) )\\n OD\\n FI;\\n close( input file )\\nFI\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#NoEnv\\n#SingleInstance, force\\n\\t\\t\\t\\t; press Esc to stop and display the output text\\n\\t\\t\\t\\t; (a debug file describing ongoing steps will be created in the end)\\nFileEncoding, UTF-8\\nFileRead, warWords, war of words.txt ; wrapped booktext\\nglobal textOut := \\\" \\\"\\nglobal warWords := strreplace(warWords,\\\"`r`n\\\", \\\" \\\")\\nwarWords := strreplace(warWords,\\\"`r\\\", \\\" \\\")\\nwarWords := strreplace(warWords,\\\"`n\\\", \\\" \\\")\\nwarWords := strreplace(warWords,\\\"-\\\", \\\" \\\")\\nwarWords := strreplace(warWords,\\\"—\\\", \\\" \\\")\\nwarWords := strreplace(warWords,\\\"`t\\\", \\\" \\\")\\nwarWords := strreplace(warWords,\\\"“\\\")\\nwarWords := strreplace(warWords,\\\"_\\\")\\nwarWords := strreplace(warWords,\\\"”\\\")\\nwarWords := strreplace(warWords,\\\"’\\\")\\nwarWords := strreplace(warWords,\\\"'\\\")\\nwarWords := strreplace(warWords,\\\"\\\"\\\"\\\")\\nwarWords := strreplace(warWords,\\\")\\\")\\nwarWords := strreplace(warWords,\\\"(\\\")\\nwarWords := strreplace(warWords,\\\"[\\\")\\nwarWords := strreplace(warWords,\\\"]\\\")\\nwarWords := strreplace(warWords,\\\"{\\\")\\nwarWords := strreplace(warWords,\\\"}\\\")\\nwarWords := strreplace(warWords,\\\"»\\\")\\nwarWords := strreplace(warWords,\\\"«\\\")\\nwarWords := trim(warWords)\\nLoop\\n{\\n\\twarWords := strreplace(warWords,\\\" \\\", \\\" \\\")\\n\\tif (Errorlevel = 0)\\n\\t\\tbreak\\n}\\nFileDelete, debug.txt\\nInputBox, fOne, War of Words, Choice a punctuation to start ( . or ! or ? or `, ),,,,,,,,.\\ntreco := NextPunct(fOne)\\nLoop\\n{\\nloop,parse,treco,\\\" \\\"\\n\\tif A_LoopField\\n\\t\\tfOne := trim(A_LoopField)\\ntextOut .= fOne . \\\" \\\"\\ntremPos := InStr(textOut,\\\" \\\",,0,3)\\ntremText := trim(substr(textOut,tremPos))\\nif tremText\\n\\t{\\n\\t\\ttremText := strreplace(tremText,\\\".\\\",\\\"\\\\.\\\")\\n\\t\\ttremText := strreplace(tremText,\\\";\\\",\\\"\\\\;\\\")\\n\\t\\ttremText := strreplace(tremText,\\\",\\\",\\\"\\\\,\\\")\\n\\t\\ttremText := strreplace(tremText,\\\"!\\\",\\\"\\\\!\\\")\\n\\t\\ttremText := \\\" \\\" . strreplace(tremText,\\\"?\\\",\\\"\\\\?\\\")\\n\\t\\ttreco := NextWord(tremText)\\n\\t}\\nelse\\n\\ttreco := NextWord(fOne)\\n}\\n\\nNextPunct(punct) {\\nxpos := 1\\nprox := []\\nLoop\\n{\\n\\tspos := RegExMatch(warWords, \\\"(*UCP)\\\\\\\" . punct . \\\" \\\\w+.\\\",gg,xpos)\\n\\tif (spos = 0)\\n\\t\\tbreak\\n\\tprox[a_index] := gg\\n\\txpos := spos + 1\\n}\\nproximas := \\\"\\\"\\nloop, % prox.MaxIndex()\\n\\tproximas .= a_index . \\\" -> \\\" . prox[a_index] . \\\"`n\\\"\\nFileAppend, %proximas%, debug.txt, UTF-8\\nRandom, linha, 1, prox.MaxIndex()\\nFileAppend, % \\\"---------------`nescolhido = \\\" . linha . \\\" -> \\\" . prox[linha] . \\\" -> \\\" . textOut . \\\"`n----------------`n\\\", debug.txt, UTF-8\\nreturn prox[linha]\\n}\\n\\nNextWord(word) {\\nxpos := 1\\nprox := []\\nloop\\n{\\n\\tspos := RegExMatch(warWords, \\\"(*UCP)\\\" . word . \\\" \\\\w+.\\\",gg,xpos)\\n\\tif !spos\\n\\t\\tbreak\\n\\tprox[a_index] := gg\\n\\txpos := spos + 1\\n}\\n\\nif (prox.MaxIndex() > 0)\\n{\\nproximas := \\\"\\\"\\nloop, % prox.MaxIndex()\\n\\tproximas .= a_index . \\\" -> \\\" . prox[a_index] . \\\"`n\\\"\\nFileAppend, %proximas%, debug.txt, UTF-8\\nRandom, linha, 1, prox.MaxIndex()\\nFileAppend, % \\\"---------------`nescolhido = \\\" . linha . \\\" -> \\\" . prox[linha] . \\\" -> \\\" . textOut . \\\"`n----------------`n\\\", debug.txt, UTF-8\\nreturn % prox[linha]\\n}\\t\\n\\nloop,parse,word,\\\" \\\"\\n\\twrd := A_LoopField\\nword := wrd\\nspos := xpos := 1\\nprox := []\\nloop\\n{\\n\\tspos := RegExMatch(warWords, \\\"(*UCP)\\\" . word . \\\" \\\\w+.\\\",gg,xpos)\\n\\tif (spos = 0)\\n\\t\\tbreak\\n\\tprox[a_index] := gg\\n\\txpos := spos + 1\\n}\\nproximas := \\\"\\\"\\nloop, % prox.MaxIndex()\\n\\tproximas .= a_index . \\\" -> \\\" . prox[a_index] . \\\"`n\\\"\\nFileAppend, %proximas%, debug.txt, UTF-8\\nRandom, linha, 1, prox.MaxIndex()\\nFileAppend, % \\\"---------------`nescolhido = \\\" . linha . \\\" -> \\\" . prox[linha] . \\\" -> \\\" . textOut . \\\"`n----------------`n\\\", debug.txt, UTF-8\\nreturn % prox[linha]\\n}\\n\\nExitApp\\n\\n~Esc::\\nmsgbox % textOut . \\\"...\\\"\\nExitApp\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"\\\"\\\"\\\" weighted random pick of items in a Dict{String, Int} where keys are words, values counts \\\"\\\"\\\"\\nfunction weightedrandompick(dict, total)\\n n = rand(1:total)\\n for (key, value) in dict\\n n -= value\\n if n <= 0\\n return key\\n end\\n end\\n return last(keys(dict))\\nend\\n\\nlet\\n \\\"\\\"\\\" Read in the book \\\"The War of the Worlds\\\", by H. G. Wells. \\\"\\\"\\\"\\n wotw_uri = \\\"http://www.gutenberg.org/files/36/36-0.txt\\\"\\n wfile = \\\"war_of_the_worlds.txt\\\"\\n stat(wfile).size == 0 && download(wotw_uri, wfile) # download if file not here already\\n text = read(wfile, String)\\n\\n \\\"\\\"\\\"skip to start of book and prune end \\\"\\\"\\\"\\n startphrase, endphrase = \\\"No one would have believed\\\", \\\"she has counted me, among the dead\\\"\\n text = text[findfirst(startphrase, text).start:findlast(endphrase, text).stop]\\n\\n \\\"\\\"\\\" Remove extraneous punctuation, but keep at least sentence-ending punctuation characters . ! and ? \\\"\\\"\\\"\\n text = replace(replace(text, r\\\"[^01-9a-zA-Z\\\\.\\\\?\\\\!’,]\\\" => \\\" \\\"), r\\\"([.?!])\\\" => s\\\" \\\\1\\\")\\n words = split(text, r\\\"\\\\s+\\\")\\n for (i, w) in enumerate(words)\\n w != \\\"I\\\" && i > 1 && words[i - 1] in [\\\".\\\", \\\"?\\\", \\\"!\\\"] && (words[i] = lowercase(words[i]))\\n end\\n\\n \\\"\\\"\\\" Keep account of what words follow words and how many times it is seen. Treat sentence terminators\\n (?.!) as words too. Keep account of what words follow two words and how many times it is seen.\\n \\\"\\\"\\\"\\n follows, follows2 = Dict{String, Dict{String, Int}}(), Dict{String, Dict{String, Int}}()\\n afterstop, wlen = Dict{String, Int}(), length(words)\\n for (i, w) in enumerate(@view words[1:end-1])\\n d = get!(follows, w, Dict(words[i + 1] => 0))\\n get!(d, words[i + 1], 0)\\n d[words[i + 1]] += 1\\n if w in [\\\".\\\", \\\"?\\\", \\\"!\\\"]\\n d = get!(afterstop, words[i + 1], 0)\\n afterstop[words[i + 1]] += 1\\n end\\n (i > wlen - 2) && continue\\n w2 = w * \\\" \\\" * words[i + 1]\\n d = get!(follows2, w2, Dict(words[i + 2] => 0))\\n get!(d, words[i + 2], 0)\\n d[words[i + 2]] += 1\\n end\\n followsums = Dict(key => sum(values(follows[key])) for key in keys(follows))\\n follow2sums = Dict(key => sum(values(follows2[key])) for key in keys(follows2))\\n afterstopsum = sum(values(afterstop))\\n\\n \\\"\\\"\\\" Assume that a sentence starts with a not to be shown full-stop character then use a weighted\\n random choice of the possible words that may follow a full-stop to add to the sentence.\\n \\\"\\\"\\\"\\n function makesentence()\\n firstword = weightedrandompick(afterstop, afterstopsum)\\n sentencewords = [firstword, weightedrandompick(follows[firstword], followsums[firstword])]\\n while !(sentencewords[end] in [\\\".\\\", \\\"?\\\", \\\"!\\\"])\\n w2 = sentencewords[end-1] * \\\" \\\" * sentencewords[end]\\n if haskey(follows2, w2)\\n push!(sentencewords, weightedrandompick(follows2[w2], follow2sums[w2]))\\n else\\n push!(sentencewords, weightedrandompick(afterstop, afterstopsum))\\n end\\n end\\n sentencewords[1] = uppercase(firstword[1]) * (length(firstword) > 1 ? firstword[2:end] : \\\"\\\")\\n println(join(sentencewords[1:end-1], \\\" \\\") * sentencewords[end] * \\\"\\\\n\\\")\\n end\\n # Print 3 weighted random pick sentences\\n makesentence(); makesentence(); makesentence()\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import random, sequtils, strutils, tables\\nfrom unicode import utf8\\n\\nconst StopChars = [\\\".\\\", \\\"?\\\", \\\"!\\\"]\\n\\nproc weightedChoice(choices: CountTable[string]; totalCount: int): string =\\n ## Return a string from \\\"choices\\\" key using counts as weights.\\n var n = rand(1..totalCount)\\n for word, count in choices.pairs:\\n dec n, count\\n if n <= 0: return word\\n assert false, \\\"internal error\\\"\\n\\nproc finalFilter(words: seq[string]): seq[string] =\\n ## Eliminate words of length one (except those of a given list)\\n ## and words containing only uppercase letters (words from titles).\\n for word in words:\\n if word in [\\\".\\\", \\\"?\\\", \\\"!\\\", \\\"I\\\", \\\"A\\\", \\\"a\\\"]:\\n result.add word\\n elif word.len > 1 and any(word, isLowerAscii):\\n result.add word\\n\\n\\nrandomize()\\n\\nvar text = readFile(\\\"The War of the Worlds.txt\\\")\\n\\n# Extract the actual text from the book.\\nconst\\n StartText = \\\"BOOK ONE\\\\r\\\\nTHE COMING OF THE MARTIANS\\\"\\n EndText = \\\"End of the Project Gutenberg EBook\\\"\\nlet startIndex = text.find(StartText)\\nlet endIndex = text.find(EndText)\\ntext = text[startIndex..<endIndex]\\n\\n# Clean the text by removing some characters and replacing others.\\n# As there are some non ASCII characters, we have to apply special rules.\\nvar processedText: string\\nfor uchar in text.utf8():\\n if uchar.len == 1:\\n # ASCII character.\\n let ch = uchar[0]\\n case ch\\n of '0'..'9', 'a'..'z', 'A'..'Z', ' ': processedText.add ch # Keep as is.\\n of '\\\\n': processedText.add ' ' # Replace with a space.\\n of '.', '?', '!': processedText.add ' ' & ch # Make sure these characters are isolated.\\n else: discard # Remove others.\\n else:\\n # Some UTF-8 representation of a non ASCII character.\\n case uchar\\n of \\\"—\\\": processedText.add ' ' # Replace EM DASH with space.\\n of \\\"ç\\\", \\\"æ\\\", \\\"’\\\": processedText.add uchar # Keep these characters as they are parts of words.\\n of \\\"“\\\", \\\"”\\\", \\\"‘\\\": discard # Removed these ones.\\n else: echo \\\"encountered: \\\", uchar # Should not go here.\\n\\n# Extract words and filter them.\\nlet words = processedText.splitWhitespace().finalFilter()\\n\\n# Build count tables.\\nvar followCount, followCount2: Table[string, CountTable[string]]\\nfor i in 1..words.high:\\n followCount.mgetOrPut(words[i - 1], initCountTable[string]()).inc(words[i])\\nfor i in 2..words.high:\\n followCount2.mgetOrPut(words[i - 2] & ' ' & words[i - 1], initCountTable[string]()).inc words[i]\\n\\n# Build sum tables.\\nvar followSum, followSum2: CountTable[string]\\nfor key in followCount.keys:\\n for count in followCount[key].values:\\n followSum.inc key, count\\nfor key in followCount2.keys:\\n for count in followCount2[key].values:\\n followSum2.inc key, count\\n\\n# Build table of starting words and compute the sum.\\nvar\\n startingWords: CountTable[string]\\n startingSum: int\\nfor stopChar in StopChars:\\n for word, count in followCount[stopChar].pairs:\\n startingWords.inc word, count\\n inc startingSum, count\\n\\n# Build a sentence.\\nlet firstWord = weightedChoice(startingWords, startingSum)\\nvar sentence = @[firstWord]\\nvar lastWord = weightedChoice(followCount[firstWord], followSum[firstWord])\\nwhile lastWord notin StopChars:\\n sentence.add lastWord\\n let key = sentence[^2] & ' ' & lastWord\\n lastWord = if key in followCount2:\\n weightedChoice(followCount2[key], followSum2[key])\\n else:\\n weightedChoice(followCount[lastWord], followSum[lastWord])\\necho sentence.join(\\\" \\\") & lastWord\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\n\\nuse strict; # https://rosettacode.org/wiki/Random_sentence_from_book\\nuse warnings;\\n\\nmy $book = do { local (@ARGV, $/) = 'waroftheworlds.txt'; <> };\\nmy (%one, %two);\\n\\ns/^.*?START OF THIS\\\\N*\\\\n//s, s/END OF THIS.*//s,\\n tr/a-zA-Z.!?/ /c, tr/ / /s for $book;\\n\\nmy $qr = qr/(\\\\b\\\\w+\\\\b|[.!?])/;\\n$one{$1}{$2}++, $two{$1}{$2}{$3}++ while $book =~ /$qr(?= *$qr *$qr)/g;\\n\\nsub weightedpick\\n {\\n my $href = shift;\\n my @weightedpick = map { ($_) x $href->{$_} } keys %$href;\\n $weightedpick[rand @weightedpick];\\n }\\n\\nsub sentence\\n {\\n my @sentence = qw( . ! ? )[rand 3];\\n push @sentence, weightedpick( $one{ $sentence[0] } );\\n push @sentence, weightedpick( $two{ $sentence[-2] }{ $sentence[-1] } )\\n while $sentence[-1] =~ /\\\\w/;\\n shift @sentence;\\n \\\"@sentence\\\\n\\\\n\\\" =~ s/\\\\w\\\\K (?=[st]\\\\b)/'/gr =~ s/ (?=[.!?]\\\\n)//r\\n =~ s/.{60,}?\\\\K /\\\\n/gr;\\n }\\n\\nprint sentence() for 1 .. 10;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- demo/rosetta/RandomSentence.exw</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">builtins</span><span style=\\\"color: #0000FF;\\\">\\\\</span><span style=\\\"color: #000000;\\\">libcurl</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">url</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"http://www.gutenberg.org/files/36/36-0.txt\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">filename</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"war_of_the_worlds.txt\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">fsent</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"No one would have believed\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">lasts</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"End of the Project Gutenberg EBook\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">unicodes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">utf32_to_utf8</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">#2019</span><span style=\\\"color: #0000FF;\\\">}),</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- rsquo</span>\\n <span style=\\\"color: #7060A8;\\\">utf32_to_utf8</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">#2014</span><span style=\\\"color: #0000FF;\\\">})},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- hyphen</span>\\n <span style=\\\"color: #000000;\\\">asciis</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"'\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"-\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000000;\\\">aleph</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">'Z'</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">'A'</span><span style=\\\"color: #0000FF;\\\">)&</span><span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">'z'</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">'a'</span><span style=\\\"color: #0000FF;\\\">)&</span><span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">'9'</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">'0'</span><span style=\\\"color: #0000FF;\\\">)&</span><span style=\\\"color: #008000;\\\">\\\",'.?! \\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">follow</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">new_dict</span><span style=\\\"color: #0000FF;\\\">(),</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- {word} -> {words,counts}</span>\\n <span style=\\\"color: #000000;\\\">follow2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">new_dict</span><span style=\\\"color: #0000FF;\\\">()</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- {word,word} -> {words,counts}</span>\\n\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">file_exists</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Downloading %s...\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #004080;\\\">CURLcode</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">curl_easy_get_file</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">url</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #004600;\\\">CURLE_OK</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"cannot download\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">text</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">get_text</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">text</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #7060A8;\\\">match</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fsent</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">)..</span><span style=\\\"color: #7060A8;\\\">match</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lasts</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">text</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute_all</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">unicodes</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">asciis</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">text</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute_all</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\".?!-\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\" .\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" ? \\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" ! \\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">text</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">filter</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"in\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">aleph</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">words</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">account</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">next</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[$]</span>\\n <span style=\\\"color: #000000;\\\">words</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..$-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">follow</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">follow2</span><span style=\\\"color: #0000FF;\\\">}[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">getdd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">,{{},{}},</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">tk</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">next</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">tk</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">next</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">tk</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">setd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">words</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">..$]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">!={</span><span style=\\\"color: #008000;\\\">\\\".\\\"</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (may as well quit)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">],{</span><span style=\\\"color: #008000;\\\">\\\".\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"?\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"!\\\"</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">lower</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">account</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #7060A8;\\\">max</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)..</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">weighted_random_pick</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">dict</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">getd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dict</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">total</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]),</span>\\n <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">total</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">5</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">sentence</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\".\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">weighted_random_pick</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #008000;\\\">\\\".\\\"</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #000000;\\\">follow</span><span style=\\\"color: #0000FF;\\\">)}</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">next</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">weighted_random_pick</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sentence</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">..-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">follow2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">sentence</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sentence</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">next</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">next</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\".\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"?\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"!\\\"</span><span style=\\\"color: #0000FF;\\\">})</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #000000;\\\">sentence</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">upper</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sentence</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sentence</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">..$-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])&</span><span style=\\\"color: #000000;\\\">sentence</span><span style=\\\"color: #0000FF;\\\">[$]})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #0000FF;\\\">{}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">wait_key</span><span style=\\\"color: #0000FF;\\\">()</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"from urllib.request import urlopen\\nimport re\\nfrom string import punctuation\\nfrom collections import Counter, defaultdict\\nimport random\\n\\n\\n# The War of the Worlds, by H. G. Wells\\ntext_url = 'http://www.gutenberg.org/files/36/36-0.txt'\\ntext_start = 'No one would have believed'\\n\\nsentence_ending = '.!?'\\nsentence_pausing = ',;:'\\n\\ndef read_book(text_url, text_start) -> str:\\n with urlopen(text_url) as book:\\n text = book.read().decode('utf-8')\\n return text[text.index(text_start):]\\n\\ndef remove_punctuation(text: str, keep=sentence_ending+sentence_pausing)-> str:\\n \\\"Remove punctuation, keeping some\\\"\\n to_remove = ''.join(set(punctuation) - set(keep))\\n text = text.translate(str.maketrans(to_remove, ' ' * len(to_remove))).strip()\\n text = re.sub(fr\\\"[^a-zA-Z0-9{keep}\\\\n ]+\\\", ' ', text)\\n # Remove duplicates and put space around remaining punctuation\\n if keep:\\n text = re.sub(f\\\"([{keep}])+\\\", r\\\" \\\\1 \\\", text).strip()\\n if text[-1] not in sentence_ending:\\n text += ' .'\\n return text.lower()\\n\\ndef word_follows_words(txt_with_pauses_and_endings):\\n \\\"return dict of freq of words following one/two words\\\"\\n words = ['.'] + txt_with_pauses_and_endings.strip().split()\\n\\n # count of what word follows this\\n word2next = defaultdict(lambda :defaultdict(int))\\n word2next2 = defaultdict(lambda :defaultdict(int))\\n for lh, rh in zip(words, words[1:]):\\n word2next[lh][rh] += 1\\n for lh, mid, rh in zip(words, words[1:], words[2:]):\\n word2next2[(lh, mid)][rh] += 1\\n\\n return dict(word2next), dict(word2next2)\\n\\ndef gen_sentence(word2next, word2next2) -> str:\\n\\n s = ['.']\\n s += random.choices(*zip(*word2next[s[-1]].items()))\\n while True:\\n s += random.choices(*zip(*word2next2[(s[-2], s[-1])].items()))\\n if s[-1] in sentence_ending:\\n break\\n\\n s = ' '.join(s[1:]).capitalize()\\n s = re.sub(fr\\\" ([{sentence_ending+sentence_pausing}])\\\", r'\\\\1', s)\\n s = re.sub(r\\\" re\\\\b\\\", \\\"'re\\\", s)\\n s = re.sub(r\\\" s\\\\b\\\", \\\"'s\\\", s)\\n s = re.sub(r\\\"\\\\bi\\\\b\\\", \\\"I\\\", s)\\n\\n return s\\n\\nif __name__ == \\\"__main__\\\":\\n txt_with_pauses_and_endings = remove_punctuation(read_book(text_url, text_start))\\n word2next, word2next2 = word_follows_words(txt_with_pauses_and_endings)\\n #%%\\n sentence = gen_sentence(word2next, word2next2)\\n print(sentence)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"my $text = '36-0.txt'.IO.slurp.subst(/.+ '*** START OF THIS' .+? \\\\n (.*?) 'End of the Project Gutenberg EBook' .*/, {$0} );\\n\\n$text.=subst(/ <+punct-[.!?\\\\’,]> /, ' ', :g);\\n$text.=subst(/ (\\\\s) '’' (\\\\s) /, '', :g);\\n$text.=subst(/ (\\\\w) '’' (\\\\s) /, {$0~$1}, :g);\\n$text.=subst(/ (\\\\s) '’' (\\\\w) /, {$0~$1}, :g);\\n\\nmy (%one, %two);\\n\\nfor $text.comb(/[\\\\w+(\\\\’\\\\w+)?]','?|<punct>/).rotor(3 => -2) {\\n %two{.[0]}{.[1]}{.[2]}++;\\n %one{.[0]}{.[1]}++;\\n}\\n\\nsub weightedpick (%hash) { %hash.keys.map( { $_ xx %hash{$_} } ).pick }\\n\\nsub sentence {\\n my @sentence = <. ! ?>.roll;\\n @sentence.push: weightedpick( %one{ @sentence[0] } );\\n @sentence.push: weightedpick( %two{ @sentence[*-2] }{ @sentence[*-1] } // %('.' => 1) )[0]\\n until @sentence[*-1] ∈ <. ! ?>;\\n @sentence.=squish;\\n shift @sentence;\\n redo if @sentence < 7;\\n @sentence.join(' ').tc.subst(/\\\\s(<:punct>)/, {$0}, :g);\\n}\\n\\nsay sentence() ~ \\\"\\\\n\\\" for ^10;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"import \\\"io\\\" for File\\nimport \\\"random\\\" for Random\\nimport \\\"./seq\\\" for Lst\\n\\n// puctuation to keep (also keep hyphen and apostrophe but don't count as words)\\nvar ending = \\\".!?\\\"\\nvar pausing = \\\",:;\\\"\\n\\n// puctuation to remove\\nvar removing = \\\"\\\\\\\"#$\\\\%&()*+/<=>@[\\\\\\\\]^_`{|}~“”\\\"\\n\\n// read in book\\nvar fileName = \\\"36-0.txt\\\" // local copy of http://www.gutenberg.org/files/36/36-0.txt\\nvar text = File.read(fileName)\\n\\n// skip to start\\nvar ix = text.indexOf(\\\"No one would have believed\\\")\\ntext = text[ix..-1]\\n\\n// remove extraneous punctuation\\nfor (r in removing) text = text.replace(r, \\\"\\\")\\n\\n// replace EM DASH (unicode 8212) with a space\\ntext = text.replace(\\\"—\\\", \\\" \\\")\\n\\n// split into words\\nvar words = text.split(\\\" \\\").where { |w| w != \\\"\\\" }.toList\\n// treat 'ending' and 'pausing' punctuation as words\\nfor (i in 0...words.count) {\\n var w = words[i]\\n for (p in ending + pausing) if (w.endsWith(p)) words[i] = [w[0...-1], w[-1]]\\n}\\nwords = Lst.flatten(words)\\n\\n// Keep account of what words follow words and how many times it is seen\\nvar dict1 = {}\\nfor (i in 0...words.count-1) {\\n var w1 = words[i]\\n var w2 = words[i+1]\\n if (dict1[w1]) {\\n dict1[w1].add(w2)\\n } else {\\n dict1[w1] = [w2]\\n }\\n}\\nfor (key in dict1.keys) dict1[key] = [dict1[key].count, Lst.individuals(dict1[key])]\\n\\n// Keep account of what words follow two words and how many times it is seen\\nvar dict2 = {}\\nfor (i in 0...words.count-2) {\\n var w12 = words[i] + \\\" \\\" + words[i+1]\\n var w3 = words[i+2]\\n if (dict2[w12]) {\\n dict2[w12].add(w3)\\n } else {\\n dict2[w12] = [w3]\\n }\\n}\\nfor (key in dict2.keys) dict2[key] = [dict2[key].count, Lst.individuals(dict2[key])]\\n\\nvar rand = Random.new()\\n\\nvar weightedRandomChoice = Fn.new { |value|\\n var n = value[0]\\n var indivs = value[1]\\n var r = rand.int(n)\\n var sum = 0\\n for (indiv in indivs) {\\n sum = sum + indiv[1]\\n if (r < sum) return indiv[0]\\n }\\n}\\n\\n// build 5 random sentences say\\nfor (i in 1..5) {\\n var sentence = weightedRandomChoice.call(dict1[\\\".\\\"])\\n var lastOne = sentence\\n var lastTwo = \\\". \\\" + sentence\\n while (true) {\\n var nextOne = weightedRandomChoice.call(dict2[lastTwo])\\n sentence = sentence + \\\" \\\" + nextOne\\n if (ending.contains(nextOne)) break // stop on reaching ending punctuation\\n lastTwo = lastOne + \\\" \\\" + nextOne\\n lastOne = nextOne\\n }\\n\\n // tidy up sentence\\n for (p in ending + pausing) sentence = sentence.replace(\\\" %(p)\\\", \\\"%(p)\\\")\\n sentence = sentence.replace(\\\"\\\\n\\\", \\\" \\\")\\n System.print(sentence)\\n System.print()\\n}\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Random-sentence-from-book"}}},{"rowIdx":1559,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Range_expansion\n","language":"00-META"},{"code":"{{:Range extraction/Format}}\n\n\n;Task:\nExpand the range description: \n <big> -6,-3--1,3-5,7-11,14,15,17-20 </big>\n\n<small>Note that the second element above, \nis the '''range from minus 3 to ''minus'' 1'''. </small>\n\n\n;Related task:\n* [[Range extraction]]\n<br><br>\n\n","language":"00-TASK"},{"code":"F rangeexpand(txt)\n [Int] lst\n L(r) txt.split(‘,’)\n I ‘-’ C r[1..]\n V rr = r[1..].split(‘-’, 2)\n lst [+]= Int(r[0]‘’rr[0]) .. Int(rr[1])\n E\n lst.append(Int(r))\n R lst\n\nprint(rangeexpand(‘-6,-3--1,3-5,7-11,14,15,17-20’))\n","language":"11l"},{"code":"\\ Given a low and high limit, create an array containing the numbers in the\n\\ range, inclusive:\n: n:gen-range \\ low hi -- a\n \\ make sure they are in order:\n 2dup n:> if swap then\n \\ fill the array with the values:\n [] ' a:push\n 2swap loop ;\n\n\\ Take a string, either \"X\" or \"X-Y\", and correctly return either a number (if\n\\ \"X\") or an array of numbers (if \"X-Y\"):\n: n:expand-one \\ s -- n | a[n,..m]\n \\ First see if we can parse a number. This works in the \"X\" case:\n dup >n null? if\n \\ Failed >n because it's (possibly) \"X-Y\"\n drop\n \\ not a valid number, might be a range\n \\ We'll use a capturing regex to handle the different cases correctly:\n /(-?[0-9]+)-(-?[0-9]+)/ tuck r:match\n\n \\ If the regex matches three (the whole string, plus the two captured\n \\ expressions) then it's a valid \"X-Y\":\n 3 n:= if\n 1 r:@ >n swap 2 r:@ >n nip\n \\ generate the range:\n n:gen-range\n else\n \\ The regex didn't match, so we got garbage. Therefore, return a 'null':\n drop null\n then\n else\n \\ It was a \"X\", just drop the original string:\n nip\n then\n ;\n\n\\ Take an array (possibly) containing other arrays, and flatten any contained\n\\ arrays so the result is a simple array:\n: a:flatten \\ a1 -- a2\n [] >r\n (\n nip\n array? if\n a:flatten r> swap a:+ >r\n else\n r> swap a:push >r\n then\n ) a:each drop r> ;\n\n\\ Take a comma-delimited string of ranges, and expand it into an array of\n\\ numbers:\n: n:range-expand \\ str -- a\n \",\" s:/\n ' n:expand-one a:map\n a:flatten ;\n\n\\ Process a list:\n\"-6,-3--1,3-5,7-11,14,15,17-20\"\nn:range-expand\n\\ print the expanded list:\n. cr bye\n","language":"8th"},{"code":"BYTE FUNC Find(CHAR ARRAY text CHAR c BYTE start)\n BYTE i\n\n i=start\n WHILE i<=text(0)\n DO\n IF text(i)=c THEN\n RETURN (i)\n FI\n i==+1\n OD\nRETURN (0)\n\nPROC ProcessItem(CHAR ARRAY text INT ARRAY res INT POINTER size)\n BYTE pos\n INT start,end,i\n CHAR ARRAY tmp(200)\n\n pos=Find(text,'-,2)\n IF pos=0 THEN\n res(size^)=ValI(text)\n size^==+1\n ELSE\n SCopyS(tmp,text,1,pos-1)\n start=ValI(tmp)\n SCopyS(tmp,text,pos+1,text(0))\n end=ValI(tmp)\n FOR i=start TO end\n DO\n res(size^)=i\n size^==+1\n OD\n FI\nRETURN\n\nPROC RangeExtraction(CHAR ARRAY text INT ARRAY res INT POINTER size)\n BYTE i,pos\n CHAR ARRAY tmp(200)\n\n i=1 size^=0\n WHILE i<=text(0)\n DO\n pos=Find(text,',,i)\n IF pos=0 THEN\n SCopyS(tmp,text,i,text(0))\n i=text(0)+1\n ELSE\n SCopyS(tmp,text,i,pos-1)\n i=pos+1\n FI\n ProcessItem(tmp,res,size)\n OD\nRETURN\n\nPROC PrintArray(INT ARRAY a INT size)\n INT i\n\n Put('[)\n FOR i=0 TO size-1\n DO\n IF i>0 THEN Put(' ) FI\n PrintI(a(i))\n OD\n Put(']) PutE()\nRETURN\n\nPROC Main()\n INT ARRAY res(100)\n INT size\n RangeExtraction(\"-6,-3--1,3-5,7-11,14,15,17-20\",res,@size)\n PrintArray(res,size)\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\nprocedure Test_Range_Expansion is\n type Sequence is array (Positive range <>) of Integer;\n function Expand (Text : String) return Sequence is\n To : Integer := Text'First;\n Count : Natural := 0;\n Low : Integer;\n function Get return Integer is\n From : Integer := To;\n begin\n if Text (To) = '-' then\n To := To + 1;\n end if;\n while To <= Text'Last loop\n case Text (To) is\n when ',' | '-' => exit;\n when others => To := To + 1;\n end case;\n end loop;\n return Integer'Value (Text (From..To - 1));\n end Get;\n begin\n while To <= Text'Last loop -- Counting items of the list\n Low := Get;\n if To > Text'Last or else Text (To) = ',' then\n Count := Count + 1;\n else\n To := To + 1;\n Count := Count + Get - Low + 1;\n end if;\n To := To + 1;\n end loop;\n return Result : Sequence (1..Count) do\n Count := 0;\n To := Text'First;\n while To <= Text'Last loop -- Filling the list\n Low := Get;\n if To > Text'Last or else Text (To) = ',' then\n Count := Count + 1;\n Result (Count) := Low;\n else\n To := To + 1;\n for Item in Low..Get loop\n Count := Count + 1;\n Result (Count) := Item;\n end loop;\n end if;\n To := To + 1;\n end loop;\n end return;\n end Expand;\n procedure Put (S : Sequence) is\n First : Boolean := True;\n begin\n for I in S'Range loop\n if First then\n First := False;\n else\n Put (',');\n end if;\n Put (Integer'Image (S (I)));\n end loop;\n end Put;\nbegin\n Put (Expand (\"-6,-3--1,3-5,7-11,14,15,17-20\"));\nend Test_Range_Expansion;\n","language":"Ada"},{"code":"list l;\n\nfile().b_affix(\"-6,-3--1,3-5,7-11,14,15,17-20\").news(l, 0, 0, \",\");\nfor (, text s in l) {\n integer a, b, p;\n\n p = b_frame(s, '-');\n if (p < 1) {\n o_(s, \",\");\n } else {\n p -= s[p - 1] == '-' ? 1 : 0;\n a = s.cut(0, p).atoi;\n b = s.erase(0, p).atoi;\n do {\n o_(a, \",\");\n } while ((a += 1) <= b);\n }\n}\n\no_(\"\\n\");\n","language":"Aime"},{"code":"integer p;\nlist l;\n\nfile().b_affix(\"-6,-3--1,3-5,7-11,14,15,17-20\").news(l, 0, 0, \",\");\nfor (, text s in l) {\n if ((p = b_frame(s, '-')) < 1) {\n o_(s, \",\");\n } else {\n p -= s[p - 1] == '-' ? 1 : 0;\n call_s(o_, 0, s.cut(0, p).atoi, s.erase(0, p).atoi + 1, 1, \",\");\n }\n}\n\no_(\"\\n\");\n","language":"Aime"},{"code":"MODE YIELDINT = PROC(INT)VOID;\n\nMODE RANGE = STRUCT(INT lwb, upb);\nMODE RANGEINT = UNION(RANGE, INT);\n\nOP SIZEOF = ([]RANGEINT list)INT: (\n# determine the length of the output array #\n INT upb := LWB list - 1;\n FOR key FROM LWB list TO UPB list DO\n CASE list[key] IN\n (RANGE value): upb +:= upb OF value - lwb OF value + 1,\n (INT): upb +:= 1\n ESAC\n OD;\n upb\n);\n\nPROC gen range expand = ([]RANGEINT list, YIELDINT yield)VOID:\n FOR key FROM LWB list TO UPB list DO\n CASE list[key] IN\n (RANGE range): FOR value FROM lwb OF range TO upb OF range DO yield(value) OD,\n (INT int): yield(int)\n ESAC\n OD;\n\nPROC range expand = ([]RANGEINT list)[]INT: (\n [LWB list: LWB list + SIZEOF list - 1]INT out;\n INT upb := LWB out - 1;\n# FOR INT value IN # gen range expand(list, # ) DO #\n## (INT value)VOID:\n out[upb +:= 1] := value\n# OD #);\n out\n);\n\n#\ntest:(\n []RANGEINT list = (-6, RANGE(-3, -1), RANGE(3, 5), RANGE(7, 11), 14, 15, RANGE(17, 20));\n print((range expand(list), new line))\n)\n#\n\n\n# converts string containing a comma-separated list of ranges and values to a []RANGEINT #\nOP TORANGE = ( STRING s )[]RANGEINT:\nBEGIN\n\n # counts the number of elements - one more than the number of commas #\n # and so assumes there is always at least one element #\n PROC count elements = INT:\n BEGIN\n\n INT elements := 1;\n\n FOR pos FROM LWB s TO UPB s\n DO\n IF s[ pos ] = \",\"\n THEN\n elements +:= 1\n FI\n OD;\n\n # RESULT #\n elements\n END; # count elements #\n\n REF[]RANGEINT result = HEAP [ 1 : count elements ]RANGEINT;\n\n # does the actual parsing - assumes the string is syntatically valid and doesn't check for errors #\n # - in particular, a string with no elements will cause problems, as will space characters in the string #\n PROC parse range string = []RANGEINT:\n BEGIN\n\n INT element := 0;\n INT str pos := 1;\n\n PROC next = VOID: str pos +:= 1;\n PROC curr char = CHAR: IF str pos > UPB s THEN \"?\" ELSE s[ str pos ] FI;\n PROC have minus = BOOL: curr char = \"-\";\n PROC have digit = BOOL: curr char >= \"0\" AND curr char <= \"9\";\n\n\n # parses a number out of the string #\n # the number must be a sequence of digits with an optional leading minus sign #\n PROC get number = INT:\n BEGIN\n\n INT number := 0;\n\n INT sign multiplier = IF have minus\n THEN\n # negaive number #\n # skip the sign #\n next;\n -1\n ELSE\n # positive number #\n 1\n FI;\n\n WHILE curr char >= \"0\" AND curr char <= \"9\"\n DO\n number *:= 10;\n number +:= ( ABS curr char - ABS \"0\" );\n next\n OD;\n\n # RESULT #\n number * sign multiplier\n END; # get number #\n\n\n # main parsing #\n WHILE str pos <= UPB s\n DO\n CHAR c = curr char;\n\n IF have minus OR have digit\n THEN\n # have the start of a number #\n INT from value = get number;\n element +:= 1;\n IF NOT have minus\n THEN\n # not a range #\n result[ element ] := from value\n ELSE\n # have a range #\n next;\n INT to value = get number;\n result[ element ] := RANGE( from value, to value )\n FI\n ELSE\n # should be a comma #\n next\n FI\n OD;\n\n # RESULT #\n result\n END; # parse range string #\n\n\n# RESULT #\n parse range string\nEND; # TORANGE #\n\n\n# converts a []INT to a comma separated string of the elements #\nOP TOSTRING = ( []INT values )STRING:\nBEGIN\n\n STRING result := \"\";\n STRING separator := \"\";\n\n FOR pos FROM LWB values TO UPB values\n DO\n result +:= ( separator + whole( values[ pos ], 0 ) );\n separator := \",\"\n OD;\n\n# RESULT #\n result\nEND; # TOSTRING #\n\n\ntest:(\n print( ( TOSTRING range expand( TORANGE \"-6,-3--1,3-5,7-11,14,15,17-20\" ), newline ) )\n)\n","language":"ALGOL-68"},{"code":"range←{\n aplnum←{⍎('¯',⎕D)[('-',⎕D)⍳⍵]}\n ∊{ 0::('Invalid range: ''',⍵,'''')⎕SIGNAL 11\n n←aplnum¨(~<\\(⊢≠∨\\)⍵∊⎕D)⊆⍵\n 1=≢n:n\n s e←n\n (s+(⍳e-s-1))-1\n }¨(⍵≠',')⊆⍵\n}\n","language":"APL"},{"code":"-- Each comma-delimited string is mapped to a list of integers,\n-- and these integer lists are concatenated together into a single list\n\n\n---------------------- RANGE EXPANSION ---------------------\n\n-- expansion :: String -> [Int]\non expansion(strExpr)\n -- The string (between commas) is split on hyphens,\n -- and this segmentation is rewritten to ranges or minus signs\n -- and evaluated to lists of integer values\n\n -- signedRange :: String -> [Int]\n script signedRange\n -- After the first character, numbers preceded by an\n -- empty string (resulting from splitting on hyphens)\n -- and interpreted as negative\n\n -- signedIntegerAppended:: [Int] -> String -> Int -> [Int] -> [Int]\n on signedIntegerAppended(acc, strNum, iPosn, xs)\n if strNum ≠ \"\" then\n if iPosn > 1 then\n set strSign to |λ|(0 < length of (item (iPosn - 1) of xs)) ¬\n of bool(\"\", \"-\")\n else\n set strSign to \"+\"\n end if\n\n acc & ((strSign & strNum) as integer)\n else\n acc\n end if\n end signedIntegerAppended\n\n on |λ|(strHyphenated)\n tupleRange(foldl(signedIntegerAppended, {}, ¬\n splitOn(\"-\", strHyphenated)))\n end |λ|\n end script\n\n concatMap(signedRange, splitOn(\",\", strExpr))\nend expansion\n\n\n---------------------------- TEST --------------------------\non run\n\n expansion(\"-6,-3--1,3-5,7-11,14,15,17-20\")\n\n --> {-6, -3, -2, -1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20}\nend run\n\n\n--------------------- GENERIC FUNCTIONS --------------------\n\n\n-- bool :: a -> a -> Bool -> a\non bool(tf, ff)\n -- The evaluation of either tf or ff,\n -- depending on a boolean value.\n script\n on |λ|(bln)\n if bln then\n set e to tf\n else\n set e to ff\n end if\n set c to class of e\n if {script, handler} contains c then\n |λ|() of mReturn(e)\n else\n e\n end if\n end |λ|\n end script\nend bool\n\n-- concatMap :: (a -> [b]) -> [a] -> [b]\non concatMap(f, xs)\n script append\n on |λ|(a, b)\n a & b\n end |λ|\n end script\n\n foldl(append, {}, map(f, xs))\nend concatMap\n\n-- enumFromTo :: Int -> Int -> [Int]\non enumFromTo(m, n)\n if n < m then\n set d to -1\n else\n set d to 1\n end if\n set lst to {}\n repeat with i from m to n by d\n set end of lst to i\n end repeat\n return lst\nend enumFromTo\n\n-- foldl :: (a -> b -> a) -> a -> [b] -> a\non foldl(f, startValue, xs)\n tell mReturn(f)\n set v to startValue\n set lng to length of xs\n repeat with i from 1 to lng\n set v to |λ|(v, item i of xs, i, xs)\n end repeat\n return v\n end tell\nend foldl\n\n-- map :: (a -> b) -> [a] -> [b]\non map(f, xs)\n tell mReturn(f)\n set lng to length of xs\n set lst to {}\n repeat with i from 1 to lng\n set end of lst to |λ|(item i of xs, i, xs)\n end repeat\n return lst\n end tell\nend map\n\n-- Lift 2nd class handler function into 1st class script wrapper\n-- mReturn :: Handler -> Script\non mReturn(f)\n if class of f is script then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n\n-- splitOn :: Text -> Text -> [Text]\non splitOn(strDelim, strMain)\n set {dlm, my text item delimiters} to {my text item delimiters, strDelim}\n set xs to text items of strMain\n set my text item delimiters to dlm\n return xs\nend splitOn\n\n-- range :: (Int, Int) -> [Int]\non tupleRange(tuple)\n if tuple = {} then\n {}\n else if length of tuple > 1 then\n enumFromTo(item 1 of tuple, item 2 of tuple)\n else\n item 1 of tuple\n end if\nend tupleRange\n","language":"AppleScript"},{"code":"{-6, -3, -2, -1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20}\n","language":"AppleScript"},{"code":"on rangeExpansion(rangeExpression)\n -- Split the expression at the commas, if any.\n set astid to AppleScript's text item delimiters\n set AppleScript's text item delimiters to \",\"\n set theRanges to rangeExpression's text items\n\n set integerList to {}\n set AppleScript's text item delimiters to \"-\"\n repeat with thisRange in theRanges\n -- Split each range or integer text at its dash(es), if any.\n set rangeParts to thisRange's text items\n -- A minus before the first integer will make leading text item \"\".\n -- If this happens, insert the negative first value at the beginning of the parts list.\n -- (AppleScript automatically coerces numeric text to number when the context demands.)\n if (rangeParts begins with \"\") then set beginning of rangeParts to -(item 2 of rangeParts)\n -- A minus before the second (or only) integer will make the penultimate text item \"\".\n -- In this case, insert the negative last value at the end of the parts list.\n if (((count rangeParts) > 1) and (item -2 of rangeParts is \"\")) then set end of rangeParts to -(end of rangeParts)\n -- Append all the integers implied by the range to the integer list.\n repeat with i from (beginning of rangeParts) to (end of rangeParts)\n set end of integerList to i\n end repeat\n end repeat\n set AppleScript's text item delimiters to astid\n\n return integerList\nend rangeExpansion\n\n-- Demo code:\nset rangeExpression to \"-6,-3--1,3-5,7-11,14,15,17-20\"\nreturn rangeExpansion(rangeExpression)\n","language":"AppleScript"},{"code":"{-6, -3, -2, -1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20}\n","language":"AppleScript"},{"code":"expandRange: function [rng][\n flatten @ to :block\n join.with:\" \" map split.by:\",\" rng 'x ->\n replace replace replace x\n {/^\\-(\\d+)/} \"(neg $1)\" {/\\-\\-(\\d+)/}\n \"-(neg $1)\" \"-\" \"..\"\n]\n\nprint expandRange {-6,-3--1,3-5,7-11,14,15,17-20}\n","language":"Arturo"},{"code":"msgbox % expand(\"-6,-3--1,3-5,7-11,14,15,17-20\")\n\nexpand( range ) {\n p := 0\n while p := RegExMatch(range, \"\\s*(-?\\d++)(?:\\s*-\\s*(-?\\d++))?\", f, p+1+StrLen(f))\n loop % (f2 ? f2-f1 : 0) + 1\n ret .= \",\" (A_Index-1) + f1\n return SubStr(ret, 2)\n}\n","language":"AutoHotkey"},{"code":"#!/usr/bin/awk -f\nBEGIN {\tFS=\",\"; }\n\n{\ts=\"\";\n\tfor (i=1; i<=NF; i++) { expand($i); }\n\tprint substr(s,2);\n}\n\nfunction expand(a) {\n\tidx = match(a,/[0-9]-/);\n\tif (idx==0) {\n\t\ts = s\",\"a; \t\n\t\treturn;\n\t}\n\t\n\tstart= substr(a,1, idx)+0;\n\tstop = substr(a,idx+2)+0;\n\tfor (m = start; m <= stop; m++) {\n\t\ts = s\",\"m; \t\n\t}\n\treturn;\n}\n","language":"AWK"},{"code":" PRINT FNrangeexpand(\"-6,-3--1,3-5,7-11,14,15,17-20\")\n END\n\n DEF FNrangeexpand(r$)\n LOCAL i%, j%, k%, t$\n REPEAT\n i% = INSTR(r$, \"-\", i%+1)\n IF i% THEN\n j% = i%\n WHILE MID$(r$,j%-1,1)<>\",\" AND j%<>1\n j% -= 1\n ENDWHILE\n IF i%>j% IF MID$(r$,j%,i%-j%)<>STRING$(i%-j%,\" \") THEN\n t$ = \"\"\n FOR k% = VALMID$(r$,j%) TO VALMID$(r$,i%+1)-1\n t$ += STR$(k%) + \",\"\n NEXT\n r$ = LEFT$(r$,j%-1) + t$ + MID$(r$,i%+1)\n i% = j% + LEN(t$) + 2\n ENDIF\n ENDIF\n UNTIL i% = 0\n = r$\n","language":"BBC-BASIC"},{"code":" ( expandRanges\n = a b L\n . @( !arg\n : (#(?a:?b)|#?a \"-\" #?b)\n (:?L|\",\" [%(expandRanges$!sjt:?L))\n )\n & whl\n ' ( (!L:&!b|(!b,!L))\n : ?L\n & -1+!b:~<!a:?b\n )\n & !L\n |\n )\n& out$(str$(expandRanges$\"-6,-3--1,3-5,7-11,14,15,17-20\"))\n","language":"Bracmat"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <ctype.h>\n\n/* BNFesque\n\trangelist := (range | number) [',' rangelist]\n\trange := number '-' number\t*/\n\nint get_list(const char *, char **);\nint get_rnge(const char *, char **);\n\n/* parser only parses; what to do with parsed items is up to\n* the add_number and and_range functions */\nvoid add_number(int x);\nint add_range(int x, int y);\n\n#define skip_space while(isspace(*s)) s++\n#define get_number(x, s, e) (x = strtol(s, e, 10), *e != s)\nint get_list(const char *s, char **e)\n{\n\tint x;\n\twhile (1) {\n\t\tskip_space;\n\t\tif (!get_rnge(s, e) && !get_number(x, s, e)) break;\n\t\ts = *e;\n\n\t\tskip_space;\n\t\tif ((*s) == '\\0') { putchar('\\n'); return 1; }\n\t\tif ((*s) == ',') { s++; continue; }\n\t\tbreak;\n\t}\n\t*(const char **)e = s;\n\tprintf(\"\\nSyntax error at %s\\n\", s);\n\treturn 0;\n}\n\nint get_rnge(const char *s, char **e)\n{\n\tint x, y;\n\tchar *ee;\n\tif (!get_number(x, s, &ee)) return 0;\n\ts = ee;\n\n\tskip_space;\n\tif (*s != '-') {\n\t\t*(const char **)e = s;\n\t\treturn 0;\n\t}\n\ts++;\n\tif(!get_number(y, s, e)) return 0;\n\treturn add_range(x, y);\n}\n\nvoid add_number(int x)\n{\n\tprintf(\"%d \", x);\n}\n\nint add_range(int x, int y)\n{\n\tif (y <= x) return 0;\n\twhile (x <= y) printf(\"%d \", x++);\n\treturn 1;\n}\n\nint main()\n{\n\tchar *end;\n\n\t/* this is correct */\n\tif (get_list(\"-6,-3--1,3-5,7-11,14,15,17-20\", &end)) puts(\"Ok\");\n\n\t/* this is not. note the subtle error: \"-6 -3\" is parsed\n\t * as range(-6, 3), so synax error comes after that */\n\tget_list(\"-6 -3--1,3-5,7-11,14,15,17-20\", &end);\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <sstream>\n#include <iterator>\n#include <climits>\n#include <deque>\n\n// parse a list of numbers with ranges\n//\n// arguments:\n// is: the stream to parse\n// out: the output iterator the parsed list is written to.\n//\n// returns true if the parse was successful. false otherwise\ntemplate<typename OutIter>\n bool parse_number_list_with_ranges(std::istream& is, OutIter out)\n{\n int number;\n // the list always has to start with a number\n while (is >> number)\n {\n *out++ = number;\n\n char c;\n if (is >> c)\n switch(c)\n {\n case ',':\n continue;\n case '-':\n {\n int number2;\n if (is >> number2)\n {\n if (number2 < number)\n return false;\n while (number < number2)\n *out++ = ++number;\n char c2;\n if (is >> c2)\n if (c2 == ',')\n continue;\n else\n return false;\n else\n return is.eof();\n }\n else\n return false;\n }\n default:\n return is.eof();\n }\n else\n return is.eof();\n }\n // if we get here, something went wrong (otherwise we would have\n // returned from inside the loop)\n return false;\n}\n\nint main()\n{\n std::istringstream example(\"-6,-3--1,3-5,7-11,14,15,17-20\");\n std::deque<int> v;\n bool success = parse_number_list_with_ranges(example, std::back_inserter(v));\n if (success)\n {\n std::copy(v.begin(), v.end()-1,\n std::ostream_iterator<int>(std::cout, \",\"));\n std::cout << v.back() << \"\\n\";\n }\n else\n std::cout << \"an error occured.\";\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text.RegularExpressions;\n\nclass Program\n{\n static void Main(string[] args)\n {\n var rangeString = \"-6,-3--1,3-5,7-11,14,15,17-20\";\n var matches = Regex.Matches(rangeString, @\"(?<f>-?\\d+)-(?<s>-?\\d+)|(-?\\d+)\");\n var values = new List<string>();\n\n foreach (var m in matches.OfType<Match>())\n {\n if (m.Groups[1].Success)\n {\n values.Add(m.Value);\n continue;\n }\n\n var start = Convert.ToInt32(m.Groups[\"f\"].Value);\n var end = Convert.ToInt32(m.Groups[\"s\"].Value) + 1;\n\n values.AddRange(Enumerable.Range(start, end - start).Select(v => v.ToString()));\n }\n\n Console.WriteLine(string.Join(\", \", values));\n }\n}\n","language":"C-sharp"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nnamespace RangeExpansion {\n internal static class StringExtensions {\n internal static IEnumerable<int> ExpandRange(this string s) {\n return s.Split(',')\n .Select(rstr => {\n int start;\n if (int.TryParse(rstr, out start))\n return new {Start = start, End = start};\n var istr = new string((\"+-\".Any(_ => rstr[0] == _)\n ? rstr.Take(1).Concat(rstr.Skip(1).TakeWhile(char.IsDigit))\n : rstr.TakeWhile(char.IsDigit)\n ).ToArray());\n rstr = rstr.Substring(istr.Length + 1, (rstr.Length - istr.Length) - 1);\n return new {Start = int.Parse(istr), End = int.Parse(rstr)};\n }).SelectMany(_ => Enumerable.Range(_.Start, _.End - _.Start + 1));\n }\n }\n\n internal static class Program {\n private static void Main() {\n const string RANGE_STRING = \"-6,-3--1,3-5,7-11,14,15,17-20\";\n var values = RANGE_STRING.ExpandRange().ToList();\n var vstr = string.Join(\", \", values.Select(_ => _.ToString()));\n Console.WriteLine(vstr);\n }\n }\n}\n","language":"C-sharp"},{"code":"(defn split [s sep]\n (defn skipFirst [[x & xs :as s]]\n\t(cond (empty? s) [nil nil]\n\t (= x sep) [x xs]\n\t true [nil s]))\n (loop [lst '(), s s]\n\t (if (empty? s) (reverse lst)\n\t (let [[hd trunc] (skipFirst s)\n\t [word news] (split-with #(not= % sep) trunc)\n\t\t cWord (cons hd word)]\n\t\t (recur (cons (apply str cWord) lst)\n\t\t \t (apply str (rest news)))))))\n\n(defn parseRange [[x & xs :as s]]\n (if (some #(= % \\-) xs)\n\t (let [[r0 r1] (split s \\-)]\n\t\t(range (read-string r0) (inc (read-string r1))))\n\t (list (read-string (str s))))))\n\n(defn rangeexpand [s]\n (flatten (map parseRange (split s \\,))))\n\n> (rangeexpand \"-6,-3--1,3-5,7-11,14,15,17-20\")\n(-6 -3 -2 -1 3 4 5 7 8 9 10 11 14 15 17 18 19 20)\n","language":"Clojure"},{"code":" >>SOURCE FREE\nIDENTIFICATION DIVISION.\nPROGRAM-ID. expand-range.\n\nDATA DIVISION.\nWORKING-STORAGE SECTION.\n01 comma-pos PIC 99 COMP VALUE 1.\n01 dash-pos PIC 99 COMP.\n01 end-num PIC S9(3).\n01 Max-Part-Len CONSTANT 10.\n01 num PIC S9(3).\n01 edited-num PIC -(3)9.\n01 part PIC X(10).\n\n01 part-flag PIC X.\n 88 last-part VALUE \"Y\".\n\n01 range-str PIC X(80).\n01 Range-Str-Len CONSTANT 80.\n01 start-pos PIC 99 COMP.\n01 start-num PIC S9(3).\n\nPROCEDURE DIVISION.\n ACCEPT range-str\n\n PERFORM WITH TEST AFTER UNTIL last-part\n UNSTRING range-str DELIMITED BY \",\" INTO part WITH POINTER comma-pos\n PERFORM check-if-last\n\n PERFORM find-range-dash\n\n IF dash-pos > Max-Part-Len\n PERFORM display-num\n ELSE\n PERFORM display-range\n END-IF\n END-PERFORM\n\n DISPLAY SPACES\n\n GOBACK\n .\ncheck-if-last SECTION.\n IF comma-pos > Range-Str-Len\n SET last-part TO TRUE\n END-IF\n .\nfind-range-dash SECTION.\n IF part (1:1) <> \"-\"\n MOVE 1 TO start-pos\n ELSE\n MOVE 2 TO start-pos\n END-IF\n\n MOVE 1 TO dash-pos\n INSPECT part (start-pos:) TALLYING dash-pos FOR CHARACTERS BEFORE \"-\"\n COMPUTE dash-pos = dash-pos + start-pos - 1\n .\ndisplay-num SECTION.\n MOVE part TO edited-num\n CALL \"display-edited-num\" USING CONTENT part-flag, edited-num\n .\ndisplay-range SECTION.\n MOVE part (1:dash-pos - 1) TO start-num\n MOVE part (dash-pos + 1:) TO end-num\n\n PERFORM VARYING num FROM start-num BY 1 UNTIL num = end-num\n MOVE num TO edited-num\n CALL \"display-edited-num\" USING CONTENT \"N\", edited-num\n END-PERFORM\n\n MOVE end-num TO edited-num\n CALL \"display-edited-num\" USING CONTENT part-flag, edited-num\n .\nEND PROGRAM expand-range.\n\n\nIDENTIFICATION DIVISION.\nPROGRAM-ID. display-edited-num.\n\nDATA DIVISION.\nLINKAGE SECTION.\n01 hide-comma-flag PIC X.\n 88 hide-comma VALUE \"Y\".\n01 edited-num PIC -(3)9.\n\nPROCEDURE DIVISION USING hide-comma-flag, edited-num.\n DISPLAY FUNCTION TRIM(edited-num) NO ADVANCING\n IF NOT hide-comma\n DISPLAY \", \" NO ADVANCING\n END-IF\n .\nEND PROGRAM display-edited-num.\n","language":"COBOL"},{"code":"(defun expand-ranges (string)\n (loop\n with prevnum = nil\n for idx = 0 then (1+ nextidx)\n for (number nextidx) = (multiple-value-list\n (parse-integer string\n :start idx :junk-allowed t))\n append (cond\n (prevnum\n (prog1\n (loop for i from prevnum to number\n collect i)\n (setf prevnum nil)))\n ((and (< nextidx (length string))\n (char= (aref string nextidx) #\\-))\n (setf prevnum number)\n nil)\n (t\n (list number)))\n while (< nextidx (length string))))\n\nCL-USER> (expand-ranges \"-6,-3--1,3-5,7-11,14,15,17-20\")\n(-6 -3 -2 -1 3 4 5 7 8 9 10 11 14 15 17 18 19 20)\n","language":"Common-Lisp"},{"code":"include \"cowgol.coh\";\n\n# Callback interface\ninterface RangeCb(n: int32);\n\n# This will call `cb' for each number in the range, in ascending order.\n# It will return NULL on success, or the location of an error if\n# there is one.\nsub Expand(ranges: [uint8], cb: RangeCb): (err: [uint8]) is\n err := 0 as [uint8];\n loop\n # Grab first number\n var n1: int32;\n var next: [uint8];\n (n1, next) := AToI(ranges);\n\n if next == ranges then\n # No number here!\n err := ranges;\n break;\n elseif [next] == ',' or [next] == 0 then\n # Only one number, not a range\n cb(n1);\n elseif [next] != '-' then\n # No dash!\n err := ranges;\n break;\n else\n # Grab second number\n ranges := @next next;\n var n2: int32;\n (n2, next) := AToI(ranges);\n if next == ranges or n1 >= n2 then\n # No second number, or first not before second\n err := ranges;\n break;\n end if;\n\n # We need all numbers from n1 to n2 inclusive\n while n1 <= n2 loop\n cb(n1);\n n1 := n1 + 1;\n end loop;\n end if;\n\n # stop if end reached\n if [next] == 0 then break;\n elseif [next] != ',' then\n err := ranges;\n break;\n end if;\n ranges := @next next;\n end loop;\nend sub;\n\n# This function will use `Expand' above to expand a comma-separated\n# range list, and reformat it as a comma-separated list of integers.\nsub ExpandFmt(ranges: [uint8], buf: [uint8]): (err: [uint8]) is\n # Format and add number to buffer\n sub AddNum implements RangeCb is\n buf := IToA(n, 10, buf);\n [buf] := ',';\n buf := @next buf;\n end sub;\n\n # Expand range, adding numbers to buffer\n err := Expand(ranges, AddNum);\n [@prev buf] := 0;\nend sub;\n\n# Expand and print, and/or give error\nsub PrintExpansion(ranges: [uint8]) is\n var buf: uint8[256];\n var err := ExpandFmt(ranges, &buf[0]);\n print(ranges);\n print_nl();\n print(\" >> \");\n if err == 0 as [uint8] then\n # everything is OK\n print(&buf[0]);\n else\n # error\n print(\"error at: \");\n print(err);\n end if;\n print_nl();\nend sub;\n\n# Try it on the given input\nPrintExpansion(\"-6,-3--1,3-5,7-11,14,15,17-20\");\n\n# Try it on a couple of wrong ones\nPrintExpansion(\"-6-3--1,3-5,7-11,14,15,17-20\"); # misformatted range\nPrintExpansion(\"-6,-3--1,5-3,7-11,14,15,17-20\"); # numbers not in order\n","language":"Cowgol"},{"code":"def range_expand(range)\n range.split(',').flat_map do |part|\n match = /^(-?\\d+)-(-?\\d+)$/.match(part)\n if match\n (match[1].to_i .. match[2].to_i).to_a\n else\n part.to_i\n end\n end\nend\n\nputs range_expand(\"-6,-3--1,3-5,7-11,14,15,17-20\")\n","language":"Crystal"},{"code":"import std.stdio, std.regex, std.conv, std.range, std.algorithm;\n\nenum rangeEx = (string s) /*pure*/ => s.matchAll(`(-?\\d+)-?(-?\\d+)?,?`)\n .map!q{ a[1].to!int.iota(a[1 + !a[2].empty].to!int + 1) }.join;\n\nvoid main() {\n \"-6,-3--1,3-5,7-11,14,15,17-20\".rangeEx.writeln;\n}\n","language":"D"},{"code":"program Range_expansion;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils;\n\nconst\n input = '-6,-3--1,3-5,7-11,14,15,17-20';\n\nvar\n r: TArray<Integer>;\n last, i, n: Integer;\n\nbegin\n for var part in input.Split([',']) do\n begin\n i := part.Substring(1).IndexOf('-');\n if i = -1 then\n begin\n if not TryStrToInt(part, n) then\n raise Exception.Create('Error: value invalid ' + part);\n if Length(r) > 0 then\n if last = n then\n begin\n raise Exception.Create('Error: Duplicate value:' + n.ToString);\n end\n else\n begin\n if last > n then\n raise Exception.CreateFmt('Error: values not ordered: %s > %s', [last, n]);\n end;\n SetLength(r, Length(r) + 1);\n r[High(r)] := n;\n last := n;\n end\n else\n begin\n var n1 := 0;\n var n2 := 0;\n if not TryStrToInt(part.Substring(0, i + 1), n1) then\n raise Exception.Create('Error: value invalid ' + part);\n if not TryStrToInt(part.Substring(i + 2), n2) then\n raise Exception.Create('Error: value invalid ' + part);\n if n2 < n1 + 2 then\n raise Exception.Create('Error: Invalid range' + part);\n if Length(r) > 0 then\n begin\n if last = n1 then\n raise Exception.Create('Error: Duplicate value: ' + n1.ToString);\n if last > n1 then\n raise Exception.CreateFmt('Error: Values not ordened: %d > %d', [last, n1]);\n end;\n\n for i := n1 to n2 do\n begin\n SetLength(r, Length(r) + 1);\n r[High(r)] := i;\n end;\n\n last := n2;\n end;\n end;\n write('expanded: ');\n for var rr in r do\n begin\n write(rr, ',');\n end;\n readln;\nend.\n","language":"Delphi"},{"code":"function ExpandRanges(ranges : String) : array of Integer;\nbegin\n for var range in ranges.Split(',') do begin\n var separator = range.IndexOf('-', 2);\n if separator > 0 then begin\n for var i := range.Left(separator-1).ToInteger to range.Copy(separator+1).ToInteger do\n Result.Add(i);\n end else begin\n Result.Add(range.ToInteger)\n end;\n end;\nend;\n\nvar expanded := ExpandRanges('-6,-3--1,3-5,7-11,14,15,17-20');\nPrintLn(JSON.Stringify(expanded));\n","language":"DWScript"},{"code":"func main() {\n let input = \"-6,-3--1,3-5,7-11,14,15,17-20\"\n print(\"range: \\(input)\")\n var r = []\n var last = 0\n for part in input.Split(',') {\n var i = part[1..].IndexOf('-')\n if i == -1 {\n var n = Integer(part)\n if r.Length() > 0 {\n return print(\"duplicate value: \\(n)\") when last == n\n return print(\"values not ordered: \\(last) > \\(n)\") when last > n\n }\n r.Add(n)\n last = n\n } else {\n var n1 = Integer(part[..i])\n var n2 = Integer(part[(i + 2)..])\n return print(\"invalid range: \\(part)\") when n2 < n1 + 2\n\n if r.Length() > 0 {\n return print(\"duplicate value: \\(n1)\") when last == n1\n return print(\"values not ordered: \\(last) > \\(n1)\") when last > n1\n }\n\n for i in n1..n2 {\n r.Add(i)\n }\n last = n2\n }\n }\n\n print(\"expanded: \\(r)\")\n}\n\nmain()\n","language":"Dyalect"},{"code":";; parsing [spaces][-]digit(s)-[-]digit(s)[spaces]\n(define R (make-regexp \"^ *(\\-?\\\\d+)\\-(\\-?\\\\d+) *$\" ))\n\n;; the native (range a b) is [a ... b[\n;; (range+ a b) is [a ... b]\n(define (range+ a b)\n\t(if (< a b) (range a (1+ b))\n\t(if (> a b) (range a (1- b) -1)\n\t(list a))))\n\t\n;; in : string : \"number\" or \"number-number\"\n;; out : a range = list of integer(s)\n(define (do-range str)\n(define from-to (regexp-exec R str)) ;; \"1-3\" --> (\"1\" \"3\")\n(if from-to\n (range+ (string->number (first from-to)) (string->number (second from-to)))\n (list (string->number str))))\n\n(define (ranges str)\n (apply append (map do-range (string-split str \",\"))))\n\t\n\n(define task \"-6,-3--1,3-5,7-11,14,15,17-20\")\n(ranges task)\n → (-6 -3 -2 -1 3 4 5 7 8 9 10 11 14 15 17 18 19 20)\n","language":"EchoLisp"},{"code":"defmodule RC do\n def expansion(range) do\n Enum.flat_map(String.split(range, \",\"), fn part ->\n case Regex.scan(~r/^(-?\\d+)-(-?\\d+)$/, part) do\n [[_,a,b]] -> Enum.to_list(String.to_integer(a) .. String.to_integer(b))\n [] -> [String.to_integer(part)]\n end\n end)\n end\nend\n\nIO.inspect RC.expansion(\"-6,-3--1,3-5,7-11,14,15,17-20\")\n","language":"Elixir"},{"code":"-module( range ).\n\n-export( [expansion/1, task/0] ).\n\nexpansion( String ) ->\n lists:flatten( [expansion_individual(io_lib:fread(\"~d\", X)) || X <- string:tokens(String, \",\")] ).\n\ntask() ->\n io:fwrite( \"~p~n\", [expansion(\"-6,-3--1,3-5,7-11,14,15,17-20\")] ).\n\n\n\nexpansion_individual( {ok, [N], []} ) -> N;\nexpansion_individual( {ok, [Start], \"-\" ++ Stop_string} ) -> lists:seq( Start, erlang:list_to_integer(Stop_string) ).\n","language":"Erlang"},{"code":"open System.Text.RegularExpressions\n\n// simplify regex matching with an active pattern\nlet (|Regexp|_|) pattern txt =\n match Regex.Match(txt, pattern) with\n | m when m.Success -> [for g in m.Groups -> g.Value] |> List.tail |> Some\n | _ -> None\n\n// Parse and expand a single range description.\n// string -> int list\nlet parseRange r =\n match r with\n | Regexp @\"^(-?\\d+)-(-?\\d+)$\" [first; last] -> [int first..int last]\n | Regexp @\"^(-?\\d+)$\" [single] -> [int single]\n | _ -> failwithf \"illegal range format: %s\" r\n\n\nlet expand (desc:string) =\n desc.Split(',')\n |> List.ofArray\n |> List.collect parseRange\n\nprintfn \"%A\" (expand \"-6,-3--1,3-5,7-11,14,15,17-20\")\n","language":"F-Sharp"},{"code":"USING: kernel math.parser math.ranges prettyprint regexp\nsequences sequences.extras splitting ;\n\n: expand ( str -- seq )\n \",\" split [\n R/ (?<=\\d)-/ re-split [ string>number ] map\n dup length 2 = [ first2 [a,b] ] when\n ] map-concat ;\n\n\"-6,-3--1,3-5,7-11,14,15,17-20\" expand .\n","language":"Factor"},{"code":": >snumber ( str len -- 'str 'len n )\n 0. 2swap\n over c@ [char] - = if\n 1 /string\n >number 2swap drop\n negate\n else\n >number 2swap drop\n then ;\n\n: expand ( str len -- )\n begin dup while\n >snumber >r\n dup if over c@ [char] - = if\n 1 /string\n >snumber r> over >r\n do i . loop\n then then\n dup if over c@ [char] , = if\n 1 /string\n then then\n r> .\n repeat 2drop ;\n\ns\" -6,-3--1,3-5,7-11,14,15,17-20\" expand\n","language":"Forth"},{"code":" MODULE HOMEONTHERANGE\n CONTAINS\t!The key function.\n CHARACTER*200 FUNCTION ERANGE(TEXT)\t!Expands integer ranges in a list.\nCan't return a character value of variable size.\n CHARACTER*(*) TEXT\t!The list on input.\n CHARACTER*200 ALINE\t!Scratchpad for output.\n INTEGER N,N1,N2\t!Numbers in a range.\n INTEGER I,I1\t\t!Steppers.\n ALINE = \"\"\t\t!Scrub the scratchpad.\n L = 0\t\t\t!No text has been placed.\n I = 1\t\t\t!Start at the start.\n CALL FORASIGN\t\t!Find something to look at.\nChug through another number or number - number range.\n R:DO WHILE(EATINT(N1))\t!If I can grab a first number, a term has begun.\n N2 = N1\t\t\t!Make the far end the same.\n IF (PASSBY(\"-\")) CALL EATINT(N2)\t!A hyphen here is not a minus sign.\n IF (L.GT.0) CALL EMIT(\",\")\t\t!Another, after what went before?\n DO N = N1,N2,SIGN(+1,N2 - N1)\t!Step through the range, possibly backwards.\n CALL SPLOT(N)\t\t\t\t!Roll a number.\n IF (N.NE.N2) CALL EMIT(\",\")\t\t!Perhaps another follows.\n END DO\t\t\t\t!On to the next number.\n IF (.NOT.PASSBY(\",\")) EXIT R\t!More to come?\n END DO R\t\t!So much for a range.\nCompleted the scan. Just return the result.\n ERANGE = ALINE(1:L)\t!Present the result. Fiddling ERANGE is bungled by some compilers.\n CONTAINS\t!Some assistants for the scan to save on repetition and show intent.\n SUBROUTINE FORASIGN\t!Look for one.\n 1 IF (I.LE.LEN(TEXT)) THEN\t!After a thingy,\n IF (TEXT(I:I).LE.\" \") THEN\t!There may follow spaces.\n I = I + 1\t\t\t\t!So,\n GO TO 1\t\t\t\t\t!Speed past any.\n END IF\t\t\t!So that the caller can see\n END IF\t\t\t!Whatever substantive character follows.\n END SUBROUTINE FORASIGN\t!Simple enough.\n\n LOGICAL FUNCTION PASSBY(C)\t!Advances the scan if a certain character is seen.\nCould consider or ignore case for letters, but this is really for single symbols.\n CHARACTER*1 C\t!The character.\n PASSBY = .FALSE.\t!Pessimism.\n IF (I.LE.LEN(TEXT)) THEN\t!Can't rely on I.LE.LEN(TEXT) .AND. TEXT(I:I)...\n IF (TEXT(I:I).EQ.C) THEN\t!Curse possible full evaluation.\n PASSBY = .TRUE.\t\t!Righto, C is seen.\n I = I + 1\t\t!So advance the scan.\n CALL FORASIGN\t\t!And see what follows.\n END IF\t\t!So much for a match.\n END IF\t\t!If there is something to be uinspected.\n END FUNCTION PASSBY\t!Can't rely on testing PASSBY within PASSBY either.\n\n LOGICAL FUNCTION EATINT(N)\t!Convert text into an integer.\n INTEGER N\t!The value to be ascertained.\n INTEGER D\t!A digit.\n LOGICAL NEG\t!In case of a minus sign.\n EATINT = .FALSE.\t!Pessimism.\n IF (I.GT.LEN(TEXT)) RETURN\t!Anything to look at?\n N = 0\t\t\t!Scrub to start with.\n IF (PASSBY(\"+\")) THEN\t!A plus sign here can be ignored.\n NEG = .FALSE.\t\t!So, there's no minus sign.\n ELSE\t\t\t!And if there wasn't a plus,\n NEG = PASSBY(\"-\")\t\t!A hyphen here is a minus sign.\n END IF\t\t\t!One way or another, NEG is initialised.\n IF (I.GT.LEN(TEXT)) RETURN\t!Nothing further! We wuz misled!\nChug through digits. Can develop -2147483648, thanks to the workings of two's complement.\n 10 D = ICHAR(TEXT(I:I)) - ICHAR(\"0\")\t!Hope for a digit.\n IF (0.LE.D .AND. D.LE.9) THEN\t!Is it one?\n N = N*10 + D\t\t\t!Yes! Assimilate it, negatively.\n I = I + 1\t\t\t\t!Advance one.\n IF (I.LE.LEN(TEXT)) GO TO 10\t!And see what comes next.\n END IF\t\t\t!So much for a sequence of digits.\n IF (NEG) N = -N\t\t!Apply the minus sign.\n EATINT = .TRUE.\t\t!Should really check for at least one digit.\n CALL FORASIGN\t\t!Ram into whatever follows.\n END FUNCTION EATINT\t!Integers are easy. Could check for no digits seen.\n\n SUBROUTINE EMIT(C)\t!Rolls forth one character.\n CHARACTER*1 C\t!The character.\n L = L + 1\t\t!Advance the finger.\n IF (L.GT.LEN(ALINE)) STOP \"Ran out of ALINE!\"\t!Maybe not.\n ALINE(L:L) = C\t!And place the character.\n END SUBROUTINE EMIT\t!That was simple.\n\n SUBROUTINE SPLOT(N)\t!Rolls forth a signed number.\n INTEGER N\t\t!The number.\n CHARACTER*12 FIELD\t!Sufficient for 32-bit integers.\n INTEGER I\t\t!A stepper.\n WRITE (FIELD,\"(I0)\") N\t!Roll the number, with trailing spaces.\n DO I = 1,12\t\t!Now transfer the ALINE of the number.\n IF (FIELD(I:I).LE.\" \") EXIT\t!Up to the first space.\n CALL EMIT(FIELD(I:I))\t!One by one.\n END DO\t\t!On to the end.\n END SUBROUTINE SPLOT\t!Not so difficult either.\n END FUNCTION ERANGE\t!A bit tricky.\n END MODULE HOMEONTHERANGE\n\n PROGRAM POKE\n USE HOMEONTHERANGE\n CHARACTER*(200) SOME\n SOME = \"-6,-3--1,3-5,7-11,14,15,17-20\"\n SOME = ERANGE(SOME)\n WRITE (6,*) SOME\t!If ERANGE(SOME) then the function usually can't write output also.\n END\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nSub split (s As Const String, sepList As Const String, result() As String)\n If s = \"\" OrElse sepList = \"\" Then\n Redim result(0)\n result(0) = s\n Return\n End If\n Dim As Integer i, j, count = 0, empty = 0, length\n Dim As Integer position(Len(s) + 1)\n position(0) = 0\n\n For i = 0 To len(s) - 1\n For j = 0 to Len(sepList) - 1\n If s[i] = sepList[j] Then\n count += 1\n position(count) = i + 1\n End If\n Next j\n Next i\n\n Redim result(count)\n If count = 0 Then\n result(0) = s\n Return\n End If\n\n position(count + 1) = len(s) + 1\n\n For i = 1 To count + 1\n length = position(i) - position(i - 1) - 1\n result(i - 1) = Mid(s, position(i - 1) + 1, length)\n Next\nEnd Sub\n\nFunction expandRange(s As Const String) As String\n If s = \"\" Then Return \"\"\n Dim b() As String\n Dim c() As String\n Dim result As String = \"\"\n Dim As Integer start = 0, finish = 0, length\n split s, \",\", b()\n For i As Integer = LBound(b) To UBound(b)\n split b(i), \"-\", c()\n length = UBound(c) - LBound(c) + 1\n If length = 1 Then\n start = ValLng(c(LBound(c)))\n finish = start\n ElseIf length = 2 Then\n If Left(b(i), 1) = \"-\" Then\n start = -ValLng(c(UBound(c)))\n finish = start\n Else\n start = ValLng(c(LBound(c)))\n finish = ValLng(c(UBound(c)))\n End If\n ElseIf length = 3 Then\n start = -ValLng(c(LBound(c) + 1))\n finish = ValLng(c(UBound(c)))\n Else\n start = -ValLng(c(LBound(c) + 1))\n finish = -ValLng(c(UBound(c)))\n End If\n For j As Integer = start To finish\n result += Str(j) + \", \"\n Next j\n Next i\n Return Left(result, Len(result) - 2) '' get rid of final \", \"\nEnd Function\n\nDim s As String = \"-6,-3--1,3-5,7-11,14,15,17-20\"\nPrint expandRange(s)\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"strconv\"\n \"strings\"\n)\n\nconst input = \"-6,-3--1,3-5,7-11,14,15,17-20\"\n\nfunc main() {\n fmt.Println(\"range:\", input)\n var r []int\n var last int\n for _, part := range strings.Split(input, \",\") {\n if i := strings.Index(part[1:], \"-\"); i == -1 {\n n, err := strconv.Atoi(part)\n if err != nil {\n fmt.Println(err)\n return\n }\n if len(r) > 0 {\n if last == n {\n fmt.Println(\"duplicate value:\", n)\n return\n } else if last > n {\n fmt.Println(\"values not ordered:\", last, \">\", n)\n return\n }\n }\n r = append(r, n)\n last = n\n } else {\n n1, err := strconv.Atoi(part[:i+1])\n if err != nil {\n fmt.Println(err)\n return\n }\n n2, err := strconv.Atoi(part[i+2:])\n if err != nil {\n fmt.Println(err)\n return\n }\n if n2 < n1+2 {\n fmt.Println(\"invalid range:\", part)\n return\n }\n if len(r) > 0 {\n if last == n1 {\n fmt.Println(\"duplicate value:\", n1)\n return\n } else if last > n1 {\n fmt.Println(\"values not ordered:\", last, \">\", n1)\n return\n }\n }\n for i = n1; i <= n2; i++ {\n r = append(r, i)\n }\n last = n2\n }\n }\n fmt.Println(\"expanded:\", r)\n}\n","language":"Go"},{"code":"def expandRanges = { compressed ->\n Eval.me('['+compressed.replaceAll(~/(\\d)-/, '$1..')+']').flatten().toString()[1..-2]\n}\n","language":"Groovy"},{"code":"def s = '-6,-3--1,3-5,7-11,14,15,17-20'\nprintln (expandRanges(s))\n","language":"Groovy"},{"code":"> expandRange \"-6,-3--1,3-5,7-11,14,15,17-20\"\n[-6,-3,-2,-1,3,4,5,7,8,9,10,11,14,15,17,18,19,20]\n","language":"Haskell"},{"code":"expandRange :: String -> [Int]\nexpandRange = concatMap f . split ','\n where f str@(c : cs) | '-' `elem` cs = [read (c : a) .. read b]\n | otherwise = [read str]\n where (a, _ : b) = break (== '-') cs\n\nsplit :: Eq a => a -> [a] -> [[a]]\nsplit delim [] = []\nsplit delim l = a : split delim (dropWhile (== delim) b)\n where (a, b) = break (== delim) l\n","language":"Haskell"},{"code":"{-# LANGUAGE FlexibleContexts #-}\n\nimport Text.Parsec\n\nexpandRange :: String -> Maybe [Int]\nexpandRange =\n either\n (const Nothing)\n Just\n . parse rangeParser \"\"\n\nrangeParser ::\n (Enum a, Read a, Stream s m Char) =>\n ParsecT s u m [a]\nrangeParser = concat <$> (item `sepBy` char ',')\n where\n item = do\n n1 <- num\n n2 <- option n1 (char '-' *> num)\n return [n1 .. n2]\n num =\n read `dot` (<>) <$> option \"\" (string \"-\")\n <*> many1 digit\n dot = (.) . (.)\n\nmain :: IO ()\nmain = print $ expandRange \"-6,-3--1,3-5,7-11,14,15,17-20\"\n","language":"Haskell"},{"code":"procedure main()\ns := \"-6,-3--1,3-5,7-11,14,15,17-20\"\nwrite(\"Input string := \",s)\nwrite(\"Expanded list := \", list2string(range_expand(s)) | \"FAILED\")\nend\n\nprocedure range_expand(s) #: return list of integers extracted from an ordered string representation\nlocal R,low,high\nR := []\n\ns ? until pos(0) do {\n put(R,low := integer(tab(upto(',-')|0))| fail) # get lower bound\n if =\"-\" || (high := integer(tab(find(\",\")|0))|fail) then\n until low = high do put(R,low +:= 1) # find range\n =\",\"\n }\nreturn R\nend\n\nprocedure list2string(L) #: helper function to convert a list to a string\nlocal s\n\n every (s := \"[ \") ||:= !L || \" \"\n return s || \"]\"\nend\n","language":"Icon"},{"code":"require'strings'\nthru=: <. + i.@(+*)@-~\nnum=: _&\".\nnormaliz=: rplc&(',-';',_';'--';'-_')@,~&','\nsubranges=:<@(thru/)@(num;._2)@,&'-';._1\nrngexp=: ;@subranges@normaliz\n","language":"J"},{"code":" rngexp '-6,-3--1,3-5,7-11,14,15,17-20'\n_6 _3 _2 _1 3 4 5 7 8 9 10 11 14 15 17 18 19 20\n","language":"J"},{"code":"import java.util.*;\n\nclass RangeExpander implements Iterator<Integer>, Iterable<Integer> {\n\n private static final Pattern TOKEN_PATTERN = Pattern.compile(\"([+-]?\\\\d+)-([+-]?\\\\d+)\");\n\n private final Iterator<String> tokensIterator;\n\n private boolean inRange;\n private int upperRangeEndpoint;\n private int nextRangeValue;\n\n public RangeExpander(String range) {\n String[] tokens = range.split(\"\\\\s*,\\\\s*\");\n this.tokensIterator = Arrays.asList(tokens).iterator();\n }\n\n @Override\n public boolean hasNext() {\n return hasNextRangeValue() || this.tokensIterator.hasNext();\n }\n\n private boolean hasNextRangeValue() {\n return this.inRange && this.nextRangeValue <= this.upperRangeEndpoint;\n }\n\n @Override\n public Integer next() {\n if (!hasNext()) {\n throw new NoSuchElementException();\n }\n\n if (hasNextRangeValue()) {\n return this.nextRangeValue++;\n }\n\n String token = this.tokensIterator.next();\n\n Matcher matcher = TOKEN_PATTERN.matcher(token);\n if (matcher.find()) {\n this.inRange = true;\n this.upperRangeEndpoint = Integer.valueOf(matcher.group(2));\n this.nextRangeValue = Integer.valueOf(matcher.group(1));\n return this.nextRangeValue++;\n }\n\n this.inRange = false;\n return Integer.valueOf(token);\n }\n\n @Override\n public Iterator<Integer> iterator() {\n return this;\n }\n\n}\n\nclass RangeExpanderTest {\n public static void main(String[] args) {\n RangeExpander re = new RangeExpander(\"-6,-3--1,3-5,7-11,14,15,17-20\");\n for (int i : re) {\n System.out.print(i + \" \");\n }\n }\n}\n","language":"Java"},{"code":"#!/usr/bin/env js\n\nfunction main() {\n print(rangeExpand('-6,-3--1,3-5,7-11,14,15,17-20'));\n}\n\nfunction rangeExpand(rangeExpr) {\n\n function getFactors(term) {\n var matches = term.match(/(-?[0-9]+)-(-?[0-9]+)/);\n if (!matches) return {first:Number(term)};\n return {first:Number(matches[1]), last:Number(matches[2])};\n }\n\n function expandTerm(term) {\n var factors = getFactors(term);\n if (factors.length < 2) return [factors.first];\n var range = [];\n for (var n = factors.first; n <= factors.last; n++) {\n range.push(n);\n }\n return range;\n }\n\n var result = [];\n var terms = rangeExpr.split(/,/);\n for (var t in terms) {\n result = result.concat(expandTerm(terms[t]));\n }\n\n return result;\n}\n\nmain();\n","language":"JavaScript"},{"code":"(function (strTest) {\n 'use strict';\n\n // s -> [n]\n function expansion(strExpr) {\n\n // concat map yields flattened output list\n return [].concat.apply([], strExpr.split(',')\n .map(function (x) {\n return x.split('-')\n .reduce(function (a, s, i, l) {\n\n // negative (after item 0) if preceded by an empty string\n // (i.e. a hyphen-split artefact, otherwise ignored)\n return s.length ? i ? a.concat(\n parseInt(l[i - 1].length ? s :\n '-' + s, 10)\n ) : [+s] : a;\n }, []);\n\n // two-number lists are interpreted as ranges\n })\n .map(function (r) {\n return r.length > 1 ? range.apply(null, r) : r;\n }));\n }\n\n\n // [m..n]\n function range(m, n) {\n return Array.apply(null, Array(n - m + 1))\n .map(function (x, i) {\n return m + i;\n });\n }\n\n return expansion(strTest);\n\n})('-6,-3--1,3-5,7-11,14,15,17-20');\n","language":"JavaScript"},{"code":"[-6, -3, -2, -1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]\n","language":"JavaScript"},{"code":"(() => {\n \"use strict\";\n\n // ----------------- RANGE EXPANSION -----------------\n\n // rangeExpansion :: String -> [Int]\n const rangeExpansion = rangeString =>\n // A list of integers parsed from a\n // comma-delimited string which may include\n // (rising) hyphenated ranges.\n rangeString.split(\",\")\n .flatMap(x => {\n const ns = x.split(\"-\")\n .reduce((a, s, i, xs) =>\n Boolean(s) ? (\n 0 < i ? a.concat(\n parseInt(\n xs[i - 1].length ? (\n s\n ) : `-${s}`,\n 10\n )\n ) : [Number(s)]\n ) : a,\n []\n );\n\n return 2 === ns.length ? (\n uncurry(enumFromTo)(ns)\n ) : ns;\n });\n\n\n // ---------------------- TEST -----------------------\n // main :: IO ()\n const main = () =>\n rangeExpansion(\"-6,-3--1,3-5,7-11,14,15,17-20\");\n\n\n // --------------------- GENERIC ---------------------\n\n // enumFromTo :: Int -> Int -> [Int]\n const enumFromTo = m =>\n n => Array.from({\n length: 1 + n - m\n }, (_, i) => m + i);\n\n\n // uncurry :: (a -> b -> c) -> ((a, b) -> c)\n const uncurry = f =>\n // A function over a pair, derived\n // from a curried function.\n (...args) => {\n const [x, y] = Boolean(args.length % 2) ? (\n args[0]\n ) : args;\n\n return f(x)(y);\n };\n\n\n // MAIN ---\n return JSON.stringify(main());\n})();\n","language":"JavaScript"},{"code":"def expand_range:\n def number: \"-?[0-9]+\";\n def expand: [range(.[0]; .[1] + 1)];\n\n split(\",\")\n | reduce .[] as $r\n ( []; . +\n ($r | if test(\"^\\(number)$\") then [tonumber]\n else sub( \"(?<x>\\(number))-(?<y>\\(number))\"; \"\\(.x):\\(.y)\")\n | split(\":\") | map(tonumber) | expand\n\t end));\n","language":"Jq"},{"code":"\"-6,-3--1,3-5,7-11,14,15,17-20\" | expand_range\n","language":"Jq"},{"code":"#!/usr/bin/env jsish\n\"use strict\";\n\n/* Range expansion, in Jsish */\nfunction rangeExpand(rangeExpr) {\n\n function getFactors(term) {\n var matches = term.match(/(-?[0-9]+)-(-?[0-9]+)/);\n if (!matches) return {first:Number(term)};\n return {first:Number(matches[1]), last:Number(matches[2])};\n }\n\n function expandTerm(term) {\n var factors = getFactors(term);\n if (factors.length < 2) return [factors.first];\n var range = [];\n for (var n = factors.first; n <= factors.last; n++) {\n range.push(n);\n }\n return range;\n }\n\n var result = [];\n var terms = rangeExpr.split(\",\");\n for (var t in terms) {\n result = result.concat(expandTerm(terms[t]));\n }\n\n return result;\n}\n\nif (Interp.conf('unitTest')) {\n; rangeExpand('-6,-3--1,3-5,7-11,14,15,17-20');\n}\n\n/*\n=!EXPECTSTART!=\nrangeExpand('-6,-3--1,3-5,7-11,14,15,17-20') ==> [ -6, -3, -2, -1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20 ]\n=!EXPECTEND!=\n*/\n","language":"Jsish"},{"code":"slurp(s) = readcsv(IOBuffer(s))\n\nconv(s)= colon(map(x->parse(Int,x),match(r\"^(-?\\d+)-(-?\\d+)$\", s).captures)...)\n\nexpand(s) = mapreduce(x -> isa(x,Number)? Int(x) : conv(x), vcat, slurp(s))\n","language":"Julia"},{"code":"grp : {1_'(&x=*x)_ x:\",\",x}\npos : {:[3=l:#p:&\"-\"=x;0,p@1;2=l;p;0=*p;,0;0,p]}\nconv: 0${(x;1_ y)}/'{(pos x)_ x}'\nexpd: {,/@[x;&2=#:'x;{(*x)+!1+,/-':x}]}\nrnge: {expd@conv grp x}\n","language":"K"},{"code":" rnge \"-6,-3--1,3-5,7-11,14,15,17-20\"\n-6 -3 -2 -1 3 4 5 7 8 9 10 11 14 15 17 18 19 20\n","language":"K"},{"code":"// version 1.0.6\n\nfun expandRange(s: String): MutableList<Int> {\n val list = mutableListOf<Int>()\n val items = s.split(',')\n var first: Int\n var last: Int\n for (item in items) {\n val count = item.count { it == '-' }\n if (count == 0 || (count == 1 && item[0] == '-'))\n list.add(item.toInt())\n else {\n val items2 = item.split('-')\n if (count == 1) {\n first = items2[0].toInt()\n last = items2[1].toInt()\n }\n else if (count == 2) {\n first = items2[1].toInt() * -1\n last = items2[2].toInt()\n }\n else {\n first = items2[1].toInt() * -1\n last = items2[3].toInt() * -1\n }\n for (i in first..last) list.add(i)\n }\n }\n return list\n}\n\nfun main(args: Array<String>) {\n val s = \"-6,-3--1,3-5,7-11,14,15,17-20\"\n println(expandRange(s))\n}\n","language":"Kotlin"},{"code":"define range_expand(expression::string) => {\n local(parts) = regexp(`^(-?\\d+)-(-?\\d+)$`)\n\n return (\n with elm in #expression->split(`,`)\n let isRange = #parts->setInput(#elm)&matches\n select #isRange\n ? (integer(#parts->matchString(1)) to integer(#parts->matchString(2)))->asString\n | integer(#elm)->asString\n )->join(', ')\n}\n\nrange_expand(`-6,-3--1,3-5,7-11,14,15,17-20`)\n","language":"Lasso"},{"code":"print ExpandRange$( \"-6,-3--1,3-5,7-11,14,15,17-20\")\nend\n\nfunction ExpandRange$( compressed$)\n for i = 1 to ItemCount( compressed$, \",\")\n item$ = word$( compressed$, i, \",\")\n dash = instr( item$, \"-\", 2) 'dash that is not the first character, is a separator\n if dash then\n for k = val( left$( item$, dash - 1)) to val( mid$( item$, dash + 1))\n ExpandRange$ = ExpandRange$ + str$( k) + \",\"\n next k\n else\n ExpandRange$ = ExpandRange$ + item$ + \",\"\n end if\n next i\n ExpandRange$ = left$( ExpandRange$, len( ExpandRange$) - 1)\nend function\n\nfunction ItemCount( list$, separator$)\n while word$(list$, ItemCount + 1, separator$) <> \"\"\n ItemCount = ItemCount + 1\n wend\nend function\n","language":"Liberty-BASIC"},{"code":"-- Note: currently does not support extra white space in input string\non expandRange (str)\n res = \"\"\n _player.itemDelimiter = \",\"\n cnt = str.item.count\n repeat with i = 1 to cnt\n part = str.item[i]\n pos = offset(\"-\", part.char[2..part.length])\n if pos>0 then\n a = integer(part.char[1..pos])\n b = integer(part.char[pos+2..part.length])\n repeat with j = a to b\n put j&\",\" after res\n end repeat\n else\n put part&\",\" after res\n end if\n end repeat\n delete the last char of res\n return res\nend\n","language":"Lingo"},{"code":"put expandRange(\"-6,-3--1,3-5,7-11,14,15,17-20\")\n-- \"-6,-3,-2,-1,3,4,5,7,8,9,10,11,14,15,17,18,19,20\"\n","language":"Lingo"},{"code":"function range beginning ending stepping\n local tRange, tBegin, tEnd, tstep\n if stepping is empty or stepping is 0 then\n put 1 into tstep\n else\n put abs(stepping) into tstep\n end if\n\n if ending is empty or isNumber(ending) is not true then\n put 0 into tEnd\n else\n put ending into tEnd\n end if\n\n if beginning is empty or isNumber(beginning) is not true then\n put 0 into tBegin\n else\n put beginning into tBegin\n end if\n\n repeat with r = tBegin to tEnd step tstep\n put space & r after tRange\n end repeat\n return word 1 to -1 of tRange\nend range\n\nfunction expandRange rangeExpr\n put rangeExpr into tRange\n split tRange by comma\n repeat with n = 1 to the number of elements of tRange\n if matchText(tRange[n],\"^(\\-*\\d+)\\-(\\-*\\d+)\",beginning, ending) then\n put range(beginning, ending, 1) & space after z\n else\n put tRange[n] & space after z\n end if\n end repeat\n return z\nend expandRange\n","language":"LiveCode"},{"code":"expandRange(\"-6,-3--1,3-5,7-11,14,15,17-20\")\n-6 -3 -2 -1 3 4 5 7 8 9 10 11 14 15 17 18 19 20\n","language":"LiveCode"},{"code":"function range(i, j)\n local t = {}\n for n = i, j, i<j and 1 or -1 do\n t[#t+1] = n\n end\n return t\nend\n\nfunction expand_ranges(rspec)\n local ptn = \"([-+]?%d+)%s?-%s?([-+]?%d+)\"\n local t = {}\n\n for v in string.gmatch(rspec, '[^,]+') do\n local s, e = v:match(ptn)\n\n if s == nil then\n t[#t+1] = tonumber(v)\n else\n for i, n in ipairs(range(tonumber(s), tonumber(e))) do\n t[#t+1] = n\n end\n end\n end\n return t\nend\n\nlocal ranges = \"-6,-3--1,3-5,7-11,14,15,17-20\"\nprint(table.concat(expand_ranges(ranges), ', '))\n","language":"Lua"},{"code":"ExpandRanges := proc( s :: string )\n uses StringTools;\n local DoOne := proc( input )\n uses StringTools;\n local lo, hi, pos;\n if IsDigit( input ) or input[ 1 ] = \"-\"\n and IsDigit( input[ 2 .. -1 ] ) then\n parse( input )\n else\n pos := Search( \"--\", input );\n if pos > 0 then\n lo := input[ 1 .. pos - 1 ];\n hi := input[ 1 + pos .. -1 ];\n elif input[ 1 ] = \"-\" then\n pos := FirstFromLeft( \"-\", input[ 2 .. -1 ] );\n if pos = 0 then\n lo := input;\n hi := lo\n else\n lo := input[ 1 .. pos ];\n hi := input[ 2 + pos .. -1 ];\n end if;\n else\n pos := FirstFromLeft( \"-\", input );\n if pos = 0 then\n error \"incorrect syntax\"\n end if;\n lo := input[ 1 .. pos - 1 ];\n hi := input[ 1 + pos .. -1 ];\n end if;\n lo := parse( lo );\n hi := parse( hi );\n seq( lo .. hi )\n end if\n end proc:\n map( DoOne, map( Trim, Split( s, \",\" ) ) )\nend proc:\n","language":"Maple"},{"code":"> rng := \"-6,-3--1,3-5,7-11,14,15,17-20\":\n> ExpandRanges( rng );\n [-6, -3, -2, -1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]\n","language":"Maple"},{"code":"> rng := \"-6,-3-1,3-5,7-11,14,15,17-20\":\n> ExpandRanges( rng );\n[-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]\n","language":"Maple"},{"code":"rangeexpand[ rng_ ] := Module[ { step1 },\nstep1 = StringSplit[StringReplacePart[rng,\"S\",StringPosition[ rng,DigitCharacter~~\"-\"] /. {x_,y_} -> {y,y}],\",\"];\nFlatten@ToExpression/@Quiet@StringReplace[step1,x__~~\"S\"~~y__->\"Range[\"<>x<>\",\"<>y<>\"]\"] ]\n","language":"Mathematica"},{"code":"function L=range_expansion(S)\n% Range expansion\nif nargin < 1;\n\tS='[]';\nend\n\nif ~all(isdigit(S) | (S=='-') | (S==',') | isspace(S))\n\terror 'invalid input';\nend\nixr = find(isdigit(S(1:end-1)) & S(2:end) == '-')+1;\nS(ixr)=':';\nS=['[',S,']'];\nL=eval(S);\n","language":"MATLAB"},{"code":"pullInt = function(chars)\n numstr = chars.pull\n while chars and chars[0] != \",\" and chars[0] != \"-\"\n numstr = numstr + chars.pull\n end while\n return val(numstr)\nend function\n\nexpandRange = function(s)\n result = []\n chars = s.split(\"\")\n while chars\n num = pullInt(chars)\n if not chars or chars.pull == \",\" then\n result.push num\n else\n result = result + range(num, pullInt(chars))\n chars.pull // skip \",\" after range\n end if\n end while\n return result\nend function\n\nprint expandRange(\"-6,-3--1,3-5,7-11,14,15,17-20\")\n","language":"MiniScript"},{"code":"RANGEXP(X) ;Integer range expansion\n NEW Y,I,J,X1,H SET Y=\"\"\n FOR I=1:1:$LENGTH(X,\",\") DO\n .S X1=$PIECE(X,\",\",I) FOR Q:$EXTRACT(X1)'=\" \" S X1=$EXTRACT(X1,2,$LENGTH(X1)) ;clean up leading spaces\n .SET H=$FIND(X1,\"-\")-1\n .IF H=1 SET H=$FIND(X1,\"-\",(H+1))-1 ;If the first value is negative ignore that \"-\"\n .IF H<0 SET Y=$SELECT($LENGTH(Y)=0:Y_X1,1:Y_\",\"_X1)\n .IF '(H<0) FOR J=+$EXTRACT(X1,1,(H-1)):1:+$EXTRACT(X1,(H+1),$LENGTH(X1)) SET Y=$SELECT($LENGTH(Y)=0:J,1:Y_\",\"_J)\n KILL I,J,X1,H\n QUIT Y\n","language":"MUMPS"},{"code":"/*NetRexx program to expand a range of integers into a list. *************\n* 09.08.2012 Walter Pachl derived from my Rexx version\n* Changes: translate(old,' ',',') -> old.translate(' ',',')\n* dashpos=pos('-',x,2) -> dashpos=x.pos('-',2)\n* Do -> Loop\n* Parse Var a x a -> Parse a x a\n* Parse Var x ... -> Parse x ...\n**********************************************************************/\n\nparse arg old\nif old = '' then\n old='-6,-3--1,3-5,7-11,14,15,17-20' /*original list of nums/ranges */\n\n Say 'old='old /*show old list of nums/ranges. */\n a=old.translate(' ',',') /*translate commas to blanks */\n new='' /*new list of numbers (so far). */\n\n comma=''\n Loop While a<>'' /* as long as there is input */\n Parse a x a /* get one element */\n dashpos=x.pos('-',2) /* find position of dash, if any */\n If dashpos>0 Then Do /* element is low-high */\n Parse x low =(dashpos) +1 high /* split the element */\n Loop j=low To high /* output all numbers in range */\n new=new||comma||j /* with separating commas */\n comma=',' /* from now on use comma */\n End\n End\n Else Do /* element is a number */\n new=new||comma||x /* append (with comma) */\n comma=',' /* from now on use comma */\n End\n End\n Say 'new='new /*show the expanded list */\n","language":"NetRexx"},{"code":"import parseutils, strutils\n\nproc expandRange(input: string): string =\n var output: seq[string]\n for range in input.split(','):\n var sep = range.find('-', 1)\n if sep > 0: # parse range\n var first = -1\n if range.substr(0, sep-1).parseInt(first) == 0:\n break\n var last = -1\n if range.substr(sep+1).parseInt(last) == 0:\n break\n for i in first..last:\n output.add($i)\n else: # parse single number\n var n = -1\n if range.parseInt(n) > 0:\n output.add($n)\n else:\n break\n return output.join(\",\")\n\necho(\"-6,-3--1,3-5,7-11,14,15,17-20\".expandRange)\n","language":"Nim"},{"code":"MODULE LIVector;\nIMPORT SYSTEM;\nTYPE\n\tLIPool = POINTER TO ARRAY OF LONGINT;\n\tLIVector*= POINTER TO LIVectorDesc;\n\tLIVectorDesc = RECORD\n\t\tcap-: INTEGER;\n\t\tlen-: INTEGER;\n\t\tLIPool: LIPool;\n\tEND;\n\t\n\tPROCEDURE (v: LIVector) Init*(cap: INTEGER);\n\tBEGIN\n\t\tv.cap := cap;\n\t\tv.len := 0;\n\t\tNEW(v.LIPool,cap);\n\tEND Init;\n\t\n\tPROCEDURE (v: LIVector) Add*(x: LONGINT);\n\tVAR\n\t\tnewLIPool: LIPool;\n\tBEGIN\n\t\tIF v.len = LEN(v.LIPool^) THEN\n\t\t\t(* run out of space *)\n\t\t\tv.cap := v.cap + (v.cap DIV 2);\n\t\t\tNEW(newLIPool,v.cap);\n\t\t\tSYSTEM.MOVE(SYSTEM.ADR(v.LIPool^),SYSTEM.ADR(newLIPool^),v.cap * SIZE(LONGINT));\n\t\t\tv.LIPool := newLIPool\n\t\tEND;\n\t\tv.LIPool[v.len] := x;\n\t\tINC(v.len)\n\tEND Add;\n\t\n\tPROCEDURE (v: LIVector) At*(idx: INTEGER): LONGINT;\n\tBEGIN\n\t\tRETURN v.LIPool[idx];\n\tEND At;\nEND LIVector.\n\nMODULE LIRange;\nIMPORT Out, LIV := LIVector;\n\nTYPE\n\tRange* = POINTER TO RangeDesc;\n\tRangeDesc = RECORD\n\t\tl,r: POINTER TO ARRAY 1 OF LONGINT;\n\tEND;\n\t\n\tPROCEDURE (r: Range) Init*();\n\tBEGIN\n\t\tr.l := NIL;\n\t\tr.r := NIL;\n\tEND Init;\n\t\n\tPROCEDURE (r: Range) IsEmpty*(): BOOLEAN;\n\tBEGIN\n\t\tRETURN (r.l = NIL) & (r.l = NIL);\n\tEND IsEmpty;\n\t\n\tPROCEDURE (r: Range) SetLeft*(v: LONGINT);\n\tBEGIN\n\t\tIF r.l = NIL THEN NEW(r.l) END;\n\t\tr.l[0] := v;\n\tEND SetLeft;\n\t\n\tPROCEDURE (r: Range) SetRight*(v : LONGINT);\n\tBEGIN\n\t\tIF r.r = NIL THEN NEW(r.r) END;\n\t\tr.r[0] := v;\n\tEND SetRight;\n\t\n\tPROCEDURE (r: Range) LeftPart*(): BOOLEAN;\n\tBEGIN\n\t\tRETURN r.l # NIL;\n\tEND LeftPart;\n\t\n\tPROCEDURE (r: Range) GetLeft(): LONGINT;\n\tBEGIN\n\t\tRETURN r.l[0];\n\tEND\tGetLeft;\n\t\n\tPROCEDURE (r: Range) RightPart*(): BOOLEAN;\n\tBEGIN\n\t\tRETURN r.l # NIL;\n\tEND RightPart;\n\t\n\tPROCEDURE (r: Range) GetRight*(): LONGINT;\n\tBEGIN\n\t\tRETURN r.r[0];\n\tEND\tGetRight;\n\t\n\tPROCEDURE (r: Range) Show*();\n\tBEGIN\n\t\tOut.Char('(');\n\t\tIF r.l # NIL THEN Out.LongInt(r.l[0],10) END;\n\t\tOut.String(\" - \");\n\t\tIF r.r # NIL THEN Out.LongInt(r.r[0],10); END;\n\t\tOut.Char(')');Out.Ln\n\tEND Show;\n\t\n\tPROCEDURE (r: Range) Expand*(VAR liv: LIV.LIVector);\n\tVAR\n\t\tfrom, to : LONGINT;\n\tBEGIN\n\t\tIF r.l # NIL THEN from := r.l[0] ELSE from := 0 END;\n\t\tIF r.r # NIL THEN to := r.r[0] ELSE to := from END;\n\t\tWHILE (from <= to) DO\n\t\t\tliv.Add(from);INC(from)\n\t\tEND\n\tEND Expand;\nEND LIRange.\n\nMODULE Splitter;\nTYPE\n\tSplitter* = POINTER TO SplitterDesc;\n\tSplitterDesc = RECORD\n\t\tfrom: INTEGER;\n\t\tc: CHAR;\n\t\ts: POINTER TO ARRAY OF CHAR;\n\tEND;\n\t\n\tPROCEDURE (s: Splitter) Init*;\n\tBEGIN\n\t\ts.c := ',';\n\t\ts.from := 0;\n\t\ts.s := NIL;\n\tEND Init;\n\t\n\tPROCEDURE (s: Splitter) On*(str: ARRAY OF CHAR);\n\tBEGIN\n\t\ts.from := 0;\n\t\tNEW(s.s,LEN(str));\n\t\tCOPY(str,s.s^)\n\tEND On;\n\t\n\tPROCEDURE (s: Splitter) OnWithChar*(str: ARRAY OF CHAR;c: CHAR);\n\tBEGIN\n\t\ts.from := 0;\n\t\ts.c := c;\n\t\tNEW(s.s,LEN(str));\n\t\tCOPY(str,s.s^)\n\tEND OnWithChar;\n\t\n\tPROCEDURE (s: Splitter) Next*(VAR str: ARRAY OF CHAR);\n\tVAR\n\t\tk : INTEGER;\t\n\tBEGIN\n\t\tk := 0;\n\t\tIF (s.from < LEN(s.s^) - 1) & (s.s[s.from] = 0X) THEN str[0] := 0X END;\n\t\tWHILE (k < LEN(str) - 1) & (s.from < LEN(s.s^) - 1) & (s.s[s.from] # s.c) DO\n\t\t\tstr[k] := s.s[s.from];\n\t\t\tINC(k);INC(s.from)\n\t\tEND;\n\t\tIF k < LEN(str) - 1 THEN str[k] := 0X ELSE str[LEN(str) - 1] := 0X END;\n\t\tWHILE (s.from < LEN(s.s^) - 1) & (s.s[s.from] # s.c) DO INC(s.from) END;\n\t\tINC(s.from)\n\tEND Next;\nEND Splitter.\n\nMODULE ExpandRange;\nIMPORT Out, LIV := LIVector, LIR := LIRange, S := Splitter;\n\nPROCEDURE GetNumberFrom(s: ARRAY OF CHAR; VAR from: INTEGER; VAR done: BOOLEAN): LONGINT;\nVAR\n\td,i: INTEGER;\n\tnum,sign: LONGINT;\nBEGIN\n\ti := from; num := 0;sign := 1;\n\tCASE s[i] OF\n\t\t '-': sign := -1;INC(i)\n\t\t|'+': INC(i);\n\t\tELSE\n\tEND;\n\tWHILE (i < LEN(s) - 1) & (s[i] >= '0') & (s[i] <= '9') DO\n\t\td := ORD(s[i]) - ORD('0');\n\t\tnum := d + num * 10;\n\t\tINC(i);\n\tEND;\n\tIF i = from THEN done := FALSE ELSE done := TRUE; from := i END;\n\tRETURN sign * num\nEND GetNumberFrom;\n\nPROCEDURE GetRange(s: ARRAY OF CHAR): LIR.Range;\nVAR\n\tr: LIR.Range;\n\ti: INTEGER;\n\tnum: LONGINT;\n\tdone: BOOLEAN;\nBEGIN\n\ti := 0;NEW(r);r.Init();\n\tWHILE (i < LEN(s) - 1) & (s[i] = 20X) DO INC(i) END;\n\t(* Left value *)\n\tdone := FALSE;\n\tnum := GetNumberFrom(s,i,done);\n\tIF ~done THEN RETURN r END;\n\tr.SetLeft(num);\n\n\tWHILE (i < LEN(s) - 1) & (s[i] = 20X) DO INC(i) END;\n\tCASE s[i] OF\n\t\t '-' : INC(i);\n\t\t| 0X : RETURN r;\n\t\tELSE\n\tEND;\n\tWHILE (i < LEN(s) - 1) & (s[i] = 20X) DO INC(i) END;\n\t\n\t(* Right Value *)\n\tdone := FALSE;\n\tnum := GetNumberFrom(s,i,done);\n\tIF ~done THEN RETURN r END;\n\tr.SetRight(num);\n\tRETURN r;\nEND GetRange;\n\nVAR\n\ti: INTEGER;\n\tr: LIR.Range;\n\tsp: S.Splitter;\n\tp : ARRAY 128 OF CHAR;\n\tliv: LIV.LIVector;\nBEGIN\n\tNEW(sp);sp.Init();\n\tNEW(liv);liv.Init(128);\n\n\tsp.On(\"-6,-3--1,3-5,7-11,14,15,17-20\");\n\tsp.Next(p);\n\tWHILE (p[0] # 0X) DO\n\t\tr := GetRange(p);\n\t\tr.Expand(liv);\n\t\tsp.Next(p);\n\tEND;\n\tFOR i := 0 TO liv.len - 2 DO\n\t\tOut.LongInt(liv.At(i),3);Out.Char(',');\n\tEND;\n\tOut.LongInt(liv.At(liv.len - 1),3);Out.Ln;\nEND ExpandRange.\n","language":"Oberon"},{"code":"#load \"str.cma\"\n\nlet range a b =\n if b < a then invalid_arg \"range\";\n let rec aux i acc =\n if i = b then List.rev (i::acc)\n else aux (succ i) (i::acc)\n in\n aux a []\n\nlet parse_piece s =\n try Scanf.sscanf s \"%d-%d\" (fun a b -> range a b)\n with _ -> [int_of_string s]\n\nlet range_expand rng =\n let ps = Str.split (Str.regexp_string \",\") rng in\n List.flatten (List.map parse_piece ps)\n\nlet () =\n let rng = \"-6,-3--1,3-5,7-11,14,15,17-20\" in\n let exp = range_expand rng in\n List.iter (Printf.printf \" %d\") exp;\n print_newline ()\n","language":"OCaml"},{"code":": addRange( s res -- )\n| i n |\n s asInteger dup ifNotNull: [ res add return ] drop\n s indexOfFrom('-', 2) ->i\n s left( i 1- ) asInteger s right( s size i - ) asInteger\n for: n [ n res add ]\n;\n\n: rangeExpand ( s -- [ n ] )\n ArrayBuffer new s wordsWith( ',' ) apply( #[ over addRange ] ) ;\n","language":"Oforth"},{"code":"list = '-6,-3--1,3-5,7-11,14,15,17-20'\nexpanded = expandRanges(list)\n\nsay \"Original list: [\"list\"]\"\nsay \"Expanded list: [\"expanded~tostring(\"l\", \",\")\"]\"\n\n-- expand a string expression a range of numbers into a list\n-- of values for the range. This returns an array\n::routine expandRanges\n use strict arg list\n values = list~makearray(',')\n -- build this up using an array first. Make this at least the\n -- size of the original value set.\n expanded = .array~new(values~items)\n\n -- now process each element in the range\n loop element over values\n -- if this is a valid number, it's not a range, so add it directly\n if element~datatype('whole') then expanded~append(element)\n else do\n -- search for the divider, starting from the second position\n -- to allow for the starting value to be a minus sign.\n split = element~pos('-', 2)\n parse var element start =(split) +1 finish\n loop i = start to finish\n expanded~append(i)\n end\n end\n end\n return expanded\n","language":"OoRexx"},{"code":"declare\n fun {Expand RangeDesc}\n {Flatten\n {Map {ParseDesc RangeDesc}\n ExpandRange}}\n end\n\n fun {ParseDesc Txt}\n {Map {String.tokens Txt &,} ParseRange}\n end\n\n fun {ParseRange R}\n if {Member &- R.2} then\n First Second\n in\n {String.token R.2 &- ?First ?Second}\n {String.toInt R.1|First}#{String.toInt Second}\n else\n Singleton = {String.toInt R}\n in\n Singleton#Singleton\n end\n end\n\n fun {ExpandRange From#To}\n {List.number From To 1}\n end\nin\n {System.showInfo\n {Value.toVirtualString {Expand \"-6,-3--1,3-5,7-11,14,15,17-20\"} 100 100}}\n","language":"Oz"},{"code":"[~6 ~3 ~2 ~1 3 4 5 7 8 9 10 11 14 15 17 18 19 20]\n","language":"Oz"},{"code":"sub rangex {\n map { /^(.*\\d)-(.+)$/ ? $1..$2 : $_ } split /,/, shift\n}\n\n# Test and display\nprint join(',', rangex('-6,-3--1,3-5,7-11,14,15,17-20')), \"\\n\";\n","language":"Perl"},{"code":"sub rangex {\n (my $range = shift) =~ s/(?<=\\d)-/../g;\n eval $range;\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">range_expansion</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">range</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">range</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">','</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">si</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">'-'</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">si</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">to_number</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">si</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">startrange</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">to_number</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">si</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]),</span>\n <span style=\"color: #000000;\">endofrange</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">to_number</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">si</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..$])</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">startrange</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">endofrange</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">range_expansion</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"-6,-3-1,3-5,7-11,14,15,17-20\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">range_expansion</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"-6,-3--1,3-5,7-11,14,15,17-20\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"0 tolist var r\n\ndef append\n r swap 0 put var r\nenddef\n\n\"-6,-3--1,3-5,7-11,14,15,17-20\" \",\" \" \" subst split\n\nlen for\n get dup tonum dup\n nan == if\n drop\n dup len 1 - 2 swap slice\n \"-\" find dup 2 + rot drop\n rot rot 1 swap slice tonum\n rot rot len rot swap over - 1 + slice tonum\n nip rot drop\n 2 tolist for append endfor\n else\n append drop\n endif\nendfor\nr\npstack\n","language":"Phixmonti"},{"code":"0 tolist var r\n\ndef append\n r swap 0 put var r\nenddef\n\n\"-6,-3--1,3-5,7-11,14,15,17-20\" \",\" \" \" subst split\n\nlen for\n get dup tonum dup\n nan == if\n drop\n dup 32 1 set\n \"-\" find nip\n swap over 1 - 1 swap slice tonum\n rot rot len rot swap over - swap 1 + swap slice tonum\n nip 2 tolist for append endfor\n else\n append drop\n endif\nendfor\nr\npstack\n","language":"Phixmonti"},{"code":"0 tolist var r\n\ndef append\n r swap 0 put var r\nenddef\n\ndef getSeparator /# s -- s n #/\n dup 32 1 set\n \"-\" find nip\nenddef\n\ndef first /# s n -- s n #/\n swap over 1 - 1\n swap slice tonum\nenddef\n\ndef last /# s n -- s n #/\n swap len rot swap over - swap 1 +\n swap slice tonum\nenddef\n\n\"-6,-3--1,3-5,7-11,14,15,17-20\" \",\" \" \" subst split\n\nlen for\n get dup tonum dup\n nan == if\n drop\n getSeparator\n first\n rot rot swap\n last\n nip 2 tolist for append endfor\n else\n append drop\n endif\nendfor\nr\npstack\n","language":"Phixmonti"},{"code":"function rangex($str) {\n $lst = array();\n foreach (explode(',', $str) as $e) {\n if (strpos($e, '-', 1) !== FALSE) {\n list($a, $b) = explode('-', substr($e, 1), 2);\n $lst = array_merge($lst, range($e[0] . $a, $b));\n } else {\n $lst[] = (int) $e;\n }\n }\n return $lst;\n}\n","language":"PHP"},{"code":"(de rangeexpand (Str)\n (make\n (for S (split (chop Str) \",\")\n (if (index \"-\" (cdr S))\n (chain\n (range\n (format (head @ S))\n (format (tail (- -1 @) S)) ) )\n (link (format S)) ) ) ) )\n","language":"PicoLisp"},{"code":"range_expansion:\n procedure options (main);\n\nget_number:\n procedure (Number, c, eof);\n declare number fixed binary (31), c character (1), eof bit (1) aligned;\n declare neg fixed binary (1);\n\n number = 0; eof = false;\n do until (c ^= ' ');\n get edit (c) (a(1));\n end;\n if c = '-' then do; get edit (c) (a(1)); neg = -1; end; else neg = 1;\n do forever;\n select (c);\n when ('0', '1', '2', '3', '4', '5', '6', '7', '8', '9')\n number = number*10 + c;\n when (',', '-') do; number = neg*number; return; end;\n otherwise signal error;\n end;\n on endfile (sysin) go to exit;\n get edit (c) (a(1));\n end;\nexit:\n number = neg*number;\n eof = true;\nend get_Number;\n\n declare c character, (i, range_start, range_end) fixed binary (31);\n declare eof bit (1) aligned;\n declare true bit (1) value ('1'b), false bit (1) value ('0'b);\n declare delimiter character (1) initial (' ');\n declare out file output;\n\n open file (out) output title ('/out, type(text),recsize(80)');\n do while (^eof);\n call get_number(range_start, c, eof);\n if c = '-' then /* we have a range */\n do;\n call get_number (range_end, c, eof);\n do i = range_start to range_end;\n put file (out) edit (delimiter, i) (a, f(3));\n end;\n end;\n else\n do;\n put file (out) edit (delimiter, range_start) (a, f(3));\n end;\n delimiter = ',';\n end;\nend range_expansion;\n","language":"PL-I"},{"code":"function range-expansion($array) {\n function expansion($arr) {\n if($arr) {\n $arr = $arr.Split(',')\n $arr | foreach{\n $a = $_\n $b, $c, $d, $e = $a.Split('-')\n switch($a) {\n $b {return $a}\n \"-$c\" {return $a}\n \"$b-$c\" {return \"$(([Int]$b)..([Int]$c))\"}\n \"-$c-$d\" {return \"$(([Int]$(\"-$c\"))..([Int]$d))\"}\n \"-$c--$e\" {return \"$(([Int]$(\"-$c\"))..([Int]$(\"-$e\")))\"}\n }\n }\n } else {\"\"}\n }\n $OFS = \", \"\n \"$(expansion $array)\"\n $OFS = \" \"\n}\nrange-expansion \"-6,-3--1,3-5,7-11,14,15,17-20\"\n","language":"PowerShell"},{"code":"function Expand-Range\n{\n [CmdletBinding()]\n [OutputType([int])]\n Param\n (\n [Parameter(Mandatory=$true,\n Position=0)]\n [ValidateNotNullOrEmpty()]\n [ValidatePattern('^[0-9,-]*$')]\n [string]\n $Range\n )\n\n try\n {\n if ($Range -match '-,') # I'm not good enough to weed this case out with Regex\n {\n throw \"Input string was not in a correct format.\"\n }\n\n [int[]]$output = $Range -split ',' | ForEach-Object {\n\n [int[]]$array = $_ -split '(?<=\\d)-'\n\n if ($array.Count -gt 1) # $array contains one or two elements\n {\n $array[0]..$array[1] # two elements = start and end of range\n }\n else\n {\n $array # one element = an integer\n }\n }\n }\n catch\n {\n throw \"Input string was not in a correct format.\"\n }\n\n $output\n}\n","language":"PowerShell"},{"code":"(Expand-Range \"-6,-3--1,3-5,7-11,14,15,17-20\") -join \", \"\n","language":"PowerShell"},{"code":"range_expand :-\n\tL = '-6,-3--1,3-5,7-11,14,15,17-20',\n\twriteln(L),\n\tatom_chars(L, LA),\n\textract_Range(LA, R),\n\tmaplist(study_Range, R, LR),\n\tpack_Range(LX, LR),\n\twriteln(LX).\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% extract_Range(?In, ?Out)\n% In : '-6,-3--1,3-5,7-11,14,15,17-20'\n% Out : [-6], [-3--1], [3-5],[7-11], [14],[15], [17-20]\n%\nextract_Range([], []).\n\nextract_Range(X , [Range | Y1]) :-\n\tget_Range(X, U-U, Range, X1),\n\textract_Range(X1, Y1).\n\nget_Range([], Range-[], Range, []).\nget_Range([','|B], Range-[], Range, B) :- !.\n\nget_Range([A | B], EC, Range, R) :-\n\tappend_dl(EC, [A | U]-U, NEC),\n\tget_Range(B, NEC, Range, R).\n\n\nappend_dl(X-Y, Y-Z, X-Z).\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%\n% study Range(?In, ?Out)\n% In : [-6]\n% Out : [-6,-6]\n%\n% In : [-3--1]\n% Out : [-3, -1]\n%\nstudy_Range(Range1, [Deb, Deb]) :-\n catch(number_chars(Deb, Range1), Deb, false).\n\nstudy_Range(Range1, [Deb, Fin]) :-\n append(A, ['-'|B], Range1),\n A \\= [],\n number_chars(Deb, A),\n number_chars(Fin, B).\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%\n:- use_module(library(clpfd)).\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%\n% Pack Range(?In, ?Out)\n% In : -6,\n% Out : [-6]\n%\n% In : -3, -2,-1\n% Out : [-3,-1]\n%\npack_Range([],[]).\n\npack_Range([X|Rest],[[X | V]|Packed]):-\n run(X,Rest, [X|V], RRest),\n pack_Range(RRest,Packed).\n\n\nrun(Fin,[Other|RRest], [Deb, Fin],[Other|RRest]):-\n\tFin #\\= Deb,\n\tFin #\\= Deb + 1,\n\tOther #\\= Fin+1.\n\nrun(Fin,[],[_Var, Fin],[]).\n\nrun(Var,[Var1|LRest],[Deb, Fin], RRest):-\n\tFin #\\= Deb,\n\tFin #\\= Deb + 1,\n\tVar1 #= Var + 1,\n\trun(Var1,LRest,[Deb, Fin], RRest).\n\nrun(Val,[Other|RRest], [Val, Val],[Other|RRest]).\n","language":"Prolog"},{"code":"Procedure rangeexpand(txt.s, List outputList())\n Protected rangesCount = CountString(txt, \",\") + 1\n Protected subTxt.s, r, rangeMarker, rangeStart, rangeFinish, rangeIncrement, i\n\n LastElement(outputList())\n For r = 1 To rangesCount\n subTxt = StringField(txt, r, \",\")\n rangeMarker = FindString(subTxt, \"-\", 2)\n If rangeMarker\n rangeStart = Val(Mid(subTxt, 1, rangeMarker - 1))\n rangeFinish = Val(Mid(subTxt, rangeMarker + 1))\n\n If rangeStart > rangeFinish\n rangeIncrement = -1\n Else\n rangeIncrement = 1\n EndIf\n\n i = rangeStart - rangeIncrement\n Repeat\n i + rangeIncrement\n AddElement(outputList()): outputList() = i\n Until i = rangeFinish\n Else\n AddElement(outputList()): outputList() = Val(subTxt)\n EndIf\n Next\nEndProcedure\n\nProcedure outputListValues(List values())\n Print(\"[ \")\n ForEach values()\n Print(Str(values()) + \" \")\n Next\n PrintN(\"]\")\nEndProcedure\n\nIf OpenConsole()\n NewList values()\n rangeexpand(\"-6,-3--1,3-5,7-11,14,15,17-20\", values())\n outputListValues(values())\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\")\n Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"def rangeexpand(txt):\n lst = []\n for r in txt.split(','):\n if '-' in r[1:]:\n r0, r1 = r[1:].split('-', 1)\n lst += range(int(r[0] + r0), int(r1) + 1)\n else:\n lst.append(int(r))\n return lst\n\nprint(rangeexpand('-6,-3--1,3-5,7-11,14,15,17-20'))\n","language":"Python"},{"code":"import re\n\ndef rangeexpand(txt):\n lst = []\n for rng in txt.split(','):\n start,end = re.match('^(-?\\d+)(?:-(-?\\d+))?$', rng).groups()\n if end:\n lst.extend(xrange(int(start),int(end)+1))\n else:\n lst.append(int(start))\n return lst\n","language":"Python"},{"code":"'''Range expansion'''\n\nfrom functools import (reduce)\n\n\n# ------------------- EXPANSION FUNCTION -------------------\n\n# rangeExpansion :: String -> [Int]\ndef rangeExpansion(s):\n '''List of integers expanded from a\n comma-delimited string of individual\n numbers and hyphenated ranges.\n '''\n def go(a, x):\n tpl = breakOn('-')(x[1:])\n r = tpl[1]\n return a + (\n [int(x)] if not r\n else enumFromTo(int(x[0] + tpl[0]))(\n int(r[1:])\n )\n )\n return reduce(go, s.split(','), [])\n\n\n# -------------------------- TEST --------------------------\ndef main():\n '''Expansion test'''\n\n print(\n fTable(__doc__ + ':')(\n lambda x: \"\\n'\" + str(x) + \"'\"\n )(lambda x: '\\n\\n\\t' + showList(x))(\n rangeExpansion\n )([\n '-6,-3--1,3-5,7-11,14,15,17-20'\n ])\n )\n\n\n# ------------------- GENERIC FUNCTIONS --------------------\n\n# breakOn :: String -> String -> (String, String)\ndef breakOn(needle):\n '''A tuple of:\n 1. the prefix of haystack before needle,\n 2. the remainder of haystack, starting\n with needle.\n '''\n def go(haystack):\n xs = haystack.split(needle)\n return (xs[0], haystack[len(xs[0]):]) if (\n 1 < len(xs)\n ) else (haystack, '')\n return lambda haystack: go(haystack) if (\n needle\n ) else None\n\n\n# enumFromTo :: Int -> Int -> [Int]\ndef enumFromTo(m):\n '''Enumeration of integer values [m..n]\n '''\n return lambda n: list(range(m, 1 + n))\n\n\n# fTable :: String -> (a -> String) ->\n# (b -> String) -> (a -> b) -> [a] -> String\ndef fTable(s):\n '''Heading -> x display function ->\n fx display function -> f -> xs -> tabular string.\n '''\n def gox(xShow):\n def gofx(fxShow):\n def gof(f):\n def goxs(xs):\n ys = [xShow(x) for x in xs]\n w = max(map(len, ys))\n\n def arrowed(x, y):\n return y.rjust(w, ' ') + ' -> ' + (\n fxShow(f(x))\n )\n return s + '\\n' + '\\n'.join(\n map(arrowed, xs, ys)\n )\n return goxs\n return gof\n return gofx\n return gox\n\n\n# showList :: [a] -> String\ndef showList(xs):\n '''Stringification of a list.\n '''\n return '[' + ','.join(str(x) for x in xs) + ']'\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"rangeExpand <- function(text) {\n lst <- gsub(\"(\\\\d)-\", \"\\\\1:\", unlist(strsplit(text, \",\")))\n unlist(sapply(lst, function (x) eval(parse(text=x))), use.names=FALSE)\n}\n\nrangeExpand(\"-6,-3--1,3-5,7-11,14,15,17-20\")\n [1] -6 -3 -2 -1 3 4 5 7 8 9 10 11 14 15 17 18 19 20\n","language":"R"},{"code":"#lang racket\n\n(define (range-expand s)\n (append*\n (for/list ([r (regexp-split \",\" s)])\n (match (regexp-match* \"(-?[0-9]+)-(-?[0-9]+)\" r\n #:match-select cdr)\n [(list (list f t))\n (range (string->number f) (+ (string->number t) 1))]\n [(list)\n (list (string->number r))]))))\n\n(range-expand \"-6,-3--1,3-5,7-11,14,15,17-20\")\n","language":"Racket"},{"code":"#lang racket\n\n(define on-minus\n (case-lambda\n [(ch ip) (on-minus ch ip #f #f #f #f)]\n [(ch ip src line col pos)\n (if (char-numeric? (peek-char ip))\n (- (read ip))\n (datum->syntax #f '-))]))\n\n(define minus-delimits\n (make-readtable (current-readtable) #\\- 'terminating-macro on-minus))\n\n(define (range-expand s)\n (parameterize ([current-readtable minus-delimits])\n (append*\n (for/list ([f (in-port read s)])\n (match (peek-char s)\n [#\\, (read-char s)\n (list f)]\n [#\\- (read-char s)\n (define t (read s))\n (read-char s)\n (range f (+ t 1))])))))\n\n(range-expand (open-input-string \"-6,-3--1,3-5,7-11,14,15,17-20\"))\n","language":"Racket"},{"code":"sub range-expand (Str $range-description) {\n my token number { '-'? \\d+ }\n my token range { (<&number>) '-' (<&number>) }\n\n $range-description\n .split(',')\n .map({ .match(&range) ?? $0..$1 !! +$_ })\n .flat\n}\n\nsay range-expand('-6,-3--1,3-5,7-11,14,15,17-20').join(', ');\n","language":"Raku"},{"code":"grammar RangeList {\n token TOP { <term>* % ',' { make $<term>.map(*.made) } }\n token term { [<range>|<num>] { make ($<num> // $<range>).made } }\n token range { <num> '-' <num> { make +$<num>[0] .. +$<num>[1] } }\n token num { '-'? \\d+ { make +$/ } }\n}\n\nsay RangeList.parse('-6,-3--1,3-5,7-11,14,15,17-20').made.flat.join(', ');\n","language":"Raku"},{"code":"define get_num use $lst\n # \"-22\" split by \"-\" is [ \"\", \"22\" ] so check if\n # first list item is \"\" -> a negative number\n $lst 0 get \"\" = if\n # negative number\n #\n # convert str to integer and multiply by -1\n -1 $lst 1 get 0 prefer *\n $lst shift $lst shift drop drop\n else\n # positive number\n $lst 0 get 0 prefer\n $lst shift drop\n\ndefine range_expand use $rng\n [ ] as $res\n $rng \",\" split each as $r\n $r m/^(-?\\d+)-(-?\\d+)$/ TRUE = if\n $r s/-/g as $parts\n $parts get_num as $from\n $parts get_num as $to\n # int list to str list, then joined by \",\"\n group\n $from $to 1 range each \"\" prefer\n list \",\" join $res push\n # range doesn't include the $to, so add to end of generated range\n $to \"%d\" $res push\n else\n $r $res push\n $res \",\" join print\n \"\\n\" print\n\n'-6,-3--1,3-5,7-11,14,15,17-20' range_expand\n","language":"Raven"},{"code":"/*REXX program expands an ordered list of integers into an expanded list. */\nold= '-6,-3--1, 3-5, 7-11, 14,15,17-20'; a=translate(old,,',')\nnew= /*translate [↑] commas (,) ───► blanks*/\n do until a==''; parse var a X a /*obtain the next integer ──or── range.*/\n p=pos('-', X, 2) /*find the location of a dash (maybe). */\n if p==0 then new=new X /*append integer X to the new list.*/\n else do j=left(X,p-1) to substr(X,p+1); new=new j\n end /*j*/ /*append a single [↑] integer at a time*/\n end /*until*/\n /*stick a fork in it, we're all done. */\nnew=translate( strip(new), ',', \" \") /*remove the first blank, add commas. */\nsay 'old list: ' old /*show the old list of numbers/ranges.*/\nsay 'new list: ' new /* \" \" new \" \" numbers. */\n","language":"REXX"},{"code":"/*REXX program to expand a range of integers into a list. *************\n* 09.08.2012 Walter Pachl\n**********************************************************************/\n\n parse arg old\n if old = '' then -\n old='-6,-3--1,3-5,7-11,14,15,17-20' /*original list of nums/ranges */\n\n Say 'old='old /*show old list of nums/ranges. */\n a=translate(old,,',') /*translate commas to blanks */\n new='' /*new list of numbers (so far). */\n\n comma=''\n Do While a<>'' /* as long as there is input */\n Parse var a x a /* get one element */\n dashpos=pos('-',x,2) /* find position of dash, if any */\n If dashpos>0 Then Do /* element is low-high */\n Parse Var x low =(dashpos) +1 high /* split the element */\n Do j=low To high /* output all numbers in range */\n new=new||comma||j /* with separating commas */\n comma=',' /* from now on use comma */\n End\n End\n Else Do /* element is a number */\n new=new||comma||x /* append (with comma) */\n comma=',' /* from now on use comma */\n End\n End\n Say 'new='new /*show the expanded list */\n","language":"REXX"},{"code":"# Project : Range expansion\n\nint = \"-6,-3--1,3-5,7-11,14,15,17-20\"\nint = str2list(substr(int, \",\", nl))\nnewint = []\nfor n=1 to len(int)\n nrint = substr(int[n], \"-\")\n nrint2 = substr(int[n], \"--\")\n if nrint2 > 0\n temp1 = left(int[n], nrint2 -1)\n temp2 = right(int[n], len(int[n]) - nrint2)\n add(newint, [temp1,temp2])\n else\n if len(int[n]) <= 2\n add(newint, [int[n], \"\"])\n else\n if nrint > 0 and nrint2 = 0\n temp1 = left(int[n], nrint - 1)\n temp2 = right(int[n], len(int[n]) - nrint)\n add(newint, [temp1,temp2])\n ok\n ok\n ok\nnext\nshowarray(newint)\n\nfunc showarray(vect)\n see \"[\"\n svect = \"\"\n for n = 1 to len(vect)\n if newint[n][2] != \"\"\n for nr = newint[n][1] to newint[n][2]\n svect = svect +\"\" + nr + \", \"\n next\n else\n svect = svect +\"\" + newint[n][1] + \", \"\n ok\n next\n svect = left(svect, len(svect) - 2)\n see svect\n see \"]\" + nl\n","language":"Ring"},{"code":"def range_expand(rng)\n rng.split(',').flat_map do |part|\n if part =~ /^(-?\\d+)-(-?\\d+)$/\n ($1.to_i .. $2.to_i).to_a\n else\n Integer(part)\n end\n end\nend\n\np range_expand('-6,-3--1,3-5,7-11,14,15,17-20')\n","language":"Ruby"},{"code":"PRINT rangeExpand$(\"-6,-3--1,3-5,7-11,14,15,17-20\")\nend\n\nfunction rangeExpand$(range$)\n[loop]\ni\t= INSTR(range$, \"-\", i+1)\nIF i THEN\n j = i\n WHILE MID$(range$,j-1,1) <> \",\" AND j <> 1\n j = j - 1\n wend\n IF i > j then\n IF MID$(range$,j,i-j) <> str$(i-j)+\" \" THEN\n t$ = \"\"\n FOR k = VAL(MID$(range$,j)) TO VAL(MID$(range$,i+1))-1\n t$ = t$ + str$(k) + \",\"\n NEXT k\n range$ = LEFT$(range$,j-1) + t$ + MID$(range$,i+1)\n i = j + LEN(t$) + 2\n end if\n end if\nend if\nif i <> 0 then goto [loop]\nrangeExpand$ = range$\nend function\n","language":"Run-BASIC"},{"code":"use std::str::FromStr;\n\n// Precondition: range doesn't contain multibyte UTF-8 characters\nfn range_expand(range : &str) -> Vec<i32> {\n range.split(',').flat_map(|item| {\n match i32::from_str(item) {\n Ok(n) => n..n+1,\n _ => {\n let dashpos=\n match item.rfind(\"--\") {\n Some(p) => p,\n None => item.rfind('-').unwrap(),\n };\n let rstart=i32::from_str(\n unsafe{ item.slice_unchecked(0,dashpos)} ).unwrap();\n let rend=i32::from_str(\n unsafe{ item.slice_unchecked(dashpos+1,item.len()) } ).unwrap();\n rstart..rend+1\n },\n }\n }).collect()\n}\n\nfn main() {\n println!(\"{:?}\", range_expand(\"-6,-3--1,3-5,7-11,14,15,17-20\"));\n}\n","language":"Rust"},{"code":"variable r_expres = \"-6,-3--1,3-5,7-11,14,15,17-20\", s, r_expan = {}, dpos, i;\n\nforeach s (strchop(r_expres, ',', 0))\n{\n % S-Lang built-in RE's are fairly limited, and have a quirk:\n % grouping is done with \\\\( and \\\\), not ( and )\n % [PCRE and Oniguruma RE's are available via standard libraries]\n if (string_match(s, \"-?[0-9]+\\\\(-\\\\)-?[0-9]+\", 1)) {\n\n (dpos, ) = string_match_nth(1);\n\n % Create/loop-over a \"range array\": from num before - to num after it:\n foreach i ( [integer(substr(s, 1, dpos)) : integer(substr(s, dpos+2, -1))] )\n list_append(r_expan, string(i));\n }\n else\n list_append(r_expan, s);\n}\nprint(strjoin(list_to_array(r_expan), \", \"));\n","language":"S-lang"},{"code":"def rangex(str: String): Seq[Int] =\n str split \",\" flatMap { (s) =>\n val r = \"\"\"(-?\\d+)(?:-(-?\\d+))?\"\"\".r\n val r(a,b) = s\n if (b == null) Seq(a.toInt) else a.toInt to b.toInt\n }\n","language":"Scala"},{"code":"(define split\n (lambda (str char skip count)\n (let ((len (string-length str)))\n (let loop ((index skip)\n (last-index 0)\n (result '()))\n (if (= index len)\n (reverse (cons (substring str last-index) result))\n (if (eq? char (string-ref str index))\n (loop (if (= count (+ 2 (length result)))\n len\n (+ index 1))\n (+ index 1)\n (cons char (cons (substring str last-index index)\n result)))\n (loop (+ index 1)\n last-index\n result)))))))\n\n(define range-expand\n (lambda (str)\n (for-each\n (lambda (token)\n (if (char? token)\n (display token)\n (let ((range (split token #\\- 1 2)))\n (if (null? (cdr range))\n (display (car range))\n (do ((count (string->number (list-ref range 0)) (+ 1 count))\n (high (string->number (list-ref range 2))))\n ((= count high) (display high))\n (display count)\n (display \",\"))))))\n (split str #\\, 0 0))\n (newline)))\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n include \"scanstri.s7i\";\n\nconst func array integer: rangeExpansion (in var string: rangeStri) is func\n result\n var array integer: numbers is 0 times 0;\n local\n var integer: number is 0;\n begin\n while rangeStri <> \"\" do\n number := integer parse getInteger(rangeStri);\n numbers &:= number;\n if startsWith(rangeStri, \"-\") then\n rangeStri := rangeStri[2 ..];\n for number range succ(number) to integer parse getInteger(rangeStri) do\n numbers &:= number;\n end for;\n end if;\n if startsWith(rangeStri, \",\") then\n rangeStri := rangeStri[2 ..];\n elsif rangeStri <> \"\" then\n raise RANGE_ERROR;\n end if;\n end while;\n end func;\n\nconst proc: main is func\n local\n var integer: number is 0;\n begin\n for number range rangeExpansion(\"-6,-3--1,3-5,7-11,14,15,17-20\") do\n write(number <& \" \");\n end for;\n writeln;\n end func;\n","language":"Seed7"},{"code":"func rangex(str) {\n str.split(',').map { |r|\n var m = r.match(/^\n (?(DEFINE) (?<int>[+-]?[0-9]+) )\n (?<from>(?&int))-(?<to>(?&int))\n $/x)\n m ? do {var c = m.ncap; (Num(c{:from}) .. Num(c{:to}))...}\n : Num(r)\n }\n}\n\nsay rangex('-6,-3--1,3-5,7-11,14,15,17-20').join(',')\n","language":"Sidef"},{"code":"* # Return range n1 .. n2\n define('range(n1,n2)') :(range_end)\nrange range = range n1 ','; n1 = lt(n1,n2) n1 + 1 :s(range)\n range rtab(1) . range :(return)\nrange_end\n\n define('rangex(range)d1,d2')\n num = ('-' | '') span('0123456789') :(rangex_end)\nrangex range num . d1 '-' num . d2 = range(d1,d2) :s(rangex)\n rangex = range :(return)\nrangex_end\n\n* # Test and display\n output = rangex('-6,-3--1,3-5,7-11,14,15,17-20')\nend\n","language":"SNOBOL4"},{"code":"/*\nThis code is an implementation of \"Range expansion\" in SQL ORACLE 19c\np_list_of_sets -- input string\ndelimeter by default \",\"\n*/\nwith\nfunction range_expansion(p_list_of_sets in varchar2)\nreturn varchar2 is\n --\n v_list_of_sets varchar2(32767) := p_list_of_sets;\n v_output varchar2(32767) ;\n v_set_1 varchar2(2000) ;\n v_set_1_min pls_integer;\n v_set_1_max pls_integer;\n --\n function sort_set(p_in_str varchar2)\n return varchar2 is\n v_out varchar2(32767) := p_in_str;\n begin\n --\n with out_tab as\n (select to_number(regexp_substr(str, '[^,]+', 1, rownum, 'c', 0) default null on conversion error) elem\n from\n (select p_in_str as str\n from dual\n )\n connect by level <= regexp_count(str, '[^,]+')\n )\n select trim(both ',' from min(elem)||','||max(elem)) end\n into v_out\n from out_tab;\n --\n return v_out;\n end;\n --\n function sort_output(p_in_str varchar2)\n return varchar2 is\n v_out varchar2(32767) := p_in_str;\n begin\n --\n with out_tab as\n (select distinct to_number(regexp_substr(str, '[^,]+', 1, rownum, 'c', 0) default null on conversion error) elem\n from\n (select p_in_str as str\n from dual\n )\n connect by level <= regexp_count(str, '[^,]+')\n )\n select listagg(elem, ',') within group(order by elem) end\n into v_out\n from out_tab\n where elem is not null;\n --\n return v_out;\n end;\n --\nbegin\n --cleaning\n v_list_of_sets := replace(v_list_of_sets, ' ', '') ;\n v_list_of_sets := replace(v_list_of_sets, '+', '') ;\n v_list_of_sets := replace(v_list_of_sets, ',', '|') ;\n v_list_of_sets := regexp_replace(v_list_of_sets, '(\\d{1,})-(\\d{1,})', '\\1,\\2', 1, 0) ;\n v_list_of_sets := regexp_replace(v_list_of_sets, '(\\d{1,})--(\\d{1,})', '\\1,-\\2', 1, 0) ;\n --\n <<loop_through_sets>>\n while regexp_count(v_list_of_sets, '[^|]+') > 0\n loop\n v_set_1 := regexp_substr(v_list_of_sets, '[^|]+', 1, 1) ;\n v_list_of_sets := regexp_replace(v_list_of_sets, v_set_1, sort_set(v_set_1), 1, 1) ;\n v_set_1 := sort_set(v_set_1) ;\n --\n continue loop_through_sets when v_set_1 is null;\n --\n v_set_1_min := least(to_number(regexp_substr(v_set_1, '[^,]+', 1, 1))\n ,to_number(regexp_substr(v_set_1, '[^,]+', 1, 2))\n ) ;\n v_set_1_max := greatest(to_number(regexp_substr(v_set_1, '[^,]+', 1, 1))\n ,to_number(regexp_substr(v_set_1, '[^,]+', 1, 2))\n ) ;\n --\n <<loop_for>>\n for i in v_set_1_min..v_set_1_max\n loop\n --\n v_output := v_output||','||i;\n --\n end loop loop_for;\n --\n v_list_of_sets := regexp_replace(v_list_of_sets,v_set_1,'',1,1);\n --\n end loop loop_through_sets;\n --\n v_output := sort_output(v_output);\n --\n return trim(v_output);\nend;\n\n--Test\nselect '-- Test ' as output from dual\nunion all\nselect lpad(' ', 65) || ' ==> ' || range_expansion(' ') as output from dual\nunion all\nselect lpad('-0,+0,-2 ,-1--2,3 ,-3, 2,-2', 65) || ' ==> ' || range_expansion('-0,+0,-2 ,-1--2,3 ,-3, 2,-2') as output from dual\nunion all\nselect lpad('0,-1,+2,-2', 65) || ' ==> ' || range_expansion('0,-1,2,-2') as output from dual\nunion all\nselect lpad('-D,-w23--1,+14q,15,17-20,3-5,7-11, +0, 2q, +4, 3,0 ,-0,-2 , -3', 65) || ' ==> ' || range_expansion('-D,-w23--1,+14q,15,17-20,3-5,7-11, +0, 2q, +4, 3,0 ,-0,-2 , -3') as output from dual\nunion all\nselect lpad('-6,-3--1,14,15,17-20,3-5,7-11', 65) || ' ==> ' || range_expansion('-6,-3--1,14,15,17-20,3-5,11-7') as output from dual\nunion all\n--Test RosettaCode\nselect '-- Test RosettaCode' as output from dual\nunion all\nselect lpad('-6,-3--1,3-5,7-11,14,15,17-20', 65) || ' ==> ' || range_expansion('-6,-3--1,3-5,7-11,14,15,17-20') as output from dual\n;\n","language":"SQL"},{"code":"composer expand\n [<element>*]\n rule element: <range|INT> (<','>?)\n rule range: (def start: <INT>; <'-'>) <INT> -> $start..$\nend expand\n\n'-6,-3--1,3-5,7-11,14,15,17-20' -> expand -> !OUT::write\n","language":"Tailspin"},{"code":"proc rangeExpand desc {\n set result {}\n foreach term [split $desc \",\"] {\n\tset count [scan $term %d-%d from to]\n\tif {$count == 1} {\n\t lappend result $from\n\t} elseif {$count == 2} {\n\t for {set i $from} {$i <= $to} {incr i} {lappend result $i}\n\t}\n }\n return $result\n}\n\nputs [rangeExpand \"-6,-3--1,3-5,7-11,14,15,17-20\"]\n","language":"Tcl"},{"code":"$$ MODE TUSCRIPT\nrangednrs=\"-6,-3--1,3-5,7-11,14,15,17-20\"\nexpandnrs=SPLIT (rangednrs,\":,:\")\n\nLOOP/CLEAR r=expandnrs\n test=STRINGS (r,\":><-><<>>/:\")\n sz_test=SIZE (test)\n IF (sz_test==1) THEN\n expandnrs=APPEND (expandnrs,r)\n ELSE\n r=SPLIT (r,\"::<|->/::-:\",beg,end)\n expandnrs=APPEND (expandnrs,beg)\n LOOP/CLEAR next=beg,end\n next=next+1\n expandnrs=APPEND (expandnrs,next)\n IF (next==end) EXIT\n ENDLOOP\n ENDIF\nENDLOOP\nexpandnrs= JOIN (expandnrs,\",\")\n\nPRINT expandnrs\n","language":"TUSCRIPT"},{"code":"@(define num (n))@(local tok)@{tok /[+\\-]?\\d+/}@(bind n @(int-str tok))@(end)\n@(define entry (e))@\\\n @(local n1 n2)@\\\n @(cases)@\\\n @(num n1)@/\\s*-\\s*/@(num n2)@\\\n @(bind e (n1 n2))@\\\n @(or)@\\\n @(num n1)@\\\n @(bind e n1)@\\\n @(end)@\\\n@(end)\n@(define rangelist (list))@\\\n @(local first rest)@\\\n @(cases)@\\\n @(entry first)@/\\s*,\\s*/@(rangelist rest)@\\\n @(bind list @(cons first rest))@\\\n @(or)@\\\n @(entry first)@\\\n @(bind list (first))@\\\n @(or)@\\\n @(bind list nil)@\\\n @(end)@\\\n@(end)\n@(do\n (defun expand-helper (list)\n (cond\n ((null list) nil)\n ((consp (first list))\n (append (range (first (first list))\n (second (first list)))\n (rangeexpand (rest list))))\n (t (cons (first list) (rangeexpand (rest list))))))\n\n (defun rangeexpand (list)\n (uniq (expand-helper list))))\n@(repeat)\n@(rangelist x)@{trailing-junk}\n@(output)\nraw syntax: @x\nexpansion: @(rangeexpand x)\nyour junk: @{trailing-junk}\n@(end)\n@(end)\n","language":"TXR"},{"code":"#!/usr/bin/bash\n\nrange_expand () (\n IFS=,\n set -- $1\n n=$#\n for element; do\n if [[ $element =~ ^(-?[0-9]+)-(-?[0-9]+)$ ]]; then\n set -- \"$@\" $(eval echo \"{${BASH_REMATCH[1]}..${BASH_REMATCH[2]}}\")\n else\n set -- \"$@\" $element\n fi\n done\n shift $n\n echo \"$@\"\n # to return a comma-separated value: echo \"${*// /,}\"\n)\n\nrange_expand \"-6,-3--1,3-5,7-11,14,15,17-20\"\n","language":"UNIX-Shell"},{"code":"#import std\n#import int\n\nrex = sep`,; zrange+*= %zp~~htttPzztPQhQXbiNC+ rlc ~&r~=`-\n\n#cast %zL\n\nt = rex '-6,-3--1,3-5,7-11,14,15,17-20'\n","language":"Ursala"},{"code":"Public Function RangeExpand(AString as string)\n' return a list with the numbers expressed in AString\nDim Splits() As String\nDim List() As Integer\nDim count As Integer\n\ncount = -1 'to start a zero-based List() array\n' first split it using comma as delimiter\nSplits = Split(AString, \",\")\n' process all fragments\nFor Each fragment In Splits\n 'is there a \"-\" in it (do not consider first character)?\n P = InStr(2, fragment, \"-\")\n If P > 0 Then 'yes, so it's a range: find start and end numbers\n nstart = Val(left$(fragment, P - 1))\n nend = Val(Mid$(fragment, P + 1))\n j = count\n count = count + (nend - nstart + 1)\n 'add numbers in range to List\n ReDim Preserve List(count)\n For i = nstart To nend\n j = j + 1\n List(j) = i\n Next\n Else\n 'not a range, add a single number\n count = count + 1\n ReDim Preserve List(count)\n List(count) = Val(fragment)\n End If\nNext\nRangeExpand = List\nEnd Function\n\nPublic Sub RangeExpandTest()\n'test function RangeExpand\nDim X As Variant\n\nX = RangeExpand(\"-6,-3--1,3-5,7-11,14,15,17-20\")\n'print X\nDebug.Print \"Result:\"\nFor Each el In X\n Debug.Print el;\nNext\nDebug.Print\nEnd Sub\n","language":"VBA"},{"code":"var expandRange = Fn.new { |s|\n var list = []\n var items = s.split(\",\")\n for (item in items) {\n var count = item.count { |c| c == \"-\" }\n if (count == 0 || (count == 1 && item[0] == \"-\")) {\n list.add(Num.fromString(item))\n } else {\n var items2 = item.split(\"-\")\n var first\n var last\n if (count == 1) {\n first = Num.fromString(items2[0])\n last = Num.fromString(items2[1])\n } else if (count == 2) {\n first = Num.fromString(items2[1]) * -1\n last = Num.fromString(items2[2])\n } else {\n first = Num.fromString(items2[1]) * -1\n last = Num.fromString(items2[3]) * -1\n }\n for (i in first..last) list.add(i)\n }\n }\n return list\n}\n\nvar s = \"-6,-3--1,3-5,7-11,14,15,17-20\"\nSystem.print(expandRange.call(s))\n","language":"Wren"},{"code":"proc Expand(Range);\nchar Range;\nint Lo, Hi, N;\n[Text(8, Range);\nloop [Lo:= IntIn(8);\n BackUp; \\get what terminated number\n case ChIn(8) of\n ^-: [Hi:= IntIn(8);\n for N:= Lo to Hi do\n [IntOut(0, N);\n if N < Hi then Text(0, \", \");\n ];\n BackUp;\n if ChIn(8) = $1A \\EOF\\ then quit;\n ];\n ^,: IntOut(0, Lo)\n other \\EOF\\ [IntOut(0, Lo); quit];\n Text(0, \", \");\n ];\n];\n\nExpand(\"-6,-3--1,3-5,7-11,14,15,17-20\")\n","language":"XPL0"},{"code":"print RangeExpand$(\"-6,-3--1,3-5,7-11,14,15,17-20\")\n\nsub RangeExpand$(s$)\n local w$(1), n, i, r$, p, a, b\n\n n = token(s$, w$(), \",\")\n\n for i = 1 to n\n p = instr(w$(i), \"-\", 2)\n if p then\n a = val(left$(w$(i), p-1))\n b = val(right$(w$(i), len(w$(i)) - p))\n repeat\n r$ = r$ + str$(a) + \",\"\n a = a + 1\n until(a > b)\n else\n r$ = r$ + w$(i) + \",\"\n end if\n next\n return left$(r$, len(r$) - 1)\nend sub\n","language":"Yabasic"},{"code":"fcn rangex(s){\n fcn(s,re){\n if (re.search(s)){\n\t a,b:=re.matched[1,*].apply(\"toInt\");\n\t [a..b].walk();\n }\n else s;\n } :\n s.split(\",\").pump(List, _.fp1(RegExp(0'|(.*\\d+)-(.*\\d+)|)))\n .flatten().concat(\",\");\n}\n","language":"Zkl"},{"code":"ns=\"-6,-3-1,3-5,7-11,14,15,17-20\";\nrangex(ns).println();\n\nns=\"-6,-3--1,3-5,7-11,14,15,17-20\";\nrangex(ns).println();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Range_expansion\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"{{:Range extraction/Format}}\\n\\n\\n;Task:\\nExpand the range description: \\n <big> -6,-3--1,3-5,7-11,14,15,17-20 </big>\\n\\n<small>Note that the second element above, \\nis the '''range from minus 3 to ''minus'' 1'''. </small>\\n\\n\\n;Related task:\\n* [[Range extraction]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F rangeexpand(txt)\\n [Int] lst\\n L(r) txt.split(‘,’)\\n I ‘-’ C r[1..]\\n V rr = r[1..].split(‘-’, 2)\\n lst [+]= Int(r[0]‘’rr[0]) .. Int(rr[1])\\n E\\n lst.append(Int(r))\\n R lst\\n\\nprint(rangeexpand(‘-6,-3--1,3-5,7-11,14,15,17-20’))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"\\\\ Given a low and high limit, create an array containing the numbers in the\\n\\\\ range, inclusive:\\n: n:gen-range \\\\ low hi -- a\\n \\\\ make sure they are in order:\\n 2dup n:> if swap then\\n \\\\ fill the array with the values:\\n [] ' a:push\\n 2swap loop ;\\n\\n\\\\ Take a string, either \\\"X\\\" or \\\"X-Y\\\", and correctly return either a number (if\\n\\\\ \\\"X\\\") or an array of numbers (if \\\"X-Y\\\"):\\n: n:expand-one \\\\ s -- n | a[n,..m]\\n \\\\ First see if we can parse a number. This works in the \\\"X\\\" case:\\n dup >n null? if\\n \\\\ Failed >n because it's (possibly) \\\"X-Y\\\"\\n drop\\n \\\\ not a valid number, might be a range\\n \\\\ We'll use a capturing regex to handle the different cases correctly:\\n /(-?[0-9]+)-(-?[0-9]+)/ tuck r:match\\n\\n \\\\ If the regex matches three (the whole string, plus the two captured\\n \\\\ expressions) then it's a valid \\\"X-Y\\\":\\n 3 n:= if\\n 1 r:@ >n swap 2 r:@ >n nip\\n \\\\ generate the range:\\n n:gen-range\\n else\\n \\\\ The regex didn't match, so we got garbage. Therefore, return a 'null':\\n drop null\\n then\\n else\\n \\\\ It was a \\\"X\\\", just drop the original string:\\n nip\\n then\\n ;\\n\\n\\\\ Take an array (possibly) containing other arrays, and flatten any contained\\n\\\\ arrays so the result is a simple array:\\n: a:flatten \\\\ a1 -- a2\\n [] >r\\n (\\n nip\\n array? if\\n a:flatten r> swap a:+ >r\\n else\\n r> swap a:push >r\\n then\\n ) a:each drop r> ;\\n\\n\\\\ Take a comma-delimited string of ranges, and expand it into an array of\\n\\\\ numbers:\\n: n:range-expand \\\\ str -- a\\n \\\",\\\" s:/\\n ' n:expand-one a:map\\n a:flatten ;\\n\\n\\\\ Process a list:\\n\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\nn:range-expand\\n\\\\ print the expanded list:\\n. cr bye\\n\",\n \"language\": \"8th\"\n },\n {\n \"code\": \"BYTE FUNC Find(CHAR ARRAY text CHAR c BYTE start)\\n BYTE i\\n\\n i=start\\n WHILE i<=text(0)\\n DO\\n IF text(i)=c THEN\\n RETURN (i)\\n FI\\n i==+1\\n OD\\nRETURN (0)\\n\\nPROC ProcessItem(CHAR ARRAY text INT ARRAY res INT POINTER size)\\n BYTE pos\\n INT start,end,i\\n CHAR ARRAY tmp(200)\\n\\n pos=Find(text,'-,2)\\n IF pos=0 THEN\\n res(size^)=ValI(text)\\n size^==+1\\n ELSE\\n SCopyS(tmp,text,1,pos-1)\\n start=ValI(tmp)\\n SCopyS(tmp,text,pos+1,text(0))\\n end=ValI(tmp)\\n FOR i=start TO end\\n DO\\n res(size^)=i\\n size^==+1\\n OD\\n FI\\nRETURN\\n\\nPROC RangeExtraction(CHAR ARRAY text INT ARRAY res INT POINTER size)\\n BYTE i,pos\\n CHAR ARRAY tmp(200)\\n\\n i=1 size^=0\\n WHILE i<=text(0)\\n DO\\n pos=Find(text,',,i)\\n IF pos=0 THEN\\n SCopyS(tmp,text,i,text(0))\\n i=text(0)+1\\n ELSE\\n SCopyS(tmp,text,i,pos-1)\\n i=pos+1\\n FI\\n ProcessItem(tmp,res,size)\\n OD\\nRETURN\\n\\nPROC PrintArray(INT ARRAY a INT size)\\n INT i\\n\\n Put('[)\\n FOR i=0 TO size-1\\n DO\\n IF i>0 THEN Put(' ) FI\\n PrintI(a(i))\\n OD\\n Put(']) PutE()\\nRETURN\\n\\nPROC Main()\\n INT ARRAY res(100)\\n INT size\\n RangeExtraction(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\",res,@size)\\n PrintArray(res,size)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\nprocedure Test_Range_Expansion is\\n type Sequence is array (Positive range <>) of Integer;\\n function Expand (Text : String) return Sequence is\\n To : Integer := Text'First;\\n Count : Natural := 0;\\n Low : Integer;\\n function Get return Integer is\\n From : Integer := To;\\n begin\\n if Text (To) = '-' then\\n To := To + 1;\\n end if;\\n while To <= Text'Last loop\\n case Text (To) is\\n when ',' | '-' => exit;\\n when others => To := To + 1;\\n end case;\\n end loop;\\n return Integer'Value (Text (From..To - 1));\\n end Get;\\n begin\\n while To <= Text'Last loop -- Counting items of the list\\n Low := Get;\\n if To > Text'Last or else Text (To) = ',' then\\n Count := Count + 1;\\n else\\n To := To + 1;\\n Count := Count + Get - Low + 1;\\n end if;\\n To := To + 1;\\n end loop;\\n return Result : Sequence (1..Count) do\\n Count := 0;\\n To := Text'First;\\n while To <= Text'Last loop -- Filling the list\\n Low := Get;\\n if To > Text'Last or else Text (To) = ',' then\\n Count := Count + 1;\\n Result (Count) := Low;\\n else\\n To := To + 1;\\n for Item in Low..Get loop\\n Count := Count + 1;\\n Result (Count) := Item;\\n end loop;\\n end if;\\n To := To + 1;\\n end loop;\\n end return;\\n end Expand;\\n procedure Put (S : Sequence) is\\n First : Boolean := True;\\n begin\\n for I in S'Range loop\\n if First then\\n First := False;\\n else\\n Put (',');\\n end if;\\n Put (Integer'Image (S (I)));\\n end loop;\\n end Put;\\nbegin\\n Put (Expand (\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"));\\nend Test_Range_Expansion;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"list l;\\n\\nfile().b_affix(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\").news(l, 0, 0, \\\",\\\");\\nfor (, text s in l) {\\n integer a, b, p;\\n\\n p = b_frame(s, '-');\\n if (p < 1) {\\n o_(s, \\\",\\\");\\n } else {\\n p -= s[p - 1] == '-' ? 1 : 0;\\n a = s.cut(0, p).atoi;\\n b = s.erase(0, p).atoi;\\n do {\\n o_(a, \\\",\\\");\\n } while ((a += 1) <= b);\\n }\\n}\\n\\no_(\\\"\\\\n\\\");\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"integer p;\\nlist l;\\n\\nfile().b_affix(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\").news(l, 0, 0, \\\",\\\");\\nfor (, text s in l) {\\n if ((p = b_frame(s, '-')) < 1) {\\n o_(s, \\\",\\\");\\n } else {\\n p -= s[p - 1] == '-' ? 1 : 0;\\n call_s(o_, 0, s.cut(0, p).atoi, s.erase(0, p).atoi + 1, 1, \\\",\\\");\\n }\\n}\\n\\no_(\\\"\\\\n\\\");\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"MODE YIELDINT = PROC(INT)VOID;\\n\\nMODE RANGE = STRUCT(INT lwb, upb);\\nMODE RANGEINT = UNION(RANGE, INT);\\n\\nOP SIZEOF = ([]RANGEINT list)INT: (\\n# determine the length of the output array #\\n INT upb := LWB list - 1;\\n FOR key FROM LWB list TO UPB list DO\\n CASE list[key] IN\\n (RANGE value): upb +:= upb OF value - lwb OF value + 1,\\n (INT): upb +:= 1\\n ESAC\\n OD;\\n upb\\n);\\n\\nPROC gen range expand = ([]RANGEINT list, YIELDINT yield)VOID:\\n FOR key FROM LWB list TO UPB list DO\\n CASE list[key] IN\\n (RANGE range): FOR value FROM lwb OF range TO upb OF range DO yield(value) OD,\\n (INT int): yield(int)\\n ESAC\\n OD;\\n\\nPROC range expand = ([]RANGEINT list)[]INT: (\\n [LWB list: LWB list + SIZEOF list - 1]INT out;\\n INT upb := LWB out - 1;\\n# FOR INT value IN # gen range expand(list, # ) DO #\\n## (INT value)VOID:\\n out[upb +:= 1] := value\\n# OD #);\\n out\\n);\\n\\n#\\ntest:(\\n []RANGEINT list = (-6, RANGE(-3, -1), RANGE(3, 5), RANGE(7, 11), 14, 15, RANGE(17, 20));\\n print((range expand(list), new line))\\n)\\n#\\n\\n\\n# converts string containing a comma-separated list of ranges and values to a []RANGEINT #\\nOP TORANGE = ( STRING s )[]RANGEINT:\\nBEGIN\\n\\n # counts the number of elements - one more than the number of commas #\\n # and so assumes there is always at least one element #\\n PROC count elements = INT:\\n BEGIN\\n\\n INT elements := 1;\\n\\n FOR pos FROM LWB s TO UPB s\\n DO\\n IF s[ pos ] = \\\",\\\"\\n THEN\\n elements +:= 1\\n FI\\n OD;\\n\\n # RESULT #\\n elements\\n END; # count elements #\\n\\n REF[]RANGEINT result = HEAP [ 1 : count elements ]RANGEINT;\\n\\n # does the actual parsing - assumes the string is syntatically valid and doesn't check for errors #\\n # - in particular, a string with no elements will cause problems, as will space characters in the string #\\n PROC parse range string = []RANGEINT:\\n BEGIN\\n\\n INT element := 0;\\n INT str pos := 1;\\n\\n PROC next = VOID: str pos +:= 1;\\n PROC curr char = CHAR: IF str pos > UPB s THEN \\\"?\\\" ELSE s[ str pos ] FI;\\n PROC have minus = BOOL: curr char = \\\"-\\\";\\n PROC have digit = BOOL: curr char >= \\\"0\\\" AND curr char <= \\\"9\\\";\\n\\n\\n # parses a number out of the string #\\n # the number must be a sequence of digits with an optional leading minus sign #\\n PROC get number = INT:\\n BEGIN\\n\\n INT number := 0;\\n\\n INT sign multiplier = IF have minus\\n THEN\\n # negaive number #\\n # skip the sign #\\n next;\\n -1\\n ELSE\\n # positive number #\\n 1\\n FI;\\n\\n WHILE curr char >= \\\"0\\\" AND curr char <= \\\"9\\\"\\n DO\\n number *:= 10;\\n number +:= ( ABS curr char - ABS \\\"0\\\" );\\n next\\n OD;\\n\\n # RESULT #\\n number * sign multiplier\\n END; # get number #\\n\\n\\n # main parsing #\\n WHILE str pos <= UPB s\\n DO\\n CHAR c = curr char;\\n\\n IF have minus OR have digit\\n THEN\\n # have the start of a number #\\n INT from value = get number;\\n element +:= 1;\\n IF NOT have minus\\n THEN\\n # not a range #\\n result[ element ] := from value\\n ELSE\\n # have a range #\\n next;\\n INT to value = get number;\\n result[ element ] := RANGE( from value, to value )\\n FI\\n ELSE\\n # should be a comma #\\n next\\n FI\\n OD;\\n\\n # RESULT #\\n result\\n END; # parse range string #\\n\\n\\n# RESULT #\\n parse range string\\nEND; # TORANGE #\\n\\n\\n# converts a []INT to a comma separated string of the elements #\\nOP TOSTRING = ( []INT values )STRING:\\nBEGIN\\n\\n STRING result := \\\"\\\";\\n STRING separator := \\\"\\\";\\n\\n FOR pos FROM LWB values TO UPB values\\n DO\\n result +:= ( separator + whole( values[ pos ], 0 ) );\\n separator := \\\",\\\"\\n OD;\\n\\n# RESULT #\\n result\\nEND; # TOSTRING #\\n\\n\\ntest:(\\n print( ( TOSTRING range expand( TORANGE \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\" ), newline ) )\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"range←{\\n aplnum←{⍎('¯',⎕D)[('-',⎕D)⍳⍵]}\\n ∊{ 0::('Invalid range: ''',⍵,'''')⎕SIGNAL 11\\n n←aplnum¨(~<\\\\(⊢≠∨\\\\)⍵∊⎕D)⊆⍵\\n 1=≢n:n\\n s e←n\\n (s+(⍳e-s-1))-1\\n }¨(⍵≠',')⊆⍵\\n}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"-- Each comma-delimited string is mapped to a list of integers,\\n-- and these integer lists are concatenated together into a single list\\n\\n\\n---------------------- RANGE EXPANSION ---------------------\\n\\n-- expansion :: String -> [Int]\\non expansion(strExpr)\\n -- The string (between commas) is split on hyphens,\\n -- and this segmentation is rewritten to ranges or minus signs\\n -- and evaluated to lists of integer values\\n\\n -- signedRange :: String -> [Int]\\n script signedRange\\n -- After the first character, numbers preceded by an\\n -- empty string (resulting from splitting on hyphens)\\n -- and interpreted as negative\\n\\n -- signedIntegerAppended:: [Int] -> String -> Int -> [Int] -> [Int]\\n on signedIntegerAppended(acc, strNum, iPosn, xs)\\n if strNum ≠ \\\"\\\" then\\n if iPosn > 1 then\\n set strSign to |λ|(0 < length of (item (iPosn - 1) of xs)) ¬\\n of bool(\\\"\\\", \\\"-\\\")\\n else\\n set strSign to \\\"+\\\"\\n end if\\n\\n acc & ((strSign & strNum) as integer)\\n else\\n acc\\n end if\\n end signedIntegerAppended\\n\\n on |λ|(strHyphenated)\\n tupleRange(foldl(signedIntegerAppended, {}, ¬\\n splitOn(\\\"-\\\", strHyphenated)))\\n end |λ|\\n end script\\n\\n concatMap(signedRange, splitOn(\\\",\\\", strExpr))\\nend expansion\\n\\n\\n---------------------------- TEST --------------------------\\non run\\n\\n expansion(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n\\n --> {-6, -3, -2, -1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20}\\nend run\\n\\n\\n--------------------- GENERIC FUNCTIONS --------------------\\n\\n\\n-- bool :: a -> a -> Bool -> a\\non bool(tf, ff)\\n -- The evaluation of either tf or ff,\\n -- depending on a boolean value.\\n script\\n on |λ|(bln)\\n if bln then\\n set e to tf\\n else\\n set e to ff\\n end if\\n set c to class of e\\n if {script, handler} contains c then\\n |λ|() of mReturn(e)\\n else\\n e\\n end if\\n end |λ|\\n end script\\nend bool\\n\\n-- concatMap :: (a -> [b]) -> [a] -> [b]\\non concatMap(f, xs)\\n script append\\n on |λ|(a, b)\\n a & b\\n end |λ|\\n end script\\n\\n foldl(append, {}, map(f, xs))\\nend concatMap\\n\\n-- enumFromTo :: Int -> Int -> [Int]\\non enumFromTo(m, n)\\n if n < m then\\n set d to -1\\n else\\n set d to 1\\n end if\\n set lst to {}\\n repeat with i from m to n by d\\n set end of lst to i\\n end repeat\\n return lst\\nend enumFromTo\\n\\n-- foldl :: (a -> b -> a) -> a -> [b] -> a\\non foldl(f, startValue, xs)\\n tell mReturn(f)\\n set v to startValue\\n set lng to length of xs\\n repeat with i from 1 to lng\\n set v to |λ|(v, item i of xs, i, xs)\\n end repeat\\n return v\\n end tell\\nend foldl\\n\\n-- map :: (a -> b) -> [a] -> [b]\\non map(f, xs)\\n tell mReturn(f)\\n set lng to length of xs\\n set lst to {}\\n repeat with i from 1 to lng\\n set end of lst to |λ|(item i of xs, i, xs)\\n end repeat\\n return lst\\n end tell\\nend map\\n\\n-- Lift 2nd class handler function into 1st class script wrapper\\n-- mReturn :: Handler -> Script\\non mReturn(f)\\n if class of f is script then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\\n-- splitOn :: Text -> Text -> [Text]\\non splitOn(strDelim, strMain)\\n set {dlm, my text item delimiters} to {my text item delimiters, strDelim}\\n set xs to text items of strMain\\n set my text item delimiters to dlm\\n return xs\\nend splitOn\\n\\n-- range :: (Int, Int) -> [Int]\\non tupleRange(tuple)\\n if tuple = {} then\\n {}\\n else if length of tuple > 1 then\\n enumFromTo(item 1 of tuple, item 2 of tuple)\\n else\\n item 1 of tuple\\n end if\\nend tupleRange\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{-6, -3, -2, -1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"on rangeExpansion(rangeExpression)\\n -- Split the expression at the commas, if any.\\n set astid to AppleScript's text item delimiters\\n set AppleScript's text item delimiters to \\\",\\\"\\n set theRanges to rangeExpression's text items\\n\\n set integerList to {}\\n set AppleScript's text item delimiters to \\\"-\\\"\\n repeat with thisRange in theRanges\\n -- Split each range or integer text at its dash(es), if any.\\n set rangeParts to thisRange's text items\\n -- A minus before the first integer will make leading text item \\\"\\\".\\n -- If this happens, insert the negative first value at the beginning of the parts list.\\n -- (AppleScript automatically coerces numeric text to number when the context demands.)\\n if (rangeParts begins with \\\"\\\") then set beginning of rangeParts to -(item 2 of rangeParts)\\n -- A minus before the second (or only) integer will make the penultimate text item \\\"\\\".\\n -- In this case, insert the negative last value at the end of the parts list.\\n if (((count rangeParts) > 1) and (item -2 of rangeParts is \\\"\\\")) then set end of rangeParts to -(end of rangeParts)\\n -- Append all the integers implied by the range to the integer list.\\n repeat with i from (beginning of rangeParts) to (end of rangeParts)\\n set end of integerList to i\\n end repeat\\n end repeat\\n set AppleScript's text item delimiters to astid\\n\\n return integerList\\nend rangeExpansion\\n\\n-- Demo code:\\nset rangeExpression to \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\nreturn rangeExpansion(rangeExpression)\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{-6, -3, -2, -1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"expandRange: function [rng][\\n flatten @ to :block\\n join.with:\\\" \\\" map split.by:\\\",\\\" rng 'x ->\\n replace replace replace x\\n {/^\\\\-(\\\\d+)/} \\\"(neg $1)\\\" {/\\\\-\\\\-(\\\\d+)/}\\n \\\"-(neg $1)\\\" \\\"-\\\" \\\"..\\\"\\n]\\n\\nprint expandRange {-6,-3--1,3-5,7-11,14,15,17-20}\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"msgbox % expand(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n\\nexpand( range ) {\\n p := 0\\n while p := RegExMatch(range, \\\"\\\\s*(-?\\\\d++)(?:\\\\s*-\\\\s*(-?\\\\d++))?\\\", f, p+1+StrLen(f))\\n loop % (f2 ? f2-f1 : 0) + 1\\n ret .= \\\",\\\" (A_Index-1) + f1\\n return SubStr(ret, 2)\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#!/usr/bin/awk -f\\nBEGIN {\\tFS=\\\",\\\"; }\\n\\n{\\ts=\\\"\\\";\\n\\tfor (i=1; i<=NF; i++) { expand($i); }\\n\\tprint substr(s,2);\\n}\\n\\nfunction expand(a) {\\n\\tidx = match(a,/[0-9]-/);\\n\\tif (idx==0) {\\n\\t\\ts = s\\\",\\\"a; \\t\\n\\t\\treturn;\\n\\t}\\n\\t\\n\\tstart= substr(a,1, idx)+0;\\n\\tstop = substr(a,idx+2)+0;\\n\\tfor (m = start; m <= stop; m++) {\\n\\t\\ts = s\\\",\\\"m; \\t\\n\\t}\\n\\treturn;\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \" PRINT FNrangeexpand(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n END\\n\\n DEF FNrangeexpand(r$)\\n LOCAL i%, j%, k%, t$\\n REPEAT\\n i% = INSTR(r$, \\\"-\\\", i%+1)\\n IF i% THEN\\n j% = i%\\n WHILE MID$(r$,j%-1,1)<>\\\",\\\" AND j%<>1\\n j% -= 1\\n ENDWHILE\\n IF i%>j% IF MID$(r$,j%,i%-j%)<>STRING$(i%-j%,\\\" \\\") THEN\\n t$ = \\\"\\\"\\n FOR k% = VALMID$(r$,j%) TO VALMID$(r$,i%+1)-1\\n t$ += STR$(k%) + \\\",\\\"\\n NEXT\\n r$ = LEFT$(r$,j%-1) + t$ + MID$(r$,i%+1)\\n i% = j% + LEN(t$) + 2\\n ENDIF\\n ENDIF\\n UNTIL i% = 0\\n = r$\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \" ( expandRanges\\n = a b L\\n . @( !arg\\n : (#(?a:?b)|#?a \\\"-\\\" #?b)\\n (:?L|\\\",\\\" [%(expandRanges$!sjt:?L))\\n )\\n & whl\\n ' ( (!L:&!b|(!b,!L))\\n : ?L\\n & -1+!b:~<!a:?b\\n )\\n & !L\\n |\\n )\\n& out$(str$(expandRanges$\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"))\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <ctype.h>\\n\\n/* BNFesque\\n\\trangelist := (range | number) [',' rangelist]\\n\\trange := number '-' number\\t*/\\n\\nint get_list(const char *, char **);\\nint get_rnge(const char *, char **);\\n\\n/* parser only parses; what to do with parsed items is up to\\n* the add_number and and_range functions */\\nvoid add_number(int x);\\nint add_range(int x, int y);\\n\\n#define skip_space while(isspace(*s)) s++\\n#define get_number(x, s, e) (x = strtol(s, e, 10), *e != s)\\nint get_list(const char *s, char **e)\\n{\\n\\tint x;\\n\\twhile (1) {\\n\\t\\tskip_space;\\n\\t\\tif (!get_rnge(s, e) && !get_number(x, s, e)) break;\\n\\t\\ts = *e;\\n\\n\\t\\tskip_space;\\n\\t\\tif ((*s) == '\\\\0') { putchar('\\\\n'); return 1; }\\n\\t\\tif ((*s) == ',') { s++; continue; }\\n\\t\\tbreak;\\n\\t}\\n\\t*(const char **)e = s;\\n\\tprintf(\\\"\\\\nSyntax error at %s\\\\n\\\", s);\\n\\treturn 0;\\n}\\n\\nint get_rnge(const char *s, char **e)\\n{\\n\\tint x, y;\\n\\tchar *ee;\\n\\tif (!get_number(x, s, &ee)) return 0;\\n\\ts = ee;\\n\\n\\tskip_space;\\n\\tif (*s != '-') {\\n\\t\\t*(const char **)e = s;\\n\\t\\treturn 0;\\n\\t}\\n\\ts++;\\n\\tif(!get_number(y, s, e)) return 0;\\n\\treturn add_range(x, y);\\n}\\n\\nvoid add_number(int x)\\n{\\n\\tprintf(\\\"%d \\\", x);\\n}\\n\\nint add_range(int x, int y)\\n{\\n\\tif (y <= x) return 0;\\n\\twhile (x <= y) printf(\\\"%d \\\", x++);\\n\\treturn 1;\\n}\\n\\nint main()\\n{\\n\\tchar *end;\\n\\n\\t/* this is correct */\\n\\tif (get_list(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\", &end)) puts(\\\"Ok\\\");\\n\\n\\t/* this is not. note the subtle error: \\\"-6 -3\\\" is parsed\\n\\t * as range(-6, 3), so synax error comes after that */\\n\\tget_list(\\\"-6 -3--1,3-5,7-11,14,15,17-20\\\", &end);\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <sstream>\\n#include <iterator>\\n#include <climits>\\n#include <deque>\\n\\n// parse a list of numbers with ranges\\n//\\n// arguments:\\n// is: the stream to parse\\n// out: the output iterator the parsed list is written to.\\n//\\n// returns true if the parse was successful. false otherwise\\ntemplate<typename OutIter>\\n bool parse_number_list_with_ranges(std::istream& is, OutIter out)\\n{\\n int number;\\n // the list always has to start with a number\\n while (is >> number)\\n {\\n *out++ = number;\\n\\n char c;\\n if (is >> c)\\n switch(c)\\n {\\n case ',':\\n continue;\\n case '-':\\n {\\n int number2;\\n if (is >> number2)\\n {\\n if (number2 < number)\\n return false;\\n while (number < number2)\\n *out++ = ++number;\\n char c2;\\n if (is >> c2)\\n if (c2 == ',')\\n continue;\\n else\\n return false;\\n else\\n return is.eof();\\n }\\n else\\n return false;\\n }\\n default:\\n return is.eof();\\n }\\n else\\n return is.eof();\\n }\\n // if we get here, something went wrong (otherwise we would have\\n // returned from inside the loop)\\n return false;\\n}\\n\\nint main()\\n{\\n std::istringstream example(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\");\\n std::deque<int> v;\\n bool success = parse_number_list_with_ranges(example, std::back_inserter(v));\\n if (success)\\n {\\n std::copy(v.begin(), v.end()-1,\\n std::ostream_iterator<int>(std::cout, \\\",\\\"));\\n std::cout << v.back() << \\\"\\\\n\\\";\\n }\\n else\\n std::cout << \\\"an error occured.\\\";\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\nusing System.Text.RegularExpressions;\\n\\nclass Program\\n{\\n static void Main(string[] args)\\n {\\n var rangeString = \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\";\\n var matches = Regex.Matches(rangeString, @\\\"(?<f>-?\\\\d+)-(?<s>-?\\\\d+)|(-?\\\\d+)\\\");\\n var values = new List<string>();\\n\\n foreach (var m in matches.OfType<Match>())\\n {\\n if (m.Groups[1].Success)\\n {\\n values.Add(m.Value);\\n continue;\\n }\\n\\n var start = Convert.ToInt32(m.Groups[\\\"f\\\"].Value);\\n var end = Convert.ToInt32(m.Groups[\\\"s\\\"].Value) + 1;\\n\\n values.AddRange(Enumerable.Range(start, end - start).Select(v => v.ToString()));\\n }\\n\\n Console.WriteLine(string.Join(\\\", \\\", values));\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\nnamespace RangeExpansion {\\n internal static class StringExtensions {\\n internal static IEnumerable<int> ExpandRange(this string s) {\\n return s.Split(',')\\n .Select(rstr => {\\n int start;\\n if (int.TryParse(rstr, out start))\\n return new {Start = start, End = start};\\n var istr = new string((\\\"+-\\\".Any(_ => rstr[0] == _)\\n ? rstr.Take(1).Concat(rstr.Skip(1).TakeWhile(char.IsDigit))\\n : rstr.TakeWhile(char.IsDigit)\\n ).ToArray());\\n rstr = rstr.Substring(istr.Length + 1, (rstr.Length - istr.Length) - 1);\\n return new {Start = int.Parse(istr), End = int.Parse(rstr)};\\n }).SelectMany(_ => Enumerable.Range(_.Start, _.End - _.Start + 1));\\n }\\n }\\n\\n internal static class Program {\\n private static void Main() {\\n const string RANGE_STRING = \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\";\\n var values = RANGE_STRING.ExpandRange().ToList();\\n var vstr = string.Join(\\\", \\\", values.Select(_ => _.ToString()));\\n Console.WriteLine(vstr);\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn split [s sep]\\n (defn skipFirst [[x & xs :as s]]\\n\\t(cond (empty? s) [nil nil]\\n\\t (= x sep) [x xs]\\n\\t true [nil s]))\\n (loop [lst '(), s s]\\n\\t (if (empty? s) (reverse lst)\\n\\t (let [[hd trunc] (skipFirst s)\\n\\t [word news] (split-with #(not= % sep) trunc)\\n\\t\\t cWord (cons hd word)]\\n\\t\\t (recur (cons (apply str cWord) lst)\\n\\t\\t \\t (apply str (rest news)))))))\\n\\n(defn parseRange [[x & xs :as s]]\\n (if (some #(= % \\\\-) xs)\\n\\t (let [[r0 r1] (split s \\\\-)]\\n\\t\\t(range (read-string r0) (inc (read-string r1))))\\n\\t (list (read-string (str s))))))\\n\\n(defn rangeexpand [s]\\n (flatten (map parseRange (split s \\\\,))))\\n\\n> (rangeexpand \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n(-6 -3 -2 -1 3 4 5 7 8 9 10 11 14 15 17 18 19 20)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \" >>SOURCE FREE\\nIDENTIFICATION DIVISION.\\nPROGRAM-ID. expand-range.\\n\\nDATA DIVISION.\\nWORKING-STORAGE SECTION.\\n01 comma-pos PIC 99 COMP VALUE 1.\\n01 dash-pos PIC 99 COMP.\\n01 end-num PIC S9(3).\\n01 Max-Part-Len CONSTANT 10.\\n01 num PIC S9(3).\\n01 edited-num PIC -(3)9.\\n01 part PIC X(10).\\n\\n01 part-flag PIC X.\\n 88 last-part VALUE \\\"Y\\\".\\n\\n01 range-str PIC X(80).\\n01 Range-Str-Len CONSTANT 80.\\n01 start-pos PIC 99 COMP.\\n01 start-num PIC S9(3).\\n\\nPROCEDURE DIVISION.\\n ACCEPT range-str\\n\\n PERFORM WITH TEST AFTER UNTIL last-part\\n UNSTRING range-str DELIMITED BY \\\",\\\" INTO part WITH POINTER comma-pos\\n PERFORM check-if-last\\n\\n PERFORM find-range-dash\\n\\n IF dash-pos > Max-Part-Len\\n PERFORM display-num\\n ELSE\\n PERFORM display-range\\n END-IF\\n END-PERFORM\\n\\n DISPLAY SPACES\\n\\n GOBACK\\n .\\ncheck-if-last SECTION.\\n IF comma-pos > Range-Str-Len\\n SET last-part TO TRUE\\n END-IF\\n .\\nfind-range-dash SECTION.\\n IF part (1:1) <> \\\"-\\\"\\n MOVE 1 TO start-pos\\n ELSE\\n MOVE 2 TO start-pos\\n END-IF\\n\\n MOVE 1 TO dash-pos\\n INSPECT part (start-pos:) TALLYING dash-pos FOR CHARACTERS BEFORE \\\"-\\\"\\n COMPUTE dash-pos = dash-pos + start-pos - 1\\n .\\ndisplay-num SECTION.\\n MOVE part TO edited-num\\n CALL \\\"display-edited-num\\\" USING CONTENT part-flag, edited-num\\n .\\ndisplay-range SECTION.\\n MOVE part (1:dash-pos - 1) TO start-num\\n MOVE part (dash-pos + 1:) TO end-num\\n\\n PERFORM VARYING num FROM start-num BY 1 UNTIL num = end-num\\n MOVE num TO edited-num\\n CALL \\\"display-edited-num\\\" USING CONTENT \\\"N\\\", edited-num\\n END-PERFORM\\n\\n MOVE end-num TO edited-num\\n CALL \\\"display-edited-num\\\" USING CONTENT part-flag, edited-num\\n .\\nEND PROGRAM expand-range.\\n\\n\\nIDENTIFICATION DIVISION.\\nPROGRAM-ID. display-edited-num.\\n\\nDATA DIVISION.\\nLINKAGE SECTION.\\n01 hide-comma-flag PIC X.\\n 88 hide-comma VALUE \\\"Y\\\".\\n01 edited-num PIC -(3)9.\\n\\nPROCEDURE DIVISION USING hide-comma-flag, edited-num.\\n DISPLAY FUNCTION TRIM(edited-num) NO ADVANCING\\n IF NOT hide-comma\\n DISPLAY \\\", \\\" NO ADVANCING\\n END-IF\\n .\\nEND PROGRAM display-edited-num.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"(defun expand-ranges (string)\\n (loop\\n with prevnum = nil\\n for idx = 0 then (1+ nextidx)\\n for (number nextidx) = (multiple-value-list\\n (parse-integer string\\n :start idx :junk-allowed t))\\n append (cond\\n (prevnum\\n (prog1\\n (loop for i from prevnum to number\\n collect i)\\n (setf prevnum nil)))\\n ((and (< nextidx (length string))\\n (char= (aref string nextidx) #\\\\-))\\n (setf prevnum number)\\n nil)\\n (t\\n (list number)))\\n while (< nextidx (length string))))\\n\\nCL-USER> (expand-ranges \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n(-6 -3 -2 -1 3 4 5 7 8 9 10 11 14 15 17 18 19 20)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\n# Callback interface\\ninterface RangeCb(n: int32);\\n\\n# This will call `cb' for each number in the range, in ascending order.\\n# It will return NULL on success, or the location of an error if\\n# there is one.\\nsub Expand(ranges: [uint8], cb: RangeCb): (err: [uint8]) is\\n err := 0 as [uint8];\\n loop\\n # Grab first number\\n var n1: int32;\\n var next: [uint8];\\n (n1, next) := AToI(ranges);\\n\\n if next == ranges then\\n # No number here!\\n err := ranges;\\n break;\\n elseif [next] == ',' or [next] == 0 then\\n # Only one number, not a range\\n cb(n1);\\n elseif [next] != '-' then\\n # No dash!\\n err := ranges;\\n break;\\n else\\n # Grab second number\\n ranges := @next next;\\n var n2: int32;\\n (n2, next) := AToI(ranges);\\n if next == ranges or n1 >= n2 then\\n # No second number, or first not before second\\n err := ranges;\\n break;\\n end if;\\n\\n # We need all numbers from n1 to n2 inclusive\\n while n1 <= n2 loop\\n cb(n1);\\n n1 := n1 + 1;\\n end loop;\\n end if;\\n\\n # stop if end reached\\n if [next] == 0 then break;\\n elseif [next] != ',' then\\n err := ranges;\\n break;\\n end if;\\n ranges := @next next;\\n end loop;\\nend sub;\\n\\n# This function will use `Expand' above to expand a comma-separated\\n# range list, and reformat it as a comma-separated list of integers.\\nsub ExpandFmt(ranges: [uint8], buf: [uint8]): (err: [uint8]) is\\n # Format and add number to buffer\\n sub AddNum implements RangeCb is\\n buf := IToA(n, 10, buf);\\n [buf] := ',';\\n buf := @next buf;\\n end sub;\\n\\n # Expand range, adding numbers to buffer\\n err := Expand(ranges, AddNum);\\n [@prev buf] := 0;\\nend sub;\\n\\n# Expand and print, and/or give error\\nsub PrintExpansion(ranges: [uint8]) is\\n var buf: uint8[256];\\n var err := ExpandFmt(ranges, &buf[0]);\\n print(ranges);\\n print_nl();\\n print(\\\" >> \\\");\\n if err == 0 as [uint8] then\\n # everything is OK\\n print(&buf[0]);\\n else\\n # error\\n print(\\\"error at: \\\");\\n print(err);\\n end if;\\n print_nl();\\nend sub;\\n\\n# Try it on the given input\\nPrintExpansion(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\");\\n\\n# Try it on a couple of wrong ones\\nPrintExpansion(\\\"-6-3--1,3-5,7-11,14,15,17-20\\\"); # misformatted range\\nPrintExpansion(\\\"-6,-3--1,5-3,7-11,14,15,17-20\\\"); # numbers not in order\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"def range_expand(range)\\n range.split(',').flat_map do |part|\\n match = /^(-?\\\\d+)-(-?\\\\d+)$/.match(part)\\n if match\\n (match[1].to_i .. match[2].to_i).to_a\\n else\\n part.to_i\\n end\\n end\\nend\\n\\nputs range_expand(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio, std.regex, std.conv, std.range, std.algorithm;\\n\\nenum rangeEx = (string s) /*pure*/ => s.matchAll(`(-?\\\\d+)-?(-?\\\\d+)?,?`)\\n .map!q{ a[1].to!int.iota(a[1 + !a[2].empty].to!int + 1) }.join;\\n\\nvoid main() {\\n \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\".rangeEx.writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Range_expansion;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils;\\n\\nconst\\n input = '-6,-3--1,3-5,7-11,14,15,17-20';\\n\\nvar\\n r: TArray<Integer>;\\n last, i, n: Integer;\\n\\nbegin\\n for var part in input.Split([',']) do\\n begin\\n i := part.Substring(1).IndexOf('-');\\n if i = -1 then\\n begin\\n if not TryStrToInt(part, n) then\\n raise Exception.Create('Error: value invalid ' + part);\\n if Length(r) > 0 then\\n if last = n then\\n begin\\n raise Exception.Create('Error: Duplicate value:' + n.ToString);\\n end\\n else\\n begin\\n if last > n then\\n raise Exception.CreateFmt('Error: values not ordered: %s > %s', [last, n]);\\n end;\\n SetLength(r, Length(r) + 1);\\n r[High(r)] := n;\\n last := n;\\n end\\n else\\n begin\\n var n1 := 0;\\n var n2 := 0;\\n if not TryStrToInt(part.Substring(0, i + 1), n1) then\\n raise Exception.Create('Error: value invalid ' + part);\\n if not TryStrToInt(part.Substring(i + 2), n2) then\\n raise Exception.Create('Error: value invalid ' + part);\\n if n2 < n1 + 2 then\\n raise Exception.Create('Error: Invalid range' + part);\\n if Length(r) > 0 then\\n begin\\n if last = n1 then\\n raise Exception.Create('Error: Duplicate value: ' + n1.ToString);\\n if last > n1 then\\n raise Exception.CreateFmt('Error: Values not ordened: %d > %d', [last, n1]);\\n end;\\n\\n for i := n1 to n2 do\\n begin\\n SetLength(r, Length(r) + 1);\\n r[High(r)] := i;\\n end;\\n\\n last := n2;\\n end;\\n end;\\n write('expanded: ');\\n for var rr in r do\\n begin\\n write(rr, ',');\\n end;\\n readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"function ExpandRanges(ranges : String) : array of Integer;\\nbegin\\n for var range in ranges.Split(',') do begin\\n var separator = range.IndexOf('-', 2);\\n if separator > 0 then begin\\n for var i := range.Left(separator-1).ToInteger to range.Copy(separator+1).ToInteger do\\n Result.Add(i);\\n end else begin\\n Result.Add(range.ToInteger)\\n end;\\n end;\\nend;\\n\\nvar expanded := ExpandRanges('-6,-3--1,3-5,7-11,14,15,17-20');\\nPrintLn(JSON.Stringify(expanded));\\n\",\n \"language\": \"DWScript\"\n },\n {\n \"code\": \"func main() {\\n let input = \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\n print(\\\"range: \\\\(input)\\\")\\n var r = []\\n var last = 0\\n for part in input.Split(',') {\\n var i = part[1..].IndexOf('-')\\n if i == -1 {\\n var n = Integer(part)\\n if r.Length() > 0 {\\n return print(\\\"duplicate value: \\\\(n)\\\") when last == n\\n return print(\\\"values not ordered: \\\\(last) > \\\\(n)\\\") when last > n\\n }\\n r.Add(n)\\n last = n\\n } else {\\n var n1 = Integer(part[..i])\\n var n2 = Integer(part[(i + 2)..])\\n return print(\\\"invalid range: \\\\(part)\\\") when n2 < n1 + 2\\n\\n if r.Length() > 0 {\\n return print(\\\"duplicate value: \\\\(n1)\\\") when last == n1\\n return print(\\\"values not ordered: \\\\(last) > \\\\(n1)\\\") when last > n1\\n }\\n\\n for i in n1..n2 {\\n r.Add(i)\\n }\\n last = n2\\n }\\n }\\n\\n print(\\\"expanded: \\\\(r)\\\")\\n}\\n\\nmain()\\n\",\n \"language\": \"Dyalect\"\n },\n {\n \"code\": \";; parsing [spaces][-]digit(s)-[-]digit(s)[spaces]\\n(define R (make-regexp \\\"^ *(\\\\-?\\\\\\\\d+)\\\\-(\\\\-?\\\\\\\\d+) *$\\\" ))\\n\\n;; the native (range a b) is [a ... b[\\n;; (range+ a b) is [a ... b]\\n(define (range+ a b)\\n\\t(if (< a b) (range a (1+ b))\\n\\t(if (> a b) (range a (1- b) -1)\\n\\t(list a))))\\n\\t\\n;; in : string : \\\"number\\\" or \\\"number-number\\\"\\n;; out : a range = list of integer(s)\\n(define (do-range str)\\n(define from-to (regexp-exec R str)) ;; \\\"1-3\\\" --> (\\\"1\\\" \\\"3\\\")\\n(if from-to\\n (range+ (string->number (first from-to)) (string->number (second from-to)))\\n (list (string->number str))))\\n\\n(define (ranges str)\\n (apply append (map do-range (string-split str \\\",\\\"))))\\n\\t\\n\\n(define task \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n(ranges task)\\n → (-6 -3 -2 -1 3 4 5 7 8 9 10 11 14 15 17 18 19 20)\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"defmodule RC do\\n def expansion(range) do\\n Enum.flat_map(String.split(range, \\\",\\\"), fn part ->\\n case Regex.scan(~r/^(-?\\\\d+)-(-?\\\\d+)$/, part) do\\n [[_,a,b]] -> Enum.to_list(String.to_integer(a) .. String.to_integer(b))\\n [] -> [String.to_integer(part)]\\n end\\n end)\\n end\\nend\\n\\nIO.inspect RC.expansion(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-module( range ).\\n\\n-export( [expansion/1, task/0] ).\\n\\nexpansion( String ) ->\\n lists:flatten( [expansion_individual(io_lib:fread(\\\"~d\\\", X)) || X <- string:tokens(String, \\\",\\\")] ).\\n\\ntask() ->\\n io:fwrite( \\\"~p~n\\\", [expansion(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")] ).\\n\\n\\n\\nexpansion_individual( {ok, [N], []} ) -> N;\\nexpansion_individual( {ok, [Start], \\\"-\\\" ++ Stop_string} ) -> lists:seq( Start, erlang:list_to_integer(Stop_string) ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"open System.Text.RegularExpressions\\n\\n// simplify regex matching with an active pattern\\nlet (|Regexp|_|) pattern txt =\\n match Regex.Match(txt, pattern) with\\n | m when m.Success -> [for g in m.Groups -> g.Value] |> List.tail |> Some\\n | _ -> None\\n\\n// Parse and expand a single range description.\\n// string -> int list\\nlet parseRange r =\\n match r with\\n | Regexp @\\\"^(-?\\\\d+)-(-?\\\\d+)$\\\" [first; last] -> [int first..int last]\\n | Regexp @\\\"^(-?\\\\d+)$\\\" [single] -> [int single]\\n | _ -> failwithf \\\"illegal range format: %s\\\" r\\n\\n\\nlet expand (desc:string) =\\n desc.Split(',')\\n |> List.ofArray\\n |> List.collect parseRange\\n\\nprintfn \\\"%A\\\" (expand \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: kernel math.parser math.ranges prettyprint regexp\\nsequences sequences.extras splitting ;\\n\\n: expand ( str -- seq )\\n \\\",\\\" split [\\n R/ (?<=\\\\d)-/ re-split [ string>number ] map\\n dup length 2 = [ first2 [a,b] ] when\\n ] map-concat ;\\n\\n\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\" expand .\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": >snumber ( str len -- 'str 'len n )\\n 0. 2swap\\n over c@ [char] - = if\\n 1 /string\\n >number 2swap drop\\n negate\\n else\\n >number 2swap drop\\n then ;\\n\\n: expand ( str len -- )\\n begin dup while\\n >snumber >r\\n dup if over c@ [char] - = if\\n 1 /string\\n >snumber r> over >r\\n do i . loop\\n then then\\n dup if over c@ [char] , = if\\n 1 /string\\n then then\\n r> .\\n repeat 2drop ;\\n\\ns\\\" -6,-3--1,3-5,7-11,14,15,17-20\\\" expand\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" MODULE HOMEONTHERANGE\\n CONTAINS\\t!The key function.\\n CHARACTER*200 FUNCTION ERANGE(TEXT)\\t!Expands integer ranges in a list.\\nCan't return a character value of variable size.\\n CHARACTER*(*) TEXT\\t!The list on input.\\n CHARACTER*200 ALINE\\t!Scratchpad for output.\\n INTEGER N,N1,N2\\t!Numbers in a range.\\n INTEGER I,I1\\t\\t!Steppers.\\n ALINE = \\\"\\\"\\t\\t!Scrub the scratchpad.\\n L = 0\\t\\t\\t!No text has been placed.\\n I = 1\\t\\t\\t!Start at the start.\\n CALL FORASIGN\\t\\t!Find something to look at.\\nChug through another number or number - number range.\\n R:DO WHILE(EATINT(N1))\\t!If I can grab a first number, a term has begun.\\n N2 = N1\\t\\t\\t!Make the far end the same.\\n IF (PASSBY(\\\"-\\\")) CALL EATINT(N2)\\t!A hyphen here is not a minus sign.\\n IF (L.GT.0) CALL EMIT(\\\",\\\")\\t\\t!Another, after what went before?\\n DO N = N1,N2,SIGN(+1,N2 - N1)\\t!Step through the range, possibly backwards.\\n CALL SPLOT(N)\\t\\t\\t\\t!Roll a number.\\n IF (N.NE.N2) CALL EMIT(\\\",\\\")\\t\\t!Perhaps another follows.\\n END DO\\t\\t\\t\\t!On to the next number.\\n IF (.NOT.PASSBY(\\\",\\\")) EXIT R\\t!More to come?\\n END DO R\\t\\t!So much for a range.\\nCompleted the scan. Just return the result.\\n ERANGE = ALINE(1:L)\\t!Present the result. Fiddling ERANGE is bungled by some compilers.\\n CONTAINS\\t!Some assistants for the scan to save on repetition and show intent.\\n SUBROUTINE FORASIGN\\t!Look for one.\\n 1 IF (I.LE.LEN(TEXT)) THEN\\t!After a thingy,\\n IF (TEXT(I:I).LE.\\\" \\\") THEN\\t!There may follow spaces.\\n I = I + 1\\t\\t\\t\\t!So,\\n GO TO 1\\t\\t\\t\\t\\t!Speed past any.\\n END IF\\t\\t\\t!So that the caller can see\\n END IF\\t\\t\\t!Whatever substantive character follows.\\n END SUBROUTINE FORASIGN\\t!Simple enough.\\n\\n LOGICAL FUNCTION PASSBY(C)\\t!Advances the scan if a certain character is seen.\\nCould consider or ignore case for letters, but this is really for single symbols.\\n CHARACTER*1 C\\t!The character.\\n PASSBY = .FALSE.\\t!Pessimism.\\n IF (I.LE.LEN(TEXT)) THEN\\t!Can't rely on I.LE.LEN(TEXT) .AND. TEXT(I:I)...\\n IF (TEXT(I:I).EQ.C) THEN\\t!Curse possible full evaluation.\\n PASSBY = .TRUE.\\t\\t!Righto, C is seen.\\n I = I + 1\\t\\t!So advance the scan.\\n CALL FORASIGN\\t\\t!And see what follows.\\n END IF\\t\\t!So much for a match.\\n END IF\\t\\t!If there is something to be uinspected.\\n END FUNCTION PASSBY\\t!Can't rely on testing PASSBY within PASSBY either.\\n\\n LOGICAL FUNCTION EATINT(N)\\t!Convert text into an integer.\\n INTEGER N\\t!The value to be ascertained.\\n INTEGER D\\t!A digit.\\n LOGICAL NEG\\t!In case of a minus sign.\\n EATINT = .FALSE.\\t!Pessimism.\\n IF (I.GT.LEN(TEXT)) RETURN\\t!Anything to look at?\\n N = 0\\t\\t\\t!Scrub to start with.\\n IF (PASSBY(\\\"+\\\")) THEN\\t!A plus sign here can be ignored.\\n NEG = .FALSE.\\t\\t!So, there's no minus sign.\\n ELSE\\t\\t\\t!And if there wasn't a plus,\\n NEG = PASSBY(\\\"-\\\")\\t\\t!A hyphen here is a minus sign.\\n END IF\\t\\t\\t!One way or another, NEG is initialised.\\n IF (I.GT.LEN(TEXT)) RETURN\\t!Nothing further! We wuz misled!\\nChug through digits. Can develop -2147483648, thanks to the workings of two's complement.\\n 10 D = ICHAR(TEXT(I:I)) - ICHAR(\\\"0\\\")\\t!Hope for a digit.\\n IF (0.LE.D .AND. D.LE.9) THEN\\t!Is it one?\\n N = N*10 + D\\t\\t\\t!Yes! Assimilate it, negatively.\\n I = I + 1\\t\\t\\t\\t!Advance one.\\n IF (I.LE.LEN(TEXT)) GO TO 10\\t!And see what comes next.\\n END IF\\t\\t\\t!So much for a sequence of digits.\\n IF (NEG) N = -N\\t\\t!Apply the minus sign.\\n EATINT = .TRUE.\\t\\t!Should really check for at least one digit.\\n CALL FORASIGN\\t\\t!Ram into whatever follows.\\n END FUNCTION EATINT\\t!Integers are easy. Could check for no digits seen.\\n\\n SUBROUTINE EMIT(C)\\t!Rolls forth one character.\\n CHARACTER*1 C\\t!The character.\\n L = L + 1\\t\\t!Advance the finger.\\n IF (L.GT.LEN(ALINE)) STOP \\\"Ran out of ALINE!\\\"\\t!Maybe not.\\n ALINE(L:L) = C\\t!And place the character.\\n END SUBROUTINE EMIT\\t!That was simple.\\n\\n SUBROUTINE SPLOT(N)\\t!Rolls forth a signed number.\\n INTEGER N\\t\\t!The number.\\n CHARACTER*12 FIELD\\t!Sufficient for 32-bit integers.\\n INTEGER I\\t\\t!A stepper.\\n WRITE (FIELD,\\\"(I0)\\\") N\\t!Roll the number, with trailing spaces.\\n DO I = 1,12\\t\\t!Now transfer the ALINE of the number.\\n IF (FIELD(I:I).LE.\\\" \\\") EXIT\\t!Up to the first space.\\n CALL EMIT(FIELD(I:I))\\t!One by one.\\n END DO\\t\\t!On to the end.\\n END SUBROUTINE SPLOT\\t!Not so difficult either.\\n END FUNCTION ERANGE\\t!A bit tricky.\\n END MODULE HOMEONTHERANGE\\n\\n PROGRAM POKE\\n USE HOMEONTHERANGE\\n CHARACTER*(200) SOME\\n SOME = \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\n SOME = ERANGE(SOME)\\n WRITE (6,*) SOME\\t!If ERANGE(SOME) then the function usually can't write output also.\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nSub split (s As Const String, sepList As Const String, result() As String)\\n If s = \\\"\\\" OrElse sepList = \\\"\\\" Then\\n Redim result(0)\\n result(0) = s\\n Return\\n End If\\n Dim As Integer i, j, count = 0, empty = 0, length\\n Dim As Integer position(Len(s) + 1)\\n position(0) = 0\\n\\n For i = 0 To len(s) - 1\\n For j = 0 to Len(sepList) - 1\\n If s[i] = sepList[j] Then\\n count += 1\\n position(count) = i + 1\\n End If\\n Next j\\n Next i\\n\\n Redim result(count)\\n If count = 0 Then\\n result(0) = s\\n Return\\n End If\\n\\n position(count + 1) = len(s) + 1\\n\\n For i = 1 To count + 1\\n length = position(i) - position(i - 1) - 1\\n result(i - 1) = Mid(s, position(i - 1) + 1, length)\\n Next\\nEnd Sub\\n\\nFunction expandRange(s As Const String) As String\\n If s = \\\"\\\" Then Return \\\"\\\"\\n Dim b() As String\\n Dim c() As String\\n Dim result As String = \\\"\\\"\\n Dim As Integer start = 0, finish = 0, length\\n split s, \\\",\\\", b()\\n For i As Integer = LBound(b) To UBound(b)\\n split b(i), \\\"-\\\", c()\\n length = UBound(c) - LBound(c) + 1\\n If length = 1 Then\\n start = ValLng(c(LBound(c)))\\n finish = start\\n ElseIf length = 2 Then\\n If Left(b(i), 1) = \\\"-\\\" Then\\n start = -ValLng(c(UBound(c)))\\n finish = start\\n Else\\n start = ValLng(c(LBound(c)))\\n finish = ValLng(c(UBound(c)))\\n End If\\n ElseIf length = 3 Then\\n start = -ValLng(c(LBound(c) + 1))\\n finish = ValLng(c(UBound(c)))\\n Else\\n start = -ValLng(c(LBound(c) + 1))\\n finish = -ValLng(c(UBound(c)))\\n End If\\n For j As Integer = start To finish\\n result += Str(j) + \\\", \\\"\\n Next j\\n Next i\\n Return Left(result, Len(result) - 2) '' get rid of final \\\", \\\"\\nEnd Function\\n\\nDim s As String = \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\nPrint expandRange(s)\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"strconv\\\"\\n \\\"strings\\\"\\n)\\n\\nconst input = \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\n\\nfunc main() {\\n fmt.Println(\\\"range:\\\", input)\\n var r []int\\n var last int\\n for _, part := range strings.Split(input, \\\",\\\") {\\n if i := strings.Index(part[1:], \\\"-\\\"); i == -1 {\\n n, err := strconv.Atoi(part)\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n if len(r) > 0 {\\n if last == n {\\n fmt.Println(\\\"duplicate value:\\\", n)\\n return\\n } else if last > n {\\n fmt.Println(\\\"values not ordered:\\\", last, \\\">\\\", n)\\n return\\n }\\n }\\n r = append(r, n)\\n last = n\\n } else {\\n n1, err := strconv.Atoi(part[:i+1])\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n n2, err := strconv.Atoi(part[i+2:])\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n if n2 < n1+2 {\\n fmt.Println(\\\"invalid range:\\\", part)\\n return\\n }\\n if len(r) > 0 {\\n if last == n1 {\\n fmt.Println(\\\"duplicate value:\\\", n1)\\n return\\n } else if last > n1 {\\n fmt.Println(\\\"values not ordered:\\\", last, \\\">\\\", n1)\\n return\\n }\\n }\\n for i = n1; i <= n2; i++ {\\n r = append(r, i)\\n }\\n last = n2\\n }\\n }\\n fmt.Println(\\\"expanded:\\\", r)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def expandRanges = { compressed ->\\n Eval.me('['+compressed.replaceAll(~/(\\\\d)-/, '$1..')+']').flatten().toString()[1..-2]\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def s = '-6,-3--1,3-5,7-11,14,15,17-20'\\nprintln (expandRanges(s))\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"> expandRange \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\n[-6,-3,-2,-1,3,4,5,7,8,9,10,11,14,15,17,18,19,20]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"expandRange :: String -> [Int]\\nexpandRange = concatMap f . split ','\\n where f str@(c : cs) | '-' `elem` cs = [read (c : a) .. read b]\\n | otherwise = [read str]\\n where (a, _ : b) = break (== '-') cs\\n\\nsplit :: Eq a => a -> [a] -> [[a]]\\nsplit delim [] = []\\nsplit delim l = a : split delim (dropWhile (== delim) b)\\n where (a, b) = break (== delim) l\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"{-# LANGUAGE FlexibleContexts #-}\\n\\nimport Text.Parsec\\n\\nexpandRange :: String -> Maybe [Int]\\nexpandRange =\\n either\\n (const Nothing)\\n Just\\n . parse rangeParser \\\"\\\"\\n\\nrangeParser ::\\n (Enum a, Read a, Stream s m Char) =>\\n ParsecT s u m [a]\\nrangeParser = concat <$> (item `sepBy` char ',')\\n where\\n item = do\\n n1 <- num\\n n2 <- option n1 (char '-' *> num)\\n return [n1 .. n2]\\n num =\\n read `dot` (<>) <$> option \\\"\\\" (string \\\"-\\\")\\n <*> many1 digit\\n dot = (.) . (.)\\n\\nmain :: IO ()\\nmain = print $ expandRange \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\ns := \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\nwrite(\\\"Input string := \\\",s)\\nwrite(\\\"Expanded list := \\\", list2string(range_expand(s)) | \\\"FAILED\\\")\\nend\\n\\nprocedure range_expand(s) #: return list of integers extracted from an ordered string representation\\nlocal R,low,high\\nR := []\\n\\ns ? until pos(0) do {\\n put(R,low := integer(tab(upto(',-')|0))| fail) # get lower bound\\n if =\\\"-\\\" || (high := integer(tab(find(\\\",\\\")|0))|fail) then\\n until low = high do put(R,low +:= 1) # find range\\n =\\\",\\\"\\n }\\nreturn R\\nend\\n\\nprocedure list2string(L) #: helper function to convert a list to a string\\nlocal s\\n\\n every (s := \\\"[ \\\") ||:= !L || \\\" \\\"\\n return s || \\\"]\\\"\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"require'strings'\\nthru=: <. + i.@(+*)@-~\\nnum=: _&\\\".\\nnormaliz=: rplc&(',-';',_';'--';'-_')@,~&','\\nsubranges=:<@(thru/)@(num;._2)@,&'-';._1\\nrngexp=: ;@subranges@normaliz\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" rngexp '-6,-3--1,3-5,7-11,14,15,17-20'\\n_6 _3 _2 _1 3 4 5 7 8 9 10 11 14 15 17 18 19 20\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.*;\\n\\nclass RangeExpander implements Iterator<Integer>, Iterable<Integer> {\\n\\n private static final Pattern TOKEN_PATTERN = Pattern.compile(\\\"([+-]?\\\\\\\\d+)-([+-]?\\\\\\\\d+)\\\");\\n\\n private final Iterator<String> tokensIterator;\\n\\n private boolean inRange;\\n private int upperRangeEndpoint;\\n private int nextRangeValue;\\n\\n public RangeExpander(String range) {\\n String[] tokens = range.split(\\\"\\\\\\\\s*,\\\\\\\\s*\\\");\\n this.tokensIterator = Arrays.asList(tokens).iterator();\\n }\\n\\n @Override\\n public boolean hasNext() {\\n return hasNextRangeValue() || this.tokensIterator.hasNext();\\n }\\n\\n private boolean hasNextRangeValue() {\\n return this.inRange && this.nextRangeValue <= this.upperRangeEndpoint;\\n }\\n\\n @Override\\n public Integer next() {\\n if (!hasNext()) {\\n throw new NoSuchElementException();\\n }\\n\\n if (hasNextRangeValue()) {\\n return this.nextRangeValue++;\\n }\\n\\n String token = this.tokensIterator.next();\\n\\n Matcher matcher = TOKEN_PATTERN.matcher(token);\\n if (matcher.find()) {\\n this.inRange = true;\\n this.upperRangeEndpoint = Integer.valueOf(matcher.group(2));\\n this.nextRangeValue = Integer.valueOf(matcher.group(1));\\n return this.nextRangeValue++;\\n }\\n\\n this.inRange = false;\\n return Integer.valueOf(token);\\n }\\n\\n @Override\\n public Iterator<Integer> iterator() {\\n return this;\\n }\\n\\n}\\n\\nclass RangeExpanderTest {\\n public static void main(String[] args) {\\n RangeExpander re = new RangeExpander(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\");\\n for (int i : re) {\\n System.out.print(i + \\\" \\\");\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"#!/usr/bin/env js\\n\\nfunction main() {\\n print(rangeExpand('-6,-3--1,3-5,7-11,14,15,17-20'));\\n}\\n\\nfunction rangeExpand(rangeExpr) {\\n\\n function getFactors(term) {\\n var matches = term.match(/(-?[0-9]+)-(-?[0-9]+)/);\\n if (!matches) return {first:Number(term)};\\n return {first:Number(matches[1]), last:Number(matches[2])};\\n }\\n\\n function expandTerm(term) {\\n var factors = getFactors(term);\\n if (factors.length < 2) return [factors.first];\\n var range = [];\\n for (var n = factors.first; n <= factors.last; n++) {\\n range.push(n);\\n }\\n return range;\\n }\\n\\n var result = [];\\n var terms = rangeExpr.split(/,/);\\n for (var t in terms) {\\n result = result.concat(expandTerm(terms[t]));\\n }\\n\\n return result;\\n}\\n\\nmain();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(function (strTest) {\\n 'use strict';\\n\\n // s -> [n]\\n function expansion(strExpr) {\\n\\n // concat map yields flattened output list\\n return [].concat.apply([], strExpr.split(',')\\n .map(function (x) {\\n return x.split('-')\\n .reduce(function (a, s, i, l) {\\n\\n // negative (after item 0) if preceded by an empty string\\n // (i.e. a hyphen-split artefact, otherwise ignored)\\n return s.length ? i ? a.concat(\\n parseInt(l[i - 1].length ? s :\\n '-' + s, 10)\\n ) : [+s] : a;\\n }, []);\\n\\n // two-number lists are interpreted as ranges\\n })\\n .map(function (r) {\\n return r.length > 1 ? range.apply(null, r) : r;\\n }));\\n }\\n\\n\\n // [m..n]\\n function range(m, n) {\\n return Array.apply(null, Array(n - m + 1))\\n .map(function (x, i) {\\n return m + i;\\n });\\n }\\n\\n return expansion(strTest);\\n\\n})('-6,-3--1,3-5,7-11,14,15,17-20');\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"[-6, -3, -2, -1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n \\\"use strict\\\";\\n\\n // ----------------- RANGE EXPANSION -----------------\\n\\n // rangeExpansion :: String -> [Int]\\n const rangeExpansion = rangeString =>\\n // A list of integers parsed from a\\n // comma-delimited string which may include\\n // (rising) hyphenated ranges.\\n rangeString.split(\\\",\\\")\\n .flatMap(x => {\\n const ns = x.split(\\\"-\\\")\\n .reduce((a, s, i, xs) =>\\n Boolean(s) ? (\\n 0 < i ? a.concat(\\n parseInt(\\n xs[i - 1].length ? (\\n s\\n ) : `-${s}`,\\n 10\\n )\\n ) : [Number(s)]\\n ) : a,\\n []\\n );\\n\\n return 2 === ns.length ? (\\n uncurry(enumFromTo)(ns)\\n ) : ns;\\n });\\n\\n\\n // ---------------------- TEST -----------------------\\n // main :: IO ()\\n const main = () =>\\n rangeExpansion(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\");\\n\\n\\n // --------------------- GENERIC ---------------------\\n\\n // enumFromTo :: Int -> Int -> [Int]\\n const enumFromTo = m =>\\n n => Array.from({\\n length: 1 + n - m\\n }, (_, i) => m + i);\\n\\n\\n // uncurry :: (a -> b -> c) -> ((a, b) -> c)\\n const uncurry = f =>\\n // A function over a pair, derived\\n // from a curried function.\\n (...args) => {\\n const [x, y] = Boolean(args.length % 2) ? (\\n args[0]\\n ) : args;\\n\\n return f(x)(y);\\n };\\n\\n\\n // MAIN ---\\n return JSON.stringify(main());\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def expand_range:\\n def number: \\\"-?[0-9]+\\\";\\n def expand: [range(.[0]; .[1] + 1)];\\n\\n split(\\\",\\\")\\n | reduce .[] as $r\\n ( []; . +\\n ($r | if test(\\\"^\\\\(number)$\\\") then [tonumber]\\n else sub( \\\"(?<x>\\\\(number))-(?<y>\\\\(number))\\\"; \\\"\\\\(.x):\\\\(.y)\\\")\\n | split(\\\":\\\") | map(tonumber) | expand\\n\\t end));\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\" | expand_range\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"#!/usr/bin/env jsish\\n\\\"use strict\\\";\\n\\n/* Range expansion, in Jsish */\\nfunction rangeExpand(rangeExpr) {\\n\\n function getFactors(term) {\\n var matches = term.match(/(-?[0-9]+)-(-?[0-9]+)/);\\n if (!matches) return {first:Number(term)};\\n return {first:Number(matches[1]), last:Number(matches[2])};\\n }\\n\\n function expandTerm(term) {\\n var factors = getFactors(term);\\n if (factors.length < 2) return [factors.first];\\n var range = [];\\n for (var n = factors.first; n <= factors.last; n++) {\\n range.push(n);\\n }\\n return range;\\n }\\n\\n var result = [];\\n var terms = rangeExpr.split(\\\",\\\");\\n for (var t in terms) {\\n result = result.concat(expandTerm(terms[t]));\\n }\\n\\n return result;\\n}\\n\\nif (Interp.conf('unitTest')) {\\n; rangeExpand('-6,-3--1,3-5,7-11,14,15,17-20');\\n}\\n\\n/*\\n=!EXPECTSTART!=\\nrangeExpand('-6,-3--1,3-5,7-11,14,15,17-20') ==> [ -6, -3, -2, -1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20 ]\\n=!EXPECTEND!=\\n*/\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"slurp(s) = readcsv(IOBuffer(s))\\n\\nconv(s)= colon(map(x->parse(Int,x),match(r\\\"^(-?\\\\d+)-(-?\\\\d+)$\\\", s).captures)...)\\n\\nexpand(s) = mapreduce(x -> isa(x,Number)? Int(x) : conv(x), vcat, slurp(s))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"grp : {1_'(&x=*x)_ x:\\\",\\\",x}\\npos : {:[3=l:#p:&\\\"-\\\"=x;0,p@1;2=l;p;0=*p;,0;0,p]}\\nconv: 0${(x;1_ y)}/'{(pos x)_ x}'\\nexpd: {,/@[x;&2=#:'x;{(*x)+!1+,/-':x}]}\\nrnge: {expd@conv grp x}\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \" rnge \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\n-6 -3 -2 -1 3 4 5 7 8 9 10 11 14 15 17 18 19 20\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nfun expandRange(s: String): MutableList<Int> {\\n val list = mutableListOf<Int>()\\n val items = s.split(',')\\n var first: Int\\n var last: Int\\n for (item in items) {\\n val count = item.count { it == '-' }\\n if (count == 0 || (count == 1 && item[0] == '-'))\\n list.add(item.toInt())\\n else {\\n val items2 = item.split('-')\\n if (count == 1) {\\n first = items2[0].toInt()\\n last = items2[1].toInt()\\n }\\n else if (count == 2) {\\n first = items2[1].toInt() * -1\\n last = items2[2].toInt()\\n }\\n else {\\n first = items2[1].toInt() * -1\\n last = items2[3].toInt() * -1\\n }\\n for (i in first..last) list.add(i)\\n }\\n }\\n return list\\n}\\n\\nfun main(args: Array<String>) {\\n val s = \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\n println(expandRange(s))\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"define range_expand(expression::string) => {\\n local(parts) = regexp(`^(-?\\\\d+)-(-?\\\\d+)$`)\\n\\n return (\\n with elm in #expression->split(`,`)\\n let isRange = #parts->setInput(#elm)&matches\\n select #isRange\\n ? (integer(#parts->matchString(1)) to integer(#parts->matchString(2)))->asString\\n | integer(#elm)->asString\\n )->join(', ')\\n}\\n\\nrange_expand(`-6,-3--1,3-5,7-11,14,15,17-20`)\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"print ExpandRange$( \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\nend\\n\\nfunction ExpandRange$( compressed$)\\n for i = 1 to ItemCount( compressed$, \\\",\\\")\\n item$ = word$( compressed$, i, \\\",\\\")\\n dash = instr( item$, \\\"-\\\", 2) 'dash that is not the first character, is a separator\\n if dash then\\n for k = val( left$( item$, dash - 1)) to val( mid$( item$, dash + 1))\\n ExpandRange$ = ExpandRange$ + str$( k) + \\\",\\\"\\n next k\\n else\\n ExpandRange$ = ExpandRange$ + item$ + \\\",\\\"\\n end if\\n next i\\n ExpandRange$ = left$( ExpandRange$, len( ExpandRange$) - 1)\\nend function\\n\\nfunction ItemCount( list$, separator$)\\n while word$(list$, ItemCount + 1, separator$) <> \\\"\\\"\\n ItemCount = ItemCount + 1\\n wend\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"-- Note: currently does not support extra white space in input string\\non expandRange (str)\\n res = \\\"\\\"\\n _player.itemDelimiter = \\\",\\\"\\n cnt = str.item.count\\n repeat with i = 1 to cnt\\n part = str.item[i]\\n pos = offset(\\\"-\\\", part.char[2..part.length])\\n if pos>0 then\\n a = integer(part.char[1..pos])\\n b = integer(part.char[pos+2..part.length])\\n repeat with j = a to b\\n put j&\\\",\\\" after res\\n end repeat\\n else\\n put part&\\\",\\\" after res\\n end if\\n end repeat\\n delete the last char of res\\n return res\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"put expandRange(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n-- \\\"-6,-3,-2,-1,3,4,5,7,8,9,10,11,14,15,17,18,19,20\\\"\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"function range beginning ending stepping\\n local tRange, tBegin, tEnd, tstep\\n if stepping is empty or stepping is 0 then\\n put 1 into tstep\\n else\\n put abs(stepping) into tstep\\n end if\\n\\n if ending is empty or isNumber(ending) is not true then\\n put 0 into tEnd\\n else\\n put ending into tEnd\\n end if\\n\\n if beginning is empty or isNumber(beginning) is not true then\\n put 0 into tBegin\\n else\\n put beginning into tBegin\\n end if\\n\\n repeat with r = tBegin to tEnd step tstep\\n put space & r after tRange\\n end repeat\\n return word 1 to -1 of tRange\\nend range\\n\\nfunction expandRange rangeExpr\\n put rangeExpr into tRange\\n split tRange by comma\\n repeat with n = 1 to the number of elements of tRange\\n if matchText(tRange[n],\\\"^(\\\\-*\\\\d+)\\\\-(\\\\-*\\\\d+)\\\",beginning, ending) then\\n put range(beginning, ending, 1) & space after z\\n else\\n put tRange[n] & space after z\\n end if\\n end repeat\\n return z\\nend expandRange\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"expandRange(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n-6 -3 -2 -1 3 4 5 7 8 9 10 11 14 15 17 18 19 20\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"function range(i, j)\\n local t = {}\\n for n = i, j, i<j and 1 or -1 do\\n t[#t+1] = n\\n end\\n return t\\nend\\n\\nfunction expand_ranges(rspec)\\n local ptn = \\\"([-+]?%d+)%s?-%s?([-+]?%d+)\\\"\\n local t = {}\\n\\n for v in string.gmatch(rspec, '[^,]+') do\\n local s, e = v:match(ptn)\\n\\n if s == nil then\\n t[#t+1] = tonumber(v)\\n else\\n for i, n in ipairs(range(tonumber(s), tonumber(e))) do\\n t[#t+1] = n\\n end\\n end\\n end\\n return t\\nend\\n\\nlocal ranges = \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\nprint(table.concat(expand_ranges(ranges), ', '))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"ExpandRanges := proc( s :: string )\\n uses StringTools;\\n local DoOne := proc( input )\\n uses StringTools;\\n local lo, hi, pos;\\n if IsDigit( input ) or input[ 1 ] = \\\"-\\\"\\n and IsDigit( input[ 2 .. -1 ] ) then\\n parse( input )\\n else\\n pos := Search( \\\"--\\\", input );\\n if pos > 0 then\\n lo := input[ 1 .. pos - 1 ];\\n hi := input[ 1 + pos .. -1 ];\\n elif input[ 1 ] = \\\"-\\\" then\\n pos := FirstFromLeft( \\\"-\\\", input[ 2 .. -1 ] );\\n if pos = 0 then\\n lo := input;\\n hi := lo\\n else\\n lo := input[ 1 .. pos ];\\n hi := input[ 2 + pos .. -1 ];\\n end if;\\n else\\n pos := FirstFromLeft( \\\"-\\\", input );\\n if pos = 0 then\\n error \\\"incorrect syntax\\\"\\n end if;\\n lo := input[ 1 .. pos - 1 ];\\n hi := input[ 1 + pos .. -1 ];\\n end if;\\n lo := parse( lo );\\n hi := parse( hi );\\n seq( lo .. hi )\\n end if\\n end proc:\\n map( DoOne, map( Trim, Split( s, \\\",\\\" ) ) )\\nend proc:\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"> rng := \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\":\\n> ExpandRanges( rng );\\n [-6, -3, -2, -1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"> rng := \\\"-6,-3-1,3-5,7-11,14,15,17-20\\\":\\n> ExpandRanges( rng );\\n[-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"rangeexpand[ rng_ ] := Module[ { step1 },\\nstep1 = StringSplit[StringReplacePart[rng,\\\"S\\\",StringPosition[ rng,DigitCharacter~~\\\"-\\\"] /. {x_,y_} -> {y,y}],\\\",\\\"];\\nFlatten@ToExpression/@Quiet@StringReplace[step1,x__~~\\\"S\\\"~~y__->\\\"Range[\\\"<>x<>\\\",\\\"<>y<>\\\"]\\\"] ]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function L=range_expansion(S)\\n% Range expansion\\nif nargin < 1;\\n\\tS='[]';\\nend\\n\\nif ~all(isdigit(S) | (S=='-') | (S==',') | isspace(S))\\n\\terror 'invalid input';\\nend\\nixr = find(isdigit(S(1:end-1)) & S(2:end) == '-')+1;\\nS(ixr)=':';\\nS=['[',S,']'];\\nL=eval(S);\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"pullInt = function(chars)\\n numstr = chars.pull\\n while chars and chars[0] != \\\",\\\" and chars[0] != \\\"-\\\"\\n numstr = numstr + chars.pull\\n end while\\n return val(numstr)\\nend function\\n\\nexpandRange = function(s)\\n result = []\\n chars = s.split(\\\"\\\")\\n while chars\\n num = pullInt(chars)\\n if not chars or chars.pull == \\\",\\\" then\\n result.push num\\n else\\n result = result + range(num, pullInt(chars))\\n chars.pull // skip \\\",\\\" after range\\n end if\\n end while\\n return result\\nend function\\n\\nprint expandRange(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"RANGEXP(X) ;Integer range expansion\\n NEW Y,I,J,X1,H SET Y=\\\"\\\"\\n FOR I=1:1:$LENGTH(X,\\\",\\\") DO\\n .S X1=$PIECE(X,\\\",\\\",I) FOR Q:$EXTRACT(X1)'=\\\" \\\" S X1=$EXTRACT(X1,2,$LENGTH(X1)) ;clean up leading spaces\\n .SET H=$FIND(X1,\\\"-\\\")-1\\n .IF H=1 SET H=$FIND(X1,\\\"-\\\",(H+1))-1 ;If the first value is negative ignore that \\\"-\\\"\\n .IF H<0 SET Y=$SELECT($LENGTH(Y)=0:Y_X1,1:Y_\\\",\\\"_X1)\\n .IF '(H<0) FOR J=+$EXTRACT(X1,1,(H-1)):1:+$EXTRACT(X1,(H+1),$LENGTH(X1)) SET Y=$SELECT($LENGTH(Y)=0:J,1:Y_\\\",\\\"_J)\\n KILL I,J,X1,H\\n QUIT Y\\n\",\n \"language\": \"MUMPS\"\n },\n {\n \"code\": \"/*NetRexx program to expand a range of integers into a list. *************\\n* 09.08.2012 Walter Pachl derived from my Rexx version\\n* Changes: translate(old,' ',',') -> old.translate(' ',',')\\n* dashpos=pos('-',x,2) -> dashpos=x.pos('-',2)\\n* Do -> Loop\\n* Parse Var a x a -> Parse a x a\\n* Parse Var x ... -> Parse x ...\\n**********************************************************************/\\n\\nparse arg old\\nif old = '' then\\n old='-6,-3--1,3-5,7-11,14,15,17-20' /*original list of nums/ranges */\\n\\n Say 'old='old /*show old list of nums/ranges. */\\n a=old.translate(' ',',') /*translate commas to blanks */\\n new='' /*new list of numbers (so far). */\\n\\n comma=''\\n Loop While a<>'' /* as long as there is input */\\n Parse a x a /* get one element */\\n dashpos=x.pos('-',2) /* find position of dash, if any */\\n If dashpos>0 Then Do /* element is low-high */\\n Parse x low =(dashpos) +1 high /* split the element */\\n Loop j=low To high /* output all numbers in range */\\n new=new||comma||j /* with separating commas */\\n comma=',' /* from now on use comma */\\n End\\n End\\n Else Do /* element is a number */\\n new=new||comma||x /* append (with comma) */\\n comma=',' /* from now on use comma */\\n End\\n End\\n Say 'new='new /*show the expanded list */\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"import parseutils, strutils\\n\\nproc expandRange(input: string): string =\\n var output: seq[string]\\n for range in input.split(','):\\n var sep = range.find('-', 1)\\n if sep > 0: # parse range\\n var first = -1\\n if range.substr(0, sep-1).parseInt(first) == 0:\\n break\\n var last = -1\\n if range.substr(sep+1).parseInt(last) == 0:\\n break\\n for i in first..last:\\n output.add($i)\\n else: # parse single number\\n var n = -1\\n if range.parseInt(n) > 0:\\n output.add($n)\\n else:\\n break\\n return output.join(\\\",\\\")\\n\\necho(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\".expandRange)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"MODULE LIVector;\\nIMPORT SYSTEM;\\nTYPE\\n\\tLIPool = POINTER TO ARRAY OF LONGINT;\\n\\tLIVector*= POINTER TO LIVectorDesc;\\n\\tLIVectorDesc = RECORD\\n\\t\\tcap-: INTEGER;\\n\\t\\tlen-: INTEGER;\\n\\t\\tLIPool: LIPool;\\n\\tEND;\\n\\t\\n\\tPROCEDURE (v: LIVector) Init*(cap: INTEGER);\\n\\tBEGIN\\n\\t\\tv.cap := cap;\\n\\t\\tv.len := 0;\\n\\t\\tNEW(v.LIPool,cap);\\n\\tEND Init;\\n\\t\\n\\tPROCEDURE (v: LIVector) Add*(x: LONGINT);\\n\\tVAR\\n\\t\\tnewLIPool: LIPool;\\n\\tBEGIN\\n\\t\\tIF v.len = LEN(v.LIPool^) THEN\\n\\t\\t\\t(* run out of space *)\\n\\t\\t\\tv.cap := v.cap + (v.cap DIV 2);\\n\\t\\t\\tNEW(newLIPool,v.cap);\\n\\t\\t\\tSYSTEM.MOVE(SYSTEM.ADR(v.LIPool^),SYSTEM.ADR(newLIPool^),v.cap * SIZE(LONGINT));\\n\\t\\t\\tv.LIPool := newLIPool\\n\\t\\tEND;\\n\\t\\tv.LIPool[v.len] := x;\\n\\t\\tINC(v.len)\\n\\tEND Add;\\n\\t\\n\\tPROCEDURE (v: LIVector) At*(idx: INTEGER): LONGINT;\\n\\tBEGIN\\n\\t\\tRETURN v.LIPool[idx];\\n\\tEND At;\\nEND LIVector.\\n\\nMODULE LIRange;\\nIMPORT Out, LIV := LIVector;\\n\\nTYPE\\n\\tRange* = POINTER TO RangeDesc;\\n\\tRangeDesc = RECORD\\n\\t\\tl,r: POINTER TO ARRAY 1 OF LONGINT;\\n\\tEND;\\n\\t\\n\\tPROCEDURE (r: Range) Init*();\\n\\tBEGIN\\n\\t\\tr.l := NIL;\\n\\t\\tr.r := NIL;\\n\\tEND Init;\\n\\t\\n\\tPROCEDURE (r: Range) IsEmpty*(): BOOLEAN;\\n\\tBEGIN\\n\\t\\tRETURN (r.l = NIL) & (r.l = NIL);\\n\\tEND IsEmpty;\\n\\t\\n\\tPROCEDURE (r: Range) SetLeft*(v: LONGINT);\\n\\tBEGIN\\n\\t\\tIF r.l = NIL THEN NEW(r.l) END;\\n\\t\\tr.l[0] := v;\\n\\tEND SetLeft;\\n\\t\\n\\tPROCEDURE (r: Range) SetRight*(v : LONGINT);\\n\\tBEGIN\\n\\t\\tIF r.r = NIL THEN NEW(r.r) END;\\n\\t\\tr.r[0] := v;\\n\\tEND SetRight;\\n\\t\\n\\tPROCEDURE (r: Range) LeftPart*(): BOOLEAN;\\n\\tBEGIN\\n\\t\\tRETURN r.l # NIL;\\n\\tEND LeftPart;\\n\\t\\n\\tPROCEDURE (r: Range) GetLeft(): LONGINT;\\n\\tBEGIN\\n\\t\\tRETURN r.l[0];\\n\\tEND\\tGetLeft;\\n\\t\\n\\tPROCEDURE (r: Range) RightPart*(): BOOLEAN;\\n\\tBEGIN\\n\\t\\tRETURN r.l # NIL;\\n\\tEND RightPart;\\n\\t\\n\\tPROCEDURE (r: Range) GetRight*(): LONGINT;\\n\\tBEGIN\\n\\t\\tRETURN r.r[0];\\n\\tEND\\tGetRight;\\n\\t\\n\\tPROCEDURE (r: Range) Show*();\\n\\tBEGIN\\n\\t\\tOut.Char('(');\\n\\t\\tIF r.l # NIL THEN Out.LongInt(r.l[0],10) END;\\n\\t\\tOut.String(\\\" - \\\");\\n\\t\\tIF r.r # NIL THEN Out.LongInt(r.r[0],10); END;\\n\\t\\tOut.Char(')');Out.Ln\\n\\tEND Show;\\n\\t\\n\\tPROCEDURE (r: Range) Expand*(VAR liv: LIV.LIVector);\\n\\tVAR\\n\\t\\tfrom, to : LONGINT;\\n\\tBEGIN\\n\\t\\tIF r.l # NIL THEN from := r.l[0] ELSE from := 0 END;\\n\\t\\tIF r.r # NIL THEN to := r.r[0] ELSE to := from END;\\n\\t\\tWHILE (from <= to) DO\\n\\t\\t\\tliv.Add(from);INC(from)\\n\\t\\tEND\\n\\tEND Expand;\\nEND LIRange.\\n\\nMODULE Splitter;\\nTYPE\\n\\tSplitter* = POINTER TO SplitterDesc;\\n\\tSplitterDesc = RECORD\\n\\t\\tfrom: INTEGER;\\n\\t\\tc: CHAR;\\n\\t\\ts: POINTER TO ARRAY OF CHAR;\\n\\tEND;\\n\\t\\n\\tPROCEDURE (s: Splitter) Init*;\\n\\tBEGIN\\n\\t\\ts.c := ',';\\n\\t\\ts.from := 0;\\n\\t\\ts.s := NIL;\\n\\tEND Init;\\n\\t\\n\\tPROCEDURE (s: Splitter) On*(str: ARRAY OF CHAR);\\n\\tBEGIN\\n\\t\\ts.from := 0;\\n\\t\\tNEW(s.s,LEN(str));\\n\\t\\tCOPY(str,s.s^)\\n\\tEND On;\\n\\t\\n\\tPROCEDURE (s: Splitter) OnWithChar*(str: ARRAY OF CHAR;c: CHAR);\\n\\tBEGIN\\n\\t\\ts.from := 0;\\n\\t\\ts.c := c;\\n\\t\\tNEW(s.s,LEN(str));\\n\\t\\tCOPY(str,s.s^)\\n\\tEND OnWithChar;\\n\\t\\n\\tPROCEDURE (s: Splitter) Next*(VAR str: ARRAY OF CHAR);\\n\\tVAR\\n\\t\\tk : INTEGER;\\t\\n\\tBEGIN\\n\\t\\tk := 0;\\n\\t\\tIF (s.from < LEN(s.s^) - 1) & (s.s[s.from] = 0X) THEN str[0] := 0X END;\\n\\t\\tWHILE (k < LEN(str) - 1) & (s.from < LEN(s.s^) - 1) & (s.s[s.from] # s.c) DO\\n\\t\\t\\tstr[k] := s.s[s.from];\\n\\t\\t\\tINC(k);INC(s.from)\\n\\t\\tEND;\\n\\t\\tIF k < LEN(str) - 1 THEN str[k] := 0X ELSE str[LEN(str) - 1] := 0X END;\\n\\t\\tWHILE (s.from < LEN(s.s^) - 1) & (s.s[s.from] # s.c) DO INC(s.from) END;\\n\\t\\tINC(s.from)\\n\\tEND Next;\\nEND Splitter.\\n\\nMODULE ExpandRange;\\nIMPORT Out, LIV := LIVector, LIR := LIRange, S := Splitter;\\n\\nPROCEDURE GetNumberFrom(s: ARRAY OF CHAR; VAR from: INTEGER; VAR done: BOOLEAN): LONGINT;\\nVAR\\n\\td,i: INTEGER;\\n\\tnum,sign: LONGINT;\\nBEGIN\\n\\ti := from; num := 0;sign := 1;\\n\\tCASE s[i] OF\\n\\t\\t '-': sign := -1;INC(i)\\n\\t\\t|'+': INC(i);\\n\\t\\tELSE\\n\\tEND;\\n\\tWHILE (i < LEN(s) - 1) & (s[i] >= '0') & (s[i] <= '9') DO\\n\\t\\td := ORD(s[i]) - ORD('0');\\n\\t\\tnum := d + num * 10;\\n\\t\\tINC(i);\\n\\tEND;\\n\\tIF i = from THEN done := FALSE ELSE done := TRUE; from := i END;\\n\\tRETURN sign * num\\nEND GetNumberFrom;\\n\\nPROCEDURE GetRange(s: ARRAY OF CHAR): LIR.Range;\\nVAR\\n\\tr: LIR.Range;\\n\\ti: INTEGER;\\n\\tnum: LONGINT;\\n\\tdone: BOOLEAN;\\nBEGIN\\n\\ti := 0;NEW(r);r.Init();\\n\\tWHILE (i < LEN(s) - 1) & (s[i] = 20X) DO INC(i) END;\\n\\t(* Left value *)\\n\\tdone := FALSE;\\n\\tnum := GetNumberFrom(s,i,done);\\n\\tIF ~done THEN RETURN r END;\\n\\tr.SetLeft(num);\\n\\n\\tWHILE (i < LEN(s) - 1) & (s[i] = 20X) DO INC(i) END;\\n\\tCASE s[i] OF\\n\\t\\t '-' : INC(i);\\n\\t\\t| 0X : RETURN r;\\n\\t\\tELSE\\n\\tEND;\\n\\tWHILE (i < LEN(s) - 1) & (s[i] = 20X) DO INC(i) END;\\n\\t\\n\\t(* Right Value *)\\n\\tdone := FALSE;\\n\\tnum := GetNumberFrom(s,i,done);\\n\\tIF ~done THEN RETURN r END;\\n\\tr.SetRight(num);\\n\\tRETURN r;\\nEND GetRange;\\n\\nVAR\\n\\ti: INTEGER;\\n\\tr: LIR.Range;\\n\\tsp: S.Splitter;\\n\\tp : ARRAY 128 OF CHAR;\\n\\tliv: LIV.LIVector;\\nBEGIN\\n\\tNEW(sp);sp.Init();\\n\\tNEW(liv);liv.Init(128);\\n\\n\\tsp.On(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\");\\n\\tsp.Next(p);\\n\\tWHILE (p[0] # 0X) DO\\n\\t\\tr := GetRange(p);\\n\\t\\tr.Expand(liv);\\n\\t\\tsp.Next(p);\\n\\tEND;\\n\\tFOR i := 0 TO liv.len - 2 DO\\n\\t\\tOut.LongInt(liv.At(i),3);Out.Char(',');\\n\\tEND;\\n\\tOut.LongInt(liv.At(liv.len - 1),3);Out.Ln;\\nEND ExpandRange.\\n\",\n \"language\": \"Oberon\"\n },\n {\n \"code\": \"#load \\\"str.cma\\\"\\n\\nlet range a b =\\n if b < a then invalid_arg \\\"range\\\";\\n let rec aux i acc =\\n if i = b then List.rev (i::acc)\\n else aux (succ i) (i::acc)\\n in\\n aux a []\\n\\nlet parse_piece s =\\n try Scanf.sscanf s \\\"%d-%d\\\" (fun a b -> range a b)\\n with _ -> [int_of_string s]\\n\\nlet range_expand rng =\\n let ps = Str.split (Str.regexp_string \\\",\\\") rng in\\n List.flatten (List.map parse_piece ps)\\n\\nlet () =\\n let rng = \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\" in\\n let exp = range_expand rng in\\n List.iter (Printf.printf \\\" %d\\\") exp;\\n print_newline ()\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \": addRange( s res -- )\\n| i n |\\n s asInteger dup ifNotNull: [ res add return ] drop\\n s indexOfFrom('-', 2) ->i\\n s left( i 1- ) asInteger s right( s size i - ) asInteger\\n for: n [ n res add ]\\n;\\n\\n: rangeExpand ( s -- [ n ] )\\n ArrayBuffer new s wordsWith( ',' ) apply( #[ over addRange ] ) ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"list = '-6,-3--1,3-5,7-11,14,15,17-20'\\nexpanded = expandRanges(list)\\n\\nsay \\\"Original list: [\\\"list\\\"]\\\"\\nsay \\\"Expanded list: [\\\"expanded~tostring(\\\"l\\\", \\\",\\\")\\\"]\\\"\\n\\n-- expand a string expression a range of numbers into a list\\n-- of values for the range. This returns an array\\n::routine expandRanges\\n use strict arg list\\n values = list~makearray(',')\\n -- build this up using an array first. Make this at least the\\n -- size of the original value set.\\n expanded = .array~new(values~items)\\n\\n -- now process each element in the range\\n loop element over values\\n -- if this is a valid number, it's not a range, so add it directly\\n if element~datatype('whole') then expanded~append(element)\\n else do\\n -- search for the divider, starting from the second position\\n -- to allow for the starting value to be a minus sign.\\n split = element~pos('-', 2)\\n parse var element start =(split) +1 finish\\n loop i = start to finish\\n expanded~append(i)\\n end\\n end\\n end\\n return expanded\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"declare\\n fun {Expand RangeDesc}\\n {Flatten\\n {Map {ParseDesc RangeDesc}\\n ExpandRange}}\\n end\\n\\n fun {ParseDesc Txt}\\n {Map {String.tokens Txt &,} ParseRange}\\n end\\n\\n fun {ParseRange R}\\n if {Member &- R.2} then\\n First Second\\n in\\n {String.token R.2 &- ?First ?Second}\\n {String.toInt R.1|First}#{String.toInt Second}\\n else\\n Singleton = {String.toInt R}\\n in\\n Singleton#Singleton\\n end\\n end\\n\\n fun {ExpandRange From#To}\\n {List.number From To 1}\\n end\\nin\\n {System.showInfo\\n {Value.toVirtualString {Expand \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"} 100 100}}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"[~6 ~3 ~2 ~1 3 4 5 7 8 9 10 11 14 15 17 18 19 20]\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"sub rangex {\\n map { /^(.*\\\\d)-(.+)$/ ? $1..$2 : $_ } split /,/, shift\\n}\\n\\n# Test and display\\nprint join(',', rangex('-6,-3--1,3-5,7-11,14,15,17-20')), \\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"sub rangex {\\n (my $range = shift) =~ s/(?<=\\\\d)-/../g;\\n eval $range;\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">range_expansion</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">range</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">range</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">','</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">si</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">'-'</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">si</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">to_number</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">si</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">startrange</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">to_number</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">si</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]),</span>\\n <span style=\\\"color: #000000;\\\">endofrange</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">to_number</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">si</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..$])</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">startrange</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">endofrange</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">range_expansion</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"-6,-3-1,3-5,7-11,14,15,17-20\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">range_expansion</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"0 tolist var r\\n\\ndef append\\n r swap 0 put var r\\nenddef\\n\\n\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\" \\\",\\\" \\\" \\\" subst split\\n\\nlen for\\n get dup tonum dup\\n nan == if\\n drop\\n dup len 1 - 2 swap slice\\n \\\"-\\\" find dup 2 + rot drop\\n rot rot 1 swap slice tonum\\n rot rot len rot swap over - 1 + slice tonum\\n nip rot drop\\n 2 tolist for append endfor\\n else\\n append drop\\n endif\\nendfor\\nr\\npstack\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"0 tolist var r\\n\\ndef append\\n r swap 0 put var r\\nenddef\\n\\n\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\" \\\",\\\" \\\" \\\" subst split\\n\\nlen for\\n get dup tonum dup\\n nan == if\\n drop\\n dup 32 1 set\\n \\\"-\\\" find nip\\n swap over 1 - 1 swap slice tonum\\n rot rot len rot swap over - swap 1 + swap slice tonum\\n nip 2 tolist for append endfor\\n else\\n append drop\\n endif\\nendfor\\nr\\npstack\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"0 tolist var r\\n\\ndef append\\n r swap 0 put var r\\nenddef\\n\\ndef getSeparator /# s -- s n #/\\n dup 32 1 set\\n \\\"-\\\" find nip\\nenddef\\n\\ndef first /# s n -- s n #/\\n swap over 1 - 1\\n swap slice tonum\\nenddef\\n\\ndef last /# s n -- s n #/\\n swap len rot swap over - swap 1 +\\n swap slice tonum\\nenddef\\n\\n\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\" \\\",\\\" \\\" \\\" subst split\\n\\nlen for\\n get dup tonum dup\\n nan == if\\n drop\\n getSeparator\\n first\\n rot rot swap\\n last\\n nip 2 tolist for append endfor\\n else\\n append drop\\n endif\\nendfor\\nr\\npstack\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"function rangex($str) {\\n $lst = array();\\n foreach (explode(',', $str) as $e) {\\n if (strpos($e, '-', 1) !== FALSE) {\\n list($a, $b) = explode('-', substr($e, 1), 2);\\n $lst = array_merge($lst, range($e[0] . $a, $b));\\n } else {\\n $lst[] = (int) $e;\\n }\\n }\\n return $lst;\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(de rangeexpand (Str)\\n (make\\n (for S (split (chop Str) \\\",\\\")\\n (if (index \\\"-\\\" (cdr S))\\n (chain\\n (range\\n (format (head @ S))\\n (format (tail (- -1 @) S)) ) )\\n (link (format S)) ) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"range_expansion:\\n procedure options (main);\\n\\nget_number:\\n procedure (Number, c, eof);\\n declare number fixed binary (31), c character (1), eof bit (1) aligned;\\n declare neg fixed binary (1);\\n\\n number = 0; eof = false;\\n do until (c ^= ' ');\\n get edit (c) (a(1));\\n end;\\n if c = '-' then do; get edit (c) (a(1)); neg = -1; end; else neg = 1;\\n do forever;\\n select (c);\\n when ('0', '1', '2', '3', '4', '5', '6', '7', '8', '9')\\n number = number*10 + c;\\n when (',', '-') do; number = neg*number; return; end;\\n otherwise signal error;\\n end;\\n on endfile (sysin) go to exit;\\n get edit (c) (a(1));\\n end;\\nexit:\\n number = neg*number;\\n eof = true;\\nend get_Number;\\n\\n declare c character, (i, range_start, range_end) fixed binary (31);\\n declare eof bit (1) aligned;\\n declare true bit (1) value ('1'b), false bit (1) value ('0'b);\\n declare delimiter character (1) initial (' ');\\n declare out file output;\\n\\n open file (out) output title ('/out, type(text),recsize(80)');\\n do while (^eof);\\n call get_number(range_start, c, eof);\\n if c = '-' then /* we have a range */\\n do;\\n call get_number (range_end, c, eof);\\n do i = range_start to range_end;\\n put file (out) edit (delimiter, i) (a, f(3));\\n end;\\n end;\\n else\\n do;\\n put file (out) edit (delimiter, range_start) (a, f(3));\\n end;\\n delimiter = ',';\\n end;\\nend range_expansion;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"function range-expansion($array) {\\n function expansion($arr) {\\n if($arr) {\\n $arr = $arr.Split(',')\\n $arr | foreach{\\n $a = $_\\n $b, $c, $d, $e = $a.Split('-')\\n switch($a) {\\n $b {return $a}\\n \\\"-$c\\\" {return $a}\\n \\\"$b-$c\\\" {return \\\"$(([Int]$b)..([Int]$c))\\\"}\\n \\\"-$c-$d\\\" {return \\\"$(([Int]$(\\\"-$c\\\"))..([Int]$d))\\\"}\\n \\\"-$c--$e\\\" {return \\\"$(([Int]$(\\\"-$c\\\"))..([Int]$(\\\"-$e\\\")))\\\"}\\n }\\n }\\n } else {\\\"\\\"}\\n }\\n $OFS = \\\", \\\"\\n \\\"$(expansion $array)\\\"\\n $OFS = \\\" \\\"\\n}\\nrange-expansion \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"function Expand-Range\\n{\\n [CmdletBinding()]\\n [OutputType([int])]\\n Param\\n (\\n [Parameter(Mandatory=$true,\\n Position=0)]\\n [ValidateNotNullOrEmpty()]\\n [ValidatePattern('^[0-9,-]*$')]\\n [string]\\n $Range\\n )\\n\\n try\\n {\\n if ($Range -match '-,') # I'm not good enough to weed this case out with Regex\\n {\\n throw \\\"Input string was not in a correct format.\\\"\\n }\\n\\n [int[]]$output = $Range -split ',' | ForEach-Object {\\n\\n [int[]]$array = $_ -split '(?<=\\\\d)-'\\n\\n if ($array.Count -gt 1) # $array contains one or two elements\\n {\\n $array[0]..$array[1] # two elements = start and end of range\\n }\\n else\\n {\\n $array # one element = an integer\\n }\\n }\\n }\\n catch\\n {\\n throw \\\"Input string was not in a correct format.\\\"\\n }\\n\\n $output\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"(Expand-Range \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\") -join \\\", \\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"range_expand :-\\n\\tL = '-6,-3--1,3-5,7-11,14,15,17-20',\\n\\twriteln(L),\\n\\tatom_chars(L, LA),\\n\\textract_Range(LA, R),\\n\\tmaplist(study_Range, R, LR),\\n\\tpack_Range(LX, LR),\\n\\twriteln(LX).\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n% extract_Range(?In, ?Out)\\n% In : '-6,-3--1,3-5,7-11,14,15,17-20'\\n% Out : [-6], [-3--1], [3-5],[7-11], [14],[15], [17-20]\\n%\\nextract_Range([], []).\\n\\nextract_Range(X , [Range | Y1]) :-\\n\\tget_Range(X, U-U, Range, X1),\\n\\textract_Range(X1, Y1).\\n\\nget_Range([], Range-[], Range, []).\\nget_Range([','|B], Range-[], Range, B) :- !.\\n\\nget_Range([A | B], EC, Range, R) :-\\n\\tappend_dl(EC, [A | U]-U, NEC),\\n\\tget_Range(B, NEC, Range, R).\\n\\n\\nappend_dl(X-Y, Y-Z, X-Z).\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%\\n% study Range(?In, ?Out)\\n% In : [-6]\\n% Out : [-6,-6]\\n%\\n% In : [-3--1]\\n% Out : [-3, -1]\\n%\\nstudy_Range(Range1, [Deb, Deb]) :-\\n catch(number_chars(Deb, Range1), Deb, false).\\n\\nstudy_Range(Range1, [Deb, Fin]) :-\\n append(A, ['-'|B], Range1),\\n A \\\\= [],\\n number_chars(Deb, A),\\n number_chars(Fin, B).\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%\\n:- use_module(library(clpfd)).\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%\\n% Pack Range(?In, ?Out)\\n% In : -6,\\n% Out : [-6]\\n%\\n% In : -3, -2,-1\\n% Out : [-3,-1]\\n%\\npack_Range([],[]).\\n\\npack_Range([X|Rest],[[X | V]|Packed]):-\\n run(X,Rest, [X|V], RRest),\\n pack_Range(RRest,Packed).\\n\\n\\nrun(Fin,[Other|RRest], [Deb, Fin],[Other|RRest]):-\\n\\tFin #\\\\= Deb,\\n\\tFin #\\\\= Deb + 1,\\n\\tOther #\\\\= Fin+1.\\n\\nrun(Fin,[],[_Var, Fin],[]).\\n\\nrun(Var,[Var1|LRest],[Deb, Fin], RRest):-\\n\\tFin #\\\\= Deb,\\n\\tFin #\\\\= Deb + 1,\\n\\tVar1 #= Var + 1,\\n\\trun(Var1,LRest,[Deb, Fin], RRest).\\n\\nrun(Val,[Other|RRest], [Val, Val],[Other|RRest]).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Procedure rangeexpand(txt.s, List outputList())\\n Protected rangesCount = CountString(txt, \\\",\\\") + 1\\n Protected subTxt.s, r, rangeMarker, rangeStart, rangeFinish, rangeIncrement, i\\n\\n LastElement(outputList())\\n For r = 1 To rangesCount\\n subTxt = StringField(txt, r, \\\",\\\")\\n rangeMarker = FindString(subTxt, \\\"-\\\", 2)\\n If rangeMarker\\n rangeStart = Val(Mid(subTxt, 1, rangeMarker - 1))\\n rangeFinish = Val(Mid(subTxt, rangeMarker + 1))\\n\\n If rangeStart > rangeFinish\\n rangeIncrement = -1\\n Else\\n rangeIncrement = 1\\n EndIf\\n\\n i = rangeStart - rangeIncrement\\n Repeat\\n i + rangeIncrement\\n AddElement(outputList()): outputList() = i\\n Until i = rangeFinish\\n Else\\n AddElement(outputList()): outputList() = Val(subTxt)\\n EndIf\\n Next\\nEndProcedure\\n\\nProcedure outputListValues(List values())\\n Print(\\\"[ \\\")\\n ForEach values()\\n Print(Str(values()) + \\\" \\\")\\n Next\\n PrintN(\\\"]\\\")\\nEndProcedure\\n\\nIf OpenConsole()\\n NewList values()\\n rangeexpand(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\", values())\\n outputListValues(values())\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\")\\n Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"def rangeexpand(txt):\\n lst = []\\n for r in txt.split(','):\\n if '-' in r[1:]:\\n r0, r1 = r[1:].split('-', 1)\\n lst += range(int(r[0] + r0), int(r1) + 1)\\n else:\\n lst.append(int(r))\\n return lst\\n\\nprint(rangeexpand('-6,-3--1,3-5,7-11,14,15,17-20'))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import re\\n\\ndef rangeexpand(txt):\\n lst = []\\n for rng in txt.split(','):\\n start,end = re.match('^(-?\\\\d+)(?:-(-?\\\\d+))?$', rng).groups()\\n if end:\\n lst.extend(xrange(int(start),int(end)+1))\\n else:\\n lst.append(int(start))\\n return lst\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Range expansion'''\\n\\nfrom functools import (reduce)\\n\\n\\n# ------------------- EXPANSION FUNCTION -------------------\\n\\n# rangeExpansion :: String -> [Int]\\ndef rangeExpansion(s):\\n '''List of integers expanded from a\\n comma-delimited string of individual\\n numbers and hyphenated ranges.\\n '''\\n def go(a, x):\\n tpl = breakOn('-')(x[1:])\\n r = tpl[1]\\n return a + (\\n [int(x)] if not r\\n else enumFromTo(int(x[0] + tpl[0]))(\\n int(r[1:])\\n )\\n )\\n return reduce(go, s.split(','), [])\\n\\n\\n# -------------------------- TEST --------------------------\\ndef main():\\n '''Expansion test'''\\n\\n print(\\n fTable(__doc__ + ':')(\\n lambda x: \\\"\\\\n'\\\" + str(x) + \\\"'\\\"\\n )(lambda x: '\\\\n\\\\n\\\\t' + showList(x))(\\n rangeExpansion\\n )([\\n '-6,-3--1,3-5,7-11,14,15,17-20'\\n ])\\n )\\n\\n\\n# ------------------- GENERIC FUNCTIONS --------------------\\n\\n# breakOn :: String -> String -> (String, String)\\ndef breakOn(needle):\\n '''A tuple of:\\n 1. the prefix of haystack before needle,\\n 2. the remainder of haystack, starting\\n with needle.\\n '''\\n def go(haystack):\\n xs = haystack.split(needle)\\n return (xs[0], haystack[len(xs[0]):]) if (\\n 1 < len(xs)\\n ) else (haystack, '')\\n return lambda haystack: go(haystack) if (\\n needle\\n ) else None\\n\\n\\n# enumFromTo :: Int -> Int -> [Int]\\ndef enumFromTo(m):\\n '''Enumeration of integer values [m..n]\\n '''\\n return lambda n: list(range(m, 1 + n))\\n\\n\\n# fTable :: String -> (a -> String) ->\\n# (b -> String) -> (a -> b) -> [a] -> String\\ndef fTable(s):\\n '''Heading -> x display function ->\\n fx display function -> f -> xs -> tabular string.\\n '''\\n def gox(xShow):\\n def gofx(fxShow):\\n def gof(f):\\n def goxs(xs):\\n ys = [xShow(x) for x in xs]\\n w = max(map(len, ys))\\n\\n def arrowed(x, y):\\n return y.rjust(w, ' ') + ' -> ' + (\\n fxShow(f(x))\\n )\\n return s + '\\\\n' + '\\\\n'.join(\\n map(arrowed, xs, ys)\\n )\\n return goxs\\n return gof\\n return gofx\\n return gox\\n\\n\\n# showList :: [a] -> String\\ndef showList(xs):\\n '''Stringification of a list.\\n '''\\n return '[' + ','.join(str(x) for x in xs) + ']'\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"rangeExpand <- function(text) {\\n lst <- gsub(\\\"(\\\\\\\\d)-\\\", \\\"\\\\\\\\1:\\\", unlist(strsplit(text, \\\",\\\")))\\n unlist(sapply(lst, function (x) eval(parse(text=x))), use.names=FALSE)\\n}\\n\\nrangeExpand(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n [1] -6 -3 -2 -1 3 4 5 7 8 9 10 11 14 15 17 18 19 20\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (range-expand s)\\n (append*\\n (for/list ([r (regexp-split \\\",\\\" s)])\\n (match (regexp-match* \\\"(-?[0-9]+)-(-?[0-9]+)\\\" r\\n #:match-select cdr)\\n [(list (list f t))\\n (range (string->number f) (+ (string->number t) 1))]\\n [(list)\\n (list (string->number r))]))))\\n\\n(range-expand \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define on-minus\\n (case-lambda\\n [(ch ip) (on-minus ch ip #f #f #f #f)]\\n [(ch ip src line col pos)\\n (if (char-numeric? (peek-char ip))\\n (- (read ip))\\n (datum->syntax #f '-))]))\\n\\n(define minus-delimits\\n (make-readtable (current-readtable) #\\\\- 'terminating-macro on-minus))\\n\\n(define (range-expand s)\\n (parameterize ([current-readtable minus-delimits])\\n (append*\\n (for/list ([f (in-port read s)])\\n (match (peek-char s)\\n [#\\\\, (read-char s)\\n (list f)]\\n [#\\\\- (read-char s)\\n (define t (read s))\\n (read-char s)\\n (range f (+ t 1))])))))\\n\\n(range-expand (open-input-string \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub range-expand (Str $range-description) {\\n my token number { '-'? \\\\d+ }\\n my token range { (<&number>) '-' (<&number>) }\\n\\n $range-description\\n .split(',')\\n .map({ .match(&range) ?? $0..$1 !! +$_ })\\n .flat\\n}\\n\\nsay range-expand('-6,-3--1,3-5,7-11,14,15,17-20').join(', ');\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"grammar RangeList {\\n token TOP { <term>* % ',' { make $<term>.map(*.made) } }\\n token term { [<range>|<num>] { make ($<num> // $<range>).made } }\\n token range { <num> '-' <num> { make +$<num>[0] .. +$<num>[1] } }\\n token num { '-'? \\\\d+ { make +$/ } }\\n}\\n\\nsay RangeList.parse('-6,-3--1,3-5,7-11,14,15,17-20').made.flat.join(', ');\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"define get_num use $lst\\n # \\\"-22\\\" split by \\\"-\\\" is [ \\\"\\\", \\\"22\\\" ] so check if\\n # first list item is \\\"\\\" -> a negative number\\n $lst 0 get \\\"\\\" = if\\n # negative number\\n #\\n # convert str to integer and multiply by -1\\n -1 $lst 1 get 0 prefer *\\n $lst shift $lst shift drop drop\\n else\\n # positive number\\n $lst 0 get 0 prefer\\n $lst shift drop\\n\\ndefine range_expand use $rng\\n [ ] as $res\\n $rng \\\",\\\" split each as $r\\n $r m/^(-?\\\\d+)-(-?\\\\d+)$/ TRUE = if\\n $r s/-/g as $parts\\n $parts get_num as $from\\n $parts get_num as $to\\n # int list to str list, then joined by \\\",\\\"\\n group\\n $from $to 1 range each \\\"\\\" prefer\\n list \\\",\\\" join $res push\\n # range doesn't include the $to, so add to end of generated range\\n $to \\\"%d\\\" $res push\\n else\\n $r $res push\\n $res \\\",\\\" join print\\n \\\"\\\\n\\\" print\\n\\n'-6,-3--1,3-5,7-11,14,15,17-20' range_expand\\n\",\n \"language\": \"Raven\"\n },\n {\n \"code\": \"/*REXX program expands an ordered list of integers into an expanded list. */\\nold= '-6,-3--1, 3-5, 7-11, 14,15,17-20'; a=translate(old,,',')\\nnew= /*translate [↑] commas (,) ───► blanks*/\\n do until a==''; parse var a X a /*obtain the next integer ──or── range.*/\\n p=pos('-', X, 2) /*find the location of a dash (maybe). */\\n if p==0 then new=new X /*append integer X to the new list.*/\\n else do j=left(X,p-1) to substr(X,p+1); new=new j\\n end /*j*/ /*append a single [↑] integer at a time*/\\n end /*until*/\\n /*stick a fork in it, we're all done. */\\nnew=translate( strip(new), ',', \\\" \\\") /*remove the first blank, add commas. */\\nsay 'old list: ' old /*show the old list of numbers/ranges.*/\\nsay 'new list: ' new /* \\\" \\\" new \\\" \\\" numbers. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program to expand a range of integers into a list. *************\\n* 09.08.2012 Walter Pachl\\n**********************************************************************/\\n\\n parse arg old\\n if old = '' then -\\n old='-6,-3--1,3-5,7-11,14,15,17-20' /*original list of nums/ranges */\\n\\n Say 'old='old /*show old list of nums/ranges. */\\n a=translate(old,,',') /*translate commas to blanks */\\n new='' /*new list of numbers (so far). */\\n\\n comma=''\\n Do While a<>'' /* as long as there is input */\\n Parse var a x a /* get one element */\\n dashpos=pos('-',x,2) /* find position of dash, if any */\\n If dashpos>0 Then Do /* element is low-high */\\n Parse Var x low =(dashpos) +1 high /* split the element */\\n Do j=low To high /* output all numbers in range */\\n new=new||comma||j /* with separating commas */\\n comma=',' /* from now on use comma */\\n End\\n End\\n Else Do /* element is a number */\\n new=new||comma||x /* append (with comma) */\\n comma=',' /* from now on use comma */\\n End\\n End\\n Say 'new='new /*show the expanded list */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Range expansion\\n\\nint = \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\nint = str2list(substr(int, \\\",\\\", nl))\\nnewint = []\\nfor n=1 to len(int)\\n nrint = substr(int[n], \\\"-\\\")\\n nrint2 = substr(int[n], \\\"--\\\")\\n if nrint2 > 0\\n temp1 = left(int[n], nrint2 -1)\\n temp2 = right(int[n], len(int[n]) - nrint2)\\n add(newint, [temp1,temp2])\\n else\\n if len(int[n]) <= 2\\n add(newint, [int[n], \\\"\\\"])\\n else\\n if nrint > 0 and nrint2 = 0\\n temp1 = left(int[n], nrint - 1)\\n temp2 = right(int[n], len(int[n]) - nrint)\\n add(newint, [temp1,temp2])\\n ok\\n ok\\n ok\\nnext\\nshowarray(newint)\\n\\nfunc showarray(vect)\\n see \\\"[\\\"\\n svect = \\\"\\\"\\n for n = 1 to len(vect)\\n if newint[n][2] != \\\"\\\"\\n for nr = newint[n][1] to newint[n][2]\\n svect = svect +\\\"\\\" + nr + \\\", \\\"\\n next\\n else\\n svect = svect +\\\"\\\" + newint[n][1] + \\\", \\\"\\n ok\\n next\\n svect = left(svect, len(svect) - 2)\\n see svect\\n see \\\"]\\\" + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def range_expand(rng)\\n rng.split(',').flat_map do |part|\\n if part =~ /^(-?\\\\d+)-(-?\\\\d+)$/\\n ($1.to_i .. $2.to_i).to_a\\n else\\n Integer(part)\\n end\\n end\\nend\\n\\np range_expand('-6,-3--1,3-5,7-11,14,15,17-20')\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"PRINT rangeExpand$(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\nend\\n\\nfunction rangeExpand$(range$)\\n[loop]\\ni\\t= INSTR(range$, \\\"-\\\", i+1)\\nIF i THEN\\n j = i\\n WHILE MID$(range$,j-1,1) <> \\\",\\\" AND j <> 1\\n j = j - 1\\n wend\\n IF i > j then\\n IF MID$(range$,j,i-j) <> str$(i-j)+\\\" \\\" THEN\\n t$ = \\\"\\\"\\n FOR k = VAL(MID$(range$,j)) TO VAL(MID$(range$,i+1))-1\\n t$ = t$ + str$(k) + \\\",\\\"\\n NEXT k\\n range$ = LEFT$(range$,j-1) + t$ + MID$(range$,i+1)\\n i = j + LEN(t$) + 2\\n end if\\n end if\\nend if\\nif i <> 0 then goto [loop]\\nrangeExpand$ = range$\\nend function\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use std::str::FromStr;\\n\\n// Precondition: range doesn't contain multibyte UTF-8 characters\\nfn range_expand(range : &str) -> Vec<i32> {\\n range.split(',').flat_map(|item| {\\n match i32::from_str(item) {\\n Ok(n) => n..n+1,\\n _ => {\\n let dashpos=\\n match item.rfind(\\\"--\\\") {\\n Some(p) => p,\\n None => item.rfind('-').unwrap(),\\n };\\n let rstart=i32::from_str(\\n unsafe{ item.slice_unchecked(0,dashpos)} ).unwrap();\\n let rend=i32::from_str(\\n unsafe{ item.slice_unchecked(dashpos+1,item.len()) } ).unwrap();\\n rstart..rend+1\\n },\\n }\\n }).collect()\\n}\\n\\nfn main() {\\n println!(\\\"{:?}\\\", range_expand(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"));\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"variable r_expres = \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\", s, r_expan = {}, dpos, i;\\n\\nforeach s (strchop(r_expres, ',', 0))\\n{\\n % S-Lang built-in RE's are fairly limited, and have a quirk:\\n % grouping is done with \\\\\\\\( and \\\\\\\\), not ( and )\\n % [PCRE and Oniguruma RE's are available via standard libraries]\\n if (string_match(s, \\\"-?[0-9]+\\\\\\\\(-\\\\\\\\)-?[0-9]+\\\", 1)) {\\n\\n (dpos, ) = string_match_nth(1);\\n\\n % Create/loop-over a \\\"range array\\\": from num before - to num after it:\\n foreach i ( [integer(substr(s, 1, dpos)) : integer(substr(s, dpos+2, -1))] )\\n list_append(r_expan, string(i));\\n }\\n else\\n list_append(r_expan, s);\\n}\\nprint(strjoin(list_to_array(r_expan), \\\", \\\"));\\n\",\n \"language\": \"S-lang\"\n },\n {\n \"code\": \"def rangex(str: String): Seq[Int] =\\n str split \\\",\\\" flatMap { (s) =>\\n val r = \\\"\\\"\\\"(-?\\\\d+)(?:-(-?\\\\d+))?\\\"\\\"\\\".r\\n val r(a,b) = s\\n if (b == null) Seq(a.toInt) else a.toInt to b.toInt\\n }\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define split\\n (lambda (str char skip count)\\n (let ((len (string-length str)))\\n (let loop ((index skip)\\n (last-index 0)\\n (result '()))\\n (if (= index len)\\n (reverse (cons (substring str last-index) result))\\n (if (eq? char (string-ref str index))\\n (loop (if (= count (+ 2 (length result)))\\n len\\n (+ index 1))\\n (+ index 1)\\n (cons char (cons (substring str last-index index)\\n result)))\\n (loop (+ index 1)\\n last-index\\n result)))))))\\n\\n(define range-expand\\n (lambda (str)\\n (for-each\\n (lambda (token)\\n (if (char? token)\\n (display token)\\n (let ((range (split token #\\\\- 1 2)))\\n (if (null? (cdr range))\\n (display (car range))\\n (do ((count (string->number (list-ref range 0)) (+ 1 count))\\n (high (string->number (list-ref range 2))))\\n ((= count high) (display high))\\n (display count)\\n (display \\\",\\\"))))))\\n (split str #\\\\, 0 0))\\n (newline)))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"scanstri.s7i\\\";\\n\\nconst func array integer: rangeExpansion (in var string: rangeStri) is func\\n result\\n var array integer: numbers is 0 times 0;\\n local\\n var integer: number is 0;\\n begin\\n while rangeStri <> \\\"\\\" do\\n number := integer parse getInteger(rangeStri);\\n numbers &:= number;\\n if startsWith(rangeStri, \\\"-\\\") then\\n rangeStri := rangeStri[2 ..];\\n for number range succ(number) to integer parse getInteger(rangeStri) do\\n numbers &:= number;\\n end for;\\n end if;\\n if startsWith(rangeStri, \\\",\\\") then\\n rangeStri := rangeStri[2 ..];\\n elsif rangeStri <> \\\"\\\" then\\n raise RANGE_ERROR;\\n end if;\\n end while;\\n end func;\\n\\nconst proc: main is func\\n local\\n var integer: number is 0;\\n begin\\n for number range rangeExpansion(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\") do\\n write(number <& \\\" \\\");\\n end for;\\n writeln;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"func rangex(str) {\\n str.split(',').map { |r|\\n var m = r.match(/^\\n (?(DEFINE) (?<int>[+-]?[0-9]+) )\\n (?<from>(?&int))-(?<to>(?&int))\\n $/x)\\n m ? do {var c = m.ncap; (Num(c{:from}) .. Num(c{:to}))...}\\n : Num(r)\\n }\\n}\\n\\nsay rangex('-6,-3--1,3-5,7-11,14,15,17-20').join(',')\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"* # Return range n1 .. n2\\n define('range(n1,n2)') :(range_end)\\nrange range = range n1 ','; n1 = lt(n1,n2) n1 + 1 :s(range)\\n range rtab(1) . range :(return)\\nrange_end\\n\\n define('rangex(range)d1,d2')\\n num = ('-' | '') span('0123456789') :(rangex_end)\\nrangex range num . d1 '-' num . d2 = range(d1,d2) :s(rangex)\\n rangex = range :(return)\\nrangex_end\\n\\n* # Test and display\\n output = rangex('-6,-3--1,3-5,7-11,14,15,17-20')\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"/*\\nThis code is an implementation of \\\"Range expansion\\\" in SQL ORACLE 19c\\np_list_of_sets -- input string\\ndelimeter by default \\\",\\\"\\n*/\\nwith\\nfunction range_expansion(p_list_of_sets in varchar2)\\nreturn varchar2 is\\n --\\n v_list_of_sets varchar2(32767) := p_list_of_sets;\\n v_output varchar2(32767) ;\\n v_set_1 varchar2(2000) ;\\n v_set_1_min pls_integer;\\n v_set_1_max pls_integer;\\n --\\n function sort_set(p_in_str varchar2)\\n return varchar2 is\\n v_out varchar2(32767) := p_in_str;\\n begin\\n --\\n with out_tab as\\n (select to_number(regexp_substr(str, '[^,]+', 1, rownum, 'c', 0) default null on conversion error) elem\\n from\\n (select p_in_str as str\\n from dual\\n )\\n connect by level <= regexp_count(str, '[^,]+')\\n )\\n select trim(both ',' from min(elem)||','||max(elem)) end\\n into v_out\\n from out_tab;\\n --\\n return v_out;\\n end;\\n --\\n function sort_output(p_in_str varchar2)\\n return varchar2 is\\n v_out varchar2(32767) := p_in_str;\\n begin\\n --\\n with out_tab as\\n (select distinct to_number(regexp_substr(str, '[^,]+', 1, rownum, 'c', 0) default null on conversion error) elem\\n from\\n (select p_in_str as str\\n from dual\\n )\\n connect by level <= regexp_count(str, '[^,]+')\\n )\\n select listagg(elem, ',') within group(order by elem) end\\n into v_out\\n from out_tab\\n where elem is not null;\\n --\\n return v_out;\\n end;\\n --\\nbegin\\n --cleaning\\n v_list_of_sets := replace(v_list_of_sets, ' ', '') ;\\n v_list_of_sets := replace(v_list_of_sets, '+', '') ;\\n v_list_of_sets := replace(v_list_of_sets, ',', '|') ;\\n v_list_of_sets := regexp_replace(v_list_of_sets, '(\\\\d{1,})-(\\\\d{1,})', '\\\\1,\\\\2', 1, 0) ;\\n v_list_of_sets := regexp_replace(v_list_of_sets, '(\\\\d{1,})--(\\\\d{1,})', '\\\\1,-\\\\2', 1, 0) ;\\n --\\n <<loop_through_sets>>\\n while regexp_count(v_list_of_sets, '[^|]+') > 0\\n loop\\n v_set_1 := regexp_substr(v_list_of_sets, '[^|]+', 1, 1) ;\\n v_list_of_sets := regexp_replace(v_list_of_sets, v_set_1, sort_set(v_set_1), 1, 1) ;\\n v_set_1 := sort_set(v_set_1) ;\\n --\\n continue loop_through_sets when v_set_1 is null;\\n --\\n v_set_1_min := least(to_number(regexp_substr(v_set_1, '[^,]+', 1, 1))\\n ,to_number(regexp_substr(v_set_1, '[^,]+', 1, 2))\\n ) ;\\n v_set_1_max := greatest(to_number(regexp_substr(v_set_1, '[^,]+', 1, 1))\\n ,to_number(regexp_substr(v_set_1, '[^,]+', 1, 2))\\n ) ;\\n --\\n <<loop_for>>\\n for i in v_set_1_min..v_set_1_max\\n loop\\n --\\n v_output := v_output||','||i;\\n --\\n end loop loop_for;\\n --\\n v_list_of_sets := regexp_replace(v_list_of_sets,v_set_1,'',1,1);\\n --\\n end loop loop_through_sets;\\n --\\n v_output := sort_output(v_output);\\n --\\n return trim(v_output);\\nend;\\n\\n--Test\\nselect '-- Test ' as output from dual\\nunion all\\nselect lpad(' ', 65) || ' ==> ' || range_expansion(' ') as output from dual\\nunion all\\nselect lpad('-0,+0,-2 ,-1--2,3 ,-3, 2,-2', 65) || ' ==> ' || range_expansion('-0,+0,-2 ,-1--2,3 ,-3, 2,-2') as output from dual\\nunion all\\nselect lpad('0,-1,+2,-2', 65) || ' ==> ' || range_expansion('0,-1,2,-2') as output from dual\\nunion all\\nselect lpad('-D,-w23--1,+14q,15,17-20,3-5,7-11, +0, 2q, +4, 3,0 ,-0,-2 , -3', 65) || ' ==> ' || range_expansion('-D,-w23--1,+14q,15,17-20,3-5,7-11, +0, 2q, +4, 3,0 ,-0,-2 , -3') as output from dual\\nunion all\\nselect lpad('-6,-3--1,14,15,17-20,3-5,7-11', 65) || ' ==> ' || range_expansion('-6,-3--1,14,15,17-20,3-5,11-7') as output from dual\\nunion all\\n--Test RosettaCode\\nselect '-- Test RosettaCode' as output from dual\\nunion all\\nselect lpad('-6,-3--1,3-5,7-11,14,15,17-20', 65) || ' ==> ' || range_expansion('-6,-3--1,3-5,7-11,14,15,17-20') as output from dual\\n;\\n\",\n \"language\": \"SQL\"\n },\n {\n \"code\": \"composer expand\\n [<element>*]\\n rule element: <range|INT> (<','>?)\\n rule range: (def start: <INT>; <'-'>) <INT> -> $start..$\\nend expand\\n\\n'-6,-3--1,3-5,7-11,14,15,17-20' -> expand -> !OUT::write\\n\",\n \"language\": \"Tailspin\"\n },\n {\n \"code\": \"proc rangeExpand desc {\\n set result {}\\n foreach term [split $desc \\\",\\\"] {\\n\\tset count [scan $term %d-%d from to]\\n\\tif {$count == 1} {\\n\\t lappend result $from\\n\\t} elseif {$count == 2} {\\n\\t for {set i $from} {$i <= $to} {incr i} {lappend result $i}\\n\\t}\\n }\\n return $result\\n}\\n\\nputs [rangeExpand \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nrangednrs=\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\nexpandnrs=SPLIT (rangednrs,\\\":,:\\\")\\n\\nLOOP/CLEAR r=expandnrs\\n test=STRINGS (r,\\\":><-><<>>/:\\\")\\n sz_test=SIZE (test)\\n IF (sz_test==1) THEN\\n expandnrs=APPEND (expandnrs,r)\\n ELSE\\n r=SPLIT (r,\\\"::<|->/::-:\\\",beg,end)\\n expandnrs=APPEND (expandnrs,beg)\\n LOOP/CLEAR next=beg,end\\n next=next+1\\n expandnrs=APPEND (expandnrs,next)\\n IF (next==end) EXIT\\n ENDLOOP\\n ENDIF\\nENDLOOP\\nexpandnrs= JOIN (expandnrs,\\\",\\\")\\n\\nPRINT expandnrs\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"@(define num (n))@(local tok)@{tok /[+\\\\-]?\\\\d+/}@(bind n @(int-str tok))@(end)\\n@(define entry (e))@\\\\\\n @(local n1 n2)@\\\\\\n @(cases)@\\\\\\n @(num n1)@/\\\\s*-\\\\s*/@(num n2)@\\\\\\n @(bind e (n1 n2))@\\\\\\n @(or)@\\\\\\n @(num n1)@\\\\\\n @(bind e n1)@\\\\\\n @(end)@\\\\\\n@(end)\\n@(define rangelist (list))@\\\\\\n @(local first rest)@\\\\\\n @(cases)@\\\\\\n @(entry first)@/\\\\s*,\\\\s*/@(rangelist rest)@\\\\\\n @(bind list @(cons first rest))@\\\\\\n @(or)@\\\\\\n @(entry first)@\\\\\\n @(bind list (first))@\\\\\\n @(or)@\\\\\\n @(bind list nil)@\\\\\\n @(end)@\\\\\\n@(end)\\n@(do\\n (defun expand-helper (list)\\n (cond\\n ((null list) nil)\\n ((consp (first list))\\n (append (range (first (first list))\\n (second (first list)))\\n (rangeexpand (rest list))))\\n (t (cons (first list) (rangeexpand (rest list))))))\\n\\n (defun rangeexpand (list)\\n (uniq (expand-helper list))))\\n@(repeat)\\n@(rangelist x)@{trailing-junk}\\n@(output)\\nraw syntax: @x\\nexpansion: @(rangeexpand x)\\nyour junk: @{trailing-junk}\\n@(end)\\n@(end)\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"#!/usr/bin/bash\\n\\nrange_expand () (\\n IFS=,\\n set -- $1\\n n=$#\\n for element; do\\n if [[ $element =~ ^(-?[0-9]+)-(-?[0-9]+)$ ]]; then\\n set -- \\\"$@\\\" $(eval echo \\\"{${BASH_REMATCH[1]}..${BASH_REMATCH[2]}}\\\")\\n else\\n set -- \\\"$@\\\" $element\\n fi\\n done\\n shift $n\\n echo \\\"$@\\\"\\n # to return a comma-separated value: echo \\\"${*// /,}\\\"\\n)\\n\\nrange_expand \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#import std\\n#import int\\n\\nrex = sep`,; zrange+*= %zp~~htttPzztPQhQXbiNC+ rlc ~&r~=`-\\n\\n#cast %zL\\n\\nt = rex '-6,-3--1,3-5,7-11,14,15,17-20'\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"Public Function RangeExpand(AString as string)\\n' return a list with the numbers expressed in AString\\nDim Splits() As String\\nDim List() As Integer\\nDim count As Integer\\n\\ncount = -1 'to start a zero-based List() array\\n' first split it using comma as delimiter\\nSplits = Split(AString, \\\",\\\")\\n' process all fragments\\nFor Each fragment In Splits\\n 'is there a \\\"-\\\" in it (do not consider first character)?\\n P = InStr(2, fragment, \\\"-\\\")\\n If P > 0 Then 'yes, so it's a range: find start and end numbers\\n nstart = Val(left$(fragment, P - 1))\\n nend = Val(Mid$(fragment, P + 1))\\n j = count\\n count = count + (nend - nstart + 1)\\n 'add numbers in range to List\\n ReDim Preserve List(count)\\n For i = nstart To nend\\n j = j + 1\\n List(j) = i\\n Next\\n Else\\n 'not a range, add a single number\\n count = count + 1\\n ReDim Preserve List(count)\\n List(count) = Val(fragment)\\n End If\\nNext\\nRangeExpand = List\\nEnd Function\\n\\nPublic Sub RangeExpandTest()\\n'test function RangeExpand\\nDim X As Variant\\n\\nX = RangeExpand(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n'print X\\nDebug.Print \\\"Result:\\\"\\nFor Each el In X\\n Debug.Print el;\\nNext\\nDebug.Print\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"var expandRange = Fn.new { |s|\\n var list = []\\n var items = s.split(\\\",\\\")\\n for (item in items) {\\n var count = item.count { |c| c == \\\"-\\\" }\\n if (count == 0 || (count == 1 && item[0] == \\\"-\\\")) {\\n list.add(Num.fromString(item))\\n } else {\\n var items2 = item.split(\\\"-\\\")\\n var first\\n var last\\n if (count == 1) {\\n first = Num.fromString(items2[0])\\n last = Num.fromString(items2[1])\\n } else if (count == 2) {\\n first = Num.fromString(items2[1]) * -1\\n last = Num.fromString(items2[2])\\n } else {\\n first = Num.fromString(items2[1]) * -1\\n last = Num.fromString(items2[3]) * -1\\n }\\n for (i in first..last) list.add(i)\\n }\\n }\\n return list\\n}\\n\\nvar s = \\\"-6,-3--1,3-5,7-11,14,15,17-20\\\"\\nSystem.print(expandRange.call(s))\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"proc Expand(Range);\\nchar Range;\\nint Lo, Hi, N;\\n[Text(8, Range);\\nloop [Lo:= IntIn(8);\\n BackUp; \\\\get what terminated number\\n case ChIn(8) of\\n ^-: [Hi:= IntIn(8);\\n for N:= Lo to Hi do\\n [IntOut(0, N);\\n if N < Hi then Text(0, \\\", \\\");\\n ];\\n BackUp;\\n if ChIn(8) = $1A \\\\EOF\\\\ then quit;\\n ];\\n ^,: IntOut(0, Lo)\\n other \\\\EOF\\\\ [IntOut(0, Lo); quit];\\n Text(0, \\\", \\\");\\n ];\\n];\\n\\nExpand(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"print RangeExpand$(\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\")\\n\\nsub RangeExpand$(s$)\\n local w$(1), n, i, r$, p, a, b\\n\\n n = token(s$, w$(), \\\",\\\")\\n\\n for i = 1 to n\\n p = instr(w$(i), \\\"-\\\", 2)\\n if p then\\n a = val(left$(w$(i), p-1))\\n b = val(right$(w$(i), len(w$(i)) - p))\\n repeat\\n r$ = r$ + str$(a) + \\\",\\\"\\n a = a + 1\\n until(a > b)\\n else\\n r$ = r$ + w$(i) + \\\",\\\"\\n end if\\n next\\n return left$(r$, len(r$) - 1)\\nend sub\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"fcn rangex(s){\\n fcn(s,re){\\n if (re.search(s)){\\n\\t a,b:=re.matched[1,*].apply(\\\"toInt\\\");\\n\\t [a..b].walk();\\n }\\n else s;\\n } :\\n s.split(\\\",\\\").pump(List, _.fp1(RegExp(0'|(.*\\\\d+)-(.*\\\\d+)|)))\\n .flatten().concat(\\\",\\\");\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"ns=\\\"-6,-3-1,3-5,7-11,14,15,17-20\\\";\\nrangex(ns).println();\\n\\nns=\\\"-6,-3--1,3-5,7-11,14,15,17-20\\\";\\nrangex(ns).println();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Range-expansion"}}},{"rowIdx":1560,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Range_extraction\n","language":"00-META"},{"code":"{{:Range extraction/Format}}\n\n;Task:\n* Create a function that takes a list of integers in increasing order and returns a correctly formatted string in the range format. \n* Use the function to compute and print the range formatted version of the following ordered list of integers. (The correct answer is: <code>0-2,4,6-8,11,12,14-25,27-33,35-39</code>).\n<br>\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39\n* Show the output of your program.\n\n\n;Related task:\n* [[Range expansion]]\n<br><br>\n\n","language":"00-TASK"},{"code":"F range_extract(lst)\n [[Int]] r\n V lenlst = lst.len\n V i = 0\n L i < lenlst\n V low = lst[i]\n L i < lenlst - 1 & lst[i] + 1 == lst[i + 1]\n i++\n V hi = lst[i]\n I hi - low >= 2\n r [+]= [low, hi]\n E I hi - low == 1\n r [+]= [low]\n r [+]= [hi]\n E\n r [+]= [low]\n i++\n R r\n\nF printr(ranges)\n print(ranges.map(r -> (I r.len == 2 {r[0]‘-’r[1]} E String(r[0]))).join(‘,’))\n\nL(lst) [[-8, -7, -6, -3, -2, -1, 0, 1, 3, 4, 5, 7,\n 8, 9, 10, 11, 14, 15, 17, 18, 19, 20],\n [0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22,\n 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39]]\n printr(range_extract(lst))\n","language":"11l"},{"code":"INT FUNC FindRange(INT ARRAY a INT len,start)\n INT count\n\n count=1\n WHILE start<len-1\n DO\n IF a(start)+1#a(start+1) THEN\n EXIT\n FI\n start==+1\n count==+1\n OD\nRETURN (count)\n\nPROC Append(CHAR ARRAY text,suffix)\n BYTE POINTER srcPtr,dstPtr\n BYTE len\n\n len=suffix(0)\n IF text(0)+len>255 THEN\n len=255-text(0)\n FI\n IF len THEN\n srcPtr=suffix+1\n dstPtr=text+text(0)+1\n MoveBlock(dstPtr,srcPtr,len)\n text(0)==+suffix(0)\n FI\nRETURN\n\nPROC RangeToStr(INT ARRAY a INT len CHAR ARRAY res)\n INT i,count\n CHAR ARRAY tmp(10)\n\n i=0\n res(0)=0\n WHILE i<len\n DO\n count=FindRange(a,len,i)\n StrI(a(i),tmp) Append(res,tmp)\n IF count=2 THEN\n Append(res,\",\")\n StrI(a(i+1),tmp) Append(res,tmp)\n ELSEIF count>2 THEN\n Append(res,\"-\")\n StrI(a(i+count-1),tmp) Append(res,tmp)\n FI\n i==+count\n IF i<len THEN\n Append(res,\",\")\n FI\n OD\nRETURN\n\nPROC Main()\n INT ARRAY a=[0 1 2 4 6 7 8 11 12 14\n 15 16 17 18 19 20 21 22 23 24 25 27\n 28 29 30 31 32 33 35 36 37 38 39]\n INT ARRAY b=[65530 65533 65534 65535\n 0 1 3 4 5 7 8 9 10 11 14 15 17 18 19 20]\n CHAR ARRAY res(256)\n\n RangeToStr(a,33,res)\n PrintE(res) PutE()\n RangeToStr(b,20,res)\n PrintE(res)\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\nwith Ada.Strings.Unbounded; use Ada.Strings.Unbounded;\nwith Ada.Strings.Fixed; use Ada.Strings.Fixed;\n\nprocedure Range_Extraction is\n type Sequence is array (Positive range <>) of Integer;\n function Image (S : Sequence) return String is\n Result : Unbounded_String;\n From : Integer;\n procedure Flush (To : Integer) is\n begin\n if Length (Result) > 0 then\n Append (Result, ',');\n end if;\n Append (Result, Trim (Integer'Image (From), Ada.Strings.Left));\n if From < To then\n if From+1 = To then\n Append (Result, ',');\n else\n Append (Result, '-');\n end if;\n Append (Result, Trim (Integer'Image (To), Ada.Strings.Left));\n end if;\n end Flush;\n begin\n if S'Length > 0 then\n From := S (S'First);\n for I in S'First + 1..S'Last loop\n if S (I - 1) + 1 /= S (I) then\n Flush (S (I - 1));\n From := S (I);\n end if;\n end loop;\n Flush (S (S'Last));\n end if;\n return To_String (Result);\n end Image;\nbegin\n Put_Line\n ( Image\n ( ( 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39\n ) ) );\nend Range_Extraction;\n","language":"Ada"},{"code":"with Ada.Text_IO, Ada.Strings.Fixed;\n\nprocedure Range_Extract is\n type Sequence is array (Positive range <>) of Integer;\n\n function Img(I: Integer) return String is -- the image of an Integer\n begin\n return\n Ada.Strings.Fixed.Trim(Integer'Image(I), Ada.Strings.Left);\n end Img;\n\n function Img(S: Sequence) return String is -- the image of a Sequence\n\n function X(S : Sequence) return String is -- recursive eXtract\n Idx: Positive := S'First;\n begin\n if S'Length = 0 then return\n \"\"; -- return nothing if Sequence is empty\n else\n while Idx < S'Last and then S(Idx+1) = S(Idx) + 1 loop\n Idx := Idx + 1;\n end loop;\n if Idx = S'First then return\n \",\" & Img(S(Idx)) & X(S(Idx+1 .. S'Last));\n elsif Idx = S'First+1 then return\n \",\" & Img(S(S'First)) & ',' & Img(S(Idx)) & X(S(Idx+1 .. S'Last));\n else return\n \",\" & Img(S(S'First)) & '-' & Img(S(Idx)) & X(S(Idx+1 .. S'Last));\n end if;\n end if;\n end X;\n\n begin -- function Img(S: Sequence) return String\n if S'Length = 0 then return\n \"\";\n else return\n Img(S(S'First)) & X(S(S'First+1 .. S'Last));\n end if;\n end Img;\n\nbegin -- main\n Ada.Text_IO.Put_Line(Img( ( 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16,\n 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29,\n 30, 31, 32, 33, 35, 36, 37, 38, 39) ));\nend Range_Extract;\n","language":"Ada"},{"code":"rp(list l)\n{\n integer a, i;\n data b;\n index x;\n\n a = l[0];\n x[a] = a;\n for (, a in l) {\n x[a == x.back + 1 ? x.high : a] = a;\n }\n for (i, a in x) {\n b.form(a - i < 2 ? a - i ? \"~,~,\" : \"~,\" : \"~-~,\", i, a);\n }\n\n b.delete(-1);\n}\n\nmain(void)\n{\n o_(rp(list(0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22,\n 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39)),\n \"\\n\");\n\n 0;\n}\n","language":"Aime"},{"code":"###\n REQUIRES(MODE SCALAR, OP(SCALAR,SCALAR)BOOL =, OP(SCALAR,SCALAR)SCALAR +);\n###\nMODE SCALARLIST = FLEX[0]SCALAR;\nMODE YIELDINT = PROC(SCALAR)VOID;\n\n################################################################\n# Declarations for manipulating lists of range pairs [lwb:upb] #\n################################################################\nMODE RANGE = STRUCT(SCALAR lwb, upb);\nMODE RANGELIST = FLEX[0]RANGE;\nMODE YIELDRANGE = PROC(RANGE)VOID;\n\nPROC range repr = (RANGE range)STRING: (\n STRING lwb := whole(lwb OF range,0);\n IF lwb OF range = upb OF range THEN\n lwb\n ELSE\n # \"[\"+lwb+\":\"+whole(upb OF range,0)+\"]\" #\n lwb+\"-\"+whole(upb OF range,0)\n FI\n);\n\n# OP REPR = (RANGE range)STRING: range repr(range); # # firmly related to UNIRANGE #\n\n######################################################################\n# Declarations for manipulating lists containing pairs AND lone INTs #\n######################################################################\nMODE UNIRANGE = UNION(SCALAR, RANGE);\nMODE UNIRANGELIST = FLEX[0]UNIRANGE;\nMODE YIELDUNIRANGE = PROC(UNIRANGE)VOID;\n\nPROC unirange repr = (UNIRANGE unirange)STRING:\n CASE unirange IN\n (RANGE range): range repr(range),\n (SCALAR scalar): whole(scalar,0)\n ESAC;\n\nOP (UNIRANGE)STRING REPR = unirange repr; # alias #\n\n# The closest thing Algol68 has to inheritance is the UNION #\nMODE UNIRANGELISTS = UNION(UNIRANGELIST, RANGELIST, SCALARLIST);\n\nPROC unirange list repr = (UNIRANGELIST unirange list)STRING: (\n### Produce a STRING representation of a UNIRANGELIST ###\n STRING out # := \"(\"#, sep := \"\";\n FOR key FROM LWB unirange list TO UPB unirange list DO\n out +:= sep + REPR unirange list[key];\n sep := \",\" # +\" \" #\n OD;\n out # +\")\" #\n);\n\nOP (UNIRANGELIST)STRING REPR = unirange list repr; # alias #\n","language":"ALGOL-68"},{"code":"###\n REQUIRES(MODE SCALAR, OP(SCALAR,SCALAR)BOOL =, OP(SCALAR,SCALAR)SCALAR +);\n###\nPR READ \"Template_Range_extraction_Base.a68\" PR\n\nOP (UNIRANGELISTS)UNIRANGELIST INITUNIRANGE = init unirange list; # alias #\n\nPROC init unirange list = (UNIRANGELISTS unirange list)UNIRANGELIST: (\n### Take a []SCALAR, []RANGE or []UNIRANGE, and return a normalised []UNIRANGE ###\n\n INT len = UPB unirange list-LWB unirange list+1;\n [LWB unirange list: LWB unirange list+len*2]UNIRANGE out unirange list;\n SCALAR upb out unirange list := LWB out unirange list - 1;\n UNION(VOID, RANGE) prev range := EMPTY;\n\n PROC out unirange list append = (RANGE value)VOID:(\n\n IF lwb OF value = upb OF value THEN\n out unirange list[upb out unirange list+:=1] := lwb OF value\n ELIF lwb OF value + 1 = upb OF value THEN\n out unirange list[upb out unirange list+:=1] := lwb OF value;\n out unirange list[upb out unirange list+:=1] := upb OF value\n ELSE\n out unirange list[upb out unirange list+:=1] := value\n FI\n );\n\n FOR key FROM LWB unirange list TO UPB unirange list DO\n UNIRANGE value = CASE unirange list IN\n (SCALARLIST list):list[key],\n (RANGELIST list):list[key],\n (UNIRANGELIST list):list[key]\n ESAC;\n\n RANGE next range := CASE value IN\n (RANGE range): range,\n (SCALAR value): RANGE(value, value)\n ESAC;\n\n prev range :=\n CASE prev range IN\n (VOID): next range,\n (RANGE prev range):\n IF upb OF prev range + 1 = lwb OF next range THEN\n RANGE(lwb OF prev range, upb OF next range) # merge the range #\n ELSE\n out unirange list append(prev range);\n next range\n FI\n OUT SKIP\n ESAC\n\n OD;\n\n CASE prev range IN\n (RANGE last range): out unirange list append(last range)\n ESAC;\n\n out unirange list[:upb out unirange list]\n);\n","language":"ALGOL-68"},{"code":"#!/usr/local/bin/a68g --script #\n############################\n# some simple test cases: #\n############################\n\nMODE SCALAR = INT;\nPR READ \"Template_Range_extraction_Iterative.a68\" PR\n#PR READ \"Template_Range_extraction_Generative.a68\" PR#\nMODE RANGEINT = UNIRANGE;\n\ntest: BEGIN\n []INT int list = ( # unnormalised #\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39);\n\n []RANGE range list = ( # unnormalised #\n (0,0), (1,1), (2,2), (4,4), (6,6), (7,7), (8,8), (11,11), (12,12), (14,14),\n (15,15), (16,16), (17,17), (18,18), (19,19), (20,20), (21,21), (22,22), (23,23), (24,24),\n (25,25), (27,27), (28,28), (29,29), (30,30), (31,31), (32,32), (33,33), (35,35), (36,36),\n (37,37), (38,38), (39,39));\n\n []RANGEINT list a = ( # unnormalised #\n RANGE(0,2), 4, RANGE(6,8), RANGE(11,12),\n RANGE(14,25), RANGE(27,33), RANGE(35,39));\n\n []RANGEINT list b = ( # unnormalised #\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39);\n\n []RANGEINT list c = INITUNIRANGE(list b); # normalised #\n\n# compare manipulation of various types of argument lists #\n printf(($gl$,\n REPR INITUNIRANGE int list,\n REPR INITUNIRANGE range list,\n REPR INITUNIRANGE list a,\n REPR INITUNIRANGE list b,\n REPR list c\n ))\nEND\n","language":"ALGOL-68"},{"code":"###\n REQUIRES(MODE SCALAR, OP(SCALAR,SCALAR)BOOL =, OP(SCALAR,SCALAR)SCALAR +);\n###\nPR READ \"Template_Range_extraction_Base.a68\" PR\n\nPROC gen range = (UNIRANGELISTS unirange list, YIELDRANGE yield range)VOID:\n### Take a []SCALAR, []RANGE or []URANGE, and generatively yield an unnormalised RANGE ###\n\n FOR key FROM LWB unirange list TO UPB unirange list DO\n# Note: Algol 68RS cannot handle LWB and UPB of a UNION in the following: #\n UNIRANGE value = CASE unirange list IN\n (SCALARLIST list):list[key],\n (RANGELIST list):list[key],\n (UNIRANGELIST list):list[key]\n ESAC;\n yield range(\n CASE value IN\n (RANGE range): range,\n (SCALAR value): (value, value)\n ESAC\n )\n OD;\n\nPROC gen range merge = (UNIRANGELISTS unirange list, YIELDRANGE yield)VOID: (\n### Take a []SCALAR, []RANGE or []URANGE , and generatively yield a normalised RANGE ###\n\n UNION(VOID, RANGE) prev range := EMPTY;\n\n# FOR RANGE next range IN # gen range(unirange list, # ) DO #\n## (RANGE next range)VOID:\n# if the ranges cannot be merge, then yield 1st, and return 2nd #\n prev range :=\n CASE prev range IN\n (VOID): next range,\n (RANGE prev range):\n IF upb OF prev range + 1 = lwb OF next range THEN\n RANGE(lwb OF prev range, upb OF next range) # merge the range #\n ELSE\n #IF lwb OF prev range <= upb OF prev range THEN#\n yield(prev range);\n #FI;#\n next range\n FI\n OUT SKIP\n ESAC\n# OD # );\n\n CASE prev range IN (RANGE last range): yield(last range) ESAC\n);\n\nPROC gen unirange merge = (UNIRANGELISTS unirange list, YIELDUNIRANGE yield)VOID: (\n### Take a []SCALAR, []RANGE or []UNIRANGE and generatively yield a normalised UNIRANGE ###\n\n PROC unpack = (RANGE value)VOID:(\n IF lwb OF value = upb OF value THEN\n yield(lwb OF value)\n ELIF lwb OF value + 1 = upb OF value THEN\n yield(lwb OF value);\n yield(upb OF value)\n ELSE\n yield(value)\n FI\n );\n\n gen range merge(unirange list, unpack)\n);\n\nPROC unirange list init = (UNIRANGELISTS unirange list)UNIRANGELIST: (\n### Take a []SCALAR, []RANGE or []UNIRANGE and return a static []UNIRANGE ###\n\n INT len = UPB unirange list - LWB unirange list + 1;\n [LWB unirange list: LWB unirange list + len * 2]UNIRANGE out unirange list; # estimate #\n SCALAR upb out unirange list := LWB out unirange list - 1;\n\n# FOR UNIRANGE unirange IN # gen unirange merge(unirange list, # ) DO #\n## (UNIRANGE unirange)VOID:\n out unirange list[upb out unirange list+:=1] := unirange\n# OD # );\n\n out unirange list[:upb out unirange list]\n);\n\nOP (UNIRANGELISTS)UNIRANGELIST INITUNIRANGE = unirange list init; # alias #\n","language":"ALGOL-68"},{"code":"--------------------- RANGE EXTRACTION ---------------------\n\n-- rangeFormat :: [Int] -> String\non rangeFormat(xs)\n script segment\n on |λ|(xs)\n if 2 < length of xs then\n intercalate(\"-\", {first item of xs, last item of (xs)})\n else\n intercalate(\",\", xs)\n end if\n end |λ|\n end script\n\n script gap\n on |λ|(a, b)\n 1 < b - a\n end |λ|\n end script\n\n intercalate(\",\", map(segment, splitBy(gap, xs)))\nend rangeFormat\n\n\n--------------------------- TEST ---------------------------\non run\n set xs to {0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, ¬\n 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, ¬\n 33, 35, 36, 37, 38, 39}\n\n rangeFormat(xs)\n\n --> \"0-2,4,6-8,11,12,14-25,27-33,35-39\"\nend run\n\n\n-------------------- GENERIC FUNCTIONS ---------------------\n\n\n-- foldl :: (a -> b -> a) -> a -> [b] -> a\non foldl(f, startValue, xs)\n tell mReturn(f)\n set v to startValue\n set lng to length of xs\n repeat with i from 1 to lng\n set v to |λ|(v, item i of xs, i, xs)\n end repeat\n return v\n end tell\nend foldl\n\n\n-- map :: (a -> b) -> [a] -> [b]\non map(f, xs)\n tell mReturn(f)\n set lng to length of xs\n set lst to {}\n repeat with i from 1 to lng\n set end of lst to |λ|(item i of xs, i, xs)\n end repeat\n return lst\n end tell\nend map\n\n\n-- intercalate :: Text -> [Text] -> Text\non intercalate(strText, lstText)\n set {dlm, my text item delimiters} to {my text item delimiters, strText}\n set strJoined to lstText as text\n set my text item delimiters to dlm\n return strJoined\nend intercalate\n\n\n-- Lift 2nd class handler function into 1st class script wrapper\n-- mReturn :: Handler -> Script\non mReturn(f)\n if class of f is script then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n\n\n-- splitBy :: (a -> a -> Bool) -> [a] -> [[a]]\non splitBy(f, xs)\n set mf to mReturn(f)\n\n if length of xs < 2 then\n {xs}\n else\n script p\n on |λ|(a, x)\n set {acc, active, prev} to a\n if mf's |λ|(prev, x) then\n {acc & {active}, {x}, x}\n else\n {acc, active & x, x}\n end if\n end |λ|\n end script\n\n set h to item 1 of xs\n set lstParts to foldl(p, {{}, {h}, h}, items 2 thru -1 of xs)\n item 1 of lstParts & {item 2 of lstParts}\n end if\nend splitBy\n","language":"AppleScript"},{"code":"(*\n The task description doesn't explicitly state that the integers are unique or what to do if they're not.\n This script treats runs of equal integers as single instances of those integers.\n*)\n\non rangeDescription(orderedListOfIntegers)\n script o\n property lst : orderedListOfIntegers\n property entries : {}\n\n on addEntry(startInt, endInt)\n set rangeDifference to endInt - startInt\n if (rangeDifference > 1) then\n set end of my entries to (startInt as text) & \"-\" & endInt\n else if (rangeDifference is 1) then\n set end of my entries to (startInt as text) & \",\" & endInt\n else\n set end of my entries to startInt\n end if\n end addEntry\n end script\n\n -- if ((orderedListOfIntegers's class is not list) or ((count o's lst's integers) < (count orderedListOfIntegers))) then error\n\n -- Work through the list, identifying gaps in the sequence and adding range or individual results to o's entries.\n set startInt to beginning of o's lst\n set endInt to startInt\n repeat with i from 2 to (count orderedListOfIntegers)\n set thisInt to item i of o's lst\n if (thisInt - endInt > 1) then\n tell o to addEntry(startInt, endInt)\n set startInt to thisInt\n end if\n set endInt to thisInt\n end repeat\n tell o to addEntry(startInt, thisInt)\n\n -- Coerce the entries list to text using a comma delimiter.\n set astid to AppleScript's text item delimiters\n set AppleScript's text item delimiters to \",\"\n set output to o's entries as text\n set AppleScript's text item delimiters to astid\n\n return output\nend rangeDescription\n\n-- Test code:\nset listOfIntegers to {0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39}\nreturn rangeDescription(listOfIntegers)\n","language":"AppleScript"},{"code":"\"0-2,4,6-8,11,12,14-25,27-33,35-39\"\n","language":"AppleScript"},{"code":"extractRange: function [inp][\n items: map split.by:\",\" join split.lines strip inp 'x -> to :integer strip x\n ranges: []\n\n i: 0\n while [i < size items][\n fst: items\\[i]\n offset: i\n while [true][\n if (i + 1) >= size items -> break\n if (fst - offset) <> items\\[i+1] - (i+1) -> break\n i: i + 1\n ]\n lst: items\\[i]\n case [(lst-fst)=]\n when? -> 0 -> 'ranges ++ ~\"|fst|\"\n when? -> 1 -> 'ranges ++ ~\"|fst|, |lst|\"\n else -> 'ranges ++ ~\"|fst|-|lst|\"\n i: i + 1\n ]\n\n return join.with:\", \" ranges\n]\n\nprint extractRange {\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39\n}\n","language":"Arturo"},{"code":"msgbox % extract(\"0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39\")\n\nextract( list ) {\n loop, parse, list, `,, %A_Tab%%A_Space%`r`n\n {\n if (A_LoopField+0 != p+1)\n ret .= (f!=p ? (p>f+1 ? \"-\" : \",\") p : \"\") \",\" f := A_LoopField\n p := A_LoopField\n }\n return SubStr(ret (f!=p ? (p>f+1 ? \"-\" : \",\") p : \"\"), 2)\n}\n","language":"AutoHotkey"},{"code":"#!/usr/bin/awk -f\n\nBEGIN {\n delete sequence\n delete range\n\n seqStr = \"0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,\"\n seqStr = seqStr \"25,27,28,29,30,31,32,33,35,36,37,38,39\"\n print \"Sequence: \" seqStr\n fillSequence(seqStr)\n rangeExtract()\n showRange()\n exit\n}\n\nfunction rangeExtract( runStart, runLen) {\n delete range\n runStart = 1\n while(runStart <= length(sequence)) {\n runLen = getSeqRunLen(runStart)\n addRange(runStart, runLen)\n runStart += runLen\n }\n}\n\nfunction getSeqRunLen(startPos, pos) {\n for (pos = startPos; pos < length(sequence); pos++) {\n if (sequence[pos] + 1 != sequence[pos + 1]) break;\n }\n return pos - startPos + 1;\n}\n\nfunction addRange(startPos, len, str) {\n if (len == 1) str = sequence[startPos]\n else if (len == 2) str = sequence[startPos] \",\" sequence[startPos + 1]\n else str = sequence[startPos] \"-\" sequence[startPos + len - 1]\n range[length(range) + 1] = str\n}\n\nfunction showRange( r) {\n printf \" Ranges: \"\n for (r = 1; r <= length(range); r++) {\n if (r > 1) printf \",\"\n printf range[r]\n }\n printf \"\\n\"\n}\n\nfunction fillSequence(seqStr, n, s) {\n n = split(seqStr,a,/[,]+/)\n for (s = 1; s <= n; s++) {\n sequence[s] = a[s]\n }\n}\n","language":"AWK"},{"code":"arraybase 1\ndim a = {-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20}\nprint formatRange(a)\nprint\n\ndim b = {0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39}\nprint formatRange(b)\nend\n\nfunction formatRange (a)\n\tlb = a[?,]: ub = a[?]\n\tif ub = - 1 then return \"\"\n\tif lb = ub then return string(a[lb])\n\trangeCount = 1\n\trange = string(a[lb])\n\tfor i = lb + 1 to ub\n\t\tif a[i] = a[i - 1] + 1 then\n\t\t\trangeCount += 1\n\t\telse\n\t\t\tif rangeCount = 1 then\n\t\t\t\trange += \",\" + string(a[i])\n\t\t\telse\n\t\t\t\tif rangeCount = 2 then\n\t\t\t\t\trangeCount = 1\n\t\t\t\t\trange += \",\" + string(a[i-1]) + \",\" + string(a[i])\n\t\t\t\telse\n\t\t\t\t\trangeCount = 1\n\t\t\t\t\trange += \"-\" + string(a[i-1]) + \",\" + string(a[i])\n\t\t\t\tend if\n\t\t\tend if\n\t\tend if\n\tnext\n\tif rangeCount = 2 then\n\t\trange += \",\" + string(a[ub])\n\telse\n\t\tif rangeCount > 2 then range += \"-\" + string(a[ub])\n\tend if\n\treturn range\nend function\n","language":"BASIC256"},{"code":" range$ = \" 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, \" + \\\n \\ \"15, 16, 17, 18, 19, 20, 21, 22, 23, 24, \" + \\\n \\ \"25, 27, 28, 29, 30, 31, 32, 33, 35, 36, \" + \\\n \\ \"37, 38, 39\"\n PRINT FNrangeextract(range$)\n END\n\n DEF FNrangeextract(r$)\n LOCAL f%, i%, r%, t%, t$\n f% = VAL(r$)\n REPEAT\n i% = INSTR(r$, \",\", i%+1)\n t% = VALMID$(r$, i%+1)\n IF t% = f% + r% + 1 THEN\n r% += 1\n ELSE\n CASE r% OF\n WHEN 0: t$ += STR$(f%) + \",\"\n WHEN 1: t$ += STR$(f%) + \",\" + STR$(f% + r%) + \",\"\n OTHERWISE: t$ += STR$(f%) + \"-\" + STR$(f% + r%) + \",\"\n ENDCASE\n r% = 0\n f% = t%\n ENDIF\n UNTIL i% = 0\n = LEFT$(t$)\n","language":"BBC-BASIC"},{"code":" ( rangeExtract\n = accumulator firstInRange nextInRange\n , accumulate fasten rangePattern\n . ( accumulate\n = !accumulator\n (!accumulator:|?&\",\")\n !firstInRange\n ( !firstInRange+1:<>!nextInRange\n & ( !firstInRange+2:!nextInRange&\",\"\n | \"-\"\n )\n -1+!nextInRange\n |\n )\n : ?accumulator\n )\n & ( fasten\n = [%( !accumulate\n & (!sjt:?firstInRange)+1:?nextInRange\n )\n )\n & ( rangePattern\n = (\n | ?\n ( !nextInRange\n & 1+!nextInRange:?nextInRange\n )\n )\n ( &!accumulate\n | (#<>!nextInRange:!fasten) !rangePattern\n )\n )\n & :?accumulator:?firstInRange\n & !arg:(|#!fasten !rangePattern)\n & str$!accumulator\n )\n& ( test\n = L A\n . put$(!arg \" ==>\\n\",LIN)\n & ( !arg:(?,?)\n & whl'(!arg:(?A,?arg)&(!A,!L):?L)\n & whl'(!L:(?A,?L)&!A !arg:?arg)\n |\n )\n & out$(rangeExtract$!arg)\n )\n& test\n $ (0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39)\n","language":"Bracmat"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n\nsize_t rprint(char *s, int *x, int len)\n{\n#define sep (a > s ? \",\" : \"\") /* use comma except before first output */\n#define ol (s ? 100 : 0) /* print only if not testing for length */\n\tint i, j;\n\tchar *a = s;\n\tfor (i = j = 0; i < len; i = ++j) {\n\t\tfor (; j < len - 1 && x[j + 1] == x[j] + 1; j++);\n\n\t\tif (i + 1 < j)\n\t\t\ta += snprintf(s?a:s, ol, \"%s%d-%d\", sep, x[i], x[j]);\n\t\telse\n\t\t\twhile (i <= j)\n\t\t\t\ta += snprintf(s?a:s, ol, \"%s%d\", sep, x[i++]);\n\t}\n\treturn a - s;\n#undef sep\n#undef ol\n}\n\nint main()\n{\n\tint x[] = {\t0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n\t\t\t15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n\t\t\t25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n\t\t\t37, 38, 39 };\n\n\tchar *s = malloc(rprint(0, x, sizeof(x) / sizeof(int)) + 1);\n\trprint(s, x, sizeof(x) / sizeof(int));\n\tprintf(\"%s\\n\", s);\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <iterator>\n#include <cstddef>\n\ntemplate<typename InIter>\n void extract_ranges(InIter begin, InIter end, std::ostream& os)\n{\n if (begin == end)\n return;\n\n int current = *begin++;\n os << current;\n int count = 1;\n\n while (begin != end)\n {\n int next = *begin++;\n if (next == current+1)\n ++count;\n else\n {\n if (count > 2)\n os << '-';\n else\n os << ',';\n if (count > 1)\n os << current << ',';\n os << next;\n count = 1;\n }\n current = next;\n }\n\n if (count > 1)\n os << (count > 2? '-' : ',') << current;\n}\n\ntemplate<typename T, std::size_t n>\n T* end(T (&array)[n])\n{\n return array+n;\n}\n\nint main()\n{\n int data[] = { 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39 };\n\n extract_ranges(data, end(data), std::cout);\n std::cout << std::endl;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass RangeExtraction\n{\n static void Main()\n {\n const string testString = \"0, 1, 2, 4, 6, 7, 8, 11, 12, 14,15, 16, 17, 18, 19, 20, 21, 22, 23, 24,25, 27, 28, 29, 30, 31, 32, 33, 35, 36,37, 38, 39\";\n var result = String.Join(\",\", RangesToStrings(GetRanges(testString)));\n Console.Out.WriteLine(result);\n }\n\n public static IEnumerable<IEnumerable<int>> GetRanges(string testString)\n {\n var numbers = testString.Split(new[] { ',' }).Select(x => Convert.ToInt32(x));\n var current = new List<int>();\n foreach (var n in numbers)\n {\n if (current.Count == 0)\n {\n current.Add(n);\n }\n else\n {\n if (current.Max() + 1 == n)\n {\n current.Add(n);\n }\n else\n {\n yield return current;\n current = new List<int> { n };\n }\n }\n }\n yield return current;\n }\n\n public static IEnumerable<string> RangesToStrings(IEnumerable<IEnumerable<int>> ranges)\n {\n foreach (var range in ranges)\n {\n if (range.Count() == 1)\n {\n yield return range.Single().ToString();\n }\n else if (range.Count() == 2)\n {\n yield return range.Min() + \",\" + range.Max();\n }\n else\n {\n yield return range.Min() + \"-\" + range.Max();\n }\n }\n }\n}\n","language":"C-sharp"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\npublic class RangeExtraction\n{\n public static void Main()\n {\n string s = \"0,1,2,4,6,7,8,11,12,14,15, 16, 17, 18, 19, 20, 21, 22, 23, 24,25, 27, 28, 29, 30, 31, 32, 33, 35, 36,37, 38, 39\";\n Console.WriteLine(string.Join(\",\", Ranges(s.Split(',').Select(int.Parse))\n .Select(r => r.end == r.start ? $\"{r.start}\" : $\"{r.start}-{r.end}\")));\n }\n\n static IEnumerable<(int start, int end)> Ranges(IEnumerable<int> numbers) {\n if (numbers == null) yield break;\n var e = numbers.GetEnumerator();\n if (!e.MoveNext()) yield break;\n\n int start = e.Current;\n int end = start;\n while (e.MoveNext()) {\n if (e.Current - end != 1) {\n if (end - start == 1) {\n yield return (start, start);\n yield return (end, end);\n } else {\n yield return (start, end);\n }\n start = e.Current;\n }\n end = e.Current;\n }\n yield return (start, end);\n }\n\n}\n","language":"C-sharp"},{"code":"shared void run() {\n\t\n\tvalue numbers = [\n\t\t0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n\t\t15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n\t\t25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n\t\t37, 38, 39\n\t];\n\t\n\tfunction asRangeFormattedString<Value>([Value*] values)\n\t\t\tgiven Value satisfies Enumerable<Value> {\n\t\t\n\t\tvalue builder = StringBuilder();\n\t\t\n\t\tvoid append(Range<Value> range) {\n\t\t\tif(!builder.empty) {\n\t\t\t\tbuilder.append(\",\");\n\t\t\t}\n\t\t\tif(1 <= range.size < 3) {\n\t\t\t\tbuilder.append(\",\".join(range));\n\t\t\t} else {\n\t\t\t\tbuilder.append(\"``range.first``-``range.last``\");\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(nonempty values) {\n\t\t\tvariable value currentRange = values.first..values.first;\n\t\t\tfor(val in values.rest) {\n\t\t\t\tif(currentRange.last.successor == val) {\n\t\t\t\t\tcurrentRange = currentRange.first..val;\n\t\t\t\t} else {\n\t\t\t\t\tappend(currentRange);\n\t\t\t\t\tcurrentRange = val..val;\n\t\t\t\t}\n\t\t\t}\n\t\t\tappend(currentRange);\n\t\t}\n\t\treturn builder.string;\n\t}\n\t\n\tvalue rangeString = asRangeFormattedString(numbers);\n\tassert(rangeString == \"0-2,4,6-8,11,12,14-25,27-33,35-39\");\n\tprint(rangeString);\n}\n","language":"Ceylon"},{"code":"(use '[flatland.useful.seq :only (partition-between)])\n\n(defn nonconsecutive? [[x y]]\n (not= (inc x) y))\n\n(defn string-ranges [coll]\n (let [left (first coll)\n size (count coll)]\n (cond\n (> size 2) (str left \"-\" (last coll))\n (= size 2) (str left \",\" (last coll))\n :else (str left))))\n\n(defn format-with-ranges [coll]\n (println (clojure.string/join \",\"\n (map string-ranges (partition-between nonconsecutive? coll)))))\n","language":"Clojure"},{"code":" IDENTIFICATION DIVISION.\n PROGRAM-ID. extract-range-task.\n\n DATA DIVISION.\n WORKING-STORAGE SECTION.\n 01 data-str PIC X(200) VALUE \"0, 1, 2, 4, 6,\"\n & \" 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, \"\n & \"24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39\".\n\n 01 result PIC X(200).\n\n PROCEDURE DIVISION.\n CALL \"extract-range\" USING CONTENT data-str, REFERENCE result\n DISPLAY FUNCTION TRIM(result)\n\n GOBACK\n .\n END PROGRAM extract-range-task.\n\n\n IDENTIFICATION DIVISION.\n PROGRAM-ID. extract-range.\n\n DATA DIVISION.\n LOCAL-STORAGE SECTION.\n COPY \"nums-table.cpy\".\n\n 01 difference PIC 999.\n\n 01 rng-begin PIC S999.\n 01 rng-end PIC S999.\n\n 01 num-trailing PIC 999.\n\n 01 trailing-comma-pos PIC 999.\n\n LINKAGE SECTION.\n 01 nums-str PIC X(200).\n 01 extracted-range PIC X(200).\n\n 01 extracted-range-len CONSTANT LENGTH extracted-range.\n\n PROCEDURE DIVISION USING nums-str, extracted-range.\n CALL \"split-nums\" USING CONTENT nums-str, \", \",\n REFERENCE nums-table\n\n *> Process the table\n MOVE nums (1) TO rng-begin\n PERFORM VARYING nums-idx FROM 2 BY 1\n UNTIL num-nums < nums-idx\n SUBTRACT nums (nums-idx - 1) FROM nums (nums-idx)\n GIVING difference\n\n *> If number is more than one away from the previous one\n *> end the range and start a new one.\n IF difference > 1\n MOVE nums (nums-idx - 1) TO rng-end\n CALL \"add-next-range\" USING CONTENT rng-begin,\n rng-end, REFERENCE extracted-range\n MOVE nums (nums-idx) TO rng-begin\n END-IF\n END-PERFORM\n\n *> Process the last number\n MOVE nums (num-nums) TO rng-end\n CALL \"add-next-range\" USING CONTENT rng-begin,\n rng-end, REFERENCE extracted-range\n\n *> Remove trailing comma.\n CALL \"find-num-trailing-spaces\"\n USING CONTENT extracted-range, REFERENCE num-trailing\n COMPUTE trailing-comma-pos =\n extracted-range-len - num-trailing\n MOVE SPACE TO extracted-range (trailing-comma-pos:1)\n\n GOBACK\n .\n\n IDENTIFICATION DIVISION.\n PROGRAM-ID. split-nums INITIAL.\n\n DATA DIVISION.\n WORKING-STORAGE SECTION.\n 01 num-len PIC 9.\n 01 next-num-pos PIC 999.\n\n LINKAGE SECTION.\n 01 str PIC X(200).\n 01 delim PIC X ANY LENGTH.\n\n COPY \"nums-table.cpy\".\n\n PROCEDURE DIVISION USING str, delim, nums-table.\n INITIALIZE num-nums\n\n PERFORM UNTIL str = SPACES\n INITIALIZE num-len\n INSPECT str TALLYING num-len FOR CHARACTERS BEFORE delim\n\n ADD 1 TO num-nums\n\n *> If there are no more instances of delim in the string,\n *> add the rest of the string to the last element of the\n *> table.\n IF num-len = 0\n MOVE str TO nums (num-nums)\n EXIT PERFORM\n ELSE\n MOVE str (1:num-len) TO nums (num-nums)\n ADD 3 TO num-len GIVING next-num-pos\n MOVE str (next-num-pos:) TO str\n END-IF\n END-PERFORM\n .\n END PROGRAM split-nums.\n\n IDENTIFICATION DIVISION.\n PROGRAM-ID. add-next-range INITIAL.\n\n DATA DIVISION.\n WORKING-STORAGE SECTION.\n 01 num-trailing PIC 999.\n 01 start-pos PIC 999.\n\n 01 range-len PIC 999.\n\n 01 begin-edited PIC -ZZ9.\n 01 end-edited PIC -ZZ9.\n\n LINKAGE SECTION.\n 01 rng-begin PIC S999.\n 01 rng-end PIC S999.\n\n 01 extracted-range PIC X(200).\n\n 01 extracted-range-len CONSTANT LENGTH extracted-range.\n\n PROCEDURE DIVISION USING rng-begin, rng-end, extracted-range.\n CALL \"find-num-trailing-spaces\"\n USING CONTENT extracted-range, REFERENCE num-trailing\n COMPUTE start-pos = extracted-range-len - num-trailing + 1\n\n SUBTRACT rng-begin FROM rng-end GIVING range-len\n\n MOVE rng-begin TO begin-edited\n MOVE rng-end TO end-edited\n\n EVALUATE TRUE\n WHEN rng-begin = rng-end\n STRING FUNCTION TRIM(begin-edited), \",\"\n INTO extracted-range (start-pos:)\n\n WHEN range-len = 1\n STRING FUNCTION TRIM(begin-edited), \",\",\n FUNCTION TRIM(end-edited), \",\"\n INTO extracted-range (start-pos:)\n\n WHEN OTHER\n STRING FUNCTION TRIM(begin-edited), \"-\",\n FUNCTION TRIM(end-edited), \",\"\n INTO extracted-range (start-pos:)\n END-EVALUATE\n .\n END PROGRAM add-next-range.\n\n IDENTIFICATION DIVISION.\n PROGRAM-ID. find-num-trailing-spaces.\n\n DATA DIVISION.\n LINKAGE SECTION.\n 01 str PIC X(200).\n 01 num-trailing PIC 999.\n\n PROCEDURE DIVISION USING str, num-trailing.\n INITIALIZE num-trailing\n INSPECT str TALLYING num-trailing FOR TRAILING SPACES\n .\n END PROGRAM find-num-trailing-spaces.\n\n END PROGRAM extract-range.\n","language":"COBOL"},{"code":" 01 nums-table.\n 03 num-nums PIC 999.\n 03 nums-area.\n 05 nums PIC S999 OCCURS 1 TO 100 TIMES\n DEPENDING ON num-nums\n INDEXED BY nums-idx.\n","language":"COBOL"},{"code":"(defun format-with-ranges (list)\n (unless list (return \"\"))\n (with-output-to-string (s)\n (let ((current (first list))\n (list (rest list))\n (count 1))\n (princ current s)\n (dolist (next list)\n (if (= next (1+ current))\n (incf count)\n (progn (princ (if (> count 2) \"-\" \",\") s)\n (when (> count 1)\n (princ current s)\n (princ \",\" s))\n (princ next s)\n (setf count 1)))\n (setf current next))\n (when (> count 1)\n (princ (if (> count 2) \"-\" \",\") s)\n (princ current s)))))\n\nCL-USER> (format-with-ranges (list 0 1 2 4 6 7 8 11 12 14\n 15 16 17 18 19 20 21 22 23 24\n 25 27 28 29 30 31 32 33 35 36\n 37 38 39))\n\"0-2,4,6-8,11,12,14-25,27-33,35-39\"\n","language":"Common-Lisp"},{"code":"import std.stdio, std.conv, std.string, std.algorithm, std.range;\n\nstring rangeExtraction(in int[] items)\nin {\n assert(items.isSorted);\n} body {\n if (items.empty)\n return null;\n auto ranges = [[items[0].text]];\n\n foreach (immutable x, immutable y; items.zip(items[1 .. $]))\n if (x + 1 == y)\n ranges[$ - 1] ~= y.text;\n else\n ranges ~= [y.text];\n\n return ranges\n .map!(r => r.length > 2 ? r[0] ~ \"-\" ~ r.back : r.join(','))\n .join(',');\n}\n\nvoid main() {\n foreach (data; [[-8, -7, -6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9,\n 10, 11, 14, 15, 17, 18, 19, 20],\n [0, 0, 0, 1, 1],\n [0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18,\n 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31,\n 32, 33, 35, 36, 37, 38, 39]])\n data.rangeExtraction.writeln;\n}\n","language":"D"},{"code":"procedure ExtractRanges(const values : array of Integer);\nbegin\n var i:=0;\n while i<values.Length do begin\n if i>0 then\n Print(',');\n Print(values[i]);\n var j:=i+1;\n while (j<values.Length) and (values[j]=values[j-1]+1) do\n Inc(j);\n Dec(j);\n if j>i then begin\n if j=i+1 then\n Print(',')\n else Print('-');\n Print(values[j]);\n end;\n i:=j+1;\n end;\nend;\n\nExtractRanges([ 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39]);\n","language":"DWScript"},{"code":"func rangeFormat(a) {\n if a.Length() == 0 {\n return \"\"\n }\n var parts = []\n var n1 = 0\n while true {\n var n2 = n1 + 1\n while n2 < a.Length() && a[n2] == a[n2-1]+1 {\n n2 += 1\n }\n var s = a[n1].ToString()\n if n2 == n1+2 {\n s += \",\" + a[n2-1]\n } else if n2 > n1+2 {\n s += \"-\" + a[n2-1]\n }\n parts.Add(s)\n if n2 == a.Length() {\n break\n }\n if a[n2] == a[n2-1] {\n throw \"Sequence repeats value \\(a[n2])\"\n }\n if a[n2] < a[n2-1] {\n throw \"Sequence not ordered: \\(a[n2]) < \\(a[n2-1])\"\n }\n n1 = n2\n }\n return String.Join(values: parts)\n}\n\nvar rf = rangeFormat([\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39\n])\nprint(\"range format: \\(rf)\")\n","language":"Dyalect"},{"code":"def rex(numbers :List[int]) {\n var region := 0..!0\n for n in numbers { region |= n..n }\n var ranges := []\n for interval in region.getSimpleRegions() {\n def a := interval.getOptStart()\n def b := interval.getOptBound() - 1\n ranges with= if (b > a + 1) {\n `$a-$b`\n } else if (b <=> a + 1) {\n `$a,$b`\n } else { # b <=> a\n `$a`\n }\n }\n return \",\".rjoin(ranges)\n}\n","language":"E"},{"code":"? rex([\n> 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n> 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n> 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n> 37, 38, 39])\n# value: \"0-2,4,6-8,11,12,14-25,27-33,35-39\"\n","language":"E"},{"code":"func$ mkrange arr[] .\n idx = 1\n idx2 = 1\n while idx <= len arr[]\n repeat\n idx2 += 1\n until idx2 > len arr[] or arr[idx2] - arr[idx2 - 1] <> 1\n .\n if idx2 - idx > 2\n r$ &= arr[idx] & \"-\" & arr[idx2 - 1] & \",\"\n idx = idx2\n else\n while idx < idx2\n r$ &= arr[idx] & \",\"\n idx += 1\n .\n .\n .\n return substr r$ 1 (len r$ - 1)\n.\nprint mkrange [ 0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39 ]\n","language":"EasyLang"},{"code":"(define task '(0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39))\n\n;; 1- GROUPING\n(define (group-range item acc)\n(if\n (or (empty? acc) (!= (caar acc) (1- item)))\n (cons (cons item item) acc)\n (begin (set-car! (car acc) item) acc)))\n\n;; intermediate result\n;; (foldl group-range () task)\n;; → ((39 . 35) (33 . 27) (25 . 14) (12 . 11) (8 . 6) (4 . 4) (2 . 0))\n\n;; 2- FORMATTING\n(define (range->string range)\n(let ((from (rest range)) (to (first range)))\n\t\t(cond\n\t\t((= from to) (format \"%d \" from))\n\t\t((= to (1+ from)) (format \"%d, %d \" from to))\n\t\t(else (format \"%d-%d \" from to)))))\n\t\t\n;; 3 - FINAL\n(string-join (map range->string (reverse (foldl group-range () task))) \",\")\n → \"0-2 ,4 ,6-8 ,11, 12 ,14-25 ,27-33 ,35-39 \"\n","language":"EchoLisp"},{"code":"class\n\tRANGE\n\ncreate\n\tmake\n\nfeature\n\tmake\n\t\tlocal\n\t\t\textended_range: STRING\n\t\tdo\n\t\t\textended_range := \"0, 1, 2, 4, 6, 7, 8, 11, 12, 14, \" +\n\t\t\t\t\"15, 16, 17, 18, 19, 20, 21, 22, 23, 24, \" +\n\t\t\t\t\"25, 27, 28, 29, 30, 31, 32, 33, 35, 36, \" +\n \t\t\"37, 38, 39\"\n\t\t\tprint(\"Extended range: \" + extended_range + \"%N\")\n\t\t\tprint(\"Extracted range: \" + extracted_range(extended_range) + \"%N%N\")\n\t\tend\n\nfeature\n\textracted_range(sequence: STRING): STRING\n\t\tlocal\n\t\t\telements: LIST[STRING]\n\t\t\tfirst, curr: STRING\n\t\t\tsubrange_size, index: INTEGER\n\t\tdo\n\t\t\tsequence.replace_substring_all (\", \", \",\")\n\t\t\telements := sequence.split (',')\n\t\t\tfrom\n\t\t\t\tindex := 2\n\t\t\t\tfirst := elements.at (1)\n\t\t\t\tsubrange_size := 0\n\t\t\t\tResult := \"\"\n\t\t\tuntil\n\t\t\t\tindex > elements.count\n\t\t\tloop\n\t\t\t\tcurr := elements.at (index)\n\t\t\t\tif curr.to_integer - first.to_integer - subrange_size = 1\n\t\t\t\tthen\n\t\t\t\t\tsubrange_size := subrange_size + 1\n\t\t\t\telse\n\t\t\t\t\tResult.append(first)\n\t\t\t\t\tif (subrange_size <= 1)\n\t\t\t\t\tthen\n\t\t\t\t\t\tResult.append (\", \")\n\t\t\t\t\telse\n\t\t\t\t\t\tResult.append (\" - \")\n\t\t\t\t\tend\n\t\t\t\t\tif (subrange_size >= 1)\n\t\t\t\t\tthen\n\t\t\t\t\t\tResult.append ((first.to_integer + subrange_size).out)\n\t\t\t\t\t\tResult.append (\", \")\n\t\t\t\t\tend\n\n\t\t\t\t\tfirst := curr\n\t\t\t\t\tsubrange_size := 0\n\t\t\t\tend\n\t\t\t\tindex := index + 1\n\t\t\tend\n\t\t\tResult.append(first)\n\t\t\tif (subrange_size <= 1)\n\t\t\tthen\n\t\t\t\tResult.append (\", \")\n\t\t\telse\n\t\t\t\tResult.append (\" - \")\n\t\t\tend\n\t\t\tif (subrange_size >= 1)\n\t\t\tthen\n\t\t\t\tResult.append ((first.to_integer + subrange_size).out)\n\t\t\tend\n\t\tend\nend\n","language":"Eiffel"},{"code":"defmodule RC do\n def range_extract(list) do\n max = Enum.max(list) + 2\n sorted = Enum.sort([max|list])\n candidate_number = hd(sorted)\n current_number = hd(sorted)\n extract(tl(sorted), candidate_number, current_number, [])\n end\n\n defp extract([], _, _, range), do: Enum.reverse(range) |> Enum.join(\",\")\n defp extract([next|rest], candidate, current, range) when current+1 >= next do\n extract(rest, candidate, next, range)\n end\n defp extract([next|rest], candidate, current, range) when candidate == current do\n extract(rest, next, next, [to_string(current)|range])\n end\n defp extract([next|rest], candidate, current, range) do\n separator = if candidate+1 == current, do: \",\", else: \"-\"\n str = \"#{candidate}#{separator}#{current}\"\n extract(rest, next, next, [str|range])\n end\nend\n\nlist = [\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39\n]\nIO.inspect RC.range_extract(list)\n","language":"Elixir"},{"code":"(require 'gnus-range)\n\n(defun rangext (lst)\n (mapconcat (lambda (item)\n (if (consp item)\n\t\t (if (= (+ 1 (car item)) (cdr item))\n\t\t (format \"%d,%d\" (car item) (cdr item))\n\t\t (format \"%d-%d\" (car item) (cdr item)))\n (format \"%d\" item)))\n (gnus-compress-sequence lst)\n \",\"))\n\n(rangext '(0 1 2 4 6 7 8 11 12 14\n 15 16 17 18 19 20 21 22 23 24\n 25 27 28 29 30 31 32 33 35 36\n 37 38 39))\n;; => \"0-2,4,6-8,11,12,14-25,27-33,35-39\"\n","language":"Emacs-Lisp"},{"code":"(defun split-into-ranges (numbers)\n (let* ((last-number (pop numbers))\n (range (list last-number))\n ranges)\n (dolist (n numbers)\n (if (= n (1+ last-number))\n (push n range)\n (push (nreverse range) ranges)\n (setq range (list n)))\n (setq last-number n))\n (nreverse (cons (nreverse range) ranges))))\n\n(defun format-range (range)\n (cond\n ((not range)\n (error \"invalid range\"))\n ((= (length range) 1)\n (number-to-string (car range)))\n ((= (length range) 2)\n (format \"%d,%d\" (car range) (cadr range)))\n (t\n (format \"%d-%d\" (car range) (car (last range))))))\n\n(defun rangext (numbers)\n (mapconcat #'format-range (split-into-ranges numbers) \",\"))\n\n(rangext '(0 1 2 4 6 7 8 11 12 14\n 15 16 17 18 19 20 21 22 23 24\n 25 27 28 29 30 31 32 33 35 36\n 37 38 39))\n;; => \"0-2,4,6-8,11,12,14-25,27-33,35-39\"\n","language":"Emacs-Lisp"},{"code":"-module( range ).\n\n-export( [extraction/1, task/0] ).\n\nextraction( [H | T] ) when is_integer(H) ->\n Reversed_extracts = extraction_acc( lists:foldl(fun extraction/2, {H, []}, T) ),\n string:join( lists:reverse(Reversed_extracts), \",\" ).\n\ntask() ->\n io:fwrite( \"~p~n\", [extraction([0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39])] ).\n\n\n\nextraction( N, {Start, Acc} ) when N =:= Start + 1 -> {Start, N, Acc};\nextraction( N, {Start, Acc} ) -> {N, extraction_acc( {Start, Acc} )};\nextraction( N, {Start, Stop, Acc} ) when N =:= Stop + 1 -> {Start, N, Acc};\nextraction( N, {Start, Stop, Acc} ) -> {N, extraction_acc( {Start, Stop, Acc} )}.\n\nextraction_acc( {N, Acc} ) -> [erlang:integer_to_list(N) | Acc];\nextraction_acc( {Start, Stop, Acc} ) when Stop > Start + 1 -> [erlang:integer_to_list(Start) ++ \"-\" ++ erlang:integer_to_list(Stop) | Acc];\nextraction_acc( {Start, Stop, Acc} ) -> [erlang:integer_to_list(Stop), erlang:integer_to_list(Start) | Acc]. % Reversed\n","language":"Erlang"},{"code":"function extract_ranges(sequence s)\n integer first\n sequence out\n out = \"\"\n if length(s) = 0 then\n return out\n end if\n first = 1\n for i = 2 to length(s) do\n if s[i] != s[i-1]+1 then\n if first = i-1 then\n out &= sprintf(\"%d,\", s[first])\n elsif first = i-2 then\n out &= sprintf(\"%d,%d,\", {s[first],s[i-1]})\n else\n out &= sprintf(\"%d-%d,\", {s[first],s[i-1]})\n end if\n first = i\n end if\n end for\n if first = length(s) then\n out &= sprintf(\"%d\", s[first])\n elsif first = length(s)-1 then\n out &= sprintf(\"%d,%d\", {s[first],s[$]})\n else\n out &= sprintf(\"%d-%d\", {s[first],s[$]})\n end if\n return out\nend function\n\nputs(1, extract_ranges({0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19,\n 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39}))\n","language":"Euphoria"},{"code":"let extractRanges = function\n | [] -> Seq.empty\n | x::xr ->\n let rec loop ys first last = seq {\n match ys with\n | y::yr when y = last + 1 -> yield! loop yr first y // add to current range\n | y::yr -> yield (first, last) // finish current range\n yield! loop yr y y // and start next\n | [] -> yield (first, last) } // finish final range\n loop xr x x\n\n\nlet rangeToString (s,e) =\n match e-s with\n | 0 -> sprintf \"%d\" s\n | 1 -> sprintf \"%d,%d\" s e\n | _ -> sprintf \"%d-%d\" s e\n\n\nlet extract = extractRanges >> Seq.map rangeToString >> String.concat \",\"\n\n\nprintfn \"%s\" (extract [ 0; 1; 2; 4; 6; 7; 8; 11; 12; 14; 15; 16; 17; 18; 19; 20; 21;\n 22; 23; 24; 25; 27; 28; 29; 30; 31; 32; 33; 35; 36; 37; 38; 39 ])\n","language":"F-Sharp"},{"code":"USING: formatting io kernel math math.parser sequences\nsplitting.monotonic ;\nIN: rosetta-code.range-extraction\n\n: make-range ( seq -- str )\n [ first ] [ last ] bi \"%d-%d\" sprintf ;\n\n: make-atomic ( seq -- str ) [ number>string ] map \",\" join ;\n\n: extract-range ( seq -- str )\n [ - -1 = ] monotonic-split\n [ dup length 2 > [ make-range ] [ make-atomic ] if ] map\n \",\" join ;\n\n{\n 0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22\n 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39\n} extract-range print\n","language":"Factor"},{"code":"create values\nhere\n 0 , 1 , 2 , 4 , 6 , 7 , 8 , 11 , 12 , 14 ,\n 15 , 16 , 17 , 18 , 19 , 20 , 21 , 22 , 23 , 24 ,\n 25 , 27 , 28 , 29 , 30 , 31 , 32 , 33 , 35 , 36 ,\n 37 , 38 , 39 ,\nhere swap - 1 cells / constant /values\n\n: clip 1- swap cell+ swap ; \\ reduce array\n: .range2 0 .r .\" -\" 0 .r ; \\ difference two or more\n: .range1 0 .r .\" , \" 0 .r ; \\ difference one\n: .range0 drop 0 .r ; \\ no difference\n \\ select printing routine\ncreate .range ' .range0 , ' .range1 , ' .range2 ,\n does> >r over over - 2 min cells r> + @ execute ;\n\n: .ranges ( a n --)\n over @ dup >r >r \\ setup first value\n begin\n clip dup \\ check length array\n while\n over @ dup r@ 1+ = \\ check if range breaks\n if r> drop >r else r> r> .range .\" , \" dup >r >r then\n repeat 2drop r> r> .range cr \\ print last range\n;\n\nvalues /values .ranges\n","language":"Forth"},{"code":" SUBROUTINE IRANGE(TEXT)\t!Identifies integer ranges in a list of integers.\nCould make this a function, but then a maximum text length returned would have to be specified.\n CHARACTER*(*) TEXT\t!The list on input, the list with ranges on output.\n INTEGER LOTS\t\t!Once again, how long is a piece of string?\n PARAMETER (LOTS = 666)\t!This should do, at least for demonstrations.\n INTEGER VAL(LOTS)\t!The integers of the list.\n INTEGER N\t\t!Count of numbers.\n INTEGER I,I1\t\t!Steppers.\n N = 1\t\t!Presume there to be one number.\n DO I = 1,LEN(TEXT)\t!Then by noticing commas,\n IF (TEXT(I:I).EQ.\",\") N = N + 1\t!Determine how many more there are.\n END DO\t\t\t!Step alonmg the text.\n IF (N.LE.2) RETURN\t!One comma = two values. Boring.\n IF (N.GT.LOTS) STOP \"Too many values!\"\n READ (TEXT,*) VAL(1:N)\t!Get the numbers, with free-format flexibility.\n TEXT = \"\"\t\t!Scrub the parameter!\n L = 0\t\t\t!No text has been placed.\n I1 = 1\t\t\t!Start the scan.\n 10 IF (L.GT.0) CALL EMIT(\",\")\t!A comma if there is prior text.\n CALL SPLOT(VAL(I1))\t\t!The first number always appears.\n DO I = I1 + 1,N\t\t\t!Now probe ahead\n IF (VAL(I - 1) + 1 .NE. VAL(I)) EXIT\t!While values are consecutive.\n END DO\t\t\t\t!Up to the end of the remaining list.\n IF (I - I1 .GT. 2) THEN\t\t!More than two consecutive values seen?\n CALL EMIT(\"-\")\t\t!Yes!\n CALL SPLOT(VAL(I - 1))\t!The ending number of a range.\n I1 = I\t\t\t!Finger the first beyond the run.\n ELSE\t\t\t!But if too few to be worth a span,\n I1 = I1 + 1\t\t\t!Just finger the next number.\n END IF\t\t\t!So much for that starter.\n IF (I.LE.N) GO TO 10\t!Any more?\n CONTAINS\t\t!Some assistants to save on repetition.\n SUBROUTINE EMIT(C)\t!Rolls forth one character.\n CHARACTER*1 C\t\t!The character.\n L = L + 1\t\t!Advance the finger.\n IF (L.GT.LEN(TEXT)) STOP \"Ran out of text!\"\t!Maybe not.\n TEXT(L:L) = C\t\t!And place the character.\n END SUBROUTINE EMIT\t!That was simple.\n SUBROUTINE SPLOT(N)\t!Rolls forth a signed number.\n INTEGER N\t\t!The number.\n CHARACTER*12 FIELD\t!Sufficient for 32-bit integers.\n INTEGER I\t\t!A stepper.\n WRITE (FIELD,\"(I0)\") N!Roll the number, with trailing spaces.\n DO I = 1,12\t\t!Now transfer the text of the number.\n IF (FIELD(I:I).LE.\" \") EXIT\t!Up to the first space.\n CALL EMIT(FIELD(I:I))\t!One by one.\n END DO\t\t!On to the end.\n END SUBROUTINE SPLOT\t!Not so difficult either.\n END\t!So much for IRANGE.\n\n PROGRAM POKE\n CHARACTER*(200) SOME\n SOME = \" 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, \"\n 1 //\" 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\"\n 2 //\"25, 27, 28, 29, 30, 31, 32, 33, 35, 36, \"\n 3 //\"37, 38, 39 \"\n CALL IRANGE(SOME)\n WRITE (6,*) SOME\n END\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nFunction formatRange (a() As Integer) As String\n Dim lb As Integer = LBound(a)\n Dim ub As Integer = UBound(a)\n If ub = - 1 Then Return \"\"\n If lb = ub Then Return Str(a(lb))\n Dim rangeCount As Integer = 1\n Dim range As String = Str(a(lb))\n For i As Integer = lb + 1 To ub\n If a(i) = a(i - 1) + 1 Then\n rangeCount += 1\n ElseIf rangeCount = 1 Then\n range += \",\" + Str(a(i))\n ElseIf rangeCount = 2 Then\n rangeCount = 1\n range += \",\" + Str(a(i-1)) + \",\" + Str(a(i))\n Else\n rangeCount = 1\n range += \"-\" + Str(a(i-1)) + \",\" + Str(a(i))\n End If\n Next\n If rangeCount = 2 Then\n range += \",\" + Str(a(ub))\n ElseIf rangeCount > 2 Then\n range += \"-\" + Str(a(ub))\n End If\n Return range\nEnd Function\n\nDim a(1 To 20) As Integer = {-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20}\nPrint formatRange(a())\nPrint\n\nDim b(1 To 33) As Integer => _\n{ _\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, _\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, _\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, _\n 37, 38, 39 _\n}\n\nPrint formatRange(b())\nPrint\nPrint \"Press any key to continue\"\nSleep\n","language":"FreeBASIC"},{"code":"siInput As New Short[]\nsiInput1 As Short[] = [0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39]\nsiInput2 As Short[] = [-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]\nsOutput As New String[]\nsiCount As Short\nsiNum As Short\n'__________________\nPublic Sub Main()\nDim siLoop As Short\n\nFor siLoop = 0 To 1\n If siLoop = 0 Then siInput = siInput1.Copy() Else siInput = siInput2.Copy()\n siCount = 0\n siNum = 0\n Repeat\n If siInput[siCount + 1] = siInput[siCount] + 1 Then\n Inc siCount\n Else\n GetOutput\n Endif\n Until siCount = siInput.Max\n\n GetOutput\n Print sOutput.join(\", \")\n sOutput.clear\nNext\n\nEnd\n'__________________\nPublic Sub GetOutput()\n\nIf siNum = siCount Then\n sOutput.add(siInput[siNum])\n Inc siCount\n siNum = siCount\nEnd If\n\nIf siNum <> siCount Then\n If siNum = siCount - 1 Then\n sOutput.add(siInput[siNum])\n sOutput.add(siInput[siNum + 1])\n siCount += 2\n siNum += 2\n Return\n End If\n sOutput.Add(siInput[siNum] & \"-\" & siInput[siCount])\n Inc siCount\n siNum = siCount\nEnd If\n\nEnd\n","language":"Gambas"},{"code":"package main\n\nimport (\n \"errors\"\n \"fmt\"\n \"strconv\"\n \"strings\"\n)\n\nfunc main() {\n rf, err := rangeFormat([]int{\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39,\n })\n if err != nil {\n fmt.Println(err)\n return\n }\n fmt.Println(\"range format:\", rf)\n}\n\nfunc rangeFormat(a []int) (string, error) {\n if len(a) == 0 {\n return \"\", nil\n }\n var parts []string\n for n1 := 0; ; {\n n2 := n1 + 1\n for n2 < len(a) && a[n2] == a[n2-1]+1 {\n n2++\n }\n s := strconv.Itoa(a[n1])\n if n2 == n1+2 {\n s += \",\" + strconv.Itoa(a[n2-1])\n } else if n2 > n1+2 {\n s += \"-\" + strconv.Itoa(a[n2-1])\n }\n parts = append(parts, s)\n if n2 == len(a) {\n break\n }\n if a[n2] == a[n2-1] {\n return \"\", errors.New(fmt.Sprintf(\n \"sequence repeats value %d\", a[n2]))\n }\n if a[n2] < a[n2-1] {\n return \"\", errors.New(fmt.Sprintf(\n \"sequence not ordered: %d < %d\", a[n2], a[n2-1]))\n }\n n1 = n2\n }\n return strings.Join(parts, \",\"), nil\n}\n","language":"Go"},{"code":"def range = { s, e -> s == e ? \"${s},\" : s == e - 1 ? \"${s},${e},\" : \"${s}-${e},\" }\n\ndef compressList = { list ->\n def sb, start, end\n (sb, start, end) = [''<<'', list[0], list[0]]\n for (i in list[1..-1]) {\n (sb, start, end) = i == end + 1 ? [sb, start, i] : [sb << range(start, end), i, i]\n }\n (sb << range(start, end))[0..-2].toString()\n}\n\ndef compressRanges = { expanded -> compressList(Eval.me('[' + expanded + ']')) }\n","language":"Groovy"},{"code":"def s = '''\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39\n'''\nprintln (compressRanges(s))\n","language":"Groovy"},{"code":"import Data.List (intercalate)\n\nextractRange :: [Int] -> String\nextractRange = intercalate \",\" . f\n where f :: [Int] -> [String]\n f (x1 : x2 : x3 : xs) | x1 + 1 == x2 && x2 + 1 == x3\n = (show x1 ++ '-' : show xn) : f xs'\n where (xn, xs') = g (x3 + 1) xs\n g a (n : ns) | a == n = g (a + 1) ns\n | otherwise = (a - 1, n : ns)\n g a [] = (a - 1, [])\n f (x : xs) = show x : f xs\n f [] = []\n","language":"Haskell"},{"code":"> extractRange $ [0..2] ++ 4 : [6..8] ++ 11 : 12 : [14..25] ++ [27..33] ++ [35..39]\n\"0-2,4,6-8,11,12,14-25,27-33,35-39\"\n","language":"Haskell"},{"code":"import Data.List (intercalate)\nimport Data.Function (on)\n\n----------------------- RANGE FORMAT ---------------------\nrangeFormat :: [Int] -> String\nrangeFormat = intercalate \",\" . fmap rangeString . splitBy ((/=) . succ)\n\nrangeString xs\n | 2 < length xs = x ++ '-' : last t\n | otherwise = intercalate \",\" ps\n where\n ps@(x:t) = show <$> xs\n\n--------------------- GENERIC FUNCTION -------------------\n-- Split wherever a supplied predicate matches the\n-- relationship between two consecutive items.\nsplitBy :: (a -> a -> Bool) -> [a] -> [[a]]\nsplitBy _ [] = []\nsplitBy _ [x] = [[x]]\nsplitBy f xs@(_:t) = uncurry (:) $ foldr go ([], []) (zip xs t)\n where\n go (x, prev) (active, acc)\n | f x prev = ([x], current : acc)\n | otherwise = (x : current, acc)\n where\n current\n | null active = [prev]\n | otherwise = active\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain =\n print $\n rangeFormat\n [ 0\n , 1\n , 2\n , 4\n , 6\n , 7\n , 8\n , 11\n , 12\n , 14\n , 15\n , 16\n , 17\n , 18\n , 19\n , 20\n , 21\n , 22\n , 23\n , 24\n , 25\n , 27\n , 28\n , 29\n , 30\n , 31\n , 32\n , 33\n , 35\n , 36\n , 37\n , 38\n , 39\n ]\n","language":"Haskell"},{"code":"import Data.List (intercalate, groupBy, isPrefixOf)\nimport Data.List.Split (chop)\nimport Data.Bool (bool)\n\nrangeFormat :: [Int] -> String\nrangeFormat xs =\n intercalate \",\" $\n (head . ((bool <*> tail) <*> (> 1) . length)) <$>\n groupBy isPrefixOf (rangeString <$> chop succSpan (zip xs (tail xs)))\n\nrangeString [] = \"\"\nrangeString xxs@(x:xs)\n | null xs = show (snd x)\n | otherwise = intercalate \"-\" (show <$> [fst x, snd (last xs)])\n\nsuccSpan [] = ([], [])\nsuccSpan (xxs@(x:xs))\n | null ys = ([x], xs)\n | otherwise = (ys, zs)\n where\n (ys, zs) = span (uncurry ((==) . succ)) xxs\n\nmain :: IO ()\nmain =\n putStrLn $\n rangeFormat [ 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39 ]\n","language":"Haskell"},{"code":"procedure main()\n\n R := [ 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39 ]\n\n write(\"Input list := \",list2string(R))\n write(\"Extracted sting := \",s := range_extract(R) | \"FAILED\")\nend\n\nprocedure range_extract(R) #: return string/range representation of a list of unique integers\nlocal s,sep,low,high,x\n\n every if integer(x:= !R) ~= x then fail # ensure all are integers,\n R := sort(set(R)) # unique, and sorted\n\n s := sep := \"\"\n while s ||:= sep || ( low := high := get(R) ) do { # lower bound of range\n sep := \",\"\n while high := ( R[1] = high + 1 ) do get(R) # find the end of range\n if high > low+1 then s ||:= \"-\" || high # - record range of 3+\n else if high = low+1 then push(R,high) # - range of 2, high becomes new low\n }\n return s\nend\n\nprocedure list2string(L) #: helper to convert list to string\nlocal s\n\n every (s := \"[ \") ||:= !L || \" \"\n return s || \"]\"\nend\n","language":"Icon"},{"code":"fmt=: [: ;@(8!:0) [`]`({. ; (',-' {~ 2 < #) ; {:)@.(2 <. #)\ngroup=: <@fmt;.1~ 1 ~: 0 , 2 -~/\\ ]\nextractRange=: ',' joinstring group\n","language":"J"},{"code":" extractRange 0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39\n0-2,4,6-8,11,12,14-25,27-33,35-39\n","language":"J"},{"code":" extractRange (-6, 3, 2, 1), 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20\n-6,-3-1,3-5,7-11,14,15,17-20\n","language":"J"},{"code":" extractRange i.101\n0-100\n","language":"J"},{"code":" extractRange (-. p:) i.101\n0,1,4,6,8-10,12,14-16,18,20-22,24-28,30,32-36,38-40,42,44-46,48-52,54-58,60,62-66,68-70,72,74-78,80-82,84-88,90-96,98-100\n","language":"J"},{"code":" extractRange 2}. (-. p:) i.101\n4,6,8-10,12,14-16,18,20-22,24-28,30,32-36,38-40,42,44-46,48-52,54-58,60,62-66,68-70,72,74-78,80-82,84-88,90-96,98-100\n","language":"J"},{"code":"public class RangeExtraction {\n\n public static void main(String[] args) {\n int[] arr = {0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39};\n\n int len = arr.length;\n int idx = 0, idx2 = 0;\n while (idx < len) {\n while (++idx2 < len && arr[idx2] - arr[idx2 - 1] == 1);\n if (idx2 - idx > 2) {\n System.out.printf(\"%s-%s,\", arr[idx], arr[idx2 - 1]);\n idx = idx2;\n } else {\n for (; idx < idx2; idx++)\n System.out.printf(\"%s,\", arr[idx]);\n }\n }\n }\n}\n","language":"Java"},{"code":"function rangeExtraction(list) {\n var len = list.length;\n var out = [];\n var i, j;\n\n for (i = 0; i < len; i = j + 1) {\n // beginning of range or single\n out.push(list[i]);\n\n // find end of range\n for (var j = i + 1; j < len && list[j] == list[j-1] + 1; j++);\n j--;\n\n if (i == j) {\n // single number\n out.push(\",\");\n } else if (i + 1 == j) {\n // two numbers\n out.push(\",\", list[j], \",\");\n } else {\n // range\n out.push(\"-\", list[j], \",\");\n }\n }\n out.pop(); // remove trailing comma\n return out.join(\"\");\n}\n\n// using print function as supplied by Rhino standalone\nprint(rangeExtraction([\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39\n]));\n","language":"JavaScript"},{"code":"(function () {\n 'use strict';\n\n // rangeFormat :: [Int] -> String\n var rangeFormat = function (xs) {\n return splitBy(function (a, b) {\n return b - a > 1;\n }, xs)\n .map(rangeString)\n .join(',');\n };\n\n // rangeString :: [Int] -> String\n var rangeString = function (xs) {\n return xs.length > 2 ? [head(xs), last(xs)].map(show)\n .join('-') : xs.join(',');\n };\n\n // GENERIC FUNCTIONS\n\n // Splitting not on a delimiter, but whenever the relationship between\n // two consecutive items matches a supplied predicate function\n\n // splitBy :: (a -> a -> Bool) -> [a] -> [[a]]\n var splitBy = function (f, xs) {\n if (xs.length < 2) return [xs];\n var h = head(xs),\n lstParts = xs.slice(1)\n .reduce(function (a, x) {\n var acc = a[0],\n active = a[1],\n prev = a[2];\n\n return f(prev, x) ? (\n [acc.concat([active]), [x], x]\n ) : [acc, active.concat(x), x];\n }, [\n [],\n [h], h\n ]);\n return lstParts[0].concat([lstParts[1]]);\n };\n\n // head :: [a] -> a\n var head = function (xs) {\n return xs.length ? xs[0] : undefined;\n };\n\n // last :: [a] -> a\n var last = function (xs) {\n return xs.length ? xs.slice(-1)[0] : undefined;\n };\n\n // show :: a -> String\n var show = function (x) {\n return JSON.stringify(x);\n };\n\n // TEST\n return rangeFormat([0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16,\n 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32,\n 33, 35, 36, 37, 38, 39\n ]);\n})();\n","language":"JavaScript"},{"code":"(() => {\n 'use strict';\n\n // ---------------- RANGE EXTRACTION -----------------\n\n // rangeFormat :: [Int] -> String\n const rangeFormat = xs =>\n splitBy((a, b) => b - a > 1, xs)\n .map(rangeString)\n .join(',');\n\n // rangeString :: [Int] -> String\n const rangeString = xs =>\n xs.length > 2 ? (\n [xs[0], last(xs)].map(show)\n .join('-')\n ) : xs.join(',')\n\n\n // ---------------------- TEST -----------------------\n const main = () =>\n rangeFormat([0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39\n ]);\n\n\n // ---------------- GENERIC FUNCTIONS ----------------\n\n // Splitting not on a delimiter, but whenever the\n // relationship between two consecutive items matches\n // a supplied predicate function\n\n // splitBy :: (a -> a -> Bool) -> [a] -> [[a]]\n const splitBy = (f, xs) => {\n if (xs.length < 2) return [xs];\n const\n h = xs[0],\n lstParts = xs.slice(1)\n .reduce(([acc, active, prev], x) =>\n f(prev, x) ? (\n [acc.concat([active]), [x], x]\n ) : [acc, active.concat(x), x], [\n [],\n [h],\n h\n ]);\n return lstParts[0].concat([lstParts[1]]);\n };\n\n // last :: [a] -> a\n const last = xs => (\n // The last item of a list.\n ys => 0 < ys.length ? (\n ys.slice(-1)[0]\n ) : undefined\n )(xs);\n\n // show :: a -> String\n const show = x =>\n JSON.stringify(x);\n\n // MAIN --\n return main();\n})();\n","language":"JavaScript"},{"code":"function toRange(arr) {\n const ranges = [];\n const sorted = [...arr.filter(Number.isInteger)].sort((x,y) => Math.sign(x-y));\n const sequenceBreak = (x,y) => y - x > 1 ;\n\n let i = 0;\n while ( i < sorted.length ) {\n\n let j = i ;\n while ( j < sorted.length - 1 && !sequenceBreak( sorted[j], sorted[j+1] ) ) {\n ++j;\n }\n\n const from = sorted[i];\n const thru = sorted[j];\n const rangeLen = 1 + j - i;\n\n if ( from === thru ) {\n ranges.push( [from] );\n } else {\n if ( rangeLen > 2 ) {\n ranges.push([from,thru]);\n } else {\n ranges.push([from], [thru]);\n }\n }\n\n i = j+1;\n }\n\n return ranges.map( range => range.join('-') ).join(',');\n}\n\n// -----------------------------------------------------------------------------\n// Test Case\n// -----------------------------------------------------------------------------\nconst expected = '0-2,4,6-8,11,12,14-25,27-33,35-39';\nconst actual = toRange([\n 0, 1, 2,\n 4,\n 6, 7, 8,\n 11, 12, // should be two singletons\n 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,\n 27, 28, 29, 30, 31, 32, 33,\n 35, 36, 37, 38, 39,\n]);\n\nconsole.log(`actual output : '${actual}'.`);\nconsole.log(`expected output : '${expected}'.`);\nconsole.log(`Correct? ${ actual === expected ? 'Yes' : 'No'}`);\n","language":"JavaScript"},{"code":"# Input should be an array\ndef extract:\n reduce .[] as $i\n # state is an array with integers or [start, end] ranges\n ([];\n if length == 0 then [ $i ]\n else ( .[-1]) as $last\n | if ($last|type) == \"array\" then\n if ($last[1] + 1) == $i then setpath([-1,1]; $i)\n else . + [ $i ]\n end\n elif ($last + 1) == $i then setpath([-1]; [$last, $i])\n else . + [ $i ]\n end\n end)\n | map( if type == \"number\" then tostring\n elif .[0] == .[1] -1\n then \"\\(.[0]),\\(.[1])\" # satisfy special requirement\n else \"\\(.[0])-\\(.[1])\" end )\n | join(\",\") ;\n","language":"Jq"},{"code":"/* Range Extraction, in Jsish */\nfunction rangeExtraction(list) {\n var len = list.length;\n var out = [];\n var i, j;\n\n for (i = 0; i < len; i = j + 1) {\n // beginning of range or single\n out.push(list[i]);\n\n // find end of range\n for (j = i + 1; j < len && list[j] == list[j-1] + 1; j++);\n j--;\n\n if (i == j) {\n // single number\n out.push(\",\");\n } else if (i + 1 == j) {\n // two numbers\n out.push(\",\", list[j], \",\");\n } else {\n // range\n out.push(\"-\", list[j], \",\");\n }\n }\n out.pop(); // remove trailing comma\n return out.join(\"\");\n}\n\nvar arr = [ 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39 ];\n\nputs(arr);\nputs(rangeExtraction(arr));\n","language":"Jsish"},{"code":"function sprintfrange{T<:Integer}(a::Array{T,1})\n len = length(a)\n 0 < len || return \"\"\n dropme = falses(len)\n dropme[2:end-1] = Bool[a[i-1]==a[i]-1 && a[i+1]==a[i]+1 for i in 2:(len-1)]\n s = [string(i) for i in a]\n s[dropme] = \"X\"\n s = join(s, \",\")\n replace(s, r\",[,X]+,\", \"-\")\nend\n\ntesta = [ 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39]\n\nprintln(\"Testing range-style formatting.\")\nprintln(\" \", testa, \"\\n =>\\n \", sprintfrange(testa))\n","language":"Julia"},{"code":"grp : {(&~1=0,-':x)_ x}\nfmt : {:[1=#s:$x;s;(*s),:[3>#s;\",\";\"-\"],*|s]}\nerng: {{x,\",\",y}/,//'fmt'grp x}\n","language":"K"},{"code":"// version 1.0.6\n\nfun extractRange(list: List<Int>): String {\n if (list.isEmpty()) return \"\"\n val sb = StringBuilder()\n var first = list[0]\n var prev = first\n\n fun append(index: Int) {\n if (first == prev) sb.append(prev)\n else if (first == prev - 1) sb.append(first, \",\", prev)\n else sb.append(first, \"-\", prev)\n if (index < list.size - 1) sb.append(\",\")\n }\n\n for (i in 1 until list.size) {\n if (list[i] == prev + 1) prev++\n else {\n append(i)\n first = list[i]\n prev = first\n }\n }\n append(list.size - 1)\n return sb.toString()\n}\n\nfun main(args: Array<String>) {\n val list1 = listOf(-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20)\n println(extractRange(list1))\n println()\n val list2 = listOf(0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39)\n println(extractRange(list2))\n}\n","language":"Kotlin"},{"code":"s$ = \"0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\" + _\n \"25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39\"\nprint ExtractRange$( s$)\nend\n\nfunction ExtractRange$( range$)\n n = 1\n count = ItemCount( range$, \",\")\n while n <= count\n startValue = val( word$( range$, n, \",\"))\n m = n + 1\n while m <= count\n nextValue = val( word$( range$, m, \",\"))\n if nextValue - startValue <> m - n then exit while\n m = m + 1\n wend\n if m - n > 2 then\n ExtractRange$ = ExtractRange$ + str$( startValue) + \"-\" + str$( startValue + m - n - 1) + \",\"\n else\n for i = n to m - 1\n ExtractRange$ = ExtractRange$ + str$( startValue + i - n) + \",\"\n next i\n end if\n n = m\n wend\n ExtractRange$ = left$( ExtractRange$, len( ExtractRange$) - 1)\nend function\n\nfunction ItemCount( list$, separator$)\n while word$( list$, ItemCount + 1, separator$) <> \"\"\n ItemCount = ItemCount + 1\n wend\nend function\n","language":"Liberty-BASIC"},{"code":"function rangeExtract nums\n local prevNum, znums, rangedNums\n set itemDelimiter to \", \"\n put the first item of nums into prevNum\n repeat for each item n in nums\n if n is (prevNum + 1) then\n put n into prevNum\n put \"#\" & n after znums\n else\n put n into prevNum\n put return & n after znums\n end if\n end repeat\n set itemDelimiter to \"#\"\n repeat for each line z in znums\n if z is empty then next repeat\n switch the number of items of z\n case 1\n put z & \",\" after rangedNums\n break\n case 2\n put item 1 of z & \",\" & item -1 of z & \",\" after rangedNums\n break\n default\n put item 1 of z & \"-\" & item -1 of z & \",\" after rangedNums\n end switch\n end repeat\n return char 1 to -2 of rangedNums --strip off trailing comma\nend rangeExtract\n","language":"LiveCode"},{"code":"command testRangeExtract\n local numbers\n put \"0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\" \\\n && \"15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\" \\\n && \"25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\" \\\n && \"37, 38, 39\" into numbers\n put rangeExtract(numbers)\nend testRangeExtract\n","language":"LiveCode"},{"code":"0-2,4,6-8,11,12,14-25,27-33,35-39\n","language":"LiveCode"},{"code":"function extractRange (rList)\n local rExpr, startVal = \"\"\n for k, v in pairs(rList) do\n if rList[k + 1] == v + 1 then\n if not startVal then startVal = v end\n else\n if startVal then\n if v == startVal + 1 then\n rExpr = rExpr .. startVal .. \",\" .. v .. \",\"\n else\n rExpr = rExpr .. startVal .. \"-\" .. v .. \",\"\n end\n startVal = nil\n else\n rExpr = rExpr .. v .. \",\"\n end\n end\n end\n return rExpr:sub(1, -2)\nend\n\nlocal intList = {\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39\n}\nprint(extractRange(intList))\n","language":"Lua"},{"code":"lst := [0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39]:\nr1,r2:= lst[1],lst[1]:\nfor i from 2 to numelems(lst) do\n\tif lst[i] - lst[i-1] = 1 then #consecutive\n\t\tr2 := lst[i]:\n\telse #break\n\t\tprintf(piecewise(r2-r1=1, \"%d,%d,\", r2-r1>1,\"%d-%d,\", \"%d,\"), r1, r2):\n\t\tr1,r2:= lst[i],lst[i]:\n\tfi:\nod:\nprintf(piecewise(r2-r1=1, \"%d,%d\", r2-r1>1,\"%d-%d\", \"%d\"), r1, r2):\n","language":"Maple"},{"code":"rangeExtract[data_List] := ToString[Row[Riffle[\n Flatten[Split[Sort[data], #2 - #1 == 1 &] /. {a_Integer, __, b_} :> Row[{a, \"-\", b}]],\n \",\"]]];\nrangeExtract[{0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39}]\n","language":"Mathematica"},{"code":"function S=range_extraction(L)\n % Range extraction\n L(end+1) = NaN;\n S = int2str(L(1));\n k = 1;\n while (k < length(L)-1)\n if (L(k)+1==L(k+1) && L(k)+2==L(k+2) )\n m = 2;\n while (L(k)+m==L(k+m))\n m = m+1;\n end\n k = k+m-1;\n S = [S,'-',int2str(L(k))];\n else\n k = k+1;\n S = [S,',',int2str(L(k))];\n end \t\n end\nend\n\ndisp(range_extraction([0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, ...\n 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, ...\n 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39]))\n","language":"MATLAB"},{"code":":- module range_extraction.\n:- interface.\n\n:- import_module io.\n\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\n\n:- import_module int, list, ranges, string.\n\nmain(!IO) :-\n print_ranges(numbers, !IO).\n\n:- pred print_ranges(list(int)::in, io::di, io::uo) is det.\n\nprint_ranges(Nums, !IO) :-\n Ranges = ranges.from_list(Nums),\n ranges.range_foldr(add_range_string, Ranges, [], RangeStrs),\n io.write_list(RangeStrs, \",\", io.write_string, !IO).\n\n:- pred add_range_string(int::in, int::in,\n list(string)::in, list(string)::out) is det.\n\nadd_range_string(L, H, !Strs) :-\n ( if L = H then\n !:Strs = [int_to_string(L) | !.Strs]\n else if L + 1 = H then\n !:Strs = [int_to_string(L), int_to_string(H) | !.Strs]\n else\n !:Strs = [string.format(\"%d-%d\", [i(L), i(H)]) | !.Strs]\n ).\n\n:- func numbers = list(int).\n\nnumbers = [\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39].\n","language":"Mercury"},{"code":"extractRange = function(ints)\n result = []\n idx = 0\n while idx < ints.len\n runLen = 1\n while idx+runLen < ints.len and ints[idx+runLen] == ints[idx] + runLen\n runLen = runLen + 1\n end while\n if runLen > 2 then\n result.push ints[idx] + \"-\" + ints[idx+runLen-1]\n idx = idx + runLen\n else\n result.push ints[idx]\n idx = idx + 1\n end if\n end while\n return join(result, \",\")\nend function\n\ntest = [ 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39]\nprint extractRange(test)\n","language":"MiniScript"},{"code":"RANGCONT(X) ;Integer range contraction\n NEW Y,I,CONT,NOTFIRST,CURR,PREV,NEXT,SEQ SET Y=\"\",SEQ=0,PREV=\"\",CONT=0\n FOR I=1:1:$LENGTH(X,\",\") DO\n .SET NOTFIRST=$LENGTH(Y),CURR=$PIECE(X,\",\",I),NEXT=$PIECE(X,\",\",I+1)\n .FOR Q:$EXTRACT(CURR)'=\" \" S CURR=$EXTRACT(CURR,2,$LENGTH(CURR)) ;clean up leading spaces\n .S SEQ=((CURR-1)=PREV)&((CURR+1)=NEXT)\n .IF 'NOTFIRST SET Y=CURR\n .IF NOTFIRST DO\n ..;Order matters due to flags\n ..IF CONT&SEQ ;Do nothing\n ..IF 'CONT&'SEQ SET Y=Y_\",\"_CURR\n ..IF CONT&'SEQ SET Y=Y_CURR,CONT=0\n ..IF 'CONT&SEQ SET Y=Y_\"-\",CONT=1\n .SET PREV=CURR\n IF CONT SET Y=Y_PREV\n K I,CONT,NOTFIRST,CURR,PREV,NEXT,SEQ\n QUIT Y\n","language":"MUMPS"},{"code":"/*NetRexx program to test range extraction. ***************************\n* 07.08.2012 Walter Pachl derived from my Rexx Version\n* Changes: line continuation in aaa assignment changed\n* 1e99 -> 999999999\n* Do -> Loop\n* words(aaa) -> aaa.words()\n* word(aaa,i) -> aaa.word(i)\n**********************************************************************/\nSay 'NetRexx program derived from Rexx'\naaa='0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29'\naaa=aaa' 30 31 32 33 35 36 37 38 39'\nsay 'old='aaa;\naaa=aaa 999999999 /* artificial number at the end */\ni=0 /* initialize index */\nol='' /* initialize output string */\ncomma='' /* will become a ',' lateron */\ninrange=0\nLoop While i<=aaa.words /* loop for all numbers */\n i=i+1 /* index of next number */\n n=aaa.word(i) /* the now current number */\n If n=999999999 Then Leave /* we are at the end */\n If inrange Then Do /* range was opened */\n If aaa.word(i+1)<>n+1 Then Do /* following word not in range */\n ol=ol||n /* so this number is the end */\n inrange=0 /* and the range is over */\n End /* else ignore current number */\n End\n Else Do /* not in a range */\n ol=ol||comma||n /* add number (with comma) */\n comma=',' /* to the output string */\n If aaa.word(i+2)=n+2 Then Do /* if the nr after the next fits */\n inrange=1 /* open a range */\n ol=ol'-' /* append the range connector */\n End\n End\n End\nSay 'new='ol\n","language":"NetRexx"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary\n\nrunSample(arg)\nreturn\n\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\n-- Compact a list of numbers by reducing ranges\nmethod compact(expanded) public static\n nums = expanded.changestr(',', ' ').space -- remove possible commas & clean up the string\n rezult = ''\n\n RANGE = 0\n FIRST = nums.word(1) -- set starting value\n loop i_ = 2 to nums.words -- each word in the string is a number to examine\n LOCAL = nums.word(i_)\n if LOCAL - FIRST - RANGE == 1 then do\n -- inside a range\n RANGE = RANGE + 1\n end\n else do\n -- not inside a range\n if RANGE \\= 0 then do\n -- we have a range of numbers so collect this and reset\n rezult = rezult || FIRST || delim(RANGE) || FIRST + RANGE || ','\n RANGE = 0\n end\n else do\n -- just collect this number\n rezult = rezult || FIRST || ','\n end\n FIRST = LOCAL -- bump new starting value\n end\n end i_\n\n if RANGE \\= 0 then do\n -- terminating value is a range\n rezult = rezult || FIRST || delim(RANGE) || FIRST + RANGE\n end\n else do\n -- terminating value is a single number\n rezult = rezult || FIRST\n end\n\n return rezult.space(1, ',') -- format and return result string\n\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\n-- determine if the range delimiter should be a comma or dash\nmethod delim(range) private static\n if range == 1 then dlm = ','\n else dlm = '-'\n return dlm\n\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\n-- sample driver\nmethod runSample(arg) public static\n\nparse arg userInput\ntd = 0\nif userInput.words > 0 then do\n -- use input from command line\n td[0] = td[0] + 1; r_ = td[0]; td[r_] = userInput\n end\nelse do\n -- use canned test data\n td[0] = td[0] + 1; r_ = td[0]; td[r_] = ' -6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20'\n td[0] = td[0] + 1; r_ = td[0]; td[r_] = ' 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39'\n td[0] = td[0] + 1; r_ = td[0]; td[r_] = ' -4, -3, -2, 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39'\n end\n\nloop r_ = 1 to td[0]\n say 'Original: ' td[r_].changestr(',', ' ').space(1, ',')\n say 'Compacted:' compact(td[r_])\n say\n end r_\nreturn\n","language":"NetRexx"},{"code":"import parseutils, re, strutils, sequtils\n\nproc extractRange(input: string): string =\n var list = input.replace(re\"\\s+\").split(',').map(parseInt)\n var ranges: seq[string]\n var i = 0\n while i < list.len:\n var first = list[i] # first element in the current range\n var offset = i\n while True: # skip ahead to the end of the current range\n if i + 1 >= list.len:\n # reached end of the list\n break\n if list[i + 1] - (i + 1) != first - offset:\n # next element isn't in the current range\n break\n i.inc\n var last = list[i] # last element in the current range\n case last - first\n of 0: ranges.add($first)\n of 1: ranges.add(\"$1,$2\".format(first, last))\n else: ranges.add(\"$1-$2\".format(first, last))\n i.inc\n return ranges.join(\",\")\n\necho(\"\"\"\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39\"\"\".extractRange)\n","language":"Nim"},{"code":"MODULE RangeExtraction;\nIMPORT Out;\n\nPROCEDURE Range(s: ARRAY OF INTEGER);\nVAR\n\ti,j: INTEGER;\n\t\n\tPROCEDURE Emit(sep: CHAR);\n\tBEGIN\n\t\tIF i > 2 THEN\n\t\t\tOut.Int(s[j],3);Out.Char('-');Out.Int(s[j + i - 1],3);Out.Char(sep);\n\t\t\tINC(j,i)\n\t\tELSE\n\t\t\tOut.Int(s[j],3);Out.Char(sep);\n\t\t\tINC(j)\n\t\tEND;\n\tEND Emit;\n\t\nBEGIN\n\tj := 0;i := -1;\n\tLOOP\n\t\tINC(i);\n\t\tIF j + i >= LEN(s) THEN\n\t\t\tEmit(0AX);\n\t\t\tEXIT\n\t\tELSIF s[j + i] # (s[j] + i) THEN\n\t\t\tEmit(',');\n\t\t\ti := 0;\n\t\tEND\n\tEND\nEND Range;\n\nVAR\n\tseq0: ARRAY 33 OF INTEGER;\n\tseq1: ARRAY 20 OF INTEGER;\nBEGIN\n\tseq0[0] := 0;\n\tseq0[1] := 1;\n\tseq0[2] := 2;\n\tseq0[3] := 4;\n\tseq0[4] := 6;\n\tseq0[5] := 7;\n\tseq0[6] := 8;\n\tseq0[7] := 11;\n\tseq0[8] := 12;\n\tseq0[9] := 14;\n\tseq0[10] := 15;\n\tseq0[11] := 16;\n\tseq0[12] := 17;\n\tseq0[13] := 18;\n\tseq0[14] := 19;\n\tseq0[15] := 20;\n\tseq0[16] := 21;\n\tseq0[17] := 22;\n\tseq0[18] := 23;\n\tseq0[19] := 24;\n\tseq0[20] := 25;\n\tseq0[21] := 27;\n\tseq0[22] := 28;\n\tseq0[23] := 29;\n\tseq0[24] := 30;\n\tseq0[25] := 31;\n\tseq0[26] := 32;\n\tseq0[27] := 33;\n\tseq0[28] := 35;\n\tseq0[29] := 36;\n\tseq0[30] := 37;\n\tseq0[31] := 38;\n\tseq0[32] := 39;\n\tRange(seq0);\n\tseq1[0] := -6;\n\tseq1[1] := -3;\n\tseq1[2] := -2;\n\tseq1[3] := -1;\n\tseq1[4] := 0;\n\tseq1[5] := 1;\n\tseq1[6] := 3;\n\tseq1[7] := 4;\n\tseq1[8] := 5;\n\tseq1[9] := 7;\n\tseq1[10] := 8;\n\tseq1[11] := 9;\n\tseq1[12] := 10;\n\tseq1[13] := 11;\n\tseq1[14] := 14;\n\tseq1[15] := 15;\n\tseq1[16] := 17;\n\tseq1[17] := 18;\n\tseq1[18] := 19;\n\tseq1[19] := 20;\n\tRange(seq1)\nEND RangeExtraction.\n","language":"Oberon"},{"code":"class IdentityMatrix {\n function : Main(args : String[]) ~ Nil {\n Compress2Range(\"-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20\")->PrintLine();\n\n Compress2Range(\"0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39\")->PrintLine();\n }\n\n function : Compress2Range(expanded : String) ~ String {\n result := \"\";\n nums := expanded->ReplaceAll(\" \", \"\")->Split(\",\");\n firstNum := nums[0]->ToInt();\n rangeSize := 0;\n for(i:= 1; i < nums->Size(); i += 1;) {\n thisNum := nums[i]->ToInt();\n if(thisNum - firstNum - rangeSize = 1) {\n rangeSize += 1;\n }\n else{\n if(rangeSize <> 0){\n result->Append(firstNum);\n result->Append((rangeSize = 1) ? \",\": \"-\");\n result->Append(firstNum+rangeSize);\n result->Append(\",\");\n rangeSize := 0;\n }\n else {\n result->Append(firstNum);\n result->Append(\",\");\n };\n firstNum := thisNum;\n };\n };\n\n if(rangeSize <> 0){\n result->Append(firstNum);\n result->Append((rangeSize = 1) ? \",\" : \"-\");\n result->Append(firstNum + rangeSize);\n rangeSize := 0;\n }\n else {\n result->Append(firstNum);\n };\n\n return result;\n }\n}\n","language":"Objeck"},{"code":"#import <Foundation/Foundation.h>\n\nNSString *extractRanges(NSArray *nums) {\n NSMutableIndexSet *indexSet = [[NSMutableIndexSet alloc] init];\n for (NSNumber *n in nums) {\n if ([n integerValue] < 0)\n @throw [NSException exceptionWithName:NSInvalidArgumentException reason:@\"negative number not supported\" userInfo:nil];\n [indexSet addIndex:[n unsignedIntegerValue]];\n }\n NSMutableString *s = [[NSMutableString alloc] init];\n [indexSet enumerateRangesUsingBlock:^(NSRange range, BOOL *stop) {\n if (s.length)\n [s appendString:@\",\"];\n if (range.length == 1)\n [s appendFormat:@\"%lu\", range.location];\n else if (range.length == 2)\n [s appendFormat:@\"%lu,%lu\", range.location, range.location+1];\n else\n [s appendFormat:@\"%lu-%lu\", range.location, range.location+range.length-1];\n }];\n return s;\n}\n\nint main() {\n @autoreleasepool {\n\n NSLog(@\"%@\", extractRanges(@[@0, @1, @2, @4, @6, @7, @8, @11, @12, @14,\n @15, @16, @17, @18, @19, @20, @21, @22, @23, @24,\n @25, @27, @28, @29, @30, @31, @32, @33, @35, @36,\n @37, @38, @39]));\n\n }\n return 0;\n}\n","language":"Objective-C"},{"code":"let range_extract = function\n | [] -> []\n | x::xs ->\n let f (i,j,ret) k =\n if k = succ j then (i,k,ret) else (k,k,(i,j)::ret) in\n let (m,n,ret) = List.fold_left f (x,x,[]) xs in\n List.rev ((m,n)::ret)\n\nlet string_of_range rng =\n let str (a,b) =\n if a = b then string_of_int a\n else Printf.sprintf \"%d%c%d\" a (if b = succ a then ',' else '-') b in\n String.concat \",\" (List.map str rng)\n\nlet () =\n let li =\n [ 0; 1; 2; 4; 6; 7; 8; 11; 12; 14; 15; 16; 17; 18; 19; 20; 21;\n 22; 23; 24; 25; 27; 28; 29; 30; 31; 32; 33; 35; 36; 37; 38; 39 ]\n in\n let rng = range_extract li in\n print_endline(string_of_range rng)\n","language":"OCaml"},{"code":"(define (extract ll)\n (let loop ((head (car ll)) (tail (cdr ll)) (out #null))\n (if (null? tail)\n (reverse (cons head out))\n else\n (cond\n ((eq? head (- (car tail) 1))\n (loop (list (car tail) head) (cdr tail) out))\n ((and (pair? head) (eq? (car head) (- (car tail) 1)))\n (loop (cons (car tail) head) (cdr tail) out))\n (else\n (loop (car tail) (cdr tail) (cons head out)))))))\n\n(define (range->string range)\n (fold (lambda (f v)\n (string-append (if f (string-append f \",\") \"\")\n (if (pair? v)\n (string-append (string-append (number->string (last v #f)) \"-\")(number->string (car v)))\n (number->string v))))\n #false\n range))\n\n; let's test\n(define data '(0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39))\n(define range (extract data))\n\n(print \"extracted ranges: \" range)\n(print \"string representation: \" (range->string range))\n","language":"Ol"},{"code":"/* Rexx */\n\nparse arg userInput\ncall runSample userInput\nreturn\nexit\n\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\n-- Compact a list of numbers by reducing ranges\ncompact:\nprocedure\n--trace ?r;nop\n parse arg expanded\n nums = expanded~changestr(',', ' ')~space -- remove possible commas & clean up the string\n rezult = ''\n\n RANGE = 0\n FIRST = nums~word(1) -- set starting value\n loop i_ = 2 to nums~words -- each word in the string is a number to examine\n LOCAL = nums~word(i_)\n if LOCAL - FIRST - RANGE == 1 then do\n -- inside a range\n RANGE += 1\n end\n else do\n -- not inside a range\n if RANGE \\= 0 then do\n -- we have a range of numbers so collect this and reset\n rezult = rezult || FIRST || delim(RANGE) || FIRST + RANGE || ','\n RANGE = 0\n end\n else do\n -- just collect this number\n rezult = rezult || FIRST || ','\n end\n FIRST = LOCAL -- bump new starting value\n end\n end i_\n if RANGE \\= 0 then do\n -- collect terminating value (a range)\n rezult = rezult || FIRST || delim(RANGE) || FIRST + RANGE\n end\n else do\n -- collect terminating value (a single number)\n rezult = rezult || FIRST\n end\n\n return rezult~space(1, ',') -- format and return result string\n\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\n-- determine if the range delimiter should be a comma or dash\ndelim:\nprocedure\n parse arg range .\n if range == 1 then dlm = ','\n else dlm = '-'\n return dlm\n\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\n-- sample driver\nrunSample:\nprocedure\nparse arg userInput\ntd. = 0\nif userInput~words > 0 then do\n td.0 += 1; r_ = td.0; td.r_ = userInput\n end\nelse do\n td.0 += 1; r_ = td.0; td.r_ = '-6 -3 -2 -1 0 1 3 4 5 7 8 9 10 11 14 15 17 18 19 20'\n td.0 += 1; r_ = td.0; td.r_ = '0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39'\n td.0 += 1; r_ = td.0; td.r_ = '-4, -3, -2, 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39'\n end\n\nloop r_ = 1 to td.0\n say 'Original: ' td.r_~changestr(',', ' ')~space(1, ',')\n say 'Compacted:' compact(td.r_)\n say\n end r_\nreturn\n","language":"OoRexx"},{"code":" int ints(100)\n\nints={\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39\n}\n\n\n' RESULT:\n' 0-2, 4, 6-8, 11, 12, 14-25, 27-33, 35-39\n\n\n\n function Ranges(int*i) as string\n '===============================\n string pr=\"\"\n int n=0\n int e=0\n int j=0\n int k=0\n int f=1\n do\n j++\n n=i(j)\n e=i(j+1)\n if e<j\n exit do\n endif\n if e=n+1 and i(j+2)=n+2 then 'LOOKAHEAD\n if f then k=n : f=0\n else\n if f=0 then\n pr+=k \"-\" i(j+1) \", \" 'RANGE OF VALUES\n j++\n f=1\n else\n pr+=n \", \" 'SINGLE VALUES\n end if\n end if\n loop\n return left pr, len(pr)-2\n end function\n\n\n print Ranges ints\n","language":"OxygenBasic"},{"code":"declare\n fun {Extract Xs}\n {CommaSeparated\n {Map {ExtractRanges Xs} RangeToString}}\n end\n\n fun {ExtractRanges Xs}\n fun {Loop Ys Start End}\n case Ys\n of Y|Yr andthen Y == End+1 then {Loop Yr Start Y}\n [] Y|Yr then Start#End|{Loop Yr Y Y}\n [] nil then [Start#End]\n end\n end\n in\n case Xs\n of X|Xr then {Loop Xr X X}\n [] nil then nil\n end\n end\n\n fun {RangeToString S#E}\n if E-S >= 2 then\n {VirtualString.toString S#\"-\"#E}\n else\n {CommaSeparated\n {Map {List.number S E 1} Int.toString}}\n end\n end\n\n fun {CommaSeparated Xs}\n {Flatten {Intersperse \",\" Xs}}\n end\n\n fun {Intersperse Sep Xs}\n case Xs of X|Y|Xr then\n X|Sep|{Intersperse Sep Y|Xr}\n else\n Xs\n end\n end\nin\n {System.showInfo\n {Extract [ 0 1 2 4 6 7 8 11 12 14\n 15 16 17 18 19 20 21 22 23 24\n 25 27 28 29 30 31 32 33 35 36\n 37 38 39 ]}}\n","language":"Oz"},{"code":"program RangeExtractionApp;\n\n\n{$IFDEF FPC}\n {$mode objfpc}{$H+}\n{$ENDIF}\n\n\nuses\n {$IFDEF UNIX}{$IFDEF UseCThreads}\n cthreads,\n {$ENDIF}{$ENDIF}\n SysUtils;\n\nfunction RangeExtraction(const Seq: array of integer): String;\nconst\n SubSeqLen = 3; // minimal length of the range, can be changed.\nvar\n i, j: Integer;\n Separator: string;\nbegin\n Separator:= '';\n Result := '';\n i := Low(Seq);\n while i <= High(Seq) do\n begin\n j := i;\n // All subsequent values, starting from i, up to High(Seq) possibly\n while ((j < High(Seq)) and ((Seq[j+1]-Seq[j]) = 1)) do\n Inc(j);\n // is it a range ?\n if ((j-i) >= (SubSeqLen-1)) then\n begin\n Result := Result + Format(Separator+'%d-%d',[Seq[i],Seq[j]]);\n i := j+1; // Next value to be processed\n Separator := ',';\n end\n else\n begin\n // Loop, to process the case SubSeqLen > 3\n while i<=j do\n begin\n Result := Result + Format(Separator+'%d',[Seq[i]]);\n Inc(i); // Next value to be processed\n Separator := ',';\n end;\n end;\n end;\nEnd;\n\nprocedure DisplayRange(const Seq: array of integer);\nvar\n i: Integer;\nbegin\n Write(Format('[%d', [Seq[Low(Seq)]]));\n for i := Low(Seq) + 1 to High(Seq) do\n Write(Format(',%d', [Seq[i]]));\n WriteLn('] => ' + RangeExtraction(Seq));\n WriteLn;\nEnd;\n\nbegin\n DisplayRange([0]);\n DisplayRange([0,1]);\n DisplayRange([0,2]);\n DisplayRange([0,1,2]);\n DisplayRange([0,1,2,3]);\n DisplayRange([0,1,2,3,4,5,6,7]);\n DisplayRange([0,2,3,4,5,6,7,9]);\n DisplayRange([0,2,4,6,8,10]);\n DisplayRange([0,1,2,3,4,5,6,7,9]);\n DisplayRange([0,1,2,3,4,6,9,10,11,12]);\n\n DisplayRange([\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39]);\n {$IFNDEF UNIX}readln;{$ENDIF}\nend.\n","language":"Pascal"},{"code":"sub rangext {\n my $str = join ' ', @_;\n 1 while $str =~ s{([+-]?\\d+) ([+-]?\\d+)}\n {$1.(abs($2 - $1) == 1 ? '~' : ',').$2}eg; # abs for neg ranges\n $str =~ s/(\\d+)~(?:[+-]?\\d+~)+([+-]?\\d+)/$1-$2/g;\n $str =~ tr/~/,/;\n return $str;\n}\n\n# Test and display\nmy @test = qw(0 1 2 4 6 7 8 11 12 14\n 15 16 17 18 19 20 21 22 23 24\n 25 27 28 29 30 31 32 33 35 36\n 37 38 39);\nprint rangext(@test), \"\\n\";\n","language":"Perl"},{"code":"use Set::IntSpan;\nsub rangext { return Set::IntSpan->new(@_) . '' } # stringized\n","language":"Perl"},{"code":"use Set::IntSpan::Fast;\nsub rangext { return Set::IntSpan::Fast->new(@_)->as_string }\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">spout</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">first</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">curr</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">first</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">curr</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">first</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">sep</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">first</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">curr</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">','</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">'-'</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%d%s%d\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">first</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">sep</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">curr</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">extract_ranges</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">first</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">out</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]!=</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">out</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">spout</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">first</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)&</span><span style=\"color: #008000;\">','</span>\n <span style=\"color: #000000;\">first</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">i</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">out</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">spout</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">first</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">out</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">14</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">15</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">16</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">17</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">18</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">19</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">21</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">22</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">23</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">24</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">25</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">27</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">28</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">29</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">30</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">31</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">33</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">35</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">36</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">37</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">38</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">39</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">extract_ranges</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">)})</span>\n<!--\n","language":"Phix"},{"code":"include ..\\Utilitys.pmt\n\n( ) var res\n( )\n( 0 1 2 4 6 7 8 11 12 14\n 15 16 17 18 19 20 21 22 23 24\n 25 27 28 29 30 31 32 33 35 36\n 37 38 39 )\n\ndef append\n 1 get swap -1 get rot swap\n 2 tolist res swap 0 put var res\nenddef\n\ndef printRes\n res len for\n get\n 1 get swap 2 get nip\n over over == if\n drop print\n else\n over over - abs 1 > if \"-\" else \",\" endif\n rot print print print\n endif\n \",\" print\n endfor\n drop\n 8 tochar print \" \" print\nenddef\n\n1 get rot swap 0 put swap\n\nlen 2 swap 2 tolist for\n get var num\n swap -1 get 1 + num != if\n append\n flush\n endif\n num 0 put swap\nendfor\nswap\nappend\n\nclear\n\nprintRes\n","language":"Phixmonti"},{"code":"include ..\\Utilitys.pmt\n\n( 0 1 2 4 6 7 8 11 12 14\n 15 16 17 18 19 20 21 22 23 24\n 25 27 28 29 30 31 32 33 35 36\n 37 38 39 )\n\nlen get var fin\n2 var i\ni get fin == not\nwhile\n i 1 - get var prev\n i get prev - 1 != if\n inf i put\n i 1 + var i\n endif\n i 1 + var i\n i get fin == not\nendwhile\ninf 0 put\n\ndef printEnd print \",\" print enddef\n\n1 var ini\n\nlen for\n var i\n i get inf == if\n i ini - ini swap slice\n -1 get swap 1 get nip\n over over == if drop printEnd\n else over over - 1 == if printEnd printEnd\n else print \"-\" print printEnd\n endif\n endif\n i 1 + var ini\n endif\nendfor\n8 tochar print \" \" print\n","language":"Phixmonti"},{"code":"include ..\\Utilitys.pmt\n\n( 0 1 2 4 6 7 8 11 12 14\n 15 16 17 18 19 20 21 22 23 24\n 25 27 28 29 30 31 32 33 35 36\n 37 38 39 )\n\ninf 0 put\n\ndef printEnd print \",\" print enddef\n\n2 var i\n1 var ini\n\ni get inf == not\nwhile\n i 1 - get var prev\n i get var act\n act prev - 1 != if\n i ini -\n dup 2 == if drop ini get prev swap printEnd printEnd else\n dup 1 == if drop prev printEnd else\n drop ini get print \"-\" print prev printEnd\n endif\n endif\n i var ini\n endif\n i 1 + var i\n act inf == not\nendwhile\n8 tochar print \" \" print\n","language":"Phixmonti"},{"code":"include ..\\Utilitys.pmt\n\ndef glue /# l o -- l #/\n var ob\n len 2 * 1 - 2 swap 2 3 tolist for\n ob swap put\n endfor\nenddef\n\n( )\n\n( 0 1 2 4 6 7 8 11 12 14\n 15 16 17 18 19 20 21 22 23 24\n 25 27 28 29 30 31 32 33 35 36\n 37 38 39 )\n\nlen for drop\n pop swap dup var N var M\n len for drop\n head M 1 + == if\n pop swap var M\n else\n exitfor\n endif\n endfor\n swap\n N M == if N tostr 0 put else\n N 1 + M == if N tostr 0 put M tostr 0 put else\n N tostr \"-\" M tostr chain chain 0 put\n endif\n endif\n swap\n len 0 == if\n drop\n exitfor\n endif\nendfor\n\n\",\" glue lprint\n","language":"Phixmonti"},{"code":"go =>\n Lists = [\n [-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9,\n 10, 11, 14, 15, 17, 18, 19, 20],\n [ 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17,\n 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31,\n 32, 33, 35, 36, 37, 38, 39],\n 1..20,\n [13],\n [11,12,13,15]\n ].\n foreach(List in Lists)\n println(List),\n println(make_ranges(List)),\n nl\n end,\n nl.\n\n\nmake_ranges(L) = Res =>\n Ranges = [],\n Range = [L[1]],\n\n % Identify the range\n foreach(I in 2..L.length)\n Li1 = L[I-1],\n Li = L[I],\n if Li == Li1+1 then\n Range := Range ++ [Li]\n else\n if length(Range) > 0 then\n Ranges := Ranges ++ [Range]\n end,\n Range := [] ++ [Li]\n end\n end,\n % pickup the last range\n if length(Range) > 0 then\n Ranges := Ranges ++ [Range]\n end,\n Res := join([get_range(R) : R in Ranges], \",\").\n\n\n% Convert to range representation\nget_range(R) =\n cond(R.length == 1,\n R.first().to_string(),\n min(R).to_string() ++ \"-\" ++ max(R).to_string()).\n","language":"Picat"},{"code":"(de rangeextract (Lst)\n (glue \",\"\n (make\n (while Lst\n (let (N (pop 'Lst) M N)\n (while (= (inc M) (car Lst))\n (setq M (pop 'Lst)) )\n (cond\n ((= N M) (link N))\n ((= (inc N) M) (link N M))\n (T (link (list N '- M))) ) ) ) ) ) )\n","language":"PicoLisp"},{"code":"/* Modified 19 November 2011 to meet requirement that there be at */\n/* least 3 items in a run. */\nrange_extraction: /* 17 August 2010 */\n procedure options (main);\n declare (c, d) character (1);\n declare (old, new, initial) fixed binary (31);\n declare in file;\n declare out file output;\n\n open file (in) title ('/range2.dat,type(text),recsize(80)' );\n open file (out) output title ('/range2.out,type(text),recsize(70)');\n\n c = ' '; d = ',';\n get file (in) list (old);\n do forever;\n initial = old;\n on endfile (in) begin;\n put file (out) edit (c, trim(old)) (a);\n stop;\n end;\n get file (in) list (new);\n if new = old+1 then\n do; /* we have a run. */\n on endfile (in) begin;\n if old > initial+1 then d = '-';\n put file (out) edit (c, trim(initial), d, trim(old) ) (a);\n stop;\n end;\n do while (new = old+1);\n old = new;\n get file (in) list (new);\n end;\n /* At this point, old holds the last in a run; */\n /* initial holds the first in a run. */\n /* if there are only two members in a run, don't use the */\n /* range notation. */\n if old > initial+1 then d = '-';\n put file (out) edit (c, trim(initial), d, trim(old) ) (a);\n old = new;\n end;\n else /* we have an isolated value. */\n do;\n put file (out) edit (c, trim(old)) (a);\n old = new;\n end;\n c, d = ',';\n end;\nend range_extraction;\n","language":"PL-I"},{"code":" 0-2,4,6-8,11-12,14-25,27-33,35-39\n","language":"PL-I"},{"code":"function range-extraction($arr) {\n if($arr.Count -gt 2) {\n $a, $b, $c, $arr = $arr\n $d = $e = $c\n if((($a + 1) -eq $b) -and (($b + 1) -eq $c)) {\n $test = $true\n while($arr -and $test) {\n $d = $e\n $e, $arr = $arr\n $test = ($d+1) -eq $e\n }\n if($test){\"$a-$e\"}\n elseif((-not $arr) -and $test){\"$a-$d\"}\n elseif(-not $arr){\"$a-$d,$e\"}\n else{\"$a-$d,\" + (range-extraction (@($e)+$arr))}\n }\n elseif(($b + 1) -eq $c) {\"$a,\" + (range-extraction (@($b, $c)+$arr))}\n else {\"$a,$b,\" + (range-extraction (@($c)+$arr))}\n } else {\n switch($arr.Count) {\n 0 {\"\"}\n 1 {\"$arr\"}\n 2 {\"$($arr[0]),$($arr[1])\"}\n }\n }\n}\nrange-extraction @(0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n37, 38, 39)\n","language":"PowerShell"},{"code":"range_extract :-\n\tL = [0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n\t 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n\t 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n\t 37, 38, 39] ,\n\twriteln(L),\n\tpack_Range(L, LP),\n\tmaplist(study_Range, R, LP),\n\textract_Range(LA, R),\n\tatom_chars(A, LA),\n\twriteln(A).\n\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% extract_Range(?In, ?Out)\n% In : '-6,-3--1,3-5,7-11,14,15,17-20' =>\n% Out : [-6], [-3--1], [3-5],[7-11], [14],[15], [17-20]\n%\nextract_Range([], []).\n\n\nextract_Range(X , [Range | Y1]) :-\n\tget_Range(X, U-U, Range, X1),\n\textract_Range(X1, Y1).\n\n\n\nget_Range([], Range-[], Range, []).\nget_Range([','|B], Range-[], Range, B) :- !.\n\nget_Range([A | B], EC, Range, R) :-\n\tappend_dl(EC, [A | U]-U, NEC),\n\tget_Range(B, NEC, Range, R).\n\n\nappend_dl(X-Y, Y-Z, X-Z).\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%\n% study Range(?In, ?Out)\n% In : [-6]\n% Out : [-6,-6]\n%\n% In : [-3--1]\n% Out : [-3, -1]\n%\nstudy_Range(Range1, [Deb, Deb]) :-\n catch(number_chars(Deb, Range1), Deb, false).\n\nstudy_Range(Range1, [Deb, Fin]) :-\n append(A, ['-'|B], Range1),\n A \\= [],\n number_chars(Deb, A),\n number_chars(Fin, B).\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%\n:- use_module(library(clpfd)).\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n%\n% Pack Range(?In, ?Out)\n% In : -6,\n% Out : [-6]\n%\n% In : -3, -2,-1\n% Out : [-3,-1]\n%\npack_Range([],[]).\n\npack_Range([X|Rest],[[X | V]|Packed]):-\n run(X,Rest, [X|V], RRest),\n pack_Range(RRest,Packed).\n\n\n\nrun(Fin,[Other|RRest], [Deb, Fin],[Other|RRest]):-\n\tFin #\\= Deb,\n\tFin #\\= Deb + 1,\n\tOther #\\= Fin+1.\n\nrun(Fin,[],[_Var, Fin],[]).\n\nrun(Var,[Var1|LRest],[Deb, Fin], RRest):-\n\tFin #\\= Deb,\n\tFin #\\= Deb + 1,\n\tVar1 #= Var + 1,\n\trun(Var1,LRest,[Deb, Fin], RRest).\n\nrun(Val,[Other|RRest], [Val, Val],[Other|RRest]).\n","language":"Prolog"},{"code":"DataSection\n Data.i 33 ;count of elements to be read\n Data.i 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24\n Data.i 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39\nEndDataSection\n\nNewList values()\n;setup list\nDefine elementCount, i\nRead.i elementCount\nFor i = 1 To elementCount\n AddElement(values()): Read.i values()\nNext\n\nProcedure.s rangeExtract(List values())\n Protected listSize = ListSize(values()) - 1\n Protected rangeMarker, rangeStart, rangeIncrement, retraceSteps, rangeSize, endOfRange, output.s, sub.s\n\n ForEach values()\n rangeStart = values():\n sub = Str(rangeStart)\n If NextElement(values())\n retraceSteps = 1\n rangeIncrement = values() - rangeStart\n If rangeIncrement = 1 Or rangeIncrement = -1\n ;found start of possible range\n If ListIndex(values()) <> listSize\n retraceSteps = 2\n rangeSize = 2\n endOfRange = #False\n rangeMarker = values()\n While NextElement(values())\n If values() - rangeMarker <> rangeIncrement\n endOfRange = #True\n Break\n EndIf\n rangeSize + 1\n rangeMarker = values()\n Wend\n\n If rangeSize > 2\n sub = Str(rangeStart) + \"-\" + Str(rangeMarker)\n If Not endOfRange\n retraceSteps = 0 ;at end of list\n Else\n retraceSteps = 1\n EndIf\n EndIf\n EndIf\n EndIf\n\n ;return to the value before look-aheads\n While retraceSteps > 0\n PreviousElement(values()): retraceSteps - 1\n Wend\n EndIf\n\n output + sub + \",\"\n Next\n\n ProcedureReturn RTrim(output, \",\")\nEndProcedure\n\nIf OpenConsole()\n PrintN(rangeExtract(values()))\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\")\n Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"def range_extract(lst):\n 'Yield 2-tuple ranges or 1-tuple single elements from list of increasing ints'\n lenlst = len(lst)\n i = 0\n while i< lenlst:\n low = lst[i]\n while i <lenlst-1 and lst[i]+1 == lst[i+1]: i +=1\n hi = lst[i]\n if hi - low >= 2:\n yield (low, hi)\n elif hi - low == 1:\n yield (low,)\n yield (hi,)\n else:\n yield (low,)\n i += 1\n\ndef printr(ranges):\n print( ','.join( (('%i-%i' % r) if len(r) == 2 else '%i' % r)\n for r in ranges ) )\n\nif __name__ == '__main__':\n for lst in [[-8, -7, -6, -3, -2, -1, 0, 1, 3, 4, 5, 7,\n 8, 9, 10, 11, 14, 15, 17, 18, 19, 20],\n [0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22,\n 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39]]:\n #print(list(range_extract(lst)))\n printr(range_extract(lst))\n","language":"Python"},{"code":"def range_extract(iterable):\n '''Assumes iterable is sorted sequentially. Returns iterator of range tuples.'''\n it = iter(iterable)\n\n try:\n i = next(it)\n except StopIteration:\n return\n\n while True:\n low = i\n\n try:\n j = next(it)\n except StopIteration:\n yield (low, )\n return\n while i + 1 == j:\n i_next = j\n try:\n j = next(it)\n except StopIteration:\n yield (low, j)\n return\n i = i_next\n\n hi = i\n\n if hi - low >= 2:\n yield (low, hi)\n elif hi - low == 1:\n yield (low,)\n yield (hi,)\n else:\n yield (low,)\n\n i = j\n\ndef printr(ranges):\n print( ','.join( (('%i-%i' % r) if len(r) == 2 else '%i' % r)\n for r in ranges ) )\n\nif __name__ == '__main__':\n for lst in [[-8, -7, -6, -3, -2, -1, 0, 1, 3, 4, 5, 7,\n 8, 9, 10, 11, 14, 15, 17, 18, 19, 20],\n [0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22,\n 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39]]:\n #print(list(range_extract(lst)))\n printr(range_extract(lst))\n","language":"Python"},{"code":"class PushableIter():\n \"Can push items back on iterable\"\n def __init__(self, it):\n self.it = iter(it)\n self.pushed = []\n\n def push(self, item):\n self.pushed.append(item)\n\n def pop(self):\n return self.pushed.pop(0) if self.pushed else self.it.__next__()\n\n def __iter__(self):\n return self\n\n def __next__(self):\n return self.pop()\n\ndef range_extractp(sorted_iterable):\n 'Yield 2-tuple ranges or 1-tuple single elements from iter of increasing ints'\n rest = PushableIter(sorted_iterable)\n for this in rest:\n low = hi = last = this\n for nxt in rest: # Find upper range on incremented values\n if nxt == last + 1:\n last = hi = nxt\n else: # Out of (sub)-range\n rest.push(nxt)\n break\n if hi - low >= 2:\n yield (low, hi)\n elif hi - low == 1:\n yield (low,)\n yield (hi,)\n else:\n yield (low,)\n","language":"Python"},{"code":"'''Range extraction'''\n\nfrom functools import reduce\n\n\n# rangeFormat :: [Int] -> String\ndef rangeFormat(xs):\n '''Range-formatted display string for\n a list of integers.\n '''\n return ','.join([\n rangeString(x) for x\n in splitBy(lambda a, b: 1 < b - a)(xs)\n ])\n\n\n# rangeString :: [Int] -> String\ndef rangeString(xs):\n '''Start and end of xs delimited by hyphens\n if there are more than two integers.\n Otherwise, comma-delimited xs.\n '''\n ys = [str(x) for x in xs]\n return '-'.join([ys[0], ys[-1]]) if 2 < len(ys) else (\n ','.join(ys)\n )\n\n\n# TEST ----------------------------------------------------\n# main :: IO ()\ndef main():\n '''Test'''\n\n xs = [\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39\n ]\n print(\n __doc__ + ':\\n[' + '\\n'.join(map(\n lambda x: ' ' + repr(x)[1:-1],\n chunksOf(11)(xs)\n )) + \" ]\\n\\n -> '\" + rangeFormat(xs) + \"'\\n\"\n )\n\n\n# GENERIC -------------------------------------------------\n\n# chunksOf :: Int -> [a] -> [[a]]\ndef chunksOf(n):\n '''A series of lists of length n,\n subdividing the contents of xs.\n Where the length of xs is not evenly divible,\n the final list will be shorter than n.'''\n return lambda xs: reduce(\n lambda a, i: a + [xs[i:n + i]],\n range(0, len(xs), n), []\n ) if 0 < n else []\n\n\n# splitBy :: (a -> a -> Bool) -> [a] -> [[a]]\ndef splitBy(p):\n '''A list split wherever two consecutive\n items match the binary predicate p.\n '''\n # step :: ([[a]], [a], a) -> a -> ([[a]], [a], a)\n def step(acp, x):\n acc, active, prev = acp\n return (acc + [active], [x], x) if p(prev, x) else (\n (acc, active + [x], x)\n )\n\n # go :: [a] -> [[a]]\n def go(xs):\n if 2 > len(xs):\n return xs\n else:\n h = xs[0]\n ys = reduce(step, xs[1:], ([], [h], h))\n # The accumulated sublists, and the current group.\n return ys[0] + [ys[1]]\n\n return lambda xs: go(xs)\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"(define make-range\n Start Start -> [\",\" Start]\n Start End -> [\",\" Start \",\" End] where (= End (+ Start 1))\n Start End -> [\",\" Start \"-\" End])\n\n(define range-extract-0\n Start End [] -> (make-range Start End)\n Start End [A|As] -> (range-extract-0 Start A As) where (= (+ 1 End) A)\n Start End [A|As] -> (append (make-range Start End) (range-extract-0 A A As)))\n\n(define range-extract\n [A |As] -> (FORMAT NIL \"~{~a~}\" (tail (range-extract-0 A A As))))\n\n(range-extract [ 0 1 2 4 6 7 8 11 12 14\n 15 16 17 18 19 20 21 22 23 24\n 25 27 28 29 30 31 32 33 35 36\n 37 38 39])\n","language":"Qi"},{"code":"REM Range extraction\nDECLARE FUNCTION RangeExtract$ (RS$)\n\nRange$ = \" 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, \"\nRange$ = Range$ + \"15, 16, 17, 18, 19, 20, 21, 22, 23, 24, \"\nRange$ = Range$ + \"25, 27, 28, 29, 30, 31, 32, 33, 35, 36, \"\nRange$ = Range$ + \"37, 38, 39\"\nPRINT RangeExtract$(Range$)\nEND\n\nFUNCTION RangeExtract$ (RS$)\n TS$ = \"\": I% = 0\n F% = VAL(RS$)\n DO\n I% = INSTR(I% + 1, RS$, \",\")\n T% = VAL(MID$(RS$, I% + 1))\n IF T% = F% + R% + 1 THEN\n R% = R% + 1\n ELSE\n SELECT CASE R%\n CASE 0\n TS$ = TS$ + LTRIM$(STR$(F%)) + \",\"\n CASE 1\n TS$ = TS$ + LTRIM$(STR$(F%)) + \",\" + LTRIM$(STR$(F% + R%)) + \",\"\n CASE ELSE\n TS$ = TS$ + LTRIM$(STR$(F%)) + \"-\" + LTRIM$(STR$(F% + R%)) + \",\"\n END SELECT\n R% = 0: F% = T%\n END IF\n LOOP WHILE I% <> 0\n RangeExtract$ = LEFT$(TS$, LEN(TS$) - 1)\nEND FUNCTION\n","language":"QuickBASIC"},{"code":"extract.range = function(v) {\n r <- c(1, which(diff(v) != 1) + 1, length(v) + 1)\n paste0(collapse=\",\",\n v[head(r, -1)],\n ifelse(diff(r) == 1,\n \"\",\n paste0(ifelse(diff(r) == 2, \",\", \"-\"),\n v[r[-1] - 1])))\n}\n\n\nprint(extract.range(c(\n -6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20)))\nprint(extract.range(c(\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22,\n 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39)))\n","language":"R"},{"code":"#lang racket\n\n(define (list->ranges xs)\n (define (R lo hi)\n (if (= lo hi) (~a lo) (~a lo (if (= 1 (- hi lo)) \",\" \"-\") hi)))\n (let loop ([xs xs] [lo #f] [hi #f] [r '()])\n (cond [(null? xs) (string-join (reverse (if lo (cons (R lo hi) r) r)) \",\")]\n [(not hi) (loop (cdr xs) (car xs) (car xs) r)]\n [(= 1 (- (car xs) hi)) (loop (cdr xs) lo (car xs) r)]\n [else (loop xs #f #f (cons (R lo hi) r))])))\n\n(list->ranges '(0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23\n 24 25 27 28 29 30 31 32 33 35 36 37 38 39))\n;; -> \"0-2,4,6-8,11,12,14-25,27-33,35-39\"\n","language":"Racket"},{"code":"sub range-extraction (*@ints) {\n my $prev = NaN;\n my @ranges;\n\n for @ints -> $int {\n if $int == $prev + 1 {\n @ranges[*-1].push: $int;\n }\n else {\n @ranges.push: [$int];\n }\n $prev = $int;\n }\n join ',', @ranges.map: -> @r { @r > 2 ?? \"@r[0]-@r[*-1]\" !! @r }\n}\n\nsay range-extraction\n -6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20;\n\nsay range-extraction\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39;\n","language":"Raku"},{"code":"/*REXX program creates a range extraction from a list of numbers (can be negative.) */\nold=0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39\n#= words(old) /*number of integers in the number list*/\nnew= /*the new list, possibly with ranges. */\n do j=1 to #; z= word(old, j) /*obtain Jth number in the old list. */\n inc= 1; new= new','z /*append \" \" to \" new \" */\n do k=j+1 to #; y= word(old, k) /*get the Kth number in the number list*/\n if y\\==z+inc then leave /*is this number not > previous by inc?*/\n inc= inc + 1; g= y /*increase the range, assign G (good).*/\n end /*k*/\n if k-1=j | g=z+1 then iterate /*Is the range=0│1? Then keep truckin'*/\n new= new'-'g; j= k - 1 /*indicate a range of #s; change index*/\n end /*j*/\n /*stick a fork in it, we're all done. */\nnew= substr(new, 2) /*elide the leading comma in the range.*/\nsay 'old:' old; say 'new:' new /*show the old and new range of numbers*/\n","language":"REXX"},{"code":"/*REXX program creates a range extraction from a list of numbers (can be negative.) */\nold=0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39\n#= words(old); j= 0 /*number of integers in the number list*/\nnew= /*the new list, possibly with ranges. */\n do while j<#; j= j + 1; z= word(old, j) /*get the Jth number in the number list*/\n inc= 1; new= new','z /*append \" \" to \" new \" */\n do k=j+1 to #; y= word(old, k) /*get the Kth number in the number list*/\n if y\\==z+inc then leave /*is this number not > previous by inc?*/\n inc= inc + 1; g= y /*increase the range, assign G (good).*/\n end /*k*/\n if k-1=j | g=z+1 then iterate /*Is the range=0│1? Then keep truckin'*/\n new= new'-'g; j= k - 1 /*indicate a range of numbers; change J*/\n end /*while*/\n /*stick a fork in it, we're all done. */\nnew= substr(new, 2) /*elide the leading comma in the list. */\nsay 'old:' old; say 'new:' new /*show the old and new range of numbers*/\n","language":"REXX"},{"code":"/*REXX program to test range extraction. ******************************\n* 07.08.2012 Walter Pachl\n**********************************************************************/\naaa='0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29',\n '30 31 32 33 35 36 37 38 39'\nsay 'old='aaa;\naaa=aaa 1e99 /* artificial number at the end */\ni=0 /* initialize index */\nol='' /* initialize output string */\ncomma='' /* will become a ',' lateron */\ninrange=0\nDo While i<=words(aaa) /* loop for all numbers */\n i=i+1 /* index of next number */\n n=word(aaa,i) /* the now current number */\n If n=1e99 Then Leave /* we are at the end */\n If inrange Then Do /* range was opened */\n If word(aaa,i+1)<>n+1 Then Do /* following word not in range */\n ol=ol||n /* so this number is the end */\n inrange=0 /* and the range is over */\n End /* else ignore current number */\n End\n Else Do /* not in a range */\n ol=ol||comma||n /* add number (with comma) */\n comma=',' /* to the output string */\n If word(aaa,i+2)=n+2 Then Do /* if the nr after the next fits */\n inrange=1 /* open a range */\n ol=ol'-' /* append the range connector */\n End\n End\n End\nSay 'new='ol\n","language":"REXX"},{"code":"# Project : Range extraction\n\nint = \"0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39\"\nint = str2list(substr(int, \",\", nl))\nsumint = []\nintnew = 1\nfor n=1 to len(int)\n flag = 0\n nr = 0\n intnew = 0\n for m=n to len(int)-1\n if int[m] = int[m+1] - 1\n intnew = m+1\n flag = 1\n nr = nr + 1\n else\n exit\n ok\n next\n if flag = 1 and nr > 1\n if intnew != 0\n add(sumint, [n,intnew])\n n = m\n ok\n else\n add(sumint, [n,\"\"])\n ok\nnext\nshowarray(sumint)\n\nfunc showarray(vect)\n see \"[\"\n svect = \"\"\n for n = 1 to len(vect)\n if vect[n][2] != \"\"\n svect = svect +\"\" + int[vect[n][1]] + \"-\" + int[vect[n][2]] + \", \"\n else\n svect = svect +\"\" + int[vect[n][1]] + \", \"\n ok\n next\n svect = left(svect, len(svect) - 2)\n see svect\n see \"]\" + nl\n","language":"Ring"},{"code":"def range_extract(l)\n # pad the list with a big value, so that the last loop iteration will\n # append something to the range\n sorted, range = l.sort.concat([Float::MAX]), []\n canidate_number = sorted.first\n\n # enumerate over the sorted list in pairs of current number and next by index\n sorted.each_cons(2) do |current_number, next_number|\n # if there is a gap between the current element and its next by index\n if current_number.succ < next_number\n # if current element is our first or our next by index\n if canidate_number == current_number\n # put the first element or next by index into our range as a string\n range << canidate_number.to_s\n else\n # if current element is not the same as the first or next\n # add [first or next, first or next equals current add , else -, current]\n seperator = canidate_number.succ == current_number ? \",\" : \"-\"\n range << \"%d%s%d\" % [canidate_number, seperator, current_number]\n end\n # make the first element the next element\n canidate_number = next_number\n end\n end\n range.join(',')\nend\n\nlst = [\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39\n]\n\np rng = range_extract(lst)\n","language":"Ruby"},{"code":"ary = [0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39]\nputs ary.sort.slice_when{|i,j| i+1 != j}.map{|a| a.size<3 ? a : \"#{a[0]}-#{a[-1]}\"}.join(\",\")\n","language":"Ruby"},{"code":"use std::ops::Add;\n\nstruct RangeFinder<'a, T: 'a> {\n index: usize,\n length: usize,\n arr: &'a [T],\n}\n\nimpl<'a, T> Iterator for RangeFinder<'a, T> where T: PartialEq + Add<i8, Output=T> + Copy {\n type Item = (T, Option<T>);\n fn next(&mut self) -> Option<Self::Item> {\n if self.index == self.length {\n return None;\n }\n let lo = self.index;\n while self.index < self.length - 1 && self.arr[self.index + 1] == self.arr[self.index] + 1 {\n self.index += 1\n }\n let hi = self.index;\n self.index += 1;\n if hi - lo > 1 {\n Some((self.arr[lo], Some(self.arr[hi])))\n } else {\n if hi - lo == 1 {\n self.index -= 1\n }\n Some((self.arr[lo], None))\n }\n }\n}\n\nimpl<'a, T> RangeFinder<'a, T> {\n fn new(a: &'a [T]) -> Self {\n RangeFinder {\n index: 0,\n arr: a,\n length: a.len(),\n }\n }\n}\n\nfn main() {\n let input_numbers : &[i8] = &[0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39];\n for (i, (lo, hi)) in RangeFinder::new(&input_numbers).enumerate() {\n if i > 0 {print!(\",\")}\n print!(\"{}\", lo);\n if hi.is_some() {print!(\"-{}\", hi.unwrap())}\n }\n println!(\"\");\n}\n","language":"Rust"},{"code":"#![feature(zero_one)]\nuse std::num::One;\n","language":"Rust"},{"code":" impl<'a, T> Iterator for RangeFinder<'a, T> where T: PartialEq + Add<i8, Output=T> + Copy {\n","language":"Rust"},{"code":"impl<'a, T> Iterator for RangeFinder<'a, T> where T: PartialEq + Add<T, Output=T> + Copy + One {\n","language":"Rust"},{"code":" while self.index < self.length - 1 && self.arr[self.index + 1] == self.arr[self.index] + 1 {\n","language":"Rust"},{"code":" while self.index < self.length - 1 && self.arr[self.index + 1] == self.arr[self.index] + T::one() {\n","language":"Rust"},{"code":"object Range {\n def spanRange(ls:List[Int])={\n var last=ls.head\n ls span {x => val b=x<=last+1; last=x; b}\n }\n\n def toRangeList(ls:List[Int]):List[List[Int]]=ls match {\n case Nil => List()\n case _ => spanRange(ls) match {\n case (range, Nil) => List(range)\n case (range, rest) => range :: toRangeList(rest)\n }\n }\n\n def toRangeString(ls:List[List[Int]])=ls map {r=>\n if(r.size<3) r mkString \",\"\n else r.head + \"-\" + r.last\n } mkString \",\"\n\n def main(args: Array[String]): Unit = {\n var l=List(0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,\n 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39)\n println(toRangeString(toRangeList(l)))\n }\n}\n","language":"Scala"},{"code":"(define (make-range start end)\n (cond ((= start end)\n `(\",\" ,start))\n ((= end (+ start 1))\n `(\",\" ,start \",\" ,end))\n (else\n `(\",\" ,start \"-\" ,end))))\n\n(define (range-extract-0 start end a)\n (cond ((null? a)\n (make-range start end))\n ((= (+ 1 end) (car a))\n (range-extract-0 start (car a) (cdr a)))\n (else\n (append (make-range start end)\n (range-extract-0 (car a) (car a) (cdr a))))))\n\n(define (range-extract a)\n (apply string-append (map (lambda (x)\n (if (number? x)\n (number->string x)\n x))\n (cdr (range-extract-0 (car a) (car a) (cdr a))))))\n\n(range-extract '( 0 1 2 4 6 7 8 11 12 14\n 15 16 17 18 19 20 21 22 23 24\n 25 27 28 29 30 31 32 33 35 36\n 37 38 39))\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n\nconst func string: rangeExtraction (in array integer: numbers) is func\n result\n var string: rangeStri is \"\";\n local\n var integer: index is 1;\n var integer: index2 is 1;\n begin\n while index <= length(numbers) do\n while index2 <= pred(length(numbers)) and numbers[succ(index2)] = succ(numbers[index2]) do\n incr(index2);\n end while;\n if succ(index) < index2 then\n rangeStri &:= \",\" <& numbers[index] <& \"-\" <& numbers[index2];\n else\n while index <= index2 do\n rangeStri &:= \",\" <& numbers[index];\n incr(index);\n\tend while;\n end if;\n incr(index2);\n index := index2;\n end while;\n rangeStri := rangeStri[2 ..];\n end func;\n\nconst proc: main is func\n begin\n writeln(rangeExtraction([] (0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19,\n 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39)));\n end func;\n","language":"Seed7"},{"code":"* # Absolute value\n define('abs(n)') :(abs_end)\nabs abs = ~(abs = lt(n,0) -n) n :(return)\nabs_end\n\n define('rangext(str)d1,d2') :(rangext_end)\nrangext num = ('+' | '-' | '') span('0123456789')\nrxt1 str ',' span(' ') = ' ' :s(rxt1)\nrxt2 str num . d1 ' ' num . d2 =\n+ d1 ('~,' ? *eq(abs(d2 - d1),1) '~' | ',') d2 :s(rxt2)\nrxt3 str ('~' | '-') num '~' = '-' :s(rxt3)\nrxt4 str '~' = ',' :s(rxt4)\n rangext = str :(return)\nrangext_end\n\n* # Test and display\n test = '0, 1, 2, 4, 6, 7, 8, 11, 12, 14, '\n+ '15, 16, 17, 18, 19, 20, 21, 22, 23, 24, '\n+ '25, 27, 28, 29, 30, 31, 32, 33, 35, 36, '\n+ '37, 38, 39'\n output = rangext(test)\nend\n","language":"SNOBOL4"},{"code":"/*\nThis code is an implementation of \"Range extraction\" in SQL ORACLE 19c\np_list_of_sets -- input string\ndelimeter by default \",\"\np_format -- output format:\n 0 => [-2,-1] [0,2]\n 1 => -2--1,0-2\n*/\nwith\nfunction range_extraction(p_list_of_sets in varchar2, p_format integer default 0)\nreturn varchar2 is\n --\n v_list_of_sets varchar2(32767) := p_list_of_sets;\n v_output varchar2(32767) ;\n v_set_1 varchar2(2000) ;\n v_set_2 varchar2(2000) ;\n v_set_2_gr pls_integer;\n v_max pls_integer;\n --\n function sort_set(p_in_str varchar2)\n return varchar2 is\n v_out varchar2(32767) := p_in_str;\n begin\n --\n with out_tab as\n (select distinct to_number(regexp_substr(str, '[^,]+', 1, rownum, 'c', 0) default null on conversion error ) elem\n from\n (select p_in_str as str\n from dual\n )\n connect by level <= regexp_count(str, '[^,]+')\n )\n select distinct listagg(elem, ',') within group(order by elem) end\n into v_out\n from out_tab;\n --\n return v_out;\n end;\n --\nbegin\n --cleaning\n v_list_of_sets := replace(v_list_of_sets, ' ', '') ;\n v_list_of_sets := sort_set(v_list_of_sets) ;\n --\n <<loop_through_set>>\n while regexp_count(v_list_of_sets, '[^,]+') > 0\n loop\n v_set_1 := regexp_substr(v_list_of_sets, '[^,]+', 1, 1) ;\n v_list_of_sets := regexp_replace(v_list_of_sets,v_set_1,'',1,1);\n --\n <<loop_for>>\n for i in 1..regexp_count(v_list_of_sets, '[^,]+')\n loop\n v_set_2_gr := nvl(v_set_2,v_set_1);\n v_set_2 := regexp_substr(v_list_of_sets, '[^,]+', 1, 1) ;\n --\n if to_number(v_set_2) > to_number(v_set_1) + i then\n v_output := v_output||' ['||v_set_1||case when v_set_1 != v_set_2_gr then ','||v_set_2_gr end||']';\n continue loop_through_set;\n end if;\n --\n v_list_of_sets := regexp_replace(v_list_of_sets,v_set_2,'',1,1);\n --\n end loop loop_for;\n --\n v_output := v_output||' ['||v_set_1||case when v_set_1 != v_set_2 then ','||v_set_2 end||']';\n v_list_of_sets := regexp_replace(v_list_of_sets,v_set_1,'',1,1);\n --\n end loop loop_through_set;\n --\n --output format\n v_output := nvl(v_output,'[]');\n if p_format = 1 then\n v_output := ltrim(trim(v_output), '[');\n v_output := rtrim(v_output, ']');\n v_output := replace(v_output, ',', '-');\n v_output := replace(v_output, '] [', ',');\n end if;\n --\n return trim(v_output);\nend;\n\n--Test\nselect '-- Test, Standart Format ' as output from dual\nunion all\nselect lpad(', ',125) || ' ==> ' || range_extraction(', ') as output from dual\nunion all\nselect lpad('0,-1,2,-2',125) || ' ==> ' || range_extraction('0,-1,2,-2') as output from dual\nunion all\nselect lpad('3,3,0,0,-2,-2',125) || ' ==> ' || range_extraction('3,3,0,0,-2,-2') as output from dual\nunion all\nselect lpad('+0,-X,swde, 2q, +4, 3,0 ,-0,-2 , -3',125) || ' ==> ' || range_extraction('+0,-X,swde, 2q, +4, 3,0 ,-0,-2 , -3') as output from dual\nunion all\nselect lpad('-1,-11,-12,-14,-15,-16,-17,-18,-19,-2,-20,-21,-22,-23,-24,-25,-0,-27,-28,-29,-30,-31,-32,-33,-35,-36,-37,-38,-39,-4,-6,-7,-8',125) || ' ==> ' || range_extraction('-1,-11,-12,-14,-15,-16,-17,-18,-19,-2,-20,-21,-22,-23,-24,-25,-0,-27,-28,-29,-30,-31,-32,-33,-35,-36,-37,-38,-39,-4,-6,-7,-8') as output from dual\nunion all\nselect lpad('1,11,12,14,15,16,17,18,19,2,20,21,22,23,24,25,0,27,28,29,30,31,32,33,35,36,37,38,39,4,6,7,8',125) || ' ==> ' || range_extraction('1,11,12,14,15,16,17,18,19,2,20,21,22,23,24,25,0,27,28,29,30,31,32,33,35,36,37,38,39,4,6,7,8') as output from dual\nunion all\n--Test RosettaCode\nselect '-- Test RosettaCode, Standart Format ' as output from dual\nunion all\nselect lpad('-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20',125) || ' ==> ' || range_extraction('-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20') as output from dual\nunion all\nselect lpad('0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39',125) || ' ==> ' || range_extraction('0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39') as output from dual\nunion all\nselect '-- Test RosettaCode, RosettaCode Format' as output from dual\nunion all\nselect lpad('-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20',125) || ' ==> ' || range_extraction('-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20',1) as output from dual\nunion all\nselect lpad('0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39',125) || ' ==> ' || range_extraction('0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39',1) as output from dual\n;\n","language":"SQL"},{"code":"import Darwin\n\nfunc ranges(from ints:[Int]) -> [(Int, Int)] {\n\n\tvar range : (Int, Int)?\n\tvar ranges = [(Int, Int)]()\n\tfor this in ints {\n\t\tif let (start, end) = range {\n\t\t\tif this == end + 1 {\n\t\t\t\trange = (start, this)\n\t\t\t}\n\t\t\telse {\n\t\t\t\tranges.append(range!)\n\t\t\t\trange = (this, this)\n\t\t\t}\n\t\t}\n\t\telse { range = (this, this) }\n\t}\n\tranges.append(range!)\n\n\treturn ranges\n}\n\nfunc description(from ranges:[(Int, Int)]) -> String {\n\tvar desc = \"\"\n\tfor (start, end) in ranges {\n\t\tdesc += desc.isEmpty ? \"\" : \",\"\n\t\tif start == end {\n\t\t\tdesc += \"\\(start)\"\n\t\t}\n\t\telse if end == start + 1 {\n\t\t\tdesc += \"\\(start),\\(end)\"\n\t\t}\n\t\telse {\n\t\t\tdesc += \"\\(start)-\\(end)\"\n\t\t}\n\t}\n\treturn desc\n}\n\n\nlet ex = [-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]\nlet longer = [0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n\t15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n\t25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n\t37, 38, 39]\n\nprint(description(from: ranges(from: ex)))\nprint(description(from: ranges(from: longer)))\n","language":"Swift"},{"code":"templates extract\n templates out\n when <{start: <=$.end::raw>}> do '$.start;' !\n when <{end: <=$.start::raw+1>}> do '$.start;,$.end;' !\n otherwise '$.start;-$.end;' !\n end out\n @: {start: $(1), end: $(1)};\n [ $(2..last)... -> #, $@ -> out ] -> '$...;' !\n when <=$@.end::raw+1> do @.end: $;\n otherwise $@ -> out !\n ',' !\n @: {start: $, end: $};\nend extract\n\n[0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39] -> extract -> !OUT::write\n","language":"Tailspin"},{"code":"proc rangeExtract list {\n set result [lindex $list 0]\n set first [set last [lindex $list 0]]\n foreach term [lrange $list 1 end] {\n\tif {$term == $last+1} {\n\t set last $term\n\t continue\n\t}\n\tif {$last > $first} {\n\t append result [expr {$last == $first+1 ? \",\" : \"-\"}] $last\n\t}\n\tappend result \",\" $term\n\tset first [set last $term]\n }\n if {$last == $first+1} {\n\tappend result \",\" $last\n } elseif {$last > $first} {\n\tappend result \"-\" $last\n }\n return $result\n}\n\n# Commas already removed so it is a natural Tcl list\nputs [rangeExtract {\n 0 1 2 4 6 7 8 11 12 14\n 15 16 17 18 19 20 21 22 23 24\n 25 27 28 29 30 31 32 33 35 36\n 37 38 39\n}]\n","language":"Tcl"},{"code":"$$ MODE TUSCRIPT,{}\nMODE DATA\n$$ numbers=*\n0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n37, 38, 39\n$$ MODE TUSCRIPT\nnumbers=EXCHANGE (numbers,\":,{0-00} :':\")\nunrangednrs=JOIN (numbers,\"\")\nrangednrs=COMBINE (unrangednrs,\"\")\nrangednrs=EXCHANGE (rangednrs,\":':,:\")\nPRINT rangednrs\n","language":"TUSCRIPT"},{"code":"$$ MODE TUSCRIPT\nMODE DATA\n$$ numbers=*\n0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n37, 38, 39\n$$ MODE TUSCRIPT\nnumbers=EXCHANGE (numbers,\":,><<> :':\")\nunrangednrs=JOIN (numbers,\"\")\n\nhelp = APPEND (unrangednrs, \"999999999\")\nrest = REMOVE (help, 1, n_1)\nn_2 = n_1, n_3= n_2 + 1,rangednrs= \"\"\nLOOP n= rest\n IF (n!=n_3) THEN\n rangednrs = APPEND (rangednrs, n_1)\n IF (n_1!=n_2) THEN\n range=n_1+1\n IF (range==n_2) THEN\n rangednrs = APPEND (rangednrs,n_2)\n ELSE\n rangednrs = CONCAT (rangednrs, \"-\", n_2)\n ENDIF\n ENDIF\n n_1 = n\n ENDIF\n n_2 = n, n_3 = n_2 + 1\nENDLOOP\nrangednrs=EXCHANGE (rangednrs,\":':,:\")\nPRINT rangednrs\n","language":"TUSCRIPT"},{"code":"(defun range-extract (numbers)\n `@{(mapcar [iff [callf > length (ret 2)]\n (ret `@[@1 0]-@[@1 -1]`)\n (ret `@{@1 \",\"}`)]\n (mapcar (op mapcar car)\n (split [window-map 1 :reflect\n (op list @2 (- @2 @1))\n (sort (uniq numbers))]\n (op where [chain second (op < 1)])))) \",\"}`)\n","language":"TXR"},{"code":"#!/usr/bin/bash\n\nrange_contract () (\n add_range () {\n case $(( current - range_start )) in\n 0) ranges+=( $range_start ) ;;\n 1) ranges+=( $range_start $current ) ;;\n *) ranges+=(\"$range_start-$current\") ;;\n esac\n }\n\n ranges=()\n range_start=$1\n current=$1\n shift\n\n for number; do\n if (( number > current+1 )); then\n add_range\n range_start=$number\n fi\n current=$number\n done\n add_range\n\n x=\"${ranges[@]}\"\n echo ${x// /,}\n)\n\nrange_contract 0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39\n","language":"UNIX-Shell"},{"code":"#import std\n#import int\n\nx = <0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39>\n\nf = mat`,+ ==?(~&l,^|T/~& :/`-)*bhPS+ %zP~~hzX*titZBPiNCSiNCQSL+ rlc ^|E/~& predecessor\n\n#show+\n\nt = <f x>\n","language":"Ursala"},{"code":"Public Function RangeExtraction(AList) As String\n'AList is a variant that is an array, assumed filled with numbers in ascending order\nConst RangeDelim = \"-\" 'range delimiter\nDim result As String\nDim InRange As Boolean\nDim Posn, ub, lb, rangestart, rangelen As Integer\n\nresult = \"\"\n'find dimensions of AList\nub = UBound(AList)\nlb = LBound(AList)\nPosn = lb\nWhile Posn < ub\n rangestart = Posn\n rangelen = 0\n InRange = True\n 'try to extend the range\n While InRange\n rangelen = rangelen + 1\n If Posn = ub Then\n InRange = False\n Else\n InRange = (AList(Posn + 1) = AList(Posn) + 1)\n Posn = Posn + 1\n End If\n Wend\n If rangelen > 2 Then 'output the range if it has more than 2 elements\n result = result & \",\" & Format$(AList(rangestart)) & RangeDelim & Format$(AList(rangestart + rangelen - 1))\n Else 'output the separate elements\n For i = rangestart To rangestart + rangelen - 1\n result = result & \",\" & Format$(AList(i))\n Next\n End If\n Posn = rangestart + rangelen\nWend\nRangeExtraction = Mid$(result, 2) 'get rid of first comma!\nEnd Function\n\n\nPublic Sub RangeTest()\n'test function RangeExtraction\n'first test with a Variant array\nDim MyList As Variant\nMyList = Array(0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39)\nDebug.Print \"a) \"; RangeExtraction(MyList)\n\n'next test with an array of integers\nDim MyOtherList(1 To 20) As Integer\nMyOtherList(1) = -6\nMyOtherList(2) = -3\nMyOtherList(3) = -2\nMyOtherList(4) = -1\nMyOtherList(5) = 0\nMyOtherList(6) = 1\nMyOtherList(7) = 3\nMyOtherList(8) = 4\nMyOtherList(9) = 5\nMyOtherList(10) = 7\nMyOtherList(11) = 8\nMyOtherList(12) = 9\nMyOtherList(13) = 10\nMyOtherList(14) = 11\nMyOtherList(15) = 14\nMyOtherList(16) = 15\nMyOtherList(17) = 17\nMyOtherList(18) = 18\nMyOtherList(19) = 19\nMyOtherList(20) = 20\nDebug.Print \"b) \"; RangeExtraction(MyOtherList)\nEnd Sub\n","language":"VBA"},{"code":"Function Range_Extraction(list)\n\tnum = Split(list,\",\")\n\tFor i = 0 To UBound(num)\n\t\tstartnum = CInt(num(i))\n\t\tsum = startnum\n\t\tDo While i <= UBound(num)\n\t\t\tIf sum = CInt(num(i)) Then\n\t\t\t\tIf i = UBound(num) Then\n\t\t\t\t\tIf startnum <> CInt(num(i)) Then\n\t\t\t\t\t\tIf startnum + 1 = CInt(num(i)) Then\n\t\t\t\t\t\t\tRange_Extraction = Range_Extraction & startnum & \",\" & num(i) & \",\"\n\t\t\t\t\t\tElse\n\t\t\t\t\t\t\tRange_Extraction = Range_Extraction & startnum & \"-\" & num(i) & \",\"\n\t\t\t\t\t\tEnd If\n\t\t\t\t\tElse\n\t\t\t\t\t\tRange_Extraction = Range_Extraction & startnum & \",\"\n\t\t\t\t\tEnd If\n Exit Do\n\t\t\t\tElse\n\t\t\t\t\ti = i + 1\n\t\t\t\t\tsum = sum + 1\n\t\t\t\tEnd If\n\t\t\tElse\n\t\t\t\tIf startnum = CInt(num(i-1)) Then\n\t\t\t\t\tRange_Extraction = Range_Extraction & startnum & \",\"\n\t\t\t\tElse\n\t\t\t\t\tIf startnum + 1 = CInt(num(i-1)) Then\n\t\t\t\t\t\tRange_Extraction = Range_Extraction & startnum & \",\" & num(i-1) & \",\"\n\t\t\t\t\tElse\n\t\t\t\t\t\tRange_Extraction = Range_Extraction & startnum & \"-\" & num(i-1) & \",\"\n\t\t\t\t\tEnd If\n\t\t\t\tEnd If\n\t\t\t\ti = i - 1\n\t\t\t\tExit Do\n\t\t\tEnd If\n\t\tLoop\n\tNext\n\tRange_Extraction = Left(Range_Extraction,Len(Range_Extraction)-1)\nEnd Function\n\nWScript.StdOut.Write Range_Extraction(\"0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39\")\n","language":"VBScript"},{"code":"var extractRange = Fn.new { |list|\n if (list.isEmpty) return \"\"\n var sb = \"\"\n var first = list[0]\n var prev = first\n\n var append = Fn.new { |index|\n if (first == prev) {\n sb = sb + prev.toString\n } else if (first == prev - 1) {\n sb = sb + first.toString + \",\" + prev.toString\n } else {\n sb = sb + first.toString + \"-\" + prev.toString\n }\n if (index < list.count - 1) sb = sb + \",\"\n }\n\n for (i in 1...list.count) {\n if (list[i] == prev + 1) {\n prev = prev + 1\n } else {\n append.call(i)\n first = list[i]\n prev = first\n }\n }\n append.call(list.count - 1)\n return sb\n}\n\nvar list1 = [-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]\nSystem.print(extractRange.call(list1))\nvar list2 = [0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39]\nSystem.print(extractRange.call(list2))\n","language":"Wren"},{"code":"string 0;\ndef End = -1>>1;\n\nfunc RangeExtract(List); \\Return a string in the range format\nint List, I, Lo, Hi;\nchar String(0);\n[I:= 0;\nloop [Lo:= List(I);\n while List(I)+1 = List(I+1) do I:= I+1;\n Hi:= List(I);\n IntOut(8, Lo);\n if Hi-Lo >= 2 then\n [ChOut(8, ^-); IntOut(8, Hi)]\n else if Hi-Lo = 1 then\n [ChOut(8, ^,); IntOut(8, Hi)];\n I:= I+1;\n if List(I) = End then quit;\n ChOut(8, ^,);\n ];\nChOut(8, 0);\nI:= 0;\nloop [String(I):= ChIn(8);\n if String(I) = 0 then return String;\n I:= I+1;\n ];\n];\n\nText(0, RangeExtract(\n [0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39, End]) )\n","language":"XPL0"},{"code":"fcn range(ns){\n fcn(w){\n if (w.atEnd) return(Void.Stop);\n a:=b:=w.next(); n:=0;\n while(b+1 == (c:=w.peekN(n))){ n+=1; b=c }\n if(n>1){do(n){w.next()}; return(\"%d-%d\".fmt(a,b)); }\n a\n } :\n (0).pump(*,List,_.fp(ns.walker().tweak(Void,Void))).concat(\",\");\n}\n","language":"Zkl"},{"code":"var ns=T(-6,-3,-2,-1,0,1,3,4,5,7,8,9,10,11,14,15,17,18,19,20);\nrange(ns).println();\n\nns=T(\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\n 37, 38, 39);\nrange(ns).println();\n\nrange([1..100]).println();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Range_extraction\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"{{:Range extraction/Format}}\\n\\n;Task:\\n* Create a function that takes a list of integers in increasing order and returns a correctly formatted string in the range format. \\n* Use the function to compute and print the range formatted version of the following ordered list of integers. (The correct answer is: <code>0-2,4,6-8,11,12,14-25,27-33,35-39</code>).\\n<br>\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39\\n* Show the output of your program.\\n\\n\\n;Related task:\\n* [[Range expansion]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F range_extract(lst)\\n [[Int]] r\\n V lenlst = lst.len\\n V i = 0\\n L i < lenlst\\n V low = lst[i]\\n L i < lenlst - 1 & lst[i] + 1 == lst[i + 1]\\n i++\\n V hi = lst[i]\\n I hi - low >= 2\\n r [+]= [low, hi]\\n E I hi - low == 1\\n r [+]= [low]\\n r [+]= [hi]\\n E\\n r [+]= [low]\\n i++\\n R r\\n\\nF printr(ranges)\\n print(ranges.map(r -> (I r.len == 2 {r[0]‘-’r[1]} E String(r[0]))).join(‘,’))\\n\\nL(lst) [[-8, -7, -6, -3, -2, -1, 0, 1, 3, 4, 5, 7,\\n 8, 9, 10, 11, 14, 15, 17, 18, 19, 20],\\n [0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22,\\n 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39]]\\n printr(range_extract(lst))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"INT FUNC FindRange(INT ARRAY a INT len,start)\\n INT count\\n\\n count=1\\n WHILE start<len-1\\n DO\\n IF a(start)+1#a(start+1) THEN\\n EXIT\\n FI\\n start==+1\\n count==+1\\n OD\\nRETURN (count)\\n\\nPROC Append(CHAR ARRAY text,suffix)\\n BYTE POINTER srcPtr,dstPtr\\n BYTE len\\n\\n len=suffix(0)\\n IF text(0)+len>255 THEN\\n len=255-text(0)\\n FI\\n IF len THEN\\n srcPtr=suffix+1\\n dstPtr=text+text(0)+1\\n MoveBlock(dstPtr,srcPtr,len)\\n text(0)==+suffix(0)\\n FI\\nRETURN\\n\\nPROC RangeToStr(INT ARRAY a INT len CHAR ARRAY res)\\n INT i,count\\n CHAR ARRAY tmp(10)\\n\\n i=0\\n res(0)=0\\n WHILE i<len\\n DO\\n count=FindRange(a,len,i)\\n StrI(a(i),tmp) Append(res,tmp)\\n IF count=2 THEN\\n Append(res,\\\",\\\")\\n StrI(a(i+1),tmp) Append(res,tmp)\\n ELSEIF count>2 THEN\\n Append(res,\\\"-\\\")\\n StrI(a(i+count-1),tmp) Append(res,tmp)\\n FI\\n i==+count\\n IF i<len THEN\\n Append(res,\\\",\\\")\\n FI\\n OD\\nRETURN\\n\\nPROC Main()\\n INT ARRAY a=[0 1 2 4 6 7 8 11 12 14\\n 15 16 17 18 19 20 21 22 23 24 25 27\\n 28 29 30 31 32 33 35 36 37 38 39]\\n INT ARRAY b=[65530 65533 65534 65535\\n 0 1 3 4 5 7 8 9 10 11 14 15 17 18 19 20]\\n CHAR ARRAY res(256)\\n\\n RangeToStr(a,33,res)\\n PrintE(res) PutE()\\n RangeToStr(b,20,res)\\n PrintE(res)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\nwith Ada.Strings.Unbounded; use Ada.Strings.Unbounded;\\nwith Ada.Strings.Fixed; use Ada.Strings.Fixed;\\n\\nprocedure Range_Extraction is\\n type Sequence is array (Positive range <>) of Integer;\\n function Image (S : Sequence) return String is\\n Result : Unbounded_String;\\n From : Integer;\\n procedure Flush (To : Integer) is\\n begin\\n if Length (Result) > 0 then\\n Append (Result, ',');\\n end if;\\n Append (Result, Trim (Integer'Image (From), Ada.Strings.Left));\\n if From < To then\\n if From+1 = To then\\n Append (Result, ',');\\n else\\n Append (Result, '-');\\n end if;\\n Append (Result, Trim (Integer'Image (To), Ada.Strings.Left));\\n end if;\\n end Flush;\\n begin\\n if S'Length > 0 then\\n From := S (S'First);\\n for I in S'First + 1..S'Last loop\\n if S (I - 1) + 1 /= S (I) then\\n Flush (S (I - 1));\\n From := S (I);\\n end if;\\n end loop;\\n Flush (S (S'Last));\\n end if;\\n return To_String (Result);\\n end Image;\\nbegin\\n Put_Line\\n ( Image\\n ( ( 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39\\n ) ) );\\nend Range_Extraction;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO, Ada.Strings.Fixed;\\n\\nprocedure Range_Extract is\\n type Sequence is array (Positive range <>) of Integer;\\n\\n function Img(I: Integer) return String is -- the image of an Integer\\n begin\\n return\\n Ada.Strings.Fixed.Trim(Integer'Image(I), Ada.Strings.Left);\\n end Img;\\n\\n function Img(S: Sequence) return String is -- the image of a Sequence\\n\\n function X(S : Sequence) return String is -- recursive eXtract\\n Idx: Positive := S'First;\\n begin\\n if S'Length = 0 then return\\n \\\"\\\"; -- return nothing if Sequence is empty\\n else\\n while Idx < S'Last and then S(Idx+1) = S(Idx) + 1 loop\\n Idx := Idx + 1;\\n end loop;\\n if Idx = S'First then return\\n \\\",\\\" & Img(S(Idx)) & X(S(Idx+1 .. S'Last));\\n elsif Idx = S'First+1 then return\\n \\\",\\\" & Img(S(S'First)) & ',' & Img(S(Idx)) & X(S(Idx+1 .. S'Last));\\n else return\\n \\\",\\\" & Img(S(S'First)) & '-' & Img(S(Idx)) & X(S(Idx+1 .. S'Last));\\n end if;\\n end if;\\n end X;\\n\\n begin -- function Img(S: Sequence) return String\\n if S'Length = 0 then return\\n \\\"\\\";\\n else return\\n Img(S(S'First)) & X(S(S'First+1 .. S'Last));\\n end if;\\n end Img;\\n\\nbegin -- main\\n Ada.Text_IO.Put_Line(Img( ( 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16,\\n 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29,\\n 30, 31, 32, 33, 35, 36, 37, 38, 39) ));\\nend Range_Extract;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"rp(list l)\\n{\\n integer a, i;\\n data b;\\n index x;\\n\\n a = l[0];\\n x[a] = a;\\n for (, a in l) {\\n x[a == x.back + 1 ? x.high : a] = a;\\n }\\n for (i, a in x) {\\n b.form(a - i < 2 ? a - i ? \\\"~,~,\\\" : \\\"~,\\\" : \\\"~-~,\\\", i, a);\\n }\\n\\n b.delete(-1);\\n}\\n\\nmain(void)\\n{\\n o_(rp(list(0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22,\\n 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39)),\\n \\\"\\\\n\\\");\\n\\n 0;\\n}\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"###\\n REQUIRES(MODE SCALAR, OP(SCALAR,SCALAR)BOOL =, OP(SCALAR,SCALAR)SCALAR +);\\n###\\nMODE SCALARLIST = FLEX[0]SCALAR;\\nMODE YIELDINT = PROC(SCALAR)VOID;\\n\\n################################################################\\n# Declarations for manipulating lists of range pairs [lwb:upb] #\\n################################################################\\nMODE RANGE = STRUCT(SCALAR lwb, upb);\\nMODE RANGELIST = FLEX[0]RANGE;\\nMODE YIELDRANGE = PROC(RANGE)VOID;\\n\\nPROC range repr = (RANGE range)STRING: (\\n STRING lwb := whole(lwb OF range,0);\\n IF lwb OF range = upb OF range THEN\\n lwb\\n ELSE\\n # \\\"[\\\"+lwb+\\\":\\\"+whole(upb OF range,0)+\\\"]\\\" #\\n lwb+\\\"-\\\"+whole(upb OF range,0)\\n FI\\n);\\n\\n# OP REPR = (RANGE range)STRING: range repr(range); # # firmly related to UNIRANGE #\\n\\n######################################################################\\n# Declarations for manipulating lists containing pairs AND lone INTs #\\n######################################################################\\nMODE UNIRANGE = UNION(SCALAR, RANGE);\\nMODE UNIRANGELIST = FLEX[0]UNIRANGE;\\nMODE YIELDUNIRANGE = PROC(UNIRANGE)VOID;\\n\\nPROC unirange repr = (UNIRANGE unirange)STRING:\\n CASE unirange IN\\n (RANGE range): range repr(range),\\n (SCALAR scalar): whole(scalar,0)\\n ESAC;\\n\\nOP (UNIRANGE)STRING REPR = unirange repr; # alias #\\n\\n# The closest thing Algol68 has to inheritance is the UNION #\\nMODE UNIRANGELISTS = UNION(UNIRANGELIST, RANGELIST, SCALARLIST);\\n\\nPROC unirange list repr = (UNIRANGELIST unirange list)STRING: (\\n### Produce a STRING representation of a UNIRANGELIST ###\\n STRING out # := \\\"(\\\"#, sep := \\\"\\\";\\n FOR key FROM LWB unirange list TO UPB unirange list DO\\n out +:= sep + REPR unirange list[key];\\n sep := \\\",\\\" # +\\\" \\\" #\\n OD;\\n out # +\\\")\\\" #\\n);\\n\\nOP (UNIRANGELIST)STRING REPR = unirange list repr; # alias #\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"###\\n REQUIRES(MODE SCALAR, OP(SCALAR,SCALAR)BOOL =, OP(SCALAR,SCALAR)SCALAR +);\\n###\\nPR READ \\\"Template_Range_extraction_Base.a68\\\" PR\\n\\nOP (UNIRANGELISTS)UNIRANGELIST INITUNIRANGE = init unirange list; # alias #\\n\\nPROC init unirange list = (UNIRANGELISTS unirange list)UNIRANGELIST: (\\n### Take a []SCALAR, []RANGE or []UNIRANGE, and return a normalised []UNIRANGE ###\\n\\n INT len = UPB unirange list-LWB unirange list+1;\\n [LWB unirange list: LWB unirange list+len*2]UNIRANGE out unirange list;\\n SCALAR upb out unirange list := LWB out unirange list - 1;\\n UNION(VOID, RANGE) prev range := EMPTY;\\n\\n PROC out unirange list append = (RANGE value)VOID:(\\n\\n IF lwb OF value = upb OF value THEN\\n out unirange list[upb out unirange list+:=1] := lwb OF value\\n ELIF lwb OF value + 1 = upb OF value THEN\\n out unirange list[upb out unirange list+:=1] := lwb OF value;\\n out unirange list[upb out unirange list+:=1] := upb OF value\\n ELSE\\n out unirange list[upb out unirange list+:=1] := value\\n FI\\n );\\n\\n FOR key FROM LWB unirange list TO UPB unirange list DO\\n UNIRANGE value = CASE unirange list IN\\n (SCALARLIST list):list[key],\\n (RANGELIST list):list[key],\\n (UNIRANGELIST list):list[key]\\n ESAC;\\n\\n RANGE next range := CASE value IN\\n (RANGE range): range,\\n (SCALAR value): RANGE(value, value)\\n ESAC;\\n\\n prev range :=\\n CASE prev range IN\\n (VOID): next range,\\n (RANGE prev range):\\n IF upb OF prev range + 1 = lwb OF next range THEN\\n RANGE(lwb OF prev range, upb OF next range) # merge the range #\\n ELSE\\n out unirange list append(prev range);\\n next range\\n FI\\n OUT SKIP\\n ESAC\\n\\n OD;\\n\\n CASE prev range IN\\n (RANGE last range): out unirange list append(last range)\\n ESAC;\\n\\n out unirange list[:upb out unirange list]\\n);\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#!/usr/local/bin/a68g --script #\\n############################\\n# some simple test cases: #\\n############################\\n\\nMODE SCALAR = INT;\\nPR READ \\\"Template_Range_extraction_Iterative.a68\\\" PR\\n#PR READ \\\"Template_Range_extraction_Generative.a68\\\" PR#\\nMODE RANGEINT = UNIRANGE;\\n\\ntest: BEGIN\\n []INT int list = ( # unnormalised #\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39);\\n\\n []RANGE range list = ( # unnormalised #\\n (0,0), (1,1), (2,2), (4,4), (6,6), (7,7), (8,8), (11,11), (12,12), (14,14),\\n (15,15), (16,16), (17,17), (18,18), (19,19), (20,20), (21,21), (22,22), (23,23), (24,24),\\n (25,25), (27,27), (28,28), (29,29), (30,30), (31,31), (32,32), (33,33), (35,35), (36,36),\\n (37,37), (38,38), (39,39));\\n\\n []RANGEINT list a = ( # unnormalised #\\n RANGE(0,2), 4, RANGE(6,8), RANGE(11,12),\\n RANGE(14,25), RANGE(27,33), RANGE(35,39));\\n\\n []RANGEINT list b = ( # unnormalised #\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39);\\n\\n []RANGEINT list c = INITUNIRANGE(list b); # normalised #\\n\\n# compare manipulation of various types of argument lists #\\n printf(($gl$,\\n REPR INITUNIRANGE int list,\\n REPR INITUNIRANGE range list,\\n REPR INITUNIRANGE list a,\\n REPR INITUNIRANGE list b,\\n REPR list c\\n ))\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"###\\n REQUIRES(MODE SCALAR, OP(SCALAR,SCALAR)BOOL =, OP(SCALAR,SCALAR)SCALAR +);\\n###\\nPR READ \\\"Template_Range_extraction_Base.a68\\\" PR\\n\\nPROC gen range = (UNIRANGELISTS unirange list, YIELDRANGE yield range)VOID:\\n### Take a []SCALAR, []RANGE or []URANGE, and generatively yield an unnormalised RANGE ###\\n\\n FOR key FROM LWB unirange list TO UPB unirange list DO\\n# Note: Algol 68RS cannot handle LWB and UPB of a UNION in the following: #\\n UNIRANGE value = CASE unirange list IN\\n (SCALARLIST list):list[key],\\n (RANGELIST list):list[key],\\n (UNIRANGELIST list):list[key]\\n ESAC;\\n yield range(\\n CASE value IN\\n (RANGE range): range,\\n (SCALAR value): (value, value)\\n ESAC\\n )\\n OD;\\n\\nPROC gen range merge = (UNIRANGELISTS unirange list, YIELDRANGE yield)VOID: (\\n### Take a []SCALAR, []RANGE or []URANGE , and generatively yield a normalised RANGE ###\\n\\n UNION(VOID, RANGE) prev range := EMPTY;\\n\\n# FOR RANGE next range IN # gen range(unirange list, # ) DO #\\n## (RANGE next range)VOID:\\n# if the ranges cannot be merge, then yield 1st, and return 2nd #\\n prev range :=\\n CASE prev range IN\\n (VOID): next range,\\n (RANGE prev range):\\n IF upb OF prev range + 1 = lwb OF next range THEN\\n RANGE(lwb OF prev range, upb OF next range) # merge the range #\\n ELSE\\n #IF lwb OF prev range <= upb OF prev range THEN#\\n yield(prev range);\\n #FI;#\\n next range\\n FI\\n OUT SKIP\\n ESAC\\n# OD # );\\n\\n CASE prev range IN (RANGE last range): yield(last range) ESAC\\n);\\n\\nPROC gen unirange merge = (UNIRANGELISTS unirange list, YIELDUNIRANGE yield)VOID: (\\n### Take a []SCALAR, []RANGE or []UNIRANGE and generatively yield a normalised UNIRANGE ###\\n\\n PROC unpack = (RANGE value)VOID:(\\n IF lwb OF value = upb OF value THEN\\n yield(lwb OF value)\\n ELIF lwb OF value + 1 = upb OF value THEN\\n yield(lwb OF value);\\n yield(upb OF value)\\n ELSE\\n yield(value)\\n FI\\n );\\n\\n gen range merge(unirange list, unpack)\\n);\\n\\nPROC unirange list init = (UNIRANGELISTS unirange list)UNIRANGELIST: (\\n### Take a []SCALAR, []RANGE or []UNIRANGE and return a static []UNIRANGE ###\\n\\n INT len = UPB unirange list - LWB unirange list + 1;\\n [LWB unirange list: LWB unirange list + len * 2]UNIRANGE out unirange list; # estimate #\\n SCALAR upb out unirange list := LWB out unirange list - 1;\\n\\n# FOR UNIRANGE unirange IN # gen unirange merge(unirange list, # ) DO #\\n## (UNIRANGE unirange)VOID:\\n out unirange list[upb out unirange list+:=1] := unirange\\n# OD # );\\n\\n out unirange list[:upb out unirange list]\\n);\\n\\nOP (UNIRANGELISTS)UNIRANGELIST INITUNIRANGE = unirange list init; # alias #\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"--------------------- RANGE EXTRACTION ---------------------\\n\\n-- rangeFormat :: [Int] -> String\\non rangeFormat(xs)\\n script segment\\n on |λ|(xs)\\n if 2 < length of xs then\\n intercalate(\\\"-\\\", {first item of xs, last item of (xs)})\\n else\\n intercalate(\\\",\\\", xs)\\n end if\\n end |λ|\\n end script\\n\\n script gap\\n on |λ|(a, b)\\n 1 < b - a\\n end |λ|\\n end script\\n\\n intercalate(\\\",\\\", map(segment, splitBy(gap, xs)))\\nend rangeFormat\\n\\n\\n--------------------------- TEST ---------------------------\\non run\\n set xs to {0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, ¬\\n 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, ¬\\n 33, 35, 36, 37, 38, 39}\\n\\n rangeFormat(xs)\\n\\n --> \\\"0-2,4,6-8,11,12,14-25,27-33,35-39\\\"\\nend run\\n\\n\\n-------------------- GENERIC FUNCTIONS ---------------------\\n\\n\\n-- foldl :: (a -> b -> a) -> a -> [b] -> a\\non foldl(f, startValue, xs)\\n tell mReturn(f)\\n set v to startValue\\n set lng to length of xs\\n repeat with i from 1 to lng\\n set v to |λ|(v, item i of xs, i, xs)\\n end repeat\\n return v\\n end tell\\nend foldl\\n\\n\\n-- map :: (a -> b) -> [a] -> [b]\\non map(f, xs)\\n tell mReturn(f)\\n set lng to length of xs\\n set lst to {}\\n repeat with i from 1 to lng\\n set end of lst to |λ|(item i of xs, i, xs)\\n end repeat\\n return lst\\n end tell\\nend map\\n\\n\\n-- intercalate :: Text -> [Text] -> Text\\non intercalate(strText, lstText)\\n set {dlm, my text item delimiters} to {my text item delimiters, strText}\\n set strJoined to lstText as text\\n set my text item delimiters to dlm\\n return strJoined\\nend intercalate\\n\\n\\n-- Lift 2nd class handler function into 1st class script wrapper\\n-- mReturn :: Handler -> Script\\non mReturn(f)\\n if class of f is script then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\\n\\n-- splitBy :: (a -> a -> Bool) -> [a] -> [[a]]\\non splitBy(f, xs)\\n set mf to mReturn(f)\\n\\n if length of xs < 2 then\\n {xs}\\n else\\n script p\\n on |λ|(a, x)\\n set {acc, active, prev} to a\\n if mf's |λ|(prev, x) then\\n {acc & {active}, {x}, x}\\n else\\n {acc, active & x, x}\\n end if\\n end |λ|\\n end script\\n\\n set h to item 1 of xs\\n set lstParts to foldl(p, {{}, {h}, h}, items 2 thru -1 of xs)\\n item 1 of lstParts & {item 2 of lstParts}\\n end if\\nend splitBy\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"(*\\n The task description doesn't explicitly state that the integers are unique or what to do if they're not.\\n This script treats runs of equal integers as single instances of those integers.\\n*)\\n\\non rangeDescription(orderedListOfIntegers)\\n script o\\n property lst : orderedListOfIntegers\\n property entries : {}\\n\\n on addEntry(startInt, endInt)\\n set rangeDifference to endInt - startInt\\n if (rangeDifference > 1) then\\n set end of my entries to (startInt as text) & \\\"-\\\" & endInt\\n else if (rangeDifference is 1) then\\n set end of my entries to (startInt as text) & \\\",\\\" & endInt\\n else\\n set end of my entries to startInt\\n end if\\n end addEntry\\n end script\\n\\n -- if ((orderedListOfIntegers's class is not list) or ((count o's lst's integers) < (count orderedListOfIntegers))) then error\\n\\n -- Work through the list, identifying gaps in the sequence and adding range or individual results to o's entries.\\n set startInt to beginning of o's lst\\n set endInt to startInt\\n repeat with i from 2 to (count orderedListOfIntegers)\\n set thisInt to item i of o's lst\\n if (thisInt - endInt > 1) then\\n tell o to addEntry(startInt, endInt)\\n set startInt to thisInt\\n end if\\n set endInt to thisInt\\n end repeat\\n tell o to addEntry(startInt, thisInt)\\n\\n -- Coerce the entries list to text using a comma delimiter.\\n set astid to AppleScript's text item delimiters\\n set AppleScript's text item delimiters to \\\",\\\"\\n set output to o's entries as text\\n set AppleScript's text item delimiters to astid\\n\\n return output\\nend rangeDescription\\n\\n-- Test code:\\nset listOfIntegers to {0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39}\\nreturn rangeDescription(listOfIntegers)\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"\\\"0-2,4,6-8,11,12,14-25,27-33,35-39\\\"\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"extractRange: function [inp][\\n items: map split.by:\\\",\\\" join split.lines strip inp 'x -> to :integer strip x\\n ranges: []\\n\\n i: 0\\n while [i < size items][\\n fst: items\\\\[i]\\n offset: i\\n while [true][\\n if (i + 1) >= size items -> break\\n if (fst - offset) <> items\\\\[i+1] - (i+1) -> break\\n i: i + 1\\n ]\\n lst: items\\\\[i]\\n case [(lst-fst)=]\\n when? -> 0 -> 'ranges ++ ~\\\"|fst|\\\"\\n when? -> 1 -> 'ranges ++ ~\\\"|fst|, |lst|\\\"\\n else -> 'ranges ++ ~\\\"|fst|-|lst|\\\"\\n i: i + 1\\n ]\\n\\n return join.with:\\\", \\\" ranges\\n]\\n\\nprint extractRange {\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39\\n}\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"msgbox % extract(\\\"0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39\\\")\\n\\nextract( list ) {\\n loop, parse, list, `,, %A_Tab%%A_Space%`r`n\\n {\\n if (A_LoopField+0 != p+1)\\n ret .= (f!=p ? (p>f+1 ? \\\"-\\\" : \\\",\\\") p : \\\"\\\") \\\",\\\" f := A_LoopField\\n p := A_LoopField\\n }\\n return SubStr(ret (f!=p ? (p>f+1 ? \\\"-\\\" : \\\",\\\") p : \\\"\\\"), 2)\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#!/usr/bin/awk -f\\n\\nBEGIN {\\n delete sequence\\n delete range\\n\\n seqStr = \\\"0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,\\\"\\n seqStr = seqStr \\\"25,27,28,29,30,31,32,33,35,36,37,38,39\\\"\\n print \\\"Sequence: \\\" seqStr\\n fillSequence(seqStr)\\n rangeExtract()\\n showRange()\\n exit\\n}\\n\\nfunction rangeExtract( runStart, runLen) {\\n delete range\\n runStart = 1\\n while(runStart <= length(sequence)) {\\n runLen = getSeqRunLen(runStart)\\n addRange(runStart, runLen)\\n runStart += runLen\\n }\\n}\\n\\nfunction getSeqRunLen(startPos, pos) {\\n for (pos = startPos; pos < length(sequence); pos++) {\\n if (sequence[pos] + 1 != sequence[pos + 1]) break;\\n }\\n return pos - startPos + 1;\\n}\\n\\nfunction addRange(startPos, len, str) {\\n if (len == 1) str = sequence[startPos]\\n else if (len == 2) str = sequence[startPos] \\\",\\\" sequence[startPos + 1]\\n else str = sequence[startPos] \\\"-\\\" sequence[startPos + len - 1]\\n range[length(range) + 1] = str\\n}\\n\\nfunction showRange( r) {\\n printf \\\" Ranges: \\\"\\n for (r = 1; r <= length(range); r++) {\\n if (r > 1) printf \\\",\\\"\\n printf range[r]\\n }\\n printf \\\"\\\\n\\\"\\n}\\n\\nfunction fillSequence(seqStr, n, s) {\\n n = split(seqStr,a,/[,]+/)\\n for (s = 1; s <= n; s++) {\\n sequence[s] = a[s]\\n }\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"arraybase 1\\ndim a = {-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20}\\nprint formatRange(a)\\nprint\\n\\ndim b = {0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39}\\nprint formatRange(b)\\nend\\n\\nfunction formatRange (a)\\n\\tlb = a[?,]: ub = a[?]\\n\\tif ub = - 1 then return \\\"\\\"\\n\\tif lb = ub then return string(a[lb])\\n\\trangeCount = 1\\n\\trange = string(a[lb])\\n\\tfor i = lb + 1 to ub\\n\\t\\tif a[i] = a[i - 1] + 1 then\\n\\t\\t\\trangeCount += 1\\n\\t\\telse\\n\\t\\t\\tif rangeCount = 1 then\\n\\t\\t\\t\\trange += \\\",\\\" + string(a[i])\\n\\t\\t\\telse\\n\\t\\t\\t\\tif rangeCount = 2 then\\n\\t\\t\\t\\t\\trangeCount = 1\\n\\t\\t\\t\\t\\trange += \\\",\\\" + string(a[i-1]) + \\\",\\\" + string(a[i])\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\trangeCount = 1\\n\\t\\t\\t\\t\\trange += \\\"-\\\" + string(a[i-1]) + \\\",\\\" + string(a[i])\\n\\t\\t\\t\\tend if\\n\\t\\t\\tend if\\n\\t\\tend if\\n\\tnext\\n\\tif rangeCount = 2 then\\n\\t\\trange += \\\",\\\" + string(a[ub])\\n\\telse\\n\\t\\tif rangeCount > 2 then range += \\\"-\\\" + string(a[ub])\\n\\tend if\\n\\treturn range\\nend function\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \" range$ = \\\" 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, \\\" + \\\\\\n \\\\ \\\"15, 16, 17, 18, 19, 20, 21, 22, 23, 24, \\\" + \\\\\\n \\\\ \\\"25, 27, 28, 29, 30, 31, 32, 33, 35, 36, \\\" + \\\\\\n \\\\ \\\"37, 38, 39\\\"\\n PRINT FNrangeextract(range$)\\n END\\n\\n DEF FNrangeextract(r$)\\n LOCAL f%, i%, r%, t%, t$\\n f% = VAL(r$)\\n REPEAT\\n i% = INSTR(r$, \\\",\\\", i%+1)\\n t% = VALMID$(r$, i%+1)\\n IF t% = f% + r% + 1 THEN\\n r% += 1\\n ELSE\\n CASE r% OF\\n WHEN 0: t$ += STR$(f%) + \\\",\\\"\\n WHEN 1: t$ += STR$(f%) + \\\",\\\" + STR$(f% + r%) + \\\",\\\"\\n OTHERWISE: t$ += STR$(f%) + \\\"-\\\" + STR$(f% + r%) + \\\",\\\"\\n ENDCASE\\n r% = 0\\n f% = t%\\n ENDIF\\n UNTIL i% = 0\\n = LEFT$(t$)\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \" ( rangeExtract\\n = accumulator firstInRange nextInRange\\n , accumulate fasten rangePattern\\n . ( accumulate\\n = !accumulator\\n (!accumulator:|?&\\\",\\\")\\n !firstInRange\\n ( !firstInRange+1:<>!nextInRange\\n & ( !firstInRange+2:!nextInRange&\\\",\\\"\\n | \\\"-\\\"\\n )\\n -1+!nextInRange\\n |\\n )\\n : ?accumulator\\n )\\n & ( fasten\\n = [%( !accumulate\\n & (!sjt:?firstInRange)+1:?nextInRange\\n )\\n )\\n & ( rangePattern\\n = (\\n | ?\\n ( !nextInRange\\n & 1+!nextInRange:?nextInRange\\n )\\n )\\n ( &!accumulate\\n | (#<>!nextInRange:!fasten) !rangePattern\\n )\\n )\\n & :?accumulator:?firstInRange\\n & !arg:(|#!fasten !rangePattern)\\n & str$!accumulator\\n )\\n& ( test\\n = L A\\n . put$(!arg \\\" ==>\\\\n\\\",LIN)\\n & ( !arg:(?,?)\\n & whl'(!arg:(?A,?arg)&(!A,!L):?L)\\n & whl'(!L:(?A,?L)&!A !arg:?arg)\\n |\\n )\\n & out$(rangeExtract$!arg)\\n )\\n& test\\n $ (0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39)\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n\\nsize_t rprint(char *s, int *x, int len)\\n{\\n#define sep (a > s ? \\\",\\\" : \\\"\\\") /* use comma except before first output */\\n#define ol (s ? 100 : 0) /* print only if not testing for length */\\n\\tint i, j;\\n\\tchar *a = s;\\n\\tfor (i = j = 0; i < len; i = ++j) {\\n\\t\\tfor (; j < len - 1 && x[j + 1] == x[j] + 1; j++);\\n\\n\\t\\tif (i + 1 < j)\\n\\t\\t\\ta += snprintf(s?a:s, ol, \\\"%s%d-%d\\\", sep, x[i], x[j]);\\n\\t\\telse\\n\\t\\t\\twhile (i <= j)\\n\\t\\t\\t\\ta += snprintf(s?a:s, ol, \\\"%s%d\\\", sep, x[i++]);\\n\\t}\\n\\treturn a - s;\\n#undef sep\\n#undef ol\\n}\\n\\nint main()\\n{\\n\\tint x[] = {\\t0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n\\t\\t\\t15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n\\t\\t\\t25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n\\t\\t\\t37, 38, 39 };\\n\\n\\tchar *s = malloc(rprint(0, x, sizeof(x) / sizeof(int)) + 1);\\n\\trprint(s, x, sizeof(x) / sizeof(int));\\n\\tprintf(\\\"%s\\\\n\\\", s);\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <iterator>\\n#include <cstddef>\\n\\ntemplate<typename InIter>\\n void extract_ranges(InIter begin, InIter end, std::ostream& os)\\n{\\n if (begin == end)\\n return;\\n\\n int current = *begin++;\\n os << current;\\n int count = 1;\\n\\n while (begin != end)\\n {\\n int next = *begin++;\\n if (next == current+1)\\n ++count;\\n else\\n {\\n if (count > 2)\\n os << '-';\\n else\\n os << ',';\\n if (count > 1)\\n os << current << ',';\\n os << next;\\n count = 1;\\n }\\n current = next;\\n }\\n\\n if (count > 1)\\n os << (count > 2? '-' : ',') << current;\\n}\\n\\ntemplate<typename T, std::size_t n>\\n T* end(T (&array)[n])\\n{\\n return array+n;\\n}\\n\\nint main()\\n{\\n int data[] = { 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39 };\\n\\n extract_ranges(data, end(data), std::cout);\\n std::cout << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\nclass RangeExtraction\\n{\\n static void Main()\\n {\\n const string testString = \\\"0, 1, 2, 4, 6, 7, 8, 11, 12, 14,15, 16, 17, 18, 19, 20, 21, 22, 23, 24,25, 27, 28, 29, 30, 31, 32, 33, 35, 36,37, 38, 39\\\";\\n var result = String.Join(\\\",\\\", RangesToStrings(GetRanges(testString)));\\n Console.Out.WriteLine(result);\\n }\\n\\n public static IEnumerable<IEnumerable<int>> GetRanges(string testString)\\n {\\n var numbers = testString.Split(new[] { ',' }).Select(x => Convert.ToInt32(x));\\n var current = new List<int>();\\n foreach (var n in numbers)\\n {\\n if (current.Count == 0)\\n {\\n current.Add(n);\\n }\\n else\\n {\\n if (current.Max() + 1 == n)\\n {\\n current.Add(n);\\n }\\n else\\n {\\n yield return current;\\n current = new List<int> { n };\\n }\\n }\\n }\\n yield return current;\\n }\\n\\n public static IEnumerable<string> RangesToStrings(IEnumerable<IEnumerable<int>> ranges)\\n {\\n foreach (var range in ranges)\\n {\\n if (range.Count() == 1)\\n {\\n yield return range.Single().ToString();\\n }\\n else if (range.Count() == 2)\\n {\\n yield return range.Min() + \\\",\\\" + range.Max();\\n }\\n else\\n {\\n yield return range.Min() + \\\"-\\\" + range.Max();\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\npublic class RangeExtraction\\n{\\n public static void Main()\\n {\\n string s = \\\"0,1,2,4,6,7,8,11,12,14,15, 16, 17, 18, 19, 20, 21, 22, 23, 24,25, 27, 28, 29, 30, 31, 32, 33, 35, 36,37, 38, 39\\\";\\n Console.WriteLine(string.Join(\\\",\\\", Ranges(s.Split(',').Select(int.Parse))\\n .Select(r => r.end == r.start ? $\\\"{r.start}\\\" : $\\\"{r.start}-{r.end}\\\")));\\n }\\n\\n static IEnumerable<(int start, int end)> Ranges(IEnumerable<int> numbers) {\\n if (numbers == null) yield break;\\n var e = numbers.GetEnumerator();\\n if (!e.MoveNext()) yield break;\\n\\n int start = e.Current;\\n int end = start;\\n while (e.MoveNext()) {\\n if (e.Current - end != 1) {\\n if (end - start == 1) {\\n yield return (start, start);\\n yield return (end, end);\\n } else {\\n yield return (start, end);\\n }\\n start = e.Current;\\n }\\n end = e.Current;\\n }\\n yield return (start, end);\\n }\\n\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"shared void run() {\\n\\t\\n\\tvalue numbers = [\\n\\t\\t0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n\\t\\t15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n\\t\\t25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n\\t\\t37, 38, 39\\n\\t];\\n\\t\\n\\tfunction asRangeFormattedString<Value>([Value*] values)\\n\\t\\t\\tgiven Value satisfies Enumerable<Value> {\\n\\t\\t\\n\\t\\tvalue builder = StringBuilder();\\n\\t\\t\\n\\t\\tvoid append(Range<Value> range) {\\n\\t\\t\\tif(!builder.empty) {\\n\\t\\t\\t\\tbuilder.append(\\\",\\\");\\n\\t\\t\\t}\\n\\t\\t\\tif(1 <= range.size < 3) {\\n\\t\\t\\t\\tbuilder.append(\\\",\\\".join(range));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tbuilder.append(\\\"``range.first``-``range.last``\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(nonempty values) {\\n\\t\\t\\tvariable value currentRange = values.first..values.first;\\n\\t\\t\\tfor(val in values.rest) {\\n\\t\\t\\t\\tif(currentRange.last.successor == val) {\\n\\t\\t\\t\\t\\tcurrentRange = currentRange.first..val;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tappend(currentRange);\\n\\t\\t\\t\\t\\tcurrentRange = val..val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tappend(currentRange);\\n\\t\\t}\\n\\t\\treturn builder.string;\\n\\t}\\n\\t\\n\\tvalue rangeString = asRangeFormattedString(numbers);\\n\\tassert(rangeString == \\\"0-2,4,6-8,11,12,14-25,27-33,35-39\\\");\\n\\tprint(rangeString);\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"(use '[flatland.useful.seq :only (partition-between)])\\n\\n(defn nonconsecutive? [[x y]]\\n (not= (inc x) y))\\n\\n(defn string-ranges [coll]\\n (let [left (first coll)\\n size (count coll)]\\n (cond\\n (> size 2) (str left \\\"-\\\" (last coll))\\n (= size 2) (str left \\\",\\\" (last coll))\\n :else (str left))))\\n\\n(defn format-with-ranges [coll]\\n (println (clojure.string/join \\\",\\\"\\n (map string-ranges (partition-between nonconsecutive? coll)))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. extract-range-task.\\n\\n DATA DIVISION.\\n WORKING-STORAGE SECTION.\\n 01 data-str PIC X(200) VALUE \\\"0, 1, 2, 4, 6,\\\"\\n & \\\" 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, \\\"\\n & \\\"24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39\\\".\\n\\n 01 result PIC X(200).\\n\\n PROCEDURE DIVISION.\\n CALL \\\"extract-range\\\" USING CONTENT data-str, REFERENCE result\\n DISPLAY FUNCTION TRIM(result)\\n\\n GOBACK\\n .\\n END PROGRAM extract-range-task.\\n\\n\\n IDENTIFICATION DIVISION.\\n PROGRAM-ID. extract-range.\\n\\n DATA DIVISION.\\n LOCAL-STORAGE SECTION.\\n COPY \\\"nums-table.cpy\\\".\\n\\n 01 difference PIC 999.\\n\\n 01 rng-begin PIC S999.\\n 01 rng-end PIC S999.\\n\\n 01 num-trailing PIC 999.\\n\\n 01 trailing-comma-pos PIC 999.\\n\\n LINKAGE SECTION.\\n 01 nums-str PIC X(200).\\n 01 extracted-range PIC X(200).\\n\\n 01 extracted-range-len CONSTANT LENGTH extracted-range.\\n\\n PROCEDURE DIVISION USING nums-str, extracted-range.\\n CALL \\\"split-nums\\\" USING CONTENT nums-str, \\\", \\\",\\n REFERENCE nums-table\\n\\n *> Process the table\\n MOVE nums (1) TO rng-begin\\n PERFORM VARYING nums-idx FROM 2 BY 1\\n UNTIL num-nums < nums-idx\\n SUBTRACT nums (nums-idx - 1) FROM nums (nums-idx)\\n GIVING difference\\n\\n *> If number is more than one away from the previous one\\n *> end the range and start a new one.\\n IF difference > 1\\n MOVE nums (nums-idx - 1) TO rng-end\\n CALL \\\"add-next-range\\\" USING CONTENT rng-begin,\\n rng-end, REFERENCE extracted-range\\n MOVE nums (nums-idx) TO rng-begin\\n END-IF\\n END-PERFORM\\n\\n *> Process the last number\\n MOVE nums (num-nums) TO rng-end\\n CALL \\\"add-next-range\\\" USING CONTENT rng-begin,\\n rng-end, REFERENCE extracted-range\\n\\n *> Remove trailing comma.\\n CALL \\\"find-num-trailing-spaces\\\"\\n USING CONTENT extracted-range, REFERENCE num-trailing\\n COMPUTE trailing-comma-pos =\\n extracted-range-len - num-trailing\\n MOVE SPACE TO extracted-range (trailing-comma-pos:1)\\n\\n GOBACK\\n .\\n\\n IDENTIFICATION DIVISION.\\n PROGRAM-ID. split-nums INITIAL.\\n\\n DATA DIVISION.\\n WORKING-STORAGE SECTION.\\n 01 num-len PIC 9.\\n 01 next-num-pos PIC 999.\\n\\n LINKAGE SECTION.\\n 01 str PIC X(200).\\n 01 delim PIC X ANY LENGTH.\\n\\n COPY \\\"nums-table.cpy\\\".\\n\\n PROCEDURE DIVISION USING str, delim, nums-table.\\n INITIALIZE num-nums\\n\\n PERFORM UNTIL str = SPACES\\n INITIALIZE num-len\\n INSPECT str TALLYING num-len FOR CHARACTERS BEFORE delim\\n\\n ADD 1 TO num-nums\\n\\n *> If there are no more instances of delim in the string,\\n *> add the rest of the string to the last element of the\\n *> table.\\n IF num-len = 0\\n MOVE str TO nums (num-nums)\\n EXIT PERFORM\\n ELSE\\n MOVE str (1:num-len) TO nums (num-nums)\\n ADD 3 TO num-len GIVING next-num-pos\\n MOVE str (next-num-pos:) TO str\\n END-IF\\n END-PERFORM\\n .\\n END PROGRAM split-nums.\\n\\n IDENTIFICATION DIVISION.\\n PROGRAM-ID. add-next-range INITIAL.\\n\\n DATA DIVISION.\\n WORKING-STORAGE SECTION.\\n 01 num-trailing PIC 999.\\n 01 start-pos PIC 999.\\n\\n 01 range-len PIC 999.\\n\\n 01 begin-edited PIC -ZZ9.\\n 01 end-edited PIC -ZZ9.\\n\\n LINKAGE SECTION.\\n 01 rng-begin PIC S999.\\n 01 rng-end PIC S999.\\n\\n 01 extracted-range PIC X(200).\\n\\n 01 extracted-range-len CONSTANT LENGTH extracted-range.\\n\\n PROCEDURE DIVISION USING rng-begin, rng-end, extracted-range.\\n CALL \\\"find-num-trailing-spaces\\\"\\n USING CONTENT extracted-range, REFERENCE num-trailing\\n COMPUTE start-pos = extracted-range-len - num-trailing + 1\\n\\n SUBTRACT rng-begin FROM rng-end GIVING range-len\\n\\n MOVE rng-begin TO begin-edited\\n MOVE rng-end TO end-edited\\n\\n EVALUATE TRUE\\n WHEN rng-begin = rng-end\\n STRING FUNCTION TRIM(begin-edited), \\\",\\\"\\n INTO extracted-range (start-pos:)\\n\\n WHEN range-len = 1\\n STRING FUNCTION TRIM(begin-edited), \\\",\\\",\\n FUNCTION TRIM(end-edited), \\\",\\\"\\n INTO extracted-range (start-pos:)\\n\\n WHEN OTHER\\n STRING FUNCTION TRIM(begin-edited), \\\"-\\\",\\n FUNCTION TRIM(end-edited), \\\",\\\"\\n INTO extracted-range (start-pos:)\\n END-EVALUATE\\n .\\n END PROGRAM add-next-range.\\n\\n IDENTIFICATION DIVISION.\\n PROGRAM-ID. find-num-trailing-spaces.\\n\\n DATA DIVISION.\\n LINKAGE SECTION.\\n 01 str PIC X(200).\\n 01 num-trailing PIC 999.\\n\\n PROCEDURE DIVISION USING str, num-trailing.\\n INITIALIZE num-trailing\\n INSPECT str TALLYING num-trailing FOR TRAILING SPACES\\n .\\n END PROGRAM find-num-trailing-spaces.\\n\\n END PROGRAM extract-range.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \" 01 nums-table.\\n 03 num-nums PIC 999.\\n 03 nums-area.\\n 05 nums PIC S999 OCCURS 1 TO 100 TIMES\\n DEPENDING ON num-nums\\n INDEXED BY nums-idx.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"(defun format-with-ranges (list)\\n (unless list (return \\\"\\\"))\\n (with-output-to-string (s)\\n (let ((current (first list))\\n (list (rest list))\\n (count 1))\\n (princ current s)\\n (dolist (next list)\\n (if (= next (1+ current))\\n (incf count)\\n (progn (princ (if (> count 2) \\\"-\\\" \\\",\\\") s)\\n (when (> count 1)\\n (princ current s)\\n (princ \\\",\\\" s))\\n (princ next s)\\n (setf count 1)))\\n (setf current next))\\n (when (> count 1)\\n (princ (if (> count 2) \\\"-\\\" \\\",\\\") s)\\n (princ current s)))))\\n\\nCL-USER> (format-with-ranges (list 0 1 2 4 6 7 8 11 12 14\\n 15 16 17 18 19 20 21 22 23 24\\n 25 27 28 29 30 31 32 33 35 36\\n 37 38 39))\\n\\\"0-2,4,6-8,11,12,14-25,27-33,35-39\\\"\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.conv, std.string, std.algorithm, std.range;\\n\\nstring rangeExtraction(in int[] items)\\nin {\\n assert(items.isSorted);\\n} body {\\n if (items.empty)\\n return null;\\n auto ranges = [[items[0].text]];\\n\\n foreach (immutable x, immutable y; items.zip(items[1 .. $]))\\n if (x + 1 == y)\\n ranges[$ - 1] ~= y.text;\\n else\\n ranges ~= [y.text];\\n\\n return ranges\\n .map!(r => r.length > 2 ? r[0] ~ \\\"-\\\" ~ r.back : r.join(','))\\n .join(',');\\n}\\n\\nvoid main() {\\n foreach (data; [[-8, -7, -6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9,\\n 10, 11, 14, 15, 17, 18, 19, 20],\\n [0, 0, 0, 1, 1],\\n [0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18,\\n 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31,\\n 32, 33, 35, 36, 37, 38, 39]])\\n data.rangeExtraction.writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"procedure ExtractRanges(const values : array of Integer);\\nbegin\\n var i:=0;\\n while i<values.Length do begin\\n if i>0 then\\n Print(',');\\n Print(values[i]);\\n var j:=i+1;\\n while (j<values.Length) and (values[j]=values[j-1]+1) do\\n Inc(j);\\n Dec(j);\\n if j>i then begin\\n if j=i+1 then\\n Print(',')\\n else Print('-');\\n Print(values[j]);\\n end;\\n i:=j+1;\\n end;\\nend;\\n\\nExtractRanges([ 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39]);\\n\",\n \"language\": \"DWScript\"\n },\n {\n \"code\": \"func rangeFormat(a) {\\n if a.Length() == 0 {\\n return \\\"\\\"\\n }\\n var parts = []\\n var n1 = 0\\n while true {\\n var n2 = n1 + 1\\n while n2 < a.Length() && a[n2] == a[n2-1]+1 {\\n n2 += 1\\n }\\n var s = a[n1].ToString()\\n if n2 == n1+2 {\\n s += \\\",\\\" + a[n2-1]\\n } else if n2 > n1+2 {\\n s += \\\"-\\\" + a[n2-1]\\n }\\n parts.Add(s)\\n if n2 == a.Length() {\\n break\\n }\\n if a[n2] == a[n2-1] {\\n throw \\\"Sequence repeats value \\\\(a[n2])\\\"\\n }\\n if a[n2] < a[n2-1] {\\n throw \\\"Sequence not ordered: \\\\(a[n2]) < \\\\(a[n2-1])\\\"\\n }\\n n1 = n2\\n }\\n return String.Join(values: parts)\\n}\\n\\nvar rf = rangeFormat([\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39\\n])\\nprint(\\\"range format: \\\\(rf)\\\")\\n\",\n \"language\": \"Dyalect\"\n },\n {\n \"code\": \"def rex(numbers :List[int]) {\\n var region := 0..!0\\n for n in numbers { region |= n..n }\\n var ranges := []\\n for interval in region.getSimpleRegions() {\\n def a := interval.getOptStart()\\n def b := interval.getOptBound() - 1\\n ranges with= if (b > a + 1) {\\n `$a-$b`\\n } else if (b <=> a + 1) {\\n `$a,$b`\\n } else { # b <=> a\\n `$a`\\n }\\n }\\n return \\\",\\\".rjoin(ranges)\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"? rex([\\n> 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n> 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n> 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n> 37, 38, 39])\\n# value: \\\"0-2,4,6-8,11,12,14-25,27-33,35-39\\\"\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"func$ mkrange arr[] .\\n idx = 1\\n idx2 = 1\\n while idx <= len arr[]\\n repeat\\n idx2 += 1\\n until idx2 > len arr[] or arr[idx2] - arr[idx2 - 1] <> 1\\n .\\n if idx2 - idx > 2\\n r$ &= arr[idx] & \\\"-\\\" & arr[idx2 - 1] & \\\",\\\"\\n idx = idx2\\n else\\n while idx < idx2\\n r$ &= arr[idx] & \\\",\\\"\\n idx += 1\\n .\\n .\\n .\\n return substr r$ 1 (len r$ - 1)\\n.\\nprint mkrange [ 0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39 ]\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"(define task '(0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39))\\n\\n;; 1- GROUPING\\n(define (group-range item acc)\\n(if\\n (or (empty? acc) (!= (caar acc) (1- item)))\\n (cons (cons item item) acc)\\n (begin (set-car! (car acc) item) acc)))\\n\\n;; intermediate result\\n;; (foldl group-range () task)\\n;; → ((39 . 35) (33 . 27) (25 . 14) (12 . 11) (8 . 6) (4 . 4) (2 . 0))\\n\\n;; 2- FORMATTING\\n(define (range->string range)\\n(let ((from (rest range)) (to (first range)))\\n\\t\\t(cond\\n\\t\\t((= from to) (format \\\"%d \\\" from))\\n\\t\\t((= to (1+ from)) (format \\\"%d, %d \\\" from to))\\n\\t\\t(else (format \\\"%d-%d \\\" from to)))))\\n\\t\\t\\n;; 3 - FINAL\\n(string-join (map range->string (reverse (foldl group-range () task))) \\\",\\\")\\n → \\\"0-2 ,4 ,6-8 ,11, 12 ,14-25 ,27-33 ,35-39 \\\"\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"class\\n\\tRANGE\\n\\ncreate\\n\\tmake\\n\\nfeature\\n\\tmake\\n\\t\\tlocal\\n\\t\\t\\textended_range: STRING\\n\\t\\tdo\\n\\t\\t\\textended_range := \\\"0, 1, 2, 4, 6, 7, 8, 11, 12, 14, \\\" +\\n\\t\\t\\t\\t\\\"15, 16, 17, 18, 19, 20, 21, 22, 23, 24, \\\" +\\n\\t\\t\\t\\t\\\"25, 27, 28, 29, 30, 31, 32, 33, 35, 36, \\\" +\\n \\t\\t\\\"37, 38, 39\\\"\\n\\t\\t\\tprint(\\\"Extended range: \\\" + extended_range + \\\"%N\\\")\\n\\t\\t\\tprint(\\\"Extracted range: \\\" + extracted_range(extended_range) + \\\"%N%N\\\")\\n\\t\\tend\\n\\nfeature\\n\\textracted_range(sequence: STRING): STRING\\n\\t\\tlocal\\n\\t\\t\\telements: LIST[STRING]\\n\\t\\t\\tfirst, curr: STRING\\n\\t\\t\\tsubrange_size, index: INTEGER\\n\\t\\tdo\\n\\t\\t\\tsequence.replace_substring_all (\\\", \\\", \\\",\\\")\\n\\t\\t\\telements := sequence.split (',')\\n\\t\\t\\tfrom\\n\\t\\t\\t\\tindex := 2\\n\\t\\t\\t\\tfirst := elements.at (1)\\n\\t\\t\\t\\tsubrange_size := 0\\n\\t\\t\\t\\tResult := \\\"\\\"\\n\\t\\t\\tuntil\\n\\t\\t\\t\\tindex > elements.count\\n\\t\\t\\tloop\\n\\t\\t\\t\\tcurr := elements.at (index)\\n\\t\\t\\t\\tif curr.to_integer - first.to_integer - subrange_size = 1\\n\\t\\t\\t\\tthen\\n\\t\\t\\t\\t\\tsubrange_size := subrange_size + 1\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tResult.append(first)\\n\\t\\t\\t\\t\\tif (subrange_size <= 1)\\n\\t\\t\\t\\t\\tthen\\n\\t\\t\\t\\t\\t\\tResult.append (\\\", \\\")\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tResult.append (\\\" - \\\")\\n\\t\\t\\t\\t\\tend\\n\\t\\t\\t\\t\\tif (subrange_size >= 1)\\n\\t\\t\\t\\t\\tthen\\n\\t\\t\\t\\t\\t\\tResult.append ((first.to_integer + subrange_size).out)\\n\\t\\t\\t\\t\\t\\tResult.append (\\\", \\\")\\n\\t\\t\\t\\t\\tend\\n\\n\\t\\t\\t\\t\\tfirst := curr\\n\\t\\t\\t\\t\\tsubrange_size := 0\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tindex := index + 1\\n\\t\\t\\tend\\n\\t\\t\\tResult.append(first)\\n\\t\\t\\tif (subrange_size <= 1)\\n\\t\\t\\tthen\\n\\t\\t\\t\\tResult.append (\\\", \\\")\\n\\t\\t\\telse\\n\\t\\t\\t\\tResult.append (\\\" - \\\")\\n\\t\\t\\tend\\n\\t\\t\\tif (subrange_size >= 1)\\n\\t\\t\\tthen\\n\\t\\t\\t\\tResult.append ((first.to_integer + subrange_size).out)\\n\\t\\t\\tend\\n\\t\\tend\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"defmodule RC do\\n def range_extract(list) do\\n max = Enum.max(list) + 2\\n sorted = Enum.sort([max|list])\\n candidate_number = hd(sorted)\\n current_number = hd(sorted)\\n extract(tl(sorted), candidate_number, current_number, [])\\n end\\n\\n defp extract([], _, _, range), do: Enum.reverse(range) |> Enum.join(\\\",\\\")\\n defp extract([next|rest], candidate, current, range) when current+1 >= next do\\n extract(rest, candidate, next, range)\\n end\\n defp extract([next|rest], candidate, current, range) when candidate == current do\\n extract(rest, next, next, [to_string(current)|range])\\n end\\n defp extract([next|rest], candidate, current, range) do\\n separator = if candidate+1 == current, do: \\\",\\\", else: \\\"-\\\"\\n str = \\\"#{candidate}#{separator}#{current}\\\"\\n extract(rest, next, next, [str|range])\\n end\\nend\\n\\nlist = [\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39\\n]\\nIO.inspect RC.range_extract(list)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"(require 'gnus-range)\\n\\n(defun rangext (lst)\\n (mapconcat (lambda (item)\\n (if (consp item)\\n\\t\\t (if (= (+ 1 (car item)) (cdr item))\\n\\t\\t (format \\\"%d,%d\\\" (car item) (cdr item))\\n\\t\\t (format \\\"%d-%d\\\" (car item) (cdr item)))\\n (format \\\"%d\\\" item)))\\n (gnus-compress-sequence lst)\\n \\\",\\\"))\\n\\n(rangext '(0 1 2 4 6 7 8 11 12 14\\n 15 16 17 18 19 20 21 22 23 24\\n 25 27 28 29 30 31 32 33 35 36\\n 37 38 39))\\n;; => \\\"0-2,4,6-8,11,12,14-25,27-33,35-39\\\"\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"(defun split-into-ranges (numbers)\\n (let* ((last-number (pop numbers))\\n (range (list last-number))\\n ranges)\\n (dolist (n numbers)\\n (if (= n (1+ last-number))\\n (push n range)\\n (push (nreverse range) ranges)\\n (setq range (list n)))\\n (setq last-number n))\\n (nreverse (cons (nreverse range) ranges))))\\n\\n(defun format-range (range)\\n (cond\\n ((not range)\\n (error \\\"invalid range\\\"))\\n ((= (length range) 1)\\n (number-to-string (car range)))\\n ((= (length range) 2)\\n (format \\\"%d,%d\\\" (car range) (cadr range)))\\n (t\\n (format \\\"%d-%d\\\" (car range) (car (last range))))))\\n\\n(defun rangext (numbers)\\n (mapconcat #'format-range (split-into-ranges numbers) \\\",\\\"))\\n\\n(rangext '(0 1 2 4 6 7 8 11 12 14\\n 15 16 17 18 19 20 21 22 23 24\\n 25 27 28 29 30 31 32 33 35 36\\n 37 38 39))\\n;; => \\\"0-2,4,6-8,11,12,14-25,27-33,35-39\\\"\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"-module( range ).\\n\\n-export( [extraction/1, task/0] ).\\n\\nextraction( [H | T] ) when is_integer(H) ->\\n Reversed_extracts = extraction_acc( lists:foldl(fun extraction/2, {H, []}, T) ),\\n string:join( lists:reverse(Reversed_extracts), \\\",\\\" ).\\n\\ntask() ->\\n io:fwrite( \\\"~p~n\\\", [extraction([0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39])] ).\\n\\n\\n\\nextraction( N, {Start, Acc} ) when N =:= Start + 1 -> {Start, N, Acc};\\nextraction( N, {Start, Acc} ) -> {N, extraction_acc( {Start, Acc} )};\\nextraction( N, {Start, Stop, Acc} ) when N =:= Stop + 1 -> {Start, N, Acc};\\nextraction( N, {Start, Stop, Acc} ) -> {N, extraction_acc( {Start, Stop, Acc} )}.\\n\\nextraction_acc( {N, Acc} ) -> [erlang:integer_to_list(N) | Acc];\\nextraction_acc( {Start, Stop, Acc} ) when Stop > Start + 1 -> [erlang:integer_to_list(Start) ++ \\\"-\\\" ++ erlang:integer_to_list(Stop) | Acc];\\nextraction_acc( {Start, Stop, Acc} ) -> [erlang:integer_to_list(Stop), erlang:integer_to_list(Start) | Acc]. % Reversed\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"function extract_ranges(sequence s)\\n integer first\\n sequence out\\n out = \\\"\\\"\\n if length(s) = 0 then\\n return out\\n end if\\n first = 1\\n for i = 2 to length(s) do\\n if s[i] != s[i-1]+1 then\\n if first = i-1 then\\n out &= sprintf(\\\"%d,\\\", s[first])\\n elsif first = i-2 then\\n out &= sprintf(\\\"%d,%d,\\\", {s[first],s[i-1]})\\n else\\n out &= sprintf(\\\"%d-%d,\\\", {s[first],s[i-1]})\\n end if\\n first = i\\n end if\\n end for\\n if first = length(s) then\\n out &= sprintf(\\\"%d\\\", s[first])\\n elsif first = length(s)-1 then\\n out &= sprintf(\\\"%d,%d\\\", {s[first],s[$]})\\n else\\n out &= sprintf(\\\"%d-%d\\\", {s[first],s[$]})\\n end if\\n return out\\nend function\\n\\nputs(1, extract_ranges({0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19,\\n 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39}))\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"let extractRanges = function\\n | [] -> Seq.empty\\n | x::xr ->\\n let rec loop ys first last = seq {\\n match ys with\\n | y::yr when y = last + 1 -> yield! loop yr first y // add to current range\\n | y::yr -> yield (first, last) // finish current range\\n yield! loop yr y y // and start next\\n | [] -> yield (first, last) } // finish final range\\n loop xr x x\\n\\n\\nlet rangeToString (s,e) =\\n match e-s with\\n | 0 -> sprintf \\\"%d\\\" s\\n | 1 -> sprintf \\\"%d,%d\\\" s e\\n | _ -> sprintf \\\"%d-%d\\\" s e\\n\\n\\nlet extract = extractRanges >> Seq.map rangeToString >> String.concat \\\",\\\"\\n\\n\\nprintfn \\\"%s\\\" (extract [ 0; 1; 2; 4; 6; 7; 8; 11; 12; 14; 15; 16; 17; 18; 19; 20; 21;\\n 22; 23; 24; 25; 27; 28; 29; 30; 31; 32; 33; 35; 36; 37; 38; 39 ])\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: formatting io kernel math math.parser sequences\\nsplitting.monotonic ;\\nIN: rosetta-code.range-extraction\\n\\n: make-range ( seq -- str )\\n [ first ] [ last ] bi \\\"%d-%d\\\" sprintf ;\\n\\n: make-atomic ( seq -- str ) [ number>string ] map \\\",\\\" join ;\\n\\n: extract-range ( seq -- str )\\n [ - -1 = ] monotonic-split\\n [ dup length 2 > [ make-range ] [ make-atomic ] if ] map\\n \\\",\\\" join ;\\n\\n{\\n 0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22\\n 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39\\n} extract-range print\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"create values\\nhere\\n 0 , 1 , 2 , 4 , 6 , 7 , 8 , 11 , 12 , 14 ,\\n 15 , 16 , 17 , 18 , 19 , 20 , 21 , 22 , 23 , 24 ,\\n 25 , 27 , 28 , 29 , 30 , 31 , 32 , 33 , 35 , 36 ,\\n 37 , 38 , 39 ,\\nhere swap - 1 cells / constant /values\\n\\n: clip 1- swap cell+ swap ; \\\\ reduce array\\n: .range2 0 .r .\\\" -\\\" 0 .r ; \\\\ difference two or more\\n: .range1 0 .r .\\\" , \\\" 0 .r ; \\\\ difference one\\n: .range0 drop 0 .r ; \\\\ no difference\\n \\\\ select printing routine\\ncreate .range ' .range0 , ' .range1 , ' .range2 ,\\n does> >r over over - 2 min cells r> + @ execute ;\\n\\n: .ranges ( a n --)\\n over @ dup >r >r \\\\ setup first value\\n begin\\n clip dup \\\\ check length array\\n while\\n over @ dup r@ 1+ = \\\\ check if range breaks\\n if r> drop >r else r> r> .range .\\\" , \\\" dup >r >r then\\n repeat 2drop r> r> .range cr \\\\ print last range\\n;\\n\\nvalues /values .ranges\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" SUBROUTINE IRANGE(TEXT)\\t!Identifies integer ranges in a list of integers.\\nCould make this a function, but then a maximum text length returned would have to be specified.\\n CHARACTER*(*) TEXT\\t!The list on input, the list with ranges on output.\\n INTEGER LOTS\\t\\t!Once again, how long is a piece of string?\\n PARAMETER (LOTS = 666)\\t!This should do, at least for demonstrations.\\n INTEGER VAL(LOTS)\\t!The integers of the list.\\n INTEGER N\\t\\t!Count of numbers.\\n INTEGER I,I1\\t\\t!Steppers.\\n N = 1\\t\\t!Presume there to be one number.\\n DO I = 1,LEN(TEXT)\\t!Then by noticing commas,\\n IF (TEXT(I:I).EQ.\\\",\\\") N = N + 1\\t!Determine how many more there are.\\n END DO\\t\\t\\t!Step alonmg the text.\\n IF (N.LE.2) RETURN\\t!One comma = two values. Boring.\\n IF (N.GT.LOTS) STOP \\\"Too many values!\\\"\\n READ (TEXT,*) VAL(1:N)\\t!Get the numbers, with free-format flexibility.\\n TEXT = \\\"\\\"\\t\\t!Scrub the parameter!\\n L = 0\\t\\t\\t!No text has been placed.\\n I1 = 1\\t\\t\\t!Start the scan.\\n 10 IF (L.GT.0) CALL EMIT(\\\",\\\")\\t!A comma if there is prior text.\\n CALL SPLOT(VAL(I1))\\t\\t!The first number always appears.\\n DO I = I1 + 1,N\\t\\t\\t!Now probe ahead\\n IF (VAL(I - 1) + 1 .NE. VAL(I)) EXIT\\t!While values are consecutive.\\n END DO\\t\\t\\t\\t!Up to the end of the remaining list.\\n IF (I - I1 .GT. 2) THEN\\t\\t!More than two consecutive values seen?\\n CALL EMIT(\\\"-\\\")\\t\\t!Yes!\\n CALL SPLOT(VAL(I - 1))\\t!The ending number of a range.\\n I1 = I\\t\\t\\t!Finger the first beyond the run.\\n ELSE\\t\\t\\t!But if too few to be worth a span,\\n I1 = I1 + 1\\t\\t\\t!Just finger the next number.\\n END IF\\t\\t\\t!So much for that starter.\\n IF (I.LE.N) GO TO 10\\t!Any more?\\n CONTAINS\\t\\t!Some assistants to save on repetition.\\n SUBROUTINE EMIT(C)\\t!Rolls forth one character.\\n CHARACTER*1 C\\t\\t!The character.\\n L = L + 1\\t\\t!Advance the finger.\\n IF (L.GT.LEN(TEXT)) STOP \\\"Ran out of text!\\\"\\t!Maybe not.\\n TEXT(L:L) = C\\t\\t!And place the character.\\n END SUBROUTINE EMIT\\t!That was simple.\\n SUBROUTINE SPLOT(N)\\t!Rolls forth a signed number.\\n INTEGER N\\t\\t!The number.\\n CHARACTER*12 FIELD\\t!Sufficient for 32-bit integers.\\n INTEGER I\\t\\t!A stepper.\\n WRITE (FIELD,\\\"(I0)\\\") N!Roll the number, with trailing spaces.\\n DO I = 1,12\\t\\t!Now transfer the text of the number.\\n IF (FIELD(I:I).LE.\\\" \\\") EXIT\\t!Up to the first space.\\n CALL EMIT(FIELD(I:I))\\t!One by one.\\n END DO\\t\\t!On to the end.\\n END SUBROUTINE SPLOT\\t!Not so difficult either.\\n END\\t!So much for IRANGE.\\n\\n PROGRAM POKE\\n CHARACTER*(200) SOME\\n SOME = \\\" 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, \\\"\\n 1 //\\\" 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\\"\\n 2 //\\\"25, 27, 28, 29, 30, 31, 32, 33, 35, 36, \\\"\\n 3 //\\\"37, 38, 39 \\\"\\n CALL IRANGE(SOME)\\n WRITE (6,*) SOME\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nFunction formatRange (a() As Integer) As String\\n Dim lb As Integer = LBound(a)\\n Dim ub As Integer = UBound(a)\\n If ub = - 1 Then Return \\\"\\\"\\n If lb = ub Then Return Str(a(lb))\\n Dim rangeCount As Integer = 1\\n Dim range As String = Str(a(lb))\\n For i As Integer = lb + 1 To ub\\n If a(i) = a(i - 1) + 1 Then\\n rangeCount += 1\\n ElseIf rangeCount = 1 Then\\n range += \\\",\\\" + Str(a(i))\\n ElseIf rangeCount = 2 Then\\n rangeCount = 1\\n range += \\\",\\\" + Str(a(i-1)) + \\\",\\\" + Str(a(i))\\n Else\\n rangeCount = 1\\n range += \\\"-\\\" + Str(a(i-1)) + \\\",\\\" + Str(a(i))\\n End If\\n Next\\n If rangeCount = 2 Then\\n range += \\\",\\\" + Str(a(ub))\\n ElseIf rangeCount > 2 Then\\n range += \\\"-\\\" + Str(a(ub))\\n End If\\n Return range\\nEnd Function\\n\\nDim a(1 To 20) As Integer = {-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20}\\nPrint formatRange(a())\\nPrint\\n\\nDim b(1 To 33) As Integer => _\\n{ _\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, _\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, _\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, _\\n 37, 38, 39 _\\n}\\n\\nPrint formatRange(b())\\nPrint\\nPrint \\\"Press any key to continue\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"siInput As New Short[]\\nsiInput1 As Short[] = [0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39]\\nsiInput2 As Short[] = [-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]\\nsOutput As New String[]\\nsiCount As Short\\nsiNum As Short\\n'__________________\\nPublic Sub Main()\\nDim siLoop As Short\\n\\nFor siLoop = 0 To 1\\n If siLoop = 0 Then siInput = siInput1.Copy() Else siInput = siInput2.Copy()\\n siCount = 0\\n siNum = 0\\n Repeat\\n If siInput[siCount + 1] = siInput[siCount] + 1 Then\\n Inc siCount\\n Else\\n GetOutput\\n Endif\\n Until siCount = siInput.Max\\n\\n GetOutput\\n Print sOutput.join(\\\", \\\")\\n sOutput.clear\\nNext\\n\\nEnd\\n'__________________\\nPublic Sub GetOutput()\\n\\nIf siNum = siCount Then\\n sOutput.add(siInput[siNum])\\n Inc siCount\\n siNum = siCount\\nEnd If\\n\\nIf siNum <> siCount Then\\n If siNum = siCount - 1 Then\\n sOutput.add(siInput[siNum])\\n sOutput.add(siInput[siNum + 1])\\n siCount += 2\\n siNum += 2\\n Return\\n End If\\n sOutput.Add(siInput[siNum] & \\\"-\\\" & siInput[siCount])\\n Inc siCount\\n siNum = siCount\\nEnd If\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"errors\\\"\\n \\\"fmt\\\"\\n \\\"strconv\\\"\\n \\\"strings\\\"\\n)\\n\\nfunc main() {\\n rf, err := rangeFormat([]int{\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39,\\n })\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n fmt.Println(\\\"range format:\\\", rf)\\n}\\n\\nfunc rangeFormat(a []int) (string, error) {\\n if len(a) == 0 {\\n return \\\"\\\", nil\\n }\\n var parts []string\\n for n1 := 0; ; {\\n n2 := n1 + 1\\n for n2 < len(a) && a[n2] == a[n2-1]+1 {\\n n2++\\n }\\n s := strconv.Itoa(a[n1])\\n if n2 == n1+2 {\\n s += \\\",\\\" + strconv.Itoa(a[n2-1])\\n } else if n2 > n1+2 {\\n s += \\\"-\\\" + strconv.Itoa(a[n2-1])\\n }\\n parts = append(parts, s)\\n if n2 == len(a) {\\n break\\n }\\n if a[n2] == a[n2-1] {\\n return \\\"\\\", errors.New(fmt.Sprintf(\\n \\\"sequence repeats value %d\\\", a[n2]))\\n }\\n if a[n2] < a[n2-1] {\\n return \\\"\\\", errors.New(fmt.Sprintf(\\n \\\"sequence not ordered: %d < %d\\\", a[n2], a[n2-1]))\\n }\\n n1 = n2\\n }\\n return strings.Join(parts, \\\",\\\"), nil\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def range = { s, e -> s == e ? \\\"${s},\\\" : s == e - 1 ? \\\"${s},${e},\\\" : \\\"${s}-${e},\\\" }\\n\\ndef compressList = { list ->\\n def sb, start, end\\n (sb, start, end) = [''<<'', list[0], list[0]]\\n for (i in list[1..-1]) {\\n (sb, start, end) = i == end + 1 ? [sb, start, i] : [sb << range(start, end), i, i]\\n }\\n (sb << range(start, end))[0..-2].toString()\\n}\\n\\ndef compressRanges = { expanded -> compressList(Eval.me('[' + expanded + ']')) }\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def s = '''\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39\\n'''\\nprintln (compressRanges(s))\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Data.List (intercalate)\\n\\nextractRange :: [Int] -> String\\nextractRange = intercalate \\\",\\\" . f\\n where f :: [Int] -> [String]\\n f (x1 : x2 : x3 : xs) | x1 + 1 == x2 && x2 + 1 == x3\\n = (show x1 ++ '-' : show xn) : f xs'\\n where (xn, xs') = g (x3 + 1) xs\\n g a (n : ns) | a == n = g (a + 1) ns\\n | otherwise = (a - 1, n : ns)\\n g a [] = (a - 1, [])\\n f (x : xs) = show x : f xs\\n f [] = []\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"> extractRange $ [0..2] ++ 4 : [6..8] ++ 11 : 12 : [14..25] ++ [27..33] ++ [35..39]\\n\\\"0-2,4,6-8,11,12,14-25,27-33,35-39\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.List (intercalate)\\nimport Data.Function (on)\\n\\n----------------------- RANGE FORMAT ---------------------\\nrangeFormat :: [Int] -> String\\nrangeFormat = intercalate \\\",\\\" . fmap rangeString . splitBy ((/=) . succ)\\n\\nrangeString xs\\n | 2 < length xs = x ++ '-' : last t\\n | otherwise = intercalate \\\",\\\" ps\\n where\\n ps@(x:t) = show <$> xs\\n\\n--------------------- GENERIC FUNCTION -------------------\\n-- Split wherever a supplied predicate matches the\\n-- relationship between two consecutive items.\\nsplitBy :: (a -> a -> Bool) -> [a] -> [[a]]\\nsplitBy _ [] = []\\nsplitBy _ [x] = [[x]]\\nsplitBy f xs@(_:t) = uncurry (:) $ foldr go ([], []) (zip xs t)\\n where\\n go (x, prev) (active, acc)\\n | f x prev = ([x], current : acc)\\n | otherwise = (x : current, acc)\\n where\\n current\\n | null active = [prev]\\n | otherwise = active\\n\\n--------------------------- TEST -------------------------\\nmain :: IO ()\\nmain =\\n print $\\n rangeFormat\\n [ 0\\n , 1\\n , 2\\n , 4\\n , 6\\n , 7\\n , 8\\n , 11\\n , 12\\n , 14\\n , 15\\n , 16\\n , 17\\n , 18\\n , 19\\n , 20\\n , 21\\n , 22\\n , 23\\n , 24\\n , 25\\n , 27\\n , 28\\n , 29\\n , 30\\n , 31\\n , 32\\n , 33\\n , 35\\n , 36\\n , 37\\n , 38\\n , 39\\n ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.List (intercalate, groupBy, isPrefixOf)\\nimport Data.List.Split (chop)\\nimport Data.Bool (bool)\\n\\nrangeFormat :: [Int] -> String\\nrangeFormat xs =\\n intercalate \\\",\\\" $\\n (head . ((bool <*> tail) <*> (> 1) . length)) <$>\\n groupBy isPrefixOf (rangeString <$> chop succSpan (zip xs (tail xs)))\\n\\nrangeString [] = \\\"\\\"\\nrangeString xxs@(x:xs)\\n | null xs = show (snd x)\\n | otherwise = intercalate \\\"-\\\" (show <$> [fst x, snd (last xs)])\\n\\nsuccSpan [] = ([], [])\\nsuccSpan (xxs@(x:xs))\\n | null ys = ([x], xs)\\n | otherwise = (ys, zs)\\n where\\n (ys, zs) = span (uncurry ((==) . succ)) xxs\\n\\nmain :: IO ()\\nmain =\\n putStrLn $\\n rangeFormat [ 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39 ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\n\\n R := [ 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39 ]\\n\\n write(\\\"Input list := \\\",list2string(R))\\n write(\\\"Extracted sting := \\\",s := range_extract(R) | \\\"FAILED\\\")\\nend\\n\\nprocedure range_extract(R) #: return string/range representation of a list of unique integers\\nlocal s,sep,low,high,x\\n\\n every if integer(x:= !R) ~= x then fail # ensure all are integers,\\n R := sort(set(R)) # unique, and sorted\\n\\n s := sep := \\\"\\\"\\n while s ||:= sep || ( low := high := get(R) ) do { # lower bound of range\\n sep := \\\",\\\"\\n while high := ( R[1] = high + 1 ) do get(R) # find the end of range\\n if high > low+1 then s ||:= \\\"-\\\" || high # - record range of 3+\\n else if high = low+1 then push(R,high) # - range of 2, high becomes new low\\n }\\n return s\\nend\\n\\nprocedure list2string(L) #: helper to convert list to string\\nlocal s\\n\\n every (s := \\\"[ \\\") ||:= !L || \\\" \\\"\\n return s || \\\"]\\\"\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"fmt=: [: ;@(8!:0) [`]`({. ; (',-' {~ 2 < #) ; {:)@.(2 <. #)\\ngroup=: <@fmt;.1~ 1 ~: 0 , 2 -~/\\\\ ]\\nextractRange=: ',' joinstring group\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" extractRange 0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39\\n0-2,4,6-8,11,12,14-25,27-33,35-39\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" extractRange (-6, 3, 2, 1), 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20\\n-6,-3-1,3-5,7-11,14,15,17-20\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" extractRange i.101\\n0-100\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" extractRange (-. p:) i.101\\n0,1,4,6,8-10,12,14-16,18,20-22,24-28,30,32-36,38-40,42,44-46,48-52,54-58,60,62-66,68-70,72,74-78,80-82,84-88,90-96,98-100\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" extractRange 2}. (-. p:) i.101\\n4,6,8-10,12,14-16,18,20-22,24-28,30,32-36,38-40,42,44-46,48-52,54-58,60,62-66,68-70,72,74-78,80-82,84-88,90-96,98-100\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class RangeExtraction {\\n\\n public static void main(String[] args) {\\n int[] arr = {0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39};\\n\\n int len = arr.length;\\n int idx = 0, idx2 = 0;\\n while (idx < len) {\\n while (++idx2 < len && arr[idx2] - arr[idx2 - 1] == 1);\\n if (idx2 - idx > 2) {\\n System.out.printf(\\\"%s-%s,\\\", arr[idx], arr[idx2 - 1]);\\n idx = idx2;\\n } else {\\n for (; idx < idx2; idx++)\\n System.out.printf(\\\"%s,\\\", arr[idx]);\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function rangeExtraction(list) {\\n var len = list.length;\\n var out = [];\\n var i, j;\\n\\n for (i = 0; i < len; i = j + 1) {\\n // beginning of range or single\\n out.push(list[i]);\\n\\n // find end of range\\n for (var j = i + 1; j < len && list[j] == list[j-1] + 1; j++);\\n j--;\\n\\n if (i == j) {\\n // single number\\n out.push(\\\",\\\");\\n } else if (i + 1 == j) {\\n // two numbers\\n out.push(\\\",\\\", list[j], \\\",\\\");\\n } else {\\n // range\\n out.push(\\\"-\\\", list[j], \\\",\\\");\\n }\\n }\\n out.pop(); // remove trailing comma\\n return out.join(\\\"\\\");\\n}\\n\\n// using print function as supplied by Rhino standalone\\nprint(rangeExtraction([\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39\\n]));\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(function () {\\n 'use strict';\\n\\n // rangeFormat :: [Int] -> String\\n var rangeFormat = function (xs) {\\n return splitBy(function (a, b) {\\n return b - a > 1;\\n }, xs)\\n .map(rangeString)\\n .join(',');\\n };\\n\\n // rangeString :: [Int] -> String\\n var rangeString = function (xs) {\\n return xs.length > 2 ? [head(xs), last(xs)].map(show)\\n .join('-') : xs.join(',');\\n };\\n\\n // GENERIC FUNCTIONS\\n\\n // Splitting not on a delimiter, but whenever the relationship between\\n // two consecutive items matches a supplied predicate function\\n\\n // splitBy :: (a -> a -> Bool) -> [a] -> [[a]]\\n var splitBy = function (f, xs) {\\n if (xs.length < 2) return [xs];\\n var h = head(xs),\\n lstParts = xs.slice(1)\\n .reduce(function (a, x) {\\n var acc = a[0],\\n active = a[1],\\n prev = a[2];\\n\\n return f(prev, x) ? (\\n [acc.concat([active]), [x], x]\\n ) : [acc, active.concat(x), x];\\n }, [\\n [],\\n [h], h\\n ]);\\n return lstParts[0].concat([lstParts[1]]);\\n };\\n\\n // head :: [a] -> a\\n var head = function (xs) {\\n return xs.length ? xs[0] : undefined;\\n };\\n\\n // last :: [a] -> a\\n var last = function (xs) {\\n return xs.length ? xs.slice(-1)[0] : undefined;\\n };\\n\\n // show :: a -> String\\n var show = function (x) {\\n return JSON.stringify(x);\\n };\\n\\n // TEST\\n return rangeFormat([0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16,\\n 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32,\\n 33, 35, 36, 37, 38, 39\\n ]);\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n 'use strict';\\n\\n // ---------------- RANGE EXTRACTION -----------------\\n\\n // rangeFormat :: [Int] -> String\\n const rangeFormat = xs =>\\n splitBy((a, b) => b - a > 1, xs)\\n .map(rangeString)\\n .join(',');\\n\\n // rangeString :: [Int] -> String\\n const rangeString = xs =>\\n xs.length > 2 ? (\\n [xs[0], last(xs)].map(show)\\n .join('-')\\n ) : xs.join(',')\\n\\n\\n // ---------------------- TEST -----------------------\\n const main = () =>\\n rangeFormat([0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39\\n ]);\\n\\n\\n // ---------------- GENERIC FUNCTIONS ----------------\\n\\n // Splitting not on a delimiter, but whenever the\\n // relationship between two consecutive items matches\\n // a supplied predicate function\\n\\n // splitBy :: (a -> a -> Bool) -> [a] -> [[a]]\\n const splitBy = (f, xs) => {\\n if (xs.length < 2) return [xs];\\n const\\n h = xs[0],\\n lstParts = xs.slice(1)\\n .reduce(([acc, active, prev], x) =>\\n f(prev, x) ? (\\n [acc.concat([active]), [x], x]\\n ) : [acc, active.concat(x), x], [\\n [],\\n [h],\\n h\\n ]);\\n return lstParts[0].concat([lstParts[1]]);\\n };\\n\\n // last :: [a] -> a\\n const last = xs => (\\n // The last item of a list.\\n ys => 0 < ys.length ? (\\n ys.slice(-1)[0]\\n ) : undefined\\n )(xs);\\n\\n // show :: a -> String\\n const show = x =>\\n JSON.stringify(x);\\n\\n // MAIN --\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"function toRange(arr) {\\n const ranges = [];\\n const sorted = [...arr.filter(Number.isInteger)].sort((x,y) => Math.sign(x-y));\\n const sequenceBreak = (x,y) => y - x > 1 ;\\n\\n let i = 0;\\n while ( i < sorted.length ) {\\n\\n let j = i ;\\n while ( j < sorted.length - 1 && !sequenceBreak( sorted[j], sorted[j+1] ) ) {\\n ++j;\\n }\\n\\n const from = sorted[i];\\n const thru = sorted[j];\\n const rangeLen = 1 + j - i;\\n\\n if ( from === thru ) {\\n ranges.push( [from] );\\n } else {\\n if ( rangeLen > 2 ) {\\n ranges.push([from,thru]);\\n } else {\\n ranges.push([from], [thru]);\\n }\\n }\\n\\n i = j+1;\\n }\\n\\n return ranges.map( range => range.join('-') ).join(',');\\n}\\n\\n// -----------------------------------------------------------------------------\\n// Test Case\\n// -----------------------------------------------------------------------------\\nconst expected = '0-2,4,6-8,11,12,14-25,27-33,35-39';\\nconst actual = toRange([\\n 0, 1, 2,\\n 4,\\n 6, 7, 8,\\n 11, 12, // should be two singletons\\n 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,\\n 27, 28, 29, 30, 31, 32, 33,\\n 35, 36, 37, 38, 39,\\n]);\\n\\nconsole.log(`actual output : '${actual}'.`);\\nconsole.log(`expected output : '${expected}'.`);\\nconsole.log(`Correct? ${ actual === expected ? 'Yes' : 'No'}`);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Input should be an array\\ndef extract:\\n reduce .[] as $i\\n # state is an array with integers or [start, end] ranges\\n ([];\\n if length == 0 then [ $i ]\\n else ( .[-1]) as $last\\n | if ($last|type) == \\\"array\\\" then\\n if ($last[1] + 1) == $i then setpath([-1,1]; $i)\\n else . + [ $i ]\\n end\\n elif ($last + 1) == $i then setpath([-1]; [$last, $i])\\n else . + [ $i ]\\n end\\n end)\\n | map( if type == \\\"number\\\" then tostring\\n elif .[0] == .[1] -1\\n then \\\"\\\\(.[0]),\\\\(.[1])\\\" # satisfy special requirement\\n else \\\"\\\\(.[0])-\\\\(.[1])\\\" end )\\n | join(\\\",\\\") ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"/* Range Extraction, in Jsish */\\nfunction rangeExtraction(list) {\\n var len = list.length;\\n var out = [];\\n var i, j;\\n\\n for (i = 0; i < len; i = j + 1) {\\n // beginning of range or single\\n out.push(list[i]);\\n\\n // find end of range\\n for (j = i + 1; j < len && list[j] == list[j-1] + 1; j++);\\n j--;\\n\\n if (i == j) {\\n // single number\\n out.push(\\\",\\\");\\n } else if (i + 1 == j) {\\n // two numbers\\n out.push(\\\",\\\", list[j], \\\",\\\");\\n } else {\\n // range\\n out.push(\\\"-\\\", list[j], \\\",\\\");\\n }\\n }\\n out.pop(); // remove trailing comma\\n return out.join(\\\"\\\");\\n}\\n\\nvar arr = [ 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39 ];\\n\\nputs(arr);\\nputs(rangeExtraction(arr));\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"function sprintfrange{T<:Integer}(a::Array{T,1})\\n len = length(a)\\n 0 < len || return \\\"\\\"\\n dropme = falses(len)\\n dropme[2:end-1] = Bool[a[i-1]==a[i]-1 && a[i+1]==a[i]+1 for i in 2:(len-1)]\\n s = [string(i) for i in a]\\n s[dropme] = \\\"X\\\"\\n s = join(s, \\\",\\\")\\n replace(s, r\\\",[,X]+,\\\", \\\"-\\\")\\nend\\n\\ntesta = [ 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39]\\n\\nprintln(\\\"Testing range-style formatting.\\\")\\nprintln(\\\" \\\", testa, \\\"\\\\n =>\\\\n \\\", sprintfrange(testa))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"grp : {(&~1=0,-':x)_ x}\\nfmt : {:[1=#s:$x;s;(*s),:[3>#s;\\\",\\\";\\\"-\\\"],*|s]}\\nerng: {{x,\\\",\\\",y}/,//'fmt'grp x}\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nfun extractRange(list: List<Int>): String {\\n if (list.isEmpty()) return \\\"\\\"\\n val sb = StringBuilder()\\n var first = list[0]\\n var prev = first\\n\\n fun append(index: Int) {\\n if (first == prev) sb.append(prev)\\n else if (first == prev - 1) sb.append(first, \\\",\\\", prev)\\n else sb.append(first, \\\"-\\\", prev)\\n if (index < list.size - 1) sb.append(\\\",\\\")\\n }\\n\\n for (i in 1 until list.size) {\\n if (list[i] == prev + 1) prev++\\n else {\\n append(i)\\n first = list[i]\\n prev = first\\n }\\n }\\n append(list.size - 1)\\n return sb.toString()\\n}\\n\\nfun main(args: Array<String>) {\\n val list1 = listOf(-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20)\\n println(extractRange(list1))\\n println()\\n val list2 = listOf(0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39)\\n println(extractRange(list2))\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"s$ = \\\"0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\\" + _\\n \\\"25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39\\\"\\nprint ExtractRange$( s$)\\nend\\n\\nfunction ExtractRange$( range$)\\n n = 1\\n count = ItemCount( range$, \\\",\\\")\\n while n <= count\\n startValue = val( word$( range$, n, \\\",\\\"))\\n m = n + 1\\n while m <= count\\n nextValue = val( word$( range$, m, \\\",\\\"))\\n if nextValue - startValue <> m - n then exit while\\n m = m + 1\\n wend\\n if m - n > 2 then\\n ExtractRange$ = ExtractRange$ + str$( startValue) + \\\"-\\\" + str$( startValue + m - n - 1) + \\\",\\\"\\n else\\n for i = n to m - 1\\n ExtractRange$ = ExtractRange$ + str$( startValue + i - n) + \\\",\\\"\\n next i\\n end if\\n n = m\\n wend\\n ExtractRange$ = left$( ExtractRange$, len( ExtractRange$) - 1)\\nend function\\n\\nfunction ItemCount( list$, separator$)\\n while word$( list$, ItemCount + 1, separator$) <> \\\"\\\"\\n ItemCount = ItemCount + 1\\n wend\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"function rangeExtract nums\\n local prevNum, znums, rangedNums\\n set itemDelimiter to \\\", \\\"\\n put the first item of nums into prevNum\\n repeat for each item n in nums\\n if n is (prevNum + 1) then\\n put n into prevNum\\n put \\\"#\\\" & n after znums\\n else\\n put n into prevNum\\n put return & n after znums\\n end if\\n end repeat\\n set itemDelimiter to \\\"#\\\"\\n repeat for each line z in znums\\n if z is empty then next repeat\\n switch the number of items of z\\n case 1\\n put z & \\\",\\\" after rangedNums\\n break\\n case 2\\n put item 1 of z & \\\",\\\" & item -1 of z & \\\",\\\" after rangedNums\\n break\\n default\\n put item 1 of z & \\\"-\\\" & item -1 of z & \\\",\\\" after rangedNums\\n end switch\\n end repeat\\n return char 1 to -2 of rangedNums --strip off trailing comma\\nend rangeExtract\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"command testRangeExtract\\n local numbers\\n put \\\"0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\\" \\\\\\n && \\\"15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\\" \\\\\\n && \\\"25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\\" \\\\\\n && \\\"37, 38, 39\\\" into numbers\\n put rangeExtract(numbers)\\nend testRangeExtract\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"0-2,4,6-8,11,12,14-25,27-33,35-39\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"function extractRange (rList)\\n local rExpr, startVal = \\\"\\\"\\n for k, v in pairs(rList) do\\n if rList[k + 1] == v + 1 then\\n if not startVal then startVal = v end\\n else\\n if startVal then\\n if v == startVal + 1 then\\n rExpr = rExpr .. startVal .. \\\",\\\" .. v .. \\\",\\\"\\n else\\n rExpr = rExpr .. startVal .. \\\"-\\\" .. v .. \\\",\\\"\\n end\\n startVal = nil\\n else\\n rExpr = rExpr .. v .. \\\",\\\"\\n end\\n end\\n end\\n return rExpr:sub(1, -2)\\nend\\n\\nlocal intList = {\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39\\n}\\nprint(extractRange(intList))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"lst := [0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39]:\\nr1,r2:= lst[1],lst[1]:\\nfor i from 2 to numelems(lst) do\\n\\tif lst[i] - lst[i-1] = 1 then #consecutive\\n\\t\\tr2 := lst[i]:\\n\\telse #break\\n\\t\\tprintf(piecewise(r2-r1=1, \\\"%d,%d,\\\", r2-r1>1,\\\"%d-%d,\\\", \\\"%d,\\\"), r1, r2):\\n\\t\\tr1,r2:= lst[i],lst[i]:\\n\\tfi:\\nod:\\nprintf(piecewise(r2-r1=1, \\\"%d,%d\\\", r2-r1>1,\\\"%d-%d\\\", \\\"%d\\\"), r1, r2):\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"rangeExtract[data_List] := ToString[Row[Riffle[\\n Flatten[Split[Sort[data], #2 - #1 == 1 &] /. {a_Integer, __, b_} :> Row[{a, \\\"-\\\", b}]],\\n \\\",\\\"]]];\\nrangeExtract[{0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function S=range_extraction(L)\\n % Range extraction\\n L(end+1) = NaN;\\n S = int2str(L(1));\\n k = 1;\\n while (k < length(L)-1)\\n if (L(k)+1==L(k+1) && L(k)+2==L(k+2) )\\n m = 2;\\n while (L(k)+m==L(k+m))\\n m = m+1;\\n end\\n k = k+m-1;\\n S = [S,'-',int2str(L(k))];\\n else\\n k = k+1;\\n S = [S,',',int2str(L(k))];\\n end \\t\\n end\\nend\\n\\ndisp(range_extraction([0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, ...\\n 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, ...\\n 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39]))\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \":- module range_extraction.\\n:- interface.\\n\\n:- import_module io.\\n\\n:- pred main(io::di, io::uo) is det.\\n\\n:- implementation.\\n\\n:- import_module int, list, ranges, string.\\n\\nmain(!IO) :-\\n print_ranges(numbers, !IO).\\n\\n:- pred print_ranges(list(int)::in, io::di, io::uo) is det.\\n\\nprint_ranges(Nums, !IO) :-\\n Ranges = ranges.from_list(Nums),\\n ranges.range_foldr(add_range_string, Ranges, [], RangeStrs),\\n io.write_list(RangeStrs, \\\",\\\", io.write_string, !IO).\\n\\n:- pred add_range_string(int::in, int::in,\\n list(string)::in, list(string)::out) is det.\\n\\nadd_range_string(L, H, !Strs) :-\\n ( if L = H then\\n !:Strs = [int_to_string(L) | !.Strs]\\n else if L + 1 = H then\\n !:Strs = [int_to_string(L), int_to_string(H) | !.Strs]\\n else\\n !:Strs = [string.format(\\\"%d-%d\\\", [i(L), i(H)]) | !.Strs]\\n ).\\n\\n:- func numbers = list(int).\\n\\nnumbers = [\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39].\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"extractRange = function(ints)\\n result = []\\n idx = 0\\n while idx < ints.len\\n runLen = 1\\n while idx+runLen < ints.len and ints[idx+runLen] == ints[idx] + runLen\\n runLen = runLen + 1\\n end while\\n if runLen > 2 then\\n result.push ints[idx] + \\\"-\\\" + ints[idx+runLen-1]\\n idx = idx + runLen\\n else\\n result.push ints[idx]\\n idx = idx + 1\\n end if\\n end while\\n return join(result, \\\",\\\")\\nend function\\n\\ntest = [ 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39]\\nprint extractRange(test)\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"RANGCONT(X) ;Integer range contraction\\n NEW Y,I,CONT,NOTFIRST,CURR,PREV,NEXT,SEQ SET Y=\\\"\\\",SEQ=0,PREV=\\\"\\\",CONT=0\\n FOR I=1:1:$LENGTH(X,\\\",\\\") DO\\n .SET NOTFIRST=$LENGTH(Y),CURR=$PIECE(X,\\\",\\\",I),NEXT=$PIECE(X,\\\",\\\",I+1)\\n .FOR Q:$EXTRACT(CURR)'=\\\" \\\" S CURR=$EXTRACT(CURR,2,$LENGTH(CURR)) ;clean up leading spaces\\n .S SEQ=((CURR-1)=PREV)&((CURR+1)=NEXT)\\n .IF 'NOTFIRST SET Y=CURR\\n .IF NOTFIRST DO\\n ..;Order matters due to flags\\n ..IF CONT&SEQ ;Do nothing\\n ..IF 'CONT&'SEQ SET Y=Y_\\\",\\\"_CURR\\n ..IF CONT&'SEQ SET Y=Y_CURR,CONT=0\\n ..IF 'CONT&SEQ SET Y=Y_\\\"-\\\",CONT=1\\n .SET PREV=CURR\\n IF CONT SET Y=Y_PREV\\n K I,CONT,NOTFIRST,CURR,PREV,NEXT,SEQ\\n QUIT Y\\n\",\n \"language\": \"MUMPS\"\n },\n {\n \"code\": \"/*NetRexx program to test range extraction. ***************************\\n* 07.08.2012 Walter Pachl derived from my Rexx Version\\n* Changes: line continuation in aaa assignment changed\\n* 1e99 -> 999999999\\n* Do -> Loop\\n* words(aaa) -> aaa.words()\\n* word(aaa,i) -> aaa.word(i)\\n**********************************************************************/\\nSay 'NetRexx program derived from Rexx'\\naaa='0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29'\\naaa=aaa' 30 31 32 33 35 36 37 38 39'\\nsay 'old='aaa;\\naaa=aaa 999999999 /* artificial number at the end */\\ni=0 /* initialize index */\\nol='' /* initialize output string */\\ncomma='' /* will become a ',' lateron */\\ninrange=0\\nLoop While i<=aaa.words /* loop for all numbers */\\n i=i+1 /* index of next number */\\n n=aaa.word(i) /* the now current number */\\n If n=999999999 Then Leave /* we are at the end */\\n If inrange Then Do /* range was opened */\\n If aaa.word(i+1)<>n+1 Then Do /* following word not in range */\\n ol=ol||n /* so this number is the end */\\n inrange=0 /* and the range is over */\\n End /* else ignore current number */\\n End\\n Else Do /* not in a range */\\n ol=ol||comma||n /* add number (with comma) */\\n comma=',' /* to the output string */\\n If aaa.word(i+2)=n+2 Then Do /* if the nr after the next fits */\\n inrange=1 /* open a range */\\n ol=ol'-' /* append the range connector */\\n End\\n End\\n End\\nSay 'new='ol\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary\\n\\nrunSample(arg)\\nreturn\\n\\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\\n-- Compact a list of numbers by reducing ranges\\nmethod compact(expanded) public static\\n nums = expanded.changestr(',', ' ').space -- remove possible commas & clean up the string\\n rezult = ''\\n\\n RANGE = 0\\n FIRST = nums.word(1) -- set starting value\\n loop i_ = 2 to nums.words -- each word in the string is a number to examine\\n LOCAL = nums.word(i_)\\n if LOCAL - FIRST - RANGE == 1 then do\\n -- inside a range\\n RANGE = RANGE + 1\\n end\\n else do\\n -- not inside a range\\n if RANGE \\\\= 0 then do\\n -- we have a range of numbers so collect this and reset\\n rezult = rezult || FIRST || delim(RANGE) || FIRST + RANGE || ','\\n RANGE = 0\\n end\\n else do\\n -- just collect this number\\n rezult = rezult || FIRST || ','\\n end\\n FIRST = LOCAL -- bump new starting value\\n end\\n end i_\\n\\n if RANGE \\\\= 0 then do\\n -- terminating value is a range\\n rezult = rezult || FIRST || delim(RANGE) || FIRST + RANGE\\n end\\n else do\\n -- terminating value is a single number\\n rezult = rezult || FIRST\\n end\\n\\n return rezult.space(1, ',') -- format and return result string\\n\\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\\n-- determine if the range delimiter should be a comma or dash\\nmethod delim(range) private static\\n if range == 1 then dlm = ','\\n else dlm = '-'\\n return dlm\\n\\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\\n-- sample driver\\nmethod runSample(arg) public static\\n\\nparse arg userInput\\ntd = 0\\nif userInput.words > 0 then do\\n -- use input from command line\\n td[0] = td[0] + 1; r_ = td[0]; td[r_] = userInput\\n end\\nelse do\\n -- use canned test data\\n td[0] = td[0] + 1; r_ = td[0]; td[r_] = ' -6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20'\\n td[0] = td[0] + 1; r_ = td[0]; td[r_] = ' 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39'\\n td[0] = td[0] + 1; r_ = td[0]; td[r_] = ' -4, -3, -2, 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39'\\n end\\n\\nloop r_ = 1 to td[0]\\n say 'Original: ' td[r_].changestr(',', ' ').space(1, ',')\\n say 'Compacted:' compact(td[r_])\\n say\\n end r_\\nreturn\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"import parseutils, re, strutils, sequtils\\n\\nproc extractRange(input: string): string =\\n var list = input.replace(re\\\"\\\\s+\\\").split(',').map(parseInt)\\n var ranges: seq[string]\\n var i = 0\\n while i < list.len:\\n var first = list[i] # first element in the current range\\n var offset = i\\n while True: # skip ahead to the end of the current range\\n if i + 1 >= list.len:\\n # reached end of the list\\n break\\n if list[i + 1] - (i + 1) != first - offset:\\n # next element isn't in the current range\\n break\\n i.inc\\n var last = list[i] # last element in the current range\\n case last - first\\n of 0: ranges.add($first)\\n of 1: ranges.add(\\\"$1,$2\\\".format(first, last))\\n else: ranges.add(\\\"$1-$2\\\".format(first, last))\\n i.inc\\n return ranges.join(\\\",\\\")\\n\\necho(\\\"\\\"\\\"\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39\\\"\\\"\\\".extractRange)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"MODULE RangeExtraction;\\nIMPORT Out;\\n\\nPROCEDURE Range(s: ARRAY OF INTEGER);\\nVAR\\n\\ti,j: INTEGER;\\n\\t\\n\\tPROCEDURE Emit(sep: CHAR);\\n\\tBEGIN\\n\\t\\tIF i > 2 THEN\\n\\t\\t\\tOut.Int(s[j],3);Out.Char('-');Out.Int(s[j + i - 1],3);Out.Char(sep);\\n\\t\\t\\tINC(j,i)\\n\\t\\tELSE\\n\\t\\t\\tOut.Int(s[j],3);Out.Char(sep);\\n\\t\\t\\tINC(j)\\n\\t\\tEND;\\n\\tEND Emit;\\n\\t\\nBEGIN\\n\\tj := 0;i := -1;\\n\\tLOOP\\n\\t\\tINC(i);\\n\\t\\tIF j + i >= LEN(s) THEN\\n\\t\\t\\tEmit(0AX);\\n\\t\\t\\tEXIT\\n\\t\\tELSIF s[j + i] # (s[j] + i) THEN\\n\\t\\t\\tEmit(',');\\n\\t\\t\\ti := 0;\\n\\t\\tEND\\n\\tEND\\nEND Range;\\n\\nVAR\\n\\tseq0: ARRAY 33 OF INTEGER;\\n\\tseq1: ARRAY 20 OF INTEGER;\\nBEGIN\\n\\tseq0[0] := 0;\\n\\tseq0[1] := 1;\\n\\tseq0[2] := 2;\\n\\tseq0[3] := 4;\\n\\tseq0[4] := 6;\\n\\tseq0[5] := 7;\\n\\tseq0[6] := 8;\\n\\tseq0[7] := 11;\\n\\tseq0[8] := 12;\\n\\tseq0[9] := 14;\\n\\tseq0[10] := 15;\\n\\tseq0[11] := 16;\\n\\tseq0[12] := 17;\\n\\tseq0[13] := 18;\\n\\tseq0[14] := 19;\\n\\tseq0[15] := 20;\\n\\tseq0[16] := 21;\\n\\tseq0[17] := 22;\\n\\tseq0[18] := 23;\\n\\tseq0[19] := 24;\\n\\tseq0[20] := 25;\\n\\tseq0[21] := 27;\\n\\tseq0[22] := 28;\\n\\tseq0[23] := 29;\\n\\tseq0[24] := 30;\\n\\tseq0[25] := 31;\\n\\tseq0[26] := 32;\\n\\tseq0[27] := 33;\\n\\tseq0[28] := 35;\\n\\tseq0[29] := 36;\\n\\tseq0[30] := 37;\\n\\tseq0[31] := 38;\\n\\tseq0[32] := 39;\\n\\tRange(seq0);\\n\\tseq1[0] := -6;\\n\\tseq1[1] := -3;\\n\\tseq1[2] := -2;\\n\\tseq1[3] := -1;\\n\\tseq1[4] := 0;\\n\\tseq1[5] := 1;\\n\\tseq1[6] := 3;\\n\\tseq1[7] := 4;\\n\\tseq1[8] := 5;\\n\\tseq1[9] := 7;\\n\\tseq1[10] := 8;\\n\\tseq1[11] := 9;\\n\\tseq1[12] := 10;\\n\\tseq1[13] := 11;\\n\\tseq1[14] := 14;\\n\\tseq1[15] := 15;\\n\\tseq1[16] := 17;\\n\\tseq1[17] := 18;\\n\\tseq1[18] := 19;\\n\\tseq1[19] := 20;\\n\\tRange(seq1)\\nEND RangeExtraction.\\n\",\n \"language\": \"Oberon\"\n },\n {\n \"code\": \"class IdentityMatrix {\\n function : Main(args : String[]) ~ Nil {\\n Compress2Range(\\\"-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20\\\")->PrintLine();\\n\\n Compress2Range(\\\"0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39\\\")->PrintLine();\\n }\\n\\n function : Compress2Range(expanded : String) ~ String {\\n result := \\\"\\\";\\n nums := expanded->ReplaceAll(\\\" \\\", \\\"\\\")->Split(\\\",\\\");\\n firstNum := nums[0]->ToInt();\\n rangeSize := 0;\\n for(i:= 1; i < nums->Size(); i += 1;) {\\n thisNum := nums[i]->ToInt();\\n if(thisNum - firstNum - rangeSize = 1) {\\n rangeSize += 1;\\n }\\n else{\\n if(rangeSize <> 0){\\n result->Append(firstNum);\\n result->Append((rangeSize = 1) ? \\\",\\\": \\\"-\\\");\\n result->Append(firstNum+rangeSize);\\n result->Append(\\\",\\\");\\n rangeSize := 0;\\n }\\n else {\\n result->Append(firstNum);\\n result->Append(\\\",\\\");\\n };\\n firstNum := thisNum;\\n };\\n };\\n\\n if(rangeSize <> 0){\\n result->Append(firstNum);\\n result->Append((rangeSize = 1) ? \\\",\\\" : \\\"-\\\");\\n result->Append(firstNum + rangeSize);\\n rangeSize := 0;\\n }\\n else {\\n result->Append(firstNum);\\n };\\n\\n return result;\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"#import <Foundation/Foundation.h>\\n\\nNSString *extractRanges(NSArray *nums) {\\n NSMutableIndexSet *indexSet = [[NSMutableIndexSet alloc] init];\\n for (NSNumber *n in nums) {\\n if ([n integerValue] < 0)\\n @throw [NSException exceptionWithName:NSInvalidArgumentException reason:@\\\"negative number not supported\\\" userInfo:nil];\\n [indexSet addIndex:[n unsignedIntegerValue]];\\n }\\n NSMutableString *s = [[NSMutableString alloc] init];\\n [indexSet enumerateRangesUsingBlock:^(NSRange range, BOOL *stop) {\\n if (s.length)\\n [s appendString:@\\\",\\\"];\\n if (range.length == 1)\\n [s appendFormat:@\\\"%lu\\\", range.location];\\n else if (range.length == 2)\\n [s appendFormat:@\\\"%lu,%lu\\\", range.location, range.location+1];\\n else\\n [s appendFormat:@\\\"%lu-%lu\\\", range.location, range.location+range.length-1];\\n }];\\n return s;\\n}\\n\\nint main() {\\n @autoreleasepool {\\n\\n NSLog(@\\\"%@\\\", extractRanges(@[@0, @1, @2, @4, @6, @7, @8, @11, @12, @14,\\n @15, @16, @17, @18, @19, @20, @21, @22, @23, @24,\\n @25, @27, @28, @29, @30, @31, @32, @33, @35, @36,\\n @37, @38, @39]));\\n\\n }\\n return 0;\\n}\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"let range_extract = function\\n | [] -> []\\n | x::xs ->\\n let f (i,j,ret) k =\\n if k = succ j then (i,k,ret) else (k,k,(i,j)::ret) in\\n let (m,n,ret) = List.fold_left f (x,x,[]) xs in\\n List.rev ((m,n)::ret)\\n\\nlet string_of_range rng =\\n let str (a,b) =\\n if a = b then string_of_int a\\n else Printf.sprintf \\\"%d%c%d\\\" a (if b = succ a then ',' else '-') b in\\n String.concat \\\",\\\" (List.map str rng)\\n\\nlet () =\\n let li =\\n [ 0; 1; 2; 4; 6; 7; 8; 11; 12; 14; 15; 16; 17; 18; 19; 20; 21;\\n 22; 23; 24; 25; 27; 28; 29; 30; 31; 32; 33; 35; 36; 37; 38; 39 ]\\n in\\n let rng = range_extract li in\\n print_endline(string_of_range rng)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"(define (extract ll)\\n (let loop ((head (car ll)) (tail (cdr ll)) (out #null))\\n (if (null? tail)\\n (reverse (cons head out))\\n else\\n (cond\\n ((eq? head (- (car tail) 1))\\n (loop (list (car tail) head) (cdr tail) out))\\n ((and (pair? head) (eq? (car head) (- (car tail) 1)))\\n (loop (cons (car tail) head) (cdr tail) out))\\n (else\\n (loop (car tail) (cdr tail) (cons head out)))))))\\n\\n(define (range->string range)\\n (fold (lambda (f v)\\n (string-append (if f (string-append f \\\",\\\") \\\"\\\")\\n (if (pair? v)\\n (string-append (string-append (number->string (last v #f)) \\\"-\\\")(number->string (car v)))\\n (number->string v))))\\n #false\\n range))\\n\\n; let's test\\n(define data '(0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39))\\n(define range (extract data))\\n\\n(print \\\"extracted ranges: \\\" range)\\n(print \\\"string representation: \\\" (range->string range))\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"/* Rexx */\\n\\nparse arg userInput\\ncall runSample userInput\\nreturn\\nexit\\n\\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\\n-- Compact a list of numbers by reducing ranges\\ncompact:\\nprocedure\\n--trace ?r;nop\\n parse arg expanded\\n nums = expanded~changestr(',', ' ')~space -- remove possible commas & clean up the string\\n rezult = ''\\n\\n RANGE = 0\\n FIRST = nums~word(1) -- set starting value\\n loop i_ = 2 to nums~words -- each word in the string is a number to examine\\n LOCAL = nums~word(i_)\\n if LOCAL - FIRST - RANGE == 1 then do\\n -- inside a range\\n RANGE += 1\\n end\\n else do\\n -- not inside a range\\n if RANGE \\\\= 0 then do\\n -- we have a range of numbers so collect this and reset\\n rezult = rezult || FIRST || delim(RANGE) || FIRST + RANGE || ','\\n RANGE = 0\\n end\\n else do\\n -- just collect this number\\n rezult = rezult || FIRST || ','\\n end\\n FIRST = LOCAL -- bump new starting value\\n end\\n end i_\\n if RANGE \\\\= 0 then do\\n -- collect terminating value (a range)\\n rezult = rezult || FIRST || delim(RANGE) || FIRST + RANGE\\n end\\n else do\\n -- collect terminating value (a single number)\\n rezult = rezult || FIRST\\n end\\n\\n return rezult~space(1, ',') -- format and return result string\\n\\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\\n-- determine if the range delimiter should be a comma or dash\\ndelim:\\nprocedure\\n parse arg range .\\n if range == 1 then dlm = ','\\n else dlm = '-'\\n return dlm\\n\\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\\n-- sample driver\\nrunSample:\\nprocedure\\nparse arg userInput\\ntd. = 0\\nif userInput~words > 0 then do\\n td.0 += 1; r_ = td.0; td.r_ = userInput\\n end\\nelse do\\n td.0 += 1; r_ = td.0; td.r_ = '-6 -3 -2 -1 0 1 3 4 5 7 8 9 10 11 14 15 17 18 19 20'\\n td.0 += 1; r_ = td.0; td.r_ = '0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39'\\n td.0 += 1; r_ = td.0; td.r_ = '-4, -3, -2, 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39'\\n end\\n\\nloop r_ = 1 to td.0\\n say 'Original: ' td.r_~changestr(',', ' ')~space(1, ',')\\n say 'Compacted:' compact(td.r_)\\n say\\n end r_\\nreturn\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \" int ints(100)\\n\\nints={\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39\\n}\\n\\n\\n' RESULT:\\n' 0-2, 4, 6-8, 11, 12, 14-25, 27-33, 35-39\\n\\n\\n\\n function Ranges(int*i) as string\\n '===============================\\n string pr=\\\"\\\"\\n int n=0\\n int e=0\\n int j=0\\n int k=0\\n int f=1\\n do\\n j++\\n n=i(j)\\n e=i(j+1)\\n if e<j\\n exit do\\n endif\\n if e=n+1 and i(j+2)=n+2 then 'LOOKAHEAD\\n if f then k=n : f=0\\n else\\n if f=0 then\\n pr+=k \\\"-\\\" i(j+1) \\\", \\\" 'RANGE OF VALUES\\n j++\\n f=1\\n else\\n pr+=n \\\", \\\" 'SINGLE VALUES\\n end if\\n end if\\n loop\\n return left pr, len(pr)-2\\n end function\\n\\n\\n print Ranges ints\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"declare\\n fun {Extract Xs}\\n {CommaSeparated\\n {Map {ExtractRanges Xs} RangeToString}}\\n end\\n\\n fun {ExtractRanges Xs}\\n fun {Loop Ys Start End}\\n case Ys\\n of Y|Yr andthen Y == End+1 then {Loop Yr Start Y}\\n [] Y|Yr then Start#End|{Loop Yr Y Y}\\n [] nil then [Start#End]\\n end\\n end\\n in\\n case Xs\\n of X|Xr then {Loop Xr X X}\\n [] nil then nil\\n end\\n end\\n\\n fun {RangeToString S#E}\\n if E-S >= 2 then\\n {VirtualString.toString S#\\\"-\\\"#E}\\n else\\n {CommaSeparated\\n {Map {List.number S E 1} Int.toString}}\\n end\\n end\\n\\n fun {CommaSeparated Xs}\\n {Flatten {Intersperse \\\",\\\" Xs}}\\n end\\n\\n fun {Intersperse Sep Xs}\\n case Xs of X|Y|Xr then\\n X|Sep|{Intersperse Sep Y|Xr}\\n else\\n Xs\\n end\\n end\\nin\\n {System.showInfo\\n {Extract [ 0 1 2 4 6 7 8 11 12 14\\n 15 16 17 18 19 20 21 22 23 24\\n 25 27 28 29 30 31 32 33 35 36\\n 37 38 39 ]}}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"program RangeExtractionApp;\\n\\n\\n{$IFDEF FPC}\\n {$mode objfpc}{$H+}\\n{$ENDIF}\\n\\n\\nuses\\n {$IFDEF UNIX}{$IFDEF UseCThreads}\\n cthreads,\\n {$ENDIF}{$ENDIF}\\n SysUtils;\\n\\nfunction RangeExtraction(const Seq: array of integer): String;\\nconst\\n SubSeqLen = 3; // minimal length of the range, can be changed.\\nvar\\n i, j: Integer;\\n Separator: string;\\nbegin\\n Separator:= '';\\n Result := '';\\n i := Low(Seq);\\n while i <= High(Seq) do\\n begin\\n j := i;\\n // All subsequent values, starting from i, up to High(Seq) possibly\\n while ((j < High(Seq)) and ((Seq[j+1]-Seq[j]) = 1)) do\\n Inc(j);\\n // is it a range ?\\n if ((j-i) >= (SubSeqLen-1)) then\\n begin\\n Result := Result + Format(Separator+'%d-%d',[Seq[i],Seq[j]]);\\n i := j+1; // Next value to be processed\\n Separator := ',';\\n end\\n else\\n begin\\n // Loop, to process the case SubSeqLen > 3\\n while i<=j do\\n begin\\n Result := Result + Format(Separator+'%d',[Seq[i]]);\\n Inc(i); // Next value to be processed\\n Separator := ',';\\n end;\\n end;\\n end;\\nEnd;\\n\\nprocedure DisplayRange(const Seq: array of integer);\\nvar\\n i: Integer;\\nbegin\\n Write(Format('[%d', [Seq[Low(Seq)]]));\\n for i := Low(Seq) + 1 to High(Seq) do\\n Write(Format(',%d', [Seq[i]]));\\n WriteLn('] => ' + RangeExtraction(Seq));\\n WriteLn;\\nEnd;\\n\\nbegin\\n DisplayRange([0]);\\n DisplayRange([0,1]);\\n DisplayRange([0,2]);\\n DisplayRange([0,1,2]);\\n DisplayRange([0,1,2,3]);\\n DisplayRange([0,1,2,3,4,5,6,7]);\\n DisplayRange([0,2,3,4,5,6,7,9]);\\n DisplayRange([0,2,4,6,8,10]);\\n DisplayRange([0,1,2,3,4,5,6,7,9]);\\n DisplayRange([0,1,2,3,4,6,9,10,11,12]);\\n\\n DisplayRange([\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39]);\\n {$IFNDEF UNIX}readln;{$ENDIF}\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"sub rangext {\\n my $str = join ' ', @_;\\n 1 while $str =~ s{([+-]?\\\\d+) ([+-]?\\\\d+)}\\n {$1.(abs($2 - $1) == 1 ? '~' : ',').$2}eg; # abs for neg ranges\\n $str =~ s/(\\\\d+)~(?:[+-]?\\\\d+~)+([+-]?\\\\d+)/$1-$2/g;\\n $str =~ tr/~/,/;\\n return $str;\\n}\\n\\n# Test and display\\nmy @test = qw(0 1 2 4 6 7 8 11 12 14\\n 15 16 17 18 19 20 21 22 23 24\\n 25 27 28 29 30 31 32 33 35 36\\n 37 38 39);\\nprint rangext(@test), \\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use Set::IntSpan;\\nsub rangext { return Set::IntSpan->new(@_) . '' } # stringized\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use Set::IntSpan::Fast;\\nsub rangext { return Set::IntSpan::Fast->new(@_)->as_string }\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">spout</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">first</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">curr</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">first</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">curr</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">first</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">sep</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">first</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">curr</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">','</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">'-'</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%d%s%d\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">first</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">sep</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">curr</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">extract_ranges</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">first</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">out</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]!=</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">out</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">spout</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">first</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)&</span><span style=\\\"color: #008000;\\\">','</span>\\n <span style=\\\"color: #000000;\\\">first</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">i</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">out</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">spout</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">first</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">out</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">14</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">15</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">16</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">17</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">18</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">19</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">21</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">22</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">23</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">24</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">25</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">27</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">28</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">29</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">30</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">31</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">33</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">35</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">36</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">37</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">38</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">39</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">extract_ranges</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\n( ) var res\\n( )\\n( 0 1 2 4 6 7 8 11 12 14\\n 15 16 17 18 19 20 21 22 23 24\\n 25 27 28 29 30 31 32 33 35 36\\n 37 38 39 )\\n\\ndef append\\n 1 get swap -1 get rot swap\\n 2 tolist res swap 0 put var res\\nenddef\\n\\ndef printRes\\n res len for\\n get\\n 1 get swap 2 get nip\\n over over == if\\n drop print\\n else\\n over over - abs 1 > if \\\"-\\\" else \\\",\\\" endif\\n rot print print print\\n endif\\n \\\",\\\" print\\n endfor\\n drop\\n 8 tochar print \\\" \\\" print\\nenddef\\n\\n1 get rot swap 0 put swap\\n\\nlen 2 swap 2 tolist for\\n get var num\\n swap -1 get 1 + num != if\\n append\\n flush\\n endif\\n num 0 put swap\\nendfor\\nswap\\nappend\\n\\nclear\\n\\nprintRes\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\n( 0 1 2 4 6 7 8 11 12 14\\n 15 16 17 18 19 20 21 22 23 24\\n 25 27 28 29 30 31 32 33 35 36\\n 37 38 39 )\\n\\nlen get var fin\\n2 var i\\ni get fin == not\\nwhile\\n i 1 - get var prev\\n i get prev - 1 != if\\n inf i put\\n i 1 + var i\\n endif\\n i 1 + var i\\n i get fin == not\\nendwhile\\ninf 0 put\\n\\ndef printEnd print \\\",\\\" print enddef\\n\\n1 var ini\\n\\nlen for\\n var i\\n i get inf == if\\n i ini - ini swap slice\\n -1 get swap 1 get nip\\n over over == if drop printEnd\\n else over over - 1 == if printEnd printEnd\\n else print \\\"-\\\" print printEnd\\n endif\\n endif\\n i 1 + var ini\\n endif\\nendfor\\n8 tochar print \\\" \\\" print\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\n( 0 1 2 4 6 7 8 11 12 14\\n 15 16 17 18 19 20 21 22 23 24\\n 25 27 28 29 30 31 32 33 35 36\\n 37 38 39 )\\n\\ninf 0 put\\n\\ndef printEnd print \\\",\\\" print enddef\\n\\n2 var i\\n1 var ini\\n\\ni get inf == not\\nwhile\\n i 1 - get var prev\\n i get var act\\n act prev - 1 != if\\n i ini -\\n dup 2 == if drop ini get prev swap printEnd printEnd else\\n dup 1 == if drop prev printEnd else\\n drop ini get print \\\"-\\\" print prev printEnd\\n endif\\n endif\\n i var ini\\n endif\\n i 1 + var i\\n act inf == not\\nendwhile\\n8 tochar print \\\" \\\" print\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\ndef glue /# l o -- l #/\\n var ob\\n len 2 * 1 - 2 swap 2 3 tolist for\\n ob swap put\\n endfor\\nenddef\\n\\n( )\\n\\n( 0 1 2 4 6 7 8 11 12 14\\n 15 16 17 18 19 20 21 22 23 24\\n 25 27 28 29 30 31 32 33 35 36\\n 37 38 39 )\\n\\nlen for drop\\n pop swap dup var N var M\\n len for drop\\n head M 1 + == if\\n pop swap var M\\n else\\n exitfor\\n endif\\n endfor\\n swap\\n N M == if N tostr 0 put else\\n N 1 + M == if N tostr 0 put M tostr 0 put else\\n N tostr \\\"-\\\" M tostr chain chain 0 put\\n endif\\n endif\\n swap\\n len 0 == if\\n drop\\n exitfor\\n endif\\nendfor\\n\\n\\\",\\\" glue lprint\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"go =>\\n Lists = [\\n [-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9,\\n 10, 11, 14, 15, 17, 18, 19, 20],\\n [ 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17,\\n 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31,\\n 32, 33, 35, 36, 37, 38, 39],\\n 1..20,\\n [13],\\n [11,12,13,15]\\n ].\\n foreach(List in Lists)\\n println(List),\\n println(make_ranges(List)),\\n nl\\n end,\\n nl.\\n\\n\\nmake_ranges(L) = Res =>\\n Ranges = [],\\n Range = [L[1]],\\n\\n % Identify the range\\n foreach(I in 2..L.length)\\n Li1 = L[I-1],\\n Li = L[I],\\n if Li == Li1+1 then\\n Range := Range ++ [Li]\\n else\\n if length(Range) > 0 then\\n Ranges := Ranges ++ [Range]\\n end,\\n Range := [] ++ [Li]\\n end\\n end,\\n % pickup the last range\\n if length(Range) > 0 then\\n Ranges := Ranges ++ [Range]\\n end,\\n Res := join([get_range(R) : R in Ranges], \\\",\\\").\\n\\n\\n% Convert to range representation\\nget_range(R) =\\n cond(R.length == 1,\\n R.first().to_string(),\\n min(R).to_string() ++ \\\"-\\\" ++ max(R).to_string()).\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de rangeextract (Lst)\\n (glue \\\",\\\"\\n (make\\n (while Lst\\n (let (N (pop 'Lst) M N)\\n (while (= (inc M) (car Lst))\\n (setq M (pop 'Lst)) )\\n (cond\\n ((= N M) (link N))\\n ((= (inc N) M) (link N M))\\n (T (link (list N '- M))) ) ) ) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"/* Modified 19 November 2011 to meet requirement that there be at */\\n/* least 3 items in a run. */\\nrange_extraction: /* 17 August 2010 */\\n procedure options (main);\\n declare (c, d) character (1);\\n declare (old, new, initial) fixed binary (31);\\n declare in file;\\n declare out file output;\\n\\n open file (in) title ('/range2.dat,type(text),recsize(80)' );\\n open file (out) output title ('/range2.out,type(text),recsize(70)');\\n\\n c = ' '; d = ',';\\n get file (in) list (old);\\n do forever;\\n initial = old;\\n on endfile (in) begin;\\n put file (out) edit (c, trim(old)) (a);\\n stop;\\n end;\\n get file (in) list (new);\\n if new = old+1 then\\n do; /* we have a run. */\\n on endfile (in) begin;\\n if old > initial+1 then d = '-';\\n put file (out) edit (c, trim(initial), d, trim(old) ) (a);\\n stop;\\n end;\\n do while (new = old+1);\\n old = new;\\n get file (in) list (new);\\n end;\\n /* At this point, old holds the last in a run; */\\n /* initial holds the first in a run. */\\n /* if there are only two members in a run, don't use the */\\n /* range notation. */\\n if old > initial+1 then d = '-';\\n put file (out) edit (c, trim(initial), d, trim(old) ) (a);\\n old = new;\\n end;\\n else /* we have an isolated value. */\\n do;\\n put file (out) edit (c, trim(old)) (a);\\n old = new;\\n end;\\n c, d = ',';\\n end;\\nend range_extraction;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \" 0-2,4,6-8,11-12,14-25,27-33,35-39\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"function range-extraction($arr) {\\n if($arr.Count -gt 2) {\\n $a, $b, $c, $arr = $arr\\n $d = $e = $c\\n if((($a + 1) -eq $b) -and (($b + 1) -eq $c)) {\\n $test = $true\\n while($arr -and $test) {\\n $d = $e\\n $e, $arr = $arr\\n $test = ($d+1) -eq $e\\n }\\n if($test){\\\"$a-$e\\\"}\\n elseif((-not $arr) -and $test){\\\"$a-$d\\\"}\\n elseif(-not $arr){\\\"$a-$d,$e\\\"}\\n else{\\\"$a-$d,\\\" + (range-extraction (@($e)+$arr))}\\n }\\n elseif(($b + 1) -eq $c) {\\\"$a,\\\" + (range-extraction (@($b, $c)+$arr))}\\n else {\\\"$a,$b,\\\" + (range-extraction (@($c)+$arr))}\\n } else {\\n switch($arr.Count) {\\n 0 {\\\"\\\"}\\n 1 {\\\"$arr\\\"}\\n 2 {\\\"$($arr[0]),$($arr[1])\\\"}\\n }\\n }\\n}\\nrange-extraction @(0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n37, 38, 39)\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"range_extract :-\\n\\tL = [0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n\\t 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n\\t 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n\\t 37, 38, 39] ,\\n\\twriteln(L),\\n\\tpack_Range(L, LP),\\n\\tmaplist(study_Range, R, LP),\\n\\textract_Range(LA, R),\\n\\tatom_chars(A, LA),\\n\\twriteln(A).\\n\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n% extract_Range(?In, ?Out)\\n% In : '-6,-3--1,3-5,7-11,14,15,17-20' =>\\n% Out : [-6], [-3--1], [3-5],[7-11], [14],[15], [17-20]\\n%\\nextract_Range([], []).\\n\\n\\nextract_Range(X , [Range | Y1]) :-\\n\\tget_Range(X, U-U, Range, X1),\\n\\textract_Range(X1, Y1).\\n\\n\\n\\nget_Range([], Range-[], Range, []).\\nget_Range([','|B], Range-[], Range, B) :- !.\\n\\nget_Range([A | B], EC, Range, R) :-\\n\\tappend_dl(EC, [A | U]-U, NEC),\\n\\tget_Range(B, NEC, Range, R).\\n\\n\\nappend_dl(X-Y, Y-Z, X-Z).\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%\\n% study Range(?In, ?Out)\\n% In : [-6]\\n% Out : [-6,-6]\\n%\\n% In : [-3--1]\\n% Out : [-3, -1]\\n%\\nstudy_Range(Range1, [Deb, Deb]) :-\\n catch(number_chars(Deb, Range1), Deb, false).\\n\\nstudy_Range(Range1, [Deb, Fin]) :-\\n append(A, ['-'|B], Range1),\\n A \\\\= [],\\n number_chars(Deb, A),\\n number_chars(Fin, B).\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%\\n:- use_module(library(clpfd)).\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n%\\n% Pack Range(?In, ?Out)\\n% In : -6,\\n% Out : [-6]\\n%\\n% In : -3, -2,-1\\n% Out : [-3,-1]\\n%\\npack_Range([],[]).\\n\\npack_Range([X|Rest],[[X | V]|Packed]):-\\n run(X,Rest, [X|V], RRest),\\n pack_Range(RRest,Packed).\\n\\n\\n\\nrun(Fin,[Other|RRest], [Deb, Fin],[Other|RRest]):-\\n\\tFin #\\\\= Deb,\\n\\tFin #\\\\= Deb + 1,\\n\\tOther #\\\\= Fin+1.\\n\\nrun(Fin,[],[_Var, Fin],[]).\\n\\nrun(Var,[Var1|LRest],[Deb, Fin], RRest):-\\n\\tFin #\\\\= Deb,\\n\\tFin #\\\\= Deb + 1,\\n\\tVar1 #= Var + 1,\\n\\trun(Var1,LRest,[Deb, Fin], RRest).\\n\\nrun(Val,[Other|RRest], [Val, Val],[Other|RRest]).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"DataSection\\n Data.i 33 ;count of elements to be read\\n Data.i 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24\\n Data.i 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39\\nEndDataSection\\n\\nNewList values()\\n;setup list\\nDefine elementCount, i\\nRead.i elementCount\\nFor i = 1 To elementCount\\n AddElement(values()): Read.i values()\\nNext\\n\\nProcedure.s rangeExtract(List values())\\n Protected listSize = ListSize(values()) - 1\\n Protected rangeMarker, rangeStart, rangeIncrement, retraceSteps, rangeSize, endOfRange, output.s, sub.s\\n\\n ForEach values()\\n rangeStart = values():\\n sub = Str(rangeStart)\\n If NextElement(values())\\n retraceSteps = 1\\n rangeIncrement = values() - rangeStart\\n If rangeIncrement = 1 Or rangeIncrement = -1\\n ;found start of possible range\\n If ListIndex(values()) <> listSize\\n retraceSteps = 2\\n rangeSize = 2\\n endOfRange = #False\\n rangeMarker = values()\\n While NextElement(values())\\n If values() - rangeMarker <> rangeIncrement\\n endOfRange = #True\\n Break\\n EndIf\\n rangeSize + 1\\n rangeMarker = values()\\n Wend\\n\\n If rangeSize > 2\\n sub = Str(rangeStart) + \\\"-\\\" + Str(rangeMarker)\\n If Not endOfRange\\n retraceSteps = 0 ;at end of list\\n Else\\n retraceSteps = 1\\n EndIf\\n EndIf\\n EndIf\\n EndIf\\n\\n ;return to the value before look-aheads\\n While retraceSteps > 0\\n PreviousElement(values()): retraceSteps - 1\\n Wend\\n EndIf\\n\\n output + sub + \\\",\\\"\\n Next\\n\\n ProcedureReturn RTrim(output, \\\",\\\")\\nEndProcedure\\n\\nIf OpenConsole()\\n PrintN(rangeExtract(values()))\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\")\\n Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"def range_extract(lst):\\n 'Yield 2-tuple ranges or 1-tuple single elements from list of increasing ints'\\n lenlst = len(lst)\\n i = 0\\n while i< lenlst:\\n low = lst[i]\\n while i <lenlst-1 and lst[i]+1 == lst[i+1]: i +=1\\n hi = lst[i]\\n if hi - low >= 2:\\n yield (low, hi)\\n elif hi - low == 1:\\n yield (low,)\\n yield (hi,)\\n else:\\n yield (low,)\\n i += 1\\n\\ndef printr(ranges):\\n print( ','.join( (('%i-%i' % r) if len(r) == 2 else '%i' % r)\\n for r in ranges ) )\\n\\nif __name__ == '__main__':\\n for lst in [[-8, -7, -6, -3, -2, -1, 0, 1, 3, 4, 5, 7,\\n 8, 9, 10, 11, 14, 15, 17, 18, 19, 20],\\n [0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22,\\n 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39]]:\\n #print(list(range_extract(lst)))\\n printr(range_extract(lst))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def range_extract(iterable):\\n '''Assumes iterable is sorted sequentially. Returns iterator of range tuples.'''\\n it = iter(iterable)\\n\\n try:\\n i = next(it)\\n except StopIteration:\\n return\\n\\n while True:\\n low = i\\n\\n try:\\n j = next(it)\\n except StopIteration:\\n yield (low, )\\n return\\n while i + 1 == j:\\n i_next = j\\n try:\\n j = next(it)\\n except StopIteration:\\n yield (low, j)\\n return\\n i = i_next\\n\\n hi = i\\n\\n if hi - low >= 2:\\n yield (low, hi)\\n elif hi - low == 1:\\n yield (low,)\\n yield (hi,)\\n else:\\n yield (low,)\\n\\n i = j\\n\\ndef printr(ranges):\\n print( ','.join( (('%i-%i' % r) if len(r) == 2 else '%i' % r)\\n for r in ranges ) )\\n\\nif __name__ == '__main__':\\n for lst in [[-8, -7, -6, -3, -2, -1, 0, 1, 3, 4, 5, 7,\\n 8, 9, 10, 11, 14, 15, 17, 18, 19, 20],\\n [0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22,\\n 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39]]:\\n #print(list(range_extract(lst)))\\n printr(range_extract(lst))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"class PushableIter():\\n \\\"Can push items back on iterable\\\"\\n def __init__(self, it):\\n self.it = iter(it)\\n self.pushed = []\\n\\n def push(self, item):\\n self.pushed.append(item)\\n\\n def pop(self):\\n return self.pushed.pop(0) if self.pushed else self.it.__next__()\\n\\n def __iter__(self):\\n return self\\n\\n def __next__(self):\\n return self.pop()\\n\\ndef range_extractp(sorted_iterable):\\n 'Yield 2-tuple ranges or 1-tuple single elements from iter of increasing ints'\\n rest = PushableIter(sorted_iterable)\\n for this in rest:\\n low = hi = last = this\\n for nxt in rest: # Find upper range on incremented values\\n if nxt == last + 1:\\n last = hi = nxt\\n else: # Out of (sub)-range\\n rest.push(nxt)\\n break\\n if hi - low >= 2:\\n yield (low, hi)\\n elif hi - low == 1:\\n yield (low,)\\n yield (hi,)\\n else:\\n yield (low,)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Range extraction'''\\n\\nfrom functools import reduce\\n\\n\\n# rangeFormat :: [Int] -> String\\ndef rangeFormat(xs):\\n '''Range-formatted display string for\\n a list of integers.\\n '''\\n return ','.join([\\n rangeString(x) for x\\n in splitBy(lambda a, b: 1 < b - a)(xs)\\n ])\\n\\n\\n# rangeString :: [Int] -> String\\ndef rangeString(xs):\\n '''Start and end of xs delimited by hyphens\\n if there are more than two integers.\\n Otherwise, comma-delimited xs.\\n '''\\n ys = [str(x) for x in xs]\\n return '-'.join([ys[0], ys[-1]]) if 2 < len(ys) else (\\n ','.join(ys)\\n )\\n\\n\\n# TEST ----------------------------------------------------\\n# main :: IO ()\\ndef main():\\n '''Test'''\\n\\n xs = [\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39\\n ]\\n print(\\n __doc__ + ':\\\\n[' + '\\\\n'.join(map(\\n lambda x: ' ' + repr(x)[1:-1],\\n chunksOf(11)(xs)\\n )) + \\\" ]\\\\n\\\\n -> '\\\" + rangeFormat(xs) + \\\"'\\\\n\\\"\\n )\\n\\n\\n# GENERIC -------------------------------------------------\\n\\n# chunksOf :: Int -> [a] -> [[a]]\\ndef chunksOf(n):\\n '''A series of lists of length n,\\n subdividing the contents of xs.\\n Where the length of xs is not evenly divible,\\n the final list will be shorter than n.'''\\n return lambda xs: reduce(\\n lambda a, i: a + [xs[i:n + i]],\\n range(0, len(xs), n), []\\n ) if 0 < n else []\\n\\n\\n# splitBy :: (a -> a -> Bool) -> [a] -> [[a]]\\ndef splitBy(p):\\n '''A list split wherever two consecutive\\n items match the binary predicate p.\\n '''\\n # step :: ([[a]], [a], a) -> a -> ([[a]], [a], a)\\n def step(acp, x):\\n acc, active, prev = acp\\n return (acc + [active], [x], x) if p(prev, x) else (\\n (acc, active + [x], x)\\n )\\n\\n # go :: [a] -> [[a]]\\n def go(xs):\\n if 2 > len(xs):\\n return xs\\n else:\\n h = xs[0]\\n ys = reduce(step, xs[1:], ([], [h], h))\\n # The accumulated sublists, and the current group.\\n return ys[0] + [ys[1]]\\n\\n return lambda xs: go(xs)\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"(define make-range\\n Start Start -> [\\\",\\\" Start]\\n Start End -> [\\\",\\\" Start \\\",\\\" End] where (= End (+ Start 1))\\n Start End -> [\\\",\\\" Start \\\"-\\\" End])\\n\\n(define range-extract-0\\n Start End [] -> (make-range Start End)\\n Start End [A|As] -> (range-extract-0 Start A As) where (= (+ 1 End) A)\\n Start End [A|As] -> (append (make-range Start End) (range-extract-0 A A As)))\\n\\n(define range-extract\\n [A |As] -> (FORMAT NIL \\\"~{~a~}\\\" (tail (range-extract-0 A A As))))\\n\\n(range-extract [ 0 1 2 4 6 7 8 11 12 14\\n 15 16 17 18 19 20 21 22 23 24\\n 25 27 28 29 30 31 32 33 35 36\\n 37 38 39])\\n\",\n \"language\": \"Qi\"\n },\n {\n \"code\": \"REM Range extraction\\nDECLARE FUNCTION RangeExtract$ (RS$)\\n\\nRange$ = \\\" 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, \\\"\\nRange$ = Range$ + \\\"15, 16, 17, 18, 19, 20, 21, 22, 23, 24, \\\"\\nRange$ = Range$ + \\\"25, 27, 28, 29, 30, 31, 32, 33, 35, 36, \\\"\\nRange$ = Range$ + \\\"37, 38, 39\\\"\\nPRINT RangeExtract$(Range$)\\nEND\\n\\nFUNCTION RangeExtract$ (RS$)\\n TS$ = \\\"\\\": I% = 0\\n F% = VAL(RS$)\\n DO\\n I% = INSTR(I% + 1, RS$, \\\",\\\")\\n T% = VAL(MID$(RS$, I% + 1))\\n IF T% = F% + R% + 1 THEN\\n R% = R% + 1\\n ELSE\\n SELECT CASE R%\\n CASE 0\\n TS$ = TS$ + LTRIM$(STR$(F%)) + \\\",\\\"\\n CASE 1\\n TS$ = TS$ + LTRIM$(STR$(F%)) + \\\",\\\" + LTRIM$(STR$(F% + R%)) + \\\",\\\"\\n CASE ELSE\\n TS$ = TS$ + LTRIM$(STR$(F%)) + \\\"-\\\" + LTRIM$(STR$(F% + R%)) + \\\",\\\"\\n END SELECT\\n R% = 0: F% = T%\\n END IF\\n LOOP WHILE I% <> 0\\n RangeExtract$ = LEFT$(TS$, LEN(TS$) - 1)\\nEND FUNCTION\\n\",\n \"language\": \"QuickBASIC\"\n },\n {\n \"code\": \"extract.range = function(v) {\\n r <- c(1, which(diff(v) != 1) + 1, length(v) + 1)\\n paste0(collapse=\\\",\\\",\\n v[head(r, -1)],\\n ifelse(diff(r) == 1,\\n \\\"\\\",\\n paste0(ifelse(diff(r) == 2, \\\",\\\", \\\"-\\\"),\\n v[r[-1] - 1])))\\n}\\n\\n\\nprint(extract.range(c(\\n -6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20)))\\nprint(extract.range(c(\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22,\\n 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39)))\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (list->ranges xs)\\n (define (R lo hi)\\n (if (= lo hi) (~a lo) (~a lo (if (= 1 (- hi lo)) \\\",\\\" \\\"-\\\") hi)))\\n (let loop ([xs xs] [lo #f] [hi #f] [r '()])\\n (cond [(null? xs) (string-join (reverse (if lo (cons (R lo hi) r) r)) \\\",\\\")]\\n [(not hi) (loop (cdr xs) (car xs) (car xs) r)]\\n [(= 1 (- (car xs) hi)) (loop (cdr xs) lo (car xs) r)]\\n [else (loop xs #f #f (cons (R lo hi) r))])))\\n\\n(list->ranges '(0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23\\n 24 25 27 28 29 30 31 32 33 35 36 37 38 39))\\n;; -> \\\"0-2,4,6-8,11,12,14-25,27-33,35-39\\\"\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub range-extraction (*@ints) {\\n my $prev = NaN;\\n my @ranges;\\n\\n for @ints -> $int {\\n if $int == $prev + 1 {\\n @ranges[*-1].push: $int;\\n }\\n else {\\n @ranges.push: [$int];\\n }\\n $prev = $int;\\n }\\n join ',', @ranges.map: -> @r { @r > 2 ?? \\\"@r[0]-@r[*-1]\\\" !! @r }\\n}\\n\\nsay range-extraction\\n -6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20;\\n\\nsay range-extraction\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program creates a range extraction from a list of numbers (can be negative.) */\\nold=0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39\\n#= words(old) /*number of integers in the number list*/\\nnew= /*the new list, possibly with ranges. */\\n do j=1 to #; z= word(old, j) /*obtain Jth number in the old list. */\\n inc= 1; new= new','z /*append \\\" \\\" to \\\" new \\\" */\\n do k=j+1 to #; y= word(old, k) /*get the Kth number in the number list*/\\n if y\\\\==z+inc then leave /*is this number not > previous by inc?*/\\n inc= inc + 1; g= y /*increase the range, assign G (good).*/\\n end /*k*/\\n if k-1=j | g=z+1 then iterate /*Is the range=0│1? Then keep truckin'*/\\n new= new'-'g; j= k - 1 /*indicate a range of #s; change index*/\\n end /*j*/\\n /*stick a fork in it, we're all done. */\\nnew= substr(new, 2) /*elide the leading comma in the range.*/\\nsay 'old:' old; say 'new:' new /*show the old and new range of numbers*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program creates a range extraction from a list of numbers (can be negative.) */\\nold=0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39\\n#= words(old); j= 0 /*number of integers in the number list*/\\nnew= /*the new list, possibly with ranges. */\\n do while j<#; j= j + 1; z= word(old, j) /*get the Jth number in the number list*/\\n inc= 1; new= new','z /*append \\\" \\\" to \\\" new \\\" */\\n do k=j+1 to #; y= word(old, k) /*get the Kth number in the number list*/\\n if y\\\\==z+inc then leave /*is this number not > previous by inc?*/\\n inc= inc + 1; g= y /*increase the range, assign G (good).*/\\n end /*k*/\\n if k-1=j | g=z+1 then iterate /*Is the range=0│1? Then keep truckin'*/\\n new= new'-'g; j= k - 1 /*indicate a range of numbers; change J*/\\n end /*while*/\\n /*stick a fork in it, we're all done. */\\nnew= substr(new, 2) /*elide the leading comma in the list. */\\nsay 'old:' old; say 'new:' new /*show the old and new range of numbers*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program to test range extraction. ******************************\\n* 07.08.2012 Walter Pachl\\n**********************************************************************/\\naaa='0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29',\\n '30 31 32 33 35 36 37 38 39'\\nsay 'old='aaa;\\naaa=aaa 1e99 /* artificial number at the end */\\ni=0 /* initialize index */\\nol='' /* initialize output string */\\ncomma='' /* will become a ',' lateron */\\ninrange=0\\nDo While i<=words(aaa) /* loop for all numbers */\\n i=i+1 /* index of next number */\\n n=word(aaa,i) /* the now current number */\\n If n=1e99 Then Leave /* we are at the end */\\n If inrange Then Do /* range was opened */\\n If word(aaa,i+1)<>n+1 Then Do /* following word not in range */\\n ol=ol||n /* so this number is the end */\\n inrange=0 /* and the range is over */\\n End /* else ignore current number */\\n End\\n Else Do /* not in a range */\\n ol=ol||comma||n /* add number (with comma) */\\n comma=',' /* to the output string */\\n If word(aaa,i+2)=n+2 Then Do /* if the nr after the next fits */\\n inrange=1 /* open a range */\\n ol=ol'-' /* append the range connector */\\n End\\n End\\n End\\nSay 'new='ol\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Range extraction\\n\\nint = \\\"0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39\\\"\\nint = str2list(substr(int, \\\",\\\", nl))\\nsumint = []\\nintnew = 1\\nfor n=1 to len(int)\\n flag = 0\\n nr = 0\\n intnew = 0\\n for m=n to len(int)-1\\n if int[m] = int[m+1] - 1\\n intnew = m+1\\n flag = 1\\n nr = nr + 1\\n else\\n exit\\n ok\\n next\\n if flag = 1 and nr > 1\\n if intnew != 0\\n add(sumint, [n,intnew])\\n n = m\\n ok\\n else\\n add(sumint, [n,\\\"\\\"])\\n ok\\nnext\\nshowarray(sumint)\\n\\nfunc showarray(vect)\\n see \\\"[\\\"\\n svect = \\\"\\\"\\n for n = 1 to len(vect)\\n if vect[n][2] != \\\"\\\"\\n svect = svect +\\\"\\\" + int[vect[n][1]] + \\\"-\\\" + int[vect[n][2]] + \\\", \\\"\\n else\\n svect = svect +\\\"\\\" + int[vect[n][1]] + \\\", \\\"\\n ok\\n next\\n svect = left(svect, len(svect) - 2)\\n see svect\\n see \\\"]\\\" + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def range_extract(l)\\n # pad the list with a big value, so that the last loop iteration will\\n # append something to the range\\n sorted, range = l.sort.concat([Float::MAX]), []\\n canidate_number = sorted.first\\n\\n # enumerate over the sorted list in pairs of current number and next by index\\n sorted.each_cons(2) do |current_number, next_number|\\n # if there is a gap between the current element and its next by index\\n if current_number.succ < next_number\\n # if current element is our first or our next by index\\n if canidate_number == current_number\\n # put the first element or next by index into our range as a string\\n range << canidate_number.to_s\\n else\\n # if current element is not the same as the first or next\\n # add [first or next, first or next equals current add , else -, current]\\n seperator = canidate_number.succ == current_number ? \\\",\\\" : \\\"-\\\"\\n range << \\\"%d%s%d\\\" % [canidate_number, seperator, current_number]\\n end\\n # make the first element the next element\\n canidate_number = next_number\\n end\\n end\\n range.join(',')\\nend\\n\\nlst = [\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39\\n]\\n\\np rng = range_extract(lst)\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"ary = [0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39]\\nputs ary.sort.slice_when{|i,j| i+1 != j}.map{|a| a.size<3 ? a : \\\"#{a[0]}-#{a[-1]}\\\"}.join(\\\",\\\")\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use std::ops::Add;\\n\\nstruct RangeFinder<'a, T: 'a> {\\n index: usize,\\n length: usize,\\n arr: &'a [T],\\n}\\n\\nimpl<'a, T> Iterator for RangeFinder<'a, T> where T: PartialEq + Add<i8, Output=T> + Copy {\\n type Item = (T, Option<T>);\\n fn next(&mut self) -> Option<Self::Item> {\\n if self.index == self.length {\\n return None;\\n }\\n let lo = self.index;\\n while self.index < self.length - 1 && self.arr[self.index + 1] == self.arr[self.index] + 1 {\\n self.index += 1\\n }\\n let hi = self.index;\\n self.index += 1;\\n if hi - lo > 1 {\\n Some((self.arr[lo], Some(self.arr[hi])))\\n } else {\\n if hi - lo == 1 {\\n self.index -= 1\\n }\\n Some((self.arr[lo], None))\\n }\\n }\\n}\\n\\nimpl<'a, T> RangeFinder<'a, T> {\\n fn new(a: &'a [T]) -> Self {\\n RangeFinder {\\n index: 0,\\n arr: a,\\n length: a.len(),\\n }\\n }\\n}\\n\\nfn main() {\\n let input_numbers : &[i8] = &[0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39];\\n for (i, (lo, hi)) in RangeFinder::new(&input_numbers).enumerate() {\\n if i > 0 {print!(\\\",\\\")}\\n print!(\\\"{}\\\", lo);\\n if hi.is_some() {print!(\\\"-{}\\\", hi.unwrap())}\\n }\\n println!(\\\"\\\");\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"#![feature(zero_one)]\\nuse std::num::One;\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \" impl<'a, T> Iterator for RangeFinder<'a, T> where T: PartialEq + Add<i8, Output=T> + Copy {\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"impl<'a, T> Iterator for RangeFinder<'a, T> where T: PartialEq + Add<T, Output=T> + Copy + One {\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \" while self.index < self.length - 1 && self.arr[self.index + 1] == self.arr[self.index] + 1 {\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \" while self.index < self.length - 1 && self.arr[self.index + 1] == self.arr[self.index] + T::one() {\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object Range {\\n def spanRange(ls:List[Int])={\\n var last=ls.head\\n ls span {x => val b=x<=last+1; last=x; b}\\n }\\n\\n def toRangeList(ls:List[Int]):List[List[Int]]=ls match {\\n case Nil => List()\\n case _ => spanRange(ls) match {\\n case (range, Nil) => List(range)\\n case (range, rest) => range :: toRangeList(rest)\\n }\\n }\\n\\n def toRangeString(ls:List[List[Int]])=ls map {r=>\\n if(r.size<3) r mkString \\\",\\\"\\n else r.head + \\\"-\\\" + r.last\\n } mkString \\\",\\\"\\n\\n def main(args: Array[String]): Unit = {\\n var l=List(0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,\\n 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39)\\n println(toRangeString(toRangeList(l)))\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (make-range start end)\\n (cond ((= start end)\\n `(\\\",\\\" ,start))\\n ((= end (+ start 1))\\n `(\\\",\\\" ,start \\\",\\\" ,end))\\n (else\\n `(\\\",\\\" ,start \\\"-\\\" ,end))))\\n\\n(define (range-extract-0 start end a)\\n (cond ((null? a)\\n (make-range start end))\\n ((= (+ 1 end) (car a))\\n (range-extract-0 start (car a) (cdr a)))\\n (else\\n (append (make-range start end)\\n (range-extract-0 (car a) (car a) (cdr a))))))\\n\\n(define (range-extract a)\\n (apply string-append (map (lambda (x)\\n (if (number? x)\\n (number->string x)\\n x))\\n (cdr (range-extract-0 (car a) (car a) (cdr a))))))\\n\\n(range-extract '( 0 1 2 4 6 7 8 11 12 14\\n 15 16 17 18 19 20 21 22 23 24\\n 25 27 28 29 30 31 32 33 35 36\\n 37 38 39))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst func string: rangeExtraction (in array integer: numbers) is func\\n result\\n var string: rangeStri is \\\"\\\";\\n local\\n var integer: index is 1;\\n var integer: index2 is 1;\\n begin\\n while index <= length(numbers) do\\n while index2 <= pred(length(numbers)) and numbers[succ(index2)] = succ(numbers[index2]) do\\n incr(index2);\\n end while;\\n if succ(index) < index2 then\\n rangeStri &:= \\\",\\\" <& numbers[index] <& \\\"-\\\" <& numbers[index2];\\n else\\n while index <= index2 do\\n rangeStri &:= \\\",\\\" <& numbers[index];\\n incr(index);\\n\\tend while;\\n end if;\\n incr(index2);\\n index := index2;\\n end while;\\n rangeStri := rangeStri[2 ..];\\n end func;\\n\\nconst proc: main is func\\n begin\\n writeln(rangeExtraction([] (0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19,\\n 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39)));\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"* # Absolute value\\n define('abs(n)') :(abs_end)\\nabs abs = ~(abs = lt(n,0) -n) n :(return)\\nabs_end\\n\\n define('rangext(str)d1,d2') :(rangext_end)\\nrangext num = ('+' | '-' | '') span('0123456789')\\nrxt1 str ',' span(' ') = ' ' :s(rxt1)\\nrxt2 str num . d1 ' ' num . d2 =\\n+ d1 ('~,' ? *eq(abs(d2 - d1),1) '~' | ',') d2 :s(rxt2)\\nrxt3 str ('~' | '-') num '~' = '-' :s(rxt3)\\nrxt4 str '~' = ',' :s(rxt4)\\n rangext = str :(return)\\nrangext_end\\n\\n* # Test and display\\n test = '0, 1, 2, 4, 6, 7, 8, 11, 12, 14, '\\n+ '15, 16, 17, 18, 19, 20, 21, 22, 23, 24, '\\n+ '25, 27, 28, 29, 30, 31, 32, 33, 35, 36, '\\n+ '37, 38, 39'\\n output = rangext(test)\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"/*\\nThis code is an implementation of \\\"Range extraction\\\" in SQL ORACLE 19c\\np_list_of_sets -- input string\\ndelimeter by default \\\",\\\"\\np_format -- output format:\\n 0 => [-2,-1] [0,2]\\n 1 => -2--1,0-2\\n*/\\nwith\\nfunction range_extraction(p_list_of_sets in varchar2, p_format integer default 0)\\nreturn varchar2 is\\n --\\n v_list_of_sets varchar2(32767) := p_list_of_sets;\\n v_output varchar2(32767) ;\\n v_set_1 varchar2(2000) ;\\n v_set_2 varchar2(2000) ;\\n v_set_2_gr pls_integer;\\n v_max pls_integer;\\n --\\n function sort_set(p_in_str varchar2)\\n return varchar2 is\\n v_out varchar2(32767) := p_in_str;\\n begin\\n --\\n with out_tab as\\n (select distinct to_number(regexp_substr(str, '[^,]+', 1, rownum, 'c', 0) default null on conversion error ) elem\\n from\\n (select p_in_str as str\\n from dual\\n )\\n connect by level <= regexp_count(str, '[^,]+')\\n )\\n select distinct listagg(elem, ',') within group(order by elem) end\\n into v_out\\n from out_tab;\\n --\\n return v_out;\\n end;\\n --\\nbegin\\n --cleaning\\n v_list_of_sets := replace(v_list_of_sets, ' ', '') ;\\n v_list_of_sets := sort_set(v_list_of_sets) ;\\n --\\n <<loop_through_set>>\\n while regexp_count(v_list_of_sets, '[^,]+') > 0\\n loop\\n v_set_1 := regexp_substr(v_list_of_sets, '[^,]+', 1, 1) ;\\n v_list_of_sets := regexp_replace(v_list_of_sets,v_set_1,'',1,1);\\n --\\n <<loop_for>>\\n for i in 1..regexp_count(v_list_of_sets, '[^,]+')\\n loop\\n v_set_2_gr := nvl(v_set_2,v_set_1);\\n v_set_2 := regexp_substr(v_list_of_sets, '[^,]+', 1, 1) ;\\n --\\n if to_number(v_set_2) > to_number(v_set_1) + i then\\n v_output := v_output||' ['||v_set_1||case when v_set_1 != v_set_2_gr then ','||v_set_2_gr end||']';\\n continue loop_through_set;\\n end if;\\n --\\n v_list_of_sets := regexp_replace(v_list_of_sets,v_set_2,'',1,1);\\n --\\n end loop loop_for;\\n --\\n v_output := v_output||' ['||v_set_1||case when v_set_1 != v_set_2 then ','||v_set_2 end||']';\\n v_list_of_sets := regexp_replace(v_list_of_sets,v_set_1,'',1,1);\\n --\\n end loop loop_through_set;\\n --\\n --output format\\n v_output := nvl(v_output,'[]');\\n if p_format = 1 then\\n v_output := ltrim(trim(v_output), '[');\\n v_output := rtrim(v_output, ']');\\n v_output := replace(v_output, ',', '-');\\n v_output := replace(v_output, '] [', ',');\\n end if;\\n --\\n return trim(v_output);\\nend;\\n\\n--Test\\nselect '-- Test, Standart Format ' as output from dual\\nunion all\\nselect lpad(', ',125) || ' ==> ' || range_extraction(', ') as output from dual\\nunion all\\nselect lpad('0,-1,2,-2',125) || ' ==> ' || range_extraction('0,-1,2,-2') as output from dual\\nunion all\\nselect lpad('3,3,0,0,-2,-2',125) || ' ==> ' || range_extraction('3,3,0,0,-2,-2') as output from dual\\nunion all\\nselect lpad('+0,-X,swde, 2q, +4, 3,0 ,-0,-2 , -3',125) || ' ==> ' || range_extraction('+0,-X,swde, 2q, +4, 3,0 ,-0,-2 , -3') as output from dual\\nunion all\\nselect lpad('-1,-11,-12,-14,-15,-16,-17,-18,-19,-2,-20,-21,-22,-23,-24,-25,-0,-27,-28,-29,-30,-31,-32,-33,-35,-36,-37,-38,-39,-4,-6,-7,-8',125) || ' ==> ' || range_extraction('-1,-11,-12,-14,-15,-16,-17,-18,-19,-2,-20,-21,-22,-23,-24,-25,-0,-27,-28,-29,-30,-31,-32,-33,-35,-36,-37,-38,-39,-4,-6,-7,-8') as output from dual\\nunion all\\nselect lpad('1,11,12,14,15,16,17,18,19,2,20,21,22,23,24,25,0,27,28,29,30,31,32,33,35,36,37,38,39,4,6,7,8',125) || ' ==> ' || range_extraction('1,11,12,14,15,16,17,18,19,2,20,21,22,23,24,25,0,27,28,29,30,31,32,33,35,36,37,38,39,4,6,7,8') as output from dual\\nunion all\\n--Test RosettaCode\\nselect '-- Test RosettaCode, Standart Format ' as output from dual\\nunion all\\nselect lpad('-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20',125) || ' ==> ' || range_extraction('-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20') as output from dual\\nunion all\\nselect lpad('0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39',125) || ' ==> ' || range_extraction('0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39') as output from dual\\nunion all\\nselect '-- Test RosettaCode, RosettaCode Format' as output from dual\\nunion all\\nselect lpad('-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20',125) || ' ==> ' || range_extraction('-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20',1) as output from dual\\nunion all\\nselect lpad('0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39',125) || ' ==> ' || range_extraction('0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39',1) as output from dual\\n;\\n\",\n \"language\": \"SQL\"\n },\n {\n \"code\": \"import Darwin\\n\\nfunc ranges(from ints:[Int]) -> [(Int, Int)] {\\n\\n\\tvar range : (Int, Int)?\\n\\tvar ranges = [(Int, Int)]()\\n\\tfor this in ints {\\n\\t\\tif let (start, end) = range {\\n\\t\\t\\tif this == end + 1 {\\n\\t\\t\\t\\trange = (start, this)\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tranges.append(range!)\\n\\t\\t\\t\\trange = (this, this)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse { range = (this, this) }\\n\\t}\\n\\tranges.append(range!)\\n\\n\\treturn ranges\\n}\\n\\nfunc description(from ranges:[(Int, Int)]) -> String {\\n\\tvar desc = \\\"\\\"\\n\\tfor (start, end) in ranges {\\n\\t\\tdesc += desc.isEmpty ? \\\"\\\" : \\\",\\\"\\n\\t\\tif start == end {\\n\\t\\t\\tdesc += \\\"\\\\(start)\\\"\\n\\t\\t}\\n\\t\\telse if end == start + 1 {\\n\\t\\t\\tdesc += \\\"\\\\(start),\\\\(end)\\\"\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tdesc += \\\"\\\\(start)-\\\\(end)\\\"\\n\\t\\t}\\n\\t}\\n\\treturn desc\\n}\\n\\n\\nlet ex = [-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]\\nlet longer = [0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n\\t15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n\\t25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n\\t37, 38, 39]\\n\\nprint(description(from: ranges(from: ex)))\\nprint(description(from: ranges(from: longer)))\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"templates extract\\n templates out\\n when <{start: <=$.end::raw>}> do '$.start;' !\\n when <{end: <=$.start::raw+1>}> do '$.start;,$.end;' !\\n otherwise '$.start;-$.end;' !\\n end out\\n @: {start: $(1), end: $(1)};\\n [ $(2..last)... -> #, $@ -> out ] -> '$...;' !\\n when <=$@.end::raw+1> do @.end: $;\\n otherwise $@ -> out !\\n ',' !\\n @: {start: $, end: $};\\nend extract\\n\\n[0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39] -> extract -> !OUT::write\\n\",\n \"language\": \"Tailspin\"\n },\n {\n \"code\": \"proc rangeExtract list {\\n set result [lindex $list 0]\\n set first [set last [lindex $list 0]]\\n foreach term [lrange $list 1 end] {\\n\\tif {$term == $last+1} {\\n\\t set last $term\\n\\t continue\\n\\t}\\n\\tif {$last > $first} {\\n\\t append result [expr {$last == $first+1 ? \\\",\\\" : \\\"-\\\"}] $last\\n\\t}\\n\\tappend result \\\",\\\" $term\\n\\tset first [set last $term]\\n }\\n if {$last == $first+1} {\\n\\tappend result \\\",\\\" $last\\n } elseif {$last > $first} {\\n\\tappend result \\\"-\\\" $last\\n }\\n return $result\\n}\\n\\n# Commas already removed so it is a natural Tcl list\\nputs [rangeExtract {\\n 0 1 2 4 6 7 8 11 12 14\\n 15 16 17 18 19 20 21 22 23 24\\n 25 27 28 29 30 31 32 33 35 36\\n 37 38 39\\n}]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT,{}\\nMODE DATA\\n$$ numbers=*\\n0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n37, 38, 39\\n$$ MODE TUSCRIPT\\nnumbers=EXCHANGE (numbers,\\\":,{0-00} :':\\\")\\nunrangednrs=JOIN (numbers,\\\"\\\")\\nrangednrs=COMBINE (unrangednrs,\\\"\\\")\\nrangednrs=EXCHANGE (rangednrs,\\\":':,:\\\")\\nPRINT rangednrs\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nMODE DATA\\n$$ numbers=*\\n0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n37, 38, 39\\n$$ MODE TUSCRIPT\\nnumbers=EXCHANGE (numbers,\\\":,><<> :':\\\")\\nunrangednrs=JOIN (numbers,\\\"\\\")\\n\\nhelp = APPEND (unrangednrs, \\\"999999999\\\")\\nrest = REMOVE (help, 1, n_1)\\nn_2 = n_1, n_3= n_2 + 1,rangednrs= \\\"\\\"\\nLOOP n= rest\\n IF (n!=n_3) THEN\\n rangednrs = APPEND (rangednrs, n_1)\\n IF (n_1!=n_2) THEN\\n range=n_1+1\\n IF (range==n_2) THEN\\n rangednrs = APPEND (rangednrs,n_2)\\n ELSE\\n rangednrs = CONCAT (rangednrs, \\\"-\\\", n_2)\\n ENDIF\\n ENDIF\\n n_1 = n\\n ENDIF\\n n_2 = n, n_3 = n_2 + 1\\nENDLOOP\\nrangednrs=EXCHANGE (rangednrs,\\\":':,:\\\")\\nPRINT rangednrs\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"(defun range-extract (numbers)\\n `@{(mapcar [iff [callf > length (ret 2)]\\n (ret `@[@1 0]-@[@1 -1]`)\\n (ret `@{@1 \\\",\\\"}`)]\\n (mapcar (op mapcar car)\\n (split [window-map 1 :reflect\\n (op list @2 (- @2 @1))\\n (sort (uniq numbers))]\\n (op where [chain second (op < 1)])))) \\\",\\\"}`)\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"#!/usr/bin/bash\\n\\nrange_contract () (\\n add_range () {\\n case $(( current - range_start )) in\\n 0) ranges+=( $range_start ) ;;\\n 1) ranges+=( $range_start $current ) ;;\\n *) ranges+=(\\\"$range_start-$current\\\") ;;\\n esac\\n }\\n\\n ranges=()\\n range_start=$1\\n current=$1\\n shift\\n\\n for number; do\\n if (( number > current+1 )); then\\n add_range\\n range_start=$number\\n fi\\n current=$number\\n done\\n add_range\\n\\n x=\\\"${ranges[@]}\\\"\\n echo ${x// /,}\\n)\\n\\nrange_contract 0 1 2 4 6 7 8 11 12 14 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 31 32 33 35 36 37 38 39\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#import std\\n#import int\\n\\nx = <0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39>\\n\\nf = mat`,+ ==?(~&l,^|T/~& :/`-)*bhPS+ %zP~~hzX*titZBPiNCSiNCQSL+ rlc ^|E/~& predecessor\\n\\n#show+\\n\\nt = <f x>\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"Public Function RangeExtraction(AList) As String\\n'AList is a variant that is an array, assumed filled with numbers in ascending order\\nConst RangeDelim = \\\"-\\\" 'range delimiter\\nDim result As String\\nDim InRange As Boolean\\nDim Posn, ub, lb, rangestart, rangelen As Integer\\n\\nresult = \\\"\\\"\\n'find dimensions of AList\\nub = UBound(AList)\\nlb = LBound(AList)\\nPosn = lb\\nWhile Posn < ub\\n rangestart = Posn\\n rangelen = 0\\n InRange = True\\n 'try to extend the range\\n While InRange\\n rangelen = rangelen + 1\\n If Posn = ub Then\\n InRange = False\\n Else\\n InRange = (AList(Posn + 1) = AList(Posn) + 1)\\n Posn = Posn + 1\\n End If\\n Wend\\n If rangelen > 2 Then 'output the range if it has more than 2 elements\\n result = result & \\\",\\\" & Format$(AList(rangestart)) & RangeDelim & Format$(AList(rangestart + rangelen - 1))\\n Else 'output the separate elements\\n For i = rangestart To rangestart + rangelen - 1\\n result = result & \\\",\\\" & Format$(AList(i))\\n Next\\n End If\\n Posn = rangestart + rangelen\\nWend\\nRangeExtraction = Mid$(result, 2) 'get rid of first comma!\\nEnd Function\\n\\n\\nPublic Sub RangeTest()\\n'test function RangeExtraction\\n'first test with a Variant array\\nDim MyList As Variant\\nMyList = Array(0, 1, 2, 4, 6, 7, 8, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39)\\nDebug.Print \\\"a) \\\"; RangeExtraction(MyList)\\n\\n'next test with an array of integers\\nDim MyOtherList(1 To 20) As Integer\\nMyOtherList(1) = -6\\nMyOtherList(2) = -3\\nMyOtherList(3) = -2\\nMyOtherList(4) = -1\\nMyOtherList(5) = 0\\nMyOtherList(6) = 1\\nMyOtherList(7) = 3\\nMyOtherList(8) = 4\\nMyOtherList(9) = 5\\nMyOtherList(10) = 7\\nMyOtherList(11) = 8\\nMyOtherList(12) = 9\\nMyOtherList(13) = 10\\nMyOtherList(14) = 11\\nMyOtherList(15) = 14\\nMyOtherList(16) = 15\\nMyOtherList(17) = 17\\nMyOtherList(18) = 18\\nMyOtherList(19) = 19\\nMyOtherList(20) = 20\\nDebug.Print \\\"b) \\\"; RangeExtraction(MyOtherList)\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Function Range_Extraction(list)\\n\\tnum = Split(list,\\\",\\\")\\n\\tFor i = 0 To UBound(num)\\n\\t\\tstartnum = CInt(num(i))\\n\\t\\tsum = startnum\\n\\t\\tDo While i <= UBound(num)\\n\\t\\t\\tIf sum = CInt(num(i)) Then\\n\\t\\t\\t\\tIf i = UBound(num) Then\\n\\t\\t\\t\\t\\tIf startnum <> CInt(num(i)) Then\\n\\t\\t\\t\\t\\t\\tIf startnum + 1 = CInt(num(i)) Then\\n\\t\\t\\t\\t\\t\\t\\tRange_Extraction = Range_Extraction & startnum & \\\",\\\" & num(i) & \\\",\\\"\\n\\t\\t\\t\\t\\t\\tElse\\n\\t\\t\\t\\t\\t\\t\\tRange_Extraction = Range_Extraction & startnum & \\\"-\\\" & num(i) & \\\",\\\"\\n\\t\\t\\t\\t\\t\\tEnd If\\n\\t\\t\\t\\t\\tElse\\n\\t\\t\\t\\t\\t\\tRange_Extraction = Range_Extraction & startnum & \\\",\\\"\\n\\t\\t\\t\\t\\tEnd If\\n Exit Do\\n\\t\\t\\t\\tElse\\n\\t\\t\\t\\t\\ti = i + 1\\n\\t\\t\\t\\t\\tsum = sum + 1\\n\\t\\t\\t\\tEnd If\\n\\t\\t\\tElse\\n\\t\\t\\t\\tIf startnum = CInt(num(i-1)) Then\\n\\t\\t\\t\\t\\tRange_Extraction = Range_Extraction & startnum & \\\",\\\"\\n\\t\\t\\t\\tElse\\n\\t\\t\\t\\t\\tIf startnum + 1 = CInt(num(i-1)) Then\\n\\t\\t\\t\\t\\t\\tRange_Extraction = Range_Extraction & startnum & \\\",\\\" & num(i-1) & \\\",\\\"\\n\\t\\t\\t\\t\\tElse\\n\\t\\t\\t\\t\\t\\tRange_Extraction = Range_Extraction & startnum & \\\"-\\\" & num(i-1) & \\\",\\\"\\n\\t\\t\\t\\t\\tEnd If\\n\\t\\t\\t\\tEnd If\\n\\t\\t\\t\\ti = i - 1\\n\\t\\t\\t\\tExit Do\\n\\t\\t\\tEnd If\\n\\t\\tLoop\\n\\tNext\\n\\tRange_Extraction = Left(Range_Extraction,Len(Range_Extraction)-1)\\nEnd Function\\n\\nWScript.StdOut.Write Range_Extraction(\\\"0,1,2,4,6,7,8,11,12,14,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,31,32,33,35,36,37,38,39\\\")\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"var extractRange = Fn.new { |list|\\n if (list.isEmpty) return \\\"\\\"\\n var sb = \\\"\\\"\\n var first = list[0]\\n var prev = first\\n\\n var append = Fn.new { |index|\\n if (first == prev) {\\n sb = sb + prev.toString\\n } else if (first == prev - 1) {\\n sb = sb + first.toString + \\\",\\\" + prev.toString\\n } else {\\n sb = sb + first.toString + \\\"-\\\" + prev.toString\\n }\\n if (index < list.count - 1) sb = sb + \\\",\\\"\\n }\\n\\n for (i in 1...list.count) {\\n if (list[i] == prev + 1) {\\n prev = prev + 1\\n } else {\\n append.call(i)\\n first = list[i]\\n prev = first\\n }\\n }\\n append.call(list.count - 1)\\n return sb\\n}\\n\\nvar list1 = [-6, -3, -2, -1, 0, 1, 3, 4, 5, 7, 8, 9, 10, 11, 14, 15, 17, 18, 19, 20]\\nSystem.print(extractRange.call(list1))\\nvar list2 = [0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39]\\nSystem.print(extractRange.call(list2))\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"string 0;\\ndef End = -1>>1;\\n\\nfunc RangeExtract(List); \\\\Return a string in the range format\\nint List, I, Lo, Hi;\\nchar String(0);\\n[I:= 0;\\nloop [Lo:= List(I);\\n while List(I)+1 = List(I+1) do I:= I+1;\\n Hi:= List(I);\\n IntOut(8, Lo);\\n if Hi-Lo >= 2 then\\n [ChOut(8, ^-); IntOut(8, Hi)]\\n else if Hi-Lo = 1 then\\n [ChOut(8, ^,); IntOut(8, Hi)];\\n I:= I+1;\\n if List(I) = End then quit;\\n ChOut(8, ^,);\\n ];\\nChOut(8, 0);\\nI:= 0;\\nloop [String(I):= ChIn(8);\\n if String(I) = 0 then return String;\\n I:= I+1;\\n ];\\n];\\n\\nText(0, RangeExtract(\\n [0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39, End]) )\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"fcn range(ns){\\n fcn(w){\\n if (w.atEnd) return(Void.Stop);\\n a:=b:=w.next(); n:=0;\\n while(b+1 == (c:=w.peekN(n))){ n+=1; b=c }\\n if(n>1){do(n){w.next()}; return(\\\"%d-%d\\\".fmt(a,b)); }\\n a\\n } :\\n (0).pump(*,List,_.fp(ns.walker().tweak(Void,Void))).concat(\\\",\\\");\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"var ns=T(-6,-3,-2,-1,0,1,3,4,5,7,8,9,10,11,14,15,17,18,19,20);\\nrange(ns).println();\\n\\nns=T(\\n 0, 1, 2, 4, 6, 7, 8, 11, 12, 14,\\n 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,\\n 25, 27, 28, 29, 30, 31, 32, 33, 35, 36,\\n 37, 38, 39);\\nrange(ns).println();\\n\\nrange([1..100]).println();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Range-extraction"}}},{"rowIdx":1561,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Sorting\nfrom: http://rosettacode.org/wiki/Ranking_methods\nnote: Sorting Algorithms\n","language":"00-META"},{"code":"{{Sorting Algorithm}}\n\nThe numerical rank of competitors in a competition shows if one is better than, equal to, or worse than another based on their results in a competition.\n\nThe numerical rank of a competitor can be assigned in several [[wp:Ranking|different ways]].\n\n\n;Task:\nThe following scores are accrued for all competitors of a competition (in best-first order):\n<pre>44 Solomon\n42 Jason\n42 Errol\n41 Garry\n41 Bernard\n41 Barry\n39 Stephen</pre>\n\nFor each of the following ranking methods, create a function/method/procedure/subroutine... that applies the ranking method to an ordered list of scores with scorers:\n# Standard. (Ties share what would have been their first ordinal number).\n# Modified. (Ties share what would have been their last ordinal number).\n# Dense. (Ties share the next available integer). \n# Ordinal. ((Competitors take the next available integer. Ties are not treated otherwise).\n# Fractional. (Ties share the mean of what would have been their ordinal numbers).\n\n<br>\nSee the [[wp:Ranking|wikipedia article]] for a fuller description.\n\nShow here, on this page, the ranking of the test scores under each of the numbered ranking methods.\n<br><br>\n\n","language":"00-TASK"},{"code":"F mc_rank([(Int, String)] iterable)\n ‘Modified competition ranking’\n [(Float, (Int, String))] r\n V lastresult = -1\n [(Int, String)] fifo\n L(item) iterable\n I item[0] == lastresult\n fifo [+]= item\n E\n V n = L.index\n L !fifo.empty\n r.append((n, fifo.pop(0)))\n lastresult = item[0]\n fifo [+]= item\n L !fifo.empty\n r.append((iterable.len, fifo.pop(0)))\n R r\n\nF sc_rank([(Int, String)] iterable)\n ‘Standard competition ranking’\n [(Float, (Int, String))] r\n V lastresult = -1\n V lastrank = -1\n L(item) iterable\n I item[0] == lastresult\n r.append((lastrank, item))\n E\n V n = L.index + 1\n r.append((n, item))\n lastresult = item[0]\n lastrank = n\n R r\n\nF d_rank([(Int, String)] iterable)\n ‘Dense ranking’\n [(Float, (Int, String))] r\n V lastresult = -1\n V lastrank = 0\n L(item) iterable\n I item[0] == lastresult\n r.append((lastrank, item))\n E\n lastresult = item[0]\n lastrank++\n r.append((lastrank, item))\n R r\n\nF o_rank([(Int, String)] iterable)\n ‘Ordinal ranking’\n R enumerate(iterable, 1).map((i, item) -> ((Float(i), item)))\n\nF f_rank([(Int, String)] iterable)\n ‘Fractional ranking’\n [(Float, (Int, String))] r\n V last = -1\n [(Int, (Int, String))] fifo\n L(item) iterable\n I item[0] != last\n I !fifo.empty\n V mean = Float(sum(fifo.map(f -> f[0]))) / fifo.len\n L !fifo.empty\n r.append((mean, fifo.pop(0)[1]))\n last = item[0]\n fifo.append((L.index + 1, item))\n I !fifo.empty\n V mean = sum(fifo.map(f -> f[0])) / fifo.len\n L !fifo.empty\n r.append((mean, fifo.pop(0)[1]))\n R r\n\nV scores = [(44, ‘Solomon’),\n (42, ‘Jason’),\n (42, ‘Errol’),\n (41, ‘Garry’),\n (41, ‘Bernard’),\n (41, ‘Barry’),\n (39, ‘Stephen’)]\n\nprint(\"\\nScores to be ranked (best first):\")\nL(n, s) scores\n print(‘ #2 #.’.format(n, s))\n\nL(ranker, ranking_method) [(sc_rank, ‘Standard competition ranking’),\n (mc_rank, ‘Modified competition ranking’),\n (d_rank, ‘Dense ranking’),\n (o_rank, ‘Ordinal ranking’),\n (f_rank, ‘Fractional ranking’)]\n print(\"\\n#.:\".format(ranking_method))\n L(rank, score) ranker(scores)\n print(‘ #3, (#., #.)’.format(rank, score[0], score[1]))\n","language":"11l"},{"code":"BEGIN # rank some scores by various methods #\n # MODE to hold the scores #\n MODE RESULT = STRUCT( INT score, STRING name );\n # returns the standard ranking of s #\n PROC standard ranking = ( []RESULT s )[]INT:\n IF LWB s > UPB s THEN []INT() # no scores #\n ELSE # have some scores #\n [ LWB s : UPB s ]INT ranked;\n INT position := 1;\n ranked[ LWB s ] := position;\n FOR i FROM LWB s + 1 TO UPB s DO\n ranked[ i ] := IF score OF s[ i ] = score OF s[ i - 1 ] THEN\n # same score as the previous #\n position\n ELSE\n # different score, increase the position #\n position := i\n FI\n OD;\n ranked\n FI # standard ranking # ;\n # returns the modified ranking of s #\n PROC modified ranking = ( []RESULT s )[]INT:\n IF LWB s > UPB s THEN []INT() # no scores #\n ELSE # have some scores #\n [ LWB s : UPB s ]INT ranked;\n INT position := ( UPB s + 1 ) - LWB s;\n ranked[ UPB s ] := position;\n FOR i FROM UPB s - 1 BY -1 TO LWB s DO\n ranked[ i ] := IF score OF s[ i ] = score OF s[ i + 1 ] THEN\n # same score as the previous #\n position\n ELSE\n # different score, decrease the position #\n position := i\n FI\n OD;\n ranked\n FI # modified ranking # ;\n # returns the debse ranking of s #\n PROC dense ranking = ( []RESULT s )[]INT:\n IF LWB s > UPB s THEN []INT() # no scores #\n ELSE # have some scores #\n [ LWB s : UPB s ]INT ranked;\n INT position := 1;\n ranked[ LWB s ] := position;\n FOR i FROM LWB s + 1 TO UPB s DO\n ranked[ i ] := IF score OF s[ i ] = score OF s[ i - 1 ] THEN\n # same score as the previous #\n position\n ELSE\n # different score, increase the position #\n position +:= 1\n FI\n OD;\n ranked\n FI # dense ranking # ;\n # returns the ordinal ranking of s #\n PROC ordinal ranking = ( []RESULT s )[]INT:\n IF LWB s > UPB s THEN []INT() # no scores #\n ELSE # have some scores #\n [ LWB s : UPB s ]INT ranked;\n INT position := 0;\n FOR i FROM LWB s TO UPB s DO\n ranked[ i ] := position +:= 1\n OD;\n ranked\n FI # ordinal ranking # ;\n # regturns the fractional ranking of s #\n PROC fractional ranking = ( []RESULT s )[]REAL:\n IF LWB s > UPB s THEN []REAL() # no scores #\n ELSE # have some scores #\n [ LWB s : UPB s ]REAL ranked;\n REAL position := 1;\n FOR i FROM LWB s TO UPB s DO\n ranked[ i ]\n := IF IF i = LWB s\n THEN FALSE\n ELSE score OF s[ i ] = score OF s[ i - 1 ]\n FI\n THEN\n # same score as the previous #\n ranked[ i - 1 ]\n ELSE\n # first score or different score to the previous #\n INT same count := 1;\n INT sum := i;\n FOR j FROM i + 1 TO UPB s\n WHILE score OF s[ i ] = score OF s[ j ]\n DO\n same count +:= 1;\n sum +:= j\n OD;\n sum / same count\n FI\n OD;\n ranked\n FI # fractional ranking # ;\n # shows the integer ranking of some scores #\n PROC show integral ranking = ( []RESULT s, []INT ranking, STRING title )VOID:\n BEGIN\n print( ( title, \" competition ranking:\", newline ) );\n FOR i FROM LWB s TO UPB s DO\n print( ( whole( ranking[ i ], -3 )\n , \": \"\n , whole( score OF s[ i ], -3 )\n , \" \"\n , name OF s[ i ]\n , newline\n )\n )\n OD;\n print( ( newline ) )\n END # show integral ranking # ;\n # shows the real ranking of some scores #\n PROC show real ranking = ( []RESULT s, []REAL ranking, STRING title )VOID:\n BEGIN\n print( ( title, \" competition ranking:\", newline ) );\n FOR i FROM LWB s TO UPB s DO\n print( ( IF INT integer rank = ENTIER ranking[ i ];\n integer rank = ranking[ i ]\n THEN\n whole( integer rank, -3 ) + \" \"\n ELSE\n fixed( ranking[ i ], -6, 2 )\n FI\n , \": \"\n , whole( score OF s[ i ], -3 ), \" \"\n , name OF s[ i ]\n , newline\n )\n )\n OD;\n print( ( newline ) )\n END # show real ranking # ;\n\n # scores to rank - task test cases #\n []RESULT scores = ( ( 44, \"Solomon\" )\n , ( 42, \"Jason\" )\n , ( 42, \"Errol\" )\n , ( 41, \"Garry\" )\n , ( 41, \"Bernard\" )\n , ( 41, \"Barry\" )\n , ( 39, \"Stephen\" )\n );\n show integral ranking( scores, standard ranking( scores ), \"standard\" );\n show integral ranking( scores, modified ranking( scores ), \"modified\" );\n show integral ranking( scores, dense ranking( scores ), \"dense\" );\n show integral ranking( scores, ordinal ranking( scores ), \"ordinal\" );\n show real ranking( scores, fractional ranking( scores ), \"fractional\" )\n\nEND\n","language":"ALGOL-68"},{"code":"standard ← ∊∘(⌊\\¨⊢⊂⍳∘≢)∘(1,2≠/⊢)∘(1⌷[2]⊢),⊢\nmodified ← ∊∘(⌈\\∘⌽¨⊢⊂⍳∘≢)∘(1,2≠/⊢)∘(1⌷[2]⊢),⊢\ndense ← (+\\1,2≠/1⌷[2]⊢),⊢\nordinal ← ⍳∘≢,⊢\nfractional ← ∊∘((≢(/∘⊢)+/÷≢)¨⊢⊂⍳∘≢)∘(1,2≠/⊢)∘(1⌷[2]⊢),⊢\n","language":"APL"},{"code":"use AppleScript version \"2.3.1\" -- Mac OS 10.9 (Mavericks) or later.\nuse sorter : script ¬\n \"Custom Iterative Ternary Merge Sort\" -- <www.macscripter.net/t/timsort-and-nigsort/71383/3>\n\n(* The ranking methods are implemented as script objects sharing inherited code. *)\nscript standardRanking\n -- Properties and handlers inherited or overridden by the other script objects.\n -- The 'reference' is to a value that won't exist until 'results' is set to a list.\n -- 'me' and 'my' pertain to the script object using the code at the time.\n property results : missing value\n property startIndex : 1\n property endIndex : a reference to my results's length\n property step : 1\n property currentRank : missing value\n property currentScore : missing value\n\n -- Main handler.\n on resultsFrom(theScores)\n copy theScores to my results\n tell sorter to sort(my results, my startIndex, my endIndex, {comparer:me})\n set my currentScore to my results's item (my startIndex)'s score\n set my currentRank to my startIndex's contents\n repeat with i from (my startIndex) to (my endIndex) by (my step)\n my rankResult(i)\n end repeat\n set r to my results\n set my results to missing value\n return r\n end resultsFrom\n\n -- Comparison handler used by the sort.\n on isGreater(a, b)\n if (a's score < b's score) then return true\n return ((a's score = b's score) and (a's competitor comes after b's competitor))\n end isGreater\n\n -- Ranking handler. Inherited by the modifiedRanking script; overridden by the others.\n on rankResult(i)\n set thisResult to my results's item i\n set thisScore to thisResult's score\n if (thisScore is not currentScore) then\n set my currentRank to i\n set my currentScore to thisScore\n end if\n set my results's item i to thisResult & {rank:my currentRank}\n end rankResult\nend script\n\nscript modifiedRanking\n property parent : standardRanking\n property startIndex : a reference to my results's length\n property endIndex : 1\n property step : -1\nend script\n\nscript denseRanking\n property parent : standardRanking\n\n on rankResult(i)\n set thisResult to my results's item i\n set thisScore to thisResult's score\n if (thisScore is not my currentScore) then\n set my currentRank to (my currentRank) + 1\n set my currentScore to thisScore\n end if\n set my results's item i to thisResult & {rank:my currentRank}\n end rankResult\nend script\n\nscript ordinalRanking\n property parent : standardRanking\n\n on rankResult(i)\n set my results's item i to (my results's item i) & {rank:i}\n end rankResult\nend script\n\nscript fractionalRanking\n property parent : standardRanking\n\n on rankResult(i)\n set thisResult to my results's item i\n set thisScore to thisResult's score\n if (thisScore is not my currentScore) then\n -- The average of any run of consecutive integers is that of the first and last.\n set average to (i - 1 + (my currentRank)) / 2\n repeat with j from (my currentRank) to (i - 1)\n set my results's item j's rank to average\n end repeat\n set my currentRank to i\n set my currentScore to thisScore\n end if\n set my results's item i to thisResult & {rank:i as real}\n end rankResult\nend script\n\n-- Task code:\non formatRankings(type, theResults)\n set rankings to {type}\n repeat with thisResult in theResults\n set end of rankings to (thisResult's rank as text) & tab & ¬\n thisResult's competitor & \" (\" & thisResult's score & \")\"\n end repeat\n\n return join(rankings, linefeed)\nend formatRankings\n\non join(lst, delim)\n set astid to AppleScript's text item delimiters\n set AppleScript's text item delimiters to delim\n set txt to lst as text\n set AppleScript's text item delimiters to astid\n return txt\nend join\n\nlocal theScores, output\nset theScores to {{score:44, competitor:\"Solomon\"}, {score:42, competitor:\"Jason\"}, ¬\n {score:42, competitor:\"Errol\"}, {score:41, competitor:\"Garry\"}, {score:41, competitor:\"Bernard\"}, ¬\n {score:41, competitor:\"Barry\"}, {score:39, competitor:\"Stephen\"}}\nset output to {¬\n formatRankings(\"Standard ranking:\", standardRanking's resultsFrom(theScores)), ¬\n formatRankings(\"Modified ranking:\", modifiedRanking's resultsFrom(theScores)), ¬\n formatRankings(\"Dense ranking:\", denseRanking's resultsFrom(theScores)), ¬\n formatRankings(\"Ordinal ranking:\", ordinalRanking's resultsFrom(theScores)), ¬\n formatRankings(\"Fractional ranking:\", fractionalRanking's resultsFrom(theScores)) ¬\n }\nreturn join(output, linefeed & linefeed)\n","language":"AppleScript"},{"code":"\"Standard ranking:\n1\tSolomon (44)\n2\tErrol (42)\n2\tJason (42)\n4\tBarry (41)\n4\tBernard (41)\n4\tGarry (41)\n7\tStephen (39)\n\nModified ranking:\n1\tSolomon (44)\n3\tErrol (42)\n3\tJason (42)\n6\tBarry (41)\n6\tBernard (41)\n6\tGarry (41)\n7\tStephen (39)\n\nDense ranking:\n1\tSolomon (44)\n2\tErrol (42)\n2\tJason (42)\n3\tBarry (41)\n3\tBernard (41)\n3\tGarry (41)\n4\tStephen (39)\n\nOrdinal ranking:\n1\tSolomon (44)\n2\tErrol (42)\n3\tJason (42)\n4\tBarry (41)\n5\tBernard (41)\n6\tGarry (41)\n7\tStephen (39)\n\nFractional ranking:\n1.0\tSolomon (44)\n2.5\tErrol (42)\n2.5\tJason (42)\n5.0\tBarry (41)\n5.0\tBernard (41)\n5.0\tGarry (41)\n7.0\tStephen (39)\"\n","language":"AppleScript"},{"code":"Rank(data, opt:=1){ ; opt = 1 Standard (default), 2 Modified, 3 Dense, 4 Ordinal, 5 Fractional\n\tfor index, val in StrSplit(data, \"`n\", \"`r\") {\n\t\tRegExMatch(val, \"^(\\d+)\\s+(.*)\", Match)\n\t\tif !(Match1=prev)\n\t\t\tn := index\n\t\tprev := Match1\n\t\tRes1 .= n \"`t\" Match \"`n\"\n\t\tRes4 .= index \"`t\" Match \"`n\"\n\t\tTemp .= n \":\" index \" \" Match \"`n\"\n\t}\n\tn:=0\n\twhile pos := RegExMatch(Temp, \"`asm)^(\\d+).*?\\R(?!\\1)|.+\", Match, pos?pos+StrLen(Match):1) {\n\t\tn += StrSplit(Trim(Match, \"`r`n\"), \"`n\", \"`r\").MaxIndex()\n\t\tRes2 .= RegExReplace(Match, \"`am)^\\d+:\\d+\", n \"`t\")\n\t\tRes3 .= RegExReplace(Match, \"`am)^\\d+:\\d+\", A_Index \"`t\")\n\t\tR := 0\n\t\tfor index, val in StrSplit(Match, \"`n\", \"`r\")\n\t\t\tR += StrSplit(val, \":\").2\n\t\tRes5 .= RegExReplace(Match, \"`am)^\\d+:\\d+\", RegExReplace(R / StrSplit(Trim(Match, \"`r`n\"), \"`n\", \"`r\").MaxIndex(), \"\\.?0+$\") \"`t\")\n\t}\n\treturn Res%opt%\n}\n","language":"AutoHotkey"},{"code":"data =\n(\n44 Solomon\n42 Jason\n42 Errol\n41 Garry\n41 Bernard\n41 Barry\n39 Stephen\n)\n\nMsgBox, 262144, ,% \"\"\n. \"Standard Ranking:`n\"\t\tRank(data)\n. \"`nModified Ranking:`n\"\tRank(data, 2)\n. \"`nDense Ranking:`n\" \t\tRank(data, 3)\n. \"`nOrdinal Ranking:`n\" \tRank(data, 4)\n. \"`nFractional Ranking:`n\"\tRank(data, 5)\nreturn\n","language":"AutoHotkey"},{"code":"##\n## Dense ranking in file: ranking_d.awk\n##\n\nBEGIN{ lastresult = \"!\"; lastrank = 0 }\n\nfunction d_rank(){\n if($1==lastresult){\n print lastrank, $0\n }else{\n lastresult = $1\n print ++lastrank, $0 }\n}\n//{d_rank() }\n\n##\n## Fractional ranking in file: ranking_f.awk\n##\n\nBEGIN{\n last = \"!\"\n flen = 0 }\n\nfunction f_rank(){\n item = $0\n if($1!=last){\n if(flen){\n sum = 0\n for(fl=0; fl < flen;){\n $0 = fifo[fl++]\n sum += $1 }\n mean = sum / flen\n for(fl=0; fl < flen;){\n $0 = fifo[fl++]\n $1 = \"\"\n printf(\"%3g %s\\n\", mean, $0) }\n flen = 0\n }}\n $0 = item\n last = $1\n fifo[flen++] = sprintf(\"%i %s\", FNR, item)\n}\n//{f_rank()}\n\nEND{ if(flen){\n sum = 0\n for(fl=0; fl < flen;){\n $0 = fifo[fl++]\n sum += $1 }\n mean = sum / flen\n for(fl=0; fl < flen;){\n $0 = fifo[fl++]\n $1 = \"\"\n printf(\"%3g %s\\n\", mean, $0) }}}\n\n##\n## Modified competition ranking in file: ranking_mc.awk\n##\n\nBEGIN{\n lastresult = \"!\"\n flen = 0 }\n\nfunction mc_rank(){\n if($1==lastresult){\n fifo[flen++] = $0\n }else{\n for(fl=0; fl < flen;){\n print FNR-1, fifo[fl++]}\n flen = 0\n fifo[flen++] = $0\n lastresult = $1}\n}\n//{mc_rank()}\n\nEND{ for(fl=0; fl < flen;){\n print FNR, fifo[fl++]} }\n\n##\n## Ordinal ranking in file: ranking_o.awk\n##\n\nfunction o_rank(){ print FNR, $0 }\n//{o_rank() }\n\n##\n## Standard competition ranking in file: ranking_sc.awk\n##\n\nBEGIN{ lastresult = lastrank = \"!\" }\n\nfunction sc_rank(){\n if($1==lastresult){\n print lastrank, $0\n }else{\n print FNR, $0\n lastresult = $1\n lastrank = FNR}\n}\n//{sc_rank()}\n","language":"AWK"},{"code":"10 READ N\n20 DIM S(N),N$(N),R(N)\n30 FOR I=1 TO N: READ S(I),N$(I): NEXT\n40 PRINT \"--- Standard ranking ---\": GOSUB 100: GOSUB 400\n50 PRINT \"--- Modified ranking ---\": GOSUB 150: GOSUB 400\n60 PRINT \"--- Dense ranking ---\": GOSUB 200: GOSUB 400\n70 PRINT \"--- Ordinal ranking ---\": GOSUB 250: GOSUB 400\n80 PRINT \"--- Fractional ranking ---\": GOSUB 300: GOSUB 400\n90 END\n100 REM\n101 REM ** Ordinal ranking **\n110 R(1)=1\n120 FOR I=2 TO N\n130 IF S(I)=S(I-1) THEN R(I)=R(I-1) ELSE R(I)=I\n140 NEXT: RETURN\n150 REM\n151 REM ** Modified ranking **\n160 R(N)=N\n170 FOR I=N-1 TO 1 STEP -1\n180 IF S(I)=S(I+1) THEN R(I)=R(I+1) ELSE R(I)=I\n190 NEXT: RETURN\n200 REM\n201 REM ** Dense ranking **\n210 R(1)=1\n220 FOR I=2 TO N: R(I)=R(I-1)-(S(I)<>S(I-1)): NEXT\n230 RETURN\n250 REM\n251 REM ** Ordinal ranking **\n260 FOR I=1 TO N: R(I)=I: NEXT: RETURN\n300 REM\n301 REM ** Fractional ranking **\n310 I=1: J=2\n320 IF J<=N THEN IF S(J-1)=S(J) THEN J=J+1: GOTO 320\n330 FOR K=I TO J-1: R(K) = (I+J-1)/2: NEXT\n340 I=J: J=J+1: IF I<=N THEN 320\n350 RETURN\n400 REM\n401 REM ** Print the table ***\n410 FOR I=1 TO N\n420 PRINT USING \"\\ \\ ##, \\ \\\";STR$(R(I));S(I);N$(I)\n430 NEXT\n440 PRINT: RETURN\n500 DATA 7\n510 DATA 44,Solomon\n520 DATA 42,Jason\n530 DATA 42,Errol\n540 DATA 41,Garry\n550 DATA 41,Bernard\n560 DATA 41,Barry\n570 DATA 39,Stephen\n","language":"BASIC"},{"code":"#include<stdlib.h>\n#include<stdio.h>\n\ntypedef struct{\n\tint score;\n\tchar name[100];\n}entry;\n\nvoid ordinalRanking(entry* list,int len){\n\t\n\tint i;\n\t\n\tprintf(\"\\n\\nOrdinal Ranking\\n---------------\");\n\t\n\tfor(i=0;i<len;i++)\n\t\tprintf(\"\\n%d\\t%d\\t%s\",i+1,list[i].score,list[i].name);\n}\n\nvoid standardRanking(entry* list,int len){\n\t\n\tint i,j=1;\n\t\n\tprintf(\"\\n\\nStandard Ranking\\n----------------\");\n\t\n\tfor(i=0;i<len;i++){\n\t\tprintf(\"\\n%d\\t%d\\t%s\",j,list[i].score,list[i].name);\n\t\tif(list[i+1].score<list[i].score)\n\t\t\tj = i+2;\n\t}\n}\n\nvoid denseRanking(entry* list,int len){\n\t\n\tint i,j=1;\n\t\n\tprintf(\"\\n\\nDense Ranking\\n-------------\");\n\t\n\tfor(i=0;i<len;i++){\n\t\tprintf(\"\\n%d\\t%d\\t%s\",j,list[i].score,list[i].name);\n\t\tif(list[i+1].score<list[i].score)\n\t\t\tj++;\n\t}\n}\n\nvoid modifiedRanking(entry* list,int len){\n\t\n\tint i,j,count;\n\t\n\tprintf(\"\\n\\nModified Ranking\\n----------------\");\n\t\n\tfor(i=0;i<len-1;i++){\n\t\tif(list[i].score!=list[i+1].score){\n\t\t\tprintf(\"\\n%d\\t%d\\t%s\",i+1,list[i].score,list[i].name);\n\t\t\tcount = 1;\n\t\t\tfor(j=i+1;list[j].score==list[j+1].score && j<len-1;j++)\n\t\t\t\tcount ++;\n\t\t\tfor(j=0;j<count-1;j++)\n\t\t\t\tprintf(\"\\n%d\\t%d\\t%s\",i+count+1,list[i+j+1].score,list[i+j+1].name);\n\t\t\ti += (count-1);\n\t\t}\n\t}\n\tprintf(\"\\n%d\\t%d\\t%s\",len,list[len-1].score,list[len-1].name);\n}\n\nvoid fractionalRanking(entry* list,int len){\n\t\n\tint i,j,count;\n\tfloat sum = 0;\n\t\n\tprintf(\"\\n\\nFractional Ranking\\n------------------\");\n\t\n\tfor(i=0;i<len;i++){\n\t\tif(i==len-1 || list[i].score!=list[i+1].score)\n\t\t\tprintf(\"\\n%.1f\\t%d\\t%s\",(float)(i+1),list[i].score,list[i].name);\n\t\telse if(list[i].score==list[i+1].score){\n\t\t\tsum = i;\n\t\t\tcount = 1;\n\t\t\tfor(j=i;list[j].score==list[j+1].score;j++){\n\t\t\t\tsum += (j+1);\n\t\t\t\tcount ++;\n\t\t\t}\n\t\t\tfor(j=0;j<count;j++)\n\t\t\t\tprintf(\"\\n%.1f\\t%d\\t%s\",sum/count + 1,list[i+j].score,list[i+j].name);\n\t\t\ti += (count-1);\n\t\t}\n\t}\n}\n\nvoid processFile(char* fileName){\n\tFILE* fp = fopen(fileName,\"r\");\n\tentry* list;\n\tint i,num;\n\t\n\tfscanf(fp,\"%d\",&num);\n\t\n\tlist = (entry*)malloc(num*sizeof(entry));\n\t\n\tfor(i=0;i<num;i++)\n\t\tfscanf(fp,\"%d%s\",&list[i].score,list[i].name);\n\t\n\tfclose(fp);\n\t\n\tordinalRanking(list,num);\n\tstandardRanking(list,num);\n\tdenseRanking(list,num);\n\tmodifiedRanking(list,num);\n\tfractionalRanking(list,num);\n}\n\nint main(int argC,char* argV[])\n{\n\tif(argC!=2)\n\t\tprintf(\"Usage %s <score list file>\");\n\telse\n\t\tprocessFile(argV[1]);\n\treturn 0;\n}\n","language":"C"},{"code":"#include <algorithm>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <ostream>\n#include <set>\n#include <vector>\n\ntemplate<typename T>\nstd::ostream& print(std::ostream& os, const T& src) {\n auto it = src.cbegin();\n auto end = src.cend();\n\n os << \"[\";\n if (it != end) {\n os << *it;\n it = std::next(it);\n }\n while (it != end) {\n os << \", \" << *it;\n it = std::next(it);\n }\n\n return os << \"]\";\n}\n\ntypedef std::map<std::string, int> Map;\ntypedef Map::value_type MapEntry;\n\nvoid standardRank(const Map& scores) {\n std::cout << \"Standard Rank\" << std::endl;\n\n std::vector<int> list;\n for (auto& elem : scores) {\n list.push_back(elem.second);\n }\n std::sort(list.begin(), list.end(), std::greater<int>{});\n list.erase(std::unique(list.begin(), list.end()), list.end());\n\n int rank = 1;\n for (auto value : list) {\n int temp = rank;\n for (auto& e : scores) {\n if (e.second == value) {\n std::cout << temp << \" \" << value << \" \" << e.first.c_str() << std::endl;\n rank++;\n }\n }\n }\n\n std::cout << std::endl;\n}\n\nvoid modifiedRank(const Map& scores) {\n std::cout << \"Modified Rank\" << std::endl;\n\n std::vector<int> list;\n for (auto& elem : scores) {\n list.push_back(elem.second);\n }\n std::sort(list.begin(), list.end(), std::greater<int>{});\n list.erase(std::unique(list.begin(), list.end()), list.end());\n\n int rank = 0;\n for (auto value : list) {\n rank += std::count_if(scores.begin(), scores.end(), [value](const MapEntry& e) { return e.second == value; });\n for (auto& e : scores) {\n if (e.second == value) {\n std::cout << rank << \" \" << value << \" \" << e.first.c_str() << std::endl;\n }\n }\n }\n\n std::cout << std::endl;\n}\n\nvoid denseRank(const Map& scores) {\n std::cout << \"Dense Rank\" << std::endl;\n\n std::vector<int> list;\n for (auto& elem : scores) {\n list.push_back(elem.second);\n }\n std::sort(list.begin(), list.end(), std::greater<int>{});\n list.erase(std::unique(list.begin(), list.end()), list.end());\n\n int rank = 1;\n for (auto value : list) {\n for (auto& e : scores) {\n if (e.second == value) {\n std::cout << rank << \" \" << value << \" \" << e.first.c_str() << std::endl;\n }\n }\n rank++;\n }\n\n std::cout << std::endl;\n}\n\nvoid ordinalRank(const Map& scores) {\n std::cout << \"Ordinal Rank\" << std::endl;\n\n std::vector<int> list;\n for (auto& elem : scores) {\n list.push_back(elem.second);\n }\n std::sort(list.begin(), list.end(), std::greater<int>{});\n list.erase(std::unique(list.begin(), list.end()), list.end());\n\n int rank = 1;\n for (auto value : list) {\n for (auto& e : scores) {\n if (e.second == value) {\n std::cout << rank++ << \" \" << value << \" \" << e.first.c_str() << std::endl;\n }\n }\n }\n\n std::cout << std::endl;\n}\n\nvoid fractionalRank(const Map& scores) {\n std::cout << \"Ordinal Rank\" << std::endl;\n\n std::vector<int> list;\n for (auto& elem : scores) {\n list.push_back(elem.second);\n }\n std::sort(list.begin(), list.end(), std::greater<int>{});\n list.erase(std::unique(list.begin(), list.end()), list.end());\n\n int rank = 0;\n for (auto value : list) {\n double avg = 0.0;\n int cnt = 0;\n\n for (auto& e : scores) {\n if (e.second == value) {\n rank++;\n cnt++;\n avg += rank;\n }\n }\n avg /= cnt;\n\n for (auto& e : scores) {\n if (e.second == value) {\n std::cout << std::setprecision(1) << std::fixed << avg << \" \" << value << \" \" << e.first.c_str() << std::endl;\n }\n }\n }\n\n std::cout << std::endl;\n}\n\nint main() {\n using namespace std;\n\n map<string, int> scores{\n {\"Solomon\", 44},\n {\"Jason\", 42},\n {\"Errol\", 42},\n {\"Gary\", 41},\n {\"Bernard\", 41},\n {\"Barry\", 41},\n {\"Stephen\", 39}\n };\n\n standardRank(scores);\n modifiedRank(scores);\n denseRank(scores);\n ordinalRank(scores);\n fractionalRank(scores);\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nnamespace RankingMethods {\n class Program {\n static void Main(string[] args) {\n Dictionary<string, int> scores = new Dictionary<string, int> {\n [\"Solomon\"] = 44,\n [\"Jason\"] = 42,\n [\"Errol\"] = 42,\n [\"Gary\"] = 41,\n [\"Bernard\"] = 41,\n [\"Barry\"] = 41,\n [\"Stephen\"] = 39,\n };\n\n StandardRank(scores);\n ModifiedRank(scores);\n DenseRank(scores);\n OrdinalRank(scores);\n FractionalRank(scores);\n }\n\n static void StandardRank(Dictionary<string, int> data) {\n Console.WriteLine(\"Standard Rank\");\n\n var list = data.Values.Distinct().ToList();\n list.Sort((a, b) => b.CompareTo(a));\n\n int rank = 1;\n foreach (var value in list) {\n int temp = rank;\n foreach (var k in data.Keys) {\n if (data[k] == value) {\n Console.WriteLine(\"{0} {1} {2}\", temp, value, k);\n rank++;\n }\n }\n }\n\n Console.WriteLine();\n }\n\n static void ModifiedRank(Dictionary<string, int> data) {\n Console.WriteLine(\"Modified Rank\");\n\n var list = data.Values.Distinct().ToList();\n list.Sort((a, b) => b.CompareTo(a));\n\n int rank = 0;\n foreach (var value in list) {\n foreach (var k in data.Keys) {\n if (data[k] == value) {\n rank++;\n }\n }\n\n foreach (var k in data.Keys) {\n if (data[k] == value) {\n Console.WriteLine(\"{0} {1} {2}\", rank, data[k], k);\n }\n }\n }\n\n Console.WriteLine();\n }\n\n static void DenseRank(Dictionary<string, int> data) {\n Console.WriteLine(\"Dense Rank\");\n\n var list = data.Values.Distinct().ToList();\n list.Sort((a, b) => b.CompareTo(a));\n\n int rank = 1;\n foreach (var value in list) {\n foreach (var k in data.Keys) {\n if (data[k] == value) {\n Console.WriteLine(\"{0} {1} {2}\", rank, data[k], k);\n }\n }\n rank++;\n }\n\n Console.WriteLine();\n }\n\n static void OrdinalRank(Dictionary<string, int> data) {\n Console.WriteLine(\"Ordinal Rank\");\n\n var list = data.Values.Distinct().ToList();\n list.Sort((a, b) => b.CompareTo(a));\n\n int rank = 1;\n foreach (var value in list) {\n foreach (var k in data.Keys) {\n if (data[k] == value) {\n Console.WriteLine(\"{0} {1} {2}\", rank, data[k], k);\n rank++;\n }\n }\n }\n\n Console.WriteLine();\n }\n\n static void FractionalRank(Dictionary<string, int> data) {\n Console.WriteLine(\"Fractional Rank\");\n\n var list = data.Values.Distinct().ToList();\n list.Sort((a, b) => b.CompareTo(a));\n\n int rank = 0;\n foreach (var value in list) {\n double avg = 0;\n int cnt = 0;\n\n foreach (var k in data.Keys) {\n if (data[k] == value) {\n rank++;\n cnt++;\n avg += rank;\n }\n }\n avg /= cnt;\n\n foreach (var k in data.Keys) {\n if (data[k] == value) {\n Console.WriteLine(\"{0:F1} {1} {2}\", avg, data[k], k);\n }\n }\n }\n\n Console.WriteLine();\n }\n }\n}\n","language":"C-sharp"},{"code":"include \"cowgol.coh\";\n\n# List of competitors\nrecord Competitor is\n score: uint8;\n name: [uint8];\nend record;\n\nvar cs: Competitor[] := {\n {44, \"Solomon\"},\n {42, \"Jason\"},\n {42, \"Errol\"},\n {41, \"Garry\"},\n {41, \"Bernard\"},\n {41, \"Barry\"},\n {39, \"Stephen\"}\n};\n\n# Rank competitors given ranking method\ninterface Ranking(c: [Competitor],\n n: intptr,\n len: intptr,\n last: uint16): (rank: uint16);\nsub Rank(cs: [Competitor], num: intptr, r: Ranking) is\n var last: uint16 := 0;\n var idx: intptr := 0;\n\n while idx < num loop\n last := r(cs, idx, num, last);\n if last < 100 then\n print_i16(last);\n else\n # print fixed-point rank nicely\n print_i16(last / 100);\n print_char('.');\n print_i16((last % 100) / 10);\n print_i16(last % 10);\n end if;\n print(\". \");\n print_i8(cs.score);\n print(\", \");\n print(cs.name);\n print_nl();\n idx := idx + 1;\n cs := @next cs;\n end loop;\nend sub;\n\n# Standard ranking\nvar stdcount: uint16 := 0;\nsub Standard implements Ranking is\n if n==0 then stdcount := 0; end if;\n stdcount := stdcount + 1;\n if n>0 and c.score == [@prev c].score then\n rank := last;\n else\n rank := stdcount;\n end if;\nend sub;\n\n# Modified ranking\nsub Modified implements Ranking is\n rank := last;\n if n == 0 or c.score != [@prev c].score then\n while n < len loop\n rank := rank + 1;\n c := @next c;\n if c.score != [@prev c].score then\n break;\n end if;\n n := n + 1;\n end loop;\n end if;\nend sub;\n\n# Dense ranking\nsub Dense implements Ranking is\n if n>0 and c.score == [@prev c].score then\n rank := last;\n else\n rank := last + 1;\n end if;\nend sub;\n\n# Ordinal ranking\nsub Ordinal implements Ranking is\n rank := last + 1;\nend sub;\n\n# Fractional ranking (with fixed point arithmetic)\nsub Fractional implements Ranking is\n rank := last;\n if n==0 or c.score != [@prev c].score then\n var sum: uint16 := 0;\n var ct: uint16 := 0;\n while n < len loop\n sum := sum + (n as uint16 + 1);\n ct := ct + 1;\n c := @next c;\n if c.score != [@prev c].score then\n break;\n end if;\n n := n + 1;\n end loop;\n rank := (sum * 100) / (ct as uint16);\n end if;\nend sub;\n\nrecord Method is\n name: [uint8];\n method: Ranking;\nend record;\n\nvar methods: Method[] := {\n {\"Standard\", Standard},\n {\"Modified\", Modified},\n {\"Dense\", Dense},\n {\"Ordinal\", Ordinal},\n {\"Fractional\", Fractional}\n};\n\nvar n: @indexof methods := 0;\nwhile n < @sizeof methods loop\n print(\"--- \");\n print(methods[n].name);\n print(\" ---\\n\");\n Rank(&cs[0], @sizeof cs, methods[n].method);\n print_nl();\n n := n + 1;\nend loop;\n","language":"Cowgol"},{"code":"import std.algorithm;\nimport std.stdio;\n\nvoid main() {\n immutable scores = [\n \"Solomon\": 44,\n \"Jason\": 42,\n \"Errol\": 42,\n \"Garry\": 41,\n \"Bernard\": 41,\n \"Barry\": 41,\n \"Stephen\": 39\n ];\n\n scores.standardRank;\n scores.modifiedRank;\n scores.denseRank;\n scores.ordinalRank;\n scores.fractionalRank;\n}\n\n/*\nStandard ranking\n1 44 Solomon\n2 42 Jason\n2 42 Errol\n4 41 Garry\n4 41 Bernard\n4 41 Barry\n7 39 Stephen\n*/\nvoid standardRank(const int[string] data) {\n writeln(\"Standard Rank\");\n\n int rank = 1;\n foreach (value; data.values.dup.sort!\"a>b\".uniq) {\n int temp = rank;\n foreach(k,v; data) {\n if (v==value) {\n writeln(temp, \" \", v, \" \", k);\n rank++;\n }\n }\n }\n\n writeln;\n}\n\n/*\nModified ranking\n1 44 Solomon\n3 42 Jason\n3 42 Errol\n6 41 Garry\n6 41 Bernard\n6 41 Barry\n7 39 Stephen\n*/\nvoid modifiedRank(const int[string] data) {\n writeln(\"Modified Rank\");\n\n int rank = 0;\n foreach (value; data.values.dup.sort!\"a>b\".uniq) {\n foreach(k,v; data) {\n if (v==value) {\n rank++;\n }\n }\n foreach(k,v; data) {\n if (v==value) {\n writeln(rank, \" \", v, \" \", k);\n }\n }\n }\n\n writeln;\n}\n\n/*\nDense ranking\n1 44 Solomon\n2 42 Jason\n2 42 Errol\n3 41 Garry\n3 41 Bernard\n3 41 Barry\n4 39 Stephen\n*/\nvoid denseRank(const int[string] data) {\n writeln(\"Dense Rank\");\n\n int rank = 1;\n foreach (value; data.values.dup.sort!\"a>b\".uniq) {\n foreach(k,v; data) {\n if (v==value) {\n writeln(rank, \" \", v, \" \", k);\n }\n }\n rank++;\n }\n\n writeln;\n}\n\n/*\nOrdinal ranking\n1 44 Solomon\n2 42 Jason\n3 42 Errol\n4 41 Garry\n5 41 Bernard\n6 41 Barry\n7 39 Stephen\n*/\nvoid ordinalRank(const int[string] data) {\n writeln(\"Ordinal Rank\");\n\n int rank = 1;\n foreach (value; data.values.dup.sort!\"a>b\".uniq) {\n foreach(k,v; data) {\n if (v==value) {\n writeln(rank, \" \", v, \" \", k);\n rank++;\n }\n }\n }\n\n writeln;\n}\n\n/*\nFractional ranking\n1,0 44 Solomon\n2,5 42 Jason\n2,5 42 Errol\n5,0 41 Garry\n5,0 41 Bernard\n5,0 41 Barry\n7,0 39 Stephen\n*/\nvoid fractionalRank(const int[string] data) {\n writeln(\"Fractional Rank\");\n\n int rank = 0;\n foreach (value; data.values.dup.sort!\"a>b\".uniq) {\n real avg = 0;\n int cnt;\n\n foreach(k,v; data) {\n if (v==value) {\n rank++;\n cnt++;\n avg+=rank;\n }\n }\n avg /= cnt;\n\n foreach(k,v; data) {\n if (v==value) {\n writef(\"%0.1f \", avg);\n writeln(v, \" \", k);\n }\n }\n }\n\n writeln;\n}\n","language":"D"},{"code":"defmodule Ranking do\n def methods(data) do\n IO.puts \"stand.\\tmod.\\tdense\\tord.\\tfract.\"\n Enum.group_by(data, fn {score,_name} -> score end)\n |> Enum.map(fn {score,pairs} ->\n names = Enum.map(pairs, fn {_,name} -> name end) |> Enum.reverse\n {score, names}\n end)\n |> Enum.sort_by(fn {score,_} -> -score end)\n |> Enum.with_index\n |> Enum.reduce({1,0,0}, fn {{score, names}, i}, {s_rnk, m_rnk, o_rnk} ->\n d_rnk = i + 1\n m_rnk = m_rnk + length(names)\n f_rnk = ((s_rnk + m_rnk) / 2) |> to_string |> String.replace(\".0\",\"\")\n o_rnk = Enum.reduce(names, o_rnk, fn name,acc ->\n IO.puts \"#{s_rnk}\\t#{m_rnk}\\t#{d_rnk}\\t#{acc+1}\\t#{f_rnk}\\t#{score} #{name}\"\n acc + 1\n end)\n {s_rnk+length(names), m_rnk, o_rnk}\n end)\n end\nend\n\n~w\"44 Solomon\n 42 Jason\n 42 Errol\n 41 Garry\n 41 Bernard\n 41 Barry\n 39 Stephen\"\n|> Enum.chunk(2)\n|> Enum.map(fn [score,name] -> {String.to_integer(score),name} end)\n|> Ranking.methods\n","language":"Elixir"},{"code":"USING: arrays assocs formatting fry generalizations io kernel\nmath math.ranges math.statistics math.vectors sequences\nsplitting.monotonic ;\nIN: rosetta-code.ranking\n\nCONSTANT: ranks {\n { 44 \"Solomon\" } { 42 \"Jason\" } { 42 \"Errol\" }\n { 41 \"Garry\" } { 41 \"Bernard\" } { 41 \"Barry\" }\n { 39 \"Stephen\" }\n}\n\n: rank ( seq quot -- seq' )\n '[ [ = ] monotonic-split [ length ] map dup @ [ <array> ]\n 2map concat ] call ; inline\n\n: standard ( seq -- seq' ) [ cum-sum0 1 v+n ] rank ;\n: modified ( seq -- seq' ) [ cum-sum ] rank ;\n: dense ( seq -- seq' ) [ length [1,b] ] rank ;\n: ordinal ( seq -- seq' ) length [1,b] ;\n\n: fractional ( seq -- seq' )\n [ dup cum-sum swap [ dupd - [a,b) mean ] 2map ] rank ;\n\n: .rank ( quot -- )\n [ ranks dup keys ] dip call swap\n [ first2 \"%5u %d %s\\n\" printf ] 2each ; inline\n\n: ranking-demo ( -- )\n \"Standard ranking\" [ standard ]\n \"Modified ranking\" [ modified ]\n \"Dense ranking\" [ dense ]\n \"Ordinal ranking\" [ ordinal ]\n \"Fractional ranking\" [ fractional ]\n [ [ print ] [ .rank nl ] bi* ] 2 5 mnapply ;\n\nMAIN: ranking-demo\n","language":"Factor"},{"code":"Data 44,\"Solomon\", 42,\"Jason\", 42,\"Errol\", 41,\"Garry\"\nData 41,\"Bernard\", 41,\"Barry\", 39,\"Stephen\"\n\nDim Shared As Integer n = 7\nDim Shared As Integer puntos(n), i\nDim Shared As Single ptosnom(n)\nDim Shared As String nombre(n)\n\nPrint \"Puntuaciones a clasificar (mejores primero):\"\nFor i = 1 To n\n Read puntos(i), nombre(i)\n Print Using \" ##, \\ \\\"; puntos(i); nombre(i)\nNext i\nPrint\n\nSub MostarTabla\n For i = 1 To n\n Print Using \" \\ \\ ##, \\ \\\"; Str(ptosnom(i)); puntos(i); nombre(i)\n Next i\n Print\nEnd Sub\n\nPrint \"--- Standard ranking ---\"\nptosnom(1) = 1\nFor i = 2 To n\n If puntos(i) = puntos(i-1) Then ptosnom(i) = ptosnom(i-1) Else ptosnom(i) = i\nNext i\nMostarTabla\n\n\nPrint \"--- Modified ranking ---\"\nptosnom(n) = n\nFor i = n-1 To 1 Step -1\n If puntos(i) = puntos(i+1) Then ptosnom(i) = ptosnom(i+1) Else ptosnom(i) = i\nNext i\nMostarTabla\n\nPrint \"--- Dense ranking ---\"\nptosnom(1) = 1\nFor i = 2 To n\n ptosnom(i) = ptosnom(i-1) - (puntos(i) <> puntos(i-1))\nNext i\nMostarTabla\n\nPrint \"--- Ordinal ranking ---\"\nFor i = 1 To n\n ptosnom(i) = i\nNext i\nMostarTabla\n\nPrint \"--- Fractional ranking ---\"\ni = 1\nDim As Integer j = 2\nDo\n If j <= n Then If (puntos(j-1) = puntos(j)) Then j += 1\n For k As Integer = i To j-1\n ptosnom(k) = (i+j-1) / 2\n Next k\n i = j\n j += 1\nLoop While i <= n\nMostarTabla\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n\t\"fmt\"\n\t\"sort\"\n)\n\ntype rankable interface {\n\tLen() int\n\tRankEqual(int, int) bool\n}\n\nfunc StandardRank(d rankable) []float64 {\n\tr := make([]float64, d.Len())\n\tvar k int\n\tfor i := range r {\n\t\tif i == 0 || !d.RankEqual(i, i-1) {\n\t\t\tk = i + 1\n\t\t}\n\t\tr[i] = float64(k)\n\t}\n\treturn r\n}\n\nfunc ModifiedRank(d rankable) []float64 {\n\tr := make([]float64, d.Len())\n\tfor i := range r {\n\t\tk := i + 1\n\t\tfor j := i + 1; j < len(r) && d.RankEqual(i, j); j++ {\n\t\t\tk = j + 1\n\t\t}\n\t\tr[i] = float64(k)\n\t}\n\treturn r\n}\n\nfunc DenseRank(d rankable) []float64 {\n\tr := make([]float64, d.Len())\n\tvar k int\n\tfor i := range r {\n\t\tif i == 0 || !d.RankEqual(i, i-1) {\n\t\t\tk++\n\t\t}\n\t\tr[i] = float64(k)\n\t}\n\treturn r\n}\n\nfunc OrdinalRank(d rankable) []float64 {\n\tr := make([]float64, d.Len())\n\tfor i := range r {\n\t\tr[i] = float64(i + 1)\n\t}\n\treturn r\n}\n\nfunc FractionalRank(d rankable) []float64 {\n\tr := make([]float64, d.Len())\n\tfor i := 0; i < len(r); {\n\t\tvar j int\n\t\tf := float64(i + 1)\n\t\tfor j = i + 1; j < len(r) && d.RankEqual(i, j); j++ {\n\t\t\tf += float64(j + 1)\n\t\t}\n\t\tf /= float64(j - i)\n\t\tfor ; i < j; i++ {\n\t\t\tr[i] = f\n\t\t}\n\t}\n\treturn r\n}\n\ntype scores []struct {\n\tscore int\n\tname string\n}\n\nfunc (s scores) Len() int { return len(s) }\nfunc (s scores) RankEqual(i, j int) bool { return s[i].score == s[j].score }\nfunc (s scores) Swap(i, j int) { s[i], s[j] = s[j], s[i] }\nfunc (s scores) Less(i, j int) bool {\n\tif s[i].score != s[j].score {\n\t\treturn s[i].score > s[j].score\n\t}\n\treturn s[i].name < s[j].name\n}\n\nvar data = scores{\n\t{44, \"Solomon\"},\n\t{42, \"Jason\"},\n\t{42, \"Errol\"},\n\t{41, \"Garry\"},\n\t{41, \"Bernard\"},\n\t{41, \"Barry\"},\n\t{39, \"Stephen\"},\n}\n\nfunc main() {\n\tshow := func(name string, fn func(rankable) []float64) {\n\t\tfmt.Println(name, \"Ranking:\")\n\t\tr := fn(data)\n\t\tfor i, d := range data {\n\t\t\tfmt.Printf(\"%4v - %2d %s\\n\", r[i], d.score, d.name)\n\t\t}\n\t}\n\n\tsort.Sort(data)\n\tshow(\"Standard\", StandardRank)\n\tshow(\"\\nModified\", ModifiedRank)\n\tshow(\"\\nDense\", DenseRank)\n\tshow(\"\\nOrdinal\", OrdinalRank)\n\tshow(\"\\nFractional\", FractionalRank)\n}\n","language":"Go"},{"code":"import Data.List (groupBy, sortBy, intercalate)\n\ntype Item = (Int, String)\n\ntype ItemList = [Item]\n\ntype ItemGroups = [ItemList]\n\ntype RankItem a = (a, Int, String)\n\ntype RankItemList a = [RankItem a]\n\n-- make sure the input is ordered and grouped by score\nprepare :: ItemList -> ItemGroups\nprepare = groupBy gf . sortBy (flip compare)\n where\n gf (a, _) (b, _) = a == b\n\n-- give an item a rank\nrank\n :: Num a\n => a -> Item -> RankItem a\nrank n (a, b) = (n, a, b)\n\n-- ranking methods\nstandard, modified, dense, ordinal :: ItemGroups -> RankItemList Int\nstandard = ms 1\n where\n ms _ [] = []\n ms n (x:xs) = (rank n <$> x) ++ ms (n + length x) xs\n\nmodified = md 1\n where\n md _ [] = []\n md n (x:xs) =\n let l = length x\n nl = n + l\n nl1 = nl - 1\n in (rank nl1 <$> x) ++ md (n + l) xs\n\ndense = md 1\n where\n md _ [] = []\n md n (x:xs) = map (rank n) x ++ md (n + 1) xs\n\nordinal = zipWith rank [1 ..] . concat\n\nfractional :: ItemGroups -> RankItemList Double\nfractional = mf 1.0\n where\n mf _ [] = []\n mf n (x:xs) =\n let l = length x\n o = take l [n ..]\n ld = fromIntegral l\n a = sum o / ld\n in map (rank a) x ++ mf (n + ld) xs\n\n-- sample data\ntest :: ItemGroups\ntest =\n prepare\n [ (44, \"Solomon\")\n , (42, \"Jason\")\n , (42, \"Errol\")\n , (41, \"Garry\")\n , (41, \"Bernard\")\n , (41, \"Barry\")\n , (39, \"Stephen\")\n ]\n\n-- print rank items nicely\nnicePrint\n :: Show a\n => String -> RankItemList a -> IO ()\nnicePrint xs items = do\n putStrLn xs\n mapM_ np items\n putStr \"\\n\"\n where\n np (a, b, c) = putStrLn $ intercalate \"\\t\" [show a, show b, c]\n\nmain :: IO ()\nmain = do\n nicePrint \"Standard:\" $ standard test\n nicePrint \"Modified:\" $ modified test\n nicePrint \"Dense:\" $ dense test\n nicePrint \"Ordinal:\" $ ordinal test\n nicePrint \"Fractional:\" $ fractional test\n","language":"Haskell"},{"code":"competitors=:<;._1;._2]0 :0\n 44 Solomon\n 42 Jason\n 42 Errol\n 41 Garry\n 41 Bernard\n 41 Barry\n 39 Stephen\n)\n\nscores=: {.\"1\n\nstandard=: 1+i.~\nmodified=: 1+i:~\ndense=: #/.~ # #\\@~.\nordinal=: #\\\nfractional=: #/.~ # ] (+/%#)/. #\\\n\nrank=:1 :'<\"0@u@:scores,.]'\n","language":"J"},{"code":" standard rank competitors\n┌─┬──┬───────┐\n│1│44│Solomon│\n├─┼──┼───────┤\n│2│42│Jason │\n├─┼──┼───────┤\n│2│42│Errol │\n├─┼──┼───────┤\n│4│41│Garry │\n├─┼──┼───────┤\n│4│41│Bernard│\n├─┼──┼───────┤\n│4│41│Barry │\n├─┼──┼───────┤\n│7│39│Stephen│\n└─┴──┴───────┘\n modified rank competitors\n┌─┬──┬───────┐\n│1│44│Solomon│\n├─┼──┼───────┤\n│3│42│Jason │\n├─┼──┼───────┤\n│3│42│Errol │\n├─┼──┼───────┤\n│6│41│Garry │\n├─┼──┼───────┤\n│6│41│Bernard│\n├─┼──┼───────┤\n│6│41│Barry │\n├─┼──┼───────┤\n│7│39│Stephen│\n└─┴──┴───────┘\n dense rank competitors\n┌─┬──┬───────┐\n│1│44│Solomon│\n├─┼──┼───────┤\n│2│42│Jason │\n├─┼──┼───────┤\n│2│42│Errol │\n├─┼──┼───────┤\n│3│41│Garry │\n├─┼──┼───────┤\n│3│41│Bernard│\n├─┼──┼───────┤\n│3│41│Barry │\n├─┼──┼───────┤\n│4│39│Stephen│\n└─┴──┴───────┘\n ordinal rank competitors\n┌─┬──┬───────┐\n│1│44│Solomon│\n├─┼──┼───────┤\n│2│42│Jason │\n├─┼──┼───────┤\n│3│42│Errol │\n├─┼──┼───────┤\n│4│41│Garry │\n├─┼──┼───────┤\n│5│41│Bernard│\n├─┼──┼───────┤\n│6│41│Barry │\n├─┼──┼───────┤\n│7│39│Stephen│\n└─┴──┴───────┘\n fractional rank competitors\n┌───┬──┬───────┐\n│1 │44│Solomon│\n├───┼──┼───────┤\n│2.5│42│Jason │\n├───┼──┼───────┤\n│2.5│42│Errol │\n├───┼──┼───────┤\n│5 │41│Garry │\n├───┼──┼───────┤\n│5 │41│Bernard│\n├───┼──┼───────┤\n│5 │41│Barry │\n├───┼──┼───────┤\n│7 │39│Stephen│\n└───┴──┴───────┘\n","language":"J"},{"code":"import java.util.*;\n\npublic class RankingMethods {\n\n final static String[] input = {\"44 Solomon\", \"42 Jason\", \"42 Errol\",\n \"41 Garry\", \"41 Bernard\", \"41 Barry\", \"39 Stephen\"};\n\n public static void main(String[] args) {\n int len = input.length;\n\n Map<String, int[]> map = new TreeMap<>((a, b) -> b.compareTo(a));\n for (int i = 0; i < len; i++) {\n String key = input[i].split(\"\\\\s+\")[0];\n int[] arr;\n if ((arr = map.get(key)) == null)\n arr = new int[]{i, 0};\n arr[1]++;\n map.put(key, arr);\n }\n int[][] groups = map.values().toArray(new int[map.size()][]);\n\n standardRanking(len, groups);\n modifiedRanking(len, groups);\n denseRanking(len, groups);\n ordinalRanking(len);\n fractionalRanking(len, groups);\n }\n\n private static void standardRanking(int len, int[][] groups) {\n System.out.println(\"\\nStandard ranking\");\n for (int i = 0, rank = 0, group = 0; i < len; i++) {\n if (group < groups.length && i == groups[group][0]) {\n rank = i + 1;\n group++;\n }\n System.out.printf(\"%d %s%n\", rank, input[i]);\n }\n }\n\n private static void modifiedRanking(int len, int[][] groups) {\n System.out.println(\"\\nModified ranking\");\n for (int i = 0, rank = 0, group = 0; i < len; i++) {\n if (group < groups.length && i == groups[group][0])\n rank += groups[group++][1];\n System.out.printf(\"%d %s%n\", rank, input[i]);\n }\n }\n\n private static void denseRanking(int len, int[][] groups) {\n System.out.println(\"\\nDense ranking\");\n for (int i = 0, rank = 0; i < len; i++) {\n if (rank < groups.length && i == groups[rank][0])\n rank++;\n System.out.printf(\"%d %s%n\", rank, input[i]);\n }\n }\n\n private static void ordinalRanking(int len) {\n System.out.println(\"\\nOrdinal ranking\");\n for (int i = 0; i < len; i++)\n System.out.printf(\"%d %s%n\", i + 1, input[i]);\n }\n\n private static void fractionalRanking(int len, int[][] groups) {\n System.out.println(\"\\nFractional ranking\");\n float rank = 0;\n for (int i = 0, tmp = 0, group = 0; i < len; i++) {\n if (group < groups.length && i == groups[group][0]) {\n tmp += groups[group++][1];\n rank = (i + 1 + tmp) / 2.0F;\n }\n System.out.printf(\"%2.1f %s%n\", rank, input[i]);\n }\n }\n}\n","language":"Java"},{"code":"(function () {\n\n var xs = 'Solomon Jason Errol Garry Bernard Barry Stephen'.split(' '),\n ns = [44, 42, 42, 41, 41, 41, 39],\n\n sorted = xs.map(function (x, i) {\n return { name: x, score: ns[i] };\n }).sort(function (a, b) {\n var c = b.score - a.score;\n return c ? c : a.name < b.name ? -1 : a.name > b.name ? 1 : 0;\n }),\n\n names = sorted.map(function (x) { return x.name; }),\n scores = sorted.map(function (x) { return x.score; }),\n\n reversed = scores.slice(0).reverse(),\n unique = scores.filter(function (x, i) {\n return scores.indexOf(x) === i;\n });\n\n // RANKINGS AS FUNCTIONS OF SCORES: SORTED, REVERSED AND UNIQUE\n\n var rankings = function (score, index) {\n return {\n name: names[index],\n score: score,\n\n Ordinal: index + 1,\n\n Standard: function (n) {\n return scores.indexOf(n) + 1;\n }(score),\n\n Modified: function (n) {\n return reversed.length - reversed.indexOf(n);\n }(score),\n\n Dense: function (n) {\n return unique.indexOf(n) + 1;\n }(score),\n\n Fractional: function (n) {\n return (\n (scores.indexOf(n) + 1) +\n (reversed.length - reversed.indexOf(n))\n ) / 2;\n }(score)\n };\n },\n\n tbl = [\n 'Name Score Standard Modified Dense Ordinal Fractional'.split(' ')\n ].concat(scores.map(rankings).reduce(function (a, x) {\n return a.concat([\n [x.name, x.score,\n x.Standard, x.Modified, x.Dense, x.Ordinal, x.Fractional\n ]\n ]);\n }, [])),\n\n //[[a]] -> bool -> s -> s\n wikiTable = function (lstRows, blnHeaderRow, strStyle) {\n return '{| class=\"wikitable\" ' + (\n strStyle ? 'style=\"' + strStyle + '\"' : ''\n ) + lstRows.map(function (lstRow, iRow) {\n var strDelim = ((blnHeaderRow && !iRow) ? '!' : '|');\n\n return '\\n|-\\n' + strDelim + ' ' + lstRow.map(function (v) {\n return typeof v === 'undefined' ? ' ' : v;\n }).join(' ' + strDelim + strDelim + ' ');\n }).join('') + '\\n|}';\n };\n\n return wikiTable(tbl, true, 'text-align:center');\n\n})();\n","language":"JavaScript"},{"code":"((() => {\n const xs = 'Solomon Jason Errol Garry Bernard Barry Stephen'.split(' '),\n ns = [44, 42, 42, 41, 41, 41, 39];\n\n const sorted = xs.map((x, i) => ({\n name: x,\n score: ns[i]\n }))\n .sort((a, b) => {\n const c = b.score - a.score;\n return c ? c : a.name < b.name ? -1 : a.name > b.name ? 1 : 0;\n });\n\n const names = sorted.map(x => x.name),\n scores = sorted.map(x => x.score),\n reversed = scores.slice(0)\n .reverse(),\n unique = scores.filter((x, i) => scores.indexOf(x) === i);\n\n // RANKINGS AS FUNCTIONS OF SCORES: SORTED, REVERSED AND UNIQUE\n\n // rankings :: Int -> Int -> Dictonary\n const rankings = (score, index) => ({\n name: names[index],\n score,\n Ordinal: index + 1,\n Standard: scores.indexOf(score) + 1,\n Modified: reversed.length - reversed.indexOf(score),\n Dense: unique.indexOf(score) + 1,\n\n Fractional: (n => (\n (scores.indexOf(n) + 1) +\n (reversed.length - reversed.indexOf(n))\n ) / 2)(score)\n });\n\n // tbl :: [[[a]]]\n const tbl = [\n 'Name Score Standard Modified Dense Ordinal Fractional'.split(' ')\n ].concat(scores.map(rankings)\n .reduce((a, x) => a.concat([\n [x.name, x.score,\n x.Standard, x.Modified, x.Dense, x.Ordinal, x.Fractional\n ]\n ]), []));\n\n // wikiTable :: [[[a]]] -> Bool -> String -> String\n const wikiTable = (lstRows, blnHeaderRow, strStyle) =>\n `{| class=\"wikitable\" ${strStyle ? 'style=\"' + strStyle + '\"' : ''}\n ${lstRows.map((lstRow, iRow) => {\n const strDelim = ((blnHeaderRow && !iRow) ? '!' : '|');\n\n return '\\n|-\\n' + strDelim + ' ' + lstRow\n .map(v => typeof v === 'undefined' ? ' ' : v)\n .join(' ' + strDelim + strDelim + ' ');\n }).join('')}\\n|}`;\n\n return wikiTable(tbl, true, 'text-align:center');\n}))();\n","language":"JavaScript"},{"code":"# Ties share what would have been their first ordinal number\ndef standard_ranking:\n . as $raw\n | ([range(1;length;2) | $raw[.]]) as $scores\n | reduce range(1; $scores|length) as $i\n ([1]; if $scores[$i - 1] == $scores[$i] then . + [.[-1]]\n else . + [$i + 1]\n end) ;\n\ndef modified_ranking:\n # The helper function resolves [ranks, tentative]\n # by appending the ranks of the ties to \"ranks\"\n def resolve:\n (.[1] | length) as $length\n | if $length == 0 then .[0]\n else .[1][-1] as $max\n | .[0] + ( .[1] | map( $max) )\n end ;\n . as $raw\n | ([range(1;length;2) | $raw[.]]) as $scores\n | reduce range(1; $scores|length) as $i\n # state: [ranks, tentative]\n ([ [], [1] ];\n if $scores[$i - 1] == $scores[$i] then [.[0], .[1] + [ $i + 1 ]]\n else [ resolve, [ $i + 1 ] ]\n end )\n | resolve ;\n\ndef dense_ranking: # next available\n . as $raw\n | ([range(1;length;2) | $raw[.]]) as $scores\n | reduce range(1; $scores|length) as $i\n ([1]; if $scores[$i - 1] == $scores[$i] then . + [.[-1]]\n else . + [ .[-1] + 1]\n end );\n\ndef ordinal_ranking: # unfair to some!\n [ range(1; 1 + length/2) ] ;\n\ndef fractional_ranking:\n # The helper function resolves [ranks, tentative]\n # by appending the averages of the tentative ranks to \"ranks\"\n def resolve:\n (.[1] | length) as $length\n | if $length == 0 then .[0]\n else (.[1] | add / $length) as $avg\n | .[0] + ( .[1] | map( $avg) )\n end ;\n . as $raw\n | ([range(1;length;2) | $raw[.]]) as $scores\n | reduce range(1; $scores|length) as $i\n # state: [ranks, tentative]\n ([ [], [1] ];\n if $scores[$i - 1] == $scores[$i] then [.[0], .[1] + [ $i + 1 ]]\n else [ resolve, [ $i + 1 ] ]\n end )\n | resolve ;\n","language":"Jq"},{"code":"def raw:\n [\n \"Solomon\", 44,\n \"Jason\" , 42,\n \"Errol\" , 42,\n \"Garry\" , 41,\n \"Bernard\", 41,\n \"Barry\" , 41,\n \"Stephen\", 39\n] ;\n\ndef task:\n \"standard: \\( raw | standard_ranking)\",\n \"modified: \\( raw | modified_ranking)\",\n \"dense: \\( raw | dense_ranking)\",\n \"ordinal: \\( raw | ordinal_ranking)\",\n \"fractional: \\( raw | fractional_ranking)\" ;\n\ntask\n","language":"Jq"},{"code":"function ties{T<:Real}(a::Array{T,1})\n unique(a[2:end][a[2:end] .== a[1:end-1]])\nend\n","language":"Julia"},{"code":"function rankstandard{T<:Real}(a::Array{T,1})\n r = collect(1:length(a))\n 1 < r[end] || return r\n for i in ties(a)\n r[a.==i] = r[a.==i][1]\n end\n return r\nend\n","language":"Julia"},{"code":"function rankmodified{T<:Real}(a::Array{T,1})\n indexin(a, a)\nend\n","language":"Julia"},{"code":"function rankdense{T<:Real}(a::Array{T,1})\n indexin(a, unique(a))\nend\n","language":"Julia"},{"code":"function rankordinal{T<:Real}(a::Array{T,1})\n collect(1:length(a))\nend\n","language":"Julia"},{"code":"function rankfractional{T<:Real}(a::Array{T,1})\n r = float64(collect(1:length(a)))\n 1.0 < r[end] || return r\n for i in ties(a)\n r[a.==i] = mean(r[a.==i])\n end\n return r\nend\n","language":"Julia"},{"code":"scores = [44, 42, 42, 41, 41, 41, 39]\nnames = [\"Solomon\", \"Jason\", \"Errol\", \"Garry\",\n \"Bernard\", \"Barry\", \"Stephen\"]\n\nsrank = rankstandard(scores)\nmrank = rankmodified(scores)\ndrank = rankdense(scores)\norank = rankordinal(scores)\nfrank = rankfractional(scores)\n\nprintln(\" Name Score Std Mod Den Ord Frac\")\nfor i in 1:length(scores)\n print(@sprintf(\" %-7s\", names[i]))\n print(@sprintf(\"%5d \", scores[i]))\n print(@sprintf(\"%5d\", srank[i]))\n print(@sprintf(\"%5d\", mrank[i]))\n print(@sprintf(\"%5d\", drank[i]))\n print(@sprintf(\"%5d\", orank[i]))\n print(@sprintf(\"%7.2f\", frank[i]))\n println()\nend\n","language":"Julia"},{"code":"// version 1.0.6\n\n/* all ranking functions assume the array of Pairs is non-empty and already sorted by decreasing order of scores\n and then, if the scores are equal, by reverse alphabetic order of names\n*/\n\nfun standardRanking(scores: Array<Pair<Int, String>>): IntArray {\n val rankings = IntArray(scores.size)\n rankings[0] = 1\n for (i in 1 until scores.size) rankings[i] = if (scores[i].first == scores[i - 1].first) rankings[i - 1] else i + 1\n return rankings\n}\n\nfun modifiedRanking(scores: Array<Pair<Int, String>>): IntArray {\n val rankings = IntArray(scores.size)\n rankings[0] = 1\n for (i in 1 until scores.size) {\n rankings[i] = i + 1\n val currScore = scores[i].first\n for (j in i - 1 downTo 0) {\n if (currScore != scores[j].first) break\n rankings[j] = i + 1\n }\n }\n return rankings\n}\n\nfun denseRanking(scores: Array<Pair<Int, String>>): IntArray {\n val rankings = IntArray(scores.size)\n rankings[0] = 1\n var prevRanking = 1\n for (i in 1 until scores.size) rankings[i] = if (scores[i].first == scores[i - 1].first) prevRanking else ++prevRanking\n return rankings\n}\n\nfun ordinalRanking(scores: Array<Pair<Int, String>>) = IntArray(scores.size) { it + 1 }\n\nfun fractionalRanking(scores: Array<Pair<Int, String>>): DoubleArray {\n val rankings = DoubleArray(scores.size)\n rankings[0] = 1.0\n for (i in 1 until scores.size) {\n var k = i\n val currScore = scores[i].first\n for (j in i - 1 downTo 0) {\n if (currScore != scores[j].first) break\n k = j\n }\n val avg = (k..i).average() + 1.0\n for (m in k..i) rankings[m] = avg\n }\n return rankings\n}\n\nfun printRankings(title: String, rankings: IntArray, scores: Array<Pair<Int, String>>) {\n println(title + \":\")\n for (i in 0 until rankings.size) {\n print (\"${rankings[i]} \")\n println(scores[i].toString().removeSurrounding(\"(\", \")\").replace(\",\", \"\"))\n }\n println()\n}\n\nfun printFractionalRankings(title: String, rankings: DoubleArray, scores: Array<Pair<Int, String>>) {\n println(title + \":\")\n for (i in 0 until rankings.size) {\n print (\"${\"%3.2f\".format(rankings[i])} \")\n println(scores[i].toString().removeSurrounding(\"(\", \")\").replace(\",\", \"\"))\n }\n println()\n}\n\nfun main(args: Array<String>) {\n val scores = arrayOf(44 to \"Solomon\", 42 to \"Jason\", 42 to \"Errol\", 41 to \"Garry\",\n 41 to \"Bernard\", 41 to \"Barry\", 39 to \"Stephen\")\n printRankings(\"Standard ranking\", standardRanking(scores), scores)\n printRankings(\"Modified ranking\", modifiedRanking(scores), scores)\n printRankings(\"Dense ranking\", denseRanking(scores), scores)\n printRankings(\"Ordinal ranking\", ordinalRanking(scores), scores)\n printFractionalRankings(\"Fractional ranking\", fractionalRanking(scores), scores)\n}\n","language":"Kotlin"},{"code":"#!/bin/ksh\nexec 2> /tmp/Ranking_methods.err\n# Ranking methods\n#\n#\t# Standard. (Ties share what would have been their first ordinal number).\n#\t# Modified. (Ties share what would have been their last ordinal number).\n#\t# Dense. (Ties share the next available integer).\n#\t# Ordinal. ((Competitors take the next available integer. Ties are not treated otherwise).\n#\t# Fractional. (Ties share the mean of what would have been their ordinal numbers)\n\n#\t# Variables:\n#\ntypeset -a arr=( '44 Solomon' '42 Jason' '42 Errol' '41 Garry' '41 Bernard' '41 Barry' '39 Stephen' )\ninteger i\n\n#\t# Functions:\n#\n\n#\t# Function _rankStandard(arr, rankarr) - retun arr with standard ranking\n#\nfunction _rankStandard {\n\ttypeset _ranked ; nameref _ranked=\"$1\"\n\n\ttypeset _i _j _scr _currank _prevscr _shelf\n\tinteger _i _j _scr _currank=1 _prevscr\n\ttypeset -a _shelf\n\n\tfor ((_i=0; _i<${#arr[*]}; _i++)); do\n\t\t_scr=${arr[_i]%\\ *}\n\t\tif (( _i>0 )) && (( _scr != _prevscr )); then\n\t\t\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\n\t\t\t\t_ranked+=( \"${_currank} ${_shelf[_j]}\" )\n\t\t\tdone\n\t\t\t(( _currank+=${#_shelf[*]} ))\n\t\t\tunset _shelf ; typeset -a _shelf\n\t\tfi\n\t\t_shelf+=( \"${arr[_i]}\" )\n\t\t_prevscr=${_scr}\n\tdone\n\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\n\t\t_ranked+=( \"${_currank} ${_shelf[_j]}\" )\n\tdone\n}\n\n#\t# Function _rankModified(arr, rankarr) - retun arr with modified ranking\n#\nfunction _rankModified {\n\ttypeset _ranked ; nameref _ranked=\"$1\"\n\n\ttypeset _i _j _scr _currank _prevscr _shelf\n\tinteger _i _j _scr _currank=0 _prevscr\n\ttypeset -a _shelf\n\n\tfor ((_i=0; _i<${#arr[*]}; _i++)); do\n\t\t_scr=${arr[_i]%\\ *}\n\t\tif (( _i>0 )) && (( _scr != _prevscr )); then\n\t\t\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\n\t\t\t\t_ranked+=( \"${_currank} ${_shelf[_j]}\" )\n\t\t\tdone\n\t\t\tunset _shelf ; typeset -a _shelf\n\t\tfi\n\t\t_shelf+=( \"${arr[_i]}\" )\n\t\t(( _currank++ ))\n\t\t_prevscr=${_scr}\n\tdone\n\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\n\t\t_ranked+=( \"${_currank} ${_shelf[_j]}\" )\n\tdone\n}\n\n#\t# Function _rankDense(arr, rankarr) - retun arr with dense ranking\n#\nfunction _rankDense {\n\ttypeset _ranked ; nameref _ranked=\"$1\"\n\n\ttypeset _i _j _scr _currank _prevscr _shelf\n\tinteger _i _j _scr _currank=0 _prevscr\n\ttypeset -a _shelf\n\n\tfor ((_i=0; _i<${#arr[*]}; _i++)); do\n\t\t_scr=${arr[_i]%\\ *}\n\t\tif (( _i>0 )) && (( _scr != _prevscr )); then\n\t\t\t(( _currank++ ))\n\t\t\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\n\t\t\t\t_ranked+=( \"${_currank} ${_shelf[_j]}\" )\n\t\t\tdone\n\t\t\tunset _shelf ; typeset -a _shelf\n\t\tfi\n\t\t_shelf+=( \"${arr[_i]}\" )\n\t\t_prevscr=${_scr}\n\tdone\n\t(( _currank++ ))\n\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\n\t\t_ranked+=( \"${_currank} ${_shelf[_j]}\" )\n\tdone\n}\n\n#\t# Function _rankOrdinal(arr, rankarr) - retun arr with ordinal ranking\n#\nfunction _rankOrdinal {\n\ttypeset _ranked ; nameref _ranked=\"$1\"\n\ttypeset _i ; integer _i\n\n\tfor ((_i=0; _i<${#arr[*]}; _i++)); do\n\t\t_ranked+=( \"$(( _i + 1 )) ${arr[_i]}\" )\n\tdone\n}\n\n#\t# Function _rankFractional(arr, rankarr) - retun arr with Fractional ranking\n#\nfunction _rankFractional {\n\ttypeset _ranked ; nameref _ranked=\"$1\"\n\n\ttypeset _i _j _scr _currank _prevscr _shelf\n\tinteger _i _j _scr _prevscr\n\ttypeset -F1 _currank=1.0\n\ttypeset -a _shelf\n\n\tfor ((_i=0; _i<${#arr[*]}; _i++)); do\n\t\t_scr=${arr[_i]%\\ *}\n\t\tif (( _i>0 )) && (( _scr != _prevscr )); then\n\t\t\t(( _currank/=${#_shelf[*]} ))\n\t\t\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\n\t\t\t\t_ranked+=( \"${_currank} ${_shelf[_j]}\" )\n\t\t\tdone\n\t\t\t_currank=0.0\n\t\t\tunset _shelf ; typeset -a _shelf\n\t\tfi\n\t\t(( _i>0 )) && (( _currank+=_i + 1 ))\n\t\t_shelf+=( \"${arr[_i]}\" )\n\t\t_prevscr=${_scr}\n\tdone\n\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\n\t\t(( _currank/=${#_shelf[*]} ))\n\t\t_ranked+=( \"${_currank} ${_shelf[_j]}\" )\n\tdone\n}\n\n ######\n# main #\n ######\n\nprintf \"\\n\\nInput Data: ${#arr[*]} records\\n---------------------\\n\"\nfor ((i=0; i< ${#arr[*]}; i++)); do\n\tprint ${arr[i]}\ndone\n\ntypeset -a rankedarr\n_rankStandard rankedarr\nprintf \"\\n\\nStandard Ranking\\n----------------\\n\"\nfor ((i=0; i< ${#rankedarr[*]}; i++)); do\n\tprint ${rankedarr[i]}\ndone\n\nunset rankedarr ; typeset -a rankedarr\n_rankModified rankedarr\nprintf \"\\n\\nModified Ranking\\n----------------\\n\"\nfor ((i=0; i< ${#rankedarr[*]}; i++)); do\n\tprint ${rankedarr[i]}\ndone\n\nunset rankedarr ; typeset -a rankedarr\n_rankDense rankedarr\nprintf \"\\n\\nDense Ranking\\n-------------\\n\"\nfor ((i=0; i< ${#rankedarr[*]}; i++)); do\n\tprint ${rankedarr[i]}\ndone\n\nunset rankedarr ; typeset -a rankedarr\n_rankOrdinal rankedarr\nprintf \"\\n\\nOrdinal Ranking\\n---------------\\n\"\nfor ((i=0; i< ${#rankedarr[*]}; i++)); do\n\tprint ${rankedarr[i]}\ndone\n\nunset rankedarr ; typeset -a rankedarr\n_rankFractional rankedarr\nprintf \"\\n\\nFractional Ranking\\n------------------\\n\"\nfor ((i=0; i< ${#rankedarr[*]}; i++)); do\n\tprint ${rankedarr[i]}\ndone\n","language":"Ksh"},{"code":"Module Ranking (output$, orderlist) {\n\tOpen output$ for output as #k\n\tGosub getdata\n\tPrint #k, \"Standard ranking:\"\n\tskip=true\n\trankval=1\n\toldrank=0\n\tFor i=1 to items\n\t\tRead rank, name$\n\t\tif skip then\n\t\t\tskip=false\n\t\telse.if oldrank<>rank then\n\t\t\trankval=i\n\t\tend if\n\t\toldrank=rank\n\t\tPrint #k, Format$(\"{0::-5} {2} ({1})\", rankval, rank, name$)\n\tNext\n\tGosub getdata\n\tPrint #k, \"Modified ranking:\"\n\tskip=true\n\trankval=Items\n\toldrank=0\n\tShiftBack 1, -items*2 ' reverse stack items\n\tFor i=items to 1\n\t\tRead name$, rank\n\t\tif skip then\n\t\t\tskip=false\n\t\telse.if oldrank<>rank then\n\t\t\trankval=i\n\t\tend if\n\t\toldrank=rank\n\t\tData Format$(\"{0::-5} {2} ({1})\", rankval, rank, name$)\n\tNext\n\tShiftBack 1, -items ' reverse stack items\n\tFor i=1 to items\n\t\tPrint #k, letter$\n\tNext i\n\tGosub getdata\n\tPrint #k, \"Dense ranking:\"\n\tskip=true\n\tDense=Stack\n\tacc=1\n\toldrank=0\n\tFor i=1 to items\n\t\tRead rank, name$\n\t\tif skip then\n\t\t\tskip=false\n\t\t\toldrank=rank\n\t\telse.if oldrank<>rank then\n\t\t\toldrank=rank\n\t\t\tGosub dense\n\t\t\tacc=i\n\t\tend if\n\t\tStack Dense {data Format$(\" {0} ({1})\",name$, rank)}\t\n\tNext\n\tGosub dense\n\tGosub getdata\n\tPrint #k, \"Ordinal ranking:\"\n\tFor i=1 to items\n\t\tPrint #k, Format$(\"{0::-5} {2} ({1})\", i, Number, letter$)\n\tNext\n\tGosub getdata\n\tPrint #k, \"Fractional ranking:\"\n\tskip=true\n\tFrac=Stack\n\tacc=1\n\toldrank=0\n\tFor i=1 to items\n\t\tRead rank, name$\n\t\tif skip then\n\t\t\tskip=false\n\t\t\toldrank=rank\n\t\telse.if oldrank<>rank then\n\t\t\toldrank=rank\n\t\t\tGosub Fractional\n\t\t\tacc=I\n\t\tend if\n\t\tStack Frac {data Format$(\" {0} ({1})\",name$, rank)}\t\n\tNext\n\tGosub Fractional\n\tClose #k\n\tEnd\n\tFractional:\n\t\tval=((len(Frac)+1)/2+(acc-1))\n\t\tStack Frac {\n\t\t\twhile not empty\n\t\t\t\tPrint #k, format$(\"{0:1:-5}{1}\", val, letter$)\n\t\t\tend while\n\t\t}\n\tReturn\n\tdense:\n\t\tStack Dense {\n\t\t\twhile not empty\n\t\t\t\tPrint #k, format$(\"{0::-5}{1}\", acc, letter$)\n\t\t\tend while\n\t\t}\n\tReturn\n\tgetdata:\n\t\tflush\n\t\tstack stack(orderlist) // place a copy of items to current stack\n\t\titems=stack.size/2\n\tReturn\n}\nFlush\nData 44, \"Solomon\", 42, \"Jason\", 42, \"Errol\"\nData 41, \"Garry\", 41, \"Bernard\", 41, \"Barry\"\nData 39, \"Stephen\"\n// get all items from current stack to a new stack\nalist=[]\n// To screen\nRanking \"\", alist\n// To file\nRanking \"ranking.txt\", alist\n","language":"M2000-Interpreter"},{"code":"data = Transpose@{{44, 42, 42, 41, 41, 41, 39}, {\"Solomon\", \"Jason\",\n \"Errol\", \"Garry\", \"Bernard\", \"Barry\", \"Stephen\"}};\n\nrank[data_, type_] :=\n Module[{t = Transpose@{Sort@data, Range[Length@data, 1, -1]}},\n Switch[type,\n \"standard\", data/.Rule@@@First/@SplitBy[t, First],\n \"modified\", data/.Rule@@@Last/@SplitBy[t, First],\n \"dense\", data/.Thread[#->Range[Length@#]]&@SplitBy[t, First][[All, 1, 1]],\n \"ordinal\", Reverse@Ordering[data],\n \"fractional\", data/.Rule@@@(Mean[#]/.{a_Rational:>N[a]}&)/@ SplitBy[t, First]]]\n\nfmtRankedData[data_, type_] :=\n Labeled[Grid[\n SortBy[ArrayFlatten@{{Transpose@{rank[data[[All, 1]], type]},\n data}}, First], Alignment->Left], type<>\" ranking:\", Top]\n\nGrid@{fmtRankedData[data, #] & /@ {\"standard\", \"modified\", \"dense\",\n \"ordinal\", \"fractional\"}}\n","language":"Mathematica"},{"code":"MODULE RankingMethods;\nFROM FormatString IMPORT FormatString;\nFROM RealStr IMPORT RealToFixed;\nFROM Terminal IMPORT WriteString,WriteLn,ReadChar;\n\nPROCEDURE WriteCard(c : CARDINAL);\nVAR buf : ARRAY[0..15] OF CHAR;\nBEGIN\n FormatString(\"%c\", buf, c);\n WriteString(buf)\nEND WriteCard;\n\nTYPE Entry = RECORD\n name : ARRAY[0..15] OF CHAR;\n score : CARDINAL;\nEND;\n\nPROCEDURE OrdinalRanking(CONST entries : ARRAY OF Entry);\nVAR\n buf : ARRAY[0..31] OF CHAR;\n i : CARDINAL;\nBEGIN\n WriteString(\"Ordinal Ranking\");\n WriteLn;\n WriteString(\"---------------\");\n WriteLn;\n\n FOR i:=0 TO HIGH(entries) DO\n FormatString(\"%c\\t%c\\t%s\\n\", buf, i + 1, entries[i].score, entries[i].name);\n WriteString(buf)\n END;\n\n WriteLn\nEND OrdinalRanking;\n\nPROCEDURE StandardRanking(CONST entries : ARRAY OF Entry);\nVAR\n buf : ARRAY[0..31] OF CHAR;\n i,j : CARDINAL;\nBEGIN\n WriteString(\"Standard Ranking\");\n WriteLn;\n WriteString(\"---------------\");\n WriteLn;\n\n j := 1;\n FOR i:=0 TO HIGH(entries) DO\n FormatString(\"%c\\t%c\\t%s\\n\", buf, j, entries[i].score, entries[i].name);\n WriteString(buf);\n IF entries[i+1].score < entries[i].score THEN\n j := i + 2\n END\n END;\n\n WriteLn\nEND StandardRanking;\n\nPROCEDURE DenseRanking(CONST entries : ARRAY OF Entry);\nVAR\n buf : ARRAY[0..31] OF CHAR;\n i,j : CARDINAL;\nBEGIN\n WriteString(\"Dense Ranking\");\n WriteLn;\n WriteString(\"---------------\");\n WriteLn;\n\n j := 1;\n FOR i:=0 TO HIGH(entries) DO\n FormatString(\"%c\\t%c\\t%s\\n\", buf, j, entries[i].score, entries[i].name);\n WriteString(buf);\n IF entries[i+1].score < entries[i].score THEN\n INC(j)\n END\n END;\n\n WriteLn\nEND DenseRanking;\n\nPROCEDURE ModifiedRanking(CONST entries : ARRAY OF Entry);\nVAR\n buf : ARRAY[0..31] OF CHAR;\n i,j,count : CARDINAL;\nBEGIN\n WriteString(\"Modified Ranking\");\n WriteLn;\n WriteString(\"---------------\");\n WriteLn;\n\n i := 0;\n j := 1;\n WHILE i < HIGH(entries) DO\n IF entries[i].score # entries[i+1].score THEN\n FormatString(\"%c\\t%c\\t%s\\n\", buf, i+1, entries[i].score, entries[i].name);\n WriteString(buf);\n\n count := 1;\n FOR j:=i+1 TO HIGH(entries)-1 DO\n IF entries[j].score # entries[j+1].score THEN\n BREAK\n END;\n INC(count)\n END;\n\n j := 0;\n WHILE j < count-1 DO\n FormatString(\"%c\\t%c\\t%s\\n\", buf, i+count+1, entries[i+j+1].score, entries[i+j+1].name);\n WriteString(buf);\n INC(j)\n END;\n i := i + count - 1\n END;\n INC(i)\n END;\n\n FormatString(\"%c\\t%c\\t%s\\n\\n\", buf, HIGH(entries)+1, entries[HIGH(entries)].score, entries[HIGH(entries)].name);\n WriteString(buf)\nEND ModifiedRanking;\n\nPROCEDURE FractionalRanking(CONST entries : ARRAY OF Entry);\nVAR\n buf : ARRAY[0..32] OF CHAR;\n i,j,count : CARDINAL;\n sum : REAL;\nBEGIN\n WriteString(\"Fractional Ranking\");\n WriteLn;\n WriteString(\"---------------\");\n WriteLn;\n\n sum := 0.0;\n i := 0;\n WHILE i <= HIGH(entries) DO\n IF (i = HIGH(entries) - 1) OR (entries[i].score # entries[i+1].score) THEN\n RealToFixed(FLOAT(i+1),1,buf);\n WriteString(buf);\n FormatString(\"\\t%c\\t%s\\n\", buf, entries[i].score, entries[i].name);\n WriteString(buf)\n ELSE\n sum := FLOAT(i);\n count := 1;\n\n j := i;\n WHILE entries[j].score = entries[j+1].score DO\n sum := sum + FLOAT(j + 1);\n INC(count);\n INC(j)\n END;\n FOR j:=0 TO count-1 DO\n RealToFixed(sum/FLOAT(count)+1.0,1,buf);\n WriteString(buf);\n FormatString(\"\\t%c\\t%s\\n\", buf, entries[i+j].score, entries[i+j].name);\n WriteString(buf)\n END;\n i := i + count - 1\n END;\n INC(i)\n END\nEND FractionalRanking;\n\n(* Main *)\nTYPE EA = ARRAY[0..6] OF Entry;\nVAR entries : EA;\nBEGIN\n entries := EA{\n {\"Solomon\", 44},\n {\"Jason\", 42},\n {\"Errol\", 42},\n {\"Garry\", 41},\n {\"Bernard\", 41},\n {\"Barry\", 41},\n {\"Stephen\", 39}\n };\n\n OrdinalRanking(entries);\n StandardRanking(entries);\n DenseRanking(entries);\n ModifiedRanking(entries);\n FractionalRanking(entries);\n\n ReadChar\nEND RankingMethods.\n","language":"Modula-2"},{"code":"import algorithm, sequtils, stats, tables\n\ntype\n Record = tuple[score: int; name: string] # Input data.\n Groups = OrderedTable[int, seq[string]] # Maps score to list of names.\n Rank = tuple[rank: int; name: string; score: int] # Result.\n FractRank = tuple[rank: float; name: string; score: int] # Result (fractional).\n\nfunc cmp(a, b: (int, seq[string])): int =\n ## Comparison function needed to sort the groups.\n cmp(a[0], b[0])\n\nfunc toGroups(records: openArray[Record]): Groups =\n ## Build a \"Groups\" table from the records.\n for record in records:\n result.mgetOrPut(record.score, @[]).add record.name\n # Sort the list of names by alphabetic order.\n for score in result.keys:\n sort(result[score])\n # Sort the groups by decreasing score.\n result.sort(cmp, Descending)\n\nfunc standardRanks(groups: Groups): seq[Rank] =\n var rank = 1\n for score, names in groups.pairs:\n for name in names:\n result.add (rank, name, score)\n inc rank, names.len\n\nfunc modifiedRanks(groups: Groups): seq[Rank] =\n var rank = 0\n for score, names in groups.pairs:\n inc rank, names.len\n for name in names:\n result.add (rank, name, score)\n\nfunc denseRanks(groups: Groups): seq[Rank] =\n var rank = 0\n for score, names in groups.pairs:\n inc rank\n for name in names:\n result.add (rank, name, score)\n\nfunc ordinalRanks(groups: Groups): seq[Rank] =\n var rank = 0\n for score, names in groups.pairs:\n for name in names:\n inc rank\n result.add (rank, name, score)\n\nfunc fractionalRanks(groups: Groups): seq[FractRank] =\n var rank = 1\n for score, names in groups.pairs:\n let fRank = mean(toSeq(rank..(rank + names.high)))\n for name in names:\n result.add (fRank, name, score)\n inc rank, names.len\n\nwhen isMainModule:\n const Data = [(44, \"Solomon\"), (42, \"Jason\"), (42, \"Errol\"),\n (41, \"Garry\"), (41, \"Bernard\"), (41, \"Barry\"), (39, \"Stephen\")]\n\n let groups = Data.toGroups()\n echo \"Standard ranking:\"\n for (rank, name, score) in groups.standardRanks():\n echo rank, \": \", name, \" \", score\n\n echo()\n echo \"Modified ranking:\"\n for (rank, name, score) in groups.modifiedRanks():\n echo rank, \": \", name, \" \", score\n\n echo()\n echo \"Dense ranking:\"\n for (rank, name, score) in groups.denseRanks():\n echo rank, \": \", name, \" \", score\n\n echo()\n echo \"Ordinal ranking:\"\n for (rank, name, score) in groups.ordinalRanks():\n echo rank, \": \", name, \" \", score\n\n echo()\n echo \"Fractional ranking:\"\n for (rank, name, score) in groups.fractionalRanks():\n echo rank, \": \", name, \" \", score\n","language":"Nim"},{"code":"import algorithm\n\ntype\n Record = tuple[score: int; name: string] # Input data.\n Rank = tuple[rank: int; name: string; score: int] # Result.\n FractRank = tuple[rank: float; name: string; score: int] # Result (fractional).\n\nfunc cmp(a, b: Record): int =\n ## Record comparison function (needed for sorting).\n result = cmp(b[0], a[0]) # Reverse order.\n if result == 0:\n result = cmp(a.name, b.name) # Alphabetical order.\n\nfunc standardRanks(records: openArray[Record]): seq[Rank] =\n let records = sorted(records, cmp)\n var rank = 1\n var currScore = records[0].score\n for idx, (score, name) in records:\n if score != currScore:\n rank = idx + 1\n currScore = score\n result.add (rank, name, score)\n\nfunc modifiedRanks(records: openArray[Record]): seq[Rank] =\n let records = sorted(records, cmp)\n var rank = records.len\n var currScore = records[^1].score\n for idx in countdown(records.high, 0):\n let (score, name) = records[idx]\n if score != currScore:\n rank = idx + 1\n currScore = score\n result.add (rank, name, score)\n result.reverse()\n\nfunc denseRanks(records: openArray[Record]): seq[Rank] =\n let records = sorted(records, cmp)\n var rank = 1\n var currScore = records[0].score\n for (score, name) in records:\n if score != currScore:\n inc rank\n currScore = score\n result.add (rank, name, score)\n\nfunc ordinalRanks(records: openArray[Record]): seq[Rank] =\n let records = sorted(records, cmp)\n var rank = 0\n for (score, name) in records:\n inc rank\n result.add (rank, name, score)\n\nfunc fractionalRanks(records: openArray[Record]): seq[FractRank] =\n let records = sorted(records, cmp)\n\n # Build a list of ranks.\n var currScore = records[0].score\n var sum = 0\n var ranks: seq[float]\n var count = 0\n for idx, record in records:\n if record.score == currScore:\n inc count\n inc sum, idx + 1\n else:\n ranks.add sum / count\n count = 1\n currScore = record.score\n sum = idx + 1\n ranks.add sum / count\n\n # Give a rank to each record.\n currScore = records[0].score\n var rankIndex = 0\n for (score, name) in records:\n if score != currScore:\n inc rankIndex\n currScore = score\n result.add (ranks[rankIndex], name, score)\n\nwhen isMainModule:\n\n const Data = [(44, \"Solomon\"), (42, \"Jason\"), (42, \"Errol\"),\n (41, \"Garry\"), (41, \"Bernard\"), (41, \"Barry\"), (39, \"Stephen\")]\n\n echo \"Standard ranking:\"\n for (rank, name, score) in Data.standardRanks():\n echo rank, \": \", name, \" \", score\n\n echo()\n echo \"Modified ranking:\"\n for (rank, name, score) in Data.modifiedRanks():\n echo rank, \": \", name, \" \", score\n\n echo()\n echo \"Dense ranking:\"\n for (rank, name, score) in Data.denseRanks():\n echo rank, \": \", name, \" \", score\n\n echo()\n echo \"Ordinal ranking:\"\n for (rank, name, score) in Data.ordinalRanks():\n echo rank, \": \", name, \" \", score\n\n echo()\n echo \"Fractional ranking:\"\n for (rank, name, score) in Data.fractionalRanks():\n echo rank, \": \", name, \" \", score\n","language":"Nim"},{"code":"standard(v)=v=vecsort(v,1,4); my(last=v[1][1]+1); for(i=1,#v, v[i][1]=if(v[i][1]<last,last=v[i][1]; i, v[i-1][1])); v;\nmodified(v)=v=vecsort(v,1,4); my(last=v[#v][1]-1); forstep(i=#v,1,-1, v[i][1]=if(v[i][1]>last,last=v[i][1]; i, v[i+1][1])); v;\ndense(v)=v=vecsort(v,1,4); my(last=v[1][1]+1,rank); for(i=1,#v, v[i][1]=if(v[i][1]<last,last=v[i][1]; rank++, rank)); v;\nordinal(v)=v=vecsort(v,1,4); for(i=1,#v,v[i][1]=i); v;\nfractional(v)=my(a=standard(v),b=modified(v)); vector(#v,i,[(a[i][1]+b[i][1])/2,v[i][2]]);\n\nv=[[44,\"Solomon\"], [42,\"Jason\"], [42,\"Errol\"], [41,\"Garry\"], [41,\"Bernard\"], [41,\"Barry\"], [39,\"Stephen\"]];\nstandard(v)\nmodified(v)\ndense(v)\nordinal(v)\nfractional(v)\n","language":"PARI-GP"},{"code":"my %scores = (\n 'Solomon' => 44,\n 'Jason' => 42,\n 'Errol' => 42,\n 'Garry' => 41,\n 'Bernard' => 41,\n 'Barry' => 41,\n 'Stephen' => 39\n);\n\nsub tiers {\n my(%s) = @_; my(%h);\n push @{$h{$s{$_}}}, $_ for keys %s;\n @{\\%h}{reverse sort keys %h};\n}\n\nsub standard {\n my(%s) = @_; my($result);\n my $rank = 1;\n for my $players (tiers %s) {\n $result .= \"$rank \" . join(', ', sort @$players) . \"\\n\";\n $rank += @$players;\n }\n return $result;\n}\n\nsub modified {\n my(%s) = @_; my($result);\n my $rank = 0;\n for my $players (tiers %s) {\n $rank += @$players;\n $result .= \"$rank \" . join(', ', sort @$players) . \"\\n\";\n }\n return $result;\n}\n\nsub dense {\n my(%s) = @_; my($n,$result);\n $result .= sprintf \"%d %s\\n\", ++$n, join(', ', sort @$_) for tiers %s;\n return $result;\n}\n\nsub ordinal {\n my(%s) = @_; my($n,$result);\n for my $players (tiers %s) {\n $result .= sprintf \"%d %s\\n\", ++$n, $_ for sort @$players;\n }\n return $result;\n}\n\nsub fractional {\n my(%s) = @_; my($result);\n my $rank = 1;\n for my $players (tiers %s) {\n my $beg = $rank;\n my $end = $rank += @$players;\n my $avg = 0;\n $avg += $_/@$players for $beg .. $end-1;\n $result .= sprintf \"%3.1f %s\\n\", $avg, join ', ', sort @$players;\n }\n return $result;\n}\n\nprint \"Standard:\\n\" . standard(%scores) . \"\\n\";\nprint \"Modified:\\n\" . modified(%scores) . \"\\n\";\nprint \"Dense:\\n\" . dense(%scores) . \"\\n\";\nprint \"Ordinal:\\n\" . ordinal(%scores) . \"\\n\";\nprint \"Fractional:\\n\" . fractional(%scores) . \"\\n\";\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">ties</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">scores</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span> <span style=\"color: #000080;font-style:italic;\">-- {start,num} pairs</span>\n <span style=\"color: #000000;\">tdx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">scores</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">last</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">scores</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">curr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">scores</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">curr</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">last</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">[$][</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">tdx</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">last</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">curr</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000080;font-style:italic;\">-- eg <nowiki>{{</nowiki>{1,1},{2,2},{4,3},{7,1<nowiki>}}</nowiki>,\n -- {1,2,2,3,3,3,4<nowiki>}}</nowiki></span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">tdx</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">enum</span> <span style=\"color: #000000;\">STANDARD</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- eg {1,2,2,4,4,4,7}</span>\n <span style=\"color: #000000;\">MODIFIED</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- eg {1,3,3,6,6,6,7}</span>\n <span style=\"color: #000000;\">DENSE</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- (==tdx)</span>\n <span style=\"color: #000000;\">ORDINAL</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- eg {1,2,3,4,5,6,7}</span>\n <span style=\"color: #000000;\">FRACTION</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- {1,2.5,2.5,5,5,5,7}</span>\n <span style=\"color: #000000;\">METHODS</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">$</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">rank</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">method</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">tdx</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">idx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">tdx</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">tx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">tn</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">idx</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">switch</span> <span style=\"color: #000000;\">method</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #000000;\">STANDARD</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">tx</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #000000;\">MODIFIED</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">tx</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">tn</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #000000;\">DENSE</span> <span style=\"color: #0000FF;\">:</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">idx</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #000000;\">ORDINAL</span> <span style=\"color: #0000FF;\">:</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">i</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #000000;\">FRACTION</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">tx</span><span style=\"color: #0000FF;\">+(</span><span style=\"color: #000000;\">tn</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">2</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">switch</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">scores</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #000000;\">44</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Solomon\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">42</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Jason\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">42</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Errol\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">41</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Garry\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">41</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Bernard\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">41</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Barry\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">39</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"Stephen\"</span><span style=\"color: #0000FF;\">}}</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">tdx</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ties</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">scores</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" score name standard modified dense ordinal fractional\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">scores</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">ranks</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">METHODS</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">method</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">METHODS</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">ranks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">method</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rank</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">method</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">tdx</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%5d %-7s \"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">scores</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%6g %8g %6g %6g %9g\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ranks</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"function Get-Ranking\n{\n [CmdletBinding(DefaultParameterSetName=\"Standard\")]\n [OutputType([PSCustomObject])]\n Param\n (\n [Parameter(Mandatory=$true,\n ValueFromPipeline=$true,\n ValueFromPipelineByPropertyName=$true,\n Position=0)]\n [string]\n $InputObject,\n\n [Parameter(Mandatory=$false,\n ParameterSetName=\"Standard\")]\n [switch]\n $Standard,\n\n [Parameter(Mandatory=$false,\n ParameterSetName=\"Modified\")]\n [switch]\n $Modified,\n\n [Parameter(Mandatory=$false,\n ParameterSetName=\"Dense\")]\n [switch]\n $Dense,\n\n [Parameter(Mandatory=$false,\n ParameterSetName=\"Ordinal\")]\n [switch]\n $Ordinal,\n\n [Parameter(Mandatory=$false,\n ParameterSetName=\"Fractional\")]\n [switch]\n $Fractional\n )\n\n Begin\n {\n function Get-OrdinalRank ([PSCustomObject[]]$Values)\n {\n for ($i = 0; $i -lt $Values.Count; $i++)\n {\n $Values[$i].Rank = $i + 1\n }\n\n $Values\n }\n\n function Get-Rank ([PSCustomObject[]]$Scores)\n {\n foreach ($score in $Scores)\n {\n $score.Group | ForEach-Object {$_.Rank = $score.Rank}\n }\n\n $Scores.Group\n }\n\n function New-Competitor ([string]$Name, [int]$Score, [int]$Rank = 0)\n {\n [PSCustomObject]@{\n Name = $Name\n Score = $Score\n Rank = $Rank\n }\n }\n\n $competitors = @()\n $scores = @()\n }\n Process\n {\n @($input) | ForEach-Object {$competitors += New-Competitor -Name $_.Split()[1] -Score $_.Split()[0]}\n }\n End\n {\n $scores = $competitors |\n Sort-Object -Property Score -Descending |\n Group-Object -Property Score |\n Select-Object -Property @{Name=\"Score\"; Expression={[int]$_.Name}}, @{Name=\"Rank\"; Expression={0}}, Count, Group\n\n switch ($PSCmdlet.ParameterSetName)\n {\n \"Standard\"\n {\n $rank = 1\n\n for ($i = 0; $i -lt $scores.Count; $i++)\n {\n $scores[$i].Rank = $rank\n $rank += $scores[$i].Count\n }\n\n Get-Rank $scores\n }\n \"Modified\"\n {\n $rank = 0\n\n foreach ($score in $scores)\n {\n $rank = $score.Count + $rank\n $score.Rank = $rank\n }\n\n Get-Rank $scores\n }\n \"Dense\"\n {\n for ($i = 0; $i -lt $scores.Count; $i++)\n {\n $scores[$i].Rank = $i + 1\n }\n\n Get-Rank $scores\n }\n \"Ordinal\"\n {\n Get-OrdinalRank $competitors\n }\n \"Fractional\"\n {\n Get-OrdinalRank $competitors | Group-Object -Property Score | ForEach-Object {\n if ($_.Count -gt 1)\n {\n $rank = ($_.Group.Rank | Measure-Object -Average).Average\n\n foreach ($competitor in $_.Group)\n {\n $competitor.Rank = $rank\n }\n }\n }\n\n $competitors\n }\n }\n }\n}\n","language":"PowerShell"},{"code":"$scores = \"44 Solomon\",\"42 Jason\",\"42 Errol\",\"41 Garry\",\"41 Bernard\",\"41 Barry\",\"39 Stephen\"\n","language":"PowerShell"},{"code":"$scores | Get-Ranking -Standard\n","language":"PowerShell"},{"code":"$scores | Get-Ranking -Modified\n","language":"PowerShell"},{"code":"$scores | Get-Ranking -Dense\n","language":"PowerShell"},{"code":"$scores | Get-Ranking -Ordinal\n","language":"PowerShell"},{"code":"$scores | Get-Ranking -Fractional\n","language":"PowerShell"},{"code":"def mc_rank(iterable, start=1):\n \"\"\"Modified competition ranking\"\"\"\n lastresult, fifo = None, []\n for n, item in enumerate(iterable, start-1):\n if item[0] == lastresult:\n fifo += [item]\n else:\n while fifo:\n yield n, fifo.pop(0)\n lastresult, fifo = item[0], fifo + [item]\n while fifo:\n yield n+1, fifo.pop(0)\n\n\ndef sc_rank(iterable, start=1):\n \"\"\"Standard competition ranking\"\"\"\n lastresult, lastrank = None, None\n for n, item in enumerate(iterable, start):\n if item[0] == lastresult:\n yield lastrank, item\n else:\n yield n, item\n lastresult, lastrank = item[0], n\n\n\ndef d_rank(iterable, start=1):\n \"\"\"Dense ranking\"\"\"\n lastresult, lastrank = None, start - 1,\n for item in iterable:\n if item[0] == lastresult:\n yield lastrank, item\n else:\n lastresult, lastrank = item[0], lastrank + 1\n yield lastrank, item\n\n\ndef o_rank(iterable, start=1):\n \"\"\"Ordinal ranking\"\"\"\n yield from enumerate(iterable, start)\n\n\ndef f_rank(iterable, start=1):\n \"\"\"Fractional ranking\"\"\"\n last, fifo = None, []\n for n, item in enumerate(iterable, start):\n if item[0] != last:\n if fifo:\n mean = sum(f[0] for f in fifo) / len(fifo)\n while fifo:\n yield mean, fifo.pop(0)[1]\n last = item[0]\n fifo.append((n, item))\n if fifo:\n mean = sum(f[0] for f in fifo) / len(fifo)\n while fifo:\n yield mean, fifo.pop(0)[1]\n\n\nif __name__ == '__main__':\n scores = [(44, 'Solomon'),\n (42, 'Jason'),\n (42, 'Errol'),\n (41, 'Garry'),\n (41, 'Bernard'),\n (41, 'Barry'),\n (39, 'Stephen')]\n\n print('\\nScores to be ranked (best first):')\n for s in scores:\n print(' %2i %s' % (s ))\n for ranker in [sc_rank, mc_rank, d_rank, o_rank, f_rank]:\n print('\\n%s:' % ranker.__doc__)\n for rank, score in ranker(scores):\n print(' %3g, %r' % (rank, score))\n","language":"Python"},{"code":"#lang racket\n;; Tim-brown 2014-09-11\n\n;; produces a ranking according to ranking function: rfn\n;; INPUT:\n;; lst : (list (score . details))\n;; rfn : (length-scores)\n;; -> (values\n;; ranks-added ; how many ranks to add for the next iteration\n;; (idx . rest -> rank-offset)) ; function that produces the rank for the idx^th element\n;; ; in the scoring (arity must be >= 1)\n(define (rank-list all-scores rfn)\n (let loop ((rank-0 0) (lst (sort all-scores > #:key car)) (acc empty))\n (cond\n [(null? lst) acc]\n [else\n (define 1st-score (caar lst))\n (define (ties-with-1st? cand) (= (car cand) 1st-score))\n (define-values (tied unranked) (splitf-at lst ties-with-1st?))\n ;; all ranking functions should properly handle a singleton tied list\n (define tied-len (length tied))\n (define tied? (> tied-len 1))\n (define-values (ranks-added rank-offset-fn) (rfn tied-len))\n (define ranked-tied (for/list ((t (in-list tied)) (i (in-naturals 1)))\n (list* tied? (+ rank-0 (rank-offset-fn i)) t)))\n (loop (+ ranks-added rank-0) unranked (append acc ranked-tied))])))\n\n;; Ties share what would have been their first ordinal number\n(define (rank-function:Standard l)\n (values l (thunk* 1)))\n\n;; Ties share what would have been their last ordinal number\n(define (rank-function:Modified l)\n (values l (thunk* l)))\n\n;; Ties share the next available integer\n(define (rank-function:Dense l)\n (values 1 (thunk* 1)))\n\n;; Competitors take the next available integer. Ties are not treated otherwise\n(define (rank-function:Ordinal l)\n (values l (λ (n . _) n)))\n\n;; Ties share the mean of what would have been their ordinal numbers\n(define (rank-function:Fractional l)\n (values l (thunk* (/ (+ l 1) 2))))\n\n(define score-board\n '((44 . Solomon)\n (42 . Jason)\n (42 . Errol)\n (41 . Garry)\n (41 . Bernard)\n (41 . Barry)\n (39 . Stephen)))\n\n(define format-number\n (match-lambda\n [(? integer? i) i]\n [(and f (app numerator n) (app denominator d))\n (define-values (q r) (quotient/remainder n d))\n (format \"~a ~a/~a\" q r d)]))\n\n(for ((fn (list\n rank-function:Standard\n rank-function:Modified\n rank-function:Dense\n rank-function:Ordinal\n rank-function:Fractional)))\n (printf \"Function: ~s~%\" fn)\n (for ((r (in-list (rank-list score-board fn))))\n (printf \"~a ~a\\t~a\\t~a~%\"\n (if (car r) \"=\" \" \")\n (format-number (cadr r))\n (caddr r)\n (cdddr r)))\n (newline))\n","language":"Racket"},{"code":"my @scores =\n Solomon => 44,\n Jason => 42,\n Errol => 42,\n Garry => 41,\n Bernard => 41,\n Barry => 41,\n Stephen => 39;\n\nsub tiers (@s) { @s.classify(*.value).pairs.sort.reverse.map: { .value».key } }\n\nsub standard (@s) {\n my $rank = 1;\n gather for tiers @s -> @players {\n\ttake $rank => @players;\n\t$rank += @players;\n }\n}\n\nsub modified (@s) {\n my $rank = 0;\n gather for tiers @s -> @players {\n\t$rank += @players;\n\ttake $rank => @players;\n }\n}\n\nsub dense (@s) { tiers(@s).map: { ++$_ => @^players } }\n\nsub ordinal (@s) { @s.map: ++$_ => *.key }\n\nsub fractional (@s) {\n my $rank = 1;\n gather for tiers @s -> @players {\n\tmy $beg = $rank;\n\tmy $end = $rank += @players;\n\ttake [+]($beg ..^ $end) / @players => @players;\n }\n}\n\nsay \"Standard:\"; .perl.say for standard @scores;\nsay \"\\nModified:\"; .perl.say for modified @scores;\nsay \"\\nDense:\"; .perl.say for dense @scores;\nsay \"\\nOrdinal:\"; .perl.say for ordinal @scores;\nsay \"\\nFractional:\"; .perl.say for fractional @scores;\n","language":"Raku"},{"code":"/**************************\n44 Solomon 1 1 1 1 1\n42 Jason 2 3 2 2 2.5\n42 Errol 2 3 2 3 2.5\n41 Garry 4 6 3 4 5\n41 Bernard 4 6 3 5 5\n41 Barry 4 6 3 6 5\n39 Stephen 7 7 4 7 7\n**************************/\nDo i=1 To 7\n Parse Value sourceline(i+1) With rank.i name.i .\n /* say rank.i name.i */\n End\npool=0\ncrank=0\nDo i=1 To 7\n If rank.i<>crank Then Do\n pool=pool+1\n lo.pool=i\n hi.pool=i\n n.pool=1\n ii.pool=i\n End\n Else Do\n n.pool=n.pool+1\n hi.pool=i\n ii.pool=ii.pool+i\n End\n crank=rank.i\n pool.i=pool\n End\n/*\nDo j=1 To pool\n Say 'pool' j n.j lo.j hi.j\n End\n*/\ncp=0\nr=0\ncnt.=0\nDo i=1 To 7\n p=pool.i\n If p<>cp Then\n r=r+1\n res=rank.i left(name.i,8) lo.p hi.p r i ii.p/n.p\n If res=sourceline(i+1) Then cnt.ok=cnt.ok+1\n Say res\n cp=p\n End\nSay cnt.ok 'correct lines'\n","language":"REXX"},{"code":"ar = \"44 Solomon\n42 Jason\n42 Errol\n41 Garry\n41 Bernard\n41 Barry\n39 Stephen\".lines.map{|line| line.split}\ngrouped = ar.group_by{|pair| pair.shift.to_i}\ns_rnk = 1\nm_rnk = o_rnk = 0\nputs \"stand.\\tmod.\\tdense\\tord.\\tfract.\"\n\ngrouped.each.with_index(1) do |(score, names), d_rnk|\n m_rnk += names.flatten!.size\n f_rnk = (s_rnk + m_rnk)/2.0\n names.each do |name|\n o_rnk += 1\n puts \"#{s_rnk}\\t#{m_rnk}\\t#{d_rnk}\\t#{o_rnk}\\t#{f_rnk.to_s.sub(\".0\",\"\")}\\t#{score} #{name}\"\n end\n s_rnk += names.size\nend\n","language":"Ruby"},{"code":"object RankingMethods extends App {\n case class Score(score: Int, name: String) // incoming data\n case class Rank[Precision](rank: Precision, names: List[String]) // outgoing results (can be int or double)\n case class State[Precision](n: Int, done: List[Rank[Precision]]) { // internal state, no mutable variables\n def next(n: Int, next: Rank[Precision]) = State(n, next :: done)\n }\n def grouped[Precision](list: List[Score]) = // group names together by score, with highest first\n (scala.collection.immutable.TreeMap[Int, List[Score]]() ++ list.groupBy(-_.score))\n .values.map(_.map(_.name)).foldLeft(State[Precision](1, Nil)) _\n\n // Ranking methods:\n\n def rankStandard(list: List[Score]) =\n grouped[Int](list){case (state, names) => state.next(state.n+names.length, Rank(state.n, names))}.done.reverse\n\n def rankModified(list: List[Score]) =\n rankStandard(list).map(r => Rank(r.rank+r.names.length-1, r.names))\n\n def rankDense(list: List[Score]) =\n grouped[Int](list){case (state, names) => state.next(state.n+1, Rank(state.n, names))}.done.reverse\n\n def rankOrdinal(list: List[Score]) =\n list.zipWithIndex.map{case (score, n) => Rank(n+1, List(score.name))}\n\n def rankFractional(list: List[Score]) =\n rankStandard(list).map(r => Rank((2*r.rank+r.names.length-1.0)/2, r.names))\n\n // Tests:\n\n def parseScores(s: String) = s split \"\\\\s+\" match {case Array(s,n) => Score(s.toInt, n)}\n val test = List(\"44 Solomon\", \"42 Jason\", \"42 Errol\", \"41 Garry\", \"41 Bernard\", \"41 Barry\", \"39 Stephen\").map(parseScores)\n\n println(\"Standard:\")\n println(rankStandard(test) mkString \"\\n\")\n println(\"\\nModified:\")\n println(rankModified(test) mkString \"\\n\")\n println(\"\\nDense:\")\n println(rankDense(test) mkString \"\\n\")\n println(\"\\nOrdinal:\")\n println(rankOrdinal(test) mkString \"\\n\")\n println(\"\\nFractional:\")\n println(rankFractional(test) mkString \"\\n\")\n\n}\n","language":"Scala"},{"code":"var scores = [\n Pair(Solomon => 44),\n Pair(Jason => 42),\n Pair(Errol => 42),\n Pair(Garry => 41),\n Pair(Bernard => 41),\n Pair(Barry => 41),\n Pair(Stephen => 39),\n]\n\nfunc tiers(s) {\n s.group_by { .value }.kv.sort.flip.map { .value.map{.key} }\n}\n\nfunc standard(s) {\n var rank = 1\n gather {\n for players in tiers(s) {\n take(Pair(rank, players))\n rank += players.len\n }\n }\n}\n\nfunc modified(s) {\n var rank = 0\n gather {\n for players in tiers(s) {\n rank += players.len\n take(Pair(rank, players))\n }\n }\n}\n\nfunc dense(s) {\n tiers(s).map_kv { |k,v| Pair(k+1, v) }\n}\n\nfunc ordinal(s) {\n s.map_kv { |k,v| Pair(k+1, v.key) }\n}\n\nfunc fractional(s) {\n var rank = 1\n gather {\n for players in tiers(s) {\n var beg = rank\n var end = (rank += players.len)\n take(Pair(sum(beg ..^ end) / players.len, players))\n }\n }\n}\n\nfunc display(r) {\n say r.map {|a| '%3s : %s' % a... }.join(\"\\n\")\n}\n\nsay \"Standard:\"; display( standard(scores))\nsay \"\\nModified:\"; display( modified(scores))\nsay \"\\nDense:\"; display( dense(scores))\nsay \"\\nOrdinal:\"; display( ordinal(scores))\nsay \"\\nFractional:\"; display(fractional(scores))\n","language":"Sidef"},{"code":"proc rank {rankingMethod sortedList} {\n # Extract the groups in the data (this is pointless for ordinal...)\n set s [set group [set groups {}]]\n foreach {score who} $sortedList {\n\tif {$score != $s} {\n\t lappend groups [llength $group]\n\t set s $score\n\t set group {}\n\t}\n\tlappend group $who\n }\n lappend groups [llength $group]\n # Construct the rankings; note that we have a zero-sized leading group\n set n 1; set m 0\n foreach g $groups {\n\tswitch $rankingMethod {\n\t standard {\n\t\tlappend result {*}[lrepeat $g $n]\n\t\tincr n $g\n\t }\n\t modified {\n\t\tlappend result {*}[lrepeat $g [incr m $g]]\n\t }\n\t dense {\n\t\tlappend result {*}[lrepeat $g $m]\n\t\tincr m\n\t }\n\t ordinal {\n\t\tfor {set i 0} {$i < $g} {incr i} {\n\t\t lappend result [incr m]\n\t\t}\n\t }\n\t fractional {\n\t\tset val [expr {($n + [incr n $g] - 1) / 2.0}]\n\t\tlappend result {*}[lrepeat $g [format %g $val]]\n\t }\n\t}\n }\n return $result\n}\n\nset data {\n 44 Solomon\n 42 Jason\n 42 Errol\n 41 Garry\n 41 Bernard\n 41 Barry\n 39 Stephen\n}\nforeach method {standard modified dense ordinal fractional} {\n puts \"Using method '$method'...\\n Rank\\tScore\\tWho\"\n foreach rank [rank $method $data] {score who} $data {\n\tputs \" $rank\\t$score\\t$who\"\n }\n}\n","language":"Tcl"},{"code":"LET n = 7\nDIM puntos(7), ptosnom(7), nombre$(7)\n\nSUB MostarTabla\n FOR i = 1 to n\n PRINT str$(ptosnom(i)); \" \"; puntos(i); \" \"; nombre$(i)\n NEXT i\n PRINT\nEND SUB\n\nPRINT \"Puntuaciones a clasificar (mejores primero):\"\nFOR i = 1 to n\n READ puntos(i), nombre$(i)\n PRINT \" \"; puntos(i); \" \"; nombre$(i)\nNEXT i\n\nPRINT\nPRINT \"--- Standard ranking ---\"\nLET ptosnom(1) = 1\nFOR i = 2 to n\nNEXT i\nCALL MostarTabla\n\nPRINT \"--- Modified ranking ---\"\nLET ptosnom(n) = n\nFOR i = n-1 to 1 step -1\n IF puntos(i) = puntos(i+1) then LET ptosnom(i) = ptosnom(i+1) else LET ptosnom(i) = i\nNEXT i\nCALL MostarTabla\n\nPRINT \"--- Ordinal ranking ---\"\nFOR i = 1 to n\n LET ptosnom(i) = i\nNEXT i\nCALL MostarTabla\n\nPRINT \"--- Fractional ranking ---\"\nLET i = 1\nLET j = 2\nDO\n IF j <= n then\n IF (puntos(j-1) = puntos(j)) then\n LET j = j + 1\n END IF\n END IF\n\n FOR k = i to j-1\n LET ptosnom(k) = (i+j-1) / 2\n NEXT k\n LET i = j\n LET j = j + 1\nLOOP UNTIL i > n\nCALL MOSTARTABLA\n\nDATA 44, \"Solomon\", 42, \"Jason\", 42, \"Errol\", 41, \"Garry\", 41, \"Bernard\", 41, \"Barry\", 39, \"Stephen\"\nEND\n","language":"True-BASIC"},{"code":"#DEFINE CTAB CHR(9)\n#DEFINE CRLF CHR(13) + CHR(10)\nLOCAL lcTxt As String, i As Integer\nCLOSE DATABASES ALL\nSET SAFETY OFF\nCLEAR\nCREATE CURSOR scores (score I, name V(8), rownum I AUTOINC)\nINDEX ON score TAG score COLLATE \"Machine\"\nSET ORDER TO 0\nINSERT INTO scores (score, name) VALUES (44, \"Solomon\")\nINSERT INTO scores (score, name) VALUES (42, \"Jason\")\nINSERT INTO scores (score, name) VALUES (42, \"Errol\")\nINSERT INTO scores (score, name) VALUES (41, \"Garry\")\nINSERT INTO scores (score, name) VALUES (41, \"Bernard\")\nINSERT INTO scores (score, name) VALUES (41, \"Barry\")\nINSERT INTO scores (score, name) VALUES (39, \"Stephen\")\n\nCREATE CURSOR ranks (sc_rank I, mod_rank I, dense I, ordinal I, fractional B(1), score I, name V(8))\nINDEX ON score TAG score COLLATE \"Machine\"\nSET ORDER TO 0\nAPPEND FROM DBF(\"scores\") FIELDS score, name\nStd_Comp()\nModified()\nDense()\nOrdinal()\nFractional()\nCOPY TO ranks.txt TYPE DELIMITED WITH TAB\nlcTxt = \"\"\nFOR i = 1 TO FCOUNT()\n lcTxt = lcTxt + FIELD(i) + CTAB\nENDFOR\nlcTxt = LEFT(lcTxt, LEN(lcTxt) - 1) + CRLF + FILETOSTR(\"ranks.txt\")\nSTRTOFILE(lcTxt, \"ranks.txt\")\nMODIFY FILE ranks.txt\nSET SAFETY ON\n\nFUNCTION ScoreGroup(aa)\nLOCAL n As Integer\nSELECT score, COUNT(*) As num FROM scores ;\nGROUP BY score ORDER BY score DESC INTO ARRAY aa\nn = _TALLY\nRETURN n\nENDFUNC\n\nPROCEDURE Std_Comp\nLOCAL n, i, nn\nLOCAL ARRAY a[1]\nSELECT ranks\nBLANK FIELDS sc_rank ALL\nnn = ScoreGroup(@a)\nn = 1\nFOR i = 1 TO nn\n REPLACE sc_rank WITH n FOR score = a[i,1]\n n = n + a[i,2]\nENDFOR\t\nENDPROC\n\nPROCEDURE Modified\nLOCAL n, i, nn\nLOCAL ARRAY a[1]\nSELECT ranks\nBLANK FIELDS mod_rank ALL\nnn = ScoreGroup(@a)\nn = 0\nFOR i = 1 TO nn\n n = n + a[i,2]\n REPLACE mod_rank WITH n FOR score = a[i,1]\nENDFOR\t\nENDPROC\n\nPROCEDURE Dense\nLOCAL n, i, nn\nLOCAL ARRAY a[1]\nSELECT ranks\nBLANK FIELDS dense ALL\nnn = ScoreGroup(@a)\nSELECT ranks\nn = 0\nFOR i = 1 TO nn\n n = n + a[i,2]\n REPLACE dense WITH i FOR score = a[i,1]\nENDFOR\t\nENDPROC\n\nPROCEDURE Ordinal\nSELECT ranks\nBLANK FIELDS ordinal ALL\nREPLACE ordinal WITH RECNO() ALL\nENDPROC\n\nPROCEDURE Fractional\nLOCAL i As Integer, nn As Integer\nLOCAL ARRAY a[1]\nSELECT ranks\nBLANK FIELDS fractional ALL\nSELECT CAST(AVG(rownum) As B(1)), score FROM scores ;\nGROUP BY score ORDER BY score DESC INTO ARRAY a\nnn = _TALLY\nFOR i = 1 TO nn\n REPLACE fractional WITH a[i,1] FOR score = a[i,2]\nENDFOR\t\nENDPROC\n","language":"Visual-FoxPro"},{"code":"import \"./math\" for Nums\nimport \"./fmt\" for Fmt\n\n/* all ranking functions assume the array of Pairs is non-empty and already sorted\n by decreasing order of scores and then, if the scores are equal, by reverse\n alphabetic order of names\n*/\n\nvar standardRanking = Fn.new { |scores|\n var rankings = List.filled(scores.count, 0)\n rankings[0] = 1\n for (i in 1...scores.count) {\n rankings[i] = (scores[i][0] == scores[i-1][0]) ? rankings[i-1] : i + 1\n }\n return rankings\n}\n\nvar modifiedRanking = Fn.new { |scores|\n var rankings = List.filled(scores.count, 0)\n rankings[0] = 1\n for (i in 1...scores.count) {\n rankings[i] = i + 1\n var currScore = scores[i][0]\n for (j in i-1..0) {\n if (currScore != scores[j][0]) break\n rankings[j] = i + 1\n }\n }\n return rankings\n}\n\nvar denseRanking = Fn.new { |scores|\n var rankings = List.filled(scores.count, 0)\n rankings[0] = 1\n var prevRanking = 1\n for (i in 1...scores.count) {\n rankings[i] = (scores[i][0] == scores[i-1][0]) ? prevRanking : (prevRanking = prevRanking+1)\n }\n return rankings\n}\n\nvar ordinalRanking = Fn.new { |scores| (1..scores.count).toList }\n\nvar fractionalRanking = Fn.new { |scores|\n var rankings = List.filled(scores.count, 0)\n rankings[0] = 1\n for (i in 1...scores.count) {\n var k = i\n var currScore = scores[i][0]\n for (j in i-1..0) {\n if (currScore != scores[j][0]) break\n k = j\n }\n var avg = Nums.mean(k..i) + 1\n for (m in k..i) rankings[m] = avg\n }\n return rankings\n}\n\nvar printRankings = Fn.new { |title, rankings, scores|\n System.print(title + \":\")\n for (i in 0...rankings.count) {\n System.print(\"%(rankings[i]) %(scores[i][0]) %(scores[i][1])\")\n }\n System.print()\n}\n\nvar printFractionalRankings = Fn.new { |title, rankings, scores|\n System.print(title + \":\")\n for (i in 0...rankings.count) {\n Fmt.print(\"$3.2f $d $s\", rankings[i], scores[i][0], scores[i][1])\n }\n System.print()\n}\n\nvar scores = [[44, \"Solomon\"], [42, \"Jason\"], [42, \"Errol\"], [41, \"Garry\"],\n [41, \"Bernard\"], [41, \"Barry\"], [39, \"Stephen\"]]\nprintRankings.call(\"Standard ranking\", standardRanking.call(scores), scores)\nprintRankings.call(\"Modified ranking\", modifiedRanking.call(scores), scores)\nprintRankings.call(\"Dense ranking\", denseRanking.call(scores), scores)\nprintRankings.call(\"Ordinal ranking\", ordinalRanking.call(scores), scores)\nprintFractionalRankings.call(\"Fractional ranking\", fractionalRanking.call(scores), scores)\n","language":"Wren"},{"code":"n = 7\ndim puntos(7), ptosnom(7), nombre$(7)\n\nsub MostarTabla()\n for i = 1 to n\n print str$(ptosnom(i)), \" \", puntos(i), \" \", nombre$(i)\n next i\n print\nend sub\n\nprint \"Puntuaciones a clasificar (mejores primero):\"\nfor i = 1 to n\n read puntos(i), nombre$(i)\n print \" \", puntos(i), \" \", nombre$(i)\nnext i\n\nprint\nprint \"--- Standard ranking ---\"\nptosnom(1) = 1\nfor i = 2 to n\n if puntos(i) = puntos(i-1) then ptosnom(i) = ptosnom(i-1) else ptosnom(i) = i : fi\nnext i\nMostarTabla()\n\nprint \"--- Modified ranking ---\"\nptosnom(n) = n\nfor i = n-1 to 1 step -1\n if puntos(i) = puntos(i+1) then ptosnom(i) = ptosnom(i+1) else ptosnom(i) = i : fi\nnext i\nMostarTabla()\n\nprint \"--- Ordinal ranking ---\"\nfor i = 1 to n\n ptosnom(i) = i\nnext i\nMostarTabla()\n\nprint \"--- Fractional ranking ---\"\ni = 1\nj = 2\nrepeat\n if j <= n then\n if (puntos(j-1) = puntos(j)) then j = j + 1 : fi\n end if\n\n for k = i to j-1\n ptosnom(k) = (i+j-1) / 2\n next k\n i = j\n j = j + 1\nuntil i > n\nMostarTabla()\n\ndata 44, \"Solomon\", 42, \"Jason\", 42, \"Errol\", 41, \"Garry\", 41, \"Bernard\", 41, \"Barry\", 39, \"Stephen\"\nend\n","language":"Yabasic"},{"code":"fcn group(scores){ // group like scores into one list --> list of lists\n sink:=List();\n scores.reduce('wrap(ps,sn,buf){\n if(sn[0]!=ps){ sink.append(buf.copy()); buf.clear(); }\n buf+sn;\n sn[0];\n },scores[0][0],buf:=List());\n sink.append(buf);\n}\nfcn print(list,rank){\n list.apply2('wrap(sn){ \"%2s: %s (%d)\".fmt(rank,sn[1],sn[0]):println(_); });\n}\nfcn rankViaStandard(scores){\n rank:=1;\n foreach group in (group(scores)){ print(group,rank); rank+=group.len(); }\n}\nfcn rankViaModified(scores){\n rank:=0;\n foreach group in (group(scores)){ rank+=group.len(); print(group,rank); }\n}\nfcn rankViaDense(scores){\n rank:=1;\n foreach group in (group(scores)){ print(group,rank); rank+=1; }\n}\nfcn rankViaOrdinal(scores){\n scores.apply2('wrap(sn,rr){ \"%2s: %s (%d)\".fmt(rr.inc(),sn[1],sn[0]):println(_); },Ref(1));\n}\nfcn rankViaFractional(scores){\n rank:=1;\n foreach group in (group(scores)){\n n:=group.len(); r:=rank.reduce(n,'+,0.0)/n; rank+=n;\n print(group,\"%5.2f\".fmt(r));\n }\n}\n","language":"Zkl"},{"code":" // these are sorted!?!\nscores:=T(T(44,\"Solomon\"), T(42,\"Jason\"), T(42,\"Errol\"), T(41,\"Garry\"),\n T(41,\"Bernard\"),T(41,\"Barry\"),T(39,\"Stephen\"),);\n\"Standard:\" .println(); rankViaStandard(scores);\n\"Modified:\" .println(); rankViaModified(scores);\n\"Dense:\" .println(); rankViaDense(scores);\n\"Ordinal:\" .println(); rankViaOrdinal(scores);\n\"Fractional:\".println(); rankViaFractional(scores);\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Sorting\\nfrom: http://rosettacode.org/wiki/Ranking_methods\\nnote: Sorting Algorithms\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"{{Sorting Algorithm}}\\n\\nThe numerical rank of competitors in a competition shows if one is better than, equal to, or worse than another based on their results in a competition.\\n\\nThe numerical rank of a competitor can be assigned in several [[wp:Ranking|different ways]].\\n\\n\\n;Task:\\nThe following scores are accrued for all competitors of a competition (in best-first order):\\n<pre>44 Solomon\\n42 Jason\\n42 Errol\\n41 Garry\\n41 Bernard\\n41 Barry\\n39 Stephen</pre>\\n\\nFor each of the following ranking methods, create a function/method/procedure/subroutine... that applies the ranking method to an ordered list of scores with scorers:\\n# Standard. (Ties share what would have been their first ordinal number).\\n# Modified. (Ties share what would have been their last ordinal number).\\n# Dense. (Ties share the next available integer). \\n# Ordinal. ((Competitors take the next available integer. Ties are not treated otherwise).\\n# Fractional. (Ties share the mean of what would have been their ordinal numbers).\\n\\n<br>\\nSee the [[wp:Ranking|wikipedia article]] for a fuller description.\\n\\nShow here, on this page, the ranking of the test scores under each of the numbered ranking methods.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F mc_rank([(Int, String)] iterable)\\n ‘Modified competition ranking’\\n [(Float, (Int, String))] r\\n V lastresult = -1\\n [(Int, String)] fifo\\n L(item) iterable\\n I item[0] == lastresult\\n fifo [+]= item\\n E\\n V n = L.index\\n L !fifo.empty\\n r.append((n, fifo.pop(0)))\\n lastresult = item[0]\\n fifo [+]= item\\n L !fifo.empty\\n r.append((iterable.len, fifo.pop(0)))\\n R r\\n\\nF sc_rank([(Int, String)] iterable)\\n ‘Standard competition ranking’\\n [(Float, (Int, String))] r\\n V lastresult = -1\\n V lastrank = -1\\n L(item) iterable\\n I item[0] == lastresult\\n r.append((lastrank, item))\\n E\\n V n = L.index + 1\\n r.append((n, item))\\n lastresult = item[0]\\n lastrank = n\\n R r\\n\\nF d_rank([(Int, String)] iterable)\\n ‘Dense ranking’\\n [(Float, (Int, String))] r\\n V lastresult = -1\\n V lastrank = 0\\n L(item) iterable\\n I item[0] == lastresult\\n r.append((lastrank, item))\\n E\\n lastresult = item[0]\\n lastrank++\\n r.append((lastrank, item))\\n R r\\n\\nF o_rank([(Int, String)] iterable)\\n ‘Ordinal ranking’\\n R enumerate(iterable, 1).map((i, item) -> ((Float(i), item)))\\n\\nF f_rank([(Int, String)] iterable)\\n ‘Fractional ranking’\\n [(Float, (Int, String))] r\\n V last = -1\\n [(Int, (Int, String))] fifo\\n L(item) iterable\\n I item[0] != last\\n I !fifo.empty\\n V mean = Float(sum(fifo.map(f -> f[0]))) / fifo.len\\n L !fifo.empty\\n r.append((mean, fifo.pop(0)[1]))\\n last = item[0]\\n fifo.append((L.index + 1, item))\\n I !fifo.empty\\n V mean = sum(fifo.map(f -> f[0])) / fifo.len\\n L !fifo.empty\\n r.append((mean, fifo.pop(0)[1]))\\n R r\\n\\nV scores = [(44, ‘Solomon’),\\n (42, ‘Jason’),\\n (42, ‘Errol’),\\n (41, ‘Garry’),\\n (41, ‘Bernard’),\\n (41, ‘Barry’),\\n (39, ‘Stephen’)]\\n\\nprint(\\\"\\\\nScores to be ranked (best first):\\\")\\nL(n, s) scores\\n print(‘ #2 #.’.format(n, s))\\n\\nL(ranker, ranking_method) [(sc_rank, ‘Standard competition ranking’),\\n (mc_rank, ‘Modified competition ranking’),\\n (d_rank, ‘Dense ranking’),\\n (o_rank, ‘Ordinal ranking’),\\n (f_rank, ‘Fractional ranking’)]\\n print(\\\"\\\\n#.:\\\".format(ranking_method))\\n L(rank, score) ranker(scores)\\n print(‘ #3, (#., #.)’.format(rank, score[0], score[1]))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"BEGIN # rank some scores by various methods #\\n # MODE to hold the scores #\\n MODE RESULT = STRUCT( INT score, STRING name );\\n # returns the standard ranking of s #\\n PROC standard ranking = ( []RESULT s )[]INT:\\n IF LWB s > UPB s THEN []INT() # no scores #\\n ELSE # have some scores #\\n [ LWB s : UPB s ]INT ranked;\\n INT position := 1;\\n ranked[ LWB s ] := position;\\n FOR i FROM LWB s + 1 TO UPB s DO\\n ranked[ i ] := IF score OF s[ i ] = score OF s[ i - 1 ] THEN\\n # same score as the previous #\\n position\\n ELSE\\n # different score, increase the position #\\n position := i\\n FI\\n OD;\\n ranked\\n FI # standard ranking # ;\\n # returns the modified ranking of s #\\n PROC modified ranking = ( []RESULT s )[]INT:\\n IF LWB s > UPB s THEN []INT() # no scores #\\n ELSE # have some scores #\\n [ LWB s : UPB s ]INT ranked;\\n INT position := ( UPB s + 1 ) - LWB s;\\n ranked[ UPB s ] := position;\\n FOR i FROM UPB s - 1 BY -1 TO LWB s DO\\n ranked[ i ] := IF score OF s[ i ] = score OF s[ i + 1 ] THEN\\n # same score as the previous #\\n position\\n ELSE\\n # different score, decrease the position #\\n position := i\\n FI\\n OD;\\n ranked\\n FI # modified ranking # ;\\n # returns the debse ranking of s #\\n PROC dense ranking = ( []RESULT s )[]INT:\\n IF LWB s > UPB s THEN []INT() # no scores #\\n ELSE # have some scores #\\n [ LWB s : UPB s ]INT ranked;\\n INT position := 1;\\n ranked[ LWB s ] := position;\\n FOR i FROM LWB s + 1 TO UPB s DO\\n ranked[ i ] := IF score OF s[ i ] = score OF s[ i - 1 ] THEN\\n # same score as the previous #\\n position\\n ELSE\\n # different score, increase the position #\\n position +:= 1\\n FI\\n OD;\\n ranked\\n FI # dense ranking # ;\\n # returns the ordinal ranking of s #\\n PROC ordinal ranking = ( []RESULT s )[]INT:\\n IF LWB s > UPB s THEN []INT() # no scores #\\n ELSE # have some scores #\\n [ LWB s : UPB s ]INT ranked;\\n INT position := 0;\\n FOR i FROM LWB s TO UPB s DO\\n ranked[ i ] := position +:= 1\\n OD;\\n ranked\\n FI # ordinal ranking # ;\\n # regturns the fractional ranking of s #\\n PROC fractional ranking = ( []RESULT s )[]REAL:\\n IF LWB s > UPB s THEN []REAL() # no scores #\\n ELSE # have some scores #\\n [ LWB s : UPB s ]REAL ranked;\\n REAL position := 1;\\n FOR i FROM LWB s TO UPB s DO\\n ranked[ i ]\\n := IF IF i = LWB s\\n THEN FALSE\\n ELSE score OF s[ i ] = score OF s[ i - 1 ]\\n FI\\n THEN\\n # same score as the previous #\\n ranked[ i - 1 ]\\n ELSE\\n # first score or different score to the previous #\\n INT same count := 1;\\n INT sum := i;\\n FOR j FROM i + 1 TO UPB s\\n WHILE score OF s[ i ] = score OF s[ j ]\\n DO\\n same count +:= 1;\\n sum +:= j\\n OD;\\n sum / same count\\n FI\\n OD;\\n ranked\\n FI # fractional ranking # ;\\n # shows the integer ranking of some scores #\\n PROC show integral ranking = ( []RESULT s, []INT ranking, STRING title )VOID:\\n BEGIN\\n print( ( title, \\\" competition ranking:\\\", newline ) );\\n FOR i FROM LWB s TO UPB s DO\\n print( ( whole( ranking[ i ], -3 )\\n , \\\": \\\"\\n , whole( score OF s[ i ], -3 )\\n , \\\" \\\"\\n , name OF s[ i ]\\n , newline\\n )\\n )\\n OD;\\n print( ( newline ) )\\n END # show integral ranking # ;\\n # shows the real ranking of some scores #\\n PROC show real ranking = ( []RESULT s, []REAL ranking, STRING title )VOID:\\n BEGIN\\n print( ( title, \\\" competition ranking:\\\", newline ) );\\n FOR i FROM LWB s TO UPB s DO\\n print( ( IF INT integer rank = ENTIER ranking[ i ];\\n integer rank = ranking[ i ]\\n THEN\\n whole( integer rank, -3 ) + \\\" \\\"\\n ELSE\\n fixed( ranking[ i ], -6, 2 )\\n FI\\n , \\\": \\\"\\n , whole( score OF s[ i ], -3 ), \\\" \\\"\\n , name OF s[ i ]\\n , newline\\n )\\n )\\n OD;\\n print( ( newline ) )\\n END # show real ranking # ;\\n\\n # scores to rank - task test cases #\\n []RESULT scores = ( ( 44, \\\"Solomon\\\" )\\n , ( 42, \\\"Jason\\\" )\\n , ( 42, \\\"Errol\\\" )\\n , ( 41, \\\"Garry\\\" )\\n , ( 41, \\\"Bernard\\\" )\\n , ( 41, \\\"Barry\\\" )\\n , ( 39, \\\"Stephen\\\" )\\n );\\n show integral ranking( scores, standard ranking( scores ), \\\"standard\\\" );\\n show integral ranking( scores, modified ranking( scores ), \\\"modified\\\" );\\n show integral ranking( scores, dense ranking( scores ), \\\"dense\\\" );\\n show integral ranking( scores, ordinal ranking( scores ), \\\"ordinal\\\" );\\n show real ranking( scores, fractional ranking( scores ), \\\"fractional\\\" )\\n\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"standard ← ∊∘(⌊\\\\¨⊢⊂⍳∘≢)∘(1,2≠/⊢)∘(1⌷[2]⊢),⊢\\nmodified ← ∊∘(⌈\\\\∘⌽¨⊢⊂⍳∘≢)∘(1,2≠/⊢)∘(1⌷[2]⊢),⊢\\ndense ← (+\\\\1,2≠/1⌷[2]⊢),⊢\\nordinal ← ⍳∘≢,⊢\\nfractional ← ∊∘((≢(/∘⊢)+/÷≢)¨⊢⊂⍳∘≢)∘(1,2≠/⊢)∘(1⌷[2]⊢),⊢\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"use AppleScript version \\\"2.3.1\\\" -- Mac OS 10.9 (Mavericks) or later.\\nuse sorter : script ¬\\n \\\"Custom Iterative Ternary Merge Sort\\\" -- <www.macscripter.net/t/timsort-and-nigsort/71383/3>\\n\\n(* The ranking methods are implemented as script objects sharing inherited code. *)\\nscript standardRanking\\n -- Properties and handlers inherited or overridden by the other script objects.\\n -- The 'reference' is to a value that won't exist until 'results' is set to a list.\\n -- 'me' and 'my' pertain to the script object using the code at the time.\\n property results : missing value\\n property startIndex : 1\\n property endIndex : a reference to my results's length\\n property step : 1\\n property currentRank : missing value\\n property currentScore : missing value\\n\\n -- Main handler.\\n on resultsFrom(theScores)\\n copy theScores to my results\\n tell sorter to sort(my results, my startIndex, my endIndex, {comparer:me})\\n set my currentScore to my results's item (my startIndex)'s score\\n set my currentRank to my startIndex's contents\\n repeat with i from (my startIndex) to (my endIndex) by (my step)\\n my rankResult(i)\\n end repeat\\n set r to my results\\n set my results to missing value\\n return r\\n end resultsFrom\\n\\n -- Comparison handler used by the sort.\\n on isGreater(a, b)\\n if (a's score < b's score) then return true\\n return ((a's score = b's score) and (a's competitor comes after b's competitor))\\n end isGreater\\n\\n -- Ranking handler. Inherited by the modifiedRanking script; overridden by the others.\\n on rankResult(i)\\n set thisResult to my results's item i\\n set thisScore to thisResult's score\\n if (thisScore is not currentScore) then\\n set my currentRank to i\\n set my currentScore to thisScore\\n end if\\n set my results's item i to thisResult & {rank:my currentRank}\\n end rankResult\\nend script\\n\\nscript modifiedRanking\\n property parent : standardRanking\\n property startIndex : a reference to my results's length\\n property endIndex : 1\\n property step : -1\\nend script\\n\\nscript denseRanking\\n property parent : standardRanking\\n\\n on rankResult(i)\\n set thisResult to my results's item i\\n set thisScore to thisResult's score\\n if (thisScore is not my currentScore) then\\n set my currentRank to (my currentRank) + 1\\n set my currentScore to thisScore\\n end if\\n set my results's item i to thisResult & {rank:my currentRank}\\n end rankResult\\nend script\\n\\nscript ordinalRanking\\n property parent : standardRanking\\n\\n on rankResult(i)\\n set my results's item i to (my results's item i) & {rank:i}\\n end rankResult\\nend script\\n\\nscript fractionalRanking\\n property parent : standardRanking\\n\\n on rankResult(i)\\n set thisResult to my results's item i\\n set thisScore to thisResult's score\\n if (thisScore is not my currentScore) then\\n -- The average of any run of consecutive integers is that of the first and last.\\n set average to (i - 1 + (my currentRank)) / 2\\n repeat with j from (my currentRank) to (i - 1)\\n set my results's item j's rank to average\\n end repeat\\n set my currentRank to i\\n set my currentScore to thisScore\\n end if\\n set my results's item i to thisResult & {rank:i as real}\\n end rankResult\\nend script\\n\\n-- Task code:\\non formatRankings(type, theResults)\\n set rankings to {type}\\n repeat with thisResult in theResults\\n set end of rankings to (thisResult's rank as text) & tab & ¬\\n thisResult's competitor & \\\" (\\\" & thisResult's score & \\\")\\\"\\n end repeat\\n\\n return join(rankings, linefeed)\\nend formatRankings\\n\\non join(lst, delim)\\n set astid to AppleScript's text item delimiters\\n set AppleScript's text item delimiters to delim\\n set txt to lst as text\\n set AppleScript's text item delimiters to astid\\n return txt\\nend join\\n\\nlocal theScores, output\\nset theScores to {{score:44, competitor:\\\"Solomon\\\"}, {score:42, competitor:\\\"Jason\\\"}, ¬\\n {score:42, competitor:\\\"Errol\\\"}, {score:41, competitor:\\\"Garry\\\"}, {score:41, competitor:\\\"Bernard\\\"}, ¬\\n {score:41, competitor:\\\"Barry\\\"}, {score:39, competitor:\\\"Stephen\\\"}}\\nset output to {¬\\n formatRankings(\\\"Standard ranking:\\\", standardRanking's resultsFrom(theScores)), ¬\\n formatRankings(\\\"Modified ranking:\\\", modifiedRanking's resultsFrom(theScores)), ¬\\n formatRankings(\\\"Dense ranking:\\\", denseRanking's resultsFrom(theScores)), ¬\\n formatRankings(\\\"Ordinal ranking:\\\", ordinalRanking's resultsFrom(theScores)), ¬\\n formatRankings(\\\"Fractional ranking:\\\", fractionalRanking's resultsFrom(theScores)) ¬\\n }\\nreturn join(output, linefeed & linefeed)\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"\\\"Standard ranking:\\n1\\tSolomon (44)\\n2\\tErrol (42)\\n2\\tJason (42)\\n4\\tBarry (41)\\n4\\tBernard (41)\\n4\\tGarry (41)\\n7\\tStephen (39)\\n\\nModified ranking:\\n1\\tSolomon (44)\\n3\\tErrol (42)\\n3\\tJason (42)\\n6\\tBarry (41)\\n6\\tBernard (41)\\n6\\tGarry (41)\\n7\\tStephen (39)\\n\\nDense ranking:\\n1\\tSolomon (44)\\n2\\tErrol (42)\\n2\\tJason (42)\\n3\\tBarry (41)\\n3\\tBernard (41)\\n3\\tGarry (41)\\n4\\tStephen (39)\\n\\nOrdinal ranking:\\n1\\tSolomon (44)\\n2\\tErrol (42)\\n3\\tJason (42)\\n4\\tBarry (41)\\n5\\tBernard (41)\\n6\\tGarry (41)\\n7\\tStephen (39)\\n\\nFractional ranking:\\n1.0\\tSolomon (44)\\n2.5\\tErrol (42)\\n2.5\\tJason (42)\\n5.0\\tBarry (41)\\n5.0\\tBernard (41)\\n5.0\\tGarry (41)\\n7.0\\tStephen (39)\\\"\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"Rank(data, opt:=1){ ; opt = 1 Standard (default), 2 Modified, 3 Dense, 4 Ordinal, 5 Fractional\\n\\tfor index, val in StrSplit(data, \\\"`n\\\", \\\"`r\\\") {\\n\\t\\tRegExMatch(val, \\\"^(\\\\d+)\\\\s+(.*)\\\", Match)\\n\\t\\tif !(Match1=prev)\\n\\t\\t\\tn := index\\n\\t\\tprev := Match1\\n\\t\\tRes1 .= n \\\"`t\\\" Match \\\"`n\\\"\\n\\t\\tRes4 .= index \\\"`t\\\" Match \\\"`n\\\"\\n\\t\\tTemp .= n \\\":\\\" index \\\" \\\" Match \\\"`n\\\"\\n\\t}\\n\\tn:=0\\n\\twhile pos := RegExMatch(Temp, \\\"`asm)^(\\\\d+).*?\\\\R(?!\\\\1)|.+\\\", Match, pos?pos+StrLen(Match):1) {\\n\\t\\tn += StrSplit(Trim(Match, \\\"`r`n\\\"), \\\"`n\\\", \\\"`r\\\").MaxIndex()\\n\\t\\tRes2 .= RegExReplace(Match, \\\"`am)^\\\\d+:\\\\d+\\\", n \\\"`t\\\")\\n\\t\\tRes3 .= RegExReplace(Match, \\\"`am)^\\\\d+:\\\\d+\\\", A_Index \\\"`t\\\")\\n\\t\\tR := 0\\n\\t\\tfor index, val in StrSplit(Match, \\\"`n\\\", \\\"`r\\\")\\n\\t\\t\\tR += StrSplit(val, \\\":\\\").2\\n\\t\\tRes5 .= RegExReplace(Match, \\\"`am)^\\\\d+:\\\\d+\\\", RegExReplace(R / StrSplit(Trim(Match, \\\"`r`n\\\"), \\\"`n\\\", \\\"`r\\\").MaxIndex(), \\\"\\\\.?0+$\\\") \\\"`t\\\")\\n\\t}\\n\\treturn Res%opt%\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"data =\\n(\\n44 Solomon\\n42 Jason\\n42 Errol\\n41 Garry\\n41 Bernard\\n41 Barry\\n39 Stephen\\n)\\n\\nMsgBox, 262144, ,% \\\"\\\"\\n. \\\"Standard Ranking:`n\\\"\\t\\tRank(data)\\n. \\\"`nModified Ranking:`n\\\"\\tRank(data, 2)\\n. \\\"`nDense Ranking:`n\\\" \\t\\tRank(data, 3)\\n. \\\"`nOrdinal Ranking:`n\\\" \\tRank(data, 4)\\n. \\\"`nFractional Ranking:`n\\\"\\tRank(data, 5)\\nreturn\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"##\\n## Dense ranking in file: ranking_d.awk\\n##\\n\\nBEGIN{ lastresult = \\\"!\\\"; lastrank = 0 }\\n\\nfunction d_rank(){\\n if($1==lastresult){\\n print lastrank, $0\\n }else{\\n lastresult = $1\\n print ++lastrank, $0 }\\n}\\n//{d_rank() }\\n\\n##\\n## Fractional ranking in file: ranking_f.awk\\n##\\n\\nBEGIN{\\n last = \\\"!\\\"\\n flen = 0 }\\n\\nfunction f_rank(){\\n item = $0\\n if($1!=last){\\n if(flen){\\n sum = 0\\n for(fl=0; fl < flen;){\\n $0 = fifo[fl++]\\n sum += $1 }\\n mean = sum / flen\\n for(fl=0; fl < flen;){\\n $0 = fifo[fl++]\\n $1 = \\\"\\\"\\n printf(\\\"%3g %s\\\\n\\\", mean, $0) }\\n flen = 0\\n }}\\n $0 = item\\n last = $1\\n fifo[flen++] = sprintf(\\\"%i %s\\\", FNR, item)\\n}\\n//{f_rank()}\\n\\nEND{ if(flen){\\n sum = 0\\n for(fl=0; fl < flen;){\\n $0 = fifo[fl++]\\n sum += $1 }\\n mean = sum / flen\\n for(fl=0; fl < flen;){\\n $0 = fifo[fl++]\\n $1 = \\\"\\\"\\n printf(\\\"%3g %s\\\\n\\\", mean, $0) }}}\\n\\n##\\n## Modified competition ranking in file: ranking_mc.awk\\n##\\n\\nBEGIN{\\n lastresult = \\\"!\\\"\\n flen = 0 }\\n\\nfunction mc_rank(){\\n if($1==lastresult){\\n fifo[flen++] = $0\\n }else{\\n for(fl=0; fl < flen;){\\n print FNR-1, fifo[fl++]}\\n flen = 0\\n fifo[flen++] = $0\\n lastresult = $1}\\n}\\n//{mc_rank()}\\n\\nEND{ for(fl=0; fl < flen;){\\n print FNR, fifo[fl++]} }\\n\\n##\\n## Ordinal ranking in file: ranking_o.awk\\n##\\n\\nfunction o_rank(){ print FNR, $0 }\\n//{o_rank() }\\n\\n##\\n## Standard competition ranking in file: ranking_sc.awk\\n##\\n\\nBEGIN{ lastresult = lastrank = \\\"!\\\" }\\n\\nfunction sc_rank(){\\n if($1==lastresult){\\n print lastrank, $0\\n }else{\\n print FNR, $0\\n lastresult = $1\\n lastrank = FNR}\\n}\\n//{sc_rank()}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"10 READ N\\n20 DIM S(N),N$(N),R(N)\\n30 FOR I=1 TO N: READ S(I),N$(I): NEXT\\n40 PRINT \\\"--- Standard ranking ---\\\": GOSUB 100: GOSUB 400\\n50 PRINT \\\"--- Modified ranking ---\\\": GOSUB 150: GOSUB 400\\n60 PRINT \\\"--- Dense ranking ---\\\": GOSUB 200: GOSUB 400\\n70 PRINT \\\"--- Ordinal ranking ---\\\": GOSUB 250: GOSUB 400\\n80 PRINT \\\"--- Fractional ranking ---\\\": GOSUB 300: GOSUB 400\\n90 END\\n100 REM\\n101 REM ** Ordinal ranking **\\n110 R(1)=1\\n120 FOR I=2 TO N\\n130 IF S(I)=S(I-1) THEN R(I)=R(I-1) ELSE R(I)=I\\n140 NEXT: RETURN\\n150 REM\\n151 REM ** Modified ranking **\\n160 R(N)=N\\n170 FOR I=N-1 TO 1 STEP -1\\n180 IF S(I)=S(I+1) THEN R(I)=R(I+1) ELSE R(I)=I\\n190 NEXT: RETURN\\n200 REM\\n201 REM ** Dense ranking **\\n210 R(1)=1\\n220 FOR I=2 TO N: R(I)=R(I-1)-(S(I)<>S(I-1)): NEXT\\n230 RETURN\\n250 REM\\n251 REM ** Ordinal ranking **\\n260 FOR I=1 TO N: R(I)=I: NEXT: RETURN\\n300 REM\\n301 REM ** Fractional ranking **\\n310 I=1: J=2\\n320 IF J<=N THEN IF S(J-1)=S(J) THEN J=J+1: GOTO 320\\n330 FOR K=I TO J-1: R(K) = (I+J-1)/2: NEXT\\n340 I=J: J=J+1: IF I<=N THEN 320\\n350 RETURN\\n400 REM\\n401 REM ** Print the table ***\\n410 FOR I=1 TO N\\n420 PRINT USING \\\"\\\\ \\\\ ##, \\\\ \\\\\\\";STR$(R(I));S(I);N$(I)\\n430 NEXT\\n440 PRINT: RETURN\\n500 DATA 7\\n510 DATA 44,Solomon\\n520 DATA 42,Jason\\n530 DATA 42,Errol\\n540 DATA 41,Garry\\n550 DATA 41,Bernard\\n560 DATA 41,Barry\\n570 DATA 39,Stephen\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"#include<stdlib.h>\\n#include<stdio.h>\\n\\ntypedef struct{\\n\\tint score;\\n\\tchar name[100];\\n}entry;\\n\\nvoid ordinalRanking(entry* list,int len){\\n\\t\\n\\tint i;\\n\\t\\n\\tprintf(\\\"\\\\n\\\\nOrdinal Ranking\\\\n---------------\\\");\\n\\t\\n\\tfor(i=0;i<len;i++)\\n\\t\\tprintf(\\\"\\\\n%d\\\\t%d\\\\t%s\\\",i+1,list[i].score,list[i].name);\\n}\\n\\nvoid standardRanking(entry* list,int len){\\n\\t\\n\\tint i,j=1;\\n\\t\\n\\tprintf(\\\"\\\\n\\\\nStandard Ranking\\\\n----------------\\\");\\n\\t\\n\\tfor(i=0;i<len;i++){\\n\\t\\tprintf(\\\"\\\\n%d\\\\t%d\\\\t%s\\\",j,list[i].score,list[i].name);\\n\\t\\tif(list[i+1].score<list[i].score)\\n\\t\\t\\tj = i+2;\\n\\t}\\n}\\n\\nvoid denseRanking(entry* list,int len){\\n\\t\\n\\tint i,j=1;\\n\\t\\n\\tprintf(\\\"\\\\n\\\\nDense Ranking\\\\n-------------\\\");\\n\\t\\n\\tfor(i=0;i<len;i++){\\n\\t\\tprintf(\\\"\\\\n%d\\\\t%d\\\\t%s\\\",j,list[i].score,list[i].name);\\n\\t\\tif(list[i+1].score<list[i].score)\\n\\t\\t\\tj++;\\n\\t}\\n}\\n\\nvoid modifiedRanking(entry* list,int len){\\n\\t\\n\\tint i,j,count;\\n\\t\\n\\tprintf(\\\"\\\\n\\\\nModified Ranking\\\\n----------------\\\");\\n\\t\\n\\tfor(i=0;i<len-1;i++){\\n\\t\\tif(list[i].score!=list[i+1].score){\\n\\t\\t\\tprintf(\\\"\\\\n%d\\\\t%d\\\\t%s\\\",i+1,list[i].score,list[i].name);\\n\\t\\t\\tcount = 1;\\n\\t\\t\\tfor(j=i+1;list[j].score==list[j+1].score && j<len-1;j++)\\n\\t\\t\\t\\tcount ++;\\n\\t\\t\\tfor(j=0;j<count-1;j++)\\n\\t\\t\\t\\tprintf(\\\"\\\\n%d\\\\t%d\\\\t%s\\\",i+count+1,list[i+j+1].score,list[i+j+1].name);\\n\\t\\t\\ti += (count-1);\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"\\\\n%d\\\\t%d\\\\t%s\\\",len,list[len-1].score,list[len-1].name);\\n}\\n\\nvoid fractionalRanking(entry* list,int len){\\n\\t\\n\\tint i,j,count;\\n\\tfloat sum = 0;\\n\\t\\n\\tprintf(\\\"\\\\n\\\\nFractional Ranking\\\\n------------------\\\");\\n\\t\\n\\tfor(i=0;i<len;i++){\\n\\t\\tif(i==len-1 || list[i].score!=list[i+1].score)\\n\\t\\t\\tprintf(\\\"\\\\n%.1f\\\\t%d\\\\t%s\\\",(float)(i+1),list[i].score,list[i].name);\\n\\t\\telse if(list[i].score==list[i+1].score){\\n\\t\\t\\tsum = i;\\n\\t\\t\\tcount = 1;\\n\\t\\t\\tfor(j=i;list[j].score==list[j+1].score;j++){\\n\\t\\t\\t\\tsum += (j+1);\\n\\t\\t\\t\\tcount ++;\\n\\t\\t\\t}\\n\\t\\t\\tfor(j=0;j<count;j++)\\n\\t\\t\\t\\tprintf(\\\"\\\\n%.1f\\\\t%d\\\\t%s\\\",sum/count + 1,list[i+j].score,list[i+j].name);\\n\\t\\t\\ti += (count-1);\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid processFile(char* fileName){\\n\\tFILE* fp = fopen(fileName,\\\"r\\\");\\n\\tentry* list;\\n\\tint i,num;\\n\\t\\n\\tfscanf(fp,\\\"%d\\\",&num);\\n\\t\\n\\tlist = (entry*)malloc(num*sizeof(entry));\\n\\t\\n\\tfor(i=0;i<num;i++)\\n\\t\\tfscanf(fp,\\\"%d%s\\\",&list[i].score,list[i].name);\\n\\t\\n\\tfclose(fp);\\n\\t\\n\\tordinalRanking(list,num);\\n\\tstandardRanking(list,num);\\n\\tdenseRanking(list,num);\\n\\tmodifiedRanking(list,num);\\n\\tfractionalRanking(list,num);\\n}\\n\\nint main(int argC,char* argV[])\\n{\\n\\tif(argC!=2)\\n\\t\\tprintf(\\\"Usage %s <score list file>\\\");\\n\\telse\\n\\t\\tprocessFile(argV[1]);\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <iomanip>\\n#include <iostream>\\n#include <map>\\n#include <ostream>\\n#include <set>\\n#include <vector>\\n\\ntemplate<typename T>\\nstd::ostream& print(std::ostream& os, const T& src) {\\n auto it = src.cbegin();\\n auto end = src.cend();\\n\\n os << \\\"[\\\";\\n if (it != end) {\\n os << *it;\\n it = std::next(it);\\n }\\n while (it != end) {\\n os << \\\", \\\" << *it;\\n it = std::next(it);\\n }\\n\\n return os << \\\"]\\\";\\n}\\n\\ntypedef std::map<std::string, int> Map;\\ntypedef Map::value_type MapEntry;\\n\\nvoid standardRank(const Map& scores) {\\n std::cout << \\\"Standard Rank\\\" << std::endl;\\n\\n std::vector<int> list;\\n for (auto& elem : scores) {\\n list.push_back(elem.second);\\n }\\n std::sort(list.begin(), list.end(), std::greater<int>{});\\n list.erase(std::unique(list.begin(), list.end()), list.end());\\n\\n int rank = 1;\\n for (auto value : list) {\\n int temp = rank;\\n for (auto& e : scores) {\\n if (e.second == value) {\\n std::cout << temp << \\\" \\\" << value << \\\" \\\" << e.first.c_str() << std::endl;\\n rank++;\\n }\\n }\\n }\\n\\n std::cout << std::endl;\\n}\\n\\nvoid modifiedRank(const Map& scores) {\\n std::cout << \\\"Modified Rank\\\" << std::endl;\\n\\n std::vector<int> list;\\n for (auto& elem : scores) {\\n list.push_back(elem.second);\\n }\\n std::sort(list.begin(), list.end(), std::greater<int>{});\\n list.erase(std::unique(list.begin(), list.end()), list.end());\\n\\n int rank = 0;\\n for (auto value : list) {\\n rank += std::count_if(scores.begin(), scores.end(), [value](const MapEntry& e) { return e.second == value; });\\n for (auto& e : scores) {\\n if (e.second == value) {\\n std::cout << rank << \\\" \\\" << value << \\\" \\\" << e.first.c_str() << std::endl;\\n }\\n }\\n }\\n\\n std::cout << std::endl;\\n}\\n\\nvoid denseRank(const Map& scores) {\\n std::cout << \\\"Dense Rank\\\" << std::endl;\\n\\n std::vector<int> list;\\n for (auto& elem : scores) {\\n list.push_back(elem.second);\\n }\\n std::sort(list.begin(), list.end(), std::greater<int>{});\\n list.erase(std::unique(list.begin(), list.end()), list.end());\\n\\n int rank = 1;\\n for (auto value : list) {\\n for (auto& e : scores) {\\n if (e.second == value) {\\n std::cout << rank << \\\" \\\" << value << \\\" \\\" << e.first.c_str() << std::endl;\\n }\\n }\\n rank++;\\n }\\n\\n std::cout << std::endl;\\n}\\n\\nvoid ordinalRank(const Map& scores) {\\n std::cout << \\\"Ordinal Rank\\\" << std::endl;\\n\\n std::vector<int> list;\\n for (auto& elem : scores) {\\n list.push_back(elem.second);\\n }\\n std::sort(list.begin(), list.end(), std::greater<int>{});\\n list.erase(std::unique(list.begin(), list.end()), list.end());\\n\\n int rank = 1;\\n for (auto value : list) {\\n for (auto& e : scores) {\\n if (e.second == value) {\\n std::cout << rank++ << \\\" \\\" << value << \\\" \\\" << e.first.c_str() << std::endl;\\n }\\n }\\n }\\n\\n std::cout << std::endl;\\n}\\n\\nvoid fractionalRank(const Map& scores) {\\n std::cout << \\\"Ordinal Rank\\\" << std::endl;\\n\\n std::vector<int> list;\\n for (auto& elem : scores) {\\n list.push_back(elem.second);\\n }\\n std::sort(list.begin(), list.end(), std::greater<int>{});\\n list.erase(std::unique(list.begin(), list.end()), list.end());\\n\\n int rank = 0;\\n for (auto value : list) {\\n double avg = 0.0;\\n int cnt = 0;\\n\\n for (auto& e : scores) {\\n if (e.second == value) {\\n rank++;\\n cnt++;\\n avg += rank;\\n }\\n }\\n avg /= cnt;\\n\\n for (auto& e : scores) {\\n if (e.second == value) {\\n std::cout << std::setprecision(1) << std::fixed << avg << \\\" \\\" << value << \\\" \\\" << e.first.c_str() << std::endl;\\n }\\n }\\n }\\n\\n std::cout << std::endl;\\n}\\n\\nint main() {\\n using namespace std;\\n\\n map<string, int> scores{\\n {\\\"Solomon\\\", 44},\\n {\\\"Jason\\\", 42},\\n {\\\"Errol\\\", 42},\\n {\\\"Gary\\\", 41},\\n {\\\"Bernard\\\", 41},\\n {\\\"Barry\\\", 41},\\n {\\\"Stephen\\\", 39}\\n };\\n\\n standardRank(scores);\\n modifiedRank(scores);\\n denseRank(scores);\\n ordinalRank(scores);\\n fractionalRank(scores);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\nnamespace RankingMethods {\\n class Program {\\n static void Main(string[] args) {\\n Dictionary<string, int> scores = new Dictionary<string, int> {\\n [\\\"Solomon\\\"] = 44,\\n [\\\"Jason\\\"] = 42,\\n [\\\"Errol\\\"] = 42,\\n [\\\"Gary\\\"] = 41,\\n [\\\"Bernard\\\"] = 41,\\n [\\\"Barry\\\"] = 41,\\n [\\\"Stephen\\\"] = 39,\\n };\\n\\n StandardRank(scores);\\n ModifiedRank(scores);\\n DenseRank(scores);\\n OrdinalRank(scores);\\n FractionalRank(scores);\\n }\\n\\n static void StandardRank(Dictionary<string, int> data) {\\n Console.WriteLine(\\\"Standard Rank\\\");\\n\\n var list = data.Values.Distinct().ToList();\\n list.Sort((a, b) => b.CompareTo(a));\\n\\n int rank = 1;\\n foreach (var value in list) {\\n int temp = rank;\\n foreach (var k in data.Keys) {\\n if (data[k] == value) {\\n Console.WriteLine(\\\"{0} {1} {2}\\\", temp, value, k);\\n rank++;\\n }\\n }\\n }\\n\\n Console.WriteLine();\\n }\\n\\n static void ModifiedRank(Dictionary<string, int> data) {\\n Console.WriteLine(\\\"Modified Rank\\\");\\n\\n var list = data.Values.Distinct().ToList();\\n list.Sort((a, b) => b.CompareTo(a));\\n\\n int rank = 0;\\n foreach (var value in list) {\\n foreach (var k in data.Keys) {\\n if (data[k] == value) {\\n rank++;\\n }\\n }\\n\\n foreach (var k in data.Keys) {\\n if (data[k] == value) {\\n Console.WriteLine(\\\"{0} {1} {2}\\\", rank, data[k], k);\\n }\\n }\\n }\\n\\n Console.WriteLine();\\n }\\n\\n static void DenseRank(Dictionary<string, int> data) {\\n Console.WriteLine(\\\"Dense Rank\\\");\\n\\n var list = data.Values.Distinct().ToList();\\n list.Sort((a, b) => b.CompareTo(a));\\n\\n int rank = 1;\\n foreach (var value in list) {\\n foreach (var k in data.Keys) {\\n if (data[k] == value) {\\n Console.WriteLine(\\\"{0} {1} {2}\\\", rank, data[k], k);\\n }\\n }\\n rank++;\\n }\\n\\n Console.WriteLine();\\n }\\n\\n static void OrdinalRank(Dictionary<string, int> data) {\\n Console.WriteLine(\\\"Ordinal Rank\\\");\\n\\n var list = data.Values.Distinct().ToList();\\n list.Sort((a, b) => b.CompareTo(a));\\n\\n int rank = 1;\\n foreach (var value in list) {\\n foreach (var k in data.Keys) {\\n if (data[k] == value) {\\n Console.WriteLine(\\\"{0} {1} {2}\\\", rank, data[k], k);\\n rank++;\\n }\\n }\\n }\\n\\n Console.WriteLine();\\n }\\n\\n static void FractionalRank(Dictionary<string, int> data) {\\n Console.WriteLine(\\\"Fractional Rank\\\");\\n\\n var list = data.Values.Distinct().ToList();\\n list.Sort((a, b) => b.CompareTo(a));\\n\\n int rank = 0;\\n foreach (var value in list) {\\n double avg = 0;\\n int cnt = 0;\\n\\n foreach (var k in data.Keys) {\\n if (data[k] == value) {\\n rank++;\\n cnt++;\\n avg += rank;\\n }\\n }\\n avg /= cnt;\\n\\n foreach (var k in data.Keys) {\\n if (data[k] == value) {\\n Console.WriteLine(\\\"{0:F1} {1} {2}\\\", avg, data[k], k);\\n }\\n }\\n }\\n\\n Console.WriteLine();\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\n# List of competitors\\nrecord Competitor is\\n score: uint8;\\n name: [uint8];\\nend record;\\n\\nvar cs: Competitor[] := {\\n {44, \\\"Solomon\\\"},\\n {42, \\\"Jason\\\"},\\n {42, \\\"Errol\\\"},\\n {41, \\\"Garry\\\"},\\n {41, \\\"Bernard\\\"},\\n {41, \\\"Barry\\\"},\\n {39, \\\"Stephen\\\"}\\n};\\n\\n# Rank competitors given ranking method\\ninterface Ranking(c: [Competitor],\\n n: intptr,\\n len: intptr,\\n last: uint16): (rank: uint16);\\nsub Rank(cs: [Competitor], num: intptr, r: Ranking) is\\n var last: uint16 := 0;\\n var idx: intptr := 0;\\n\\n while idx < num loop\\n last := r(cs, idx, num, last);\\n if last < 100 then\\n print_i16(last);\\n else\\n # print fixed-point rank nicely\\n print_i16(last / 100);\\n print_char('.');\\n print_i16((last % 100) / 10);\\n print_i16(last % 10);\\n end if;\\n print(\\\". \\\");\\n print_i8(cs.score);\\n print(\\\", \\\");\\n print(cs.name);\\n print_nl();\\n idx := idx + 1;\\n cs := @next cs;\\n end loop;\\nend sub;\\n\\n# Standard ranking\\nvar stdcount: uint16 := 0;\\nsub Standard implements Ranking is\\n if n==0 then stdcount := 0; end if;\\n stdcount := stdcount + 1;\\n if n>0 and c.score == [@prev c].score then\\n rank := last;\\n else\\n rank := stdcount;\\n end if;\\nend sub;\\n\\n# Modified ranking\\nsub Modified implements Ranking is\\n rank := last;\\n if n == 0 or c.score != [@prev c].score then\\n while n < len loop\\n rank := rank + 1;\\n c := @next c;\\n if c.score != [@prev c].score then\\n break;\\n end if;\\n n := n + 1;\\n end loop;\\n end if;\\nend sub;\\n\\n# Dense ranking\\nsub Dense implements Ranking is\\n if n>0 and c.score == [@prev c].score then\\n rank := last;\\n else\\n rank := last + 1;\\n end if;\\nend sub;\\n\\n# Ordinal ranking\\nsub Ordinal implements Ranking is\\n rank := last + 1;\\nend sub;\\n\\n# Fractional ranking (with fixed point arithmetic)\\nsub Fractional implements Ranking is\\n rank := last;\\n if n==0 or c.score != [@prev c].score then\\n var sum: uint16 := 0;\\n var ct: uint16 := 0;\\n while n < len loop\\n sum := sum + (n as uint16 + 1);\\n ct := ct + 1;\\n c := @next c;\\n if c.score != [@prev c].score then\\n break;\\n end if;\\n n := n + 1;\\n end loop;\\n rank := (sum * 100) / (ct as uint16);\\n end if;\\nend sub;\\n\\nrecord Method is\\n name: [uint8];\\n method: Ranking;\\nend record;\\n\\nvar methods: Method[] := {\\n {\\\"Standard\\\", Standard},\\n {\\\"Modified\\\", Modified},\\n {\\\"Dense\\\", Dense},\\n {\\\"Ordinal\\\", Ordinal},\\n {\\\"Fractional\\\", Fractional}\\n};\\n\\nvar n: @indexof methods := 0;\\nwhile n < @sizeof methods loop\\n print(\\\"--- \\\");\\n print(methods[n].name);\\n print(\\\" ---\\\\n\\\");\\n Rank(&cs[0], @sizeof cs, methods[n].method);\\n print_nl();\\n n := n + 1;\\nend loop;\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"import std.algorithm;\\nimport std.stdio;\\n\\nvoid main() {\\n immutable scores = [\\n \\\"Solomon\\\": 44,\\n \\\"Jason\\\": 42,\\n \\\"Errol\\\": 42,\\n \\\"Garry\\\": 41,\\n \\\"Bernard\\\": 41,\\n \\\"Barry\\\": 41,\\n \\\"Stephen\\\": 39\\n ];\\n\\n scores.standardRank;\\n scores.modifiedRank;\\n scores.denseRank;\\n scores.ordinalRank;\\n scores.fractionalRank;\\n}\\n\\n/*\\nStandard ranking\\n1 44 Solomon\\n2 42 Jason\\n2 42 Errol\\n4 41 Garry\\n4 41 Bernard\\n4 41 Barry\\n7 39 Stephen\\n*/\\nvoid standardRank(const int[string] data) {\\n writeln(\\\"Standard Rank\\\");\\n\\n int rank = 1;\\n foreach (value; data.values.dup.sort!\\\"a>b\\\".uniq) {\\n int temp = rank;\\n foreach(k,v; data) {\\n if (v==value) {\\n writeln(temp, \\\" \\\", v, \\\" \\\", k);\\n rank++;\\n }\\n }\\n }\\n\\n writeln;\\n}\\n\\n/*\\nModified ranking\\n1 44 Solomon\\n3 42 Jason\\n3 42 Errol\\n6 41 Garry\\n6 41 Bernard\\n6 41 Barry\\n7 39 Stephen\\n*/\\nvoid modifiedRank(const int[string] data) {\\n writeln(\\\"Modified Rank\\\");\\n\\n int rank = 0;\\n foreach (value; data.values.dup.sort!\\\"a>b\\\".uniq) {\\n foreach(k,v; data) {\\n if (v==value) {\\n rank++;\\n }\\n }\\n foreach(k,v; data) {\\n if (v==value) {\\n writeln(rank, \\\" \\\", v, \\\" \\\", k);\\n }\\n }\\n }\\n\\n writeln;\\n}\\n\\n/*\\nDense ranking\\n1 44 Solomon\\n2 42 Jason\\n2 42 Errol\\n3 41 Garry\\n3 41 Bernard\\n3 41 Barry\\n4 39 Stephen\\n*/\\nvoid denseRank(const int[string] data) {\\n writeln(\\\"Dense Rank\\\");\\n\\n int rank = 1;\\n foreach (value; data.values.dup.sort!\\\"a>b\\\".uniq) {\\n foreach(k,v; data) {\\n if (v==value) {\\n writeln(rank, \\\" \\\", v, \\\" \\\", k);\\n }\\n }\\n rank++;\\n }\\n\\n writeln;\\n}\\n\\n/*\\nOrdinal ranking\\n1 44 Solomon\\n2 42 Jason\\n3 42 Errol\\n4 41 Garry\\n5 41 Bernard\\n6 41 Barry\\n7 39 Stephen\\n*/\\nvoid ordinalRank(const int[string] data) {\\n writeln(\\\"Ordinal Rank\\\");\\n\\n int rank = 1;\\n foreach (value; data.values.dup.sort!\\\"a>b\\\".uniq) {\\n foreach(k,v; data) {\\n if (v==value) {\\n writeln(rank, \\\" \\\", v, \\\" \\\", k);\\n rank++;\\n }\\n }\\n }\\n\\n writeln;\\n}\\n\\n/*\\nFractional ranking\\n1,0 44 Solomon\\n2,5 42 Jason\\n2,5 42 Errol\\n5,0 41 Garry\\n5,0 41 Bernard\\n5,0 41 Barry\\n7,0 39 Stephen\\n*/\\nvoid fractionalRank(const int[string] data) {\\n writeln(\\\"Fractional Rank\\\");\\n\\n int rank = 0;\\n foreach (value; data.values.dup.sort!\\\"a>b\\\".uniq) {\\n real avg = 0;\\n int cnt;\\n\\n foreach(k,v; data) {\\n if (v==value) {\\n rank++;\\n cnt++;\\n avg+=rank;\\n }\\n }\\n avg /= cnt;\\n\\n foreach(k,v; data) {\\n if (v==value) {\\n writef(\\\"%0.1f \\\", avg);\\n writeln(v, \\\" \\\", k);\\n }\\n }\\n }\\n\\n writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"defmodule Ranking do\\n def methods(data) do\\n IO.puts \\\"stand.\\\\tmod.\\\\tdense\\\\tord.\\\\tfract.\\\"\\n Enum.group_by(data, fn {score,_name} -> score end)\\n |> Enum.map(fn {score,pairs} ->\\n names = Enum.map(pairs, fn {_,name} -> name end) |> Enum.reverse\\n {score, names}\\n end)\\n |> Enum.sort_by(fn {score,_} -> -score end)\\n |> Enum.with_index\\n |> Enum.reduce({1,0,0}, fn {{score, names}, i}, {s_rnk, m_rnk, o_rnk} ->\\n d_rnk = i + 1\\n m_rnk = m_rnk + length(names)\\n f_rnk = ((s_rnk + m_rnk) / 2) |> to_string |> String.replace(\\\".0\\\",\\\"\\\")\\n o_rnk = Enum.reduce(names, o_rnk, fn name,acc ->\\n IO.puts \\\"#{s_rnk}\\\\t#{m_rnk}\\\\t#{d_rnk}\\\\t#{acc+1}\\\\t#{f_rnk}\\\\t#{score} #{name}\\\"\\n acc + 1\\n end)\\n {s_rnk+length(names), m_rnk, o_rnk}\\n end)\\n end\\nend\\n\\n~w\\\"44 Solomon\\n 42 Jason\\n 42 Errol\\n 41 Garry\\n 41 Bernard\\n 41 Barry\\n 39 Stephen\\\"\\n|> Enum.chunk(2)\\n|> Enum.map(fn [score,name] -> {String.to_integer(score),name} end)\\n|> Ranking.methods\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"USING: arrays assocs formatting fry generalizations io kernel\\nmath math.ranges math.statistics math.vectors sequences\\nsplitting.monotonic ;\\nIN: rosetta-code.ranking\\n\\nCONSTANT: ranks {\\n { 44 \\\"Solomon\\\" } { 42 \\\"Jason\\\" } { 42 \\\"Errol\\\" }\\n { 41 \\\"Garry\\\" } { 41 \\\"Bernard\\\" } { 41 \\\"Barry\\\" }\\n { 39 \\\"Stephen\\\" }\\n}\\n\\n: rank ( seq quot -- seq' )\\n '[ [ = ] monotonic-split [ length ] map dup @ [ <array> ]\\n 2map concat ] call ; inline\\n\\n: standard ( seq -- seq' ) [ cum-sum0 1 v+n ] rank ;\\n: modified ( seq -- seq' ) [ cum-sum ] rank ;\\n: dense ( seq -- seq' ) [ length [1,b] ] rank ;\\n: ordinal ( seq -- seq' ) length [1,b] ;\\n\\n: fractional ( seq -- seq' )\\n [ dup cum-sum swap [ dupd - [a,b) mean ] 2map ] rank ;\\n\\n: .rank ( quot -- )\\n [ ranks dup keys ] dip call swap\\n [ first2 \\\"%5u %d %s\\\\n\\\" printf ] 2each ; inline\\n\\n: ranking-demo ( -- )\\n \\\"Standard ranking\\\" [ standard ]\\n \\\"Modified ranking\\\" [ modified ]\\n \\\"Dense ranking\\\" [ dense ]\\n \\\"Ordinal ranking\\\" [ ordinal ]\\n \\\"Fractional ranking\\\" [ fractional ]\\n [ [ print ] [ .rank nl ] bi* ] 2 5 mnapply ;\\n\\nMAIN: ranking-demo\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Data 44,\\\"Solomon\\\", 42,\\\"Jason\\\", 42,\\\"Errol\\\", 41,\\\"Garry\\\"\\nData 41,\\\"Bernard\\\", 41,\\\"Barry\\\", 39,\\\"Stephen\\\"\\n\\nDim Shared As Integer n = 7\\nDim Shared As Integer puntos(n), i\\nDim Shared As Single ptosnom(n)\\nDim Shared As String nombre(n)\\n\\nPrint \\\"Puntuaciones a clasificar (mejores primero):\\\"\\nFor i = 1 To n\\n Read puntos(i), nombre(i)\\n Print Using \\\" ##, \\\\ \\\\\\\"; puntos(i); nombre(i)\\nNext i\\nPrint\\n\\nSub MostarTabla\\n For i = 1 To n\\n Print Using \\\" \\\\ \\\\ ##, \\\\ \\\\\\\"; Str(ptosnom(i)); puntos(i); nombre(i)\\n Next i\\n Print\\nEnd Sub\\n\\nPrint \\\"--- Standard ranking ---\\\"\\nptosnom(1) = 1\\nFor i = 2 To n\\n If puntos(i) = puntos(i-1) Then ptosnom(i) = ptosnom(i-1) Else ptosnom(i) = i\\nNext i\\nMostarTabla\\n\\n\\nPrint \\\"--- Modified ranking ---\\\"\\nptosnom(n) = n\\nFor i = n-1 To 1 Step -1\\n If puntos(i) = puntos(i+1) Then ptosnom(i) = ptosnom(i+1) Else ptosnom(i) = i\\nNext i\\nMostarTabla\\n\\nPrint \\\"--- Dense ranking ---\\\"\\nptosnom(1) = 1\\nFor i = 2 To n\\n ptosnom(i) = ptosnom(i-1) - (puntos(i) <> puntos(i-1))\\nNext i\\nMostarTabla\\n\\nPrint \\\"--- Ordinal ranking ---\\\"\\nFor i = 1 To n\\n ptosnom(i) = i\\nNext i\\nMostarTabla\\n\\nPrint \\\"--- Fractional ranking ---\\\"\\ni = 1\\nDim As Integer j = 2\\nDo\\n If j <= n Then If (puntos(j-1) = puntos(j)) Then j += 1\\n For k As Integer = i To j-1\\n ptosnom(k) = (i+j-1) / 2\\n Next k\\n i = j\\n j += 1\\nLoop While i <= n\\nMostarTabla\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"fmt\\\"\\n\\t\\\"sort\\\"\\n)\\n\\ntype rankable interface {\\n\\tLen() int\\n\\tRankEqual(int, int) bool\\n}\\n\\nfunc StandardRank(d rankable) []float64 {\\n\\tr := make([]float64, d.Len())\\n\\tvar k int\\n\\tfor i := range r {\\n\\t\\tif i == 0 || !d.RankEqual(i, i-1) {\\n\\t\\t\\tk = i + 1\\n\\t\\t}\\n\\t\\tr[i] = float64(k)\\n\\t}\\n\\treturn r\\n}\\n\\nfunc ModifiedRank(d rankable) []float64 {\\n\\tr := make([]float64, d.Len())\\n\\tfor i := range r {\\n\\t\\tk := i + 1\\n\\t\\tfor j := i + 1; j < len(r) && d.RankEqual(i, j); j++ {\\n\\t\\t\\tk = j + 1\\n\\t\\t}\\n\\t\\tr[i] = float64(k)\\n\\t}\\n\\treturn r\\n}\\n\\nfunc DenseRank(d rankable) []float64 {\\n\\tr := make([]float64, d.Len())\\n\\tvar k int\\n\\tfor i := range r {\\n\\t\\tif i == 0 || !d.RankEqual(i, i-1) {\\n\\t\\t\\tk++\\n\\t\\t}\\n\\t\\tr[i] = float64(k)\\n\\t}\\n\\treturn r\\n}\\n\\nfunc OrdinalRank(d rankable) []float64 {\\n\\tr := make([]float64, d.Len())\\n\\tfor i := range r {\\n\\t\\tr[i] = float64(i + 1)\\n\\t}\\n\\treturn r\\n}\\n\\nfunc FractionalRank(d rankable) []float64 {\\n\\tr := make([]float64, d.Len())\\n\\tfor i := 0; i < len(r); {\\n\\t\\tvar j int\\n\\t\\tf := float64(i + 1)\\n\\t\\tfor j = i + 1; j < len(r) && d.RankEqual(i, j); j++ {\\n\\t\\t\\tf += float64(j + 1)\\n\\t\\t}\\n\\t\\tf /= float64(j - i)\\n\\t\\tfor ; i < j; i++ {\\n\\t\\t\\tr[i] = f\\n\\t\\t}\\n\\t}\\n\\treturn r\\n}\\n\\ntype scores []struct {\\n\\tscore int\\n\\tname string\\n}\\n\\nfunc (s scores) Len() int { return len(s) }\\nfunc (s scores) RankEqual(i, j int) bool { return s[i].score == s[j].score }\\nfunc (s scores) Swap(i, j int) { s[i], s[j] = s[j], s[i] }\\nfunc (s scores) Less(i, j int) bool {\\n\\tif s[i].score != s[j].score {\\n\\t\\treturn s[i].score > s[j].score\\n\\t}\\n\\treturn s[i].name < s[j].name\\n}\\n\\nvar data = scores{\\n\\t{44, \\\"Solomon\\\"},\\n\\t{42, \\\"Jason\\\"},\\n\\t{42, \\\"Errol\\\"},\\n\\t{41, \\\"Garry\\\"},\\n\\t{41, \\\"Bernard\\\"},\\n\\t{41, \\\"Barry\\\"},\\n\\t{39, \\\"Stephen\\\"},\\n}\\n\\nfunc main() {\\n\\tshow := func(name string, fn func(rankable) []float64) {\\n\\t\\tfmt.Println(name, \\\"Ranking:\\\")\\n\\t\\tr := fn(data)\\n\\t\\tfor i, d := range data {\\n\\t\\t\\tfmt.Printf(\\\"%4v - %2d %s\\\\n\\\", r[i], d.score, d.name)\\n\\t\\t}\\n\\t}\\n\\n\\tsort.Sort(data)\\n\\tshow(\\\"Standard\\\", StandardRank)\\n\\tshow(\\\"\\\\nModified\\\", ModifiedRank)\\n\\tshow(\\\"\\\\nDense\\\", DenseRank)\\n\\tshow(\\\"\\\\nOrdinal\\\", OrdinalRank)\\n\\tshow(\\\"\\\\nFractional\\\", FractionalRank)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List (groupBy, sortBy, intercalate)\\n\\ntype Item = (Int, String)\\n\\ntype ItemList = [Item]\\n\\ntype ItemGroups = [ItemList]\\n\\ntype RankItem a = (a, Int, String)\\n\\ntype RankItemList a = [RankItem a]\\n\\n-- make sure the input is ordered and grouped by score\\nprepare :: ItemList -> ItemGroups\\nprepare = groupBy gf . sortBy (flip compare)\\n where\\n gf (a, _) (b, _) = a == b\\n\\n-- give an item a rank\\nrank\\n :: Num a\\n => a -> Item -> RankItem a\\nrank n (a, b) = (n, a, b)\\n\\n-- ranking methods\\nstandard, modified, dense, ordinal :: ItemGroups -> RankItemList Int\\nstandard = ms 1\\n where\\n ms _ [] = []\\n ms n (x:xs) = (rank n <$> x) ++ ms (n + length x) xs\\n\\nmodified = md 1\\n where\\n md _ [] = []\\n md n (x:xs) =\\n let l = length x\\n nl = n + l\\n nl1 = nl - 1\\n in (rank nl1 <$> x) ++ md (n + l) xs\\n\\ndense = md 1\\n where\\n md _ [] = []\\n md n (x:xs) = map (rank n) x ++ md (n + 1) xs\\n\\nordinal = zipWith rank [1 ..] . concat\\n\\nfractional :: ItemGroups -> RankItemList Double\\nfractional = mf 1.0\\n where\\n mf _ [] = []\\n mf n (x:xs) =\\n let l = length x\\n o = take l [n ..]\\n ld = fromIntegral l\\n a = sum o / ld\\n in map (rank a) x ++ mf (n + ld) xs\\n\\n-- sample data\\ntest :: ItemGroups\\ntest =\\n prepare\\n [ (44, \\\"Solomon\\\")\\n , (42, \\\"Jason\\\")\\n , (42, \\\"Errol\\\")\\n , (41, \\\"Garry\\\")\\n , (41, \\\"Bernard\\\")\\n , (41, \\\"Barry\\\")\\n , (39, \\\"Stephen\\\")\\n ]\\n\\n-- print rank items nicely\\nnicePrint\\n :: Show a\\n => String -> RankItemList a -> IO ()\\nnicePrint xs items = do\\n putStrLn xs\\n mapM_ np items\\n putStr \\\"\\\\n\\\"\\n where\\n np (a, b, c) = putStrLn $ intercalate \\\"\\\\t\\\" [show a, show b, c]\\n\\nmain :: IO ()\\nmain = do\\n nicePrint \\\"Standard:\\\" $ standard test\\n nicePrint \\\"Modified:\\\" $ modified test\\n nicePrint \\\"Dense:\\\" $ dense test\\n nicePrint \\\"Ordinal:\\\" $ ordinal test\\n nicePrint \\\"Fractional:\\\" $ fractional test\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"competitors=:<;._1;._2]0 :0\\n 44 Solomon\\n 42 Jason\\n 42 Errol\\n 41 Garry\\n 41 Bernard\\n 41 Barry\\n 39 Stephen\\n)\\n\\nscores=: {.\\\"1\\n\\nstandard=: 1+i.~\\nmodified=: 1+i:~\\ndense=: #/.~ # #\\\\@~.\\nordinal=: #\\\\\\nfractional=: #/.~ # ] (+/%#)/. #\\\\\\n\\nrank=:1 :'<\\\"0@u@:scores,.]'\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" standard rank competitors\\n┌─┬──┬───────┐\\n│1│44│Solomon│\\n├─┼──┼───────┤\\n│2│42│Jason │\\n├─┼──┼───────┤\\n│2│42│Errol │\\n├─┼──┼───────┤\\n│4│41│Garry │\\n├─┼──┼───────┤\\n│4│41│Bernard│\\n├─┼──┼───────┤\\n│4│41│Barry │\\n├─┼──┼───────┤\\n│7│39│Stephen│\\n└─┴──┴───────┘\\n modified rank competitors\\n┌─┬──┬───────┐\\n│1│44│Solomon│\\n├─┼──┼───────┤\\n│3│42│Jason │\\n├─┼──┼───────┤\\n│3│42│Errol │\\n├─┼──┼───────┤\\n│6│41│Garry │\\n├─┼──┼───────┤\\n│6│41│Bernard│\\n├─┼──┼───────┤\\n│6│41│Barry │\\n├─┼──┼───────┤\\n│7│39│Stephen│\\n└─┴──┴───────┘\\n dense rank competitors\\n┌─┬──┬───────┐\\n│1│44│Solomon│\\n├─┼──┼───────┤\\n│2│42│Jason │\\n├─┼──┼───────┤\\n│2│42│Errol │\\n├─┼──┼───────┤\\n│3│41│Garry │\\n├─┼──┼───────┤\\n│3│41│Bernard│\\n├─┼──┼───────┤\\n│3│41│Barry │\\n├─┼──┼───────┤\\n│4│39│Stephen│\\n└─┴──┴───────┘\\n ordinal rank competitors\\n┌─┬──┬───────┐\\n│1│44│Solomon│\\n├─┼──┼───────┤\\n│2│42│Jason │\\n├─┼──┼───────┤\\n│3│42│Errol │\\n├─┼──┼───────┤\\n│4│41│Garry │\\n├─┼──┼───────┤\\n│5│41│Bernard│\\n├─┼──┼───────┤\\n│6│41│Barry │\\n├─┼──┼───────┤\\n│7│39│Stephen│\\n└─┴──┴───────┘\\n fractional rank competitors\\n┌───┬──┬───────┐\\n│1 │44│Solomon│\\n├───┼──┼───────┤\\n│2.5│42│Jason │\\n├───┼──┼───────┤\\n│2.5│42│Errol │\\n├───┼──┼───────┤\\n│5 │41│Garry │\\n├───┼──┼───────┤\\n│5 │41│Bernard│\\n├───┼──┼───────┤\\n│5 │41│Barry │\\n├───┼──┼───────┤\\n│7 │39│Stephen│\\n└───┴──┴───────┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.*;\\n\\npublic class RankingMethods {\\n\\n final static String[] input = {\\\"44 Solomon\\\", \\\"42 Jason\\\", \\\"42 Errol\\\",\\n \\\"41 Garry\\\", \\\"41 Bernard\\\", \\\"41 Barry\\\", \\\"39 Stephen\\\"};\\n\\n public static void main(String[] args) {\\n int len = input.length;\\n\\n Map<String, int[]> map = new TreeMap<>((a, b) -> b.compareTo(a));\\n for (int i = 0; i < len; i++) {\\n String key = input[i].split(\\\"\\\\\\\\s+\\\")[0];\\n int[] arr;\\n if ((arr = map.get(key)) == null)\\n arr = new int[]{i, 0};\\n arr[1]++;\\n map.put(key, arr);\\n }\\n int[][] groups = map.values().toArray(new int[map.size()][]);\\n\\n standardRanking(len, groups);\\n modifiedRanking(len, groups);\\n denseRanking(len, groups);\\n ordinalRanking(len);\\n fractionalRanking(len, groups);\\n }\\n\\n private static void standardRanking(int len, int[][] groups) {\\n System.out.println(\\\"\\\\nStandard ranking\\\");\\n for (int i = 0, rank = 0, group = 0; i < len; i++) {\\n if (group < groups.length && i == groups[group][0]) {\\n rank = i + 1;\\n group++;\\n }\\n System.out.printf(\\\"%d %s%n\\\", rank, input[i]);\\n }\\n }\\n\\n private static void modifiedRanking(int len, int[][] groups) {\\n System.out.println(\\\"\\\\nModified ranking\\\");\\n for (int i = 0, rank = 0, group = 0; i < len; i++) {\\n if (group < groups.length && i == groups[group][0])\\n rank += groups[group++][1];\\n System.out.printf(\\\"%d %s%n\\\", rank, input[i]);\\n }\\n }\\n\\n private static void denseRanking(int len, int[][] groups) {\\n System.out.println(\\\"\\\\nDense ranking\\\");\\n for (int i = 0, rank = 0; i < len; i++) {\\n if (rank < groups.length && i == groups[rank][0])\\n rank++;\\n System.out.printf(\\\"%d %s%n\\\", rank, input[i]);\\n }\\n }\\n\\n private static void ordinalRanking(int len) {\\n System.out.println(\\\"\\\\nOrdinal ranking\\\");\\n for (int i = 0; i < len; i++)\\n System.out.printf(\\\"%d %s%n\\\", i + 1, input[i]);\\n }\\n\\n private static void fractionalRanking(int len, int[][] groups) {\\n System.out.println(\\\"\\\\nFractional ranking\\\");\\n float rank = 0;\\n for (int i = 0, tmp = 0, group = 0; i < len; i++) {\\n if (group < groups.length && i == groups[group][0]) {\\n tmp += groups[group++][1];\\n rank = (i + 1 + tmp) / 2.0F;\\n }\\n System.out.printf(\\\"%2.1f %s%n\\\", rank, input[i]);\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"(function () {\\n\\n var xs = 'Solomon Jason Errol Garry Bernard Barry Stephen'.split(' '),\\n ns = [44, 42, 42, 41, 41, 41, 39],\\n\\n sorted = xs.map(function (x, i) {\\n return { name: x, score: ns[i] };\\n }).sort(function (a, b) {\\n var c = b.score - a.score;\\n return c ? c : a.name < b.name ? -1 : a.name > b.name ? 1 : 0;\\n }),\\n\\n names = sorted.map(function (x) { return x.name; }),\\n scores = sorted.map(function (x) { return x.score; }),\\n\\n reversed = scores.slice(0).reverse(),\\n unique = scores.filter(function (x, i) {\\n return scores.indexOf(x) === i;\\n });\\n\\n // RANKINGS AS FUNCTIONS OF SCORES: SORTED, REVERSED AND UNIQUE\\n\\n var rankings = function (score, index) {\\n return {\\n name: names[index],\\n score: score,\\n\\n Ordinal: index + 1,\\n\\n Standard: function (n) {\\n return scores.indexOf(n) + 1;\\n }(score),\\n\\n Modified: function (n) {\\n return reversed.length - reversed.indexOf(n);\\n }(score),\\n\\n Dense: function (n) {\\n return unique.indexOf(n) + 1;\\n }(score),\\n\\n Fractional: function (n) {\\n return (\\n (scores.indexOf(n) + 1) +\\n (reversed.length - reversed.indexOf(n))\\n ) / 2;\\n }(score)\\n };\\n },\\n\\n tbl = [\\n 'Name Score Standard Modified Dense Ordinal Fractional'.split(' ')\\n ].concat(scores.map(rankings).reduce(function (a, x) {\\n return a.concat([\\n [x.name, x.score,\\n x.Standard, x.Modified, x.Dense, x.Ordinal, x.Fractional\\n ]\\n ]);\\n }, [])),\\n\\n //[[a]] -> bool -> s -> s\\n wikiTable = function (lstRows, blnHeaderRow, strStyle) {\\n return '{| class=\\\"wikitable\\\" ' + (\\n strStyle ? 'style=\\\"' + strStyle + '\\\"' : ''\\n ) + lstRows.map(function (lstRow, iRow) {\\n var strDelim = ((blnHeaderRow && !iRow) ? '!' : '|');\\n\\n return '\\\\n|-\\\\n' + strDelim + ' ' + lstRow.map(function (v) {\\n return typeof v === 'undefined' ? ' ' : v;\\n }).join(' ' + strDelim + strDelim + ' ');\\n }).join('') + '\\\\n|}';\\n };\\n\\n return wikiTable(tbl, true, 'text-align:center');\\n\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"((() => {\\n const xs = 'Solomon Jason Errol Garry Bernard Barry Stephen'.split(' '),\\n ns = [44, 42, 42, 41, 41, 41, 39];\\n\\n const sorted = xs.map((x, i) => ({\\n name: x,\\n score: ns[i]\\n }))\\n .sort((a, b) => {\\n const c = b.score - a.score;\\n return c ? c : a.name < b.name ? -1 : a.name > b.name ? 1 : 0;\\n });\\n\\n const names = sorted.map(x => x.name),\\n scores = sorted.map(x => x.score),\\n reversed = scores.slice(0)\\n .reverse(),\\n unique = scores.filter((x, i) => scores.indexOf(x) === i);\\n\\n // RANKINGS AS FUNCTIONS OF SCORES: SORTED, REVERSED AND UNIQUE\\n\\n // rankings :: Int -> Int -> Dictonary\\n const rankings = (score, index) => ({\\n name: names[index],\\n score,\\n Ordinal: index + 1,\\n Standard: scores.indexOf(score) + 1,\\n Modified: reversed.length - reversed.indexOf(score),\\n Dense: unique.indexOf(score) + 1,\\n\\n Fractional: (n => (\\n (scores.indexOf(n) + 1) +\\n (reversed.length - reversed.indexOf(n))\\n ) / 2)(score)\\n });\\n\\n // tbl :: [[[a]]]\\n const tbl = [\\n 'Name Score Standard Modified Dense Ordinal Fractional'.split(' ')\\n ].concat(scores.map(rankings)\\n .reduce((a, x) => a.concat([\\n [x.name, x.score,\\n x.Standard, x.Modified, x.Dense, x.Ordinal, x.Fractional\\n ]\\n ]), []));\\n\\n // wikiTable :: [[[a]]] -> Bool -> String -> String\\n const wikiTable = (lstRows, blnHeaderRow, strStyle) =>\\n `{| class=\\\"wikitable\\\" ${strStyle ? 'style=\\\"' + strStyle + '\\\"' : ''}\\n ${lstRows.map((lstRow, iRow) => {\\n const strDelim = ((blnHeaderRow && !iRow) ? '!' : '|');\\n\\n return '\\\\n|-\\\\n' + strDelim + ' ' + lstRow\\n .map(v => typeof v === 'undefined' ? ' ' : v)\\n .join(' ' + strDelim + strDelim + ' ');\\n }).join('')}\\\\n|}`;\\n\\n return wikiTable(tbl, true, 'text-align:center');\\n}))();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Ties share what would have been their first ordinal number\\ndef standard_ranking:\\n . as $raw\\n | ([range(1;length;2) | $raw[.]]) as $scores\\n | reduce range(1; $scores|length) as $i\\n ([1]; if $scores[$i - 1] == $scores[$i] then . + [.[-1]]\\n else . + [$i + 1]\\n end) ;\\n\\ndef modified_ranking:\\n # The helper function resolves [ranks, tentative]\\n # by appending the ranks of the ties to \\\"ranks\\\"\\n def resolve:\\n (.[1] | length) as $length\\n | if $length == 0 then .[0]\\n else .[1][-1] as $max\\n | .[0] + ( .[1] | map( $max) )\\n end ;\\n . as $raw\\n | ([range(1;length;2) | $raw[.]]) as $scores\\n | reduce range(1; $scores|length) as $i\\n # state: [ranks, tentative]\\n ([ [], [1] ];\\n if $scores[$i - 1] == $scores[$i] then [.[0], .[1] + [ $i + 1 ]]\\n else [ resolve, [ $i + 1 ] ]\\n end )\\n | resolve ;\\n\\ndef dense_ranking: # next available\\n . as $raw\\n | ([range(1;length;2) | $raw[.]]) as $scores\\n | reduce range(1; $scores|length) as $i\\n ([1]; if $scores[$i - 1] == $scores[$i] then . + [.[-1]]\\n else . + [ .[-1] + 1]\\n end );\\n\\ndef ordinal_ranking: # unfair to some!\\n [ range(1; 1 + length/2) ] ;\\n\\ndef fractional_ranking:\\n # The helper function resolves [ranks, tentative]\\n # by appending the averages of the tentative ranks to \\\"ranks\\\"\\n def resolve:\\n (.[1] | length) as $length\\n | if $length == 0 then .[0]\\n else (.[1] | add / $length) as $avg\\n | .[0] + ( .[1] | map( $avg) )\\n end ;\\n . as $raw\\n | ([range(1;length;2) | $raw[.]]) as $scores\\n | reduce range(1; $scores|length) as $i\\n # state: [ranks, tentative]\\n ([ [], [1] ];\\n if $scores[$i - 1] == $scores[$i] then [.[0], .[1] + [ $i + 1 ]]\\n else [ resolve, [ $i + 1 ] ]\\n end )\\n | resolve ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def raw:\\n [\\n \\\"Solomon\\\", 44,\\n \\\"Jason\\\" , 42,\\n \\\"Errol\\\" , 42,\\n \\\"Garry\\\" , 41,\\n \\\"Bernard\\\", 41,\\n \\\"Barry\\\" , 41,\\n \\\"Stephen\\\", 39\\n] ;\\n\\ndef task:\\n \\\"standard: \\\\( raw | standard_ranking)\\\",\\n \\\"modified: \\\\( raw | modified_ranking)\\\",\\n \\\"dense: \\\\( raw | dense_ranking)\\\",\\n \\\"ordinal: \\\\( raw | ordinal_ranking)\\\",\\n \\\"fractional: \\\\( raw | fractional_ranking)\\\" ;\\n\\ntask\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function ties{T<:Real}(a::Array{T,1})\\n unique(a[2:end][a[2:end] .== a[1:end-1]])\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"function rankstandard{T<:Real}(a::Array{T,1})\\n r = collect(1:length(a))\\n 1 < r[end] || return r\\n for i in ties(a)\\n r[a.==i] = r[a.==i][1]\\n end\\n return r\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"function rankmodified{T<:Real}(a::Array{T,1})\\n indexin(a, a)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"function rankdense{T<:Real}(a::Array{T,1})\\n indexin(a, unique(a))\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"function rankordinal{T<:Real}(a::Array{T,1})\\n collect(1:length(a))\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"function rankfractional{T<:Real}(a::Array{T,1})\\n r = float64(collect(1:length(a)))\\n 1.0 < r[end] || return r\\n for i in ties(a)\\n r[a.==i] = mean(r[a.==i])\\n end\\n return r\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"scores = [44, 42, 42, 41, 41, 41, 39]\\nnames = [\\\"Solomon\\\", \\\"Jason\\\", \\\"Errol\\\", \\\"Garry\\\",\\n \\\"Bernard\\\", \\\"Barry\\\", \\\"Stephen\\\"]\\n\\nsrank = rankstandard(scores)\\nmrank = rankmodified(scores)\\ndrank = rankdense(scores)\\norank = rankordinal(scores)\\nfrank = rankfractional(scores)\\n\\nprintln(\\\" Name Score Std Mod Den Ord Frac\\\")\\nfor i in 1:length(scores)\\n print(@sprintf(\\\" %-7s\\\", names[i]))\\n print(@sprintf(\\\"%5d \\\", scores[i]))\\n print(@sprintf(\\\"%5d\\\", srank[i]))\\n print(@sprintf(\\\"%5d\\\", mrank[i]))\\n print(@sprintf(\\\"%5d\\\", drank[i]))\\n print(@sprintf(\\\"%5d\\\", orank[i]))\\n print(@sprintf(\\\"%7.2f\\\", frank[i]))\\n println()\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\n/* all ranking functions assume the array of Pairs is non-empty and already sorted by decreasing order of scores\\n and then, if the scores are equal, by reverse alphabetic order of names\\n*/\\n\\nfun standardRanking(scores: Array<Pair<Int, String>>): IntArray {\\n val rankings = IntArray(scores.size)\\n rankings[0] = 1\\n for (i in 1 until scores.size) rankings[i] = if (scores[i].first == scores[i - 1].first) rankings[i - 1] else i + 1\\n return rankings\\n}\\n\\nfun modifiedRanking(scores: Array<Pair<Int, String>>): IntArray {\\n val rankings = IntArray(scores.size)\\n rankings[0] = 1\\n for (i in 1 until scores.size) {\\n rankings[i] = i + 1\\n val currScore = scores[i].first\\n for (j in i - 1 downTo 0) {\\n if (currScore != scores[j].first) break\\n rankings[j] = i + 1\\n }\\n }\\n return rankings\\n}\\n\\nfun denseRanking(scores: Array<Pair<Int, String>>): IntArray {\\n val rankings = IntArray(scores.size)\\n rankings[0] = 1\\n var prevRanking = 1\\n for (i in 1 until scores.size) rankings[i] = if (scores[i].first == scores[i - 1].first) prevRanking else ++prevRanking\\n return rankings\\n}\\n\\nfun ordinalRanking(scores: Array<Pair<Int, String>>) = IntArray(scores.size) { it + 1 }\\n\\nfun fractionalRanking(scores: Array<Pair<Int, String>>): DoubleArray {\\n val rankings = DoubleArray(scores.size)\\n rankings[0] = 1.0\\n for (i in 1 until scores.size) {\\n var k = i\\n val currScore = scores[i].first\\n for (j in i - 1 downTo 0) {\\n if (currScore != scores[j].first) break\\n k = j\\n }\\n val avg = (k..i).average() + 1.0\\n for (m in k..i) rankings[m] = avg\\n }\\n return rankings\\n}\\n\\nfun printRankings(title: String, rankings: IntArray, scores: Array<Pair<Int, String>>) {\\n println(title + \\\":\\\")\\n for (i in 0 until rankings.size) {\\n print (\\\"${rankings[i]} \\\")\\n println(scores[i].toString().removeSurrounding(\\\"(\\\", \\\")\\\").replace(\\\",\\\", \\\"\\\"))\\n }\\n println()\\n}\\n\\nfun printFractionalRankings(title: String, rankings: DoubleArray, scores: Array<Pair<Int, String>>) {\\n println(title + \\\":\\\")\\n for (i in 0 until rankings.size) {\\n print (\\\"${\\\"%3.2f\\\".format(rankings[i])} \\\")\\n println(scores[i].toString().removeSurrounding(\\\"(\\\", \\\")\\\").replace(\\\",\\\", \\\"\\\"))\\n }\\n println()\\n}\\n\\nfun main(args: Array<String>) {\\n val scores = arrayOf(44 to \\\"Solomon\\\", 42 to \\\"Jason\\\", 42 to \\\"Errol\\\", 41 to \\\"Garry\\\",\\n 41 to \\\"Bernard\\\", 41 to \\\"Barry\\\", 39 to \\\"Stephen\\\")\\n printRankings(\\\"Standard ranking\\\", standardRanking(scores), scores)\\n printRankings(\\\"Modified ranking\\\", modifiedRanking(scores), scores)\\n printRankings(\\\"Dense ranking\\\", denseRanking(scores), scores)\\n printRankings(\\\"Ordinal ranking\\\", ordinalRanking(scores), scores)\\n printFractionalRankings(\\\"Fractional ranking\\\", fractionalRanking(scores), scores)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"#!/bin/ksh\\nexec 2> /tmp/Ranking_methods.err\\n# Ranking methods\\n#\\n#\\t# Standard. (Ties share what would have been their first ordinal number).\\n#\\t# Modified. (Ties share what would have been their last ordinal number).\\n#\\t# Dense. (Ties share the next available integer).\\n#\\t# Ordinal. ((Competitors take the next available integer. Ties are not treated otherwise).\\n#\\t# Fractional. (Ties share the mean of what would have been their ordinal numbers)\\n\\n#\\t# Variables:\\n#\\ntypeset -a arr=( '44 Solomon' '42 Jason' '42 Errol' '41 Garry' '41 Bernard' '41 Barry' '39 Stephen' )\\ninteger i\\n\\n#\\t# Functions:\\n#\\n\\n#\\t# Function _rankStandard(arr, rankarr) - retun arr with standard ranking\\n#\\nfunction _rankStandard {\\n\\ttypeset _ranked ; nameref _ranked=\\\"$1\\\"\\n\\n\\ttypeset _i _j _scr _currank _prevscr _shelf\\n\\tinteger _i _j _scr _currank=1 _prevscr\\n\\ttypeset -a _shelf\\n\\n\\tfor ((_i=0; _i<${#arr[*]}; _i++)); do\\n\\t\\t_scr=${arr[_i]%\\\\ *}\\n\\t\\tif (( _i>0 )) && (( _scr != _prevscr )); then\\n\\t\\t\\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\\n\\t\\t\\t\\t_ranked+=( \\\"${_currank} ${_shelf[_j]}\\\" )\\n\\t\\t\\tdone\\n\\t\\t\\t(( _currank+=${#_shelf[*]} ))\\n\\t\\t\\tunset _shelf ; typeset -a _shelf\\n\\t\\tfi\\n\\t\\t_shelf+=( \\\"${arr[_i]}\\\" )\\n\\t\\t_prevscr=${_scr}\\n\\tdone\\n\\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\\n\\t\\t_ranked+=( \\\"${_currank} ${_shelf[_j]}\\\" )\\n\\tdone\\n}\\n\\n#\\t# Function _rankModified(arr, rankarr) - retun arr with modified ranking\\n#\\nfunction _rankModified {\\n\\ttypeset _ranked ; nameref _ranked=\\\"$1\\\"\\n\\n\\ttypeset _i _j _scr _currank _prevscr _shelf\\n\\tinteger _i _j _scr _currank=0 _prevscr\\n\\ttypeset -a _shelf\\n\\n\\tfor ((_i=0; _i<${#arr[*]}; _i++)); do\\n\\t\\t_scr=${arr[_i]%\\\\ *}\\n\\t\\tif (( _i>0 )) && (( _scr != _prevscr )); then\\n\\t\\t\\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\\n\\t\\t\\t\\t_ranked+=( \\\"${_currank} ${_shelf[_j]}\\\" )\\n\\t\\t\\tdone\\n\\t\\t\\tunset _shelf ; typeset -a _shelf\\n\\t\\tfi\\n\\t\\t_shelf+=( \\\"${arr[_i]}\\\" )\\n\\t\\t(( _currank++ ))\\n\\t\\t_prevscr=${_scr}\\n\\tdone\\n\\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\\n\\t\\t_ranked+=( \\\"${_currank} ${_shelf[_j]}\\\" )\\n\\tdone\\n}\\n\\n#\\t# Function _rankDense(arr, rankarr) - retun arr with dense ranking\\n#\\nfunction _rankDense {\\n\\ttypeset _ranked ; nameref _ranked=\\\"$1\\\"\\n\\n\\ttypeset _i _j _scr _currank _prevscr _shelf\\n\\tinteger _i _j _scr _currank=0 _prevscr\\n\\ttypeset -a _shelf\\n\\n\\tfor ((_i=0; _i<${#arr[*]}; _i++)); do\\n\\t\\t_scr=${arr[_i]%\\\\ *}\\n\\t\\tif (( _i>0 )) && (( _scr != _prevscr )); then\\n\\t\\t\\t(( _currank++ ))\\n\\t\\t\\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\\n\\t\\t\\t\\t_ranked+=( \\\"${_currank} ${_shelf[_j]}\\\" )\\n\\t\\t\\tdone\\n\\t\\t\\tunset _shelf ; typeset -a _shelf\\n\\t\\tfi\\n\\t\\t_shelf+=( \\\"${arr[_i]}\\\" )\\n\\t\\t_prevscr=${_scr}\\n\\tdone\\n\\t(( _currank++ ))\\n\\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\\n\\t\\t_ranked+=( \\\"${_currank} ${_shelf[_j]}\\\" )\\n\\tdone\\n}\\n\\n#\\t# Function _rankOrdinal(arr, rankarr) - retun arr with ordinal ranking\\n#\\nfunction _rankOrdinal {\\n\\ttypeset _ranked ; nameref _ranked=\\\"$1\\\"\\n\\ttypeset _i ; integer _i\\n\\n\\tfor ((_i=0; _i<${#arr[*]}; _i++)); do\\n\\t\\t_ranked+=( \\\"$(( _i + 1 )) ${arr[_i]}\\\" )\\n\\tdone\\n}\\n\\n#\\t# Function _rankFractional(arr, rankarr) - retun arr with Fractional ranking\\n#\\nfunction _rankFractional {\\n\\ttypeset _ranked ; nameref _ranked=\\\"$1\\\"\\n\\n\\ttypeset _i _j _scr _currank _prevscr _shelf\\n\\tinteger _i _j _scr _prevscr\\n\\ttypeset -F1 _currank=1.0\\n\\ttypeset -a _shelf\\n\\n\\tfor ((_i=0; _i<${#arr[*]}; _i++)); do\\n\\t\\t_scr=${arr[_i]%\\\\ *}\\n\\t\\tif (( _i>0 )) && (( _scr != _prevscr )); then\\n\\t\\t\\t(( _currank/=${#_shelf[*]} ))\\n\\t\\t\\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\\n\\t\\t\\t\\t_ranked+=( \\\"${_currank} ${_shelf[_j]}\\\" )\\n\\t\\t\\tdone\\n\\t\\t\\t_currank=0.0\\n\\t\\t\\tunset _shelf ; typeset -a _shelf\\n\\t\\tfi\\n\\t\\t(( _i>0 )) && (( _currank+=_i + 1 ))\\n\\t\\t_shelf+=( \\\"${arr[_i]}\\\" )\\n\\t\\t_prevscr=${_scr}\\n\\tdone\\n\\tfor ((_j=0; _j<${#_shelf[*]}; _j++)); do\\n\\t\\t(( _currank/=${#_shelf[*]} ))\\n\\t\\t_ranked+=( \\\"${_currank} ${_shelf[_j]}\\\" )\\n\\tdone\\n}\\n\\n ######\\n# main #\\n ######\\n\\nprintf \\\"\\\\n\\\\nInput Data: ${#arr[*]} records\\\\n---------------------\\\\n\\\"\\nfor ((i=0; i< ${#arr[*]}; i++)); do\\n\\tprint ${arr[i]}\\ndone\\n\\ntypeset -a rankedarr\\n_rankStandard rankedarr\\nprintf \\\"\\\\n\\\\nStandard Ranking\\\\n----------------\\\\n\\\"\\nfor ((i=0; i< ${#rankedarr[*]}; i++)); do\\n\\tprint ${rankedarr[i]}\\ndone\\n\\nunset rankedarr ; typeset -a rankedarr\\n_rankModified rankedarr\\nprintf \\\"\\\\n\\\\nModified Ranking\\\\n----------------\\\\n\\\"\\nfor ((i=0; i< ${#rankedarr[*]}; i++)); do\\n\\tprint ${rankedarr[i]}\\ndone\\n\\nunset rankedarr ; typeset -a rankedarr\\n_rankDense rankedarr\\nprintf \\\"\\\\n\\\\nDense Ranking\\\\n-------------\\\\n\\\"\\nfor ((i=0; i< ${#rankedarr[*]}; i++)); do\\n\\tprint ${rankedarr[i]}\\ndone\\n\\nunset rankedarr ; typeset -a rankedarr\\n_rankOrdinal rankedarr\\nprintf \\\"\\\\n\\\\nOrdinal Ranking\\\\n---------------\\\\n\\\"\\nfor ((i=0; i< ${#rankedarr[*]}; i++)); do\\n\\tprint ${rankedarr[i]}\\ndone\\n\\nunset rankedarr ; typeset -a rankedarr\\n_rankFractional rankedarr\\nprintf \\\"\\\\n\\\\nFractional Ranking\\\\n------------------\\\\n\\\"\\nfor ((i=0; i< ${#rankedarr[*]}; i++)); do\\n\\tprint ${rankedarr[i]}\\ndone\\n\",\n \"language\": \"Ksh\"\n },\n {\n \"code\": \"Module Ranking (output$, orderlist) {\\n\\tOpen output$ for output as #k\\n\\tGosub getdata\\n\\tPrint #k, \\\"Standard ranking:\\\"\\n\\tskip=true\\n\\trankval=1\\n\\toldrank=0\\n\\tFor i=1 to items\\n\\t\\tRead rank, name$\\n\\t\\tif skip then\\n\\t\\t\\tskip=false\\n\\t\\telse.if oldrank<>rank then\\n\\t\\t\\trankval=i\\n\\t\\tend if\\n\\t\\toldrank=rank\\n\\t\\tPrint #k, Format$(\\\"{0::-5} {2} ({1})\\\", rankval, rank, name$)\\n\\tNext\\n\\tGosub getdata\\n\\tPrint #k, \\\"Modified ranking:\\\"\\n\\tskip=true\\n\\trankval=Items\\n\\toldrank=0\\n\\tShiftBack 1, -items*2 ' reverse stack items\\n\\tFor i=items to 1\\n\\t\\tRead name$, rank\\n\\t\\tif skip then\\n\\t\\t\\tskip=false\\n\\t\\telse.if oldrank<>rank then\\n\\t\\t\\trankval=i\\n\\t\\tend if\\n\\t\\toldrank=rank\\n\\t\\tData Format$(\\\"{0::-5} {2} ({1})\\\", rankval, rank, name$)\\n\\tNext\\n\\tShiftBack 1, -items ' reverse stack items\\n\\tFor i=1 to items\\n\\t\\tPrint #k, letter$\\n\\tNext i\\n\\tGosub getdata\\n\\tPrint #k, \\\"Dense ranking:\\\"\\n\\tskip=true\\n\\tDense=Stack\\n\\tacc=1\\n\\toldrank=0\\n\\tFor i=1 to items\\n\\t\\tRead rank, name$\\n\\t\\tif skip then\\n\\t\\t\\tskip=false\\n\\t\\t\\toldrank=rank\\n\\t\\telse.if oldrank<>rank then\\n\\t\\t\\toldrank=rank\\n\\t\\t\\tGosub dense\\n\\t\\t\\tacc=i\\n\\t\\tend if\\n\\t\\tStack Dense {data Format$(\\\" {0} ({1})\\\",name$, rank)}\\t\\n\\tNext\\n\\tGosub dense\\n\\tGosub getdata\\n\\tPrint #k, \\\"Ordinal ranking:\\\"\\n\\tFor i=1 to items\\n\\t\\tPrint #k, Format$(\\\"{0::-5} {2} ({1})\\\", i, Number, letter$)\\n\\tNext\\n\\tGosub getdata\\n\\tPrint #k, \\\"Fractional ranking:\\\"\\n\\tskip=true\\n\\tFrac=Stack\\n\\tacc=1\\n\\toldrank=0\\n\\tFor i=1 to items\\n\\t\\tRead rank, name$\\n\\t\\tif skip then\\n\\t\\t\\tskip=false\\n\\t\\t\\toldrank=rank\\n\\t\\telse.if oldrank<>rank then\\n\\t\\t\\toldrank=rank\\n\\t\\t\\tGosub Fractional\\n\\t\\t\\tacc=I\\n\\t\\tend if\\n\\t\\tStack Frac {data Format$(\\\" {0} ({1})\\\",name$, rank)}\\t\\n\\tNext\\n\\tGosub Fractional\\n\\tClose #k\\n\\tEnd\\n\\tFractional:\\n\\t\\tval=((len(Frac)+1)/2+(acc-1))\\n\\t\\tStack Frac {\\n\\t\\t\\twhile not empty\\n\\t\\t\\t\\tPrint #k, format$(\\\"{0:1:-5}{1}\\\", val, letter$)\\n\\t\\t\\tend while\\n\\t\\t}\\n\\tReturn\\n\\tdense:\\n\\t\\tStack Dense {\\n\\t\\t\\twhile not empty\\n\\t\\t\\t\\tPrint #k, format$(\\\"{0::-5}{1}\\\", acc, letter$)\\n\\t\\t\\tend while\\n\\t\\t}\\n\\tReturn\\n\\tgetdata:\\n\\t\\tflush\\n\\t\\tstack stack(orderlist) // place a copy of items to current stack\\n\\t\\titems=stack.size/2\\n\\tReturn\\n}\\nFlush\\nData 44, \\\"Solomon\\\", 42, \\\"Jason\\\", 42, \\\"Errol\\\"\\nData 41, \\\"Garry\\\", 41, \\\"Bernard\\\", 41, \\\"Barry\\\"\\nData 39, \\\"Stephen\\\"\\n// get all items from current stack to a new stack\\nalist=[]\\n// To screen\\nRanking \\\"\\\", alist\\n// To file\\nRanking \\\"ranking.txt\\\", alist\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"data = Transpose@{{44, 42, 42, 41, 41, 41, 39}, {\\\"Solomon\\\", \\\"Jason\\\",\\n \\\"Errol\\\", \\\"Garry\\\", \\\"Bernard\\\", \\\"Barry\\\", \\\"Stephen\\\"}};\\n\\nrank[data_, type_] :=\\n Module[{t = Transpose@{Sort@data, Range[Length@data, 1, -1]}},\\n Switch[type,\\n \\\"standard\\\", data/.Rule@@@First/@SplitBy[t, First],\\n \\\"modified\\\", data/.Rule@@@Last/@SplitBy[t, First],\\n \\\"dense\\\", data/.Thread[#->Range[Length@#]]&@SplitBy[t, First][[All, 1, 1]],\\n \\\"ordinal\\\", Reverse@Ordering[data],\\n \\\"fractional\\\", data/.Rule@@@(Mean[#]/.{a_Rational:>N[a]}&)/@ SplitBy[t, First]]]\\n\\nfmtRankedData[data_, type_] :=\\n Labeled[Grid[\\n SortBy[ArrayFlatten@{{Transpose@{rank[data[[All, 1]], type]},\\n data}}, First], Alignment->Left], type<>\\\" ranking:\\\", Top]\\n\\nGrid@{fmtRankedData[data, #] & /@ {\\\"standard\\\", \\\"modified\\\", \\\"dense\\\",\\n \\\"ordinal\\\", \\\"fractional\\\"}}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"MODULE RankingMethods;\\nFROM FormatString IMPORT FormatString;\\nFROM RealStr IMPORT RealToFixed;\\nFROM Terminal IMPORT WriteString,WriteLn,ReadChar;\\n\\nPROCEDURE WriteCard(c : CARDINAL);\\nVAR buf : ARRAY[0..15] OF CHAR;\\nBEGIN\\n FormatString(\\\"%c\\\", buf, c);\\n WriteString(buf)\\nEND WriteCard;\\n\\nTYPE Entry = RECORD\\n name : ARRAY[0..15] OF CHAR;\\n score : CARDINAL;\\nEND;\\n\\nPROCEDURE OrdinalRanking(CONST entries : ARRAY OF Entry);\\nVAR\\n buf : ARRAY[0..31] OF CHAR;\\n i : CARDINAL;\\nBEGIN\\n WriteString(\\\"Ordinal Ranking\\\");\\n WriteLn;\\n WriteString(\\\"---------------\\\");\\n WriteLn;\\n\\n FOR i:=0 TO HIGH(entries) DO\\n FormatString(\\\"%c\\\\t%c\\\\t%s\\\\n\\\", buf, i + 1, entries[i].score, entries[i].name);\\n WriteString(buf)\\n END;\\n\\n WriteLn\\nEND OrdinalRanking;\\n\\nPROCEDURE StandardRanking(CONST entries : ARRAY OF Entry);\\nVAR\\n buf : ARRAY[0..31] OF CHAR;\\n i,j : CARDINAL;\\nBEGIN\\n WriteString(\\\"Standard Ranking\\\");\\n WriteLn;\\n WriteString(\\\"---------------\\\");\\n WriteLn;\\n\\n j := 1;\\n FOR i:=0 TO HIGH(entries) DO\\n FormatString(\\\"%c\\\\t%c\\\\t%s\\\\n\\\", buf, j, entries[i].score, entries[i].name);\\n WriteString(buf);\\n IF entries[i+1].score < entries[i].score THEN\\n j := i + 2\\n END\\n END;\\n\\n WriteLn\\nEND StandardRanking;\\n\\nPROCEDURE DenseRanking(CONST entries : ARRAY OF Entry);\\nVAR\\n buf : ARRAY[0..31] OF CHAR;\\n i,j : CARDINAL;\\nBEGIN\\n WriteString(\\\"Dense Ranking\\\");\\n WriteLn;\\n WriteString(\\\"---------------\\\");\\n WriteLn;\\n\\n j := 1;\\n FOR i:=0 TO HIGH(entries) DO\\n FormatString(\\\"%c\\\\t%c\\\\t%s\\\\n\\\", buf, j, entries[i].score, entries[i].name);\\n WriteString(buf);\\n IF entries[i+1].score < entries[i].score THEN\\n INC(j)\\n END\\n END;\\n\\n WriteLn\\nEND DenseRanking;\\n\\nPROCEDURE ModifiedRanking(CONST entries : ARRAY OF Entry);\\nVAR\\n buf : ARRAY[0..31] OF CHAR;\\n i,j,count : CARDINAL;\\nBEGIN\\n WriteString(\\\"Modified Ranking\\\");\\n WriteLn;\\n WriteString(\\\"---------------\\\");\\n WriteLn;\\n\\n i := 0;\\n j := 1;\\n WHILE i < HIGH(entries) DO\\n IF entries[i].score # entries[i+1].score THEN\\n FormatString(\\\"%c\\\\t%c\\\\t%s\\\\n\\\", buf, i+1, entries[i].score, entries[i].name);\\n WriteString(buf);\\n\\n count := 1;\\n FOR j:=i+1 TO HIGH(entries)-1 DO\\n IF entries[j].score # entries[j+1].score THEN\\n BREAK\\n END;\\n INC(count)\\n END;\\n\\n j := 0;\\n WHILE j < count-1 DO\\n FormatString(\\\"%c\\\\t%c\\\\t%s\\\\n\\\", buf, i+count+1, entries[i+j+1].score, entries[i+j+1].name);\\n WriteString(buf);\\n INC(j)\\n END;\\n i := i + count - 1\\n END;\\n INC(i)\\n END;\\n\\n FormatString(\\\"%c\\\\t%c\\\\t%s\\\\n\\\\n\\\", buf, HIGH(entries)+1, entries[HIGH(entries)].score, entries[HIGH(entries)].name);\\n WriteString(buf)\\nEND ModifiedRanking;\\n\\nPROCEDURE FractionalRanking(CONST entries : ARRAY OF Entry);\\nVAR\\n buf : ARRAY[0..32] OF CHAR;\\n i,j,count : CARDINAL;\\n sum : REAL;\\nBEGIN\\n WriteString(\\\"Fractional Ranking\\\");\\n WriteLn;\\n WriteString(\\\"---------------\\\");\\n WriteLn;\\n\\n sum := 0.0;\\n i := 0;\\n WHILE i <= HIGH(entries) DO\\n IF (i = HIGH(entries) - 1) OR (entries[i].score # entries[i+1].score) THEN\\n RealToFixed(FLOAT(i+1),1,buf);\\n WriteString(buf);\\n FormatString(\\\"\\\\t%c\\\\t%s\\\\n\\\", buf, entries[i].score, entries[i].name);\\n WriteString(buf)\\n ELSE\\n sum := FLOAT(i);\\n count := 1;\\n\\n j := i;\\n WHILE entries[j].score = entries[j+1].score DO\\n sum := sum + FLOAT(j + 1);\\n INC(count);\\n INC(j)\\n END;\\n FOR j:=0 TO count-1 DO\\n RealToFixed(sum/FLOAT(count)+1.0,1,buf);\\n WriteString(buf);\\n FormatString(\\\"\\\\t%c\\\\t%s\\\\n\\\", buf, entries[i+j].score, entries[i+j].name);\\n WriteString(buf)\\n END;\\n i := i + count - 1\\n END;\\n INC(i)\\n END\\nEND FractionalRanking;\\n\\n(* Main *)\\nTYPE EA = ARRAY[0..6] OF Entry;\\nVAR entries : EA;\\nBEGIN\\n entries := EA{\\n {\\\"Solomon\\\", 44},\\n {\\\"Jason\\\", 42},\\n {\\\"Errol\\\", 42},\\n {\\\"Garry\\\", 41},\\n {\\\"Bernard\\\", 41},\\n {\\\"Barry\\\", 41},\\n {\\\"Stephen\\\", 39}\\n };\\n\\n OrdinalRanking(entries);\\n StandardRanking(entries);\\n DenseRanking(entries);\\n ModifiedRanking(entries);\\n FractionalRanking(entries);\\n\\n ReadChar\\nEND RankingMethods.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"import algorithm, sequtils, stats, tables\\n\\ntype\\n Record = tuple[score: int; name: string] # Input data.\\n Groups = OrderedTable[int, seq[string]] # Maps score to list of names.\\n Rank = tuple[rank: int; name: string; score: int] # Result.\\n FractRank = tuple[rank: float; name: string; score: int] # Result (fractional).\\n\\nfunc cmp(a, b: (int, seq[string])): int =\\n ## Comparison function needed to sort the groups.\\n cmp(a[0], b[0])\\n\\nfunc toGroups(records: openArray[Record]): Groups =\\n ## Build a \\\"Groups\\\" table from the records.\\n for record in records:\\n result.mgetOrPut(record.score, @[]).add record.name\\n # Sort the list of names by alphabetic order.\\n for score in result.keys:\\n sort(result[score])\\n # Sort the groups by decreasing score.\\n result.sort(cmp, Descending)\\n\\nfunc standardRanks(groups: Groups): seq[Rank] =\\n var rank = 1\\n for score, names in groups.pairs:\\n for name in names:\\n result.add (rank, name, score)\\n inc rank, names.len\\n\\nfunc modifiedRanks(groups: Groups): seq[Rank] =\\n var rank = 0\\n for score, names in groups.pairs:\\n inc rank, names.len\\n for name in names:\\n result.add (rank, name, score)\\n\\nfunc denseRanks(groups: Groups): seq[Rank] =\\n var rank = 0\\n for score, names in groups.pairs:\\n inc rank\\n for name in names:\\n result.add (rank, name, score)\\n\\nfunc ordinalRanks(groups: Groups): seq[Rank] =\\n var rank = 0\\n for score, names in groups.pairs:\\n for name in names:\\n inc rank\\n result.add (rank, name, score)\\n\\nfunc fractionalRanks(groups: Groups): seq[FractRank] =\\n var rank = 1\\n for score, names in groups.pairs:\\n let fRank = mean(toSeq(rank..(rank + names.high)))\\n for name in names:\\n result.add (fRank, name, score)\\n inc rank, names.len\\n\\nwhen isMainModule:\\n const Data = [(44, \\\"Solomon\\\"), (42, \\\"Jason\\\"), (42, \\\"Errol\\\"),\\n (41, \\\"Garry\\\"), (41, \\\"Bernard\\\"), (41, \\\"Barry\\\"), (39, \\\"Stephen\\\")]\\n\\n let groups = Data.toGroups()\\n echo \\\"Standard ranking:\\\"\\n for (rank, name, score) in groups.standardRanks():\\n echo rank, \\\": \\\", name, \\\" \\\", score\\n\\n echo()\\n echo \\\"Modified ranking:\\\"\\n for (rank, name, score) in groups.modifiedRanks():\\n echo rank, \\\": \\\", name, \\\" \\\", score\\n\\n echo()\\n echo \\\"Dense ranking:\\\"\\n for (rank, name, score) in groups.denseRanks():\\n echo rank, \\\": \\\", name, \\\" \\\", score\\n\\n echo()\\n echo \\\"Ordinal ranking:\\\"\\n for (rank, name, score) in groups.ordinalRanks():\\n echo rank, \\\": \\\", name, \\\" \\\", score\\n\\n echo()\\n echo \\\"Fractional ranking:\\\"\\n for (rank, name, score) in groups.fractionalRanks():\\n echo rank, \\\": \\\", name, \\\" \\\", score\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"import algorithm\\n\\ntype\\n Record = tuple[score: int; name: string] # Input data.\\n Rank = tuple[rank: int; name: string; score: int] # Result.\\n FractRank = tuple[rank: float; name: string; score: int] # Result (fractional).\\n\\nfunc cmp(a, b: Record): int =\\n ## Record comparison function (needed for sorting).\\n result = cmp(b[0], a[0]) # Reverse order.\\n if result == 0:\\n result = cmp(a.name, b.name) # Alphabetical order.\\n\\nfunc standardRanks(records: openArray[Record]): seq[Rank] =\\n let records = sorted(records, cmp)\\n var rank = 1\\n var currScore = records[0].score\\n for idx, (score, name) in records:\\n if score != currScore:\\n rank = idx + 1\\n currScore = score\\n result.add (rank, name, score)\\n\\nfunc modifiedRanks(records: openArray[Record]): seq[Rank] =\\n let records = sorted(records, cmp)\\n var rank = records.len\\n var currScore = records[^1].score\\n for idx in countdown(records.high, 0):\\n let (score, name) = records[idx]\\n if score != currScore:\\n rank = idx + 1\\n currScore = score\\n result.add (rank, name, score)\\n result.reverse()\\n\\nfunc denseRanks(records: openArray[Record]): seq[Rank] =\\n let records = sorted(records, cmp)\\n var rank = 1\\n var currScore = records[0].score\\n for (score, name) in records:\\n if score != currScore:\\n inc rank\\n currScore = score\\n result.add (rank, name, score)\\n\\nfunc ordinalRanks(records: openArray[Record]): seq[Rank] =\\n let records = sorted(records, cmp)\\n var rank = 0\\n for (score, name) in records:\\n inc rank\\n result.add (rank, name, score)\\n\\nfunc fractionalRanks(records: openArray[Record]): seq[FractRank] =\\n let records = sorted(records, cmp)\\n\\n # Build a list of ranks.\\n var currScore = records[0].score\\n var sum = 0\\n var ranks: seq[float]\\n var count = 0\\n for idx, record in records:\\n if record.score == currScore:\\n inc count\\n inc sum, idx + 1\\n else:\\n ranks.add sum / count\\n count = 1\\n currScore = record.score\\n sum = idx + 1\\n ranks.add sum / count\\n\\n # Give a rank to each record.\\n currScore = records[0].score\\n var rankIndex = 0\\n for (score, name) in records:\\n if score != currScore:\\n inc rankIndex\\n currScore = score\\n result.add (ranks[rankIndex], name, score)\\n\\nwhen isMainModule:\\n\\n const Data = [(44, \\\"Solomon\\\"), (42, \\\"Jason\\\"), (42, \\\"Errol\\\"),\\n (41, \\\"Garry\\\"), (41, \\\"Bernard\\\"), (41, \\\"Barry\\\"), (39, \\\"Stephen\\\")]\\n\\n echo \\\"Standard ranking:\\\"\\n for (rank, name, score) in Data.standardRanks():\\n echo rank, \\\": \\\", name, \\\" \\\", score\\n\\n echo()\\n echo \\\"Modified ranking:\\\"\\n for (rank, name, score) in Data.modifiedRanks():\\n echo rank, \\\": \\\", name, \\\" \\\", score\\n\\n echo()\\n echo \\\"Dense ranking:\\\"\\n for (rank, name, score) in Data.denseRanks():\\n echo rank, \\\": \\\", name, \\\" \\\", score\\n\\n echo()\\n echo \\\"Ordinal ranking:\\\"\\n for (rank, name, score) in Data.ordinalRanks():\\n echo rank, \\\": \\\", name, \\\" \\\", score\\n\\n echo()\\n echo \\\"Fractional ranking:\\\"\\n for (rank, name, score) in Data.fractionalRanks():\\n echo rank, \\\": \\\", name, \\\" \\\", score\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"standard(v)=v=vecsort(v,1,4); my(last=v[1][1]+1); for(i=1,#v, v[i][1]=if(v[i][1]<last,last=v[i][1]; i, v[i-1][1])); v;\\nmodified(v)=v=vecsort(v,1,4); my(last=v[#v][1]-1); forstep(i=#v,1,-1, v[i][1]=if(v[i][1]>last,last=v[i][1]; i, v[i+1][1])); v;\\ndense(v)=v=vecsort(v,1,4); my(last=v[1][1]+1,rank); for(i=1,#v, v[i][1]=if(v[i][1]<last,last=v[i][1]; rank++, rank)); v;\\nordinal(v)=v=vecsort(v,1,4); for(i=1,#v,v[i][1]=i); v;\\nfractional(v)=my(a=standard(v),b=modified(v)); vector(#v,i,[(a[i][1]+b[i][1])/2,v[i][2]]);\\n\\nv=[[44,\\\"Solomon\\\"], [42,\\\"Jason\\\"], [42,\\\"Errol\\\"], [41,\\\"Garry\\\"], [41,\\\"Bernard\\\"], [41,\\\"Barry\\\"], [39,\\\"Stephen\\\"]];\\nstandard(v)\\nmodified(v)\\ndense(v)\\nordinal(v)\\nfractional(v)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"my %scores = (\\n 'Solomon' => 44,\\n 'Jason' => 42,\\n 'Errol' => 42,\\n 'Garry' => 41,\\n 'Bernard' => 41,\\n 'Barry' => 41,\\n 'Stephen' => 39\\n);\\n\\nsub tiers {\\n my(%s) = @_; my(%h);\\n push @{$h{$s{$_}}}, $_ for keys %s;\\n @{\\\\%h}{reverse sort keys %h};\\n}\\n\\nsub standard {\\n my(%s) = @_; my($result);\\n my $rank = 1;\\n for my $players (tiers %s) {\\n $result .= \\\"$rank \\\" . join(', ', sort @$players) . \\\"\\\\n\\\";\\n $rank += @$players;\\n }\\n return $result;\\n}\\n\\nsub modified {\\n my(%s) = @_; my($result);\\n my $rank = 0;\\n for my $players (tiers %s) {\\n $rank += @$players;\\n $result .= \\\"$rank \\\" . join(', ', sort @$players) . \\\"\\\\n\\\";\\n }\\n return $result;\\n}\\n\\nsub dense {\\n my(%s) = @_; my($n,$result);\\n $result .= sprintf \\\"%d %s\\\\n\\\", ++$n, join(', ', sort @$_) for tiers %s;\\n return $result;\\n}\\n\\nsub ordinal {\\n my(%s) = @_; my($n,$result);\\n for my $players (tiers %s) {\\n $result .= sprintf \\\"%d %s\\\\n\\\", ++$n, $_ for sort @$players;\\n }\\n return $result;\\n}\\n\\nsub fractional {\\n my(%s) = @_; my($result);\\n my $rank = 1;\\n for my $players (tiers %s) {\\n my $beg = $rank;\\n my $end = $rank += @$players;\\n my $avg = 0;\\n $avg += $_/@$players for $beg .. $end-1;\\n $result .= sprintf \\\"%3.1f %s\\\\n\\\", $avg, join ', ', sort @$players;\\n }\\n return $result;\\n}\\n\\nprint \\\"Standard:\\\\n\\\" . standard(%scores) . \\\"\\\\n\\\";\\nprint \\\"Modified:\\\\n\\\" . modified(%scores) . \\\"\\\\n\\\";\\nprint \\\"Dense:\\\\n\\\" . dense(%scores) . \\\"\\\\n\\\";\\nprint \\\"Ordinal:\\\\n\\\" . ordinal(%scores) . \\\"\\\\n\\\";\\nprint \\\"Fractional:\\\\n\\\" . fractional(%scores) . \\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">ties</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">scores</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- {start,num} pairs</span>\\n <span style=\\\"color: #000000;\\\">tdx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">scores</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">last</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">scores</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">curr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">scores</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">curr</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">last</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">[$][</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">tdx</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">last</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">curr</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- eg <nowiki>{{</nowiki>{1,1},{2,2},{4,3},{7,1<nowiki>}}</nowiki>,\\n -- {1,2,2,3,3,3,4<nowiki>}}</nowiki></span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">tdx</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">enum</span> <span style=\\\"color: #000000;\\\">STANDARD</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- eg {1,2,2,4,4,4,7}</span>\\n <span style=\\\"color: #000000;\\\">MODIFIED</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- eg {1,3,3,6,6,6,7}</span>\\n <span style=\\\"color: #000000;\\\">DENSE</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (==tdx)</span>\\n <span style=\\\"color: #000000;\\\">ORDINAL</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- eg {1,2,3,4,5,6,7}</span>\\n <span style=\\\"color: #000000;\\\">FRACTION</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- {1,2.5,2.5,5,5,5,7}</span>\\n <span style=\\\"color: #000000;\\\">METHODS</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">$</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">rank</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">method</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">tdx</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">idx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">tdx</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">tx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">tn</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">idx</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">switch</span> <span style=\\\"color: #000000;\\\">method</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #000000;\\\">STANDARD</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">tx</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #000000;\\\">MODIFIED</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">tx</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">tn</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #000000;\\\">DENSE</span> <span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">idx</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #000000;\\\">ORDINAL</span> <span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">i</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #000000;\\\">FRACTION</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">tx</span><span style=\\\"color: #0000FF;\\\">+(</span><span style=\\\"color: #000000;\\\">tn</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">switch</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">scores</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #000000;\\\">44</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Solomon\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">42</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Jason\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">42</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Errol\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">41</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Garry\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">41</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Bernard\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">41</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Barry\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">39</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"Stephen\\\"</span><span style=\\\"color: #0000FF;\\\">}}</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">tdx</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ties</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">scores</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" score name standard modified dense ordinal fractional\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">scores</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">ranks</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">METHODS</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">method</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">METHODS</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">ranks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">method</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rank</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">method</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">tdx</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%5d %-7s \\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">scores</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%6g %8g %6g %6g %9g\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ranks</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"function Get-Ranking\\n{\\n [CmdletBinding(DefaultParameterSetName=\\\"Standard\\\")]\\n [OutputType([PSCustomObject])]\\n Param\\n (\\n [Parameter(Mandatory=$true,\\n ValueFromPipeline=$true,\\n ValueFromPipelineByPropertyName=$true,\\n Position=0)]\\n [string]\\n $InputObject,\\n\\n [Parameter(Mandatory=$false,\\n ParameterSetName=\\\"Standard\\\")]\\n [switch]\\n $Standard,\\n\\n [Parameter(Mandatory=$false,\\n ParameterSetName=\\\"Modified\\\")]\\n [switch]\\n $Modified,\\n\\n [Parameter(Mandatory=$false,\\n ParameterSetName=\\\"Dense\\\")]\\n [switch]\\n $Dense,\\n\\n [Parameter(Mandatory=$false,\\n ParameterSetName=\\\"Ordinal\\\")]\\n [switch]\\n $Ordinal,\\n\\n [Parameter(Mandatory=$false,\\n ParameterSetName=\\\"Fractional\\\")]\\n [switch]\\n $Fractional\\n )\\n\\n Begin\\n {\\n function Get-OrdinalRank ([PSCustomObject[]]$Values)\\n {\\n for ($i = 0; $i -lt $Values.Count; $i++)\\n {\\n $Values[$i].Rank = $i + 1\\n }\\n\\n $Values\\n }\\n\\n function Get-Rank ([PSCustomObject[]]$Scores)\\n {\\n foreach ($score in $Scores)\\n {\\n $score.Group | ForEach-Object {$_.Rank = $score.Rank}\\n }\\n\\n $Scores.Group\\n }\\n\\n function New-Competitor ([string]$Name, [int]$Score, [int]$Rank = 0)\\n {\\n [PSCustomObject]@{\\n Name = $Name\\n Score = $Score\\n Rank = $Rank\\n }\\n }\\n\\n $competitors = @()\\n $scores = @()\\n }\\n Process\\n {\\n @($input) | ForEach-Object {$competitors += New-Competitor -Name $_.Split()[1] -Score $_.Split()[0]}\\n }\\n End\\n {\\n $scores = $competitors |\\n Sort-Object -Property Score -Descending |\\n Group-Object -Property Score |\\n Select-Object -Property @{Name=\\\"Score\\\"; Expression={[int]$_.Name}}, @{Name=\\\"Rank\\\"; Expression={0}}, Count, Group\\n\\n switch ($PSCmdlet.ParameterSetName)\\n {\\n \\\"Standard\\\"\\n {\\n $rank = 1\\n\\n for ($i = 0; $i -lt $scores.Count; $i++)\\n {\\n $scores[$i].Rank = $rank\\n $rank += $scores[$i].Count\\n }\\n\\n Get-Rank $scores\\n }\\n \\\"Modified\\\"\\n {\\n $rank = 0\\n\\n foreach ($score in $scores)\\n {\\n $rank = $score.Count + $rank\\n $score.Rank = $rank\\n }\\n\\n Get-Rank $scores\\n }\\n \\\"Dense\\\"\\n {\\n for ($i = 0; $i -lt $scores.Count; $i++)\\n {\\n $scores[$i].Rank = $i + 1\\n }\\n\\n Get-Rank $scores\\n }\\n \\\"Ordinal\\\"\\n {\\n Get-OrdinalRank $competitors\\n }\\n \\\"Fractional\\\"\\n {\\n Get-OrdinalRank $competitors | Group-Object -Property Score | ForEach-Object {\\n if ($_.Count -gt 1)\\n {\\n $rank = ($_.Group.Rank | Measure-Object -Average).Average\\n\\n foreach ($competitor in $_.Group)\\n {\\n $competitor.Rank = $rank\\n }\\n }\\n }\\n\\n $competitors\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$scores = \\\"44 Solomon\\\",\\\"42 Jason\\\",\\\"42 Errol\\\",\\\"41 Garry\\\",\\\"41 Bernard\\\",\\\"41 Barry\\\",\\\"39 Stephen\\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$scores | Get-Ranking -Standard\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$scores | Get-Ranking -Modified\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$scores | Get-Ranking -Dense\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$scores | Get-Ranking -Ordinal\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$scores | Get-Ranking -Fractional\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"def mc_rank(iterable, start=1):\\n \\\"\\\"\\\"Modified competition ranking\\\"\\\"\\\"\\n lastresult, fifo = None, []\\n for n, item in enumerate(iterable, start-1):\\n if item[0] == lastresult:\\n fifo += [item]\\n else:\\n while fifo:\\n yield n, fifo.pop(0)\\n lastresult, fifo = item[0], fifo + [item]\\n while fifo:\\n yield n+1, fifo.pop(0)\\n\\n\\ndef sc_rank(iterable, start=1):\\n \\\"\\\"\\\"Standard competition ranking\\\"\\\"\\\"\\n lastresult, lastrank = None, None\\n for n, item in enumerate(iterable, start):\\n if item[0] == lastresult:\\n yield lastrank, item\\n else:\\n yield n, item\\n lastresult, lastrank = item[0], n\\n\\n\\ndef d_rank(iterable, start=1):\\n \\\"\\\"\\\"Dense ranking\\\"\\\"\\\"\\n lastresult, lastrank = None, start - 1,\\n for item in iterable:\\n if item[0] == lastresult:\\n yield lastrank, item\\n else:\\n lastresult, lastrank = item[0], lastrank + 1\\n yield lastrank, item\\n\\n\\ndef o_rank(iterable, start=1):\\n \\\"\\\"\\\"Ordinal ranking\\\"\\\"\\\"\\n yield from enumerate(iterable, start)\\n\\n\\ndef f_rank(iterable, start=1):\\n \\\"\\\"\\\"Fractional ranking\\\"\\\"\\\"\\n last, fifo = None, []\\n for n, item in enumerate(iterable, start):\\n if item[0] != last:\\n if fifo:\\n mean = sum(f[0] for f in fifo) / len(fifo)\\n while fifo:\\n yield mean, fifo.pop(0)[1]\\n last = item[0]\\n fifo.append((n, item))\\n if fifo:\\n mean = sum(f[0] for f in fifo) / len(fifo)\\n while fifo:\\n yield mean, fifo.pop(0)[1]\\n\\n\\nif __name__ == '__main__':\\n scores = [(44, 'Solomon'),\\n (42, 'Jason'),\\n (42, 'Errol'),\\n (41, 'Garry'),\\n (41, 'Bernard'),\\n (41, 'Barry'),\\n (39, 'Stephen')]\\n\\n print('\\\\nScores to be ranked (best first):')\\n for s in scores:\\n print(' %2i %s' % (s ))\\n for ranker in [sc_rank, mc_rank, d_rank, o_rank, f_rank]:\\n print('\\\\n%s:' % ranker.__doc__)\\n for rank, score in ranker(scores):\\n print(' %3g, %r' % (rank, score))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n;; Tim-brown 2014-09-11\\n\\n;; produces a ranking according to ranking function: rfn\\n;; INPUT:\\n;; lst : (list (score . details))\\n;; rfn : (length-scores)\\n;; -> (values\\n;; ranks-added ; how many ranks to add for the next iteration\\n;; (idx . rest -> rank-offset)) ; function that produces the rank for the idx^th element\\n;; ; in the scoring (arity must be >= 1)\\n(define (rank-list all-scores rfn)\\n (let loop ((rank-0 0) (lst (sort all-scores > #:key car)) (acc empty))\\n (cond\\n [(null? lst) acc]\\n [else\\n (define 1st-score (caar lst))\\n (define (ties-with-1st? cand) (= (car cand) 1st-score))\\n (define-values (tied unranked) (splitf-at lst ties-with-1st?))\\n ;; all ranking functions should properly handle a singleton tied list\\n (define tied-len (length tied))\\n (define tied? (> tied-len 1))\\n (define-values (ranks-added rank-offset-fn) (rfn tied-len))\\n (define ranked-tied (for/list ((t (in-list tied)) (i (in-naturals 1)))\\n (list* tied? (+ rank-0 (rank-offset-fn i)) t)))\\n (loop (+ ranks-added rank-0) unranked (append acc ranked-tied))])))\\n\\n;; Ties share what would have been their first ordinal number\\n(define (rank-function:Standard l)\\n (values l (thunk* 1)))\\n\\n;; Ties share what would have been their last ordinal number\\n(define (rank-function:Modified l)\\n (values l (thunk* l)))\\n\\n;; Ties share the next available integer\\n(define (rank-function:Dense l)\\n (values 1 (thunk* 1)))\\n\\n;; Competitors take the next available integer. Ties are not treated otherwise\\n(define (rank-function:Ordinal l)\\n (values l (λ (n . _) n)))\\n\\n;; Ties share the mean of what would have been their ordinal numbers\\n(define (rank-function:Fractional l)\\n (values l (thunk* (/ (+ l 1) 2))))\\n\\n(define score-board\\n '((44 . Solomon)\\n (42 . Jason)\\n (42 . Errol)\\n (41 . Garry)\\n (41 . Bernard)\\n (41 . Barry)\\n (39 . Stephen)))\\n\\n(define format-number\\n (match-lambda\\n [(? integer? i) i]\\n [(and f (app numerator n) (app denominator d))\\n (define-values (q r) (quotient/remainder n d))\\n (format \\\"~a ~a/~a\\\" q r d)]))\\n\\n(for ((fn (list\\n rank-function:Standard\\n rank-function:Modified\\n rank-function:Dense\\n rank-function:Ordinal\\n rank-function:Fractional)))\\n (printf \\\"Function: ~s~%\\\" fn)\\n (for ((r (in-list (rank-list score-board fn))))\\n (printf \\\"~a ~a\\\\t~a\\\\t~a~%\\\"\\n (if (car r) \\\"=\\\" \\\" \\\")\\n (format-number (cadr r))\\n (caddr r)\\n (cdddr r)))\\n (newline))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my @scores =\\n Solomon => 44,\\n Jason => 42,\\n Errol => 42,\\n Garry => 41,\\n Bernard => 41,\\n Barry => 41,\\n Stephen => 39;\\n\\nsub tiers (@s) { @s.classify(*.value).pairs.sort.reverse.map: { .value».key } }\\n\\nsub standard (@s) {\\n my $rank = 1;\\n gather for tiers @s -> @players {\\n\\ttake $rank => @players;\\n\\t$rank += @players;\\n }\\n}\\n\\nsub modified (@s) {\\n my $rank = 0;\\n gather for tiers @s -> @players {\\n\\t$rank += @players;\\n\\ttake $rank => @players;\\n }\\n}\\n\\nsub dense (@s) { tiers(@s).map: { ++$_ => @^players } }\\n\\nsub ordinal (@s) { @s.map: ++$_ => *.key }\\n\\nsub fractional (@s) {\\n my $rank = 1;\\n gather for tiers @s -> @players {\\n\\tmy $beg = $rank;\\n\\tmy $end = $rank += @players;\\n\\ttake [+]($beg ..^ $end) / @players => @players;\\n }\\n}\\n\\nsay \\\"Standard:\\\"; .perl.say for standard @scores;\\nsay \\\"\\\\nModified:\\\"; .perl.say for modified @scores;\\nsay \\\"\\\\nDense:\\\"; .perl.say for dense @scores;\\nsay \\\"\\\\nOrdinal:\\\"; .perl.say for ordinal @scores;\\nsay \\\"\\\\nFractional:\\\"; .perl.say for fractional @scores;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/**************************\\n44 Solomon 1 1 1 1 1\\n42 Jason 2 3 2 2 2.5\\n42 Errol 2 3 2 3 2.5\\n41 Garry 4 6 3 4 5\\n41 Bernard 4 6 3 5 5\\n41 Barry 4 6 3 6 5\\n39 Stephen 7 7 4 7 7\\n**************************/\\nDo i=1 To 7\\n Parse Value sourceline(i+1) With rank.i name.i .\\n /* say rank.i name.i */\\n End\\npool=0\\ncrank=0\\nDo i=1 To 7\\n If rank.i<>crank Then Do\\n pool=pool+1\\n lo.pool=i\\n hi.pool=i\\n n.pool=1\\n ii.pool=i\\n End\\n Else Do\\n n.pool=n.pool+1\\n hi.pool=i\\n ii.pool=ii.pool+i\\n End\\n crank=rank.i\\n pool.i=pool\\n End\\n/*\\nDo j=1 To pool\\n Say 'pool' j n.j lo.j hi.j\\n End\\n*/\\ncp=0\\nr=0\\ncnt.=0\\nDo i=1 To 7\\n p=pool.i\\n If p<>cp Then\\n r=r+1\\n res=rank.i left(name.i,8) lo.p hi.p r i ii.p/n.p\\n If res=sourceline(i+1) Then cnt.ok=cnt.ok+1\\n Say res\\n cp=p\\n End\\nSay cnt.ok 'correct lines'\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"ar = \\\"44 Solomon\\n42 Jason\\n42 Errol\\n41 Garry\\n41 Bernard\\n41 Barry\\n39 Stephen\\\".lines.map{|line| line.split}\\ngrouped = ar.group_by{|pair| pair.shift.to_i}\\ns_rnk = 1\\nm_rnk = o_rnk = 0\\nputs \\\"stand.\\\\tmod.\\\\tdense\\\\tord.\\\\tfract.\\\"\\n\\ngrouped.each.with_index(1) do |(score, names), d_rnk|\\n m_rnk += names.flatten!.size\\n f_rnk = (s_rnk + m_rnk)/2.0\\n names.each do |name|\\n o_rnk += 1\\n puts \\\"#{s_rnk}\\\\t#{m_rnk}\\\\t#{d_rnk}\\\\t#{o_rnk}\\\\t#{f_rnk.to_s.sub(\\\".0\\\",\\\"\\\")}\\\\t#{score} #{name}\\\"\\n end\\n s_rnk += names.size\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"object RankingMethods extends App {\\n case class Score(score: Int, name: String) // incoming data\\n case class Rank[Precision](rank: Precision, names: List[String]) // outgoing results (can be int or double)\\n case class State[Precision](n: Int, done: List[Rank[Precision]]) { // internal state, no mutable variables\\n def next(n: Int, next: Rank[Precision]) = State(n, next :: done)\\n }\\n def grouped[Precision](list: List[Score]) = // group names together by score, with highest first\\n (scala.collection.immutable.TreeMap[Int, List[Score]]() ++ list.groupBy(-_.score))\\n .values.map(_.map(_.name)).foldLeft(State[Precision](1, Nil)) _\\n\\n // Ranking methods:\\n\\n def rankStandard(list: List[Score]) =\\n grouped[Int](list){case (state, names) => state.next(state.n+names.length, Rank(state.n, names))}.done.reverse\\n\\n def rankModified(list: List[Score]) =\\n rankStandard(list).map(r => Rank(r.rank+r.names.length-1, r.names))\\n\\n def rankDense(list: List[Score]) =\\n grouped[Int](list){case (state, names) => state.next(state.n+1, Rank(state.n, names))}.done.reverse\\n\\n def rankOrdinal(list: List[Score]) =\\n list.zipWithIndex.map{case (score, n) => Rank(n+1, List(score.name))}\\n\\n def rankFractional(list: List[Score]) =\\n rankStandard(list).map(r => Rank((2*r.rank+r.names.length-1.0)/2, r.names))\\n\\n // Tests:\\n\\n def parseScores(s: String) = s split \\\"\\\\\\\\s+\\\" match {case Array(s,n) => Score(s.toInt, n)}\\n val test = List(\\\"44 Solomon\\\", \\\"42 Jason\\\", \\\"42 Errol\\\", \\\"41 Garry\\\", \\\"41 Bernard\\\", \\\"41 Barry\\\", \\\"39 Stephen\\\").map(parseScores)\\n\\n println(\\\"Standard:\\\")\\n println(rankStandard(test) mkString \\\"\\\\n\\\")\\n println(\\\"\\\\nModified:\\\")\\n println(rankModified(test) mkString \\\"\\\\n\\\")\\n println(\\\"\\\\nDense:\\\")\\n println(rankDense(test) mkString \\\"\\\\n\\\")\\n println(\\\"\\\\nOrdinal:\\\")\\n println(rankOrdinal(test) mkString \\\"\\\\n\\\")\\n println(\\\"\\\\nFractional:\\\")\\n println(rankFractional(test) mkString \\\"\\\\n\\\")\\n\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"var scores = [\\n Pair(Solomon => 44),\\n Pair(Jason => 42),\\n Pair(Errol => 42),\\n Pair(Garry => 41),\\n Pair(Bernard => 41),\\n Pair(Barry => 41),\\n Pair(Stephen => 39),\\n]\\n\\nfunc tiers(s) {\\n s.group_by { .value }.kv.sort.flip.map { .value.map{.key} }\\n}\\n\\nfunc standard(s) {\\n var rank = 1\\n gather {\\n for players in tiers(s) {\\n take(Pair(rank, players))\\n rank += players.len\\n }\\n }\\n}\\n\\nfunc modified(s) {\\n var rank = 0\\n gather {\\n for players in tiers(s) {\\n rank += players.len\\n take(Pair(rank, players))\\n }\\n }\\n}\\n\\nfunc dense(s) {\\n tiers(s).map_kv { |k,v| Pair(k+1, v) }\\n}\\n\\nfunc ordinal(s) {\\n s.map_kv { |k,v| Pair(k+1, v.key) }\\n}\\n\\nfunc fractional(s) {\\n var rank = 1\\n gather {\\n for players in tiers(s) {\\n var beg = rank\\n var end = (rank += players.len)\\n take(Pair(sum(beg ..^ end) / players.len, players))\\n }\\n }\\n}\\n\\nfunc display(r) {\\n say r.map {|a| '%3s : %s' % a... }.join(\\\"\\\\n\\\")\\n}\\n\\nsay \\\"Standard:\\\"; display( standard(scores))\\nsay \\\"\\\\nModified:\\\"; display( modified(scores))\\nsay \\\"\\\\nDense:\\\"; display( dense(scores))\\nsay \\\"\\\\nOrdinal:\\\"; display( ordinal(scores))\\nsay \\\"\\\\nFractional:\\\"; display(fractional(scores))\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"proc rank {rankingMethod sortedList} {\\n # Extract the groups in the data (this is pointless for ordinal...)\\n set s [set group [set groups {}]]\\n foreach {score who} $sortedList {\\n\\tif {$score != $s} {\\n\\t lappend groups [llength $group]\\n\\t set s $score\\n\\t set group {}\\n\\t}\\n\\tlappend group $who\\n }\\n lappend groups [llength $group]\\n # Construct the rankings; note that we have a zero-sized leading group\\n set n 1; set m 0\\n foreach g $groups {\\n\\tswitch $rankingMethod {\\n\\t standard {\\n\\t\\tlappend result {*}[lrepeat $g $n]\\n\\t\\tincr n $g\\n\\t }\\n\\t modified {\\n\\t\\tlappend result {*}[lrepeat $g [incr m $g]]\\n\\t }\\n\\t dense {\\n\\t\\tlappend result {*}[lrepeat $g $m]\\n\\t\\tincr m\\n\\t }\\n\\t ordinal {\\n\\t\\tfor {set i 0} {$i < $g} {incr i} {\\n\\t\\t lappend result [incr m]\\n\\t\\t}\\n\\t }\\n\\t fractional {\\n\\t\\tset val [expr {($n + [incr n $g] - 1) / 2.0}]\\n\\t\\tlappend result {*}[lrepeat $g [format %g $val]]\\n\\t }\\n\\t}\\n }\\n return $result\\n}\\n\\nset data {\\n 44 Solomon\\n 42 Jason\\n 42 Errol\\n 41 Garry\\n 41 Bernard\\n 41 Barry\\n 39 Stephen\\n}\\nforeach method {standard modified dense ordinal fractional} {\\n puts \\\"Using method '$method'...\\\\n Rank\\\\tScore\\\\tWho\\\"\\n foreach rank [rank $method $data] {score who} $data {\\n\\tputs \\\" $rank\\\\t$score\\\\t$who\\\"\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"LET n = 7\\nDIM puntos(7), ptosnom(7), nombre$(7)\\n\\nSUB MostarTabla\\n FOR i = 1 to n\\n PRINT str$(ptosnom(i)); \\\" \\\"; puntos(i); \\\" \\\"; nombre$(i)\\n NEXT i\\n PRINT\\nEND SUB\\n\\nPRINT \\\"Puntuaciones a clasificar (mejores primero):\\\"\\nFOR i = 1 to n\\n READ puntos(i), nombre$(i)\\n PRINT \\\" \\\"; puntos(i); \\\" \\\"; nombre$(i)\\nNEXT i\\n\\nPRINT\\nPRINT \\\"--- Standard ranking ---\\\"\\nLET ptosnom(1) = 1\\nFOR i = 2 to n\\nNEXT i\\nCALL MostarTabla\\n\\nPRINT \\\"--- Modified ranking ---\\\"\\nLET ptosnom(n) = n\\nFOR i = n-1 to 1 step -1\\n IF puntos(i) = puntos(i+1) then LET ptosnom(i) = ptosnom(i+1) else LET ptosnom(i) = i\\nNEXT i\\nCALL MostarTabla\\n\\nPRINT \\\"--- Ordinal ranking ---\\\"\\nFOR i = 1 to n\\n LET ptosnom(i) = i\\nNEXT i\\nCALL MostarTabla\\n\\nPRINT \\\"--- Fractional ranking ---\\\"\\nLET i = 1\\nLET j = 2\\nDO\\n IF j <= n then\\n IF (puntos(j-1) = puntos(j)) then\\n LET j = j + 1\\n END IF\\n END IF\\n\\n FOR k = i to j-1\\n LET ptosnom(k) = (i+j-1) / 2\\n NEXT k\\n LET i = j\\n LET j = j + 1\\nLOOP UNTIL i > n\\nCALL MOSTARTABLA\\n\\nDATA 44, \\\"Solomon\\\", 42, \\\"Jason\\\", 42, \\\"Errol\\\", 41, \\\"Garry\\\", 41, \\\"Bernard\\\", 41, \\\"Barry\\\", 39, \\\"Stephen\\\"\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"#DEFINE CTAB CHR(9)\\n#DEFINE CRLF CHR(13) + CHR(10)\\nLOCAL lcTxt As String, i As Integer\\nCLOSE DATABASES ALL\\nSET SAFETY OFF\\nCLEAR\\nCREATE CURSOR scores (score I, name V(8), rownum I AUTOINC)\\nINDEX ON score TAG score COLLATE \\\"Machine\\\"\\nSET ORDER TO 0\\nINSERT INTO scores (score, name) VALUES (44, \\\"Solomon\\\")\\nINSERT INTO scores (score, name) VALUES (42, \\\"Jason\\\")\\nINSERT INTO scores (score, name) VALUES (42, \\\"Errol\\\")\\nINSERT INTO scores (score, name) VALUES (41, \\\"Garry\\\")\\nINSERT INTO scores (score, name) VALUES (41, \\\"Bernard\\\")\\nINSERT INTO scores (score, name) VALUES (41, \\\"Barry\\\")\\nINSERT INTO scores (score, name) VALUES (39, \\\"Stephen\\\")\\n\\nCREATE CURSOR ranks (sc_rank I, mod_rank I, dense I, ordinal I, fractional B(1), score I, name V(8))\\nINDEX ON score TAG score COLLATE \\\"Machine\\\"\\nSET ORDER TO 0\\nAPPEND FROM DBF(\\\"scores\\\") FIELDS score, name\\nStd_Comp()\\nModified()\\nDense()\\nOrdinal()\\nFractional()\\nCOPY TO ranks.txt TYPE DELIMITED WITH TAB\\nlcTxt = \\\"\\\"\\nFOR i = 1 TO FCOUNT()\\n lcTxt = lcTxt + FIELD(i) + CTAB\\nENDFOR\\nlcTxt = LEFT(lcTxt, LEN(lcTxt) - 1) + CRLF + FILETOSTR(\\\"ranks.txt\\\")\\nSTRTOFILE(lcTxt, \\\"ranks.txt\\\")\\nMODIFY FILE ranks.txt\\nSET SAFETY ON\\n\\nFUNCTION ScoreGroup(aa)\\nLOCAL n As Integer\\nSELECT score, COUNT(*) As num FROM scores ;\\nGROUP BY score ORDER BY score DESC INTO ARRAY aa\\nn = _TALLY\\nRETURN n\\nENDFUNC\\n\\nPROCEDURE Std_Comp\\nLOCAL n, i, nn\\nLOCAL ARRAY a[1]\\nSELECT ranks\\nBLANK FIELDS sc_rank ALL\\nnn = ScoreGroup(@a)\\nn = 1\\nFOR i = 1 TO nn\\n REPLACE sc_rank WITH n FOR score = a[i,1]\\n n = n + a[i,2]\\nENDFOR\\t\\nENDPROC\\n\\nPROCEDURE Modified\\nLOCAL n, i, nn\\nLOCAL ARRAY a[1]\\nSELECT ranks\\nBLANK FIELDS mod_rank ALL\\nnn = ScoreGroup(@a)\\nn = 0\\nFOR i = 1 TO nn\\n n = n + a[i,2]\\n REPLACE mod_rank WITH n FOR score = a[i,1]\\nENDFOR\\t\\nENDPROC\\n\\nPROCEDURE Dense\\nLOCAL n, i, nn\\nLOCAL ARRAY a[1]\\nSELECT ranks\\nBLANK FIELDS dense ALL\\nnn = ScoreGroup(@a)\\nSELECT ranks\\nn = 0\\nFOR i = 1 TO nn\\n n = n + a[i,2]\\n REPLACE dense WITH i FOR score = a[i,1]\\nENDFOR\\t\\nENDPROC\\n\\nPROCEDURE Ordinal\\nSELECT ranks\\nBLANK FIELDS ordinal ALL\\nREPLACE ordinal WITH RECNO() ALL\\nENDPROC\\n\\nPROCEDURE Fractional\\nLOCAL i As Integer, nn As Integer\\nLOCAL ARRAY a[1]\\nSELECT ranks\\nBLANK FIELDS fractional ALL\\nSELECT CAST(AVG(rownum) As B(1)), score FROM scores ;\\nGROUP BY score ORDER BY score DESC INTO ARRAY a\\nnn = _TALLY\\nFOR i = 1 TO nn\\n REPLACE fractional WITH a[i,1] FOR score = a[i,2]\\nENDFOR\\t\\nENDPROC\\n\",\n \"language\": \"Visual-FoxPro\"\n },\n {\n \"code\": \"import \\\"./math\\\" for Nums\\nimport \\\"./fmt\\\" for Fmt\\n\\n/* all ranking functions assume the array of Pairs is non-empty and already sorted\\n by decreasing order of scores and then, if the scores are equal, by reverse\\n alphabetic order of names\\n*/\\n\\nvar standardRanking = Fn.new { |scores|\\n var rankings = List.filled(scores.count, 0)\\n rankings[0] = 1\\n for (i in 1...scores.count) {\\n rankings[i] = (scores[i][0] == scores[i-1][0]) ? rankings[i-1] : i + 1\\n }\\n return rankings\\n}\\n\\nvar modifiedRanking = Fn.new { |scores|\\n var rankings = List.filled(scores.count, 0)\\n rankings[0] = 1\\n for (i in 1...scores.count) {\\n rankings[i] = i + 1\\n var currScore = scores[i][0]\\n for (j in i-1..0) {\\n if (currScore != scores[j][0]) break\\n rankings[j] = i + 1\\n }\\n }\\n return rankings\\n}\\n\\nvar denseRanking = Fn.new { |scores|\\n var rankings = List.filled(scores.count, 0)\\n rankings[0] = 1\\n var prevRanking = 1\\n for (i in 1...scores.count) {\\n rankings[i] = (scores[i][0] == scores[i-1][0]) ? prevRanking : (prevRanking = prevRanking+1)\\n }\\n return rankings\\n}\\n\\nvar ordinalRanking = Fn.new { |scores| (1..scores.count).toList }\\n\\nvar fractionalRanking = Fn.new { |scores|\\n var rankings = List.filled(scores.count, 0)\\n rankings[0] = 1\\n for (i in 1...scores.count) {\\n var k = i\\n var currScore = scores[i][0]\\n for (j in i-1..0) {\\n if (currScore != scores[j][0]) break\\n k = j\\n }\\n var avg = Nums.mean(k..i) + 1\\n for (m in k..i) rankings[m] = avg\\n }\\n return rankings\\n}\\n\\nvar printRankings = Fn.new { |title, rankings, scores|\\n System.print(title + \\\":\\\")\\n for (i in 0...rankings.count) {\\n System.print(\\\"%(rankings[i]) %(scores[i][0]) %(scores[i][1])\\\")\\n }\\n System.print()\\n}\\n\\nvar printFractionalRankings = Fn.new { |title, rankings, scores|\\n System.print(title + \\\":\\\")\\n for (i in 0...rankings.count) {\\n Fmt.print(\\\"$3.2f $d $s\\\", rankings[i], scores[i][0], scores[i][1])\\n }\\n System.print()\\n}\\n\\nvar scores = [[44, \\\"Solomon\\\"], [42, \\\"Jason\\\"], [42, \\\"Errol\\\"], [41, \\\"Garry\\\"],\\n [41, \\\"Bernard\\\"], [41, \\\"Barry\\\"], [39, \\\"Stephen\\\"]]\\nprintRankings.call(\\\"Standard ranking\\\", standardRanking.call(scores), scores)\\nprintRankings.call(\\\"Modified ranking\\\", modifiedRanking.call(scores), scores)\\nprintRankings.call(\\\"Dense ranking\\\", denseRanking.call(scores), scores)\\nprintRankings.call(\\\"Ordinal ranking\\\", ordinalRanking.call(scores), scores)\\nprintFractionalRankings.call(\\\"Fractional ranking\\\", fractionalRanking.call(scores), scores)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"n = 7\\ndim puntos(7), ptosnom(7), nombre$(7)\\n\\nsub MostarTabla()\\n for i = 1 to n\\n print str$(ptosnom(i)), \\\" \\\", puntos(i), \\\" \\\", nombre$(i)\\n next i\\n print\\nend sub\\n\\nprint \\\"Puntuaciones a clasificar (mejores primero):\\\"\\nfor i = 1 to n\\n read puntos(i), nombre$(i)\\n print \\\" \\\", puntos(i), \\\" \\\", nombre$(i)\\nnext i\\n\\nprint\\nprint \\\"--- Standard ranking ---\\\"\\nptosnom(1) = 1\\nfor i = 2 to n\\n if puntos(i) = puntos(i-1) then ptosnom(i) = ptosnom(i-1) else ptosnom(i) = i : fi\\nnext i\\nMostarTabla()\\n\\nprint \\\"--- Modified ranking ---\\\"\\nptosnom(n) = n\\nfor i = n-1 to 1 step -1\\n if puntos(i) = puntos(i+1) then ptosnom(i) = ptosnom(i+1) else ptosnom(i) = i : fi\\nnext i\\nMostarTabla()\\n\\nprint \\\"--- Ordinal ranking ---\\\"\\nfor i = 1 to n\\n ptosnom(i) = i\\nnext i\\nMostarTabla()\\n\\nprint \\\"--- Fractional ranking ---\\\"\\ni = 1\\nj = 2\\nrepeat\\n if j <= n then\\n if (puntos(j-1) = puntos(j)) then j = j + 1 : fi\\n end if\\n\\n for k = i to j-1\\n ptosnom(k) = (i+j-1) / 2\\n next k\\n i = j\\n j = j + 1\\nuntil i > n\\nMostarTabla()\\n\\ndata 44, \\\"Solomon\\\", 42, \\\"Jason\\\", 42, \\\"Errol\\\", 41, \\\"Garry\\\", 41, \\\"Bernard\\\", 41, \\\"Barry\\\", 39, \\\"Stephen\\\"\\nend\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"fcn group(scores){ // group like scores into one list --> list of lists\\n sink:=List();\\n scores.reduce('wrap(ps,sn,buf){\\n if(sn[0]!=ps){ sink.append(buf.copy()); buf.clear(); }\\n buf+sn;\\n sn[0];\\n },scores[0][0],buf:=List());\\n sink.append(buf);\\n}\\nfcn print(list,rank){\\n list.apply2('wrap(sn){ \\\"%2s: %s (%d)\\\".fmt(rank,sn[1],sn[0]):println(_); });\\n}\\nfcn rankViaStandard(scores){\\n rank:=1;\\n foreach group in (group(scores)){ print(group,rank); rank+=group.len(); }\\n}\\nfcn rankViaModified(scores){\\n rank:=0;\\n foreach group in (group(scores)){ rank+=group.len(); print(group,rank); }\\n}\\nfcn rankViaDense(scores){\\n rank:=1;\\n foreach group in (group(scores)){ print(group,rank); rank+=1; }\\n}\\nfcn rankViaOrdinal(scores){\\n scores.apply2('wrap(sn,rr){ \\\"%2s: %s (%d)\\\".fmt(rr.inc(),sn[1],sn[0]):println(_); },Ref(1));\\n}\\nfcn rankViaFractional(scores){\\n rank:=1;\\n foreach group in (group(scores)){\\n n:=group.len(); r:=rank.reduce(n,'+,0.0)/n; rank+=n;\\n print(group,\\\"%5.2f\\\".fmt(r));\\n }\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \" // these are sorted!?!\\nscores:=T(T(44,\\\"Solomon\\\"), T(42,\\\"Jason\\\"), T(42,\\\"Errol\\\"), T(41,\\\"Garry\\\"),\\n T(41,\\\"Bernard\\\"),T(41,\\\"Barry\\\"),T(39,\\\"Stephen\\\"),);\\n\\\"Standard:\\\" .println(); rankViaStandard(scores);\\n\\\"Modified:\\\" .println(); rankViaModified(scores);\\n\\\"Dense:\\\" .println(); rankViaDense(scores);\\n\\\"Ordinal:\\\" .println(); rankViaOrdinal(scores);\\n\\\"Fractional:\\\".println(); rankViaFractional(scores);\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Ranking-methods"}}},{"rowIdx":1562,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Rate_counter\n","language":"00-META"},{"code":"Counting the frequency at which something occurs is a common activity in measuring performance and managing resources. In this task, we assume that there is some job which we want to perform repeatedly, and we want to know how quickly these jobs are being performed.\n\nOf interest is the code that performs the actual measurements. Any other code (such as job implementation or dispatching) that is required to demonstrate the rate tracking is helpful, but not the focus.\n\nMultiple approaches are allowed (even preferable), so long as they can accomplish these goals:\n\n* Run N seconds worth of jobs and/or Y jobs.\n* Report at least three distinct times.\n\n<br>Be aware of the precision and accuracy limitations of your timing mechanisms, and document them if you can.\n\n'''See also:''' [[System time]], [[Time a function]]\n\n","language":"00-TASK"},{"code":"INCLUDE \"D2:REAL.ACT\" ;from the Action! Tool Kit\n\nDEFINE PTR=\"CARD\"\n\nCARD FUNC GetFrame()\n BYTE RTCLOK1=$13,RTCLOK2=$14\n CARD res\n BYTE lsb=res,msb=res+1\n\n lsb=RTCLOK2\n msb=RTCLOK1\nRETURN (res)\n\nCARD FUNC FramesToMs(CARD frames)\n BYTE PALNTSC=$D014\n CARD res\n\n IF PALNTSC=15 THEN\n res=frames*60\n ELSE\n res=frames*50\n FI\nRETURN (res)\n\nCARD FUNC ItersPerSecond(CARD timeMs,iters)\n REAL rTime,rIters,r1000,tmp\n CARD res\n\n IntToReal(timeMs,tmp)\n IntToReal(iters,rIters)\n IntToReal(1000,r1000)\n RealDiv(tmp,r1000,rTime)\n RealDiv(rIters,rTime,tmp)\n res=RealToInt(tmp)\nRETURN (res)\n\n;jump addr is stored in X and A registers\nPROC Action=*(PTR jumpAddr)\n DEFINE STX=\"$8E\"\n DEFINE STA=\"$8D\"\n DEFINE JSR=\"$20\"\n DEFINE RTS=\"$60\"\n [STX Action+8\n STA Action+7\n JSR $00 $00\n RTS]\n\nPROC Benchmark(PTR ARRAY actions,times BYTE count CARD iters)\n BYTE i\n CARD j,beg,end,diff,diffMs\n PTR act\n\n FOR i=0 TO count-1\n DO\n act=actions(i)\n beg=GetFrame()\n FOR j=0 TO iters-1\n DO\n Action(act)\n OD\n end=GetFrame()\n diff=end-beg\n times(i)=FramesToMs(diff)\n OD\nRETURN\n\nPROC Action1()\nRETURN\n\nPROC Action2()\n INT a=[12345],b=[23456],c\n\n c=a+b\nRETURN\n\nPROC Action3()\n INT i=[12345]\n CHAR ARRAY s(6)\n\n StrI(i,s)\nRETURN\n\nPROC Main()\n DEFINE COUNT=\"3\"\n DEFINE ITERS=\"10000\"\n PTR ARRAY actions(COUNT)\n CARD ARRAY times(COUNT),prec,rate\n BYTE i\n\n Put(125) PutE() ;clear the screen\n prec=FramesToMs(1)\n PrintF(\"Iteration count: %U%E\",ITERS)\n PrintF(\"Clock precision: %U ms%E%E\",prec)\n actions(0)=Action1\n actions(1)=Action2\n actions(2)=Action3\n Benchmark(actions,times,COUNT,ITERS)\n\n FOR i=0 TO COUNT-1\n DO\n rate=ItersPerSecond(times(i),iters)\n PrintF(\"Action%B: %U ms, %U times per sec%E\",i+1,times(i),rate)\n OD\nRETURN\n","language":"Action-"},{"code":"with System; use System;\nwith Ada.Text_IO; use Ada.Text_IO;\nwith Ada.Calendar; use Ada.Calendar;\nwith Ada.Unchecked_Deallocation; use Ada;\nwith Interfaces;\n\nprocedure Rate_Counter is\n pragma Priority (Max_Priority);\n\n package Duration_IO is new Fixed_IO (Duration);\n\n Job_Nbr : constant := 6; -- adjust to your need\n subtype Job_Index is Natural range 1 .. Job_Nbr;\n\n task type Job (ID : Job_Index) is\n pragma Priority (Default_Priority);\n entry Start;\n end Job;\n\n type Job_Ptr is access Job;\n procedure Free is new Unchecked_Deallocation (Job, Job_Ptr);\n\n Jobs : array (Job_Index) of Job_Ptr;\n\n Done : Natural := 0;\n Completed : array (Job_Index) of Boolean := (others => False);\n\n type Timings is array (Job_Index) of Calendar.Time;\n Start_T, Stop_T : Timings;\n\n task body Job is\n Anchor : Interfaces.Integer_32;\n pragma Volatile (Anchor); -- necessary to avoid compiler optimization.\n begin\n accept Start;\n\n for I in Interfaces.Integer_32'Range loop -- the job to do\n Anchor := I;\n end loop;\n end Job;\n\nbegin\n for J in Job_Index'Range loop\n Jobs (J) := new Job (ID => J); -- create the jobs first, sync later\n end loop;\n for J in Job_Index'Range loop -- launch the jobs in parallel\n Start_T (J) := Calendar.Clock; -- get the start time\n Jobs (J).Start; -- priority settings necessary to regain control.\n end loop;\n -- Polling for the results / also possible to use a protected type.\n while not (Done = Job_Nbr) loop\n for J in Job_Index'Range loop\n if not Completed (J) and then Jobs (J)'Terminated then\n Stop_T (J) := Calendar.Clock; -- get the end time\n Put (\"Job #\" & Job_Index'Image (J) & \" is finished. It took \");\n Duration_IO.Put (Stop_T (J) - Start_T (J), Fore => 3, Aft => 2);\n Put_Line (\" seconds.\");\n Completed (J) := True;\n Done := Done + 1;\n end if;\n end loop;\n delay System.Tick; -- according to the precision of the system clock\n end loop;\n Duration_IO.Put (System.Tick, Fore => 1, Aft => 6);\n Put_Line (\" seconds is the precision of System clock.\");\n\n for J in Job_Index'Range loop\n Free (Jobs (J)); -- no GC in Ada, clean-up is explicit\n end loop;\n\nend Rate_Counter;\n","language":"Ada"},{"code":"cube: function [z]->\n z * z * z\n\nloop 1..10 'x [\n benchmark ->\n loop 1..400 'o -> cube 5\n]\n","language":"Arturo"},{"code":"SetBatchLines, -1\nTick := A_TickCount ; store tickcount\nLoop, 1000000 {\n Random, x, 1, 1000000\n Random, y, 1, 1000000\n gcd(x, y)\n}\nt := A_TickCount - Tick ; store ticks elapsed\nMsgBox, % t / 1000 \" Seconds elapsed.`n\" Round(1 / (t / 1000000000), 0) \" Loop iterations per second.\"\n\ngcd(a, b) { ; Euclidean GCD\n while b\n t := b, b := Mod(a, b), a := t\n return, a\n}\n","language":"AutoHotkey"},{"code":"SetBatchLines, -1\nQPX(1) ; start timer\nLoop, 1000000 {\n Random, x, 1, 1000000\n Random, y, 1, 1000000\n gcd(x, y)\n}\nt := QPX(0) ; end timer\nMsgBox, % t \" Seconds elapsed.`n\" Round(1 / (t / 1000000), 0) \" Loop iterations per second.\"\n\nQPX( N=0 ) { ; Wrapper for QueryPerformanceCounter()by SKAN | CD: 06/Dec/2009\n Static F,A,Q,P,X ; www.autohotkey.com/forum/viewtopic.php?t=52083 | LM: 10/Dec/2009\n If ( N && !P )\n Return DllCall(\"QueryPerformanceFrequency\",Int64P,F) + (X:=A:=0) + DllCall(\"QueryPerformanceCounter\",Int64P,P)\n DllCall(\"QueryPerformanceCounter\",Int64P,Q), A:=A+Q-P, P:=Q, X:=X+1\n Return ( N && X=N ) ? (X:=X-1)<<64 : ( N=0 && (R:=A/X/F) ) ? ( R + (A:=P:=X:=0) ) : 1\n}\n\ngcd(a, b) { ; Euclidean GCD\n while b\n t := b, b := Mod(a, b), a := t\n return, a\n}\n","language":"AutoHotkey"},{"code":"' Rate counter\nFOR i = 1 TO 3\n GOSUB timeit\nNEXT\n\ni = 2000\nGOSUB timeit\nEND\n\nLABEL timeit\n iter = 0\n starter = TIMER\n WHILE TRUE DO\n INCR iter\n IF TIMER >= starter + i THEN BREAK\n WEND\n PRINT iter, \" iterations in \", i, \" millisecond\", IIF$(i > 1, \"s\", \"\")\n RETURN\n","language":"BaCon"},{"code":"global i\nsubroutine timeit()\n\titer = 0\n\tstarter = msec\n\twhile True\n\t\titer += 1\n\t\tif msec >= starter + i then exit while\n\tend while\n\tprint iter; \" iteraciones en \"; i; \" milisegundo\";\n\tif i > 1 then print \"s\" else print\nend subroutine\n\nfor i = 1 to 3\n\tcall timeit()\nnext i\n\ni = 200\ncall timeit()\nend\n","language":"BASIC256"},{"code":" PRINT \"Method 1: Calculate reciprocal of elapsed time:\"\n FOR trial% = 1 TO 3\n start% = TIME\n PROCtasktomeasure\n finish% = TIME\n PRINT \"Rate = \"; 100 / (finish%-start%) \" per second\"\n NEXT trial%\n\n PRINT '\"Method 2: Count completed tasks in one second:\"\n FOR trial% = 1 TO 3\n runs% = 0\n finish% = TIME + 100\n REPEAT\n PROCtasktomeasure\n IF TIME < finish% runs% += 1\n UNTIL TIME >= finish%\n PRINT \"Rate = \"; runs% \" per second\"\n NEXT trial%\n END\n\n REM This is an example, replace with the task you want to measure\n DEF PROCtasktomeasure\n LOCAL i%\n FOR i% = 1 TO 1000000\n NEXT\n ENDPROC\n","language":"BBC-BASIC"},{"code":"#include <stdio.h>\n#include <time.h>\n\n// We only get one-second precision on most systems, as\n// time_t only holds seconds.\nstruct rate_state_s\n{\n time_t lastFlush;\n time_t period;\n size_t tickCount;\n};\n\nvoid tic_rate(struct rate_state_s* pRate)\n{\n pRate->tickCount += 1;\n\n time_t now = time(NULL);\n\n if((now - pRate->lastFlush) >= pRate->period)\n {\n //TPS Report\n size_t tps = 0.0;\n if(pRate->tickCount > 0)\n tps = pRate->tickCount / (now - pRate->lastFlush);\n\n printf(\"%u tics per second.\\n\", tps);\n\n //Reset\n pRate->tickCount = 0;\n pRate->lastFlush = now;\n }\n}\n\n// A stub function that simply represents whatever it is\n// that we want to multiple times.\nvoid something_we_do()\n{\n // We use volatile here, as many compilers will optimize away\n // the for() loop otherwise, even without optimizations\n // explicitly enabled.\n //\n // volatile tells the compiler not to make any assumptions\n // about the variable, implying that the programmer knows more\n // about that variable than the compiler, in this case.\n volatile size_t anchor = 0;\n size_t x = 0;\n for(x = 0; x < 0xffff; ++x)\n {\n anchor = x;\n }\n}\n\nint main()\n{\n time_t start = time(NULL);\n\n struct rate_state_s rateWatch;\n rateWatch.lastFlush = start;\n rateWatch.tickCount = 0;\n rateWatch.period = 5; // Report every five seconds.\n\n time_t latest = start;\n // Loop for twenty seconds\n for(latest = start; (latest - start) < 20; latest = time(NULL))\n {\n // Do something.\n something_we_do();\n\n // Note that we did something.\n tic_rate(&rateWatch);\n }\n\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <ctime>\n\n// We only get one-second precision on most systems, as\n// time_t only holds seconds.\nclass CRateState\n{\nprotected:\n time_t m_lastFlush;\n time_t m_period;\n size_t m_tickCount;\npublic:\n CRateState(time_t period);\n void Tick();\n};\n\nCRateState::CRateState(time_t period) : m_lastFlush(std::time(NULL)),\n m_period(period),\n m_tickCount(0)\n{ }\n\nvoid CRateState::Tick()\n{\n m_tickCount++;\n\n time_t now = std::time(NULL);\n\n if((now - m_lastFlush) >= m_period)\n {\n //TPS Report\n size_t tps = 0.0;\n if(m_tickCount > 0)\n tps = m_tickCount / (now - m_lastFlush);\n\n std::cout << tps << \" tics per second\" << std::endl;\n\n //Reset\n m_tickCount = 0;\n m_lastFlush = now;\n }\n}\n\n// A stub function that simply represents whatever it is\n// that we want to multiple times.\nvoid something_we_do()\n{\n // We use volatile here, as many compilers will optimize away\n // the for() loop otherwise, even without optimizations\n // explicitly enabled.\n //\n // volatile tells the compiler not to make any assumptions\n // about the variable, implying that the programmer knows more\n // about that variable than the compiler, in this case.\n volatile size_t anchor = 0;\n for(size_t x = 0; x < 0xffff; ++x)\n {\n anchor = x;\n }\n}\n\nint main()\n{\n time_t start = std::time(NULL);\n\n CRateState rateWatch(5);\n\n // Loop for twenty seconds\n for(time_t latest = start; (latest - start) < 20; latest = std::time(NULL))\n {\n // Do something.\n something_we_do();\n\n // Note that we did something.\n rateWatch.Tick();\n }\n\n return 0;\n}\n","language":"C++"},{"code":"(time (do some stuff))\n","language":"Common-Lisp"},{"code":"(defmacro time-this (cnt &rest body)\n (let ((real-t (gensym)) (run-t (gensym)))\n `(let (,real-t ,run-t)\n (setf ,real-t (get-internal-real-time)\n\t ,run-t (get-internal-run-time))\n (loop repeat ,cnt do ,@body)\n (list (/ (- (get-internal-real-time) ,real-t)\n\t\t(coerce internal-time-units-per-second 'float))\n\t (/ (- (get-internal-run-time) ,run-t)\n\t\t(coerce internal-time-units-per-second 'float))))))\n","language":"Common-Lisp"},{"code":"(print (time-this 99 (loop for i below 10000 sum i)))\n","language":"Common-Lisp"},{"code":"(0.023 0.022)\n","language":"Common-Lisp"},{"code":"require \"benchmark\"\n\nstruct Document\n property :id\n def initialize(@id : Int32) end\nend\n\ndocuments_a = [] of Int32 | Document\ndocuments_h = {} of Int32 => Int32 | Document\n\n1.upto(10_000) do |n|\n d = Document.new(n)\n documents_a << d\n documents_h[d.id] = d\nend\n\nsearchlist = Array.new(1000){ rand(10_000)+1 }\n\nBenchmark.bm do |x|\n x.report(\"array\"){searchlist.each{ |el| documents_a.any?{ |d| d == el }} }\n x.report(\"hash\") {searchlist.each{ |el| documents_h.has_key?(el) } }\nend\nputs\nBenchmark.ips do |x|\n x.report(\"array\"){searchlist.each{ |el| documents_a.any?{ |d| d == el }} }\n x.report(\"hash\") {searchlist.each{ |el| documents_h.has_key?(el) } }\nend\n","language":"Crystal"},{"code":"import std.stdio;\nimport std.conv;\nimport std.datetime.stopwatch;\n\nint a;\nvoid f0() {}\nvoid f1() { auto b = a; }\nvoid f2() { auto b = to!string(a); }\n\n\t\nvoid main()\n{\n auto r = benchmark!(f0, f1, f2)(10_000);\n\n writeln(\"Time fx took to run 10,000 times:\\n\");\n writeln(\"f0: \", r[0]);\n writeln(\"f1: \", r[1]);\n writeln(\"f2: \", r[2]);\n\t\n}\n","language":"D"},{"code":"program Rate_counter;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils,\n System.Diagnostics;\n\nvar\n a: Integer;\n\nfunction TickToString(Tick: Int64): string;\nvar\n ns, us, ms, s, t: Cardinal;\nbegin\n Result := '';\n ns := (Tick mod 10) * 100;\n if ns > 0 then\n Result := format(' %dns', [ns]);\n\n t := Tick div 10;\n us := t mod 1000;\n if us > 0 then\n Result := format(' %dus', [us]) + Result;\n\n t := t div 1000;\n ms := t mod 1000;\n if ms > 0 then\n Result := format(' %dms', [ms]) + Result;\n\n t := t div 1000;\n s := t mod 1000;\n if s > 0 then\n Result := format(' %ds', [s]) + Result;\nend;\n\nfunction Benchmark(Fns: TArray<TProc>; times: Cardinal): TArray<string>;\nvar\n Stopwatch: TStopwatch;\n fn: TProc;\n i, j: Cardinal;\nbegin\n SetLength(result, length(Fns));\n Stopwatch := TStopwatch.Create;\n\n for i := 0 to High(Fns) do\n begin\n fn := Fns[i];\n if not Assigned(fn) then\n Continue;\n Stopwatch.Reset;\n Stopwatch.Start;\n for j := 1 to times do\n fn();\n Stopwatch.Stop;\n Result[i] := TickToString(Stopwatch.ElapsedTicks);\n end;\nend;\n\nprocedure F0();\nbegin\nend;\n\nprocedure F1();\nbegin\n var b := a;\nend;\n\nprocedure F2();\nbegin\n var b := a.ToString;\nend;\n\nbegin\n writeln('Time fx took to run 10,000 times:'#10);\n var r := Benchmark([F0, F1, F2], 10000);\n for var i := 0 to High(r) do\n writeln('f', i, ': ', r[i]);\n Readln;\nend.\n","language":"Delphi"},{"code":"def makeLamportSlot := <import:org.erights.e.elib.slot.makeLamportSlot>\n\nThe rate counter:\n\n/** Returns a function to call to report the event being counted, and an\n EverReporter slot containing the current rate, as a float64 in units of\n events per millisecond. */\ndef makeRateCounter(timer, reportPeriod) {\n var count := 0\n var start := timer.now()\n def &rate := makeLamportSlot(nullOk[float64], null)\n\n def signal() {\n def time := timer.now()\n count += 1\n if (time >= start + reportPeriod) {\n rate := count / (time - start)\n start := time\n count := 0\n }\n }\n\n return [signal, &rate]\n}\n","language":"E"},{"code":"/** Dummy task: Retrieve http://localhost/ and return the content. */\ndef theJob() {\n return when (def text := <http://localhost/> <- getText()) -> {\n text\n }\n}\n\n/** Repeatedly run 'action' and wait for it until five seconds have elapsed. */\ndef repeatForFiveSeconds(action) {\n def stopTime := timer.now() + 5000\n def loop() {\n if (timer.now() < stopTime) {\n when (action <- ()) -> {\n loop()\n }\n }\n }\n loop()\n}\n\ndef whenever := <import:org.erights.e.elib.slot.whenever>\n\ndef [signal, &rate] := makeRateCounter(timer, 1000)\n\n# Prepare to report the rate info.\nwhenever([&rate], fn {\n println(`Rate: ${rate*1000} requests/sec`)\n}, fn {true})\n\n# Do some stuff to be counted.\nrepeatForFiveSeconds(fn {\n signal()\n theJob()\n})\n","language":"E"},{"code":"color 700\non animate\n clear\n rad += 0.2\n move 50 50\n circle rad\n if rad > 50\n rad = 0\n .\n t = systime\n if t0 > 0\n print 1000 * (t - t0) & \" ms\"\n .\n t0 = t\nend\n","language":"EasyLang"},{"code":"-module( rate_counter ).\n\n-export( [fun_during_seconds/2, task/0] ).\n\nfun_during_seconds( Fun, Seconds ) ->\n\tMy_pid = erlang:self(),\n\tRef = erlang:make_ref(),\n Pid = erlang:spawn( fun() -> fun_during_seconds_loop( My_pid, Fun ) end ),\n timer:send_after( Seconds * 1000, My_pid, {stop, Ref} ),\n\tN = fun_during_seconds_receive_loop( Ref, Pid, 0 ),\n\terlang:exit( Pid, kill ),\n\tN.\n\ntask() ->\n Results = [timer:tc( fun() -> io:fwrite(\"Hello, world!~n\") end ) || _X <- lists:seq(1, 3)],\n Times = [X || {X, _Returned} <- Results],\n io:fwrite( \"Times ~p, average ~p microseconds.~n\", [Times, lists:sum(Times) / erlang:length(Times)]),\n N =\tfun_during_seconds( fun() -> math:sqrt(123) end, 2 ),\n io:fwrite( \"Square root of 123, during 2\tseconds, was done ~p times.~n\", [N] ).\n\n\n\nfun_during_seconds_loop( Pid, Fun ) ->\n\tFun(),\n\tPid ! {one_time, erlang:self()},\n\tfun_during_seconds_loop( Pid, Fun ).\n\nfun_during_seconds_receive_loop( Ref, Pid, N ) ->\n\treceive\n\t{stop, Ref} -> N;\n {one_time, Pid} -> fun_during_seconds_receive_loop( Ref, Pid, N + 1 )\n\tend.\n","language":"Erlang"},{"code":"PROGRAM RATE_COUNTER\n\n!\n! for rosettacode.org\n!\n\n!\n! This is an example, replace with the task you want to measure\n!\nPROCEDURE TASK_TO_MEASURE\n LOCAL I\n FOR I=1 TO 1000000 DO\n END FOR\nEND PROCEDURE\n\nBEGIN\n PRINT(\"Method 1: Calculate reciprocal of elapsed time:\")\n FOR TRIAL%=1 TO 3 DO\n START=TIMER\n TASK_TO_MEASURE\n FINISH=TIMER\n PRINT(\"Rate =\";100/(FINISH-START);\"per second\")\n END FOR\n\n PRINT(\"Method 2: Count completed tasks in one minute:\")\n FOR TRIAL%=1 TO 3 DO\n RUNS%=0\n FINISH=TIMER+60\n REPEAT\n TASK_TO_MEASURE\n IF TIMER<FINISH THEN RUNS%+=1 END IF\n UNTIL TIMER>=FINISH\n PRINT(\"Rate =\";RUNS%;\"per minute\")\n END FOR\nEND PROGRAM\n","language":"ERRE"},{"code":" DO I = FIRST,LAST\n IF (PROGRESSNOTE((I - FIRST)/(LAST - FIRST + 1.0))) WRITE (6,*) \"Reached \",I,\", towards \",LAST\n ...much computation...\n END DO\n","language":"Fortran"},{"code":"Dim Shared As Integer i\n\nSub timeit\n Dim As Integer iter = 0\n Dim As Double starter = Timer\n While True\n iter += 1\n If Timer >= starter + i Then Exit While\n Wend\n Print iter; \" iteraciones en\"; i; \" milisegundo\"; Iif(i > 1, \"s\", \"\")\nEnd Sub\n\nFor i = 1 To 3\n timeit\nNext i\n\ni = 200 : timeit\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/rand\"\n \"time\"\n)\n\n// representation of time.Time is nanosecond, actual resolution system specific\ntype rateStateS struct {\n lastFlush time.Time\n period time.Duration\n tickCount int\n}\n\nfunc ticRate(pRate *rateStateS) {\n pRate.tickCount++\n now := time.Now()\n if now.Sub(pRate.lastFlush) >= pRate.period {\n // TPS Report\n tps := 0.\n if pRate.tickCount > 0 {\n tps = float64(pRate.tickCount) / now.Sub(pRate.lastFlush).Seconds()\n }\n fmt.Println(tps, \"tics per second.\")\n\n // Reset\n pRate.tickCount = 0\n pRate.lastFlush = now\n }\n}\n\nfunc somethingWeDo() {\n time.Sleep(time.Duration(9e7 + rand.Int63n(2e7))) // sleep about .1 second.\n}\n\nfunc main() {\n start := time.Now()\n\n rateWatch := rateStateS{\n lastFlush: start,\n period: 5 * time.Second,\n }\n\n // Loop for twenty seconds\n latest := start\n for latest.Sub(start) < 20*time.Second {\n somethingWeDo()\n ticRate(&rateWatch)\n latest = time.Now()\n }\n}\n","language":"Go"},{"code":"import Control.Monad\nimport Control.Concurrent\nimport Data.Time\n\ngetTime :: IO DiffTime\ngetTime = fmap utctDayTime getCurrentTime\n\naddSample :: MVar [a] -> a -> IO ()\naddSample q v = modifyMVar_ q (return . (v:))\n\ntimeit :: Int -> IO a -> IO [DiffTime]\ntimeit n task = do\n samples <- newMVar []\n forM_ [0..n] $ \\n -> do\n t1 <- getTime\n task\n t2 <- getTime\n addSample samples (t2 - t1)\n\n readMVar samples\n\nmain = timeit 10 (threadDelay 1000000)\n","language":"Haskell"},{"code":"CHARACTER prompt='Count \"Hits++\" for 5 sec, get current rate'\n\nDLG(Button=\"1:&Hits++\", CALL=\"cb\", B=\"2:&Count 5sec\", B=\"3:&Rate\", RC=retcod, TItle=prompt, WIN=hdl)\n\nSUBROUTINE cb ! callback after dialog buttons\n IF(retcod == 1) THEN ! \"Hits++\" button\n Hits = Hits + 1\n ELSEIF(retcod == 2) THEN ! \"Count 5 sec\" button\n Hits = 0\n ALARM(5, 5) ! call F5 in 5 seconds\n t_start = TIME()\n ELSE ! \"Rate\" button\n sec = TIME() - t_start\n WRITE(StatusBar) 'Average rate since last \"5 sec\" button = ', hits/sec, \" Hz\"\n ENDIF\nEND\n\nSUBROUTINE F5 ! called 5 sec after button \"5 sec\"\n WRITE(StatusBar) Hits, \"hits last 5 sec\"\nEND\n","language":"HicEst"},{"code":" x (6!:2) y\n","language":"J"},{"code":" list=: 1e6 ?@$ 100 NB. 1 million random integers from 0 to 99\n freqtable=: ~. ,. #/.~ NB. verb to calculate and build frequency table\n 20 (6!:2) 'freqtable list' NB. calculate and build frequency table for list, 20 times\n0.00994106\n","language":"J"},{"code":" 1 1 1 (6!:2) 'freqtable list'\n0.0509995 0.0116702 0.0116266\n","language":"J"},{"code":"import java.util.function.Consumer;\n\npublic class RateCounter {\n\n public static void main(String[] args) {\n for (double d : benchmark(10, x -> System.out.print(\"\"), 10))\n System.out.println(d);\n }\n\n static double[] benchmark(int n, Consumer<Integer> f, int arg) {\n double[] timings = new double[n];\n for (int i = 0; i < n; i++) {\n long time = System.nanoTime();\n f.accept(arg);\n timings[i] = System.nanoTime() - time;\n }\n return timings;\n }\n}\n","language":"Java"},{"code":"import java.util.function.IntConsumer;\nimport java.util.stream.DoubleStream;\n\nimport static java.lang.System.nanoTime;\nimport static java.util.stream.DoubleStream.generate;\n\nimport static java.lang.System.out;\n\npublic interface RateCounter {\n public static void main(final String... arguments) {\n benchmark(\n 10,\n x -> out.print(\"\"),\n 10\n )\n .forEach(out::println)\n ;\n }\n\n public static DoubleStream benchmark(\n final int n,\n final IntConsumer consumer,\n final int argument\n ) {\n return generate(() -> {\n final long time = nanoTime();\n consumer.accept(argument);\n return nanoTime() - time;\n })\n .limit(n)\n ;\n }\n}\n","language":"Java"},{"code":"function millis() { // Gets current time in milliseconds.\n return (new Date()).getTime();\n}\n\n/* Executes function 'func' n times, returns array of execution times. */\nfunction benchmark(n, func, args) {\n var times = [];\n for (var i=0; i<n; i++) {\n var m = millis();\n func.apply(func, args);\n times.push(millis() - m);\n }\n return times;\n}\n","language":"JavaScript"},{"code":"def cube: . * . * .;\n\ndef pow3: pow(.; 3);\n\ndef benchmark($n; func; $arg; $calls):\n reduce range(0; $n) as $i ([];\n now as $_\n | (range(0; $calls) | ($arg | func)) as $x\n # milliseconds:\n | . + [(now - $_) * 1000 | floor] ) ;\n\n\"Timings (total elapsed time in milliseconds):\",\n\"cube pow3\",\n([benchmark(10; cube; 5; 1e5), benchmark(10; pow3; 5; 1e5)]\n | transpose[]\n | \"\\(.[0]) \\(.[1])\" )\n","language":"Jq"},{"code":"#!/usr/bin/env jsish\n\"use strict\";\n/* Rate counter, timer access, in Jsish */\n\n/* System time in milliseconds */\nvar runs = 0, newMs;\nfunction countJobsIsTheJob() { runs += 1; }\nvar milliSeconds = strptime();\nwhile ((newMs = strptime()) < (milliSeconds + 1000)) { countJobsIsTheJob(); }\nputs(runs, 'runs in', newMs - milliSeconds, 'ms');\n\n\n/* Builtin times test(callback, runs), result in microseconds */\nfunction sleeper() { sleep(10); }\n\nvar timer;\nfor (var i = 1; i < 4; i++) {\n timer = times(sleeper, 100);\n puts(timer, 'μs to sleep 10 ms, 100 times');\n}\n","language":"Jsish"},{"code":"dosomething() = sleep(abs(randn()))\n\nfunction runNsecondsworthofjobs(N)\n times = Vector{Float64}()\n totaltime = 0\n runcount = 0\n while totaltime < N\n t = @elapsed(dosomething())\n push!(times, t)\n totaltime += t\n runcount += 1\n end\n println(\"Ran job $runcount times, for total time of $totaltime seconds.\")\n println(\"Average time per run was $(sum(times)/length(times)) seconds.\")\n println(\"Individual times of the jobs in seconds were:\")\n for t in times\n println(\" $t\")\n end\nend\n\nrunNsecondsworthofjobs(5)\n","language":"Julia"},{"code":"// version 1.1.3\n\ntypealias Func<T> = (T) -> T\n\nfun cube(n: Int) = n * n * n\n\nfun <T> benchmark(n: Int, func: Func<T>, arg: T): LongArray {\n val times = LongArray(n)\n for (i in 0 until n) {\n val m = System.nanoTime()\n func(arg)\n times[i] = System.nanoTime() - m\n }\n return times\n}\n\nfun main(args: Array<String>) {\n println(\"\\nTimings (nanoseconds) : \")\n for (time in benchmark(10, ::cube, 5)) println(time)\n}\n","language":"Kotlin"},{"code":"Print \"Rate counter\"\nprint \"Precision: system clock, ms \";\nt0=time$(\"ms\")\nwhile time$(\"ms\")=t0 'busy loop till click ticks\nwend\nprint time$(\"ms\")-t0\nprint\n\nPrint \"Run jobs N times, report every time\"\nPrint \"After that, report average time\"\nN=10\nt00=time$(\"ms\")\nfor i = 1 to 10\n scan\n t0=time$(\"ms\")\n 'any code we want to measure goes here\n res = testFunc()\n 'end of measured code\n t1=time$(\"ms\")\n ElapsedTime = t1-t0\n print \"Job #\";i;\" Elapsed time, ms \";ElapsedTime, 1000/ElapsedTime; \" ticks per second\"\nnext\nprint \"---------------------------------\"\nprint \"Average time, ms, is \";(t1-t00)/N, 1000/((t1-t00)/N); \" ticks per second\"\n\n\nprint\nprint \"Run jobs for not less then N seconds (if time up, it'll finish last job)\"\nprint \"After that, report average time\"\n\nNSec=5\ni = 0\nt00=time$(\"ms\")\nwhile time$(\"ms\")<t00+NSec*1000\n scan\n i = i+1\n t0=time$(\"ms\")\n 'any code we want to measure goes here\n res = testFunc()\n 'end of measured code\n t1=time$(\"ms\")\n ElapsedTime = t1-t0\n print \"Job #\";i;\" Elapsed time, ms \";ElapsedTime, 1000/ElapsedTime; \" ticks per second\"\nwend\nprint \"---------------------------------\"\nprint \"Average time, ms, is \";(t1-t00)/i, 1000/((t1-t00)/i); \" ticks per second\"\n\nend\n\nfunction testFunc()\n s=0\n for i = 1 to 30000\n s=s+sin(i)/30000\n next\n testFunc = s\nend function\n","language":"Liberty-BASIC"},{"code":"jobRateCounted[fn_,Y_Integer]:=First[AbsoluteTiming[Do[fn,{Y}]]/Y;\nSetAttributes[jobRateCounted,HoldFirst]\njobRatePeriod[fn_,time_]:=Block[{n=0},TimeConstrained[While[True,fn;n++]];n/time];\nSetAttributes[jobRatePeriod,HoldFirst]\n","language":"Mathematica"},{"code":"import sugar, std/monotimes, times\n\ntype Func[T] = (T) -> T\n\nfunc cube(n: int): int = n * n * n\n\nproc benchmark[T](n: int; f: Func[T]; arg: T): seq[Duration] =\n result.setLen(n)\n for i in 0..<n:\n let m = getMonoTime()\n discard f(arg)\n result[i] = getMonoTime() - m\n\necho \"Timings (nanoseconds):\"\nfor time in benchmark(10, cube, 5):\n echo time.inNanoseconds\n","language":"Nim"},{"code":"'========\n'TIME API\n'========\n\n'http://msdn.microsoft.com/en-us/library/windows/desktop/ms724950(v=vs.85).aspx\n\nextern lib \"kernel32.dll\"\n\ntype SYSTEMTIME\n WORD wYear\n WORD wMonth\n WORD wDayOfWeek\n WORD wDay\n WORD wHour\n WORD wMinute\n WORD wSecond\n WORD wMilliseconds\nend type\n\nvoid GetSystemTime(SYSTEMTIME*t)\nvoid GetLocalTime(SYSTEMTIME*t)\nvoid QueryPerformanceCounter(quad*c)\nvoid QueryPerformanceFrequency(quad*freq)\nvoid Sleep(sys millisecods)\n\nend extern\n\nString WeekDay[7]={\"Sunday\",\"Monday\",\"Tuesday\",\"Wednesday\",\n\"Thursday\",\"Friday\",\"Saturday\"}\n\nString MonthName[12]={\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\n\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"}\n\n\n'==============\nClass Jobrecord\n'==============\n\n has SYSTEMTIME stt\n has SYSTEMTIME fin\n quad countA\n quad CountB\n quad freq\n sys serial\n\n method pad(string s) as string\n method=s\n if len(method)<2 then method=\"0\"+method\n end method\n\n\n method ShowDateTime(sys a,f) as string\n\n SYSTEMTIME *t\n\n if a then\n @t=@fin\n else\n @t=@stt\n end if\n '\n String month=pad(str t.wMonth)\n String day=pad(str t.wDay)\n if f=0 then\n return \"\" t.wYear \"-\" month \"-\" day \" \"+\n pad(t.wHour) \":\" pad(t.wMinute) \":\" pad(t.wSecond) \":\" t.wMilliSeconds\n elseif f=1\n return WeekDay[t.wDayOfWeek+1 and 7 ] \" \" +\n MonthName[t.wMonth and 31] \" \" day \" \" t.wYear\n end if\n end method\n\n method Start()\n QueryPerformanceCounter countA\n QueryPerformanceFrequency freq\n serial++\n GetLocalTime stt\n end method\n\n method Finish()\n GetLocalTime fin\n QueryPerformanceCounter countB\n end method\n\n\n method ShowDuration() as string\n return str((countB-countA)/freq,6) 'seconds with microsecond resolution\n end method\n\n method report() as string\n string tab=chr(9), cr=chr(13)+chr(10)\n method=\"Job:\" tab serial cr +\n \"Duration:\" tab ShowDuration() cr +\n \"Start: \" tab ShowDateTime(0,0) cr +\n \"Finish:\" tab ShowDateTime(1,0) cr +\n ShowDateTime(1,1) cr\n end method\n\nend class\n\n'#recordof JobRecord\n\n'====\n'TEST\n'====\n\nJobRecord JR\nJR.start\nsleep 100 'JOB!\nJR.finish\nprint JR.Report\n'putfile \"s.txt\",JR.Report\n'\n'Job:\t1\n'Duration:\t0.099026\n'Start: \t2012-07-01 00:52:36:874\n'Finish:\t2012-07-01 00:52:36:974\n'Sunday July 01 2012\n","language":"OxygenBasic"},{"code":"a=0;\nb=0;\nfor(n=1,20000000,\n a=a+gettime();\n if(a>60000,print(b);a=0;b=0);\n'''code to test'''\n b=b+1;\n a=a+gettime();\n if(a>60000,print(b);a=0;b=0)\n)\n","language":"PARI-GP"},{"code":"use Benchmark;\n\ntimethese COUNT,{ 'Job1' => &job1, 'Job2' => &job2 };\n\nsub job1\n{\n\t...job1 code...\n}\nsub job2\n{\n\t...job2 code...\n}\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">task_to_measure</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">sleep</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0.1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"method 1: calculate reciprocal of elapsed time:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">trial</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">3</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">task_to_measure</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()-</span><span style=\"color: #000000;\">t</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%g\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">):</span><span style=\"color: #008000;\">\"inf\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"rate = %s per second\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"method 2: count completed tasks in one second:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">trial</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">3</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">runs</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">finish</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">task_to_measure</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()>=</span><span style=\"color: #000000;\">finish</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">runs</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"rate = %d per second\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">runs</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"100000 var iterations\n2 4 2 tolist\nfor\n msec var a\n iterations\n for\n over 2 power + drop\n endfor\n msec a - var dif\n \"take \" print dif print \" secs\" print\n \" or \" print iterations dif / print \" sums per second\" print nl\nendfor\n","language":"Phixmonti"},{"code":"(prin \"Hit a key ... \")\n(key)\n(prinl)\n(let Usec (usec)\n (prin \"Hit another key ... \")\n (key)\n (prinl)\n (prinl \"This took \" (format (- (usec) Usec) 6) \" seconds\") )\n","language":"PicoLisp"},{"code":"(bench (key))\n","language":"PicoLisp"},{"code":"[datetime]$start = Get-Date\n\n[int]$count = 3\n\n[timespan[]]$times = for ($i = 0; $i -lt $count; $i++)\n{\n Measure-Command {0..999999 | Out-Null}\n}\n\n[datetime]$end = Get-Date\n\n$rate = [PSCustomObject]@{\n StartTime = $start\n EndTime = $end\n Duration = ($end - $start).TotalSeconds\n TimesRun = $count\n AverageRunTime = ($times.TotalSeconds | Measure-Object -Average).Average\n}\n\n$rate | Format-List\n","language":"PowerShell"},{"code":"Procedure.d TimesPSec(Reset=#False)\n Static starttime, cnt\n Protected Result.d, dt\n If Reset\n starttime=ElapsedMilliseconds(): cnt=0\n Else\n cnt+1\n dt=(ElapsedMilliseconds()-starttime)\n If dt\n Result=cnt/(ElapsedMilliseconds()-starttime)\n EndIf\n EndIf\n ProcedureReturn Result*1000\nEndProcedure\n\nIf OpenWindow(0,#PB_Ignore,#PB_Ignore,220,110,\"\",#PB_Window_SystemMenu)\n Define Event, r.d, GadgetNumber\n ButtonGadget(0,10, 5,200,35,\"Click me!\")\n ButtonGadget(1,10,70,100,35,\"Reset\")\n TextGadget (2,10,45,200,25,\"\")\n TimesPSec(1)\n Repeat\n Event=WaitWindowEvent()\n If Event=#PB_Event_Gadget\n GadgetNumber =EventGadget()\n If GadgetNumber=0\n r=TimesPSec()\n SetGadgetText(2,\"You are clicking at \"+StrD(r,5)+\" Hz.\")\n ElseIf GadgetNumber=1\n TimesPSec(1)\n SetGadgetText(2,\"Counter zeroed.\")\n EndIf\n EndIf\n Until Event=#PB_Event_CloseWindow\nEndIf\n","language":"PureBasic"},{"code":"Procedure DummyThread(arg)\n Define.d dummy=#PI*Pow(arg,2)/4\nEndProcedure\n\nstart=ElapsedMilliseconds()\nRepeat\n T=CreateThread(@DummyThread(),Random(100))\n WaitThread(T)\n cnt+1\nUntil start+10000<=ElapsedMilliseconds(); Count for 10 sec\n\nmsg$=\"We got \"+Str(cnt)+\" st.\"+Chr(10)+StrF(cnt/10,2)+\" threads per sec.\"\nMessageRequester(\"Counting threads in 10 sec\",msg$)\n","language":"PureBasic"},{"code":"import subprocess\nimport time\n\nclass Tlogger(object):\n def __init__(self):\n self.counts = 0\n self.tottime = 0.0\n self.laststart = 0.0\n self.lastreport = time.time()\n\n def logstart(self):\n self.laststart = time.time()\n\n def logend(self):\n self.counts +=1\n self.tottime += (time.time()-self.laststart)\n if (time.time()-self.lastreport)>5.0: # report once every 5 seconds\n self.report()\n\n def report(self):\n if ( self.counts > 4*self.tottime):\n print \"Subtask execution rate: %f times/second\"% (self.counts/self.tottime);\n else:\n print \"Average execution time: %f seconds\"%(self.tottime/self.counts);\n self.lastreport = time.time()\n\n\ndef taskTimer( n, subproc_args ):\n logger = Tlogger()\n\n for x in range(n):\n logger.logstart()\n p = subprocess.Popen(subproc_args)\n p.wait()\n logger.logend()\n logger.report()\n\n\nimport timeit\nimport sys\n\ndef main( ):\n\n # for accurate timing of code segments\n s = \"\"\"j = [4*n for n in range(50)]\"\"\"\n timer = timeit.Timer(s)\n rzlts = timer.repeat(5, 5000)\n for t in rzlts:\n print \"Time for 5000 executions of statement = \",t\n\n # subprocess execution timing\n print \"#times:\",sys.argv[1]\n print \"Command:\",sys.argv[2:]\n print \"\"\n for k in range(3):\n taskTimer( int(sys.argv[1]), sys.argv[2:])\n\nmain()\n","language":"Python"},{"code":"#lang racket\n\n;; Racket has a useful `time*' macro that does just what's requested:\n;; run some expression N times, and produce timing results\n(require unstable/time)\n\n;; Sample use:\n(define (fib n) (if (<= n 1) n (+ (fib (- n 1)) (fib (- n 2)))))\n(time* 10 (fib 38))\n\n;; But of course, can be used to measure external processes too:\n(time* 10 (system \"sleep 1\"))\n","language":"Racket"},{"code":"sub runrate($N where $N > 0, &todo) {\n my $n = $N;\n\n my $start = now;\n todo() while --$n;\n my $end = now;\n\n say \"Start time: \", DateTime.new($start).Str;\n say \"End time: \", DateTime.new($end).Str;\n my $elapsed = $end - $start;\n\n say \"Elapsed time: $elapsed seconds\";\n say \"Rate: { ($N / $elapsed).fmt('%.2f') } per second\\n\";\n}\n\nsub factorial($n) { (state @)[$n] //= $n < 2 ?? 1 !! $n * factorial($n-1) }\n\nrunrate 100_000, { state $n = 1; factorial($n++) }\n\nrunrate 100_000, { state $n = 1; factorial($n++) }\n","language":"Raku"},{"code":"/*REXX program reports on the amount of elapsed time 4 different tasks use (wall clock).*/\ntime.= /*nullify times for all the tasks below*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncall time 'Reset' /*reset the REXX (elapsed) clock timer.*/\n /*show pi in hex to 2,000 dec. digits.*/\n task.1= 'base(pi,16) ;;; lowercase digits 2k echoOptions'\n call '$CALC' task.1 /*perform task number one (via $CALC).*/\ntime.1=time('E') /*get and save the time used by task 1.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncall time 'Reset' /*reset the REXX (elapsed) clock timer.*/\n /*get primes 40000 ──► 40800 and */\n /*show their differences. */\n task.2= 'diffs[ prime(40k, 40.8k) ] ;;; GRoup 20'\n call '$CALC' task.2 /*perform task number two (via $CALC).*/\ntime.2=time('E') /*get and save the time used by task 2.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncall time 'Reset' /*reset the REXX (elapsed) clock timer.*/\n /*show the Collatz sequence for a */\n /*stupidly gihugeic number. */\n task.3= 'Collatz(38**8) ;;; Horizontal'\n call '$CALC' task.3 /*perform task number three (via $CALC)*/\ntime.3=time('E') /*get and save the time used by task 3.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncall time 'Reset' /*reset the REXX (elapsed) clock timer.*/\n /*plot SINE in ½ degree increments.*/\n /*using five decimal digits (¬ 60). */\n task.4= 'sinD(-180, +180, 0.5) ;;; Plot DIGits 5 echoOptions'\n call '$CALC' task.4 /*perform task number four (via $CALC).*/\ntime.4=time('E') /*get and save the time used by task 4.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nsay\n do j=1 while time.j\\==''\n say 'time used for task' j \"was\" right(format(time.j,,0),4) 'seconds.'\n end /*j*/\n /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"# Project : Rate counter\n\nsee \"method 1: calculate reciprocal of elapsed time:\" + nl\nfor trial = 1 to 3\n start = clock()\n tasktomeasure()\n finish = clock()\n see \"rate = \" + 100 / (finish-start) + \" per second\" + nl\nnext\n\nsee \"method 2: count completed tasks in one second:\" + nl\nfor trial = 1 to 3\n runs = 0\n finish = clock() + 100\n while clock() < finish\n tasktomeasure()\n if clock() < finish\n runs = runs + 1\n ok\n end\n see \"rate = \" + runs + \" per second\" + nl\nnext\n\nfunc tasktomeasure\n for i = 1 to 100000\n next\n","language":"Ring"},{"code":"require 'benchmark'\nDocument = Struct.new(:id,:a,:b,:c)\ndocuments_a = []\ndocuments_h = {}\n1.upto(10_000) do |n|\n d = Document.new(n)\n documents_a << d\n documents_h[d.id] = d\nend\nsearchlist = Array.new(1000){ rand(10_000)+1 }\n\nBenchmark.bm(10) do |x|\n x.report('array'){searchlist.each{|el| documents_a.any?{|d| d.id == el}} }\n x.report('hash'){searchlist.each{|el| documents_h.has_key?(el)} }\nend\n","language":"Ruby"},{"code":"html \"<table bgcolor=wheat border=1><tr><td align=center colspan=2>Rate Counter</td></tr>\n <tr><td>Run Job Times</td><td>\"\n textbox #runTimes,\"10\",3\n\nhtml \"</tr><tr><td align=center colspan=2>\"\n button #r,\"Run\", [runIt]\nhtml \" \"\n button #a, \"Average\", [ave]\nhtml \"</td></tr></table>\"\nwait\n\n[runIt]\nrunTimes = min(10,val(#runTimes contents$()))\ncount = count + 1\nprint \"-------- Run Number \";count;\" ----------------\"\nprint \"Run jobs\";runTimes;\" times, reporting each\"\n\nfor i = 1 to runTimes\n ' -----------------------------------------------------------------\n ' Normally we use a RUN() command to run another program\n ' but for test pruporse we have a routine that simply loops a bunch\n ' -----------------------------------------------------------------\n begTime = time$(\"ms\")\n theRun = bogusProg()\n\n endTime = time$(\"ms\")\n lapsTime = endTime - begTime\n print \"Job #\";i;\" Elapsed time, ms \";lapsTime;\" \";1000/lapsTime; \" ticks per second\"\nnext\naveTime = (endTime-startTime)/runTimes\ntotAveTime = totAveTime + aveTime\nprint \"Average time, ms, is \";aveTime;\" \"; 1000/((endTime-startTime)/runTimes); \" ticks per second\"\nwait\n\n[ave]\nprint \"---------------------------------\"\nprint \"Total average time:\";aveTime/count\n\nfunction bogusProg()\n for i = 1 to 10000\n sini = sini + sin(i)\n tani = tani + tan(i)\n cpsi = cosi + cos(i)\n next\nend function\n","language":"Run-BASIC"},{"code":"def task(n: Int) = Thread.sleep(n * 1000)\ndef rate(fs: List[() => Unit]) = {\n val jobs = fs map (f => scala.actors.Futures.future(f()))\n val cnt1 = scala.actors.Futures.awaitAll(5000, jobs: _*).count(_ != None)\n val cnt2 = scala.actors.Futures.awaitAll(5000, jobs: _*).count(_ != None)\n val cnt3 = scala.actors.Futures.awaitAll(5000, jobs: _*).count(_ != None)\n println(\"%d jobs in 5 seconds\" format cnt1)\n println(\"%d jobs in 10 seconds\" format cnt2)\n println(\"%d jobs in 15 seconds\" format cnt3)\n}\nrate(List.fill(30)(() => task(scala.util.Random.nextInt(10)+1)))\n","language":"Scala"},{"code":"def rate(n: Int, y: Int)(task: => Unit) {\n val startTime = System.currentTimeMillis\n var currTime = startTime\n var loops = 0\n do {\n task\n currTime = System.currentTimeMillis\n loops += 1\n } while (currTime - startTime < n * 1000 && loops < y)\n if (currTime - startTime > n * 1000)\n println(\"Rate %d times per %d seconds\" format (loops - 1, n))\n else\n println(\"Rate %d times in %.3f seconds\" format (y, (currTime - startTime).toDouble / 1000))\n}\nrate(5, 20)(task(2))\n","language":"Scala"},{"code":"var benchmark = frequire('Benchmark');\n\nfunc job1 {\n #...job1 code...\n}\nfunc job2 {\n #...job2 code...\n}\n\nconst COUNT = -1; # run for one CPU second\nbenchmark.timethese(COUNT, Hash.new('Job1' => job1, 'Job2' => job2));\n","language":"Sidef"},{"code":"|times|\ntimes := Bag new.\n1 to: 10 do: [:n| times add:\n (Time millisecondsToRun: [3000 factorial])].\nTranscript show: times average asInteger.\n","language":"Smalltalk"},{"code":"set iters 10\n\n# A silly example task\nproc theTask {} {\n for {set a 0} {$a < 100000} {incr a} {\n expr {$a**3+$a**2+$a+1}\n }\n}\n\n# Measure the time taken $iters times\nfor {set i 1} {$i <= $iters} {incr i} {\n set t [lindex [time {\n theTask\n }] 0]\n puts \"task took $t microseconds on iteration $i\"\n}\n","language":"Tcl"},{"code":"puts [time { set aVar 123 } 1000000]\n","language":"Tcl"},{"code":"#!/bin/bash\n\nwhile : ; do\ntask && echo >> .fc\ndone\n","language":"UNIX-Shell"},{"code":"./foo.sh &\nsleep 5\nmv .fc .fc2 2>/dev/null\nwc -l .fc2 2>/dev/null\nrm .fc2\nsleep 5\nmv .fc .fc2 2>/dev/null\nwc -l .fc2 2>/dev/null\nsleep 5\nmv .fc .fc2 2>/dev/null\nwc -l .fc2 2>/dev/null\nsleep 5\nkillall foo.sh\nwc -l .fc 2>/dev/null\nrm .fc\n","language":"UNIX-Shell"},{"code":"import rand\nimport time\n\n// representation of time.Time is nanosecond, actual resolution system specific\nstruct RateStateS {\nmut:\n last_flush time.Time\n period time.Duration\n tick_count int\n}\n\nfn (mut p_rate RateStateS) tic_rate() {\n p_rate.tick_count++\n now := time.now()\n if now-p_rate.last_flush >= p_rate.period {\n // TPS Report\n mut tps := 0.0\n if p_rate.tick_count > 0 {\n tps = f64(p_rate.tick_count) / (now-p_rate.last_flush).seconds()\n }\n println(\"$tps tics per second.\")\n\n // Reset\n p_rate.tick_count = 0\n p_rate.last_flush = now\n }\n}\n\nfn something_we_do() {\n time.sleep(time.Duration(i64(9e7) + rand.i64n(i64(2e7)) or {i64(0)})) // sleep about .1 second.\n}\n\nfn main() {\n start := time.now()\n\n mut rate_watch := RateStateS{\n last_flush: start,\n period: 5 * time.second,\n }\n\n // Loop for twenty seconds\n mut latest := start\n for latest-start < 20*time.second {\n something_we_do()\n rate_watch.tic_rate()\n latest = time.now()\n }\n}\n","language":"V-(Vlang)"},{"code":"var cube = Fn.new { |n| n * n * n }\n\nvar benchmark = Fn.new { |n, func, arg, calls|\n var times = List.filled(n, 0)\n for (i in 0...n) {\n var m = System.clock\n for (j in 0...calls) func.call(arg)\n times[i] = ((System.clock - m) * 1000).round // milliseconds\n }\n return times\n}\n\nSystem.print(\"Timings (milliseconds) : \")\nfor (time in benchmark.call(10, cube, 5, 1e6)) System.print(time)\n","language":"Wren"},{"code":"include c:\\cxpl\\codes; \\intrinsic 'code' declarations\nint N, I, T0, Time;\n[for N:= 1, 3 do\n [T0:= GetTime;\n for I:= 1 to 100 do\n [while port($3DA) & $08 do []; \\wait for vertical retrace to go away\n repeat until port($3DA) & $08; \\wait for vertical retrace signal\n ];\n Time:= GetTime - T0;\n IntOut(0, Time); Text(0, \" microseconds for 100 samples = \");\n RlOut(0, 100.0e6/float(Time)); Text(0, \"Hz\"); CrLf(0);\n ];\n]\n","language":"XPL0"},{"code":"iterations = 100000\n\nfor j = 2 to 4\n a = peek(\"millisrunning\")\n for i = 1 to iterations\n void = i + j^2\n next\n dif = peek(\"millisrunning\") - a\n print \"take \", dif, \" ms\";\n print \" or \", iterations / dif * 1000 using \"########\", \" sums per second\"\nnext\n","language":"Yabasic"},{"code":"fcn rateCounter(f,timeNRuns,secsToRun=Void){\n now:=Time.Clock.time;\n if(secsToRun){\n then:=now + secsToRun;\n N:=0; do{ f(); N+=1; }while(Time.Clock.time<then);\n t:=Time.Clock.time - now;\n println(\"%d runs in %s seconds = %.3f sec/run\"\n .fmt(N,Time.Date.toHMSString(0,0,t),t.toFloat()/N));\n }\n else{\n do(timeNRuns){ f() }\n t:=Time.Clock.time - now;\n println(\"%s seconds to run %d times = %.3f sec/run\"\n .fmt(Time.Date.toHMSString(0,0,t),timeNRuns,\n\t t.toFloat()/timeNRuns));\n t\n }\n}\n","language":"Zkl"},{"code":"ns:=List.createLong(0d100_000,(0).random,True); // one hundred thousand ints\nrateCounter('wrap(){ ns.copy().sort() },20);\nrateCounter('wrap(){ ns.copy().sort() },Void,10);\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Rate_counter\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Counting the frequency at which something occurs is a common activity in measuring performance and managing resources. In this task, we assume that there is some job which we want to perform repeatedly, and we want to know how quickly these jobs are being performed.\\n\\nOf interest is the code that performs the actual measurements. Any other code (such as job implementation or dispatching) that is required to demonstrate the rate tracking is helpful, but not the focus.\\n\\nMultiple approaches are allowed (even preferable), so long as they can accomplish these goals:\\n\\n* Run N seconds worth of jobs and/or Y jobs.\\n* Report at least three distinct times.\\n\\n<br>Be aware of the precision and accuracy limitations of your timing mechanisms, and document them if you can.\\n\\n'''See also:''' [[System time]], [[Time a function]]\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"INCLUDE \\\"D2:REAL.ACT\\\" ;from the Action! Tool Kit\\n\\nDEFINE PTR=\\\"CARD\\\"\\n\\nCARD FUNC GetFrame()\\n BYTE RTCLOK1=$13,RTCLOK2=$14\\n CARD res\\n BYTE lsb=res,msb=res+1\\n\\n lsb=RTCLOK2\\n msb=RTCLOK1\\nRETURN (res)\\n\\nCARD FUNC FramesToMs(CARD frames)\\n BYTE PALNTSC=$D014\\n CARD res\\n\\n IF PALNTSC=15 THEN\\n res=frames*60\\n ELSE\\n res=frames*50\\n FI\\nRETURN (res)\\n\\nCARD FUNC ItersPerSecond(CARD timeMs,iters)\\n REAL rTime,rIters,r1000,tmp\\n CARD res\\n\\n IntToReal(timeMs,tmp)\\n IntToReal(iters,rIters)\\n IntToReal(1000,r1000)\\n RealDiv(tmp,r1000,rTime)\\n RealDiv(rIters,rTime,tmp)\\n res=RealToInt(tmp)\\nRETURN (res)\\n\\n;jump addr is stored in X and A registers\\nPROC Action=*(PTR jumpAddr)\\n DEFINE STX=\\\"$8E\\\"\\n DEFINE STA=\\\"$8D\\\"\\n DEFINE JSR=\\\"$20\\\"\\n DEFINE RTS=\\\"$60\\\"\\n [STX Action+8\\n STA Action+7\\n JSR $00 $00\\n RTS]\\n\\nPROC Benchmark(PTR ARRAY actions,times BYTE count CARD iters)\\n BYTE i\\n CARD j,beg,end,diff,diffMs\\n PTR act\\n\\n FOR i=0 TO count-1\\n DO\\n act=actions(i)\\n beg=GetFrame()\\n FOR j=0 TO iters-1\\n DO\\n Action(act)\\n OD\\n end=GetFrame()\\n diff=end-beg\\n times(i)=FramesToMs(diff)\\n OD\\nRETURN\\n\\nPROC Action1()\\nRETURN\\n\\nPROC Action2()\\n INT a=[12345],b=[23456],c\\n\\n c=a+b\\nRETURN\\n\\nPROC Action3()\\n INT i=[12345]\\n CHAR ARRAY s(6)\\n\\n StrI(i,s)\\nRETURN\\n\\nPROC Main()\\n DEFINE COUNT=\\\"3\\\"\\n DEFINE ITERS=\\\"10000\\\"\\n PTR ARRAY actions(COUNT)\\n CARD ARRAY times(COUNT),prec,rate\\n BYTE i\\n\\n Put(125) PutE() ;clear the screen\\n prec=FramesToMs(1)\\n PrintF(\\\"Iteration count: %U%E\\\",ITERS)\\n PrintF(\\\"Clock precision: %U ms%E%E\\\",prec)\\n actions(0)=Action1\\n actions(1)=Action2\\n actions(2)=Action3\\n Benchmark(actions,times,COUNT,ITERS)\\n\\n FOR i=0 TO COUNT-1\\n DO\\n rate=ItersPerSecond(times(i),iters)\\n PrintF(\\\"Action%B: %U ms, %U times per sec%E\\\",i+1,times(i),rate)\\n OD\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with System; use System;\\nwith Ada.Text_IO; use Ada.Text_IO;\\nwith Ada.Calendar; use Ada.Calendar;\\nwith Ada.Unchecked_Deallocation; use Ada;\\nwith Interfaces;\\n\\nprocedure Rate_Counter is\\n pragma Priority (Max_Priority);\\n\\n package Duration_IO is new Fixed_IO (Duration);\\n\\n Job_Nbr : constant := 6; -- adjust to your need\\n subtype Job_Index is Natural range 1 .. Job_Nbr;\\n\\n task type Job (ID : Job_Index) is\\n pragma Priority (Default_Priority);\\n entry Start;\\n end Job;\\n\\n type Job_Ptr is access Job;\\n procedure Free is new Unchecked_Deallocation (Job, Job_Ptr);\\n\\n Jobs : array (Job_Index) of Job_Ptr;\\n\\n Done : Natural := 0;\\n Completed : array (Job_Index) of Boolean := (others => False);\\n\\n type Timings is array (Job_Index) of Calendar.Time;\\n Start_T, Stop_T : Timings;\\n\\n task body Job is\\n Anchor : Interfaces.Integer_32;\\n pragma Volatile (Anchor); -- necessary to avoid compiler optimization.\\n begin\\n accept Start;\\n\\n for I in Interfaces.Integer_32'Range loop -- the job to do\\n Anchor := I;\\n end loop;\\n end Job;\\n\\nbegin\\n for J in Job_Index'Range loop\\n Jobs (J) := new Job (ID => J); -- create the jobs first, sync later\\n end loop;\\n for J in Job_Index'Range loop -- launch the jobs in parallel\\n Start_T (J) := Calendar.Clock; -- get the start time\\n Jobs (J).Start; -- priority settings necessary to regain control.\\n end loop;\\n -- Polling for the results / also possible to use a protected type.\\n while not (Done = Job_Nbr) loop\\n for J in Job_Index'Range loop\\n if not Completed (J) and then Jobs (J)'Terminated then\\n Stop_T (J) := Calendar.Clock; -- get the end time\\n Put (\\\"Job #\\\" & Job_Index'Image (J) & \\\" is finished. It took \\\");\\n Duration_IO.Put (Stop_T (J) - Start_T (J), Fore => 3, Aft => 2);\\n Put_Line (\\\" seconds.\\\");\\n Completed (J) := True;\\n Done := Done + 1;\\n end if;\\n end loop;\\n delay System.Tick; -- according to the precision of the system clock\\n end loop;\\n Duration_IO.Put (System.Tick, Fore => 1, Aft => 6);\\n Put_Line (\\\" seconds is the precision of System clock.\\\");\\n\\n for J in Job_Index'Range loop\\n Free (Jobs (J)); -- no GC in Ada, clean-up is explicit\\n end loop;\\n\\nend Rate_Counter;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"cube: function [z]->\\n z * z * z\\n\\nloop 1..10 'x [\\n benchmark ->\\n loop 1..400 'o -> cube 5\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"SetBatchLines, -1\\nTick := A_TickCount ; store tickcount\\nLoop, 1000000 {\\n Random, x, 1, 1000000\\n Random, y, 1, 1000000\\n gcd(x, y)\\n}\\nt := A_TickCount - Tick ; store ticks elapsed\\nMsgBox, % t / 1000 \\\" Seconds elapsed.`n\\\" Round(1 / (t / 1000000000), 0) \\\" Loop iterations per second.\\\"\\n\\ngcd(a, b) { ; Euclidean GCD\\n while b\\n t := b, b := Mod(a, b), a := t\\n return, a\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"SetBatchLines, -1\\nQPX(1) ; start timer\\nLoop, 1000000 {\\n Random, x, 1, 1000000\\n Random, y, 1, 1000000\\n gcd(x, y)\\n}\\nt := QPX(0) ; end timer\\nMsgBox, % t \\\" Seconds elapsed.`n\\\" Round(1 / (t / 1000000), 0) \\\" Loop iterations per second.\\\"\\n\\nQPX( N=0 ) { ; Wrapper for QueryPerformanceCounter()by SKAN | CD: 06/Dec/2009\\n Static F,A,Q,P,X ; www.autohotkey.com/forum/viewtopic.php?t=52083 | LM: 10/Dec/2009\\n If ( N && !P )\\n Return DllCall(\\\"QueryPerformanceFrequency\\\",Int64P,F) + (X:=A:=0) + DllCall(\\\"QueryPerformanceCounter\\\",Int64P,P)\\n DllCall(\\\"QueryPerformanceCounter\\\",Int64P,Q), A:=A+Q-P, P:=Q, X:=X+1\\n Return ( N && X=N ) ? (X:=X-1)<<64 : ( N=0 && (R:=A/X/F) ) ? ( R + (A:=P:=X:=0) ) : 1\\n}\\n\\ngcd(a, b) { ; Euclidean GCD\\n while b\\n t := b, b := Mod(a, b), a := t\\n return, a\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"' Rate counter\\nFOR i = 1 TO 3\\n GOSUB timeit\\nNEXT\\n\\ni = 2000\\nGOSUB timeit\\nEND\\n\\nLABEL timeit\\n iter = 0\\n starter = TIMER\\n WHILE TRUE DO\\n INCR iter\\n IF TIMER >= starter + i THEN BREAK\\n WEND\\n PRINT iter, \\\" iterations in \\\", i, \\\" millisecond\\\", IIF$(i > 1, \\\"s\\\", \\\"\\\")\\n RETURN\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"global i\\nsubroutine timeit()\\n\\titer = 0\\n\\tstarter = msec\\n\\twhile True\\n\\t\\titer += 1\\n\\t\\tif msec >= starter + i then exit while\\n\\tend while\\n\\tprint iter; \\\" iteraciones en \\\"; i; \\\" milisegundo\\\";\\n\\tif i > 1 then print \\\"s\\\" else print\\nend subroutine\\n\\nfor i = 1 to 3\\n\\tcall timeit()\\nnext i\\n\\ni = 200\\ncall timeit()\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \" PRINT \\\"Method 1: Calculate reciprocal of elapsed time:\\\"\\n FOR trial% = 1 TO 3\\n start% = TIME\\n PROCtasktomeasure\\n finish% = TIME\\n PRINT \\\"Rate = \\\"; 100 / (finish%-start%) \\\" per second\\\"\\n NEXT trial%\\n\\n PRINT '\\\"Method 2: Count completed tasks in one second:\\\"\\n FOR trial% = 1 TO 3\\n runs% = 0\\n finish% = TIME + 100\\n REPEAT\\n PROCtasktomeasure\\n IF TIME < finish% runs% += 1\\n UNTIL TIME >= finish%\\n PRINT \\\"Rate = \\\"; runs% \\\" per second\\\"\\n NEXT trial%\\n END\\n\\n REM This is an example, replace with the task you want to measure\\n DEF PROCtasktomeasure\\n LOCAL i%\\n FOR i% = 1 TO 1000000\\n NEXT\\n ENDPROC\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <time.h>\\n\\n// We only get one-second precision on most systems, as\\n// time_t only holds seconds.\\nstruct rate_state_s\\n{\\n time_t lastFlush;\\n time_t period;\\n size_t tickCount;\\n};\\n\\nvoid tic_rate(struct rate_state_s* pRate)\\n{\\n pRate->tickCount += 1;\\n\\n time_t now = time(NULL);\\n\\n if((now - pRate->lastFlush) >= pRate->period)\\n {\\n //TPS Report\\n size_t tps = 0.0;\\n if(pRate->tickCount > 0)\\n tps = pRate->tickCount / (now - pRate->lastFlush);\\n\\n printf(\\\"%u tics per second.\\\\n\\\", tps);\\n\\n //Reset\\n pRate->tickCount = 0;\\n pRate->lastFlush = now;\\n }\\n}\\n\\n// A stub function that simply represents whatever it is\\n// that we want to multiple times.\\nvoid something_we_do()\\n{\\n // We use volatile here, as many compilers will optimize away\\n // the for() loop otherwise, even without optimizations\\n // explicitly enabled.\\n //\\n // volatile tells the compiler not to make any assumptions\\n // about the variable, implying that the programmer knows more\\n // about that variable than the compiler, in this case.\\n volatile size_t anchor = 0;\\n size_t x = 0;\\n for(x = 0; x < 0xffff; ++x)\\n {\\n anchor = x;\\n }\\n}\\n\\nint main()\\n{\\n time_t start = time(NULL);\\n\\n struct rate_state_s rateWatch;\\n rateWatch.lastFlush = start;\\n rateWatch.tickCount = 0;\\n rateWatch.period = 5; // Report every five seconds.\\n\\n time_t latest = start;\\n // Loop for twenty seconds\\n for(latest = start; (latest - start) < 20; latest = time(NULL))\\n {\\n // Do something.\\n something_we_do();\\n\\n // Note that we did something.\\n tic_rate(&rateWatch);\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <ctime>\\n\\n// We only get one-second precision on most systems, as\\n// time_t only holds seconds.\\nclass CRateState\\n{\\nprotected:\\n time_t m_lastFlush;\\n time_t m_period;\\n size_t m_tickCount;\\npublic:\\n CRateState(time_t period);\\n void Tick();\\n};\\n\\nCRateState::CRateState(time_t period) : m_lastFlush(std::time(NULL)),\\n m_period(period),\\n m_tickCount(0)\\n{ }\\n\\nvoid CRateState::Tick()\\n{\\n m_tickCount++;\\n\\n time_t now = std::time(NULL);\\n\\n if((now - m_lastFlush) >= m_period)\\n {\\n //TPS Report\\n size_t tps = 0.0;\\n if(m_tickCount > 0)\\n tps = m_tickCount / (now - m_lastFlush);\\n\\n std::cout << tps << \\\" tics per second\\\" << std::endl;\\n\\n //Reset\\n m_tickCount = 0;\\n m_lastFlush = now;\\n }\\n}\\n\\n// A stub function that simply represents whatever it is\\n// that we want to multiple times.\\nvoid something_we_do()\\n{\\n // We use volatile here, as many compilers will optimize away\\n // the for() loop otherwise, even without optimizations\\n // explicitly enabled.\\n //\\n // volatile tells the compiler not to make any assumptions\\n // about the variable, implying that the programmer knows more\\n // about that variable than the compiler, in this case.\\n volatile size_t anchor = 0;\\n for(size_t x = 0; x < 0xffff; ++x)\\n {\\n anchor = x;\\n }\\n}\\n\\nint main()\\n{\\n time_t start = std::time(NULL);\\n\\n CRateState rateWatch(5);\\n\\n // Loop for twenty seconds\\n for(time_t latest = start; (latest - start) < 20; latest = std::time(NULL))\\n {\\n // Do something.\\n something_we_do();\\n\\n // Note that we did something.\\n rateWatch.Tick();\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"(time (do some stuff))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defmacro time-this (cnt &rest body)\\n (let ((real-t (gensym)) (run-t (gensym)))\\n `(let (,real-t ,run-t)\\n (setf ,real-t (get-internal-real-time)\\n\\t ,run-t (get-internal-run-time))\\n (loop repeat ,cnt do ,@body)\\n (list (/ (- (get-internal-real-time) ,real-t)\\n\\t\\t(coerce internal-time-units-per-second 'float))\\n\\t (/ (- (get-internal-run-time) ,run-t)\\n\\t\\t(coerce internal-time-units-per-second 'float))))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(print (time-this 99 (loop for i below 10000 sum i)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(0.023 0.022)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"require \\\"benchmark\\\"\\n\\nstruct Document\\n property :id\\n def initialize(@id : Int32) end\\nend\\n\\ndocuments_a = [] of Int32 | Document\\ndocuments_h = {} of Int32 => Int32 | Document\\n\\n1.upto(10_000) do |n|\\n d = Document.new(n)\\n documents_a << d\\n documents_h[d.id] = d\\nend\\n\\nsearchlist = Array.new(1000){ rand(10_000)+1 }\\n\\nBenchmark.bm do |x|\\n x.report(\\\"array\\\"){searchlist.each{ |el| documents_a.any?{ |d| d == el }} }\\n x.report(\\\"hash\\\") {searchlist.each{ |el| documents_h.has_key?(el) } }\\nend\\nputs\\nBenchmark.ips do |x|\\n x.report(\\\"array\\\"){searchlist.each{ |el| documents_a.any?{ |d| d == el }} }\\n x.report(\\\"hash\\\") {searchlist.each{ |el| documents_h.has_key?(el) } }\\nend\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio;\\nimport std.conv;\\nimport std.datetime.stopwatch;\\n\\nint a;\\nvoid f0() {}\\nvoid f1() { auto b = a; }\\nvoid f2() { auto b = to!string(a); }\\n\\n\\t\\nvoid main()\\n{\\n auto r = benchmark!(f0, f1, f2)(10_000);\\n\\n writeln(\\\"Time fx took to run 10,000 times:\\\\n\\\");\\n writeln(\\\"f0: \\\", r[0]);\\n writeln(\\\"f1: \\\", r[1]);\\n writeln(\\\"f2: \\\", r[2]);\\n\\t\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Rate_counter;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils,\\n System.Diagnostics;\\n\\nvar\\n a: Integer;\\n\\nfunction TickToString(Tick: Int64): string;\\nvar\\n ns, us, ms, s, t: Cardinal;\\nbegin\\n Result := '';\\n ns := (Tick mod 10) * 100;\\n if ns > 0 then\\n Result := format(' %dns', [ns]);\\n\\n t := Tick div 10;\\n us := t mod 1000;\\n if us > 0 then\\n Result := format(' %dus', [us]) + Result;\\n\\n t := t div 1000;\\n ms := t mod 1000;\\n if ms > 0 then\\n Result := format(' %dms', [ms]) + Result;\\n\\n t := t div 1000;\\n s := t mod 1000;\\n if s > 0 then\\n Result := format(' %ds', [s]) + Result;\\nend;\\n\\nfunction Benchmark(Fns: TArray<TProc>; times: Cardinal): TArray<string>;\\nvar\\n Stopwatch: TStopwatch;\\n fn: TProc;\\n i, j: Cardinal;\\nbegin\\n SetLength(result, length(Fns));\\n Stopwatch := TStopwatch.Create;\\n\\n for i := 0 to High(Fns) do\\n begin\\n fn := Fns[i];\\n if not Assigned(fn) then\\n Continue;\\n Stopwatch.Reset;\\n Stopwatch.Start;\\n for j := 1 to times do\\n fn();\\n Stopwatch.Stop;\\n Result[i] := TickToString(Stopwatch.ElapsedTicks);\\n end;\\nend;\\n\\nprocedure F0();\\nbegin\\nend;\\n\\nprocedure F1();\\nbegin\\n var b := a;\\nend;\\n\\nprocedure F2();\\nbegin\\n var b := a.ToString;\\nend;\\n\\nbegin\\n writeln('Time fx took to run 10,000 times:'#10);\\n var r := Benchmark([F0, F1, F2], 10000);\\n for var i := 0 to High(r) do\\n writeln('f', i, ': ', r[i]);\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"def makeLamportSlot := <import:org.erights.e.elib.slot.makeLamportSlot>\\n\\nThe rate counter:\\n\\n/** Returns a function to call to report the event being counted, and an\\n EverReporter slot containing the current rate, as a float64 in units of\\n events per millisecond. */\\ndef makeRateCounter(timer, reportPeriod) {\\n var count := 0\\n var start := timer.now()\\n def &rate := makeLamportSlot(nullOk[float64], null)\\n\\n def signal() {\\n def time := timer.now()\\n count += 1\\n if (time >= start + reportPeriod) {\\n rate := count / (time - start)\\n start := time\\n count := 0\\n }\\n }\\n\\n return [signal, &rate]\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"/** Dummy task: Retrieve http://localhost/ and return the content. */\\ndef theJob() {\\n return when (def text := <http://localhost/> <- getText()) -> {\\n text\\n }\\n}\\n\\n/** Repeatedly run 'action' and wait for it until five seconds have elapsed. */\\ndef repeatForFiveSeconds(action) {\\n def stopTime := timer.now() + 5000\\n def loop() {\\n if (timer.now() < stopTime) {\\n when (action <- ()) -> {\\n loop()\\n }\\n }\\n }\\n loop()\\n}\\n\\ndef whenever := <import:org.erights.e.elib.slot.whenever>\\n\\ndef [signal, &rate] := makeRateCounter(timer, 1000)\\n\\n# Prepare to report the rate info.\\nwhenever([&rate], fn {\\n println(`Rate: ${rate*1000} requests/sec`)\\n}, fn {true})\\n\\n# Do some stuff to be counted.\\nrepeatForFiveSeconds(fn {\\n signal()\\n theJob()\\n})\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"color 700\\non animate\\n clear\\n rad += 0.2\\n move 50 50\\n circle rad\\n if rad > 50\\n rad = 0\\n .\\n t = systime\\n if t0 > 0\\n print 1000 * (t - t0) & \\\" ms\\\"\\n .\\n t0 = t\\nend\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"-module( rate_counter ).\\n\\n-export( [fun_during_seconds/2, task/0] ).\\n\\nfun_during_seconds( Fun, Seconds ) ->\\n\\tMy_pid = erlang:self(),\\n\\tRef = erlang:make_ref(),\\n Pid = erlang:spawn( fun() -> fun_during_seconds_loop( My_pid, Fun ) end ),\\n timer:send_after( Seconds * 1000, My_pid, {stop, Ref} ),\\n\\tN = fun_during_seconds_receive_loop( Ref, Pid, 0 ),\\n\\terlang:exit( Pid, kill ),\\n\\tN.\\n\\ntask() ->\\n Results = [timer:tc( fun() -> io:fwrite(\\\"Hello, world!~n\\\") end ) || _X <- lists:seq(1, 3)],\\n Times = [X || {X, _Returned} <- Results],\\n io:fwrite( \\\"Times ~p, average ~p microseconds.~n\\\", [Times, lists:sum(Times) / erlang:length(Times)]),\\n N =\\tfun_during_seconds( fun() -> math:sqrt(123) end, 2 ),\\n io:fwrite( \\\"Square root of 123, during 2\\tseconds, was done ~p times.~n\\\", [N] ).\\n\\n\\n\\nfun_during_seconds_loop( Pid, Fun ) ->\\n\\tFun(),\\n\\tPid ! {one_time, erlang:self()},\\n\\tfun_during_seconds_loop( Pid, Fun ).\\n\\nfun_during_seconds_receive_loop( Ref, Pid, N ) ->\\n\\treceive\\n\\t{stop, Ref} -> N;\\n {one_time, Pid} -> fun_during_seconds_receive_loop( Ref, Pid, N + 1 )\\n\\tend.\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"PROGRAM RATE_COUNTER\\n\\n!\\n! for rosettacode.org\\n!\\n\\n!\\n! This is an example, replace with the task you want to measure\\n!\\nPROCEDURE TASK_TO_MEASURE\\n LOCAL I\\n FOR I=1 TO 1000000 DO\\n END FOR\\nEND PROCEDURE\\n\\nBEGIN\\n PRINT(\\\"Method 1: Calculate reciprocal of elapsed time:\\\")\\n FOR TRIAL%=1 TO 3 DO\\n START=TIMER\\n TASK_TO_MEASURE\\n FINISH=TIMER\\n PRINT(\\\"Rate =\\\";100/(FINISH-START);\\\"per second\\\")\\n END FOR\\n\\n PRINT(\\\"Method 2: Count completed tasks in one minute:\\\")\\n FOR TRIAL%=1 TO 3 DO\\n RUNS%=0\\n FINISH=TIMER+60\\n REPEAT\\n TASK_TO_MEASURE\\n IF TIMER<FINISH THEN RUNS%+=1 END IF\\n UNTIL TIMER>=FINISH\\n PRINT(\\\"Rate =\\\";RUNS%;\\\"per minute\\\")\\n END FOR\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \" DO I = FIRST,LAST\\n IF (PROGRESSNOTE((I - FIRST)/(LAST - FIRST + 1.0))) WRITE (6,*) \\\"Reached \\\",I,\\\", towards \\\",LAST\\n ...much computation...\\n END DO\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Dim Shared As Integer i\\n\\nSub timeit\\n Dim As Integer iter = 0\\n Dim As Double starter = Timer\\n While True\\n iter += 1\\n If Timer >= starter + i Then Exit While\\n Wend\\n Print iter; \\\" iteraciones en\\\"; i; \\\" milisegundo\\\"; Iif(i > 1, \\\"s\\\", \\\"\\\")\\nEnd Sub\\n\\nFor i = 1 To 3\\n timeit\\nNext i\\n\\ni = 200 : timeit\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/rand\\\"\\n \\\"time\\\"\\n)\\n\\n// representation of time.Time is nanosecond, actual resolution system specific\\ntype rateStateS struct {\\n lastFlush time.Time\\n period time.Duration\\n tickCount int\\n}\\n\\nfunc ticRate(pRate *rateStateS) {\\n pRate.tickCount++\\n now := time.Now()\\n if now.Sub(pRate.lastFlush) >= pRate.period {\\n // TPS Report\\n tps := 0.\\n if pRate.tickCount > 0 {\\n tps = float64(pRate.tickCount) / now.Sub(pRate.lastFlush).Seconds()\\n }\\n fmt.Println(tps, \\\"tics per second.\\\")\\n\\n // Reset\\n pRate.tickCount = 0\\n pRate.lastFlush = now\\n }\\n}\\n\\nfunc somethingWeDo() {\\n time.Sleep(time.Duration(9e7 + rand.Int63n(2e7))) // sleep about .1 second.\\n}\\n\\nfunc main() {\\n start := time.Now()\\n\\n rateWatch := rateStateS{\\n lastFlush: start,\\n period: 5 * time.Second,\\n }\\n\\n // Loop for twenty seconds\\n latest := start\\n for latest.Sub(start) < 20*time.Second {\\n somethingWeDo()\\n ticRate(&rateWatch)\\n latest = time.Now()\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Control.Monad\\nimport Control.Concurrent\\nimport Data.Time\\n\\ngetTime :: IO DiffTime\\ngetTime = fmap utctDayTime getCurrentTime\\n\\naddSample :: MVar [a] -> a -> IO ()\\naddSample q v = modifyMVar_ q (return . (v:))\\n\\ntimeit :: Int -> IO a -> IO [DiffTime]\\ntimeit n task = do\\n samples <- newMVar []\\n forM_ [0..n] $ \\\\n -> do\\n t1 <- getTime\\n task\\n t2 <- getTime\\n addSample samples (t2 - t1)\\n\\n readMVar samples\\n\\nmain = timeit 10 (threadDelay 1000000)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"CHARACTER prompt='Count \\\"Hits++\\\" for 5 sec, get current rate'\\n\\nDLG(Button=\\\"1:&Hits++\\\", CALL=\\\"cb\\\", B=\\\"2:&Count 5sec\\\", B=\\\"3:&Rate\\\", RC=retcod, TItle=prompt, WIN=hdl)\\n\\nSUBROUTINE cb ! callback after dialog buttons\\n IF(retcod == 1) THEN ! \\\"Hits++\\\" button\\n Hits = Hits + 1\\n ELSEIF(retcod == 2) THEN ! \\\"Count 5 sec\\\" button\\n Hits = 0\\n ALARM(5, 5) ! call F5 in 5 seconds\\n t_start = TIME()\\n ELSE ! \\\"Rate\\\" button\\n sec = TIME() - t_start\\n WRITE(StatusBar) 'Average rate since last \\\"5 sec\\\" button = ', hits/sec, \\\" Hz\\\"\\n ENDIF\\nEND\\n\\nSUBROUTINE F5 ! called 5 sec after button \\\"5 sec\\\"\\n WRITE(StatusBar) Hits, \\\"hits last 5 sec\\\"\\nEND\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \" x (6!:2) y\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" list=: 1e6 ?@$ 100 NB. 1 million random integers from 0 to 99\\n freqtable=: ~. ,. #/.~ NB. verb to calculate and build frequency table\\n 20 (6!:2) 'freqtable list' NB. calculate and build frequency table for list, 20 times\\n0.00994106\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 1 1 1 (6!:2) 'freqtable list'\\n0.0509995 0.0116702 0.0116266\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.function.Consumer;\\n\\npublic class RateCounter {\\n\\n public static void main(String[] args) {\\n for (double d : benchmark(10, x -> System.out.print(\\\"\\\"), 10))\\n System.out.println(d);\\n }\\n\\n static double[] benchmark(int n, Consumer<Integer> f, int arg) {\\n double[] timings = new double[n];\\n for (int i = 0; i < n; i++) {\\n long time = System.nanoTime();\\n f.accept(arg);\\n timings[i] = System.nanoTime() - time;\\n }\\n return timings;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.util.function.IntConsumer;\\nimport java.util.stream.DoubleStream;\\n\\nimport static java.lang.System.nanoTime;\\nimport static java.util.stream.DoubleStream.generate;\\n\\nimport static java.lang.System.out;\\n\\npublic interface RateCounter {\\n public static void main(final String... arguments) {\\n benchmark(\\n 10,\\n x -> out.print(\\\"\\\"),\\n 10\\n )\\n .forEach(out::println)\\n ;\\n }\\n\\n public static DoubleStream benchmark(\\n final int n,\\n final IntConsumer consumer,\\n final int argument\\n ) {\\n return generate(() -> {\\n final long time = nanoTime();\\n consumer.accept(argument);\\n return nanoTime() - time;\\n })\\n .limit(n)\\n ;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function millis() { // Gets current time in milliseconds.\\n return (new Date()).getTime();\\n}\\n\\n/* Executes function 'func' n times, returns array of execution times. */\\nfunction benchmark(n, func, args) {\\n var times = [];\\n for (var i=0; i<n; i++) {\\n var m = millis();\\n func.apply(func, args);\\n times.push(millis() - m);\\n }\\n return times;\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def cube: . * . * .;\\n\\ndef pow3: pow(.; 3);\\n\\ndef benchmark($n; func; $arg; $calls):\\n reduce range(0; $n) as $i ([];\\n now as $_\\n | (range(0; $calls) | ($arg | func)) as $x\\n # milliseconds:\\n | . + [(now - $_) * 1000 | floor] ) ;\\n\\n\\\"Timings (total elapsed time in milliseconds):\\\",\\n\\\"cube pow3\\\",\\n([benchmark(10; cube; 5; 1e5), benchmark(10; pow3; 5; 1e5)]\\n | transpose[]\\n | \\\"\\\\(.[0]) \\\\(.[1])\\\" )\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"#!/usr/bin/env jsish\\n\\\"use strict\\\";\\n/* Rate counter, timer access, in Jsish */\\n\\n/* System time in milliseconds */\\nvar runs = 0, newMs;\\nfunction countJobsIsTheJob() { runs += 1; }\\nvar milliSeconds = strptime();\\nwhile ((newMs = strptime()) < (milliSeconds + 1000)) { countJobsIsTheJob(); }\\nputs(runs, 'runs in', newMs - milliSeconds, 'ms');\\n\\n\\n/* Builtin times test(callback, runs), result in microseconds */\\nfunction sleeper() { sleep(10); }\\n\\nvar timer;\\nfor (var i = 1; i < 4; i++) {\\n timer = times(sleeper, 100);\\n puts(timer, 'μs to sleep 10 ms, 100 times');\\n}\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"dosomething() = sleep(abs(randn()))\\n\\nfunction runNsecondsworthofjobs(N)\\n times = Vector{Float64}()\\n totaltime = 0\\n runcount = 0\\n while totaltime < N\\n t = @elapsed(dosomething())\\n push!(times, t)\\n totaltime += t\\n runcount += 1\\n end\\n println(\\\"Ran job $runcount times, for total time of $totaltime seconds.\\\")\\n println(\\\"Average time per run was $(sum(times)/length(times)) seconds.\\\")\\n println(\\\"Individual times of the jobs in seconds were:\\\")\\n for t in times\\n println(\\\" $t\\\")\\n end\\nend\\n\\nrunNsecondsworthofjobs(5)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.3\\n\\ntypealias Func<T> = (T) -> T\\n\\nfun cube(n: Int) = n * n * n\\n\\nfun <T> benchmark(n: Int, func: Func<T>, arg: T): LongArray {\\n val times = LongArray(n)\\n for (i in 0 until n) {\\n val m = System.nanoTime()\\n func(arg)\\n times[i] = System.nanoTime() - m\\n }\\n return times\\n}\\n\\nfun main(args: Array<String>) {\\n println(\\\"\\\\nTimings (nanoseconds) : \\\")\\n for (time in benchmark(10, ::cube, 5)) println(time)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"Print \\\"Rate counter\\\"\\nprint \\\"Precision: system clock, ms \\\";\\nt0=time$(\\\"ms\\\")\\nwhile time$(\\\"ms\\\")=t0 'busy loop till click ticks\\nwend\\nprint time$(\\\"ms\\\")-t0\\nprint\\n\\nPrint \\\"Run jobs N times, report every time\\\"\\nPrint \\\"After that, report average time\\\"\\nN=10\\nt00=time$(\\\"ms\\\")\\nfor i = 1 to 10\\n scan\\n t0=time$(\\\"ms\\\")\\n 'any code we want to measure goes here\\n res = testFunc()\\n 'end of measured code\\n t1=time$(\\\"ms\\\")\\n ElapsedTime = t1-t0\\n print \\\"Job #\\\";i;\\\" Elapsed time, ms \\\";ElapsedTime, 1000/ElapsedTime; \\\" ticks per second\\\"\\nnext\\nprint \\\"---------------------------------\\\"\\nprint \\\"Average time, ms, is \\\";(t1-t00)/N, 1000/((t1-t00)/N); \\\" ticks per second\\\"\\n\\n\\nprint\\nprint \\\"Run jobs for not less then N seconds (if time up, it'll finish last job)\\\"\\nprint \\\"After that, report average time\\\"\\n\\nNSec=5\\ni = 0\\nt00=time$(\\\"ms\\\")\\nwhile time$(\\\"ms\\\")<t00+NSec*1000\\n scan\\n i = i+1\\n t0=time$(\\\"ms\\\")\\n 'any code we want to measure goes here\\n res = testFunc()\\n 'end of measured code\\n t1=time$(\\\"ms\\\")\\n ElapsedTime = t1-t0\\n print \\\"Job #\\\";i;\\\" Elapsed time, ms \\\";ElapsedTime, 1000/ElapsedTime; \\\" ticks per second\\\"\\nwend\\nprint \\\"---------------------------------\\\"\\nprint \\\"Average time, ms, is \\\";(t1-t00)/i, 1000/((t1-t00)/i); \\\" ticks per second\\\"\\n\\nend\\n\\nfunction testFunc()\\n s=0\\n for i = 1 to 30000\\n s=s+sin(i)/30000\\n next\\n testFunc = s\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"jobRateCounted[fn_,Y_Integer]:=First[AbsoluteTiming[Do[fn,{Y}]]/Y;\\nSetAttributes[jobRateCounted,HoldFirst]\\njobRatePeriod[fn_,time_]:=Block[{n=0},TimeConstrained[While[True,fn;n++]];n/time];\\nSetAttributes[jobRatePeriod,HoldFirst]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import sugar, std/monotimes, times\\n\\ntype Func[T] = (T) -> T\\n\\nfunc cube(n: int): int = n * n * n\\n\\nproc benchmark[T](n: int; f: Func[T]; arg: T): seq[Duration] =\\n result.setLen(n)\\n for i in 0..<n:\\n let m = getMonoTime()\\n discard f(arg)\\n result[i] = getMonoTime() - m\\n\\necho \\\"Timings (nanoseconds):\\\"\\nfor time in benchmark(10, cube, 5):\\n echo time.inNanoseconds\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"'========\\n'TIME API\\n'========\\n\\n'http://msdn.microsoft.com/en-us/library/windows/desktop/ms724950(v=vs.85).aspx\\n\\nextern lib \\\"kernel32.dll\\\"\\n\\ntype SYSTEMTIME\\n WORD wYear\\n WORD wMonth\\n WORD wDayOfWeek\\n WORD wDay\\n WORD wHour\\n WORD wMinute\\n WORD wSecond\\n WORD wMilliseconds\\nend type\\n\\nvoid GetSystemTime(SYSTEMTIME*t)\\nvoid GetLocalTime(SYSTEMTIME*t)\\nvoid QueryPerformanceCounter(quad*c)\\nvoid QueryPerformanceFrequency(quad*freq)\\nvoid Sleep(sys millisecods)\\n\\nend extern\\n\\nString WeekDay[7]={\\\"Sunday\\\",\\\"Monday\\\",\\\"Tuesday\\\",\\\"Wednesday\\\",\\n\\\"Thursday\\\",\\\"Friday\\\",\\\"Saturday\\\"}\\n\\nString MonthName[12]={\\\"January\\\",\\\"February\\\",\\\"March\\\",\\\"April\\\",\\\"May\\\",\\\"June\\\",\\n\\\"July\\\",\\\"August\\\",\\\"September\\\",\\\"October\\\",\\\"November\\\",\\\"December\\\"}\\n\\n\\n'==============\\nClass Jobrecord\\n'==============\\n\\n has SYSTEMTIME stt\\n has SYSTEMTIME fin\\n quad countA\\n quad CountB\\n quad freq\\n sys serial\\n\\n method pad(string s) as string\\n method=s\\n if len(method)<2 then method=\\\"0\\\"+method\\n end method\\n\\n\\n method ShowDateTime(sys a,f) as string\\n\\n SYSTEMTIME *t\\n\\n if a then\\n @t=@fin\\n else\\n @t=@stt\\n end if\\n '\\n String month=pad(str t.wMonth)\\n String day=pad(str t.wDay)\\n if f=0 then\\n return \\\"\\\" t.wYear \\\"-\\\" month \\\"-\\\" day \\\" \\\"+\\n pad(t.wHour) \\\":\\\" pad(t.wMinute) \\\":\\\" pad(t.wSecond) \\\":\\\" t.wMilliSeconds\\n elseif f=1\\n return WeekDay[t.wDayOfWeek+1 and 7 ] \\\" \\\" +\\n MonthName[t.wMonth and 31] \\\" \\\" day \\\" \\\" t.wYear\\n end if\\n end method\\n\\n method Start()\\n QueryPerformanceCounter countA\\n QueryPerformanceFrequency freq\\n serial++\\n GetLocalTime stt\\n end method\\n\\n method Finish()\\n GetLocalTime fin\\n QueryPerformanceCounter countB\\n end method\\n\\n\\n method ShowDuration() as string\\n return str((countB-countA)/freq,6) 'seconds with microsecond resolution\\n end method\\n\\n method report() as string\\n string tab=chr(9), cr=chr(13)+chr(10)\\n method=\\\"Job:\\\" tab serial cr +\\n \\\"Duration:\\\" tab ShowDuration() cr +\\n \\\"Start: \\\" tab ShowDateTime(0,0) cr +\\n \\\"Finish:\\\" tab ShowDateTime(1,0) cr +\\n ShowDateTime(1,1) cr\\n end method\\n\\nend class\\n\\n'#recordof JobRecord\\n\\n'====\\n'TEST\\n'====\\n\\nJobRecord JR\\nJR.start\\nsleep 100 'JOB!\\nJR.finish\\nprint JR.Report\\n'putfile \\\"s.txt\\\",JR.Report\\n'\\n'Job:\\t1\\n'Duration:\\t0.099026\\n'Start: \\t2012-07-01 00:52:36:874\\n'Finish:\\t2012-07-01 00:52:36:974\\n'Sunday July 01 2012\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"a=0;\\nb=0;\\nfor(n=1,20000000,\\n a=a+gettime();\\n if(a>60000,print(b);a=0;b=0);\\n'''code to test'''\\n b=b+1;\\n a=a+gettime();\\n if(a>60000,print(b);a=0;b=0)\\n)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use Benchmark;\\n\\ntimethese COUNT,{ 'Job1' => &job1, 'Job2' => &job2 };\\n\\nsub job1\\n{\\n\\t...job1 code...\\n}\\nsub job2\\n{\\n\\t...job2 code...\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">task_to_measure</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">sleep</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0.1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"method 1: calculate reciprocal of elapsed time:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">trial</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">3</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">task_to_measure</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()-</span><span style=\\\"color: #000000;\\\">t</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%g\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">):</span><span style=\\\"color: #008000;\\\">\\\"inf\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"rate = %s per second\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"method 2: count completed tasks in one second:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">trial</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">3</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">runs</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">finish</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">task_to_measure</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()>=</span><span style=\\\"color: #000000;\\\">finish</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">runs</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"rate = %d per second\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">runs</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"100000 var iterations\\n2 4 2 tolist\\nfor\\n msec var a\\n iterations\\n for\\n over 2 power + drop\\n endfor\\n msec a - var dif\\n \\\"take \\\" print dif print \\\" secs\\\" print\\n \\\" or \\\" print iterations dif / print \\\" sums per second\\\" print nl\\nendfor\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"(prin \\\"Hit a key ... \\\")\\n(key)\\n(prinl)\\n(let Usec (usec)\\n (prin \\\"Hit another key ... \\\")\\n (key)\\n (prinl)\\n (prinl \\\"This took \\\" (format (- (usec) Usec) 6) \\\" seconds\\\") )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"(bench (key))\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"[datetime]$start = Get-Date\\n\\n[int]$count = 3\\n\\n[timespan[]]$times = for ($i = 0; $i -lt $count; $i++)\\n{\\n Measure-Command {0..999999 | Out-Null}\\n}\\n\\n[datetime]$end = Get-Date\\n\\n$rate = [PSCustomObject]@{\\n StartTime = $start\\n EndTime = $end\\n Duration = ($end - $start).TotalSeconds\\n TimesRun = $count\\n AverageRunTime = ($times.TotalSeconds | Measure-Object -Average).Average\\n}\\n\\n$rate | Format-List\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Procedure.d TimesPSec(Reset=#False)\\n Static starttime, cnt\\n Protected Result.d, dt\\n If Reset\\n starttime=ElapsedMilliseconds(): cnt=0\\n Else\\n cnt+1\\n dt=(ElapsedMilliseconds()-starttime)\\n If dt\\n Result=cnt/(ElapsedMilliseconds()-starttime)\\n EndIf\\n EndIf\\n ProcedureReturn Result*1000\\nEndProcedure\\n\\nIf OpenWindow(0,#PB_Ignore,#PB_Ignore,220,110,\\\"\\\",#PB_Window_SystemMenu)\\n Define Event, r.d, GadgetNumber\\n ButtonGadget(0,10, 5,200,35,\\\"Click me!\\\")\\n ButtonGadget(1,10,70,100,35,\\\"Reset\\\")\\n TextGadget (2,10,45,200,25,\\\"\\\")\\n TimesPSec(1)\\n Repeat\\n Event=WaitWindowEvent()\\n If Event=#PB_Event_Gadget\\n GadgetNumber =EventGadget()\\n If GadgetNumber=0\\n r=TimesPSec()\\n SetGadgetText(2,\\\"You are clicking at \\\"+StrD(r,5)+\\\" Hz.\\\")\\n ElseIf GadgetNumber=1\\n TimesPSec(1)\\n SetGadgetText(2,\\\"Counter zeroed.\\\")\\n EndIf\\n EndIf\\n Until Event=#PB_Event_CloseWindow\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"Procedure DummyThread(arg)\\n Define.d dummy=#PI*Pow(arg,2)/4\\nEndProcedure\\n\\nstart=ElapsedMilliseconds()\\nRepeat\\n T=CreateThread(@DummyThread(),Random(100))\\n WaitThread(T)\\n cnt+1\\nUntil start+10000<=ElapsedMilliseconds(); Count for 10 sec\\n\\nmsg$=\\\"We got \\\"+Str(cnt)+\\\" st.\\\"+Chr(10)+StrF(cnt/10,2)+\\\" threads per sec.\\\"\\nMessageRequester(\\\"Counting threads in 10 sec\\\",msg$)\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import subprocess\\nimport time\\n\\nclass Tlogger(object):\\n def __init__(self):\\n self.counts = 0\\n self.tottime = 0.0\\n self.laststart = 0.0\\n self.lastreport = time.time()\\n\\n def logstart(self):\\n self.laststart = time.time()\\n\\n def logend(self):\\n self.counts +=1\\n self.tottime += (time.time()-self.laststart)\\n if (time.time()-self.lastreport)>5.0: # report once every 5 seconds\\n self.report()\\n\\n def report(self):\\n if ( self.counts > 4*self.tottime):\\n print \\\"Subtask execution rate: %f times/second\\\"% (self.counts/self.tottime);\\n else:\\n print \\\"Average execution time: %f seconds\\\"%(self.tottime/self.counts);\\n self.lastreport = time.time()\\n\\n\\ndef taskTimer( n, subproc_args ):\\n logger = Tlogger()\\n\\n for x in range(n):\\n logger.logstart()\\n p = subprocess.Popen(subproc_args)\\n p.wait()\\n logger.logend()\\n logger.report()\\n\\n\\nimport timeit\\nimport sys\\n\\ndef main( ):\\n\\n # for accurate timing of code segments\\n s = \\\"\\\"\\\"j = [4*n for n in range(50)]\\\"\\\"\\\"\\n timer = timeit.Timer(s)\\n rzlts = timer.repeat(5, 5000)\\n for t in rzlts:\\n print \\\"Time for 5000 executions of statement = \\\",t\\n\\n # subprocess execution timing\\n print \\\"#times:\\\",sys.argv[1]\\n print \\\"Command:\\\",sys.argv[2:]\\n print \\\"\\\"\\n for k in range(3):\\n taskTimer( int(sys.argv[1]), sys.argv[2:])\\n\\nmain()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n;; Racket has a useful `time*' macro that does just what's requested:\\n;; run some expression N times, and produce timing results\\n(require unstable/time)\\n\\n;; Sample use:\\n(define (fib n) (if (<= n 1) n (+ (fib (- n 1)) (fib (- n 2)))))\\n(time* 10 (fib 38))\\n\\n;; But of course, can be used to measure external processes too:\\n(time* 10 (system \\\"sleep 1\\\"))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub runrate($N where $N > 0, &todo) {\\n my $n = $N;\\n\\n my $start = now;\\n todo() while --$n;\\n my $end = now;\\n\\n say \\\"Start time: \\\", DateTime.new($start).Str;\\n say \\\"End time: \\\", DateTime.new($end).Str;\\n my $elapsed = $end - $start;\\n\\n say \\\"Elapsed time: $elapsed seconds\\\";\\n say \\\"Rate: { ($N / $elapsed).fmt('%.2f') } per second\\\\n\\\";\\n}\\n\\nsub factorial($n) { (state @)[$n] //= $n < 2 ?? 1 !! $n * factorial($n-1) }\\n\\nrunrate 100_000, { state $n = 1; factorial($n++) }\\n\\nrunrate 100_000, { state $n = 1; factorial($n++) }\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program reports on the amount of elapsed time 4 different tasks use (wall clock).*/\\ntime.= /*nullify times for all the tasks below*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncall time 'Reset' /*reset the REXX (elapsed) clock timer.*/\\n /*show pi in hex to 2,000 dec. digits.*/\\n task.1= 'base(pi,16) ;;; lowercase digits 2k echoOptions'\\n call '$CALC' task.1 /*perform task number one (via $CALC).*/\\ntime.1=time('E') /*get and save the time used by task 1.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncall time 'Reset' /*reset the REXX (elapsed) clock timer.*/\\n /*get primes 40000 ──► 40800 and */\\n /*show their differences. */\\n task.2= 'diffs[ prime(40k, 40.8k) ] ;;; GRoup 20'\\n call '$CALC' task.2 /*perform task number two (via $CALC).*/\\ntime.2=time('E') /*get and save the time used by task 2.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncall time 'Reset' /*reset the REXX (elapsed) clock timer.*/\\n /*show the Collatz sequence for a */\\n /*stupidly gihugeic number. */\\n task.3= 'Collatz(38**8) ;;; Horizontal'\\n call '$CALC' task.3 /*perform task number three (via $CALC)*/\\ntime.3=time('E') /*get and save the time used by task 3.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncall time 'Reset' /*reset the REXX (elapsed) clock timer.*/\\n /*plot SINE in ½ degree increments.*/\\n /*using five decimal digits (¬ 60). */\\n task.4= 'sinD(-180, +180, 0.5) ;;; Plot DIGits 5 echoOptions'\\n call '$CALC' task.4 /*perform task number four (via $CALC).*/\\ntime.4=time('E') /*get and save the time used by task 4.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nsay\\n do j=1 while time.j\\\\==''\\n say 'time used for task' j \\\"was\\\" right(format(time.j,,0),4) 'seconds.'\\n end /*j*/\\n /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Rate counter\\n\\nsee \\\"method 1: calculate reciprocal of elapsed time:\\\" + nl\\nfor trial = 1 to 3\\n start = clock()\\n tasktomeasure()\\n finish = clock()\\n see \\\"rate = \\\" + 100 / (finish-start) + \\\" per second\\\" + nl\\nnext\\n\\nsee \\\"method 2: count completed tasks in one second:\\\" + nl\\nfor trial = 1 to 3\\n runs = 0\\n finish = clock() + 100\\n while clock() < finish\\n tasktomeasure()\\n if clock() < finish\\n runs = runs + 1\\n ok\\n end\\n see \\\"rate = \\\" + runs + \\\" per second\\\" + nl\\nnext\\n\\nfunc tasktomeasure\\n for i = 1 to 100000\\n next\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'benchmark'\\nDocument = Struct.new(:id,:a,:b,:c)\\ndocuments_a = []\\ndocuments_h = {}\\n1.upto(10_000) do |n|\\n d = Document.new(n)\\n documents_a << d\\n documents_h[d.id] = d\\nend\\nsearchlist = Array.new(1000){ rand(10_000)+1 }\\n\\nBenchmark.bm(10) do |x|\\n x.report('array'){searchlist.each{|el| documents_a.any?{|d| d.id == el}} }\\n x.report('hash'){searchlist.each{|el| documents_h.has_key?(el)} }\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"html \\\"<table bgcolor=wheat border=1><tr><td align=center colspan=2>Rate Counter</td></tr>\\n <tr><td>Run Job Times</td><td>\\\"\\n textbox #runTimes,\\\"10\\\",3\\n\\nhtml \\\"</tr><tr><td align=center colspan=2>\\\"\\n button #r,\\\"Run\\\", [runIt]\\nhtml \\\" \\\"\\n button #a, \\\"Average\\\", [ave]\\nhtml \\\"</td></tr></table>\\\"\\nwait\\n\\n[runIt]\\nrunTimes = min(10,val(#runTimes contents$()))\\ncount = count + 1\\nprint \\\"-------- Run Number \\\";count;\\\" ----------------\\\"\\nprint \\\"Run jobs\\\";runTimes;\\\" times, reporting each\\\"\\n\\nfor i = 1 to runTimes\\n ' -----------------------------------------------------------------\\n ' Normally we use a RUN() command to run another program\\n ' but for test pruporse we have a routine that simply loops a bunch\\n ' -----------------------------------------------------------------\\n begTime = time$(\\\"ms\\\")\\n theRun = bogusProg()\\n\\n endTime = time$(\\\"ms\\\")\\n lapsTime = endTime - begTime\\n print \\\"Job #\\\";i;\\\" Elapsed time, ms \\\";lapsTime;\\\" \\\";1000/lapsTime; \\\" ticks per second\\\"\\nnext\\naveTime = (endTime-startTime)/runTimes\\ntotAveTime = totAveTime + aveTime\\nprint \\\"Average time, ms, is \\\";aveTime;\\\" \\\"; 1000/((endTime-startTime)/runTimes); \\\" ticks per second\\\"\\nwait\\n\\n[ave]\\nprint \\\"---------------------------------\\\"\\nprint \\\"Total average time:\\\";aveTime/count\\n\\nfunction bogusProg()\\n for i = 1 to 10000\\n sini = sini + sin(i)\\n tani = tani + tan(i)\\n cpsi = cosi + cos(i)\\n next\\nend function\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"def task(n: Int) = Thread.sleep(n * 1000)\\ndef rate(fs: List[() => Unit]) = {\\n val jobs = fs map (f => scala.actors.Futures.future(f()))\\n val cnt1 = scala.actors.Futures.awaitAll(5000, jobs: _*).count(_ != None)\\n val cnt2 = scala.actors.Futures.awaitAll(5000, jobs: _*).count(_ != None)\\n val cnt3 = scala.actors.Futures.awaitAll(5000, jobs: _*).count(_ != None)\\n println(\\\"%d jobs in 5 seconds\\\" format cnt1)\\n println(\\\"%d jobs in 10 seconds\\\" format cnt2)\\n println(\\\"%d jobs in 15 seconds\\\" format cnt3)\\n}\\nrate(List.fill(30)(() => task(scala.util.Random.nextInt(10)+1)))\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"def rate(n: Int, y: Int)(task: => Unit) {\\n val startTime = System.currentTimeMillis\\n var currTime = startTime\\n var loops = 0\\n do {\\n task\\n currTime = System.currentTimeMillis\\n loops += 1\\n } while (currTime - startTime < n * 1000 && loops < y)\\n if (currTime - startTime > n * 1000)\\n println(\\\"Rate %d times per %d seconds\\\" format (loops - 1, n))\\n else\\n println(\\\"Rate %d times in %.3f seconds\\\" format (y, (currTime - startTime).toDouble / 1000))\\n}\\nrate(5, 20)(task(2))\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"var benchmark = frequire('Benchmark');\\n\\nfunc job1 {\\n #...job1 code...\\n}\\nfunc job2 {\\n #...job2 code...\\n}\\n\\nconst COUNT = -1; # run for one CPU second\\nbenchmark.timethese(COUNT, Hash.new('Job1' => job1, 'Job2' => job2));\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"|times|\\ntimes := Bag new.\\n1 to: 10 do: [:n| times add:\\n (Time millisecondsToRun: [3000 factorial])].\\nTranscript show: times average asInteger.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"set iters 10\\n\\n# A silly example task\\nproc theTask {} {\\n for {set a 0} {$a < 100000} {incr a} {\\n expr {$a**3+$a**2+$a+1}\\n }\\n}\\n\\n# Measure the time taken $iters times\\nfor {set i 1} {$i <= $iters} {incr i} {\\n set t [lindex [time {\\n theTask\\n }] 0]\\n puts \\\"task took $t microseconds on iteration $i\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"puts [time { set aVar 123 } 1000000]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#!/bin/bash\\n\\nwhile : ; do\\ntask && echo >> .fc\\ndone\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"./foo.sh &\\nsleep 5\\nmv .fc .fc2 2>/dev/null\\nwc -l .fc2 2>/dev/null\\nrm .fc2\\nsleep 5\\nmv .fc .fc2 2>/dev/null\\nwc -l .fc2 2>/dev/null\\nsleep 5\\nmv .fc .fc2 2>/dev/null\\nwc -l .fc2 2>/dev/null\\nsleep 5\\nkillall foo.sh\\nwc -l .fc 2>/dev/null\\nrm .fc\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"import rand\\nimport time\\n\\n// representation of time.Time is nanosecond, actual resolution system specific\\nstruct RateStateS {\\nmut:\\n last_flush time.Time\\n period time.Duration\\n tick_count int\\n}\\n\\nfn (mut p_rate RateStateS) tic_rate() {\\n p_rate.tick_count++\\n now := time.now()\\n if now-p_rate.last_flush >= p_rate.period {\\n // TPS Report\\n mut tps := 0.0\\n if p_rate.tick_count > 0 {\\n tps = f64(p_rate.tick_count) / (now-p_rate.last_flush).seconds()\\n }\\n println(\\\"$tps tics per second.\\\")\\n\\n // Reset\\n p_rate.tick_count = 0\\n p_rate.last_flush = now\\n }\\n}\\n\\nfn something_we_do() {\\n time.sleep(time.Duration(i64(9e7) + rand.i64n(i64(2e7)) or {i64(0)})) // sleep about .1 second.\\n}\\n\\nfn main() {\\n start := time.now()\\n\\n mut rate_watch := RateStateS{\\n last_flush: start,\\n period: 5 * time.second,\\n }\\n\\n // Loop for twenty seconds\\n mut latest := start\\n for latest-start < 20*time.second {\\n something_we_do()\\n rate_watch.tic_rate()\\n latest = time.now()\\n }\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"var cube = Fn.new { |n| n * n * n }\\n\\nvar benchmark = Fn.new { |n, func, arg, calls|\\n var times = List.filled(n, 0)\\n for (i in 0...n) {\\n var m = System.clock\\n for (j in 0...calls) func.call(arg)\\n times[i] = ((System.clock - m) * 1000).round // milliseconds\\n }\\n return times\\n}\\n\\nSystem.print(\\\"Timings (milliseconds) : \\\")\\nfor (time in benchmark.call(10, cube, 5, 1e6)) System.print(time)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"include c:\\\\cxpl\\\\codes; \\\\intrinsic 'code' declarations\\nint N, I, T0, Time;\\n[for N:= 1, 3 do\\n [T0:= GetTime;\\n for I:= 1 to 100 do\\n [while port($3DA) & $08 do []; \\\\wait for vertical retrace to go away\\n repeat until port($3DA) & $08; \\\\wait for vertical retrace signal\\n ];\\n Time:= GetTime - T0;\\n IntOut(0, Time); Text(0, \\\" microseconds for 100 samples = \\\");\\n RlOut(0, 100.0e6/float(Time)); Text(0, \\\"Hz\\\"); CrLf(0);\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"iterations = 100000\\n\\nfor j = 2 to 4\\n a = peek(\\\"millisrunning\\\")\\n for i = 1 to iterations\\n void = i + j^2\\n next\\n dif = peek(\\\"millisrunning\\\") - a\\n print \\\"take \\\", dif, \\\" ms\\\";\\n print \\\" or \\\", iterations / dif * 1000 using \\\"########\\\", \\\" sums per second\\\"\\nnext\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"fcn rateCounter(f,timeNRuns,secsToRun=Void){\\n now:=Time.Clock.time;\\n if(secsToRun){\\n then:=now + secsToRun;\\n N:=0; do{ f(); N+=1; }while(Time.Clock.time<then);\\n t:=Time.Clock.time - now;\\n println(\\\"%d runs in %s seconds = %.3f sec/run\\\"\\n .fmt(N,Time.Date.toHMSString(0,0,t),t.toFloat()/N));\\n }\\n else{\\n do(timeNRuns){ f() }\\n t:=Time.Clock.time - now;\\n println(\\\"%s seconds to run %d times = %.3f sec/run\\\"\\n .fmt(Time.Date.toHMSString(0,0,t),timeNRuns,\\n\\t t.toFloat()/timeNRuns));\\n t\\n }\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"ns:=List.createLong(0d100_000,(0).random,True); // one hundred thousand ints\\nrateCounter('wrap(){ ns.copy().sort() },20);\\nrateCounter('wrap(){ ns.copy().sort() },Void,10);\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Rate-counter"}}},{"rowIdx":1563,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Ray-casting_algorithm\nnote: Classic CS problems and programs\n","language":"00-META"},{"code":"<br>\nGiven a point and a polygon, check if the point is inside or outside the polygon using the [[wp:Point in polygon#Ray casting algorithm|ray-casting algorithm]].\n\nA pseudocode can be simply:\n\n count ← 0\n '''foreach''' side '''in''' polygon:\n '''if''' ray_intersects_segment(P,side) '''then'''\n count ← count + 1\n '''if''' ''is_odd''(count) '''then'''\n '''return''' inside\n '''else'''\n '''return''' outside\n\nWhere the function <tt>ray_intersects_segment</tt> return true if the horizontal ray starting from the point P intersects the side (segment), false otherwise.\n\nAn intuitive explanation of why it works is that every time we cross\na border, we change \"country\" (inside-outside, or outside-inside), but\nthe last \"country\" we land on is surely ''outside'' (since the inside of the polygon is finite, while the ray continues towards infinity). So, if we crossed an odd number of borders we were surely inside, otherwise we were outside; we can follow the ray backward to see it better: starting from outside, only an odd number of crossing can give an ''inside'': outside-inside, outside-inside-outside-inside, and so on (the - represents the crossing of a border).\n\nSo the main part of the algorithm is how we determine if a ray intersects a segment. The following text explain one of the possible ways.\n\n[[Image:intersect.png|200px|thumb|right]]\nLooking at the image on the right, we can easily be convinced of the fact that rays starting from points in the hatched area (like P<sub>1</sub> and P<sub>2</sub>) surely do not intersect the segment AB. We also can easily see that rays starting from points in the greenish area surely intersect the segment AB (like point P<sub>3</sub>).\n\nSo the problematic points are those inside the white area (the box delimited by the points A and B), like P<sub>4</sub>.\n\n[[Image:posslope.png|128px|thumb|right]]\n[[Image:negslope.png|128px|thumb|right]]\n\nLet us take into account a segment AB (the point A having y coordinate always smaller than B's y coordinate, i.e. point A is always below point B) and a point P. Let us use the cumbersome notation PAX to denote the angle between segment AP and AX, where X is always a point on the horizontal line passing by A with x coordinate bigger than the maximum between the x coordinate of A and the x coordinate of B. As explained graphically by the figures on the right, if PAX is greater than the angle BAX, then the ray starting from P intersects the segment AB. (In the images, the ray starting from P<sub>A</sub> does not intersect the segment, while the ray starting from P<sub>B</sub> in the second picture, intersects the segment).\n\nPoints on the boundary or \"on\" a vertex are someway special and through this approach we do not obtain ''coherent'' results. They could be treated apart, but it is not necessary to do so.\n\nAn algorithm for the previous speech could be (if P is a point, Px is its x coordinate):\n\n '''ray_intersects_segment''':\n P : the point from which the ray starts\n A : the end-point of the segment with the smallest y coordinate\n (A must be \"below\" B)\n B : the end-point of the segment with the greatest y coordinate\n (B must be \"above\" A)\n '''if''' Py = Ay '''or''' Py = By '''then'''\n Py ← Py + ε\n '''end''' '''if'''\n '''if''' Py < Ay '''or''' Py > By '''then''' \n '''return''' false\n '''else''' '''if''' Px >= max(Ax, Bx) '''then''' \n '''return''' false\n '''else'''\n '''if''' Px < min(Ax, Bx) '''then'''\n '''return''' true\n '''else'''\n '''if''' Ax ≠ Bx '''then'''\n m_red ← (By - Ay)/(Bx - Ax)\n '''else'''\n m_red ← ∞\n '''end''' '''if'''\n '''if''' Ax ≠ Px '''then'''\n m_blue ← (Py - Ay)/(Px - Ax)\n '''else'''\n m_blue ← ∞\n '''end''' '''if'''\n '''if''' m_blue ≥ m_red '''then'''\n '''return''' true\n '''else'''\n '''return''' false\n '''end''' '''if'''\n '''end''' '''if'''\n '''end''' '''if'''\n\n(To avoid the \"ray on vertex\" problem, the point is moved upward of a small quantity <big>ε</big>.)\n<br><br>\n\n","language":"00-TASK"},{"code":"T Pt\n Float x, y\n\n F (x, y)\n .x = x\n .y = y\n\n F String()\n R ‘Pt(x=#., y=#.)’.format(.x, .y)\n\nT Edge\n Pt a, b\n\n F (a, b)\n .a = a\n .b = b\n\n F String()\n R ‘Edge(a=#., b=#.)’.format(.a, .b)\n\nT Poly\n String name\n [Edge] edges\n\n F (name, edges)\n .name = name\n .edges = edges\n\nV _eps = 0.00001\nV _huge = 1e+100\nV _tiny = 1e-100\n\nF rayintersectseg(=p, edge)\n V a = edge.a\n V b = edge.b\n I a.y > b.y\n swap(&a, &b)\n I p.y == a.y | p.y == b.y\n p = Pt(p.x, p.y + :_eps)\n\n V intersect = 0B\n\n I (p.y > b.y | p.y < a.y) | (p.x > max(a.x, b.x))\n R 0B\n\n I p.x < min(a.x, b.x)\n intersect = 1B\n E\n Float m_red, m_blue\n I abs(a.x - b.x) > :_tiny\n m_red = (b.y - a.y) / Float(b.x - a.x)\n E\n m_red = :_huge\n I abs(a.x - p.x) > :_tiny\n m_blue = (p.y - a.y) / Float(p.x - a.x)\n E\n m_blue = :_huge\n intersect = m_blue >= m_red\n R intersect\n\nF ispointinside(p, poly)\n R sum(poly.edges.map(edge -> Int(rayintersectseg(@p, edge)))) % 2 == 1\n\nF polypp(poly)\n print(\"\\n Polygon(name='#.', edges=(\".format(poly.name))\n print(‘ ’(poly.edges.map(e -> String(e)).join(\",\\n \")\"\\n ))\"))\n\nV polys = [\n Poly(name' ‘square’, edges' [Edge(Pt(0, 0), Pt(10, 0)), Edge(Pt(10, 0), Pt(10, 10)), Edge(Pt(10, 10), Pt(0, 10)), Edge(Pt(0, 10), Pt(0, 0))]),\n Poly(name' ‘square_hole’, edges' [Edge(Pt(0, 0), Pt(10, 0)), Edge(Pt(10, 0), Pt(10, 10)), Edge(Pt(10, 10), Pt(0, 10)), Edge(Pt(0, 10), Pt(0, 0)), Edge(Pt(2.5, 2.5), Pt(7.5, 2.5)), Edge(Pt(7.5, 2.5), Pt(7.5, 7.5)), Edge(Pt(7.5, 7.5), Pt(2.5, 7.5)), Edge(Pt(2.5, 7.5), Pt(2.5, 2.5))]),\n Poly(name' ‘strange’, edges' [Edge(Pt(0, 0), Pt(2.5, 2.5)), Edge(Pt(2.5, 2.5), Pt(0, 10)), Edge(Pt(0, 10), Pt(2.5, 7.5)), Edge(Pt(2.5, 7.5), Pt(7.5, 7.5)), Edge(Pt(7.5, 7.5), Pt(10, 10)), Edge(Pt(10, 10), Pt(10, 0)), Edge(Pt(10, 0), Pt(2.5, 2.5))]),\n Poly(name' ‘exagon’, edges' [Edge(Pt(3, 0), Pt(7, 0)), Edge(Pt(7, 0), Pt(10, 5)), Edge(Pt(10, 5), Pt(7, 10)), Edge(Pt(7, 10), Pt(3, 10)), Edge(Pt(3, 10), Pt(0, 5)), Edge(Pt(0, 5), Pt(3, 0))])]\n\nV testpoints = [Pt(5, 5), Pt(5, 8),\n Pt(-10, 5), Pt(0, 5),\n Pt(10, 5), Pt(8, 5),\n Pt(10, 10)]\n\nprint(\"\\n TESTING WHETHER POINTS ARE WITHIN POLYGONS\")\nL(poly) polys\n polypp(poly)\n print(‘ ’testpoints[0.<3].map(p -> ‘#.: #.’.format(p, I ispointinside(p, @poly) {‘True’} E ‘False’)).join(\"\\t\"))\n print(‘ ’testpoints[3.<6].map(p -> ‘#.: #.’.format(p, I ispointinside(p, @poly) {‘True’} E ‘False’)).join(\"\\t\"))\n print(‘ ’testpoints[6.. ].map(p -> ‘#.: #.’.format(p, I ispointinside(p, @poly) {‘True’} E ‘False’)).join(\"\\t\"))\n","language":"11l"},{"code":"package Polygons is\n\n type Point is record\n X, Y : Float;\n end record;\n type Point_List is array (Positive range <>) of Point;\n subtype Segment is Point_List (1 .. 2);\n type Polygon is array (Positive range <>) of Segment;\n\n function Create_Polygon (List : Point_List) return Polygon;\n\n function Is_Inside (Who : Point; Where : Polygon) return Boolean;\n\nend Polygons;\n","language":"Ada"},{"code":"package body Polygons is\n EPSILON : constant := 0.00001;\n\n function Ray_Intersects_Segment\n (Who : Point;\n Where : Segment)\n return Boolean\n is\n The_Point : Point := Who;\n Above : Point;\n Below : Point;\n M_Red : Float;\n Red_Is_Infinity : Boolean := False;\n M_Blue : Float;\n Blue_Is_Infinity : Boolean := False;\n begin\n if Where (1).Y < Where (2).Y then\n Above := Where (2);\n Below := Where (1);\n else\n Above := Where (1);\n Below := Where (2);\n end if;\n if The_Point.Y = Above.Y or The_Point.Y = Below.Y then\n The_Point.Y := The_Point.Y + EPSILON;\n end if;\n if The_Point.Y < Below.Y or The_Point.Y > Above.Y then\n return False;\n elsif The_Point.X > Above.X and The_Point.X > Below.X then\n return False;\n elsif The_Point.X < Above.X and The_Point.X < Below.X then\n return True;\n else\n if Above.X /= Below.X then\n M_Red := (Above.Y - Below.Y) / (Above.X - Below.X);\n else\n Red_Is_Infinity := True;\n end if;\n if Below.X /= The_Point.X then\n M_Blue := (The_Point.Y - Below.Y) / (The_Point.X - Below.X);\n else\n Blue_Is_Infinity := True;\n end if;\n if Blue_Is_Infinity then\n return True;\n elsif Red_Is_Infinity then\n return False;\n elsif M_Blue >= M_Red then\n return True;\n else\n return False;\n end if;\n end if;\n end Ray_Intersects_Segment;\n\n function Create_Polygon (List : Point_List) return Polygon is\n Result : Polygon (List'Range);\n Side : Segment;\n begin\n for I in List'Range loop\n Side (1) := List (I);\n if I = List'Last then\n Side (2) := List (List'First);\n else\n Side (2) := List (I + 1);\n end if;\n Result (I) := Side;\n end loop;\n return Result;\n end Create_Polygon;\n\n function Is_Inside (Who : Point; Where : Polygon) return Boolean is\n Count : Natural := 0;\n begin\n for Side in Where'Range loop\n if Ray_Intersects_Segment (Who, Where (Side)) then\n Count := Count + 1;\n end if;\n end loop;\n if Count mod 2 = 0 then\n return False;\n else\n return True;\n end if;\n end Is_Inside;\n\nend Polygons;\n","language":"Ada"},{"code":"with Ada.Text_IO;\nwith Polygons;\nprocedure Main is\n package Float_IO is new Ada.Text_IO.Float_IO (Float);\n Test_Points : Polygons.Point_List :=\n (( 5.0, 5.0),\n ( 5.0, 8.0),\n (-10.0, 5.0),\n ( 0.0, 5.0),\n ( 10.0, 5.0),\n ( 8.0, 5.0),\n ( 10.0, 10.0));\n Square : Polygons.Polygon :=\n ((( 0.0, 0.0), (10.0, 0.0)),\n ((10.0, 0.0), (10.0, 10.0)),\n ((10.0, 10.0), ( 0.0, 10.0)),\n (( 0.0, 10.0), ( 0.0, 0.0)));\n Square_Hole : Polygons.Polygon :=\n ((( 0.0, 0.0), (10.0, 0.0)),\n ((10.0, 0.0), (10.0, 10.0)),\n ((10.0, 10.0), ( 0.0, 10.0)),\n (( 0.0, 10.0), ( 0.0, 0.0)),\n (( 2.5, 2.5), ( 7.5, 2.5)),\n (( 7.5, 2.5), ( 7.5, 7.5)),\n (( 7.5, 7.5), ( 2.5, 7.5)),\n (( 2.5, 7.5), ( 2.5, 2.5)));\n Strange : Polygons.Polygon :=\n ((( 0.0, 0.0), ( 2.5, 2.5)),\n (( 2.5, 2.5), ( 0.0, 10.0)),\n (( 0.0, 10.0), ( 2.5, 7.5)),\n (( 2.5, 7.5), ( 7.5, 7.5)),\n (( 7.5, 7.5), (10.0, 10.0)),\n ((10.0, 10.0), (10.0, 0.0)),\n ((10.0, 0.0), ( 2.5, 2.5)));\n Exagon : Polygons.Polygon :=\n ((( 3.0, 0.0), ( 7.0, 0.0)),\n (( 7.0, 0.0), (10.0, 5.0)),\n ((10.0, 5.0), ( 7.0, 10.0)),\n (( 7.0, 10.0), ( 3.0, 10.0)),\n (( 3.0, 10.0), ( 0.0, 5.0)),\n (( 0.0, 5.0), ( 3.0, 0.0)));\nbegin\n Ada.Text_IO.Put_Line (\"Testing Square:\");\n for Point in Test_Points'Range loop\n Ada.Text_IO.Put (\"Point(\");\n Float_IO.Put (Test_Points (Point).X, 0, 0, 0);\n Ada.Text_IO.Put (\",\");\n Float_IO.Put (Test_Points (Point).Y, 0, 0, 0);\n Ada.Text_IO.Put\n (\"): \" &\n Boolean'Image (Polygons.Is_Inside (Test_Points (Point), Square)));\n Ada.Text_IO.New_Line;\n end loop;\n Ada.Text_IO.New_Line;\n Ada.Text_IO.Put_Line (\"Testing Square_Hole:\");\n for Point in Test_Points'Range loop\n Ada.Text_IO.Put (\"Point(\");\n Float_IO.Put (Test_Points (Point).X, 0, 0, 0);\n Ada.Text_IO.Put (\",\");\n Float_IO.Put (Test_Points (Point).Y, 0, 0, 0);\n Ada.Text_IO.Put\n (\"): \" &\n Boolean'Image\n (Polygons.Is_Inside (Test_Points (Point), Square_Hole)));\n Ada.Text_IO.New_Line;\n end loop;\n Ada.Text_IO.New_Line;\n Ada.Text_IO.Put_Line (\"Testing Strange:\");\n for Point in Test_Points'Range loop\n Ada.Text_IO.Put (\"Point(\");\n Float_IO.Put (Test_Points (Point).X, 0, 0, 0);\n Ada.Text_IO.Put (\",\");\n Float_IO.Put (Test_Points (Point).Y, 0, 0, 0);\n Ada.Text_IO.Put\n (\"): \" &\n Boolean'Image (Polygons.Is_Inside (Test_Points (Point), Strange)));\n Ada.Text_IO.New_Line;\n end loop;\n Ada.Text_IO.New_Line;\n Ada.Text_IO.Put_Line (\"Testing Exagon:\");\n for Point in Test_Points'Range loop\n Ada.Text_IO.Put (\"Point(\");\n Float_IO.Put (Test_Points (Point).X, 0, 0, 0);\n Ada.Text_IO.Put (\",\");\n Float_IO.Put (Test_Points (Point).Y, 0, 0, 0);\n Ada.Text_IO.Put\n (\"): \" &\n Boolean'Image (Polygons.Is_Inside (Test_Points (Point), Exagon)));\n Ada.Text_IO.New_Line;\n end loop;\nend Main;\n","language":"Ada"},{"code":"BEGIN\n\nMODE POINT = STRUCT( REAL x, y );\n\nMODE POLYGON = STRUCT( STRING name, FLEX[ 1 : 0 ]POINT points );\nPROC contains = ( POLYGON self, POINT p )BOOL:\n BEGIN\n BOOL odd := FALSE, REAL eps = 1e-9;\n PROC rayseg = ( POINT p in, a in, b in )BOOL:\n BEGIN\n PROC max = ( REAL m, n )REAL: IF m > n THEN m ELSE n FI;\n PROC min = ( REAL m, n )REAL: IF m < n THEN m ELSE n FI;\n POINT p := p in, a := a in, b := b in;\n IF y OF a > y OF b THEN POINT t = a; a := b; b := t FI;\n IF y OF p = y OF a OR y OF p = y OF b THEN y OF p+:= eps FI;\n IF y OF p < y OF a OR y OF p > y OF b OR x OF p > max( x OF a, x OF b )\n THEN FALSE\n ELIF x OF p < min( x OF a, x OF b )\n THEN TRUE\n ELSE\n REAL red = IF x OF a = x OF b THEN max real ELSE ( y OF b - y OF a ) / ( x OF b - x OF a ) FI;\n REAL blu = IF x OF a = x OF p THEN max real ELSE ( y OF p - y OF a ) / ( x OF p - x OF a ) FI;\n blu >= red\n FI\n END # rayseq # ;\n\n INT len points = ( UPB points OF self - LWB points OF self ) + 1;\n FOR i FROM LWB points OF self TO UPB points OF self DO\n POINT a = ( points OF self )[ i ];\n POINT b = ( points OF self )[ ( i MOD len points ) + 1 ];\n IF rayseg( p, a, b ) THEN odd := NOT odd FI\n OD;\n odd\n END # contains # ;\n\n[]POLYGON polygons =\n ( ( \"square\"\n , ( ( 0, 0 ), ( 10, 0 ), ( 10, 10 ), ( 0, 10 ) )\n )\n , ( \"squarehole\"\n , ( ( 0, 0 ), ( 10, 0 ), ( 10, 10 ), ( 0, 10 ), ( 2.5, 2.5 ), ( 7.5, 2.5 ), ( 7.5, 7.5 ), ( 2.5, 7.5 ) )\n )\n , ( \"strange\"\n , ( ( 0, 0 ), ( 2.5, 2.5 ), ( 0, 10 ), ( 2.5, 7.5 ), ( 7.5, 7.5 ), ( 10, 10 ), ( 10, 0 ), ( 2.5, 2.5 ) )\n )\n , ( \"hexagon\"\n , ( ( 3, 0 ), ( 7, 0 ), ( 10, 5 ), ( 7, 10 ), ( 3, 10 ), ( 0, 5 ) )\n )\n );\n[]POINT points = ( ( 5, 5 ), (5 , 8 ), ( -10, 5 ), ( 0, 5 ), ( 10, 5 ), ( 8, 5 ), ( 10, 10 ) );\n\nFOR p FROM LWB polygons TO UPB polygons DO\n POLYGON poly = polygons[ p ];\n print(( \"Does '\", name OF poly, \"' contain the point..\", newline ) );\n FOR i FROM LWB points TO UPB points DO\n POINT pt = points[ i ];\n print( ( \" ( \", fixed( x OF pt, -5, 1 ), \", \", fixed( y OF pt, -5, 1 ), \" ) \" ) );\n print( ( IF contains( poly, pt ) THEN \" true\" ELSE \" false\" FI, newline ) )\n OD;\n print( ( newline ) )\nOD\n\nEND\n","language":"ALGOL-68"},{"code":"1000 PUBLIC NUMERIC x,y\n1010 LET x=1\n1020 LET y=2\n1030 !\n1040 DEF isLeft2(L(,),p()) = -SGN( (L(1,x)-L(2,x))*(p(y)-L(2,y)) - (p(x)-L(2,x))*(L(1,y)-L(2,y)))\n1050 !\n1060 FUNCTION inpolygon(p1(,),p2())\n1070 LET k=UBOUND(p1,1)+1\n1080 DIM send (1 TO 2,2)\n1090 LET wn=0\n1100 FOR n=1 TO UBOUND(p1,1)\n1110 LET index=MOD(n, k)\n1120 LET nextindex=MOD(n+1, k)\n1130 IF nextindex=0 THEN LET nextindex=1\n1140 LET send(1,x)=p1(index,x)\n1150 LET send(2,x)=p1(nextindex,x)\n1160 LET send(1,y)=p1(index,y)\n1170 LET send(2,y)=p1(nextindex,y)\n1180 IF p1(index,y)<=p2(y) THEN\n1190 IF p1(nextindex,y)>p2(y) THEN\n1200 IF isleft2(send,p2)>=0 THEN !'=\n1210 LET wn=wn+1\n1220 END IF\n1230 END IF\n1240 ELSE\n1250 IF p1(nextindex,y)<=p2(y) THEN\n1260 IF isleft2(send,p2)<=0 THEN !'=\n1270 LET wn=wn-1\n1280 END IF\n1290 END IF\n1300 END IF\n1310 NEXT n\n1320 LET inpolygon = wn\n1330 END FUNCTION\n1340 !\n1350 DIM type(1 TO 2)\n1360 !\n1370 DIM square(4,2)\n1380 MAT READ square\n1390 DATA 0,0,10,0,10,10,0,10\n1400 !\n1410 DIM hole(4,2)\n1420 MAT READ hole\n1430 DATA 2.5,2.5,7.5,2.5,7.5,7.5,2.5,7.5\n1440 !\n1450 DIM strange(8,2)\n1460 MAT READ strange\n1470 DATA 0,0,2.5,2.5,0,10,2.5,7.5,7.5,7.5,10,10,10,0,2.5,2.5\n1480 !\n1490 DIM exagon(6,2)\n1500 MAT READ exagon\n1510 DATA 3,0,7,0,10,5,7,10,3,10,0,5\n1520 !\n1530 ! printouts\n1540 FOR z=1 TO 4\n1550 SELECT CASE z\n1560 CASE 1\n1570 PRINT \"squared\"\n1580 PRINT \"(5,5) \";TAB(12);\n1590 MAT READ type\n1600 DATA 5,5\n1610 IF inpolygon(square,type) <> 0 THEN PRINT \"in\" ELSE PRINT \"out\"\n1620 MAT READ type\n1630 DATA 5,8\n1640 PRINT \"(5,8) \";TAB(12);\n1650 IF inpolygon(square,type) <> 0 THEN PRINT \"in\" ELSE PRINT \"out\"\n1660 PRINT \"(-10,5) \";TAB(12);\n1670 MAT READ type\n1680 DATA -10,5\n1690 IF inpolygon(square,type) <> 0 THEN PRINT \"in\" ELSE PRINT \"out\"\n1700 Print \"(0,5) \";Tab(12);\n1710 MAT READ type\n1720 DATA 0,5\n1730 IF inpolygon(square,type) <> 0 THEN PRINT \"in\" ELSE PRINT \"out\"\n1740 Print \"(10,5) \";Tab(12);\n1750 MAT READ type\n1760 DATA 10,5\n1770 IF inpolygon(square,type) <> 0 THEN PRINT \"in\" ELSE PRINT \"out\"\n1780 PRINT \"(8,5) \";TAB(12);\n1790 MAT READ type\n1800 DATA 8,5\n1810 IF inpolygon(square,Type) <> 0 THEN PRINT \"in\" ELSE PRINT \"out\"\n1820 PRINT \"(10,10) \";TAB(12);\n1830 MAT READ type\n1840 DATA 10,10\n1850 IF inpolygon(square,Type) <> 0 THEN PRINT \"in\" ELSE PRINT \"out\"\n1860 PRINT\n1870 CASE 2\n1880 PRINT \"squared hole\"\n1890 PRINT \"(5,5) \";TAB(12);\n1900 MAT READ type\n1910 DATA 5,5\n1920 IF NOT inpolygon(hole,Type)<>0 AND inpolygon(square,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n1930 Print \"(5,8) \";Tab(12);\n1940 MAT READ type\n1950 DATA 5,8\n1960 IF NOT inpolygon(hole,Type)<>0 AND inpolygon(square,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n1970 PRINT \"(-10,5) \";TAB(12);\n1980 MAT READ type\n1990 DATA -10,5\n2000 IF NOT inpolygon(hole,Type)<>0 AND inpolygon(square,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2010 PRINT \"(0,5) \";TAB(12);\n2020 MAT READ type\n2030 DATA 0,5\n2040 IF NOT inpolygon(hole,Type)<>0 AND inpolygon(square,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2050 PRINT \"(10,5) \";TAB(12);\n2060 MAT READ type\n2070 DATA 10,5\n2080 IF NOT inpolygon(hole,Type)<>0 AND inpolygon(square,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2090 PRINT \"(8,5) \";TAB(12);\n2100 MAT READ type\n2110 DATA 8,5\n2120 IF NOT inpolygon(hole,Type)<>0 AND inpolygon(square,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2130 PRINT \"(10,10) \";TAB(12);\n2140 MAT READ type\n2150 DATA 10,10\n2160 IF NOT inpolygon(hole,Type)<>0 AND inpolygon(square,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2170 PRINT\n2180 CASE 3\n2190 PRINT \"strange\"\n2200 PRINT \"(5,5) \";TAB(12);\n2210 MAT READ type\n2220 DATA 5,5\n2230 IF inpolygon(strange,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2240 PRINT \"(5,8) \";TAB(12);\n2250 MAT READ type\n2260 DATA 5,8\n2270 IF inpolygon(strange,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2280 PRINT \"(-10,5) \";TAB(12);\n2290 MAT READ type\n2300 DATA -10,5\n2310 IF inpolygon(strange,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2320 PRINT \"(0,5) \";TAB(12);\n2330 MAT READ type\n2340 DATA 0,5\n2350 IF inpolygon(strange,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2360 PRINT \"(10,5) \";TAB(12);\n2370 MAT READ type\n2380 DATA 10,5\n2390 IF inpolygon(strange,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2400 PRINT \"(8,5) \";TAB(12);\n2410 MAT READ type\n2420 DATA 8,5\n2430 IF inpolygon(strange,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2440 PRINT \"(10,10) \";TAB(12);\n2450 MAT READ type\n2460 DATA 10,10\n2470 IF inpolygon(strange,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2480 PRINT\n2490 CASE 4\n2500 PRINT \"exagon\"\n2510 PRINT \"(5,5) \";TAB(12);\n2520 MAT READ type\n2530 DATA 5,5\n2540 IF inpolygon(exagon,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2550 PRINT \"(5,8) \";TAB(12);\n2560 MAT READ type\n2570 DATA 5,8\n2580 IF inpolygon(exagon,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2590 PRINT \"(-10,5) \";TAB(12);\n2600 MAT READ type\n2610 DATA -10,5\n2620 IF inpolygon(exagon,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2630 PRINT \"(0,5) \";TAB(12);\n2640 MAT READ type\n2650 DATA 0,5\n2660 IF inpolygon(exagon,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2670 PRINT \"(10,5) \";TAB(12);\n2680 MAT READ type\n2690 DATA 10,5\n2700 IF inpolygon(exagon,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2710 PRINT \"(8,5) \";TAB(12);\n2720 MAT READ type\n2730 DATA 8,5\n2740 IF inpolygon(exagon,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2750 PRINT \"(10,10) \";TAB(12);\n2760 MAT READ type\n2770 DATA 10,10\n2780 IF inpolygon(exagon,Type)<>0 THEN PRINT \"in\" ELSE PRINT \"out\"\n2790 PRINT\n2800 END SELECT\n2810 NEXT z\n2820 END\n","language":"ANSI-BASIC"},{"code":"Points :=[{x: 5.0, y: 5.0}\n\t\t, {x: 5.0, y: 8.0}\n\t\t, {x:-10.0, y: 5.0}\n\t\t, {x: 0.0, y: 5.0}\n\t\t, {x: 10.0, y: 5.0}\n\t\t, {x: 8.0, y: 5.0}\n\t\t, {x: 10.0, y:10.0}]\nSquare :=[{x: 0.0, y: 0.0}, {x:10.0, y: 0.0}\n\t\t, {x:10.0, y: 0.0}, {x:10.0, y:10.0}\n\t\t, {x:10.0, y:10.0}, {x: 0.0, y:10.0}\n\t\t, {x: 0.0, y:10.0}, {x: 0.0, y: 0.0}]\nSq_Hole:=[{x: 0.0, y: 0.0}, {x:10.0, y: 0.0}\n\t\t, {x:10.0, y: 0.0}, {x:10.0, y:10.0}\n\t\t, {x:10.0, y:10.0}, {x: 0.0, y:10.0}\n\t\t, {x: 0.0, y:10.0}, {x: 0.0, y: 0.0}\n\t\t, {x: 2.5, y: 2.5}, {x: 7.5, y: 2.5}\n\t\t, {x: 7.5, y: 2.5}, {x: 7.5, y: 7.5}\n\t\t, {x: 7.5, y: 7.5}, {x: 2.5, y: 7.5}\n\t\t, {x: 2.5, y: 7.5}, {x: 2.5, y: 2.5}]\nStrange:=[{x: 0.0, y: 0.0}, {x: 2.5, y: 2.5}\n\t\t, {x: 2.5, y: 2.5}, {x: 0.0, y:10.0}\n\t\t, {x: 0.0, y:10.0}, {x: 2.5, y: 7.5}\n\t\t, {x: 2.5, y: 7.5}, {x: 7.5, y: 7.5}\n\t\t, {x: 7.5, y: 7.5}, {x:10.0, y:10.0}\n\t\t, {x:10.0, y:10.0}, {x:10.0, y: 0.0}\n\t\t, {x:10.0, y: 0.0}, {x: 2.5, y: 2.5}]\nExagon :=[{x: 3.0, y: 0.0}, {x: 7.0, y: 0.0}\n\t\t, {x: 7.0, y: 0.0}, {x:10.0, y: 5.0}\n\t\t, {x:10.0, y: 5.0}, {x: 7.0, y:10.0}\n\t\t, {x: 7.0, y:10.0}, {x: 3.0, y:10.0}\n\t\t, {x: 3.0, y:10.0}, {x: 0.0, y: 5.0}\n\t\t, {x: 0.0, y: 5.0}, {x: 3.0, y: 0.0}]\nPolygons := {\"Square\":Square, \"Sq_Hole\":Sq_Hole, \"Strange\":Strange, \"Exagon\":Exagon}\nFor j, Poly in Polygons\n\tFor i, Point in Points\n\t\tIf (point_in_polygon(Point,Poly))\n\t\t\ts.= j \" does contain point \" i \"`n\"\n\t\tElse\n\t\t\ts.= j \" doesn't contain point \" i \"`n\"\nMsgbox %s%\n\npoint_in_polygon(Point,Poly) {\n\tn:=Poly.MaxIndex()\n\tcount:=0\n\tloop, %n% {\n\t\tif (ray_intersects_segment(Point,Poly[A_Index],Poly[mod(A_Index,n)+1])) {\n\t\t\tcount++\n\t\t}\n\t}\n\tif (mod(count,2)) { ; true = inside, false = outside\n\t\treturn true\t\t; P is in the polygon\n\t} else {\n\t\treturn false\t; P isn't in the polygon\n\t}\n}\n\nray_intersects_segment(P,A,B) {\n\t;P = the point from which the ray starts\n\t;A = the end-point of the segment with the smallest y coordinate\n\t;B = the end-point of the segment with the greatest y coordinate\n\tif (A.y > B.y) {\n\t\ttemp:=A\n\t\tA:=B\n\t\tB:=temp\n\t}\n\tif (P.y = A.y or P.y = B.y) {\n\t\tP.y += 0.000001\n\t}\n\tif (P.y < A.y or P.y > B.y) {\n\t\treturn false\n\t} else if (P.x > A.x && P.x > B.x) {\n\t\treturn false\n\t} else {\n\t\tif (P.x < A.x && P.x < B.x) {\n\t\t\treturn true\n\t\t} else {\n\t\t\tif (A.x != B.x) {\n\t\t\t\tm_red := (B.y - A.y)/(B.x - A.x)\n\t\t\t} else {\n\t\t\t\tm_red := \"inf\"\n\t\t\t}\n\t\t\tif (A.x != P.x) {\n\t\t\t\tm_blue := (P.y - A.y)/(P.x - A.x)\n\t\t\t} else {\n\t\t\t\tm_blue := \"inf\"\n\t\t\t}\n\t\t\tif (m_blue >= m_red) {\n\t\t\t\treturn true\n\t\t\t} else {\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t}\n}\n","language":"AutoHotkey"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\ntypedef struct { double x, y; } vec;\ntypedef struct { int n; vec* v; } polygon_t, *polygon;\n\n#define BIN_V(op, xx, yy) vec v##op(vec a,vec b){vec c;c.x=xx;c.y=yy;return c;}\n#define BIN_S(op, r) double v##op(vec a, vec b){ return r; }\nBIN_V(sub, a.x - b.x, a.y - b.y);\nBIN_V(add, a.x + b.x, a.y + b.y);\nBIN_S(dot, a.x * b.x + a.y * b.y);\nBIN_S(cross, a.x * b.y - a.y * b.x);\n\n/* return a + s * b */\nvec vmadd(vec a, double s, vec b)\n{\n\tvec c;\n\tc.x = a.x + s * b.x;\n\tc.y = a.y + s * b.y;\n\treturn c;\n}\n\n/* check if x0->x1 edge crosses y0->y1 edge. dx = x1 - x0, dy = y1 - y0, then\n solve x0 + a * dx == y0 + b * dy with a, b in real\n cross both sides with dx, then: (remember, cross product is a scalar)\n\tx0 X dx = y0 X dx + b * (dy X dx)\n similarly,\n\tx0 X dy + a * (dx X dy) == y0 X dy\n there is an intersection iff 0 <= a <= 1 and 0 <= b <= 1\n\n returns: 1 for intersect, -1 for not, 0 for hard to say (if the intersect\n point is too close to y0 or y1)\n*/\nint intersect(vec x0, vec x1, vec y0, vec y1, double tol, vec *sect)\n{\n\tvec dx = vsub(x1, x0), dy = vsub(y1, y0);\n\tdouble d = vcross(dy, dx), a;\n\tif (!d) return 0; /* edges are parallel */\n\n\ta = (vcross(x0, dx) - vcross(y0, dx)) / d;\n\tif (sect)\n\t\t*sect = vmadd(y0, a, dy);\n\n\tif (a < -tol || a > 1 + tol) return -1;\n\tif (a < tol || a > 1 - tol) return 0;\n\n\ta = (vcross(x0, dy) - vcross(y0, dy)) / d;\n\tif (a < 0 || a > 1) return -1;\n\n\treturn 1;\n}\n\n/* distance between x and nearest point on y0->y1 segment. if the point\n lies outside the segment, returns infinity */\ndouble dist(vec x, vec y0, vec y1, double tol)\n{\n\tvec dy = vsub(y1, y0);\n\tvec x1, s;\n\tint r;\n\n\tx1.x = x.x + dy.y; x1.y = x.y - dy.x;\n\tr = intersect(x, x1, y0, y1, tol, &s);\n\tif (r == -1) return HUGE_VAL;\n\ts = vsub(s, x);\n\treturn sqrt(vdot(s, s));\n}\n\n#define for_v(i, z, p) for(i = 0, z = p->v; i < p->n; i++, z++)\n/* returns 1 for inside, -1 for outside, 0 for on edge */\nint inside(vec v, polygon p, double tol)\n{\n\t/* should assert p->n > 1 */\n\tint i, k, crosses, intersectResult;\n\tvec *pv;\n\tdouble min_x, max_x, min_y, max_y;\n\n\tfor (i = 0; i < p->n; i++) {\n\t\tk = (i + 1) % p->n;\n\t\tmin_x = dist(v, p->v[i], p->v[k], tol);\n\t\tif (min_x < tol) return 0;\n\t}\n\n\tmin_x = max_x = p->v[0].x;\n\tmin_y = max_y = p->v[1].y;\n\n\t/* calculate extent of polygon */\n\tfor_v(i, pv, p) {\n\t\tif (pv->x > max_x) max_x = pv->x;\n\t\tif (pv->x < min_x) min_x = pv->x;\n\t\tif (pv->y > max_y) max_y = pv->y;\n\t\tif (pv->y < min_y) min_y = pv->y;\n\t}\n\tif (v.x < min_x || v.x > max_x || v.y < min_y || v.y > max_y)\n\t\treturn -1;\n\n\tmax_x -= min_x; max_x *= 2;\n\tmax_y -= min_y; max_y *= 2;\n\tmax_x += max_y;\n\n\tvec e;\n\twhile (1) {\n\t\tcrosses = 0;\n\t\t/* pick a rand point far enough to be outside polygon */\n\t\te.x = v.x + (1 + rand() / (RAND_MAX + 1.)) * max_x;\n\t\te.y = v.y + (1 + rand() / (RAND_MAX + 1.)) * max_x;\n\n\t\tfor (i = 0; i < p->n; i++) {\n\t\t\tk = (i + 1) % p->n;\n\t\t\tintersectResult = intersect(v, e, p->v[i], p->v[k], tol, 0);\n\n\t\t\t/* picked a bad point, ray got too close to vertex.\n\t\t\t re-pick */\n\t\t\tif (!intersectResult) break;\n\n\t\t\tif (intersectResult == 1) crosses++;\n\t\t}\n\t\tif (i == p->n) break;\n\t}\n\treturn (crosses & 1) ? 1 : -1;\n}\n\nint main()\n{\n\tvec vsq[] = {\t{0,0}, {10,0}, {10,10}, {0,10},\n\t\t\t{2.5,2.5}, {7.5,0.1}, {7.5,7.5}, {2.5,7.5}};\n\n\tpolygon_t sq = { 4, vsq }, /* outer square */\n\t\tsq_hole = { 8, vsq }; /* outer and inner square, ie hole */\n\n\tvec c = { 10, 5 }; /* on edge */\n\tvec d = { 5, 5 };\n\n\tprintf(\"%d\\n\", inside(c, &sq, 1e-10));\n\tprintf(\"%d\\n\", inside(c, &sq_hole, 1e-10));\n\n\tprintf(\"%d\\n\", inside(d, &sq, 1e-10));\t/* in */\n\tprintf(\"%d\\n\", inside(d, &sq_hole, 1e-10)); /* out (in the hole) */\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <algorithm>\n#include <cstdlib>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n\nusing namespace std;\n\nconst double epsilon = numeric_limits<float>().epsilon();\nconst numeric_limits<double> DOUBLE;\nconst double MIN = DOUBLE.min();\nconst double MAX = DOUBLE.max();\n\nstruct Point { const double x, y; };\n\nstruct Edge {\n const Point a, b;\n\n bool operator()(const Point& p) const\n {\n if (a.y > b.y) return Edge{ b, a }(p);\n if (p.y == a.y || p.y == b.y) return operator()({ p.x, p.y + epsilon });\n if (p.y > b.y || p.y < a.y || p.x > max(a.x, b.x)) return false;\n if (p.x < min(a.x, b.x)) return true;\n auto blue = abs(a.x - p.x) > MIN ? (p.y - a.y) / (p.x - a.x) : MAX;\n auto red = abs(a.x - b.x) > MIN ? (b.y - a.y) / (b.x - a.x) : MAX;\n return blue >= red;\n }\n};\n\nstruct Figure {\n const string name;\n const initializer_list<Edge> edges;\n\n bool contains(const Point& p) const\n {\n auto c = 0;\n for (auto e : edges) if (e(p)) c++;\n return c % 2 != 0;\n }\n\n template<unsigned char W = 3>\n void check(const initializer_list<Point>& points, ostream& os) const\n {\n os << \"Is point inside figure \" << name << '?' << endl;\n for (auto p : points)\n os << \" (\" << setw(W) << p.x << ',' << setw(W) << p.y << \"): \" << boolalpha << contains(p) << endl;\n os << endl;\n }\n};\n\nint main()\n{\n const initializer_list<Point> points = { { 5.0, 5.0}, {5.0, 8.0}, {-10.0, 5.0}, {0.0, 5.0}, {10.0, 5.0}, {8.0, 5.0}, {10.0, 10.0} };\n const Figure square = { \"Square\",\n { {{0.0, 0.0}, {10.0, 0.0}}, {{10.0, 0.0}, {10.0, 10.0}}, {{10.0, 10.0}, {0.0, 10.0}}, {{0.0, 10.0}, {0.0, 0.0}} }\n };\n\n const Figure square_hole = { \"Square hole\",\n { {{0.0, 0.0}, {10.0, 0.0}}, {{10.0, 0.0}, {10.0, 10.0}}, {{10.0, 10.0}, {0.0, 10.0}}, {{0.0, 10.0}, {0.0, 0.0}},\n {{2.5, 2.5}, {7.5, 2.5}}, {{7.5, 2.5}, {7.5, 7.5}}, {{7.5, 7.5}, {2.5, 7.5}}, {{2.5, 7.5}, {2.5, 2.5}}\n }\n };\n\n const Figure strange = { \"Strange\",\n { {{0.0, 0.0}, {2.5, 2.5}}, {{2.5, 2.5}, {0.0, 10.0}}, {{0.0, 10.0}, {2.5, 7.5}}, {{2.5, 7.5}, {7.5, 7.5}},\n {{7.5, 7.5}, {10.0, 10.0}}, {{10.0, 10.0}, {10.0, 0.0}}, {{10.0, 0}, {2.5, 2.5}}\n }\n };\n\n const Figure exagon = { \"Exagon\",\n { {{3.0, 0.0}, {7.0, 0.0}}, {{7.0, 0.0}, {10.0, 5.0}}, {{10.0, 5.0}, {7.0, 10.0}}, {{7.0, 10.0}, {3.0, 10.0}},\n {{3.0, 10.0}, {0.0, 5.0}}, {{0.0, 5.0}, {3.0, 0.0}}\n }\n };\n\n for(auto f : {square, square_hole, strange, exagon})\n f.check(points, cout);\n\n return EXIT_SUCCESS;\n}\n","language":"C++"},{"code":"using System;\n\nclass RayCasting {\n\n static bool Intersects(int[] A, int[] B, double[] P) {\n if (A[1] > B[1])\n return Intersects(B, A, P);\n\n if (P[1] == A[1] || P[1] == B[1])\n P[1] += 0.0001;\n\n if (P[1] > B[1] || P[1] < A[1] || P[0] >= Math.Max(A[0], B[0]))\n return false;\n\n if (P[0] < Math.Min(A[0], B[0]))\n return true;\n\n double red = (P[1] - A[1]) / (P[0] - A[0]);\n double blue = (B[1] - A[1]) / (B[0] - A[0]);\n return red >= blue;\n }\n\n static bool Contains(int[][] shape, double[] pnt) {\n bool inside = false;\n int len = shape.Length;\n for (int i = 0; i < len; i++) {\n if (Intersects(shape[i], shape[(i + 1) % len], pnt))\n inside = !inside;\n }\n return inside;\n }\n\n public static void Main(string[] args) {\n double[][] testPoints = new double[][] {\n new double[] { 10, 10 }, new double[] { 10, 16 }, new double[] { -20, 10 },\n new double[] { 0, 10 }, new double[] { 20, 10 }, new double[] { 16, 10 },\n new double[] { 20, 20 }\n };\n\n foreach (int[][] shape in shapes) {\n foreach (double[] pnt in testPoints)\n Console.Write($\"{Contains(shape, pnt),7} \");\n Console.WriteLine();\n }\n }\n\n readonly static int[][] square = new int[][] {\n new int[] { 0, 0 }, new int[] { 20, 0 }, new int[] { 20, 20 }, new int[] { 0, 20 }\n };\n\n readonly static int[][] squareHole = new int[][] {\n new int[] { 0, 0 }, new int[] { 20, 0 }, new int[] { 20, 20 }, new int[] { 0, 20 },\n new int[] { 5, 5 }, new int[] { 15, 5 }, new int[] { 15, 15 }, new int[] { 5, 15 }\n };\n\n readonly static int[][] strange = new int[][] {\n new int[] { 0, 0 }, new int[] { 5, 5 }, new int[] { 0, 20 }, new int[] { 5, 15 },\n new int[] { 15, 15 }, new int[] { 20, 20 }, new int[] { 20, 0 }\n };\n\n readonly static int[][] hexagon = new int[][] {\n new int[] { 6, 0 }, new int[] { 14, 0 }, new int[] { 20, 10 }, new int[] { 14, 20 },\n new int[] { 6, 20 }, new int[] { 0, 10 }\n };\n\n readonly static int[][][] shapes = new int[][][] { square, squareHole, strange, hexagon };\n}\n","language":"C-sharp"},{"code":" Point = (@x,@y) ->\n\n pointInPoly = (point,poly) ->\n segments = for pointA, index in poly\n pointB = poly[(index + 1) % poly.length]\n [pointA,pointB]\n intesected = (segment for segment in segments when rayIntesectsSegment(point,segment))\n intesected.length % 2 != 0\n\n rayIntesectsSegment = (p,segment) ->\n [p1,p2] = segment\n [a,b] = if p1.y < p2.y\n [p1,p2]\n else\n [p2,p1]\n if p.y == b.y || p.y == a.y\n p.y += Number.MIN_VALUE\n\n if p.y > b.y || p.y < a.y\n false\n else if p.x > a.x && p.x > b.x\n false\n else if p.x < a.x && p.x < b.x\n true\n else\n mAB = (b.y - a.y) / (b.x - a.x)\n mAP = (p.y - a.y) / (p.x - a.x)\n mAP > mAB\n","language":"CoffeeScript"},{"code":"(defun point-in-polygon (point polygon)\n (do ((in-p nil)) ((endp polygon) in-p)\n (when (ray-intersects-segment point (pop polygon))\n (setf in-p (not in-p)))))\n\n(defun ray-intersects-segment (point segment &optional (epsilon .001))\n (destructuring-bind (px . py) point\n (destructuring-bind ((ax . ay) . (bx . by)) segment\n (when (< ay by)\n (rotatef ay by)\n (rotatef ax bx))\n (when (or (= py ay) (= py by))\n (incf py epsilon))\n (cond\n ;; point is above, below, or to the right of the rectangle\n ;; determined by segment; ray does not intesect the segment.\n ((or (> px (max ax bx)) (> py (max ay by)) (< py (min ay by)))\n nil)\n ;; point is to left of the rectangle; ray intersects segment\n ((< px (min ax bx))\n t)\n ;; point is within the rectangle...\n (t (let ((m-red (if (= ax bx) nil\n (/ (- by ay) (- bx ax))))\n (m-blue (if (= px ax) nil\n (/ (- py ay) (- px ax)))))\n (cond\n ((null m-blue) t)\n ((null m-red) nil)\n (t (>= m-blue m-red)))))))))\n","language":"Common-Lisp"},{"code":"(defparameter *points*\n #((0 . 0) (10 . 0) (10 . 10) (0 . 10)\n (2.5 . 2.5) (7.5 . 2.5) (7.5 . 7.5) (2.5 . 7.5)\n (0 . 5) (10 . 5) (3 . 0) (7 . 0)\n (7 . 10) (3 . 10)))\n\n(defun create-polygon (indices &optional (points *points*))\n (loop for (a b) on indices by 'cddr\n collecting (cons (aref points (1- a))\n (aref points (1- b)))))\n\n(defun square ()\n (create-polygon '(1 2 2 3 3 4 4 1)))\n\n(defun square-hole ()\n (create-polygon '(1 2 2 3 3 4 4 1 5 6 6 7 7 8 8 5)))\n\n(defun strange ()\n (create-polygon '(1 5 5 4 4 8 8 7 7 3 3 2 2 5)))\n\n(defun exagon ()\n (create-polygon '(11 12 12 10 10 13 13 14 14 9 9 11)))\n\n(defparameter *test-points*\n #((5 . 5) (5 . 8) (-10 . 5) (0 . 5)\n (10 . 5) (8 . 5) (10 . 10)))\n\n(defun test-pip ()\n (dolist (shape '(square square-hole strange exagon))\n (print shape)\n (loop with polygon = (funcall shape)\n for test-point across *test-points*\n do (format t \"~&~w ~:[outside~;inside ~].\"\n test-point\n (point-in-polygon test-point polygon)))))\n","language":"Common-Lisp"},{"code":"import std.stdio, std.math, std.algorithm;\n\nimmutable struct Point { double x, y; }\nimmutable struct Edge { Point a, b; }\nimmutable struct Figure {\n string name;\n Edge[] edges;\n}\n\nbool contains(in Figure poly, in Point p) pure nothrow @safe @nogc {\n static bool raySegI(in Point p, in Edge edge)\n pure nothrow @safe @nogc {\n enum double epsilon = 0.00001;\n with (edge) {\n if (a.y > b.y)\n //swap(a, b); // if edge is mutable\n return raySegI(p, Edge(b, a));\n if (p.y == a.y || p.y == b.y)\n //p.y += epsilon; // if p is mutable\n return raySegI(Point(p.x, p.y + epsilon), edge);\n if (p.y > b.y || p.y < a.y || p.x > max(a.x, b.x))\n return false;\n if (p.x < min(a.x, b.x))\n return true;\n immutable blue = (abs(a.x - p.x) > double.min_normal) ?\n ((p.y - a.y) / (p.x - a.x)) :\n double.max;\n immutable red = (abs(a.x - b.x) > double.min_normal) ?\n ((b.y - a.y) / (b.x - a.x)) :\n double.max;\n return blue >= red;\n }\n }\n\n return poly.edges.count!(e => raySegI(p, e)) % 2;\n}\n\nvoid main() {\n immutable Figure[] polys = [\n {\"Square\", [\n {{ 0.0, 0.0}, {10.0, 0.0}}, {{10.0, 0.0}, {10.0, 10.0}},\n {{10.0, 10.0}, { 0.0, 10.0}}, {{ 0.0, 10.0}, { 0.0, 0.0}}]},\n {\"Square hole\", [\n {{ 0.0, 0.0}, {10.0, 0.0}}, {{10.0, 0.0}, {10.0, 10.0}},\n {{10.0, 10.0}, { 0.0, 10.0}}, {{ 0.0, 10.0}, { 0.0, 0.0}},\n {{ 2.5, 2.5}, { 7.5, 2.5}}, {{ 7.5, 2.5}, { 7.5, 7.5}},\n {{ 7.5, 7.5}, { 2.5, 7.5}}, {{ 2.5, 7.5}, { 2.5, 2.5}}]},\n {\"Strange\", [\n {{ 0.0, 0.0}, { 2.5, 2.5}}, {{ 2.5, 2.5}, { 0.0, 10.0}},\n {{ 0.0, 10.0}, { 2.5, 7.5}}, {{ 2.5, 7.5}, { 7.5, 7.5}},\n {{ 7.5, 7.5}, {10.0, 10.0}}, {{10.0, 10.0}, {10.0, 0.0}},\n {{10.0, 0}, { 2.5, 2.5}}]},\n {\"Exagon\", [\n {{ 3.0, 0.0}, { 7.0, 0.0}}, {{ 7.0, 0.0}, {10.0, 5.0}},\n {{10.0, 5.0}, { 7.0, 10.0}}, {{ 7.0, 10.0}, { 3.0, 10.0}},\n {{ 3.0, 10.0}, { 0.0, 5.0}}, {{ 0.0, 5.0}, { 3.0, 0.0}}]}\n];\n\n immutable Point[] testPoints = [{ 5, 5}, {5, 8}, {-10, 5}, {0, 5},\n {10, 5}, {8, 5}, { 10, 10}];\n\n foreach (immutable poly; polys) {\n writefln(`Is point inside figure \"%s\"?`, poly.name);\n foreach (immutable p; testPoints)\n writefln(\" (%3s, %2s): %s\", p.x, p.y, contains(poly, p));\n writeln;\n }\n}\n","language":"D"},{"code":"USING: kernel prettyprint sequences arrays math math.vectors ;\nIN: raycasting\n\n: between ( a b x -- ? ) [ last ] tri@ [ < ] curry bi@ xor ;\n\n: lincomb ( a b x -- w )\n 3dup [ last ] tri@\n [ - ] curry bi@\n [ drop ] 2dip\n neg 2dup + [ / ] curry bi@\n [ [ v*n ] curry ] bi@ bi* v+ ;\n: leftof ( a b x -- ? ) dup [ lincomb ] dip [ first ] bi@ > ;\n\n: ray ( a b x -- ? ) [ between ] [ leftof ] 3bi and ;\n\n: raycast ( poly x -- ? )\n [ dup first suffix [ rest-slice ] [ but-last-slice ] bi ] dip\n [ ray ] curry 2map\n f [ xor ] reduce ;\n","language":"Factor"},{"code":"( scratchpad ) CONSTANT: square { { -2 -1 } { 1 -2 } { 2 1 } { -1 2 } }\n( scratchpad ) square { 0 0 } raycast .\nt\n( scratchpad ) square { 5 5 } raycast .\nf\n( scratchpad ) square { 2 0 } raycast .\nf\n","language":"Factor"},{"code":"module Polygons\n use Points_Module\n implicit none\n\n type polygon\n type(point), dimension(:), allocatable :: points\n integer, dimension(:), allocatable :: vertices\n end type polygon\n\ncontains\n\n function create_polygon(pts, vt)\n type(polygon) :: create_polygon\n type(point), dimension(:), intent(in) :: pts\n integer, dimension(:), intent(in) :: vt\n\n integer :: np, nv\n\n np = size(pts,1)\n nv = size(vt,1)\n\n allocate(create_polygon%points(np), create_polygon%vertices(nv))\n create_polygon%points = pts\n create_polygon%vertices = vt\n\n end function create_polygon\n\n subroutine free_polygon(pol)\n type(polygon), intent(inout) :: pol\n\n deallocate(pol%points, pol%vertices)\n\n end subroutine free_polygon\n\nend module Polygons\n","language":"Fortran"},{"code":"module Ray_Casting_Algo\n use Polygons\n implicit none\n\n real, parameter, private :: eps = 0.00001\n private :: ray_intersects_seg\n\ncontains\n\n function ray_intersects_seg(p0, a0, b0) result(intersect)\n type(point), intent(in) :: p0, a0, b0\n logical :: intersect\n\n type(point) :: a, b, p\n real :: m_red, m_blue\n\n p = p0\n ! let variable \"a\" be the point with smallest y coordinate\n if ( a0%y > b0%y ) then\n b = a0\n a = b0\n else\n a = a0\n b = b0\n end if\n\n if ( (p%y == a%y) .or. (p%y == b%y) ) p%y = p%y + eps\n\n intersect = .false.\n\n if ( (p%y > b%y) .or. (p%y < a%y) ) return\n if ( p%x > max(a%x, b%x) ) return\n\n if ( p%x < min(a%x, b%x) ) then\n intersect = .true.\n else\n if ( abs(a%x - b%x) > tiny(a%x) ) then\n m_red = (b%y - a%y) / (b%x - a%x)\n else\n m_red = huge(m_red)\n end if\n if ( abs(a%x - p%x) > tiny(a%x) ) then\n m_blue = (p%y - a%y) / (p%x - a%x)\n else\n m_blue = huge(m_blue)\n end if\n if ( m_blue >= m_red ) then\n intersect = .true.\n else\n intersect = .false.\n end if\n end if\n\n end function ray_intersects_seg\n\n function point_is_inside(p, pol) result(inside)\n logical :: inside\n type(point), intent(in) :: p\n type(polygon), intent(in) :: pol\n\n integer :: i, cnt, pa, pb\n\n cnt = 0\n do i = lbound(pol%vertices,1), ubound(pol%vertices,1), 2\n pa = pol%vertices(i)\n pb = pol%vertices(i+1)\n if ( ray_intersects_seg(p, pol%points(pa), pol%points(pb)) ) cnt = cnt + 1\n end do\n\n inside = .true.\n if ( mod(cnt, 2) == 0 ) then\n inside = .false.\n end if\n\n end function point_is_inside\n\nend module Ray_Casting_Algo\n","language":"Fortran"},{"code":"program Pointpoly\n use Points_Module\n use Ray_Casting_Algo\n implicit none\n\n character(len=16), dimension(4) :: names\n type(polygon), dimension(4) :: polys\n type(point), dimension(14) :: pts\n type(point), dimension(7) :: p\n\n integer :: i, j\n\n pts = (/ point(0,0), point(10,0), point(10,10), point(0,10), &\n point(2.5,2.5), point(7.5,2.5), point(7.5,7.5), point(2.5,7.5), &\n point(0,5), point(10,5), &\n point(3,0), point(7,0), point(7,10), point(3,10) /)\n\n polys(1) = create_polygon(pts, (/ 1,2, 2,3, 3,4, 4,1 /) )\n polys(2) = create_polygon(pts, (/ 1,2, 2,3, 3,4, 4,1, 5,6, 6,7, 7,8, 8,5 /) )\n polys(3) = create_polygon(pts, (/ 1,5, 5,4, 4,8, 8,7, 7,3, 3,2, 2,5 /) )\n polys(4) = create_polygon(pts, (/ 11,12, 12,10, 10,13, 13,14, 14,9, 9,11 /) )\n\n names = (/ \"square\", \"square hole\", \"strange\", \"hexagon\" /)\n\n p = (/ point(5,5), point(5, 8), point(-10, 5), point(0,5), point(10,5), &\n point(8,5), point(10,10) /)\n\n do j = 1, size(p)\n do i = 1, size(polys)\n write(*, \"('point (',F8.2,',',F8.2,') is inside ',A,'? ', L)\") &\n p(j)%x, p(j)%y, names(i), point_is_inside(p(j), polys(i))\n end do\n print *, \"\"\n end do\n\n do i = 1, size(polys)\n call free_polygon(polys(i))\n end do\n\nend program Pointpoly\n","language":"Fortran"},{"code":"Type Point\n As Single x,y\nEnd Type\n\nFunction inpolygon(p1() As Point,p2 As Point) As Integer\n #Macro isleft2(L,p)\n -Sgn( (L(1).x-L(2).x)*(p.y-L(2).y) - (p.x-L(2).x)*(L(1).y-L(2).y))\n #EndMacro\n Dim As Integer index,nextindex\n Dim k As Integer=UBound(p1)+1\n Dim send (1 To 2) As Point\n Dim wn As Integer=0\n For n As Integer=1 To UBound(p1)\n index=n Mod k:nextindex=(n+1) Mod k\n If nextindex=0 Then nextindex=1\n send(1).x=p1(index).x:send(2).x=p1(nextindex).x\n send(1).y=p1(index).y:send(2).y=p1(nextindex).y\n If p1(index).y<=p2.y Then\n If p1(nextindex).y>p2.y Then\n If isleft2(send,p2)>=0 Then '=\n wn=wn+1\n End If\n End If\n Else\n If p1(nextindex).y<=p2.y Then\n If isleft2(send,p2)<=0 Then'=\n wn=wn-1\n End If\n End If\n End If\n Next n\n Return wn\nEnd Function\n\n\nDim As Point square(1 To 4) ={(0,0),(10,0),(10,10),(0,10)}\n\nDim As Point hole(1 To 4) ={(2.5,2.5),(7.5,2.5),(7.5,7.5),(2.5,7.5)}\n\nDim As Point strange(1 To 8) ={(0,0),(2.5,2.5),(0,10),(2.5,7.5),_\n (7.5,7.5),(10,10),(10,0),(2.5,2.5)}\n\nDim As Point exagon(1 To 6) ={(3,0),(7,0),(10,5),(7,10),(3,10),(0,5)}\n\n'printouts\nFor z As Integer=1 To 4\n Select Case z\n Case 1: Print \"squared\"\n Print \"(5,5) \" ;Tab(12);\n If inpolygon(square(),Type<Point>(5,5)) Then Print \"in\" Else Print \"out\"\n Print \"(5,8) \" ;Tab(12);\n If inpolygon(square(),Type<Point>(5,8)) Then Print \"in\" Else Print \"out\"\n Print \"(-10,5) \" ;Tab(12);\n If inpolygon(square(),Type<Point>(-10,5)) Then Print \"in\" Else Print \"out\"\n Print \"(0,5) \" ;Tab(12);\n If inpolygon(square(),Type<Point>(0,5)) Then Print \"in\" Else Print \"out\"\n Print \"(10,5) \" ;Tab(12);\n If inpolygon(square(),Type<Point>(10,5)) Then Print \"in\" Else Print \"out\"\n Print \"(8,5) \" ;Tab(12);\n If inpolygon(square(),Type<Point>(8,5)) Then Print \"in\" Else Print \"out\"\n Print \"(10,10) \" ;Tab(12);\n If inpolygon(square(),Type<Point>(10,10)) Then Print \"in\" Else Print \"out\"\n Print\n Case 2:Print \"squared hole\"\n Print \"(5,5) \" ;Tab(12);\n If Not inpolygon(hole(),Type<Point>(5,5)) And inpolygon(square(),Type<Point>(5,5)) Then Print \"in\" Else Print \"out\"\n Print \"(5,8) \" ;Tab(12);\n If Not inpolygon(hole(),Type<Point>(5,8)) And inpolygon(square(),Type<Point>(5,8))Then Print \"in\" Else Print \"out\"\n Print \"(-10,5) \" ;Tab(12);\n If Not inpolygon(hole(),Type<Point>(-10,5))And inpolygon(square(),Type<Point>(-10,5)) Then Print \"in\" Else Print \"out\"\n Print \"(0,5) \" ;Tab(12);\n If Not inpolygon(hole(),Type<Point>(0,5))And inpolygon(square(),Type<Point>(0,5)) Then Print \"in\" Else Print \"out\"\n Print \"(10,5) \" ;Tab(12);\n If Not inpolygon(hole(),Type<Point>(10,5))And inpolygon(square(),Type<Point>(10,5)) Then Print \"in\" Else Print \"out\"\n Print \"(8,5) \" ;Tab(12);\n If Not inpolygon(hole(),Type<Point>(8,5))And inpolygon(square(),Type<Point>(8,5)) Then Print \"in\" Else Print \"out\"\n Print \"(10,10) \" ;Tab(12);\n If Not inpolygon(hole(),Type<Point>(10,10))And inpolygon(square(),Type<Point>(10,10)) Then Print \"in\" Else Print \"out\"\n Print\n Case 3:Print \"strange\"\n Print \"(5,5) \" ;Tab(12);\n If inpolygon(strange(),Type<Point>(5,5)) Then Print \"in\" Else Print \"out\"\n Print \"(5,8) \" ;Tab(12);\n If inpolygon(strange(),Type<Point>(5,8)) Then Print \"in\" Else Print \"out\"\n Print \"(-10,5) \" ;Tab(12);\n If inpolygon(strange(),Type<Point>(-10,5)) Then Print \"in\" Else Print \"out\"\n Print \"(0,5) \" ;Tab(12);\n If inpolygon(strange(),Type<Point>(0,5)) Then Print \"in\" Else Print \"out\"\n Print \"(10,5) \" ;Tab(12);\n If inpolygon(strange(),Type<Point>(10,5)) Then Print \"in\" Else Print \"out\"\n Print \"(8,5) \" ;Tab(12);\n If inpolygon(strange(),Type<Point>(8,5)) Then Print \"in\" Else Print \"out\"\n Print \"(10,10) \" ;Tab(12);\n If inpolygon(strange(),Type<Point>(10,10)) Then Print \"in\" Else Print \"out\"\n Print\n Case 4:Print \"exagon\"\n Print \"(5,5) \" ;Tab(12);\n If inpolygon(exagon(),Type<Point>(5,5)) Then Print \"in\" Else Print \"out\"\n Print \"(5,8) \" ;Tab(12);\n If inpolygon(exagon(),Type<Point>(5,8)) Then Print \"in\" Else Print \"out\"\n Print \"(-10,5) \" ;Tab(12);\n If inpolygon(exagon(),Type<Point>(-10,5)) Then Print \"in\" Else Print \"out\"\n Print \"(0,5) \" ;Tab(12);\n If inpolygon(exagon(),Type<Point>(0,5)) Then Print \"in\" Else Print \"out\"\n Print \"(10,5) \" ;Tab(12);\n If inpolygon(exagon(),Type<Point>(10,5)) Then Print \"in\" Else Print \"out\"\n Print \"(8,5) \" ;Tab(12);\n If inpolygon(exagon(),Type<Point>(8,5)) Then Print \"in\" Else Print \"out\"\n Print \"(10,10) \" ;Tab(12);\n If inpolygon(exagon(),Type<Point>(10,10)) Then Print \"in\" Else Print \"out\"\n Print\n End Select\nNext z\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n)\n\ntype xy struct {\n x, y float64\n}\n\ntype seg struct {\n p1, p2 xy\n}\n\ntype poly struct {\n name string\n sides []seg\n}\n\nfunc inside(pt xy, pg poly) (i bool) {\n for _, side := range pg.sides {\n if rayIntersectsSegment(pt, side) {\n i = !i\n }\n }\n return\n}\n\nfunc rayIntersectsSegment(p xy, s seg) bool {\n var a, b xy\n if s.p1.y < s.p2.y {\n a, b = s.p1, s.p2\n } else {\n a, b = s.p2, s.p1\n }\n for p.y == a.y || p.y == b.y {\n p.y = math.Nextafter(p.y, math.Inf(1))\n }\n if p.y < a.y || p.y > b.y {\n return false\n }\n if a.x > b.x {\n if p.x > a.x {\n return false\n }\n if p.x < b.x {\n return true\n }\n } else {\n if p.x > b.x {\n return false\n }\n if p.x < a.x {\n return true\n }\n }\n return (p.y-a.y)/(p.x-a.x) >= (b.y-a.y)/(b.x-a.x)\n}\n\nvar (\n p1 = xy{0, 0}\n p2 = xy{10, 0}\n p3 = xy{10, 10}\n p4 = xy{0, 10}\n p5 = xy{2.5, 2.5}\n p6 = xy{7.5, 2.5}\n p7 = xy{7.5, 7.5}\n p8 = xy{2.5, 7.5}\n p9 = xy{0, 5}\n p10 = xy{10, 5}\n p11 = xy{3, 0}\n p12 = xy{7, 0}\n p13 = xy{7, 10}\n p14 = xy{3, 10}\n)\n\nvar tpg = []poly{\n {\"square\", []seg{{p1, p2}, {p2, p3}, {p3, p4}, {p4, p1}}},\n {\"square hole\", []seg{{p1, p2}, {p2, p3}, {p3, p4}, {p4, p1},\n {p5, p6}, {p6, p7}, {p7, p8}, {p8, p5}}},\n {\"strange\", []seg{{p1, p5},\n {p5, p4}, {p4, p8}, {p8, p7}, {p7, p3}, {p3, p2}, {p2, p5}}},\n {\"exagon\", []seg{{p11, p12}, {p12, p10}, {p10, p13},\n {p13, p14}, {p14, p9}, {p9, p11}}},\n}\n\nvar tpt = []xy{\n // test points common in other solutions on this page\n {5, 5}, {5, 8}, {-10, 5}, {0, 5}, {10, 5}, {8, 5}, {10, 10},\n // test points that show the problem with \"strange\"\n {1, 2}, {2, 1},\n}\n\nfunc main() {\n for _, pg := range tpg {\n fmt.Printf(\"%s:\\n\", pg.name)\n for _, pt := range tpt {\n fmt.Println(pt, inside(pt, pg))\n }\n }\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"math\"\n \"fmt\"\n)\n\ntype xy struct {\n x, y float64\n}\n\ntype closedPoly struct {\n name string\n vert []xy\n}\n\nfunc inside(pt xy, pg closedPoly) bool {\n if len(pg.vert) < 3 {\n return false\n }\n in := rayIntersectsSegment(pt, pg.vert[len(pg.vert)-1], pg.vert[0])\n for i := 1; i < len(pg.vert); i++ {\n if rayIntersectsSegment(pt, pg.vert[i-1], pg.vert[i]) {\n in = !in\n }\n }\n return in\n}\n\nfunc rayIntersectsSegment(p, a, b xy) bool {\n if a.y > b.y {\n a, b = b, a\n }\n for p.y == a.y || p.y == b.y {\n p.y = math.Nextafter(p.y, math.Inf(1))\n }\n if p.y < a.y || p.y > b.y {\n return false\n }\n if a.x > b.x {\n if p.x > a.x {\n return false\n }\n if p.x < b.x {\n return true\n }\n } else {\n if p.x > b.x {\n return false\n }\n if p.x < a.x {\n return true\n }\n }\n return (p.y-a.y)/(p.x-a.x) >= (b.y-a.y)/(b.x-a.x)\n}\n\nvar tpg = []closedPoly{\n {\"square\", []xy{{0, 0}, {10, 0}, {10, 10}, {0, 10}}},\n {\"square hole\", []xy{{0, 0}, {10, 0}, {10, 10}, {0, 10}, {0, 0},\n {2.5, 2.5}, {7.5, 2.5}, {7.5, 7.5}, {2.5, 7.5}, {2.5, 2.5}}},\n {\"strange\", []xy{{0, 0}, {2.5, 2.5}, {0, 10}, {2.5, 7.5}, {7.5, 7.5},\n {10, 10}, {10, 0}, {2.5, 2.5}}},\n {\"exagon\", []xy{{3, 0}, {7, 0}, {10, 5}, {7, 10}, {3, 10}, {0, 5}}},\n}\n\nvar tpt = []xy{{1, 2}, {2, 1}}\n\nfunc main() {\n for _, pg := range tpg {\n fmt.Printf(\"%s:\\n\", pg.name)\n for _, pt := range tpt {\n fmt.Println(pt, inside(pt, pg))\n }\n }\n}\n","language":"Go"},{"code":"package main\n\nimport \"fmt\"\n\ntype xy struct {\n x, y float64\n}\n\ntype closedPoly struct {\n name string\n vert []xy\n}\n\nfunc inside(pt xy, pg closedPoly) bool {\n if len(pg.vert) < 3 {\n return false\n }\n in := rayIntersectsSegment(pt, pg.vert[len(pg.vert)-1], pg.vert[0])\n for i := 1; i < len(pg.vert); i++ {\n if rayIntersectsSegment(pt, pg.vert[i-1], pg.vert[i]) {\n in = !in\n }\n }\n return in\n}\n\nfunc rayIntersectsSegment(p, a, b xy) bool {\n return (a.y > p.y) != (b.y > p.y) &&\n p.x < (b.x-a.x)*(p.y-a.y)/(b.y-a.y)+a.x\n}\n\nvar tpg = []closedPoly{\n {\"square\", []xy{{0, 0}, {10, 0}, {10, 10}, {0, 10}}},\n {\"square hole\", []xy{{0, 0}, {10, 0}, {10, 10}, {0, 10}, {0, 0},\n {2.5, 2.5}, {7.5, 2.5}, {7.5, 7.5}, {2.5, 7.5}, {2.5, 2.5}}},\n {\"strange\", []xy{{0, 0}, {2.5, 2.5}, {0, 10}, {2.5, 7.5}, {7.5, 7.5},\n {10, 10}, {10, 0}, {2.5, 2.5}}},\n {\"exagon\", []xy{{3, 0}, {7, 0}, {10, 5}, {7, 10}, {3, 10}, {0, 5}}},\n}\n\nvar tpt = []xy{{1, 2}, {2, 1}}\n\nfunc main() {\n for _, pg := range tpg {\n fmt.Printf(\"%s:\\n\", pg.name)\n for _, pt := range tpt {\n fmt.Println(pt, inside(pt, pg))\n }\n }\n}\n","language":"Go"},{"code":"import Data.Ratio\n\ntype Point = (Rational, Rational)\ntype Polygon = [Point]\ndata Line = Sloped {lineSlope, lineYIntercept :: Rational} |\n Vert {lineXIntercept :: Rational}\n\npolygonSides :: Polygon -> [(Point, Point)]\npolygonSides poly@(p1 : ps) = zip poly $ ps ++ [p1]\n\nintersects :: Point -> Line -> Bool\n{- @intersects (px, py) l@ is true if the ray {(x, py) | x ≥ px}\nintersects l. -}\nintersects (px, _) (Vert xint) = px <= xint\nintersects (px, py) (Sloped m b) | m < 0 = py <= m * px + b\n | otherwise = py >= m * px + b\n\nonLine :: Point -> Line -> Bool\n{- Is the point on the line? -}\nonLine (px, _) (Vert xint) = px == xint\nonLine (px, py) (Sloped m b) = py == m * px + b\n\ncarrier :: (Point, Point) -> Line\n{- Finds the line containing the given line segment. -}\ncarrier ((ax, ay), (bx, by)) | ax == bx = Vert ax\n | otherwise = Sloped slope yint\n where slope = (ay - by) / (ax - bx)\n yint = ay - slope * ax\n\nbetween :: Ord a => a -> a -> a -> Bool\nbetween x a b | a > b = b <= x && x <= a\n | otherwise = a <= x && x <= b\n\ninPolygon :: Point -> Polygon -> Bool\ninPolygon p@(px, py) = f 0 . polygonSides\n where f n [] = odd n\n f n (side : sides) | far = f n sides\n | onSegment = True\n | rayIntersects = f (n + 1) sides\n | otherwise = f n sides\n where far = not $ between py ay by\n onSegment | ay == by = between px ax bx\n | otherwise = p `onLine` line\n rayIntersects =\n intersects p line &&\n (py /= ay || by < py) &&\n (py /= by || ay < py)\n ((ax, ay), (bx, by)) = side\n line = carrier side\n","language":"Haskell"},{"code":"NB.*crossPnP v point in closed polygon, crossing number\nNB. bool=. points crossPnP polygon\ncrossPnP=: 4 : 0\"2\n 'X Y'=. |:x\n 'x0 y0 x1 y1'=. |:2 ,/\\^:(2={:@$@]) y\n p1=. ((y0<:/Y)*. y1>/Y) +. (y0>/Y)*. y1<:/Y\n p2=. (x0-/X) < (x0-x1) * (y0-/Y) % (y0 - y1)\n 2|+/ p1*.p2\n)\n","language":"J"},{"code":"SQUAREV=: 0 0 , 10 0 , 10 10 ,: 0 10\nSQUAREV=: SQUAREV, 2.5 2.5 , 7.5 0.1 , 7.5 7.5 ,: 2.5 7.5\n\nESAV=: 3 0 , 7 0 , 10 5 , 7 10 , 3 10 ,: 0 5\n\nESA=: (0 1,1 2,2 3,3 4,4 5,:5 0) , .{ ESAV\nSQUARE=: (0 1,1 2,2 3,:3 0) , .{ SQUAREV\nSQUAREHOLE=: (0 1,1 2,2 3,3 0,4 5,5 6,6 7,:7 4) , .{ SQUAREV\nSTRANGE=: (0 4,4 3,3 7,7 6,6 2,2 1,1 5,:5 0) , .{ SQUAREV\n\nPOINTS=: 5 5,5 8,2 2,0 0,10 10,2.5 2.5,0.01 5,2.2 7.4,0 5,10 5,:_4 10\n","language":"J"},{"code":" (<POINTS) crossPnP every ESA;SQUARE;SQUAREHOLE;STRANGE\n1 1 1 0 0 1 1 1 0 1 0\n1 1 1 0 0 1 1 1 0 1 0\n0 1 1 0 0 1 1 1 0 1 0\n1 0 0 0 0 0 0 1 0 1 0\n","language":"J"},{"code":"import static java.lang.Math.*;\n\npublic class RayCasting {\n\n static boolean intersects(int[] A, int[] B, double[] P) {\n if (A[1] > B[1])\n return intersects(B, A, P);\n\n if (P[1] == A[1] || P[1] == B[1])\n P[1] += 0.0001;\n\n if (P[1] > B[1] || P[1] < A[1] || P[0] >= max(A[0], B[0]))\n return false;\n\n if (P[0] < min(A[0], B[0]))\n return true;\n\n double red = (P[1] - A[1]) / (double) (P[0] - A[0]);\n double blue = (B[1] - A[1]) / (double) (B[0] - A[0]);\n return red >= blue;\n }\n\n static boolean contains(int[][] shape, double[] pnt) {\n boolean inside = false;\n int len = shape.length;\n for (int i = 0; i < len; i++) {\n if (intersects(shape[i], shape[(i + 1) % len], pnt))\n inside = !inside;\n }\n return inside;\n }\n\n public static void main(String[] a) {\n double[][] testPoints = {{10, 10}, {10, 16}, {-20, 10}, {0, 10},\n {20, 10}, {16, 10}, {20, 20}};\n\n for (int[][] shape : shapes) {\n for (double[] pnt : testPoints)\n System.out.printf(\"%7s \", contains(shape, pnt));\n System.out.println();\n }\n }\n\n final static int[][] square = {{0, 0}, {20, 0}, {20, 20}, {0, 20}};\n\n final static int[][] squareHole = {{0, 0}, {20, 0}, {20, 20}, {0, 20},\n {5, 5}, {15, 5}, {15, 15}, {5, 15}};\n\n final static int[][] strange = {{0, 0}, {5, 5}, {0, 20}, {5, 15}, {15, 15},\n {20, 20}, {20, 0}};\n\n final static int[][] hexagon = {{6, 0}, {14, 0}, {20, 10}, {14, 20},\n {6, 20}, {0, 10}};\n\n final static int[][][] shapes = {square, squareHole, strange, hexagon};\n}\n","language":"Java"},{"code":"/**\n * @return {boolean} true if (lng, lat) is in bounds\n */\nfunction contains(bounds, lat, lng) {\n //https://rosettacode.org/wiki/Ray-casting_algorithm\n var count = 0;\n for (var b = 0; b < bounds.length; b++) {\n var vertex1 = bounds[b];\n var vertex2 = bounds[(b + 1) % bounds.length];\n if (west(vertex1, vertex2, lng, lat))\n ++count;\n }\n return count % 2;\n\n /**\n * @return {boolean} true if (x,y) is west of the line segment connecting A and B\n */\n function west(A, B, x, y) {\n if (A.y <= B.y) {\n if (y <= A.y || y > B.y ||\n x >= A.x && x >= B.x) {\n return false;\n } else if (x < A.x && x < B.x) {\n return true;\n } else {\n return (y - A.y) / (x - A.x) > (B.y - A.y) / (B.x - A.x);\n }\n } else {\n return west(B, A, x, y);\n }\n }\n}\n\nvar square = {name: 'square', bounds: [{x: 0, y: 0}, {x: 20, y: 0}, {x: 20, y: 20}, {x: 0, y: 20}]};\nvar squareHole = {\n name: 'squareHole',\n bounds: [{x: 0, y: 0}, {x: 20, y: 0}, {x: 20, y: 20}, {x: 0, y: 20}, {x: 5, y: 5}, {x: 15, y: 5}, {x: 15, y: 15}, {x: 5, y: 15}]\n};\nvar strange = {\n name: 'strange',\n bounds: [{x: 0, y: 0}, {x: 5, y: 5}, {x: 0, y: 20}, {x: 5, y: 15}, {x: 15, y: 15}, {x: 20, y: 20}, {x: 20, y: 0}]\n};\nvar hexagon = {\n name: 'hexagon',\n bounds: [{x: 6, y: 0}, {x: 14, y: 0}, {x: 20, y: 10}, {x: 14, y: 20}, {x: 6, y: 20}, {x: 0, y: 10}]\n};\n\nvar shapes = [square, squareHole, strange, hexagon];\nvar testPoints = [{lng: 10, lat: 10}, {lng: 10, lat: 16}, {lng: -20, lat: 10},\n {lng: 0, lat: 10}, {lng: 20, lat: 10}, {lng: 16, lat: 10}, {lng: 20, lat: 20}];\n\nfor (var s = 0; s < shapes.length; s++) {\n var shape = shapes[s];\n for (var tp = 0; tp < testPoints.length; tp++) {\n var testPoint = testPoints[tp];\n console.log(JSON.stringify(testPoint) + '\\tin ' + shape.name + '\\t' + contains(shape.bounds, testPoint.lat, testPoint.lng));\n }\n}\n","language":"JavaScript"},{"code":"module RayCastings\n\nexport Point\n\nstruct Point{T}\n x::T\n y::T\nend\nBase.show(io::IO, p::Point) = print(io, \"($(p.x), $(p.y))\")\n\nconst Edge = Tuple{Point{T}, Point{T}} where T\nBase.show(io::IO, e::Edge) = print(io, \"$(e[1]) ∘-∘ $(e[2])\")\n\nfunction rayintersectseg(p::Point{T}, edge::Edge{T}) where T\n a, b = edge\n if a.y > b.y\n a, b = b, a\n end\n if p.y ∈ (a.y, b.y)\n p = Point(p.x, p.y + eps(p.y))\n end\n\n rst = false\n if (p.y > b.y || p.y < a.y) || (p.x > max(a.x, b.x))\n return false\n end\n\n if p.x < min(a.x, b.x)\n rst = true\n else\n mred = (b.y - a.y) / (b.x - a.x)\n mblu = (p.y - a.y) / (p.x - a.x)\n rst = mblu ≥ mred\n end\n\n return rst\nend\n\nisinside(poly::Vector{Tuple{Point{T}, Point{T}}}, p::Point{T}) where T =\n isodd(count(edge -> rayintersectseg(p, edge), poly))\n\nconnect(a::Point{T}, b::Point{T}...) where T =\n [(a, b) for (a, b) in zip(vcat(a, b...), vcat(b..., a))]\n\nend # module RayCastings\n","language":"Julia"},{"code":"using Printf\n\nlet A = Point(0.0, 0.0),\n B = Point(0.0, 10.0),\n C = Point(10.0, 10.0),\n D = Point(10.0, 0.0),\n E = Point(2.5, 2.5),\n F = Point(2.5, 7.5),\n G = Point(7.5, 7.5),\n H = Point(7.5, 2.5),\n I = Point(3.0, 0.0),\n J = Point(7.0, 0.0),\n K = Point(10.0, 5.0),\n L = Point(7.0, 10.0),\n M = Point(3.0, 10.0),\n N = Point(0.0, 5.0),\n testpts = (Point(5.0, 5.0), Point(5.0, 8.0), Point(-10.0, 5.0), Point(0.0, 5.0),\n Point(10.0, 5.0), Point(8.0, 5.0), Point(10.0, 10.0))\n\n square = RayCastings.connect(A, B, C, D)\n square_withhole = vcat(square, RayCastings.connect(E, F, G, H))\n strange = RayCastings.connect(A, E, B, F, G, C, D, E)\n exagon = RayCastings.connect(I, J, K, L, M, N)\n\n println(\"\\n# TESTING WHETHER POINTS ARE WITHIN POLYGONS\")\n for poly in (square, square_withhole, strange, exagon)\n println(\"\\nEdges: \\n - \", join(poly, \"\\n - \"))\n println(\"Inside/outside:\")\n for p in testpts\n @printf(\" - %-12s is %s\\n\", p, RayCastings.isinside(poly, p) ? \"inside\" : \"outside\")\n end\n end\nend\n","language":"Julia"},{"code":"import java.lang.Double.MAX_VALUE\nimport java.lang.Double.MIN_VALUE\nimport java.lang.Math.abs\n\ndata class Point(val x: Double, val y: Double)\n\ndata class Edge(val s: Point, val e: Point) {\n operator fun invoke(p: Point) : Boolean = when {\n s.y > e.y -> Edge(e, s).invoke(p)\n p.y == s.y || p.y == e.y -> invoke(Point(p.x, p.y + epsilon))\n p.y > e.y || p.y < s.y || p.x > Math.max(s.x, e.x) -> false\n p.x < Math.min(s.x, e.x) -> true\n else -> {\n val blue = if (abs(s.x - p.x) > MIN_VALUE) (p.y - s.y) / (p.x - s.x) else MAX_VALUE\n val red = if (abs(s.x - e.x) > MIN_VALUE) (e.y - s.y) / (e.x - s.x) else MAX_VALUE\n blue >= red\n }\n }\n\n val epsilon = 0.00001\n}\n\nclass Figure(val name: String, val edges: Array<Edge>) {\n operator fun contains(p: Point) = edges.count({ it(p) }) % 2 != 0\n}\n\nobject Ray_casting {\n fun check(figures : Array<Figure>, points : List<Point>) {\n println(\"points: \" + points)\n figures.forEach { f ->\n println(\"figure: \" + f.name)\n f.edges.forEach { println(\" \" + it) }\n println(\"result: \" + (points.map { it in f }))\n }\n }\n}\n","language":"Kotlin"},{"code":"fun main(args: Array<String>) {\n val figures = arrayOf(Figure(\"Square\", arrayOf(Edge(Point(0.0, 0.0), Point(10.0, 0.0)), Edge(Point(10.0, 0.0), Point(10.0, 10.0)),\n Edge(Point(10.0, 10.0), Point(0.0, 10.0)),Edge(Point(0.0, 10.0), Point(0.0, 0.0)))),\n Figure(\"Square hole\", arrayOf(Edge(Point(0.0, 0.0), Point(10.0, 0.0)), Edge(Point(10.0, 0.0), Point(10.0, 10.0)),\n Edge(Point(10.0, 10.0), Point(0.0, 10.0)), Edge(Point(0.0, 10.0), Point(0.0, 0.0)), Edge(Point(2.5, 2.5), Point(7.5, 2.5)),\n Edge(Point(7.5, 2.5), Point(7.5, 7.5)),Edge(Point(7.5, 7.5), Point(2.5, 7.5)), Edge(Point(2.5, 7.5), Point(2.5, 2.5)))),\n Figure(\"Strange\", arrayOf(Edge(Point(0.0, 0.0), Point(2.5, 2.5)), Edge(Point(2.5, 2.5), Point(0.0, 10.0)),\n Edge(Point(0.0, 10.0), Point(2.5, 7.5)), Edge(Point(2.5, 7.5), Point(7.5, 7.5)), Edge(Point(7.5, 7.5), Point(10.0, 10.0)),\n Edge(Point(10.0, 10.0), Point(10.0, 0.0)), Edge(Point(10.0, 0.0), Point(2.5, 2.5)))),\n Figure(\"Exagon\", arrayOf(Edge(Point(3.0, 0.0), Point(7.0, 0.0)), Edge(Point(7.0, 0.0), Point(10.0, 5.0)), Edge(Point(10.0, 5.0), Point(7.0, 10.0)),\n Edge(Point(7.0, 10.0), Point(3.0, 10.0)), Edge(Point(3.0, 10.0), Point(0.0, 5.0)), Edge(Point(0.0, 5.0), Point(3.0, 0.0)))))\n\n val points = listOf(Point(5.0, 5.0), Point(5.0, 8.0), Point(-10.0, 5.0), Point(0.0, 5.0),\n Point(10.0, 5.0), Point(8.0, 5.0), Point(10.0, 10.0))\n\n Ray_casting.check(figures, points)\n}\n","language":"Kotlin"},{"code":"NoMainWin\nGlobal sw, sh, verts\n\nsw = 640 : sh = 480\nWindowWidth = sw+8 : WindowHeight = sh+31\nUpperLeftX = (DisplayWidth -sw)/2\nUpperLeftY = (DisplayHeight-sh)/2\nOpen\"Ray Casting Algorithm\" For Graphics_nf_nsb As #g\n#g \"Down; TrapClose [halt]\"\nh$ = \"#g\"\n\nDim xp(15),yp(15)\n#g \"when leftButtonDown [halt];when mouseMove checkPoint\"\n#g \"when rightButtonDown [Repeat]\"\n\n[Repeat]\n #g \"Cls;Fill 32 160 255; Color white;BackColor 32 160 255\"\n #g \"Place 5 460;\\L-click to exit\"\n #g \"Place 485 460;\\R-click for new polygon\"\n\n 'generate polygon from random points\n numPoints = rand(4,15)\n verts = numPoints\n For i = 0 To numPoints-1\n xp(i) = rand(20,620)\n yp(i) = rand(40,420)\n Next\n Call drawPoly h$, verts, \"white\"\n #g \"Flush\"\n Wait\n\n[halt]\nClose #g\nEnd\n\n'Point In Polygon Function\nFunction pnp(x, y, numSides)\n j= numSides-1: oddNodes = 0\n For i = 0 To numSides-1\n If ((yp(i)<y) And (yp(j)>=y)) Or ((yp(j)<y) And (yp(i)>=y)) Then\n f1 = y - yp(i):f2 = yp(j) - yp(i): f3 = xp(j) - xp(i)\n If (xp(i) + f1 / f2 * f3) < x Then oddNodes = 1 - oddNodes\n End If\n j = i\n Next\n pnp = oddNodes\nEnd Function\n\n'draw the polygon\nSub drawPoly h$, verts, colour$\n #h$, \"Color \";colour$\n j = verts-1\n For i = 0 To verts-1\n #h$ \"Line \";xp(j);\" \";yp(j);\" \";xp(i);\" \";yp(i)\n j = i\n Next\nEnd Sub\n\n'change message and color of polygon\nSub checkPoint h$, x, y\n If pnp(x,y,verts) Then\n #h$ \"Color 32 160 255;BackColor 32 160 255\"\n #h$ \"Place 5 0;BoxFilled 150 20;Color white\"\n #h$ \"Place 7 15;\\Mouse In Polygon\"\n Call drawPoly h$, verts, \"red\"\n Else\n #h$ \"Color 32 160 255;BackColor 32 160 255\"\n #h$ \"Place 5 0;BoxFilled 150 20;Color white\"\n #h$ \"Place 7 15;\\Mouse Not In Polygon\"\n Call drawPoly h$, verts, \"white\"\n End If\nEnd Sub\n\nFunction rand(loNum,hiNum)\n rand = Int(Rnd(0)*(hiNum-loNum+1)+loNum)\nEnd Function\n","language":"Liberty-BASIC"},{"code":"function Point(x,y) return {x=x, y=y} end\n\nfunction Polygon(name, points)\n local function contains(self, p)\n local odd, eps = false, 1e-9\n local function rayseg(p, a, b)\n if a.y > b.y then a, b = b, a end\n if p.y == a.y or p.y == b.y then p.y = p.y + eps end\n if p.y < a.y or p.y > b.y or p.x > math.max(a.x, b.x) then return false end\n if p.x < math.min(a.x, b.x) then return true end\n local red = a.x == b.x and math.huge or (b.y-a.y)/(b.x-a.x)\n local blu = a.x == p.x and math.huge or (p.y-a.y)/(p.x-a.x)\n return blu >= red\n end\n for i, a in ipairs(self.points) do\n local b = self.points[i%#self.points+1]\n if rayseg(p, a, b) then odd = not odd end\n end\n return odd\n end\n return {name=name, points=points, contains=contains}\nend\n\npolygons = {\n Polygon(\"square\", { Point(0,0), Point(10,0), Point(10,10), Point(0,10) }),\n Polygon(\"squarehole\", { Point(0,0), Point(10,0), Point(10,10), Point(0,10), Point(2.5,2.5), Point(7.5,2.5), Point(7.5,7.5), Point(2.5,7.5) }),\n Polygon(\"strange\", { Point(0,0), Point(2.5,2.5), Point(0, 10), Point(2.5,7.5), Point(7.5,7.5), Point(10,10), Point(10,0), Point(2.5,2.5) }),\n Polygon(\"hexagon\", { Point(3,0), Point(7,0), Point(10,5), Point(7,10), Point(3,10), Point(0,5) })\n}\npoints = { Point(5,5), Point(5,8), Point(-10,5), Point(0,5), Point(10,5), Point(8,5), Point(10,10) }\n\nfor _,poly in ipairs(polygons) do\n print(\"Does '\"..poly.name..\"' contain the point..\")\n for _,pt in ipairs(points) do\n print(string.format(\" (%3.f, %2.f)? %s\", pt.x, pt.y, tostring(poly:contains(pt))))\n end\n print()\nend\n","language":"Lua"},{"code":"import fenv, sequtils, strformat\n\ntype\n Point = tuple[x, y: float]\n Edge = tuple[a, b: Point]\n Figure = tuple[name: string; edges: seq[Edge]]\n\n\nfunc contains(poly: Figure; p: Point): bool =\n\n func raySegI(p: Point; edge: Edge): bool =\n const Epsilon = 0.00001\n if edge.a.y > edge.b.y:\n # Swap \"a\" and \"b\".\n return p.raySegI((edge.b, edge.a))\n if p.y == edge.a.y or p.y == edge.b.y:\n # p.y += Epsilon.\n return (p.x, p.y + Epsilon).raySegI(edge)\n if p.y > edge.b.y or p.y < edge.a.y or p.x > max(edge.a.x, edge.b.x):\n return false\n if p.x < min(edge.a.x, edge.b.x):\n return true\n let blue = if abs(edge.a.x - p.x) > minimumPositiveValue(float):\n (p.y - edge.a.y) / (p.x - edge.a.x)\n else:\n maximumPositiveValue(float)\n let red = if abs(edge.a.x - edge.b.x) > minimumPositiveValue(float):\n (edge.b.y - edge.a.y) / (edge.b.x - edge.a.x)\n else:\n maximumPositiveValue(float)\n result = blue >= red\n\n result = (poly.edges.filterIt(p.raySegI(it)).len and 1) != 0\n\n\nwhen isMainModule:\n\n const\n Polys: array[4, Figure] =\n [(\"Square\",\n @[(( 0.0, 0.0), (10.0, 0.0)), ((10.0, 0.0), (10.0, 10.0)),\n ((10.0, 10.0), ( 0.0, 10.0)), (( 0.0, 10.0), ( 0.0, 0.0))]),\n (\"Square hole\",\n @[(( 0.0, 0.0), (10.0, 0.0)), ((10.0, 0.0), (10.0, 10.0)),\n ((10.0, 10.0), ( 0.0, 10.0)), (( 0.0, 10.0), ( 0.0, 0.0)),\n (( 2.5, 2.5), ( 7.5, 2.5)), (( 7.5, 2.5), ( 7.5, 7.5)),\n (( 7.5, 7.5), ( 2.5, 7.5)), (( 2.5, 7.5), ( 2.5, 2.5))]),\n (\"Strange\",\n @[(( 0.0, 0.0), ( 2.5, 2.5)), (( 2.5, 2.5), ( 0.0, 10.0)),\n (( 0.0, 10.0), ( 2.5, 7.5)), (( 2.5, 7.5), ( 7.5, 7.5)),\n (( 7.5, 7.5), (10.0, 10.0)), ((10.0, 10.0), (10.0, 0.0)),\n ((10.0, 0.0), ( 2.5, 2.5))]),\n (\"Hexagon\",\n @[(( 3.0, 0.0), ( 7.0, 0.0)), (( 7.0, 0.0), (10.0, 5.0)),\n ((10.0, 5.0), ( 7.0, 10.0)), (( 7.0, 10.0), ( 3.0, 10.0)),\n (( 3.0, 10.0), ( 0.0, 5.0)), (( 0.0, 5.0), ( 3.0, 0.0))])\n ]\n\n TestPoints: array[7, Point] =\n [(5.0, 5.0), (5.0, 8.0), (-10.0, 5.0), (0.0, 5.0), (10.0, 5.0), (8.0, 5.0), (10.0, 10.0)]\n\n for poly in Polys:\n echo &\"Is point inside figure {poly.name}?\"\n for p in TestPoints:\n echo &\" ({p.x:3},{p.y:3}): {poly.contains(p)}\"\n","language":"Nim"},{"code":"type point = { x:float; y:float }\n\ntype polygon = {\n vertices: point array;\n edges: (int * int) list;\n}\n\nlet p x y = { x=x; y=y }\n\nlet square_v = [|\n (p 0. 0.); (p 10. 0.); (p 10. 10.); (p 0. 10.);\n (p 2.5 2.5); (p 7.5 0.1); (p 7.5 7.5); (p 2.5 7.5)\n|]\n\nlet esa_v = [|\n (p 3. 0.); (p 7. 0.); (p 10. 5.); (p 7. 10.); (p 3. 10.); (p 0. 5.)\n|]\n\nlet esa = {\n vertices = esa_v;\n edges = [ (0,1); (1,2); (2,3); (3,4); (4,5); (5,0) ]\n}\n\nlet square = {\n vertices = square_v;\n edges = [ (0,1); (1,2); (2,3); (3,0) ]\n}\n\nlet squarehole = {\n vertices = square_v;\n edges = [ (0,1); (1,2); (2,3); (3,0); (4,5); (5,6); (6,7); (7,4) ]\n}\n\nlet strange = {\n vertices = square_v;\n edges = [ (0,4); (4,3); (3,7); (7,6); (6,2); (2,1); (1,5); (5,0) ]\n}\n\n\nlet min_y ~a ~b = if a.y > b.y then (b) else (a)\n\nlet coeff_ang ~pa ~pb = (pb.y -. pa.y) /. (pb.x -. pa.x)\n\nlet huge_val = infinity\n\nlet hseg_intersect_seg ~s ~a ~b =\n let _eps =\n if s.y = (max a.y b.y) ||\n s.y = (min a.y b.y) then 0.00001 else 0.0\n in\n if (s.y +. _eps) > (max a.y b.y) ||\n (s.y +. _eps) < (min a.y b.y) ||\n s.x > (max a.x b.x) then (false)\n else if s.x <= (min a.x b.x) then (true)\n else\n let ca = if a.x <> b.x then (coeff_ang a b) else (huge_val) in\n let my = min_y ~a ~b in\n let cp = if (s.x -. my.x) <> 0.0 then (coeff_ang my s) else (huge_val) in\n (cp >= ca)\n;;\n\n\nlet point_is_inside ~poly ~pt =\n let cross = ref 0 in\n List.iter (fun (a,b) ->\n if hseg_intersect_seg pt\n poly.vertices.(a)\n poly.vertices.(b)\n then incr cross\n ) poly.edges;\n ( (!cross mod 2) <> 0)\n;;\n\n\nlet make_test p label s =\n Printf.printf \"point (%.5f,%.5f) is \" p.x p.y;\n print_string (if point_is_inside s p\n then \"INSIDE \"\n else \"OUTSIDE \");\n print_endline label;\n;;\n\n\nlet () =\n let test_points = [\n (p 5. 5.); (p 5. 8.); (p 2. 2.); (p 0. 0.);\n (p 10. 10.); (p 2.5 2.5); (p 0.01 5.);\n (p 2.2 7.4); (p 0. 5.); (p 10. 5.); (p (-4.) 10.) ] in\n\n List.iter (fun p ->\n make_test p \"square\" square;\n make_test p \"squarehole\" squarehole;\n make_test p \"strange\" strange;\n make_test p \"esa\" esa;\n print_newline()\n ) test_points;\n;;\n","language":"OCaml"},{"code":"use strict;\nuse List::Util qw(max min);\n\nsub point_in_polygon\n{\n my ( $point, $polygon ) = @_;\n\n my $count = 0;\n foreach my $side ( @$polygon ) {\n\t$count++ if ray_intersect_segment($point, $side);\n }\n return ($count % 2 == 0) ? 0 : 1;\n}\n\n\nmy $eps = 0.0001;\nmy $inf = 1e600;\n\nsub ray_intersect_segment\n{\n my ($point, $segment) = @_;\n\n my ($A, $B) = @$segment;\n\n my @P = @$point; # copy it\n\n ($A, $B) = ($B, $A) if $A->[1] > $B->[1];\n\n $P[1] += $eps if ($P[1] == $A->[1]) || ($P[1] == $B->[1]);\n\n return 0 if ($P[1] < $A->[1]) || ( $P[1] > $B->[1]) || ($P[0] > max($A->[0],$B->[1]) );\n return 1 if $P[0] < min($A->[0], $B->[0]);\n\n my $m_red = ($A->[0] != $B->[0]) ? ( $B->[1] - $A->[1] )/($B->[0] - $A->[0]) : $inf;\n my $m_blue = ($A->[0] != $P[0]) ? ( $P[1] - $A->[1] )/($P[0] - $A->[0]) : $inf;\n\n return ($m_blue >= $m_red) ? 1 : 0;\n}\n","language":"Perl"},{"code":"# the following are utilities to use the same Fortran data...\nsub point\n{\n [shift, shift];\n}\nsub create_polygon\n{\n my ($pts, $sides) = @_;\n my @poly;\n for(my $i = 0; $i < $#$sides; $i += 2) {\n\tpush @poly, [ $pts->[$sides->[$i]-1], $pts->[$sides->[$i+1]-1] ];\n }\n \\@poly;\n}\n\nmy @pts = ( point(0,0), point(10,0), point(10,10), point(0,10),\n\t point(2.5,2.5), point(7.5,2.5), point(7.5,7.5), point(2.5,7.5),\n\t point(0,5), point(10,5),\n\t point(3,0), point(7,0), point(7,10), point(3,10) );\n\nmy %pgs = (\n squared => create_polygon(\\@pts, [ 1,2, 2,3, 3,4, 4,1 ] ),\n squaredhole => create_polygon(\\@pts, [ 1,2, 2,3, 3,4, 4,1, 5,6, 6,7, 7,8, 8,5 ] ),\n strange => create_polygon(\\@pts, [ 1,5, 5,4, 4,8, 8,7, 7,3, 3,2, 2,5 ] ),\n exagon => create_polygon(\\@pts, [ 11,12, 12,10, 10,13, 13,14, 14,9, 9,11 ]) ,\n);\n\nmy @p = ( point(5,5), point(5, 8), point(-10, 5), point(0,5), point(10,5), &\n\t point(8,5), point(10,10) );\n\nforeach my $pol ( sort keys %pgs ) {\n no strict 'refs';\n print \"$pol\\n\";\n my $rp = $pgs{$pol};\n foreach my $tp ( @p ) {\n\tprint \"\\t($tp->[0],$tp->[1]) \" .\n ( point_in_polygon($tp, $rp) ? \"INSIDE\" : \"OUTSIDE\" ) . \"\\n\";\n }\n}\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">inf</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1e300</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">1e300</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">rayIntersectsSegment</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">point</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">segment</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">segment</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">pX</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pY</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">point</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">aX</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">aY</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">bX</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">bY</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">m_red</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">m_blue</span>\n <span style=\"color: #000080;font-style:italic;\">-- ensure {aX,aY} is the segment end-point with the smallest y coordinate</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">aY</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">bY</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">bX</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">bY</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">a</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">aX</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">aY</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">b</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">pY</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">aY</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">pY</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">bY</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000080;font-style:italic;\">--\n -- Consider a ray passing through the top or left corner of a diamond:\n -- /\n -- --- or -\n -- ^ \\\n -- In both cases it touches both edges, but ends up outside in the\n -- top case, whereas it ends up inside in the left case. Just move\n -- the y co-ordinate down a smidge and it'll work properly, by\n -- missing one line in the left/right cases and hitting both/none\n -- in the top/bottom cases.\n --</span>\n <span style=\"color: #000000;\">pY</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">0.000001</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">pY</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">aY</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">pY</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">bY</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">false</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">pX</span><span style=\"color: #0000FF;\">></span><span style=\"color: #7060A8;\">max</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">aX</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">bX</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">false</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">pX</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">aX</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">bX</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">aX</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">bX</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">m_red</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">bY</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">aY</span><span style=\"color: #0000FF;\">)/(</span><span style=\"color: #000000;\">bX</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">aX</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">m_red</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">inf</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">aX</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">pX</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">m_blue</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pY</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">aY</span><span style=\"color: #0000FF;\">)/(</span><span style=\"color: #000000;\">pX</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">aX</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">m_blue</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">inf</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">m_blue</span> <span style=\"color: #0000FF;\">>=</span> <span style=\"color: #000000;\">m_red</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">inside</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">point</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">poly</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">poly</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">rayIntersectsSegment</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">point</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">poly</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">instr</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">flag</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">expected</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"in\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"out\"</span><span style=\"color: #0000FF;\">}[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">flag</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">flag</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">expected</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #008000;\">\"*** ERROR ***\"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">instar</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">flag</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #008000;\">\"* \"</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">flag</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">test_points</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">},{-</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">}}</span>\n\n <span style=\"color: #000080;font-style:italic;\">--constant NAME = 1, POLY = 2, EXPECTED = 3</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">test_polygons</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"square\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{{{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">}}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"square hole\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{{{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{{</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">7.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">7.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">7.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7.5</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">7.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7.5</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7.5</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7.5</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">}}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"strange\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{{{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7.5</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7.5</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">7.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7.5</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{{</span><span style=\"color: #000000;\">7.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7.5</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2.5</span><span style=\"color: #0000FF;\">}}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"exagon\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{{{</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">}},{{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">}}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">}}</span>\n <span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">poly</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">expected</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">tp</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">test_polygons</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">poly</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">expected</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">test_polygons</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n%12s:\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">test_points</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">tp</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">test_points</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" %s, %-4s\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tp</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">instr</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">inside</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tp</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">poly</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">expected</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">])})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n\\n\\n\"</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">10</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">test_polygons</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">poly</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">test_polygons</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">10</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">instar</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">inside</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">0.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10.5</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #000000;\">poly</span><span style=\"color: #0000FF;\">)))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"<?php\n\nfunction contains($bounds, $lat, $lng)\n{\n $count = 0;\n $bounds_count = count($bounds);\n for ($b = 0; $b < $bounds_count; $b++) {\n $vertex1 = $bounds[$b];\n $vertex2 = $bounds[($b + 1) % $bounds_count];\n if (west($vertex1, $vertex2, $lng, $lat))\n $count++;\n }\n\n return $count % 2;\n}\n\nfunction west($A, $B, $x, $y)\n{\n if ($A['y'] <= $B['y']) {\n if ($y <= $A['y'] || $y > $B['y'] ||\n $x >= $A['x'] && $x >= $B['x']) {\n return false;\n }\n if ($x < $A['x'] && $x < $B['x']) {\n return true;\n }\n if ($x == $A['x']) {\n if ($y == $A['y']) {\n $result1 = NAN;\n } else {\n $result1 = INF;\n }\n } else {\n $result1 = ($y - $A['y']) / ($x - $A['x']);\n }\n if ($B['x'] == $A['x']) {\n if ($B['y'] == $A['y']) {\n $result2 = NAN;\n } else {\n $result2 = INF;\n }\n } else {\n $result2 = ($B['y'] - $A['y']) / ($B['x'] - $A['x']);\n }\n return $result1 > $result2;\n }\n\n return west($B, $A, $x, $y);\n}\n\n$square = [\n 'name' => 'square',\n 'bounds' => [['x' => 0, 'y' => 0], ['x' => 20, 'y' => 0], ['x' => 20, 'y' => 20], ['x' => 0, 'y' => 20]]\n];\n$squareHole = [\n 'name' => 'squareHole',\n 'bounds' => [['x' => 0, 'y' => 0], ['x' => 20, 'y' => 0], ['x' => 20, 'y' => 20], ['x' => 0, 'y' => 20], ['x' => 5, 'y' => 5], ['x' => 15, 'y' => 5], ['x' => 15, 'y' => 15], ['x' => 5, 'y' => 15]]\n];\n$strange = [\n 'name' => 'strange',\n 'bounds' => [['x' => 0, 'y' => 0], ['x' => 5, 'y' => 5], ['x' => 0, 'y' => 20], ['x' => 5, 'y' => 15], ['x' => 15, 'y' => 15], ['x' => 20, 'y' => 20], ['x' => 20, 'y' => 0]]\n];\n$hexagon = [\n 'name' => 'hexagon',\n 'bounds' => [['x' => 6, 'y' => 0], ['x' => 14, 'y' => 0], ['x' => 20, 'y' => 10], ['x' => 14, 'y' => 20], ['x' => 6, 'y' => 20], ['x' => 0, 'y' => 10]]\n];\n\n$shapes = [$square, $squareHole, $strange, $hexagon];\n\n$testPoints = [\n ['lng' => 10, 'lat' => 10],\n ['lng' => 10, 'lat' => 16],\n ['lng' => -20, 'lat' => 10],\n ['lng' => 0, 'lat' => 10],\n ['lng' => 20, 'lat' => 10],\n ['lng' => 16, 'lat' => 10],\n ['lng' => 20, 'lat' => 20]\n];\n\nfor ($s = 0; $s < count($shapes); $s++) {\n $shape = $shapes[$s];\n for ($tp = 0; $tp < count($testPoints); $tp++) {\n $testPoint = $testPoints[$tp];\n echo json_encode($testPoint) . \"\\tin \" . $shape['name'] . \"\\t\" . contains($shape['bounds'], $testPoint['lat'], $testPoint['lng']) . PHP_EOL;\n }\n}\n","language":"PHP"},{"code":"(scl 4)\n\n(de intersects (Px Py Ax Ay Bx By)\n (when (> Ay By)\n (xchg 'Ax 'Bx)\n (xchg 'Ay 'By) )\n (when (or (= Py Ay) (= Py By))\n (inc 'Py) )\n (and\n (>= Py Ay)\n (>= By Py)\n (>= (max Ax Bx) Px)\n (or\n (> (min Ax Bx) Px)\n (= Ax Px)\n (and\n (<> Ax Bx)\n (>=\n (*/ (- Py Ay) 1.0 (- Px Ax)) # Blue\n (*/ (- By Ay) 1.0 (- Bx Ax)) ) ) ) ) ) # Red\n\n(de inside (Pt Poly)\n (let Res NIL\n (for Edge Poly\n (when (apply intersects Edge (car Pt) (cdr Pt))\n (onOff Res) ) )\n Res ) )\n","language":"PicoLisp"},{"code":"Structure point_f\n x.f\n y.f\nEndStructure\nProcedure inpoly(*p.point_f, List poly.point_f())\n Protected.point_f new, old, lp, rp\n Protected inside\n If ListSize(poly()) < 3: ProcedureReturn 0: EndIf\n LastElement(poly()): old = poly()\n ForEach poly()\n ;find leftmost endpoint 'lp' and the rightmost endpoint 'rp' based on x value\n If poly()\\x > old\\x\n lp = old\n rp = poly()\n Else\n lp = poly()\n rp = old\n EndIf\n If lp\\x < *p\\x And *p\\x <= rp\\x And (*p\\y - lp\\y) * (rp\\x - lp\\x) < (rp\\y - lp\\y) * (*p\\x - lp\\x)\n inside = ~inside\n EndIf\n old = poly()\n Next\n ProcedureReturn inside & 1\nEndProcedure\n\nIf InitSprite()\n If InitKeyboard() And InitMouse()\n OpenWindow(0, 0, 0, 800, 600, \"Press [Esc] to close, [Left mouse button] Add Point, [Right mouse button] Clear All Points.\", #PB_Window_ScreenCentered | #PB_Window_SystemMenu)\n OpenWindowedScreen(WindowID(0), 0, 0, 800, 600, 1, 0, 0)\n SetFrameRate(60)\n EndIf\nElse\n MessageRequester(\"\", \"Unable to initsprite\"): End\nEndIf\n\nNewList v.point_f()\nDefine.point_f pvp, mp\nDefine Col, EventID, mode.b, modetxt.s\nRepeat\n Delay(1)\n EventID = WindowEvent()\n ExamineKeyboard()\n ExamineMouse()\n ClearScreen(Col)\n\n mp\\x = MouseX()\n mp\\y = MouseY()\n If MouseButton(#PB_MouseButton_Left)\n AddElement(v())\n v()\\x = mp\\x\n v()\\y = mp\\y\n Delay(100)\n EndIf\n\n If MouseButton(#PB_MouseButton_Right)\n ClearList(v())\n Delay(100)\n EndIf\n\n StartDrawing(ScreenOutput())\n If LastElement(v())\n pvp = v()\n ForEach v()\n LineXY(pvp\\x, pvp\\y, v()\\x, v()\\y, RGB(0, $FF, 0)) ;Green\n Circle(pvp\\x, pvp\\y, 5, RGB($FF, 0, 0)) ;Red\n pvp = v()\n Next\n EndIf\n Circle(MouseX(), MouseY(), 5, RGB($C0, $C0, $FF)) ;LightBlue\n\n If inpoly(mp, v())\n modetxt = \"You are in the polygon.\"\n Col = RGB(0, 0, 0)\n Else\n modetxt = \"You are not in the polygon.\"\n Col = RGB($50, $50, $50)\n EndIf\n DrawText((800 - TextWidth(modetxt)) / 2, 0, modetxt)\n StopDrawing()\n\n FlipBuffers()\nUntil KeyboardReleased(#PB_Key_Escape) Or EventID = #PB_Event_CloseWindow\n","language":"PureBasic"},{"code":"from collections import namedtuple\nfrom pprint import pprint as pp\nimport sys\n\nPt = namedtuple('Pt', 'x, y') # Point\nEdge = namedtuple('Edge', 'a, b') # Polygon edge from a to b\nPoly = namedtuple('Poly', 'name, edges') # Polygon\n\n_eps = 0.00001\n_huge = sys.float_info.max\n_tiny = sys.float_info.min\n\ndef rayintersectseg(p, edge):\n ''' takes a point p=Pt() and an edge of two endpoints a,b=Pt() of a line segment returns boolean\n '''\n a,b = edge\n if a.y > b.y:\n a,b = b,a\n if p.y == a.y or p.y == b.y:\n p = Pt(p.x, p.y + _eps)\n\n intersect = False\n\n if (p.y > b.y or p.y < a.y) or (\n p.x > max(a.x, b.x)):\n return False\n\n if p.x < min(a.x, b.x):\n intersect = True\n else:\n if abs(a.x - b.x) > _tiny:\n m_red = (b.y - a.y) / float(b.x - a.x)\n else:\n m_red = _huge\n if abs(a.x - p.x) > _tiny:\n m_blue = (p.y - a.y) / float(p.x - a.x)\n else:\n m_blue = _huge\n intersect = m_blue >= m_red\n return intersect\n\ndef _odd(x): return x%2 == 1\n\ndef ispointinside(p, poly):\n ln = len(poly)\n return _odd(sum(rayintersectseg(p, edge)\n for edge in poly.edges ))\n\ndef polypp(poly):\n print (\"\\n Polygon(name='%s', edges=(\" % poly.name)\n print (' ', ',\\n '.join(str(e) for e in poly.edges) + '\\n ))')\n\nif __name__ == '__main__':\n polys = [\n Poly(name='square', edges=(\n Edge(a=Pt(x=0, y=0), b=Pt(x=10, y=0)),\n Edge(a=Pt(x=10, y=0), b=Pt(x=10, y=10)),\n Edge(a=Pt(x=10, y=10), b=Pt(x=0, y=10)),\n Edge(a=Pt(x=0, y=10), b=Pt(x=0, y=0))\n )),\n Poly(name='square_hole', edges=(\n Edge(a=Pt(x=0, y=0), b=Pt(x=10, y=0)),\n Edge(a=Pt(x=10, y=0), b=Pt(x=10, y=10)),\n Edge(a=Pt(x=10, y=10), b=Pt(x=0, y=10)),\n Edge(a=Pt(x=0, y=10), b=Pt(x=0, y=0)),\n Edge(a=Pt(x=2.5, y=2.5), b=Pt(x=7.5, y=2.5)),\n Edge(a=Pt(x=7.5, y=2.5), b=Pt(x=7.5, y=7.5)),\n Edge(a=Pt(x=7.5, y=7.5), b=Pt(x=2.5, y=7.5)),\n Edge(a=Pt(x=2.5, y=7.5), b=Pt(x=2.5, y=2.5))\n )),\n Poly(name='strange', edges=(\n Edge(a=Pt(x=0, y=0), b=Pt(x=2.5, y=2.5)),\n Edge(a=Pt(x=2.5, y=2.5), b=Pt(x=0, y=10)),\n Edge(a=Pt(x=0, y=10), b=Pt(x=2.5, y=7.5)),\n Edge(a=Pt(x=2.5, y=7.5), b=Pt(x=7.5, y=7.5)),\n Edge(a=Pt(x=7.5, y=7.5), b=Pt(x=10, y=10)),\n Edge(a=Pt(x=10, y=10), b=Pt(x=10, y=0)),\n Edge(a=Pt(x=10, y=0), b=Pt(x=2.5, y=2.5))\n )),\n Poly(name='exagon', edges=(\n Edge(a=Pt(x=3, y=0), b=Pt(x=7, y=0)),\n Edge(a=Pt(x=7, y=0), b=Pt(x=10, y=5)),\n Edge(a=Pt(x=10, y=5), b=Pt(x=7, y=10)),\n Edge(a=Pt(x=7, y=10), b=Pt(x=3, y=10)),\n Edge(a=Pt(x=3, y=10), b=Pt(x=0, y=5)),\n Edge(a=Pt(x=0, y=5), b=Pt(x=3, y=0))\n )),\n ]\n testpoints = (Pt(x=5, y=5), Pt(x=5, y=8),\n Pt(x=-10, y=5), Pt(x=0, y=5),\n Pt(x=10, y=5), Pt(x=8, y=5),\n Pt(x=10, y=10))\n\n print (\"\\n TESTING WHETHER POINTS ARE WITHIN POLYGONS\")\n for poly in polys:\n polypp(poly)\n print (' ', '\\t'.join(\"%s: %s\" % (p, ispointinside(p, poly))\n for p in testpoints[:3]))\n print (' ', '\\t'.join(\"%s: %s\" % (p, ispointinside(p, poly))\n for p in testpoints[3:6]))\n print (' ', '\\t'.join(\"%s: %s\" % (p, ispointinside(p, poly))\n for p in testpoints[6:]))\n","language":"Python"},{"code":"def _convert_fortran_shapes():\n point = Pt\n pts = (point(0,0), point(10,0), point(10,10), point(0,10),\n point(2.5,2.5), point(7.5,2.5), point(7.5,7.5), point(2.5,7.5),\n point(0,5), point(10,5),\n point(3,0), point(7,0), point(7,10), point(3,10))\n p = (point(5,5), point(5, 8), point(-10, 5), point(0,5), point(10,5),\n point(8,5), point(10,10) )\n\n def create_polygon(pts,vertexindex):\n return [tuple(Edge(pts[vertexindex[i]-1], pts[vertexindex[i+1]-1])\n for i in range(0, len(vertexindex), 2) )]\n polys=[]\n polys += create_polygon(pts, ( 1,2, 2,3, 3,4, 4,1 ) )\n polys += create_polygon(pts, ( 1,2, 2,3, 3,4, 4,1, 5,6, 6,7, 7,8, 8,5 ) )\n polys += create_polygon(pts, ( 1,5, 5,4, 4,8, 8,7, 7,3, 3,2, 2,5 ) )\n polys += create_polygon(pts, ( 11,12, 12,10, 10,13, 13,14, 14,9, 9,11 ) )\n\n names = ( \"square\", \"square_hole\", \"strange\", \"exagon\" )\n polys = [Poly(name, edges)\n for name, edges in zip(names, polys)]\n print 'polys = ['\n for p in polys:\n print \" Poly(name='%s', edges=(\" % p.name\n print ' ', ',\\n '.join(str(e) for e in p.edges) + '\\n )),'\n print ' ]'\n _convert_fortran_shapes()\n","language":"Python"},{"code":"point_in_polygon <- function(polygon, p) {\n count <- 0\n for(side in polygon) {\n if ( ray_intersect_segment(p, side) ) {\n count <- count + 1\n }\n }\n if ( count %% 2 == 1 )\n \"INSIDE\"\n else\n \"OUTSIDE\"\n}\n\nray_intersect_segment <- function(p, side) {\n eps <- 0.0001\n a <- side$A\n b <- side$B\n if ( a$y > b$y ) {\n a <- side$B\n b <- side$A\n }\n if ( (p$y == a$y) || (p$y == b$y) ) {\n p$y <- p$y + eps\n }\n if ( (p$y < a$y) || (p$y > b$y) )\n return(FALSE)\n else if ( p$x > max(a$x, b$x) )\n return(FALSE)\n else {\n if ( p$x < min(a$x, b$x) )\n return(TRUE)\n else {\n if ( a$x != b$x )\n m_red <- (b$y - a$y) / (b$x - a$x)\n else\n m_red <- Inf\n if ( a$x != p$x )\n m_blue <- (p$y - a$y) / (p$x - a$x)\n else\n m_blue <- Inf\n return( m_blue >= m_red )\n }\n }\n}\n","language":"R"},{"code":"######## utility functions #########\n\npoint <- function(x,y) list(x=x, y=y)\n\n# pts = list(p1, p2, ... )... coords\n# segs = list(c(1,2), c(2,1) ...) indices\ncreatePolygon <- function(pts, segs) {\n pol <- list()\n for(pseg in segs) {\n pol <- c(pol, list(list(A=pts[[pseg[1]]], B=pts[[pseg[2]]])))\n }\n pol\n}\n","language":"R"},{"code":"#### testing ####\n\npts <- list(point(0,0), point(10,0), point(10,10), point(0,10),\n point(2.5,2.5), point(7.5,2.5), point(7.5,7.5), point(2.5,7.5),\n point(0,5), point(10,5),\n point(3,0), point(7,0), point(7,10), point(3,10))\n\npolygons <-\n list(\n square = createPolygon(pts, list(c(1,2), c(2,3), c(3,4), c(4,1))),\n squarehole = createPolygon(pts, list(c(1,2), c(2,3), c(3,4), c(4,1), c(5,6), c(6,7), c(7,8), c(8,5))),\n exagon = createPolygon(pts, list(c(11,12), c(12,10), c(10,13), c(13,14), c(14,9), c(9,11)))\n )\n\ntestpoints <-\n list(\n point(5,5), point(5, 8), point(-10, 5), point(0,5), point(10,5),\n point(8,5), point(9.9,9.9)\n )\n\nfor(p in testpoints) {\n for(polysi in 1:length(polygons)) {\n cat(sprintf(\"point (%lf, %lf) is %s polygon (%s)\\n\",\n p$x, p$y, point_in_polygon(polygons[[polysi]], p), names(polygons[polysi])))\n }\n}\n","language":"R"},{"code":"#lang racket\n\n(module pip racket\n (require racket/contract)\n\n (provide point)\n (provide seg)\n (provide (contract-out [point-in-polygon? (->\n point?\n list?\n boolean?)]))\n\n (struct point (x y) #:transparent)\n (struct seg (Ax Ay Bx By) #:transparent)\n (define ε 0.000001)\n (define (neq? x y) (not (eq? x y)))\n\n (define (ray-cross-seg? r s)\n (let* ([Ax (seg-Ax s)] [Ay (seg-Ay s)]\n [Bx (seg-Bx s)] [By (seg-By s)]\n [Px (point-x r)] [Pyo (point-y r)]\n [Py (+ Pyo (if (or (eq? Pyo Ay)\n (eq? Pyo By))\n ε 0))])\n\n (define Ax2 (if (< Ay By) Ax Bx))\n (define Ay2 (if (< Ay By) Ay By))\n (define Bx2 (if (< Ay By) Bx Ax))\n (define By2 (if (< Ay By) By Ay))\n\n (cond [(or (> Py (max Ay By)) (< Py (min Ay By))) #f]\n [(> Px (max Ax Bx)) #f]\n [else (cond\n [(< Px (min Ax Bx)) #t]\n [else\n (let ([red (if (neq? Ax2 Bx2)\n (/ (- By2 Ay2) (- Bx2 Ax2))\n +inf.0)]\n [blue (if (neq? Ax2 Px)\n (/ (- Py Ay2) (- Px Ax2))\n +inf.0)])\n (if (>= blue red) #t #f))])])))\n\n (define (point-in-polygon? point polygon)\n (odd?\n (for/fold ([c 0]) ([seg polygon])\n (+ c (if (ray-cross-seg? point seg) 1 0))))))\n\n(require 'pip)\n\n(define test-point-list\n (list\n (point 5.0 5.0)\n (point 5.0 8.0)\n (point -10.0 5.0)\n (point 0.0 5.0)\n (point 10.0 5.0)\n (point 8.0 5.0)\n (point 10.0 10.0)))\n\n(define square\n (list (seg 0.0 0.0 10.0 0.0)\n (seg 10.0 0.0 10.0 10.0)\n (seg 10.0 10.0 0.0 10.0)\n (seg 0.0 0.0 0.0 10.0)))\n\n(define exagon\n (list (seg 3.0 0.0 7.0 0.0)\n (seg 7.0 0.0 10.0 5.0)\n (seg 10.0 5.0 7.0 10.0)\n (seg 7.0 10.0 3.0 10.0)\n (seg 0.0 5.0 3.0 10.0)\n (seg 3.0 0.0 0.0 5.0)))\n\n(define (test-figure fig name)\n (printf \"\\ntesting ~a: \\n\" name)\n (for ([p test-point-list])\n (printf \"testing ~v: ~a\\n\" p (point-in-polygon? p fig))))\n\n(test-figure square \"square\")\n(test-figure exagon \"exagon\")\n","language":"Racket"},{"code":"constant ε = 0.0001;\n\nsub ray-hits-seg([\\Px,\\Py], [[\\Ax,\\Ay], [\\Bx,\\By]] --> Bool) {\n Py += ε if Py == Ay | By;\n\n if Py < Ay or Py > By or Px > (Ax max Bx) {\n\tFalse;\n }\n elsif Px < (Ax min Bx) {\n\tTrue;\n }\n else {\n\tmy \\red = Ax == Bx ?? Inf !! (By - Ay) / (Bx - Ax);\n\tmy \\blue = Ax == Px ?? Inf !! (Py - Ay) / (Px - Ax);\n\tblue >= red;\n }\n}\n\nsub point-in-poly(@point, @polygon --> Bool) {\n so 2 R% [+] gather for @polygon -> @side {\n\ttake ray-hits-seg @point, @side.sort(*.[1]);\n }\n}\n\nmy %poly =\n squared =>\n\t [[[ 0.0, 0.0], [10.0, 0.0]],\n\t [[10.0, 0.0], [10.0, 10.0]],\n\t [[10.0, 10.0], [ 0.0, 10.0]],\n\t [[ 0.0, 10.0], [ 0.0, 0.0]]],\n squaredhole =>\n\t [[[ 0.0, 0.0], [10.0, 0.0]],\n\t [[10.0, 0.0], [10.0, 10.0]],\n\t [[10.0, 10.0], [ 0.0, 10.0]],\n\t [[ 0.0, 10.0], [ 0.0, 0.0]],\n\t [[ 2.5, 2.5], [ 7.5, 2.5]],\n\t [[ 7.5, 2.5], [ 7.5, 7.5]],\n\t [[ 7.5, 7.5], [ 2.5, 7.5]],\n\t [[ 2.5, 7.5], [ 2.5, 2.5]]],\n strange =>\n\t [[[ 0.0, 0.0], [ 2.5, 2.5]],\n\t [[ 2.5, 2.5], [ 0.0, 10.0]],\n\t [[ 0.0, 10.0], [ 2.5, 7.5]],\n\t [[ 2.5, 7.5], [ 7.5, 7.5]],\n\t [[ 7.5, 7.5], [10.0, 10.0]],\n\t [[10.0, 10.0], [10.0, 0.0]],\n\t [[10.0, 0.0], [ 2.5, 2.5]],\n\t [[ 2.5, 2.5], [ 0.0, 0.0]]], # conjecturally close polygon\n exagon =>\n\t [[[ 3.0, 0.0], [ 7.0, 0.0]],\n\t [[ 7.0, 0.0], [10.0, 5.0]],\n\t [[10.0, 5.0], [ 7.0, 10.0]],\n\t [[ 7.0, 10.0], [ 3.0, 10.0]],\n\t [[ 3.0, 10.0], [ 0.0, 5.0]],\n\t [[ 0.0, 5.0], [ 3.0, 0.0]]];\n\nmy @test-points =\n\t [ 5.0, 5.0],\n\t [ 5.0, 8.0],\n\t [-10.0, 5.0],\n\t [ 0.0, 5.0],\n\t [ 10.0, 5.0],\n\t [ 8.0, 5.0],\n\t [ 10.0, 10.0];\n\nfor <squared squaredhole strange exagon> -> $polywanna {\n say \"$polywanna\";\n my @poly = %poly{$polywanna}[];\n for @test-points -> @point {\n\tsay \"\\t(@point.fmt('%.1f',','))\\t{ point-in-poly(@point, @poly) ?? 'IN' !! 'OUT' }\";\n }\n}\n","language":"Raku"},{"code":"/*REXX program verifies if a horizontal ray from point P intersects a polygon. */\ncall points 5 5, 5 8, -10 5, 0 5, 10 5, 8 5, 10 10\n A= 2.5; B= 7.5 /* ◄───── used for shorter arguments (below).*/\ncall poly 0 0, 10 0, 10 10, 0 10 ; call test 'square'\ncall poly 0 0, 10 0, 10 10, 0 10, A A, B A, B B, A B ; call test 'square hole'\ncall poly 0 0, A A, 0 10, A B, B B, 10 10, 10 0 ; call test 'irregular'\ncall poly 3 0, 7 0, 10 5, 7 10, 3 10, 0 5 ; call test 'hexagon'\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nin$out: procedure expose point. poly.; parse arg p; #= 0\n do side=1 to poly.0 by 2; #= # +intersect(p, side); end /*side*/\n return # // 2 /*ODD is inside. EVEN is outside.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nintersect: procedure expose point. poly.; parse arg ?,s; sp= s + 1\n epsilon= '1e' || (-digits() % 2)\n Px= point.?.x; Ax= poly.s.x; Bx= poly.sp.x\n Py= point.?.y; Ay= poly.s.y; By= poly.sp.y /* [↓] do vertex swap.*/\n if Ay>By then parse value Ax Ay Bx By with Bx By Ax Ay\n if Py=Ay | Py=By then Py= Py + epsilon\n if Py<Ay | Py>By | Px>max(Ax, Bx) then return 0\n if Px<min(Ax, Bx) then return 1\n if Ax\\=Bx then red = (By-Ay) / (Bx-Ax)\n else red = i\"1e\" || (digits() *2) /* ◄─── infinity.*/\n if Ax\\=Px then return (Py-Ay) / (Px-Ax) >= red\n else return 1\n/*──────────────────────────────────────────────────────────────────────────────────────*/\npoints: wx= 0; wy= 0; do j=1 for arg(); parse value arg(j) with xx yy\n wx= max(wx, length(xx) ); call value 'POINT.'j\".X\", xx\n wy= max(wy, length(yy) ); call value 'POINT.'j\".Y\", yy\n end /*j*/\n call value point.0, j-1 /*define the number of points. */\n return /* [↑] adjust J (for DO loop)*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\npoly: @= 'POLY.'; parse arg Fx Fy /* [↓] process the X,Y points.*/\n n= 0\n do j=1 for arg(); n= n + 1; parse value arg(j) with xx yy\n call value @ || n'.X', xx ; call value @ || n\".Y\", yy\n if n//2 then iterate; n= n + 1 /*Inside? Then skip this point.*/\n call value @ || n'.X', xx ; call value @ || n\".Y\", yy\n end /*j*/\n n= n + 1 /*POLY.0 is # segments(sides).*/\n call value @ || n'.X', Fx; call value @ || n\".Y\", Fy; call value @'0', n\n return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ntest: say; do k=1 for point.0; w= wx + wy + 2 /*W, WX, WY ≡are various widths*/\n say right(' ['arg(1)\"] point:\", 30),\n right( right(point.k.x, wx)', 'right(point.k.y, wy), w) \" is \",\n right( word('outside inside', in$out(k) + 1), 7)\n end /*k*/\n return /* [↑] format the output nicely*/\n","language":"REXX"},{"code":"use std::f64;\n\nconst _EPS: f64 = 0.00001;\nconst _MIN: f64 = f64::MIN_POSITIVE;\nconst _MAX: f64 = f64::MAX;\n\n#[derive(Clone)]\nstruct Point {\n x: f64,\n y: f64,\n}\n\n#[derive(Clone)]\nstruct Edge {\n pt1: Point,\n pt2: Point,\n}\n\nimpl Edge {\n fn new(pt1: (f64, f64), pt2: (f64, f64)) -> Edge {\n Edge {\n pt1: Point { x: pt1.0, y: pt1.1 },\n pt2: Point { x: pt2.0, y: pt2.1 },\n }\n }\n}\n\nstruct Polygon {\n edges: Vec<Edge>, // Polygon has to be created with counter-clockwise coordinates\n}\n\nfn pt_in_polygon(pt: &Point, poly: &Polygon) -> bool {\n let count = poly.edges\n .iter()\n .filter(|edge| ray_intersect_seg(pt, edge))\n .count();\n\n count % 2 == 1\n}\n\nfn ray_intersect_seg(p: &Point, edge: &Edge) -> bool {\n let mut pt = p.clone();\n let (mut a, mut b): (&Point, &Point) = (&edge.pt1, &edge.pt2);\n if a.y > b.y {\n std::mem::swap(&mut a, &mut b);\n }\n if pt.y == a.y || pt.y == b.y {\n pt.y += _EPS;\n }\n\n if (pt.y > b.y || pt.y < a.y) || pt.x > a.x.max(b.x) {\n false\n } else if pt.x < a.x.min(b.x) {\n true\n } else {\n let m_red = if (a.x - b.x).abs() > _MIN {\n (b.y - a.y) / (b.x - a.x)\n } else {\n _MAX\n };\n let m_blue = if (a.x - pt.x).abs() > _MIN {\n (pt.y - a.y) / (pt.x - a.x)\n } else {\n _MAX\n };\n m_blue >= m_red\n }\n}\n\nfn main() {\n let p = |x, y| Point { x, y };\n let testpoints = [p(5.0, 5.0), p(5.0, 8.0), p(-10.0, 5.0), p(0.0, 5.0), p(10.0, 5.0), p(8.0, 5.0), p(10.0, 10.0)];\n let poly_square = Polygon {\n edges: vec![\n Edge::new((0.0, 0.0), (10.0, 0.0)),\n Edge::new((10.0, 0.0), (10.0, 10.0)),\n Edge::new((10.0, 10.0), (0.0, 10.0)),\n Edge::new((0.0, 10.0), (0.0, 0.0)),\n ],\n };\n let poly_square_hole = Polygon {\n edges: vec![\n Edge::new((0.0, 0.0), (10.0, 0.0)),\n Edge::new((10.0, 0.0), (10.0, 10.0)),\n Edge::new((10.0, 10.0), (0.0, 10.0)),\n Edge::new((0.0, 10.0), (0.0, 0.0)),\n Edge::new((2.5, 2.5), (7.5, 2.5)),\n Edge::new((7.5, 2.5), (7.5, 7.5)),\n Edge::new((7.5, 7.5), (2.5, 7.5)),\n Edge::new((2.5, 7.5), (2.5, 2.5)),\n ],\n };\n let poly_strange = Polygon {\n edges: vec![\n Edge::new((0.0, 0.0), (2.5, 2.5)),\n Edge::new((2.5, 2.5), (0.0, 10.0)),\n Edge::new((0.0, 10.0), (2.5, 7.5)),\n Edge::new((2.5, 7.5), (7.5, 7.5)),\n Edge::new((7.5, 7.5), (10.0, 10.0)),\n Edge::new((10.0, 10.0), (10.0, 0.0)),\n Edge::new((10.0, 0.0), (2.5, 2.5)),\n ],\n };\n let poly_hexagon = Polygon {\n edges: vec![\n Edge::new((3.0, 0.0), (7.0, 0.0)),\n Edge::new((7.0, 0.0), (10.0, 5.0)),\n Edge::new((10.0, 5.0), (7.0, 10.0)),\n Edge::new((7.0, 10.0), (3.0, 10.0)),\n Edge::new((3.0, 10.0), (0.0, 5.0)),\n Edge::new((0.0, 5.0), (3.0, 0.0)),\n ],\n };\n print!(\"\\nSquare :\");\n for pt in &testpoints {\n print!(\" {:?}\", pt_in_polygon(pt, &poly_square));\n }\n print!(\"\\nSquare with hole:\");\n for pt in &testpoints {\n print!(\" {:?}\", pt_in_polygon(pt, &poly_square_hole));\n }\n print!(\"\\nStrange polygon :\");\n for pt in &testpoints {\n print!(\" {:?}\", pt_in_polygon(pt, &poly_strange));\n }\n print!(\"\\nHexagon :\");\n for pt in &testpoints {\n print!(\" {:?}\", pt_in_polygon(pt, &poly_hexagon));\n }\n println!();\n}\n","language":"Rust"},{"code":"package scala.ray_casting\n\ncase class Edge(_1: (Double, Double), _2: (Double, Double)) {\n import Math._\n import Double._\n\n def raySegI(p: (Double, Double)): Boolean = {\n if (_1._2 > _2._2) return Edge(_2, _1).raySegI(p)\n if (p._2 == _1._2 || p._2 == _2._2) return raySegI((p._1, p._2 + epsilon))\n if (p._2 > _2._2 || p._2 < _1._2 || p._1 > max(_1._1, _2._1))\n return false\n if (p._1 < min(_1._1, _2._1)) return true\n val blue = if (abs(_1._1 - p._1) > MinValue) (p._2 - _1._2) / (p._1 - _1._1) else MaxValue\n val red = if (abs(_1._1 - _2._1) > MinValue) (_2._2 - _1._2) / (_2._1 - _1._1) else MaxValue\n blue >= red\n }\n\n final val epsilon = 0.00001\n}\n\ncase class Figure(name: String, edges: Seq[Edge]) {\n def contains(p: (Double, Double)) = edges.count(_.raySegI(p)) % 2 != 0\n}\n\nobject Ray_casting extends App {\n val figures = Seq(Figure(\"Square\", Seq(((0.0, 0.0), (10.0, 0.0)), ((10.0, 0.0), (10.0, 10.0)),\n ((10.0, 10.0), (0.0, 10.0)),((0.0, 10.0), (0.0, 0.0)))),\n Figure(\"Square hole\", Seq(((0.0, 0.0), (10.0, 0.0)), ((10.0, 0.0), (10.0, 10.0)),\n ((10.0, 10.0), (0.0, 10.0)), ((0.0, 10.0), (0.0, 0.0)), ((2.5, 2.5), (7.5, 2.5)),\n ((7.5, 2.5), (7.5, 7.5)),((7.5, 7.5), (2.5, 7.5)), ((2.5, 7.5), (2.5, 2.5)))),\n Figure(\"Strange\", Seq(((0.0, 0.0), (2.5, 2.5)), ((2.5, 2.5), (0.0, 10.0)),\n ((0.0, 10.0), (2.5, 7.5)), ((2.5, 7.5), (7.5, 7.5)), ((7.5, 7.5), (10.0, 10.0)),\n ((10.0, 10.0), (10.0, 0.0)), ((10.0, 0.0), (2.5, 2.5)))),\n Figure(\"Exagon\", Seq(((3.0, 0.0), (7.0, 0.0)), ((7.0, 0.0), (10.0, 5.0)), ((10.0, 5.0), (7.0, 10.0)),\n ((7.0, 10.0), (3.0, 10.0)), ((3.0, 10.0), (0.0, 5.0)), ((0.0, 5.0), (3.0, 0.0)))))\n\n val points = Seq((5.0, 5.0), (5.0, 8.0), (-10.0, 5.0), (0.0, 5.0), (10.0, 5.0), (8.0, 5.0), (10.0, 10.0))\n\n println(\"points: \" + points)\n for (f <- figures) {\n println(\"figure: \" + f.name)\n println(\" \" + f.edges)\n println(\"result: \" + (points map f.contains))\n }\n\n private implicit def to_edge(p: ((Double, Double), (Double, Double))): Edge = Edge(p._1, p._2)\n}\n","language":"Scala"},{"code":"Object subclass: Segment [\n |pts|\n Segment class >> new: points [ |a|\n a := super new.\n ^ a init: points\n ]\n init: points [ pts := points copy. ^self ]\n endPoints [ ^pts ]\n \"utility methods\"\n first [ ^ pts at: 1]\n second [ ^ pts at: 2]\n leftmostEndPoint [\n ^ (self first x > self second x) ifTrue: [ self second ] ifFalse: [ self first ]\n ]\n rightmostEndPoint [\n ^ (self first x > self second x) ifTrue: [ self first ] ifFalse: [ self second ]\n ]\n topmostEndPoint [\n ^ (self first y > self second y) ifTrue: [ self first ] ifFalse: [ self second ]\n ]\n bottommostEndPoint [\n ^ (self first y > self second y) ifTrue: [ self second ] ifFalse: [ self first ]\n ]\n\n slope [\n (pts at: 1) x ~= (pts at: 2) x\n ifTrue: [ ^ ((pts at: 1) y - (pts at: 2) y) / ((pts at: 1) x - (pts at: 2) x) ]\n ifFalse: [ ^ FloatD infinity ]\n ]\n\n doesIntersectRayFrom: point [ |p A B|\n (point y = (pts at: 1) y) | (point y = (pts at: 2) y)\n ifTrue: [ p := Point x: (point x) y: (point y) + 0.00001 ]\n ifFalse: [ p := point copy ].\n A := self bottommostEndPoint.\n B := self topmostEndPoint.\n (p y < A y) | (p y > B y) | (p x > (self rightmostEndPoint x))\n ifTrue: [ ^false ]\n ifFalse: [ (p x < (self leftmostEndPoint x))\n ifTrue: [ ^true ]\n ifFalse: [ |s|\n s := Segment new: { A . point }.\n\t\t\t(s slope) >= (self slope)\n\t\t\t ifTrue: [ ^ true ]\n ]\n ].\n ^false\n ]\n].\n\nObject subclass: Polygon [\n |polysegs|\n Polygon class >> new [ |a| a := super new. ^ a init. ]\n Polygon class >> fromSegments: segments [ |a|\n a := super new.\n ^ a initWithSegments: segments\n ]\n Polygon class >> fromPoints: pts and: indexes [ |a|\n a := self new.\n indexes do: [ :i |\n a addSegment: ( Segment new: { pts at: (i at: 1) . pts at: (i at: 2) } )\n ].\n ^ a\n ]\n initWithSegments: segments [\n polysegs := segments copy. ^self\n ]\n init [ polysegs := OrderedCollection new. ^ self ]\n addSegment: segment [ polysegs add: segment ]\n\n pointInside: point [ |cnt|\n cnt := 0.\n polysegs do: [ :s | (s doesIntersectRayFrom: point)\n ifTrue: [ cnt := cnt + 1 ] ].\n ^ ( cnt \\\\ 2 = 0 ) not\n ]\n].\n","language":"Smalltalk"},{"code":"|points names polys|\n\npoints := {\n 0@0 . 10@0 . 10@10 . 0@10 .\n 2.5@2.5 . 7.5@2.5 . 7.5@7.5 .\n 2.5@7.5 . 0@5 . 10@5 .\n 3@0 . 7@0 . 7@10 . 3@10\n }.\n\nnames := { 'square' . 'square hole' . 'strange' . 'exagon' }.\n\npolys := OrderedCollection new.\n\npolys add:\n (\n Polygon fromPoints: points\n and: { {1 . 2}. {2 . 3}. {3 . 4}. {4 . 1} }\n ) ;\n add:\n (\n Polygon fromPoints: points\n and: { {1 . 2}. {2 . 3}. {3 . 4}. {4 . 1}. {5 . 6}. {6 . 7}. {7 . 8}. {8 . 5} }\n ) ;\n add:\n (\n Polygon fromPoints: points\n and: { {1 . 5}. {5 . 4}. {4 . 8}. {8 . 7}. {7 . 3}. {3 . 2}. {2 . 5} }\n ) ;\n add:\n (\n Polygon fromPoints: points\n and: { {11 . 12}. {12 . 10}. {10 . 13}. {13 . 14}. {14 . 9}. {9 . 11} }\n ).\n\n{ 5@5 . 5@8 . -10@5 . 0@5 . 10@5 . 8@5 . 10@10 }\ndo: [ :p |\n 1 to: 4 do: [ :i |\n ('point %1 inside %2? %3' %\n { p . names at: i. (polys at: i) pointInside: p }) displayNl\n ].\n ' ' displayNl.\n]\n","language":"Smalltalk"},{"code":"package require Tcl 8.5\n\nproc point_in_polygon {point polygon} {\n set count 0\n foreach side [sides $polygon] {\n if {[ray_intersects_line $point $side]} {\n incr count\n }\n }\n expr {$count % 2} ;#-- 1 = odd = true, 0 = even = false\n}\nproc sides polygon {\n lassign $polygon x0 y0\n foreach {x y} [lrange [lappend polygon $x0 $y0] 2 end] {\n lappend res [list $x0 $y0 $x $y]\n set x0 $x\n set y0 $y\n }\n return $res\n}\nproc ray_intersects_line {point line} {\n lassign $point Px Py\n lassign $line Ax Ay Bx By\n # Reverse line direction if necessary\n if {$By < $Ay} {\n\tlassign $line Bx By Ax Ay\n }\n # Add epsilon to\n if {$Py == $Ay || $Py == $By} {\n\tset Py [expr {$Py + abs($Py)/1e6}]\n }\n # Bounding box checks\n if {$Py < $Ay || $Py > $By || $Px > max($Ax,$Bx)} {\n\treturn 0\n } elseif {$Px < min($Ax,$Bx)} {\n\treturn 1\n }\n # Compare dot products to compare (cosines of) angles\n set mRed [expr {$Ax != $Bx ? ($By-$Ay)/($Bx-$Ax) : Inf}]\n set mBlu [expr {$Ax != $Px ? ($Py-$Ay)/($Px-$Ax) : Inf}]\n return [expr {$mBlu >= $mRed}]\n}\n\nforeach {point poly} {\n {0 0}\t{-1 -1 -1 1 1 1 1 -1}\n {2 2}\t{-1 -1 -1 1 1 1 1 -1}\n {0 0}\t{-2 -2 -2 2 2 2 2 -2 2 -1 1 1 -1 1 -1 -1 1 -1 2 -1}\n {1.5 1.5}\t{-2 -2 -2 2 2 2 2 -2 2 -1 1 1 -1 1 -1 -1 1 -1 2 -1}\n {5 5}\t{0 0 2.5 2.5 0 10 2.5 7.5 7.5 7.5 10 10 10 0 7.5 0.1}\n {5 8}\t{0 0 2.5 2.5 0 10 2.5 7.5 7.5 7.5 10 10 10 0 7.5 0.1}\n {2 2}\t{0 0 2.5 2.5 0 10 2.5 7.5 7.5 7.5 10 10 10 0 7.5 0.1}\n {0 0}\t{0 0 2.5 2.5 0 10 2.5 7.5 7.5 7.5 10 10 10 0 7.5 0.1}\n {10 10}\t{0 0 2.5 2.5 0 10 2.5 7.5 7.5 7.5 10 10 10 0 7.5 0.1}\n {2.5 2.5}\t{0 0 2.5 2.5 0 10 2.5 7.5 7.5 7.5 10 10 10 0 7.5 0.1}\n {-5 5}\t{3 0 7 0 10 5 7 10 3 10 0 5}\n} {\n puts \"$point in $poly = [point_in_polygon $point $poly]\"\n}\n","language":"Tcl"},{"code":"#import flo\n\nin =\n\n@lrzyCipPX ~|afatPRZaq ~&EZ+fleq~~lrPrbr2G&& ~&B+fleq~~lrPrbl2G!| -&\n ~&Y+ ~~lrPrbl2G fleq,\n ^E(fleq@lrrPX,@rl fleq\\0.)^/~&lr ^(~&r,times)^/minus@llPrll2X vid+ minus~~rbbI&-\n","language":"Ursala"},{"code":"#cast %bL\n\nexamples =\n\nin* <\n ((0.5,0.6),<(0.,0.),(1.,2.),(1.,0.)>),\n ((0.5,0.6),<(0.,0.),(1.,1.),(1.,0.)>)>\n","language":"Ursala"},{"code":"Imports System.Math\n\nModule RayCasting\n\n Private square As Integer()() = {New Integer() {0, 0}, New Integer() {20, 0}, New Integer() {20, 20}, New Integer() {0, 20}}\n Private squareHole As Integer()() = {New Integer() {0, 0}, New Integer() {20, 0}, New Integer() {20, 20}, New Integer() {0, 20}, New Integer() {5, 5}, New Integer() {15, 5}, New Integer() {15, 15}, New Integer() {5, 15}}\n Private strange As Integer()() = {New Integer() {0, 0}, New Integer() {5, 5}, New Integer() {0, 20}, New Integer() {5, 15}, New Integer() {15, 15}, New Integer() {20, 20}, New Integer() {20, 0}}\n Private hexagon As Integer()() = {New Integer() {6, 0}, New Integer() {14, 0}, New Integer() {20, 10}, New Integer() {14, 20}, New Integer() {6, 20}, New Integer() {0, 10}}\n Private shapes As Integer()()() = {square, squareHole, strange, hexagon}\n\n Public Sub Main()\n Dim testPoints As Double()() = {New Double() {10, 10}, New Double() {10, 16}, New Double() {-20, 10}, New Double() {0, 10}, New Double() {20, 10}, New Double() {16, 10}, New Double() {20, 20}}\n\n For Each shape As Integer()() In shapes\n For Each point As Double() In testPoints\n Console.Write(String.Format(\"{0} \", Contains(shape, point).ToString.PadLeft(7)))\n Next\n Console.WriteLine()\n Next\n End Sub\n\n Private Function Contains(shape As Integer()(), point As Double()) As Boolean\n\n Dim inside As Boolean = False\n Dim length As Integer = shape.Length\n\n For i As Integer = 0 To length - 1\n If Intersects(shape(i), shape((i + 1) Mod length), point) Then\n inside = Not inside\n End If\n Next\n\n Return inside\n End Function\n\n Private Function Intersects(a As Integer(), b As Integer(), p As Double()) As Boolean\n\n If a(1) > b(1) Then Return Intersects(b, a, p)\n If p(1) = a(1) Or p(1) = b(1) Then p(1) += 0.0001\n If p(1) > b(1) Or p(1) < a(1) Or p(0) >= Max(a(0), b(0)) Then Return False\n If p(0) < Min(a(0), b(0)) Then Return True\n Dim red As Double = (p(1) - a(1)) / (p(0) - a(0))\n Dim blue As Double = (b(1) - a(1)) / (b(0) - a(0))\n\n Return red >= blue\n End Function\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"./fmt\" for Fmt\n\nclass RayCasting {\n static intersects(a, b, p) {\n if (a[1] > b[1]) return intersects(b, a, p)\n if (p[1] == a[1] || p[1] == b[1]) p[1] = p[1] + 0.0001\n if (p[1] > b[1] || p[1] < a[1] || p[0] >= a[0].max(b[0])) return false\n if (p[0] < a[0].min(b[0])) return true\n var red = (p[1] - a[1]) / (p[0] - a[0])\n var blue = (b[1] - a[1]) / (b[0] - a[0])\n return red >= blue\n }\n\n static contains(shape, pnt) {\n var inside = false\n var len = shape.count\n for (i in 0...len) {\n if (intersects(shape[i], shape[(i + 1) % len], pnt)) inside = !inside\n }\n return inside\n }\n\n static square { [[0, 0], [20, 0], [20, 20], [0, 20]] }\n\n static squareHole { [[0, 0], [20, 0], [20, 20], [0, 20], [5, 5], [15, 5], [15, 15], [5, 15]] }\n\n static strange { [[0, 0], [5, 5], [0, 20], [5, 15], [15, 15], [20, 20], [20, 0]] }\n\n static hexagon { [[6, 0], [14, 0], [20, 10], [14, 20], [6, 20], [0, 10]] }\n\n static shapes { [square, squareHole, strange, hexagon] }\n}\n\nvar testPoints = [[10, 10], [10, 16], [-20, 10], [0, 10], [20, 10], [16, 10], [20, 20]]\nfor (shape in RayCasting.shapes) {\n for (pnt in testPoints) Fmt.write(\"$7s \", RayCasting.contains(shape, pnt))\n System.print()\n}\n","language":"Wren"},{"code":"const E = 0.0001;\n\nfcn rayHitsSeg([(Px,Py)],[(Ax,Ay)],[(Bx,By)]){ // --> Bool\n if(Py==Ay or Py==By) Py+=E;\n if(Py<Ay or Py>By or Px>Ax.max(Bx)) False\n else if(Px<Ax.min(Bx)) True\n else try{ ( (Py - Ay)/(Px - Ax) )>=( (By - Ay)/(Bx - Ax) ) } //blue>=red\n catch(MathError){ Px==Ax } // divide by zero == ∞, only blue?\n}\n\nfcn pointInPoly(point, polygon){ // --> Bool, polygon is ( (a,b),(c,d).. )\n polygon.filter('wrap([(ab,cd)]){ a,b:=ab; c,d:=cd;\n if(b<=d) rayHitsSeg(point,ab,cd); // left point has smallest y coordinate\n else rayHitsSeg(point,cd,ab);\n })\n .len().isOdd; // True if crossed an odd number of borders ie inside polygon\n}\n","language":"Zkl"},{"code":"polys:=T( //(name,( ((a,b),(c,d)),((a,b),(c,d))... ), ... )==(nm,(ln,ln..) ..)\n T(\"squared\",\n\tT(T(T( 0.0, 0.0), T(10.0, 0.0)),\n\t T(T(10.0, 0.0), T(10.0, 10.0)),\n\t T(T(10.0, 10.0), T( 0.0, 10.0)),\n\t T(T( 0.0, 10.0), T( 0.0, 0.0)))),\n T(\"squaredhole\",\n\tT(T(T( 0.0, 0.0), T(10.0, 0.0)),\n\t T(T(10.0, 0.0), T(10.0, 10.0)),\n\t T(T(10.0, 10.0), T( 0.0, 10.0)),\n\t T(T( 0.0, 10.0), T( 0.0, 0.0)),\n\t T(T( 2.5, 2.5), T( 7.5, 2.5)),\n\t T(T( 7.5, 2.5), T( 7.5, 7.5)),\n\t T(T( 7.5, 7.5), T( 2.5, 7.5)),\n\t T(T( 2.5, 7.5), T( 2.5, 2.5)))),\n T(\"strange\",\n\tT(T(T( 0.0, 0.0), T( 2.5, 2.5)),\n\t T(T( 2.5, 2.5), T( 0.0, 10.0)),\n\t T(T( 0.0, 10.0), T( 2.5, 7.5)),\n\t T(T( 2.5, 7.5), T( 7.5, 7.5)),\n\t T(T( 7.5, 7.5), T(10.0, 10.0)),\n\t T(T(10.0, 10.0), T(10.0, 0.0)),\n\t T(T(10.0, 0.0), T( 2.5, 2.5)),\n\t T(T( 2.5, 2.5), T( 0.0, 0.0)))), # conjecturally close polygon\n T(\"exagon\",\n\tT(T(T( 3.0, 0.0), T( 7.0, 0.0)),\n\t T(T( 7.0, 0.0), T(10.0, 5.0)),\n\t T(T(10.0, 5.0), T( 7.0, 10.0)),\n\t T(T( 7.0, 10.0), T( 3.0, 10.0)),\n\t T(T( 3.0, 10.0), T( 0.0, 5.0)),\n\t T(T( 0.0, 5.0), T( 3.0, 0.0)))),\n);\n\ntestPoints:=T(\n\t T( 5.0, 5.0),\n\t T( 5.0, 8.0),\n\t T(-10.0, 5.0),\n\t T( 0.0, 5.0),\n\t T( 10.0, 5.0),\n\t T( 8.0, 5.0),\n\t T( 10.0, 10.0)\n);\n\nforeach name,polywanna in (polys){\n name.println();\n foreach testPoint in (testPoints){\n println(\"\\t(%6.1f,%6.1f)\\t\".fmt(testPoint.xplode()),\n pointInPoly(testPoint,polywanna) and \"IN\" or \"OUT\");\n }\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Ray-casting_algorithm\\nnote: Classic CS problems and programs\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"<br>\\nGiven a point and a polygon, check if the point is inside or outside the polygon using the [[wp:Point in polygon#Ray casting algorithm|ray-casting algorithm]].\\n\\nA pseudocode can be simply:\\n\\n count ← 0\\n '''foreach''' side '''in''' polygon:\\n '''if''' ray_intersects_segment(P,side) '''then'''\\n count ← count + 1\\n '''if''' ''is_odd''(count) '''then'''\\n '''return''' inside\\n '''else'''\\n '''return''' outside\\n\\nWhere the function <tt>ray_intersects_segment</tt> return true if the horizontal ray starting from the point P intersects the side (segment), false otherwise.\\n\\nAn intuitive explanation of why it works is that every time we cross\\na border, we change \\\"country\\\" (inside-outside, or outside-inside), but\\nthe last \\\"country\\\" we land on is surely ''outside'' (since the inside of the polygon is finite, while the ray continues towards infinity). So, if we crossed an odd number of borders we were surely inside, otherwise we were outside; we can follow the ray backward to see it better: starting from outside, only an odd number of crossing can give an ''inside'': outside-inside, outside-inside-outside-inside, and so on (the - represents the crossing of a border).\\n\\nSo the main part of the algorithm is how we determine if a ray intersects a segment. The following text explain one of the possible ways.\\n\\n[[Image:intersect.png|200px|thumb|right]]\\nLooking at the image on the right, we can easily be convinced of the fact that rays starting from points in the hatched area (like P<sub>1</sub> and P<sub>2</sub>) surely do not intersect the segment AB. We also can easily see that rays starting from points in the greenish area surely intersect the segment AB (like point P<sub>3</sub>).\\n\\nSo the problematic points are those inside the white area (the box delimited by the points A and B), like P<sub>4</sub>.\\n\\n[[Image:posslope.png|128px|thumb|right]]\\n[[Image:negslope.png|128px|thumb|right]]\\n\\nLet us take into account a segment AB (the point A having y coordinate always smaller than B's y coordinate, i.e. point A is always below point B) and a point P. Let us use the cumbersome notation PAX to denote the angle between segment AP and AX, where X is always a point on the horizontal line passing by A with x coordinate bigger than the maximum between the x coordinate of A and the x coordinate of B. As explained graphically by the figures on the right, if PAX is greater than the angle BAX, then the ray starting from P intersects the segment AB. (In the images, the ray starting from P<sub>A</sub> does not intersect the segment, while the ray starting from P<sub>B</sub> in the second picture, intersects the segment).\\n\\nPoints on the boundary or \\\"on\\\" a vertex are someway special and through this approach we do not obtain ''coherent'' results. They could be treated apart, but it is not necessary to do so.\\n\\nAn algorithm for the previous speech could be (if P is a point, Px is its x coordinate):\\n\\n '''ray_intersects_segment''':\\n P : the point from which the ray starts\\n A : the end-point of the segment with the smallest y coordinate\\n (A must be \\\"below\\\" B)\\n B : the end-point of the segment with the greatest y coordinate\\n (B must be \\\"above\\\" A)\\n '''if''' Py = Ay '''or''' Py = By '''then'''\\n Py ← Py + ε\\n '''end''' '''if'''\\n '''if''' Py < Ay '''or''' Py > By '''then''' \\n '''return''' false\\n '''else''' '''if''' Px >= max(Ax, Bx) '''then''' \\n '''return''' false\\n '''else'''\\n '''if''' Px < min(Ax, Bx) '''then'''\\n '''return''' true\\n '''else'''\\n '''if''' Ax ≠ Bx '''then'''\\n m_red ← (By - Ay)/(Bx - Ax)\\n '''else'''\\n m_red ← ∞\\n '''end''' '''if'''\\n '''if''' Ax ≠ Px '''then'''\\n m_blue ← (Py - Ay)/(Px - Ax)\\n '''else'''\\n m_blue ← ∞\\n '''end''' '''if'''\\n '''if''' m_blue ≥ m_red '''then'''\\n '''return''' true\\n '''else'''\\n '''return''' false\\n '''end''' '''if'''\\n '''end''' '''if'''\\n '''end''' '''if'''\\n\\n(To avoid the \\\"ray on vertex\\\" problem, the point is moved upward of a small quantity <big>ε</big>.)\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"T Pt\\n Float x, y\\n\\n F (x, y)\\n .x = x\\n .y = y\\n\\n F String()\\n R ‘Pt(x=#., y=#.)’.format(.x, .y)\\n\\nT Edge\\n Pt a, b\\n\\n F (a, b)\\n .a = a\\n .b = b\\n\\n F String()\\n R ‘Edge(a=#., b=#.)’.format(.a, .b)\\n\\nT Poly\\n String name\\n [Edge] edges\\n\\n F (name, edges)\\n .name = name\\n .edges = edges\\n\\nV _eps = 0.00001\\nV _huge = 1e+100\\nV _tiny = 1e-100\\n\\nF rayintersectseg(=p, edge)\\n V a = edge.a\\n V b = edge.b\\n I a.y > b.y\\n swap(&a, &b)\\n I p.y == a.y | p.y == b.y\\n p = Pt(p.x, p.y + :_eps)\\n\\n V intersect = 0B\\n\\n I (p.y > b.y | p.y < a.y) | (p.x > max(a.x, b.x))\\n R 0B\\n\\n I p.x < min(a.x, b.x)\\n intersect = 1B\\n E\\n Float m_red, m_blue\\n I abs(a.x - b.x) > :_tiny\\n m_red = (b.y - a.y) / Float(b.x - a.x)\\n E\\n m_red = :_huge\\n I abs(a.x - p.x) > :_tiny\\n m_blue = (p.y - a.y) / Float(p.x - a.x)\\n E\\n m_blue = :_huge\\n intersect = m_blue >= m_red\\n R intersect\\n\\nF ispointinside(p, poly)\\n R sum(poly.edges.map(edge -> Int(rayintersectseg(@p, edge)))) % 2 == 1\\n\\nF polypp(poly)\\n print(\\\"\\\\n Polygon(name='#.', edges=(\\\".format(poly.name))\\n print(‘ ’(poly.edges.map(e -> String(e)).join(\\\",\\\\n \\\")\\\"\\\\n ))\\\"))\\n\\nV polys = [\\n Poly(name' ‘square’, edges' [Edge(Pt(0, 0), Pt(10, 0)), Edge(Pt(10, 0), Pt(10, 10)), Edge(Pt(10, 10), Pt(0, 10)), Edge(Pt(0, 10), Pt(0, 0))]),\\n Poly(name' ‘square_hole’, edges' [Edge(Pt(0, 0), Pt(10, 0)), Edge(Pt(10, 0), Pt(10, 10)), Edge(Pt(10, 10), Pt(0, 10)), Edge(Pt(0, 10), Pt(0, 0)), Edge(Pt(2.5, 2.5), Pt(7.5, 2.5)), Edge(Pt(7.5, 2.5), Pt(7.5, 7.5)), Edge(Pt(7.5, 7.5), Pt(2.5, 7.5)), Edge(Pt(2.5, 7.5), Pt(2.5, 2.5))]),\\n Poly(name' ‘strange’, edges' [Edge(Pt(0, 0), Pt(2.5, 2.5)), Edge(Pt(2.5, 2.5), Pt(0, 10)), Edge(Pt(0, 10), Pt(2.5, 7.5)), Edge(Pt(2.5, 7.5), Pt(7.5, 7.5)), Edge(Pt(7.5, 7.5), Pt(10, 10)), Edge(Pt(10, 10), Pt(10, 0)), Edge(Pt(10, 0), Pt(2.5, 2.5))]),\\n Poly(name' ‘exagon’, edges' [Edge(Pt(3, 0), Pt(7, 0)), Edge(Pt(7, 0), Pt(10, 5)), Edge(Pt(10, 5), Pt(7, 10)), Edge(Pt(7, 10), Pt(3, 10)), Edge(Pt(3, 10), Pt(0, 5)), Edge(Pt(0, 5), Pt(3, 0))])]\\n\\nV testpoints = [Pt(5, 5), Pt(5, 8),\\n Pt(-10, 5), Pt(0, 5),\\n Pt(10, 5), Pt(8, 5),\\n Pt(10, 10)]\\n\\nprint(\\\"\\\\n TESTING WHETHER POINTS ARE WITHIN POLYGONS\\\")\\nL(poly) polys\\n polypp(poly)\\n print(‘ ’testpoints[0.<3].map(p -> ‘#.: #.’.format(p, I ispointinside(p, @poly) {‘True’} E ‘False’)).join(\\\"\\\\t\\\"))\\n print(‘ ’testpoints[3.<6].map(p -> ‘#.: #.’.format(p, I ispointinside(p, @poly) {‘True’} E ‘False’)).join(\\\"\\\\t\\\"))\\n print(‘ ’testpoints[6.. ].map(p -> ‘#.: #.’.format(p, I ispointinside(p, @poly) {‘True’} E ‘False’)).join(\\\"\\\\t\\\"))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"package Polygons is\\n\\n type Point is record\\n X, Y : Float;\\n end record;\\n type Point_List is array (Positive range <>) of Point;\\n subtype Segment is Point_List (1 .. 2);\\n type Polygon is array (Positive range <>) of Segment;\\n\\n function Create_Polygon (List : Point_List) return Polygon;\\n\\n function Is_Inside (Who : Point; Where : Polygon) return Boolean;\\n\\nend Polygons;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package body Polygons is\\n EPSILON : constant := 0.00001;\\n\\n function Ray_Intersects_Segment\\n (Who : Point;\\n Where : Segment)\\n return Boolean\\n is\\n The_Point : Point := Who;\\n Above : Point;\\n Below : Point;\\n M_Red : Float;\\n Red_Is_Infinity : Boolean := False;\\n M_Blue : Float;\\n Blue_Is_Infinity : Boolean := False;\\n begin\\n if Where (1).Y < Where (2).Y then\\n Above := Where (2);\\n Below := Where (1);\\n else\\n Above := Where (1);\\n Below := Where (2);\\n end if;\\n if The_Point.Y = Above.Y or The_Point.Y = Below.Y then\\n The_Point.Y := The_Point.Y + EPSILON;\\n end if;\\n if The_Point.Y < Below.Y or The_Point.Y > Above.Y then\\n return False;\\n elsif The_Point.X > Above.X and The_Point.X > Below.X then\\n return False;\\n elsif The_Point.X < Above.X and The_Point.X < Below.X then\\n return True;\\n else\\n if Above.X /= Below.X then\\n M_Red := (Above.Y - Below.Y) / (Above.X - Below.X);\\n else\\n Red_Is_Infinity := True;\\n end if;\\n if Below.X /= The_Point.X then\\n M_Blue := (The_Point.Y - Below.Y) / (The_Point.X - Below.X);\\n else\\n Blue_Is_Infinity := True;\\n end if;\\n if Blue_Is_Infinity then\\n return True;\\n elsif Red_Is_Infinity then\\n return False;\\n elsif M_Blue >= M_Red then\\n return True;\\n else\\n return False;\\n end if;\\n end if;\\n end Ray_Intersects_Segment;\\n\\n function Create_Polygon (List : Point_List) return Polygon is\\n Result : Polygon (List'Range);\\n Side : Segment;\\n begin\\n for I in List'Range loop\\n Side (1) := List (I);\\n if I = List'Last then\\n Side (2) := List (List'First);\\n else\\n Side (2) := List (I + 1);\\n end if;\\n Result (I) := Side;\\n end loop;\\n return Result;\\n end Create_Polygon;\\n\\n function Is_Inside (Who : Point; Where : Polygon) return Boolean is\\n Count : Natural := 0;\\n begin\\n for Side in Where'Range loop\\n if Ray_Intersects_Segment (Who, Where (Side)) then\\n Count := Count + 1;\\n end if;\\n end loop;\\n if Count mod 2 = 0 then\\n return False;\\n else\\n return True;\\n end if;\\n end Is_Inside;\\n\\nend Polygons;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\nwith Polygons;\\nprocedure Main is\\n package Float_IO is new Ada.Text_IO.Float_IO (Float);\\n Test_Points : Polygons.Point_List :=\\n (( 5.0, 5.0),\\n ( 5.0, 8.0),\\n (-10.0, 5.0),\\n ( 0.0, 5.0),\\n ( 10.0, 5.0),\\n ( 8.0, 5.0),\\n ( 10.0, 10.0));\\n Square : Polygons.Polygon :=\\n ((( 0.0, 0.0), (10.0, 0.0)),\\n ((10.0, 0.0), (10.0, 10.0)),\\n ((10.0, 10.0), ( 0.0, 10.0)),\\n (( 0.0, 10.0), ( 0.0, 0.0)));\\n Square_Hole : Polygons.Polygon :=\\n ((( 0.0, 0.0), (10.0, 0.0)),\\n ((10.0, 0.0), (10.0, 10.0)),\\n ((10.0, 10.0), ( 0.0, 10.0)),\\n (( 0.0, 10.0), ( 0.0, 0.0)),\\n (( 2.5, 2.5), ( 7.5, 2.5)),\\n (( 7.5, 2.5), ( 7.5, 7.5)),\\n (( 7.5, 7.5), ( 2.5, 7.5)),\\n (( 2.5, 7.5), ( 2.5, 2.5)));\\n Strange : Polygons.Polygon :=\\n ((( 0.0, 0.0), ( 2.5, 2.5)),\\n (( 2.5, 2.5), ( 0.0, 10.0)),\\n (( 0.0, 10.0), ( 2.5, 7.5)),\\n (( 2.5, 7.5), ( 7.5, 7.5)),\\n (( 7.5, 7.5), (10.0, 10.0)),\\n ((10.0, 10.0), (10.0, 0.0)),\\n ((10.0, 0.0), ( 2.5, 2.5)));\\n Exagon : Polygons.Polygon :=\\n ((( 3.0, 0.0), ( 7.0, 0.0)),\\n (( 7.0, 0.0), (10.0, 5.0)),\\n ((10.0, 5.0), ( 7.0, 10.0)),\\n (( 7.0, 10.0), ( 3.0, 10.0)),\\n (( 3.0, 10.0), ( 0.0, 5.0)),\\n (( 0.0, 5.0), ( 3.0, 0.0)));\\nbegin\\n Ada.Text_IO.Put_Line (\\\"Testing Square:\\\");\\n for Point in Test_Points'Range loop\\n Ada.Text_IO.Put (\\\"Point(\\\");\\n Float_IO.Put (Test_Points (Point).X, 0, 0, 0);\\n Ada.Text_IO.Put (\\\",\\\");\\n Float_IO.Put (Test_Points (Point).Y, 0, 0, 0);\\n Ada.Text_IO.Put\\n (\\\"): \\\" &\\n Boolean'Image (Polygons.Is_Inside (Test_Points (Point), Square)));\\n Ada.Text_IO.New_Line;\\n end loop;\\n Ada.Text_IO.New_Line;\\n Ada.Text_IO.Put_Line (\\\"Testing Square_Hole:\\\");\\n for Point in Test_Points'Range loop\\n Ada.Text_IO.Put (\\\"Point(\\\");\\n Float_IO.Put (Test_Points (Point).X, 0, 0, 0);\\n Ada.Text_IO.Put (\\\",\\\");\\n Float_IO.Put (Test_Points (Point).Y, 0, 0, 0);\\n Ada.Text_IO.Put\\n (\\\"): \\\" &\\n Boolean'Image\\n (Polygons.Is_Inside (Test_Points (Point), Square_Hole)));\\n Ada.Text_IO.New_Line;\\n end loop;\\n Ada.Text_IO.New_Line;\\n Ada.Text_IO.Put_Line (\\\"Testing Strange:\\\");\\n for Point in Test_Points'Range loop\\n Ada.Text_IO.Put (\\\"Point(\\\");\\n Float_IO.Put (Test_Points (Point).X, 0, 0, 0);\\n Ada.Text_IO.Put (\\\",\\\");\\n Float_IO.Put (Test_Points (Point).Y, 0, 0, 0);\\n Ada.Text_IO.Put\\n (\\\"): \\\" &\\n Boolean'Image (Polygons.Is_Inside (Test_Points (Point), Strange)));\\n Ada.Text_IO.New_Line;\\n end loop;\\n Ada.Text_IO.New_Line;\\n Ada.Text_IO.Put_Line (\\\"Testing Exagon:\\\");\\n for Point in Test_Points'Range loop\\n Ada.Text_IO.Put (\\\"Point(\\\");\\n Float_IO.Put (Test_Points (Point).X, 0, 0, 0);\\n Ada.Text_IO.Put (\\\",\\\");\\n Float_IO.Put (Test_Points (Point).Y, 0, 0, 0);\\n Ada.Text_IO.Put\\n (\\\"): \\\" &\\n Boolean'Image (Polygons.Is_Inside (Test_Points (Point), Exagon)));\\n Ada.Text_IO.New_Line;\\n end loop;\\nend Main;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"BEGIN\\n\\nMODE POINT = STRUCT( REAL x, y );\\n\\nMODE POLYGON = STRUCT( STRING name, FLEX[ 1 : 0 ]POINT points );\\nPROC contains = ( POLYGON self, POINT p )BOOL:\\n BEGIN\\n BOOL odd := FALSE, REAL eps = 1e-9;\\n PROC rayseg = ( POINT p in, a in, b in )BOOL:\\n BEGIN\\n PROC max = ( REAL m, n )REAL: IF m > n THEN m ELSE n FI;\\n PROC min = ( REAL m, n )REAL: IF m < n THEN m ELSE n FI;\\n POINT p := p in, a := a in, b := b in;\\n IF y OF a > y OF b THEN POINT t = a; a := b; b := t FI;\\n IF y OF p = y OF a OR y OF p = y OF b THEN y OF p+:= eps FI;\\n IF y OF p < y OF a OR y OF p > y OF b OR x OF p > max( x OF a, x OF b )\\n THEN FALSE\\n ELIF x OF p < min( x OF a, x OF b )\\n THEN TRUE\\n ELSE\\n REAL red = IF x OF a = x OF b THEN max real ELSE ( y OF b - y OF a ) / ( x OF b - x OF a ) FI;\\n REAL blu = IF x OF a = x OF p THEN max real ELSE ( y OF p - y OF a ) / ( x OF p - x OF a ) FI;\\n blu >= red\\n FI\\n END # rayseq # ;\\n\\n INT len points = ( UPB points OF self - LWB points OF self ) + 1;\\n FOR i FROM LWB points OF self TO UPB points OF self DO\\n POINT a = ( points OF self )[ i ];\\n POINT b = ( points OF self )[ ( i MOD len points ) + 1 ];\\n IF rayseg( p, a, b ) THEN odd := NOT odd FI\\n OD;\\n odd\\n END # contains # ;\\n\\n[]POLYGON polygons =\\n ( ( \\\"square\\\"\\n , ( ( 0, 0 ), ( 10, 0 ), ( 10, 10 ), ( 0, 10 ) )\\n )\\n , ( \\\"squarehole\\\"\\n , ( ( 0, 0 ), ( 10, 0 ), ( 10, 10 ), ( 0, 10 ), ( 2.5, 2.5 ), ( 7.5, 2.5 ), ( 7.5, 7.5 ), ( 2.5, 7.5 ) )\\n )\\n , ( \\\"strange\\\"\\n , ( ( 0, 0 ), ( 2.5, 2.5 ), ( 0, 10 ), ( 2.5, 7.5 ), ( 7.5, 7.5 ), ( 10, 10 ), ( 10, 0 ), ( 2.5, 2.5 ) )\\n )\\n , ( \\\"hexagon\\\"\\n , ( ( 3, 0 ), ( 7, 0 ), ( 10, 5 ), ( 7, 10 ), ( 3, 10 ), ( 0, 5 ) )\\n )\\n );\\n[]POINT points = ( ( 5, 5 ), (5 , 8 ), ( -10, 5 ), ( 0, 5 ), ( 10, 5 ), ( 8, 5 ), ( 10, 10 ) );\\n\\nFOR p FROM LWB polygons TO UPB polygons DO\\n POLYGON poly = polygons[ p ];\\n print(( \\\"Does '\\\", name OF poly, \\\"' contain the point..\\\", newline ) );\\n FOR i FROM LWB points TO UPB points DO\\n POINT pt = points[ i ];\\n print( ( \\\" ( \\\", fixed( x OF pt, -5, 1 ), \\\", \\\", fixed( y OF pt, -5, 1 ), \\\" ) \\\" ) );\\n print( ( IF contains( poly, pt ) THEN \\\" true\\\" ELSE \\\" false\\\" FI, newline ) )\\n OD;\\n print( ( newline ) )\\nOD\\n\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"1000 PUBLIC NUMERIC x,y\\n1010 LET x=1\\n1020 LET y=2\\n1030 !\\n1040 DEF isLeft2(L(,),p()) = -SGN( (L(1,x)-L(2,x))*(p(y)-L(2,y)) - (p(x)-L(2,x))*(L(1,y)-L(2,y)))\\n1050 !\\n1060 FUNCTION inpolygon(p1(,),p2())\\n1070 LET k=UBOUND(p1,1)+1\\n1080 DIM send (1 TO 2,2)\\n1090 LET wn=0\\n1100 FOR n=1 TO UBOUND(p1,1)\\n1110 LET index=MOD(n, k)\\n1120 LET nextindex=MOD(n+1, k)\\n1130 IF nextindex=0 THEN LET nextindex=1\\n1140 LET send(1,x)=p1(index,x)\\n1150 LET send(2,x)=p1(nextindex,x)\\n1160 LET send(1,y)=p1(index,y)\\n1170 LET send(2,y)=p1(nextindex,y)\\n1180 IF p1(index,y)<=p2(y) THEN\\n1190 IF p1(nextindex,y)>p2(y) THEN\\n1200 IF isleft2(send,p2)>=0 THEN !'=\\n1210 LET wn=wn+1\\n1220 END IF\\n1230 END IF\\n1240 ELSE\\n1250 IF p1(nextindex,y)<=p2(y) THEN\\n1260 IF isleft2(send,p2)<=0 THEN !'=\\n1270 LET wn=wn-1\\n1280 END IF\\n1290 END IF\\n1300 END IF\\n1310 NEXT n\\n1320 LET inpolygon = wn\\n1330 END FUNCTION\\n1340 !\\n1350 DIM type(1 TO 2)\\n1360 !\\n1370 DIM square(4,2)\\n1380 MAT READ square\\n1390 DATA 0,0,10,0,10,10,0,10\\n1400 !\\n1410 DIM hole(4,2)\\n1420 MAT READ hole\\n1430 DATA 2.5,2.5,7.5,2.5,7.5,7.5,2.5,7.5\\n1440 !\\n1450 DIM strange(8,2)\\n1460 MAT READ strange\\n1470 DATA 0,0,2.5,2.5,0,10,2.5,7.5,7.5,7.5,10,10,10,0,2.5,2.5\\n1480 !\\n1490 DIM exagon(6,2)\\n1500 MAT READ exagon\\n1510 DATA 3,0,7,0,10,5,7,10,3,10,0,5\\n1520 !\\n1530 ! printouts\\n1540 FOR z=1 TO 4\\n1550 SELECT CASE z\\n1560 CASE 1\\n1570 PRINT \\\"squared\\\"\\n1580 PRINT \\\"(5,5) \\\";TAB(12);\\n1590 MAT READ type\\n1600 DATA 5,5\\n1610 IF inpolygon(square,type) <> 0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n1620 MAT READ type\\n1630 DATA 5,8\\n1640 PRINT \\\"(5,8) \\\";TAB(12);\\n1650 IF inpolygon(square,type) <> 0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n1660 PRINT \\\"(-10,5) \\\";TAB(12);\\n1670 MAT READ type\\n1680 DATA -10,5\\n1690 IF inpolygon(square,type) <> 0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n1700 Print \\\"(0,5) \\\";Tab(12);\\n1710 MAT READ type\\n1720 DATA 0,5\\n1730 IF inpolygon(square,type) <> 0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n1740 Print \\\"(10,5) \\\";Tab(12);\\n1750 MAT READ type\\n1760 DATA 10,5\\n1770 IF inpolygon(square,type) <> 0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n1780 PRINT \\\"(8,5) \\\";TAB(12);\\n1790 MAT READ type\\n1800 DATA 8,5\\n1810 IF inpolygon(square,Type) <> 0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n1820 PRINT \\\"(10,10) \\\";TAB(12);\\n1830 MAT READ type\\n1840 DATA 10,10\\n1850 IF inpolygon(square,Type) <> 0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n1860 PRINT\\n1870 CASE 2\\n1880 PRINT \\\"squared hole\\\"\\n1890 PRINT \\\"(5,5) \\\";TAB(12);\\n1900 MAT READ type\\n1910 DATA 5,5\\n1920 IF NOT inpolygon(hole,Type)<>0 AND inpolygon(square,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n1930 Print \\\"(5,8) \\\";Tab(12);\\n1940 MAT READ type\\n1950 DATA 5,8\\n1960 IF NOT inpolygon(hole,Type)<>0 AND inpolygon(square,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n1970 PRINT \\\"(-10,5) \\\";TAB(12);\\n1980 MAT READ type\\n1990 DATA -10,5\\n2000 IF NOT inpolygon(hole,Type)<>0 AND inpolygon(square,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2010 PRINT \\\"(0,5) \\\";TAB(12);\\n2020 MAT READ type\\n2030 DATA 0,5\\n2040 IF NOT inpolygon(hole,Type)<>0 AND inpolygon(square,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2050 PRINT \\\"(10,5) \\\";TAB(12);\\n2060 MAT READ type\\n2070 DATA 10,5\\n2080 IF NOT inpolygon(hole,Type)<>0 AND inpolygon(square,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2090 PRINT \\\"(8,5) \\\";TAB(12);\\n2100 MAT READ type\\n2110 DATA 8,5\\n2120 IF NOT inpolygon(hole,Type)<>0 AND inpolygon(square,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2130 PRINT \\\"(10,10) \\\";TAB(12);\\n2140 MAT READ type\\n2150 DATA 10,10\\n2160 IF NOT inpolygon(hole,Type)<>0 AND inpolygon(square,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2170 PRINT\\n2180 CASE 3\\n2190 PRINT \\\"strange\\\"\\n2200 PRINT \\\"(5,5) \\\";TAB(12);\\n2210 MAT READ type\\n2220 DATA 5,5\\n2230 IF inpolygon(strange,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2240 PRINT \\\"(5,8) \\\";TAB(12);\\n2250 MAT READ type\\n2260 DATA 5,8\\n2270 IF inpolygon(strange,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2280 PRINT \\\"(-10,5) \\\";TAB(12);\\n2290 MAT READ type\\n2300 DATA -10,5\\n2310 IF inpolygon(strange,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2320 PRINT \\\"(0,5) \\\";TAB(12);\\n2330 MAT READ type\\n2340 DATA 0,5\\n2350 IF inpolygon(strange,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2360 PRINT \\\"(10,5) \\\";TAB(12);\\n2370 MAT READ type\\n2380 DATA 10,5\\n2390 IF inpolygon(strange,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2400 PRINT \\\"(8,5) \\\";TAB(12);\\n2410 MAT READ type\\n2420 DATA 8,5\\n2430 IF inpolygon(strange,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2440 PRINT \\\"(10,10) \\\";TAB(12);\\n2450 MAT READ type\\n2460 DATA 10,10\\n2470 IF inpolygon(strange,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2480 PRINT\\n2490 CASE 4\\n2500 PRINT \\\"exagon\\\"\\n2510 PRINT \\\"(5,5) \\\";TAB(12);\\n2520 MAT READ type\\n2530 DATA 5,5\\n2540 IF inpolygon(exagon,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2550 PRINT \\\"(5,8) \\\";TAB(12);\\n2560 MAT READ type\\n2570 DATA 5,8\\n2580 IF inpolygon(exagon,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2590 PRINT \\\"(-10,5) \\\";TAB(12);\\n2600 MAT READ type\\n2610 DATA -10,5\\n2620 IF inpolygon(exagon,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2630 PRINT \\\"(0,5) \\\";TAB(12);\\n2640 MAT READ type\\n2650 DATA 0,5\\n2660 IF inpolygon(exagon,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2670 PRINT \\\"(10,5) \\\";TAB(12);\\n2680 MAT READ type\\n2690 DATA 10,5\\n2700 IF inpolygon(exagon,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2710 PRINT \\\"(8,5) \\\";TAB(12);\\n2720 MAT READ type\\n2730 DATA 8,5\\n2740 IF inpolygon(exagon,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2750 PRINT \\\"(10,10) \\\";TAB(12);\\n2760 MAT READ type\\n2770 DATA 10,10\\n2780 IF inpolygon(exagon,Type)<>0 THEN PRINT \\\"in\\\" ELSE PRINT \\\"out\\\"\\n2790 PRINT\\n2800 END SELECT\\n2810 NEXT z\\n2820 END\\n\",\n \"language\": \"ANSI-BASIC\"\n },\n {\n \"code\": \"Points :=[{x: 5.0, y: 5.0}\\n\\t\\t, {x: 5.0, y: 8.0}\\n\\t\\t, {x:-10.0, y: 5.0}\\n\\t\\t, {x: 0.0, y: 5.0}\\n\\t\\t, {x: 10.0, y: 5.0}\\n\\t\\t, {x: 8.0, y: 5.0}\\n\\t\\t, {x: 10.0, y:10.0}]\\nSquare :=[{x: 0.0, y: 0.0}, {x:10.0, y: 0.0}\\n\\t\\t, {x:10.0, y: 0.0}, {x:10.0, y:10.0}\\n\\t\\t, {x:10.0, y:10.0}, {x: 0.0, y:10.0}\\n\\t\\t, {x: 0.0, y:10.0}, {x: 0.0, y: 0.0}]\\nSq_Hole:=[{x: 0.0, y: 0.0}, {x:10.0, y: 0.0}\\n\\t\\t, {x:10.0, y: 0.0}, {x:10.0, y:10.0}\\n\\t\\t, {x:10.0, y:10.0}, {x: 0.0, y:10.0}\\n\\t\\t, {x: 0.0, y:10.0}, {x: 0.0, y: 0.0}\\n\\t\\t, {x: 2.5, y: 2.5}, {x: 7.5, y: 2.5}\\n\\t\\t, {x: 7.5, y: 2.5}, {x: 7.5, y: 7.5}\\n\\t\\t, {x: 7.5, y: 7.5}, {x: 2.5, y: 7.5}\\n\\t\\t, {x: 2.5, y: 7.5}, {x: 2.5, y: 2.5}]\\nStrange:=[{x: 0.0, y: 0.0}, {x: 2.5, y: 2.5}\\n\\t\\t, {x: 2.5, y: 2.5}, {x: 0.0, y:10.0}\\n\\t\\t, {x: 0.0, y:10.0}, {x: 2.5, y: 7.5}\\n\\t\\t, {x: 2.5, y: 7.5}, {x: 7.5, y: 7.5}\\n\\t\\t, {x: 7.5, y: 7.5}, {x:10.0, y:10.0}\\n\\t\\t, {x:10.0, y:10.0}, {x:10.0, y: 0.0}\\n\\t\\t, {x:10.0, y: 0.0}, {x: 2.5, y: 2.5}]\\nExagon :=[{x: 3.0, y: 0.0}, {x: 7.0, y: 0.0}\\n\\t\\t, {x: 7.0, y: 0.0}, {x:10.0, y: 5.0}\\n\\t\\t, {x:10.0, y: 5.0}, {x: 7.0, y:10.0}\\n\\t\\t, {x: 7.0, y:10.0}, {x: 3.0, y:10.0}\\n\\t\\t, {x: 3.0, y:10.0}, {x: 0.0, y: 5.0}\\n\\t\\t, {x: 0.0, y: 5.0}, {x: 3.0, y: 0.0}]\\nPolygons := {\\\"Square\\\":Square, \\\"Sq_Hole\\\":Sq_Hole, \\\"Strange\\\":Strange, \\\"Exagon\\\":Exagon}\\nFor j, Poly in Polygons\\n\\tFor i, Point in Points\\n\\t\\tIf (point_in_polygon(Point,Poly))\\n\\t\\t\\ts.= j \\\" does contain point \\\" i \\\"`n\\\"\\n\\t\\tElse\\n\\t\\t\\ts.= j \\\" doesn't contain point \\\" i \\\"`n\\\"\\nMsgbox %s%\\n\\npoint_in_polygon(Point,Poly) {\\n\\tn:=Poly.MaxIndex()\\n\\tcount:=0\\n\\tloop, %n% {\\n\\t\\tif (ray_intersects_segment(Point,Poly[A_Index],Poly[mod(A_Index,n)+1])) {\\n\\t\\t\\tcount++\\n\\t\\t}\\n\\t}\\n\\tif (mod(count,2)) { ; true = inside, false = outside\\n\\t\\treturn true\\t\\t; P is in the polygon\\n\\t} else {\\n\\t\\treturn false\\t; P isn't in the polygon\\n\\t}\\n}\\n\\nray_intersects_segment(P,A,B) {\\n\\t;P = the point from which the ray starts\\n\\t;A = the end-point of the segment with the smallest y coordinate\\n\\t;B = the end-point of the segment with the greatest y coordinate\\n\\tif (A.y > B.y) {\\n\\t\\ttemp:=A\\n\\t\\tA:=B\\n\\t\\tB:=temp\\n\\t}\\n\\tif (P.y = A.y or P.y = B.y) {\\n\\t\\tP.y += 0.000001\\n\\t}\\n\\tif (P.y < A.y or P.y > B.y) {\\n\\t\\treturn false\\n\\t} else if (P.x > A.x && P.x > B.x) {\\n\\t\\treturn false\\n\\t} else {\\n\\t\\tif (P.x < A.x && P.x < B.x) {\\n\\t\\t\\treturn true\\n\\t\\t} else {\\n\\t\\t\\tif (A.x != B.x) {\\n\\t\\t\\t\\tm_red := (B.y - A.y)/(B.x - A.x)\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tm_red := \\\"inf\\\"\\n\\t\\t\\t}\\n\\t\\t\\tif (A.x != P.x) {\\n\\t\\t\\t\\tm_blue := (P.y - A.y)/(P.x - A.x)\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tm_blue := \\\"inf\\\"\\n\\t\\t\\t}\\n\\t\\t\\tif (m_blue >= m_red) {\\n\\t\\t\\t\\treturn true\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn false\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <math.h>\\n\\ntypedef struct { double x, y; } vec;\\ntypedef struct { int n; vec* v; } polygon_t, *polygon;\\n\\n#define BIN_V(op, xx, yy) vec v##op(vec a,vec b){vec c;c.x=xx;c.y=yy;return c;}\\n#define BIN_S(op, r) double v##op(vec a, vec b){ return r; }\\nBIN_V(sub, a.x - b.x, a.y - b.y);\\nBIN_V(add, a.x + b.x, a.y + b.y);\\nBIN_S(dot, a.x * b.x + a.y * b.y);\\nBIN_S(cross, a.x * b.y - a.y * b.x);\\n\\n/* return a + s * b */\\nvec vmadd(vec a, double s, vec b)\\n{\\n\\tvec c;\\n\\tc.x = a.x + s * b.x;\\n\\tc.y = a.y + s * b.y;\\n\\treturn c;\\n}\\n\\n/* check if x0->x1 edge crosses y0->y1 edge. dx = x1 - x0, dy = y1 - y0, then\\n solve x0 + a * dx == y0 + b * dy with a, b in real\\n cross both sides with dx, then: (remember, cross product is a scalar)\\n\\tx0 X dx = y0 X dx + b * (dy X dx)\\n similarly,\\n\\tx0 X dy + a * (dx X dy) == y0 X dy\\n there is an intersection iff 0 <= a <= 1 and 0 <= b <= 1\\n\\n returns: 1 for intersect, -1 for not, 0 for hard to say (if the intersect\\n point is too close to y0 or y1)\\n*/\\nint intersect(vec x0, vec x1, vec y0, vec y1, double tol, vec *sect)\\n{\\n\\tvec dx = vsub(x1, x0), dy = vsub(y1, y0);\\n\\tdouble d = vcross(dy, dx), a;\\n\\tif (!d) return 0; /* edges are parallel */\\n\\n\\ta = (vcross(x0, dx) - vcross(y0, dx)) / d;\\n\\tif (sect)\\n\\t\\t*sect = vmadd(y0, a, dy);\\n\\n\\tif (a < -tol || a > 1 + tol) return -1;\\n\\tif (a < tol || a > 1 - tol) return 0;\\n\\n\\ta = (vcross(x0, dy) - vcross(y0, dy)) / d;\\n\\tif (a < 0 || a > 1) return -1;\\n\\n\\treturn 1;\\n}\\n\\n/* distance between x and nearest point on y0->y1 segment. if the point\\n lies outside the segment, returns infinity */\\ndouble dist(vec x, vec y0, vec y1, double tol)\\n{\\n\\tvec dy = vsub(y1, y0);\\n\\tvec x1, s;\\n\\tint r;\\n\\n\\tx1.x = x.x + dy.y; x1.y = x.y - dy.x;\\n\\tr = intersect(x, x1, y0, y1, tol, &s);\\n\\tif (r == -1) return HUGE_VAL;\\n\\ts = vsub(s, x);\\n\\treturn sqrt(vdot(s, s));\\n}\\n\\n#define for_v(i, z, p) for(i = 0, z = p->v; i < p->n; i++, z++)\\n/* returns 1 for inside, -1 for outside, 0 for on edge */\\nint inside(vec v, polygon p, double tol)\\n{\\n\\t/* should assert p->n > 1 */\\n\\tint i, k, crosses, intersectResult;\\n\\tvec *pv;\\n\\tdouble min_x, max_x, min_y, max_y;\\n\\n\\tfor (i = 0; i < p->n; i++) {\\n\\t\\tk = (i + 1) % p->n;\\n\\t\\tmin_x = dist(v, p->v[i], p->v[k], tol);\\n\\t\\tif (min_x < tol) return 0;\\n\\t}\\n\\n\\tmin_x = max_x = p->v[0].x;\\n\\tmin_y = max_y = p->v[1].y;\\n\\n\\t/* calculate extent of polygon */\\n\\tfor_v(i, pv, p) {\\n\\t\\tif (pv->x > max_x) max_x = pv->x;\\n\\t\\tif (pv->x < min_x) min_x = pv->x;\\n\\t\\tif (pv->y > max_y) max_y = pv->y;\\n\\t\\tif (pv->y < min_y) min_y = pv->y;\\n\\t}\\n\\tif (v.x < min_x || v.x > max_x || v.y < min_y || v.y > max_y)\\n\\t\\treturn -1;\\n\\n\\tmax_x -= min_x; max_x *= 2;\\n\\tmax_y -= min_y; max_y *= 2;\\n\\tmax_x += max_y;\\n\\n\\tvec e;\\n\\twhile (1) {\\n\\t\\tcrosses = 0;\\n\\t\\t/* pick a rand point far enough to be outside polygon */\\n\\t\\te.x = v.x + (1 + rand() / (RAND_MAX + 1.)) * max_x;\\n\\t\\te.y = v.y + (1 + rand() / (RAND_MAX + 1.)) * max_x;\\n\\n\\t\\tfor (i = 0; i < p->n; i++) {\\n\\t\\t\\tk = (i + 1) % p->n;\\n\\t\\t\\tintersectResult = intersect(v, e, p->v[i], p->v[k], tol, 0);\\n\\n\\t\\t\\t/* picked a bad point, ray got too close to vertex.\\n\\t\\t\\t re-pick */\\n\\t\\t\\tif (!intersectResult) break;\\n\\n\\t\\t\\tif (intersectResult == 1) crosses++;\\n\\t\\t}\\n\\t\\tif (i == p->n) break;\\n\\t}\\n\\treturn (crosses & 1) ? 1 : -1;\\n}\\n\\nint main()\\n{\\n\\tvec vsq[] = {\\t{0,0}, {10,0}, {10,10}, {0,10},\\n\\t\\t\\t{2.5,2.5}, {7.5,0.1}, {7.5,7.5}, {2.5,7.5}};\\n\\n\\tpolygon_t sq = { 4, vsq }, /* outer square */\\n\\t\\tsq_hole = { 8, vsq }; /* outer and inner square, ie hole */\\n\\n\\tvec c = { 10, 5 }; /* on edge */\\n\\tvec d = { 5, 5 };\\n\\n\\tprintf(\\\"%d\\\\n\\\", inside(c, &sq, 1e-10));\\n\\tprintf(\\\"%d\\\\n\\\", inside(c, &sq_hole, 1e-10));\\n\\n\\tprintf(\\\"%d\\\\n\\\", inside(d, &sq, 1e-10));\\t/* in */\\n\\tprintf(\\\"%d\\\\n\\\", inside(d, &sq_hole, 1e-10)); /* out (in the hole) */\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <cstdlib>\\n#include <iomanip>\\n#include <iostream>\\n#include <limits>\\n\\nusing namespace std;\\n\\nconst double epsilon = numeric_limits<float>().epsilon();\\nconst numeric_limits<double> DOUBLE;\\nconst double MIN = DOUBLE.min();\\nconst double MAX = DOUBLE.max();\\n\\nstruct Point { const double x, y; };\\n\\nstruct Edge {\\n const Point a, b;\\n\\n bool operator()(const Point& p) const\\n {\\n if (a.y > b.y) return Edge{ b, a }(p);\\n if (p.y == a.y || p.y == b.y) return operator()({ p.x, p.y + epsilon });\\n if (p.y > b.y || p.y < a.y || p.x > max(a.x, b.x)) return false;\\n if (p.x < min(a.x, b.x)) return true;\\n auto blue = abs(a.x - p.x) > MIN ? (p.y - a.y) / (p.x - a.x) : MAX;\\n auto red = abs(a.x - b.x) > MIN ? (b.y - a.y) / (b.x - a.x) : MAX;\\n return blue >= red;\\n }\\n};\\n\\nstruct Figure {\\n const string name;\\n const initializer_list<Edge> edges;\\n\\n bool contains(const Point& p) const\\n {\\n auto c = 0;\\n for (auto e : edges) if (e(p)) c++;\\n return c % 2 != 0;\\n }\\n\\n template<unsigned char W = 3>\\n void check(const initializer_list<Point>& points, ostream& os) const\\n {\\n os << \\\"Is point inside figure \\\" << name << '?' << endl;\\n for (auto p : points)\\n os << \\\" (\\\" << setw(W) << p.x << ',' << setw(W) << p.y << \\\"): \\\" << boolalpha << contains(p) << endl;\\n os << endl;\\n }\\n};\\n\\nint main()\\n{\\n const initializer_list<Point> points = { { 5.0, 5.0}, {5.0, 8.0}, {-10.0, 5.0}, {0.0, 5.0}, {10.0, 5.0}, {8.0, 5.0}, {10.0, 10.0} };\\n const Figure square = { \\\"Square\\\",\\n { {{0.0, 0.0}, {10.0, 0.0}}, {{10.0, 0.0}, {10.0, 10.0}}, {{10.0, 10.0}, {0.0, 10.0}}, {{0.0, 10.0}, {0.0, 0.0}} }\\n };\\n\\n const Figure square_hole = { \\\"Square hole\\\",\\n { {{0.0, 0.0}, {10.0, 0.0}}, {{10.0, 0.0}, {10.0, 10.0}}, {{10.0, 10.0}, {0.0, 10.0}}, {{0.0, 10.0}, {0.0, 0.0}},\\n {{2.5, 2.5}, {7.5, 2.5}}, {{7.5, 2.5}, {7.5, 7.5}}, {{7.5, 7.5}, {2.5, 7.5}}, {{2.5, 7.5}, {2.5, 2.5}}\\n }\\n };\\n\\n const Figure strange = { \\\"Strange\\\",\\n { {{0.0, 0.0}, {2.5, 2.5}}, {{2.5, 2.5}, {0.0, 10.0}}, {{0.0, 10.0}, {2.5, 7.5}}, {{2.5, 7.5}, {7.5, 7.5}},\\n {{7.5, 7.5}, {10.0, 10.0}}, {{10.0, 10.0}, {10.0, 0.0}}, {{10.0, 0}, {2.5, 2.5}}\\n }\\n };\\n\\n const Figure exagon = { \\\"Exagon\\\",\\n { {{3.0, 0.0}, {7.0, 0.0}}, {{7.0, 0.0}, {10.0, 5.0}}, {{10.0, 5.0}, {7.0, 10.0}}, {{7.0, 10.0}, {3.0, 10.0}},\\n {{3.0, 10.0}, {0.0, 5.0}}, {{0.0, 5.0}, {3.0, 0.0}}\\n }\\n };\\n\\n for(auto f : {square, square_hole, strange, exagon})\\n f.check(points, cout);\\n\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nclass RayCasting {\\n\\n static bool Intersects(int[] A, int[] B, double[] P) {\\n if (A[1] > B[1])\\n return Intersects(B, A, P);\\n\\n if (P[1] == A[1] || P[1] == B[1])\\n P[1] += 0.0001;\\n\\n if (P[1] > B[1] || P[1] < A[1] || P[0] >= Math.Max(A[0], B[0]))\\n return false;\\n\\n if (P[0] < Math.Min(A[0], B[0]))\\n return true;\\n\\n double red = (P[1] - A[1]) / (P[0] - A[0]);\\n double blue = (B[1] - A[1]) / (B[0] - A[0]);\\n return red >= blue;\\n }\\n\\n static bool Contains(int[][] shape, double[] pnt) {\\n bool inside = false;\\n int len = shape.Length;\\n for (int i = 0; i < len; i++) {\\n if (Intersects(shape[i], shape[(i + 1) % len], pnt))\\n inside = !inside;\\n }\\n return inside;\\n }\\n\\n public static void Main(string[] args) {\\n double[][] testPoints = new double[][] {\\n new double[] { 10, 10 }, new double[] { 10, 16 }, new double[] { -20, 10 },\\n new double[] { 0, 10 }, new double[] { 20, 10 }, new double[] { 16, 10 },\\n new double[] { 20, 20 }\\n };\\n\\n foreach (int[][] shape in shapes) {\\n foreach (double[] pnt in testPoints)\\n Console.Write($\\\"{Contains(shape, pnt),7} \\\");\\n Console.WriteLine();\\n }\\n }\\n\\n readonly static int[][] square = new int[][] {\\n new int[] { 0, 0 }, new int[] { 20, 0 }, new int[] { 20, 20 }, new int[] { 0, 20 }\\n };\\n\\n readonly static int[][] squareHole = new int[][] {\\n new int[] { 0, 0 }, new int[] { 20, 0 }, new int[] { 20, 20 }, new int[] { 0, 20 },\\n new int[] { 5, 5 }, new int[] { 15, 5 }, new int[] { 15, 15 }, new int[] { 5, 15 }\\n };\\n\\n readonly static int[][] strange = new int[][] {\\n new int[] { 0, 0 }, new int[] { 5, 5 }, new int[] { 0, 20 }, new int[] { 5, 15 },\\n new int[] { 15, 15 }, new int[] { 20, 20 }, new int[] { 20, 0 }\\n };\\n\\n readonly static int[][] hexagon = new int[][] {\\n new int[] { 6, 0 }, new int[] { 14, 0 }, new int[] { 20, 10 }, new int[] { 14, 20 },\\n new int[] { 6, 20 }, new int[] { 0, 10 }\\n };\\n\\n readonly static int[][][] shapes = new int[][][] { square, squareHole, strange, hexagon };\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \" Point = (@x,@y) ->\\n\\n pointInPoly = (point,poly) ->\\n segments = for pointA, index in poly\\n pointB = poly[(index + 1) % poly.length]\\n [pointA,pointB]\\n intesected = (segment for segment in segments when rayIntesectsSegment(point,segment))\\n intesected.length % 2 != 0\\n\\n rayIntesectsSegment = (p,segment) ->\\n [p1,p2] = segment\\n [a,b] = if p1.y < p2.y\\n [p1,p2]\\n else\\n [p2,p1]\\n if p.y == b.y || p.y == a.y\\n p.y += Number.MIN_VALUE\\n\\n if p.y > b.y || p.y < a.y\\n false\\n else if p.x > a.x && p.x > b.x\\n false\\n else if p.x < a.x && p.x < b.x\\n true\\n else\\n mAB = (b.y - a.y) / (b.x - a.x)\\n mAP = (p.y - a.y) / (p.x - a.x)\\n mAP > mAB\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(defun point-in-polygon (point polygon)\\n (do ((in-p nil)) ((endp polygon) in-p)\\n (when (ray-intersects-segment point (pop polygon))\\n (setf in-p (not in-p)))))\\n\\n(defun ray-intersects-segment (point segment &optional (epsilon .001))\\n (destructuring-bind (px . py) point\\n (destructuring-bind ((ax . ay) . (bx . by)) segment\\n (when (< ay by)\\n (rotatef ay by)\\n (rotatef ax bx))\\n (when (or (= py ay) (= py by))\\n (incf py epsilon))\\n (cond\\n ;; point is above, below, or to the right of the rectangle\\n ;; determined by segment; ray does not intesect the segment.\\n ((or (> px (max ax bx)) (> py (max ay by)) (< py (min ay by)))\\n nil)\\n ;; point is to left of the rectangle; ray intersects segment\\n ((< px (min ax bx))\\n t)\\n ;; point is within the rectangle...\\n (t (let ((m-red (if (= ax bx) nil\\n (/ (- by ay) (- bx ax))))\\n (m-blue (if (= px ax) nil\\n (/ (- py ay) (- px ax)))))\\n (cond\\n ((null m-blue) t)\\n ((null m-red) nil)\\n (t (>= m-blue m-red)))))))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defparameter *points*\\n #((0 . 0) (10 . 0) (10 . 10) (0 . 10)\\n (2.5 . 2.5) (7.5 . 2.5) (7.5 . 7.5) (2.5 . 7.5)\\n (0 . 5) (10 . 5) (3 . 0) (7 . 0)\\n (7 . 10) (3 . 10)))\\n\\n(defun create-polygon (indices &optional (points *points*))\\n (loop for (a b) on indices by 'cddr\\n collecting (cons (aref points (1- a))\\n (aref points (1- b)))))\\n\\n(defun square ()\\n (create-polygon '(1 2 2 3 3 4 4 1)))\\n\\n(defun square-hole ()\\n (create-polygon '(1 2 2 3 3 4 4 1 5 6 6 7 7 8 8 5)))\\n\\n(defun strange ()\\n (create-polygon '(1 5 5 4 4 8 8 7 7 3 3 2 2 5)))\\n\\n(defun exagon ()\\n (create-polygon '(11 12 12 10 10 13 13 14 14 9 9 11)))\\n\\n(defparameter *test-points*\\n #((5 . 5) (5 . 8) (-10 . 5) (0 . 5)\\n (10 . 5) (8 . 5) (10 . 10)))\\n\\n(defun test-pip ()\\n (dolist (shape '(square square-hole strange exagon))\\n (print shape)\\n (loop with polygon = (funcall shape)\\n for test-point across *test-points*\\n do (format t \\\"~&~w ~:[outside~;inside ~].\\\"\\n test-point\\n (point-in-polygon test-point polygon)))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.math, std.algorithm;\\n\\nimmutable struct Point { double x, y; }\\nimmutable struct Edge { Point a, b; }\\nimmutable struct Figure {\\n string name;\\n Edge[] edges;\\n}\\n\\nbool contains(in Figure poly, in Point p) pure nothrow @safe @nogc {\\n static bool raySegI(in Point p, in Edge edge)\\n pure nothrow @safe @nogc {\\n enum double epsilon = 0.00001;\\n with (edge) {\\n if (a.y > b.y)\\n //swap(a, b); // if edge is mutable\\n return raySegI(p, Edge(b, a));\\n if (p.y == a.y || p.y == b.y)\\n //p.y += epsilon; // if p is mutable\\n return raySegI(Point(p.x, p.y + epsilon), edge);\\n if (p.y > b.y || p.y < a.y || p.x > max(a.x, b.x))\\n return false;\\n if (p.x < min(a.x, b.x))\\n return true;\\n immutable blue = (abs(a.x - p.x) > double.min_normal) ?\\n ((p.y - a.y) / (p.x - a.x)) :\\n double.max;\\n immutable red = (abs(a.x - b.x) > double.min_normal) ?\\n ((b.y - a.y) / (b.x - a.x)) :\\n double.max;\\n return blue >= red;\\n }\\n }\\n\\n return poly.edges.count!(e => raySegI(p, e)) % 2;\\n}\\n\\nvoid main() {\\n immutable Figure[] polys = [\\n {\\\"Square\\\", [\\n {{ 0.0, 0.0}, {10.0, 0.0}}, {{10.0, 0.0}, {10.0, 10.0}},\\n {{10.0, 10.0}, { 0.0, 10.0}}, {{ 0.0, 10.0}, { 0.0, 0.0}}]},\\n {\\\"Square hole\\\", [\\n {{ 0.0, 0.0}, {10.0, 0.0}}, {{10.0, 0.0}, {10.0, 10.0}},\\n {{10.0, 10.0}, { 0.0, 10.0}}, {{ 0.0, 10.0}, { 0.0, 0.0}},\\n {{ 2.5, 2.5}, { 7.5, 2.5}}, {{ 7.5, 2.5}, { 7.5, 7.5}},\\n {{ 7.5, 7.5}, { 2.5, 7.5}}, {{ 2.5, 7.5}, { 2.5, 2.5}}]},\\n {\\\"Strange\\\", [\\n {{ 0.0, 0.0}, { 2.5, 2.5}}, {{ 2.5, 2.5}, { 0.0, 10.0}},\\n {{ 0.0, 10.0}, { 2.5, 7.5}}, {{ 2.5, 7.5}, { 7.5, 7.5}},\\n {{ 7.5, 7.5}, {10.0, 10.0}}, {{10.0, 10.0}, {10.0, 0.0}},\\n {{10.0, 0}, { 2.5, 2.5}}]},\\n {\\\"Exagon\\\", [\\n {{ 3.0, 0.0}, { 7.0, 0.0}}, {{ 7.0, 0.0}, {10.0, 5.0}},\\n {{10.0, 5.0}, { 7.0, 10.0}}, {{ 7.0, 10.0}, { 3.0, 10.0}},\\n {{ 3.0, 10.0}, { 0.0, 5.0}}, {{ 0.0, 5.0}, { 3.0, 0.0}}]}\\n];\\n\\n immutable Point[] testPoints = [{ 5, 5}, {5, 8}, {-10, 5}, {0, 5},\\n {10, 5}, {8, 5}, { 10, 10}];\\n\\n foreach (immutable poly; polys) {\\n writefln(`Is point inside figure \\\"%s\\\"?`, poly.name);\\n foreach (immutable p; testPoints)\\n writefln(\\\" (%3s, %2s): %s\\\", p.x, p.y, contains(poly, p));\\n writeln;\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"USING: kernel prettyprint sequences arrays math math.vectors ;\\nIN: raycasting\\n\\n: between ( a b x -- ? ) [ last ] tri@ [ < ] curry bi@ xor ;\\n\\n: lincomb ( a b x -- w )\\n 3dup [ last ] tri@\\n [ - ] curry bi@\\n [ drop ] 2dip\\n neg 2dup + [ / ] curry bi@\\n [ [ v*n ] curry ] bi@ bi* v+ ;\\n: leftof ( a b x -- ? ) dup [ lincomb ] dip [ first ] bi@ > ;\\n\\n: ray ( a b x -- ? ) [ between ] [ leftof ] 3bi and ;\\n\\n: raycast ( poly x -- ? )\\n [ dup first suffix [ rest-slice ] [ but-last-slice ] bi ] dip\\n [ ray ] curry 2map\\n f [ xor ] reduce ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"( scratchpad ) CONSTANT: square { { -2 -1 } { 1 -2 } { 2 1 } { -1 2 } }\\n( scratchpad ) square { 0 0 } raycast .\\nt\\n( scratchpad ) square { 5 5 } raycast .\\nf\\n( scratchpad ) square { 2 0 } raycast .\\nf\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"module Polygons\\n use Points_Module\\n implicit none\\n\\n type polygon\\n type(point), dimension(:), allocatable :: points\\n integer, dimension(:), allocatable :: vertices\\n end type polygon\\n\\ncontains\\n\\n function create_polygon(pts, vt)\\n type(polygon) :: create_polygon\\n type(point), dimension(:), intent(in) :: pts\\n integer, dimension(:), intent(in) :: vt\\n\\n integer :: np, nv\\n\\n np = size(pts,1)\\n nv = size(vt,1)\\n\\n allocate(create_polygon%points(np), create_polygon%vertices(nv))\\n create_polygon%points = pts\\n create_polygon%vertices = vt\\n\\n end function create_polygon\\n\\n subroutine free_polygon(pol)\\n type(polygon), intent(inout) :: pol\\n\\n deallocate(pol%points, pol%vertices)\\n\\n end subroutine free_polygon\\n\\nend module Polygons\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"module Ray_Casting_Algo\\n use Polygons\\n implicit none\\n\\n real, parameter, private :: eps = 0.00001\\n private :: ray_intersects_seg\\n\\ncontains\\n\\n function ray_intersects_seg(p0, a0, b0) result(intersect)\\n type(point), intent(in) :: p0, a0, b0\\n logical :: intersect\\n\\n type(point) :: a, b, p\\n real :: m_red, m_blue\\n\\n p = p0\\n ! let variable \\\"a\\\" be the point with smallest y coordinate\\n if ( a0%y > b0%y ) then\\n b = a0\\n a = b0\\n else\\n a = a0\\n b = b0\\n end if\\n\\n if ( (p%y == a%y) .or. (p%y == b%y) ) p%y = p%y + eps\\n\\n intersect = .false.\\n\\n if ( (p%y > b%y) .or. (p%y < a%y) ) return\\n if ( p%x > max(a%x, b%x) ) return\\n\\n if ( p%x < min(a%x, b%x) ) then\\n intersect = .true.\\n else\\n if ( abs(a%x - b%x) > tiny(a%x) ) then\\n m_red = (b%y - a%y) / (b%x - a%x)\\n else\\n m_red = huge(m_red)\\n end if\\n if ( abs(a%x - p%x) > tiny(a%x) ) then\\n m_blue = (p%y - a%y) / (p%x - a%x)\\n else\\n m_blue = huge(m_blue)\\n end if\\n if ( m_blue >= m_red ) then\\n intersect = .true.\\n else\\n intersect = .false.\\n end if\\n end if\\n\\n end function ray_intersects_seg\\n\\n function point_is_inside(p, pol) result(inside)\\n logical :: inside\\n type(point), intent(in) :: p\\n type(polygon), intent(in) :: pol\\n\\n integer :: i, cnt, pa, pb\\n\\n cnt = 0\\n do i = lbound(pol%vertices,1), ubound(pol%vertices,1), 2\\n pa = pol%vertices(i)\\n pb = pol%vertices(i+1)\\n if ( ray_intersects_seg(p, pol%points(pa), pol%points(pb)) ) cnt = cnt + 1\\n end do\\n\\n inside = .true.\\n if ( mod(cnt, 2) == 0 ) then\\n inside = .false.\\n end if\\n\\n end function point_is_inside\\n\\nend module Ray_Casting_Algo\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"program Pointpoly\\n use Points_Module\\n use Ray_Casting_Algo\\n implicit none\\n\\n character(len=16), dimension(4) :: names\\n type(polygon), dimension(4) :: polys\\n type(point), dimension(14) :: pts\\n type(point), dimension(7) :: p\\n\\n integer :: i, j\\n\\n pts = (/ point(0,0), point(10,0), point(10,10), point(0,10), &\\n point(2.5,2.5), point(7.5,2.5), point(7.5,7.5), point(2.5,7.5), &\\n point(0,5), point(10,5), &\\n point(3,0), point(7,0), point(7,10), point(3,10) /)\\n\\n polys(1) = create_polygon(pts, (/ 1,2, 2,3, 3,4, 4,1 /) )\\n polys(2) = create_polygon(pts, (/ 1,2, 2,3, 3,4, 4,1, 5,6, 6,7, 7,8, 8,5 /) )\\n polys(3) = create_polygon(pts, (/ 1,5, 5,4, 4,8, 8,7, 7,3, 3,2, 2,5 /) )\\n polys(4) = create_polygon(pts, (/ 11,12, 12,10, 10,13, 13,14, 14,9, 9,11 /) )\\n\\n names = (/ \\\"square\\\", \\\"square hole\\\", \\\"strange\\\", \\\"hexagon\\\" /)\\n\\n p = (/ point(5,5), point(5, 8), point(-10, 5), point(0,5), point(10,5), &\\n point(8,5), point(10,10) /)\\n\\n do j = 1, size(p)\\n do i = 1, size(polys)\\n write(*, \\\"('point (',F8.2,',',F8.2,') is inside ',A,'? ', L)\\\") &\\n p(j)%x, p(j)%y, names(i), point_is_inside(p(j), polys(i))\\n end do\\n print *, \\\"\\\"\\n end do\\n\\n do i = 1, size(polys)\\n call free_polygon(polys(i))\\n end do\\n\\nend program Pointpoly\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Type Point\\n As Single x,y\\nEnd Type\\n\\nFunction inpolygon(p1() As Point,p2 As Point) As Integer\\n #Macro isleft2(L,p)\\n -Sgn( (L(1).x-L(2).x)*(p.y-L(2).y) - (p.x-L(2).x)*(L(1).y-L(2).y))\\n #EndMacro\\n Dim As Integer index,nextindex\\n Dim k As Integer=UBound(p1)+1\\n Dim send (1 To 2) As Point\\n Dim wn As Integer=0\\n For n As Integer=1 To UBound(p1)\\n index=n Mod k:nextindex=(n+1) Mod k\\n If nextindex=0 Then nextindex=1\\n send(1).x=p1(index).x:send(2).x=p1(nextindex).x\\n send(1).y=p1(index).y:send(2).y=p1(nextindex).y\\n If p1(index).y<=p2.y Then\\n If p1(nextindex).y>p2.y Then\\n If isleft2(send,p2)>=0 Then '=\\n wn=wn+1\\n End If\\n End If\\n Else\\n If p1(nextindex).y<=p2.y Then\\n If isleft2(send,p2)<=0 Then'=\\n wn=wn-1\\n End If\\n End If\\n End If\\n Next n\\n Return wn\\nEnd Function\\n\\n\\nDim As Point square(1 To 4) ={(0,0),(10,0),(10,10),(0,10)}\\n\\nDim As Point hole(1 To 4) ={(2.5,2.5),(7.5,2.5),(7.5,7.5),(2.5,7.5)}\\n\\nDim As Point strange(1 To 8) ={(0,0),(2.5,2.5),(0,10),(2.5,7.5),_\\n (7.5,7.5),(10,10),(10,0),(2.5,2.5)}\\n\\nDim As Point exagon(1 To 6) ={(3,0),(7,0),(10,5),(7,10),(3,10),(0,5)}\\n\\n'printouts\\nFor z As Integer=1 To 4\\n Select Case z\\n Case 1: Print \\\"squared\\\"\\n Print \\\"(5,5) \\\" ;Tab(12);\\n If inpolygon(square(),Type<Point>(5,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(5,8) \\\" ;Tab(12);\\n If inpolygon(square(),Type<Point>(5,8)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(-10,5) \\\" ;Tab(12);\\n If inpolygon(square(),Type<Point>(-10,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(0,5) \\\" ;Tab(12);\\n If inpolygon(square(),Type<Point>(0,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(10,5) \\\" ;Tab(12);\\n If inpolygon(square(),Type<Point>(10,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(8,5) \\\" ;Tab(12);\\n If inpolygon(square(),Type<Point>(8,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(10,10) \\\" ;Tab(12);\\n If inpolygon(square(),Type<Point>(10,10)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print\\n Case 2:Print \\\"squared hole\\\"\\n Print \\\"(5,5) \\\" ;Tab(12);\\n If Not inpolygon(hole(),Type<Point>(5,5)) And inpolygon(square(),Type<Point>(5,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(5,8) \\\" ;Tab(12);\\n If Not inpolygon(hole(),Type<Point>(5,8)) And inpolygon(square(),Type<Point>(5,8))Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(-10,5) \\\" ;Tab(12);\\n If Not inpolygon(hole(),Type<Point>(-10,5))And inpolygon(square(),Type<Point>(-10,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(0,5) \\\" ;Tab(12);\\n If Not inpolygon(hole(),Type<Point>(0,5))And inpolygon(square(),Type<Point>(0,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(10,5) \\\" ;Tab(12);\\n If Not inpolygon(hole(),Type<Point>(10,5))And inpolygon(square(),Type<Point>(10,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(8,5) \\\" ;Tab(12);\\n If Not inpolygon(hole(),Type<Point>(8,5))And inpolygon(square(),Type<Point>(8,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(10,10) \\\" ;Tab(12);\\n If Not inpolygon(hole(),Type<Point>(10,10))And inpolygon(square(),Type<Point>(10,10)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print\\n Case 3:Print \\\"strange\\\"\\n Print \\\"(5,5) \\\" ;Tab(12);\\n If inpolygon(strange(),Type<Point>(5,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(5,8) \\\" ;Tab(12);\\n If inpolygon(strange(),Type<Point>(5,8)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(-10,5) \\\" ;Tab(12);\\n If inpolygon(strange(),Type<Point>(-10,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(0,5) \\\" ;Tab(12);\\n If inpolygon(strange(),Type<Point>(0,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(10,5) \\\" ;Tab(12);\\n If inpolygon(strange(),Type<Point>(10,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(8,5) \\\" ;Tab(12);\\n If inpolygon(strange(),Type<Point>(8,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(10,10) \\\" ;Tab(12);\\n If inpolygon(strange(),Type<Point>(10,10)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print\\n Case 4:Print \\\"exagon\\\"\\n Print \\\"(5,5) \\\" ;Tab(12);\\n If inpolygon(exagon(),Type<Point>(5,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(5,8) \\\" ;Tab(12);\\n If inpolygon(exagon(),Type<Point>(5,8)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(-10,5) \\\" ;Tab(12);\\n If inpolygon(exagon(),Type<Point>(-10,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(0,5) \\\" ;Tab(12);\\n If inpolygon(exagon(),Type<Point>(0,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(10,5) \\\" ;Tab(12);\\n If inpolygon(exagon(),Type<Point>(10,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(8,5) \\\" ;Tab(12);\\n If inpolygon(exagon(),Type<Point>(8,5)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print \\\"(10,10) \\\" ;Tab(12);\\n If inpolygon(exagon(),Type<Point>(10,10)) Then Print \\\"in\\\" Else Print \\\"out\\\"\\n Print\\n End Select\\nNext z\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n)\\n\\ntype xy struct {\\n x, y float64\\n}\\n\\ntype seg struct {\\n p1, p2 xy\\n}\\n\\ntype poly struct {\\n name string\\n sides []seg\\n}\\n\\nfunc inside(pt xy, pg poly) (i bool) {\\n for _, side := range pg.sides {\\n if rayIntersectsSegment(pt, side) {\\n i = !i\\n }\\n }\\n return\\n}\\n\\nfunc rayIntersectsSegment(p xy, s seg) bool {\\n var a, b xy\\n if s.p1.y < s.p2.y {\\n a, b = s.p1, s.p2\\n } else {\\n a, b = s.p2, s.p1\\n }\\n for p.y == a.y || p.y == b.y {\\n p.y = math.Nextafter(p.y, math.Inf(1))\\n }\\n if p.y < a.y || p.y > b.y {\\n return false\\n }\\n if a.x > b.x {\\n if p.x > a.x {\\n return false\\n }\\n if p.x < b.x {\\n return true\\n }\\n } else {\\n if p.x > b.x {\\n return false\\n }\\n if p.x < a.x {\\n return true\\n }\\n }\\n return (p.y-a.y)/(p.x-a.x) >= (b.y-a.y)/(b.x-a.x)\\n}\\n\\nvar (\\n p1 = xy{0, 0}\\n p2 = xy{10, 0}\\n p3 = xy{10, 10}\\n p4 = xy{0, 10}\\n p5 = xy{2.5, 2.5}\\n p6 = xy{7.5, 2.5}\\n p7 = xy{7.5, 7.5}\\n p8 = xy{2.5, 7.5}\\n p9 = xy{0, 5}\\n p10 = xy{10, 5}\\n p11 = xy{3, 0}\\n p12 = xy{7, 0}\\n p13 = xy{7, 10}\\n p14 = xy{3, 10}\\n)\\n\\nvar tpg = []poly{\\n {\\\"square\\\", []seg{{p1, p2}, {p2, p3}, {p3, p4}, {p4, p1}}},\\n {\\\"square hole\\\", []seg{{p1, p2}, {p2, p3}, {p3, p4}, {p4, p1},\\n {p5, p6}, {p6, p7}, {p7, p8}, {p8, p5}}},\\n {\\\"strange\\\", []seg{{p1, p5},\\n {p5, p4}, {p4, p8}, {p8, p7}, {p7, p3}, {p3, p2}, {p2, p5}}},\\n {\\\"exagon\\\", []seg{{p11, p12}, {p12, p10}, {p10, p13},\\n {p13, p14}, {p14, p9}, {p9, p11}}},\\n}\\n\\nvar tpt = []xy{\\n // test points common in other solutions on this page\\n {5, 5}, {5, 8}, {-10, 5}, {0, 5}, {10, 5}, {8, 5}, {10, 10},\\n // test points that show the problem with \\\"strange\\\"\\n {1, 2}, {2, 1},\\n}\\n\\nfunc main() {\\n for _, pg := range tpg {\\n fmt.Printf(\\\"%s:\\\\n\\\", pg.name)\\n for _, pt := range tpt {\\n fmt.Println(pt, inside(pt, pg))\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"math\\\"\\n \\\"fmt\\\"\\n)\\n\\ntype xy struct {\\n x, y float64\\n}\\n\\ntype closedPoly struct {\\n name string\\n vert []xy\\n}\\n\\nfunc inside(pt xy, pg closedPoly) bool {\\n if len(pg.vert) < 3 {\\n return false\\n }\\n in := rayIntersectsSegment(pt, pg.vert[len(pg.vert)-1], pg.vert[0])\\n for i := 1; i < len(pg.vert); i++ {\\n if rayIntersectsSegment(pt, pg.vert[i-1], pg.vert[i]) {\\n in = !in\\n }\\n }\\n return in\\n}\\n\\nfunc rayIntersectsSegment(p, a, b xy) bool {\\n if a.y > b.y {\\n a, b = b, a\\n }\\n for p.y == a.y || p.y == b.y {\\n p.y = math.Nextafter(p.y, math.Inf(1))\\n }\\n if p.y < a.y || p.y > b.y {\\n return false\\n }\\n if a.x > b.x {\\n if p.x > a.x {\\n return false\\n }\\n if p.x < b.x {\\n return true\\n }\\n } else {\\n if p.x > b.x {\\n return false\\n }\\n if p.x < a.x {\\n return true\\n }\\n }\\n return (p.y-a.y)/(p.x-a.x) >= (b.y-a.y)/(b.x-a.x)\\n}\\n\\nvar tpg = []closedPoly{\\n {\\\"square\\\", []xy{{0, 0}, {10, 0}, {10, 10}, {0, 10}}},\\n {\\\"square hole\\\", []xy{{0, 0}, {10, 0}, {10, 10}, {0, 10}, {0, 0},\\n {2.5, 2.5}, {7.5, 2.5}, {7.5, 7.5}, {2.5, 7.5}, {2.5, 2.5}}},\\n {\\\"strange\\\", []xy{{0, 0}, {2.5, 2.5}, {0, 10}, {2.5, 7.5}, {7.5, 7.5},\\n {10, 10}, {10, 0}, {2.5, 2.5}}},\\n {\\\"exagon\\\", []xy{{3, 0}, {7, 0}, {10, 5}, {7, 10}, {3, 10}, {0, 5}}},\\n}\\n\\nvar tpt = []xy{{1, 2}, {2, 1}}\\n\\nfunc main() {\\n for _, pg := range tpg {\\n fmt.Printf(\\\"%s:\\\\n\\\", pg.name)\\n for _, pt := range tpt {\\n fmt.Println(pt, inside(pt, pg))\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\ntype xy struct {\\n x, y float64\\n}\\n\\ntype closedPoly struct {\\n name string\\n vert []xy\\n}\\n\\nfunc inside(pt xy, pg closedPoly) bool {\\n if len(pg.vert) < 3 {\\n return false\\n }\\n in := rayIntersectsSegment(pt, pg.vert[len(pg.vert)-1], pg.vert[0])\\n for i := 1; i < len(pg.vert); i++ {\\n if rayIntersectsSegment(pt, pg.vert[i-1], pg.vert[i]) {\\n in = !in\\n }\\n }\\n return in\\n}\\n\\nfunc rayIntersectsSegment(p, a, b xy) bool {\\n return (a.y > p.y) != (b.y > p.y) &&\\n p.x < (b.x-a.x)*(p.y-a.y)/(b.y-a.y)+a.x\\n}\\n\\nvar tpg = []closedPoly{\\n {\\\"square\\\", []xy{{0, 0}, {10, 0}, {10, 10}, {0, 10}}},\\n {\\\"square hole\\\", []xy{{0, 0}, {10, 0}, {10, 10}, {0, 10}, {0, 0},\\n {2.5, 2.5}, {7.5, 2.5}, {7.5, 7.5}, {2.5, 7.5}, {2.5, 2.5}}},\\n {\\\"strange\\\", []xy{{0, 0}, {2.5, 2.5}, {0, 10}, {2.5, 7.5}, {7.5, 7.5},\\n {10, 10}, {10, 0}, {2.5, 2.5}}},\\n {\\\"exagon\\\", []xy{{3, 0}, {7, 0}, {10, 5}, {7, 10}, {3, 10}, {0, 5}}},\\n}\\n\\nvar tpt = []xy{{1, 2}, {2, 1}}\\n\\nfunc main() {\\n for _, pg := range tpg {\\n fmt.Printf(\\\"%s:\\\\n\\\", pg.name)\\n for _, pt := range tpt {\\n fmt.Println(pt, inside(pt, pg))\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.Ratio\\n\\ntype Point = (Rational, Rational)\\ntype Polygon = [Point]\\ndata Line = Sloped {lineSlope, lineYIntercept :: Rational} |\\n Vert {lineXIntercept :: Rational}\\n\\npolygonSides :: Polygon -> [(Point, Point)]\\npolygonSides poly@(p1 : ps) = zip poly $ ps ++ [p1]\\n\\nintersects :: Point -> Line -> Bool\\n{- @intersects (px, py) l@ is true if the ray {(x, py) | x ≥ px}\\nintersects l. -}\\nintersects (px, _) (Vert xint) = px <= xint\\nintersects (px, py) (Sloped m b) | m < 0 = py <= m * px + b\\n | otherwise = py >= m * px + b\\n\\nonLine :: Point -> Line -> Bool\\n{- Is the point on the line? -}\\nonLine (px, _) (Vert xint) = px == xint\\nonLine (px, py) (Sloped m b) = py == m * px + b\\n\\ncarrier :: (Point, Point) -> Line\\n{- Finds the line containing the given line segment. -}\\ncarrier ((ax, ay), (bx, by)) | ax == bx = Vert ax\\n | otherwise = Sloped slope yint\\n where slope = (ay - by) / (ax - bx)\\n yint = ay - slope * ax\\n\\nbetween :: Ord a => a -> a -> a -> Bool\\nbetween x a b | a > b = b <= x && x <= a\\n | otherwise = a <= x && x <= b\\n\\ninPolygon :: Point -> Polygon -> Bool\\ninPolygon p@(px, py) = f 0 . polygonSides\\n where f n [] = odd n\\n f n (side : sides) | far = f n sides\\n | onSegment = True\\n | rayIntersects = f (n + 1) sides\\n | otherwise = f n sides\\n where far = not $ between py ay by\\n onSegment | ay == by = between px ax bx\\n | otherwise = p `onLine` line\\n rayIntersects =\\n intersects p line &&\\n (py /= ay || by < py) &&\\n (py /= by || ay < py)\\n ((ax, ay), (bx, by)) = side\\n line = carrier side\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"NB.*crossPnP v point in closed polygon, crossing number\\nNB. bool=. points crossPnP polygon\\ncrossPnP=: 4 : 0\\\"2\\n 'X Y'=. |:x\\n 'x0 y0 x1 y1'=. |:2 ,/\\\\^:(2={:@$@]) y\\n p1=. ((y0<:/Y)*. y1>/Y) +. (y0>/Y)*. y1<:/Y\\n p2=. (x0-/X) < (x0-x1) * (y0-/Y) % (y0 - y1)\\n 2|+/ p1*.p2\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"SQUAREV=: 0 0 , 10 0 , 10 10 ,: 0 10\\nSQUAREV=: SQUAREV, 2.5 2.5 , 7.5 0.1 , 7.5 7.5 ,: 2.5 7.5\\n\\nESAV=: 3 0 , 7 0 , 10 5 , 7 10 , 3 10 ,: 0 5\\n\\nESA=: (0 1,1 2,2 3,3 4,4 5,:5 0) , .{ ESAV\\nSQUARE=: (0 1,1 2,2 3,:3 0) , .{ SQUAREV\\nSQUAREHOLE=: (0 1,1 2,2 3,3 0,4 5,5 6,6 7,:7 4) , .{ SQUAREV\\nSTRANGE=: (0 4,4 3,3 7,7 6,6 2,2 1,1 5,:5 0) , .{ SQUAREV\\n\\nPOINTS=: 5 5,5 8,2 2,0 0,10 10,2.5 2.5,0.01 5,2.2 7.4,0 5,10 5,:_4 10\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" (<POINTS) crossPnP every ESA;SQUARE;SQUAREHOLE;STRANGE\\n1 1 1 0 0 1 1 1 0 1 0\\n1 1 1 0 0 1 1 1 0 1 0\\n0 1 1 0 0 1 1 1 0 1 0\\n1 0 0 0 0 0 0 1 0 1 0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import static java.lang.Math.*;\\n\\npublic class RayCasting {\\n\\n static boolean intersects(int[] A, int[] B, double[] P) {\\n if (A[1] > B[1])\\n return intersects(B, A, P);\\n\\n if (P[1] == A[1] || P[1] == B[1])\\n P[1] += 0.0001;\\n\\n if (P[1] > B[1] || P[1] < A[1] || P[0] >= max(A[0], B[0]))\\n return false;\\n\\n if (P[0] < min(A[0], B[0]))\\n return true;\\n\\n double red = (P[1] - A[1]) / (double) (P[0] - A[0]);\\n double blue = (B[1] - A[1]) / (double) (B[0] - A[0]);\\n return red >= blue;\\n }\\n\\n static boolean contains(int[][] shape, double[] pnt) {\\n boolean inside = false;\\n int len = shape.length;\\n for (int i = 0; i < len; i++) {\\n if (intersects(shape[i], shape[(i + 1) % len], pnt))\\n inside = !inside;\\n }\\n return inside;\\n }\\n\\n public static void main(String[] a) {\\n double[][] testPoints = {{10, 10}, {10, 16}, {-20, 10}, {0, 10},\\n {20, 10}, {16, 10}, {20, 20}};\\n\\n for (int[][] shape : shapes) {\\n for (double[] pnt : testPoints)\\n System.out.printf(\\\"%7s \\\", contains(shape, pnt));\\n System.out.println();\\n }\\n }\\n\\n final static int[][] square = {{0, 0}, {20, 0}, {20, 20}, {0, 20}};\\n\\n final static int[][] squareHole = {{0, 0}, {20, 0}, {20, 20}, {0, 20},\\n {5, 5}, {15, 5}, {15, 15}, {5, 15}};\\n\\n final static int[][] strange = {{0, 0}, {5, 5}, {0, 20}, {5, 15}, {15, 15},\\n {20, 20}, {20, 0}};\\n\\n final static int[][] hexagon = {{6, 0}, {14, 0}, {20, 10}, {14, 20},\\n {6, 20}, {0, 10}};\\n\\n final static int[][][] shapes = {square, squareHole, strange, hexagon};\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"/**\\n * @return {boolean} true if (lng, lat) is in bounds\\n */\\nfunction contains(bounds, lat, lng) {\\n //https://rosettacode.org/wiki/Ray-casting_algorithm\\n var count = 0;\\n for (var b = 0; b < bounds.length; b++) {\\n var vertex1 = bounds[b];\\n var vertex2 = bounds[(b + 1) % bounds.length];\\n if (west(vertex1, vertex2, lng, lat))\\n ++count;\\n }\\n return count % 2;\\n\\n /**\\n * @return {boolean} true if (x,y) is west of the line segment connecting A and B\\n */\\n function west(A, B, x, y) {\\n if (A.y <= B.y) {\\n if (y <= A.y || y > B.y ||\\n x >= A.x && x >= B.x) {\\n return false;\\n } else if (x < A.x && x < B.x) {\\n return true;\\n } else {\\n return (y - A.y) / (x - A.x) > (B.y - A.y) / (B.x - A.x);\\n }\\n } else {\\n return west(B, A, x, y);\\n }\\n }\\n}\\n\\nvar square = {name: 'square', bounds: [{x: 0, y: 0}, {x: 20, y: 0}, {x: 20, y: 20}, {x: 0, y: 20}]};\\nvar squareHole = {\\n name: 'squareHole',\\n bounds: [{x: 0, y: 0}, {x: 20, y: 0}, {x: 20, y: 20}, {x: 0, y: 20}, {x: 5, y: 5}, {x: 15, y: 5}, {x: 15, y: 15}, {x: 5, y: 15}]\\n};\\nvar strange = {\\n name: 'strange',\\n bounds: [{x: 0, y: 0}, {x: 5, y: 5}, {x: 0, y: 20}, {x: 5, y: 15}, {x: 15, y: 15}, {x: 20, y: 20}, {x: 20, y: 0}]\\n};\\nvar hexagon = {\\n name: 'hexagon',\\n bounds: [{x: 6, y: 0}, {x: 14, y: 0}, {x: 20, y: 10}, {x: 14, y: 20}, {x: 6, y: 20}, {x: 0, y: 10}]\\n};\\n\\nvar shapes = [square, squareHole, strange, hexagon];\\nvar testPoints = [{lng: 10, lat: 10}, {lng: 10, lat: 16}, {lng: -20, lat: 10},\\n {lng: 0, lat: 10}, {lng: 20, lat: 10}, {lng: 16, lat: 10}, {lng: 20, lat: 20}];\\n\\nfor (var s = 0; s < shapes.length; s++) {\\n var shape = shapes[s];\\n for (var tp = 0; tp < testPoints.length; tp++) {\\n var testPoint = testPoints[tp];\\n console.log(JSON.stringify(testPoint) + '\\\\tin ' + shape.name + '\\\\t' + contains(shape.bounds, testPoint.lat, testPoint.lng));\\n }\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"module RayCastings\\n\\nexport Point\\n\\nstruct Point{T}\\n x::T\\n y::T\\nend\\nBase.show(io::IO, p::Point) = print(io, \\\"($(p.x), $(p.y))\\\")\\n\\nconst Edge = Tuple{Point{T}, Point{T}} where T\\nBase.show(io::IO, e::Edge) = print(io, \\\"$(e[1]) ∘-∘ $(e[2])\\\")\\n\\nfunction rayintersectseg(p::Point{T}, edge::Edge{T}) where T\\n a, b = edge\\n if a.y > b.y\\n a, b = b, a\\n end\\n if p.y ∈ (a.y, b.y)\\n p = Point(p.x, p.y + eps(p.y))\\n end\\n\\n rst = false\\n if (p.y > b.y || p.y < a.y) || (p.x > max(a.x, b.x))\\n return false\\n end\\n\\n if p.x < min(a.x, b.x)\\n rst = true\\n else\\n mred = (b.y - a.y) / (b.x - a.x)\\n mblu = (p.y - a.y) / (p.x - a.x)\\n rst = mblu ≥ mred\\n end\\n\\n return rst\\nend\\n\\nisinside(poly::Vector{Tuple{Point{T}, Point{T}}}, p::Point{T}) where T =\\n isodd(count(edge -> rayintersectseg(p, edge), poly))\\n\\nconnect(a::Point{T}, b::Point{T}...) where T =\\n [(a, b) for (a, b) in zip(vcat(a, b...), vcat(b..., a))]\\n\\nend # module RayCastings\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"using Printf\\n\\nlet A = Point(0.0, 0.0),\\n B = Point(0.0, 10.0),\\n C = Point(10.0, 10.0),\\n D = Point(10.0, 0.0),\\n E = Point(2.5, 2.5),\\n F = Point(2.5, 7.5),\\n G = Point(7.5, 7.5),\\n H = Point(7.5, 2.5),\\n I = Point(3.0, 0.0),\\n J = Point(7.0, 0.0),\\n K = Point(10.0, 5.0),\\n L = Point(7.0, 10.0),\\n M = Point(3.0, 10.0),\\n N = Point(0.0, 5.0),\\n testpts = (Point(5.0, 5.0), Point(5.0, 8.0), Point(-10.0, 5.0), Point(0.0, 5.0),\\n Point(10.0, 5.0), Point(8.0, 5.0), Point(10.0, 10.0))\\n\\n square = RayCastings.connect(A, B, C, D)\\n square_withhole = vcat(square, RayCastings.connect(E, F, G, H))\\n strange = RayCastings.connect(A, E, B, F, G, C, D, E)\\n exagon = RayCastings.connect(I, J, K, L, M, N)\\n\\n println(\\\"\\\\n# TESTING WHETHER POINTS ARE WITHIN POLYGONS\\\")\\n for poly in (square, square_withhole, strange, exagon)\\n println(\\\"\\\\nEdges: \\\\n - \\\", join(poly, \\\"\\\\n - \\\"))\\n println(\\\"Inside/outside:\\\")\\n for p in testpts\\n @printf(\\\" - %-12s is %s\\\\n\\\", p, RayCastings.isinside(poly, p) ? \\\"inside\\\" : \\\"outside\\\")\\n end\\n end\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import java.lang.Double.MAX_VALUE\\nimport java.lang.Double.MIN_VALUE\\nimport java.lang.Math.abs\\n\\ndata class Point(val x: Double, val y: Double)\\n\\ndata class Edge(val s: Point, val e: Point) {\\n operator fun invoke(p: Point) : Boolean = when {\\n s.y > e.y -> Edge(e, s).invoke(p)\\n p.y == s.y || p.y == e.y -> invoke(Point(p.x, p.y + epsilon))\\n p.y > e.y || p.y < s.y || p.x > Math.max(s.x, e.x) -> false\\n p.x < Math.min(s.x, e.x) -> true\\n else -> {\\n val blue = if (abs(s.x - p.x) > MIN_VALUE) (p.y - s.y) / (p.x - s.x) else MAX_VALUE\\n val red = if (abs(s.x - e.x) > MIN_VALUE) (e.y - s.y) / (e.x - s.x) else MAX_VALUE\\n blue >= red\\n }\\n }\\n\\n val epsilon = 0.00001\\n}\\n\\nclass Figure(val name: String, val edges: Array<Edge>) {\\n operator fun contains(p: Point) = edges.count({ it(p) }) % 2 != 0\\n}\\n\\nobject Ray_casting {\\n fun check(figures : Array<Figure>, points : List<Point>) {\\n println(\\\"points: \\\" + points)\\n figures.forEach { f ->\\n println(\\\"figure: \\\" + f.name)\\n f.edges.forEach { println(\\\" \\\" + it) }\\n println(\\\"result: \\\" + (points.map { it in f }))\\n }\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"fun main(args: Array<String>) {\\n val figures = arrayOf(Figure(\\\"Square\\\", arrayOf(Edge(Point(0.0, 0.0), Point(10.0, 0.0)), Edge(Point(10.0, 0.0), Point(10.0, 10.0)),\\n Edge(Point(10.0, 10.0), Point(0.0, 10.0)),Edge(Point(0.0, 10.0), Point(0.0, 0.0)))),\\n Figure(\\\"Square hole\\\", arrayOf(Edge(Point(0.0, 0.0), Point(10.0, 0.0)), Edge(Point(10.0, 0.0), Point(10.0, 10.0)),\\n Edge(Point(10.0, 10.0), Point(0.0, 10.0)), Edge(Point(0.0, 10.0), Point(0.0, 0.0)), Edge(Point(2.5, 2.5), Point(7.5, 2.5)),\\n Edge(Point(7.5, 2.5), Point(7.5, 7.5)),Edge(Point(7.5, 7.5), Point(2.5, 7.5)), Edge(Point(2.5, 7.5), Point(2.5, 2.5)))),\\n Figure(\\\"Strange\\\", arrayOf(Edge(Point(0.0, 0.0), Point(2.5, 2.5)), Edge(Point(2.5, 2.5), Point(0.0, 10.0)),\\n Edge(Point(0.0, 10.0), Point(2.5, 7.5)), Edge(Point(2.5, 7.5), Point(7.5, 7.5)), Edge(Point(7.5, 7.5), Point(10.0, 10.0)),\\n Edge(Point(10.0, 10.0), Point(10.0, 0.0)), Edge(Point(10.0, 0.0), Point(2.5, 2.5)))),\\n Figure(\\\"Exagon\\\", arrayOf(Edge(Point(3.0, 0.0), Point(7.0, 0.0)), Edge(Point(7.0, 0.0), Point(10.0, 5.0)), Edge(Point(10.0, 5.0), Point(7.0, 10.0)),\\n Edge(Point(7.0, 10.0), Point(3.0, 10.0)), Edge(Point(3.0, 10.0), Point(0.0, 5.0)), Edge(Point(0.0, 5.0), Point(3.0, 0.0)))))\\n\\n val points = listOf(Point(5.0, 5.0), Point(5.0, 8.0), Point(-10.0, 5.0), Point(0.0, 5.0),\\n Point(10.0, 5.0), Point(8.0, 5.0), Point(10.0, 10.0))\\n\\n Ray_casting.check(figures, points)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"NoMainWin\\nGlobal sw, sh, verts\\n\\nsw = 640 : sh = 480\\nWindowWidth = sw+8 : WindowHeight = sh+31\\nUpperLeftX = (DisplayWidth -sw)/2\\nUpperLeftY = (DisplayHeight-sh)/2\\nOpen\\\"Ray Casting Algorithm\\\" For Graphics_nf_nsb As #g\\n#g \\\"Down; TrapClose [halt]\\\"\\nh$ = \\\"#g\\\"\\n\\nDim xp(15),yp(15)\\n#g \\\"when leftButtonDown [halt];when mouseMove checkPoint\\\"\\n#g \\\"when rightButtonDown [Repeat]\\\"\\n\\n[Repeat]\\n #g \\\"Cls;Fill 32 160 255; Color white;BackColor 32 160 255\\\"\\n #g \\\"Place 5 460;\\\\L-click to exit\\\"\\n #g \\\"Place 485 460;\\\\R-click for new polygon\\\"\\n\\n 'generate polygon from random points\\n numPoints = rand(4,15)\\n verts = numPoints\\n For i = 0 To numPoints-1\\n xp(i) = rand(20,620)\\n yp(i) = rand(40,420)\\n Next\\n Call drawPoly h$, verts, \\\"white\\\"\\n #g \\\"Flush\\\"\\n Wait\\n\\n[halt]\\nClose #g\\nEnd\\n\\n'Point In Polygon Function\\nFunction pnp(x, y, numSides)\\n j= numSides-1: oddNodes = 0\\n For i = 0 To numSides-1\\n If ((yp(i)<y) And (yp(j)>=y)) Or ((yp(j)<y) And (yp(i)>=y)) Then\\n f1 = y - yp(i):f2 = yp(j) - yp(i): f3 = xp(j) - xp(i)\\n If (xp(i) + f1 / f2 * f3) < x Then oddNodes = 1 - oddNodes\\n End If\\n j = i\\n Next\\n pnp = oddNodes\\nEnd Function\\n\\n'draw the polygon\\nSub drawPoly h$, verts, colour$\\n #h$, \\\"Color \\\";colour$\\n j = verts-1\\n For i = 0 To verts-1\\n #h$ \\\"Line \\\";xp(j);\\\" \\\";yp(j);\\\" \\\";xp(i);\\\" \\\";yp(i)\\n j = i\\n Next\\nEnd Sub\\n\\n'change message and color of polygon\\nSub checkPoint h$, x, y\\n If pnp(x,y,verts) Then\\n #h$ \\\"Color 32 160 255;BackColor 32 160 255\\\"\\n #h$ \\\"Place 5 0;BoxFilled 150 20;Color white\\\"\\n #h$ \\\"Place 7 15;\\\\Mouse In Polygon\\\"\\n Call drawPoly h$, verts, \\\"red\\\"\\n Else\\n #h$ \\\"Color 32 160 255;BackColor 32 160 255\\\"\\n #h$ \\\"Place 5 0;BoxFilled 150 20;Color white\\\"\\n #h$ \\\"Place 7 15;\\\\Mouse Not In Polygon\\\"\\n Call drawPoly h$, verts, \\\"white\\\"\\n End If\\nEnd Sub\\n\\nFunction rand(loNum,hiNum)\\n rand = Int(Rnd(0)*(hiNum-loNum+1)+loNum)\\nEnd Function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"function Point(x,y) return {x=x, y=y} end\\n\\nfunction Polygon(name, points)\\n local function contains(self, p)\\n local odd, eps = false, 1e-9\\n local function rayseg(p, a, b)\\n if a.y > b.y then a, b = b, a end\\n if p.y == a.y or p.y == b.y then p.y = p.y + eps end\\n if p.y < a.y or p.y > b.y or p.x > math.max(a.x, b.x) then return false end\\n if p.x < math.min(a.x, b.x) then return true end\\n local red = a.x == b.x and math.huge or (b.y-a.y)/(b.x-a.x)\\n local blu = a.x == p.x and math.huge or (p.y-a.y)/(p.x-a.x)\\n return blu >= red\\n end\\n for i, a in ipairs(self.points) do\\n local b = self.points[i%#self.points+1]\\n if rayseg(p, a, b) then odd = not odd end\\n end\\n return odd\\n end\\n return {name=name, points=points, contains=contains}\\nend\\n\\npolygons = {\\n Polygon(\\\"square\\\", { Point(0,0), Point(10,0), Point(10,10), Point(0,10) }),\\n Polygon(\\\"squarehole\\\", { Point(0,0), Point(10,0), Point(10,10), Point(0,10), Point(2.5,2.5), Point(7.5,2.5), Point(7.5,7.5), Point(2.5,7.5) }),\\n Polygon(\\\"strange\\\", { Point(0,0), Point(2.5,2.5), Point(0, 10), Point(2.5,7.5), Point(7.5,7.5), Point(10,10), Point(10,0), Point(2.5,2.5) }),\\n Polygon(\\\"hexagon\\\", { Point(3,0), Point(7,0), Point(10,5), Point(7,10), Point(3,10), Point(0,5) })\\n}\\npoints = { Point(5,5), Point(5,8), Point(-10,5), Point(0,5), Point(10,5), Point(8,5), Point(10,10) }\\n\\nfor _,poly in ipairs(polygons) do\\n print(\\\"Does '\\\"..poly.name..\\\"' contain the point..\\\")\\n for _,pt in ipairs(points) do\\n print(string.format(\\\" (%3.f, %2.f)? %s\\\", pt.x, pt.y, tostring(poly:contains(pt))))\\n end\\n print()\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"import fenv, sequtils, strformat\\n\\ntype\\n Point = tuple[x, y: float]\\n Edge = tuple[a, b: Point]\\n Figure = tuple[name: string; edges: seq[Edge]]\\n\\n\\nfunc contains(poly: Figure; p: Point): bool =\\n\\n func raySegI(p: Point; edge: Edge): bool =\\n const Epsilon = 0.00001\\n if edge.a.y > edge.b.y:\\n # Swap \\\"a\\\" and \\\"b\\\".\\n return p.raySegI((edge.b, edge.a))\\n if p.y == edge.a.y or p.y == edge.b.y:\\n # p.y += Epsilon.\\n return (p.x, p.y + Epsilon).raySegI(edge)\\n if p.y > edge.b.y or p.y < edge.a.y or p.x > max(edge.a.x, edge.b.x):\\n return false\\n if p.x < min(edge.a.x, edge.b.x):\\n return true\\n let blue = if abs(edge.a.x - p.x) > minimumPositiveValue(float):\\n (p.y - edge.a.y) / (p.x - edge.a.x)\\n else:\\n maximumPositiveValue(float)\\n let red = if abs(edge.a.x - edge.b.x) > minimumPositiveValue(float):\\n (edge.b.y - edge.a.y) / (edge.b.x - edge.a.x)\\n else:\\n maximumPositiveValue(float)\\n result = blue >= red\\n\\n result = (poly.edges.filterIt(p.raySegI(it)).len and 1) != 0\\n\\n\\nwhen isMainModule:\\n\\n const\\n Polys: array[4, Figure] =\\n [(\\\"Square\\\",\\n @[(( 0.0, 0.0), (10.0, 0.0)), ((10.0, 0.0), (10.0, 10.0)),\\n ((10.0, 10.0), ( 0.0, 10.0)), (( 0.0, 10.0), ( 0.0, 0.0))]),\\n (\\\"Square hole\\\",\\n @[(( 0.0, 0.0), (10.0, 0.0)), ((10.0, 0.0), (10.0, 10.0)),\\n ((10.0, 10.0), ( 0.0, 10.0)), (( 0.0, 10.0), ( 0.0, 0.0)),\\n (( 2.5, 2.5), ( 7.5, 2.5)), (( 7.5, 2.5), ( 7.5, 7.5)),\\n (( 7.5, 7.5), ( 2.5, 7.5)), (( 2.5, 7.5), ( 2.5, 2.5))]),\\n (\\\"Strange\\\",\\n @[(( 0.0, 0.0), ( 2.5, 2.5)), (( 2.5, 2.5), ( 0.0, 10.0)),\\n (( 0.0, 10.0), ( 2.5, 7.5)), (( 2.5, 7.5), ( 7.5, 7.5)),\\n (( 7.5, 7.5), (10.0, 10.0)), ((10.0, 10.0), (10.0, 0.0)),\\n ((10.0, 0.0), ( 2.5, 2.5))]),\\n (\\\"Hexagon\\\",\\n @[(( 3.0, 0.0), ( 7.0, 0.0)), (( 7.0, 0.0), (10.0, 5.0)),\\n ((10.0, 5.0), ( 7.0, 10.0)), (( 7.0, 10.0), ( 3.0, 10.0)),\\n (( 3.0, 10.0), ( 0.0, 5.0)), (( 0.0, 5.0), ( 3.0, 0.0))])\\n ]\\n\\n TestPoints: array[7, Point] =\\n [(5.0, 5.0), (5.0, 8.0), (-10.0, 5.0), (0.0, 5.0), (10.0, 5.0), (8.0, 5.0), (10.0, 10.0)]\\n\\n for poly in Polys:\\n echo &\\\"Is point inside figure {poly.name}?\\\"\\n for p in TestPoints:\\n echo &\\\" ({p.x:3},{p.y:3}): {poly.contains(p)}\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"type point = { x:float; y:float }\\n\\ntype polygon = {\\n vertices: point array;\\n edges: (int * int) list;\\n}\\n\\nlet p x y = { x=x; y=y }\\n\\nlet square_v = [|\\n (p 0. 0.); (p 10. 0.); (p 10. 10.); (p 0. 10.);\\n (p 2.5 2.5); (p 7.5 0.1); (p 7.5 7.5); (p 2.5 7.5)\\n|]\\n\\nlet esa_v = [|\\n (p 3. 0.); (p 7. 0.); (p 10. 5.); (p 7. 10.); (p 3. 10.); (p 0. 5.)\\n|]\\n\\nlet esa = {\\n vertices = esa_v;\\n edges = [ (0,1); (1,2); (2,3); (3,4); (4,5); (5,0) ]\\n}\\n\\nlet square = {\\n vertices = square_v;\\n edges = [ (0,1); (1,2); (2,3); (3,0) ]\\n}\\n\\nlet squarehole = {\\n vertices = square_v;\\n edges = [ (0,1); (1,2); (2,3); (3,0); (4,5); (5,6); (6,7); (7,4) ]\\n}\\n\\nlet strange = {\\n vertices = square_v;\\n edges = [ (0,4); (4,3); (3,7); (7,6); (6,2); (2,1); (1,5); (5,0) ]\\n}\\n\\n\\nlet min_y ~a ~b = if a.y > b.y then (b) else (a)\\n\\nlet coeff_ang ~pa ~pb = (pb.y -. pa.y) /. (pb.x -. pa.x)\\n\\nlet huge_val = infinity\\n\\nlet hseg_intersect_seg ~s ~a ~b =\\n let _eps =\\n if s.y = (max a.y b.y) ||\\n s.y = (min a.y b.y) then 0.00001 else 0.0\\n in\\n if (s.y +. _eps) > (max a.y b.y) ||\\n (s.y +. _eps) < (min a.y b.y) ||\\n s.x > (max a.x b.x) then (false)\\n else if s.x <= (min a.x b.x) then (true)\\n else\\n let ca = if a.x <> b.x then (coeff_ang a b) else (huge_val) in\\n let my = min_y ~a ~b in\\n let cp = if (s.x -. my.x) <> 0.0 then (coeff_ang my s) else (huge_val) in\\n (cp >= ca)\\n;;\\n\\n\\nlet point_is_inside ~poly ~pt =\\n let cross = ref 0 in\\n List.iter (fun (a,b) ->\\n if hseg_intersect_seg pt\\n poly.vertices.(a)\\n poly.vertices.(b)\\n then incr cross\\n ) poly.edges;\\n ( (!cross mod 2) <> 0)\\n;;\\n\\n\\nlet make_test p label s =\\n Printf.printf \\\"point (%.5f,%.5f) is \\\" p.x p.y;\\n print_string (if point_is_inside s p\\n then \\\"INSIDE \\\"\\n else \\\"OUTSIDE \\\");\\n print_endline label;\\n;;\\n\\n\\nlet () =\\n let test_points = [\\n (p 5. 5.); (p 5. 8.); (p 2. 2.); (p 0. 0.);\\n (p 10. 10.); (p 2.5 2.5); (p 0.01 5.);\\n (p 2.2 7.4); (p 0. 5.); (p 10. 5.); (p (-4.) 10.) ] in\\n\\n List.iter (fun p ->\\n make_test p \\\"square\\\" square;\\n make_test p \\\"squarehole\\\" squarehole;\\n make_test p \\\"strange\\\" strange;\\n make_test p \\\"esa\\\" esa;\\n print_newline()\\n ) test_points;\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"use strict;\\nuse List::Util qw(max min);\\n\\nsub point_in_polygon\\n{\\n my ( $point, $polygon ) = @_;\\n\\n my $count = 0;\\n foreach my $side ( @$polygon ) {\\n\\t$count++ if ray_intersect_segment($point, $side);\\n }\\n return ($count % 2 == 0) ? 0 : 1;\\n}\\n\\n\\nmy $eps = 0.0001;\\nmy $inf = 1e600;\\n\\nsub ray_intersect_segment\\n{\\n my ($point, $segment) = @_;\\n\\n my ($A, $B) = @$segment;\\n\\n my @P = @$point; # copy it\\n\\n ($A, $B) = ($B, $A) if $A->[1] > $B->[1];\\n\\n $P[1] += $eps if ($P[1] == $A->[1]) || ($P[1] == $B->[1]);\\n\\n return 0 if ($P[1] < $A->[1]) || ( $P[1] > $B->[1]) || ($P[0] > max($A->[0],$B->[1]) );\\n return 1 if $P[0] < min($A->[0], $B->[0]);\\n\\n my $m_red = ($A->[0] != $B->[0]) ? ( $B->[1] - $A->[1] )/($B->[0] - $A->[0]) : $inf;\\n my $m_blue = ($A->[0] != $P[0]) ? ( $P[1] - $A->[1] )/($P[0] - $A->[0]) : $inf;\\n\\n return ($m_blue >= $m_red) ? 1 : 0;\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"# the following are utilities to use the same Fortran data...\\nsub point\\n{\\n [shift, shift];\\n}\\nsub create_polygon\\n{\\n my ($pts, $sides) = @_;\\n my @poly;\\n for(my $i = 0; $i < $#$sides; $i += 2) {\\n\\tpush @poly, [ $pts->[$sides->[$i]-1], $pts->[$sides->[$i+1]-1] ];\\n }\\n \\\\@poly;\\n}\\n\\nmy @pts = ( point(0,0), point(10,0), point(10,10), point(0,10),\\n\\t point(2.5,2.5), point(7.5,2.5), point(7.5,7.5), point(2.5,7.5),\\n\\t point(0,5), point(10,5),\\n\\t point(3,0), point(7,0), point(7,10), point(3,10) );\\n\\nmy %pgs = (\\n squared => create_polygon(\\\\@pts, [ 1,2, 2,3, 3,4, 4,1 ] ),\\n squaredhole => create_polygon(\\\\@pts, [ 1,2, 2,3, 3,4, 4,1, 5,6, 6,7, 7,8, 8,5 ] ),\\n strange => create_polygon(\\\\@pts, [ 1,5, 5,4, 4,8, 8,7, 7,3, 3,2, 2,5 ] ),\\n exagon => create_polygon(\\\\@pts, [ 11,12, 12,10, 10,13, 13,14, 14,9, 9,11 ]) ,\\n);\\n\\nmy @p = ( point(5,5), point(5, 8), point(-10, 5), point(0,5), point(10,5), &\\n\\t point(8,5), point(10,10) );\\n\\nforeach my $pol ( sort keys %pgs ) {\\n no strict 'refs';\\n print \\\"$pol\\\\n\\\";\\n my $rp = $pgs{$pol};\\n foreach my $tp ( @p ) {\\n\\tprint \\\"\\\\t($tp->[0],$tp->[1]) \\\" .\\n ( point_in_polygon($tp, $rp) ? \\\"INSIDE\\\" : \\\"OUTSIDE\\\" ) . \\\"\\\\n\\\";\\n }\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">inf</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1e300</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">1e300</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">rayIntersectsSegment</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">point</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">segment</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">segment</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">pX</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pY</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">point</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">aX</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">aY</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">bX</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">bY</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">m_red</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">m_blue</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- ensure {aX,aY} is the segment end-point with the smallest y coordinate</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">aY</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">bY</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">bX</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">bY</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">a</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">aX</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">aY</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">b</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">pY</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">aY</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">pY</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">bY</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- Consider a ray passing through the top or left corner of a diamond:\\n -- /\\n -- --- or -\\n -- ^ \\\\\\n -- In both cases it touches both edges, but ends up outside in the\\n -- top case, whereas it ends up inside in the left case. Just move\\n -- the y co-ordinate down a smidge and it'll work properly, by\\n -- missing one line in the left/right cases and hitting both/none\\n -- in the top/bottom cases.\\n --</span>\\n <span style=\\\"color: #000000;\\\">pY</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">0.000001</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">pY</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">aY</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">pY</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">bY</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">false</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">pX</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #7060A8;\\\">max</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">aX</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">bX</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">false</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">pX</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">aX</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">bX</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">aX</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">bX</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">m_red</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">bY</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">aY</span><span style=\\\"color: #0000FF;\\\">)/(</span><span style=\\\"color: #000000;\\\">bX</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">aX</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">m_red</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">inf</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">aX</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">pX</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">m_blue</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pY</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">aY</span><span style=\\\"color: #0000FF;\\\">)/(</span><span style=\\\"color: #000000;\\\">pX</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">aX</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">m_blue</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">inf</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">m_blue</span> <span style=\\\"color: #0000FF;\\\">>=</span> <span style=\\\"color: #000000;\\\">m_red</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">inside</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">point</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">poly</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">poly</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">rayIntersectsSegment</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">point</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">poly</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">instr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">flag</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">expected</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"in\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"out\\\"</span><span style=\\\"color: #0000FF;\\\">}[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">flag</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">flag</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">expected</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #008000;\\\">\\\"*** ERROR ***\\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">instar</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">flag</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008000;\\\">\\\"* \\\"</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">flag</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">test_points</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">},{-</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">}}</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">--constant NAME = 1, POLY = 2, EXPECTED = 3</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">test_polygons</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"square\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{{{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">}}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"square hole\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{{{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">7.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">7.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">7.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7.5</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">7.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7.5</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7.5</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7.5</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">}}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"strange\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{{{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7.5</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7.5</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">7.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7.5</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #000000;\\\">7.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7.5</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2.5</span><span style=\\\"color: #0000FF;\\\">}}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"exagon\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{{{</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">}},{{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">}}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">}}</span>\\n <span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">poly</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">expected</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">tp</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">test_polygons</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">poly</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">expected</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">test_polygons</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n%12s:\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">test_points</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">tp</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">test_points</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" %s, %-4s\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tp</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">instr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">inside</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tp</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">poly</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">expected</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">])})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\\n\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">10</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">test_polygons</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">poly</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">test_polygons</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">10</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">instar</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">inside</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">0.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10.5</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #000000;\\\">poly</span><span style=\\\"color: #0000FF;\\\">)))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\n\\nfunction contains($bounds, $lat, $lng)\\n{\\n $count = 0;\\n $bounds_count = count($bounds);\\n for ($b = 0; $b < $bounds_count; $b++) {\\n $vertex1 = $bounds[$b];\\n $vertex2 = $bounds[($b + 1) % $bounds_count];\\n if (west($vertex1, $vertex2, $lng, $lat))\\n $count++;\\n }\\n\\n return $count % 2;\\n}\\n\\nfunction west($A, $B, $x, $y)\\n{\\n if ($A['y'] <= $B['y']) {\\n if ($y <= $A['y'] || $y > $B['y'] ||\\n $x >= $A['x'] && $x >= $B['x']) {\\n return false;\\n }\\n if ($x < $A['x'] && $x < $B['x']) {\\n return true;\\n }\\n if ($x == $A['x']) {\\n if ($y == $A['y']) {\\n $result1 = NAN;\\n } else {\\n $result1 = INF;\\n }\\n } else {\\n $result1 = ($y - $A['y']) / ($x - $A['x']);\\n }\\n if ($B['x'] == $A['x']) {\\n if ($B['y'] == $A['y']) {\\n $result2 = NAN;\\n } else {\\n $result2 = INF;\\n }\\n } else {\\n $result2 = ($B['y'] - $A['y']) / ($B['x'] - $A['x']);\\n }\\n return $result1 > $result2;\\n }\\n\\n return west($B, $A, $x, $y);\\n}\\n\\n$square = [\\n 'name' => 'square',\\n 'bounds' => [['x' => 0, 'y' => 0], ['x' => 20, 'y' => 0], ['x' => 20, 'y' => 20], ['x' => 0, 'y' => 20]]\\n];\\n$squareHole = [\\n 'name' => 'squareHole',\\n 'bounds' => [['x' => 0, 'y' => 0], ['x' => 20, 'y' => 0], ['x' => 20, 'y' => 20], ['x' => 0, 'y' => 20], ['x' => 5, 'y' => 5], ['x' => 15, 'y' => 5], ['x' => 15, 'y' => 15], ['x' => 5, 'y' => 15]]\\n];\\n$strange = [\\n 'name' => 'strange',\\n 'bounds' => [['x' => 0, 'y' => 0], ['x' => 5, 'y' => 5], ['x' => 0, 'y' => 20], ['x' => 5, 'y' => 15], ['x' => 15, 'y' => 15], ['x' => 20, 'y' => 20], ['x' => 20, 'y' => 0]]\\n];\\n$hexagon = [\\n 'name' => 'hexagon',\\n 'bounds' => [['x' => 6, 'y' => 0], ['x' => 14, 'y' => 0], ['x' => 20, 'y' => 10], ['x' => 14, 'y' => 20], ['x' => 6, 'y' => 20], ['x' => 0, 'y' => 10]]\\n];\\n\\n$shapes = [$square, $squareHole, $strange, $hexagon];\\n\\n$testPoints = [\\n ['lng' => 10, 'lat' => 10],\\n ['lng' => 10, 'lat' => 16],\\n ['lng' => -20, 'lat' => 10],\\n ['lng' => 0, 'lat' => 10],\\n ['lng' => 20, 'lat' => 10],\\n ['lng' => 16, 'lat' => 10],\\n ['lng' => 20, 'lat' => 20]\\n];\\n\\nfor ($s = 0; $s < count($shapes); $s++) {\\n $shape = $shapes[$s];\\n for ($tp = 0; $tp < count($testPoints); $tp++) {\\n $testPoint = $testPoints[$tp];\\n echo json_encode($testPoint) . \\\"\\\\tin \\\" . $shape['name'] . \\\"\\\\t\\\" . contains($shape['bounds'], $testPoint['lat'], $testPoint['lng']) . PHP_EOL;\\n }\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(scl 4)\\n\\n(de intersects (Px Py Ax Ay Bx By)\\n (when (> Ay By)\\n (xchg 'Ax 'Bx)\\n (xchg 'Ay 'By) )\\n (when (or (= Py Ay) (= Py By))\\n (inc 'Py) )\\n (and\\n (>= Py Ay)\\n (>= By Py)\\n (>= (max Ax Bx) Px)\\n (or\\n (> (min Ax Bx) Px)\\n (= Ax Px)\\n (and\\n (<> Ax Bx)\\n (>=\\n (*/ (- Py Ay) 1.0 (- Px Ax)) # Blue\\n (*/ (- By Ay) 1.0 (- Bx Ax)) ) ) ) ) ) # Red\\n\\n(de inside (Pt Poly)\\n (let Res NIL\\n (for Edge Poly\\n (when (apply intersects Edge (car Pt) (cdr Pt))\\n (onOff Res) ) )\\n Res ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"Structure point_f\\n x.f\\n y.f\\nEndStructure\\nProcedure inpoly(*p.point_f, List poly.point_f())\\n Protected.point_f new, old, lp, rp\\n Protected inside\\n If ListSize(poly()) < 3: ProcedureReturn 0: EndIf\\n LastElement(poly()): old = poly()\\n ForEach poly()\\n ;find leftmost endpoint 'lp' and the rightmost endpoint 'rp' based on x value\\n If poly()\\\\x > old\\\\x\\n lp = old\\n rp = poly()\\n Else\\n lp = poly()\\n rp = old\\n EndIf\\n If lp\\\\x < *p\\\\x And *p\\\\x <= rp\\\\x And (*p\\\\y - lp\\\\y) * (rp\\\\x - lp\\\\x) < (rp\\\\y - lp\\\\y) * (*p\\\\x - lp\\\\x)\\n inside = ~inside\\n EndIf\\n old = poly()\\n Next\\n ProcedureReturn inside & 1\\nEndProcedure\\n\\nIf InitSprite()\\n If InitKeyboard() And InitMouse()\\n OpenWindow(0, 0, 0, 800, 600, \\\"Press [Esc] to close, [Left mouse button] Add Point, [Right mouse button] Clear All Points.\\\", #PB_Window_ScreenCentered | #PB_Window_SystemMenu)\\n OpenWindowedScreen(WindowID(0), 0, 0, 800, 600, 1, 0, 0)\\n SetFrameRate(60)\\n EndIf\\nElse\\n MessageRequester(\\\"\\\", \\\"Unable to initsprite\\\"): End\\nEndIf\\n\\nNewList v.point_f()\\nDefine.point_f pvp, mp\\nDefine Col, EventID, mode.b, modetxt.s\\nRepeat\\n Delay(1)\\n EventID = WindowEvent()\\n ExamineKeyboard()\\n ExamineMouse()\\n ClearScreen(Col)\\n\\n mp\\\\x = MouseX()\\n mp\\\\y = MouseY()\\n If MouseButton(#PB_MouseButton_Left)\\n AddElement(v())\\n v()\\\\x = mp\\\\x\\n v()\\\\y = mp\\\\y\\n Delay(100)\\n EndIf\\n\\n If MouseButton(#PB_MouseButton_Right)\\n ClearList(v())\\n Delay(100)\\n EndIf\\n\\n StartDrawing(ScreenOutput())\\n If LastElement(v())\\n pvp = v()\\n ForEach v()\\n LineXY(pvp\\\\x, pvp\\\\y, v()\\\\x, v()\\\\y, RGB(0, $FF, 0)) ;Green\\n Circle(pvp\\\\x, pvp\\\\y, 5, RGB($FF, 0, 0)) ;Red\\n pvp = v()\\n Next\\n EndIf\\n Circle(MouseX(), MouseY(), 5, RGB($C0, $C0, $FF)) ;LightBlue\\n\\n If inpoly(mp, v())\\n modetxt = \\\"You are in the polygon.\\\"\\n Col = RGB(0, 0, 0)\\n Else\\n modetxt = \\\"You are not in the polygon.\\\"\\n Col = RGB($50, $50, $50)\\n EndIf\\n DrawText((800 - TextWidth(modetxt)) / 2, 0, modetxt)\\n StopDrawing()\\n\\n FlipBuffers()\\nUntil KeyboardReleased(#PB_Key_Escape) Or EventID = #PB_Event_CloseWindow\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"from collections import namedtuple\\nfrom pprint import pprint as pp\\nimport sys\\n\\nPt = namedtuple('Pt', 'x, y') # Point\\nEdge = namedtuple('Edge', 'a, b') # Polygon edge from a to b\\nPoly = namedtuple('Poly', 'name, edges') # Polygon\\n\\n_eps = 0.00001\\n_huge = sys.float_info.max\\n_tiny = sys.float_info.min\\n\\ndef rayintersectseg(p, edge):\\n ''' takes a point p=Pt() and an edge of two endpoints a,b=Pt() of a line segment returns boolean\\n '''\\n a,b = edge\\n if a.y > b.y:\\n a,b = b,a\\n if p.y == a.y or p.y == b.y:\\n p = Pt(p.x, p.y + _eps)\\n\\n intersect = False\\n\\n if (p.y > b.y or p.y < a.y) or (\\n p.x > max(a.x, b.x)):\\n return False\\n\\n if p.x < min(a.x, b.x):\\n intersect = True\\n else:\\n if abs(a.x - b.x) > _tiny:\\n m_red = (b.y - a.y) / float(b.x - a.x)\\n else:\\n m_red = _huge\\n if abs(a.x - p.x) > _tiny:\\n m_blue = (p.y - a.y) / float(p.x - a.x)\\n else:\\n m_blue = _huge\\n intersect = m_blue >= m_red\\n return intersect\\n\\ndef _odd(x): return x%2 == 1\\n\\ndef ispointinside(p, poly):\\n ln = len(poly)\\n return _odd(sum(rayintersectseg(p, edge)\\n for edge in poly.edges ))\\n\\ndef polypp(poly):\\n print (\\\"\\\\n Polygon(name='%s', edges=(\\\" % poly.name)\\n print (' ', ',\\\\n '.join(str(e) for e in poly.edges) + '\\\\n ))')\\n\\nif __name__ == '__main__':\\n polys = [\\n Poly(name='square', edges=(\\n Edge(a=Pt(x=0, y=0), b=Pt(x=10, y=0)),\\n Edge(a=Pt(x=10, y=0), b=Pt(x=10, y=10)),\\n Edge(a=Pt(x=10, y=10), b=Pt(x=0, y=10)),\\n Edge(a=Pt(x=0, y=10), b=Pt(x=0, y=0))\\n )),\\n Poly(name='square_hole', edges=(\\n Edge(a=Pt(x=0, y=0), b=Pt(x=10, y=0)),\\n Edge(a=Pt(x=10, y=0), b=Pt(x=10, y=10)),\\n Edge(a=Pt(x=10, y=10), b=Pt(x=0, y=10)),\\n Edge(a=Pt(x=0, y=10), b=Pt(x=0, y=0)),\\n Edge(a=Pt(x=2.5, y=2.5), b=Pt(x=7.5, y=2.5)),\\n Edge(a=Pt(x=7.5, y=2.5), b=Pt(x=7.5, y=7.5)),\\n Edge(a=Pt(x=7.5, y=7.5), b=Pt(x=2.5, y=7.5)),\\n Edge(a=Pt(x=2.5, y=7.5), b=Pt(x=2.5, y=2.5))\\n )),\\n Poly(name='strange', edges=(\\n Edge(a=Pt(x=0, y=0), b=Pt(x=2.5, y=2.5)),\\n Edge(a=Pt(x=2.5, y=2.5), b=Pt(x=0, y=10)),\\n Edge(a=Pt(x=0, y=10), b=Pt(x=2.5, y=7.5)),\\n Edge(a=Pt(x=2.5, y=7.5), b=Pt(x=7.5, y=7.5)),\\n Edge(a=Pt(x=7.5, y=7.5), b=Pt(x=10, y=10)),\\n Edge(a=Pt(x=10, y=10), b=Pt(x=10, y=0)),\\n Edge(a=Pt(x=10, y=0), b=Pt(x=2.5, y=2.5))\\n )),\\n Poly(name='exagon', edges=(\\n Edge(a=Pt(x=3, y=0), b=Pt(x=7, y=0)),\\n Edge(a=Pt(x=7, y=0), b=Pt(x=10, y=5)),\\n Edge(a=Pt(x=10, y=5), b=Pt(x=7, y=10)),\\n Edge(a=Pt(x=7, y=10), b=Pt(x=3, y=10)),\\n Edge(a=Pt(x=3, y=10), b=Pt(x=0, y=5)),\\n Edge(a=Pt(x=0, y=5), b=Pt(x=3, y=0))\\n )),\\n ]\\n testpoints = (Pt(x=5, y=5), Pt(x=5, y=8),\\n Pt(x=-10, y=5), Pt(x=0, y=5),\\n Pt(x=10, y=5), Pt(x=8, y=5),\\n Pt(x=10, y=10))\\n\\n print (\\\"\\\\n TESTING WHETHER POINTS ARE WITHIN POLYGONS\\\")\\n for poly in polys:\\n polypp(poly)\\n print (' ', '\\\\t'.join(\\\"%s: %s\\\" % (p, ispointinside(p, poly))\\n for p in testpoints[:3]))\\n print (' ', '\\\\t'.join(\\\"%s: %s\\\" % (p, ispointinside(p, poly))\\n for p in testpoints[3:6]))\\n print (' ', '\\\\t'.join(\\\"%s: %s\\\" % (p, ispointinside(p, poly))\\n for p in testpoints[6:]))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def _convert_fortran_shapes():\\n point = Pt\\n pts = (point(0,0), point(10,0), point(10,10), point(0,10),\\n point(2.5,2.5), point(7.5,2.5), point(7.5,7.5), point(2.5,7.5),\\n point(0,5), point(10,5),\\n point(3,0), point(7,0), point(7,10), point(3,10))\\n p = (point(5,5), point(5, 8), point(-10, 5), point(0,5), point(10,5),\\n point(8,5), point(10,10) )\\n\\n def create_polygon(pts,vertexindex):\\n return [tuple(Edge(pts[vertexindex[i]-1], pts[vertexindex[i+1]-1])\\n for i in range(0, len(vertexindex), 2) )]\\n polys=[]\\n polys += create_polygon(pts, ( 1,2, 2,3, 3,4, 4,1 ) )\\n polys += create_polygon(pts, ( 1,2, 2,3, 3,4, 4,1, 5,6, 6,7, 7,8, 8,5 ) )\\n polys += create_polygon(pts, ( 1,5, 5,4, 4,8, 8,7, 7,3, 3,2, 2,5 ) )\\n polys += create_polygon(pts, ( 11,12, 12,10, 10,13, 13,14, 14,9, 9,11 ) )\\n\\n names = ( \\\"square\\\", \\\"square_hole\\\", \\\"strange\\\", \\\"exagon\\\" )\\n polys = [Poly(name, edges)\\n for name, edges in zip(names, polys)]\\n print 'polys = ['\\n for p in polys:\\n print \\\" Poly(name='%s', edges=(\\\" % p.name\\n print ' ', ',\\\\n '.join(str(e) for e in p.edges) + '\\\\n )),'\\n print ' ]'\\n _convert_fortran_shapes()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"point_in_polygon <- function(polygon, p) {\\n count <- 0\\n for(side in polygon) {\\n if ( ray_intersect_segment(p, side) ) {\\n count <- count + 1\\n }\\n }\\n if ( count %% 2 == 1 )\\n \\\"INSIDE\\\"\\n else\\n \\\"OUTSIDE\\\"\\n}\\n\\nray_intersect_segment <- function(p, side) {\\n eps <- 0.0001\\n a <- side$A\\n b <- side$B\\n if ( a$y > b$y ) {\\n a <- side$B\\n b <- side$A\\n }\\n if ( (p$y == a$y) || (p$y == b$y) ) {\\n p$y <- p$y + eps\\n }\\n if ( (p$y < a$y) || (p$y > b$y) )\\n return(FALSE)\\n else if ( p$x > max(a$x, b$x) )\\n return(FALSE)\\n else {\\n if ( p$x < min(a$x, b$x) )\\n return(TRUE)\\n else {\\n if ( a$x != b$x )\\n m_red <- (b$y - a$y) / (b$x - a$x)\\n else\\n m_red <- Inf\\n if ( a$x != p$x )\\n m_blue <- (p$y - a$y) / (p$x - a$x)\\n else\\n m_blue <- Inf\\n return( m_blue >= m_red )\\n }\\n }\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"######## utility functions #########\\n\\npoint <- function(x,y) list(x=x, y=y)\\n\\n# pts = list(p1, p2, ... )... coords\\n# segs = list(c(1,2), c(2,1) ...) indices\\ncreatePolygon <- function(pts, segs) {\\n pol <- list()\\n for(pseg in segs) {\\n pol <- c(pol, list(list(A=pts[[pseg[1]]], B=pts[[pseg[2]]])))\\n }\\n pol\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#### testing ####\\n\\npts <- list(point(0,0), point(10,0), point(10,10), point(0,10),\\n point(2.5,2.5), point(7.5,2.5), point(7.5,7.5), point(2.5,7.5),\\n point(0,5), point(10,5),\\n point(3,0), point(7,0), point(7,10), point(3,10))\\n\\npolygons <-\\n list(\\n square = createPolygon(pts, list(c(1,2), c(2,3), c(3,4), c(4,1))),\\n squarehole = createPolygon(pts, list(c(1,2), c(2,3), c(3,4), c(4,1), c(5,6), c(6,7), c(7,8), c(8,5))),\\n exagon = createPolygon(pts, list(c(11,12), c(12,10), c(10,13), c(13,14), c(14,9), c(9,11)))\\n )\\n\\ntestpoints <-\\n list(\\n point(5,5), point(5, 8), point(-10, 5), point(0,5), point(10,5),\\n point(8,5), point(9.9,9.9)\\n )\\n\\nfor(p in testpoints) {\\n for(polysi in 1:length(polygons)) {\\n cat(sprintf(\\\"point (%lf, %lf) is %s polygon (%s)\\\\n\\\",\\n p$x, p$y, point_in_polygon(polygons[[polysi]], p), names(polygons[polysi])))\\n }\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(module pip racket\\n (require racket/contract)\\n\\n (provide point)\\n (provide seg)\\n (provide (contract-out [point-in-polygon? (->\\n point?\\n list?\\n boolean?)]))\\n\\n (struct point (x y) #:transparent)\\n (struct seg (Ax Ay Bx By) #:transparent)\\n (define ε 0.000001)\\n (define (neq? x y) (not (eq? x y)))\\n\\n (define (ray-cross-seg? r s)\\n (let* ([Ax (seg-Ax s)] [Ay (seg-Ay s)]\\n [Bx (seg-Bx s)] [By (seg-By s)]\\n [Px (point-x r)] [Pyo (point-y r)]\\n [Py (+ Pyo (if (or (eq? Pyo Ay)\\n (eq? Pyo By))\\n ε 0))])\\n\\n (define Ax2 (if (< Ay By) Ax Bx))\\n (define Ay2 (if (< Ay By) Ay By))\\n (define Bx2 (if (< Ay By) Bx Ax))\\n (define By2 (if (< Ay By) By Ay))\\n\\n (cond [(or (> Py (max Ay By)) (< Py (min Ay By))) #f]\\n [(> Px (max Ax Bx)) #f]\\n [else (cond\\n [(< Px (min Ax Bx)) #t]\\n [else\\n (let ([red (if (neq? Ax2 Bx2)\\n (/ (- By2 Ay2) (- Bx2 Ax2))\\n +inf.0)]\\n [blue (if (neq? Ax2 Px)\\n (/ (- Py Ay2) (- Px Ax2))\\n +inf.0)])\\n (if (>= blue red) #t #f))])])))\\n\\n (define (point-in-polygon? point polygon)\\n (odd?\\n (for/fold ([c 0]) ([seg polygon])\\n (+ c (if (ray-cross-seg? point seg) 1 0))))))\\n\\n(require 'pip)\\n\\n(define test-point-list\\n (list\\n (point 5.0 5.0)\\n (point 5.0 8.0)\\n (point -10.0 5.0)\\n (point 0.0 5.0)\\n (point 10.0 5.0)\\n (point 8.0 5.0)\\n (point 10.0 10.0)))\\n\\n(define square\\n (list (seg 0.0 0.0 10.0 0.0)\\n (seg 10.0 0.0 10.0 10.0)\\n (seg 10.0 10.0 0.0 10.0)\\n (seg 0.0 0.0 0.0 10.0)))\\n\\n(define exagon\\n (list (seg 3.0 0.0 7.0 0.0)\\n (seg 7.0 0.0 10.0 5.0)\\n (seg 10.0 5.0 7.0 10.0)\\n (seg 7.0 10.0 3.0 10.0)\\n (seg 0.0 5.0 3.0 10.0)\\n (seg 3.0 0.0 0.0 5.0)))\\n\\n(define (test-figure fig name)\\n (printf \\\"\\\\ntesting ~a: \\\\n\\\" name)\\n (for ([p test-point-list])\\n (printf \\\"testing ~v: ~a\\\\n\\\" p (point-in-polygon? p fig))))\\n\\n(test-figure square \\\"square\\\")\\n(test-figure exagon \\\"exagon\\\")\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"constant ε = 0.0001;\\n\\nsub ray-hits-seg([\\\\Px,\\\\Py], [[\\\\Ax,\\\\Ay], [\\\\Bx,\\\\By]] --> Bool) {\\n Py += ε if Py == Ay | By;\\n\\n if Py < Ay or Py > By or Px > (Ax max Bx) {\\n\\tFalse;\\n }\\n elsif Px < (Ax min Bx) {\\n\\tTrue;\\n }\\n else {\\n\\tmy \\\\red = Ax == Bx ?? Inf !! (By - Ay) / (Bx - Ax);\\n\\tmy \\\\blue = Ax == Px ?? Inf !! (Py - Ay) / (Px - Ax);\\n\\tblue >= red;\\n }\\n}\\n\\nsub point-in-poly(@point, @polygon --> Bool) {\\n so 2 R% [+] gather for @polygon -> @side {\\n\\ttake ray-hits-seg @point, @side.sort(*.[1]);\\n }\\n}\\n\\nmy %poly =\\n squared =>\\n\\t [[[ 0.0, 0.0], [10.0, 0.0]],\\n\\t [[10.0, 0.0], [10.0, 10.0]],\\n\\t [[10.0, 10.0], [ 0.0, 10.0]],\\n\\t [[ 0.0, 10.0], [ 0.0, 0.0]]],\\n squaredhole =>\\n\\t [[[ 0.0, 0.0], [10.0, 0.0]],\\n\\t [[10.0, 0.0], [10.0, 10.0]],\\n\\t [[10.0, 10.0], [ 0.0, 10.0]],\\n\\t [[ 0.0, 10.0], [ 0.0, 0.0]],\\n\\t [[ 2.5, 2.5], [ 7.5, 2.5]],\\n\\t [[ 7.5, 2.5], [ 7.5, 7.5]],\\n\\t [[ 7.5, 7.5], [ 2.5, 7.5]],\\n\\t [[ 2.5, 7.5], [ 2.5, 2.5]]],\\n strange =>\\n\\t [[[ 0.0, 0.0], [ 2.5, 2.5]],\\n\\t [[ 2.5, 2.5], [ 0.0, 10.0]],\\n\\t [[ 0.0, 10.0], [ 2.5, 7.5]],\\n\\t [[ 2.5, 7.5], [ 7.5, 7.5]],\\n\\t [[ 7.5, 7.5], [10.0, 10.0]],\\n\\t [[10.0, 10.0], [10.0, 0.0]],\\n\\t [[10.0, 0.0], [ 2.5, 2.5]],\\n\\t [[ 2.5, 2.5], [ 0.0, 0.0]]], # conjecturally close polygon\\n exagon =>\\n\\t [[[ 3.0, 0.0], [ 7.0, 0.0]],\\n\\t [[ 7.0, 0.0], [10.0, 5.0]],\\n\\t [[10.0, 5.0], [ 7.0, 10.0]],\\n\\t [[ 7.0, 10.0], [ 3.0, 10.0]],\\n\\t [[ 3.0, 10.0], [ 0.0, 5.0]],\\n\\t [[ 0.0, 5.0], [ 3.0, 0.0]]];\\n\\nmy @test-points =\\n\\t [ 5.0, 5.0],\\n\\t [ 5.0, 8.0],\\n\\t [-10.0, 5.0],\\n\\t [ 0.0, 5.0],\\n\\t [ 10.0, 5.0],\\n\\t [ 8.0, 5.0],\\n\\t [ 10.0, 10.0];\\n\\nfor <squared squaredhole strange exagon> -> $polywanna {\\n say \\\"$polywanna\\\";\\n my @poly = %poly{$polywanna}[];\\n for @test-points -> @point {\\n\\tsay \\\"\\\\t(@point.fmt('%.1f',','))\\\\t{ point-in-poly(@point, @poly) ?? 'IN' !! 'OUT' }\\\";\\n }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program verifies if a horizontal ray from point P intersects a polygon. */\\ncall points 5 5, 5 8, -10 5, 0 5, 10 5, 8 5, 10 10\\n A= 2.5; B= 7.5 /* ◄───── used for shorter arguments (below).*/\\ncall poly 0 0, 10 0, 10 10, 0 10 ; call test 'square'\\ncall poly 0 0, 10 0, 10 10, 0 10, A A, B A, B B, A B ; call test 'square hole'\\ncall poly 0 0, A A, 0 10, A B, B B, 10 10, 10 0 ; call test 'irregular'\\ncall poly 3 0, 7 0, 10 5, 7 10, 3 10, 0 5 ; call test 'hexagon'\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nin$out: procedure expose point. poly.; parse arg p; #= 0\\n do side=1 to poly.0 by 2; #= # +intersect(p, side); end /*side*/\\n return # // 2 /*ODD is inside. EVEN is outside.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nintersect: procedure expose point. poly.; parse arg ?,s; sp= s + 1\\n epsilon= '1e' || (-digits() % 2)\\n Px= point.?.x; Ax= poly.s.x; Bx= poly.sp.x\\n Py= point.?.y; Ay= poly.s.y; By= poly.sp.y /* [↓] do vertex swap.*/\\n if Ay>By then parse value Ax Ay Bx By with Bx By Ax Ay\\n if Py=Ay | Py=By then Py= Py + epsilon\\n if Py<Ay | Py>By | Px>max(Ax, Bx) then return 0\\n if Px<min(Ax, Bx) then return 1\\n if Ax\\\\=Bx then red = (By-Ay) / (Bx-Ax)\\n else red = i\\\"1e\\\" || (digits() *2) /* ◄─── infinity.*/\\n if Ax\\\\=Px then return (Py-Ay) / (Px-Ax) >= red\\n else return 1\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\npoints: wx= 0; wy= 0; do j=1 for arg(); parse value arg(j) with xx yy\\n wx= max(wx, length(xx) ); call value 'POINT.'j\\\".X\\\", xx\\n wy= max(wy, length(yy) ); call value 'POINT.'j\\\".Y\\\", yy\\n end /*j*/\\n call value point.0, j-1 /*define the number of points. */\\n return /* [↑] adjust J (for DO loop)*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\npoly: @= 'POLY.'; parse arg Fx Fy /* [↓] process the X,Y points.*/\\n n= 0\\n do j=1 for arg(); n= n + 1; parse value arg(j) with xx yy\\n call value @ || n'.X', xx ; call value @ || n\\\".Y\\\", yy\\n if n//2 then iterate; n= n + 1 /*Inside? Then skip this point.*/\\n call value @ || n'.X', xx ; call value @ || n\\\".Y\\\", yy\\n end /*j*/\\n n= n + 1 /*POLY.0 is # segments(sides).*/\\n call value @ || n'.X', Fx; call value @ || n\\\".Y\\\", Fy; call value @'0', n\\n return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ntest: say; do k=1 for point.0; w= wx + wy + 2 /*W, WX, WY ≡are various widths*/\\n say right(' ['arg(1)\\\"] point:\\\", 30),\\n right( right(point.k.x, wx)', 'right(point.k.y, wy), w) \\\" is \\\",\\n right( word('outside inside', in$out(k) + 1), 7)\\n end /*k*/\\n return /* [↑] format the output nicely*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"use std::f64;\\n\\nconst _EPS: f64 = 0.00001;\\nconst _MIN: f64 = f64::MIN_POSITIVE;\\nconst _MAX: f64 = f64::MAX;\\n\\n#[derive(Clone)]\\nstruct Point {\\n x: f64,\\n y: f64,\\n}\\n\\n#[derive(Clone)]\\nstruct Edge {\\n pt1: Point,\\n pt2: Point,\\n}\\n\\nimpl Edge {\\n fn new(pt1: (f64, f64), pt2: (f64, f64)) -> Edge {\\n Edge {\\n pt1: Point { x: pt1.0, y: pt1.1 },\\n pt2: Point { x: pt2.0, y: pt2.1 },\\n }\\n }\\n}\\n\\nstruct Polygon {\\n edges: Vec<Edge>, // Polygon has to be created with counter-clockwise coordinates\\n}\\n\\nfn pt_in_polygon(pt: &Point, poly: &Polygon) -> bool {\\n let count = poly.edges\\n .iter()\\n .filter(|edge| ray_intersect_seg(pt, edge))\\n .count();\\n\\n count % 2 == 1\\n}\\n\\nfn ray_intersect_seg(p: &Point, edge: &Edge) -> bool {\\n let mut pt = p.clone();\\n let (mut a, mut b): (&Point, &Point) = (&edge.pt1, &edge.pt2);\\n if a.y > b.y {\\n std::mem::swap(&mut a, &mut b);\\n }\\n if pt.y == a.y || pt.y == b.y {\\n pt.y += _EPS;\\n }\\n\\n if (pt.y > b.y || pt.y < a.y) || pt.x > a.x.max(b.x) {\\n false\\n } else if pt.x < a.x.min(b.x) {\\n true\\n } else {\\n let m_red = if (a.x - b.x).abs() > _MIN {\\n (b.y - a.y) / (b.x - a.x)\\n } else {\\n _MAX\\n };\\n let m_blue = if (a.x - pt.x).abs() > _MIN {\\n (pt.y - a.y) / (pt.x - a.x)\\n } else {\\n _MAX\\n };\\n m_blue >= m_red\\n }\\n}\\n\\nfn main() {\\n let p = |x, y| Point { x, y };\\n let testpoints = [p(5.0, 5.0), p(5.0, 8.0), p(-10.0, 5.0), p(0.0, 5.0), p(10.0, 5.0), p(8.0, 5.0), p(10.0, 10.0)];\\n let poly_square = Polygon {\\n edges: vec![\\n Edge::new((0.0, 0.0), (10.0, 0.0)),\\n Edge::new((10.0, 0.0), (10.0, 10.0)),\\n Edge::new((10.0, 10.0), (0.0, 10.0)),\\n Edge::new((0.0, 10.0), (0.0, 0.0)),\\n ],\\n };\\n let poly_square_hole = Polygon {\\n edges: vec![\\n Edge::new((0.0, 0.0), (10.0, 0.0)),\\n Edge::new((10.0, 0.0), (10.0, 10.0)),\\n Edge::new((10.0, 10.0), (0.0, 10.0)),\\n Edge::new((0.0, 10.0), (0.0, 0.0)),\\n Edge::new((2.5, 2.5), (7.5, 2.5)),\\n Edge::new((7.5, 2.5), (7.5, 7.5)),\\n Edge::new((7.5, 7.5), (2.5, 7.5)),\\n Edge::new((2.5, 7.5), (2.5, 2.5)),\\n ],\\n };\\n let poly_strange = Polygon {\\n edges: vec![\\n Edge::new((0.0, 0.0), (2.5, 2.5)),\\n Edge::new((2.5, 2.5), (0.0, 10.0)),\\n Edge::new((0.0, 10.0), (2.5, 7.5)),\\n Edge::new((2.5, 7.5), (7.5, 7.5)),\\n Edge::new((7.5, 7.5), (10.0, 10.0)),\\n Edge::new((10.0, 10.0), (10.0, 0.0)),\\n Edge::new((10.0, 0.0), (2.5, 2.5)),\\n ],\\n };\\n let poly_hexagon = Polygon {\\n edges: vec![\\n Edge::new((3.0, 0.0), (7.0, 0.0)),\\n Edge::new((7.0, 0.0), (10.0, 5.0)),\\n Edge::new((10.0, 5.0), (7.0, 10.0)),\\n Edge::new((7.0, 10.0), (3.0, 10.0)),\\n Edge::new((3.0, 10.0), (0.0, 5.0)),\\n Edge::new((0.0, 5.0), (3.0, 0.0)),\\n ],\\n };\\n print!(\\\"\\\\nSquare :\\\");\\n for pt in &testpoints {\\n print!(\\\" {:?}\\\", pt_in_polygon(pt, &poly_square));\\n }\\n print!(\\\"\\\\nSquare with hole:\\\");\\n for pt in &testpoints {\\n print!(\\\" {:?}\\\", pt_in_polygon(pt, &poly_square_hole));\\n }\\n print!(\\\"\\\\nStrange polygon :\\\");\\n for pt in &testpoints {\\n print!(\\\" {:?}\\\", pt_in_polygon(pt, &poly_strange));\\n }\\n print!(\\\"\\\\nHexagon :\\\");\\n for pt in &testpoints {\\n print!(\\\" {:?}\\\", pt_in_polygon(pt, &poly_hexagon));\\n }\\n println!();\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"package scala.ray_casting\\n\\ncase class Edge(_1: (Double, Double), _2: (Double, Double)) {\\n import Math._\\n import Double._\\n\\n def raySegI(p: (Double, Double)): Boolean = {\\n if (_1._2 > _2._2) return Edge(_2, _1).raySegI(p)\\n if (p._2 == _1._2 || p._2 == _2._2) return raySegI((p._1, p._2 + epsilon))\\n if (p._2 > _2._2 || p._2 < _1._2 || p._1 > max(_1._1, _2._1))\\n return false\\n if (p._1 < min(_1._1, _2._1)) return true\\n val blue = if (abs(_1._1 - p._1) > MinValue) (p._2 - _1._2) / (p._1 - _1._1) else MaxValue\\n val red = if (abs(_1._1 - _2._1) > MinValue) (_2._2 - _1._2) / (_2._1 - _1._1) else MaxValue\\n blue >= red\\n }\\n\\n final val epsilon = 0.00001\\n}\\n\\ncase class Figure(name: String, edges: Seq[Edge]) {\\n def contains(p: (Double, Double)) = edges.count(_.raySegI(p)) % 2 != 0\\n}\\n\\nobject Ray_casting extends App {\\n val figures = Seq(Figure(\\\"Square\\\", Seq(((0.0, 0.0), (10.0, 0.0)), ((10.0, 0.0), (10.0, 10.0)),\\n ((10.0, 10.0), (0.0, 10.0)),((0.0, 10.0), (0.0, 0.0)))),\\n Figure(\\\"Square hole\\\", Seq(((0.0, 0.0), (10.0, 0.0)), ((10.0, 0.0), (10.0, 10.0)),\\n ((10.0, 10.0), (0.0, 10.0)), ((0.0, 10.0), (0.0, 0.0)), ((2.5, 2.5), (7.5, 2.5)),\\n ((7.5, 2.5), (7.5, 7.5)),((7.5, 7.5), (2.5, 7.5)), ((2.5, 7.5), (2.5, 2.5)))),\\n Figure(\\\"Strange\\\", Seq(((0.0, 0.0), (2.5, 2.5)), ((2.5, 2.5), (0.0, 10.0)),\\n ((0.0, 10.0), (2.5, 7.5)), ((2.5, 7.5), (7.5, 7.5)), ((7.5, 7.5), (10.0, 10.0)),\\n ((10.0, 10.0), (10.0, 0.0)), ((10.0, 0.0), (2.5, 2.5)))),\\n Figure(\\\"Exagon\\\", Seq(((3.0, 0.0), (7.0, 0.0)), ((7.0, 0.0), (10.0, 5.0)), ((10.0, 5.0), (7.0, 10.0)),\\n ((7.0, 10.0), (3.0, 10.0)), ((3.0, 10.0), (0.0, 5.0)), ((0.0, 5.0), (3.0, 0.0)))))\\n\\n val points = Seq((5.0, 5.0), (5.0, 8.0), (-10.0, 5.0), (0.0, 5.0), (10.0, 5.0), (8.0, 5.0), (10.0, 10.0))\\n\\n println(\\\"points: \\\" + points)\\n for (f <- figures) {\\n println(\\\"figure: \\\" + f.name)\\n println(\\\" \\\" + f.edges)\\n println(\\\"result: \\\" + (points map f.contains))\\n }\\n\\n private implicit def to_edge(p: ((Double, Double), (Double, Double))): Edge = Edge(p._1, p._2)\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"Object subclass: Segment [\\n |pts|\\n Segment class >> new: points [ |a|\\n a := super new.\\n ^ a init: points\\n ]\\n init: points [ pts := points copy. ^self ]\\n endPoints [ ^pts ]\\n \\\"utility methods\\\"\\n first [ ^ pts at: 1]\\n second [ ^ pts at: 2]\\n leftmostEndPoint [\\n ^ (self first x > self second x) ifTrue: [ self second ] ifFalse: [ self first ]\\n ]\\n rightmostEndPoint [\\n ^ (self first x > self second x) ifTrue: [ self first ] ifFalse: [ self second ]\\n ]\\n topmostEndPoint [\\n ^ (self first y > self second y) ifTrue: [ self first ] ifFalse: [ self second ]\\n ]\\n bottommostEndPoint [\\n ^ (self first y > self second y) ifTrue: [ self second ] ifFalse: [ self first ]\\n ]\\n\\n slope [\\n (pts at: 1) x ~= (pts at: 2) x\\n ifTrue: [ ^ ((pts at: 1) y - (pts at: 2) y) / ((pts at: 1) x - (pts at: 2) x) ]\\n ifFalse: [ ^ FloatD infinity ]\\n ]\\n\\n doesIntersectRayFrom: point [ |p A B|\\n (point y = (pts at: 1) y) | (point y = (pts at: 2) y)\\n ifTrue: [ p := Point x: (point x) y: (point y) + 0.00001 ]\\n ifFalse: [ p := point copy ].\\n A := self bottommostEndPoint.\\n B := self topmostEndPoint.\\n (p y < A y) | (p y > B y) | (p x > (self rightmostEndPoint x))\\n ifTrue: [ ^false ]\\n ifFalse: [ (p x < (self leftmostEndPoint x))\\n ifTrue: [ ^true ]\\n ifFalse: [ |s|\\n s := Segment new: { A . point }.\\n\\t\\t\\t(s slope) >= (self slope)\\n\\t\\t\\t ifTrue: [ ^ true ]\\n ]\\n ].\\n ^false\\n ]\\n].\\n\\nObject subclass: Polygon [\\n |polysegs|\\n Polygon class >> new [ |a| a := super new. ^ a init. ]\\n Polygon class >> fromSegments: segments [ |a|\\n a := super new.\\n ^ a initWithSegments: segments\\n ]\\n Polygon class >> fromPoints: pts and: indexes [ |a|\\n a := self new.\\n indexes do: [ :i |\\n a addSegment: ( Segment new: { pts at: (i at: 1) . pts at: (i at: 2) } )\\n ].\\n ^ a\\n ]\\n initWithSegments: segments [\\n polysegs := segments copy. ^self\\n ]\\n init [ polysegs := OrderedCollection new. ^ self ]\\n addSegment: segment [ polysegs add: segment ]\\n\\n pointInside: point [ |cnt|\\n cnt := 0.\\n polysegs do: [ :s | (s doesIntersectRayFrom: point)\\n ifTrue: [ cnt := cnt + 1 ] ].\\n ^ ( cnt \\\\\\\\ 2 = 0 ) not\\n ]\\n].\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"|points names polys|\\n\\npoints := {\\n 0@0 . 10@0 . 10@10 . 0@10 .\\n 2.5@2.5 . 7.5@2.5 . 7.5@7.5 .\\n 2.5@7.5 . 0@5 . 10@5 .\\n 3@0 . 7@0 . 7@10 . 3@10\\n }.\\n\\nnames := { 'square' . 'square hole' . 'strange' . 'exagon' }.\\n\\npolys := OrderedCollection new.\\n\\npolys add:\\n (\\n Polygon fromPoints: points\\n and: { {1 . 2}. {2 . 3}. {3 . 4}. {4 . 1} }\\n ) ;\\n add:\\n (\\n Polygon fromPoints: points\\n and: { {1 . 2}. {2 . 3}. {3 . 4}. {4 . 1}. {5 . 6}. {6 . 7}. {7 . 8}. {8 . 5} }\\n ) ;\\n add:\\n (\\n Polygon fromPoints: points\\n and: { {1 . 5}. {5 . 4}. {4 . 8}. {8 . 7}. {7 . 3}. {3 . 2}. {2 . 5} }\\n ) ;\\n add:\\n (\\n Polygon fromPoints: points\\n and: { {11 . 12}. {12 . 10}. {10 . 13}. {13 . 14}. {14 . 9}. {9 . 11} }\\n ).\\n\\n{ 5@5 . 5@8 . -10@5 . 0@5 . 10@5 . 8@5 . 10@10 }\\ndo: [ :p |\\n 1 to: 4 do: [ :i |\\n ('point %1 inside %2? %3' %\\n { p . names at: i. (polys at: i) pointInside: p }) displayNl\\n ].\\n ' ' displayNl.\\n]\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"package require Tcl 8.5\\n\\nproc point_in_polygon {point polygon} {\\n set count 0\\n foreach side [sides $polygon] {\\n if {[ray_intersects_line $point $side]} {\\n incr count\\n }\\n }\\n expr {$count % 2} ;#-- 1 = odd = true, 0 = even = false\\n}\\nproc sides polygon {\\n lassign $polygon x0 y0\\n foreach {x y} [lrange [lappend polygon $x0 $y0] 2 end] {\\n lappend res [list $x0 $y0 $x $y]\\n set x0 $x\\n set y0 $y\\n }\\n return $res\\n}\\nproc ray_intersects_line {point line} {\\n lassign $point Px Py\\n lassign $line Ax Ay Bx By\\n # Reverse line direction if necessary\\n if {$By < $Ay} {\\n\\tlassign $line Bx By Ax Ay\\n }\\n # Add epsilon to\\n if {$Py == $Ay || $Py == $By} {\\n\\tset Py [expr {$Py + abs($Py)/1e6}]\\n }\\n # Bounding box checks\\n if {$Py < $Ay || $Py > $By || $Px > max($Ax,$Bx)} {\\n\\treturn 0\\n } elseif {$Px < min($Ax,$Bx)} {\\n\\treturn 1\\n }\\n # Compare dot products to compare (cosines of) angles\\n set mRed [expr {$Ax != $Bx ? ($By-$Ay)/($Bx-$Ax) : Inf}]\\n set mBlu [expr {$Ax != $Px ? ($Py-$Ay)/($Px-$Ax) : Inf}]\\n return [expr {$mBlu >= $mRed}]\\n}\\n\\nforeach {point poly} {\\n {0 0}\\t{-1 -1 -1 1 1 1 1 -1}\\n {2 2}\\t{-1 -1 -1 1 1 1 1 -1}\\n {0 0}\\t{-2 -2 -2 2 2 2 2 -2 2 -1 1 1 -1 1 -1 -1 1 -1 2 -1}\\n {1.5 1.5}\\t{-2 -2 -2 2 2 2 2 -2 2 -1 1 1 -1 1 -1 -1 1 -1 2 -1}\\n {5 5}\\t{0 0 2.5 2.5 0 10 2.5 7.5 7.5 7.5 10 10 10 0 7.5 0.1}\\n {5 8}\\t{0 0 2.5 2.5 0 10 2.5 7.5 7.5 7.5 10 10 10 0 7.5 0.1}\\n {2 2}\\t{0 0 2.5 2.5 0 10 2.5 7.5 7.5 7.5 10 10 10 0 7.5 0.1}\\n {0 0}\\t{0 0 2.5 2.5 0 10 2.5 7.5 7.5 7.5 10 10 10 0 7.5 0.1}\\n {10 10}\\t{0 0 2.5 2.5 0 10 2.5 7.5 7.5 7.5 10 10 10 0 7.5 0.1}\\n {2.5 2.5}\\t{0 0 2.5 2.5 0 10 2.5 7.5 7.5 7.5 10 10 10 0 7.5 0.1}\\n {-5 5}\\t{3 0 7 0 10 5 7 10 3 10 0 5}\\n} {\\n puts \\\"$point in $poly = [point_in_polygon $point $poly]\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#import flo\\n\\nin =\\n\\n@lrzyCipPX ~|afatPRZaq ~&EZ+fleq~~lrPrbr2G&& ~&B+fleq~~lrPrbl2G!| -&\\n ~&Y+ ~~lrPrbl2G fleq,\\n ^E(fleq@lrrPX,@rl fleq\\\\0.)^/~&lr ^(~&r,times)^/minus@llPrll2X vid+ minus~~rbbI&-\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"#cast %bL\\n\\nexamples =\\n\\nin* <\\n ((0.5,0.6),<(0.,0.),(1.,2.),(1.,0.)>),\\n ((0.5,0.6),<(0.,0.),(1.,1.),(1.,0.)>)>\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"Imports System.Math\\n\\nModule RayCasting\\n\\n Private square As Integer()() = {New Integer() {0, 0}, New Integer() {20, 0}, New Integer() {20, 20}, New Integer() {0, 20}}\\n Private squareHole As Integer()() = {New Integer() {0, 0}, New Integer() {20, 0}, New Integer() {20, 20}, New Integer() {0, 20}, New Integer() {5, 5}, New Integer() {15, 5}, New Integer() {15, 15}, New Integer() {5, 15}}\\n Private strange As Integer()() = {New Integer() {0, 0}, New Integer() {5, 5}, New Integer() {0, 20}, New Integer() {5, 15}, New Integer() {15, 15}, New Integer() {20, 20}, New Integer() {20, 0}}\\n Private hexagon As Integer()() = {New Integer() {6, 0}, New Integer() {14, 0}, New Integer() {20, 10}, New Integer() {14, 20}, New Integer() {6, 20}, New Integer() {0, 10}}\\n Private shapes As Integer()()() = {square, squareHole, strange, hexagon}\\n\\n Public Sub Main()\\n Dim testPoints As Double()() = {New Double() {10, 10}, New Double() {10, 16}, New Double() {-20, 10}, New Double() {0, 10}, New Double() {20, 10}, New Double() {16, 10}, New Double() {20, 20}}\\n\\n For Each shape As Integer()() In shapes\\n For Each point As Double() In testPoints\\n Console.Write(String.Format(\\\"{0} \\\", Contains(shape, point).ToString.PadLeft(7)))\\n Next\\n Console.WriteLine()\\n Next\\n End Sub\\n\\n Private Function Contains(shape As Integer()(), point As Double()) As Boolean\\n\\n Dim inside As Boolean = False\\n Dim length As Integer = shape.Length\\n\\n For i As Integer = 0 To length - 1\\n If Intersects(shape(i), shape((i + 1) Mod length), point) Then\\n inside = Not inside\\n End If\\n Next\\n\\n Return inside\\n End Function\\n\\n Private Function Intersects(a As Integer(), b As Integer(), p As Double()) As Boolean\\n\\n If a(1) > b(1) Then Return Intersects(b, a, p)\\n If p(1) = a(1) Or p(1) = b(1) Then p(1) += 0.0001\\n If p(1) > b(1) Or p(1) < a(1) Or p(0) >= Max(a(0), b(0)) Then Return False\\n If p(0) < Min(a(0), b(0)) Then Return True\\n Dim red As Double = (p(1) - a(1)) / (p(0) - a(0))\\n Dim blue As Double = (b(1) - a(1)) / (b(0) - a(0))\\n\\n Return red >= blue\\n End Function\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nclass RayCasting {\\n static intersects(a, b, p) {\\n if (a[1] > b[1]) return intersects(b, a, p)\\n if (p[1] == a[1] || p[1] == b[1]) p[1] = p[1] + 0.0001\\n if (p[1] > b[1] || p[1] < a[1] || p[0] >= a[0].max(b[0])) return false\\n if (p[0] < a[0].min(b[0])) return true\\n var red = (p[1] - a[1]) / (p[0] - a[0])\\n var blue = (b[1] - a[1]) / (b[0] - a[0])\\n return red >= blue\\n }\\n\\n static contains(shape, pnt) {\\n var inside = false\\n var len = shape.count\\n for (i in 0...len) {\\n if (intersects(shape[i], shape[(i + 1) % len], pnt)) inside = !inside\\n }\\n return inside\\n }\\n\\n static square { [[0, 0], [20, 0], [20, 20], [0, 20]] }\\n\\n static squareHole { [[0, 0], [20, 0], [20, 20], [0, 20], [5, 5], [15, 5], [15, 15], [5, 15]] }\\n\\n static strange { [[0, 0], [5, 5], [0, 20], [5, 15], [15, 15], [20, 20], [20, 0]] }\\n\\n static hexagon { [[6, 0], [14, 0], [20, 10], [14, 20], [6, 20], [0, 10]] }\\n\\n static shapes { [square, squareHole, strange, hexagon] }\\n}\\n\\nvar testPoints = [[10, 10], [10, 16], [-20, 10], [0, 10], [20, 10], [16, 10], [20, 20]]\\nfor (shape in RayCasting.shapes) {\\n for (pnt in testPoints) Fmt.write(\\\"$7s \\\", RayCasting.contains(shape, pnt))\\n System.print()\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"const E = 0.0001;\\n\\nfcn rayHitsSeg([(Px,Py)],[(Ax,Ay)],[(Bx,By)]){ // --> Bool\\n if(Py==Ay or Py==By) Py+=E;\\n if(Py<Ay or Py>By or Px>Ax.max(Bx)) False\\n else if(Px<Ax.min(Bx)) True\\n else try{ ( (Py - Ay)/(Px - Ax) )>=( (By - Ay)/(Bx - Ax) ) } //blue>=red\\n catch(MathError){ Px==Ax } // divide by zero == ∞, only blue?\\n}\\n\\nfcn pointInPoly(point, polygon){ // --> Bool, polygon is ( (a,b),(c,d).. )\\n polygon.filter('wrap([(ab,cd)]){ a,b:=ab; c,d:=cd;\\n if(b<=d) rayHitsSeg(point,ab,cd); // left point has smallest y coordinate\\n else rayHitsSeg(point,cd,ab);\\n })\\n .len().isOdd; // True if crossed an odd number of borders ie inside polygon\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"polys:=T( //(name,( ((a,b),(c,d)),((a,b),(c,d))... ), ... )==(nm,(ln,ln..) ..)\\n T(\\\"squared\\\",\\n\\tT(T(T( 0.0, 0.0), T(10.0, 0.0)),\\n\\t T(T(10.0, 0.0), T(10.0, 10.0)),\\n\\t T(T(10.0, 10.0), T( 0.0, 10.0)),\\n\\t T(T( 0.0, 10.0), T( 0.0, 0.0)))),\\n T(\\\"squaredhole\\\",\\n\\tT(T(T( 0.0, 0.0), T(10.0, 0.0)),\\n\\t T(T(10.0, 0.0), T(10.0, 10.0)),\\n\\t T(T(10.0, 10.0), T( 0.0, 10.0)),\\n\\t T(T( 0.0, 10.0), T( 0.0, 0.0)),\\n\\t T(T( 2.5, 2.5), T( 7.5, 2.5)),\\n\\t T(T( 7.5, 2.5), T( 7.5, 7.5)),\\n\\t T(T( 7.5, 7.5), T( 2.5, 7.5)),\\n\\t T(T( 2.5, 7.5), T( 2.5, 2.5)))),\\n T(\\\"strange\\\",\\n\\tT(T(T( 0.0, 0.0), T( 2.5, 2.5)),\\n\\t T(T( 2.5, 2.5), T( 0.0, 10.0)),\\n\\t T(T( 0.0, 10.0), T( 2.5, 7.5)),\\n\\t T(T( 2.5, 7.5), T( 7.5, 7.5)),\\n\\t T(T( 7.5, 7.5), T(10.0, 10.0)),\\n\\t T(T(10.0, 10.0), T(10.0, 0.0)),\\n\\t T(T(10.0, 0.0), T( 2.5, 2.5)),\\n\\t T(T( 2.5, 2.5), T( 0.0, 0.0)))), # conjecturally close polygon\\n T(\\\"exagon\\\",\\n\\tT(T(T( 3.0, 0.0), T( 7.0, 0.0)),\\n\\t T(T( 7.0, 0.0), T(10.0, 5.0)),\\n\\t T(T(10.0, 5.0), T( 7.0, 10.0)),\\n\\t T(T( 7.0, 10.0), T( 3.0, 10.0)),\\n\\t T(T( 3.0, 10.0), T( 0.0, 5.0)),\\n\\t T(T( 0.0, 5.0), T( 3.0, 0.0)))),\\n);\\n\\ntestPoints:=T(\\n\\t T( 5.0, 5.0),\\n\\t T( 5.0, 8.0),\\n\\t T(-10.0, 5.0),\\n\\t T( 0.0, 5.0),\\n\\t T( 10.0, 5.0),\\n\\t T( 8.0, 5.0),\\n\\t T( 10.0, 10.0)\\n);\\n\\nforeach name,polywanna in (polys){\\n name.println();\\n foreach testPoint in (testPoints){\\n println(\\\"\\\\t(%6.1f,%6.1f)\\\\t\\\".fmt(testPoint.xplode()),\\n pointInPoly(testPoint,polywanna) and \\\"IN\\\" or \\\"OUT\\\");\\n }\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Ray-casting-algorithm"}}},{"rowIdx":1564,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/RCRPG\nnote: Games\n","language":"00-META"},{"code":"Create a simple interactive game which incorporates the following features:\n\n* room-based navigation in three integer dimensions (x,y,z)\n* player inventory\n* three types of item: sledge, gold and ladder\n* a goal coordinate\n\nUse of the sledge should be required to create a passage between rooms. The ladder should be present in a room (but not held by the player), in order for the player to access the room above him. The gold need not have a function.\n\nThis project is based on [http://web.archive.org/web/20080212201605/http://shortcircuit.us/muddy-kinda-like-a-mud-but-single-player/ this blog post] by [[User:Short Circuit|Michael Mol]], and the Perl version comes from there.\n\n","language":"00-TASK"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/RCRPG\\nnote: Games\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Create a simple interactive game which incorporates the following features:\\n\\n* room-based navigation in three integer dimensions (x,y,z)\\n* player inventory\\n* three types of item: sledge, gold and ladder\\n* a goal coordinate\\n\\nUse of the sledge should be required to create a passage between rooms. The ladder should be present in a room (but not held by the player), in order for the player to access the room above him. The gold need not have a function.\\n\\nThis project is based on [http://web.archive.org/web/20080212201605/http://shortcircuit.us/muddy-kinda-like-a-mud-but-single-player/ this blog post] by [[User:Short Circuit|Michael Mol]], and the Perl version comes from there.\\n\\n\",\n \"language\": \"00-TASK\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"RCRPG"}}},{"rowIdx":1565,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Read_a_file_character_by_character/UTF8\nnote: File handling\n","language":"00-META"},{"code":";Task:\nRead a file one character at a time, as opposed to [[Read entire file|reading the entire file at once]].\n\nThe solution may be implemented as a procedure, which returns the next character in the file on each consecutive call (returning EOF when the end of the file is reached).\n\nThe procedure should support the reading of files containing UTF8 encoded wide characters, returning whole characters for each consecutive read.\n\n;Related task:\n* [[Read a file line by line]]\n<br><br>\n\n","language":"00-TASK"},{"code":"byte X\n\nProc Main()\n\n Open (1,\"D:FILENAME.TXT\",4,0)\n Do\n X=GetD(1)\n Put(X)\n Until EOF(1)\n Od\n Close(1)\n\nReturn\n","language":"Action-"},{"code":"File := FileOpen(\"input.txt\", \"r\")\nwhile !File.AtEOF\n MsgBox, % File.Read(1)\n","language":"AutoHotkey"},{"code":"f = freefile\nfilename$ = \"file.txt\"\n\nopen f, filename$\n\nwhile not eof(f)\n\tprint chr(readbyte(f));\nend while\nclose f\nend\n","language":"BASIC256"},{"code":"#include <stdio.h>\n#include <wchar.h>\n#include <stdlib.h>\n#include <locale.h>\n\nint main(void)\n{\n /* If your native locale doesn't use UTF-8 encoding\n * you need to replace the empty string with a\n * locale like \"en_US.utf8\"\n */\n char *locale = setlocale(LC_ALL, \"\");\n FILE *in = fopen(\"input.txt\", \"r\");\n\n wint_t c;\n while ((c = fgetwc(in)) != WEOF)\n putwchar(c);\n fclose(in);\n\n return EXIT_SUCCESS;\n}\n","language":"C"},{"code":"#include <fstream>\n#include <iostream>\n#include <locale>\n\nusing namespace std;\n\nint main(void)\n{\n /* If your native locale doesn't use UTF-8 encoding\n * you need to replace the empty string with a\n * locale like \"en_US.utf8\"\n */\n std::locale::global(std::locale(\"\")); // for C++\n std::cout.imbue(std::locale());\n ifstream in(\"input.txt\");\n\n wchar_t c;\n while ((c = in.get()) != in.eof())\n wcout<<c;\n in.close();\n\n return EXIT_SUCCESS;\n}\n","language":"C++"},{"code":"using System;\nusing System.IO;\nusing System.Text;\n\nnamespace RosettaFileByChar\n{\n class Program\n {\n static char GetNextCharacter(StreamReader streamReader) => (char)streamReader.Read();\n\n static void Main(string[] args)\n {\n Console.OutputEncoding = Encoding.UTF8;\n char c;\n using (FileStream fs = File.OpenRead(\"input.txt\"))\n {\n using (StreamReader streamReader = new StreamReader(fs, Encoding.UTF8))\n {\n while (!streamReader.EndOfStream)\n {\n c = GetNextCharacter(streamReader);\n Console.Write(c);\n }\n }\n }\n }\n }\n}\n","language":"C-sharp"},{"code":";; CLISP puts the external formats into a separate package\n#+clisp (import 'charset:utf-8 'keyword)\n\n(with-open-file (s \"input.txt\" :external-format :utf-8)\n (loop for c = (read-char s nil)\n while c\n do (format t \"~a\" c)))\n","language":"Common-Lisp"},{"code":"File.open(\"input.txt\") do |file|\n file.each_char { |c| p c }\nend\n","language":"Crystal"},{"code":"File.open(\"input.txt\") do |file|\n while c = file.read_char\n p c\n end\nend\n","language":"Crystal"},{"code":"program Read_a_file_character_by_character_UTF8;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils,\n System.Classes;\n\nfunction GetNextCharacter(StreamReader: TStreamReader): char;\nbegin\n Result := chr(StreamReader.Read);\nend;\n\nconst\n FileName: TFileName = 'input.txt';\n\nbegin\n if not FileExists(FileName) then\n raise Exception.Create('Error: File not exist.');\n\n var F := TStreamReader.Create(FileName, TEncoding.UTF8);\n\n while not F.EndOfStream do\n begin\n var c := GetNextCharacter(F);\n write(c);\n end;\n readln;\nend.\n","language":"Delphi"},{"code":"USING: kernel io io.encodings.utf8 io.files strings ;\nIN: rosetta-code.read-one\n\n\"input.txt\" utf8 [\n [ read1 dup ] [ 1string write ] while drop\n] with-file-reader\n","language":"Factor"},{"code":"Dim As Long f\nf = Freefile\n\nDim As String filename = \"file.txt\"\nDim As String*1 txt\n\nOpen filename For Binary As #f\nWhile Not Eof(f)\n txt = String(Lof(f), 0)\n Get #f, , txt\n Print txt;\nWend\nClose #f\nSleep\n","language":"FreeBASIC"},{"code":"import io.{InputStreamReader, FileInputStream}\n\nr = InputStreamReader( FileInputStream('input.txt'), 'UTF-8' )\n\nwhile (ch = r.read()) != -1\n print( chr(ch) )\n\nr.close()\n","language":"FunL"},{"code":"package main\n\nimport (\n \"bufio\"\n \"fmt\"\n \"io\"\n \"os\"\n)\n\nfunc Runer(r io.RuneReader) func() (rune, error) {\n return func() (r rune, err error) {\n r, _, err = r.ReadRune()\n return\n }\n}\n\nfunc main() {\n runes := Runer(bufio.NewReader(os.Stdin))\n for r, err := runes(); err != nil; r,err = runes() {\n fmt.Printf(\"%c\", r)\n }\n}\n","language":"Go"},{"code":"#!/usr/bin/env runhaskell\n\n{- The procedure to read a UTF-8 character is just:\n\n hGetChar :: Handle -> IO Char\n\n assuming that the encoding for the handle has been set to utf8.\n-}\n\nimport System.Environment (getArgs)\nimport System.IO (\n Handle, IOMode (..),\n hGetChar, hIsEOF, hSetEncoding, stdin, utf8, withFile\n )\nimport Control.Monad (forM_, unless)\nimport Text.Printf (printf)\nimport Data.Char (ord)\n\nprocessCharacters :: Handle -> IO ()\nprocessCharacters h = do\n done <- hIsEOF h\n unless done $ do\n c <- hGetChar h\n putStrLn $ printf \"U+%04X\" (ord c)\n processCharacters h\n\nprocessOneFile :: Handle -> IO ()\nprocessOneFile h = do\n hSetEncoding h utf8\n processCharacters h\n\n{- You can specify one or more files on the command line, or if no\n files are specified, it reads from standard input.\n-}\nmain :: IO ()\nmain = do\n args <- getArgs\n case args of\n [] -> processOneFile stdin\n xs -> forM_ xs $ \\name -> do\n putStrLn name\n withFile name ReadMode processOneFile\n","language":"Haskell"},{"code":"u8len=: 1 >. 0 i.~ (8#2)#:a.&i.\n","language":"J"},{"code":"indexedread1u8=:4 :0\n try.\n octet0=. 1!:11 y;x,1\n octet0,1!:11 y;(x+1),<:u8len octet0\n catch.\n 'EOF'\n end.\n)\n","language":"J"},{"code":"import java.io.FileReader;\nimport java.io.IOException;\nimport java.nio.charset.StandardCharsets;\n\npublic class Program {\n private final FileReader reader;\n\n public Program(String path) throws IOException {\n reader = new FileReader(path, StandardCharsets.UTF_16);\n }\n\n /** @return integer value from 0 to 0xffff, or -1 for EOS */\n public int nextCharacter() throws IOException {\n return reader.read();\n }\n\n public void close() throws IOException {\n reader.close();\n }\n}\n","language":"Java"},{"code":"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.nio.charset.StandardCharsets;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\n\npublic final class ReadFileByCharacter {\n\t\n\tpublic static void main(String[] aArgs) {\n\t\tPath path = Path.of(\"input.txt\");\n\t\t\n\t\ttry ( BufferedReader reader = Files.newBufferedReader(path, StandardCharsets.UTF_8) ) {\n\t\t\tint value;\n\t\t\twhile ( ( value = reader.read() ) != END_OF_STREAM ) {\n\t\t\t\tSystem.out.println((char) value);\n\t\t\t}\n\t\t} catch (IOException ioe) {\n\t\t\tioe.printStackTrace();\n\t\t}\t\n\t}\n\t\n\tprivate static final int END_OF_STREAM = -1;\n\n}\n","language":"Java"},{"code":"def readc:\n inputs + \"\\n\" | explode[] | [.] | implode;\n","language":"Jq"},{"code":" echo '过活' | jq -Rn 'include \"readc\"; readc'\n \"过\"\n \"活\"\n \"\\n\"\n","language":"Jq"},{"code":"open(\"myfilename\") do f\n while !eof(f)\n c = read(f, Char)\n println(c)\n end\nend\n","language":"Julia"},{"code":"// version 1.1.2\n\nimport java.io.File\n\nconst val EOF = -1\n\nfun main(args: Array<String>) {\n val reader = File(\"input.txt\").reader() // uses UTF-8 by default\n reader.use {\n while (true) {\n val c = reader.read()\n if (c == EOF) break\n print(c.toChar()) // echo to console\n }\n }\n}\n","language":"Kotlin"},{"code":"-- Return whether the given string is a single ASCII character.\nfunction is_ascii (str)\n return string.match(str, \"[\\0-\\x7F]\")\nend\n\n-- Return whether the given string is an initial byte in a multibyte sequence.\nfunction is_init (str)\n return string.match(str, \"[\\xC2-\\xF4]\")\nend\n\n-- Return whether the given string is a continuation byte in a multibyte sequence.\nfunction is_cont (str)\n return string.match(str, \"[\\x80-\\xBF]\")\nend\n\n-- Accept a filestream.\n-- Return the next UTF8 character in the file.\nfunction read_char (file)\n local multibyte -- build a valid multibyte Unicode character\n\n for c in file:lines(1) do\n if is_ascii(c) then\n if multibyte then\n -- We've finished reading a Unicode character; unread the next byte,\n -- and return the Unicode character.\n file:seek(\"cur\", -1)\n return multibyte\n else\n return c\n end\n elseif is_init(c) then\n if multibyte then\n file:seek(\"cur\", -1)\n return multibyte\n else\n multibyte = c\n end\n elseif is_cont(c) then\n multibyte = multibyte .. c\n else\n assert(false)\n end\n end\nend\n\n-- Test.\nfunction read_all ()\n testfile = io.open(\"tmp.txt\", \"w\")\n testfile:write(\"𝄞AöЖ€𝄞Ελληνικάy䮀成长汉\\n\")\n testfile:close()\n testfile = io.open(\"tmp.txt\", \"r\")\n\n while true do\n local c = read_char(testfile)\n if not c then return else io.write(\" \", c) end\n end\nend\n","language":"Lua"},{"code":"Module checkit {\n \\\\ prepare a file\n \\\\ Save.Doc and Append.Doc to file, Load.Doc and Merge.Doc from file\n document a$\n a$={First Line\n Second line\n Third Line\n Ελληνικά Greek Letters\n y䮀\n 成长汉\n }\n Save.Doc a$, \"checkthis.txt\", 2 ' 2 for UTF-8\n b$=\"*\"\n final$=\"\"\n buffer Clear bytes as byte*16\n Buffer One as byte\n Buffer Two as byte*2\n Buffer Three as byte*3\n Locale 1033\n open \"checkthis.txt\" for input as #f\n seek#f, 4 ' skip BOM\n While b$<>\"\" {\n GetOneUtf8Char(&b$)\n final$+=b$\n }\n close #f\n Report final$\n Sub GetOneUtf8Char(&ch$)\n ch$=\"\"\n if Eof(#f) then Exit Sub\n Get #f, One\n Return Bytes, 0:=Eval(one, 0)\n local mrk=Eval(one, 0)\n Try ok {\n If Binary.And(mrk, 0xE0)=0xC0 then {\n Get #f,one\n Return Bytes, 1:=Eval$(one, 0,1)\n ch$=Eval$(Bytes, 0, 2)\n } Else.if Binary.And(mrk, 0xF0)=0xE0 then {\n Get #f,two\n Return Bytes, 1:=Eval$(two,0,2)\n ch$=Eval$(Bytes, 0, 3)\n } Else.if Binary.And(mrk, 0xF8)=0xF0 then {\n Get #f,three\n Return Bytes, 1:=Eval$(three, 0, 3)\n ch$=Eval$(Bytes, 0, 4)\n } Else ch$=Eval$(Bytes, 0, 1)\n }\n if Error or not ok then ch$=\"\" : exit sub\n ch$=left$(string$(ch$ as Utf8dec),1)\n End Sub\n}\ncheckit\n","language":"M2000-Interpreter"},{"code":"Module checkit {\n \\\\ prepare a file\n \\\\ Save.Doc and Append.Doc to file, Load.Doc and Merge.Doc from file\n document a$\n a$={First Line\n Second line\n Third Line\n Ελληνικά Greek Letters\n y䮀\n 成长汉\n }\n Save.Doc a$, \"checkthis.txt\", 2 ' 2 for UTF-8\n b$=\"*\"\n document final$\n buffer Clear bytes as byte*16\n Buffer One as byte\n Buffer Two as byte*2\n Buffer Three as byte*3\n Locale 1033\n open \"checkthis.txt\" for input as #f\n seek#f, 4 ' skip BOM\n oldb$=\"\"\n While b$<>\"\" {\n GetOneUtf8Char(&b$)\n \\\\ if final$ is document then 10 and 13 if comes alone are new line\n \\\\ so we need to throw 10 after the 13, so we have to use oldb$\n if b$=chr$(10) then if oldb$=chr$(13) then oldb$=\"\": continue\n oldb$=b$\n final$=b$ ' we use = for append to document\n }\n close #f\n Report final$\n Sub GetOneUtf8Char(&ch$)\n ch$=\"\"\n if Eof(#f) then Exit Sub\n Get #f, One\n Return Bytes, 0:=Eval(one, 0)\n local mrk=Eval(one, 0)\n Try ok {\n If Binary.And(mrk, 0xE0)=0xC0 then {\n Get #f,one\n Return Bytes, 1:=Eval$(one, 0,1)\n ch$=Eval$(Bytes, 0, 2)\n } Else.if Binary.And(mrk, 0xF0)=0xE0 then {\n Get #f,two\n Return Bytes, 1:=Eval$(two,0,2)\n ch$=Eval$(Bytes, 0, 3)\n } Else.if Binary.And(mrk, 0xF8)=0xF0 then {\n Get #f,three\n Return Bytes, 1:=Eval$(three, 0, 3)\n ch$=Eval$(Bytes, 0, 4)\n } Else ch$=Eval$(Bytes, 0, 1)\n }\n if Error or not ok then ch$=\"\" : exit sub\n ch$=left$(string$(ch$ as Utf8dec),1)\n End Sub\n}\ncheckit\n","language":"M2000-Interpreter"},{"code":"str = OpenRead[\"file.txt\"];\nToString[Read[str, \"Character\"], CharacterEncoding -> \"UTF-8\"]\n","language":"Mathematica"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary\nnumeric digits 20\n\nrunSample(arg)\nreturn\n\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\nmethod readCharacters(fName) public static binary returns String\n slurped = String('')\n slrp = StringBuilder()\n fr = Reader null\n fFile = File(fName)\n EOF = int -1 -- End Of File indicator\n do\n fr = BufferedReader(FileReader(fFile))\n ic = int\n cc = char\n -- read the contents of the file one character at a time\n loop label rdr forever\n -- Reader.read reads a single character as an integer value in the range 0 - 65535 [0x00 - 0xffff]\n -- or -1 on end of stream i.e. End Of File\n ic = fr.read()\n if ic == EOF then leave rdr\n cc = Rexx(ic).d2c\n slrp.append(cc)\n end rdr\n -- load the results of the read into a variable\n slurped = slrp.toString()\n catch fex = FileNotFoundException\n fex.printStackTrace()\n catch iex = IOException\n iex.printStackTrace()\n finally\n if fr \\= null then do\n fr.close()\n catch iex = IOException\n iex.printStackTrace()\n end\n end\n return slurped\n\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\nmethod encodingDetails(str = String) public static\n stlen = str.length()\n cplen = Character.codePointCount(str, 0, stlen)\n say 'Unicode: length=\"'stlen'\" code_point_count=\"'cplen'\" string=\"'str'\"'\n loop ix = 0 to stlen - 1\n cp = Rexx(Character.codePointAt(str, ix))\n cc = Rexx(Character.charCount(cp))\n say ' 'formatCodePoint(ix, cc, cp)\n if cc > 1 then do\n surrogates = [Rexx(Character.highSurrogate(cp)).c2d(), Rexx(Character.lowSurrogate(cp)).c2d()]\n loop sx = 0 to cc - 1\n ix = ix + sx\n cp = surrogates[sx]\n say ' 'formatCodePoint(ix, 1, cp)\n end sx\n end\n end ix\n say\n return\n\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\n-- @see http://docs.oracle.com/javase/6/docs/technotes/guides/intl/encoding.doc.html\n-- @since Java 1.7\nmethod formatCodePoint(ix, cc, cp) private static\n scp = Rexx(Character.toChars(cp))\n icp = cp.d2x(8).x2d(9) -- signed to unsigned conversion\n ocp = Rexx(Integer.toOctalString(icp))\n x_utf16 = ''\n x_utf8 = ''\n do\n b_utf16 = String(scp).getBytes('UTF-16BE')\n b_utf8 = String(scp).getBytes('UTF-8')\n loop bv = 0 to b_utf16.length - 1 by 2\n x_utf16 = x_utf16 Rexx(b_utf16[bv]).d2x(2) || Rexx(b_utf16[bv + 1]).d2x(2)\n end bv\n loop bv = 0 to b_utf8.length - 1\n x_utf8 = x_utf8 Rexx(b_utf8[bv]).d2x(2)\n end bv\n x_utf16 = x_utf16.space(1, ',')\n x_utf8 = x_utf8.space(1, ',')\n catch ex = UnsupportedEncodingException\n ex.printStackTrace()\n end\n cpName = Character.getName(cp)\n fmt = -\n 'CodePoint:' -\n 'index=\"'ix.right(3, 0)'\"' -\n 'character_count=\"'cc'\"' -\n 'id=\"U+'cp.d2x(5)'\"' -\n 'hex=\"0x'cp.d2x(6)'\"' -\n 'dec=\"'icp.right(7, 0)'\"' -\n 'oct=\"'ocp.right(7, 0)'\"' -\n 'char=\"'scp'\"' -\n 'utf-16=\"'x_utf16'\"' -\n 'utf-8=\"'x_utf8'\"' -\n 'name=\"'cpName'\"'\n return fmt\n\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\nmethod runSample(arg) public static\n parse arg fileNames\n if fileNames = '' then fileNames = 'data/utf8-001.txt'\n loop while fileNames \\= ''\n parse fileNames fileName fileNames\n slurped = readCharacters(fileName)\n say \"Input:\" slurped\n encodingDetails(slurped)\n end\n say\n return\n","language":"NetRexx"},{"code":"import unicode\n\nproc readUtf8(f: File): string =\n ## Return next UTF-8 character as a string.\n while true:\n result.add f.readChar()\n if result.validateUtf8() == -1: break\n\niterator readUtf8(f: File): string =\n ## Yield successive UTF-8 characters from file \"f\".\n var res: string\n while not f.endOfFile:\n res.setLen(0)\n while true:\n res.add f.readChar()\n if res.validateUtf8() == -1: break\n yield res\n","language":"Nim"},{"code":"(* Read a file char by char *)\n program ReadFileByChar;\n var\n InputFile,OutputFile: file of char;\n InputChar: char;\n begin\n Assign(InputFile, 'testin.txt');\n Reset(InputFile);\n Assign(OutputFile, 'testout.txt');\n Rewrite(OutputFile);\n while not Eof(InputFile) do\n begin\n Read(InputFile, InputChar);\n Write(OutputFile, InputChar)\n end;\n Close(InputFile);\n Close(OutputFile)\n end.\n","language":"Pascal"},{"code":"binmode STDOUT, ':utf8'; # so we can print wide chars without warning\n\nopen my $fh, \"<:encoding(UTF-8)\", \"input.txt\" or die \"$!\\n\";\n\nwhile (read $fh, my $char, 1) {\n printf \"got character $char [U+%04x]\\n\", ord $char;\n}\n\nclose $fh;\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">INVALID_UTF8</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">#FFFD</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">get_one_utf8_char</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- returns INVALID_UTF8 on error, else a string of 1..4 bytes representing one character</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">headb</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">bytes</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">c</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- headb = first byte of utf-8 character:</span>\n <span style=\"color: #000000;\">headb</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">getc</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">headb</span><span style=\"color: #0000FF;\">=-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">headb</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- calculate length of utf-8 character in bytes (1..4):</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">headb</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">bytes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span> <span style=\"color: #000080;font-style:italic;\">-- (utf-8 starts at #0)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">headb</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">0b01111111</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">bytes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #000080;font-style:italic;\">-- 0b_0xxx_xxxx</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">headb</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">0b10111111</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">bytes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span> <span style=\"color: #000080;font-style:italic;\">-- (it's a tail byte)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">headb</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">0b11011111</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">bytes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #000080;font-style:italic;\">-- 0b_110x_xxxx</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">headb</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">0b11101111</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">bytes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">3</span> <span style=\"color: #000080;font-style:italic;\">-- 0b_1110_xxxx</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">headb</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">0b11110100</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">bytes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">4</span> <span style=\"color: #000080;font-style:italic;\">-- 0b_1111_0xzz</span>\n <span style=\"color: #008080;\">else</span> <span style=\"color: #000000;\">bytes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span> <span style=\"color: #000080;font-style:italic;\">-- (utf-8 ends at #10FFFF)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- 2..4 bytes encoding (tail range: 0b_1000_0000..0b_1011_1111);</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">bytes</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span> <span style=\"color: #000080;font-style:italic;\">-- tail bytes are valid?</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">getc</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">#80</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">#BF</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">bytes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span> <span style=\"color: #000080;font-style:italic;\">-- invalid tail byte or eof</span>\n <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">c</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- 1 byte encoding (head range: 0b_0000_0000..0b_0111_1111):</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">bytes</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">headb</span> <span style=\"color: #000080;font-style:italic;\">-- UTF-8 = ASCII\n\n -- 2 bytes encoding (head range: 0b_1100_0000..0b_1101_1111):</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">bytes</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">headb</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#1F</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">#40</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000080;font-style:italic;\">-- 0b110[7..11] headb</span>\n <span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">#3F</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- 0b10[1..6] tail</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">#7FF</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span> <span style=\"color: #000080;font-style:italic;\">-- sanity check</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">#80</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000080;font-style:italic;\">-- long form?</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">INVALID_UTF8</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- 3 bytes encoding (head range: 0b_1110_0000..0b_1110_1111):</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">bytes</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">3</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">headb</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#0F</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">#1000</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000080;font-style:italic;\">-- 0b1110[13..16] head</span>\n <span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">#3F</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">#40</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000080;font-style:italic;\">-- 0b10[7..12] tail</span>\n <span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">#3F</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- 0b10[1..6] tail</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">#FFFF</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span> <span style=\"color: #000080;font-style:italic;\">-- sanity check</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">#800</span> <span style=\"color: #000080;font-style:italic;\">-- long form?</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">#D800</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">#DFFF</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000080;font-style:italic;\">-- utf-16 incompatible</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">INVALID_UTF8</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- 4 bytes encoding (head range: 0b_1111_0000..0b_1111_0111):</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">bytes</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">headb</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">#07</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">#040000</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000080;font-style:italic;\">-- 0b11110[19..21] head</span>\n <span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">#3F</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">#1000</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000080;font-style:italic;\">-- 0b10[13..18] tail</span>\n <span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">#3F</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">#0040</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000080;font-style:italic;\">-- 0b10[7..12] tail</span>\n <span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">#3F</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- 0b10[1..6] tail</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">#10000</span> <span style=\"color: #000080;font-style:italic;\">-- long form?</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">#10FFFF</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">INVALID_UTF8</span> <span style=\"color: #000080;font-style:italic;\">-- utf-8 ends at #10FFFF</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- bytes = 0; current byte is not encoded correctly:</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">INVALID_UTF8</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n<!--\n","language":"Phix"},{"code":"-->\n <span style=\"color: #000080;font-style:italic;\">--string utf8 = \"aă€⼥\" -- (same results as next)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">utf8</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">utf32_to_utf8</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">#0061</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">#0103</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">#20ac</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">#2f25</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"length of utf8 is %d bytes\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">utf8</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">fn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">open</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"test.txt\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"wb\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">utf8</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">close</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">fn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">open</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"test.txt\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"r\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">5</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">get_one_utf8_char</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #004080;\">string</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()=</span><span style=\"color: #000000;\">LINUX</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"char %d (%s) is %d bytes\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000080;font-style:italic;\">-- unicode and consoles tricky on windows, so I'm\n -- just avoiding that issue altogther (t)here.</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"char %d is %d bytes\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">=-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"char %d - EOF\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"char %d - INVALID_UTF8\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">close</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"(in \"wordlist\"\n (while (char)\n (process @))\n","language":"PicoLisp"},{"code":"def get_next_character(f):\n # note: assumes valid utf-8\n c = f.read(1)\n while c:\n while True:\n try:\n yield c.decode('utf-8')\n except UnicodeDecodeError:\n # we've encountered a multibyte character\n # read another byte and try again\n c += f.read(1)\n else:\n # c was a valid char, and was yielded, continue\n c = f.read(1)\n break\n\n# Usage:\nwith open(\"input.txt\",\"rb\") as f:\n for c in get_next_character(f):\n print(c)\n","language":"Python"},{"code":"def get_next_character(f):\n \"\"\"Reads one character from the given textfile\"\"\"\n c = f.read(1)\n while c:\n yield c\n c = f.read(1)\n\n# Usage:\nwith open(\"input.txt\", encoding=\"utf-8\") as f:\n for c in get_next_character(f):\n print(c, sep=\"\", end=\"\")\n","language":"Python"},{"code":"f = FREEFILE\nfilename$ = \"file.txt\"\n\nOPEN filename$ FOR BINARY AS #f\nWHILE NOT EOF(f)\n char$ = STR$(LOF(f))\n GET #f, , char$\n PRINT char$;\nWEND\nCLOSE #f\n","language":"QBasic"},{"code":"#lang racket\n; This file contains utf-8 charachters: λ, α, γ ...\n(for ([c (in-port read-char (open-input-file \"read-file.rkt\"))])\n (display c))\n","language":"Racket"},{"code":"#lang racket\n; This file contains utf-8 charachters: λ, α, γ ...\n(for ([c (in-port read-char (open-input-file \"read-file.rkt\"))])\n (display c))\n","language":"Racket"},{"code":".say while defined $_ = $*IN.getc;\n","language":"Raku"},{"code":"my $filename = 'whatever';\n\nmy $in = open( $filename, :r ) orelse .die;\n\nprint $_ while defined $_ = $in.getc;\n","language":"Raku"},{"code":"/*REXX program reads and displays a file char by char, returning 'EOF' when done. */\nparse arg iFID . /*iFID: is the fileID to be read. */\n /* [↓] show the file's contents. */\nif iFID\\=='' then do j=1 until x=='EOF' /*J count's the file's characters. */\n x=getchar(iFID); y= /*get a character or an 'EOF'. */\n if x>>' ' then y=x /*display X if presentable. */\n say right(j, 12) 'character, (hex,char)' c2x(x) y\n end /*j*/ /* [↑] only display X if not low hex*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngetchar: procedure; parse arg z; if chars(z)==0 then return 'EOF'; return charin(z)\n","language":"REXX"},{"code":"/* REXX ---------------------------------------------------------------\n* 29.12.2013 Walter Pachl\n* read one utf8 character at a time\n* see http://de.wikipedia.org/wiki/UTF-8#Kodierung\n*--------------------------------------------------------------------*/\noid='utf8.txt';'erase' oid /* first create file containing utf8 chars*/\nCall charout oid,'79'x\nCall charout oid,'C3A4'x\nCall charout oid,'C2AE'x\nCall charout oid,'E282AC'x\nCall charout oid,'F09D849E'x\nCall lineout oid\nfid='utf8.txt' /* then read it and show the contents */\nDo Until c8='EOF'\n c8=get_utf8char(fid)\n Say left(c8,4) c2x(c8)\n End\nExit\n\nget_utf8char: Procedure\n Parse Arg f\n If chars(f)=0 Then\n Return 'EOF'\n c=charin(f)\n b=c2b(c)\n If left(b,1)=0 Then\n Nop\n Else Do\n p=pos('0',b)\n Do i=1 To p-2\n If chars(f)=0 Then Do\n Say 'illegal contents in file' f\n Leave\n End\n c=c||charin(f)\n End\n End\n Return c\n\nc2b: Return x2b(c2x(arg(1)))\n","language":"REXX"},{"code":"fp = fopen(\"C:\\Ring\\ReadMe.txt\",\"r\")\nr = fgetc(fp)\nwhile isstring(r)\n r = fgetc(fp)\n see r\nend\nfclose(fp)\n","language":"Ring"},{"code":"File.open('input.txt', 'r:utf-8') do |f|\n f.each_char{|c| p c}\nend\n","language":"Ruby"},{"code":"File.open('input.txt', 'r:utf-8') do |f|\n while c = f.getc\n p c\n end\nend\n","language":"Ruby"},{"code":"open file.txt\" for binary as #f\nnumChars = 1 ' specify number of characters to read\na$ = input$(#f,numChars) ' read number of characters specified\nb$ = input$(#f,1) ' read one character\nclose #f\n","language":"Run-BASIC"},{"code":"use std::{\n convert::TryFrom,\n fmt::{Debug, Display, Formatter},\n io::Read,\n};\n\npub struct ReadUtf8<I: Iterator> {\n source: std::iter::Peekable<I>,\n}\n\nimpl<R: Read> From<R> for ReadUtf8<std::io::Bytes<R>> {\n fn from(source: R) -> Self {\n ReadUtf8 {\n source: source.bytes().peekable(),\n }\n }\n}\n\nimpl<I, E> Iterator for ReadUtf8<I>\nwhere\n I: Iterator<Item = Result<u8, E>>,\n{\n type Item = Result<char, Error<E>>;\n\n fn next(&mut self) -> Option<Self::Item> {\n self.source.next().map(|next| match next {\n Ok(lead) => self.complete_char(lead),\n Err(e) => Err(Error::SourceError(e)),\n })\n }\n}\n\nimpl<I, E> ReadUtf8<I>\nwhere\n I: Iterator<Item = Result<u8, E>>,\n{\n fn continuation(&mut self) -> Result<u32, Error<E>> {\n if let Some(Ok(byte)) = self.source.peek() {\n let byte = *byte;\n\n return if byte & 0b1100_0000 == 0b1000_0000 {\n self.source.next();\n Ok((byte & 0b0011_1111) as u32)\n } else {\n Err(Error::InvalidByte(byte))\n };\n }\n\n match self.source.next() {\n None => Err(Error::InputTruncated),\n Some(Err(e)) => Err(Error::SourceError(e)),\n Some(Ok(_)) => unreachable!(),\n }\n }\n\n fn complete_char(&mut self, lead: u8) -> Result<char, Error<E>> {\n let a = lead as u32; // Let's name the bytes in the sequence\n\n let result = if a & 0b1000_0000 == 0 {\n Ok(a)\n } else if lead & 0b1110_0000 == 0b1100_0000 {\n let b = self.continuation()?;\n Ok((a & 0b0001_1111) << 6 | b)\n } else if a & 0b1111_0000 == 0b1110_0000 {\n let b = self.continuation()?;\n let c = self.continuation()?;\n Ok((a & 0b0000_1111) << 12 | b << 6 | c)\n } else if a & 0b1111_1000 == 0b1111_0000 {\n let b = self.continuation()?;\n let c = self.continuation()?;\n let d = self.continuation()?;\n Ok((a & 0b0000_0111) << 18 | b << 12 | c << 6 | d)\n } else {\n Err(Error::InvalidByte(lead))\n };\n\n Ok(char::try_from(result?).unwrap())\n }\n}\n\n#[derive(Debug, Clone)]\npub enum Error<E> {\n InvalidByte(u8),\n InputTruncated,\n SourceError(E),\n}\n\nimpl<E: Display> Display for Error<E> {\n fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {\n match self {\n Self::InvalidByte(b) => write!(f, \"invalid byte 0x{:x}\", b),\n Self::InputTruncated => write!(f, \"character truncated\"),\n Self::SourceError(e) => e.fmt(f),\n }\n }\n}\n\nfn main() -> std::io::Result<()> {\n for (index, value) in ReadUtf8::from(std::fs::File::open(\"test.txt\")?).enumerate() {\n match value {\n Ok(c) => print!(\"{}\", c),\n\n Err(e) => {\n print!(\"\\u{fffd}\");\n eprintln!(\"offset {}: {}\", index, e);\n }\n }\n }\n\n Ok(())\n}\n","language":"Rust"},{"code":"$ include \"seed7_05.s7i\";\n include \"utf8.s7i\";\n\nconst proc: main is func\n local\n var file: inFile is STD_NULL;\n var char: ch is ' ';\n begin\n OUT := STD_UTF8_OUT;\n inFile := openUtf8(\"readAFileCharacterByCharacterUtf8.in\", \"r\");\n if inFile <> STD_NULL then\n while hasNext(inFile) do\n ch := getc(inFile);\n writeln(\"got character \" <& ch <& \" [U+\" <& ord(ch) radix 16 <& \"]\");\n end while;\n close(inFile);\n end if;\n end func;\n","language":"Seed7"},{"code":"var file = File('input.txt') # the input file contains: \"aă€⼥\"\nvar fh = file.open_r # equivalent with: file.open('<:utf8')\nfh.each_char { |char|\n printf(\"got character #{char} [U+%04x]\\n\", char.ord)\n}\n","language":"Sidef"},{"code":"|utfStream|\nutfStream := 'input' asFilename readStream asUTF8EncodedStream.\n[utfStream atEnd] whileFalse:[\n Transcript showCR:'got char ',utfStream next.\n].\nutfStream close.\n","language":"Smalltalk"},{"code":"set ch [read $channel 1]\n","language":"Tcl"},{"code":"fconfigure $channel -buffersize $byteCount\n","language":"Tcl"},{"code":"import os\n\nfn main() {\n\tfile := './file.txt'\n\tmut content_arr := []u8{}\n\t\t\n\tif os.is_file(file) == true {\n\t\tcontent_arr << os.read_bytes(file) or {\n\t\t\tprintln('Error: can not read')\n\t\t\texit(1)\n\t\t}\n\t}\n\telse {\n\t\tprintln('Error: can not find file')\n\t\texit(1)\n\t}\n\n\tprintln(content_arr.bytestr())\n}\n","language":"V-(Vlang)"},{"code":"import \"io\" for File\n\nFile.open(\"input.txt\") { |file|\n var offset = 0\n var char = \"\" // stores each byte read till we have a complete UTF encoded character\n while(true) {\n var b = file.readBytes(1, offset)\n if (b == \"\") return // end of stream\n char = char + b\n if (char.codePoints[0] >= 0) { // a UTF encoded character is complete\n System.write(char) // print it\n char = \"\" // reset store\n }\n offset = offset + 1\n }\n}\n","language":"Wren"},{"code":"fcn readUTF8c(chr,s=\"\"){ // transform UTF-8 character stream\n s+=chr;\n try{ s.len(8); return(s) }\n catch{ if(s.len()>6) throw(__exception) } // 6 bytes max for UTF-8\n return(Void.Again,s); // call me again with s & another character\n}\n","language":"Zkl"},{"code":"fcn utf8Walker(obj){\n obj.walker(3) // read characters\n .tweak(readUTF8c)\n}\n","language":"Zkl"},{"code":"s:=\"-->\\u20AC123\"; // --> e2,82,ac,31,32,33 == -->€123\nutf8Walker(s).walk().println();\n\nw:=utf8Walker(Data(Void,s,\"\\n\")); // Data is a byte bucket\nforeach c in (utf8Walker(Data(Void,s,\"\\n\"))){ print(c) }\n\nutf8Walker(Data(Void,0xe2,0x82,\"123456\")).walk().println(); // € is short 1 byte\n","language":"Zkl"},{"code":"stream:=Data(Void,s,\"\\n\").howza(3); // character stream\nstream.pump(List,readUTF8c,\"print\")\n","language":"Zkl"},{"code":"File(\"foo.txt\",\"rb\").howza(3).pump(List,readUTF8c,\"print\");\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Read_a_file_character_by_character/UTF8\\nnote: File handling\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nRead a file one character at a time, as opposed to [[Read entire file|reading the entire file at once]].\\n\\nThe solution may be implemented as a procedure, which returns the next character in the file on each consecutive call (returning EOF when the end of the file is reached).\\n\\nThe procedure should support the reading of files containing UTF8 encoded wide characters, returning whole characters for each consecutive read.\\n\\n;Related task:\\n* [[Read a file line by line]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"byte X\\n\\nProc Main()\\n\\n Open (1,\\\"D:FILENAME.TXT\\\",4,0)\\n Do\\n X=GetD(1)\\n Put(X)\\n Until EOF(1)\\n Od\\n Close(1)\\n\\nReturn\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"File := FileOpen(\\\"input.txt\\\", \\\"r\\\")\\nwhile !File.AtEOF\\n MsgBox, % File.Read(1)\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"f = freefile\\nfilename$ = \\\"file.txt\\\"\\n\\nopen f, filename$\\n\\nwhile not eof(f)\\n\\tprint chr(readbyte(f));\\nend while\\nclose f\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <wchar.h>\\n#include <stdlib.h>\\n#include <locale.h>\\n\\nint main(void)\\n{\\n /* If your native locale doesn't use UTF-8 encoding\\n * you need to replace the empty string with a\\n * locale like \\\"en_US.utf8\\\"\\n */\\n char *locale = setlocale(LC_ALL, \\\"\\\");\\n FILE *in = fopen(\\\"input.txt\\\", \\\"r\\\");\\n\\n wint_t c;\\n while ((c = fgetwc(in)) != WEOF)\\n putwchar(c);\\n fclose(in);\\n\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <fstream>\\n#include <iostream>\\n#include <locale>\\n\\nusing namespace std;\\n\\nint main(void)\\n{\\n /* If your native locale doesn't use UTF-8 encoding\\n * you need to replace the empty string with a\\n * locale like \\\"en_US.utf8\\\"\\n */\\n std::locale::global(std::locale(\\\"\\\")); // for C++\\n std::cout.imbue(std::locale());\\n ifstream in(\\\"input.txt\\\");\\n\\n wchar_t c;\\n while ((c = in.get()) != in.eof())\\n wcout<<c;\\n in.close();\\n\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.IO;\\nusing System.Text;\\n\\nnamespace RosettaFileByChar\\n{\\n class Program\\n {\\n static char GetNextCharacter(StreamReader streamReader) => (char)streamReader.Read();\\n\\n static void Main(string[] args)\\n {\\n Console.OutputEncoding = Encoding.UTF8;\\n char c;\\n using (FileStream fs = File.OpenRead(\\\"input.txt\\\"))\\n {\\n using (StreamReader streamReader = new StreamReader(fs, Encoding.UTF8))\\n {\\n while (!streamReader.EndOfStream)\\n {\\n c = GetNextCharacter(streamReader);\\n Console.Write(c);\\n }\\n }\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \";; CLISP puts the external formats into a separate package\\n#+clisp (import 'charset:utf-8 'keyword)\\n\\n(with-open-file (s \\\"input.txt\\\" :external-format :utf-8)\\n (loop for c = (read-char s nil)\\n while c\\n do (format t \\\"~a\\\" c)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"File.open(\\\"input.txt\\\") do |file|\\n file.each_char { |c| p c }\\nend\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"File.open(\\\"input.txt\\\") do |file|\\n while c = file.read_char\\n p c\\n end\\nend\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"program Read_a_file_character_by_character_UTF8;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils,\\n System.Classes;\\n\\nfunction GetNextCharacter(StreamReader: TStreamReader): char;\\nbegin\\n Result := chr(StreamReader.Read);\\nend;\\n\\nconst\\n FileName: TFileName = 'input.txt';\\n\\nbegin\\n if not FileExists(FileName) then\\n raise Exception.Create('Error: File not exist.');\\n\\n var F := TStreamReader.Create(FileName, TEncoding.UTF8);\\n\\n while not F.EndOfStream do\\n begin\\n var c := GetNextCharacter(F);\\n write(c);\\n end;\\n readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"USING: kernel io io.encodings.utf8 io.files strings ;\\nIN: rosetta-code.read-one\\n\\n\\\"input.txt\\\" utf8 [\\n [ read1 dup ] [ 1string write ] while drop\\n] with-file-reader\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Dim As Long f\\nf = Freefile\\n\\nDim As String filename = \\\"file.txt\\\"\\nDim As String*1 txt\\n\\nOpen filename For Binary As #f\\nWhile Not Eof(f)\\n txt = String(Lof(f), 0)\\n Get #f, , txt\\n Print txt;\\nWend\\nClose #f\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"import io.{InputStreamReader, FileInputStream}\\n\\nr = InputStreamReader( FileInputStream('input.txt'), 'UTF-8' )\\n\\nwhile (ch = r.read()) != -1\\n print( chr(ch) )\\n\\nr.close()\\n\",\n \"language\": \"FunL\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bufio\\\"\\n \\\"fmt\\\"\\n \\\"io\\\"\\n \\\"os\\\"\\n)\\n\\nfunc Runer(r io.RuneReader) func() (rune, error) {\\n return func() (r rune, err error) {\\n r, _, err = r.ReadRune()\\n return\\n }\\n}\\n\\nfunc main() {\\n runes := Runer(bufio.NewReader(os.Stdin))\\n for r, err := runes(); err != nil; r,err = runes() {\\n fmt.Printf(\\\"%c\\\", r)\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"#!/usr/bin/env runhaskell\\n\\n{- The procedure to read a UTF-8 character is just:\\n\\n hGetChar :: Handle -> IO Char\\n\\n assuming that the encoding for the handle has been set to utf8.\\n-}\\n\\nimport System.Environment (getArgs)\\nimport System.IO (\\n Handle, IOMode (..),\\n hGetChar, hIsEOF, hSetEncoding, stdin, utf8, withFile\\n )\\nimport Control.Monad (forM_, unless)\\nimport Text.Printf (printf)\\nimport Data.Char (ord)\\n\\nprocessCharacters :: Handle -> IO ()\\nprocessCharacters h = do\\n done <- hIsEOF h\\n unless done $ do\\n c <- hGetChar h\\n putStrLn $ printf \\\"U+%04X\\\" (ord c)\\n processCharacters h\\n\\nprocessOneFile :: Handle -> IO ()\\nprocessOneFile h = do\\n hSetEncoding h utf8\\n processCharacters h\\n\\n{- You can specify one or more files on the command line, or if no\\n files are specified, it reads from standard input.\\n-}\\nmain :: IO ()\\nmain = do\\n args <- getArgs\\n case args of\\n [] -> processOneFile stdin\\n xs -> forM_ xs $ \\\\name -> do\\n putStrLn name\\n withFile name ReadMode processOneFile\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"u8len=: 1 >. 0 i.~ (8#2)#:a.&i.\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"indexedread1u8=:4 :0\\n try.\\n octet0=. 1!:11 y;x,1\\n octet0,1!:11 y;(x+1),<:u8len octet0\\n catch.\\n 'EOF'\\n end.\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.io.FileReader;\\nimport java.io.IOException;\\nimport java.nio.charset.StandardCharsets;\\n\\npublic class Program {\\n private final FileReader reader;\\n\\n public Program(String path) throws IOException {\\n reader = new FileReader(path, StandardCharsets.UTF_16);\\n }\\n\\n /** @return integer value from 0 to 0xffff, or -1 for EOS */\\n public int nextCharacter() throws IOException {\\n return reader.read();\\n }\\n\\n public void close() throws IOException {\\n reader.close();\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.io.BufferedReader;\\nimport java.io.IOException;\\nimport java.nio.charset.StandardCharsets;\\nimport java.nio.file.Files;\\nimport java.nio.file.Path;\\n\\npublic final class ReadFileByCharacter {\\n\\t\\n\\tpublic static void main(String[] aArgs) {\\n\\t\\tPath path = Path.of(\\\"input.txt\\\");\\n\\t\\t\\n\\t\\ttry ( BufferedReader reader = Files.newBufferedReader(path, StandardCharsets.UTF_8) ) {\\n\\t\\t\\tint value;\\n\\t\\t\\twhile ( ( value = reader.read() ) != END_OF_STREAM ) {\\n\\t\\t\\t\\tSystem.out.println((char) value);\\n\\t\\t\\t}\\n\\t\\t} catch (IOException ioe) {\\n\\t\\t\\tioe.printStackTrace();\\n\\t\\t}\\t\\n\\t}\\n\\t\\n\\tprivate static final int END_OF_STREAM = -1;\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"def readc:\\n inputs + \\\"\\\\n\\\" | explode[] | [.] | implode;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \" echo '过活' | jq -Rn 'include \\\"readc\\\"; readc'\\n \\\"过\\\"\\n \\\"活\\\"\\n \\\"\\\\n\\\"\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"open(\\\"myfilename\\\") do f\\n while !eof(f)\\n c = read(f, Char)\\n println(c)\\n end\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nimport java.io.File\\n\\nconst val EOF = -1\\n\\nfun main(args: Array<String>) {\\n val reader = File(\\\"input.txt\\\").reader() // uses UTF-8 by default\\n reader.use {\\n while (true) {\\n val c = reader.read()\\n if (c == EOF) break\\n print(c.toChar()) // echo to console\\n }\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"-- Return whether the given string is a single ASCII character.\\nfunction is_ascii (str)\\n return string.match(str, \\\"[\\\\0-\\\\x7F]\\\")\\nend\\n\\n-- Return whether the given string is an initial byte in a multibyte sequence.\\nfunction is_init (str)\\n return string.match(str, \\\"[\\\\xC2-\\\\xF4]\\\")\\nend\\n\\n-- Return whether the given string is a continuation byte in a multibyte sequence.\\nfunction is_cont (str)\\n return string.match(str, \\\"[\\\\x80-\\\\xBF]\\\")\\nend\\n\\n-- Accept a filestream.\\n-- Return the next UTF8 character in the file.\\nfunction read_char (file)\\n local multibyte -- build a valid multibyte Unicode character\\n\\n for c in file:lines(1) do\\n if is_ascii(c) then\\n if multibyte then\\n -- We've finished reading a Unicode character; unread the next byte,\\n -- and return the Unicode character.\\n file:seek(\\\"cur\\\", -1)\\n return multibyte\\n else\\n return c\\n end\\n elseif is_init(c) then\\n if multibyte then\\n file:seek(\\\"cur\\\", -1)\\n return multibyte\\n else\\n multibyte = c\\n end\\n elseif is_cont(c) then\\n multibyte = multibyte .. c\\n else\\n assert(false)\\n end\\n end\\nend\\n\\n-- Test.\\nfunction read_all ()\\n testfile = io.open(\\\"tmp.txt\\\", \\\"w\\\")\\n testfile:write(\\\"𝄞AöЖ€𝄞Ελληνικάy䮀成长汉\\\\n\\\")\\n testfile:close()\\n testfile = io.open(\\\"tmp.txt\\\", \\\"r\\\")\\n\\n while true do\\n local c = read_char(testfile)\\n if not c then return else io.write(\\\" \\\", c) end\\n end\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module checkit {\\n \\\\\\\\ prepare a file\\n \\\\\\\\ Save.Doc and Append.Doc to file, Load.Doc and Merge.Doc from file\\n document a$\\n a$={First Line\\n Second line\\n Third Line\\n Ελληνικά Greek Letters\\n y䮀\\n 成长汉\\n }\\n Save.Doc a$, \\\"checkthis.txt\\\", 2 ' 2 for UTF-8\\n b$=\\\"*\\\"\\n final$=\\\"\\\"\\n buffer Clear bytes as byte*16\\n Buffer One as byte\\n Buffer Two as byte*2\\n Buffer Three as byte*3\\n Locale 1033\\n open \\\"checkthis.txt\\\" for input as #f\\n seek#f, 4 ' skip BOM\\n While b$<>\\\"\\\" {\\n GetOneUtf8Char(&b$)\\n final$+=b$\\n }\\n close #f\\n Report final$\\n Sub GetOneUtf8Char(&ch$)\\n ch$=\\\"\\\"\\n if Eof(#f) then Exit Sub\\n Get #f, One\\n Return Bytes, 0:=Eval(one, 0)\\n local mrk=Eval(one, 0)\\n Try ok {\\n If Binary.And(mrk, 0xE0)=0xC0 then {\\n Get #f,one\\n Return Bytes, 1:=Eval$(one, 0,1)\\n ch$=Eval$(Bytes, 0, 2)\\n } Else.if Binary.And(mrk, 0xF0)=0xE0 then {\\n Get #f,two\\n Return Bytes, 1:=Eval$(two,0,2)\\n ch$=Eval$(Bytes, 0, 3)\\n } Else.if Binary.And(mrk, 0xF8)=0xF0 then {\\n Get #f,three\\n Return Bytes, 1:=Eval$(three, 0, 3)\\n ch$=Eval$(Bytes, 0, 4)\\n } Else ch$=Eval$(Bytes, 0, 1)\\n }\\n if Error or not ok then ch$=\\\"\\\" : exit sub\\n ch$=left$(string$(ch$ as Utf8dec),1)\\n End Sub\\n}\\ncheckit\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Module checkit {\\n \\\\\\\\ prepare a file\\n \\\\\\\\ Save.Doc and Append.Doc to file, Load.Doc and Merge.Doc from file\\n document a$\\n a$={First Line\\n Second line\\n Third Line\\n Ελληνικά Greek Letters\\n y䮀\\n 成长汉\\n }\\n Save.Doc a$, \\\"checkthis.txt\\\", 2 ' 2 for UTF-8\\n b$=\\\"*\\\"\\n document final$\\n buffer Clear bytes as byte*16\\n Buffer One as byte\\n Buffer Two as byte*2\\n Buffer Three as byte*3\\n Locale 1033\\n open \\\"checkthis.txt\\\" for input as #f\\n seek#f, 4 ' skip BOM\\n oldb$=\\\"\\\"\\n While b$<>\\\"\\\" {\\n GetOneUtf8Char(&b$)\\n \\\\\\\\ if final$ is document then 10 and 13 if comes alone are new line\\n \\\\\\\\ so we need to throw 10 after the 13, so we have to use oldb$\\n if b$=chr$(10) then if oldb$=chr$(13) then oldb$=\\\"\\\": continue\\n oldb$=b$\\n final$=b$ ' we use = for append to document\\n }\\n close #f\\n Report final$\\n Sub GetOneUtf8Char(&ch$)\\n ch$=\\\"\\\"\\n if Eof(#f) then Exit Sub\\n Get #f, One\\n Return Bytes, 0:=Eval(one, 0)\\n local mrk=Eval(one, 0)\\n Try ok {\\n If Binary.And(mrk, 0xE0)=0xC0 then {\\n Get #f,one\\n Return Bytes, 1:=Eval$(one, 0,1)\\n ch$=Eval$(Bytes, 0, 2)\\n } Else.if Binary.And(mrk, 0xF0)=0xE0 then {\\n Get #f,two\\n Return Bytes, 1:=Eval$(two,0,2)\\n ch$=Eval$(Bytes, 0, 3)\\n } Else.if Binary.And(mrk, 0xF8)=0xF0 then {\\n Get #f,three\\n Return Bytes, 1:=Eval$(three, 0, 3)\\n ch$=Eval$(Bytes, 0, 4)\\n } Else ch$=Eval$(Bytes, 0, 1)\\n }\\n if Error or not ok then ch$=\\\"\\\" : exit sub\\n ch$=left$(string$(ch$ as Utf8dec),1)\\n End Sub\\n}\\ncheckit\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"str = OpenRead[\\\"file.txt\\\"];\\nToString[Read[str, \\\"Character\\\"], CharacterEncoding -> \\\"UTF-8\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary\\nnumeric digits 20\\n\\nrunSample(arg)\\nreturn\\n\\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\\nmethod readCharacters(fName) public static binary returns String\\n slurped = String('')\\n slrp = StringBuilder()\\n fr = Reader null\\n fFile = File(fName)\\n EOF = int -1 -- End Of File indicator\\n do\\n fr = BufferedReader(FileReader(fFile))\\n ic = int\\n cc = char\\n -- read the contents of the file one character at a time\\n loop label rdr forever\\n -- Reader.read reads a single character as an integer value in the range 0 - 65535 [0x00 - 0xffff]\\n -- or -1 on end of stream i.e. End Of File\\n ic = fr.read()\\n if ic == EOF then leave rdr\\n cc = Rexx(ic).d2c\\n slrp.append(cc)\\n end rdr\\n -- load the results of the read into a variable\\n slurped = slrp.toString()\\n catch fex = FileNotFoundException\\n fex.printStackTrace()\\n catch iex = IOException\\n iex.printStackTrace()\\n finally\\n if fr \\\\= null then do\\n fr.close()\\n catch iex = IOException\\n iex.printStackTrace()\\n end\\n end\\n return slurped\\n\\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\\nmethod encodingDetails(str = String) public static\\n stlen = str.length()\\n cplen = Character.codePointCount(str, 0, stlen)\\n say 'Unicode: length=\\\"'stlen'\\\" code_point_count=\\\"'cplen'\\\" string=\\\"'str'\\\"'\\n loop ix = 0 to stlen - 1\\n cp = Rexx(Character.codePointAt(str, ix))\\n cc = Rexx(Character.charCount(cp))\\n say ' 'formatCodePoint(ix, cc, cp)\\n if cc > 1 then do\\n surrogates = [Rexx(Character.highSurrogate(cp)).c2d(), Rexx(Character.lowSurrogate(cp)).c2d()]\\n loop sx = 0 to cc - 1\\n ix = ix + sx\\n cp = surrogates[sx]\\n say ' 'formatCodePoint(ix, 1, cp)\\n end sx\\n end\\n end ix\\n say\\n return\\n\\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\\n-- @see http://docs.oracle.com/javase/6/docs/technotes/guides/intl/encoding.doc.html\\n-- @since Java 1.7\\nmethod formatCodePoint(ix, cc, cp) private static\\n scp = Rexx(Character.toChars(cp))\\n icp = cp.d2x(8).x2d(9) -- signed to unsigned conversion\\n ocp = Rexx(Integer.toOctalString(icp))\\n x_utf16 = ''\\n x_utf8 = ''\\n do\\n b_utf16 = String(scp).getBytes('UTF-16BE')\\n b_utf8 = String(scp).getBytes('UTF-8')\\n loop bv = 0 to b_utf16.length - 1 by 2\\n x_utf16 = x_utf16 Rexx(b_utf16[bv]).d2x(2) || Rexx(b_utf16[bv + 1]).d2x(2)\\n end bv\\n loop bv = 0 to b_utf8.length - 1\\n x_utf8 = x_utf8 Rexx(b_utf8[bv]).d2x(2)\\n end bv\\n x_utf16 = x_utf16.space(1, ',')\\n x_utf8 = x_utf8.space(1, ',')\\n catch ex = UnsupportedEncodingException\\n ex.printStackTrace()\\n end\\n cpName = Character.getName(cp)\\n fmt = -\\n 'CodePoint:' -\\n 'index=\\\"'ix.right(3, 0)'\\\"' -\\n 'character_count=\\\"'cc'\\\"' -\\n 'id=\\\"U+'cp.d2x(5)'\\\"' -\\n 'hex=\\\"0x'cp.d2x(6)'\\\"' -\\n 'dec=\\\"'icp.right(7, 0)'\\\"' -\\n 'oct=\\\"'ocp.right(7, 0)'\\\"' -\\n 'char=\\\"'scp'\\\"' -\\n 'utf-16=\\\"'x_utf16'\\\"' -\\n 'utf-8=\\\"'x_utf8'\\\"' -\\n 'name=\\\"'cpName'\\\"'\\n return fmt\\n\\n-- ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~\\nmethod runSample(arg) public static\\n parse arg fileNames\\n if fileNames = '' then fileNames = 'data/utf8-001.txt'\\n loop while fileNames \\\\= ''\\n parse fileNames fileName fileNames\\n slurped = readCharacters(fileName)\\n say \\\"Input:\\\" slurped\\n encodingDetails(slurped)\\n end\\n say\\n return\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"import unicode\\n\\nproc readUtf8(f: File): string =\\n ## Return next UTF-8 character as a string.\\n while true:\\n result.add f.readChar()\\n if result.validateUtf8() == -1: break\\n\\niterator readUtf8(f: File): string =\\n ## Yield successive UTF-8 characters from file \\\"f\\\".\\n var res: string\\n while not f.endOfFile:\\n res.setLen(0)\\n while true:\\n res.add f.readChar()\\n if res.validateUtf8() == -1: break\\n yield res\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"(* Read a file char by char *)\\n program ReadFileByChar;\\n var\\n InputFile,OutputFile: file of char;\\n InputChar: char;\\n begin\\n Assign(InputFile, 'testin.txt');\\n Reset(InputFile);\\n Assign(OutputFile, 'testout.txt');\\n Rewrite(OutputFile);\\n while not Eof(InputFile) do\\n begin\\n Read(InputFile, InputChar);\\n Write(OutputFile, InputChar)\\n end;\\n Close(InputFile);\\n Close(OutputFile)\\n end.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"binmode STDOUT, ':utf8'; # so we can print wide chars without warning\\n\\nopen my $fh, \\\"<:encoding(UTF-8)\\\", \\\"input.txt\\\" or die \\\"$!\\\\n\\\";\\n\\nwhile (read $fh, my $char, 1) {\\n printf \\\"got character $char [U+%04x]\\\\n\\\", ord $char;\\n}\\n\\nclose $fh;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">INVALID_UTF8</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">#FFFD</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">get_one_utf8_char</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- returns INVALID_UTF8 on error, else a string of 1..4 bytes representing one character</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">headb</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">bytes</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">c</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- headb = first byte of utf-8 character:</span>\\n <span style=\\\"color: #000000;\\\">headb</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">getc</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">headb</span><span style=\\\"color: #0000FF;\\\">=-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">headb</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- calculate length of utf-8 character in bytes (1..4):</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">headb</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">bytes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (utf-8 starts at #0)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">headb</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">0b01111111</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">bytes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 0b_0xxx_xxxx</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">headb</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">0b10111111</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">bytes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (it's a tail byte)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">headb</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">0b11011111</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">bytes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 0b_110x_xxxx</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">headb</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">0b11101111</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">bytes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">3</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 0b_1110_xxxx</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">headb</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">0b11110100</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">bytes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 0b_1111_0xzz</span>\\n <span style=\\\"color: #008080;\\\">else</span> <span style=\\\"color: #000000;\\\">bytes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (utf-8 ends at #10FFFF)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- 2..4 bytes encoding (tail range: 0b_1000_0000..0b_1011_1111);</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">bytes</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- tail bytes are valid?</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">getc</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">#80</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">#BF</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">bytes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- invalid tail byte or eof</span>\\n <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">c</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- 1 byte encoding (head range: 0b_0000_0000..0b_0111_1111):</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">bytes</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">headb</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- UTF-8 = ASCII\\n\\n -- 2 bytes encoding (head range: 0b_1100_0000..0b_1101_1111):</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">bytes</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">headb</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#1F</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">#40</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 0b110[7..11] headb</span>\\n <span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">#3F</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 0b10[1..6] tail</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">#7FF</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- sanity check</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">#80</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- long form?</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">INVALID_UTF8</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- 3 bytes encoding (head range: 0b_1110_0000..0b_1110_1111):</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">bytes</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">3</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">headb</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#0F</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">#1000</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 0b1110[13..16] head</span>\\n <span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">#3F</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">#40</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 0b10[7..12] tail</span>\\n <span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">#3F</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 0b10[1..6] tail</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">#FFFF</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- sanity check</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">#800</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- long form?</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">#D800</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">#DFFF</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- utf-16 incompatible</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">INVALID_UTF8</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- 4 bytes encoding (head range: 0b_1111_0000..0b_1111_0111):</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">bytes</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">headb</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">#07</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">#040000</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 0b11110[19..21] head</span>\\n <span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">#3F</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">#1000</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 0b10[13..18] tail</span>\\n <span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">#3F</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">#0040</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 0b10[7..12] tail</span>\\n <span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">#3F</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 0b10[1..6] tail</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">#10000</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- long form?</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">#10FFFF</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">INVALID_UTF8</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- utf-8 ends at #10FFFF</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- bytes = 0; current byte is not encoded correctly:</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">INVALID_UTF8</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--string utf8 = \\\"aă€⼥\\\" -- (same results as next)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">utf8</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">utf32_to_utf8</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">#0061</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">#0103</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">#20ac</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">#2f25</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"length of utf8 is %d bytes\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">utf8</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">fn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">open</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"test.txt\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"wb\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">utf8</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">close</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">fn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">open</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"test.txt\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"r\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">5</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">get_one_utf8_char</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #004080;\\\">string</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()=</span><span style=\\\"color: #000000;\\\">LINUX</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"char %d (%s) is %d bytes\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- unicode and consoles tricky on windows, so I'm\\n -- just avoiding that issue altogther (t)here.</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"char %d is %d bytes\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">=-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"char %d - EOF\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"char %d - INVALID_UTF8\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">close</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(in \\\"wordlist\\\"\\n (while (char)\\n (process @))\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"def get_next_character(f):\\n # note: assumes valid utf-8\\n c = f.read(1)\\n while c:\\n while True:\\n try:\\n yield c.decode('utf-8')\\n except UnicodeDecodeError:\\n # we've encountered a multibyte character\\n # read another byte and try again\\n c += f.read(1)\\n else:\\n # c was a valid char, and was yielded, continue\\n c = f.read(1)\\n break\\n\\n# Usage:\\nwith open(\\\"input.txt\\\",\\\"rb\\\") as f:\\n for c in get_next_character(f):\\n print(c)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def get_next_character(f):\\n \\\"\\\"\\\"Reads one character from the given textfile\\\"\\\"\\\"\\n c = f.read(1)\\n while c:\\n yield c\\n c = f.read(1)\\n\\n# Usage:\\nwith open(\\\"input.txt\\\", encoding=\\\"utf-8\\\") as f:\\n for c in get_next_character(f):\\n print(c, sep=\\\"\\\", end=\\\"\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"f = FREEFILE\\nfilename$ = \\\"file.txt\\\"\\n\\nOPEN filename$ FOR BINARY AS #f\\nWHILE NOT EOF(f)\\n char$ = STR$(LOF(f))\\n GET #f, , char$\\n PRINT char$;\\nWEND\\nCLOSE #f\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \"#lang racket\\n; This file contains utf-8 charachters: λ, α, γ ...\\n(for ([c (in-port read-char (open-input-file \\\"read-file.rkt\\\"))])\\n (display c))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#lang racket\\n; This file contains utf-8 charachters: λ, α, γ ...\\n(for ([c (in-port read-char (open-input-file \\\"read-file.rkt\\\"))])\\n (display c))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \".say while defined $_ = $*IN.getc;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"my $filename = 'whatever';\\n\\nmy $in = open( $filename, :r ) orelse .die;\\n\\nprint $_ while defined $_ = $in.getc;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program reads and displays a file char by char, returning 'EOF' when done. */\\nparse arg iFID . /*iFID: is the fileID to be read. */\\n /* [↓] show the file's contents. */\\nif iFID\\\\=='' then do j=1 until x=='EOF' /*J count's the file's characters. */\\n x=getchar(iFID); y= /*get a character or an 'EOF'. */\\n if x>>' ' then y=x /*display X if presentable. */\\n say right(j, 12) 'character, (hex,char)' c2x(x) y\\n end /*j*/ /* [↑] only display X if not low hex*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngetchar: procedure; parse arg z; if chars(z)==0 then return 'EOF'; return charin(z)\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/* REXX ---------------------------------------------------------------\\n* 29.12.2013 Walter Pachl\\n* read one utf8 character at a time\\n* see http://de.wikipedia.org/wiki/UTF-8#Kodierung\\n*--------------------------------------------------------------------*/\\noid='utf8.txt';'erase' oid /* first create file containing utf8 chars*/\\nCall charout oid,'79'x\\nCall charout oid,'C3A4'x\\nCall charout oid,'C2AE'x\\nCall charout oid,'E282AC'x\\nCall charout oid,'F09D849E'x\\nCall lineout oid\\nfid='utf8.txt' /* then read it and show the contents */\\nDo Until c8='EOF'\\n c8=get_utf8char(fid)\\n Say left(c8,4) c2x(c8)\\n End\\nExit\\n\\nget_utf8char: Procedure\\n Parse Arg f\\n If chars(f)=0 Then\\n Return 'EOF'\\n c=charin(f)\\n b=c2b(c)\\n If left(b,1)=0 Then\\n Nop\\n Else Do\\n p=pos('0',b)\\n Do i=1 To p-2\\n If chars(f)=0 Then Do\\n Say 'illegal contents in file' f\\n Leave\\n End\\n c=c||charin(f)\\n End\\n End\\n Return c\\n\\nc2b: Return x2b(c2x(arg(1)))\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"fp = fopen(\\\"C:\\\\Ring\\\\ReadMe.txt\\\",\\\"r\\\")\\nr = fgetc(fp)\\nwhile isstring(r)\\n r = fgetc(fp)\\n see r\\nend\\nfclose(fp)\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"File.open('input.txt', 'r:utf-8') do |f|\\n f.each_char{|c| p c}\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"File.open('input.txt', 'r:utf-8') do |f|\\n while c = f.getc\\n p c\\n end\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"open file.txt\\\" for binary as #f\\nnumChars = 1 ' specify number of characters to read\\na$ = input$(#f,numChars) ' read number of characters specified\\nb$ = input$(#f,1) ' read one character\\nclose #f\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use std::{\\n convert::TryFrom,\\n fmt::{Debug, Display, Formatter},\\n io::Read,\\n};\\n\\npub struct ReadUtf8<I: Iterator> {\\n source: std::iter::Peekable<I>,\\n}\\n\\nimpl<R: Read> From<R> for ReadUtf8<std::io::Bytes<R>> {\\n fn from(source: R) -> Self {\\n ReadUtf8 {\\n source: source.bytes().peekable(),\\n }\\n }\\n}\\n\\nimpl<I, E> Iterator for ReadUtf8<I>\\nwhere\\n I: Iterator<Item = Result<u8, E>>,\\n{\\n type Item = Result<char, Error<E>>;\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n self.source.next().map(|next| match next {\\n Ok(lead) => self.complete_char(lead),\\n Err(e) => Err(Error::SourceError(e)),\\n })\\n }\\n}\\n\\nimpl<I, E> ReadUtf8<I>\\nwhere\\n I: Iterator<Item = Result<u8, E>>,\\n{\\n fn continuation(&mut self) -> Result<u32, Error<E>> {\\n if let Some(Ok(byte)) = self.source.peek() {\\n let byte = *byte;\\n\\n return if byte & 0b1100_0000 == 0b1000_0000 {\\n self.source.next();\\n Ok((byte & 0b0011_1111) as u32)\\n } else {\\n Err(Error::InvalidByte(byte))\\n };\\n }\\n\\n match self.source.next() {\\n None => Err(Error::InputTruncated),\\n Some(Err(e)) => Err(Error::SourceError(e)),\\n Some(Ok(_)) => unreachable!(),\\n }\\n }\\n\\n fn complete_char(&mut self, lead: u8) -> Result<char, Error<E>> {\\n let a = lead as u32; // Let's name the bytes in the sequence\\n\\n let result = if a & 0b1000_0000 == 0 {\\n Ok(a)\\n } else if lead & 0b1110_0000 == 0b1100_0000 {\\n let b = self.continuation()?;\\n Ok((a & 0b0001_1111) << 6 | b)\\n } else if a & 0b1111_0000 == 0b1110_0000 {\\n let b = self.continuation()?;\\n let c = self.continuation()?;\\n Ok((a & 0b0000_1111) << 12 | b << 6 | c)\\n } else if a & 0b1111_1000 == 0b1111_0000 {\\n let b = self.continuation()?;\\n let c = self.continuation()?;\\n let d = self.continuation()?;\\n Ok((a & 0b0000_0111) << 18 | b << 12 | c << 6 | d)\\n } else {\\n Err(Error::InvalidByte(lead))\\n };\\n\\n Ok(char::try_from(result?).unwrap())\\n }\\n}\\n\\n#[derive(Debug, Clone)]\\npub enum Error<E> {\\n InvalidByte(u8),\\n InputTruncated,\\n SourceError(E),\\n}\\n\\nimpl<E: Display> Display for Error<E> {\\n fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {\\n match self {\\n Self::InvalidByte(b) => write!(f, \\\"invalid byte 0x{:x}\\\", b),\\n Self::InputTruncated => write!(f, \\\"character truncated\\\"),\\n Self::SourceError(e) => e.fmt(f),\\n }\\n }\\n}\\n\\nfn main() -> std::io::Result<()> {\\n for (index, value) in ReadUtf8::from(std::fs::File::open(\\\"test.txt\\\")?).enumerate() {\\n match value {\\n Ok(c) => print!(\\\"{}\\\", c),\\n\\n Err(e) => {\\n print!(\\\"\\\\u{fffd}\\\");\\n eprintln!(\\\"offset {}: {}\\\", index, e);\\n }\\n }\\n }\\n\\n Ok(())\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"utf8.s7i\\\";\\n\\nconst proc: main is func\\n local\\n var file: inFile is STD_NULL;\\n var char: ch is ' ';\\n begin\\n OUT := STD_UTF8_OUT;\\n inFile := openUtf8(\\\"readAFileCharacterByCharacterUtf8.in\\\", \\\"r\\\");\\n if inFile <> STD_NULL then\\n while hasNext(inFile) do\\n ch := getc(inFile);\\n writeln(\\\"got character \\\" <& ch <& \\\" [U+\\\" <& ord(ch) radix 16 <& \\\"]\\\");\\n end while;\\n close(inFile);\\n end if;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"var file = File('input.txt') # the input file contains: \\\"aă€⼥\\\"\\nvar fh = file.open_r # equivalent with: file.open('<:utf8')\\nfh.each_char { |char|\\n printf(\\\"got character #{char} [U+%04x]\\\\n\\\", char.ord)\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"|utfStream|\\nutfStream := 'input' asFilename readStream asUTF8EncodedStream.\\n[utfStream atEnd] whileFalse:[\\n Transcript showCR:'got char ',utfStream next.\\n].\\nutfStream close.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"set ch [read $channel 1]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"fconfigure $channel -buffersize $byteCount\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import os\\n\\nfn main() {\\n\\tfile := './file.txt'\\n\\tmut content_arr := []u8{}\\n\\t\\t\\n\\tif os.is_file(file) == true {\\n\\t\\tcontent_arr << os.read_bytes(file) or {\\n\\t\\t\\tprintln('Error: can not read')\\n\\t\\t\\texit(1)\\n\\t\\t}\\n\\t}\\n\\telse {\\n\\t\\tprintln('Error: can not find file')\\n\\t\\texit(1)\\n\\t}\\n\\n\\tprintln(content_arr.bytestr())\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"import \\\"io\\\" for File\\n\\nFile.open(\\\"input.txt\\\") { |file|\\n var offset = 0\\n var char = \\\"\\\" // stores each byte read till we have a complete UTF encoded character\\n while(true) {\\n var b = file.readBytes(1, offset)\\n if (b == \\\"\\\") return // end of stream\\n char = char + b\\n if (char.codePoints[0] >= 0) { // a UTF encoded character is complete\\n System.write(char) // print it\\n char = \\\"\\\" // reset store\\n }\\n offset = offset + 1\\n }\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn readUTF8c(chr,s=\\\"\\\"){ // transform UTF-8 character stream\\n s+=chr;\\n try{ s.len(8); return(s) }\\n catch{ if(s.len()>6) throw(__exception) } // 6 bytes max for UTF-8\\n return(Void.Again,s); // call me again with s & another character\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn utf8Walker(obj){\\n obj.walker(3) // read characters\\n .tweak(readUTF8c)\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"s:=\\\"-->\\\\u20AC123\\\"; // --> e2,82,ac,31,32,33 == -->€123\\nutf8Walker(s).walk().println();\\n\\nw:=utf8Walker(Data(Void,s,\\\"\\\\n\\\")); // Data is a byte bucket\\nforeach c in (utf8Walker(Data(Void,s,\\\"\\\\n\\\"))){ print(c) }\\n\\nutf8Walker(Data(Void,0xe2,0x82,\\\"123456\\\")).walk().println(); // € is short 1 byte\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"stream:=Data(Void,s,\\\"\\\\n\\\").howza(3); // character stream\\nstream.pump(List,readUTF8c,\\\"print\\\")\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"File(\\\"foo.txt\\\",\\\"rb\\\").howza(3).pump(List,readUTF8c,\\\"print\\\");\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Read-a-file-character-by-character-UTF8"}}},{"rowIdx":1566,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Simple\nfrom: http://rosettacode.org/wiki/Read_a_file_line_by_line\nnote: File handling\n","language":"00-META"},{"code":"Read a file one line at a time, \nas opposed to [[Read entire file|reading the entire file at once]].\n\n\n;Related tasks:\n* [[Read a file character by character]]\n* [[Input loop]].\n<br><br>\n\n","language":"00-TASK"},{"code":"* Read a file line by line 12/06/2016\nREADFILE CSECT\n SAVE (14,12) save registers on entry\n PRINT NOGEN\n BALR R12,0 establish addressability\n USING *,R12 set base register\n ST R13,SAVEA+4 link mySA->prevSA\n LA R11,SAVEA mySA\n ST R11,8(R13) link prevSA->mySA\n LR R13,R11 set mySA pointer\n OPEN (INDCB,INPUT) open the input file\n OPEN (OUTDCB,OUTPUT) open the output file\nLOOP GET INDCB,PG read record\n CLI EOFFLAG,C'Y' eof reached?\n BE EOF\n PUT OUTDCB,PG write record\n B LOOP\nEOF CLOSE (INDCB) close input\n CLOSE (OUTDCB) close output\n L R13,SAVEA+4 previous save area addrs\n RETURN (14,12),RC=0 return to caller with rc=0\nINEOF CNOP 0,4 end-of-data routine\n MVI EOFFLAG,C'Y' set the end-of-file flag\n BR R14 return to caller\nSAVEA DS 18F save area for chaining\nINDCB DCB DSORG=PS,MACRF=PM,DDNAME=INDD,LRECL=80, *\n RECFM=FB,EODAD=INEOF\nOUTDCB DCB DSORG=PS,MACRF=PM,DDNAME=OUTDD,LRECL=80, *\n RECFM=FB\nEOFFLAG DC C'N' end-of-file flag\nPG DS CL80 buffer\n YREGS\n END READFILE\n","language":"360-Assembly"},{"code":"\"path/to/file\" f:open ( . cr ) f:eachline f:close\n","language":"8th"},{"code":"/* ARM assembly AARCH64 Raspberry PI 3B */\n/* program readfile64.s */\n\n/*******************************************/\n/* Constantes file */\n/*******************************************/\n/* for this file see task include a file in language AArch64 assembly*/\n.include \"../includeConstantesARM64.inc\"\n\n.equ BUFFERSIZE, 1000\n.equ LINESIZE, 100\n\n\n/*******************************************/\n/* Structures */\n/********************************************/\n/* structure read file*/\n .struct 0\nreadfile_Fd: // File descriptor\n .struct readfile_Fd + 8\nreadfile_buffer: // read buffer\n .struct readfile_buffer + 8\nreadfile_buffersize: // buffer size\n .struct readfile_buffersize + 8\nreadfile_line: // line buffer\n .struct readfile_line + 8\nreadfile_linesize: // line buffer size\n .struct readfile_linesize + 8\nreadfile_pointer:\n .struct readfile_pointer + 8 // read pointer (init to buffer size + 1)\nreadfile_end:\n/*******************************************/\n/* Initialized data */\n/*******************************************/\n.data\nszFileName: .asciz \"fictest.txt\"\nszCarriageReturn: .asciz \"\\n\"\n/* datas error display */\nszMessError: .asciz \"Error detected : @ \\n\"\n\n/*******************************************/\n/* UnInitialized data */\n/*******************************************/\n.bss\nsBuffer: .skip BUFFERSIZE // buffer result\nszLineBuffer: .skip LINESIZE\n.align 4\nstReadFile: .skip readfile_end\nsZoneConv: .skip 24\n/*******************************************/\n/* code section */\n/*******************************************/\n.text\n.global main\nmain:\n mov x0,AT_FDCWD\n ldr x1,qAdrszFileName // File name\n mov x2,O_RDWR // flags\n mov x3,0 // mode\n mov x8,OPEN // open file\n svc 0\n cmp x0,0 // error ?\n ble error\n ldr x21,qAdrstReadFile // init struture readfile\n str x0,[x21,readfile_Fd] // save FD in structure\n ldr x0,qAdrsBuffer // buffer address\n str x0,[x21,readfile_buffer]\n mov x0,BUFFERSIZE // buffer size\n str x0,[x21,readfile_buffersize]\n ldr x0,qAdrszLineBuffer // line buffer address\n str x0,[x21,readfile_line]\n mov x0,LINESIZE // line buffer size\n str x0,[x21,readfile_linesize]\n mov x0,BUFFERSIZE + 1 // init read pointer\n str x0,[x21,readfile_pointer]\n1: // begin read loop\n mov x0,x21\n bl readLineFile\n cmp x0,0\n beq end // end loop\n blt error\n\n ldr x0,qAdrszLineBuffer // display line\n bl affichageMess\n ldr x0,qAdrszCarriageReturn // display line return\n bl affichageMess\n b 1b // and loop\n\nend:\n ldr x1,qAdrstReadFile\n ldr x0,[x1,readfile_Fd] // load FD to structure\n mov x8,CLOSE // call system close file\n svc 0\n cmp x0,0\n blt error\n mov x0,0 // return code\n b 100f\nerror:\n ldr x1,qAdrsZoneConv\n bl conversion10S\n ldr x0,qAdrszMessError // error message\n ldr x1,qAdrsZoneConv\n bl strInsertAtCharInc // insert result at @ character\n bl affichageMess\n mov x0,1 // return error code\n100: // standard end of the program\n mov x8,EXIT // request to exit program\n svc 0 // perform system call\nqAdrsBuffer: .quad sBuffer\nqAdrszFileName: .quad szFileName\nqAdrszMessError: .quad szMessError\nqAdrsZoneConv: .quad sZoneConv\nqAdrszCarriageReturn: .quad szCarriageReturn\nqAdrstReadFile: .quad stReadFile\nqAdrszLineBuffer: .quad szLineBuffer\n/******************************************************************/\n/* sub strings index start number of characters */\n/******************************************************************/\n/* x0 contains the address of the structure */\n/* x0 returns number of characters or -1 if error */\nreadLineFile:\n stp x1,lr,[sp,-16]! // save registers\n mov x14,x0 // save structure\n ldr x11,[x14,#readfile_buffer]\n ldr x12,[x14,#readfile_buffersize]\n ldr x15,[x14,#readfile_pointer]\n ldr x16,[x14,#readfile_linesize]\n ldr x18,[x14,#readfile_buffersize]\n ldr x10,[x14,#readfile_line]\n mov x13,0\n strb wzr,[x10,x13] // store zéro in line buffer\n cmp x15,x12 // pointer buffer < buffer size ?\n ble 2f // no file read\n1: // loop read file\n ldr x0,[x14,#readfile_Fd]\n mov x1,x11 // buffer address\n mov x2,x12 // buffer size\n mov x8,READ // call system read file\n svc 0\n cmp x0,#0 // error read or end ?\n ble 100f\n mov x18,x0 // number of read characters\n mov x15,#0 // init buffer pointer\n\n2: // begin loop copy characters\n ldrb w0,[x11,x15] // load 1 character read buffer\n cmp x0,0x0A // end line ?\n beq 4f\n strb w0,[x10,x13] // store character in line buffer\n add x13,x13,1 // increment pointer line\n cmp x13,x16\n bgt 99f // error\n add x15,x15,1 // increment buffer pointer\n cmp x15,x12 // end buffer ?\n bge 1b // yes new read\n cmp x15,x18 // read characters ?\n blt 2b // no loop\n // final\n cmp x13,0 // no characters in line buffer ?\n beq 100f\n4:\n strb wzr,[x10,x13] // store zéro final\n add x15,x15,#1\n str x15,[x14,#readfile_pointer] // store pointer in structure\n str x18,[x14,#readfile_buffersize] // store number of last characters\n mov x0,x13 // return length of line\n b 100f\n99:\n mov x0,#-2 // line buffer too small -> error\n100:\n\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\n/********************************************************/\n/* File Include fonctions */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"\n","language":"AArch64-Assembly"},{"code":"char array TXT\n\nProc Main()\n\n Open (1,\"D:FILENAME.TXT\",4,0)\n Do\n InputSD(1,TXT)\n PrintE(TXT)\n Until EOF(1)\n Od\n Close(1)\n\nReturn\n","language":"Action-"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\n\nprocedure Line_By_Line is\n File : File_Type;\nbegin\n Open (File => File,\n Mode => In_File,\n Name => \"line_by_line.adb\");\n While not End_Of_File (File) Loop\n Put_Line (Get_Line (File));\n end loop;\n\n Close (File);\nend Line_By_Line;\n","language":"Ada"},{"code":"file f;\ntext s;\n\nf.affix(\"src/aime.c\");\n\nwhile (f.line(s) != -1) {\n o_text(s);\n o_byte('\\n');\n}\n","language":"Aime"},{"code":"#!/usr/local/bin/a68g --script #\n\nFILE foobar;\nINT errno = open(foobar, \"Read_a_file_line_by_line.a68\", stand in channel);\n\nSTRING line;\nFORMAT line fmt = $gl$;\n\nPROC mount next tape = (REF FILE file)BOOL: (\n print(\"Please mount next tape or q to quit\");\n IF read char = \"q\" THEN done ELSE TRUE FI\n);\n\non physical file end(foobar, mount next tape);\non logical file end(foobar, (REF FILE skip)BOOL: done);\n\nFOR count DO\n getf(foobar, (line fmt, line));\n printf(($g(0)\": \"$, count, line fmt, line))\nOD;\ndone: SKIP\n","language":"ALGOL-68"},{"code":"#include <hopper.h>\n\nmain:\n .ctrlc\n fd=0\n fopen(OPEN_READ,\"archivo.txt\")(fd)\n if file error?\n {\"Error open file: \"},file error\n else\n line read=0\n while( not(feof(fd)))\n fread line(1000)(fd), ++line read\n println\n wend\n {\"Total read lines : \",line read}\n fclose(fd)\n endif\n println\nexit(0)\n","language":"Amazing-Hopper"},{"code":"⍝⍝ GNU APL Version\n∇listFile fname ;fileHandle;maxLineLen;line\n maxLineLen ← 128\n fileHandle ← ⎕FIO['fopen'] fname\nreadLoop:\n →(0=⍴(line ← maxLineLen ⎕FIO['fgets'] fileHandle))/eof\n ⍞ ← ⎕AV[1+line] ⍝⍝ bytes to ASCII\n → readLoop\neof:\n ⊣⎕FIO['fclose'] fileHandle\n ⊣⎕FIO['errno'] fileHandle\n∇\n\n listFile 'corpus/sample1.txt'\nThis is some sample text.\nThe text itself has multiple lines, and\nthe text has some words that occur multiple times\nin the text.\n\nThis is the end of the text.\n","language":"APL"},{"code":"/* ARM assembly Raspberry PI */\n/* program readfile.s */\n\n/* Constantes */\n.equ STDOUT, 1 @ Linux output console\n.equ EXIT, 1 @ Linux syscall\n.equ READ, 3\n.equ WRITE, 4\n.equ OPEN, 5\n.equ CLOSE, 6\n\n.equ O_RDWR, 0x0002 @ open for reading and writing\n\n.equ BUFFERSIZE, 100\n.equ LINESIZE, 100\n\n/*******************************************/\n/* Structures */\n/********************************************/\n/* structure read file*/\n .struct 0\nreadfile_Fd: @ File descriptor\n .struct readfile_Fd + 4\nreadfile_buffer: @ read buffer\n .struct readfile_buffer + 4\nreadfile_buffersize: @ buffer size\n .struct readfile_buffersize + 4\nreadfile_line: @ line buffer\n .struct readfile_line + 4\nreadfile_linesize: @ line buffer size\n .struct readfile_linesize + 4\nreadfile_pointer:\n .struct readfile_pointer + 4 @ read pointer (init to buffer size + 1)\nreadfile_end:\n/* Initialized data */\n.data\nszFileName: .asciz \"fictest.txt\"\nszCarriageReturn: .asciz \"\\n\"\n/* datas error display */\nszMessErreur: .asciz \"Error detected.\\n\"\nszMessErr: .ascii \"Error code hexa : \"\nsHexa: .space 9,' '\n .ascii \" decimal : \"\nsDeci: .space 15,' '\n .asciz \"\\n\"\n\n/* UnInitialized data */\n.bss\nsBuffer: .skip BUFFERSIZE @ buffer result\nszLineBuffer: .skip LINESIZE\n.align 4\nstReadFile: .skip readfile_end\n\n/* code section */\n.text\n.global main\nmain:\n ldr r0,iAdrszFileName @ File name\n mov r1,#O_RDWR @ flags\n mov r2,#0 @ mode\n mov r7,#OPEN @ open file\n svc #0\n cmp r0,#0 @ error ?\n ble error\n ldr r1,iAdrstReadFile @ init struture readfile\n str r0,[r1,#readfile_Fd] @ save FD in structure\n ldr r0,iAdrsBuffer @ buffer address\n str r0,[r1,#readfile_buffer]\n mov r0,#BUFFERSIZE @ buffer size\n str r0,[r1,#readfile_buffersize]\n ldr r0,iAdrszLineBuffer @ line buffer address\n str r0,[r1,#readfile_line]\n mov r0,#LINESIZE @ line buffer size\n str r0,[r1,#readfile_linesize]\n mov r0,#BUFFERSIZE + 1 @ init read pointer\n str r0,[r1,#readfile_pointer]\n1: @ begin read loop\n mov r0,r1\n bl readLineFile\n cmp r0,#0\n beq end @ end loop\n blt error\n\n ldr r0,iAdrszLineBuffer @ display line\n bl affichageMess\n ldr r0,iAdrszCarriageReturn @ display line return\n bl affichageMess\n b 1b @ and loop\n\nend:\n ldr r1,iAdrstReadFile\n ldr r0,[r1,#readfile_Fd] @ load FD to structure\n mov r7, #CLOSE @ call system close file\n svc #0\n cmp r0,#0\n blt error\n mov r0,#0 @ return code\n b 100f\nerror:\n ldr r1,iAdrszMessErreur @ error message\n bl displayError\n mov r0,#1 @ return error code\n100: @ standard end of the program\n mov r7, #EXIT @ request to exit program\n svc 0 @ perform system call\niAdrsBuffer: .int sBuffer\niAdrszFileName: .int szFileName\niAdrszMessErreur: .int szMessErreur\niAdrszCarriageReturn: .int szCarriageReturn\niAdrstReadFile: .int stReadFile\niAdrszLineBuffer: .int szLineBuffer\n/******************************************************************/\n/* sub strings index start number of characters */\n/******************************************************************/\n/* r0 contains the address of the structure */\n/* r0 returns number of characters or -1 if error */\nreadLineFile:\n push {r1-r8,lr} @ save registers\n mov r4,r0 @ save structure\n ldr r1,[r4,#readfile_buffer]\n ldr r2,[r4,#readfile_buffersize]\n ldr r5,[r4,#readfile_pointer]\n ldr r6,[r4,#readfile_linesize]\n ldr r7,[r4,#readfile_buffersize]\n ldr r8,[r4,#readfile_line]\n mov r3,#0 @ line pointer\n strb r3,[r8,r3] @ store zéro in line buffer\n cmp r5,r2 @ pointer buffer < buffer size ?\n ble 2f @ no file read\n1: @ loop read file\n ldr r0,[r4,#readfile_Fd]\n mov r7,#READ @ call system read file\n svc 0\n cmp r0,#0 @ error read or end ?\n ble 100f\n mov r7,r0 @ number of read characters\n mov r5,#0 @ init buffer pointer\n\n2: @ begin loop copy characters\n ldrb r0,[r1,r5] @ load 1 character read buffer\n cmp r0,#0x0A @ end line ?\n beq 4f\n strb r0,[r8,r3] @ store character in line buffer\n add r3,#1 @ increment pointer line\n cmp r3,r6\n movgt r0,#-2 @ line buffer too small -> error\n bgt 100f\n add r5,#1 @ increment buffer pointer\n cmp r5,r2 @ end buffer ?\n bge 1b @ yes new read\n cmp r5,r7 @ read characters ?\n blt 2b @ no loop\n @ final\n cmp r3,#0 @ no characters in line buffer ?\n beq 100f\n4:\n mov r0,#0\n strb r0,[r8,r3] @ store zéro final\n add r5,#1\n str r5,[r4,#readfile_pointer] @ store pointer in structure\n str r7,[r4,#readfile_buffersize] @ store number of last characters\n mov r0,r3 @ return length of line\n100:\n pop {r1-r8,lr} @ restaur registers\n bx lr @ return\n\n/******************************************************************/\n/* display text with size calculation */\n/******************************************************************/\n/* r0 contains the address of the message */\naffichageMess:\n push {r0,r1,r2,r7,lr} @ save registers\n mov r2,#0 @ counter length */\n1: @ loop length calculation\n ldrb r1,[r0,r2] @ read octet start position + index\n cmp r1,#0 @ if 0 its over\n addne r2,r2,#1 @ else add 1 in the length\n bne 1b @ and loop\n @ so here r2 contains the length of the message\n mov r1,r0 @ address message in r1\n mov r0,#STDOUT @ code to write to the standard output Linux\n mov r7, #WRITE @ code call system \"write\"\n svc #0 @ call system\n pop {r0,r1,r2,r7,lr} @ restaur registers\n bx lr @ return\n/***************************************************/\n/* display error message */\n/***************************************************/\n/* r0 contains error code r1 : message address */\ndisplayError:\n push {r0-r2,lr} @ save registers\n mov r2,r0 @ save error code\n mov r0,r1\n bl affichageMess\n mov r0,r2 @ error code\n ldr r1,iAdrsHexa\n bl conversion16 @ conversion hexa\n mov r0,r2 @ error code\n ldr r1,iAdrsDeci @ result address\n bl conversion10S @ conversion decimale\n ldr r0,iAdrszMessErr @ display error message\n bl affichageMess\n100:\n pop {r0-r2,lr} @ restaur registers\n bx lr @ return\niAdrszMessErr: .int szMessErr\niAdrsHexa: .int sHexa\niAdrsDeci: .int sDeci\n/******************************************************************/\n/* Converting a register to hexadecimal */\n/******************************************************************/\n/* r0 contains value and r1 address area */\nconversion16:\n push {r1-r4,lr} @ save registers\n mov r2,#28 @ start bit position\n mov r4,#0xF0000000 @ mask\n mov r3,r0 @ save entry value\n1: @ start loop\n and r0,r3,r4 @ value register and mask\n lsr r0,r2 @ move right\n cmp r0,#10 @ compare value\n addlt r0,#48 @ <10 ->digit\n addge r0,#55 @ >10 ->letter A-F\n strb r0,[r1],#1 @ store digit on area and + 1 in area address\n lsr r4,#4 @ shift mask 4 positions\n subs r2,#4 @ counter bits - 4 <= zero ?\n bge 1b @ no -> loop\n\n100:\n pop {r1-r4,lr} @ restaur registers\n bx lr\n/***************************************************/\n/* Converting a register to a signed decimal */\n/***************************************************/\n/* r0 contains value and r1 area address */\nconversion10S:\n push {r0-r4,lr} @ save registers\n mov r2,r1 @ debut zone stockage\n mov r3,#'+' @ par defaut le signe est +\n cmp r0,#0 @ negative number ?\n movlt r3,#'-' @ yes\n mvnlt r0,r0 @ number inversion\n addlt r0,#1\n mov r4,#10 @ length area\n1: @ start loop\n bl divisionpar10U\n add r1,#48 @ digit\n strb r1,[r2,r4] @ store digit on area\n sub r4,r4,#1 @ previous position\n cmp r0,#0 @ stop if quotient = 0\n bne 1b\t\n\n strb r3,[r2,r4] @ store signe\n subs r4,r4,#1 @ previous position\n blt 100f @ if r4 < 0 -> end\n\n mov r1,#' ' @ space\n2:\n strb r1,[r2,r4] @store byte space\n subs r4,r4,#1 @ previous position\n bge 2b @ loop if r4 > 0\n100:\n pop {r0-r4,lr} @ restaur registers\n bx lr\n/***************************************************/\n/* division par 10 unsigned */\n/***************************************************/\n/* r0 dividende */\n/* r0 quotient */\n/* r1 remainder */\ndivisionpar10U:\n push {r2,r3,r4, lr}\n mov r4,r0 @ save value\n //mov r3,#0xCCCD @ r3 <- magic_number lower raspberry 3\n //movt r3,#0xCCCC @ r3 <- magic_number higter raspberry 3\n ldr r3,iMagicNumber @ r3 <- magic_number raspberry 1 2\n umull r1, r2, r3, r0 @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0)\n mov r0, r2, LSR #3 @ r2 <- r2 >> shift 3\n add r2,r0,r0, lsl #2 @ r2 <- r0 * 5\n sub r1,r4,r2, lsl #1 @ r1 <- r4 - (r2 * 2) = r4 - (r0 * 10)\n pop {r2,r3,r4,lr}\n bx lr @ leave function\niMagicNumber: \t.int 0xCCCCCCCD\n","language":"ARM-Assembly"},{"code":"loop read.lines \"myfile.txt\" 'line ->\n print line\n","language":"Arturo"},{"code":"for line in lines open('input.txt'):\n print line\n","language":"Astro"},{"code":"; --> Prompt the user to select the file being read\n\nFileSelectFile, File, 1, %A_ScriptDir%, Select the (text) file to read, Documents (*.txt) ; Could of course be set to support other filetypes\nIf Errorlevel ; If no file selected\n\tExitApp\n\n; --> Main loop: Input (File), Output (Text)\n\nLoop\n{\nFileReadLine, Line, %File%, %A_Index% ; Reads line N (where N is loop iteration)\nif Errorlevel ; If line does not exist, break loop\n\tbreak\nText .= A_Index \". \" Line . \"`n\" ; Appends the line to the variable \"Text\", adding line number before & new line after\n}\n\n; --> Delivers the output as a text file\n\nFileDelete, Output.txt ; Makes sure output is clear before writing\nFileAppend, %Text%, Output.txt ; Writes the result to Output.txt\nRun Output.txt ; Shows the created file\n","language":"AutoHotkey"},{"code":"awk '{ print $0 }' filename\n","language":"AWK"},{"code":"awk '1' filename\n","language":"AWK"},{"code":"# usage: awk -f readlines.awk *.txt\nBEGIN { print \"# Reading...\" }\nFNR==1 { f++; print \"# File #\" f, \":\", FILENAME }\n/^#/ { c++; next } # skip lines starting with \"#\", but count them\n/you/ { gsub(\"to\", \"TO\") } # change text in lines with \"you\" somewhere\n/TO/ { print FNR,\":\",$0; next } # print with line-number\n { print } # same as \"print $0\"\nEND { print \"# Done with\", f, \"file(s), with a total of\", NR, \"lines.\" }\nEND { print \"# Comment-lines:\", c }\n","language":"AWK"},{"code":"' Read a file line by line\nfilename$ = \"readlines.bac\"\nOPEN filename$ FOR READING AS fh\nREADLN fl$ FROM fh\nWHILE ISFALSE(ENDFILE(fh))\n INCR lines\n READLN fl$ FROM fh\nWEND\nPRINT lines, \" lines in \", filename$\nCLOSE FILE fh\n","language":"BaCon"},{"code":"f = freefile\nfilename$ = \"file.txt\"\n\nopen f, filename$\n\nwhile not eof(f)\n print readline(f)\nend while\nclose f\nend\n","language":"BASIC256"},{"code":"@echo off\nrem delayed expansion must be disabled before the FOR command.\nsetlocal disabledelayedexpansion\nfor /f \"tokens=1* delims=]\" %%A in ('type \"File.txt\"^|find /v /n \"\"') do (\n\tset var=%%B\n\tsetlocal enabledelayedexpansion\n\t\techo(!var!\n\tendlocal\n)\n","language":"Batch-File"},{"code":" file% = OPENIN(\"*.txt\")\n IF file%=0 ERROR 100, \"File could not be opened\"\n WHILE NOT EOF#file%\n a$ = GET$#file%\n ENDWHILE\n CLOSE #file%\n","language":"BBC-BASIC"},{"code":" file% = OPENIN(\"*.txt\")\n IF file%=0 ERROR 100, \"File could not be opened\"\n WHILE NOT EOF#file%\n INPUT #file%, a$\n IF ASCa$=10 a$ = MID$(a$,2)\n ENDWHILE\n CLOSE #file%\n","language":"BBC-BASIC"},{"code":" fil$(\"test.txt\",r) { r opens a text file, rb opens a binary file for reading }\n& fil$(,STR,\\n) { first argument empty: same as before (i.e. \"test.txt\") }\n { if \\n were replaced by e.g. \"\\n\\t \" we would read word-wise instead }\n& 0:?lineno\n& whl\n ' ( fil$:(?line.?sep) { \"sep\" contains found stop character, i.e. \\n }\n & put$(line (1+!lineno:?lineno) \":\" !line \\n)\n )\n& (fil$(,SET,-1)|); { Setting file position before start closes file, and fails.\n Therefore the | }\n","language":"Bracmat"},{"code":"include :file\n\nfile.each_line \"foobar.txt\" { line |\n p line\n}\n","language":"Brat"},{"code":"/* Programa: Número mayor de tres números introducidos (Solución 1) */\n\n#include <conio.h>\n#include <stdio.h>\n\nint main()\n{\n int n1, n2, n3;\n\n printf( \"\\n Introduzca el primer n%cmero (entero): \", 163 );\n scanf( \"%d\", &n1 );\n printf( \"\\n Introduzca el segundo n%cmero (entero): \", 163 );\n scanf( \"%d\", &n2 );\n printf( \"\\n Introduzca el tercer n%cmero (entero): \", 163 );\n scanf( \"%d\", &n3 );\n\n if ( n1 >= n2 && n1 >= n3 )\n printf( \"\\n %d es el mayor.\", n1 );\n else\n\n if ( n2 > n3 )\n printf( \"\\n %d es el mayor.\", n2 );\n else\n printf( \"\\n %d es el mayor.\", n3 );\n\n getch(); /* Pausa */\n\n return 0;\n}\n","language":"C"},{"code":"// From manpage for \"getline\"\n\n#include <stdio.h>\n#include <stdlib.h>\n\nint main(void)\n{\n\tFILE *stream;\n\tchar *line = NULL;\n\tsize_t len = 0;\n\tssize_t read;\n\n\tstream = fopen(\"file.txt\", \"r\");\n\tif (stream == NULL)\n\t\texit(EXIT_FAILURE);\n\n\twhile ((read = getline(&line, &len, stream)) != -1) {\n\t\tprintf(\"Retrieved line of length %u :\\n\", read);\n\t\tprintf(\"%s\", line);\n\t}\n\n\tfree(line);\n\tfclose(stream);\n\texit(EXIT_SUCCESS);\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <sys/types.h>\n#include <sys/stat.h>\n#include <fcntl.h> /* C POSIX library file control options */\n#include <unistd.h> /* C POSIX library system calls: open, close */\n#include <sys/mman.h> /* memory management declarations: mmap, munmap */\n#include <errno.h> /* Std C library system error numbers: errno */\n#include <err.h> /* GNU C lib error messages: err */\n\nint read_lines(const char * fname, int (*call_back)(const char*, const char*))\n{\n int fd = open(fname, O_RDONLY);\n struct stat fs;\n char *buf, *buf_end;\n char *begin, *end, c;\n\n if (fd == -1) {\n err(1, \"open: %s\", fname);\n return 0;\n }\n\n if (fstat(fd, &fs) == -1) {\n err(1, \"stat: %s\", fname);\n return 0;\n }\n\n /* fs.st_size could have been 0 actually */\n buf = mmap(0, fs.st_size, PROT_READ, MAP_SHARED, fd, 0);\n if (buf == (void*) -1) {\n err(1, \"mmap: %s\", fname);\n close(fd);\n return 0;\n }\n\n buf_end = buf + fs.st_size;\n\n begin = end = buf;\n while (1) {\n if (! (*end == '\\r' || *end == '\\n')) {\n if (++end < buf_end) continue;\n } else if (1 + end < buf_end) {\n /* see if we got \"\\r\\n\" or \"\\n\\r\" here */\n c = *(1 + end);\n if ( (c == '\\r' || c == '\\n') && c != *end)\n ++end;\n }\n\n /* call the call back and check error indication. Announce\n error here, because we didn't tell call_back the file name */\n if (! call_back(begin, end)) {\n err(1, \"[callback] %s\", fname);\n break;\n }\n\n if ((begin = ++end) >= buf_end)\n break;\n }\n\n munmap(buf, fs.st_size);\n close(fd);\n return 1;\n}\n\nint print_line(const char* begin, const char* end)\n{\n if (write(fileno(stdout), begin, end - begin + 1) == -1) {\n return 0;\n }\n return 1;\n}\n\nint main()\n{\n return read_lines(\"test.ps\", print_line) ? 0 : 1;\n}\n","language":"C"},{"code":"#include <fstream>\n#include <string>\n#include <iostream>\n\nint main( int argc , char** argv ) {\n int linecount = 0 ;\n std::string line ;\n std::ifstream infile( argv[ 1 ] ) ; // input file stream\n if ( infile ) {\n while ( getline( infile , line ) ) {\n\t std::cout << linecount << \": \"\n << line << '\\n' ; //supposing '\\n' to be line end\n\t linecount++ ;\n }\n }\n infile.close( ) ;\n return 0 ;\n}\n","language":"C++"},{"code":"#include <fstream>\n#include <iostream>\n#include <sstream>\n#include <string>\n\nint main()\n{\n std::ifstream infile(\"thefile.txt\");\n std::string line;\n while (std::getline(infile, line) )\n {\n std::istringstream iss(line);\n int a, b;\n if (!(iss >> a >> b)) { break; } // if no error a and b get values from file\n\n std::cout << \"a:\\t\" << a <<\"\\n\";\n std::cout << \"b:\\t\" << b <<\"\\n\";\n }\n std::cout << \"finished\" << std::endl;\n}\n","language":"C++"},{"code":"#include <Core/Core.h>\n\nusing namespace Upp;\n\nCONSOLE_APP_MAIN\n{\n\tFileIn in(CommandLine()[0]);\n\twhile(in && !in.IsEof())\n\t\tCout().PutLine(in.GetLine());\n}\n","language":"C++"},{"code":"foreach (string readLine in File.ReadLines(\"FileName\"))\n DoSomething(readLine);\n","language":"C-sharp"},{"code":"using System;\nusing System.IO;\nusing System.Text;\n\nnamespace RosettaCode\n{\n internal class Program\n {\n private static void Main()\n {\n var sb = new StringBuilder();\n string F = \"File.txt\";\n\n // Read a file, line by line.\n try\n {\n foreach (string readLine in File.ReadLines(F))\n {\n // Use the data in some way...\n sb.Append(readLine);\n sb.Append(\"\\n\");\n }\n }\n catch (Exception exception)\n {\n Console.WriteLine(exception.Message);\n Environment.Exit(1);\n }\n\n // Preset the results\n Console.WriteLine(sb.ToString());\n }\n }\n}\n","language":"C-sharp"},{"code":"(with-open [r (clojure.java.io/reader \"some-file.txt\")]\n (doseq [l (line-seq r)]\n (println l)))\n","language":"Clojure"},{"code":"start_up = proc ()\n po: stream := stream$primary_output()\n\n % There is a special type for file names. This ensures that\n % the path is valid; if not, file_name$parse would throw an\n % exception (which we are just ignoring here).\n fname: file_name := file_name$parse(\"input.txt\")\n\n % File I/O is then done through a stream just like any I/O.\n % If the file were not accessible, stream$open would throw an\n % exception.\n fstream: stream := stream$open(fname, \"read\")\n\n count: int := 0 % count the lines\n while true do\n % Read a line. This will end the loop once the end is reached,\n % as the exception handler is outside the loop.\n line: string := stream$getl(fstream)\n\n % Show the line\n count := count + 1\n stream$putl(po, int$unparse(count) || \": \" || line)\n end except when end_of_file:\n % Close the file once we're done\n stream$close(fstream)\n end\nend start_up\n","language":"CLU"},{"code":" IDENTIFICATION DIVISION.\n PROGRAM-ID. read-file-line-by-line.\n\n ENVIRONMENT DIVISION.\n INPUT-OUTPUT SECTION.\n FILE-CONTROL.\n SELECT input-file ASSIGN TO \"input.txt\"\n ORGANIZATION LINE SEQUENTIAL\n FILE STATUS input-file-status.\n\n DATA DIVISION.\n FILE SECTION.\n FD input-file.\n 01 input-record PIC X(256).\n\n WORKING-STORAGE SECTION.\n 01 input-file-status PIC 99.\n 88 file-is-ok VALUE 0.\n 88 end-of-file VALUE 10.\n\n 01 line-count PIC 9(6).\n\n PROCEDURE DIVISION.\n OPEN INPUT input-file\n IF NOT file-is-ok\n DISPLAY \"The file could not be opened.\"\n GOBACK\n END-IF\n\n PERFORM VARYING line-count FROM 1 BY 1 UNTIL end-of-file\n READ input-file\n DISPLAY line-count \": \" FUNCTION TRIM(input-record)\n END-PERFORM\n\n CLOSE input-file\n\n GOBACK\n .\n","language":"COBOL"},{"code":"# This module shows two ways to read a file line-by-line in node.js.\nfs = require 'fs'\n\n# First, let's keep things simple, and do things synchronously. This\n# approach is well-suited for simple scripts.\ndo ->\n fn = \"read_file.coffee\"\n for line in fs.readFileSync(fn).toString().split '\\n'\n console.log line\n console.log \"DONE SYNC!\"\n\n# Now let's complicate things.\n#\n# Use the following code when files are large, and memory is\n# constrained and/or where you want a large amount of concurrency.\n#\n# Protocol:\n# Call LineByLineReader, which calls back to you with a reader.\n# The reader has two methods.\n# next_line: call to this when you want a new line\n# close: call this when you are done using the file before\n# it has been read completely\n#\n# When you call next_line, you must supply two callbacks:\n# line_cb: called back when there is a line of text\n# done_cb: called back when there is no more text in the file\nLineByLineReader = (fn, cb) ->\n fs.open fn, 'r', (err, fd) ->\n bufsize = 256\n pos = 0\n text = ''\n eof = false\n closed = false\n reader =\n next_line: (line_cb, done_cb) ->\n if eof\n if text\n last_line = text\n text = ''\n line_cb last_line\n else\n done_cb()\n return\n\n new_line_index = text.indexOf '\\n'\n if new_line_index >= 0\n line = text.substr 0, new_line_index\n text = text.substr new_line_index + 1, text.length - new_line_index - 1\n line_cb line\n else\n frag = new Buffer(bufsize)\n fs.read fd, frag, 0, bufsize, pos, (err, bytesRead) ->\n s = frag.toString('utf8', 0, bytesRead)\n text += s\n pos += bytesRead\n if (bytesRead)\n reader.next_line line_cb, done_cb\n else\n eof = true\n fs.closeSync(fd)\n closed = true\n reader.next_line line_cb, done_cb\n close: ->\n # The reader should call this if they abandon mid-file.\n fs.closeSync(fd) unless closed\n\n cb reader\n\n# Test our interface here.\ndo ->\n console.log '---'\n fn = 'read_file.coffee'\n LineByLineReader fn, (reader) ->\n callbacks =\n process_line: (line) ->\n console.log line\n reader.next_line callbacks.process_line, callbacks.all_done\n all_done: ->\n console.log \"DONE ASYNC!\"\n reader.next_line callbacks.process_line, callbacks.all_done\n","language":"CoffeeScript"},{"code":"(with-open-file (input \"file.txt\")\n (loop for line = (read-line input nil)\n while line do (format t \"~a~%\" line)))\n","language":"Common-Lisp"},{"code":"void main() {\n import std.stdio;\n\n foreach (line; \"read_a_file_line_by_line.d\".File.byLine)\n line.writeln;\n}\n","language":"D"},{"code":";\n; Read a file line by line for DBL version 4\n;\n RECORD\n\nLINE, A100\n\nPROC\n;-----------------------------------------------\n OPEN (1,I,\"FILE.TXT\") [ERR=NOFIL]\n DO FOREVER\n BEGIN\n READS (1,LINE,EOF) [ERR=EREAD]\n END\nEOF, CLOSE 3\n\n GOTO CLOS\n\n;------------------------------------------------\nNOFIL, ;Open error...do something\n GOTO CLOS\n\nEREAD, ;Read error...do something\n GOTO CLOS\n\nCLOS, STOP\n","language":"DBL"},{"code":"$ open input input.txt\n$ loop:\n$ read /end_of_file = done input line\n$ goto loop\n$ done:\n$ close input\n","language":"DCL"},{"code":" procedure ReadFileByLine;\n var\n TextFile: text;\n TextLine: String;\n begin\n Assign(TextFile, 'c:\\test.txt');\n Reset(TextFile);\n while not Eof(TextFile) do\n Readln(TextFile, TextLine);\n CloseFile(TextFile);\n end;\n","language":"Delphi"},{"code":"procedure ReadFileByLine;\n var\n TextLines : TStringList;\n i : Integer;\n begin\n TextLines := TStringList.Create;\n TextLines.LoadFromFile('c:\\text.txt');\n for i := 0 to TextLines.count -1 do\n ShowMessage(TextLines[i]);\n end;\n","language":"Delphi"},{"code":"\\util.g\nproc nonrec main() void:\n /* first we need to declare a file buffer and an input channel */\n file() infile;\n channel input text in_ch;\n\n /* a buffer to store the line in is also handy */\n [256] char line;\n word counter; /* to count the lines */\n\n /* open the file, and exit if it fails */\n if not open(in_ch, infile, \"input.txt\") then\n writeln(\"cannot open file\");\n exit(1)\n fi;\n\n counter := 0;\n\n /* readln() reads a line and will return false once the end is reached */\n /* we pass in a pointer so it stores a C-style zero-terminated string,\n * rather than try to fill the entire array */\n while readln(in_ch; &line[0]) do\n counter := counter + 1;\n writeln(counter:5, \": \", &line[0])\n od;\n\n /* finally, close the file */\n close(in_ch)\ncorp\n","language":"Draco"},{"code":"import system'io;\nimport extensions;\nimport extensions'routines;\n\npublic program()\n{\n File.assign(\"file.txt\").forEachLine(printingLn)\n}\n","language":"Elena"},{"code":" defmodule FileReader do\n # Create a File.Stream and inspect each line\n def by_line(path) do\n File.stream!(path)\n |> Stream.map(&(IO.inspect(&1)))\n\t|> Stream.run\n end\n\n def bin_line(path) do\n # Build the stream in binary instead for performance increase\n case File.open(path) do\n # File returns a tuple, {:ok,file}, if successful\n {:ok, file} ->\n\t IO.binstream(file, :line)\n\t |> Stream.map(&(IO.inspect(&1)))\n\t |> Stream.run\n\t# And returns {:error,reason} if unsuccessful\n\t{:error,reason} ->\n\t# Use Erlang's format_error to return an error string\n\t :file.format_error(reason)\n end\n end\n end\n","language":"Elixir"},{"code":"-module( read_a_file_line_by_line ).\n\n-export( [into_list/1] ).\n\ninto_list( File ) ->\n {ok, IO} = file:open( File, [read] ),\n into_list( io:get_line(IO, ''), IO, [] ).\n\n\ninto_list( eof, _IO, Acc ) -> lists:reverse( Acc );\ninto_list( {error, _Error}, _IO, Acc ) -> lists:reverse( Acc );\ninto_list( Line, IO, Acc ) -> into_list( io:get_line(IO, ''), IO, [Line | Acc] ).\n","language":"Erlang"},{"code":"PROGRAM LETTURA\n\nEXCEPTION\n FERROR%=TRUE ! si e' verificata l'eccezione !\n PRINT(\"Il file richiesto non esiste .....\")\nEND EXCEPTION\n\nBEGIN\n FERROR%=FALSE\n PRINT(\"Nome del file\";)\n INPUT(FILE$) ! chiede il nome del file\n OPEN(\"I\",1,FILE$) ! apre un file sequenziale in lettura\n IF NOT FERROR% THEN\n REPEAT\n INPUT(LINE,#1,CH$) ! legge una riga ....\n PRINT(CH$) ! ... la stampa ...\n UNTIL EOF(1) ! ... fine a fine file\n END IF\n PRINT\n CLOSE(1) ! chiude il file\nEND PROGRAM\n","language":"ERRE"},{"code":"constant cmd = command_line()\nconstant filename = cmd[2]\nconstant fn = open(filename,\"r\")\ninteger i\ni = 1\nobject x\nwhile 1 do\n x = gets(fn)\n if atom(x) then\n exit\n end if\n printf(1,\"%2d: %s\",{i,x})\n i += 1\nend while\nclose(fn)\n","language":"Euphoria"},{"code":"open System.IO\n\n[<EntryPoint>]\nlet main argv =\n File.ReadLines(argv.[0]) |> Seq.iter (printfn \"%s\")\n 0\n","language":"F-Sharp"},{"code":" \"path/to/file\" utf8 [ [ readln dup [ print ] when* ] loop ] with-file-reader\n","language":"Factor"},{"code":"class Main\n{\n Void main ()\n {\n File (`data.txt`).eachLine |Str line|\n {\n echo (\"Line: $line\")\n }\n }\n}\n","language":"Fantom"},{"code":"\\ The scratch area provided by PAD is always at least 84 characters in\n\\ length. However, READ-LINE may (but does not have to) read up to\n\\ two line-terminating characters into the buffer after the line, so\n\\ the buffer size should always be two larger than the limit given to\n\\ READ-LINE. Lines that are two long to fit into the buffer will be split,\n\\ so you can't tell they aren't separate lines.\n82 constant max-line\n\n: third ( A b c -- A b c A )\n >r over r> swap ;\n\n: read-lines ( fileid -- fileid )\n begin pad max-line ( fileid pad max-line )\n third ( fileid pad max-line fileid )\n read-line throw ( fileid chars-read )\n while pad swap ( fileid pad chars-read ) \\ string excludes the newline\n type cr\n repeat\n \\ Get rid of number of characters read by last call to read-line, which is\n \\ zero because no charaters were read.\n drop\n;\n\ns\" infile.txt\" r/o open-file throw read-lines close-file throw\n","language":"Forth"},{"code":": read-lines' ( filename-addr filename-len -- )\n r/o open-file throw ( buffer-len wfileid )\n over 2 + \\ Add space for up to two line terminators after the buffer.\n allocate throw ( buffer-len wfileid buffer-addr )\n -rot 2>r ( buffer-addr )\n begin\n dup 2r@ read-line throw ( buffer bytes-read flag )\n while\n ( buffer-addr bytes-read )\n over swap type cr\n repeat\n drop free throw\n 2r> close-file throw drop ;\n\n4096 s\" infile.txt\" read-lines'\n","language":"Forth"},{"code":" INTEGER ENUFF\t\t!A value has to be specified beforehand,.\n PARAMETER (ENUFF = 2468)\t!Provide some provenance.\n CHARACTER*(ENUFF) ALINE\t!A perfect size?\n CHARACTER*66 FNAME\t!What about file name sizes?\n INTEGER LINPR,IN\t\t!I/O unit numbers.\n INTEGER L,N\t\t!A length, and a record counter.\n LOGICAL EXIST\t\t!This can't be asked for in an \"OPEN\" statement.\n LINPR = 6\t\t\t!Standard output via this unit number.\n IN = 10\t\t\t!Some unit number for the input file.\n FNAME = \"Read.for\"\t!Choose a file name.\n INQUIRE (FILE = FNAME, EXIST = EXIST)\t!A basic question.\n IF (.NOT.EXIST) THEN\t\t!Absent?\n WRITE (LINPR,1) FNAME\t\t!Alas, name the absentee.\n 1 FORMAT (\"No sign of file \",A)\t!The name might be mistyped.\n STOP \"No file, no go.\"\t\t!Give up.\n END IF\t\t\t\t!So much for the most obvious mishap.\n OPEN (IN,FILE = FNAME, STATUS = \"OLD\", ACTION = \"READ\")\t!For formatted input.\n\n N = 0\t\t!No records read so far.\n 10 READ (IN,11,END = 20) L,ALINE(1:MIN(L,ENUFF))\t!Read only the L characters in the record, up to ENUFF.\n 11 FORMAT (Q,A)\t\t!Q = \"how many characters yet to be read\", A = characters with no limit.\n N = N + 1\t\t\t!A record has been read.\n IF (L.GT.ENUFF) WRITE (LINPR,12) N,L,ENUFF\t!Was it longer than ALINE could accommodate?\n 12 FORMAT (\"Record \",I0,\" has length \",I0,\": my limit is \",I0)\t!Yes. Explain.\n WRITE (LINPR,13) N,ALINE(1:MIN(L,ENUFF))\t!Print the record, prefixed by the count.\n 13 FORMAT (I9,\":\",A)\t\t!Fixed number size for alignment.\n GO TO 10\t\t\t!Do it again.\n\n 20 CLOSE (IN)\t!All done.\n END\t!That's all.\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nOpen \"input.txt\" For Input As #1\nDim line_ As String\nWhile Not Eof(1)\n Line Input #1, line_ '' read each line\n Print line_ '' echo it to the console\nWend\nClose #1\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"for line = lines[\"file:yourfile.txt\"]\n println[line]\n","language":"Frink"},{"code":"Public Sub Main()\nDim hFile As File\nDim sLine As String\n\nhFile = Open \"../InputText.txt\" For Input\n\nWhile Not Eof(hFile)\n Line Input #hFile, sLine\n Print sLine\nWend\n\nEnd\n","language":"Gambas"},{"code":"ReadByLines := function(name)\n\tlocal file, line, count;\n\tfile := InputTextFile(name);\n\tcount := 0;\n\twhile true do\n\t\tline := ReadLine(file);\n\t\tif line = fail then\n\t\t\tbreak;\n\t\tfi;\n\t\tcount := count + 1;\n\tod;\n\tCloseStream(file);\n\treturn count;\nend;\n\n# With [http://www.ibiblio.org/pub/docs/misc/amnesty.txt amnesty.txt]\nReadByLines(\"amnesty.txt\");\n# 384\n","language":"GAP"},{"code":"[indent=4]\n/*\n Read file line by line, in Genie\n\n valac readFileLines.gs\n ./readFileLines [filename]\n*/\n\ninit\n\n fileName:string\n fileName = (args[1] is null) ? \"readFileLines.gs\" : args[1]\n var file = FileStream.open(fileName, \"r\")\n if file is null\n stdout.printf(\"Error: %s did not open\\n\", fileName)\n return\n\n lines:int = 0\n line:string? = file.read_line()\n while line is not null\n lines++\n stdout.printf(\"%04d %s\\n\", lines, line)\n line = file.read_line()\n","language":"Genie"},{"code":"package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"log\"\n\t\"os\"\n)\n\nfunc init() {\n\tlog.SetFlags(log.Lshortfile)\n}\n\nfunc main() {\n\t// Open an input file, exit on error.\n\tinputFile, err := os.Open(\"byline.go\")\n\tif err != nil {\n\t\tlog.Fatal(\"Error opening input file:\", err)\n\t}\n\n\t// Closes the file when we leave the scope of the current function,\n\t// this makes sure we never forget to close the file if the\n\t// function can exit in multiple places.\n\tdefer inputFile.Close()\n\n\tscanner := bufio.NewScanner(inputFile)\n\n\t// scanner.Scan() advances to the next token returning false if an error was encountered\n\tfor scanner.Scan() {\n\t\tfmt.Println(scanner.Text())\n\t}\n\n\t// When finished scanning if any error other than io.EOF occured\n\t// it will be returned by scanner.Err().\n\tif err := scanner.Err(); err != nil {\n\t\tlog.Fatal(scanner.Err())\n\t}\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"bufio\"\n \"fmt\"\n \"io\"\n \"log\"\n \"os\"\n)\n\nfunc main() {\n f, err := os.Open(\"file\") // os.OpenFile has more options if you need them\n if err != nil { // error checking is good practice\n // error *handling* is good practice. log.Fatal sends the error\n // message to stderr and exits with a non-zero code.\n log.Fatal(err)\n }\n\n // os.File has no special buffering, it makes straight operating system\n // requests. bufio.Reader does buffering and has several useful methods.\n bf := bufio.NewReader(f)\n\n // there are a few possible loop termination\n // conditions, so just start with an infinite loop.\n for {\n // reader.ReadLine does a buffered read up to a line terminator,\n // handles either /n or /r/n, and returns just the line without\n // the /r or /r/n.\n line, isPrefix, err := bf.ReadLine()\n\n // loop termination condition 1: EOF.\n // this is the normal loop termination condition.\n if err == io.EOF {\n break\n }\n\n // loop termination condition 2: some other error.\n // Errors happen, so check for them and do something with them.\n if err != nil {\n log.Fatal(err)\n }\n\n // loop termination condition 3: line too long to fit in buffer\n // without multiple reads. Bufio's default buffer size is 4K.\n // Chances are if you haven't seen a line terminator after 4k\n // you're either reading the wrong file or the file is corrupt.\n if isPrefix {\n log.Fatal(\"Error: Unexpected long line reading\", f.Name())\n }\n\n // success. The variable line is now a byte slice based on on\n // bufio's underlying buffer. This is the minimal churn necessary\n // to let you look at it, but note! the data may be overwritten or\n // otherwise invalidated on the next read. Look at it and decide\n // if you want to keep it. If so, copy it or copy the portions\n // you want before iterating in this loop. Also note, it is a byte\n // slice. Often you will want to work on the data as a string,\n // and the string type conversion (shown here) allocates a copy of\n // the data. It would be safe to send, store, reference, or otherwise\n // hold on to this string, then continue iterating in this loop.\n fmt.Println(string(line))\n }\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"bufio\"\n \"fmt\"\n \"io\"\n \"log\"\n \"os\"\n)\n\nfunc main() {\n f, err := os.Open(\"file\")\n if err != nil {\n log.Fatal(err)\n }\n bf := bufio.NewReader(f)\n for {\n switch line, err := bf.ReadString('\\n'); err {\n case nil:\n // valid line, echo it. note that line contains trailing \\n.\n fmt.Print(line)\n case io.EOF:\n if line > \"\" {\n // last line of file missing \\n, but still valid\n fmt.Println(line)\n }\n return\n default:\n log.Fatal(err)\n }\n }\n}\n","language":"Go"},{"code":"new File(\"Test.txt\").eachLine { line, lineNumber ->\n println \"processing line $lineNumber: $line\"\n}\n","language":"Groovy"},{"code":"main = do\n file <- readFile \"linebyline.hs\"\n mapM_ putStrLn (lines file)\n","language":"Haskell"},{"code":"procedure main()\nf := open(\"input.txt\",\"r\") | stop(\"cannot open file \",fn)\nwhile line := read(f)\nclose(f)\nend\n","language":"Icon"},{"code":"100 INPUT PROMPT \"Filename: \":NAME$\n110 OPEN #1:NAME$ ACCESS INPUT\n120 COPY FROM #1 TO #0\n130 CLOSE #1\n","language":"IS-BASIC"},{"code":"cocurrent 'linereader'\n\n NB. configuration parameter\n blocksize=: 400000\n\n NB. implementation\n offset=: 0\n position=: 0\n buffer=: ''\n lines=: ''\n\n create=: monad define\n name=: boxxopen y\n size=: 1!:4 name\n blocks=: 2 <@(-~/\\)\\ ~. size <. blocksize * i. 1 + >. size % blocksize\n )\n\n readblocks=: monad define\n if. 0=#blocks do. return. end.\n if. 1<#lines do. return. end.\n whilst. -.LF e.chars do.\n buffer=: buffer,chars=. 1!:11 name,{.blocks\n blocks=: }.blocks\n lines=: <;._2 buffer,LF\n end.\n buffer=: _1{::lines\n )\n\n next=: monad define\n if. (#blocks)*.2>#lines do. readblocks'' end.\n r=. 0{::lines\n lines=: }.lines\n r\n )\n","language":"J"},{"code":" example=: '/tmp/example.txt' conew 'linereader'\n next__example''\nthis is line 1\n next__example''\nand this is line 2\n","language":"J"},{"code":"import java.io.BufferedReader;\nimport java.io.FileReader;\n\n/**\n * Reads a file line by line, processing each line.\n *\n * @author $Author$\n * @version $Revision$\n */\npublic class ReadFileByLines {\n private static void processLine(int lineNo, String line) {\n // ...\n }\n\n public static void main(String[] args) {\n for (String filename : args) {\n BufferedReader br = null;\n FileReader fr = null;\n try {\n fr = new FileReader(filename);\n br = new BufferedReader(fr);\n String line;\n int lineNo = 0;\n while ((line = br.readLine()) != null) {\n processLine(++lineNo, line);\n }\n }\n catch (Exception x) {\n x.printStackTrace();\n }\n finally {\n if (fr != null) {\n try {br.close();} catch (Exception ignoreMe) {}\n try {fr.close();} catch (Exception ignoreMe) {}\n }\n }\n }\n }\n}\n","language":"Java"},{"code":"for (String filename : args) {\n try (FileReader fr = new FileReader(filename);BufferedReader br = new BufferedReader(fr)){\n String line;\n int lineNo = 0;\n while ((line = br.readLine()) != null) {\n processLine(++lineNo, line);\n }\n }\n catch (Exception x) {\n x.printStackTrace();\n }\n}\n","language":"Java"},{"code":"import java.nio.file.Files;\nimport java.nio.file.Paths;\nimport java.nio.charset.Charset;\nimport java.io.IOException;\n//...other class code\nList<String> lines = null;\ntry{\n lines = Files.readAllLines(Paths.get(filename), Charset.defaultCharset());\n}catch(IOException | SecurityException e){\n //problem with the file\n}\n","language":"Java"},{"code":"var fs = require(\"fs\");\n\nvar readFile = function(path) {\n return fs.readFileSync(path).toString();\n};\n\nconsole.log(readFile('file.txt'));\n","language":"JavaScript"},{"code":"$ seq 0 5 | jq -R 'tonumber|sin'\n0\n0.8414709848078965\n0.9092974268256817\n0.1411200080598672\n-0.7568024953079282\n-0.9589242746631385\n","language":"Jq"},{"code":"$ seq 0 5 | jq -n '[inputs|sin] | max'\n0.9092974268256817\n","language":"Jq"},{"code":"/* Read by line, in Jsish */\nvar f = new Channel('read-by-line.jsi');\nvar line;\n\nwhile (line = f.gets()) puts(line);\nf.close();\n","language":"Jsish"},{"code":"open(\"input_file\",\"r\") do f\n for line in eachline(f)\n println(\"read line: \", line)\n end\nend\n","language":"Julia"},{"code":"// version 1.1.2\n\nimport java.io.File\n\nfun main(args: Array<String>) {\n File(\"input.txt\").forEachLine { println(it) }\n}\n","language":"Kotlin"},{"code":"local(f) = file('foo.txt')\nhandle => {#f->close}\n#f->forEachLine => {^\n #1\n '<br>' // note this simply inserts an HTML line break between each line.\n^}\n","language":"Lasso"},{"code":"filedialog \"Open\",\"*.txt\",file$\nif file$=\"\" then end\nopen file$ for input as #f\nwhile not(eof(#f))\n line input #f, t$\n print t$\nwend\nclose #f\n","language":"Liberty-BASIC"},{"code":"filedialog \"Open\",\"*.txt\",file$\nif file$=\"\" then end\nopen file$ for input as #f\nwhile not(eof(#f))\n t$ = inputto$(#f, chr$(13))\n print t$\nwend\nclose #f\n","language":"Liberty-BASIC"},{"code":"filedialog \"Open\",\"*.txt\",file$\nif file$=\"\" then end\nopen file$ for input as #f\nwhile not(eof(#f))\n t$ = inputto$(#f, chr$(10))\n print t$\nwend\nclose #f\n","language":"Liberty-BASIC"},{"code":"fp = xtra(\"fileIO\").new()\nfp.openFile(_movie.path & \"input.txt\", 1)\nfileSize = fp.getLength()\nrepeat while TRUE\n str = fp.readLine()\n if str.char[1] = numtochar(10) then delete char 1 of str\n if the last char of str = numtochar(13) then delete the last char of str\n put str\n if fp.getPosition()>=fileSize then exit repeat\nend repeat\nfp.closeFile()\n","language":"Lingo"},{"code":"command readFileLineByLine\n local tFile, tLines, startRead\n put \"/usr/share/dict/words\" into tFile\n open file tFile for text read\n put true into startRead\n repeat until it is empty and startRead is false\n put false into startRead\n read from file tFile for 1 line\n add 1 to tLines\n end repeat\n close file tFile\n put tLines\nend readFileLineByLine\n","language":"LiveCode"},{"code":"10 OPENIN\"foo.txt\"\n20 WHILE NOT EOF\n30 LINE INPUT#9,i$\n40 PRINT i$\n50 WEND\n","language":"Locomotive-Basic"},{"code":"while [not eof?] [print readline]\n","language":"Logo"},{"code":"filename = \"input.txt\"\nfp = io.open( filename, \"r\" )\n\nfor line in fp:lines() do\n print( line )\nend\n\nfp:close()\n","language":"Lua"},{"code":"for line in io.lines(\"input.txt\") do\n print(line)\nend\n","language":"Lua"},{"code":"Module checkit {\n \\\\ prepare a file\n document a$\n a$={First Line\n Second line\n Third Line\n }\n Save.Doc a$, \"checkthis.txt\", 0 ' 0 for UTF-16LE\n Flush\n Open \"checkthis.txt\" For Wide Input as #F\n While not Eof(#f) {\n Data Seek(#f)\n Line Input #F, b$\n Print b$\n }\n Close #f\n Dim Index()\n \\\\ copy stack to index(), flush stack\n Index()=Array([])\n \\\\ change base to base 1\n Dim Base 1, Index(len(index()))\n Open \"checkthis.txt\" For Wide Input as #F\n Seek#F, Index(2)\n Line Input #F, b$\n Print b$ ' print second line\n Close #f\n \\\\ prepare Ansi file\n Print \"Ansi File\"\n Save.Doc a$, \"checkthis.txt\", 1033 ' we use specific locale\n Flush \\\\ flush the stack to get indexes\n oldlocale=locale\n locale 1033\n \\\\ no Wide clause\n Open \"checkthis.txt\" For Input as #F\n While not Eof(#f) {\n Data Seek(#f)\n Line Input #F, b$\n Print b$\n }\n Close #f\n Dim Index()\n \\\\ copy stack to index(), flush stack\n Index()=Array([])\n \\\\ change base to base 1\n Dim Base 1, Index(len(index()))\n Open \"checkthis.txt\" For Input as #F\n Seek#F, Index(2)\n Line Input #F, b$\n Print b$ ' print second line\n Close #f\n locale oldlocale\n}\ncheckit\n","language":"M2000-Interpreter"},{"code":"path := \"file.txt\":\nwhile (true) do\n\tinput := readline(path):\n\tif input = 0 then break; end if:\n\t#The line is stored in input\nend do:\n","language":"Maple"},{"code":"strm=OpenRead[\"input.txt\"];\nIf[strm=!=$Failed,\n While[line=!=EndOfFile,\n line=Read[strm];\n (*Do something*)\n ]];\nClose[strm];\n","language":"Mathematica"},{"code":" fid = fopen('foobar.txt','r');\n if (fid < 0)\n\tprintf('Error:could not open file\\n')\n else\n\twhile ~feof(fid),\n\t\tline = fgetl(fid);\n %% process line %%\n\tend;\n fclose(fid)\n end;\n","language":"MATLAB"},{"code":"/* Read a file and return a list of all lines */\n\nreadfile(name) := block(\n [v: [ ], f: openr(name), line],\n while stringp(line: readline(f)) do v: endcons(line, v),\n close(f),\n v\n)$\n","language":"Maxima"},{"code":":- module read_a_file_line_by_line.\n:- interface.\n\n:- import_module io.\n\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\n\n:- import_module int, list, require, string.\n\nmain(!IO) :-\n io.open_input(\"test.txt\", OpenResult, !IO),\n (\n OpenResult = ok(File),\n read_file_line_by_line(File, 0, !IO)\n ;\n OpenResult = error(Error),\n error(io.error_message(Error))\n ).\n\n:- pred read_file_line_by_line(io.text_input_stream::in, int::in,\n io::di, io::uo) is det.\n\nread_file_line_by_line(File, !.LineCount, !IO) :-\n % We could also use io.read_line/3 which returns a list of characters\n % instead of a string.\n io.read_line_as_string(File, ReadLineResult, !IO),\n (\n ReadLineResult = ok(Line),\n !:LineCount = !.LineCount + 1,\n io.format(\"%d: %s\", [i(!.LineCount), s(Line)], !IO),\n read_file_line_by_line(File, !.LineCount, !IO)\n ;\n ReadLineResult = eof\n ;\n ReadLineResult = error(Error),\n error(io.error_message(Error))\n ).\n","language":"Mercury"},{"code":":- module read_a_file_line_by_line.\n:- interface.\n\n:- import_module io.\n\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\n\n:- import_module int, list, require, string, stream.\n\nmain(!IO) :-\n io.open_input(\"test.txt\", OpenResult, !IO),\n (\n OpenResult = ok(File),\n stream.input_stream_fold2_state(File, process_line, 0, Result, !IO),\n (\n Result = ok(_)\n ;\n Result = error(_, Error),\n error(io.error_message(Error))\n )\n ;\n OpenResult = error(Error),\n error(io.error_message(Error))\n ).\n\n:- pred process_line(line::in, int::in, int::out, io::di, io::uo) is det.\n\nprocess_line(line(Line), !LineCount, !IO) :-\n !:LineCount = !.LineCount + 1,\n io.format(\"%d: %s\", [i(!.LineCount), s(Line)], !IO).\n","language":"Mercury"},{"code":"/**\n Read a file line by line, in Neko\n <doc><pre>Tectonics:\n nekoc readfile.neko\n neko readfile [filename]</pre></doc>\n*/\n\n\nvar stdin = $loader.loadprim(\"std@file_stdin\", 0)()\nvar file_open = $loader.loadprim(\"std@file_open\", 2)\nvar file_read_char = $loader.loadprim(\"std@file_read_char\", 1)\n\n/* Read a line from file f into string s returning length without any newline */\nvar NEKO_MAX = 1 << 29\nvar strsize = 256\nvar NEWLINE = 10\nvar readline = function(f) {\n var s = $smake(strsize)\n var len = 0\n var ch\n var file_exception = false\n while true {\n try ch = file_read_char(f) catch problem { file_exception = problem; break; }\n if ch == NEWLINE break;\n if $sset(s, len, ch) == null break; else len += 1\n\n if len == strsize - 1 {\n strsize *= 2\n if strsize > NEKO_MAX $throw(\"Out of string space for readline\")\n var t = s\n s = $smake(strsize)\n $sblit(s, 0, t, 0, $ssize(t))\n }\n }\n if $istrue(file_exception) $rethrow(file_exception)\n return $ssub(s, 0, len)\n}\n\nvar infile\nvar cli = $loader.args[0]\nif cli == null infile = stdin\nelse {\n cli = $string(cli)\n try infile = file_open(cli, \"r\")\n catch problem $print(problem, \" Can't open \", cli, \"\\n\")\n}\nif infile == null $throw(\"Can't open \" + cli)\n\nvar str\nwhile true {\n try {\n str = readline(infile)\n $print(\":\", str, \":\\n\")\n } catch a break;\n}\n","language":"Neko"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary\n\nparse arg inFileName .\n\nif inFileName = '' | inFileName = '.' then inFileName = './data/dwarfs.json'\nlines = scanFile(inFileName)\nloop l_ = 1 to lines[0]\n say l_.right(4)':' lines[l_]\n end l_\n\nreturn\n\n-- Read a file and return contents as a Rexx indexed string\nmethod scanFile(inFileName) public static returns Rexx\n\n fileLines = ''\n do\n inFile = File(inFileName)\n inFileScanner = Scanner(inFile)\n loop l_ = 1 while inFileScanner.hasNext()\n fileLines[0] = l_\n fileLines[l_] = inFileScanner.nextLine()\n end l_\n inFileScanner.close()\n\n catch ex = FileNotFoundException\n ex.printStackTrace\n end\n\n return fileLines\n","language":"NetRexx"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary\n\nparse arg inFileName .\n\nif inFileName = '' | inFileName = '.' then inFileName = './data/dwarfs.json'\nlines = readFile(inFileName)\nloop l_ = 1 to lines[0]\n say l_.right(4)':' lines[l_]\n end l_\n\nreturn\n\n-- Read a file and return contents as a Rexx indexed string\nmethod readFile(inFileName) public static returns Rexx\n\n fileLines = ''\n inLine = String null\n inFileBR = BufferedReader null\n\n do\n inFile = File(inFileName)\n inFileBR = BufferedReader(FileReader(inFile))\n loop l_ = 1 until inline = null\n inLine = inFileBR.readLine()\n if inline \\= null then do\n fileLines[0] = l_\n fileLines[l_] = inLine\n end\n end l_\n\n catch exFNF = FileNotFoundException\n exFNF.printStackTrace\n catch exIO = IOException\n exIO.printStackTrace\n finally\n if inFileBR \\= null then do\n do\n inFileBR.close()\n catch ex = IOException\n ex.printStackTrace\n end\n end\n end\n\n return fileLines\n","language":"NetRexx"},{"code":"(set 'in-file (open \"filename\" \"read\"))\n(while (read-line in-file)\n (write-line))\n(close in-file)\n","language":"NewLISP"},{"code":"for line in lines \"input.txt\":\n echo line\n","language":"Nim"},{"code":"bundle Default {\n class ReadFile {\n function : Main(args : String[]) ~ Nil {\n f := IO.FileReader->New(\"in.txt\");\n if(f->IsOpen()) {\n string := f->ReadString();\n while(f->IsEOF() = false) {\n string->PrintLine();\n string := f->ReadString();\n };\n f->Close();\n };\n }\n }\n}\n","language":"Objeck"},{"code":"NSString *path = [NSString stringWithString:@\"/usr/share/dict/words\"];\nNSError *error = nil;\nNSString *words = [[NSString alloc] initWithContentsOfFile:path\n encoding:NSUTF8StringEncoding error:&error];\n","language":"Objective-C"},{"code":"NSArray* lines = [words componentsSeparatedByCharactersInSet:[NSCharacterSet newlineCharacterSet]];\n","language":"Objective-C"},{"code":"let () =\n let ic = open_in \"input.txt\" in\n try\n while true do\n let line = input_line ic in\n print_endline line\n done\n with End_of_file ->\n close_in ic\n","language":"OCaml"},{"code":"let input_line_opt ic =\n try Some (input_line ic)\n with End_of_file -> None\n\nlet read_lines ic =\n let rec aux acc =\n match input_line_opt ic with\n | Some line -> aux (line::acc)\n | None -> (List.rev acc)\n in\n aux []\n\nlet lines_of_file filename =\n let ic = open_in filename in\n let lines = read_lines ic in\n close_in ic;\n (lines)\n","language":"OCaml"},{"code":"let () =\n let lines = lines_of_file \"unixdict.txt\" in\n List.iter print_endline lines\n","language":"OCaml"},{"code":"package main\n\nimport \"core:os\"\nimport \"core:fmt\"\nimport \"core:bufio\"\nimport \"core:strings\"\n\nmain :: proc() {\n f, err := os.open(\"input.txt\")\n assert(err == 0, \"Could not open file\")\n defer os.close(f)\n\n r: bufio.Reader\n buffer: [1024]byte\n bufio.reader_init_with_buf(&r, {os.stream_from_handle(f)}, buffer[:])\n defer bufio.reader_destroy(&r)\n\n for {\n line, err := bufio.reader_read_string(&r, '\\n', context.allocator)\n if err != nil do break\n defer delete(line, context.allocator)\n\n line = strings.trim_right(line, \"\\r\")\n fmt.print(line)\n }\n}\n","language":"Odin"},{"code":": readFile(fileName)\n | line | File new(fileName) forEach: line [ line println ] ;\n","language":"Oforth"},{"code":"function getline(string s, int *i) as string\n int sl=i, el=i\n byte b at strptr(s)\n do\n select b[el]\n case 0\n i=el+1 : exit do\n case 10 'lf\n i=el+1 : exit do\n case 13 'cr\n i=el+1\n if b[i]=10 then i++ 'crlf\n exit do\n end select\n el++\n loop\n return mid(s,sl,el-sl)\nend function\n\n'read all file lines\n'===================\n\nstring s=getfile \"t.txt\"\nint le=len(s)\nint i=1\nint c=0\nstring wr\nif le=0 then goto done\ndo\n wr = getline(s,i)\n 'print wr\n c++\n if i>le then exit do\nend do\ndone:\nprint \"Line count \" c\n","language":"OxygenBasic"},{"code":"FILE *f = fopen(name, \"r\");\nif (!f) {\n\tpari_err(openfiler, \"input\", name);\n}\nwhile(fgets(line, MAX_LINELEN, f) != NULL) {\n\t// ...\n}\n","language":"PARI-GP"},{"code":"(* Read a text-file line by line *)\n program ReadFileByLine;\n var\n InputFile,OutputFile: text;\n TextLine: String;\n begin\n Assign(InputFile, 'testin.txt');\n Reset(InputFile);\n Assign(OutputFile, 'testout.txt');\n Rewrite(OutputFile);\n while not Eof(InputFile) do\n begin\n ReadLn(InputFile, TextLine);\n (* do someting with TextLine *)\n WriteLn(OutputFile, TextLine)\n end;\n Close(InputFile);\n Close(OutputFile)\n end.\n","language":"Pascal"},{"code":"open(my $fh, '<', 'foobar.txt')\n || die \"Could not open file: $!\";\nwhile (<$fh>)\n{ # each line is stored in $_, with terminating newline\n # chomp, short for chomp($_), removes the terminating newline\n chomp;\n process($_);\n}\nclose $fh;\n","language":"Perl"},{"code":"open(my $fh, '< :encoding(UTF-8)', 'foobar.txt')\n || die \"Could not open file: $!\";\n","language":"Perl"},{"code":"open(my $fh, '<', 'foobar.txt')\n || die \"Could not open file: $!\";\nwhile (my $line = <$fh>)\n{\n chomp $line;\n process($line);\n}\nclose $fh;\n","language":"Perl"},{"code":"while (<>) {\n chomp;\n process($_);\n}\n","language":"Perl"},{"code":"perl myscript.pl 'rm -rf / |'\n","language":"Perl"},{"code":"open(my $fh, '<', 'foobar.txt') or die \"$!\";\nwhile (readline $fh)\n{ ... }\n\nwhile (my $line = readline $fh)\n{ ... }\nclose $fh;\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">fn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">open</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">command_line</span><span style=\"color: #0000FF;\">()[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #008000;\">\"r\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">lno</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">line</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">line</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">gets</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #004080;\">atom</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">line</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%2d: %s\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">lno</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">line</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">lno</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #7060A8;\">close</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">{}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">wait_key</span><span style=\"color: #0000FF;\">()</span>\n<!--\n","language":"Phix"},{"code":"include ..\\Utilitys.pmt\n\nargument 1 get \"r\" fopen >ps\n\ntrue\nwhile\n tps fgets number? if drop ps> fclose false else print true endif\nendwhile\n","language":"Phixmonti"},{"code":"<?php\n$file = fopen(__FILE__, 'r'); // read current file\nwhile ($line = fgets($file)) {\n $line = rtrim($line); // removes linebreaks and spaces at end\n echo strrev($line) . \"\\n\"; // reverse line and upload it\n}\n","language":"PHP"},{"code":"<?php // HOW TO ECHO FILE LINE BY LINE FROM THE COMMAND LINE: php5-cli\n$file = fopen('test.txt', 'r'); // OPEN FILE WITH READ ACCESS\nwhile (!feof($file)) {\n $line = rtrim(fgets($file)); // REMOVE TRAILING WHITESPACE AND GET LINE\n if($line != NULL) echo(\"$line\\n\"); // IF THE LINE ISN'T NULL, ECHO THE LINE\n}\n","language":"PHP"},{"code":"go =>\n FD = open(\"unixdict.txt\"),\n while (not at_end_of_stream(FD))\n Line = read_line(FD),\n println(Line)\n end,\n close(FD),\n nl.\n","language":"Picat"},{"code":"go2 =>\n foreach(Line in read_file_lines(\"unixdict.txt\"))\n println(Line)\n end.\n","language":"Picat"},{"code":"(in \"foobar.txt\"\n (while (line)\n (process @) ) )\n","language":"PicoLisp"},{"code":"read: procedure options (main);\n declare line character (500) varying;\n\n on endfile (sysin) stop;\n\n do forever;\n get edit (line)(L);\n end;\nend read;\n","language":"PL-I"},{"code":"$reader = [System.IO.File]::OpenText($mancorfile)\ntry {\n\tdo {\n\t\t$line = $reader.ReadLine()\n\t\tif ($line -eq $null) { break }\n\t\tDoSomethingWithLine($line)\n\t} while ($TRUE)\n} finally {\n\t$reader.Close()\n}\n","language":"PowerShell"},{"code":"FileName$ = OpenFileRequester(\"\",\"foo.txt\",\"*.txt\",0)\n\nIf ReadFile(0, FileName$) ; use ReadFile instead of OpenFile to include read-only files\n BOMformat = ReadStringFormat(0) ; reads the BOMformat (Unicode, UTF-8, ASCII, ...)\n While Not Eof(0)\n line$ = ReadString(0, BOMformat)\n DoSomethingWithTheLine(Line)\n Wend\n CloseFile(0)\nEndIf\n","language":"PureBasic"},{"code":"with open(\"foobar.txt\") as f:\n for line in f:\n process(line)\n","language":"Python"},{"code":"import fileinput\nfor line in fileinput.input():\n process(line)\n","language":"Python"},{"code":"f = FREEFILE\nfilename$ = \"file.txt\"\n\nOPEN filename$ FOR INPUT AS #f\n\nWHILE NOT EOF(f)\n LINE INPUT #f, linea$\n PRINT linea$\nWEND\nCLOSE #f\nEND\n","language":"QBasic"},{"code":"conn <- file(\"notes.txt\", \"r\")\nwhile(length(line <- readLines(conn, 1)) > 0) {\n cat(line, \"\\n\")\n}\n","language":"R"},{"code":"(define (read-next-line-iter file)\n\t (let ((line (read-line file 'any)))\n\t (unless (eof-object? line)\n\t (display line)\n\t (newline)\n\t (read-next-line-iter file))))\n(call-with-input-file \"foobar.txt\" read-next-line-iter)\n","language":"Racket"},{"code":"(define in (open-input-file file-name))\n(for ([line (in-lines in)])\n (displayln line))\n(close-input-port in)\n","language":"Racket"},{"code":"for open('test.txt').lines\n{\n .say\n}\n","language":"Raku"},{"code":"my $f = open 'test.txt';\nwhile my $line = $f.get {\n say $line;\n}\n","language":"Raku"},{"code":"$Include \"Rapidq.inc\"\ndim file as qfilestream\n\nif file.open(\"c:\\A Test.txt\", fmOpenRead) then\n while not File.eof\n print File.readline\n wend\nelse\n print \"Cannot read file\"\nend if\n\ninput \"Press enter to exit: \";a$\n","language":"RapidQ"},{"code":"/*REXX program reads and displays (with a count) a file, one line at a time. */\nparse arg fID . /*obtain optional argument from the CL.*/\nif fID=='' then exit 8 /*Was no fileID specified? Then quit. */\nsay center(' displaying file: ' fID\" \", 79, '═') /*show the name of the file being read.*/\ncall linein fID, 1, 0 /*see the comment in the section header*/\nsay /* [↓] show a file's contents (lines).*/\n do #=1 while lines(fID)\\==0 /*loop whilst there are lines in file. */\n y= linein(fID) /*read a line and assign contents to Y.*/\n say y /*show the content of the line (record)*/\n end /*#*/\nsay /*stick a fork in it, we're all done. */\nsay center(' file ' fID \" has \" #-1 ' records.', 79, '═') /*show rec count. */\ncall lineout fID /*close the input file (most REXXes). */\n","language":"REXX"},{"code":"/* Also works with Regina if you state OPTIONS AREXX_BIFS ; OPTIONS AREXX_SEMANTICS */\nfilename='file.txt'\ncontents=''\nIF Open(filehandle,filename,'READ')\nTHEN DO UNTIL EOF(filehandle)\n line=ReadLn(filehandle)\n SAY line\n contents=contents || line || '0a'x\n END\nELSE EXIT 20\nCALL Close filehandle\nEXIT 0\n","language":"REXX"},{"code":"fp = fopen(\"C:\\Ring\\ReadMe.txt\",\"r\")\nr = \"\"\nwhile isstring(r)\n r = fgetc(fp)\n if r = char(10) see nl\n else see r ok\nend\nfclose(fp)\n","language":"Ring"},{"code":"IO.foreach \"foobar.txt\" do |line|\n # Do something with line.\n puts line\nend\n","language":"Ruby"},{"code":"# File inherits from IO, so File.foreach also works.\nFile.foreach(\"foobar.txt\") {|line| puts line}\n","language":"Ruby"},{"code":"# IO.foreach and File.foreach can also read a subprocess.\nIO.foreach \"| grep afs3 /etc/services\" do |line|\n puts line\nend\n","language":"Ruby"},{"code":"filename = \"|strange-name.txt\"\nFile.open(filename) do |file|\n file.each {|line| puts line}\nend\n","language":"Ruby"},{"code":"open DefaultDir$ + \"\\public\\filetest.txt\" for input as #f\nwhile not(eof(#f))\n line input #f, a$\n print a$\nwend\nclose #f\n","language":"Run-BASIC"},{"code":"use std::io::{BufReader,BufRead};\nuse std::fs::File;\n\nfn main() {\n let file = File::open(\"file.txt\").unwrap();\n for line in BufReader::new(file).lines() {\n println!(\"{}\", line.unwrap());\n }\n}\n","language":"Rust"},{"code":"import scala.io._\nSource.fromFile(\"foobar.txt\").getLines.foreach(println)\n","language":"Scala"},{"code":"; Commented line below should be uncommented to use read-line with Guile\n;(use-modules (ice-9 rdelim))\n\n(define file (open-input-file \"input.txt\"))\n(do ((line (read-line file) (read-line file))) ((eof-object? line))\n (display line)\n (newline))\n","language":"Scheme"},{"code":"#!/bin/sed -f\np\n","language":"Sed"},{"code":"sed p filename\n","language":"Sed"},{"code":"$ include \"seed7_05.s7i\";\n\nconst proc: main is func\n local\n var file: aFile is STD_NULL;\n var string: line is \"\";\n begin\n aFile := open(\"input.txt\", \"r\");\n while hasNext(aFile) do\n readln(aFile, line);\n writeln(\"LINE: \" <& line);\n end while;\n end func;\n","language":"Seed7"},{"code":"repeat with each line of file \"input.txt\"\n\tput it\nend repeat\n","language":"SenseTalk"},{"code":"put \"input.txt\" into myFile\nopen file myFile\n\nrepeat forever\n\tread from file myFile until return\n\tif it is empty then exit repeat\n\tput it\nend repeat\n\nclose file myFile\n","language":"SenseTalk"},{"code":"File(__FILE__).open_r.each { |line|\n say line\n}\n","language":"Sidef"},{"code":"var fh = File(__FILE__).open_r\nwhile (fh.readline(\\var line)) {\n say line\n}\n","language":"Sidef"},{"code":"(StandardFileStream oldFileNamed: 'test.txt') contents lines do: [ :each | Transcript show: each. ]\n","language":"Smalltalk"},{"code":"'foobar.txt' asFilename readingLinesDo:[:eachLine | eachLine printCR]\n","language":"Smalltalk"},{"code":"|s|\ns := 'foobar.txt' asFilename readStream.\n[ s atEnd ] whileFalse:[\n s nextLine printCR.\n].\ns close\n","language":"Smalltalk"},{"code":"'foobar.txt' asFilename contents do:[:eachLine | eachLine printCR].\n","language":"Smalltalk"},{"code":" input(.infile,20,\"readfrom.txt\") :f(end)\nrdloop output = infile :s(rdloop)\nend\n","language":"SNOBOL4"},{"code":"let f = fopen(\"foo.txt\", \"r\");\nif f != nil {\n var line;\n while (line = fgetline(f)) != nil {\n print(line);\n }\n\n fclose(f);\n}\n","language":"Sparkling"},{"code":"f = \"file.txt\"\n> !#.eof(f)\n #.output(#.readline(f))\n<\n","language":"SPL"},{"code":"fun readLines string =\n let\n val strm = TextIO.openIn path\n fun chomp str =\n let\n val xstr = String.explode str\n val slen = List.length xstr\n in\n String.implode(List.take(xstr, (slen-1)))\n end\n fun collectLines ls s =\n case TextIO.inputLine s of\n SOME(l) => collectLines (chomp l::ls) s\n | NONE => ls\n in\n List.rev (collectLines [] strm) before TextIO.closeIn strm\n end\n","language":"Standard-ML"},{"code":"set f [open \"foobar.txt\"]\nwhile {[gets $f line] >= 0} {\n # This loops over every line\n puts \">>$line<<\"\n}\nclose $f\n","language":"Tcl"},{"code":"//Create a file object\n\n%f = new fileObject();\n\n//Open and read a file\n\n%f.openForRead(\"PATH/PATH.txt\");\n\nwhile(!%f.isEOF())\n{\n\t//Read each line from our file\n\n\t%line = %f.readLine();\n}\n\n//Close the file object\n\n%f.close();\n\n//Delete the file object\n\n%f.delete();\n","language":"TorqueScript"},{"code":"var f : int\nopen : f, \"rosetta.txt\", get\nloop\n exit when eof (f)\n var line: string\n get : f, line:*\n put line\nend loop\nclose : f\n","language":"Turing"},{"code":"loop\n exit when eof (1)\n var line: string\n get : 1, line:*\n put line\nend loop\n","language":"Turing"},{"code":"loop\n exit when eof\n var line : string\n get line:*\n put line\nend loop\n","language":"Turing"},{"code":"$$ MODE TUSCRIPT\n\ndatei=\"rosetta.txt\"\nERROR/STOP OPEN (datei,READ,-std-)\n\nACCESS q: READ/RECORDS/UTF8 $datei s,line\n LOOP\n READ/NEXT/EXIT q\n PRINT line\n ENDLOOP\nENDACCESS q\n","language":"TUSCRIPT"},{"code":"LOOP line=datei\n PRINT line\nENDLOOP\n","language":"TUSCRIPT"},{"code":"#include <Core/Core.h>\n\nusing namespace Upp;\n\nCONSOLE_APP_MAIN\n{\n\tFileIn in(CommandLine()[0]);\n\twhile(in && !in.IsEof())\n\t\tCout().PutLine(in.GetLine());\n}\n","language":"Ultimate++"},{"code":"# This while loop repeats for each line of the file.\n# This loop is inside a pipeline; many shells will\n# run this loop inside a subshell.\ncat input.txt |\nwhile IFS= read -r line ; do\n printf '%s\\n' \"$line\"\ndone\n","language":"UNIX-Shell"},{"code":"# This loop runs in the current shell, and can read both\n# the old standard input (fd 1) and input.txt (fd 3).\nexec 3<input.txt\nwhile IFS= read -r line <&3 ; do\n printf '%s\\n' \"$line\"\ndone\nexec 3>&-\n","language":"UNIX-Shell"},{"code":"# The old Bourne Shell interprets 'IFS= read' as 'IFS= ; read'.\n# It requires extra code to restore the original value of IFS.\nexec 3<input.txt\noldifs=$IFS\nwhile IFS= ; read -r line <&3 ; do\n IFS=$oldifs\n printf '%s\\n' \"$line\"\ndone\nIFS=$oldifs\nexec 3>&-\n","language":"UNIX-Shell"},{"code":"decl file f\nf.open \"filename.txt\"\nwhile (f.hasline)\n out (in string f) endl console\nend while\n","language":"Ursa"},{"code":"import os\n\nfn main() {\n\tfile := './file.txt'\n\tmut content_arr := []string{}\n\t\t\n\tif os.is_file(file) == true {\n\t\tcontent_arr << os.read_lines(file) or {\n\t\t\tprintln('Error: can not read')\n\t\t\texit(1)\n\t\t}\n\t}\n\telse {\n\t\tprintln('Error: can not find file')\n\t\texit(1)\n\t}\n\n\tfor content in content_arr {\n\t\tif content !='' {\n\t\t\tprintln(content)\n\t\t}\n\t}\n}\n","language":"V-(Vlang)"},{"code":"public static void main(){\n\tvar file = FileStream.open(\"foo.txt\", \"r\");\n\t\n\tstring line = file.read_line();\n\twhile (line != null){\n\t\tstdout.printf(\"%s\\n\", line);\n\t\tline = file.read_line();\n\t}\n}\n","language":"Vala"},{"code":"' Read a file line by line\nSub Main()\n Dim fInput As String, fOutput As String 'File names\n Dim sInput As String, sOutput As String 'Lines\n fInput = \"input.txt\"\n fOutput = \"output.txt\"\n Open fInput For Input As #1\n Open fOutput For Output As #2\n While Not EOF(1)\n Line Input #1, sInput\n sOutput = Process(sInput) 'do something\n Print #2, sOutput\n Wend\n Close #1\n Close #2\nEnd Sub 'Main\n","language":"VBA"},{"code":"FilePath = \"<SPECIFY FILE PATH HERE>\"\nSet objFSO = CreateObject(\"Scripting.FileSystemObject\")\nSet objFile = objFSO.OpenTextFile(FilePath,1)\nDo Until objFile.AtEndOfStream\n\tWScript.Echo objFile.ReadLine\nLoop\nobjFile.Close\nSet objFSO = Nothing\n","language":"VBScript"},{"code":"File_Open(\"line_by_line.vdm\")\n#10 = Buf_Num // edit buffer for input file\n#11 = Buf_Free // edit buffer for output\n#1 = 1 // line number\nwhile (!At_EOF) {\n Reg_Copy(20,1) // read one line into text register 20\n Buf_Switch(#11) // switch to output file\n Num_Ins(#1++, NOCR) // write line number\n Ins_Text(\" \")\n Reg_Ins(20) // write the line\n Buf_Switch(#10) // switch to input file\n Line(1) // next line\n}\nBuf_Close(NOMSG) // close the input file\nBuf_Switch(#11) // show the output\n","language":"Vedit-macro-language"},{"code":"' Read a file line by line\nSub Main()\n Dim fInput As String, fOutput As String 'File names\n Dim sInput As String, sOutput As String 'Lines\n Dim nRecord As Long\n fInput = \"input.txt\"\n fOutput = \"output.txt\"\n On Error GoTo InputError\n Open fInput For Input As #1\n On Error GoTo 0 'reset error handling\n Open fOutput For Output As #2\n nRecord = 0\n While Not EOF(1)\n Line Input #1, sInput\n sOutput = Process(sInput) 'do something\n nRecord = nRecord + 1\n Print #2, sOutput\n Wend\n Close #1\n Close #2\n Exit Sub\nInputError:\n MsgBox \"File: \" & fInput & \" not found\"\nEnd Sub 'Main\n","language":"Visual-Basic"},{"code":"' Read lines from a file\n'\n' (c) Copyright 1993 - 2011 Mark Hobley\n'\n' This code was ported from an application program written in Microsoft Quickbasic\n'\n' This code can be redistributed or modified under the terms of version 1.2 of\n' the GNU Free Documentation Licence as published by the Free Software Foundation.\n\nSub readlinesfromafile()\n var.filename = \"foobar.txt\"\n var.filebuffersize = ini.inimaxlinelength\n Call openfileread\n If flg.error = \"Y\" Then\n flg.abort = \"Y\"\n Exit Sub\n End If\n If flg.exists <> \"Y\" Then\n flg.abort = \"Y\"\n Exit Sub\n End If\nreadfilelabela:\n Call readlinefromfile\n If flg.error = \"Y\" Then\n flg.abort = \"Y\"\n Call closestream\n flg.error = \"Y\"\n Exit Sub\n End If\n If flg.endoffile <> \"Y\" Then\n ' We have a line from the file\n Print message$\n GoTo readfilelabela\n End If\n ' End of file reached\n ' Close the file and exit\n Call closestream\n Exit Sub\nEnd Sub\n\nSub openfileread()\n flg.streamopen = \"N\"\n Call checkfileexists\n If flg.error = \"Y\" Then Exit Sub\n If flg.exists <> \"Y\" Then Exit Sub\n Call getfreestream\n If flg.error = \"Y\" Then Exit Sub\n var.errorsection = \"Opening File\"\n var.errordevice = var.filename\n If ini.errortrap = \"Y\" Then\n On Local Error GoTo openfilereaderror\n End If\n flg.endoffile = \"N\"\n Open var.filename For Input As #var.stream Len = var.filebuffersize\n flg.streamopen = \"Y\"\n Exit Sub\nopenfilereaderror:\n var.errorcode = Err\n Call errorhandler\n resume '!!\nEnd Sub\n\nPublic Sub checkfileexists()\n var.errorsection = \"Checking File Exists\"\n var.errordevice = var.filename\n If ini.errortrap = \"Y\" Then\n On Local Error GoTo checkfileexistserror\n End If\n flg.exists = \"N\"\n If Dir$(var.filename, 0) <> \"\" Then\n flg.exists = \"Y\"\n End If\n Exit Sub\ncheckfileexistserror:\n var.errorcode = Err\n Call errorhandler\nEnd Sub\n\nPublic Sub getfreestream()\n var.errorsection = \"Opening Free Data Stream\"\n var.errordevice = \"\"\n If ini.errortrap = \"Y\" Then\n On Local Error GoTo getfreestreamerror\n End If\n var.stream = FreeFile\n Exit Sub\ngetfreestreamerror:\n var.errorcode = Err\n Call errorhandler\n resume '!!\nEnd Sub\n\nSub closestream()\n If ini.errortrap = \"Y\" Then\n On Local Error GoTo closestreamerror\n End If\n var.errorsection = \"Closing Stream\"\n var.errordevice = \"\"\n flg.resumenext = \"Y\"\n Close #var.stream\n If flg.error = \"Y\" Then\n flg.error = \"N\"\n '!! Call unexpectederror\n End If\n flg.streamopen = \"N\"\n Exit Sub\nclosestreamerror:\n var.errorcode = Err\n Call errorhandler\n resume next\nEnd Sub\n\nPublic Sub errorhandler()\n tmp$ = btrim$(var.errorsection)\n tmp2$ = btrim$(var.errordevice)\n If tmp2$ <> \"\" Then\n tmp$ = tmp$ + \" (\" + tmp2$ + \")\"\n End If\n tmp$ = tmp$ + \" : \" + Str$(var.errorcode)\n tmp1% = MsgBox(tmp$, 0, \"Error!\")\n flg.error = \"Y\"\n If flg.resumenext = \"Y\" Then\n flg.resumenext = \"N\"\n' Resume Next\n Else\n flg.error = \"N\"\n' Resume\n End If\nEnd Sub\n\nPublic Function btrim$(arg$)\n btrim$ = LTrim$(RTrim$(arg$))\nEnd Function\n","language":"Visual-Basic"},{"code":"Imports System.IO\n\n ' Loop through the lines of a file.\n ' Function assumes that the file exists.\n Private Sub ReadLines(ByVal FileName As String)\n\n Dim oReader As New StreamReader(FileName)\n Dim sLine As String = Nothing\n\n While Not oReader.EndOfStream\n sLine = oReader.ReadLine()\n ' Do something with the line.\n End While\n\n oReader.Close()\n\n End Sub\n","language":"Visual-Basic-.NET"},{"code":"with infile \"x\"\n drain (read_line)\n","language":"Wart"},{"code":"import \"io\" for File\n\nvar lines = [] // store lines read\nFile.open(\"input.txt\") { |file|\n var offset = 0\n var line = \"\"\n while(true) {\n var b = file.readBytes(1, offset)\n offset = offset + 1\n if (b == \"\\n\") {\n lines.add(line)\n line = \"\" // reset line variable\n } else if (b == \"\\r\") { // Windows\n // wait for following \"\\n\"\n } else if (b == \"\") { // end of stream\n return\n } else {\n line = line + b\n }\n }\n}\n\nSystem.print(lines.join(\"\\n\")) // print out lines\n","language":"Wren"},{"code":"int C;\n[repeat repeat C:= ChIn(1); \\repeat until end-of-line\n ChOut(0, C);\n until C < $20; \\CR, LF, or EOF\nuntil C = \\EOF\\ $1A; \\repeat until end-of-file\n]\n","language":"XPL0"},{"code":"foreach line in (File(\"foo.zkl\")){print(line)}\n","language":"Zkl"},{"code":"File(\"foo.zkl\").pump(Console.print)\n","language":"Zkl"},{"code":"Utils.zipWith(False,fcn(a,b){\"%d: %s\".fmt(a,b).print()},\n [0..],File(\"foo.zkl\",\"r\"))\n-->\n0: var R; n:=GarbageMan.gcCount;\n1: ref := GarbageMan.WeakRef(String(\"the\",\"quick brown fox\"));\n...\n","language":"Zkl"},{"code":"10 REM open my file for input\n20 OPEN #4;\"m\";1;\"MYFILE\": REM stream 4 is the first available for general purpose\n30 INPUT #4; LINE a$: REM a$ will hold our line from the file\n40 REM because we do not know how many lines are in the file, we need an error trap\n50 REM to gracefully exit when the file is read. (omitted from this example)\n60 REM to prevent an error at end of file, place a handler here\n100 GOTO 30\n","language":"ZX-Spectrum-Basic"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Simple\\nfrom: http://rosettacode.org/wiki/Read_a_file_line_by_line\\nnote: File handling\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Read a file one line at a time, \\nas opposed to [[Read entire file|reading the entire file at once]].\\n\\n\\n;Related tasks:\\n* [[Read a file character by character]]\\n* [[Input loop]].\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"* Read a file line by line 12/06/2016\\nREADFILE CSECT\\n SAVE (14,12) save registers on entry\\n PRINT NOGEN\\n BALR R12,0 establish addressability\\n USING *,R12 set base register\\n ST R13,SAVEA+4 link mySA->prevSA\\n LA R11,SAVEA mySA\\n ST R11,8(R13) link prevSA->mySA\\n LR R13,R11 set mySA pointer\\n OPEN (INDCB,INPUT) open the input file\\n OPEN (OUTDCB,OUTPUT) open the output file\\nLOOP GET INDCB,PG read record\\n CLI EOFFLAG,C'Y' eof reached?\\n BE EOF\\n PUT OUTDCB,PG write record\\n B LOOP\\nEOF CLOSE (INDCB) close input\\n CLOSE (OUTDCB) close output\\n L R13,SAVEA+4 previous save area addrs\\n RETURN (14,12),RC=0 return to caller with rc=0\\nINEOF CNOP 0,4 end-of-data routine\\n MVI EOFFLAG,C'Y' set the end-of-file flag\\n BR R14 return to caller\\nSAVEA DS 18F save area for chaining\\nINDCB DCB DSORG=PS,MACRF=PM,DDNAME=INDD,LRECL=80, *\\n RECFM=FB,EODAD=INEOF\\nOUTDCB DCB DSORG=PS,MACRF=PM,DDNAME=OUTDD,LRECL=80, *\\n RECFM=FB\\nEOFFLAG DC C'N' end-of-file flag\\nPG DS CL80 buffer\\n YREGS\\n END READFILE\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"\\\"path/to/file\\\" f:open ( . cr ) f:eachline f:close\\n\",\n \"language\": \"8th\"\n },\n {\n \"code\": \"/* ARM assembly AARCH64 Raspberry PI 3B */\\n/* program readfile64.s */\\n\\n/*******************************************/\\n/* Constantes file */\\n/*******************************************/\\n/* for this file see task include a file in language AArch64 assembly*/\\n.include \\\"../includeConstantesARM64.inc\\\"\\n\\n.equ BUFFERSIZE, 1000\\n.equ LINESIZE, 100\\n\\n\\n/*******************************************/\\n/* Structures */\\n/********************************************/\\n/* structure read file*/\\n .struct 0\\nreadfile_Fd: // File descriptor\\n .struct readfile_Fd + 8\\nreadfile_buffer: // read buffer\\n .struct readfile_buffer + 8\\nreadfile_buffersize: // buffer size\\n .struct readfile_buffersize + 8\\nreadfile_line: // line buffer\\n .struct readfile_line + 8\\nreadfile_linesize: // line buffer size\\n .struct readfile_linesize + 8\\nreadfile_pointer:\\n .struct readfile_pointer + 8 // read pointer (init to buffer size + 1)\\nreadfile_end:\\n/*******************************************/\\n/* Initialized data */\\n/*******************************************/\\n.data\\nszFileName: .asciz \\\"fictest.txt\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\n/* datas error display */\\nszMessError: .asciz \\\"Error detected : @ \\\\n\\\"\\n\\n/*******************************************/\\n/* UnInitialized data */\\n/*******************************************/\\n.bss\\nsBuffer: .skip BUFFERSIZE // buffer result\\nszLineBuffer: .skip LINESIZE\\n.align 4\\nstReadFile: .skip readfile_end\\nsZoneConv: .skip 24\\n/*******************************************/\\n/* code section */\\n/*******************************************/\\n.text\\n.global main\\nmain:\\n mov x0,AT_FDCWD\\n ldr x1,qAdrszFileName // File name\\n mov x2,O_RDWR // flags\\n mov x3,0 // mode\\n mov x8,OPEN // open file\\n svc 0\\n cmp x0,0 // error ?\\n ble error\\n ldr x21,qAdrstReadFile // init struture readfile\\n str x0,[x21,readfile_Fd] // save FD in structure\\n ldr x0,qAdrsBuffer // buffer address\\n str x0,[x21,readfile_buffer]\\n mov x0,BUFFERSIZE // buffer size\\n str x0,[x21,readfile_buffersize]\\n ldr x0,qAdrszLineBuffer // line buffer address\\n str x0,[x21,readfile_line]\\n mov x0,LINESIZE // line buffer size\\n str x0,[x21,readfile_linesize]\\n mov x0,BUFFERSIZE + 1 // init read pointer\\n str x0,[x21,readfile_pointer]\\n1: // begin read loop\\n mov x0,x21\\n bl readLineFile\\n cmp x0,0\\n beq end // end loop\\n blt error\\n\\n ldr x0,qAdrszLineBuffer // display line\\n bl affichageMess\\n ldr x0,qAdrszCarriageReturn // display line return\\n bl affichageMess\\n b 1b // and loop\\n\\nend:\\n ldr x1,qAdrstReadFile\\n ldr x0,[x1,readfile_Fd] // load FD to structure\\n mov x8,CLOSE // call system close file\\n svc 0\\n cmp x0,0\\n blt error\\n mov x0,0 // return code\\n b 100f\\nerror:\\n ldr x1,qAdrsZoneConv\\n bl conversion10S\\n ldr x0,qAdrszMessError // error message\\n ldr x1,qAdrsZoneConv\\n bl strInsertAtCharInc // insert result at @ character\\n bl affichageMess\\n mov x0,1 // return error code\\n100: // standard end of the program\\n mov x8,EXIT // request to exit program\\n svc 0 // perform system call\\nqAdrsBuffer: .quad sBuffer\\nqAdrszFileName: .quad szFileName\\nqAdrszMessError: .quad szMessError\\nqAdrsZoneConv: .quad sZoneConv\\nqAdrszCarriageReturn: .quad szCarriageReturn\\nqAdrstReadFile: .quad stReadFile\\nqAdrszLineBuffer: .quad szLineBuffer\\n/******************************************************************/\\n/* sub strings index start number of characters */\\n/******************************************************************/\\n/* x0 contains the address of the structure */\\n/* x0 returns number of characters or -1 if error */\\nreadLineFile:\\n stp x1,lr,[sp,-16]! // save registers\\n mov x14,x0 // save structure\\n ldr x11,[x14,#readfile_buffer]\\n ldr x12,[x14,#readfile_buffersize]\\n ldr x15,[x14,#readfile_pointer]\\n ldr x16,[x14,#readfile_linesize]\\n ldr x18,[x14,#readfile_buffersize]\\n ldr x10,[x14,#readfile_line]\\n mov x13,0\\n strb wzr,[x10,x13] // store zéro in line buffer\\n cmp x15,x12 // pointer buffer < buffer size ?\\n ble 2f // no file read\\n1: // loop read file\\n ldr x0,[x14,#readfile_Fd]\\n mov x1,x11 // buffer address\\n mov x2,x12 // buffer size\\n mov x8,READ // call system read file\\n svc 0\\n cmp x0,#0 // error read or end ?\\n ble 100f\\n mov x18,x0 // number of read characters\\n mov x15,#0 // init buffer pointer\\n\\n2: // begin loop copy characters\\n ldrb w0,[x11,x15] // load 1 character read buffer\\n cmp x0,0x0A // end line ?\\n beq 4f\\n strb w0,[x10,x13] // store character in line buffer\\n add x13,x13,1 // increment pointer line\\n cmp x13,x16\\n bgt 99f // error\\n add x15,x15,1 // increment buffer pointer\\n cmp x15,x12 // end buffer ?\\n bge 1b // yes new read\\n cmp x15,x18 // read characters ?\\n blt 2b // no loop\\n // final\\n cmp x13,0 // no characters in line buffer ?\\n beq 100f\\n4:\\n strb wzr,[x10,x13] // store zéro final\\n add x15,x15,#1\\n str x15,[x14,#readfile_pointer] // store pointer in structure\\n str x18,[x14,#readfile_buffersize] // store number of last characters\\n mov x0,x13 // return length of line\\n b 100f\\n99:\\n mov x0,#-2 // line buffer too small -> error\\n100:\\n\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\n/********************************************************/\\n/* File Include fonctions */\\n/********************************************************/\\n/* for this file see task include a file in language AArch64 assembly */\\n.include \\\"../includeARM64.inc\\\"\\n\",\n \"language\": \"AArch64-Assembly\"\n },\n {\n \"code\": \"char array TXT\\n\\nProc Main()\\n\\n Open (1,\\\"D:FILENAME.TXT\\\",4,0)\\n Do\\n InputSD(1,TXT)\\n PrintE(TXT)\\n Until EOF(1)\\n Od\\n Close(1)\\n\\nReturn\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\n\\nprocedure Line_By_Line is\\n File : File_Type;\\nbegin\\n Open (File => File,\\n Mode => In_File,\\n Name => \\\"line_by_line.adb\\\");\\n While not End_Of_File (File) Loop\\n Put_Line (Get_Line (File));\\n end loop;\\n\\n Close (File);\\nend Line_By_Line;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"file f;\\ntext s;\\n\\nf.affix(\\\"src/aime.c\\\");\\n\\nwhile (f.line(s) != -1) {\\n o_text(s);\\n o_byte('\\\\n');\\n}\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"#!/usr/local/bin/a68g --script #\\n\\nFILE foobar;\\nINT errno = open(foobar, \\\"Read_a_file_line_by_line.a68\\\", stand in channel);\\n\\nSTRING line;\\nFORMAT line fmt = $gl$;\\n\\nPROC mount next tape = (REF FILE file)BOOL: (\\n print(\\\"Please mount next tape or q to quit\\\");\\n IF read char = \\\"q\\\" THEN done ELSE TRUE FI\\n);\\n\\non physical file end(foobar, mount next tape);\\non logical file end(foobar, (REF FILE skip)BOOL: done);\\n\\nFOR count DO\\n getf(foobar, (line fmt, line));\\n printf(($g(0)\\\": \\\"$, count, line fmt, line))\\nOD;\\ndone: SKIP\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <hopper.h>\\n\\nmain:\\n .ctrlc\\n fd=0\\n fopen(OPEN_READ,\\\"archivo.txt\\\")(fd)\\n if file error?\\n {\\\"Error open file: \\\"},file error\\n else\\n line read=0\\n while( not(feof(fd)))\\n fread line(1000)(fd), ++line read\\n println\\n wend\\n {\\\"Total read lines : \\\",line read}\\n fclose(fd)\\n endif\\n println\\nexit(0)\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"⍝⍝ GNU APL Version\\n∇listFile fname ;fileHandle;maxLineLen;line\\n maxLineLen ← 128\\n fileHandle ← ⎕FIO['fopen'] fname\\nreadLoop:\\n →(0=⍴(line ← maxLineLen ⎕FIO['fgets'] fileHandle))/eof\\n ⍞ ← ⎕AV[1+line] ⍝⍝ bytes to ASCII\\n → readLoop\\neof:\\n ⊣⎕FIO['fclose'] fileHandle\\n ⊣⎕FIO['errno'] fileHandle\\n∇\\n\\n listFile 'corpus/sample1.txt'\\nThis is some sample text.\\nThe text itself has multiple lines, and\\nthe text has some words that occur multiple times\\nin the text.\\n\\nThis is the end of the text.\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"/* ARM assembly Raspberry PI */\\n/* program readfile.s */\\n\\n/* Constantes */\\n.equ STDOUT, 1 @ Linux output console\\n.equ EXIT, 1 @ Linux syscall\\n.equ READ, 3\\n.equ WRITE, 4\\n.equ OPEN, 5\\n.equ CLOSE, 6\\n\\n.equ O_RDWR, 0x0002 @ open for reading and writing\\n\\n.equ BUFFERSIZE, 100\\n.equ LINESIZE, 100\\n\\n/*******************************************/\\n/* Structures */\\n/********************************************/\\n/* structure read file*/\\n .struct 0\\nreadfile_Fd: @ File descriptor\\n .struct readfile_Fd + 4\\nreadfile_buffer: @ read buffer\\n .struct readfile_buffer + 4\\nreadfile_buffersize: @ buffer size\\n .struct readfile_buffersize + 4\\nreadfile_line: @ line buffer\\n .struct readfile_line + 4\\nreadfile_linesize: @ line buffer size\\n .struct readfile_linesize + 4\\nreadfile_pointer:\\n .struct readfile_pointer + 4 @ read pointer (init to buffer size + 1)\\nreadfile_end:\\n/* Initialized data */\\n.data\\nszFileName: .asciz \\\"fictest.txt\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\n/* datas error display */\\nszMessErreur: .asciz \\\"Error detected.\\\\n\\\"\\nszMessErr: .ascii \\\"Error code hexa : \\\"\\nsHexa: .space 9,' '\\n .ascii \\\" decimal : \\\"\\nsDeci: .space 15,' '\\n .asciz \\\"\\\\n\\\"\\n\\n/* UnInitialized data */\\n.bss\\nsBuffer: .skip BUFFERSIZE @ buffer result\\nszLineBuffer: .skip LINESIZE\\n.align 4\\nstReadFile: .skip readfile_end\\n\\n/* code section */\\n.text\\n.global main\\nmain:\\n ldr r0,iAdrszFileName @ File name\\n mov r1,#O_RDWR @ flags\\n mov r2,#0 @ mode\\n mov r7,#OPEN @ open file\\n svc #0\\n cmp r0,#0 @ error ?\\n ble error\\n ldr r1,iAdrstReadFile @ init struture readfile\\n str r0,[r1,#readfile_Fd] @ save FD in structure\\n ldr r0,iAdrsBuffer @ buffer address\\n str r0,[r1,#readfile_buffer]\\n mov r0,#BUFFERSIZE @ buffer size\\n str r0,[r1,#readfile_buffersize]\\n ldr r0,iAdrszLineBuffer @ line buffer address\\n str r0,[r1,#readfile_line]\\n mov r0,#LINESIZE @ line buffer size\\n str r0,[r1,#readfile_linesize]\\n mov r0,#BUFFERSIZE + 1 @ init read pointer\\n str r0,[r1,#readfile_pointer]\\n1: @ begin read loop\\n mov r0,r1\\n bl readLineFile\\n cmp r0,#0\\n beq end @ end loop\\n blt error\\n\\n ldr r0,iAdrszLineBuffer @ display line\\n bl affichageMess\\n ldr r0,iAdrszCarriageReturn @ display line return\\n bl affichageMess\\n b 1b @ and loop\\n\\nend:\\n ldr r1,iAdrstReadFile\\n ldr r0,[r1,#readfile_Fd] @ load FD to structure\\n mov r7, #CLOSE @ call system close file\\n svc #0\\n cmp r0,#0\\n blt error\\n mov r0,#0 @ return code\\n b 100f\\nerror:\\n ldr r1,iAdrszMessErreur @ error message\\n bl displayError\\n mov r0,#1 @ return error code\\n100: @ standard end of the program\\n mov r7, #EXIT @ request to exit program\\n svc 0 @ perform system call\\niAdrsBuffer: .int sBuffer\\niAdrszFileName: .int szFileName\\niAdrszMessErreur: .int szMessErreur\\niAdrszCarriageReturn: .int szCarriageReturn\\niAdrstReadFile: .int stReadFile\\niAdrszLineBuffer: .int szLineBuffer\\n/******************************************************************/\\n/* sub strings index start number of characters */\\n/******************************************************************/\\n/* r0 contains the address of the structure */\\n/* r0 returns number of characters or -1 if error */\\nreadLineFile:\\n push {r1-r8,lr} @ save registers\\n mov r4,r0 @ save structure\\n ldr r1,[r4,#readfile_buffer]\\n ldr r2,[r4,#readfile_buffersize]\\n ldr r5,[r4,#readfile_pointer]\\n ldr r6,[r4,#readfile_linesize]\\n ldr r7,[r4,#readfile_buffersize]\\n ldr r8,[r4,#readfile_line]\\n mov r3,#0 @ line pointer\\n strb r3,[r8,r3] @ store zéro in line buffer\\n cmp r5,r2 @ pointer buffer < buffer size ?\\n ble 2f @ no file read\\n1: @ loop read file\\n ldr r0,[r4,#readfile_Fd]\\n mov r7,#READ @ call system read file\\n svc 0\\n cmp r0,#0 @ error read or end ?\\n ble 100f\\n mov r7,r0 @ number of read characters\\n mov r5,#0 @ init buffer pointer\\n\\n2: @ begin loop copy characters\\n ldrb r0,[r1,r5] @ load 1 character read buffer\\n cmp r0,#0x0A @ end line ?\\n beq 4f\\n strb r0,[r8,r3] @ store character in line buffer\\n add r3,#1 @ increment pointer line\\n cmp r3,r6\\n movgt r0,#-2 @ line buffer too small -> error\\n bgt 100f\\n add r5,#1 @ increment buffer pointer\\n cmp r5,r2 @ end buffer ?\\n bge 1b @ yes new read\\n cmp r5,r7 @ read characters ?\\n blt 2b @ no loop\\n @ final\\n cmp r3,#0 @ no characters in line buffer ?\\n beq 100f\\n4:\\n mov r0,#0\\n strb r0,[r8,r3] @ store zéro final\\n add r5,#1\\n str r5,[r4,#readfile_pointer] @ store pointer in structure\\n str r7,[r4,#readfile_buffersize] @ store number of last characters\\n mov r0,r3 @ return length of line\\n100:\\n pop {r1-r8,lr} @ restaur registers\\n bx lr @ return\\n\\n/******************************************************************/\\n/* display text with size calculation */\\n/******************************************************************/\\n/* r0 contains the address of the message */\\naffichageMess:\\n push {r0,r1,r2,r7,lr} @ save registers\\n mov r2,#0 @ counter length */\\n1: @ loop length calculation\\n ldrb r1,[r0,r2] @ read octet start position + index\\n cmp r1,#0 @ if 0 its over\\n addne r2,r2,#1 @ else add 1 in the length\\n bne 1b @ and loop\\n @ so here r2 contains the length of the message\\n mov r1,r0 @ address message in r1\\n mov r0,#STDOUT @ code to write to the standard output Linux\\n mov r7, #WRITE @ code call system \\\"write\\\"\\n svc #0 @ call system\\n pop {r0,r1,r2,r7,lr} @ restaur registers\\n bx lr @ return\\n/***************************************************/\\n/* display error message */\\n/***************************************************/\\n/* r0 contains error code r1 : message address */\\ndisplayError:\\n push {r0-r2,lr} @ save registers\\n mov r2,r0 @ save error code\\n mov r0,r1\\n bl affichageMess\\n mov r0,r2 @ error code\\n ldr r1,iAdrsHexa\\n bl conversion16 @ conversion hexa\\n mov r0,r2 @ error code\\n ldr r1,iAdrsDeci @ result address\\n bl conversion10S @ conversion decimale\\n ldr r0,iAdrszMessErr @ display error message\\n bl affichageMess\\n100:\\n pop {r0-r2,lr} @ restaur registers\\n bx lr @ return\\niAdrszMessErr: .int szMessErr\\niAdrsHexa: .int sHexa\\niAdrsDeci: .int sDeci\\n/******************************************************************/\\n/* Converting a register to hexadecimal */\\n/******************************************************************/\\n/* r0 contains value and r1 address area */\\nconversion16:\\n push {r1-r4,lr} @ save registers\\n mov r2,#28 @ start bit position\\n mov r4,#0xF0000000 @ mask\\n mov r3,r0 @ save entry value\\n1: @ start loop\\n and r0,r3,r4 @ value register and mask\\n lsr r0,r2 @ move right\\n cmp r0,#10 @ compare value\\n addlt r0,#48 @ <10 ->digit\\n addge r0,#55 @ >10 ->letter A-F\\n strb r0,[r1],#1 @ store digit on area and + 1 in area address\\n lsr r4,#4 @ shift mask 4 positions\\n subs r2,#4 @ counter bits - 4 <= zero ?\\n bge 1b @ no -> loop\\n\\n100:\\n pop {r1-r4,lr} @ restaur registers\\n bx lr\\n/***************************************************/\\n/* Converting a register to a signed decimal */\\n/***************************************************/\\n/* r0 contains value and r1 area address */\\nconversion10S:\\n push {r0-r4,lr} @ save registers\\n mov r2,r1 @ debut zone stockage\\n mov r3,#'+' @ par defaut le signe est +\\n cmp r0,#0 @ negative number ?\\n movlt r3,#'-' @ yes\\n mvnlt r0,r0 @ number inversion\\n addlt r0,#1\\n mov r4,#10 @ length area\\n1: @ start loop\\n bl divisionpar10U\\n add r1,#48 @ digit\\n strb r1,[r2,r4] @ store digit on area\\n sub r4,r4,#1 @ previous position\\n cmp r0,#0 @ stop if quotient = 0\\n bne 1b\\t\\n\\n strb r3,[r2,r4] @ store signe\\n subs r4,r4,#1 @ previous position\\n blt 100f @ if r4 < 0 -> end\\n\\n mov r1,#' ' @ space\\n2:\\n strb r1,[r2,r4] @store byte space\\n subs r4,r4,#1 @ previous position\\n bge 2b @ loop if r4 > 0\\n100:\\n pop {r0-r4,lr} @ restaur registers\\n bx lr\\n/***************************************************/\\n/* division par 10 unsigned */\\n/***************************************************/\\n/* r0 dividende */\\n/* r0 quotient */\\n/* r1 remainder */\\ndivisionpar10U:\\n push {r2,r3,r4, lr}\\n mov r4,r0 @ save value\\n //mov r3,#0xCCCD @ r3 <- magic_number lower raspberry 3\\n //movt r3,#0xCCCC @ r3 <- magic_number higter raspberry 3\\n ldr r3,iMagicNumber @ r3 <- magic_number raspberry 1 2\\n umull r1, r2, r3, r0 @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0)\\n mov r0, r2, LSR #3 @ r2 <- r2 >> shift 3\\n add r2,r0,r0, lsl #2 @ r2 <- r0 * 5\\n sub r1,r4,r2, lsl #1 @ r1 <- r4 - (r2 * 2) = r4 - (r0 * 10)\\n pop {r2,r3,r4,lr}\\n bx lr @ leave function\\niMagicNumber: \\t.int 0xCCCCCCCD\\n\",\n \"language\": \"ARM-Assembly\"\n },\n {\n \"code\": \"loop read.lines \\\"myfile.txt\\\" 'line ->\\n print line\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"for line in lines open('input.txt'):\\n print line\\n\",\n \"language\": \"Astro\"\n },\n {\n \"code\": \"; --> Prompt the user to select the file being read\\n\\nFileSelectFile, File, 1, %A_ScriptDir%, Select the (text) file to read, Documents (*.txt) ; Could of course be set to support other filetypes\\nIf Errorlevel ; If no file selected\\n\\tExitApp\\n\\n; --> Main loop: Input (File), Output (Text)\\n\\nLoop\\n{\\nFileReadLine, Line, %File%, %A_Index% ; Reads line N (where N is loop iteration)\\nif Errorlevel ; If line does not exist, break loop\\n\\tbreak\\nText .= A_Index \\\". \\\" Line . \\\"`n\\\" ; Appends the line to the variable \\\"Text\\\", adding line number before & new line after\\n}\\n\\n; --> Delivers the output as a text file\\n\\nFileDelete, Output.txt ; Makes sure output is clear before writing\\nFileAppend, %Text%, Output.txt ; Writes the result to Output.txt\\nRun Output.txt ; Shows the created file\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"awk '{ print $0 }' filename\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"awk '1' filename\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"# usage: awk -f readlines.awk *.txt\\nBEGIN { print \\\"# Reading...\\\" }\\nFNR==1 { f++; print \\\"# File #\\\" f, \\\":\\\", FILENAME }\\n/^#/ { c++; next } # skip lines starting with \\\"#\\\", but count them\\n/you/ { gsub(\\\"to\\\", \\\"TO\\\") } # change text in lines with \\\"you\\\" somewhere\\n/TO/ { print FNR,\\\":\\\",$0; next } # print with line-number\\n { print } # same as \\\"print $0\\\"\\nEND { print \\\"# Done with\\\", f, \\\"file(s), with a total of\\\", NR, \\\"lines.\\\" }\\nEND { print \\\"# Comment-lines:\\\", c }\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"' Read a file line by line\\nfilename$ = \\\"readlines.bac\\\"\\nOPEN filename$ FOR READING AS fh\\nREADLN fl$ FROM fh\\nWHILE ISFALSE(ENDFILE(fh))\\n INCR lines\\n READLN fl$ FROM fh\\nWEND\\nPRINT lines, \\\" lines in \\\", filename$\\nCLOSE FILE fh\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"f = freefile\\nfilename$ = \\\"file.txt\\\"\\n\\nopen f, filename$\\n\\nwhile not eof(f)\\n print readline(f)\\nend while\\nclose f\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off\\nrem delayed expansion must be disabled before the FOR command.\\nsetlocal disabledelayedexpansion\\nfor /f \\\"tokens=1* delims=]\\\" %%A in ('type \\\"File.txt\\\"^|find /v /n \\\"\\\"') do (\\n\\tset var=%%B\\n\\tsetlocal enabledelayedexpansion\\n\\t\\techo(!var!\\n\\tendlocal\\n)\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" file% = OPENIN(\\\"*.txt\\\")\\n IF file%=0 ERROR 100, \\\"File could not be opened\\\"\\n WHILE NOT EOF#file%\\n a$ = GET$#file%\\n ENDWHILE\\n CLOSE #file%\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \" file% = OPENIN(\\\"*.txt\\\")\\n IF file%=0 ERROR 100, \\\"File could not be opened\\\"\\n WHILE NOT EOF#file%\\n INPUT #file%, a$\\n IF ASCa$=10 a$ = MID$(a$,2)\\n ENDWHILE\\n CLOSE #file%\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \" fil$(\\\"test.txt\\\",r) { r opens a text file, rb opens a binary file for reading }\\n& fil$(,STR,\\\\n) { first argument empty: same as before (i.e. \\\"test.txt\\\") }\\n { if \\\\n were replaced by e.g. \\\"\\\\n\\\\t \\\" we would read word-wise instead }\\n& 0:?lineno\\n& whl\\n ' ( fil$:(?line.?sep) { \\\"sep\\\" contains found stop character, i.e. \\\\n }\\n & put$(line (1+!lineno:?lineno) \\\":\\\" !line \\\\n)\\n )\\n& (fil$(,SET,-1)|); { Setting file position before start closes file, and fails.\\n Therefore the | }\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"include :file\\n\\nfile.each_line \\\"foobar.txt\\\" { line |\\n p line\\n}\\n\",\n \"language\": \"Brat\"\n },\n {\n \"code\": \"/* Programa: Número mayor de tres números introducidos (Solución 1) */\\n\\n#include <conio.h>\\n#include <stdio.h>\\n\\nint main()\\n{\\n int n1, n2, n3;\\n\\n printf( \\\"\\\\n Introduzca el primer n%cmero (entero): \\\", 163 );\\n scanf( \\\"%d\\\", &n1 );\\n printf( \\\"\\\\n Introduzca el segundo n%cmero (entero): \\\", 163 );\\n scanf( \\\"%d\\\", &n2 );\\n printf( \\\"\\\\n Introduzca el tercer n%cmero (entero): \\\", 163 );\\n scanf( \\\"%d\\\", &n3 );\\n\\n if ( n1 >= n2 && n1 >= n3 )\\n printf( \\\"\\\\n %d es el mayor.\\\", n1 );\\n else\\n\\n if ( n2 > n3 )\\n printf( \\\"\\\\n %d es el mayor.\\\", n2 );\\n else\\n printf( \\\"\\\\n %d es el mayor.\\\", n3 );\\n\\n getch(); /* Pausa */\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"// From manpage for \\\"getline\\\"\\n\\n#include <stdio.h>\\n#include <stdlib.h>\\n\\nint main(void)\\n{\\n\\tFILE *stream;\\n\\tchar *line = NULL;\\n\\tsize_t len = 0;\\n\\tssize_t read;\\n\\n\\tstream = fopen(\\\"file.txt\\\", \\\"r\\\");\\n\\tif (stream == NULL)\\n\\t\\texit(EXIT_FAILURE);\\n\\n\\twhile ((read = getline(&line, &len, stream)) != -1) {\\n\\t\\tprintf(\\\"Retrieved line of length %u :\\\\n\\\", read);\\n\\t\\tprintf(\\\"%s\\\", line);\\n\\t}\\n\\n\\tfree(line);\\n\\tfclose(stream);\\n\\texit(EXIT_SUCCESS);\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <sys/types.h>\\n#include <sys/stat.h>\\n#include <fcntl.h> /* C POSIX library file control options */\\n#include <unistd.h> /* C POSIX library system calls: open, close */\\n#include <sys/mman.h> /* memory management declarations: mmap, munmap */\\n#include <errno.h> /* Std C library system error numbers: errno */\\n#include <err.h> /* GNU C lib error messages: err */\\n\\nint read_lines(const char * fname, int (*call_back)(const char*, const char*))\\n{\\n int fd = open(fname, O_RDONLY);\\n struct stat fs;\\n char *buf, *buf_end;\\n char *begin, *end, c;\\n\\n if (fd == -1) {\\n err(1, \\\"open: %s\\\", fname);\\n return 0;\\n }\\n\\n if (fstat(fd, &fs) == -1) {\\n err(1, \\\"stat: %s\\\", fname);\\n return 0;\\n }\\n\\n /* fs.st_size could have been 0 actually */\\n buf = mmap(0, fs.st_size, PROT_READ, MAP_SHARED, fd, 0);\\n if (buf == (void*) -1) {\\n err(1, \\\"mmap: %s\\\", fname);\\n close(fd);\\n return 0;\\n }\\n\\n buf_end = buf + fs.st_size;\\n\\n begin = end = buf;\\n while (1) {\\n if (! (*end == '\\\\r' || *end == '\\\\n')) {\\n if (++end < buf_end) continue;\\n } else if (1 + end < buf_end) {\\n /* see if we got \\\"\\\\r\\\\n\\\" or \\\"\\\\n\\\\r\\\" here */\\n c = *(1 + end);\\n if ( (c == '\\\\r' || c == '\\\\n') && c != *end)\\n ++end;\\n }\\n\\n /* call the call back and check error indication. Announce\\n error here, because we didn't tell call_back the file name */\\n if (! call_back(begin, end)) {\\n err(1, \\\"[callback] %s\\\", fname);\\n break;\\n }\\n\\n if ((begin = ++end) >= buf_end)\\n break;\\n }\\n\\n munmap(buf, fs.st_size);\\n close(fd);\\n return 1;\\n}\\n\\nint print_line(const char* begin, const char* end)\\n{\\n if (write(fileno(stdout), begin, end - begin + 1) == -1) {\\n return 0;\\n }\\n return 1;\\n}\\n\\nint main()\\n{\\n return read_lines(\\\"test.ps\\\", print_line) ? 0 : 1;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <fstream>\\n#include <string>\\n#include <iostream>\\n\\nint main( int argc , char** argv ) {\\n int linecount = 0 ;\\n std::string line ;\\n std::ifstream infile( argv[ 1 ] ) ; // input file stream\\n if ( infile ) {\\n while ( getline( infile , line ) ) {\\n\\t std::cout << linecount << \\\": \\\"\\n << line << '\\\\n' ; //supposing '\\\\n' to be line end\\n\\t linecount++ ;\\n }\\n }\\n infile.close( ) ;\\n return 0 ;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <fstream>\\n#include <iostream>\\n#include <sstream>\\n#include <string>\\n\\nint main()\\n{\\n std::ifstream infile(\\\"thefile.txt\\\");\\n std::string line;\\n while (std::getline(infile, line) )\\n {\\n std::istringstream iss(line);\\n int a, b;\\n if (!(iss >> a >> b)) { break; } // if no error a and b get values from file\\n\\n std::cout << \\\"a:\\\\t\\\" << a <<\\\"\\\\n\\\";\\n std::cout << \\\"b:\\\\t\\\" << b <<\\\"\\\\n\\\";\\n }\\n std::cout << \\\"finished\\\" << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <Core/Core.h>\\n\\nusing namespace Upp;\\n\\nCONSOLE_APP_MAIN\\n{\\n\\tFileIn in(CommandLine()[0]);\\n\\twhile(in && !in.IsEof())\\n\\t\\tCout().PutLine(in.GetLine());\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"foreach (string readLine in File.ReadLines(\\\"FileName\\\"))\\n DoSomething(readLine);\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\nusing System.IO;\\nusing System.Text;\\n\\nnamespace RosettaCode\\n{\\n internal class Program\\n {\\n private static void Main()\\n {\\n var sb = new StringBuilder();\\n string F = \\\"File.txt\\\";\\n\\n // Read a file, line by line.\\n try\\n {\\n foreach (string readLine in File.ReadLines(F))\\n {\\n // Use the data in some way...\\n sb.Append(readLine);\\n sb.Append(\\\"\\\\n\\\");\\n }\\n }\\n catch (Exception exception)\\n {\\n Console.WriteLine(exception.Message);\\n Environment.Exit(1);\\n }\\n\\n // Preset the results\\n Console.WriteLine(sb.ToString());\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(with-open [r (clojure.java.io/reader \\\"some-file.txt\\\")]\\n (doseq [l (line-seq r)]\\n (println l)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"start_up = proc ()\\n po: stream := stream$primary_output()\\n\\n % There is a special type for file names. This ensures that\\n % the path is valid; if not, file_name$parse would throw an\\n % exception (which we are just ignoring here).\\n fname: file_name := file_name$parse(\\\"input.txt\\\")\\n\\n % File I/O is then done through a stream just like any I/O.\\n % If the file were not accessible, stream$open would throw an\\n % exception.\\n fstream: stream := stream$open(fname, \\\"read\\\")\\n\\n count: int := 0 % count the lines\\n while true do\\n % Read a line. This will end the loop once the end is reached,\\n % as the exception handler is outside the loop.\\n line: string := stream$getl(fstream)\\n\\n % Show the line\\n count := count + 1\\n stream$putl(po, int$unparse(count) || \\\": \\\" || line)\\n end except when end_of_file:\\n % Close the file once we're done\\n stream$close(fstream)\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. read-file-line-by-line.\\n\\n ENVIRONMENT DIVISION.\\n INPUT-OUTPUT SECTION.\\n FILE-CONTROL.\\n SELECT input-file ASSIGN TO \\\"input.txt\\\"\\n ORGANIZATION LINE SEQUENTIAL\\n FILE STATUS input-file-status.\\n\\n DATA DIVISION.\\n FILE SECTION.\\n FD input-file.\\n 01 input-record PIC X(256).\\n\\n WORKING-STORAGE SECTION.\\n 01 input-file-status PIC 99.\\n 88 file-is-ok VALUE 0.\\n 88 end-of-file VALUE 10.\\n\\n 01 line-count PIC 9(6).\\n\\n PROCEDURE DIVISION.\\n OPEN INPUT input-file\\n IF NOT file-is-ok\\n DISPLAY \\\"The file could not be opened.\\\"\\n GOBACK\\n END-IF\\n\\n PERFORM VARYING line-count FROM 1 BY 1 UNTIL end-of-file\\n READ input-file\\n DISPLAY line-count \\\": \\\" FUNCTION TRIM(input-record)\\n END-PERFORM\\n\\n CLOSE input-file\\n\\n GOBACK\\n .\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"# This module shows two ways to read a file line-by-line in node.js.\\nfs = require 'fs'\\n\\n# First, let's keep things simple, and do things synchronously. This\\n# approach is well-suited for simple scripts.\\ndo ->\\n fn = \\\"read_file.coffee\\\"\\n for line in fs.readFileSync(fn).toString().split '\\\\n'\\n console.log line\\n console.log \\\"DONE SYNC!\\\"\\n\\n# Now let's complicate things.\\n#\\n# Use the following code when files are large, and memory is\\n# constrained and/or where you want a large amount of concurrency.\\n#\\n# Protocol:\\n# Call LineByLineReader, which calls back to you with a reader.\\n# The reader has two methods.\\n# next_line: call to this when you want a new line\\n# close: call this when you are done using the file before\\n# it has been read completely\\n#\\n# When you call next_line, you must supply two callbacks:\\n# line_cb: called back when there is a line of text\\n# done_cb: called back when there is no more text in the file\\nLineByLineReader = (fn, cb) ->\\n fs.open fn, 'r', (err, fd) ->\\n bufsize = 256\\n pos = 0\\n text = ''\\n eof = false\\n closed = false\\n reader =\\n next_line: (line_cb, done_cb) ->\\n if eof\\n if text\\n last_line = text\\n text = ''\\n line_cb last_line\\n else\\n done_cb()\\n return\\n\\n new_line_index = text.indexOf '\\\\n'\\n if new_line_index >= 0\\n line = text.substr 0, new_line_index\\n text = text.substr new_line_index + 1, text.length - new_line_index - 1\\n line_cb line\\n else\\n frag = new Buffer(bufsize)\\n fs.read fd, frag, 0, bufsize, pos, (err, bytesRead) ->\\n s = frag.toString('utf8', 0, bytesRead)\\n text += s\\n pos += bytesRead\\n if (bytesRead)\\n reader.next_line line_cb, done_cb\\n else\\n eof = true\\n fs.closeSync(fd)\\n closed = true\\n reader.next_line line_cb, done_cb\\n close: ->\\n # The reader should call this if they abandon mid-file.\\n fs.closeSync(fd) unless closed\\n\\n cb reader\\n\\n# Test our interface here.\\ndo ->\\n console.log '---'\\n fn = 'read_file.coffee'\\n LineByLineReader fn, (reader) ->\\n callbacks =\\n process_line: (line) ->\\n console.log line\\n reader.next_line callbacks.process_line, callbacks.all_done\\n all_done: ->\\n console.log \\\"DONE ASYNC!\\\"\\n reader.next_line callbacks.process_line, callbacks.all_done\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(with-open-file (input \\\"file.txt\\\")\\n (loop for line = (read-line input nil)\\n while line do (format t \\\"~a~%\\\" line)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio;\\n\\n foreach (line; \\\"read_a_file_line_by_line.d\\\".File.byLine)\\n line.writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \";\\n; Read a file line by line for DBL version 4\\n;\\n RECORD\\n\\nLINE, A100\\n\\nPROC\\n;-----------------------------------------------\\n OPEN (1,I,\\\"FILE.TXT\\\") [ERR=NOFIL]\\n DO FOREVER\\n BEGIN\\n READS (1,LINE,EOF) [ERR=EREAD]\\n END\\nEOF, CLOSE 3\\n\\n GOTO CLOS\\n\\n;------------------------------------------------\\nNOFIL, ;Open error...do something\\n GOTO CLOS\\n\\nEREAD, ;Read error...do something\\n GOTO CLOS\\n\\nCLOS, STOP\\n\",\n \"language\": \"DBL\"\n },\n {\n \"code\": \"$ open input input.txt\\n$ loop:\\n$ read /end_of_file = done input line\\n$ goto loop\\n$ done:\\n$ close input\\n\",\n \"language\": \"DCL\"\n },\n {\n \"code\": \" procedure ReadFileByLine;\\n var\\n TextFile: text;\\n TextLine: String;\\n begin\\n Assign(TextFile, 'c:\\\\test.txt');\\n Reset(TextFile);\\n while not Eof(TextFile) do\\n Readln(TextFile, TextLine);\\n CloseFile(TextFile);\\n end;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"procedure ReadFileByLine;\\n var\\n TextLines : TStringList;\\n i : Integer;\\n begin\\n TextLines := TStringList.Create;\\n TextLines.LoadFromFile('c:\\\\text.txt');\\n for i := 0 to TextLines.count -1 do\\n ShowMessage(TextLines[i]);\\n end;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"\\\\util.g\\nproc nonrec main() void:\\n /* first we need to declare a file buffer and an input channel */\\n file() infile;\\n channel input text in_ch;\\n\\n /* a buffer to store the line in is also handy */\\n [256] char line;\\n word counter; /* to count the lines */\\n\\n /* open the file, and exit if it fails */\\n if not open(in_ch, infile, \\\"input.txt\\\") then\\n writeln(\\\"cannot open file\\\");\\n exit(1)\\n fi;\\n\\n counter := 0;\\n\\n /* readln() reads a line and will return false once the end is reached */\\n /* we pass in a pointer so it stores a C-style zero-terminated string,\\n * rather than try to fill the entire array */\\n while readln(in_ch; &line[0]) do\\n counter := counter + 1;\\n writeln(counter:5, \\\": \\\", &line[0])\\n od;\\n\\n /* finally, close the file */\\n close(in_ch)\\ncorp\\n\",\n \"language\": \"Draco\"\n },\n {\n \"code\": \"import system'io;\\nimport extensions;\\nimport extensions'routines;\\n\\npublic program()\\n{\\n File.assign(\\\"file.txt\\\").forEachLine(printingLn)\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \" defmodule FileReader do\\n # Create a File.Stream and inspect each line\\n def by_line(path) do\\n File.stream!(path)\\n |> Stream.map(&(IO.inspect(&1)))\\n\\t|> Stream.run\\n end\\n\\n def bin_line(path) do\\n # Build the stream in binary instead for performance increase\\n case File.open(path) do\\n # File returns a tuple, {:ok,file}, if successful\\n {:ok, file} ->\\n\\t IO.binstream(file, :line)\\n\\t |> Stream.map(&(IO.inspect(&1)))\\n\\t |> Stream.run\\n\\t# And returns {:error,reason} if unsuccessful\\n\\t{:error,reason} ->\\n\\t# Use Erlang's format_error to return an error string\\n\\t :file.format_error(reason)\\n end\\n end\\n end\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-module( read_a_file_line_by_line ).\\n\\n-export( [into_list/1] ).\\n\\ninto_list( File ) ->\\n {ok, IO} = file:open( File, [read] ),\\n into_list( io:get_line(IO, ''), IO, [] ).\\n\\n\\ninto_list( eof, _IO, Acc ) -> lists:reverse( Acc );\\ninto_list( {error, _Error}, _IO, Acc ) -> lists:reverse( Acc );\\ninto_list( Line, IO, Acc ) -> into_list( io:get_line(IO, ''), IO, [Line | Acc] ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"PROGRAM LETTURA\\n\\nEXCEPTION\\n FERROR%=TRUE ! si e' verificata l'eccezione !\\n PRINT(\\\"Il file richiesto non esiste .....\\\")\\nEND EXCEPTION\\n\\nBEGIN\\n FERROR%=FALSE\\n PRINT(\\\"Nome del file\\\";)\\n INPUT(FILE$) ! chiede il nome del file\\n OPEN(\\\"I\\\",1,FILE$) ! apre un file sequenziale in lettura\\n IF NOT FERROR% THEN\\n REPEAT\\n INPUT(LINE,#1,CH$) ! legge una riga ....\\n PRINT(CH$) ! ... la stampa ...\\n UNTIL EOF(1) ! ... fine a fine file\\n END IF\\n PRINT\\n CLOSE(1) ! chiude il file\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"constant cmd = command_line()\\nconstant filename = cmd[2]\\nconstant fn = open(filename,\\\"r\\\")\\ninteger i\\ni = 1\\nobject x\\nwhile 1 do\\n x = gets(fn)\\n if atom(x) then\\n exit\\n end if\\n printf(1,\\\"%2d: %s\\\",{i,x})\\n i += 1\\nend while\\nclose(fn)\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"open System.IO\\n\\n[<EntryPoint>]\\nlet main argv =\\n File.ReadLines(argv.[0]) |> Seq.iter (printfn \\\"%s\\\")\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \" \\\"path/to/file\\\" utf8 [ [ readln dup [ print ] when* ] loop ] with-file-reader\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"class Main\\n{\\n Void main ()\\n {\\n File (`data.txt`).eachLine |Str line|\\n {\\n echo (\\\"Line: $line\\\")\\n }\\n }\\n}\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \"\\\\ The scratch area provided by PAD is always at least 84 characters in\\n\\\\ length. However, READ-LINE may (but does not have to) read up to\\n\\\\ two line-terminating characters into the buffer after the line, so\\n\\\\ the buffer size should always be two larger than the limit given to\\n\\\\ READ-LINE. Lines that are two long to fit into the buffer will be split,\\n\\\\ so you can't tell they aren't separate lines.\\n82 constant max-line\\n\\n: third ( A b c -- A b c A )\\n >r over r> swap ;\\n\\n: read-lines ( fileid -- fileid )\\n begin pad max-line ( fileid pad max-line )\\n third ( fileid pad max-line fileid )\\n read-line throw ( fileid chars-read )\\n while pad swap ( fileid pad chars-read ) \\\\ string excludes the newline\\n type cr\\n repeat\\n \\\\ Get rid of number of characters read by last call to read-line, which is\\n \\\\ zero because no charaters were read.\\n drop\\n;\\n\\ns\\\" infile.txt\\\" r/o open-file throw read-lines close-file throw\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": read-lines' ( filename-addr filename-len -- )\\n r/o open-file throw ( buffer-len wfileid )\\n over 2 + \\\\ Add space for up to two line terminators after the buffer.\\n allocate throw ( buffer-len wfileid buffer-addr )\\n -rot 2>r ( buffer-addr )\\n begin\\n dup 2r@ read-line throw ( buffer bytes-read flag )\\n while\\n ( buffer-addr bytes-read )\\n over swap type cr\\n repeat\\n drop free throw\\n 2r> close-file throw drop ;\\n\\n4096 s\\\" infile.txt\\\" read-lines'\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" INTEGER ENUFF\\t\\t!A value has to be specified beforehand,.\\n PARAMETER (ENUFF = 2468)\\t!Provide some provenance.\\n CHARACTER*(ENUFF) ALINE\\t!A perfect size?\\n CHARACTER*66 FNAME\\t!What about file name sizes?\\n INTEGER LINPR,IN\\t\\t!I/O unit numbers.\\n INTEGER L,N\\t\\t!A length, and a record counter.\\n LOGICAL EXIST\\t\\t!This can't be asked for in an \\\"OPEN\\\" statement.\\n LINPR = 6\\t\\t\\t!Standard output via this unit number.\\n IN = 10\\t\\t\\t!Some unit number for the input file.\\n FNAME = \\\"Read.for\\\"\\t!Choose a file name.\\n INQUIRE (FILE = FNAME, EXIST = EXIST)\\t!A basic question.\\n IF (.NOT.EXIST) THEN\\t\\t!Absent?\\n WRITE (LINPR,1) FNAME\\t\\t!Alas, name the absentee.\\n 1 FORMAT (\\\"No sign of file \\\",A)\\t!The name might be mistyped.\\n STOP \\\"No file, no go.\\\"\\t\\t!Give up.\\n END IF\\t\\t\\t\\t!So much for the most obvious mishap.\\n OPEN (IN,FILE = FNAME, STATUS = \\\"OLD\\\", ACTION = \\\"READ\\\")\\t!For formatted input.\\n\\n N = 0\\t\\t!No records read so far.\\n 10 READ (IN,11,END = 20) L,ALINE(1:MIN(L,ENUFF))\\t!Read only the L characters in the record, up to ENUFF.\\n 11 FORMAT (Q,A)\\t\\t!Q = \\\"how many characters yet to be read\\\", A = characters with no limit.\\n N = N + 1\\t\\t\\t!A record has been read.\\n IF (L.GT.ENUFF) WRITE (LINPR,12) N,L,ENUFF\\t!Was it longer than ALINE could accommodate?\\n 12 FORMAT (\\\"Record \\\",I0,\\\" has length \\\",I0,\\\": my limit is \\\",I0)\\t!Yes. Explain.\\n WRITE (LINPR,13) N,ALINE(1:MIN(L,ENUFF))\\t!Print the record, prefixed by the count.\\n 13 FORMAT (I9,\\\":\\\",A)\\t\\t!Fixed number size for alignment.\\n GO TO 10\\t\\t\\t!Do it again.\\n\\n 20 CLOSE (IN)\\t!All done.\\n END\\t!That's all.\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nOpen \\\"input.txt\\\" For Input As #1\\nDim line_ As String\\nWhile Not Eof(1)\\n Line Input #1, line_ '' read each line\\n Print line_ '' echo it to the console\\nWend\\nClose #1\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"for line = lines[\\\"file:yourfile.txt\\\"]\\n println[line]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"Public Sub Main()\\nDim hFile As File\\nDim sLine As String\\n\\nhFile = Open \\\"../InputText.txt\\\" For Input\\n\\nWhile Not Eof(hFile)\\n Line Input #hFile, sLine\\n Print sLine\\nWend\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"ReadByLines := function(name)\\n\\tlocal file, line, count;\\n\\tfile := InputTextFile(name);\\n\\tcount := 0;\\n\\twhile true do\\n\\t\\tline := ReadLine(file);\\n\\t\\tif line = fail then\\n\\t\\t\\tbreak;\\n\\t\\tfi;\\n\\t\\tcount := count + 1;\\n\\tod;\\n\\tCloseStream(file);\\n\\treturn count;\\nend;\\n\\n# With [http://www.ibiblio.org/pub/docs/misc/amnesty.txt amnesty.txt]\\nReadByLines(\\\"amnesty.txt\\\");\\n# 384\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"[indent=4]\\n/*\\n Read file line by line, in Genie\\n\\n valac readFileLines.gs\\n ./readFileLines [filename]\\n*/\\n\\ninit\\n\\n fileName:string\\n fileName = (args[1] is null) ? \\\"readFileLines.gs\\\" : args[1]\\n var file = FileStream.open(fileName, \\\"r\\\")\\n if file is null\\n stdout.printf(\\\"Error: %s did not open\\\\n\\\", fileName)\\n return\\n\\n lines:int = 0\\n line:string? = file.read_line()\\n while line is not null\\n lines++\\n stdout.printf(\\\"%04d %s\\\\n\\\", lines, line)\\n line = file.read_line()\\n\",\n \"language\": \"Genie\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"bufio\\\"\\n\\t\\\"fmt\\\"\\n\\t\\\"log\\\"\\n\\t\\\"os\\\"\\n)\\n\\nfunc init() {\\n\\tlog.SetFlags(log.Lshortfile)\\n}\\n\\nfunc main() {\\n\\t// Open an input file, exit on error.\\n\\tinputFile, err := os.Open(\\\"byline.go\\\")\\n\\tif err != nil {\\n\\t\\tlog.Fatal(\\\"Error opening input file:\\\", err)\\n\\t}\\n\\n\\t// Closes the file when we leave the scope of the current function,\\n\\t// this makes sure we never forget to close the file if the\\n\\t// function can exit in multiple places.\\n\\tdefer inputFile.Close()\\n\\n\\tscanner := bufio.NewScanner(inputFile)\\n\\n\\t// scanner.Scan() advances to the next token returning false if an error was encountered\\n\\tfor scanner.Scan() {\\n\\t\\tfmt.Println(scanner.Text())\\n\\t}\\n\\n\\t// When finished scanning if any error other than io.EOF occured\\n\\t// it will be returned by scanner.Err().\\n\\tif err := scanner.Err(); err != nil {\\n\\t\\tlog.Fatal(scanner.Err())\\n\\t}\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bufio\\\"\\n \\\"fmt\\\"\\n \\\"io\\\"\\n \\\"log\\\"\\n \\\"os\\\"\\n)\\n\\nfunc main() {\\n f, err := os.Open(\\\"file\\\") // os.OpenFile has more options if you need them\\n if err != nil { // error checking is good practice\\n // error *handling* is good practice. log.Fatal sends the error\\n // message to stderr and exits with a non-zero code.\\n log.Fatal(err)\\n }\\n\\n // os.File has no special buffering, it makes straight operating system\\n // requests. bufio.Reader does buffering and has several useful methods.\\n bf := bufio.NewReader(f)\\n\\n // there are a few possible loop termination\\n // conditions, so just start with an infinite loop.\\n for {\\n // reader.ReadLine does a buffered read up to a line terminator,\\n // handles either /n or /r/n, and returns just the line without\\n // the /r or /r/n.\\n line, isPrefix, err := bf.ReadLine()\\n\\n // loop termination condition 1: EOF.\\n // this is the normal loop termination condition.\\n if err == io.EOF {\\n break\\n }\\n\\n // loop termination condition 2: some other error.\\n // Errors happen, so check for them and do something with them.\\n if err != nil {\\n log.Fatal(err)\\n }\\n\\n // loop termination condition 3: line too long to fit in buffer\\n // without multiple reads. Bufio's default buffer size is 4K.\\n // Chances are if you haven't seen a line terminator after 4k\\n // you're either reading the wrong file or the file is corrupt.\\n if isPrefix {\\n log.Fatal(\\\"Error: Unexpected long line reading\\\", f.Name())\\n }\\n\\n // success. The variable line is now a byte slice based on on\\n // bufio's underlying buffer. This is the minimal churn necessary\\n // to let you look at it, but note! the data may be overwritten or\\n // otherwise invalidated on the next read. Look at it and decide\\n // if you want to keep it. If so, copy it or copy the portions\\n // you want before iterating in this loop. Also note, it is a byte\\n // slice. Often you will want to work on the data as a string,\\n // and the string type conversion (shown here) allocates a copy of\\n // the data. It would be safe to send, store, reference, or otherwise\\n // hold on to this string, then continue iterating in this loop.\\n fmt.Println(string(line))\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bufio\\\"\\n \\\"fmt\\\"\\n \\\"io\\\"\\n \\\"log\\\"\\n \\\"os\\\"\\n)\\n\\nfunc main() {\\n f, err := os.Open(\\\"file\\\")\\n if err != nil {\\n log.Fatal(err)\\n }\\n bf := bufio.NewReader(f)\\n for {\\n switch line, err := bf.ReadString('\\\\n'); err {\\n case nil:\\n // valid line, echo it. note that line contains trailing \\\\n.\\n fmt.Print(line)\\n case io.EOF:\\n if line > \\\"\\\" {\\n // last line of file missing \\\\n, but still valid\\n fmt.Println(line)\\n }\\n return\\n default:\\n log.Fatal(err)\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"new File(\\\"Test.txt\\\").eachLine { line, lineNumber ->\\n println \\\"processing line $lineNumber: $line\\\"\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"main = do\\n file <- readFile \\\"linebyline.hs\\\"\\n mapM_ putStrLn (lines file)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\nf := open(\\\"input.txt\\\",\\\"r\\\") | stop(\\\"cannot open file \\\",fn)\\nwhile line := read(f)\\nclose(f)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"100 INPUT PROMPT \\\"Filename: \\\":NAME$\\n110 OPEN #1:NAME$ ACCESS INPUT\\n120 COPY FROM #1 TO #0\\n130 CLOSE #1\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \"cocurrent 'linereader'\\n\\n NB. configuration parameter\\n blocksize=: 400000\\n\\n NB. implementation\\n offset=: 0\\n position=: 0\\n buffer=: ''\\n lines=: ''\\n\\n create=: monad define\\n name=: boxxopen y\\n size=: 1!:4 name\\n blocks=: 2 <@(-~/\\\\)\\\\ ~. size <. blocksize * i. 1 + >. size % blocksize\\n )\\n\\n readblocks=: monad define\\n if. 0=#blocks do. return. end.\\n if. 1<#lines do. return. end.\\n whilst. -.LF e.chars do.\\n buffer=: buffer,chars=. 1!:11 name,{.blocks\\n blocks=: }.blocks\\n lines=: <;._2 buffer,LF\\n end.\\n buffer=: _1{::lines\\n )\\n\\n next=: monad define\\n if. (#blocks)*.2>#lines do. readblocks'' end.\\n r=. 0{::lines\\n lines=: }.lines\\n r\\n )\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" example=: '/tmp/example.txt' conew 'linereader'\\n next__example''\\nthis is line 1\\n next__example''\\nand this is line 2\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.io.BufferedReader;\\nimport java.io.FileReader;\\n\\n/**\\n * Reads a file line by line, processing each line.\\n *\\n * @author $Author$\\n * @version $Revision$\\n */\\npublic class ReadFileByLines {\\n private static void processLine(int lineNo, String line) {\\n // ...\\n }\\n\\n public static void main(String[] args) {\\n for (String filename : args) {\\n BufferedReader br = null;\\n FileReader fr = null;\\n try {\\n fr = new FileReader(filename);\\n br = new BufferedReader(fr);\\n String line;\\n int lineNo = 0;\\n while ((line = br.readLine()) != null) {\\n processLine(++lineNo, line);\\n }\\n }\\n catch (Exception x) {\\n x.printStackTrace();\\n }\\n finally {\\n if (fr != null) {\\n try {br.close();} catch (Exception ignoreMe) {}\\n try {fr.close();} catch (Exception ignoreMe) {}\\n }\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"for (String filename : args) {\\n try (FileReader fr = new FileReader(filename);BufferedReader br = new BufferedReader(fr)){\\n String line;\\n int lineNo = 0;\\n while ((line = br.readLine()) != null) {\\n processLine(++lineNo, line);\\n }\\n }\\n catch (Exception x) {\\n x.printStackTrace();\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.nio.file.Files;\\nimport java.nio.file.Paths;\\nimport java.nio.charset.Charset;\\nimport java.io.IOException;\\n//...other class code\\nList<String> lines = null;\\ntry{\\n lines = Files.readAllLines(Paths.get(filename), Charset.defaultCharset());\\n}catch(IOException | SecurityException e){\\n //problem with the file\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var fs = require(\\\"fs\\\");\\n\\nvar readFile = function(path) {\\n return fs.readFileSync(path).toString();\\n};\\n\\nconsole.log(readFile('file.txt'));\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"$ seq 0 5 | jq -R 'tonumber|sin'\\n0\\n0.8414709848078965\\n0.9092974268256817\\n0.1411200080598672\\n-0.7568024953079282\\n-0.9589242746631385\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ seq 0 5 | jq -n '[inputs|sin] | max'\\n0.9092974268256817\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"/* Read by line, in Jsish */\\nvar f = new Channel('read-by-line.jsi');\\nvar line;\\n\\nwhile (line = f.gets()) puts(line);\\nf.close();\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"open(\\\"input_file\\\",\\\"r\\\") do f\\n for line in eachline(f)\\n println(\\\"read line: \\\", line)\\n end\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nimport java.io.File\\n\\nfun main(args: Array<String>) {\\n File(\\\"input.txt\\\").forEachLine { println(it) }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"local(f) = file('foo.txt')\\nhandle => {#f->close}\\n#f->forEachLine => {^\\n #1\\n '<br>' // note this simply inserts an HTML line break between each line.\\n^}\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"filedialog \\\"Open\\\",\\\"*.txt\\\",file$\\nif file$=\\\"\\\" then end\\nopen file$ for input as #f\\nwhile not(eof(#f))\\n line input #f, t$\\n print t$\\nwend\\nclose #f\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"filedialog \\\"Open\\\",\\\"*.txt\\\",file$\\nif file$=\\\"\\\" then end\\nopen file$ for input as #f\\nwhile not(eof(#f))\\n t$ = inputto$(#f, chr$(13))\\n print t$\\nwend\\nclose #f\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"filedialog \\\"Open\\\",\\\"*.txt\\\",file$\\nif file$=\\\"\\\" then end\\nopen file$ for input as #f\\nwhile not(eof(#f))\\n t$ = inputto$(#f, chr$(10))\\n print t$\\nwend\\nclose #f\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"fp = xtra(\\\"fileIO\\\").new()\\nfp.openFile(_movie.path & \\\"input.txt\\\", 1)\\nfileSize = fp.getLength()\\nrepeat while TRUE\\n str = fp.readLine()\\n if str.char[1] = numtochar(10) then delete char 1 of str\\n if the last char of str = numtochar(13) then delete the last char of str\\n put str\\n if fp.getPosition()>=fileSize then exit repeat\\nend repeat\\nfp.closeFile()\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"command readFileLineByLine\\n local tFile, tLines, startRead\\n put \\\"/usr/share/dict/words\\\" into tFile\\n open file tFile for text read\\n put true into startRead\\n repeat until it is empty and startRead is false\\n put false into startRead\\n read from file tFile for 1 line\\n add 1 to tLines\\n end repeat\\n close file tFile\\n put tLines\\nend readFileLineByLine\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"10 OPENIN\\\"foo.txt\\\"\\n20 WHILE NOT EOF\\n30 LINE INPUT#9,i$\\n40 PRINT i$\\n50 WEND\\n\",\n \"language\": \"Locomotive-Basic\"\n },\n {\n \"code\": \"while [not eof?] [print readline]\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"filename = \\\"input.txt\\\"\\nfp = io.open( filename, \\\"r\\\" )\\n\\nfor line in fp:lines() do\\n print( line )\\nend\\n\\nfp:close()\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"for line in io.lines(\\\"input.txt\\\") do\\n print(line)\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module checkit {\\n \\\\\\\\ prepare a file\\n document a$\\n a$={First Line\\n Second line\\n Third Line\\n }\\n Save.Doc a$, \\\"checkthis.txt\\\", 0 ' 0 for UTF-16LE\\n Flush\\n Open \\\"checkthis.txt\\\" For Wide Input as #F\\n While not Eof(#f) {\\n Data Seek(#f)\\n Line Input #F, b$\\n Print b$\\n }\\n Close #f\\n Dim Index()\\n \\\\\\\\ copy stack to index(), flush stack\\n Index()=Array([])\\n \\\\\\\\ change base to base 1\\n Dim Base 1, Index(len(index()))\\n Open \\\"checkthis.txt\\\" For Wide Input as #F\\n Seek#F, Index(2)\\n Line Input #F, b$\\n Print b$ ' print second line\\n Close #f\\n \\\\\\\\ prepare Ansi file\\n Print \\\"Ansi File\\\"\\n Save.Doc a$, \\\"checkthis.txt\\\", 1033 ' we use specific locale\\n Flush \\\\\\\\ flush the stack to get indexes\\n oldlocale=locale\\n locale 1033\\n \\\\\\\\ no Wide clause\\n Open \\\"checkthis.txt\\\" For Input as #F\\n While not Eof(#f) {\\n Data Seek(#f)\\n Line Input #F, b$\\n Print b$\\n }\\n Close #f\\n Dim Index()\\n \\\\\\\\ copy stack to index(), flush stack\\n Index()=Array([])\\n \\\\\\\\ change base to base 1\\n Dim Base 1, Index(len(index()))\\n Open \\\"checkthis.txt\\\" For Input as #F\\n Seek#F, Index(2)\\n Line Input #F, b$\\n Print b$ ' print second line\\n Close #f\\n locale oldlocale\\n}\\ncheckit\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"path := \\\"file.txt\\\":\\nwhile (true) do\\n\\tinput := readline(path):\\n\\tif input = 0 then break; end if:\\n\\t#The line is stored in input\\nend do:\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"strm=OpenRead[\\\"input.txt\\\"];\\nIf[strm=!=$Failed,\\n While[line=!=EndOfFile,\\n line=Read[strm];\\n (*Do something*)\\n ]];\\nClose[strm];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \" fid = fopen('foobar.txt','r');\\n if (fid < 0)\\n\\tprintf('Error:could not open file\\\\n')\\n else\\n\\twhile ~feof(fid),\\n\\t\\tline = fgetl(fid);\\n %% process line %%\\n\\tend;\\n fclose(fid)\\n end;\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"/* Read a file and return a list of all lines */\\n\\nreadfile(name) := block(\\n [v: [ ], f: openr(name), line],\\n while stringp(line: readline(f)) do v: endcons(line, v),\\n close(f),\\n v\\n)$\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \":- module read_a_file_line_by_line.\\n:- interface.\\n\\n:- import_module io.\\n\\n:- pred main(io::di, io::uo) is det.\\n\\n:- implementation.\\n\\n:- import_module int, list, require, string.\\n\\nmain(!IO) :-\\n io.open_input(\\\"test.txt\\\", OpenResult, !IO),\\n (\\n OpenResult = ok(File),\\n read_file_line_by_line(File, 0, !IO)\\n ;\\n OpenResult = error(Error),\\n error(io.error_message(Error))\\n ).\\n\\n:- pred read_file_line_by_line(io.text_input_stream::in, int::in,\\n io::di, io::uo) is det.\\n\\nread_file_line_by_line(File, !.LineCount, !IO) :-\\n % We could also use io.read_line/3 which returns a list of characters\\n % instead of a string.\\n io.read_line_as_string(File, ReadLineResult, !IO),\\n (\\n ReadLineResult = ok(Line),\\n !:LineCount = !.LineCount + 1,\\n io.format(\\\"%d: %s\\\", [i(!.LineCount), s(Line)], !IO),\\n read_file_line_by_line(File, !.LineCount, !IO)\\n ;\\n ReadLineResult = eof\\n ;\\n ReadLineResult = error(Error),\\n error(io.error_message(Error))\\n ).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \":- module read_a_file_line_by_line.\\n:- interface.\\n\\n:- import_module io.\\n\\n:- pred main(io::di, io::uo) is det.\\n\\n:- implementation.\\n\\n:- import_module int, list, require, string, stream.\\n\\nmain(!IO) :-\\n io.open_input(\\\"test.txt\\\", OpenResult, !IO),\\n (\\n OpenResult = ok(File),\\n stream.input_stream_fold2_state(File, process_line, 0, Result, !IO),\\n (\\n Result = ok(_)\\n ;\\n Result = error(_, Error),\\n error(io.error_message(Error))\\n )\\n ;\\n OpenResult = error(Error),\\n error(io.error_message(Error))\\n ).\\n\\n:- pred process_line(line::in, int::in, int::out, io::di, io::uo) is det.\\n\\nprocess_line(line(Line), !LineCount, !IO) :-\\n !:LineCount = !.LineCount + 1,\\n io.format(\\\"%d: %s\\\", [i(!.LineCount), s(Line)], !IO).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"/**\\n Read a file line by line, in Neko\\n <doc><pre>Tectonics:\\n nekoc readfile.neko\\n neko readfile [filename]</pre></doc>\\n*/\\n\\n\\nvar stdin = $loader.loadprim(\\\"std@file_stdin\\\", 0)()\\nvar file_open = $loader.loadprim(\\\"std@file_open\\\", 2)\\nvar file_read_char = $loader.loadprim(\\\"std@file_read_char\\\", 1)\\n\\n/* Read a line from file f into string s returning length without any newline */\\nvar NEKO_MAX = 1 << 29\\nvar strsize = 256\\nvar NEWLINE = 10\\nvar readline = function(f) {\\n var s = $smake(strsize)\\n var len = 0\\n var ch\\n var file_exception = false\\n while true {\\n try ch = file_read_char(f) catch problem { file_exception = problem; break; }\\n if ch == NEWLINE break;\\n if $sset(s, len, ch) == null break; else len += 1\\n\\n if len == strsize - 1 {\\n strsize *= 2\\n if strsize > NEKO_MAX $throw(\\\"Out of string space for readline\\\")\\n var t = s\\n s = $smake(strsize)\\n $sblit(s, 0, t, 0, $ssize(t))\\n }\\n }\\n if $istrue(file_exception) $rethrow(file_exception)\\n return $ssub(s, 0, len)\\n}\\n\\nvar infile\\nvar cli = $loader.args[0]\\nif cli == null infile = stdin\\nelse {\\n cli = $string(cli)\\n try infile = file_open(cli, \\\"r\\\")\\n catch problem $print(problem, \\\" Can't open \\\", cli, \\\"\\\\n\\\")\\n}\\nif infile == null $throw(\\\"Can't open \\\" + cli)\\n\\nvar str\\nwhile true {\\n try {\\n str = readline(infile)\\n $print(\\\":\\\", str, \\\":\\\\n\\\")\\n } catch a break;\\n}\\n\",\n \"language\": \"Neko\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary\\n\\nparse arg inFileName .\\n\\nif inFileName = '' | inFileName = '.' then inFileName = './data/dwarfs.json'\\nlines = scanFile(inFileName)\\nloop l_ = 1 to lines[0]\\n say l_.right(4)':' lines[l_]\\n end l_\\n\\nreturn\\n\\n-- Read a file and return contents as a Rexx indexed string\\nmethod scanFile(inFileName) public static returns Rexx\\n\\n fileLines = ''\\n do\\n inFile = File(inFileName)\\n inFileScanner = Scanner(inFile)\\n loop l_ = 1 while inFileScanner.hasNext()\\n fileLines[0] = l_\\n fileLines[l_] = inFileScanner.nextLine()\\n end l_\\n inFileScanner.close()\\n\\n catch ex = FileNotFoundException\\n ex.printStackTrace\\n end\\n\\n return fileLines\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary\\n\\nparse arg inFileName .\\n\\nif inFileName = '' | inFileName = '.' then inFileName = './data/dwarfs.json'\\nlines = readFile(inFileName)\\nloop l_ = 1 to lines[0]\\n say l_.right(4)':' lines[l_]\\n end l_\\n\\nreturn\\n\\n-- Read a file and return contents as a Rexx indexed string\\nmethod readFile(inFileName) public static returns Rexx\\n\\n fileLines = ''\\n inLine = String null\\n inFileBR = BufferedReader null\\n\\n do\\n inFile = File(inFileName)\\n inFileBR = BufferedReader(FileReader(inFile))\\n loop l_ = 1 until inline = null\\n inLine = inFileBR.readLine()\\n if inline \\\\= null then do\\n fileLines[0] = l_\\n fileLines[l_] = inLine\\n end\\n end l_\\n\\n catch exFNF = FileNotFoundException\\n exFNF.printStackTrace\\n catch exIO = IOException\\n exIO.printStackTrace\\n finally\\n if inFileBR \\\\= null then do\\n do\\n inFileBR.close()\\n catch ex = IOException\\n ex.printStackTrace\\n end\\n end\\n end\\n\\n return fileLines\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"(set 'in-file (open \\\"filename\\\" \\\"read\\\"))\\n(while (read-line in-file)\\n (write-line))\\n(close in-file)\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"for line in lines \\\"input.txt\\\":\\n echo line\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"bundle Default {\\n class ReadFile {\\n function : Main(args : String[]) ~ Nil {\\n f := IO.FileReader->New(\\\"in.txt\\\");\\n if(f->IsOpen()) {\\n string := f->ReadString();\\n while(f->IsEOF() = false) {\\n string->PrintLine();\\n string := f->ReadString();\\n };\\n f->Close();\\n };\\n }\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"NSString *path = [NSString stringWithString:@\\\"/usr/share/dict/words\\\"];\\nNSError *error = nil;\\nNSString *words = [[NSString alloc] initWithContentsOfFile:path\\n encoding:NSUTF8StringEncoding error:&error];\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"NSArray* lines = [words componentsSeparatedByCharactersInSet:[NSCharacterSet newlineCharacterSet]];\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"let () =\\n let ic = open_in \\\"input.txt\\\" in\\n try\\n while true do\\n let line = input_line ic in\\n print_endline line\\n done\\n with End_of_file ->\\n close_in ic\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let input_line_opt ic =\\n try Some (input_line ic)\\n with End_of_file -> None\\n\\nlet read_lines ic =\\n let rec aux acc =\\n match input_line_opt ic with\\n | Some line -> aux (line::acc)\\n | None -> (List.rev acc)\\n in\\n aux []\\n\\nlet lines_of_file filename =\\n let ic = open_in filename in\\n let lines = read_lines ic in\\n close_in ic;\\n (lines)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let () =\\n let lines = lines_of_file \\\"unixdict.txt\\\" in\\n List.iter print_endline lines\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"core:os\\\"\\nimport \\\"core:fmt\\\"\\nimport \\\"core:bufio\\\"\\nimport \\\"core:strings\\\"\\n\\nmain :: proc() {\\n f, err := os.open(\\\"input.txt\\\")\\n assert(err == 0, \\\"Could not open file\\\")\\n defer os.close(f)\\n\\n r: bufio.Reader\\n buffer: [1024]byte\\n bufio.reader_init_with_buf(&r, {os.stream_from_handle(f)}, buffer[:])\\n defer bufio.reader_destroy(&r)\\n\\n for {\\n line, err := bufio.reader_read_string(&r, '\\\\n', context.allocator)\\n if err != nil do break\\n defer delete(line, context.allocator)\\n\\n line = strings.trim_right(line, \\\"\\\\r\\\")\\n fmt.print(line)\\n }\\n}\\n\",\n \"language\": \"Odin\"\n },\n {\n \"code\": \": readFile(fileName)\\n | line | File new(fileName) forEach: line [ line println ] ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"function getline(string s, int *i) as string\\n int sl=i, el=i\\n byte b at strptr(s)\\n do\\n select b[el]\\n case 0\\n i=el+1 : exit do\\n case 10 'lf\\n i=el+1 : exit do\\n case 13 'cr\\n i=el+1\\n if b[i]=10 then i++ 'crlf\\n exit do\\n end select\\n el++\\n loop\\n return mid(s,sl,el-sl)\\nend function\\n\\n'read all file lines\\n'===================\\n\\nstring s=getfile \\\"t.txt\\\"\\nint le=len(s)\\nint i=1\\nint c=0\\nstring wr\\nif le=0 then goto done\\ndo\\n wr = getline(s,i)\\n 'print wr\\n c++\\n if i>le then exit do\\nend do\\ndone:\\nprint \\\"Line count \\\" c\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"FILE *f = fopen(name, \\\"r\\\");\\nif (!f) {\\n\\tpari_err(openfiler, \\\"input\\\", name);\\n}\\nwhile(fgets(line, MAX_LINELEN, f) != NULL) {\\n\\t// ...\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"(* Read a text-file line by line *)\\n program ReadFileByLine;\\n var\\n InputFile,OutputFile: text;\\n TextLine: String;\\n begin\\n Assign(InputFile, 'testin.txt');\\n Reset(InputFile);\\n Assign(OutputFile, 'testout.txt');\\n Rewrite(OutputFile);\\n while not Eof(InputFile) do\\n begin\\n ReadLn(InputFile, TextLine);\\n (* do someting with TextLine *)\\n WriteLn(OutputFile, TextLine)\\n end;\\n Close(InputFile);\\n Close(OutputFile)\\n end.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"open(my $fh, '<', 'foobar.txt')\\n || die \\\"Could not open file: $!\\\";\\nwhile (<$fh>)\\n{ # each line is stored in $_, with terminating newline\\n # chomp, short for chomp($_), removes the terminating newline\\n chomp;\\n process($_);\\n}\\nclose $fh;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"open(my $fh, '< :encoding(UTF-8)', 'foobar.txt')\\n || die \\\"Could not open file: $!\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"open(my $fh, '<', 'foobar.txt')\\n || die \\\"Could not open file: $!\\\";\\nwhile (my $line = <$fh>)\\n{\\n chomp $line;\\n process($line);\\n}\\nclose $fh;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"while (<>) {\\n chomp;\\n process($_);\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"perl myscript.pl 'rm -rf / |'\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"open(my $fh, '<', 'foobar.txt') or die \\\"$!\\\";\\nwhile (readline $fh)\\n{ ... }\\n\\nwhile (my $line = readline $fh)\\n{ ... }\\nclose $fh;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">fn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">open</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">command_line</span><span style=\\\"color: #0000FF;\\\">()[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #008000;\\\">\\\"r\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">lno</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">line</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">line</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">gets</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #004080;\\\">atom</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">line</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%2d: %s\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">lno</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">line</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">lno</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #7060A8;\\\">close</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">{}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">wait_key</span><span style=\\\"color: #0000FF;\\\">()</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\nargument 1 get \\\"r\\\" fopen >ps\\n\\ntrue\\nwhile\\n tps fgets number? if drop ps> fclose false else print true endif\\nendwhile\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"<?php\\n$file = fopen(__FILE__, 'r'); // read current file\\nwhile ($line = fgets($file)) {\\n $line = rtrim($line); // removes linebreaks and spaces at end\\n echo strrev($line) . \\\"\\\\n\\\"; // reverse line and upload it\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"<?php // HOW TO ECHO FILE LINE BY LINE FROM THE COMMAND LINE: php5-cli\\n$file = fopen('test.txt', 'r'); // OPEN FILE WITH READ ACCESS\\nwhile (!feof($file)) {\\n $line = rtrim(fgets($file)); // REMOVE TRAILING WHITESPACE AND GET LINE\\n if($line != NULL) echo(\\\"$line\\\\n\\\"); // IF THE LINE ISN'T NULL, ECHO THE LINE\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"go =>\\n FD = open(\\\"unixdict.txt\\\"),\\n while (not at_end_of_stream(FD))\\n Line = read_line(FD),\\n println(Line)\\n end,\\n close(FD),\\n nl.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"go2 =>\\n foreach(Line in read_file_lines(\\\"unixdict.txt\\\"))\\n println(Line)\\n end.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(in \\\"foobar.txt\\\"\\n (while (line)\\n (process @) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"read: procedure options (main);\\n declare line character (500) varying;\\n\\n on endfile (sysin) stop;\\n\\n do forever;\\n get edit (line)(L);\\n end;\\nend read;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"$reader = [System.IO.File]::OpenText($mancorfile)\\ntry {\\n\\tdo {\\n\\t\\t$line = $reader.ReadLine()\\n\\t\\tif ($line -eq $null) { break }\\n\\t\\tDoSomethingWithLine($line)\\n\\t} while ($TRUE)\\n} finally {\\n\\t$reader.Close()\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"FileName$ = OpenFileRequester(\\\"\\\",\\\"foo.txt\\\",\\\"*.txt\\\",0)\\n\\nIf ReadFile(0, FileName$) ; use ReadFile instead of OpenFile to include read-only files\\n BOMformat = ReadStringFormat(0) ; reads the BOMformat (Unicode, UTF-8, ASCII, ...)\\n While Not Eof(0)\\n line$ = ReadString(0, BOMformat)\\n DoSomethingWithTheLine(Line)\\n Wend\\n CloseFile(0)\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"with open(\\\"foobar.txt\\\") as f:\\n for line in f:\\n process(line)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import fileinput\\nfor line in fileinput.input():\\n process(line)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"f = FREEFILE\\nfilename$ = \\\"file.txt\\\"\\n\\nOPEN filename$ FOR INPUT AS #f\\n\\nWHILE NOT EOF(f)\\n LINE INPUT #f, linea$\\n PRINT linea$\\nWEND\\nCLOSE #f\\nEND\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \"conn <- file(\\\"notes.txt\\\", \\\"r\\\")\\nwhile(length(line <- readLines(conn, 1)) > 0) {\\n cat(line, \\\"\\\\n\\\")\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"(define (read-next-line-iter file)\\n\\t (let ((line (read-line file 'any)))\\n\\t (unless (eof-object? line)\\n\\t (display line)\\n\\t (newline)\\n\\t (read-next-line-iter file))))\\n(call-with-input-file \\\"foobar.txt\\\" read-next-line-iter)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(define in (open-input-file file-name))\\n(for ([line (in-lines in)])\\n (displayln line))\\n(close-input-port in)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"for open('test.txt').lines\\n{\\n .say\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"my $f = open 'test.txt';\\nwhile my $line = $f.get {\\n say $line;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"$Include \\\"Rapidq.inc\\\"\\ndim file as qfilestream\\n\\nif file.open(\\\"c:\\\\A Test.txt\\\", fmOpenRead) then\\n while not File.eof\\n print File.readline\\n wend\\nelse\\n print \\\"Cannot read file\\\"\\nend if\\n\\ninput \\\"Press enter to exit: \\\";a$\\n\",\n \"language\": \"RapidQ\"\n },\n {\n \"code\": \"/*REXX program reads and displays (with a count) a file, one line at a time. */\\nparse arg fID . /*obtain optional argument from the CL.*/\\nif fID=='' then exit 8 /*Was no fileID specified? Then quit. */\\nsay center(' displaying file: ' fID\\\" \\\", 79, '═') /*show the name of the file being read.*/\\ncall linein fID, 1, 0 /*see the comment in the section header*/\\nsay /* [↓] show a file's contents (lines).*/\\n do #=1 while lines(fID)\\\\==0 /*loop whilst there are lines in file. */\\n y= linein(fID) /*read a line and assign contents to Y.*/\\n say y /*show the content of the line (record)*/\\n end /*#*/\\nsay /*stick a fork in it, we're all done. */\\nsay center(' file ' fID \\\" has \\\" #-1 ' records.', 79, '═') /*show rec count. */\\ncall lineout fID /*close the input file (most REXXes). */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/* Also works with Regina if you state OPTIONS AREXX_BIFS ; OPTIONS AREXX_SEMANTICS */\\nfilename='file.txt'\\ncontents=''\\nIF Open(filehandle,filename,'READ')\\nTHEN DO UNTIL EOF(filehandle)\\n line=ReadLn(filehandle)\\n SAY line\\n contents=contents || line || '0a'x\\n END\\nELSE EXIT 20\\nCALL Close filehandle\\nEXIT 0\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"fp = fopen(\\\"C:\\\\Ring\\\\ReadMe.txt\\\",\\\"r\\\")\\nr = \\\"\\\"\\nwhile isstring(r)\\n r = fgetc(fp)\\n if r = char(10) see nl\\n else see r ok\\nend\\nfclose(fp)\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"IO.foreach \\\"foobar.txt\\\" do |line|\\n # Do something with line.\\n puts line\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"# File inherits from IO, so File.foreach also works.\\nFile.foreach(\\\"foobar.txt\\\") {|line| puts line}\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"# IO.foreach and File.foreach can also read a subprocess.\\nIO.foreach \\\"| grep afs3 /etc/services\\\" do |line|\\n puts line\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"filename = \\\"|strange-name.txt\\\"\\nFile.open(filename) do |file|\\n file.each {|line| puts line}\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"open DefaultDir$ + \\\"\\\\public\\\\filetest.txt\\\" for input as #f\\nwhile not(eof(#f))\\n line input #f, a$\\n print a$\\nwend\\nclose #f\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use std::io::{BufReader,BufRead};\\nuse std::fs::File;\\n\\nfn main() {\\n let file = File::open(\\\"file.txt\\\").unwrap();\\n for line in BufReader::new(file).lines() {\\n println!(\\\"{}\\\", line.unwrap());\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import scala.io._\\nSource.fromFile(\\\"foobar.txt\\\").getLines.foreach(println)\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"; Commented line below should be uncommented to use read-line with Guile\\n;(use-modules (ice-9 rdelim))\\n\\n(define file (open-input-file \\\"input.txt\\\"))\\n(do ((line (read-line file) (read-line file))) ((eof-object? line))\\n (display line)\\n (newline))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"#!/bin/sed -f\\np\\n\",\n \"language\": \"Sed\"\n },\n {\n \"code\": \"sed p filename\\n\",\n \"language\": \"Sed\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst proc: main is func\\n local\\n var file: aFile is STD_NULL;\\n var string: line is \\\"\\\";\\n begin\\n aFile := open(\\\"input.txt\\\", \\\"r\\\");\\n while hasNext(aFile) do\\n readln(aFile, line);\\n writeln(\\\"LINE: \\\" <& line);\\n end while;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"repeat with each line of file \\\"input.txt\\\"\\n\\tput it\\nend repeat\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"put \\\"input.txt\\\" into myFile\\nopen file myFile\\n\\nrepeat forever\\n\\tread from file myFile until return\\n\\tif it is empty then exit repeat\\n\\tput it\\nend repeat\\n\\nclose file myFile\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"File(__FILE__).open_r.each { |line|\\n say line\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"var fh = File(__FILE__).open_r\\nwhile (fh.readline(\\\\var line)) {\\n say line\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"(StandardFileStream oldFileNamed: 'test.txt') contents lines do: [ :each | Transcript show: each. ]\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"'foobar.txt' asFilename readingLinesDo:[:eachLine | eachLine printCR]\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"|s|\\ns := 'foobar.txt' asFilename readStream.\\n[ s atEnd ] whileFalse:[\\n s nextLine printCR.\\n].\\ns close\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"'foobar.txt' asFilename contents do:[:eachLine | eachLine printCR].\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \" input(.infile,20,\\\"readfrom.txt\\\") :f(end)\\nrdloop output = infile :s(rdloop)\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"let f = fopen(\\\"foo.txt\\\", \\\"r\\\");\\nif f != nil {\\n var line;\\n while (line = fgetline(f)) != nil {\\n print(line);\\n }\\n\\n fclose(f);\\n}\\n\",\n \"language\": \"Sparkling\"\n },\n {\n \"code\": \"f = \\\"file.txt\\\"\\n> !#.eof(f)\\n #.output(#.readline(f))\\n<\\n\",\n \"language\": \"SPL\"\n },\n {\n \"code\": \"fun readLines string =\\n let\\n val strm = TextIO.openIn path\\n fun chomp str =\\n let\\n val xstr = String.explode str\\n val slen = List.length xstr\\n in\\n String.implode(List.take(xstr, (slen-1)))\\n end\\n fun collectLines ls s =\\n case TextIO.inputLine s of\\n SOME(l) => collectLines (chomp l::ls) s\\n | NONE => ls\\n in\\n List.rev (collectLines [] strm) before TextIO.closeIn strm\\n end\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"set f [open \\\"foobar.txt\\\"]\\nwhile {[gets $f line] >= 0} {\\n # This loops over every line\\n puts \\\">>$line<<\\\"\\n}\\nclose $f\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"//Create a file object\\n\\n%f = new fileObject();\\n\\n//Open and read a file\\n\\n%f.openForRead(\\\"PATH/PATH.txt\\\");\\n\\nwhile(!%f.isEOF())\\n{\\n\\t//Read each line from our file\\n\\n\\t%line = %f.readLine();\\n}\\n\\n//Close the file object\\n\\n%f.close();\\n\\n//Delete the file object\\n\\n%f.delete();\\n\",\n \"language\": \"TorqueScript\"\n },\n {\n \"code\": \"var f : int\\nopen : f, \\\"rosetta.txt\\\", get\\nloop\\n exit when eof (f)\\n var line: string\\n get : f, line:*\\n put line\\nend loop\\nclose : f\\n\",\n \"language\": \"Turing\"\n },\n {\n \"code\": \"loop\\n exit when eof (1)\\n var line: string\\n get : 1, line:*\\n put line\\nend loop\\n\",\n \"language\": \"Turing\"\n },\n {\n \"code\": \"loop\\n exit when eof\\n var line : string\\n get line:*\\n put line\\nend loop\\n\",\n \"language\": \"Turing\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\n\\ndatei=\\\"rosetta.txt\\\"\\nERROR/STOP OPEN (datei,READ,-std-)\\n\\nACCESS q: READ/RECORDS/UTF8 $datei s,line\\n LOOP\\n READ/NEXT/EXIT q\\n PRINT line\\n ENDLOOP\\nENDACCESS q\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"LOOP line=datei\\n PRINT line\\nENDLOOP\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"#include <Core/Core.h>\\n\\nusing namespace Upp;\\n\\nCONSOLE_APP_MAIN\\n{\\n\\tFileIn in(CommandLine()[0]);\\n\\twhile(in && !in.IsEof())\\n\\t\\tCout().PutLine(in.GetLine());\\n}\\n\",\n \"language\": \"Ultimate++\"\n },\n {\n \"code\": \"# This while loop repeats for each line of the file.\\n# This loop is inside a pipeline; many shells will\\n# run this loop inside a subshell.\\ncat input.txt |\\nwhile IFS= read -r line ; do\\n printf '%s\\\\n' \\\"$line\\\"\\ndone\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"# This loop runs in the current shell, and can read both\\n# the old standard input (fd 1) and input.txt (fd 3).\\nexec 3<input.txt\\nwhile IFS= read -r line <&3 ; do\\n printf '%s\\\\n' \\\"$line\\\"\\ndone\\nexec 3>&-\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"# The old Bourne Shell interprets 'IFS= read' as 'IFS= ; read'.\\n# It requires extra code to restore the original value of IFS.\\nexec 3<input.txt\\noldifs=$IFS\\nwhile IFS= ; read -r line <&3 ; do\\n IFS=$oldifs\\n printf '%s\\\\n' \\\"$line\\\"\\ndone\\nIFS=$oldifs\\nexec 3>&-\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"decl file f\\nf.open \\\"filename.txt\\\"\\nwhile (f.hasline)\\n out (in string f) endl console\\nend while\\n\",\n \"language\": \"Ursa\"\n },\n {\n \"code\": \"import os\\n\\nfn main() {\\n\\tfile := './file.txt'\\n\\tmut content_arr := []string{}\\n\\t\\t\\n\\tif os.is_file(file) == true {\\n\\t\\tcontent_arr << os.read_lines(file) or {\\n\\t\\t\\tprintln('Error: can not read')\\n\\t\\t\\texit(1)\\n\\t\\t}\\n\\t}\\n\\telse {\\n\\t\\tprintln('Error: can not find file')\\n\\t\\texit(1)\\n\\t}\\n\\n\\tfor content in content_arr {\\n\\t\\tif content !='' {\\n\\t\\t\\tprintln(content)\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"public static void main(){\\n\\tvar file = FileStream.open(\\\"foo.txt\\\", \\\"r\\\");\\n\\t\\n\\tstring line = file.read_line();\\n\\twhile (line != null){\\n\\t\\tstdout.printf(\\\"%s\\\\n\\\", line);\\n\\t\\tline = file.read_line();\\n\\t}\\n}\\n\",\n \"language\": \"Vala\"\n },\n {\n \"code\": \"' Read a file line by line\\nSub Main()\\n Dim fInput As String, fOutput As String 'File names\\n Dim sInput As String, sOutput As String 'Lines\\n fInput = \\\"input.txt\\\"\\n fOutput = \\\"output.txt\\\"\\n Open fInput For Input As #1\\n Open fOutput For Output As #2\\n While Not EOF(1)\\n Line Input #1, sInput\\n sOutput = Process(sInput) 'do something\\n Print #2, sOutput\\n Wend\\n Close #1\\n Close #2\\nEnd Sub 'Main\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"FilePath = \\\"<SPECIFY FILE PATH HERE>\\\"\\nSet objFSO = CreateObject(\\\"Scripting.FileSystemObject\\\")\\nSet objFile = objFSO.OpenTextFile(FilePath,1)\\nDo Until objFile.AtEndOfStream\\n\\tWScript.Echo objFile.ReadLine\\nLoop\\nobjFile.Close\\nSet objFSO = Nothing\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"File_Open(\\\"line_by_line.vdm\\\")\\n#10 = Buf_Num // edit buffer for input file\\n#11 = Buf_Free // edit buffer for output\\n#1 = 1 // line number\\nwhile (!At_EOF) {\\n Reg_Copy(20,1) // read one line into text register 20\\n Buf_Switch(#11) // switch to output file\\n Num_Ins(#1++, NOCR) // write line number\\n Ins_Text(\\\" \\\")\\n Reg_Ins(20) // write the line\\n Buf_Switch(#10) // switch to input file\\n Line(1) // next line\\n}\\nBuf_Close(NOMSG) // close the input file\\nBuf_Switch(#11) // show the output\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"' Read a file line by line\\nSub Main()\\n Dim fInput As String, fOutput As String 'File names\\n Dim sInput As String, sOutput As String 'Lines\\n Dim nRecord As Long\\n fInput = \\\"input.txt\\\"\\n fOutput = \\\"output.txt\\\"\\n On Error GoTo InputError\\n Open fInput For Input As #1\\n On Error GoTo 0 'reset error handling\\n Open fOutput For Output As #2\\n nRecord = 0\\n While Not EOF(1)\\n Line Input #1, sInput\\n sOutput = Process(sInput) 'do something\\n nRecord = nRecord + 1\\n Print #2, sOutput\\n Wend\\n Close #1\\n Close #2\\n Exit Sub\\nInputError:\\n MsgBox \\\"File: \\\" & fInput & \\\" not found\\\"\\nEnd Sub 'Main\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"' Read lines from a file\\n'\\n' (c) Copyright 1993 - 2011 Mark Hobley\\n'\\n' This code was ported from an application program written in Microsoft Quickbasic\\n'\\n' This code can be redistributed or modified under the terms of version 1.2 of\\n' the GNU Free Documentation Licence as published by the Free Software Foundation.\\n\\nSub readlinesfromafile()\\n var.filename = \\\"foobar.txt\\\"\\n var.filebuffersize = ini.inimaxlinelength\\n Call openfileread\\n If flg.error = \\\"Y\\\" Then\\n flg.abort = \\\"Y\\\"\\n Exit Sub\\n End If\\n If flg.exists <> \\\"Y\\\" Then\\n flg.abort = \\\"Y\\\"\\n Exit Sub\\n End If\\nreadfilelabela:\\n Call readlinefromfile\\n If flg.error = \\\"Y\\\" Then\\n flg.abort = \\\"Y\\\"\\n Call closestream\\n flg.error = \\\"Y\\\"\\n Exit Sub\\n End If\\n If flg.endoffile <> \\\"Y\\\" Then\\n ' We have a line from the file\\n Print message$\\n GoTo readfilelabela\\n End If\\n ' End of file reached\\n ' Close the file and exit\\n Call closestream\\n Exit Sub\\nEnd Sub\\n\\nSub openfileread()\\n flg.streamopen = \\\"N\\\"\\n Call checkfileexists\\n If flg.error = \\\"Y\\\" Then Exit Sub\\n If flg.exists <> \\\"Y\\\" Then Exit Sub\\n Call getfreestream\\n If flg.error = \\\"Y\\\" Then Exit Sub\\n var.errorsection = \\\"Opening File\\\"\\n var.errordevice = var.filename\\n If ini.errortrap = \\\"Y\\\" Then\\n On Local Error GoTo openfilereaderror\\n End If\\n flg.endoffile = \\\"N\\\"\\n Open var.filename For Input As #var.stream Len = var.filebuffersize\\n flg.streamopen = \\\"Y\\\"\\n Exit Sub\\nopenfilereaderror:\\n var.errorcode = Err\\n Call errorhandler\\n resume '!!\\nEnd Sub\\n\\nPublic Sub checkfileexists()\\n var.errorsection = \\\"Checking File Exists\\\"\\n var.errordevice = var.filename\\n If ini.errortrap = \\\"Y\\\" Then\\n On Local Error GoTo checkfileexistserror\\n End If\\n flg.exists = \\\"N\\\"\\n If Dir$(var.filename, 0) <> \\\"\\\" Then\\n flg.exists = \\\"Y\\\"\\n End If\\n Exit Sub\\ncheckfileexistserror:\\n var.errorcode = Err\\n Call errorhandler\\nEnd Sub\\n\\nPublic Sub getfreestream()\\n var.errorsection = \\\"Opening Free Data Stream\\\"\\n var.errordevice = \\\"\\\"\\n If ini.errortrap = \\\"Y\\\" Then\\n On Local Error GoTo getfreestreamerror\\n End If\\n var.stream = FreeFile\\n Exit Sub\\ngetfreestreamerror:\\n var.errorcode = Err\\n Call errorhandler\\n resume '!!\\nEnd Sub\\n\\nSub closestream()\\n If ini.errortrap = \\\"Y\\\" Then\\n On Local Error GoTo closestreamerror\\n End If\\n var.errorsection = \\\"Closing Stream\\\"\\n var.errordevice = \\\"\\\"\\n flg.resumenext = \\\"Y\\\"\\n Close #var.stream\\n If flg.error = \\\"Y\\\" Then\\n flg.error = \\\"N\\\"\\n '!! Call unexpectederror\\n End If\\n flg.streamopen = \\\"N\\\"\\n Exit Sub\\nclosestreamerror:\\n var.errorcode = Err\\n Call errorhandler\\n resume next\\nEnd Sub\\n\\nPublic Sub errorhandler()\\n tmp$ = btrim$(var.errorsection)\\n tmp2$ = btrim$(var.errordevice)\\n If tmp2$ <> \\\"\\\" Then\\n tmp$ = tmp$ + \\\" (\\\" + tmp2$ + \\\")\\\"\\n End If\\n tmp$ = tmp$ + \\\" : \\\" + Str$(var.errorcode)\\n tmp1% = MsgBox(tmp$, 0, \\\"Error!\\\")\\n flg.error = \\\"Y\\\"\\n If flg.resumenext = \\\"Y\\\" Then\\n flg.resumenext = \\\"N\\\"\\n' Resume Next\\n Else\\n flg.error = \\\"N\\\"\\n' Resume\\n End If\\nEnd Sub\\n\\nPublic Function btrim$(arg$)\\n btrim$ = LTrim$(RTrim$(arg$))\\nEnd Function\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"Imports System.IO\\n\\n ' Loop through the lines of a file.\\n ' Function assumes that the file exists.\\n Private Sub ReadLines(ByVal FileName As String)\\n\\n Dim oReader As New StreamReader(FileName)\\n Dim sLine As String = Nothing\\n\\n While Not oReader.EndOfStream\\n sLine = oReader.ReadLine()\\n ' Do something with the line.\\n End While\\n\\n oReader.Close()\\n\\n End Sub\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"with infile \\\"x\\\"\\n drain (read_line)\\n\",\n \"language\": \"Wart\"\n },\n {\n \"code\": \"import \\\"io\\\" for File\\n\\nvar lines = [] // store lines read\\nFile.open(\\\"input.txt\\\") { |file|\\n var offset = 0\\n var line = \\\"\\\"\\n while(true) {\\n var b = file.readBytes(1, offset)\\n offset = offset + 1\\n if (b == \\\"\\\\n\\\") {\\n lines.add(line)\\n line = \\\"\\\" // reset line variable\\n } else if (b == \\\"\\\\r\\\") { // Windows\\n // wait for following \\\"\\\\n\\\"\\n } else if (b == \\\"\\\") { // end of stream\\n return\\n } else {\\n line = line + b\\n }\\n }\\n}\\n\\nSystem.print(lines.join(\\\"\\\\n\\\")) // print out lines\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"int C;\\n[repeat repeat C:= ChIn(1); \\\\repeat until end-of-line\\n ChOut(0, C);\\n until C < $20; \\\\CR, LF, or EOF\\nuntil C = \\\\EOF\\\\ $1A; \\\\repeat until end-of-file\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"foreach line in (File(\\\"foo.zkl\\\")){print(line)}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"File(\\\"foo.zkl\\\").pump(Console.print)\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"Utils.zipWith(False,fcn(a,b){\\\"%d: %s\\\".fmt(a,b).print()},\\n [0..],File(\\\"foo.zkl\\\",\\\"r\\\"))\\n-->\\n0: var R; n:=GarbageMan.gcCount;\\n1: ref := GarbageMan.WeakRef(String(\\\"the\\\",\\\"quick brown fox\\\"));\\n...\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"10 REM open my file for input\\n20 OPEN #4;\\\"m\\\";1;\\\"MYFILE\\\": REM stream 4 is the first available for general purpose\\n30 INPUT #4; LINE a$: REM a$ will hold our line from the file\\n40 REM because we do not know how many lines are in the file, we need an error trap\\n50 REM to gracefully exit when the file is read. (omitted from this example)\\n60 REM to prevent an error at end of file, place a handler here\\n100 GOTO 30\\n\",\n \"language\": \"ZX-Spectrum-Basic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Read-a-file-line-by-line"}}},{"rowIdx":1567,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Read_a_specific_line_from_a_file\n","language":"00-META"},{"code":"Some languages have special semantics for obtaining a known line number from a file.\n\n\n;Task:\nDemonstrate how to obtain the contents of a specific line within a file. \n\nFor the purpose of this task demonstrate how the contents of the seventh line of a file can be obtained, and store it in a variable or in memory (for potential future use within the program if the code were to become embedded). \n\nIf the file does not contain seven lines, or the seventh line is empty, or too big to be retrieved, output an appropriate message. \n\nIf no special semantics are available for obtaining the required line, it is permissible to read line by line. \n\nNote that empty lines are considered and should still be counted.\n\nAlso note that for functional languages or languages without variables or storage, it is permissible to output the extracted data to standard output.\n<br><br>\n\n","language":"00-TASK"},{"code":"V f = File(‘input.txt’)\nV line = 3\n\nL 0 .< line - 1\n f.read_line()\nprint(f.read_line())\n","language":"11l"},{"code":"BYTE FUNC ReadLine(CHAR ARRAY fname CARD index CHAR ARRAY result)\n CHAR ARRAY line(255)\n CARD curr\n BYTE status,dev=[1]\n\n Close(dev)\n Open(dev,fname,4)\n curr=1 status=1\n WHILE Eof(dev)=0\n DO\n InputSD(dev,line)\n IF curr=index THEN\n SCopy(result,line)\n status=0\n EXIT\n FI\n curr==+1\n OD\n Close(dev)\nRETURN (status)\n\nPROC Test(CHAR ARRAY fname CARD index)\n CHAR ARRAY result(255)\n BYTE status\n\n PrintF(\"Reading %U line...%E\",index)\n status=ReadLine(fname,index,result)\n IF status=0 THEN\n IF result(0)=0 THEN\n PrintF(\"%U line is empty.%E%E\",index)\n ELSE\n PrintF(\"%U line is:%E\"\"%S\"\"%E%E\",index,result)\n FI\n ELSEIF status=1 THEN\n PrintF(\"File contains less than %U lines.%E%E\",index)\n FI\nRETURN\n\nPROC Main()\n CHAR ARRAY fname=\"H6:READ__96.ACT\"\n\n PrintF(\"Reading \"\"%S\"\"...%E%E\",fname)\n Test(fname,7)\n Test(fname,24)\n Test(fname,50)\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\n\nprocedure Rosetta_Read is\n File : File_Type;\nbegin\n Open (File => File,\n Mode => In_File,\n Name => \"rosetta_read.adb\");\n Set_Line (File, To => 7);\n\n declare\n Line_7 : constant String := Get_Line (File);\n begin\n if Line_7'Length = 0 then\n Put_Line (\"Line 7 is empty.\");\n else\n Put_Line (Line_7);\n end if;\n end;\n\n Close (File);\nexception\n when End_Error =>\n Put_Line (\"The file contains fewer than 7 lines.\");\n Close (File);\n when Storage_Error =>\n Put_Line (\"Line 7 is too long to load.\");\n Close (File);\nend Rosetta_Read;\n","language":"Ada"},{"code":"void\nread_line(text &line, text path, integer n)\n{\n file f;\n\n f.affix(path);\n\n call_n(n, f_slip, f);\n\n f.line(line);\n}\n\n\ninteger\nmain(void)\n{\n if (1 < argc()) {\n text line;\n\n read_line(line, argv(1), 6);\n\n o_(\"7th line is:\\n\", line, \"\\n\");\n }\n\n 0;\n}\n","language":"Aime"},{"code":"# reads the line with number \"number\" (counting from 1) #\n# from the file named \"file name\" and returns the text of the #\n# in \"line\". If an error occurs, the result is FALSE and a #\n# message is returned in \"err\". If no error occurs, TRUE is #\n# returned #\nPROC read specific line = ( STRING file name\n , INT number # line 7 #\n , REF STRING line\n , REF STRING err\n )BOOL:\n IF FILE input file;\n line := \"\";\n open( input file, file name, stand in channel ) /= 0\n THEN\n # failed to open the file #\n err := \"Unable to open \"\"\" + file name + \"\"\"\";\n FALSE\n ELSE\n # file opened OK #\n err := \"\";\n BOOL at eof := FALSE;\n # set the EOF handler for the file #\n on logical file end( input file\n , ( REF FILE f )BOOL:\n BEGIN\n # note that we reached EOF on the #\n # latest read #\n at eof := TRUE;\n\n # return TRUE so processing can continue #\n TRUE\n END\n );\n INT line number := 0;\n STRING text;\n WHILE line number < number\n AND NOT at eof\n DO\n get( input file, ( text, newline ) );\n line number +:= 1\n OD;\n # close the file #\n close( input file );\n # return the line or an error message depending on whether #\n # we got a line with the required number or not #\n IF line number = number\n THEN\n # got the required line #\n line := text;\n TRUE\n ELSE\n # not enough lines in the file #\n err := \"\"\"\" + file name + \"\"\" is too short\";\n FALSE\n FI\n FI; # read specific line #\nmain:(\n # read the seventh line of this source and print it #\n # (or an error message if we can't) #\n STRING line;\n STRING err;\n IF read specific line( \"read-specific-line.a68\", 7, line, err )\n THEN\n # got the line #\n print( ( \"line seven is: \"\"\" + line + \"\"\"\", newline ) )\n ELSE\n # got an error #\n print( ( \"unable to read line: \"\"\" + err + \"\"\"\" ) )\n FI\n)\n","language":"ALGOL-68"},{"code":"#include <hopper.h>\n#define MAX_LINE_SIZE 1000\nmain:\n v=0, fd=0\n fsearch(\"-r $'\\n'\",\"archivo.txt\")(v)\n fopen(OPEN_READ,\"archivo.txt\")(fd)\n {\"Line #7 = \"}, fgetsline(fd,MAX_LINE_SIZE,7,v), println\n try\n fgetsline(fd,MAX_LINE_SIZE,10,v),\n catch(e)\n {\"Error search line (code=\",e,\"): \"},get str error\n finish\n println\n fclose(fd)\nexit(0)\n","language":"Amazing-Hopper"},{"code":"lineToRead: 3\n\nlineRead: get read.lines \"myfile.txt\" lineToRead\n\nprint lineRead\n","language":"Arturo"},{"code":"FileReadLine, OutputVar, filename.txt, 7\nif ErrorLevel\n MsgBox, There was an error reading the 7th line of the file\n","language":"AutoHotkey"},{"code":"#!/usr/bin/awk -f\n#usage: readnthline.awk -v lineno=6 filename\n\nFNR==lineno { storedline=$0; found++ }\n\nEND {\n if (found < 1) {\n print \"ERROR: Line\", lineno, \"not found\"\n exit 1\n }\n print storedline\n}\n","language":"AWK"},{"code":"f = freefile\nfilename$ = \"input.txt\"\nopen f, filename$\n\nlineapedida = 7\ncont = 0\nwhile not (eof(f))\n linea$ = readline(f)\n cont += 1\n if cont = lineapedida then\n\tif trim(linea$) = \"\" then print \"The 7th line is empty\" else print linea$\n\texit while\n end if\nend while\nif cont < lineapedida then print \"There are only \"; cont; \" lines in the file\"\nclose f\nend\n","language":"BASIC256"},{"code":"@echo off\n\nfor /f \"skip=6 tokens=*\" %%i in (file.txt) do (\n set line7=%%i\n goto break\n)\n:break\necho Line 7 is: %line7%\npause>nul\n","language":"Batch-File"},{"code":" filepath$ = @lib$ + \"..\\licence.txt\"\n requiredline% = 7\n\n file% = OPENIN(filepath$)\n IF file%=0 ERROR 100, \"File could not be opened\"\n FOR i% = 1 TO requiredline%\n IF EOF#file% ERROR 100, \"File contains too few lines\"\n INPUT #file%, text$\n NEXT\n CLOSE #file%\n\n IF ASCtext$=10 text$ = MID$(text$,2)\n PRINT text$\n","language":"BBC-BASIC"},{"code":"#include <unistd.h>\n#include <sys/types.h>\n#include <sys/mman.h>\n#include <sys/stat.h>\n#include <fcntl.h>\n#include <err.h>\n\n/* following code assumes all file operations succeed. In practice,\n * return codes from open, close, fstat, mmap, munmap all need to be\n * checked for error.\n*/\nint read_file_line(const char *path, int line_no)\n{\n\tstruct stat s;\n\tchar *buf;\n\toff_t start = -1, end = -1;\n\tsize_t i;\n\tint ln, fd, ret = 1;\n\n\tif (line_no == 1) start = 0;\n\telse if (line_no < 1){\n\t\twarn(\"line_no too small\");\n\t\treturn 0; /* line_no starts at 1; less is error */\n\t}\n\n\tline_no--; /* back to zero based, easier */\n\n\tfd = open(path, O_RDONLY);\n\tfstat(fd, &s);\n\n\t/* Map the whole file. If the file is huge (up to GBs), OS will swap\n\t * pages in and out, and because search for lines goes sequentially\n\t * and never accesses more than one page at a time, penalty is low.\n\t * If the file is HUGE, such that OS can't find an address space to map\n\t * it, we got a real problem. In practice one would repeatedly map small\n\t * chunks, say 1MB at a time, and find the offsets of the line along the\n\t * way. Although, if file is really so huge, the line itself can't be\n\t * guaranteed small enough to be \"stored in memory\", so there.\n\t */\n\tbuf = mmap(0, s.st_size, PROT_READ, MAP_PRIVATE, fd, 0);\n\n\t/* optional; if the file is large, tell OS to read ahead */\n\tmadvise(buf, s.st_size, MADV_SEQUENTIAL);\n\n\tfor (i = ln = 0; i < s.st_size && ln <= line_no; i++) {\n\t\tif (buf[i] != '\\n') continue;\n\n\t\tif (++ln == line_no) start = i + 1;\n\t\telse if (ln == line_no + 1) end = i + 1;\n\t}\n\n\tif (start >= s.st_size || start < 0) {\n\t\twarn(\"file does not have line %d\", line_no + 1);\n\t\tret = 0;\n\t} else {\n\t\t/* \tdo something with the line here, like\n\t\twrite(STDOUT_FILENO, buf + start, end - start);\n\t\t\tor copy it out, or something\n\t\t*/\n\t}\n\n\tmunmap(buf, s.st_size);\n\tclose(fd);\n\n\treturn ret;\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n\n#define BUF_SIZE ( 256 )\n\nchar *get_nth_line( FILE *f, int line_no )\n{\n char buf[ BUF_SIZE ];\n size_t curr_alloc = BUF_SIZE, curr_ofs = 0;\n char *line = malloc( BUF_SIZE );\n int in_line = line_no == 1;\n size_t bytes_read;\n\n /* Illegal to ask for a line before the first one. */\n if ( line_no < 1 )\n return NULL;\n\n /* Handle out-of-memory by returning NULL */\n if ( !line )\n return NULL;\n\n /* Scan the file looking for newlines */\n while ( line_no &&\n ( bytes_read = fread( buf, 1, BUF_SIZE, f ) ) > 0 )\n {\n int i;\n\n for ( i = 0 ; i < bytes_read ; i++ )\n {\n if ( in_line )\n {\n if ( curr_ofs >= curr_alloc )\n {\n curr_alloc <<= 1;\n line = realloc( line, curr_alloc );\n\n if ( !line ) /* out of memory? */\n return NULL;\n }\n line[ curr_ofs++ ] = buf[i];\n }\n\n if ( buf[i] == '\\n' )\n {\n line_no--;\n\n if ( line_no == 1 )\n in_line = 1;\n\n if ( line_no == 0 )\n break;\n }\n }\n }\n\n /* Didn't find the line? */\n if ( line_no != 0 )\n {\n free( line );\n return NULL;\n }\n\n /* Resize allocated buffer to what's exactly needed by the string\n and the terminating NUL character. Note that this code *keeps*\n the terminating newline as part of the string.\n */\n line = realloc( line, curr_ofs + 1 );\n\n if ( !line ) /* out of memory? */\n return NULL;\n\n /* Add the terminating NUL. */\n line[ curr_ofs ] = '\\0';\n\n /* Return the line. Caller is responsible for freeing it. */\n return line;\n}\n\n\n/* Test program. Prints out the 7th line of input from stdin, if any */\nint main( int argc, char *argv[] )\n{\n char *line7 = get_nth_line( stdin, 7 );\n\n if ( line7 )\n {\n printf(\"The 7th line of input was:\\n%s\\n\", line7 );\n free( line7 );\n } else\n {\n printf(\"Did not find the 7th line of input. Reason: \");\n if ( feof( stdin ) )\n puts(\"End of file reached.\");\n else if ( ferror( stdin ) )\n puts(\"Error reading input.\");\n else\n puts(\"Out of memory.\");\n }\n\n return 0;\n}\n","language":"C"},{"code":"#include <string>\n#include <fstream>\n#include <iostream>\n\nint main( ) {\n std::cout << \"Which file do you want to look at ?\\n\" ;\n std::string input ;\n std::getline( std::cin , input ) ;\n std::ifstream infile( input.c_str( ) , std::ios::in ) ;\n std::string file( input ) ;\n std::cout << \"Which file line do you want to see ? ( Give a number > 0 ) ?\\n\" ;\n std::getline( std::cin , input ) ;\n int linenumber = std::stoi( input ) ;\n int lines_read = 0 ;\n std::string line ;\n if ( infile.is_open( ) ) {\n while ( infile ) {\n\t getline( infile , line ) ;\n\t lines_read++ ;\n\t if ( lines_read == linenumber ) {\n\t std::cout << line << std::endl ;\n\t break ;\n\t }\n }\n infile.close( ) ;\n if ( lines_read < linenumber )\n\t std::cout << \"No \" << linenumber << \" lines in \" << file << \" !\\n\" ;\n return 0 ;\n }\n else {\n std::cerr << \"Could not find file \" << file << \" !\\n\" ;\n return 1 ;\n }\n}\n","language":"C++"},{"code":"using System;\nusing System.IO;\n\nnamespace GetLine\n{\n internal class Program\n {\n private static void Main(string[] args)\n {\n Console.WriteLine(GetLine(args[0], uint.Parse(args[1])));\n }\n\n private static string GetLine(string path, uint line)\n {\n using (var reader = new StreamReader(path))\n {\n try\n {\n for (uint i = 0; i <= line; i++)\n {\n if (reader.EndOfStream)\n return string.Format(\"There {1} less than {0} line{2} in the file.\", line,\n ((line == 1) ? \"is\" : \"are\"), ((line == 1) ? \"\" : \"s\"));\n\n if (i == line)\n return reader.ReadLine();\n\n reader.ReadLine();\n }\n }\n catch (IOException ex)\n {\n return ex.Message;\n }\n catch (OutOfMemoryException ex)\n {\n return ex.Message;\n }\n }\n\n throw new Exception(\"Something bad happened.\");\n }\n }\n}\n","language":"C-sharp"},{"code":"(defn read-nth-line\n \"Read line-number from the given text file. The first line has the number 1.\"\n [file line-number]\n (with-open [rdr (clojure.java.io/reader file)]\n (nth (line-seq rdr) (dec line-number))))\n","language":"Clojure"},{"code":"(defun read-nth-line (file n &aux (line-number 0))\n \"Read the nth line from a text file. The first line has the number 1\"\n (assert (> n 0) (n))\n (with-open-file (stream file)\n (loop for line = (read-line stream nil nil)\n if (and (null line) (< line-number n))\n do (error \"file ~a is too short, just ~a, not ~a lines long\"\n file line-number n)\n do (incf line-number)\n if (and line (= line-number n))\n do (return line))))\n","language":"Common-Lisp"},{"code":"void main() {\n import std.stdio, std.file, std.string;\n auto file_lines = readText(\"input.txt\").splitLines();\n //file_lines becomes an array of strings, each line is one element\n writeln((file_lines.length > 6) ? file_lines[6] : \"line not found\");\n}\n","language":"D"},{"code":"import std.stdio;\n\nvoid main() {\n int countLines;\n char[] ln;\n auto f = File(\"linenumber.d\", \"r\");\n foreach (char[] line; f.byLine()) {\n countLines++;\n if (countLines == 7) {\n ln = line;\n break;\n }\n }\n switch(countLines) {\n case 0 : writeln(\"the file has zero length\");\n break;\n case 7 : writeln(\"line 7: \", (ln.length ? ln : \"empty\"));\n break;\n default :\n writefln(\"the file only contains %d lines\", countLines);\n }\n}\n","language":"D"},{"code":"program Read_a_specific_line_from_a_file;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils;\n\nfunction ReadLine(position: Cardinal; FileName: TFileName): string;\nbegin\n Result := '';\n\n if not FileExists(FileName) then\n raise Exception.Create('Error: File does not exist.');\n\n var F: TextFile;\n var line: string;\n AssignFile(F, FileName);\n Reset(F);\n for var _ := 1 to position do\n begin\n if Eof(F) then\n begin\n CloseFile(F);\n\n raise Exception.Create(Format('Error: The file \"%s\" is too short. Cannot read line %d',\n [FileName, position]));\n end;\n\n Readln(F, line);\n end;\n CloseFile(F);\n Result := line;\nend;\n\nbegin\n Writeln(ReadLine(7, 'test'));\n Readln;\nend.\n","language":"Delphi"},{"code":"defmodule LineReader do\n def get_line(filename, line) do\n File.stream!(filename)\n |> Stream.with_index\n |> Stream.filter(fn {_value, index} -> index == line-1 end)\n |> Enum.at(0)\n |> print_line\n end\n defp print_line({value, _line_number}), do: String.trim(value)\n defp print_line(_), do: {:error, \"Invalid Line\"}\nend\n","language":"Elixir"},{"code":"-module( read_a_specific_line ).\n\n-export( [from_file/2, task/0] ).\n\nfrom_file( File, N ) -> line_nr( N, read_a_file_line_by_line:into_list(File) ).\n\ntask() ->\n Lines = read_a_file_line_by_line:into_list( \"read_a_specific_line.erl\" ),\n Line_7 = line_nr( 7, Lines ),\n Line_7.\n\n\n\nline_nr( N, Lines ) ->\n try\n case lists:nth( N, Lines )\n of \"\\n\" -> erlang:exit( empty_line )\n ; Line -> Line\n end\n\n catch\n _Type:Error0 ->\n Error = line_nr_error( Error0 ),\n io:fwrite( \"Error: ~p~n\", [Error] ),\n erlang:exit( Error )\n\n end.\n\nline_nr_error( function_clause ) -> too_few_lines_in_file;\nline_nr_error( Error ) -> Error.\n","language":"Erlang"},{"code":"open System\nopen System.IO\n\n[<EntryPoint>]\nlet main args =\n let n = Int32.Parse(args.[1]) - 1\n use r = new StreamReader(args.[0])\n let lines = Seq.unfold (\n fun (reader : StreamReader) ->\n if (reader.EndOfStream) then None\n else Some(reader.ReadLine(), reader)) r\n let line = Seq.nth n lines // Seq.nth throws an ArgumentException,\n // if not not enough lines available\n Console.WriteLine(line)\n 0\n","language":"F-Sharp"},{"code":"USING: continuations fry io io.encodings.utf8 io.files kernel\nmath ;\nIN: rosetta-code.nth-line\n\n: nth-line ( path encoding n -- str/f )\n [ f ] 3dip '[\n [ _ [ drop readln [ return ] unless* ] times ]\n with-return\n ] with-file-reader ;\n\n: nth-line-demo ( -- )\n \"input.txt\" utf8 7 nth-line [ \"line not found\" ] unless*\n print ;\n\nMAIN: nth-line-demo\n","language":"Factor"},{"code":" MODULE SAMPLER !To sample a record from a file. SAM00100\n CONTAINS SAM00200\n CHARACTER*20 FUNCTION GETREC(N,F,IS) !Returns a status. SAM00300\nCareful. Some compilers get confused over the function name's usage. SAM00400\n INTEGER N !The desired record number. SAM00500\n INTEGER F !Of this file. SAM00600\n CHARACTER*(*) IS !Stashed here. SAM00700\n INTEGER I,L !Assistants. SAM00800\n IS = \"\" !Clear previous content, even if null...SAM00900\n IF (N.LE.0) THEN !Start on errors. SAM01000\n WRITE (GETREC,1) \"!No record\",N !Could never be found. SAM01100\n 1 FORMAT (A,1X,I0) !Message, number. SAM01200\n ELSE IF (F.LE.0) THEN !Obviously wrong? SAM01300\n WRITE (GETREC,1) \"!No unit number\",F!Positive is valid. SAM01400\n ELSE IF (LEN(IS).LE.0) THEN !Space awaits? SAM01500\n WRITE (GETREC,1) \"!String size\",LEN(IS) !Nope. SAM01600\n ELSE !Otherwise, there is hope. SAM01700\n REWIND (F) !Clarify the file position. SAM01800\n DO I = 1,N - 1 !Grind up to the desired record. SAM01900\n READ (F,2,END=3) !Ignoring any content. SAM02000\n END DO !Are we there yet? SAM02100\n READ (F,2,END = 3) L,IS(1:MIN(L,LEN(IS))) !At last. SAM02200\n 2 FORMAT (Q,A) !Q = characters yet unread. SAM02300\n IF (L.LT.LEN(IS)) IS(L + 1:) = \"\" !Clear the tail. SAM02400\n IF (L.GT.LEN(IS)) THEN !Now for more silliness.SAM02500\n WRITE (GETREC,1) \"+Length\",L !Too long to fit in IS. SAM02600\n ELSE IF (L.LE.0) THEN !A zero-length record SAM02700\n WRITE (GETREC,1) \"+Null\" !Is not the same SAM02800\n ELSE IF (IS.EQ.\"\") THEN !As a record SAM02900\n WRITE (GETREC,1) \"+Blank\",L !Containing spaces. SAM03000\n ELSE !But otherwise, SAM03100\n WRITE (GETREC,1) \" Length\",L !Note the leading space.SAM03200\n END IF !Righto, we've decided. SAM03300\n END IF !And, no more options. SAM03400\n RETURN !So, done. SAM03500\n 3 WRITE (GETREC,1) \"!End on read\",I !An alternative ending. SAM03600\n END FUNCTION GETREC !That was interesting. SAM03700\n END MODULE SAMPLER !Just a sample of possibility. SAM03800\n SAM03900\n PROGRAM POKE POK00100\n USE SAMPLER POK00200\n INTEGER ENUFF !Some sizes. POK00300\n PARAMETER (ENUFF = 666) !Sufficient? POK00400\n CHARACTER*(ENUFF) STUFF !Lots of memory these days. POK00500\n CHARACTER*20 RESULT POK00600\n INTEGER MSG,F !I/O unit numbers. POK00700\n MSG = 6 !Standard output. POK00800\n F = 10 !Chooose a unit number. POK00900\n WRITE (MSG,*) \" To select record 7 from a disc file.\" POK01000\n POK01100\n WRITE (MSG,*) \"As a FORMATTED file.\" POK01200\n OPEN (F,FILE=\"FileSlurpN.for\",STATUS=\"OLD\",ACTION=\"READ\") POK01300\n RESULT = GETREC(7,F,STUFF) POK01400\n WRITE (MSG,1) \"Result\",RESULT POK01500\n WRITE (MSG,1) \"Record\",STUFF POK01600\n 1 FORMAT (A,\":\",A) POK01700\n POK01800\n CLOSE (F) POK01900\n WRITE (MSG,*) \"As a random-access unformatted file.\" POK02000\n OPEN (F,FILE=\"FileSlurpN.for\",STATUS=\"OLD\",ACTION=\"READ\", POK02100\n 1 ACCESS=\"DIRECT\",FORM=\"UNFORMATTED\",RECL=82) !Not 80! POK02200\n STUFF = \"Cleared.\" POK02300\n READ (F,REC = 7,ERR = 666) STUFF(1:80) POK02400\n WRITE (MSG,1) \"Record\",STUFF(1:80) POK02500\n STOP POK02600\n 666 WRITE (MSG,*) \"Can't get the record!\" POK02700\n END !That was easy. POK02800\n","language":"Fortran"},{"code":"READ (F'7) STUFF(1:80)\n","language":"Fortran"},{"code":" READ (F,REC = 7,ERR = 666, IOSTAT = IOSTAT) STUFF(1:80)\n 666 IF (IOSTAT.NE.0) THEN\n WRITE (MSG,*) \"Can't get the record: code\",IOSTAT\n ELSE\n WRITE (MSG,1) \"Record\",STUFF(1:80)\n END IF\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nOpen \"input.txt\" For Input As #1\nDim line_ As String\nDim count As Integer = 0\nWhile Not Eof(1)\n Line Input #1, line_ '' read each line\n count += 1\n If count = 7 Then\n line_ = Trim(line_, Any !\" \\t\") '' remove any leading or trailing spaces or tabs\n If line_ = \"\" Then\n Print \"The 7th line is empty\"\n Else\n Print \"The 7th line is : \"; line_\n End If\n Exit While\n End If\nWend\nIf count < 7 Then\n Print \"There are only\"; count; \" lines in the file\"\nEnd If\nClose #1\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"nthLine[filename, lineNum] :=\n{\n line = nth[lines[filenameToURL[filename]], lineNum-1]\n if line != undef\n return line\n else\n {\n println[\"The file $filename does not contain a line number $lineNum\"]\n return undef\n }\n}\n","language":"Frink"},{"code":"window 1\n\nlong i = 1\nStr255 s, lineSeven\nCFURLRef url\n\nurl = openpanel 1, @\"Select text file\"\nif ( url )\n open \"I\", 2, url\n while ( not eof(2) )\n line input #2, s\n if ( i == 7 )\n lineSeven = s : break\n end if\n i++\n wend\n close 2\n\n if ( lineSeven[0] )\n print lineSeven\n else\n print \"File did not contain seven lines, or line was empty.\"\n end if\nend if\n\nHandleEvents\n","language":"FutureBasic"},{"code":"package main\n\nimport (\n\t\"bufio\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"os\"\n)\n\nfunc main() {\n\tif line, err := rsl(\"input.txt\", 7); err == nil {\n\t\tfmt.Println(\"7th line:\")\n\t\tfmt.Println(line)\n\t} else {\n\t\tfmt.Println(\"rsl:\", err)\n\t}\n}\n\nfunc rsl(fn string, n int) (string, error) {\n\tif n < 1 {\n\t\treturn \"\", fmt.Errorf(\"invalid request: line %d\", n)\n\t}\n\tf, err := os.Open(fn)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\tdefer f.Close()\n\tbf := bufio.NewReader(f)\n\tvar line string\n\tfor lnum := 0; lnum < n; lnum++ {\n\t\tline, err = bf.ReadString('\\n')\n\t\tif err == io.EOF {\n\t\t\tswitch lnum {\n\t\t\tcase 0:\n\t\t\t\treturn \"\", errors.New(\"no lines in file\")\n\t\t\tcase 1:\n\t\t\t\treturn \"\", errors.New(\"only 1 line\")\n\t\t\tdefault:\n\t\t\t\treturn \"\", fmt.Errorf(\"only %d lines\", lnum)\n\t\t\t}\n\t\t}\n\t\tif err != nil {\n\t\t\treturn \"\", err\n\t\t}\n\t}\n\tif line == \"\" {\n\t\treturn \"\", fmt.Errorf(\"line %d empty\", n)\n\t}\n\treturn line, nil\n}\n","language":"Go"},{"code":"def line = null\nnew File(\"lines.txt\").eachLine { currentLine, lineNumber ->\n if (lineNumber == 7) {\n line = currentLine\n }\n}\nprintln \"Line 7 = $line\"\n","language":"Groovy"},{"code":"main :: IO ()\nmain = do contents <- readFile filename\n case drop 6 $ lines contents of\n [] -> error \"File has less than seven lines\"\n l:_ -> putStrLn l\n where filename = \"testfile\"\n","language":"Haskell"},{"code":"procedure main()\nwrite(readline(\"foo.bar.txt\",7)|\"failed\")\nend\n\nprocedure readline(f,n) # return n'th line of file f\nf := open(\\f,\"r\") | fail # open file\nevery i := n & line := |read(f) \\ n do i -:= 1 # <== here\nclose(f)\nif i = 0 then return line\nend\n","language":"Icon"},{"code":"readLine=: 4 :0\n (x-1) {:: <;.2 ] 1!:1 boxxopen y\n)\n","language":"J"},{"code":"$ cal 2011 > cal.txt\n","language":"J"},{"code":" 7 readLine 'cal.txt'\n 9 10 11 12 13 14 15 13 14 15 16 17 18 19 13 14 15 16 17 18 19\n","language":"J"},{"code":"require 'files' NB. required for versions before J701\nreadLineT=: <:@[ {:: 'b'&freads@]\n","language":"J"},{"code":"package linenbr7;\n\nimport java.io.*;\n\npublic class LineNbr7 {\n\n public static void main(String[] args) throws Exception {\n File f = new File(args[0]);\n if (!f.isFile() || !f.canRead())\n throw new IOException(\"can't read \" + args[0]);\n\n BufferedReader br = new BufferedReader(new FileReader(f));\n try (LineNumberReader lnr = new LineNumberReader(br)) {\n String line = null;\n int lnum = 0;\n while ((line = lnr.readLine()) != null\n && (lnum = lnr.getLineNumber()) < 7) {\n }\n\n switch (lnum) {\n case 0:\n System.out.println(\"the file has zero length\");\n break;\n case 7:\n boolean empty = \"\".equals(line);\n System.out.println(\"line 7: \" + (empty ? \"empty\" : line));\n break;\n default:\n System.out.println(\"the file has only \" + lnum + \" line(s)\");\n }\n }\n }\n}\n","language":"Java"},{"code":"import java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\n\npublic final class ReadSpecificLineFromFile {\n\n\tpublic static void main(String[] aArgs) throws IOException {\n\t\tString fileName = \"input.txt\";\n\t\tPath filePath = Path.of(fileName);\n\t\t\n\t\tString seventhLine = Files.lines(filePath).skip(6).findFirst().orElse(ERROR_TOO_FEW_LINES);\n\t\t\n\t\tString messageToUser = seventhLine.isBlank() ? ERROR_EMPTY_LINE : seventhLine;\n\t\tSystem.out.println(messageToUser);\t\t\n\t}\t\n\t\n\tprivate static final String ERROR_TOO_FEW_LINES = \"File has fewer than 7 lines\";\n\tprivate static final String ERROR_EMPTY_LINE = \"Line 7 is empty\";\n\n}\n","language":"Java"},{"code":"# Input - a line number to read, counting from 1\n# Output - a stream with 0 or 1 items\ndef read_line:\n . as $in\n | label $top\n | foreach inputs as $line\n (0; .+1; if . == $in then $line, break $top else empty end) ;\n","language":"Jq"},{"code":"$line | tonumber\n| if . > 0 then read_line\n else \"$line (\\(.)) should be a non-negative integer\"\n end\n","language":"Jq"},{"code":"$ jq -n -r 'range(0;20) | tostring' | jq --arg line 10 -n -R -r -f Read_a_specific_line_from_a_file.jq\n9\n","language":"Jq"},{"code":"open(readlines, \"path/to/file\")[7]\n","language":"Julia"},{"code":"function read_nth_lines(stream, num)\n for i = 1:num-1\n readline(stream)\n end\n result = readline(stream)\n print(result != \"\" ? result : \"No such line.\")\nend\n","language":"Julia"},{"code":"(0:\"135-0.txt\")7\n\"will have to check the laws of the country where you are located before\\r\"\n","language":"K"},{"code":"(0:\"135-0.txt\")7-1\n\"www.gutenberg.org. If you are not located in the United States, you\\r\"\n","language":"K"},{"code":"// version 1.1.2\n\nimport java.io.File\n\nfun main(args: Array<String>) {\n /* The following code reads the whole file into memory\n and so should not be used for large files\n which should instead be read line by line until the\n desired line is reached */\n\n val lines = File(\"input.txt\").readLines()\n if (lines.size < 7)\n println(\"There are only ${lines.size} lines in the file\")\n else {\n val line7 = lines[6].trim()\n if (line7.isEmpty())\n println(\"The seventh line is empty\")\n else\n println(\"The seventh line is : $line7\")\n }\n}\n\n/* Note that 'input.txt' contains the eight lines:\nLine 1\nLine 2\nLine 3\nLine 4\nLine 5\nLine 6\nLine 7\nLine 8\n*/\n","language":"Kotlin"},{"code":"local(f) = file('unixdict.txt')\nhandle => { #f->close }\nlocal(this_line = string,line = 0)\n#f->forEachLine => {\n\t#line++\n\t#line == 7 ? #this_line = #1\n\t#line == 7 ? loop_abort\n}\n#this_line // 6th, which is the 7th line in the file\n","language":"Lasso"},{"code":"fileName$ =\"F:\\sample.txt\"\nrequiredLine =7\n\nopen fileName$ for input as #i\n f$ =input$( #i, lof( #i))\nclose #i\n\nline7$ =word$( f$, 7, chr$( 13))\nif line7$ =chr$( 13) +chr$( 10) or line7$ =\"\" then notice \"Empty line! ( or file has fewer lines).\"\n\nprint line7$\n","language":"Liberty-BASIC"},{"code":"function fileLine (lineNum, fileName)\n local count = 0\n for line in io.lines(fileName) do\n count = count + 1\n if count == lineNum then return line end\n end\n error(fileName .. \" has fewer than \" .. lineNum .. \" lines.\")\nend\n\nprint(fileLine(7, \"test.txt\"))\n","language":"Lua"},{"code":"path := \"file.txt\":\nspecificLine := proc(path, num)\n\tlocal i, input:\n\tfor i to num do\n\t\tinput := readline(path):\n\t\tif input = 0 then break; end if:\n\tend do:\n\tif i = num+1 then printf(\"Line %d, %s\", num, input):\n\telif i <= num then printf (\"Line number %d is not reached\",num): end if:\nend proc:\n","language":"Maple"},{"code":" If[# != EndOfFile , Print[#]]& @ ReadList[\"file\", String, 7]\n","language":"Mathematica"},{"code":" eln = 7; % extract line number 7\n line = '';\n fid = fopen('foobar.txt','r');\n if (fid < 0)\n\tprintf('Error:could not open file\\n')\n else\n n = 0;\n\twhile ~feof(fid),\n n = n + 1;\n if (n ~= eln),\n fgetl(fid);\n else\n line = fgetl(fid);\n end\n\tend;\n fclose(fid);\n end;\n printf('line %i: %s\\n',eln,line);\n","language":"MATLAB"},{"code":"iter = io.lines 'test.txt'\nfor i=0, 5\n error 'Not 7 lines in file' if not iter!\n\nprint iter!\n","language":"MoonScript"},{"code":"def getline(fname, linenum)\n\tcontents = null\n\ttry\n\t\tcontents = new(Nanoquery.IO.File).read()\n\t\treturn contents[linenum]\n\tcatch\n\t\tif contents = null\n\t\t\tthrow new(Exception, \"unable to read from file '\" + fname + \"'\")\n\t\telse\n\t\t\tthrow new(Exception, \"unable to retrieve line \" + linenum + \" from file: not enough lines\")\n\t\tend\n\tend\nend\n","language":"Nanoquery"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary\n\nparse arg inFileName lineNr .\n\nif inFileName = '' | inFileName = '.' then inFileName = './data/input.txt'\nif lineNr = '' | lineNr = '.' then lineNr = 7\n\ndo\n lineTxt = readLine(inFileName, lineNr)\n say '<textline number=\"'lineNr.right(5, 0)'\">'lineTxt'</textline>'\ncatch ex = Exception\n ex.printStackTrace()\nend\n\nreturn\n\n-- =============================================================================\n-- NetRexx/Java programs don't have a special mechanism to seek to a specified line number\n-- the simple solution is to iterate through file. (Costly for very large files)\nmethod readLine(inFileName, lineNr) public static signals IOException, FileNotFoundException\n\n lineReader = LineNumberReader(FileReader(File(inFileName)))\n notFound = isTrue\n lineTxt = ''\n loop label reading forever\n line = lineReader.readLine()\n select\n when lineReader.getLineNumber() = lineNr then do\n lineTxt = line\n notFound = isFalse\n leave reading -- terminate I/O loop\n end\n when line = null then do\n leave reading -- terminate I/O loop\n end\n otherwise nop\n end\n finally\n lineReader.close()\n end reading\n\n if notFound then signal RuntimeException('File' inFileName 'does not contain line' lineNr.right(5))\n\n return lineTxt\n\n-- =============================================================================\nmethod isTrue() public static returns boolean\n return 1 == 1\n-- =============================================================================\nmethod isFalse() public static returns boolean\n return \\(1 == 1)\n","language":"NetRexx"},{"code":"import strformat\n\nproc readLine(f: File; num: Positive): string =\n for n in 1..num:\n try:\n result = f.readLine()\n except EOFError:\n raise newException(IOError, &\"Not enough lines in file; expected {num}, found {n - 1}.\")\n\nlet f = open(\"test.txt\", fmRead)\necho f.readLine(7)\nf.close()\n","language":"Nim"},{"code":"let input_line_opt ic =\n try Some (input_line ic)\n with End_of_file -> None\n\nlet nth_line n filename =\n let ic = open_in filename in\n let rec aux i =\n match input_line_opt ic with\n | Some line ->\n if i = n then begin\n close_in ic;\n (line)\n end else aux (succ i)\n | None ->\n close_in ic;\n failwith \"end of file reached\"\n in\n aux 1\n\nlet () =\n print_endline (nth_line 7 Sys.argv.(1))\n","language":"OCaml"},{"code":"uses stringutil\nnew Textarray t\nt.load \"t.txt\"\nprint t.line 7\n' print t.lineCount\ndel t\n","language":"OxygenBasic"},{"code":"Program FileTruncate;\n\nuses\n SysUtils;\n\nconst\n filename = 'test';\n position = 7;\n\nvar\n myfile: text;\n line: string;\n counter: integer;\n\nbegin\n if not FileExists(filename) then\n begin\n writeln('Error: File does not exist.');\n exit;\n end;\n\n Assign(myfile, filename);\n Reset(myfile);\n counter := 0;\n Repeat\n if eof(myfile) then\n begin\n writeln('Error: The file \"', filename, '\" is too short. Cannot read line ', position);\n Close(myfile);\n exit;\n end;\n inc(counter);\n readln(myfile);\n until counter = position - 1;\n readln(myfile, line);\n Close(myfile);\n writeln(line);\nend.\n","language":"Pascal"},{"code":"#!/usr/bin/perl -s\n# invoke as <scriptname> -n=7 [input]\nwhile (<>) { $. == $n and print, exit }\ndie \"file too short\\n\";\n","language":"Perl"},{"code":"-->\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">lines</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">get_text</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"TEST.TXT\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">GT_LF_STRIPPED</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #004080;\">sequence</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lines</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lines</span><span style=\"color: #0000FF;\">)>=</span><span style=\"color: #000000;\">7</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">lines</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"no line 7\"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n<!--\n","language":"Phix"},{"code":"-->\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">fn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">open</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"TEST.TXT\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"r\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">6</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #0000FF;\">{}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">gets</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">gets</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (shows -1 if past eof)</span>\n <span style=\"color: #7060A8;\">close</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"include ..\\Utilitys.pmt\n\nargument 1 get \"r\" fopen var f drop\n0\n7 for\n f fgets number? if f fclose exitfor else nip nip endif\nendfor\nprint /# show -1 if past eof #/\n","language":"Phixmonti"},{"code":"<?php\n $DOCROOT = $_SERVER['DOCUMENT_ROOT'];\n\n function fileLine ($lineNum, $file) {\n $count = 0;\n while (!feof($file)) {\n $count++;\n $line = fgets($file);\n if ($count == $lineNum) return $line;\n }\n die(\"Requested file has fewer than \".$lineNum.\" lines!\");\n }\n\n @ $fp = fopen(\"$DOCROOT/exercises/words.txt\", 'r');\n if (!$fp) die(\"Input file not found!\");\n echo fileLine(7, $fp);\n?>\n","language":"PHP"},{"code":"(in \"file.txt\"\n (do 6 (line))\n (or (line) (quit \"No 7 lines\")) )\n","language":"PicoLisp"},{"code":"declare text character (1000) varying, line_no fixed;\n\nget (line_no);\non endfile (f) begin;\n put skip list ('the specified line does not exist');\n go to next;\nend;\n\nget file (f) edit ((text do i = 1 to line_no)) (L);\n\nput skip list (text);\nnext: ;\n","language":"PL-I"},{"code":"100H: /* READ A SPECIFIC LINE FROM A FILE */\n\n DECLARE FALSE LITERALLY '0', TRUE LITERALLY '0FFH';\n DECLARE NL$CHAR LITERALLY '0AH'; /* NEWLINE: CHAR 10 */\n DECLARE EOF$CHAR LITERALLY '26'; /* EOF: CTRL-Z */\n /* CP/M BDOS SYSTEM CALL, RETURNS A VALUE */\n BDOS: PROCEDURE( FN, ARG )BYTE; DECLARE FN BYTE, ARG ADDRESS; GOTO 5; END;\n /* CP/M BDOS SYSTEM CALL, NO RETURN VALUE */\n BDOS$P: PROCEDURE( FN, ARG ); DECLARE FN BYTE, ARG ADDRESS; GOTO 5; END;\n EXIT: PROCEDURE; CALL BDOS$P( 0, 0 ); END; /* CP/M SYSTEM RESET */\n PR$CHAR: PROCEDURE( C ); DECLARE C BYTE; CALL BDOS$P( 2, C ); END;\n PR$STRING: PROCEDURE( S ); DECLARE S ADDRESS; CALL BDOS$P( 9, S ); END;\n PR$NL: PROCEDURE; CALL PR$STRING( .( 0DH, NL$CHAR, '$' ) ); END;\n PR$NUMBER: PROCEDURE( N ); /* PRINTS A NUMBER IN THE MINIMUN FIELD WIDTH */\n DECLARE N ADDRESS;\n DECLARE V ADDRESS, N$STR ( 6 )BYTE, W BYTE;\n V = N;\n W = LAST( N$STR );\n N$STR( W ) = '$';\n N$STR( W := W - 1 ) = '0' + ( V MOD 10 );\n DO WHILE( ( V := V / 10 ) > 0 );\n N$STR( W := W - 1 ) = '0' + ( V MOD 10 );\n END;\n CALL PR$STRING( .N$STR( W ) );\n END PR$NUMBER;\n FL$EXISTS: PROCEDURE( FCB )BYTE; /* RETURNS TRUE IF THE FILE NAMED IN THE */\n DECLARE FCB ADDRESS; /* FCB EXISTS */\n RETURN ( BDOS( 17, FCB ) < 4 );\n END FL$EXISTS ;\n FL$OPEN: PROCEDURE( FCB )BYTE; /* OPEN THE FILE WITH THE SPECIFIED FCB */\n DECLARE FCB ADDRESS;\n RETURN ( BDOS( 15, FCB ) < 4 );\n END FL$OPEN;\n FL$READ: PROCEDURE( FCB )BYTE; /* READ THE NEXT RECORD FROM FCB */\n DECLARE FCB ADDRESS;\n RETURN ( BDOS( 20, FCB ) = 0 );\n END FL$READ;\n FL$CLOSE: PROCEDURE( FCB )BYTE; /* CLOSE THE FILE WITH THE SPECIFIED FCB */\n DECLARE FCB ADDRESS;\n RETURN ( BDOS( 16, FCB ) < 4 );\n END FL$CLOSE;\n\n PR$BYTE: PROCEDURE( B ); /* PRINT B EITHER AS A CHAR OR IN HEX */\n DECLARE B BYTE;\n PR$HEX: PROCEDURE( H ); /* PRINT A HEX DIGIT */\n DECLARE H BYTE;\n IF H < 10 THEN CALL PR$CHAR( H + '0' );\n ELSE CALL PR$CHAR( ( H - 10 ) + 'A' );\n END PR$HEX;\n IF B >= ' ' AND B < 7FH AND B <> '$' THEN DO;\n /* PRINTABLE CHAR AND NOT A $, SHOW AS A CHARACTER */\n CALL PR$CHAR( B );\n END;\n ELSE DO;\n /* NON-PRINTING CHAR OR $ - SHOW IN HEX */\n CALL PR$CHAR( '$' );\n CALL PR$HEX( SHR( B, 4 ) );\n CALL PR$HEX( B AND 0FH );\n END;\n END PR$BYTE;\n\n /* I/O USES FILE CONTROL BLOCKS CONTAINING THE FILE-NAME, POSITION, ETC. */\n /* WHEN THE PROGRAM IS RUN, THE CCP WILL FIRST PARSE THE COMMAND LINE AND */\n /* PUT THE FIRST PARAMETER IN FCB1, THE SECOND PARAMETER IN FCB2 */\n /* BUT FCB2 OVERLAYS THE END OF FCB1 AND THE DMA BUFFER OVERLAYS THE END */\n /* OF FCB2, SO WE NEED TO GET THE LINE NUMBER FROM FCB2 FIRST */\n\n DECLARE FCB$SIZE LITERALLY '36'; /* SIZE OF A FCB */\n DECLARE FCB1 LITERALLY '5CH'; /* ADDRESS OF FIRST FCB */\n DECLARE FCB2 LITERALLY '6CH'; /* ADDRESS OF SECOND FCB */\n DECLARE DMA$BUFFER LITERALLY '80H'; /* DEFAULT DMA BUFFER ADDRESS */\n DECLARE DMA$SIZE LITERALLY '128'; /* SIZE OF THE DMA BUFFER */\n\n DECLARE F$PTR ADDRESS, F$CHAR BASED F$PTR BYTE;\n\n /* GET THE LINE NUMBER FROM THE SECOND PARAMETER */\n DECLARE LINE$NUMBER ADDRESS;\n LINE$NUMBER = 0;\n DO F$PTR = FCB2 + 1 TO FCB2 + 8;\n IF F$CHAR >= '0' AND F$CHAR <= '9' THEN DO;\n LINE$NUMBER = ( LINE$NUMBER * 10 ) + ( F$CHAR - '0' );\n END;\n END;\n /* CLEAR THE PARTS OF FCB1 OVERLAYED BY FCB2 */\n DO F$PTR = FCB1 + 12 TO FCB1 + ( FCB$SIZE - 1 );\n F$CHAR = 0;\n END;\n\n /* SHOW THE REQUIRED LINE FROM THE FILE, IF THE FILE AND LINE EXIST */\n IF NOT FL$EXISTS( FCB1 ) THEN DO; /* THE FILE DOES NOT EXIST */\n CALL PR$STRING( .'FILE NOT FOUND$' );CALL PR$NL;\n END;\n ELSE IF NOT FL$OPEN( FCB1 ) THEN DO; /* UNABLE TO OPEN THE FILE */\n CALL PR$STRING( .'UNABLE TO OPEN THE FILE$' );CALL PR$NL;\n END;\n ELSE DO; /* FILE EXISTS AND OPENED OK - ATTEMPT TO FIND THE LINE */\n DECLARE LN ADDRESS, GOT$RCD BYTE, GOT$LINE BYTE, DMA$END ADDRESS;\n DMA$END = DMA$BUFFER + ( DMA$SIZE - 1 );\n GOT$RCD = FL$READ( FCB1 ); /* GET THE FIRST RECORD */\n GOT$LINE = FALSE;\n F$PTR = DMA$BUFFER;\n LN = 1;\n CALL PR$NUMBER( LINE$NUMBER ); CALL PR$STRING( .': <$' );\n DO WHILE( GOT$RCD AND LN <= LINE$NUMBER );\n IF F$PTR > DMA$END THEN DO;\n /* AT THE END OF THE BUFFER - GET THE NEXT RECORD */\n GOT$RCD = FL$READ( FCB1 );\n F$PTR = DMA$BUFFER;\n END;\n ELSE IF F$CHAR = NL$CHAR THEN DO; /* END OF LINE */\n LN = LN + 1;\n IF LN = LINE$NUMBER THEN GOT$LINE = TRUE;\n END;\n ELSE IF F$CHAR = EOF$CHAR THEN GOT$RCD = FALSE; /* END OF FILE */\n ELSE IF LN = LINE$NUMBER THEN CALL PR$BYTE( F$CHAR );\n F$PTR = F$PTR + 1;\n END;\n CALL PR$CHAR( '>' ); CALL PR$NL;\n /* SHOULD NOW HAVE EOF OR THE END OF THE REQUIRED LINE */\n IF NOT GOT$LINE THEN DO;\n /* COULDN'T READ THE SPECIFIED LINE */\n CALL PR$STRING( .'CANNOT READ LINE $' );\n CALL PR$NUMBER( LINE$NUMBER );\n END;\n /* CLOSE THE FILE */\n IF NOT FL$CLOSE( FCB1 ) THEN DO;\n CALL PR$STRING( .'UNABLE TO CLOSE THE FILE$' ); CALL PR$NL;\n END;\n END;\n\n CALL EXIT;\n\nEOF\n","language":"PL-M"},{"code":"$file = Get-Content c:\\file.txt\nif ($file.count -lt 7)\n{Write-Warning \"The file is too short!\"}\nelse\n{\n $file | Where Readcount -eq 7 | set-variable -name Line7\n}\n","language":"PowerShell"},{"code":"Structure lineLastRead\n lineRead.i\n line.s\nEndStructure\n\nProcedure readNthLine(file, n, *results.lineLastRead)\n *results\\lineRead = 0\n While *results\\lineRead < n And Not Eof(file)\n *results\\line = ReadString(file)\n *results\\lineRead + 1\n Wend\n\n If *results\\lineRead = n\n ProcedureReturn 1\n EndIf\nEndProcedure\n\nDefine filename.s = OpenFileRequester(\"Choose file to read a line from\", \"*.*\", \"All files (*.*)|*.*\", 0)\nIf filename\n Define file = ReadFile(#PB_Any, filename)\n If file\n Define fileReadResults.lineLastRead, lineToRead = 7\n If readNthLine(file, lineToRead, fileReadResults)\n MessageRequester(\"Results\", fileReadResults\\line)\n Else\n MessageRequester(\"Error\", \"There are less than \" + Str(lineToRead) + \" lines in file.\")\n EndIf\n CloseFile(file)\n Else\n MessageRequester(\"Error\", \"Couldn't open file \" + filename + \".\")\n EndIf\nEndIf\n","language":"PureBasic"},{"code":"with open('xxx.txt') as f:\n for i, line in enumerate(f):\n if i == 6:\n break\n else:\n print('Not 7 lines in file')\n line = None\n","language":"Python"},{"code":"from itertools import islice\n\nwith open('xxx.txt') as f:\n try:\n line = next(islice(f, 6, 7))\n except StopIteration:\n print('Not 7 lines in file')\n","language":"Python"},{"code":"print open('xxx.txt').readlines()[:7][-1]\n","language":"Python"},{"code":"f = FREEFILE\nOPEN \"input.txt\" FOR INPUT AS #f\n\nlineapedida = 7\ncont = 0\nDO WHILE NOT EOF(f)\n LINE INPUT #f, linea$\n cont = cont + 1\n IF cont = lineapedida THEN\n IF linea$ = \"\" THEN PRINT \"The 7th line is empty\" ELSE PRINT linea$\n EXIT DO\n END IF\nLOOP\nIF cont < lineapedida THEN PRINT \"There are only \"; cont; \" lines in the file\"\nCLOSE #1\n","language":"QBasic"},{"code":"> seven <- scan('hw.txt', '', skip = 6, nlines = 1, sep = '\\n') # too short\nRead 0 items\n> seven <- scan('Incoming/quotes.txt', '', skip = 6, nlines = 1, sep = '\\n')\nRead 1 item\n","language":"R"},{"code":"#lang racket\n\n;; simple, but reads the whole file\n(define s1 (list-ref (file->lines \"some-file\") 6))\n\n;; more efficient: read and discard n-1 lines\n(define s2\n (call-with-input-file \"some-file\"\n (λ(i) (for/last ([line (in-lines i)] [n 7]) line))))\n","language":"Racket"},{"code":"say lines[6] // die \"Short file\";\n","language":"Raku"},{"code":"x: pick read/lines request-file/only 7\neither x [print x] [print \"No seventh line\"]\n","language":"REBOL"},{"code":">> x: pick read/lines %file.txt 7\n\ncase [\n x = none [print \"File has less than seven lines\"]\n (length? x) = 0 [print \"Line 7 is empty\"]\n (length? x) > 0 [print append \"Line seven = \" x]\n]\n","language":"Red"},{"code":"/*REXX program reads a specific line from a file (and displays the length and content).*/\nparse arg FID n . /*obtain optional arguments from the CL*/\nif FID=='' | FID==\",\" then FID= 'JUNK.TXT' /*not specified? Then use the default.*/\nif n=='' | n==\",\" then n=7 /* \" \" \" \" \" \" */\n\nif lines(FID)==0 then call ser \"wasn't found.\" /*see if the file exists (or not). */\n\ncall linein FID, n-1 /*read the record previous to N. */\nif lines(FID)==0 then call ser \"doesn't contain\" N 'lines.'\n /* [↑] any more lines to read in file?*/\n\n$=linein(FID) /*read the Nth record in the file. */\n\nsay 'File ' FID \" line \" N ' has a length of: ' length($)\nsay 'File ' FID \" line \" N 'contents: ' $ /*display the contents of the Nth line.*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nser: say; say '***error!*** File ' FID \" \" arg(1); say; exit 13\n","language":"REXX"},{"code":"/*REXX program reads a specific line from a file (and displays the length and content).*/\nparse arg FID n . /*obtain optional arguments from the CL*/\nif FID=='' | FID==\",\" then FID= 'JUNK.TXT' /*not specified? Then use the default.*/\nif n=='' | n==\",\" then n=7 /* \" \" \" \" \" \" */\n\nif lines(FID)==0 then call ser \"wasn't found.\" /*see if the file exists (or not). */\n\n do n-1\n call linein FID /*read all the lines previous to N. */\n end /*n-1*/\n\nif lines(FID)==0 then call ser \"doesn't contain\" N 'lines.'\n /* [↑] any more lines to read in file?*/\n\n$=linein(FID) /*read the Nth record in the file. */\n\nsay 'File ' FID \" line \" N ' has a length of: ' length($)\nsay 'File ' FID \" line \" N 'contents: ' $ /*display the contents of the Nth line.*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nser: say; say '***error!*** File ' FID \" \" arg(1); say; exit 13\n","language":"REXX"},{"code":"fp = fopen(\"C:\\Ring\\ReadMe.txt\",\"r\")\nn = 0\n\nr = \"\"\nwhile isstring(r)\n while n < 8\n r = fgetc(fp)\n if r = char(10) n++ see nl\n else see r ok\n end\nend\nfclose(fp)\n","language":"Ring"},{"code":" seventh_line = open(\"/etc/passwd\").each_line.take(7).last\n","language":"Ruby"},{"code":"fileName$ = \"f:\\sample.txt\"\nrequiredLine = 7\nopen fileName$ for input as #f\n\nfor i = 1 to requiredLine\n if not(eof(#f)) then line input #f, a$\nnext i\nclose #f\nprint a$\nend\n","language":"Run-BASIC"},{"code":"use std::fs::File;\nuse std::io::BufRead;\nuse std::io::BufReader;\nuse std::io::Error;\nuse std::path::Path;\n\nfn main() {\n let path = Path::new(\"file.txt\");\n let line_num = 7usize;\n let line = get_line_at(&path, line_num - 1);\n println!(\"{}\", line.unwrap());\n}\n\nfn get_line_at(path: &Path, line_num: usize) -> Result<String, Error> {\n let file = File::open(path).expect(\"File not found or cannot be opened\");\n let content = BufReader::new(&file);\n let mut lines = content.lines();\n lines.nth(line_num).expect(\"No line found at that position\")\n}\n","language":"Rust"},{"code":"use std::env;\nuse std::fs::File;\nuse std::io::BufRead;\nuse std::io::BufReader;\nuse std::path::Path;\n\nfn main() {\n if env::args().len() <= 1 {\n println!(\"At least a path to a file is needed: No file path given\");\n return;\n } else {\n let path = &env::args().nth(1).expect(\"could not parse the path\");\n let path = Path::new(&path);\n let mut line_num = 1usize;\n if let Some(arg) = env::args().nth(2) {\n line_num = arg.parse::<usize>().expect(\"Parsing line number failed\");\n }\n print_line_at(&path, line_num);\n }\n}\n\nfn print_line_at(path: &Path, line_num: usize) {\n if line_num < 1 {\n panic!(\"Line number has to be > 0\");\n }\n let line_num = line_num - 1;\n let file = File::open(path).expect(\"File not found or cannot be opened\");\n let content = BufReader::new(&file);\n let mut lines = content.lines();\n let line = lines.nth(line_num).expect(\"No line found at given position\");\n println!(\"{}\", line.expect(\"None line\"));\n}\n","language":"Rust"},{"code":"val lines = io.Source.fromFile(\"input.txt\").getLines\nval seventhLine = lines drop(6) next\n","language":"Scala"},{"code":"var lines: Iterator[String] = _\ntry {\n lines = io.Source.fromFile(\"input.txt\").getLines drop(6)\n} catch {\n case exc: java.io.IOException =>\n println(\"File not found\")\n}\nvar seventhLine: String = _\nif (lines != null) {\n if (lines.isEmpty) println(\"too few lines in file\")\n else seventhLine = lines next\n}\nif (\"\" == seventhLine) println(\"line is empty\")\n","language":"Scala"},{"code":"val file = try Left(io.Source.fromFile(\"input.txt\")) catch {\n case exc => Right(exc.getMessage)\n}\nval seventhLine = (for(f <- file.left;\n line <- f.getLines.toStream.drop(6).headOption.toLeft(\"too few lines\").left) yield\n if (line == \"\") Right(\"line is empty\") else Left(line)).joinLeft\n","language":"Scala"},{"code":"sed -n 7p\n","language":"Sed"},{"code":"sed '7h;$!d;x;s/^$/Error: no such line/'\n","language":"Sed"},{"code":"$ include \"seed7_05.s7i\";\n\nconst func string: getLine (inout file: aFile, in var integer: lineNum) is func\n result\n var string: line is \"\";\n begin\n while lineNum > 1 and hasNext(aFile) do\n readln(aFile);\n decr(lineNum);\n end while;\n line := getln(aFile);\n end func;\n\nconst proc: main is func\n local\n var string: fileName is \"input.txt\";\n var file: aFile is STD_NULL;\n var string: line is \"\";\n begin\n aFile := open(fileName, \"r\");\n if aFile = STD_NULL then\n writeln(\"Cannot open \" <& fileName);\n else\n line := getLine(aFile, 7);\n if eof(aFile) then\n writeln(\"The file does not have 7 lines\");\n else\n writeln(\"The 7th line of the file is:\");\n writeln(line);\n end if;\n end if;\n end func;\n","language":"Seed7"},{"code":"put line 7 of file \"example.txt\" into theLine\n","language":"SenseTalk"},{"code":"func getNthLine(filename, n) {\n var file = File(filename)\n file.open_r.each { |line|\n Num($.) == n && return line\n }\n warn \"file #{file} does not have #{n} lines, only #{$.}\\n\"\n return nil\n}\n\nvar line = getNthLine(\"/etc/passwd\", 7)\nsay line if defined(line)\n","language":"Sidef"},{"code":"line := (StandardFileStream oldFileNamed: 'test.txt') contents lineNumber: 7.\n","language":"Smalltalk"},{"code":"lines = #.readlines(\"test.txt\")\n#.output(\"Seventh line of text:\")\n? #.size(lines,1)<7\n #.output(\"is absent\")\n!\n #.output(lines[7])\n.\n","language":"SPL"},{"code":"* Read rows 20 to 30 from somedata.dta\n. use somedata in 20/30, clear\n\n* Read rows for which the variable x is positive\n. use somedata if x>0, clear\n","language":"Stata"},{"code":"capture use somedata in 7, clear\nif _rc {\n\tdisplay \"Too few lines\"\n}\n","language":"Stata"},{"code":"proc getNthLineFromFile {filename n} {\n set f [open $filename]\n while {[incr n -1] > 0} {\n if {[gets $f line] < 0} {\n close $f\n error \"no such line\"\n }\n }\n close $f\n return $line\n}\n\nputs [getNthLineFromFile example.txt 7]\n","language":"Tcl"},{"code":"LET filename$ = \"input.txt\"\nOPEN #1: NAME filename$, ORG TEXT, ACCESS INPUT, CREATE OLD\n\nLET lineapedida = 7\nLET cont = 0\nDO\n LINE INPUT #1: linea$\n LET cont = cont + 1\n IF cont = lineapedida THEN\n IF TRIM$(linea$) = \"\" THEN PRINT \"The 7th line is empty\" ELSE PRINT linea$\n EXIT DO\n END IF\nLOOP UNTIL END #1\nIF cont < lineapedida THEN PRINT \"There are only \"; cont; \" lines in the file\"\nCLOSE #1\nEND\n","language":"True-BASIC"},{"code":"$$ MODE TUSCRIPT\nfile=\"lines.txt\"\nERROR/STOP OPEN (file,READ,-std-)\nline2fetch=7\n","language":"TUSCRIPT"},{"code":"@(skip nil 7)\n@line\n","language":"TXR"},{"code":"@(skip)\n@line\n@(skip 1 2)\n@(eof)\n","language":"TXR"},{"code":"get_nth_line() {\n local file=$1 n=$2 line\n while ((n-- > 0)); do\n if ! IFS= read -r line; then\n echo \"No such line $2 in $file\"\n return 1\n fi\n done < \"$file\"\n echo \"$line\"\n}\n\nget_nth_line filename 7\n","language":"UNIX-Shell"},{"code":"awk NR==7 filename\nsed -n 7p filename\nhead -n 7 filename | tail -n 1\n","language":"UNIX-Shell"},{"code":"decl string<> lines\ndecl file f\nf.open \"filename.txt\"\nset lines (f.readlines)\nf.close\n\nif (< (size lines) 7)\n out \"the file has less than seven lines\" endl console\n stop\nend if\n\nout \"the seventh line in the file is:\" endl endl console\nout lines<6> endl console\n","language":"Ursa"},{"code":"Function read_line(filepath,n)\n\tSet objFSO = CreateObject(\"Scripting.FileSystemObject\")\n\tSet objFile = objFSO.OpenTextFile(filepath,1)\n\tarrLines = Split(objFile.ReadAll,vbCrLf)\n\tIf UBound(arrLines) >= n-1 Then\n\t\tIf arrLines(n-1) <> \"\" Then\n\t\t\tread_line = arrLines(n-1)\n\t\tElse\n\t\t\tread_line = \"Line \" & n & \" is null.\"\n\t\tEnd If\n\tElse\n\t\tread_line = \"Line \" & n & \" does not exist.\"\n\tEnd If\n\tobjFile.Close\n\tSet objFSO = Nothing\nEnd Function\n\nWScript.Echo read_line(\"c:\\temp\\input.txt\",7)\n","language":"VBScript"},{"code":"File_Open(\"example.txt\", BROWSE)\nGoto_Line(7)\nif (Cur_Line < 7) {\n Statline_Message(\"File contains too few lines\")\n} else {\n if (At_EOL) {\n Statline_Message(\"Empty line\")\n }\n Reg_Copy(10, 1)\n}\nBuf_Close(NOMSG)\n","language":"Vedit-macro-language"},{"code":"import \"io\" for File\n\nvar lines = File.read(\"input.txt\").replace(\"\\r\", \"\").split(\"\\n\")\nif (lines.count < 7) {\n System.print(\"There are only %(lines.count) lines in the file\")\n} else {\n var line7 = lines[6].trim()\n if (line7 == \"\") {\n System.print(\"The seventh line is empty\")\n } else {\n System.print(\"The seventh line is : %(line7)\")\n }\n}\n\n/* Note that 'input.txt' contains the eight lines:\nLine 1\nLine 2\nLine 3\nLine 4\nLine 5\nLine 6\nLine 7\nLine 8\n*/\n","language":"Wren"},{"code":"include c:\\cxpl\\codes; \\intrinsic 'code' declarations\ndef MaxLen = 82; \\maximum length of line that can be stored (incl CR+LF)\n\nfunc ReadLine(N, L); \\Read line N from input file and return it in string L\nint N; char L;\nint I, C;\n[for I:= 1 to N-1 do \\skip to start of specified line\n repeat C:= ChIn(1);\n if C = $1A\\EOF\\ then\n [Text(0, \"File only has \"); IntOut(0, I);\n Text(0, \" lines^M^J\"); return false];\n until C = $0A\\LF\\;\nI:= 0;\nrepeat C:= ChIn(1);\n if C = $1A\\EOF\\ then\n [Text(0, \"Line is empty (EOF)^M^L\"); return false];\n L(I):= C; I:= I+1;\nuntil C=$0A\\LF\\ or I>=MaxLen;\nif I >= MaxLen then Text(0, \"Line might be truncated^M^J\");\nif I = 2 then Text(0, \"Line is empty^M^J\");\nL(I-1):= L(I-1) ! $80; \\terminate string\nreturn true;\n];\n\nchar LineN(MaxLen);\nif ReadLine(7, LineN) then Text(0, LineN)\n","language":"XPL0"},{"code":"filename$ = \"input.txt\"\nopen filename$ for reading as #1\n\nlineapedida = 7\ncont = 0\nwhile not eof(#1)\n line input #1 linea$\n cont = cont + 1\n if cont = lineapedida then\n\tif trim$(linea$) = \"\" then print \"The 7th line is empty\" else print linea$ : fi\n\tbreak\n end if\nwend\nif cont < lineapedida print \"There are only \", cont, \" lines in the file\"\nclose #1\nend\n","language":"Yabasic"},{"code":"reg line; do(7){line=File.stdin.readln()} println(\">>>\",line);\n","language":"Zkl"},{"code":"lines:=File.stdin.readln(7); println(\">>>\",line[-1]);\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Read_a_specific_line_from_a_file\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Some languages have special semantics for obtaining a known line number from a file.\\n\\n\\n;Task:\\nDemonstrate how to obtain the contents of a specific line within a file. \\n\\nFor the purpose of this task demonstrate how the contents of the seventh line of a file can be obtained, and store it in a variable or in memory (for potential future use within the program if the code were to become embedded). \\n\\nIf the file does not contain seven lines, or the seventh line is empty, or too big to be retrieved, output an appropriate message. \\n\\nIf no special semantics are available for obtaining the required line, it is permissible to read line by line. \\n\\nNote that empty lines are considered and should still be counted.\\n\\nAlso note that for functional languages or languages without variables or storage, it is permissible to output the extracted data to standard output.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V f = File(‘input.txt’)\\nV line = 3\\n\\nL 0 .< line - 1\\n f.read_line()\\nprint(f.read_line())\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"BYTE FUNC ReadLine(CHAR ARRAY fname CARD index CHAR ARRAY result)\\n CHAR ARRAY line(255)\\n CARD curr\\n BYTE status,dev=[1]\\n\\n Close(dev)\\n Open(dev,fname,4)\\n curr=1 status=1\\n WHILE Eof(dev)=0\\n DO\\n InputSD(dev,line)\\n IF curr=index THEN\\n SCopy(result,line)\\n status=0\\n EXIT\\n FI\\n curr==+1\\n OD\\n Close(dev)\\nRETURN (status)\\n\\nPROC Test(CHAR ARRAY fname CARD index)\\n CHAR ARRAY result(255)\\n BYTE status\\n\\n PrintF(\\\"Reading %U line...%E\\\",index)\\n status=ReadLine(fname,index,result)\\n IF status=0 THEN\\n IF result(0)=0 THEN\\n PrintF(\\\"%U line is empty.%E%E\\\",index)\\n ELSE\\n PrintF(\\\"%U line is:%E\\\"\\\"%S\\\"\\\"%E%E\\\",index,result)\\n FI\\n ELSEIF status=1 THEN\\n PrintF(\\\"File contains less than %U lines.%E%E\\\",index)\\n FI\\nRETURN\\n\\nPROC Main()\\n CHAR ARRAY fname=\\\"H6:READ__96.ACT\\\"\\n\\n PrintF(\\\"Reading \\\"\\\"%S\\\"\\\"...%E%E\\\",fname)\\n Test(fname,7)\\n Test(fname,24)\\n Test(fname,50)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\n\\nprocedure Rosetta_Read is\\n File : File_Type;\\nbegin\\n Open (File => File,\\n Mode => In_File,\\n Name => \\\"rosetta_read.adb\\\");\\n Set_Line (File, To => 7);\\n\\n declare\\n Line_7 : constant String := Get_Line (File);\\n begin\\n if Line_7'Length = 0 then\\n Put_Line (\\\"Line 7 is empty.\\\");\\n else\\n Put_Line (Line_7);\\n end if;\\n end;\\n\\n Close (File);\\nexception\\n when End_Error =>\\n Put_Line (\\\"The file contains fewer than 7 lines.\\\");\\n Close (File);\\n when Storage_Error =>\\n Put_Line (\\\"Line 7 is too long to load.\\\");\\n Close (File);\\nend Rosetta_Read;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"void\\nread_line(text &line, text path, integer n)\\n{\\n file f;\\n\\n f.affix(path);\\n\\n call_n(n, f_slip, f);\\n\\n f.line(line);\\n}\\n\\n\\ninteger\\nmain(void)\\n{\\n if (1 < argc()) {\\n text line;\\n\\n read_line(line, argv(1), 6);\\n\\n o_(\\\"7th line is:\\\\n\\\", line, \\\"\\\\n\\\");\\n }\\n\\n 0;\\n}\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"# reads the line with number \\\"number\\\" (counting from 1) #\\n# from the file named \\\"file name\\\" and returns the text of the #\\n# in \\\"line\\\". If an error occurs, the result is FALSE and a #\\n# message is returned in \\\"err\\\". If no error occurs, TRUE is #\\n# returned #\\nPROC read specific line = ( STRING file name\\n , INT number # line 7 #\\n , REF STRING line\\n , REF STRING err\\n )BOOL:\\n IF FILE input file;\\n line := \\\"\\\";\\n open( input file, file name, stand in channel ) /= 0\\n THEN\\n # failed to open the file #\\n err := \\\"Unable to open \\\"\\\"\\\" + file name + \\\"\\\"\\\"\\\";\\n FALSE\\n ELSE\\n # file opened OK #\\n err := \\\"\\\";\\n BOOL at eof := FALSE;\\n # set the EOF handler for the file #\\n on logical file end( input file\\n , ( REF FILE f )BOOL:\\n BEGIN\\n # note that we reached EOF on the #\\n # latest read #\\n at eof := TRUE;\\n\\n # return TRUE so processing can continue #\\n TRUE\\n END\\n );\\n INT line number := 0;\\n STRING text;\\n WHILE line number < number\\n AND NOT at eof\\n DO\\n get( input file, ( text, newline ) );\\n line number +:= 1\\n OD;\\n # close the file #\\n close( input file );\\n # return the line or an error message depending on whether #\\n # we got a line with the required number or not #\\n IF line number = number\\n THEN\\n # got the required line #\\n line := text;\\n TRUE\\n ELSE\\n # not enough lines in the file #\\n err := \\\"\\\"\\\"\\\" + file name + \\\"\\\"\\\" is too short\\\";\\n FALSE\\n FI\\n FI; # read specific line #\\nmain:(\\n # read the seventh line of this source and print it #\\n # (or an error message if we can't) #\\n STRING line;\\n STRING err;\\n IF read specific line( \\\"read-specific-line.a68\\\", 7, line, err )\\n THEN\\n # got the line #\\n print( ( \\\"line seven is: \\\"\\\"\\\" + line + \\\"\\\"\\\"\\\", newline ) )\\n ELSE\\n # got an error #\\n print( ( \\\"unable to read line: \\\"\\\"\\\" + err + \\\"\\\"\\\"\\\" ) )\\n FI\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <hopper.h>\\n#define MAX_LINE_SIZE 1000\\nmain:\\n v=0, fd=0\\n fsearch(\\\"-r $'\\\\n'\\\",\\\"archivo.txt\\\")(v)\\n fopen(OPEN_READ,\\\"archivo.txt\\\")(fd)\\n {\\\"Line #7 = \\\"}, fgetsline(fd,MAX_LINE_SIZE,7,v), println\\n try\\n fgetsline(fd,MAX_LINE_SIZE,10,v),\\n catch(e)\\n {\\\"Error search line (code=\\\",e,\\\"): \\\"},get str error\\n finish\\n println\\n fclose(fd)\\nexit(0)\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"lineToRead: 3\\n\\nlineRead: get read.lines \\\"myfile.txt\\\" lineToRead\\n\\nprint lineRead\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"FileReadLine, OutputVar, filename.txt, 7\\nif ErrorLevel\\n MsgBox, There was an error reading the 7th line of the file\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#!/usr/bin/awk -f\\n#usage: readnthline.awk -v lineno=6 filename\\n\\nFNR==lineno { storedline=$0; found++ }\\n\\nEND {\\n if (found < 1) {\\n print \\\"ERROR: Line\\\", lineno, \\\"not found\\\"\\n exit 1\\n }\\n print storedline\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"f = freefile\\nfilename$ = \\\"input.txt\\\"\\nopen f, filename$\\n\\nlineapedida = 7\\ncont = 0\\nwhile not (eof(f))\\n linea$ = readline(f)\\n cont += 1\\n if cont = lineapedida then\\n\\tif trim(linea$) = \\\"\\\" then print \\\"The 7th line is empty\\\" else print linea$\\n\\texit while\\n end if\\nend while\\nif cont < lineapedida then print \\\"There are only \\\"; cont; \\\" lines in the file\\\"\\nclose f\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off\\n\\nfor /f \\\"skip=6 tokens=*\\\" %%i in (file.txt) do (\\n set line7=%%i\\n goto break\\n)\\n:break\\necho Line 7 is: %line7%\\npause>nul\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" filepath$ = @lib$ + \\\"..\\\\licence.txt\\\"\\n requiredline% = 7\\n\\n file% = OPENIN(filepath$)\\n IF file%=0 ERROR 100, \\\"File could not be opened\\\"\\n FOR i% = 1 TO requiredline%\\n IF EOF#file% ERROR 100, \\\"File contains too few lines\\\"\\n INPUT #file%, text$\\n NEXT\\n CLOSE #file%\\n\\n IF ASCtext$=10 text$ = MID$(text$,2)\\n PRINT text$\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <unistd.h>\\n#include <sys/types.h>\\n#include <sys/mman.h>\\n#include <sys/stat.h>\\n#include <fcntl.h>\\n#include <err.h>\\n\\n/* following code assumes all file operations succeed. In practice,\\n * return codes from open, close, fstat, mmap, munmap all need to be\\n * checked for error.\\n*/\\nint read_file_line(const char *path, int line_no)\\n{\\n\\tstruct stat s;\\n\\tchar *buf;\\n\\toff_t start = -1, end = -1;\\n\\tsize_t i;\\n\\tint ln, fd, ret = 1;\\n\\n\\tif (line_no == 1) start = 0;\\n\\telse if (line_no < 1){\\n\\t\\twarn(\\\"line_no too small\\\");\\n\\t\\treturn 0; /* line_no starts at 1; less is error */\\n\\t}\\n\\n\\tline_no--; /* back to zero based, easier */\\n\\n\\tfd = open(path, O_RDONLY);\\n\\tfstat(fd, &s);\\n\\n\\t/* Map the whole file. If the file is huge (up to GBs), OS will swap\\n\\t * pages in and out, and because search for lines goes sequentially\\n\\t * and never accesses more than one page at a time, penalty is low.\\n\\t * If the file is HUGE, such that OS can't find an address space to map\\n\\t * it, we got a real problem. In practice one would repeatedly map small\\n\\t * chunks, say 1MB at a time, and find the offsets of the line along the\\n\\t * way. Although, if file is really so huge, the line itself can't be\\n\\t * guaranteed small enough to be \\\"stored in memory\\\", so there.\\n\\t */\\n\\tbuf = mmap(0, s.st_size, PROT_READ, MAP_PRIVATE, fd, 0);\\n\\n\\t/* optional; if the file is large, tell OS to read ahead */\\n\\tmadvise(buf, s.st_size, MADV_SEQUENTIAL);\\n\\n\\tfor (i = ln = 0; i < s.st_size && ln <= line_no; i++) {\\n\\t\\tif (buf[i] != '\\\\n') continue;\\n\\n\\t\\tif (++ln == line_no) start = i + 1;\\n\\t\\telse if (ln == line_no + 1) end = i + 1;\\n\\t}\\n\\n\\tif (start >= s.st_size || start < 0) {\\n\\t\\twarn(\\\"file does not have line %d\\\", line_no + 1);\\n\\t\\tret = 0;\\n\\t} else {\\n\\t\\t/* \\tdo something with the line here, like\\n\\t\\twrite(STDOUT_FILENO, buf + start, end - start);\\n\\t\\t\\tor copy it out, or something\\n\\t\\t*/\\n\\t}\\n\\n\\tmunmap(buf, s.st_size);\\n\\tclose(fd);\\n\\n\\treturn ret;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n\\n#define BUF_SIZE ( 256 )\\n\\nchar *get_nth_line( FILE *f, int line_no )\\n{\\n char buf[ BUF_SIZE ];\\n size_t curr_alloc = BUF_SIZE, curr_ofs = 0;\\n char *line = malloc( BUF_SIZE );\\n int in_line = line_no == 1;\\n size_t bytes_read;\\n\\n /* Illegal to ask for a line before the first one. */\\n if ( line_no < 1 )\\n return NULL;\\n\\n /* Handle out-of-memory by returning NULL */\\n if ( !line )\\n return NULL;\\n\\n /* Scan the file looking for newlines */\\n while ( line_no &&\\n ( bytes_read = fread( buf, 1, BUF_SIZE, f ) ) > 0 )\\n {\\n int i;\\n\\n for ( i = 0 ; i < bytes_read ; i++ )\\n {\\n if ( in_line )\\n {\\n if ( curr_ofs >= curr_alloc )\\n {\\n curr_alloc <<= 1;\\n line = realloc( line, curr_alloc );\\n\\n if ( !line ) /* out of memory? */\\n return NULL;\\n }\\n line[ curr_ofs++ ] = buf[i];\\n }\\n\\n if ( buf[i] == '\\\\n' )\\n {\\n line_no--;\\n\\n if ( line_no == 1 )\\n in_line = 1;\\n\\n if ( line_no == 0 )\\n break;\\n }\\n }\\n }\\n\\n /* Didn't find the line? */\\n if ( line_no != 0 )\\n {\\n free( line );\\n return NULL;\\n }\\n\\n /* Resize allocated buffer to what's exactly needed by the string\\n and the terminating NUL character. Note that this code *keeps*\\n the terminating newline as part of the string.\\n */\\n line = realloc( line, curr_ofs + 1 );\\n\\n if ( !line ) /* out of memory? */\\n return NULL;\\n\\n /* Add the terminating NUL. */\\n line[ curr_ofs ] = '\\\\0';\\n\\n /* Return the line. Caller is responsible for freeing it. */\\n return line;\\n}\\n\\n\\n/* Test program. Prints out the 7th line of input from stdin, if any */\\nint main( int argc, char *argv[] )\\n{\\n char *line7 = get_nth_line( stdin, 7 );\\n\\n if ( line7 )\\n {\\n printf(\\\"The 7th line of input was:\\\\n%s\\\\n\\\", line7 );\\n free( line7 );\\n } else\\n {\\n printf(\\\"Did not find the 7th line of input. Reason: \\\");\\n if ( feof( stdin ) )\\n puts(\\\"End of file reached.\\\");\\n else if ( ferror( stdin ) )\\n puts(\\\"Error reading input.\\\");\\n else\\n puts(\\\"Out of memory.\\\");\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <string>\\n#include <fstream>\\n#include <iostream>\\n\\nint main( ) {\\n std::cout << \\\"Which file do you want to look at ?\\\\n\\\" ;\\n std::string input ;\\n std::getline( std::cin , input ) ;\\n std::ifstream infile( input.c_str( ) , std::ios::in ) ;\\n std::string file( input ) ;\\n std::cout << \\\"Which file line do you want to see ? ( Give a number > 0 ) ?\\\\n\\\" ;\\n std::getline( std::cin , input ) ;\\n int linenumber = std::stoi( input ) ;\\n int lines_read = 0 ;\\n std::string line ;\\n if ( infile.is_open( ) ) {\\n while ( infile ) {\\n\\t getline( infile , line ) ;\\n\\t lines_read++ ;\\n\\t if ( lines_read == linenumber ) {\\n\\t std::cout << line << std::endl ;\\n\\t break ;\\n\\t }\\n }\\n infile.close( ) ;\\n if ( lines_read < linenumber )\\n\\t std::cout << \\\"No \\\" << linenumber << \\\" lines in \\\" << file << \\\" !\\\\n\\\" ;\\n return 0 ;\\n }\\n else {\\n std::cerr << \\\"Could not find file \\\" << file << \\\" !\\\\n\\\" ;\\n return 1 ;\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.IO;\\n\\nnamespace GetLine\\n{\\n internal class Program\\n {\\n private static void Main(string[] args)\\n {\\n Console.WriteLine(GetLine(args[0], uint.Parse(args[1])));\\n }\\n\\n private static string GetLine(string path, uint line)\\n {\\n using (var reader = new StreamReader(path))\\n {\\n try\\n {\\n for (uint i = 0; i <= line; i++)\\n {\\n if (reader.EndOfStream)\\n return string.Format(\\\"There {1} less than {0} line{2} in the file.\\\", line,\\n ((line == 1) ? \\\"is\\\" : \\\"are\\\"), ((line == 1) ? \\\"\\\" : \\\"s\\\"));\\n\\n if (i == line)\\n return reader.ReadLine();\\n\\n reader.ReadLine();\\n }\\n }\\n catch (IOException ex)\\n {\\n return ex.Message;\\n }\\n catch (OutOfMemoryException ex)\\n {\\n return ex.Message;\\n }\\n }\\n\\n throw new Exception(\\\"Something bad happened.\\\");\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn read-nth-line\\n \\\"Read line-number from the given text file. The first line has the number 1.\\\"\\n [file line-number]\\n (with-open [rdr (clojure.java.io/reader file)]\\n (nth (line-seq rdr) (dec line-number))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defun read-nth-line (file n &aux (line-number 0))\\n \\\"Read the nth line from a text file. The first line has the number 1\\\"\\n (assert (> n 0) (n))\\n (with-open-file (stream file)\\n (loop for line = (read-line stream nil nil)\\n if (and (null line) (< line-number n))\\n do (error \\\"file ~a is too short, just ~a, not ~a lines long\\\"\\n file line-number n)\\n do (incf line-number)\\n if (and line (= line-number n))\\n do (return line))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.file, std.string;\\n auto file_lines = readText(\\\"input.txt\\\").splitLines();\\n //file_lines becomes an array of strings, each line is one element\\n writeln((file_lines.length > 6) ? file_lines[6] : \\\"line not found\\\");\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio;\\n\\nvoid main() {\\n int countLines;\\n char[] ln;\\n auto f = File(\\\"linenumber.d\\\", \\\"r\\\");\\n foreach (char[] line; f.byLine()) {\\n countLines++;\\n if (countLines == 7) {\\n ln = line;\\n break;\\n }\\n }\\n switch(countLines) {\\n case 0 : writeln(\\\"the file has zero length\\\");\\n break;\\n case 7 : writeln(\\\"line 7: \\\", (ln.length ? ln : \\\"empty\\\"));\\n break;\\n default :\\n writefln(\\\"the file only contains %d lines\\\", countLines);\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Read_a_specific_line_from_a_file;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils;\\n\\nfunction ReadLine(position: Cardinal; FileName: TFileName): string;\\nbegin\\n Result := '';\\n\\n if not FileExists(FileName) then\\n raise Exception.Create('Error: File does not exist.');\\n\\n var F: TextFile;\\n var line: string;\\n AssignFile(F, FileName);\\n Reset(F);\\n for var _ := 1 to position do\\n begin\\n if Eof(F) then\\n begin\\n CloseFile(F);\\n\\n raise Exception.Create(Format('Error: The file \\\"%s\\\" is too short. Cannot read line %d',\\n [FileName, position]));\\n end;\\n\\n Readln(F, line);\\n end;\\n CloseFile(F);\\n Result := line;\\nend;\\n\\nbegin\\n Writeln(ReadLine(7, 'test'));\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"defmodule LineReader do\\n def get_line(filename, line) do\\n File.stream!(filename)\\n |> Stream.with_index\\n |> Stream.filter(fn {_value, index} -> index == line-1 end)\\n |> Enum.at(0)\\n |> print_line\\n end\\n defp print_line({value, _line_number}), do: String.trim(value)\\n defp print_line(_), do: {:error, \\\"Invalid Line\\\"}\\nend\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-module( read_a_specific_line ).\\n\\n-export( [from_file/2, task/0] ).\\n\\nfrom_file( File, N ) -> line_nr( N, read_a_file_line_by_line:into_list(File) ).\\n\\ntask() ->\\n Lines = read_a_file_line_by_line:into_list( \\\"read_a_specific_line.erl\\\" ),\\n Line_7 = line_nr( 7, Lines ),\\n Line_7.\\n\\n\\n\\nline_nr( N, Lines ) ->\\n try\\n case lists:nth( N, Lines )\\n of \\\"\\\\n\\\" -> erlang:exit( empty_line )\\n ; Line -> Line\\n end\\n\\n catch\\n _Type:Error0 ->\\n Error = line_nr_error( Error0 ),\\n io:fwrite( \\\"Error: ~p~n\\\", [Error] ),\\n erlang:exit( Error )\\n\\n end.\\n\\nline_nr_error( function_clause ) -> too_few_lines_in_file;\\nline_nr_error( Error ) -> Error.\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"open System\\nopen System.IO\\n\\n[<EntryPoint>]\\nlet main args =\\n let n = Int32.Parse(args.[1]) - 1\\n use r = new StreamReader(args.[0])\\n let lines = Seq.unfold (\\n fun (reader : StreamReader) ->\\n if (reader.EndOfStream) then None\\n else Some(reader.ReadLine(), reader)) r\\n let line = Seq.nth n lines // Seq.nth throws an ArgumentException,\\n // if not not enough lines available\\n Console.WriteLine(line)\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: continuations fry io io.encodings.utf8 io.files kernel\\nmath ;\\nIN: rosetta-code.nth-line\\n\\n: nth-line ( path encoding n -- str/f )\\n [ f ] 3dip '[\\n [ _ [ drop readln [ return ] unless* ] times ]\\n with-return\\n ] with-file-reader ;\\n\\n: nth-line-demo ( -- )\\n \\\"input.txt\\\" utf8 7 nth-line [ \\\"line not found\\\" ] unless*\\n print ;\\n\\nMAIN: nth-line-demo\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \" MODULE SAMPLER !To sample a record from a file. SAM00100\\n CONTAINS SAM00200\\n CHARACTER*20 FUNCTION GETREC(N,F,IS) !Returns a status. SAM00300\\nCareful. Some compilers get confused over the function name's usage. SAM00400\\n INTEGER N !The desired record number. SAM00500\\n INTEGER F !Of this file. SAM00600\\n CHARACTER*(*) IS !Stashed here. SAM00700\\n INTEGER I,L !Assistants. SAM00800\\n IS = \\\"\\\" !Clear previous content, even if null...SAM00900\\n IF (N.LE.0) THEN !Start on errors. SAM01000\\n WRITE (GETREC,1) \\\"!No record\\\",N !Could never be found. SAM01100\\n 1 FORMAT (A,1X,I0) !Message, number. SAM01200\\n ELSE IF (F.LE.0) THEN !Obviously wrong? SAM01300\\n WRITE (GETREC,1) \\\"!No unit number\\\",F!Positive is valid. SAM01400\\n ELSE IF (LEN(IS).LE.0) THEN !Space awaits? SAM01500\\n WRITE (GETREC,1) \\\"!String size\\\",LEN(IS) !Nope. SAM01600\\n ELSE !Otherwise, there is hope. SAM01700\\n REWIND (F) !Clarify the file position. SAM01800\\n DO I = 1,N - 1 !Grind up to the desired record. SAM01900\\n READ (F,2,END=3) !Ignoring any content. SAM02000\\n END DO !Are we there yet? SAM02100\\n READ (F,2,END = 3) L,IS(1:MIN(L,LEN(IS))) !At last. SAM02200\\n 2 FORMAT (Q,A) !Q = characters yet unread. SAM02300\\n IF (L.LT.LEN(IS)) IS(L + 1:) = \\\"\\\" !Clear the tail. SAM02400\\n IF (L.GT.LEN(IS)) THEN !Now for more silliness.SAM02500\\n WRITE (GETREC,1) \\\"+Length\\\",L !Too long to fit in IS. SAM02600\\n ELSE IF (L.LE.0) THEN !A zero-length record SAM02700\\n WRITE (GETREC,1) \\\"+Null\\\" !Is not the same SAM02800\\n ELSE IF (IS.EQ.\\\"\\\") THEN !As a record SAM02900\\n WRITE (GETREC,1) \\\"+Blank\\\",L !Containing spaces. SAM03000\\n ELSE !But otherwise, SAM03100\\n WRITE (GETREC,1) \\\" Length\\\",L !Note the leading space.SAM03200\\n END IF !Righto, we've decided. SAM03300\\n END IF !And, no more options. SAM03400\\n RETURN !So, done. SAM03500\\n 3 WRITE (GETREC,1) \\\"!End on read\\\",I !An alternative ending. SAM03600\\n END FUNCTION GETREC !That was interesting. SAM03700\\n END MODULE SAMPLER !Just a sample of possibility. SAM03800\\n SAM03900\\n PROGRAM POKE POK00100\\n USE SAMPLER POK00200\\n INTEGER ENUFF !Some sizes. POK00300\\n PARAMETER (ENUFF = 666) !Sufficient? POK00400\\n CHARACTER*(ENUFF) STUFF !Lots of memory these days. POK00500\\n CHARACTER*20 RESULT POK00600\\n INTEGER MSG,F !I/O unit numbers. POK00700\\n MSG = 6 !Standard output. POK00800\\n F = 10 !Chooose a unit number. POK00900\\n WRITE (MSG,*) \\\" To select record 7 from a disc file.\\\" POK01000\\n POK01100\\n WRITE (MSG,*) \\\"As a FORMATTED file.\\\" POK01200\\n OPEN (F,FILE=\\\"FileSlurpN.for\\\",STATUS=\\\"OLD\\\",ACTION=\\\"READ\\\") POK01300\\n RESULT = GETREC(7,F,STUFF) POK01400\\n WRITE (MSG,1) \\\"Result\\\",RESULT POK01500\\n WRITE (MSG,1) \\\"Record\\\",STUFF POK01600\\n 1 FORMAT (A,\\\":\\\",A) POK01700\\n POK01800\\n CLOSE (F) POK01900\\n WRITE (MSG,*) \\\"As a random-access unformatted file.\\\" POK02000\\n OPEN (F,FILE=\\\"FileSlurpN.for\\\",STATUS=\\\"OLD\\\",ACTION=\\\"READ\\\", POK02100\\n 1 ACCESS=\\\"DIRECT\\\",FORM=\\\"UNFORMATTED\\\",RECL=82) !Not 80! POK02200\\n STUFF = \\\"Cleared.\\\" POK02300\\n READ (F,REC = 7,ERR = 666) STUFF(1:80) POK02400\\n WRITE (MSG,1) \\\"Record\\\",STUFF(1:80) POK02500\\n STOP POK02600\\n 666 WRITE (MSG,*) \\\"Can't get the record!\\\" POK02700\\n END !That was easy. POK02800\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"READ (F'7) STUFF(1:80)\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" READ (F,REC = 7,ERR = 666, IOSTAT = IOSTAT) STUFF(1:80)\\n 666 IF (IOSTAT.NE.0) THEN\\n WRITE (MSG,*) \\\"Can't get the record: code\\\",IOSTAT\\n ELSE\\n WRITE (MSG,1) \\\"Record\\\",STUFF(1:80)\\n END IF\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nOpen \\\"input.txt\\\" For Input As #1\\nDim line_ As String\\nDim count As Integer = 0\\nWhile Not Eof(1)\\n Line Input #1, line_ '' read each line\\n count += 1\\n If count = 7 Then\\n line_ = Trim(line_, Any !\\\" \\\\t\\\") '' remove any leading or trailing spaces or tabs\\n If line_ = \\\"\\\" Then\\n Print \\\"The 7th line is empty\\\"\\n Else\\n Print \\\"The 7th line is : \\\"; line_\\n End If\\n Exit While\\n End If\\nWend\\nIf count < 7 Then\\n Print \\\"There are only\\\"; count; \\\" lines in the file\\\"\\nEnd If\\nClose #1\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"nthLine[filename, lineNum] :=\\n{\\n line = nth[lines[filenameToURL[filename]], lineNum-1]\\n if line != undef\\n return line\\n else\\n {\\n println[\\\"The file $filename does not contain a line number $lineNum\\\"]\\n return undef\\n }\\n}\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"window 1\\n\\nlong i = 1\\nStr255 s, lineSeven\\nCFURLRef url\\n\\nurl = openpanel 1, @\\\"Select text file\\\"\\nif ( url )\\n open \\\"I\\\", 2, url\\n while ( not eof(2) )\\n line input #2, s\\n if ( i == 7 )\\n lineSeven = s : break\\n end if\\n i++\\n wend\\n close 2\\n\\n if ( lineSeven[0] )\\n print lineSeven\\n else\\n print \\\"File did not contain seven lines, or line was empty.\\\"\\n end if\\nend if\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"bufio\\\"\\n\\t\\\"errors\\\"\\n\\t\\\"fmt\\\"\\n\\t\\\"io\\\"\\n\\t\\\"os\\\"\\n)\\n\\nfunc main() {\\n\\tif line, err := rsl(\\\"input.txt\\\", 7); err == nil {\\n\\t\\tfmt.Println(\\\"7th line:\\\")\\n\\t\\tfmt.Println(line)\\n\\t} else {\\n\\t\\tfmt.Println(\\\"rsl:\\\", err)\\n\\t}\\n}\\n\\nfunc rsl(fn string, n int) (string, error) {\\n\\tif n < 1 {\\n\\t\\treturn \\\"\\\", fmt.Errorf(\\\"invalid request: line %d\\\", n)\\n\\t}\\n\\tf, err := os.Open(fn)\\n\\tif err != nil {\\n\\t\\treturn \\\"\\\", err\\n\\t}\\n\\tdefer f.Close()\\n\\tbf := bufio.NewReader(f)\\n\\tvar line string\\n\\tfor lnum := 0; lnum < n; lnum++ {\\n\\t\\tline, err = bf.ReadString('\\\\n')\\n\\t\\tif err == io.EOF {\\n\\t\\t\\tswitch lnum {\\n\\t\\t\\tcase 0:\\n\\t\\t\\t\\treturn \\\"\\\", errors.New(\\\"no lines in file\\\")\\n\\t\\t\\tcase 1:\\n\\t\\t\\t\\treturn \\\"\\\", errors.New(\\\"only 1 line\\\")\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\treturn \\\"\\\", fmt.Errorf(\\\"only %d lines\\\", lnum)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif err != nil {\\n\\t\\t\\treturn \\\"\\\", err\\n\\t\\t}\\n\\t}\\n\\tif line == \\\"\\\" {\\n\\t\\treturn \\\"\\\", fmt.Errorf(\\\"line %d empty\\\", n)\\n\\t}\\n\\treturn line, nil\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def line = null\\nnew File(\\\"lines.txt\\\").eachLine { currentLine, lineNumber ->\\n if (lineNumber == 7) {\\n line = currentLine\\n }\\n}\\nprintln \\\"Line 7 = $line\\\"\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"main :: IO ()\\nmain = do contents <- readFile filename\\n case drop 6 $ lines contents of\\n [] -> error \\\"File has less than seven lines\\\"\\n l:_ -> putStrLn l\\n where filename = \\\"testfile\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\nwrite(readline(\\\"foo.bar.txt\\\",7)|\\\"failed\\\")\\nend\\n\\nprocedure readline(f,n) # return n'th line of file f\\nf := open(\\\\f,\\\"r\\\") | fail # open file\\nevery i := n & line := |read(f) \\\\ n do i -:= 1 # <== here\\nclose(f)\\nif i = 0 then return line\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"readLine=: 4 :0\\n (x-1) {:: <;.2 ] 1!:1 boxxopen y\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"$ cal 2011 > cal.txt\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 7 readLine 'cal.txt'\\n 9 10 11 12 13 14 15 13 14 15 16 17 18 19 13 14 15 16 17 18 19\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"require 'files' NB. required for versions before J701\\nreadLineT=: <:@[ {:: 'b'&freads@]\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"package linenbr7;\\n\\nimport java.io.*;\\n\\npublic class LineNbr7 {\\n\\n public static void main(String[] args) throws Exception {\\n File f = new File(args[0]);\\n if (!f.isFile() || !f.canRead())\\n throw new IOException(\\\"can't read \\\" + args[0]);\\n\\n BufferedReader br = new BufferedReader(new FileReader(f));\\n try (LineNumberReader lnr = new LineNumberReader(br)) {\\n String line = null;\\n int lnum = 0;\\n while ((line = lnr.readLine()) != null\\n && (lnum = lnr.getLineNumber()) < 7) {\\n }\\n\\n switch (lnum) {\\n case 0:\\n System.out.println(\\\"the file has zero length\\\");\\n break;\\n case 7:\\n boolean empty = \\\"\\\".equals(line);\\n System.out.println(\\\"line 7: \\\" + (empty ? \\\"empty\\\" : line));\\n break;\\n default:\\n System.out.println(\\\"the file has only \\\" + lnum + \\\" line(s)\\\");\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.io.IOException;\\nimport java.nio.file.Files;\\nimport java.nio.file.Path;\\n\\npublic final class ReadSpecificLineFromFile {\\n\\n\\tpublic static void main(String[] aArgs) throws IOException {\\n\\t\\tString fileName = \\\"input.txt\\\";\\n\\t\\tPath filePath = Path.of(fileName);\\n\\t\\t\\n\\t\\tString seventhLine = Files.lines(filePath).skip(6).findFirst().orElse(ERROR_TOO_FEW_LINES);\\n\\t\\t\\n\\t\\tString messageToUser = seventhLine.isBlank() ? ERROR_EMPTY_LINE : seventhLine;\\n\\t\\tSystem.out.println(messageToUser);\\t\\t\\n\\t}\\t\\n\\t\\n\\tprivate static final String ERROR_TOO_FEW_LINES = \\\"File has fewer than 7 lines\\\";\\n\\tprivate static final String ERROR_EMPTY_LINE = \\\"Line 7 is empty\\\";\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# Input - a line number to read, counting from 1\\n# Output - a stream with 0 or 1 items\\ndef read_line:\\n . as $in\\n | label $top\\n | foreach inputs as $line\\n (0; .+1; if . == $in then $line, break $top else empty end) ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$line | tonumber\\n| if . > 0 then read_line\\n else \\\"$line (\\\\(.)) should be a non-negative integer\\\"\\n end\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ jq -n -r 'range(0;20) | tostring' | jq --arg line 10 -n -R -r -f Read_a_specific_line_from_a_file.jq\\n9\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"open(readlines, \\\"path/to/file\\\")[7]\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"function read_nth_lines(stream, num)\\n for i = 1:num-1\\n readline(stream)\\n end\\n result = readline(stream)\\n print(result != \\\"\\\" ? result : \\\"No such line.\\\")\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"(0:\\\"135-0.txt\\\")7\\n\\\"will have to check the laws of the country where you are located before\\\\r\\\"\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"(0:\\\"135-0.txt\\\")7-1\\n\\\"www.gutenberg.org. If you are not located in the United States, you\\\\r\\\"\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nimport java.io.File\\n\\nfun main(args: Array<String>) {\\n /* The following code reads the whole file into memory\\n and so should not be used for large files\\n which should instead be read line by line until the\\n desired line is reached */\\n\\n val lines = File(\\\"input.txt\\\").readLines()\\n if (lines.size < 7)\\n println(\\\"There are only ${lines.size} lines in the file\\\")\\n else {\\n val line7 = lines[6].trim()\\n if (line7.isEmpty())\\n println(\\\"The seventh line is empty\\\")\\n else\\n println(\\\"The seventh line is : $line7\\\")\\n }\\n}\\n\\n/* Note that 'input.txt' contains the eight lines:\\nLine 1\\nLine 2\\nLine 3\\nLine 4\\nLine 5\\nLine 6\\nLine 7\\nLine 8\\n*/\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"local(f) = file('unixdict.txt')\\nhandle => { #f->close }\\nlocal(this_line = string,line = 0)\\n#f->forEachLine => {\\n\\t#line++\\n\\t#line == 7 ? #this_line = #1\\n\\t#line == 7 ? loop_abort\\n}\\n#this_line // 6th, which is the 7th line in the file\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"fileName$ =\\\"F:\\\\sample.txt\\\"\\nrequiredLine =7\\n\\nopen fileName$ for input as #i\\n f$ =input$( #i, lof( #i))\\nclose #i\\n\\nline7$ =word$( f$, 7, chr$( 13))\\nif line7$ =chr$( 13) +chr$( 10) or line7$ =\\\"\\\" then notice \\\"Empty line! ( or file has fewer lines).\\\"\\n\\nprint line7$\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"function fileLine (lineNum, fileName)\\n local count = 0\\n for line in io.lines(fileName) do\\n count = count + 1\\n if count == lineNum then return line end\\n end\\n error(fileName .. \\\" has fewer than \\\" .. lineNum .. \\\" lines.\\\")\\nend\\n\\nprint(fileLine(7, \\\"test.txt\\\"))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"path := \\\"file.txt\\\":\\nspecificLine := proc(path, num)\\n\\tlocal i, input:\\n\\tfor i to num do\\n\\t\\tinput := readline(path):\\n\\t\\tif input = 0 then break; end if:\\n\\tend do:\\n\\tif i = num+1 then printf(\\\"Line %d, %s\\\", num, input):\\n\\telif i <= num then printf (\\\"Line number %d is not reached\\\",num): end if:\\nend proc:\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \" If[# != EndOfFile , Print[#]]& @ ReadList[\\\"file\\\", String, 7]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \" eln = 7; % extract line number 7\\n line = '';\\n fid = fopen('foobar.txt','r');\\n if (fid < 0)\\n\\tprintf('Error:could not open file\\\\n')\\n else\\n n = 0;\\n\\twhile ~feof(fid),\\n n = n + 1;\\n if (n ~= eln),\\n fgetl(fid);\\n else\\n line = fgetl(fid);\\n end\\n\\tend;\\n fclose(fid);\\n end;\\n printf('line %i: %s\\\\n',eln,line);\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"iter = io.lines 'test.txt'\\nfor i=0, 5\\n error 'Not 7 lines in file' if not iter!\\n\\nprint iter!\\n\",\n \"language\": \"MoonScript\"\n },\n {\n \"code\": \"def getline(fname, linenum)\\n\\tcontents = null\\n\\ttry\\n\\t\\tcontents = new(Nanoquery.IO.File).read()\\n\\t\\treturn contents[linenum]\\n\\tcatch\\n\\t\\tif contents = null\\n\\t\\t\\tthrow new(Exception, \\\"unable to read from file '\\\" + fname + \\\"'\\\")\\n\\t\\telse\\n\\t\\t\\tthrow new(Exception, \\\"unable to retrieve line \\\" + linenum + \\\" from file: not enough lines\\\")\\n\\t\\tend\\n\\tend\\nend\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary\\n\\nparse arg inFileName lineNr .\\n\\nif inFileName = '' | inFileName = '.' then inFileName = './data/input.txt'\\nif lineNr = '' | lineNr = '.' then lineNr = 7\\n\\ndo\\n lineTxt = readLine(inFileName, lineNr)\\n say '<textline number=\\\"'lineNr.right(5, 0)'\\\">'lineTxt'</textline>'\\ncatch ex = Exception\\n ex.printStackTrace()\\nend\\n\\nreturn\\n\\n-- =============================================================================\\n-- NetRexx/Java programs don't have a special mechanism to seek to a specified line number\\n-- the simple solution is to iterate through file. (Costly for very large files)\\nmethod readLine(inFileName, lineNr) public static signals IOException, FileNotFoundException\\n\\n lineReader = LineNumberReader(FileReader(File(inFileName)))\\n notFound = isTrue\\n lineTxt = ''\\n loop label reading forever\\n line = lineReader.readLine()\\n select\\n when lineReader.getLineNumber() = lineNr then do\\n lineTxt = line\\n notFound = isFalse\\n leave reading -- terminate I/O loop\\n end\\n when line = null then do\\n leave reading -- terminate I/O loop\\n end\\n otherwise nop\\n end\\n finally\\n lineReader.close()\\n end reading\\n\\n if notFound then signal RuntimeException('File' inFileName 'does not contain line' lineNr.right(5))\\n\\n return lineTxt\\n\\n-- =============================================================================\\nmethod isTrue() public static returns boolean\\n return 1 == 1\\n-- =============================================================================\\nmethod isFalse() public static returns boolean\\n return \\\\(1 == 1)\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"import strformat\\n\\nproc readLine(f: File; num: Positive): string =\\n for n in 1..num:\\n try:\\n result = f.readLine()\\n except EOFError:\\n raise newException(IOError, &\\\"Not enough lines in file; expected {num}, found {n - 1}.\\\")\\n\\nlet f = open(\\\"test.txt\\\", fmRead)\\necho f.readLine(7)\\nf.close()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let input_line_opt ic =\\n try Some (input_line ic)\\n with End_of_file -> None\\n\\nlet nth_line n filename =\\n let ic = open_in filename in\\n let rec aux i =\\n match input_line_opt ic with\\n | Some line ->\\n if i = n then begin\\n close_in ic;\\n (line)\\n end else aux (succ i)\\n | None ->\\n close_in ic;\\n failwith \\\"end of file reached\\\"\\n in\\n aux 1\\n\\nlet () =\\n print_endline (nth_line 7 Sys.argv.(1))\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"uses stringutil\\nnew Textarray t\\nt.load \\\"t.txt\\\"\\nprint t.line 7\\n' print t.lineCount\\ndel t\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"Program FileTruncate;\\n\\nuses\\n SysUtils;\\n\\nconst\\n filename = 'test';\\n position = 7;\\n\\nvar\\n myfile: text;\\n line: string;\\n counter: integer;\\n\\nbegin\\n if not FileExists(filename) then\\n begin\\n writeln('Error: File does not exist.');\\n exit;\\n end;\\n\\n Assign(myfile, filename);\\n Reset(myfile);\\n counter := 0;\\n Repeat\\n if eof(myfile) then\\n begin\\n writeln('Error: The file \\\"', filename, '\\\" is too short. Cannot read line ', position);\\n Close(myfile);\\n exit;\\n end;\\n inc(counter);\\n readln(myfile);\\n until counter = position - 1;\\n readln(myfile, line);\\n Close(myfile);\\n writeln(line);\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"#!/usr/bin/perl -s\\n# invoke as <scriptname> -n=7 [input]\\nwhile (<>) { $. == $n and print, exit }\\ndie \\\"file too short\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">lines</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">get_text</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"TEST.TXT\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">GT_LF_STRIPPED</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #004080;\\\">sequence</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lines</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lines</span><span style=\\\"color: #0000FF;\\\">)>=</span><span style=\\\"color: #000000;\\\">7</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">lines</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"no line 7\\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">fn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">open</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"TEST.TXT\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"r\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">6</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #0000FF;\\\">{}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">gets</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">gets</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (shows -1 if past eof)</span>\\n <span style=\\\"color: #7060A8;\\\">close</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\nargument 1 get \\\"r\\\" fopen var f drop\\n0\\n7 for\\n f fgets number? if f fclose exitfor else nip nip endif\\nendfor\\nprint /# show -1 if past eof #/\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"<?php\\n $DOCROOT = $_SERVER['DOCUMENT_ROOT'];\\n\\n function fileLine ($lineNum, $file) {\\n $count = 0;\\n while (!feof($file)) {\\n $count++;\\n $line = fgets($file);\\n if ($count == $lineNum) return $line;\\n }\\n die(\\\"Requested file has fewer than \\\".$lineNum.\\\" lines!\\\");\\n }\\n\\n @ $fp = fopen(\\\"$DOCROOT/exercises/words.txt\\\", 'r');\\n if (!$fp) die(\\\"Input file not found!\\\");\\n echo fileLine(7, $fp);\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(in \\\"file.txt\\\"\\n (do 6 (line))\\n (or (line) (quit \\\"No 7 lines\\\")) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"declare text character (1000) varying, line_no fixed;\\n\\nget (line_no);\\non endfile (f) begin;\\n put skip list ('the specified line does not exist');\\n go to next;\\nend;\\n\\nget file (f) edit ((text do i = 1 to line_no)) (L);\\n\\nput skip list (text);\\nnext: ;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"100H: /* READ A SPECIFIC LINE FROM A FILE */\\n\\n DECLARE FALSE LITERALLY '0', TRUE LITERALLY '0FFH';\\n DECLARE NL$CHAR LITERALLY '0AH'; /* NEWLINE: CHAR 10 */\\n DECLARE EOF$CHAR LITERALLY '26'; /* EOF: CTRL-Z */\\n /* CP/M BDOS SYSTEM CALL, RETURNS A VALUE */\\n BDOS: PROCEDURE( FN, ARG )BYTE; DECLARE FN BYTE, ARG ADDRESS; GOTO 5; END;\\n /* CP/M BDOS SYSTEM CALL, NO RETURN VALUE */\\n BDOS$P: PROCEDURE( FN, ARG ); DECLARE FN BYTE, ARG ADDRESS; GOTO 5; END;\\n EXIT: PROCEDURE; CALL BDOS$P( 0, 0 ); END; /* CP/M SYSTEM RESET */\\n PR$CHAR: PROCEDURE( C ); DECLARE C BYTE; CALL BDOS$P( 2, C ); END;\\n PR$STRING: PROCEDURE( S ); DECLARE S ADDRESS; CALL BDOS$P( 9, S ); END;\\n PR$NL: PROCEDURE; CALL PR$STRING( .( 0DH, NL$CHAR, '$' ) ); END;\\n PR$NUMBER: PROCEDURE( N ); /* PRINTS A NUMBER IN THE MINIMUN FIELD WIDTH */\\n DECLARE N ADDRESS;\\n DECLARE V ADDRESS, N$STR ( 6 )BYTE, W BYTE;\\n V = N;\\n W = LAST( N$STR );\\n N$STR( W ) = '$';\\n N$STR( W := W - 1 ) = '0' + ( V MOD 10 );\\n DO WHILE( ( V := V / 10 ) > 0 );\\n N$STR( W := W - 1 ) = '0' + ( V MOD 10 );\\n END;\\n CALL PR$STRING( .N$STR( W ) );\\n END PR$NUMBER;\\n FL$EXISTS: PROCEDURE( FCB )BYTE; /* RETURNS TRUE IF THE FILE NAMED IN THE */\\n DECLARE FCB ADDRESS; /* FCB EXISTS */\\n RETURN ( BDOS( 17, FCB ) < 4 );\\n END FL$EXISTS ;\\n FL$OPEN: PROCEDURE( FCB )BYTE; /* OPEN THE FILE WITH THE SPECIFIED FCB */\\n DECLARE FCB ADDRESS;\\n RETURN ( BDOS( 15, FCB ) < 4 );\\n END FL$OPEN;\\n FL$READ: PROCEDURE( FCB )BYTE; /* READ THE NEXT RECORD FROM FCB */\\n DECLARE FCB ADDRESS;\\n RETURN ( BDOS( 20, FCB ) = 0 );\\n END FL$READ;\\n FL$CLOSE: PROCEDURE( FCB )BYTE; /* CLOSE THE FILE WITH THE SPECIFIED FCB */\\n DECLARE FCB ADDRESS;\\n RETURN ( BDOS( 16, FCB ) < 4 );\\n END FL$CLOSE;\\n\\n PR$BYTE: PROCEDURE( B ); /* PRINT B EITHER AS A CHAR OR IN HEX */\\n DECLARE B BYTE;\\n PR$HEX: PROCEDURE( H ); /* PRINT A HEX DIGIT */\\n DECLARE H BYTE;\\n IF H < 10 THEN CALL PR$CHAR( H + '0' );\\n ELSE CALL PR$CHAR( ( H - 10 ) + 'A' );\\n END PR$HEX;\\n IF B >= ' ' AND B < 7FH AND B <> '$' THEN DO;\\n /* PRINTABLE CHAR AND NOT A $, SHOW AS A CHARACTER */\\n CALL PR$CHAR( B );\\n END;\\n ELSE DO;\\n /* NON-PRINTING CHAR OR $ - SHOW IN HEX */\\n CALL PR$CHAR( '$' );\\n CALL PR$HEX( SHR( B, 4 ) );\\n CALL PR$HEX( B AND 0FH );\\n END;\\n END PR$BYTE;\\n\\n /* I/O USES FILE CONTROL BLOCKS CONTAINING THE FILE-NAME, POSITION, ETC. */\\n /* WHEN THE PROGRAM IS RUN, THE CCP WILL FIRST PARSE THE COMMAND LINE AND */\\n /* PUT THE FIRST PARAMETER IN FCB1, THE SECOND PARAMETER IN FCB2 */\\n /* BUT FCB2 OVERLAYS THE END OF FCB1 AND THE DMA BUFFER OVERLAYS THE END */\\n /* OF FCB2, SO WE NEED TO GET THE LINE NUMBER FROM FCB2 FIRST */\\n\\n DECLARE FCB$SIZE LITERALLY '36'; /* SIZE OF A FCB */\\n DECLARE FCB1 LITERALLY '5CH'; /* ADDRESS OF FIRST FCB */\\n DECLARE FCB2 LITERALLY '6CH'; /* ADDRESS OF SECOND FCB */\\n DECLARE DMA$BUFFER LITERALLY '80H'; /* DEFAULT DMA BUFFER ADDRESS */\\n DECLARE DMA$SIZE LITERALLY '128'; /* SIZE OF THE DMA BUFFER */\\n\\n DECLARE F$PTR ADDRESS, F$CHAR BASED F$PTR BYTE;\\n\\n /* GET THE LINE NUMBER FROM THE SECOND PARAMETER */\\n DECLARE LINE$NUMBER ADDRESS;\\n LINE$NUMBER = 0;\\n DO F$PTR = FCB2 + 1 TO FCB2 + 8;\\n IF F$CHAR >= '0' AND F$CHAR <= '9' THEN DO;\\n LINE$NUMBER = ( LINE$NUMBER * 10 ) + ( F$CHAR - '0' );\\n END;\\n END;\\n /* CLEAR THE PARTS OF FCB1 OVERLAYED BY FCB2 */\\n DO F$PTR = FCB1 + 12 TO FCB1 + ( FCB$SIZE - 1 );\\n F$CHAR = 0;\\n END;\\n\\n /* SHOW THE REQUIRED LINE FROM THE FILE, IF THE FILE AND LINE EXIST */\\n IF NOT FL$EXISTS( FCB1 ) THEN DO; /* THE FILE DOES NOT EXIST */\\n CALL PR$STRING( .'FILE NOT FOUND$' );CALL PR$NL;\\n END;\\n ELSE IF NOT FL$OPEN( FCB1 ) THEN DO; /* UNABLE TO OPEN THE FILE */\\n CALL PR$STRING( .'UNABLE TO OPEN THE FILE$' );CALL PR$NL;\\n END;\\n ELSE DO; /* FILE EXISTS AND OPENED OK - ATTEMPT TO FIND THE LINE */\\n DECLARE LN ADDRESS, GOT$RCD BYTE, GOT$LINE BYTE, DMA$END ADDRESS;\\n DMA$END = DMA$BUFFER + ( DMA$SIZE - 1 );\\n GOT$RCD = FL$READ( FCB1 ); /* GET THE FIRST RECORD */\\n GOT$LINE = FALSE;\\n F$PTR = DMA$BUFFER;\\n LN = 1;\\n CALL PR$NUMBER( LINE$NUMBER ); CALL PR$STRING( .': <$' );\\n DO WHILE( GOT$RCD AND LN <= LINE$NUMBER );\\n IF F$PTR > DMA$END THEN DO;\\n /* AT THE END OF THE BUFFER - GET THE NEXT RECORD */\\n GOT$RCD = FL$READ( FCB1 );\\n F$PTR = DMA$BUFFER;\\n END;\\n ELSE IF F$CHAR = NL$CHAR THEN DO; /* END OF LINE */\\n LN = LN + 1;\\n IF LN = LINE$NUMBER THEN GOT$LINE = TRUE;\\n END;\\n ELSE IF F$CHAR = EOF$CHAR THEN GOT$RCD = FALSE; /* END OF FILE */\\n ELSE IF LN = LINE$NUMBER THEN CALL PR$BYTE( F$CHAR );\\n F$PTR = F$PTR + 1;\\n END;\\n CALL PR$CHAR( '>' ); CALL PR$NL;\\n /* SHOULD NOW HAVE EOF OR THE END OF THE REQUIRED LINE */\\n IF NOT GOT$LINE THEN DO;\\n /* COULDN'T READ THE SPECIFIED LINE */\\n CALL PR$STRING( .'CANNOT READ LINE $' );\\n CALL PR$NUMBER( LINE$NUMBER );\\n END;\\n /* CLOSE THE FILE */\\n IF NOT FL$CLOSE( FCB1 ) THEN DO;\\n CALL PR$STRING( .'UNABLE TO CLOSE THE FILE$' ); CALL PR$NL;\\n END;\\n END;\\n\\n CALL EXIT;\\n\\nEOF\\n\",\n \"language\": \"PL-M\"\n },\n {\n \"code\": \"$file = Get-Content c:\\\\file.txt\\nif ($file.count -lt 7)\\n{Write-Warning \\\"The file is too short!\\\"}\\nelse\\n{\\n $file | Where Readcount -eq 7 | set-variable -name Line7\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Structure lineLastRead\\n lineRead.i\\n line.s\\nEndStructure\\n\\nProcedure readNthLine(file, n, *results.lineLastRead)\\n *results\\\\lineRead = 0\\n While *results\\\\lineRead < n And Not Eof(file)\\n *results\\\\line = ReadString(file)\\n *results\\\\lineRead + 1\\n Wend\\n\\n If *results\\\\lineRead = n\\n ProcedureReturn 1\\n EndIf\\nEndProcedure\\n\\nDefine filename.s = OpenFileRequester(\\\"Choose file to read a line from\\\", \\\"*.*\\\", \\\"All files (*.*)|*.*\\\", 0)\\nIf filename\\n Define file = ReadFile(#PB_Any, filename)\\n If file\\n Define fileReadResults.lineLastRead, lineToRead = 7\\n If readNthLine(file, lineToRead, fileReadResults)\\n MessageRequester(\\\"Results\\\", fileReadResults\\\\line)\\n Else\\n MessageRequester(\\\"Error\\\", \\\"There are less than \\\" + Str(lineToRead) + \\\" lines in file.\\\")\\n EndIf\\n CloseFile(file)\\n Else\\n MessageRequester(\\\"Error\\\", \\\"Couldn't open file \\\" + filename + \\\".\\\")\\n EndIf\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"with open('xxx.txt') as f:\\n for i, line in enumerate(f):\\n if i == 6:\\n break\\n else:\\n print('Not 7 lines in file')\\n line = None\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from itertools import islice\\n\\nwith open('xxx.txt') as f:\\n try:\\n line = next(islice(f, 6, 7))\\n except StopIteration:\\n print('Not 7 lines in file')\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"print open('xxx.txt').readlines()[:7][-1]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"f = FREEFILE\\nOPEN \\\"input.txt\\\" FOR INPUT AS #f\\n\\nlineapedida = 7\\ncont = 0\\nDO WHILE NOT EOF(f)\\n LINE INPUT #f, linea$\\n cont = cont + 1\\n IF cont = lineapedida THEN\\n IF linea$ = \\\"\\\" THEN PRINT \\\"The 7th line is empty\\\" ELSE PRINT linea$\\n EXIT DO\\n END IF\\nLOOP\\nIF cont < lineapedida THEN PRINT \\\"There are only \\\"; cont; \\\" lines in the file\\\"\\nCLOSE #1\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \"> seven <- scan('hw.txt', '', skip = 6, nlines = 1, sep = '\\\\n') # too short\\nRead 0 items\\n> seven <- scan('Incoming/quotes.txt', '', skip = 6, nlines = 1, sep = '\\\\n')\\nRead 1 item\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n;; simple, but reads the whole file\\n(define s1 (list-ref (file->lines \\\"some-file\\\") 6))\\n\\n;; more efficient: read and discard n-1 lines\\n(define s2\\n (call-with-input-file \\\"some-file\\\"\\n (λ(i) (for/last ([line (in-lines i)] [n 7]) line))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"say lines[6] // die \\\"Short file\\\";\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"x: pick read/lines request-file/only 7\\neither x [print x] [print \\\"No seventh line\\\"]\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \">> x: pick read/lines %file.txt 7\\n\\ncase [\\n x = none [print \\\"File has less than seven lines\\\"]\\n (length? x) = 0 [print \\\"Line 7 is empty\\\"]\\n (length? x) > 0 [print append \\\"Line seven = \\\" x]\\n]\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"/*REXX program reads a specific line from a file (and displays the length and content).*/\\nparse arg FID n . /*obtain optional arguments from the CL*/\\nif FID=='' | FID==\\\",\\\" then FID= 'JUNK.TXT' /*not specified? Then use the default.*/\\nif n=='' | n==\\\",\\\" then n=7 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n\\nif lines(FID)==0 then call ser \\\"wasn't found.\\\" /*see if the file exists (or not). */\\n\\ncall linein FID, n-1 /*read the record previous to N. */\\nif lines(FID)==0 then call ser \\\"doesn't contain\\\" N 'lines.'\\n /* [↑] any more lines to read in file?*/\\n\\n$=linein(FID) /*read the Nth record in the file. */\\n\\nsay 'File ' FID \\\" line \\\" N ' has a length of: ' length($)\\nsay 'File ' FID \\\" line \\\" N 'contents: ' $ /*display the contents of the Nth line.*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nser: say; say '***error!*** File ' FID \\\" \\\" arg(1); say; exit 13\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program reads a specific line from a file (and displays the length and content).*/\\nparse arg FID n . /*obtain optional arguments from the CL*/\\nif FID=='' | FID==\\\",\\\" then FID= 'JUNK.TXT' /*not specified? Then use the default.*/\\nif n=='' | n==\\\",\\\" then n=7 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n\\nif lines(FID)==0 then call ser \\\"wasn't found.\\\" /*see if the file exists (or not). */\\n\\n do n-1\\n call linein FID /*read all the lines previous to N. */\\n end /*n-1*/\\n\\nif lines(FID)==0 then call ser \\\"doesn't contain\\\" N 'lines.'\\n /* [↑] any more lines to read in file?*/\\n\\n$=linein(FID) /*read the Nth record in the file. */\\n\\nsay 'File ' FID \\\" line \\\" N ' has a length of: ' length($)\\nsay 'File ' FID \\\" line \\\" N 'contents: ' $ /*display the contents of the Nth line.*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nser: say; say '***error!*** File ' FID \\\" \\\" arg(1); say; exit 13\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"fp = fopen(\\\"C:\\\\Ring\\\\ReadMe.txt\\\",\\\"r\\\")\\nn = 0\\n\\nr = \\\"\\\"\\nwhile isstring(r)\\n while n < 8\\n r = fgetc(fp)\\n if r = char(10) n++ see nl\\n else see r ok\\n end\\nend\\nfclose(fp)\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \" seventh_line = open(\\\"/etc/passwd\\\").each_line.take(7).last\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"fileName$ = \\\"f:\\\\sample.txt\\\"\\nrequiredLine = 7\\nopen fileName$ for input as #f\\n\\nfor i = 1 to requiredLine\\n if not(eof(#f)) then line input #f, a$\\nnext i\\nclose #f\\nprint a$\\nend\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use std::fs::File;\\nuse std::io::BufRead;\\nuse std::io::BufReader;\\nuse std::io::Error;\\nuse std::path::Path;\\n\\nfn main() {\\n let path = Path::new(\\\"file.txt\\\");\\n let line_num = 7usize;\\n let line = get_line_at(&path, line_num - 1);\\n println!(\\\"{}\\\", line.unwrap());\\n}\\n\\nfn get_line_at(path: &Path, line_num: usize) -> Result<String, Error> {\\n let file = File::open(path).expect(\\\"File not found or cannot be opened\\\");\\n let content = BufReader::new(&file);\\n let mut lines = content.lines();\\n lines.nth(line_num).expect(\\\"No line found at that position\\\")\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"use std::env;\\nuse std::fs::File;\\nuse std::io::BufRead;\\nuse std::io::BufReader;\\nuse std::path::Path;\\n\\nfn main() {\\n if env::args().len() <= 1 {\\n println!(\\\"At least a path to a file is needed: No file path given\\\");\\n return;\\n } else {\\n let path = &env::args().nth(1).expect(\\\"could not parse the path\\\");\\n let path = Path::new(&path);\\n let mut line_num = 1usize;\\n if let Some(arg) = env::args().nth(2) {\\n line_num = arg.parse::<usize>().expect(\\\"Parsing line number failed\\\");\\n }\\n print_line_at(&path, line_num);\\n }\\n}\\n\\nfn print_line_at(path: &Path, line_num: usize) {\\n if line_num < 1 {\\n panic!(\\\"Line number has to be > 0\\\");\\n }\\n let line_num = line_num - 1;\\n let file = File::open(path).expect(\\\"File not found or cannot be opened\\\");\\n let content = BufReader::new(&file);\\n let mut lines = content.lines();\\n let line = lines.nth(line_num).expect(\\\"No line found at given position\\\");\\n println!(\\\"{}\\\", line.expect(\\\"None line\\\"));\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"val lines = io.Source.fromFile(\\\"input.txt\\\").getLines\\nval seventhLine = lines drop(6) next\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"var lines: Iterator[String] = _\\ntry {\\n lines = io.Source.fromFile(\\\"input.txt\\\").getLines drop(6)\\n} catch {\\n case exc: java.io.IOException =>\\n println(\\\"File not found\\\")\\n}\\nvar seventhLine: String = _\\nif (lines != null) {\\n if (lines.isEmpty) println(\\\"too few lines in file\\\")\\n else seventhLine = lines next\\n}\\nif (\\\"\\\" == seventhLine) println(\\\"line is empty\\\")\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"val file = try Left(io.Source.fromFile(\\\"input.txt\\\")) catch {\\n case exc => Right(exc.getMessage)\\n}\\nval seventhLine = (for(f <- file.left;\\n line <- f.getLines.toStream.drop(6).headOption.toLeft(\\\"too few lines\\\").left) yield\\n if (line == \\\"\\\") Right(\\\"line is empty\\\") else Left(line)).joinLeft\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"sed -n 7p\\n\",\n \"language\": \"Sed\"\n },\n {\n \"code\": \"sed '7h;$!d;x;s/^$/Error: no such line/'\\n\",\n \"language\": \"Sed\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst func string: getLine (inout file: aFile, in var integer: lineNum) is func\\n result\\n var string: line is \\\"\\\";\\n begin\\n while lineNum > 1 and hasNext(aFile) do\\n readln(aFile);\\n decr(lineNum);\\n end while;\\n line := getln(aFile);\\n end func;\\n\\nconst proc: main is func\\n local\\n var string: fileName is \\\"input.txt\\\";\\n var file: aFile is STD_NULL;\\n var string: line is \\\"\\\";\\n begin\\n aFile := open(fileName, \\\"r\\\");\\n if aFile = STD_NULL then\\n writeln(\\\"Cannot open \\\" <& fileName);\\n else\\n line := getLine(aFile, 7);\\n if eof(aFile) then\\n writeln(\\\"The file does not have 7 lines\\\");\\n else\\n writeln(\\\"The 7th line of the file is:\\\");\\n writeln(line);\\n end if;\\n end if;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"put line 7 of file \\\"example.txt\\\" into theLine\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"func getNthLine(filename, n) {\\n var file = File(filename)\\n file.open_r.each { |line|\\n Num($.) == n && return line\\n }\\n warn \\\"file #{file} does not have #{n} lines, only #{$.}\\\\n\\\"\\n return nil\\n}\\n\\nvar line = getNthLine(\\\"/etc/passwd\\\", 7)\\nsay line if defined(line)\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"line := (StandardFileStream oldFileNamed: 'test.txt') contents lineNumber: 7.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"lines = #.readlines(\\\"test.txt\\\")\\n#.output(\\\"Seventh line of text:\\\")\\n? #.size(lines,1)<7\\n #.output(\\\"is absent\\\")\\n!\\n #.output(lines[7])\\n.\\n\",\n \"language\": \"SPL\"\n },\n {\n \"code\": \"* Read rows 20 to 30 from somedata.dta\\n. use somedata in 20/30, clear\\n\\n* Read rows for which the variable x is positive\\n. use somedata if x>0, clear\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"capture use somedata in 7, clear\\nif _rc {\\n\\tdisplay \\\"Too few lines\\\"\\n}\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"proc getNthLineFromFile {filename n} {\\n set f [open $filename]\\n while {[incr n -1] > 0} {\\n if {[gets $f line] < 0} {\\n close $f\\n error \\\"no such line\\\"\\n }\\n }\\n close $f\\n return $line\\n}\\n\\nputs [getNthLineFromFile example.txt 7]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"LET filename$ = \\\"input.txt\\\"\\nOPEN #1: NAME filename$, ORG TEXT, ACCESS INPUT, CREATE OLD\\n\\nLET lineapedida = 7\\nLET cont = 0\\nDO\\n LINE INPUT #1: linea$\\n LET cont = cont + 1\\n IF cont = lineapedida THEN\\n IF TRIM$(linea$) = \\\"\\\" THEN PRINT \\\"The 7th line is empty\\\" ELSE PRINT linea$\\n EXIT DO\\n END IF\\nLOOP UNTIL END #1\\nIF cont < lineapedida THEN PRINT \\\"There are only \\\"; cont; \\\" lines in the file\\\"\\nCLOSE #1\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nfile=\\\"lines.txt\\\"\\nERROR/STOP OPEN (file,READ,-std-)\\nline2fetch=7\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"@(skip nil 7)\\n@line\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"@(skip)\\n@line\\n@(skip 1 2)\\n@(eof)\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"get_nth_line() {\\n local file=$1 n=$2 line\\n while ((n-- > 0)); do\\n if ! IFS= read -r line; then\\n echo \\\"No such line $2 in $file\\\"\\n return 1\\n fi\\n done < \\\"$file\\\"\\n echo \\\"$line\\\"\\n}\\n\\nget_nth_line filename 7\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"awk NR==7 filename\\nsed -n 7p filename\\nhead -n 7 filename | tail -n 1\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"decl string<> lines\\ndecl file f\\nf.open \\\"filename.txt\\\"\\nset lines (f.readlines)\\nf.close\\n\\nif (< (size lines) 7)\\n out \\\"the file has less than seven lines\\\" endl console\\n stop\\nend if\\n\\nout \\\"the seventh line in the file is:\\\" endl endl console\\nout lines<6> endl console\\n\",\n \"language\": \"Ursa\"\n },\n {\n \"code\": \"Function read_line(filepath,n)\\n\\tSet objFSO = CreateObject(\\\"Scripting.FileSystemObject\\\")\\n\\tSet objFile = objFSO.OpenTextFile(filepath,1)\\n\\tarrLines = Split(objFile.ReadAll,vbCrLf)\\n\\tIf UBound(arrLines) >= n-1 Then\\n\\t\\tIf arrLines(n-1) <> \\\"\\\" Then\\n\\t\\t\\tread_line = arrLines(n-1)\\n\\t\\tElse\\n\\t\\t\\tread_line = \\\"Line \\\" & n & \\\" is null.\\\"\\n\\t\\tEnd If\\n\\tElse\\n\\t\\tread_line = \\\"Line \\\" & n & \\\" does not exist.\\\"\\n\\tEnd If\\n\\tobjFile.Close\\n\\tSet objFSO = Nothing\\nEnd Function\\n\\nWScript.Echo read_line(\\\"c:\\\\temp\\\\input.txt\\\",7)\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"File_Open(\\\"example.txt\\\", BROWSE)\\nGoto_Line(7)\\nif (Cur_Line < 7) {\\n Statline_Message(\\\"File contains too few lines\\\")\\n} else {\\n if (At_EOL) {\\n Statline_Message(\\\"Empty line\\\")\\n }\\n Reg_Copy(10, 1)\\n}\\nBuf_Close(NOMSG)\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"import \\\"io\\\" for File\\n\\nvar lines = File.read(\\\"input.txt\\\").replace(\\\"\\\\r\\\", \\\"\\\").split(\\\"\\\\n\\\")\\nif (lines.count < 7) {\\n System.print(\\\"There are only %(lines.count) lines in the file\\\")\\n} else {\\n var line7 = lines[6].trim()\\n if (line7 == \\\"\\\") {\\n System.print(\\\"The seventh line is empty\\\")\\n } else {\\n System.print(\\\"The seventh line is : %(line7)\\\")\\n }\\n}\\n\\n/* Note that 'input.txt' contains the eight lines:\\nLine 1\\nLine 2\\nLine 3\\nLine 4\\nLine 5\\nLine 6\\nLine 7\\nLine 8\\n*/\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"include c:\\\\cxpl\\\\codes; \\\\intrinsic 'code' declarations\\ndef MaxLen = 82; \\\\maximum length of line that can be stored (incl CR+LF)\\n\\nfunc ReadLine(N, L); \\\\Read line N from input file and return it in string L\\nint N; char L;\\nint I, C;\\n[for I:= 1 to N-1 do \\\\skip to start of specified line\\n repeat C:= ChIn(1);\\n if C = $1A\\\\EOF\\\\ then\\n [Text(0, \\\"File only has \\\"); IntOut(0, I);\\n Text(0, \\\" lines^M^J\\\"); return false];\\n until C = $0A\\\\LF\\\\;\\nI:= 0;\\nrepeat C:= ChIn(1);\\n if C = $1A\\\\EOF\\\\ then\\n [Text(0, \\\"Line is empty (EOF)^M^L\\\"); return false];\\n L(I):= C; I:= I+1;\\nuntil C=$0A\\\\LF\\\\ or I>=MaxLen;\\nif I >= MaxLen then Text(0, \\\"Line might be truncated^M^J\\\");\\nif I = 2 then Text(0, \\\"Line is empty^M^J\\\");\\nL(I-1):= L(I-1) ! $80; \\\\terminate string\\nreturn true;\\n];\\n\\nchar LineN(MaxLen);\\nif ReadLine(7, LineN) then Text(0, LineN)\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"filename$ = \\\"input.txt\\\"\\nopen filename$ for reading as #1\\n\\nlineapedida = 7\\ncont = 0\\nwhile not eof(#1)\\n line input #1 linea$\\n cont = cont + 1\\n if cont = lineapedida then\\n\\tif trim$(linea$) = \\\"\\\" then print \\\"The 7th line is empty\\\" else print linea$ : fi\\n\\tbreak\\n end if\\nwend\\nif cont < lineapedida print \\\"There are only \\\", cont, \\\" lines in the file\\\"\\nclose #1\\nend\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"reg line; do(7){line=File.stdin.readln()} println(\\\">>>\\\",line);\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"lines:=File.stdin.readln(7); println(\\\">>>\\\",line[-1]);\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Read-a-specific-line-from-a-file"}}},{"rowIdx":1568,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Arithmetic operations\n- Simple\nfrom: http://rosettacode.org/wiki/Real_constants_and_functions\nnote: Basic language learning\n","language":"00-META"},{"code":";Task:\nShow how to use the following math constants and functions in your language (if not available, note it):\n:* <big>''e''</big> (base of the natural logarithm)\n:* <big><math>\\pi</math></big>\n:* square root\n:* logarithm (any base allowed)\n:* exponential (<big>''e''<sup>''x''</sup></big> )\n:* absolute value (a.k.a. \"magnitude\")\n:* floor (largest integer less than or equal to this number--not the same as truncate or int)\n:* ceiling (smallest integer not less than this number--not the same as round up)\n:* power (<big>''x''<sup>''y''</sup></big> )\n\n\n;Related task:\n* [[Trigonometric Functions]]\n<br><br>\n\n","language":"00-TASK"},{"code":"math:e // e\nmath:pi // pi\nsqrt(x) // square root\nlog(x) // natural logarithm\nlog10(x) // base 10 logarithm\nexp(x) // e raised to the power of x\nabs(x) // absolute value\nfloor(x) // floor\nceil(x) // ceiling\nx ^ y // exponentiation\n","language":"11l"},{"code":"GetAbs: ;assumes value we want to abs() is loaded into accumulator\neor #$ff\nclc\nadc #1\nrts\n","language":"6502-Assembly"},{"code":"(floor 15 2) ;; This is the floor of 15/2\n(ceiling 15 2)\n(expt 15 2) ;; 15 squared\n","language":"ACL2"},{"code":"define floor(x);\n if x < 0 then\n -intof(x);\n else\n intof(x);\n endif;\nenddefine;\n\ndefine ceiling(x);\n -floor(-x);\nenddefine;\n","language":"ACL2"},{"code":"INCLUDE \"H6:REALMATH.ACT\"\n\nPROC Euler(REAL POINTER e)\n REAL x\n\n IntToReal(1,x)\n Exp(x,e)\nRETURN\n\nPROC Main()\n REAL a,b,c\n INT i\n\n Put(125) PutE() ;clear screen\n MathInit()\n\n Euler(a)\n Print(\"e=\") PrintR(a)\n PrintE(\" by Exp(1)\")\n\n ValR(\"2\",a)\n Sqrt(a,b)\n Print(\"Sqrt(\") PrintR(a)\n Print(\")=\") PrintR(b)\n Print(\" by Power(\") PrintR(a)\n PrintE(\",0.5)\")\n\n ValR(\"2.5\",a)\n Ln(a,b)\n Print(\"Ln(\") PrintR(a)\n Print(\")=\") PrintRE(b)\n\n ValR(\"14.2\",a)\n Log10(a,b)\n Print(\"Log10(\") PrintR(a)\n Print(\")=\") PrintRE(b)\n\n ValR(\"-3.7\",a)\n Exp(a,b)\n Print(\"Exp(\") PrintR(a)\n Print(\")=\") PrintRE(b)\n\n ValR(\"2.6\",a)\n Exp10(a,b)\n Print(\"Exp10(\") PrintR(a)\n Print(\")=\") PrintRE(b)\n\n ValR(\"25.3\",a)\n ValR(\"1.3\",b)\n Power(a,b,c)\n Print(\"Power(\") PrintR(a)\n Print(\",\") PrintR(b)\n Print(\")=\") PrintRE(c)\n\n ValR(\"-32.5\",a)\n RealAbs(a,b)\n Print(\"Abs(\") PrintR(a)\n Print(\")=\") PrintR(b)\n PrintE(\" by bit manipulation\")\n\n ValR(\"23.15\",a)\n i=Floor(a)\n Print(\"Floor(\") PrintR(a)\n PrintF(\")=%I by own function%E\",i)\n\n ValR(\"-23.15\",a)\n i=Floor(a)\n Print(\"Floor(\") PrintR(a)\n PrintF(\")=%I by own function%E\",i)\n\n ValR(\"23.15\",a)\n i=Ceiling(a)\n Print(\"Ceiling(\") PrintR(a)\n PrintF(\")=%I by own function%E\",i)\n\n ValR(\"-23.15\",a)\n i=Ceiling(a)\n Print(\"Ceiling(\") PrintR(a)\n PrintF(\")=%I by own function%E\",i)\n\n PutE()\n PrintE(\"There is no support in Action! for pi.\")\nRETURN\n","language":"Action-"},{"code":"Math.E; //e\nMath.PI; //pi\nMath.sqrt(u); //square root of u\nMath.log(u); //natural logarithm of u\nMath.exp(u); //e to the power of u\nMath.abs(u); //absolute value of u\nMath.floor(u);//floor of u\nMath.ceil(u); //ceiling of u\nMath.pow(u,v);//u to the power of v\n","language":"ActionScript"},{"code":"Math.LN10; // natural logarithm of 10\nMath.LN2; // natural logarithm of 2\nMath.LOG10E; // base-10 logarithm of e\nMath.LOG2E; // base-2 logarithm of e\nMath.SQRT1_2;// square root of 1/2\nMath.SQRT2; //square root of 2\n","language":"ActionScript"},{"code":"Ada.Numerics.e -- Euler's number\nAda.Numerics.pi -- pi\nsqrt(x) -- square root\nlog(x, base) -- logarithm to any specified base\nexp(x) -- exponential\nabs(x) -- absolute value\nS'floor(x) -- Produces the floor of an instance of subtype S\nS'ceiling(x) -- Produces the ceiling of an instance of subtype S\nx**y -- x raised to the y power\n","language":"Ada"},{"code":"# e\nexp(1);\n# pi\n2 * asin(1);\n\nsqrt(x);\nlog(x);\nexp(x);\nfabs(x);\nfloor(x);\nceil(x);\npow(x, y);\n","language":"Aime"},{"code":"REAL x:=exp(1), y:=4*atan(1);\nprintf(($g(-8,5)\"; \"$,\n exp(1), # e #\n pi, # pi #\n sqrt(x), # square root #\n log(x), # logarithm base 10 #\n ln(x), # natural logarithm #\n exp(x), # exponential #\n ABS x, # absolute value #\n ENTIER x, # floor #\n -ENTIER -x, # ceiling #\n x ** y # power #\n))\n","language":"ALGOL-68"},{"code":"begin\n real t, u;\n t := 10;\n u := -2.3;\n i_w := 4; s_w := 0; r_format := \"A\"; r_d := 4; r_w := 9; % set output format %\n write( \" e: \", exp( 1 ) ); % e %\n write( \" pi: \", pi ); % pi %\n write( \" root t: \", sqrt( t ) ); % square root %\n write( \" log t: \", log( t ) ); % log base 10 %\n write( \" ln t: \", ln( t ) ); % log base e %\n write( \" exp u: \", exp( u ) ); % exponential %\n write( \" abs u: \", abs u ); % absolute value %\n write( \" floor pi: \", entier( pi ) ); % floor %\n write( \"ceiling pi: \", - entier( - pi ) ); % ceiling %\n % the raise-to-the-power operator is \"**\" - it only allows integers for the power %\n write( \" pi cubed: \", pi ** 3 ) % use exp( ln( x ) * y ) for general x^y %\nend.\n","language":"ALGOL-W"},{"code":"100 HOME : REM 10 CLS for GW-BASIC or MSX Basic or QBasic\n110 PRINT \"e = \";EXP(1) \t\t:REM e not available\n120 PRINT \"PI = \";4 * ATN(1) \t:REM pi not available\n130 X = 12.345\n140 Y = 1.23\n150 PRINT \"sqrt = \";SQR(X) \t\t:REM square root\n160 PRINT \"ln = \";LOG(X) \t\t:REM natural logarithm base e\n170 PRINT \"log10 = \";LOG(X)/LOG(10) :REM base 10 logarithm\n180 PRINT \"log = \";LOG(X)/LOG(Y) :REM arbitrary base logarithm\n190 PRINT \"exp = \";EXP(X) \t\t:REM exponential\n200 PRINT \"abs = \";ABS(-X) \t\t:REM absolute value\n210 PRINT \"floor = \"; \t\t\t\t:REM floor not available\n220 IF X > 0 THEN PRINT INT(X)\n230 IF X <= 0 AND X <> INT(X) THEN PRINT INT(X)-1\n240 IF X <= 0 AND X = INT(X) THEN PRINT INT(X)\n250 PRINT \"ceil = \"; \t\t\t\t:REM ceil not available\n260 IF X < 0 THEN PRINT INT(X)\n270 IF X >= 0 THEN PRINT INT(X)+1\n280 PRINT \"power = \";X^Y \t\t\t:REM power\n290 END\n","language":"Applesoft-BASIC"},{"code":"/* functions not availables */\n","language":"ARM-Assembly"},{"code":"print [\"Euler:\" e]\nprint [\"Pi:\" pi]\n\nprint [\"sqrt 2.0:\" sqrt 2.0]\nprint [\"ln 100:\" ln 100]\nprint [\"log(10) 100:\" log 100 10]\nprint [\"exp 3:\" exp 3]\nprint [\"abs -1:\" abs neg 1]\nprint [\"floor 23.536:\" floor 23.536]\nprint [\"ceil 23.536:\" ceil 23.536]\nprint [\"2 ^ 8:\" 2 ^ 8]\n","language":"Arturo"},{"code":"real e = exp(1); // e not available\nwrite(\"e = \", e);\nwrite(\"pi = \", pi);\n\nreal x = 12.345;\nreal y = 1.23;\n\nwrite(\"sqrt = \", sqrt(2)); // square root\nwrite(\"ln = \", log(e)); // natural logarithm base e\nwrite(\"log = \", log10(x)); // base 10 logarithm\nwrite(\"log1p = \", log1p(x)); // log (1+x)\nwrite(\"exp = \", exp(e)); // exponential\nwrite(\"abs = \", abs(-1)); // absolute value\nwrite(\"fabs = \", fabs(-1)); // absolute value\nwrite(\"floor = \", floor(-e)); // floor\nwrite(\"ceil = \", ceil(-e)); // ceiling\nwrite(\"power = \", x ^ y); // power\nwrite(\"power = \", x ** y); // power\n","language":"Asymptote"},{"code":"Sqrt(Number) ; square root\nLog(Number) ; logarithm (base 10)\nLn(Number) ; natural logarithm (base e)\nExp(N) ; e to the power N\nAbs(Number) ; absolute value\nFloor(Number) ; floor\nCeil(Number) ; ceiling\nx**y ; x to the power y\n","language":"AutoHotkey"},{"code":"e:=exp(1)\npi:=2*asin(1)\n","language":"AutoHotkey"},{"code":"Sin(Number) ; sine\nCos(Number) ; cosine\nTan(Number) ; tangent\nASin(Number) ; arcsine\nACos(Number) ; arccosine\nATan(Number) ; arctangent\n","language":"AutoHotkey"},{"code":"BEGIN {\n\tprint sqrt(2)\t\t# square root\n\tprint log(2)\t\t# logarithm base e\n\tprint exp(2)\t\t# exponential\n\tprint 2 ^ -3.4\t\t# power\n}\n# outputs 1.41421, 0.693147, 7.38906, 0.0947323\n","language":"AWK"},{"code":"BEGIN {\n\tE = exp(1)\n\tPI = atan2(0, -1)\n}\n\nfunction abs(x) {\n\treturn x < 0 ? -x : x\n}\n\nfunction floor(x) {\n\ty = int(x)\n\treturn y > x ? y - 1 : y\n}\n\nfunction ceil(x) {\n\ty = int(x)\n\treturn y < x ? y + 1 : y\n}\n\nBEGIN {\n\tprint E\n\tprint PI\n\tprint abs(-3.4)\t\t# absolute value\n\tprint floor(-3.4)\t# floor\n\tprint ceil(-3.4)\t# ceiling\n}\n# outputs 2.71828, 3.14159, 3.4, -4, -3\n","language":"AWK"},{"code":"√(X)\n","language":"Axe"},{"code":"√(Y)ʳ\n","language":"Axe"},{"code":"ln(X)\n","language":"Axe"},{"code":"e^(X)\n","language":"Axe"},{"code":"abs(X)\n","language":"Axe"},{"code":"e = exp(1) # e not available\nprint \"e = \"; e\nprint \"PI = \"; PI\n\nx = 12.345\ny = 1.23\n\nprint \"sqrt = \"; sqr(x) # square root\nprint \"ln = \"; log(e) # natural logarithm base e\nprint \"log10 = \"; log10(e) # base 10 logarithm\nprint \"log = \"; log(x)/log(y)\t # arbitrary base logarithm\nprint \"exp = \"; exp(e) # exponential\nprint \"abs = \"; abs(-1) # absolute value\nprint \"floor = \"; floor(-e) # floor\nprint \"ceil = \"; ceil(-e) # ceiling\nprint \"power = \"; x ^ y # power\n","language":"BASIC256"},{"code":" e = EXP(1)\n Pi = PI\n Sqr2 = SQR(2)\n Ln2 = LN(2)\n Log2 = LOG(2) : REM Base 10\n Exp2 = EXP(2)\n Abs2 = ABS(-2)\n Floor = INT(1.234)\n Ceil = FNceil(1.234)\n Power = 1.23^4\n END\n\n DEF FNceil(n) = INT(n) - (INT(n) <> n)\n","language":"BBC-BASIC"},{"code":"scale = 6\nsqrt(2)\t\t/* 1.414213\tsquare root */\n4.3 ^ -2\t/* .054083\tpower (integer exponent) */\n","language":"Bc"},{"code":"scale = 6\nl(2)\t\t/* .693147\tnatural logarithm */\ne(2)\t\t/* 7.389056\texponential */\n\np = 4 * a(1)\ne = e(1)\np\t\t/* 3.141592\tpi to 6 fractional digits */\ne\t\t/* 2.178281\te to 6 fractional digits */\n\ne(l(2) * -3.4)\t/* .094734\t2 to the power of -3.4 */\nl(1024) / l(2)\t/* 10.000001\tlogarithm base 2 of 1024 */\n","language":"Bc"},{"code":"/* absolute value */\ndefine v(x) {\n\tif (x < 0) return (-x)\n\treturn (x)\n}\n\n/* floor */\ndefine f(x) {\n\tauto s, y\n\n\ts = scale\n\tscale = 0\n\ty = x / 1\n\tscale = s\n\n\tif (y > x) return (y - 1)\n\treturn (y)\n}\n\n/* ceiling */\ndefine g(x) {\n\tauto s, y\n\n\ts = scale\n\tscale = 0\n\ty = x / 1\n\tscale = s\n\n\tif (y < x) return (y + 1)\n\treturn (y)\n}\n\nv(-3.4)\t\t/* 3.4\t\tabsolute value */\nf(-3.4)\t\t/* -4\t\tfloor */\ng(-3.4)\t\t/* -3\t\tceiling */\n","language":"Bc"},{"code":"{e}\n","language":"Blz"},{"code":"{pi}\n","language":"Blz"},{"code":"x ** 0.5\n","language":"Blz"},{"code":"x __ n\n","language":"Blz"},{"code":"{e} ** x\n","language":"Blz"},{"code":"abs(x)\n","language":"Blz"},{"code":"floor(x)\n","language":"Blz"},{"code":"ceil(x)\n","language":"Blz"},{"code":"x ** y\n","language":"Blz"},{"code":" ⋆1 # e and e^x\n2.718281828459045\n π # pi\n3.141592653589793\n √2 # square root\n1.414213562373095\n 2⋆⁼10 # logarithm base n (inverse power)\n3.321928094887363\n |-1 # absolute value\n1\n ⌊3.2 # floor\n3\n ⌈3.2 # ceiling\n4\n 3⋆4 # power\n81\n","language":"BQN"},{"code":"x \\D (10^x) { \\D is the differentiation operator }\n","language":"Bracmat"},{"code":"10^x*e\\L10 { \\L is the logarithm operator }\n","language":"Bracmat"},{"code":"#include <math.h>\n\nM_E; /* e - not standard but offered by most implementations */\nM_PI; /* pi - not standard but offered by most implementations */\nsqrt(x); /* square root--cube root also available in C99 (cbrt) */\nlog(x); /* natural logarithm--log base 10 also available (log10) */\nexp(x); /* exponential */\nabs(x); /* absolute value (for integers) */\nfabs(x); /* absolute value (for doubles) */\nfloor(x); /* floor */\nceil(x); /* ceiling */\npow(x,y); /* power */\n","language":"C"},{"code":"#include <iostream>\n#include <cmath>\n\n#ifdef M_E\nstatic double euler_e = M_E;\n#else\nstatic double euler_e = std::exp(1); // standard fallback\n#endif\n\n#ifdef M_PI\nstatic double pi = M_PI;\n#else\nstatic double pi = std::acos(-1);\n#endif\n\nint main()\n{\n std::cout << \"e = \" << euler_e\n << \"\\npi = \" << pi\n << \"\\nsqrt(2) = \" << std::sqrt(2.0)\n << \"\\nln(e) = \" << std::log(euler_e)\n << \"\\nlg(100) = \" << std::log10(100.0)\n << \"\\nexp(3) = \" << std::exp(3.0)\n << \"\\n|-4.5| = \" << std::abs(-4.5) // or std::fabs(-4.5); both work in C++\n << \"\\nfloor(4.5) = \" << std::floor(4.5)\n << \"\\nceiling(4.5) = \" << std::ceil(4.5)\n << \"\\npi^2 = \" << std::pow(pi,2.0) << std::endl;\n}\n","language":"C++"},{"code":"#include <iostream>\n#include <iomanip>\n#include <cmath>\n#include <boost/math/constants/constants.hpp>\n\nint main()\n{\n using namespace boost::math::double_constants;\n std::cout << \"e = \" << std::setprecision(18) << e\n << \"\\ne³ = \" << std::exp(3.0)\n << \"\\nπ = \" << pi\n << \"\\nπ² = \" << pi_sqr\n << \"\\n√2 = \" << root_two\n << \"\\nln(e) = \" << std::log(e)\n << \"\\nlg(100) = \" << std::log10(100.0)\n << \"\\n|-4.5| = \" << std::abs(-4.5)\n << \"\\nfloor(4.5) = \" << std::floor(4.5)\n << \"\\nceiling(4.5) = \" << std::ceil(4.5) << std::endl;\n}\n","language":"C++"},{"code":"using System;\n\nclass Program {\n static void Main(string[] args) {\n Console.WriteLine(Math.E); //E\n Console.WriteLine(Math.PI); //PI\n Console.WriteLine(Math.Sqrt(10)); //Square Root\n Console.WriteLine(Math.Log(10)); // Logarithm\n Console.WriteLine(Math.Log10(10)); // Base 10 Logarithm\n Console.WriteLine(Math.Exp(10)); // Exponential\n Console.WriteLine(Math.Abs(10)); //Absolute value\n Console.WriteLine(Math.Floor(10.0)); //Floor\n Console.WriteLine(Math.Ceiling(10.0)); //Ceiling\n Console.WriteLine(Math.Pow(2, 5)); // Exponentiation\n }\n}\n","language":"C-sharp"},{"code":"100 cls\n110 print \"e = \";exp(1)' e not available\n120 print \"PI = \";4*arctan(1)' pi not available\n130 x = 12.345\n140 y = 1.23\n150 print \"sqrt = \";sqr(x)' square root\n160 print \"ln = \";log(x)' natural logarithm base e\n170 print \"log10 = \";log(x)/log(10)' base 10 logarithm\n180 print \"log = \";log(x)/log(y)' arbitrary base logarithm\n190 print \"exp = \";exp(x)' exponential\n200 print \"abs = \";abs(-x)' absolute value\n210 print \"floor = \";floor(x)' floor\n220 print \"ceil = \"; : ceil(x)' ceil easily implemented as function\n230 print \"power = \";x^y ' power\n240 end\n250 sub ceil(x)\n260 if x < 0 then print int(x) else print int(x)+1\n270 end sub\n","language":"Chipmunk-Basic"},{"code":"(Math/E); //e\n(Math/PI); //pi\n(Math/sqrt x); //square root--cube root also available (cbrt)\n(Math/log x); //natural logarithm--log base 10 also available (log10)\n(Math/exp x); //exponential\n(Math/abs x); //absolute value\n(Math/floor x); //floor\n(Math/ceil x); //ceiling\n(Math/pow x y); //power\n","language":"Clojure"},{"code":"(ns user (:require [clojure.contrib.math :as math]))\n(math/sqrt x)\n(math/abs x)\n(math/floor x)\n(math/ceil x)\n(math/expt x y)\n","language":"Clojure"},{"code":"(ns user (:require [clojure.contrib.generic.math-functions :as generic]))\n(generic/sqrt x)\n(generic/log x)\n(generic/exp x)\n(generic/abs x)\n(generic/floor x)\n(generic/ceil x)\n(generic/pow x y)\n","language":"Clojure"},{"code":"E *> e\nPI *> Pi\nSQRT(n) *> Sqaure root\nLOG(n) *> Natural logarithm\nLOG10(n) *> Logarithm (base 10)\nEXP(n) *> e to the nth power\nABS(n) *> Absolute value\nINTEGER(n) *> While not a proper floor function, it is implemented in the same way.\n*> There is no ceiling function. However, it could be implemented like so:\nADD 1 TO N\nMOVE INTEGER(N) TO Result\n*> There is no pow function, although the COMPUTE verb does have an exponention operator.\nCOMPUTE Result = N ** 2\n","language":"COBOL"},{"code":"FACTORIAL(n) *> Factorial\nEXP10(n) *> 10 to the nth power\n*> Trigonometric functions, including inverse ones, named as would be expected.\n","language":"COBOL"},{"code":"(exp 1) ; e (Euler's number)\npi ; pi constant\n(sqrt x) ; square root: works for negative reals and complex\n(log x) ; natural logarithm: works for negative reals and complex\n(log x 10) ; logarithm base 10\n(exp x) ; exponential\n(abs x) ; absolute value: result exact if input exact: (abs -1/3) -> 1/3.\n(floor x) ; floor: restricted to real, two valued (second value gives residue)\n(ceiling x) ; ceiling: restricted to real, two valued (second value gives residue)\n(expt x y) ; power\n","language":"Common-Lisp"},{"code":"x = 3.25\ny = 4\n\nputs x.abs # absolute value\nputs x.floor # floor\nputs x.ceil # ceiling\nputs x ** y # power\nputs\n\ninclude Math # without including\n\nputs E # puts Math::E -- exponential constant\nputs PI # puts Math::PI -- Archimedes circle constant\nputs TAU # puts Math::TAU -- the correct circle constant, >= version 0.36\nputs sqrt(x) # puts Math.sqrt(x) -- real square root\nputs log(x) # puts Math.log(x) -- natural logarithm\nputs log10(x) # puts Math.log10(x) -- base 10 logarithm\nputs log(x, y) # puts Math.log(x, y) -- logarithm x base y\nputs exp(x) # puts Math.exp(x) -- exponential\nputs E**x # puts Math::E**x -- same\n","language":"Crystal"},{"code":"import std.math ; // need to import this module\nE // Euler's number\nPI // pi constant\nsqrt(x) // square root\nlog(x) // natural logarithm\nlog10(x) // logarithm base 10\nlog2(x) // logarithm base 2\nexp(x) // exponential\nabs(x) // absolute value (= magnitude for complex)\nfloor(x) // floor\nceil(x) // ceiling\npow(x,y) // power\n","language":"D"},{"code":"Pi; // π (Pi)\nLogN(BASE, x) // log of x for a specified base\nLog2(x) // log of x for base 2\nLog10(x) // log of x for base 10\nFloor(x); // floor\nCeil(x); // ceiling\nPower(x, y); // power\n","language":"Delphi"},{"code":"? 1.0.exp()\n# value: 2.7182818284590455\n\n? 0.0.acos() * 2\n# value: 3.141592653589793\n\n? 2.0.sqrt()\n# value: 1.4142135623730951\n\n? 2.0.log()\n# value: 0.6931471805599453\n\n? 5.0.exp()\n# value: 148.4131591025766\n\n? (-5).abs()\n# value: 5\n\n? 1.2.floor()\n# value: 1\n\n? 1.2.ceil()\n# value: 2\n\n? 10 ** 6\n# value: 1000000\n","language":"E"},{"code":"# e is not available\n# pi\nprint pi\n# square root\nprint sqrt 2\n# logarithm base 10\nprint log10 1000\n# exponential is not available\n# absolute value\nprint abs -20\n# floor\nprint floor 1.5\n# ceiling is not available\n# power\nprint pow 2 10\n","language":"EasyLang"},{"code":"import system'math;\nimport extensions;\n\npublic program()\n{\n console.printLine(E_value); //E\n console.printLine(Pi_value); //PI\n console.printLine(10.sqrt()); //Square Root\n console.printLine(10.ln()); //Logarithm\n console.printLine(10.log10()); // Base 10 Logarithm\n console.printLine(10.exp()); //Exponential\n console.printLine(10.Absolute); //Absolute value\n console.printLine(10.0r.floor()); //Floor\n console.printLine(10.0r.ceil()); //Ceiling\n console.printLine(2.power(5)); //Exponentiation\n}\n","language":"Elena"},{"code":"defmodule Real_constants_and_functions do\n def main do\n IO.puts :math.exp(1) # e\n IO.puts :math.pi # pi\n IO.puts :math.sqrt(16) # square root\n IO.puts :math.log(10) # natural logarithm\n IO.puts :math.log10(10) # base 10 logarithm\n IO.puts :math.exp(2) # e raised to the power of x\n IO.puts abs(-2.24) # absolute value\n IO.puts Float.floor(3.1423) # floor\n IO.puts Float.ceil(20.125) # ceiling\n IO.puts :math.pow(3,2) # exponentiation\n end\nend\n\nReal_constants_and_functions.main\n","language":"Elixir"},{"code":"e -- e\npi -- pi\nsqrt x -- square root\nlogBase 3 9 -- logarithm (any base)\ne^x -- exponential\nabs x -- absolute value\nfloor x -- floor\nceiling x -- ceiling\n2 ^ 3 -- power\n","language":"Elm"},{"code":"% Implemented by Arjun Sunel\n-module(math_constants).\n-export([main/0]).\nmain() ->\n\tio:format(\"~p~n\",\t[math:exp(1)]\t\t),\t\t% e\n\tio:format(\"~p~n\",\t[math:pi()]\t\t),\t\t% pi\n\tio:format(\"~p~n\",\t[math:sqrt(16)]\t\t),\t\t% square root\n\tio:format(\"~p~n\",\t[math:log(10)]\t\t),\t\t% natural logarithm\t\t\t\n\tio:format(\"~p~n\",\t[math:log10(10)]\t),\t\t% base 10 logarithm\n\tio:format(\"~p~n\",\t[math:exp(2)]\t\t),\t\t% e raised to the power of x\n\tio:format(\"~p~n\",\t[abs(-2.24)]\t\t),\t\t% absolute value\n\tio:format(\"~p~n\",\t[floor(3.1423)]\t\t),\t\t% floor\n\tio:format(\"~p~n\",\t[ceil(20.125)]\t\t),\t\t% ceiling\n\tio:format(\"~p~n\",\t[math:pow(3,2)]\t ).\t\t% exponentiation\n\nfloor(X) when X < 0 ->\n\tT = trunc(X),\n\tcase X - T == 0 of\n\t\ttrue -> T;\n \tfalse -> T - 1\n\tend;\n\nfloor(X) ->\n\ttrunc(X).\n\n\nceil(X) when X < 0 ->\n\ttrunc(X);\n\nceil(X) ->\n\tT = trunc(X),\n\tcase X - T == 0 of\n\t\ttrue -> T;\n\t\tfalse -> T + 1\n\tend.\t\n","language":"Erlang"},{"code":"PROGRAM R_C_F\n\nFUNCTION CEILING(X)\n CEILING=INT(X)-(X-INT(X)>0)\nEND FUNCTION\n\nFUNCTION FLOOR(X)\n FLOOR=INT(X)\nEND FUNCTION\n\nBEGIN\n PRINT(EXP(1)) ! e not available\n PRINT(π) ! pi is available or ....\n PRINT(4*ATN(1)) ! .... equal to\n\n X=12.345\n Y=1.23\n\n PRINT(SQR(X),X^0.5) ! square root\n PRINT(LOG(X)) ! natural logarithm base e\n PRINT(LOG(X)/LOG(10)) ! base 10 logarithm\n PRINT(LOG(X)/LOG(Y)) ! arbitrary base logarithm (y>0)\n PRINT(EXP(X)) ! exponential\n PRINT(ABS(X)) ! absolute value\n PRINT(FLOOR(X)) ! floor\n PRINT(CEILING(X)) ! ceiling\n PRINT(X^Y) ! power\nEND PROGRAM\n","language":"ERRE"},{"code":"open System\n\nlet main _ =\n Console.WriteLine(Math.E); // e\n Console.WriteLine(Math.PI); // Pi\n Console.WriteLine(Math.Sqrt(10.0)); // Square Root\n Console.WriteLine(Math.Log(10.0)); // Logarithm\n Console.WriteLine(Math.Log10(10.0)); // Base 10 Logarithm\n Console.WriteLine(Math.Exp(10.0)); // Exponential\n Console.WriteLine(Math.Abs(10)); // Absolute value\n Console.WriteLine(Math.Floor(10.0)); // Floor\n Console.WriteLine(Math.Ceiling(10.0)); // Ceiling\n Console.WriteLine(Math.Pow(2.0, 5.0)); // Exponentiation\n\n 0\n","language":"F-Sharp"},{"code":"e ! e\npi ! π\nsqrt ! square root\nlog ! natural logarithm\nexp ! exponentiation\nabs ! absolute value\nfloor ! greatest whole number smaller than or equal\nceiling ! smallest whole number greater than or equal\ntruncate ! remove the fractional part (i.e. round towards 0)\nround ! round to next whole number\n^ ! power\n","language":"Factor"},{"code":"Float.e\nFloat.pi\n9f.sqrt\n9f.log // natural logarithm\n9f.log10 // logarithm to base 10\n9f.exp // exponentiation\n(-3f).abs // absolute value, note bracket\n3.2f.floor // nearest Int smaller than this number\n3.2f.ceil // nearest Int bigger than this number\n3.2f.round // nearest Int\n3f.pow(2f) // power\n","language":"Fantom"},{"code":"1e fexp fconstant e\n0e facos 2e f* fconstant pi \\ predefined in gforth\nfsqrt ( f -- f )\nfln ( f -- f ) \\ flog for base 10\nfexp ( f -- f )\nfabs ( f -- f )\nfloor ( f -- f ) \\ round towards -inf\n: ceil ( f -- f ) fnegate floor fnegate ; \\ not standard, though fround is available\nf** ( f e -- f^e )\n","language":"Forth"},{"code":" e ! Not available. Can be calculated EXP(1.0)\n pi ! Not available. Can be calculated 4.0*ATAN(1.0)\n SQRT(x) ! square root\n LOG(x) ! natural logarithm\n LOG10(x) ! logarithm to base 10\n EXP(x) ! exponential\n ABS(x) ! absolute value\n FLOOR(x) ! floor - Fortran 90 or later only\n CEILING(x) ! ceiling - Fortran 90 or later only\n x**y ! x raised to the y power\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\n#Include \"crt/math.bi\"\n\nPrint M_E '' constant \"e\" from C runtime library\nPrint M_PI '' constant \"pi\" from C runtime library\nPrint Sqr(2) '' square root function built into FB\nPrint Log(M_E) '' log to base \"e\" built into FB\nPrint log10(10) '' log to base 10 from C runtime library\nPrint Exp(1) '' exponential function built into FB\nPrint Abs(-1) '' absolute value function (integers or floats) built into FB\nPrint Int(-2.5) '' floor function built into FB\nPrint ceil(-2.5) '' ceiling function from C runtime library\nPrint 2.5 ^ 3.5 '' exponentiation operator built into FB\nSleep\n","language":"FreeBASIC"},{"code":"e\npi, π // Unicode can also be written in ASCII programs as \\u03C0\nsqrt[x]\nln[x] // Natural log\nlog[x] // Log to base 10\nexp[x], e^x\nabs[x]\nfloor[x] // Except for complex numbers where there's no good interpretation.\nceil[x] // Except for complex numbers where there's no good interpretation.\nx^y\n","language":"Frink"},{"code":"window 1\n\ntext ,,,,, 60// set tab width\n\nprint @\"exp:\", exp(1)\nprint @\"pi:\", pi\nprint @\"sqr:\", sqr(2)\nprint @\"log:\", log(2)\nprint @\"log2:\", log2(2)\nprint @\"log10\", log10(2)\nprint @\"abs:\", abs(-2)\nprint @\"floor:\", int(1.534)\nprint @\"ceil:\", val( using\"###\"; 1.534 )\nprint @\"power:\", 1.23 ^ 4\n\nHandleEvents\n","language":"FutureBasic"},{"code":"Public Sub Main()\n\n Dim e As Float = Exp(1)\n\n Print \"e = \"; e ' e not available\n Print \"π = \"; Pi ' pi\n Dim x As Float = 12.345\n Dim y As Float = 1.23\n Print \"sqrt = \"; Sqr(x)' square root\n Print \"ln = \"; Log(x)' natural logarithm base e\n Print \"log10 = \"; Log(x) / Log(10) ' base 10 logarithm\n Print \"log = \"; Log(x) / Log(y)' arbitrary base logarithm\n Print \"exp = \"; Exp(x) ' exponential\n Print \"abs = \"; Abs(-x)' absolute value\n Print \"floor = \"; Floor(x)' floor\n Print \"ceil = \"; Ceil(x)' ceil\n Print \"power = \"; x ^ y ' power\n\nEnd\n","language":"Gambas"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n \"math/big\"\n)\n\nfunc main() {\n // e and pi defined as constants.\n // In Go, that means they are not of a specific data type and can be used\n // as float32 or float64. Println takes the float64 values.\n fmt.Println(\"float64 values:\")\n fmt.Println(\"e:\", math.E)\n fmt.Println(\"π:\", math.Pi)\n\n // The following functions all take and return the float64 data type.\n\n // square root. cube root also available (math.Cbrt)\n fmt.Println(\"square root(1.44):\", math.Sqrt(1.44))\n // natural logarithm--log base 10, 2 also available (math.Log10, math.Log2)\n // also available is log1p, the log of 1+x. (using log1p can be more\n // accurate when x is near zero.)\n fmt.Println(\"ln(e):\", math.Log(math.E))\n // exponential. also available are exp base 10, 2 (math.Pow10, math.Exp2)\n fmt.Println(\"exponential(1):\", math.Exp(1))\n fmt.Println(\"absolute value(-1.2):\", math.Abs(-1.2))\n fmt.Println(\"floor(-1.2):\", math.Floor(-1.2))\n fmt.Println(\"ceiling(-1.2):\", math.Ceil(-1.2))\n fmt.Println(\"power(1.44, .5):\", math.Pow(1.44, .5))\n\n // Equivalent functions for the float32 type are not in the standard\n // library. Here are the constants e and π as float32s however.\n fmt.Println(\"\\nfloat32 values:\")\n fmt.Println(\"e:\", float32(math.E))\n fmt.Println(\"π:\", float32(math.Pi))\n\n // The standard library has an arbitrary precision floating point type but\n // provides only the most basic methods. Also while the constants math.E\n // and math.Pi are provided to over 80 decimal places, there is no\n // convenient way of loading these numbers (with their full precision)\n // into a big.Float. A hack is cutting and pasting into a string, but\n // of course if you're going to do that you are free to cut and paste from\n // any other source. (The documentation cites OEIS as its source.)\n pi := \"3.141592653589793238462643383279502884197169399375105820974944\"\n π, _, _ := big.ParseFloat(pi, 10, 200, 0)\n fmt.Println(\"\\nbig.Float values:\")\n fmt.Println(\"π:\", π)\n // Of functions requested by the task, only absolute value is provided.\n x := new(big.Float).Neg(π)\n y := new(big.Float)\n fmt.Println(\"x:\", x)\n fmt.Println(\"abs(x):\", y.Abs(x))\n}\n","language":"Go"},{"code":"println ((-22).abs())\n","language":"Groovy"},{"code":"println 22**3.5\n","language":"Groovy"},{"code":"println ((-22)**3.5)\n","language":"Groovy"},{"code":"100 CLS\n110 PRINT \"e = \"; EXP(1) ' e not available\n120 PRINT \"PI = \"; 4 * ATN(1) ' pi not available\n130 X = 12.345\n140 Y = 1.23\n150 PRINT \"sqrt = \"; SQR(X) ' square root\n160 PRINT \"ln = \"; LOG(X) ' natural logarithm base e\n170 PRINT \"log10 = \"; LOG(X)/LOG(10) ' base 10 logarithm\n180 PRINT \"log = \"; LOG(X)/LOG(Y) ' arbitrary base logarithm\n190 PRINT \"exp = \"; EXP(X) ' exponential\n200 PRINT \"abs = \"; ABS(-X) ' absolute value\n210 PRINT \"floor = \"; floor(X) ' floor\n220 PRINT \"ceil = \"; : ' ceil not available\n230 IF X < 0 THEN PRINT INT(X) ELSE PRINT INT(X)+1\n240 PRINT \"power = \"; X ^Y ' power\n250 END\n","language":"GW-BASIC"},{"code":"exp 1 -- Euler number\npi -- pi\nsqrt x -- square root\nlog x -- natural logarithm\nexp x -- exponential\nabs x -- absolute value\nfloor x -- floor\nceiling x -- ceiling\nx ** y -- power (e.g. floating-point exponentiation)\nx ^ y -- power (e.g. integer exponentiation, nonnegative y only)\nx ^^ y -- power (e.g. integer exponentiation of rationals, also negative y)\n","language":"Haskell"},{"code":"e ! Not available. Can be calculated EXP(1)\npi ! Not available. Can be calculated 4.0*ATAN(1.0)\nx^0.5 ! square root\nLOG(x) ! natural logarithm\nLOG(x, 10) ! logarithm to base 10\nEXP(x) ! exponential\nABS(x) ! absolute value\nFLOOR(x) ! floor\nCEILING(x) ! ceiling\nx**y ! x raised to the y power\nx^y ! same as x**y\n","language":"HicEst"},{"code":"link numbers # for floor and ceil\n\nprocedure main()\nwrite(\"e=\",&e)\nwrite(\"pi=\",&pi)\nwrite(\"phi=\",&phi)\nwrite(\"sqrt(2)=\",sqrt(2.0))\nwrite(\"log(e)=\",log(&e))\nwrite(\"log(100.,10)=\",log(100,10))\nwrite(\"exp(1)=\",exp(1.0))\nwrite(\"abs(-2)=\",abs(-2))\nwrite(\"floor(-2.2)=\",floor(-2.2))\nwrite(\"ceil(-2.2)=\",ceil(-2.2))\nwrite(\"power: 3^3=\",3^3)\nend\n","language":"Icon"},{"code":"100 LET X=2:LET Y=5\n110 PRINT EXP(1) ! value of e\n120 PRINT PI ! value of Pi\n130 PRINT ROUND(PI,3) ! rounds Pi to 3 decimal places\n140 PRINT TRUNCATE(PI,3) ! cuts 3 decimal places from Pi\n150 PRINT SQR(X) ! square root of x\n160 PRINT LOG(X) ! the natural logarithm of number x\n170 PRINT LOG2(X) ! logarithm of x to base 2\n180 PRINT LOG10(X) ! logarithm of x to base 10\n190 PRINT EXP(X) ! exponential\n200 PRINT ABS(X) ! the absolute value of a number\n210 PRINT INT(X) ! the largest whole number not bigger than x\n220 PRINT IP(X) ! the integer part of x\n230 PRINT FP(X) ! stands for fractorial part\n240 PRINT CEIL(X) ! ceiling: gives the smallest whole number not less than x\n250 PRINT X^Y ! power\n260 PRINT MIN(X,Y) ! the smaller number of x and y\n270 PRINT MAX(X,Y) ! the bigger number of x and y\n280 PRINT EPS(X) ! the smallest quantity that can be added to or subtracted from x to make the interpreter register a change in the value of x\n290 PRINT INF ! The largest positive number the tinterpreter can handle. This number is 9.999999999*10^62\n","language":"IS-BASIC"},{"code":"e =. 1x1 NB. Euler's number, specified as a numeric literal.\ne =. ^ 1 NB. Euler's number, computed by exponentiation.\npi=. 1p1 NB. pi, specified as a numeric literal.\npi=. o.1 NB. pi, computed trigonometrically.\nmagnitude_of_x =. |x\nfloor_of_x =. <.x\nceiling_of_x =. >.x\nnatural_log_of_x =. ^.x\nbase_x_log_of_y =. x^.y\nx_squared =. *:x NB. special form\nx_squared =. x^2 NB. exponential form\nsquare_root_of_x =. %:x NB. special form\nsquare_root_of_x =. x^0.5 NB. exponential form\nx_to_the_y_power =. x^y\n","language":"J"},{"code":"Math.E; //e\nMath.PI; //pi\nMath.sqrt(x); //square root--cube root also available (cbrt)\nMath.log(x); //natural logarithm--log base 10 also available (log10)\nMath.exp(x); //exponential\nMath.abs(x); //absolute value\nMath.floor(x); //floor\nMath.ceil(x); //ceiling\nMath.pow(x,y); //power\n","language":"Java"},{"code":"Math.E\nMath.PI\nMath.sqrt(x)\nMath.log(x)\nMath.exp(x)\nMath.abs(x)\nMath.floor(x)\nMath.ceil(x)\nMath.pow(x,y)\n","language":"JavaScript"},{"code":"1 | exp # i.e. e\n1 | atan * 4 # i.e. π\nsqrt\nlog # Naperian log\nexp\nlength # absolute value if the argument is numeric\nfloor\nceil # requires jq >= 1.5\npow(x; y) # requires jq >= 1.5\n","language":"Jq"},{"code":"/* real constants and functions, in JSI */\nvar x, y;\n\n;Math.E;\n;Math.PI;\n\n;x = 100.0;\n;Math.sqrt(x);\n;Math.log(x);\n\n;x = 2.0;\n;Math.exp(x);\n\n;x = -x;\n;Math.abs(x);\n\n;x = 42.42;\n;Math.floor(x);\n;Math.ceil(x);\n\n;x = 10.0;\n;y = 5;\n;Math.pow(x,y);\n\n/*\n=!EXPECTSTART!=\nMath.E ==> 2.718281828459045\nMath.PI ==> 3.141592653589793\nx = 100.0 ==> 100\nMath.sqrt(x) ==> 10\nMath.log(x) ==> 4.605170185988092\nx = 2.0 ==> 2\nMath.exp(x) ==> 7.38905609893065\nx = -x ==> -2\nMath.abs(x) ==> 2\nx = 42.42 ==> 42.42\nMath.floor(x) ==> 42\nMath.ceil(x) ==> 43\nx = 10.0 ==> 10\ny = 5 ==> 5\nMath.pow(x,y) ==> 100000\n=!EXPECTEND!=\n*/\n","language":"Jsish"},{"code":"e\nπ, pi\nsqrt(x)\nlog(x)\nexp(x)\nabs(x)\nfloor(x)\nceil(x)\nx^y\n","language":"Julia"},{"code":"import kotlin.math.*\n\nfun main() {\n println(E)\n println(PI)\n println(sqrt(2.0))\n println(ln(E))\n println(log10(10.0))\n println(log(4.0, 2.0)) // log base 2 of 4\n println(exp(1.0))\n println(abs(-1))\n println(floor(-2.5))\n println(ceil(-2.5))\n println(2.5.pow(3.5)) // 2.5^3.5\n}\n","language":"Kotlin"},{"code":"{E} -> 2.718281828459045\n{PI} -> 3.141592653589793\n{sqrt 2} -> 1.4142135623730951\n{log {E}} -> 1\n{exp 1} -> 2.718281828459045\n{abs -1} -> 1\n{floor -2.5} -> -3\n{ceil -2.5} -> -2\n{pow 2.5 3.5} -> 24.705294220065465\n","language":"Lambdatalk"},{"code":"//e\ndefine e => 2.7182818284590452\n\n//π\ndefine pi => 3.141592653589793\n\ne\npi\n9.0->sqrt\n1.64->log\n1.64->log10\n1.64->exp\n1.64->abs\n1.64->floor\n1.64->ceil\n1.64->pow(10.0)\n","language":"Lasso"},{"code":"print exp( 1) ' e not available\nprint 4 *atn( 1) ' pi not available\n\nx =12.345: y =1.23\n\nprint sqr( x), x^0.5 ' square root- NB the unusual name\nprint log( x) ' natural logarithm base e\nprint log( x) /2.303 ' base 10 logarithm\nprint log( x) /log( y) ' arbitrary base logarithm\nprint exp( x) ' exponential\nprint abs( x) ' absolute value\nprint floor( x) ' floor\nprint ceiling( x) ' ceiling\nprint x^y ' power\n\nend\n\nfunction floor( x)\n if x >0 then\n floor =int( x)\n else\n if x <>int( x) then floor =int( x) -1 else floor =int( x)\n end if\nend function\n\nfunction ceiling( x)\n if x <0 then\n ceiling =int( x)\n else\n ceiling =int( x) +1\n end if\nend function\n","language":"Liberty-BASIC"},{"code":"the floatPrecision = 8\n\n-- e (base of the natural logarithm)\nput exp(1)\n-- 2.71828183\n\n-- pi\nput PI\n-- 3.14159265\n\n-- square root\nput sqrt(2.0)\n-- 1.41421356\n\n-- logarithm (any base allowed)\nx = 100\n\nput log(x) -- calculate log for base e\n-- 4.60517019\n\nput log(x)/log(10) -- calculate log for base 10\n-- 2.00000000\n\n-- exponential (ex)\nput exp(3)\n-- 20.08553692\n\n-- absolute value (a.k.a. \"magnitude\")\nput abs(-1)\n-- 1\n\n-- floor (largest integer less than or equal to this number--not the same as truncate or int)\nn = 23.536\nput bitOr(n, 0) -- calculates floor\n-- 23\n\n-- ceiling (smallest integer not less than this number--not the same as round up)\nn = 23.536\n-- calculates ceil\nfloor = bitOr(n, 0)\nif (floor >= n) then put floor\nelse put floor+1\n-- 24\n\n-- power\nput power(2, 8)\n-- 256.00000000\n","language":"Lingo"},{"code":"e: exp(1)\npi: pi\nsquare root: sqrt(x)\nlogarithm: log(x)\nexponential (ex): exp(x)\nabsolute value: abs(x)\nfloor: floor(x)\nceiling: ceil(x)\npower: x^y\n","language":"LiveCode"},{"code":"make \"e exp 1\nmake \"pi 2*(RADARCTAN 0 1)\nsqrt :x\nln :x\nexp :x\n; there is no standard abs, floor, or ceiling; only INT and ROUND.\npower :x :y\n","language":"Logo"},{"code":":- object(constants_and_functions).\n\n :- public(show/0).\n show :-\n write('e = '), E is e, write(E), nl,\n write('pi = '), PI is pi, write(PI), nl,\n write('sqrt(2) = '), SQRT is sqrt(2), write(SQRT), nl,\n % only base e logorithm is avaialable as a standard built-in function\n write('log(2) = '), LOG is log(2), write(LOG), nl,\n write('exp(2) = '), EXP is exp(2), write(EXP), nl,\n write('abs(-1) = '), ABS is abs(-1), write(ABS), nl,\n write('floor(-3.4) = '), FLOOR is floor(-3.4), write(FLOOR), nl,\n write('ceiling(-3.4) = '), CEILING is ceiling(-3.4), write(CEILING), nl,\n write('2 ** -3.4 = '), POWER is 2 ** -3.4, write(POWER), nl.\n\n:- end_object.\n","language":"Logtalk"},{"code":"math.exp(1)\nmath.pi\nmath.sqrt(x)\nmath.log(x)\nmath.log10(x)\nmath.exp(x)\nmath.abs(x)\nmath.floor(x)\nmath.ceil(x)\nx^y\n","language":"Lua"},{"code":"Module Checkit {\n Def exp(x)= 2.71828182845905^x\n Print Ln(exp(1))==1\n Print Log(10^5)==5\n Print Sgn(-5)=-1\n Print Abs(-2.10#)=2.1#\n Def exptype$(x)=type$(x)\n Print exptype$(Abs(-2.1#))=\"Currency\"\n Print exptype$(Abs(-2.1~))=\"Single\"\n Print exptype$(Abs(-2.1@))=\"Decimal\"\n Print exptype$(Abs(-2&))=\"Long\"\n Print exptype$(Abs(-2%))=\"Integer\"\n Print exptype$(Abs(-2.212e34))=\"Double\"\n\n Print exptype$(Sgn(-2.1#))=\"Integer\"\n \\\\ Sgn return integer type\n Print exptype$(Sgn(-2.212e34))=\"Integer\"\n \\\\ Log, Len return double\n Print exptype$(Log(1000))=\"Double\"\n Print exptype$(exp(1%))=\"Double\"\n Print exptype$(Ln(1212%))=\"Double\"\n \\\\ power return type Double ^ and ** (are the same)\n Print exptype$(2&^2&)=\"Long\" ' for Version <=11 is \"Double\"\n Print exptype$(2&**2&)=\"Long\" ' for Version <=11 is \"Double\"\n Print exptype$(2&*2&)=\"Long\"\n \\\\ 64bit Long Long (from Version 12)\n Print exptype$(2&&^2&&)=\"Long Long\"\n Print exptype$(2&&**2&&)=\"Long Long\"\n Print exptype$(2&&*2&)=\"Long Long\"\n Print 2**2=4, 2^2=4, 2^2^2=16, 2**2**2=16\n \\\\ floor() and Int() is the same\n Print Int(-2.7)=-3, Int(2.7)=2\n Print Floor(-2.7)=-3, Floor(2.7)=2\n Print Ceil(-2.7)=-2, Ceil(2.7)=3\n\n Print round(-2.7, 0)=-3, round(2.7, 0)=3\n Print round(-2.2, 0)=-2, round(2.2, 0)=2\n\n\n Print Sqrt(4)=2\n}\nCheckit\n","language":"M2000-Interpreter"},{"code":"> abs(ceil(floor(ln(exp(1)^sqrt(exp(Pi*I)+1)))));\n 0\n","language":"Maple"},{"code":"E\nPi\nSqrt[x]\nLog[x]\nLog[b,x]\nExp[x]\nAbs[x]\nFloor[x]\nCeiling[x]\nPower[x, y]\n","language":"Mathematica"},{"code":"Log[1.23] => 0.207014\nLog[10] => Log[10]\nLog[10,100] => 2\nLog[E^4] => 4\nLog[1 + I] => Log[1+I]\nLog[1. + I] => 0.346574 + 0.785398 I\nCeiling[Pi] => 4\nFloor[Pi] => 3\nSqrt[2] => Sqrt[2]\nSqrt[4] => 2\nSqrt[9/2] => 3/Sqrt[2]\nSqrt[3.5] => 1.87083\nSqrt[-5 + 12 I] => 2 + 3 I\nSqrt[-4] => 2I\nExp[2] => E^2\nExp[Log[4]] => 4\n","language":"Mathematica"},{"code":"exp(1) % e\npi % pi\nsqrt(x) % square root\nlog(x) % natural logarithm\nlog2(x) % logarithm base 2\nlog10(x) % logarithm base 10\nexp(x) % exponential\nabs(-x) % absolute value\nfloor(x) % floor\nceil(x) % ceiling\nx^y % power\n","language":"MATLAB"},{"code":"e -- Euler's number\npi -- pi\nlog x -- natural logarithm\nlog10 x -- log base 10\nexp x -- exponantial\nabs x -- absolute value\nfloor x -- floor\nceil x -- ceiling\npow x y -- power\n","language":"MAXScript"},{"code":"math.pi % Pi.\nmath.e % Euler's number.\nmath.sqrt(X) % Square root of X.\nmath.ln(X) % Natural logarithm of X.\nmath.log10(X) % Logarithm to the base 10 of X.\nmath.log2(X) % Logarithm to the base 2 of X.\nmath.log(B, X) % Logarithm to the base B of X.\nmath.exp(X) % e raised to the power of X.\nfloat.abs(X) % Absolute value of X.\nmath.floor(X) % Floor of X.\nmath.ceiling(X) % Ceiling of X.\nmath.pow(X, Y) % X raised to the power of Y.\n","language":"Mercury"},{"code":"show mexp(256); % outputs e; since MF uses mexp(x) = exp(x/256)\nshow 3.14159; % no pi constant built in; of course we can define it\n % in several ways... even computing\n % C/2r (which would be funny since MF handles paths,\n % and a circle is a path...)\nshow sqrt2; % 1.41422, or in general sqrt(a)\nshow mexp(256*x); % see e.\nshow abs(x); % returns |x| (the absolute value of the number x, or\n % the length of the vector x); it is the same as\n % length(x); plain Metafont in fact says:\n % let abs = length;\nshow floor(x); % floor\nshow ceiling(x); % ceiling\nshow x**y; % ** is not a built in: it is defined in the basic macros\n % set for Metafont (plain Metafont) as a primarydef\n","language":"Metafont"},{"code":"e ; e\npi ; π\nsqrt ; square root\nlog10 ; common logarithm\nlog2 ; binary logarithm\n ; no exponential\n ; no absolute value\nfloor ; greatest whole number smaller than or equal\nceil ; smallest whole number greater than or equal\ntrunc ; remove the fractional part (i.e. round towards 0)\nround ; round number to nth decimal place\npow ; power\n","language":"Min"},{"code":"Math.E;\nMath.Pi;\nMath.sqrt(x);\nMath.log(x);\nMath.exp(x);\nABS(x); (* Built in function. *)\nFLOOR(x); (* Built in function. *)\nCEILING(x); (* Built in function. *)\nMath.pow(x, y);\n","language":"Modula-3"},{"code":"100 CLS\n110 E = EXP(1)\n120 PRINT \"e = \"; E ' e not available\n130 PI = 4 * ATN(1)\n140 PRINT \"PI = \"; PI ' pi not available\n150 X = 12.345\n160 Y = 1.23\n170 PRINT \"sqrt = \"; SQR(X) ' square root\n180 PRINT \"ln = \"; LOG(X) ' natural logarithm base e\n190 PRINT \"log10 = \"; LOG(X)/LOG(10) ' base 10 logarithm\n200 PRINT \"log = \"; LOG(X)/LOG(Y) ' arbitrary base logarithm\n210 PRINT \"exp = \"; EXP(X) ' exponential\n220 PRINT \"abs = \"; ABS(-X) ' absolute value\n230 PRINT \"floor = \"; floor(X) ' floor\n240 PRINT \"ceil = \"; : ' ceil not available\n250 IF X < 0 THEN PRINT INT(X) ELSE PRINT INT(X)+1\n260 PRINT \"power = \"; X ^Y ' power\n270 END\n","language":"MSX-Basic"},{"code":"/**\n Real constants and functions, in Neko\n Tectonics:\n nekoc real-constants.neko\n neko real-constants\n*/\n\nvar euler = $loader.loadprim(\"std@math_exp\", 1)(1)\nvar pi = $loader.loadprim(\"std@math_pi\", 0)()\n\nvar math_sqrt = $loader.loadprim(\"std@math_sqrt\", 1)\nvar math_log = $loader.loadprim(\"std@math_log\", 1)\nvar math_exp = $loader.loadprim(\"std@math_exp\", 1)\nvar math_abs = $loader.loadprim(\"std@math_abs\", 1)\nvar math_floor = $loader.loadprim(\"std@math_floor\", 1)\nvar math_ceil = $loader.loadprim(\"std@math_ceil\", 1)\nvar math_pow = $loader.loadprim(\"std@math_pow\", 2)\n\n$print(\"Euler : \", euler, \"\\n\")\n$print(\"Pi : \", pi, \"\\n\")\n\n$print(\"Sqrt(2) : \", math_sqrt(2), \"\\n\")\n$print(\"Log(10) : \", math_log(10), \"\\n\")\n$print(\"Exp(1) : \", math_pow(euler, 1), \"\\n\")\n$print(\"Abs(-2.2) : \", math_abs(-2.2), \"\\n\")\n$print(\"Floor(-2.2): \", math_floor(-2.2), \"\\n\")\n$print(\"Ceil(-2.2) : \", math_ceil(-2.2), \"\\n\")\n$print(\"Pow(2, 8) : \", math_pow(2, 8), \"\\n\")\n","language":"Neko"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary utf8\n\nnumeric digits 30\n\nx = 2.5\ny = 3\npad = 40\nsay\nsay 'Java Math constants & functions:'\nsay Rexx(' Euler''s number (e):').left(pad) Math.E\nsay Rexx(' Pi:').left(pad) Math.PI\nsay Rexx(' Square root of' x':').left(pad) Math.sqrt(x)\nsay Rexx(' Log(e) of' x':').left(pad) Math.log(x)\nsay Rexx(' Log(e) of e:').left(pad) Math.log(Math.E)\nsay Rexx(' Log(10) of' x':').left(pad) Math.log10(x)\nsay Rexx(' Log(10) of 10:').left(pad) Math.log10(10)\nsay Rexx(' Exponential (e**x) of' x':').left(pad) Math.exp(x)\nsay Rexx(' Exponential (e**x) of log(e)' x':').left(pad) Math.exp(Math.log(x))\nsay Rexx(' Abs of' x':').left(pad) Math.abs(x.todouble)\nsay Rexx(' Abs of' (-x)':').left(pad) Math.abs((-x).todouble)\nsay Rexx(' Floor of' x':').left(pad) Math.floor(x)\nsay Rexx(' Floor of' (-x)':').left(pad) Math.floor((-x))\nsay Rexx(' Ceiling of' x':').left(pad) Math.ceil(x)\nsay Rexx(' Ceiling of' (-x)':').left(pad) Math.ceil((-x))\nsay Rexx(' ' x 'to the power of' y':').left(pad) Math.pow(x, y)\nsay Rexx(' ' x 'to the power of' 1 / y':').left(pad) Math.pow(x, 1 / y)\nsay Rexx(' 10 to the power of log10' x':').left(pad) Math.pow(10, Math.log10(x))\n\n-- Extras\nsay Rexx(' Cube root of' x':').left(pad) Math.cbrt(x)\nsay Rexx(' Hypotenuse of' 3 'x' 4 'right triangle:').left(pad) Math.hypot(3, 4)\nsay Rexx(' Max of' (-x) '&' x':').left(pad) Math.max((-x).todouble, x)\nsay Rexx(' Min of' (-x) '&' x':').left(pad) Math.min((-x).todouble, x)\nsay Rexx(' Signum of' x':').left(pad) Math.signum((x).todouble)\nsay Rexx(' Signum of' x '-' x':').left(pad) Math.signum((x - x).todouble)\nsay Rexx(' Signum of' (-x)':').left(pad) Math.signum((-x).todouble)\n\nsay\nsay 'NetRexx built-in support for numeric data:'\nsay Rexx(' Abs of' x':').left(pad) x.abs()\nsay Rexx(' Abs of' (-x)':').left(pad) (-x).abs()\nsay Rexx(' Sign of' x':').left(pad) x.sign()\nsay Rexx(' Sign of' x '-' x':').left(pad) (x - x).sign()\nsay Rexx(' Sign of' (-x)':').left(pad) (-x).sign()\nsay Rexx(' Max of' (-x) '&' x':').left(pad) (-x).max(x)\nsay Rexx(' Min of' (-x) '&' x':').left(pad) (-x).min(x)\nsay Rexx(' Truncate' x 'by' y':').left(pad) x.trunc(y)\nsay Rexx(' Format (with rounding)' x 'by' y':').left(pad) x.format(y, 0)\n","language":"NetRexx"},{"code":"import math\n\nvar x, y = 12.5\n\necho E\necho PI\necho sqrt(x)\necho ln(x)\necho log10(x)\necho exp(x)\necho abs(x)\necho floor(x)\necho ceil(x)\necho pow(x, y)\n","language":"Nim"},{"code":"Float->Pi();\nFloat->E();\n4.0->SquareRoot();\n1.5->Log();\n# exponential is not supported\n3.99->Abs();\n3.99->Floor();\n3.99->Ceiling();\n4.5->Ceiling(2.0);\n","language":"Objeck"},{"code":"Float.pi (* pi *)\nsqrt x (* square root *)\nlog x (* natural logarithm--log base 10 also available (log10) *)\nexp x (* exponential *)\nabs_float x (* absolute value *)\nabs x (* absolute value (for integers) *)\nfloor x (* floor *)\nceil x (* ceiling *)\nx ** y (* power *)\n-. x (* negation for floats *)\n","language":"OCaml"},{"code":"e % e\npi % pi\nsqrt(pi) % square root\nlog(e) % natural logarithm\nexp(pi) % exponential\nabs(-e) % absolute value\nfloor(pi) % floor\nceil(pi) % ceiling\ne**pi % power\n","language":"Octave"},{"code":"import: math\n\n: testReal\n E println\n Pi println\n 9 sqrt println\n 2 ln println\n 2 exp println\n -3.4 abs println\n 3.4 exp println\n\n 2.4 floor println\n 3.9 floor println\n 5.5 floor println\n -2.4 floor println\n -3.9 floor println\n -5.5 floor println\n\n 2.4 ceil println\n 3.9 ceil println\n 5.5 ceil println\n -2.4 ceil println\n -3.9 ceil println\n -5.5 ceil println ;\n","language":"Oforth"},{"code":"/* Rexx */\n\n-- MathLoadFuncs & MathDropFuncs are no longer needed and are effectively NOPs\n-- but MathLoadFuncs does return its copyright statement when given a string argument\nRxMathCopyright = MathLoadFuncs('')\nsay RxMathCopyright\n\nnumeric digits 16\n\nx = 2.5\ny = 3\npad = 40\ndigs = digits()\nsay\nsay 'Working with precision' digs\nsay 'Math constants & functions:'\nsay (' Euler''s number (e):')~left(pad) RxCalcExp(1, digs)\nsay (' Pi:')~left(pad) RxCalcPi(digs)\nsay (' Square root of' x':')~left(pad) RxCalcSqrt(x, digs)\nsay (' Log(e) of' x':')~left(pad) RxCalcLog(x, digs)\nsay (' Log(e) of e:')~left(pad) RxCalcLog(RxCalcExp(1, digs), digs)\nsay (' Log(10) of' x':')~left(pad) RxCalcLog10(x, digs)\nsay (' Log(10) of 10:')~left(pad) RxCalcLog10(10, digs)\nsay (' Exponential (e**x) of' x':')~left(pad) RxCalcExp(x, digs)\nsay (' Exponential (e**x) of log(e)' x':')~left(pad) RxCalcExp(RxCalcLog(x, digs), digs)\nsay (' ' x 'to the power of' y':')~left(pad) RxCalcPower(x, y, digs)\nsay (' ' x 'to the power of 1/'y':')~left(pad) RxCalcPower(x, 1 / y, digs)\nsay (' 10 to the power of log10' x':')~left(pad) RxCalcPower(10, RxCalcLog10(x), digs)\n\nsay\nsay 'Rexx built-in support for numeric data:'\nsay (' Abs of' x':')~left(pad) x~abs()\nsay (' Abs of' (-x)':')~left(pad) (-x)~abs()\nsay (' Sign of' x':')~left(pad) x~sign()\nsay (' Sign of' x '-' x':')~left(pad) (x - x)~sign()\nsay (' Sign of' (-x)':')~left(pad) (-x)~sign()\nsay (' Max of' (-x) '&' x':')~left(pad) (-x)~max(x)\nsay (' Min of' (-x) '&' x':')~left(pad) (-x)~min(x)\nsay (' Truncate' x 'by' y':')~left(pad) x~trunc(y)\nsay (' Format (with rounding)' x 'by' y':')~left(pad) x~format(y, 0)\n\nsay\nsay 'Use RYO functions for floor & ceiling:'\nsay (' Floor of' x':')~left(pad) floor(x)\nsay (' Floor of' (-x)':')~left(pad) floor((-x))\nsay (' Ceiling of' x':')~left(pad) ceiling(x)\nsay (' Ceiling of' (-x)':')~left(pad) ceiling((-x))\n\nreturn\n\n-- floor and ceiling functions are not part of ooRexx\nfloor: procedure\n return arg(1)~trunc() - (arg(1) < 0) * (arg(1) \\= arg(1)~trunc())\n\nceiling: procedure\n return arg(1)~trunc() + (arg(1) > 0) * (arg(1) \\= arg(1)~trunc())\n\n::requires 'RxMath' library\n","language":"OoRexx"},{"code":"{ForAll\n [\n {Exp 1.} %% 2.7183 Euler's number: not predefined\n 4. * {Atan2 1. 1.} %% 3.1416 pi: not predefined\n {Sqrt 81.} %% 9.0 square root; expects a float\n {Log 2.7183} %% 1.0 natural logarithm\n {Abs ~1} %% 1 absolute value; expects a float or an integer\n {Floor 1.999} %% 1.0 floor; expects and returns a float\n {Ceil 1.999} %% 2.0 ceiling; expects and returns a float\n {Pow 2 3} %% 8 power; both arguments must be of the same type\n ]\n Show}\n","language":"Oz"},{"code":"[exp(1), Pi, sqrt(2), log(2), abs(2), floor(2), ceil(2), 2^3]\n","language":"PARI-GP"},{"code":"\t{ Euler’s constant }\n\texp(1)\n\t{ principal square root of `x` }\n\tsqrt(x)\n\t{ natural logarithm }\n\tln(x)\n\t{ exponential }\n\texp(x)\n\t{ absolute value }\n\tabs(x)\n","language":"Pascal"},{"code":"\t{ Pi }\n\t2 * arg(cmplx(0.0, maxReal))\n\t{ power, yields same data type as `base`, `exponent` has to be an `integer` }\n\tbase pow exponent\n\t{ `real` power, `exponent` may be an `integer` or `real` value, yet `base` and }\n\t{ `exponent` are automatically promoted to an approximate `real` value, result }\n\t{ is `complex` if `base` is `complex`, otherwise a `real` value }\n\tbase ** exponent\n","language":"Pascal"},{"code":"use POSIX; # for floor() and ceil()\n\nexp(1); # e\n4 * atan2(1, 1); # pi\nsqrt($x); # square root\nlog($x); # natural logarithm; log10() available in POSIX module\nexp($x); # exponential\nabs($x); # absolute value\nfloor($x); # floor\nceil($x); # ceiling\n$x ** $y; # power\n\nuse Math::Trig;\npi; # alternate way to get pi\n\nuse Math::Complex;\npi; # alternate way to get pi\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #004600;\">E</span> <span style=\"color: #000080;font-style:italic;\">-- Euler number</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #004600;\">PI</span> <span style=\"color: #000080;font-style:italic;\">-- pi</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">log</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">E</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- natural logarithm</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">log10</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- base 10 logarithm</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">exp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">log</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">))</span> <span style=\"color: #000080;font-style:italic;\">-- exponential</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">sqrt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- square root</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">abs</span><span style=\"color: #0000FF;\">(-</span><span style=\"color: #000000;\">1.2</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- absolute value</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(-</span><span style=\"color: #000000;\">1.2</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- floor, -2</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">ceil</span><span style=\"color: #0000FF;\">(-</span><span style=\"color: #000000;\">1.2</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- ceiling, -1</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">round</span><span style=\"color: #0000FF;\">(-</span><span style=\"color: #000000;\">1.8</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- rounded, -2</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">trunc</span><span style=\"color: #0000FF;\">(-</span><span style=\"color: #000000;\">1.8</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- truncate, -1</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">E</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">log</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">))</span> <span style=\"color: #000080;font-style:italic;\">-- displays 5.0</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">log10</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">))</span> <span style=\"color: #000080;font-style:italic;\">-- displays 5.0</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #004600;\">INVLN10</span> <span style=\"color: #000080;font-style:italic;\">-- displays 0.434..</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">exp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #004600;\">INVLN10</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- displays 10.0</span>\n<!--\n","language":"Phix"},{"code":"M_E; //e\nM_PI; //pi\nsqrt(x); //square root\nlog(x); //natural logarithm--log base 10 also available (log10)\nexp(x); //exponential\nabs(x); //absolute value\nfloor(x); //floor\nceil(x); //ceiling\npow(x,y); //power\n","language":"PHP"},{"code":"main =>\n println(math.e),\n println(math.pi),\n nl,\n\n println(sqrt(2)),\n nl,\n\n println(log(10)), % base e\n println(log(math.pi,10)), % some base, here pi\n println(log2(10)), % base 2\n println(exp(2.302585092994046)),\n nl,\n\n println(abs(- math.e)),\n nl,\n println(floor(sqrt(101))),\n println(ceiling(sqrt(101))),\n nl,\n println(math.pi**math.e), % power\n println(pow(math.pi,math.e)), % power\n nl.\n","language":"Picat"},{"code":"(scl 12) # 12 places after decimal point\n(load \"@lib/math.l\")\n\n(prinl (format (exp 1.0) *Scl)) # e, exp\n(prinl (format pi *Scl)) # pi\n\n(prinl (format (pow 2.0 0.5) *Scl)) # sqare root\n(prinl (format (sqrt 2.0 1.0) *Scl))\n\n(prinl (format (log 2.0) *Scl)) # logarithm\n(prinl (format (exp 4.0) *Scl)) # exponential\n\n(prinl (format (abs -7.2) *Scl)) # absolute value\n(prinl (abs -123))\n\n(prinl (format (pow 3.0 4.0) *Scl)) # power\n","language":"PicoLisp"},{"code":"/* e not available other than by using exp(1q0).*/\n/* pi not available other than by using a trig function such as: pi=4*atan(1) */\ny = sqrt(x);\ny = log(x);\ny = log2(x);\ny = log10(x);\ny = exp(x);\ny = abs(x);\ny = floor(x);\ny = ceil(x);\na = x**y; /* power */\n/* extra functions: */\ny = erf(x); /* the error function. */\ny = erfc(x); /* the error function complemented. */\ny = gamma (x);\ny = loggamma (x);\n","language":"PL-I"},{"code":"The pizza pie is a fraction equal to 355/113. \\ equivalent to pi\n\n\\ square root\nTo find a square root of a number: \\ rounds down\nPrivatize the number.\nDe-sign the number.\nIf the number is 0, put 0 into the square root; exit.\nIf the number is 1, put 1 into the square root; exit.\nPut 1 into a square number.\nPut 3 into a delta number.\nLoop.\nIf the square is greater than the number, break.\nAdd the delta to the square.\nAdd 2 to the delta.\nRepeat.\nPut the delta divided by 2 minus 1 into the square root.\n\nA square root is a number.\n\n\\ absolute value\nTo put a fraction's absolute value into another fraction:\nPut the fraction into the other fraction.\nDe-sign the other fraction.\n\nTo put a number's absolute value into another number:\nPut the number into the other number.\nDe-sign the other number.\n\nTo put a pair's absolute value into another pair:\nPut the pair into the other pair.\nDe-sign the other pair.\n\n\\ power\nTo raise a number to another number:\nIf the other number is 0, put 1 into the number; exit.\nIf the other number is less than 0, put 0 into the number; exit. \\ should be 1/the raised result, but always comes out 0 with numbers\nPut 1 into a result number.\nLoop.\nIf a counter is past the other number, break.\nMultiply the result by the number.\nRepeat.\nPut the result into the number.\n","language":"Plain-English"},{"code":"pi ;;; Number Pi\nsqrt(x) ;;; Square root\nlog(x) ;;; Natural logarithm\nexp(x) ;;; Exponential function\nabs(x) ;;; Absolute value\nx ** y ;;; x to the power y\n","language":"Pop11"},{"code":"Write-Host ([Math]::E)\nWrite-Host ([Math]::Pi)\nWrite-Host ([Math]::Sqrt(2))\nWrite-Host ([Math]::Log(2))\nWrite-Host ([Math]::Exp(2))\nWrite-Host ([Math]::Abs(-2))\nWrite-Host ([Math]::Floor(3.14))\nWrite-Host ([Math]::Ceiling(3.14))\nWrite-Host ([Math]::Pow(2, 3))\n","language":"PowerShell"},{"code":"Debug #E\nDebug #PI\nDebug Sqr(f)\nDebug Log(f)\nDebug Exp(f)\nDebug Log10(f)\nDebug Abs(f)\nDebug Pow(f,f)\n","language":"PureBasic"},{"code":"import math\n\nmath.e # e\nmath.pi # pi\nmath.sqrt(x) # square root (Also commonly seen as x ** 0.5 to obviate importing the math module)\nmath.log(x) # natural logarithm\nmath.log10(x) # base 10 logarithm\nmath.exp(x) # e raised to the power of x\nabs(x) # absolute value\nmath.floor(x) # floor\nmath.ceil(x) # ceiling\nx ** y # exponentiation\npow(x, y[, n]) # exponentiation [, modulo n (useful in certain encryption/decryption algorithms)]\n\n# The math module constants and functions can, of course, be imported directly by:\n# from math import e, pi, sqrt, log, log10, exp, floor, ceil\n","language":"Python"},{"code":"'ceiling and floor easily implemented as functions.\n'e & pi not available- calculate as shown.\n\nFUNCTION ceiling (x)\n IF x < 0 THEN ceiling = INT(x) ELSE ceiling = INT(x) + 1\nEND FUNCTION\n\nFUNCTION floor (x)\n IF x > 0 THEN\n floor = INT(x)\n ELSE\n IF x <> INT(x) THEN floor = INT(x) - 1 ELSE floor = INT(x)\n END IF\nEND FUNCTION\n\nPRINT \"e = \"; EXP(1) ' e not available\nPRINT \"PI = \"; 4 * ATN(1) ' pi not available\n\nx = 12.345: y = 1.23\n\nPRINT \"sqrt = \"; SQR(x), x ^ .5 ' square root- NB the unusual name\nPRINT \"ln = \"; LOG(x) ' natural logarithm base e\nPRINT \"log10 = \"; LOG(x) / 2.303 ' base 10 logarithm\nPRINT \"log = \"; LOG(x) / LOG(y) ' arbitrary base logarithm\nPRINT \"exp = \"; EXP(x) ' exponential\nPRINT \"abs = \"; ABS(-x) ' absolute value\nPRINT \"floor = \"; floor(x) ' floor\nPRINT \"ceil = \"; ceiling(x) ' ceiling\nPRINT \"power = \"; x ^ y ' power\nEND\n","language":"QBasic"},{"code":"exp(1) # e\npi # pi\nsqrt(x) # square root\nlog(x) # natural logarithm\nlog10(x) # base 10 logarithm\nlog(x, y) # arbitrary base logarithm\nexp(x) # exponential\nabs(x) # absolute value\nfloor(x) # floor\nceiling(x) # ceiling\nx^y # power\n","language":"R"},{"code":"(exp 1) ; e\npi ; pi\n(sqrt x) ; square root\n(log x) ; natural logarithm\n(exp x) ; exponential\n(abs x) ; absolute value\n(floor x) ; floor\n(ceiling x) ; ceiling\n(expt x y) ; power\n","language":"Racket"},{"code":"say e; # e\nsay π; # or pi # pi\nsay τ; # or tau # tau\n\n# Common mathmatical function are availble\n# as subroutines and as numeric methods.\n# It is a matter of personal taste and\n# programming style as to which is used.\nsay sqrt 2; # Square root\nsay 2.sqrt; # Square root\n\n# If you omit a base, does natural logarithm\nsay log 2; # Natural logarithm\nsay 2.log; # Natural logarithm\n\n# Specify a base if other than e\nsay log 4, 10; # Base 10 logarithm\nsay 4.log(10); # Base 10 logarithm\nsay 4.log10; # Convenience, base 10 only logarithm\n\nsay exp 7; # Exponentiation base e\nsay 7.exp; # Exponentiation base e\n\n# Specify a base if other than e\nsay exp 7, 4; # Exponentiation\nsay 7.exp(4); # Exponentiation\nsay 4 ** 7; # Exponentiation\n\nsay abs -2; # Absolute value\nsay (-2).abs; # Absolute value\n\nsay floor -3.5; # Floor\nsay (-3.5).floor; # Floor\n\nsay ceiling pi; # Ceiling\nsay pi.ceiling; # Ceiling\n\nsay e ** π\\i + 1 ≅ 0; # :-)\n","language":"Raku"},{"code":"a=abs(y) /*takes the absolute value of y.*/\n","language":"REXX"},{"code":"r=x**y /*REXX only supports integer powers.*/\n /*Y may be negative, zero, positive.*/\n /*X may be any real number. */\n","language":"REXX"},{"code":"ceiling: procedure; parse arg x; t=trunc(x); return t+(x>0)*(x\\=t)\n","language":"REXX"},{"code":"floor: procedure; parse arg x; t=trunc(x); return t-(x<0)-(x\\=t)\n","language":"REXX"},{"code":"/*──────────────────────────────────SQRT subroutine───────────────────────────*/\nsqrt: procedure; parse arg x; if x=0 then return 0 /*handle 0 case.*/\nif \\datatype(x,'N') then return '[n/a]' /*Not Applicable ───if not numeric.*/\ni=; if x<0 then do; x=-x; i='i'; end /*handle complex numbers if X is < 0.*/\nd=digits() /*get the current numeric precision. */\nm.=9 /*technique uses just enough digits. */\nh=d+6 /*use extra decimal digits for accuracy*/\nnumeric digits 9 /*use \"small\" precision at first. */\nnumeric form /*force scientific form of the number. */\nif fuzz()\\==0 then numeric fuzz 0 /*just in case invoker has a FUZZ set.*/\nparse value format(x,2,1,,0) 'E0' with g 'E' _ . /*get the X's exponent.*/\n g=(g * .5) || 'e' || (_ % 2) /*1st guesstimate for the square root. */\n /* g= g * .5 'e' (_ % 2) */ /*a shorter & concise version of above.*/\n /*Note: to insure enough accuracy for */\n /* the result, the precision during */\n /* the SQRT calculations is increased */\n /* by two extra decimal digits. */\n do j=0 while h>9; m.j=h; h=h%2+1 /*compute the sizes (digs) of precision*/\n end /*j*/ /* [↑] precisions are stored in M. */\n /*now, we start to do the heavy lifting*/\n do k=j+5 to 0 by -1 /*compute the √ with increasing digs.*/\n numeric digits m.k /*each iteration, increase the digits. */\n g=(g+x/g) * .5 /*perform the nitty-gritty calculations*/\n end /*k*/ /* [↑] * .5 is faster than / 2 */\n /* [↓] normalize √ ──► original digits*/\nnumeric digits d /* [↓] make answer complex if X < 0. */\nreturn (g/1)i /*normalize, and add possible I suffix.*/\n","language":"REXX"},{"code":" ╔════════════════════════════════════════════════════════════════════╗\n╔═╝ __ ╚═╗\n║ √ ║\n║ ║\n║ While the above REXX code seems like it's doing a lot of extra work, ║\n║ it saves a substantial amount of processing time when the precision ║\n║ (DIGITs) is a lot greater than the default (default is nine digits). ║\n║ ║\n║ Indeed, when computing square roots in the hundreds (even thousands) ║\n║ of digits, this technique reduces the amount of CPU processing time ║\n║ by keeping the length of the computations to a minimum (due to a large ║\n║ precision), while the accuracy at the beginning isn't important for ║\n║ calculating the (first) guesstimate (the running square root guess). ║\n║ ║\n║ Each iteration of K (approximately) doubles the number of digits, ║\n║ but takes almost four times longer to compute (actually, around 3.8). ║\n║ ║\n║ The REXX code could be streamlined (pruned) by removing the ║\n║ The NUMERIC FUZZ 0 statement can be removed if it is known ║\n║ that it is already set to zero. (which is the default). ║\n║ ║\n║ Also, the NUMERIC FORM statement can be removed if it is known ║\n║ that the form is SCIENTIFIC (which is the default). ║\n║ __ ║\n╚═╗ √ ╔═╝\n ╚════════════════════════════════════════════════════════════════════╝\n","language":"REXX"},{"code":"/*──────────────────────────────────SQRT subroutine─────────────────────*/\nsqrt: procedure; arg x /*a simplistic SQRT subroutine.*/\nif x=0 then return 0 /*handle special case of zero. */\nd=digits() /*get the current precision (dig)*/\nnumeric digits d+2 /*ensure extra precision (2 digs)*/\ng=x/4 /*try get a so-so 1st guesstimate*/\nold=0 /*set OLD guess to zero. */\n do forever /*keep at it 'til G (guess)=old.*/\n g=(g+x/g) / 2 /*do the nitty-gritty calculation*/\n if g=old then leave /*if G is the same as old, quit. */\n old=g /*save OLD for next iteration. */\n end /*forever*/ /* [↑] ···'til we run out of digs*/\nnumeric digits d /*restore the original precision.*/\nreturn g/1 /*normalize to old precision (d).*/\n","language":"REXX"},{"code":"numeric digits ddd /*sets the current precision to DDD */\nnumeric fuzz fff /*arithmetic comparisons with FFF fuzzy*/\nnumeric form kkk /*exponential: scientific | engineering*/\n\nlow=min(a,b,c,d,e,f,g, ...) /*finds the min of specified arguments.*/\nbig=min(a,b,c,d,e,f,g, ...) /*finds the max of specified arguments.*/\n\nrrr=random(low,high) /*gets a random integer from LOW-->HIGH*/\narr=random(low,high,seed) /* ... with a seed (to make repeatable)*/\n\nmzp=sign(x) /*finds the sign of x (-1, 0, +1). */\n\n fs=format(x) /*formats X with the current DIGITS() */\n fb=format(x,bbb) /* BBB digs before decimal*/\n fa=format(x,bbb,aaa) /* AAA digs after decimal*/\n fa=format(x,,0) /* rounds X to an integer.*/\n fe=format(x,,eee) /* exponent has eee places. */\n ft=format(x,,eee,ttt) /*if x exceeds TTT digits, force exp. */\n\nhh=b2x(bbb) /*converts binary/bits to hexadecimal. */\ndd=c2d(ccc) /*converts character to decimal. */\nhh=c2x(ccc) /*converts character to hexadecimal. */\ncc=d2c(ddd) /*converts decimal to character. */\nhh=d2x(ddd) /*converts decimal to hexadecimal. */\nbb=x2b(hhh) /*converts hexadecimal to binary (bits)*/\ncc=x2c(hhh) /*converts hexadecimal to character. */\ndd=x2d(hhh) /*converts hexadecimal to decimal. */\n","language":"REXX"},{"code":"See \"Mathematical Functions\" + nl\nSee \"Sin(0) = \" + sin(0) + nl\nSee \"Sin(90) radians = \" + sin(90) + nl\nSee \"Sin(90) degree = \" + sin(90*3.14/180) + nl\n\nSee \"Cos(0) = \" + cos(0) + nl\nSee \"Cos(90) radians = \" + cos(90) + nl\nSee \"Cos(90) degree = \" + cos(90*3.14/180) + nl\n\nSee \"Tan(0) = \" + tan(0) + nl\nSee \"Tan(90) radians = \" + tan(90) + nl\nSee \"Tan(90) degree = \" + tan(90*3.14/180) + nl\n\nSee \"asin(0) = \" + asin(0) + nl\nSee \"acos(0) = \" + acos(0) + nl\nSee \"atan(0) = \" + atan(0) + nl\nSee \"atan2(1,1) = \" + atan2(1,1) + nl\n\nSee \"sinh(0) = \" + sinh(0) + nl\nSee \"sinh(1) = \" + sinh(1) + nl\nSee \"cosh(0) = \" + cosh(0) + nl\nSee \"cosh(1) = \" + cosh(1) + nl\nSee \"tanh(0) = \" + tanh(0) + nl\nSee \"tanh(1) = \" + tanh(1) + nl\n\nSee \"exp(0) = \" + exp(0) + nl\nSee \"exp(1) = \" + exp(1) + nl\nSee \"log(1) = \" + log(1) + nl\nSee \"log(2) = \" + log(2) + nl\nSee \"log10(1) = \" + log10(1) + nl\nSee \"log10(2) = \" + log10(2) + nl\nSee \"log10(10) = \" + log10(10) + nl\n\nSee \"Ceil(1.12) = \" + Ceil(1.12) + nl\nSee \"Ceil(1.72) = \" + Ceil(1.72) + nl\n\nSee \"Floor(1.12) = \" + floor(1.12) + nl\nSee \"Floor(1.72) = \" + floor(1.72) + nl\n\nSee \"fabs(1.12) = \" + fabs(1.12) + nl\nSee \"fabs(1.72) = \" + fabs(1.72) + nl\n\nSee \"pow(2,3) = \" + pow(2,3) + nl\n\nsee \"sqrt(16) = \" + sqrt(16) + nl\n","language":"Ring"},{"code":">> const\n e euler ln10 ln2 lnpi\n log10e log2e pi pihalf piquarter\n rpi sqrt2 sqrt2r sqrt3 sqrtpi\n tworpi\n","language":"RLaB"},{"code":">> mks\n F G J L N\n Na R0 Ry Tsp V0\n a a0 acre alpha atm\n au bar barn btu c\n cal cgal cm cm2 cm3\n ct cup curie day dm\n dm2 dm3 dyne e eV\n eps0 erg fathom floz ft\n ftcan ftlam g gal gauss\n gf h ha hbar hour\n hp in inH2O inHg kSB\n kb kcal km km2 km3\n kmh knot kpf lam lb\n lumen lux ly mHg mSun\n me micron mil mile min\n mm mm2 mm3 mmu mn\n mp mph mu0 mub mue\n mun mup nmi oz pal\n parsec pf phot poise psi\n rad roe stilb stokes tcs\n therm tntton ton torr toz\n tsp uam ukgal ukton uston\n week yd\n","language":"RLaB"},{"code":">> x = rand()\n>> sqrt(x)\n 2.23606798\n>> log(x)\n 1.60943791\n>> log10(x)\n 0.698970004\n>> exp(x)\n 148.413159\n>> abs(x)\n 5\n>> floor(x)\n 5\n>> ceil(x)\n 5\n>> x .^ 2\n 25\n","language":"RLaB"},{"code":"x.abs #absolute value\nx.magnitude #absolute value\nx.floor #floor\nx.ceil #ceiling\nx ** y #power\ninclude Math\nE #e\nPI #pi\nsqrt(x) #square root\nlog(x) #natural logarithm\nlog(x, y) #logarithm base y\nlog10(x) #base 10 logarithm\nexp(x) #exponential\n","language":"Ruby"},{"code":"print \"exp:\";chr$(9); EXP(1)\nprint \"PI:\";chr$(9); 22/7\nprint \"Sqr2:\";chr$(9); SQR(2)\nprint \"Log2:\";chr$(9); LOG(2) : REM Base 10\nprint \"Exp2:\";chr$(9); EXP(2)\nprint \"Abs2:\";chr$(9); ABS(-2)\nprint \"Floor:\";chr$(9); INT(1.534)\nprint \"ceil:\";chr$(9); val(using(\"###\",1.534))\nprint \"Power:\";chr$(9); 1.23^4\n","language":"Run-BASIC"},{"code":"use std::f64::consts::*;\n\nfn main() {\n // e (base of the natural logarithm)\n let mut x = E;\n // π\n x += PI;\n // square root\n x = x.sqrt();\n // logarithm (any base allowed)\n x = x.ln();\n // ceiling (smallest integer not less than this number--not the same as round up)\n x = x.ceil();\n // exponential (ex)\n x = x.exp();\n // absolute value (a.k.a. \"magnitude\")\n x = x.abs();\n // floor (largest integer less than or equal to this number--not the same as truncate or int)\n x = x.floor();\n // power (xy)\n x = x.powf(x);\n\n assert_eq!(x, 4.0);\n}\n","language":"Rust"},{"code":"object RealConstantsFunctions extends App{\n println(math.E) // e\n println(math.Pi) // pi\n println(math.sqrt(2.0)) // square root\n println(math.log(math.E)) // log to base e\n println(math.log10(10.0)) // log to base 10\n println(math.exp(1.0)) // exponential\n println(math.abs(-1)) // absolute value\n println(math.floor(-2.5)) // floor\n println(math.ceil(-2.5)) // ceiling\n println(math.pow(2.5, 3.5)) // power\n}\n","language":"Scala"},{"code":"(sqrt x) ;square root\n(log x) ;natural logarithm\n(exp x) ;exponential\n(abs x) ;absolute value\n(floor x) ;floor\n(ceiling x) ;ceiling\n(expt x y) ;power\n","language":"Scheme"},{"code":"Num.e # e\nNum.pi # pi\nx.sqrt # square root\nx.log # natural logarithm\nx.log10 # base 10 logarithm\nx.exp # e raised to the power of x\nx.abs # absolute value\nx.floor # floor\nx.ceil # ceiling\nx**y # exponentiation\n","language":"Sidef"},{"code":"EXP 1\n","language":"Sinclair-ZX81-BASIC"},{"code":"PI\n","language":"Sinclair-ZX81-BASIC"},{"code":"SQR X\n","language":"Sinclair-ZX81-BASIC"},{"code":"LN X\n","language":"Sinclair-ZX81-BASIC"},{"code":"EXP X\n","language":"Sinclair-ZX81-BASIC"},{"code":"ABS X\n","language":"Sinclair-ZX81-BASIC"},{"code":"INT X\n","language":"Sinclair-ZX81-BASIC"},{"code":"X**Y\n","language":"Sinclair-ZX81-BASIC"},{"code":"numerics E.\nnumerics Pi.\nn sqrt.\nn log10. \"base 10 logarithm\"\nn ln. \"natural logarithm\"\nn log: m. \"arbitrary base logarithm\"\nn exp. \"exponential\"\nn abs. \"absolute value\"\nn floor.\nn ceiling.\nn raisedTo: anotherNumber\n","language":"Slate"},{"code":"Float e.\nFloat pi.\naNumber sqrt.\naNumber log. \"base 10 logarithm\"\naNumber ln. \"natural logarithm\"\naNumber exp. \"exponential\"\naNumber abs. \"absolute value\"\naNumber floor.\naNumber ceiling.\naNumber raisedTo: anotherNumber\n","language":"Smalltalk"},{"code":"// e:\nprint(M_E);\n\n// π:\nprint(M_PI);\n\n// square root:\nlet five = sqrt(25);\n\n// logarithm\n// natural:\nlet one = log(M_E);\n// base-2:\nlet six = log2(64);\n// base-10\nlet three = log10(1000);\n\n// exponential\nlet e_cubed = exp(3);\n\n// absolute value\nlet ten = abs(-10);\n\n// floor\nlet seven = floor(7.8);\n\n// ceiling\nlet four = ceil(3.2);\n\n// power\nlet eighty_one = pow(3, 4);\n","language":"Sparkling"},{"code":"Math.e; (* e *)\nMath.pi; (* pi *)\nMath.sqrt x; (* square root *)\nMath.ln x; (* natural logarithm--log base 10 also available (Math.log10) *)\nMath.exp x; (* exponential *)\nabs x; (* absolute value *)\nfloor x; (* floor *)\nceil x; (* ceiling *)\nMath.pow (x, y); (* power *)\n~ x; (* negation *)\n","language":"Standard-ML"},{"code":"scalar x=2\nscalar y=3\ndi exp(1)\ndi _pi\ndi c(pi)\ndi sqrt(x)\ndi log(x)\ndi log10(x)\ndi exp(x)\ndi abs(x)\ndi floor(x)\ndi ceil(x)\ndi x^y\n","language":"Stata"},{"code":"import Darwin\n\nM_E // e\nM_PI // pi\nsqrt(x) // square root--cube root also available (cbrt)\nlog(x) // natural logarithm--log base 10 also available (log10)\nexp(x) // exponential\nabs(x) // absolute value\nfloor(x) // floor\nceil(x) // ceiling\npow(x,y) // power\n","language":"Swift"},{"code":"expr {exp(1)} ;# e\nexpr {4 * atan(1)} ;# pi -- also, simpler: expr acos(-1)\nexpr {sqrt($x)} ;# square root\nexpr {log($x)} ;# natural logarithm, also log10\nexpr {exp($x)} ;# exponential\nexpr {abs($x)} ;# absolute value\nexpr {floor($x)} ;# floor\nexpr {ceil($x)} ;# ceiling\nexpr {$x**$y} ;# power, also pow($x,$y)\n","language":"Tcl"},{"code":"package require math::constants\nmath::constants::constants e pi\nputs \"e = $e, pi = $pi\"\n","language":"Tcl"},{"code":"FUNCTION floor(x)\n IF x > 0 THEN\n LET floor = INT(x)\n ELSE\n IF x <> INT(x) THEN LET floor = INT(x) - 1 ELSE LET floor = INT(x)\n END IF\nEND FUNCTION\n\nPRINT \"e = \"; exp(1) ! e not available\nPRINT \"PI = \"; PI\n\nLET x = 12.345\nLET y = 1.23\n\nPRINT \"sqrt = \"; SQR(x), x^0.5 ! square root- NB the unusual name\nPRINT \"ln = \"; LOG(x) ! natural logarithm base e\nPRINT \"log2 = \"; LOG2(x) ! base 2 logarithm\nPRINT \"log10 = \"; LOG10(x) ! base 10 logarithm\nPRINT \"log = \"; LOG(x)/LOG(y) ! arbitrary base logarithm\nPRINT \"exp = \"; EXP(x) ! exponential\nPRINT \"abs = \"; ABS(-1) ! absolute value\nPRINT \"floor = \"; floor(x) ! floor easily implemented as functions\nPRINT \"ceil = \"; CEIL(x) ! ceiling\nPRINT \"power = \"; x ^ y ! power\nEND\n","language":"True-BASIC"},{"code":"echo $(( exp(1) )) # e\necho $(( acos(-1) )) # PI\nx=5\necho $(( sqrt(x) )) # square root\necho $(( log(x) )) # logarithm base e\necho $(( log2(x) )) # logarithm base 2\necho $(( log10(x) )) # logarithm base 10\necho $(( exp(x) )) # exponential\nx=-42\necho $(( abs(x) )) # absolute value\nx=-5.5\necho $(( floor(x) )) # floor\necho $(( ceil(x) )) # ceiling\nx=10 y=3\necho $(( pow(x,y) )) # power\n","language":"UNIX-Shell"},{"code":"import math\n\nfn main() {\n x := -1.2345\n println(\"e = ${math.e}\")\n println(\"pi = ${math.pi}\")\n println(\"sqrt(4) = ${math.sqrt(4)}\")\n println(\"log(e) = ${math.log(math.e)}\")\n println(\"exp(x) = ${math.exp(x)}\")\n println(\"abs(x) = ${math.abs(x)}\")\n println(\"floor(x) = ${math.floor(x)}\")\n println(\"ceil(x) = ${math.ceil(x)}\")\n println(\"pow(-x, x) = ${math.pow(-x, x)}\")\n}\n","language":"V-(Vlang)"},{"code":"var e = 1.exp\n\nSystem.print(\"e = %(e)\")\nSystem.print(\"pi = %(Num.pi)\")\nSystem.print(\"sqrt(2) = %(2.sqrt)\")\nSystem.print(\"ln(3) = %(3.log)\") // log base e\nSystem.print(\"exp(2) = %(2.exp)\")\nSystem.print(\"abs(-e) = %((-e).abs)\")\nSystem.print(\"floor(e) = %(e.floor)\")\nSystem.print(\"ceil(e) = %(e.ceil)\")\nSystem.print(\"pow(e, 2) = %(e.pow(2))\")\n","language":"Wren"},{"code":"PROGRAM\t\"progname\"\nVERSION \"0.0000\"\n\nIMPORT\t\"xma\"\n\nDECLARE FUNCTION Entry ()\nDECLARE FUNCTION Ceil (x)\nDECLARE FUNCTION Floor (x)\n\nFUNCTION Entry ()\n DOUBLE e, pi, x, y\n\n e = EXP(1)\n PRINT \"e = \"; e ' e not available\n pi = 4 * ATAN(1)\n PRINT \"pi = \"; pi ' pi not available\n\n x = 12.345\n y = 1.23\n\n PRINT \"sqrt = \"; SQRT (x) ' square root\n PRINT \"ln = \"; LOG (x) ' natural logarithm base e\n PRINT \"log10 = \"; LOG10 (x) ' base 10 logarithm\n PRINT \"log = \"; LOG (x) / LOG (y) ' arbitrary base logarithm\n PRINT \"exp = \"; EXP (x) ' exponential\n PRINT \"abs = \"; ABS (-x) ' absolute value\n PRINT \"Floor = \"; Floor (x) ' Floor easily implemented as functions\n PRINT \"Ceil = \"; Ceil (x) ' Ceil easily implemented as functions\n PRINT \"power = \"; x ** y ' power\nEND FUNCTION\n\nFUNCTION Ceil (x)\n IF x < 0 THEN RETURN INT(x) ELSE RETURN INT(x) + 1\nEND FUNCTION\n\nFUNCTION Floor (x)\n IF x > 0 THEN\n RETURN INT(x)\n ELSE\n\t IF x <> INT(x) THEN RETURN INT(x) - 1 ELSE RETURN INT(x)\n END IF\nEND FUNCTION\nEND PROGRAM\n","language":"XBasic"},{"code":"include c:\\cxpl\\codes; \\intrinsic 'code' declarations\n\nfunc real Power(X, Y); \\X raised to the Y power\nreal X, Y;\nreturn Exp(Y*Ln(X));\n\nreal E, Pi;\n[Format(4, 16); \\places shown before and after .\nE:= Exp(1.0);\nRlOut(0, E); CrLf(0);\nRlOut(0, Ln(E)); CrLf(0);\nCrLf(0);\nPi:= ATan2(0.0, -1.0); \\Pi is also a defined constant\nRlOut(0, Pi); CrLf(0);\nRlOut(0, Cos(Pi)); CrLf(0);\nCrLf(0);\nRlOut(0, Sqrt(2.0)); CrLf(0); \\Sqrt is a call to an intrinsic\nRlOut(0, Log(100.0)); CrLf(0);\nRlOut(0, Ln(Exp(123.456789))); CrLf(0);\nCrLf(0);\nRlOut(0, abs(-1234.5)); CrLf(0); \\abs works for both reals & ints\nCrLf(0);\nRlOut(0, float(fix(1.999-0.5))); CrLf(0); \\floor rounds toward -infinity\nRlOut(0, float(fix(1.001+0.5))); CrLf(0); \\ceiling rounds toward +infinity\nRlOut(0, Power(sqrt(2.0), 4.0)); CrLf(0); \\sqrt is an inline function and\n] \\ can be used for both reals & ints\n","language":"XPL0"},{"code":"print \"e = \", euler\nprint \"pi = \", pi\n\nx = 12.345\ny = 1.23\n\nprint \"sqrt = \", sqrt(2) // square root\nprint \"ln = \", log(euler) // natural logarithm base e\nprint \"log = \", log(x, y)\t // arbitrary base y logarithm\nprint \"exp = \", exp(euler) // exponential\nprint \"abs = \", abs(-1) // absolute value\nprint \"floor = \", floor(-euler) // floor\nprint \"ceil = \", ceil(-euler) // ceiling\nprint \"power = \", x ^ y, \" \", x ** y // power\nend\n","language":"Yabasic"},{"code":"const std = @import(\"std\");\n\npub fn main() void {\n var x: f64 = -1.2345;\n std.debug.print(\"e = {d}\\n\", .{std.math.e});\n std.debug.print(\"pi = {d}\\n\", .{std.math.pi});\n std.debug.print(\"sqrt(4) = {d}\\n\", .{std.math.sqrt(4)});\n std.debug.print(\"ln(e) = {d}\\n\", .{std.math.ln(std.math.e)});\n std.debug.print(\"exp(x) = {d}\\n\", .{std.math.exp(x)});\n std.debug.print(\"abs(x) = {d}\\n\", .{std.math.absFloat(x)});\n std.debug.print(\"floor(x) = {d}\\n\", .{std.math.floor(x)});\n std.debug.print(\"ceil(x) = {d}\\n\", .{std.math.ceil(x)});\n std.debug.print(\"pow(f64, -x, x) = {d}\\n\", .{std.math.pow(f64, -x, x)});\n}\n","language":"Zig"},{"code":"(0.0).e // Euler's number, a property of all floats\n(0.0).e.pi // pi, yep, all floats\n(2.0).sqrt() // square root\n(2.0).log() // natural (base e) logarithm\n(2.0).log10() // log base 10\n(0.0).e.pow(x) // e^x\n(-10.0).abs() // absolute value, both floats and ints\nx.pow(y) // x raised to the y power\nx.ceil() // ceiling\nx.floor() // floor\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Arithmetic operations\\n- Simple\\nfrom: http://rosettacode.org/wiki/Real_constants_and_functions\\nnote: Basic language learning\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nShow how to use the following math constants and functions in your language (if not available, note it):\\n:* <big>''e''</big> (base of the natural logarithm)\\n:* <big><math>\\\\pi</math></big>\\n:* square root\\n:* logarithm (any base allowed)\\n:* exponential (<big>''e''<sup>''x''</sup></big> )\\n:* absolute value (a.k.a. \\\"magnitude\\\")\\n:* floor (largest integer less than or equal to this number--not the same as truncate or int)\\n:* ceiling (smallest integer not less than this number--not the same as round up)\\n:* power (<big>''x''<sup>''y''</sup></big> )\\n\\n\\n;Related task:\\n* [[Trigonometric Functions]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"math:e // e\\nmath:pi // pi\\nsqrt(x) // square root\\nlog(x) // natural logarithm\\nlog10(x) // base 10 logarithm\\nexp(x) // e raised to the power of x\\nabs(x) // absolute value\\nfloor(x) // floor\\nceil(x) // ceiling\\nx ^ y // exponentiation\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"GetAbs: ;assumes value we want to abs() is loaded into accumulator\\neor #$ff\\nclc\\nadc #1\\nrts\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"(floor 15 2) ;; This is the floor of 15/2\\n(ceiling 15 2)\\n(expt 15 2) ;; 15 squared\\n\",\n \"language\": \"ACL2\"\n },\n {\n \"code\": \"define floor(x);\\n if x < 0 then\\n -intof(x);\\n else\\n intof(x);\\n endif;\\nenddefine;\\n\\ndefine ceiling(x);\\n -floor(-x);\\nenddefine;\\n\",\n \"language\": \"ACL2\"\n },\n {\n \"code\": \"INCLUDE \\\"H6:REALMATH.ACT\\\"\\n\\nPROC Euler(REAL POINTER e)\\n REAL x\\n\\n IntToReal(1,x)\\n Exp(x,e)\\nRETURN\\n\\nPROC Main()\\n REAL a,b,c\\n INT i\\n\\n Put(125) PutE() ;clear screen\\n MathInit()\\n\\n Euler(a)\\n Print(\\\"e=\\\") PrintR(a)\\n PrintE(\\\" by Exp(1)\\\")\\n\\n ValR(\\\"2\\\",a)\\n Sqrt(a,b)\\n Print(\\\"Sqrt(\\\") PrintR(a)\\n Print(\\\")=\\\") PrintR(b)\\n Print(\\\" by Power(\\\") PrintR(a)\\n PrintE(\\\",0.5)\\\")\\n\\n ValR(\\\"2.5\\\",a)\\n Ln(a,b)\\n Print(\\\"Ln(\\\") PrintR(a)\\n Print(\\\")=\\\") PrintRE(b)\\n\\n ValR(\\\"14.2\\\",a)\\n Log10(a,b)\\n Print(\\\"Log10(\\\") PrintR(a)\\n Print(\\\")=\\\") PrintRE(b)\\n\\n ValR(\\\"-3.7\\\",a)\\n Exp(a,b)\\n Print(\\\"Exp(\\\") PrintR(a)\\n Print(\\\")=\\\") PrintRE(b)\\n\\n ValR(\\\"2.6\\\",a)\\n Exp10(a,b)\\n Print(\\\"Exp10(\\\") PrintR(a)\\n Print(\\\")=\\\") PrintRE(b)\\n\\n ValR(\\\"25.3\\\",a)\\n ValR(\\\"1.3\\\",b)\\n Power(a,b,c)\\n Print(\\\"Power(\\\") PrintR(a)\\n Print(\\\",\\\") PrintR(b)\\n Print(\\\")=\\\") PrintRE(c)\\n\\n ValR(\\\"-32.5\\\",a)\\n RealAbs(a,b)\\n Print(\\\"Abs(\\\") PrintR(a)\\n Print(\\\")=\\\") PrintR(b)\\n PrintE(\\\" by bit manipulation\\\")\\n\\n ValR(\\\"23.15\\\",a)\\n i=Floor(a)\\n Print(\\\"Floor(\\\") PrintR(a)\\n PrintF(\\\")=%I by own function%E\\\",i)\\n\\n ValR(\\\"-23.15\\\",a)\\n i=Floor(a)\\n Print(\\\"Floor(\\\") PrintR(a)\\n PrintF(\\\")=%I by own function%E\\\",i)\\n\\n ValR(\\\"23.15\\\",a)\\n i=Ceiling(a)\\n Print(\\\"Ceiling(\\\") PrintR(a)\\n PrintF(\\\")=%I by own function%E\\\",i)\\n\\n ValR(\\\"-23.15\\\",a)\\n i=Ceiling(a)\\n Print(\\\"Ceiling(\\\") PrintR(a)\\n PrintF(\\\")=%I by own function%E\\\",i)\\n\\n PutE()\\n PrintE(\\\"There is no support in Action! for pi.\\\")\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"Math.E; //e\\nMath.PI; //pi\\nMath.sqrt(u); //square root of u\\nMath.log(u); //natural logarithm of u\\nMath.exp(u); //e to the power of u\\nMath.abs(u); //absolute value of u\\nMath.floor(u);//floor of u\\nMath.ceil(u); //ceiling of u\\nMath.pow(u,v);//u to the power of v\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"Math.LN10; // natural logarithm of 10\\nMath.LN2; // natural logarithm of 2\\nMath.LOG10E; // base-10 logarithm of e\\nMath.LOG2E; // base-2 logarithm of e\\nMath.SQRT1_2;// square root of 1/2\\nMath.SQRT2; //square root of 2\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"Ada.Numerics.e -- Euler's number\\nAda.Numerics.pi -- pi\\nsqrt(x) -- square root\\nlog(x, base) -- logarithm to any specified base\\nexp(x) -- exponential\\nabs(x) -- absolute value\\nS'floor(x) -- Produces the floor of an instance of subtype S\\nS'ceiling(x) -- Produces the ceiling of an instance of subtype S\\nx**y -- x raised to the y power\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# e\\nexp(1);\\n# pi\\n2 * asin(1);\\n\\nsqrt(x);\\nlog(x);\\nexp(x);\\nfabs(x);\\nfloor(x);\\nceil(x);\\npow(x, y);\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"REAL x:=exp(1), y:=4*atan(1);\\nprintf(($g(-8,5)\\\"; \\\"$,\\n exp(1), # e #\\n pi, # pi #\\n sqrt(x), # square root #\\n log(x), # logarithm base 10 #\\n ln(x), # natural logarithm #\\n exp(x), # exponential #\\n ABS x, # absolute value #\\n ENTIER x, # floor #\\n -ENTIER -x, # ceiling #\\n x ** y # power #\\n))\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin\\n real t, u;\\n t := 10;\\n u := -2.3;\\n i_w := 4; s_w := 0; r_format := \\\"A\\\"; r_d := 4; r_w := 9; % set output format %\\n write( \\\" e: \\\", exp( 1 ) ); % e %\\n write( \\\" pi: \\\", pi ); % pi %\\n write( \\\" root t: \\\", sqrt( t ) ); % square root %\\n write( \\\" log t: \\\", log( t ) ); % log base 10 %\\n write( \\\" ln t: \\\", ln( t ) ); % log base e %\\n write( \\\" exp u: \\\", exp( u ) ); % exponential %\\n write( \\\" abs u: \\\", abs u ); % absolute value %\\n write( \\\" floor pi: \\\", entier( pi ) ); % floor %\\n write( \\\"ceiling pi: \\\", - entier( - pi ) ); % ceiling %\\n % the raise-to-the-power operator is \\\"**\\\" - it only allows integers for the power %\\n write( \\\" pi cubed: \\\", pi ** 3 ) % use exp( ln( x ) * y ) for general x^y %\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"100 HOME : REM 10 CLS for GW-BASIC or MSX Basic or QBasic\\n110 PRINT \\\"e = \\\";EXP(1) \\t\\t:REM e not available\\n120 PRINT \\\"PI = \\\";4 * ATN(1) \\t:REM pi not available\\n130 X = 12.345\\n140 Y = 1.23\\n150 PRINT \\\"sqrt = \\\";SQR(X) \\t\\t:REM square root\\n160 PRINT \\\"ln = \\\";LOG(X) \\t\\t:REM natural logarithm base e\\n170 PRINT \\\"log10 = \\\";LOG(X)/LOG(10) :REM base 10 logarithm\\n180 PRINT \\\"log = \\\";LOG(X)/LOG(Y) :REM arbitrary base logarithm\\n190 PRINT \\\"exp = \\\";EXP(X) \\t\\t:REM exponential\\n200 PRINT \\\"abs = \\\";ABS(-X) \\t\\t:REM absolute value\\n210 PRINT \\\"floor = \\\"; \\t\\t\\t\\t:REM floor not available\\n220 IF X > 0 THEN PRINT INT(X)\\n230 IF X <= 0 AND X <> INT(X) THEN PRINT INT(X)-1\\n240 IF X <= 0 AND X = INT(X) THEN PRINT INT(X)\\n250 PRINT \\\"ceil = \\\"; \\t\\t\\t\\t:REM ceil not available\\n260 IF X < 0 THEN PRINT INT(X)\\n270 IF X >= 0 THEN PRINT INT(X)+1\\n280 PRINT \\\"power = \\\";X^Y \\t\\t\\t:REM power\\n290 END\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"/* functions not availables */\\n\",\n \"language\": \"ARM-Assembly\"\n },\n {\n \"code\": \"print [\\\"Euler:\\\" e]\\nprint [\\\"Pi:\\\" pi]\\n\\nprint [\\\"sqrt 2.0:\\\" sqrt 2.0]\\nprint [\\\"ln 100:\\\" ln 100]\\nprint [\\\"log(10) 100:\\\" log 100 10]\\nprint [\\\"exp 3:\\\" exp 3]\\nprint [\\\"abs -1:\\\" abs neg 1]\\nprint [\\\"floor 23.536:\\\" floor 23.536]\\nprint [\\\"ceil 23.536:\\\" ceil 23.536]\\nprint [\\\"2 ^ 8:\\\" 2 ^ 8]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"real e = exp(1); // e not available\\nwrite(\\\"e = \\\", e);\\nwrite(\\\"pi = \\\", pi);\\n\\nreal x = 12.345;\\nreal y = 1.23;\\n\\nwrite(\\\"sqrt = \\\", sqrt(2)); // square root\\nwrite(\\\"ln = \\\", log(e)); // natural logarithm base e\\nwrite(\\\"log = \\\", log10(x)); // base 10 logarithm\\nwrite(\\\"log1p = \\\", log1p(x)); // log (1+x)\\nwrite(\\\"exp = \\\", exp(e)); // exponential\\nwrite(\\\"abs = \\\", abs(-1)); // absolute value\\nwrite(\\\"fabs = \\\", fabs(-1)); // absolute value\\nwrite(\\\"floor = \\\", floor(-e)); // floor\\nwrite(\\\"ceil = \\\", ceil(-e)); // ceiling\\nwrite(\\\"power = \\\", x ^ y); // power\\nwrite(\\\"power = \\\", x ** y); // power\\n\",\n \"language\": \"Asymptote\"\n },\n {\n \"code\": \"Sqrt(Number) ; square root\\nLog(Number) ; logarithm (base 10)\\nLn(Number) ; natural logarithm (base e)\\nExp(N) ; e to the power N\\nAbs(Number) ; absolute value\\nFloor(Number) ; floor\\nCeil(Number) ; ceiling\\nx**y ; x to the power y\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"e:=exp(1)\\npi:=2*asin(1)\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"Sin(Number) ; sine\\nCos(Number) ; cosine\\nTan(Number) ; tangent\\nASin(Number) ; arcsine\\nACos(Number) ; arccosine\\nATan(Number) ; arctangent\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"BEGIN {\\n\\tprint sqrt(2)\\t\\t# square root\\n\\tprint log(2)\\t\\t# logarithm base e\\n\\tprint exp(2)\\t\\t# exponential\\n\\tprint 2 ^ -3.4\\t\\t# power\\n}\\n# outputs 1.41421, 0.693147, 7.38906, 0.0947323\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"BEGIN {\\n\\tE = exp(1)\\n\\tPI = atan2(0, -1)\\n}\\n\\nfunction abs(x) {\\n\\treturn x < 0 ? -x : x\\n}\\n\\nfunction floor(x) {\\n\\ty = int(x)\\n\\treturn y > x ? y - 1 : y\\n}\\n\\nfunction ceil(x) {\\n\\ty = int(x)\\n\\treturn y < x ? y + 1 : y\\n}\\n\\nBEGIN {\\n\\tprint E\\n\\tprint PI\\n\\tprint abs(-3.4)\\t\\t# absolute value\\n\\tprint floor(-3.4)\\t# floor\\n\\tprint ceil(-3.4)\\t# ceiling\\n}\\n# outputs 2.71828, 3.14159, 3.4, -4, -3\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"√(X)\\n\",\n \"language\": \"Axe\"\n },\n {\n \"code\": \"√(Y)ʳ\\n\",\n \"language\": \"Axe\"\n },\n {\n \"code\": \"ln(X)\\n\",\n \"language\": \"Axe\"\n },\n {\n \"code\": \"e^(X)\\n\",\n \"language\": \"Axe\"\n },\n {\n \"code\": \"abs(X)\\n\",\n \"language\": \"Axe\"\n },\n {\n \"code\": \"e = exp(1) # e not available\\nprint \\\"e = \\\"; e\\nprint \\\"PI = \\\"; PI\\n\\nx = 12.345\\ny = 1.23\\n\\nprint \\\"sqrt = \\\"; sqr(x) # square root\\nprint \\\"ln = \\\"; log(e) # natural logarithm base e\\nprint \\\"log10 = \\\"; log10(e) # base 10 logarithm\\nprint \\\"log = \\\"; log(x)/log(y)\\t # arbitrary base logarithm\\nprint \\\"exp = \\\"; exp(e) # exponential\\nprint \\\"abs = \\\"; abs(-1) # absolute value\\nprint \\\"floor = \\\"; floor(-e) # floor\\nprint \\\"ceil = \\\"; ceil(-e) # ceiling\\nprint \\\"power = \\\"; x ^ y # power\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \" e = EXP(1)\\n Pi = PI\\n Sqr2 = SQR(2)\\n Ln2 = LN(2)\\n Log2 = LOG(2) : REM Base 10\\n Exp2 = EXP(2)\\n Abs2 = ABS(-2)\\n Floor = INT(1.234)\\n Ceil = FNceil(1.234)\\n Power = 1.23^4\\n END\\n\\n DEF FNceil(n) = INT(n) - (INT(n) <> n)\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"scale = 6\\nsqrt(2)\\t\\t/* 1.414213\\tsquare root */\\n4.3 ^ -2\\t/* .054083\\tpower (integer exponent) */\\n\",\n \"language\": \"Bc\"\n },\n {\n \"code\": \"scale = 6\\nl(2)\\t\\t/* .693147\\tnatural logarithm */\\ne(2)\\t\\t/* 7.389056\\texponential */\\n\\np = 4 * a(1)\\ne = e(1)\\np\\t\\t/* 3.141592\\tpi to 6 fractional digits */\\ne\\t\\t/* 2.178281\\te to 6 fractional digits */\\n\\ne(l(2) * -3.4)\\t/* .094734\\t2 to the power of -3.4 */\\nl(1024) / l(2)\\t/* 10.000001\\tlogarithm base 2 of 1024 */\\n\",\n \"language\": \"Bc\"\n },\n {\n \"code\": \"/* absolute value */\\ndefine v(x) {\\n\\tif (x < 0) return (-x)\\n\\treturn (x)\\n}\\n\\n/* floor */\\ndefine f(x) {\\n\\tauto s, y\\n\\n\\ts = scale\\n\\tscale = 0\\n\\ty = x / 1\\n\\tscale = s\\n\\n\\tif (y > x) return (y - 1)\\n\\treturn (y)\\n}\\n\\n/* ceiling */\\ndefine g(x) {\\n\\tauto s, y\\n\\n\\ts = scale\\n\\tscale = 0\\n\\ty = x / 1\\n\\tscale = s\\n\\n\\tif (y < x) return (y + 1)\\n\\treturn (y)\\n}\\n\\nv(-3.4)\\t\\t/* 3.4\\t\\tabsolute value */\\nf(-3.4)\\t\\t/* -4\\t\\tfloor */\\ng(-3.4)\\t\\t/* -3\\t\\tceiling */\\n\",\n \"language\": \"Bc\"\n },\n {\n \"code\": \"{e}\\n\",\n \"language\": \"Blz\"\n },\n {\n \"code\": \"{pi}\\n\",\n \"language\": \"Blz\"\n },\n {\n \"code\": \"x ** 0.5\\n\",\n \"language\": \"Blz\"\n },\n {\n \"code\": \"x __ n\\n\",\n \"language\": \"Blz\"\n },\n {\n \"code\": \"{e} ** x\\n\",\n \"language\": \"Blz\"\n },\n {\n \"code\": \"abs(x)\\n\",\n \"language\": \"Blz\"\n },\n {\n \"code\": \"floor(x)\\n\",\n \"language\": \"Blz\"\n },\n {\n \"code\": \"ceil(x)\\n\",\n \"language\": \"Blz\"\n },\n {\n \"code\": \"x ** y\\n\",\n \"language\": \"Blz\"\n },\n {\n \"code\": \" ⋆1 # e and e^x\\n2.718281828459045\\n π # pi\\n3.141592653589793\\n √2 # square root\\n1.414213562373095\\n 2⋆⁼10 # logarithm base n (inverse power)\\n3.321928094887363\\n |-1 # absolute value\\n1\\n ⌊3.2 # floor\\n3\\n ⌈3.2 # ceiling\\n4\\n 3⋆4 # power\\n81\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"x \\\\D (10^x) { \\\\D is the differentiation operator }\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"10^x*e\\\\L10 { \\\\L is the logarithm operator }\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <math.h>\\n\\nM_E; /* e - not standard but offered by most implementations */\\nM_PI; /* pi - not standard but offered by most implementations */\\nsqrt(x); /* square root--cube root also available in C99 (cbrt) */\\nlog(x); /* natural logarithm--log base 10 also available (log10) */\\nexp(x); /* exponential */\\nabs(x); /* absolute value (for integers) */\\nfabs(x); /* absolute value (for doubles) */\\nfloor(x); /* floor */\\nceil(x); /* ceiling */\\npow(x,y); /* power */\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <cmath>\\n\\n#ifdef M_E\\nstatic double euler_e = M_E;\\n#else\\nstatic double euler_e = std::exp(1); // standard fallback\\n#endif\\n\\n#ifdef M_PI\\nstatic double pi = M_PI;\\n#else\\nstatic double pi = std::acos(-1);\\n#endif\\n\\nint main()\\n{\\n std::cout << \\\"e = \\\" << euler_e\\n << \\\"\\\\npi = \\\" << pi\\n << \\\"\\\\nsqrt(2) = \\\" << std::sqrt(2.0)\\n << \\\"\\\\nln(e) = \\\" << std::log(euler_e)\\n << \\\"\\\\nlg(100) = \\\" << std::log10(100.0)\\n << \\\"\\\\nexp(3) = \\\" << std::exp(3.0)\\n << \\\"\\\\n|-4.5| = \\\" << std::abs(-4.5) // or std::fabs(-4.5); both work in C++\\n << \\\"\\\\nfloor(4.5) = \\\" << std::floor(4.5)\\n << \\\"\\\\nceiling(4.5) = \\\" << std::ceil(4.5)\\n << \\\"\\\\npi^2 = \\\" << std::pow(pi,2.0) << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <iomanip>\\n#include <cmath>\\n#include <boost/math/constants/constants.hpp>\\n\\nint main()\\n{\\n using namespace boost::math::double_constants;\\n std::cout << \\\"e = \\\" << std::setprecision(18) << e\\n << \\\"\\\\ne³ = \\\" << std::exp(3.0)\\n << \\\"\\\\nπ = \\\" << pi\\n << \\\"\\\\nπ² = \\\" << pi_sqr\\n << \\\"\\\\n√2 = \\\" << root_two\\n << \\\"\\\\nln(e) = \\\" << std::log(e)\\n << \\\"\\\\nlg(100) = \\\" << std::log10(100.0)\\n << \\\"\\\\n|-4.5| = \\\" << std::abs(-4.5)\\n << \\\"\\\\nfloor(4.5) = \\\" << std::floor(4.5)\\n << \\\"\\\\nceiling(4.5) = \\\" << std::ceil(4.5) << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nclass Program {\\n static void Main(string[] args) {\\n Console.WriteLine(Math.E); //E\\n Console.WriteLine(Math.PI); //PI\\n Console.WriteLine(Math.Sqrt(10)); //Square Root\\n Console.WriteLine(Math.Log(10)); // Logarithm\\n Console.WriteLine(Math.Log10(10)); // Base 10 Logarithm\\n Console.WriteLine(Math.Exp(10)); // Exponential\\n Console.WriteLine(Math.Abs(10)); //Absolute value\\n Console.WriteLine(Math.Floor(10.0)); //Floor\\n Console.WriteLine(Math.Ceiling(10.0)); //Ceiling\\n Console.WriteLine(Math.Pow(2, 5)); // Exponentiation\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"100 cls\\n110 print \\\"e = \\\";exp(1)' e not available\\n120 print \\\"PI = \\\";4*arctan(1)' pi not available\\n130 x = 12.345\\n140 y = 1.23\\n150 print \\\"sqrt = \\\";sqr(x)' square root\\n160 print \\\"ln = \\\";log(x)' natural logarithm base e\\n170 print \\\"log10 = \\\";log(x)/log(10)' base 10 logarithm\\n180 print \\\"log = \\\";log(x)/log(y)' arbitrary base logarithm\\n190 print \\\"exp = \\\";exp(x)' exponential\\n200 print \\\"abs = \\\";abs(-x)' absolute value\\n210 print \\\"floor = \\\";floor(x)' floor\\n220 print \\\"ceil = \\\"; : ceil(x)' ceil easily implemented as function\\n230 print \\\"power = \\\";x^y ' power\\n240 end\\n250 sub ceil(x)\\n260 if x < 0 then print int(x) else print int(x)+1\\n270 end sub\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"(Math/E); //e\\n(Math/PI); //pi\\n(Math/sqrt x); //square root--cube root also available (cbrt)\\n(Math/log x); //natural logarithm--log base 10 also available (log10)\\n(Math/exp x); //exponential\\n(Math/abs x); //absolute value\\n(Math/floor x); //floor\\n(Math/ceil x); //ceiling\\n(Math/pow x y); //power\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(ns user (:require [clojure.contrib.math :as math]))\\n(math/sqrt x)\\n(math/abs x)\\n(math/floor x)\\n(math/ceil x)\\n(math/expt x y)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(ns user (:require [clojure.contrib.generic.math-functions :as generic]))\\n(generic/sqrt x)\\n(generic/log x)\\n(generic/exp x)\\n(generic/abs x)\\n(generic/floor x)\\n(generic/ceil x)\\n(generic/pow x y)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"E *> e\\nPI *> Pi\\nSQRT(n) *> Sqaure root\\nLOG(n) *> Natural logarithm\\nLOG10(n) *> Logarithm (base 10)\\nEXP(n) *> e to the nth power\\nABS(n) *> Absolute value\\nINTEGER(n) *> While not a proper floor function, it is implemented in the same way.\\n*> There is no ceiling function. However, it could be implemented like so:\\nADD 1 TO N\\nMOVE INTEGER(N) TO Result\\n*> There is no pow function, although the COMPUTE verb does have an exponention operator.\\nCOMPUTE Result = N ** 2\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"FACTORIAL(n) *> Factorial\\nEXP10(n) *> 10 to the nth power\\n*> Trigonometric functions, including inverse ones, named as would be expected.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"(exp 1) ; e (Euler's number)\\npi ; pi constant\\n(sqrt x) ; square root: works for negative reals and complex\\n(log x) ; natural logarithm: works for negative reals and complex\\n(log x 10) ; logarithm base 10\\n(exp x) ; exponential\\n(abs x) ; absolute value: result exact if input exact: (abs -1/3) -> 1/3.\\n(floor x) ; floor: restricted to real, two valued (second value gives residue)\\n(ceiling x) ; ceiling: restricted to real, two valued (second value gives residue)\\n(expt x y) ; power\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"x = 3.25\\ny = 4\\n\\nputs x.abs # absolute value\\nputs x.floor # floor\\nputs x.ceil # ceiling\\nputs x ** y # power\\nputs\\n\\ninclude Math # without including\\n\\nputs E # puts Math::E -- exponential constant\\nputs PI # puts Math::PI -- Archimedes circle constant\\nputs TAU # puts Math::TAU -- the correct circle constant, >= version 0.36\\nputs sqrt(x) # puts Math.sqrt(x) -- real square root\\nputs log(x) # puts Math.log(x) -- natural logarithm\\nputs log10(x) # puts Math.log10(x) -- base 10 logarithm\\nputs log(x, y) # puts Math.log(x, y) -- logarithm x base y\\nputs exp(x) # puts Math.exp(x) -- exponential\\nputs E**x # puts Math::E**x -- same\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.math ; // need to import this module\\nE // Euler's number\\nPI // pi constant\\nsqrt(x) // square root\\nlog(x) // natural logarithm\\nlog10(x) // logarithm base 10\\nlog2(x) // logarithm base 2\\nexp(x) // exponential\\nabs(x) // absolute value (= magnitude for complex)\\nfloor(x) // floor\\nceil(x) // ceiling\\npow(x,y) // power\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"Pi; // π (Pi)\\nLogN(BASE, x) // log of x for a specified base\\nLog2(x) // log of x for base 2\\nLog10(x) // log of x for base 10\\nFloor(x); // floor\\nCeil(x); // ceiling\\nPower(x, y); // power\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"? 1.0.exp()\\n# value: 2.7182818284590455\\n\\n? 0.0.acos() * 2\\n# value: 3.141592653589793\\n\\n? 2.0.sqrt()\\n# value: 1.4142135623730951\\n\\n? 2.0.log()\\n# value: 0.6931471805599453\\n\\n? 5.0.exp()\\n# value: 148.4131591025766\\n\\n? (-5).abs()\\n# value: 5\\n\\n? 1.2.floor()\\n# value: 1\\n\\n? 1.2.ceil()\\n# value: 2\\n\\n? 10 ** 6\\n# value: 1000000\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"# e is not available\\n# pi\\nprint pi\\n# square root\\nprint sqrt 2\\n# logarithm base 10\\nprint log10 1000\\n# exponential is not available\\n# absolute value\\nprint abs -20\\n# floor\\nprint floor 1.5\\n# ceiling is not available\\n# power\\nprint pow 2 10\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"import system'math;\\nimport extensions;\\n\\npublic program()\\n{\\n console.printLine(E_value); //E\\n console.printLine(Pi_value); //PI\\n console.printLine(10.sqrt()); //Square Root\\n console.printLine(10.ln()); //Logarithm\\n console.printLine(10.log10()); // Base 10 Logarithm\\n console.printLine(10.exp()); //Exponential\\n console.printLine(10.Absolute); //Absolute value\\n console.printLine(10.0r.floor()); //Floor\\n console.printLine(10.0r.ceil()); //Ceiling\\n console.printLine(2.power(5)); //Exponentiation\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"defmodule Real_constants_and_functions do\\n def main do\\n IO.puts :math.exp(1) # e\\n IO.puts :math.pi # pi\\n IO.puts :math.sqrt(16) # square root\\n IO.puts :math.log(10) # natural logarithm\\n IO.puts :math.log10(10) # base 10 logarithm\\n IO.puts :math.exp(2) # e raised to the power of x\\n IO.puts abs(-2.24) # absolute value\\n IO.puts Float.floor(3.1423) # floor\\n IO.puts Float.ceil(20.125) # ceiling\\n IO.puts :math.pow(3,2) # exponentiation\\n end\\nend\\n\\nReal_constants_and_functions.main\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"e -- e\\npi -- pi\\nsqrt x -- square root\\nlogBase 3 9 -- logarithm (any base)\\ne^x -- exponential\\nabs x -- absolute value\\nfloor x -- floor\\nceiling x -- ceiling\\n2 ^ 3 -- power\\n\",\n \"language\": \"Elm\"\n },\n {\n \"code\": \"% Implemented by Arjun Sunel\\n-module(math_constants).\\n-export([main/0]).\\nmain() ->\\n\\tio:format(\\\"~p~n\\\",\\t[math:exp(1)]\\t\\t),\\t\\t% e\\n\\tio:format(\\\"~p~n\\\",\\t[math:pi()]\\t\\t),\\t\\t% pi\\n\\tio:format(\\\"~p~n\\\",\\t[math:sqrt(16)]\\t\\t),\\t\\t% square root\\n\\tio:format(\\\"~p~n\\\",\\t[math:log(10)]\\t\\t),\\t\\t% natural logarithm\\t\\t\\t\\n\\tio:format(\\\"~p~n\\\",\\t[math:log10(10)]\\t),\\t\\t% base 10 logarithm\\n\\tio:format(\\\"~p~n\\\",\\t[math:exp(2)]\\t\\t),\\t\\t% e raised to the power of x\\n\\tio:format(\\\"~p~n\\\",\\t[abs(-2.24)]\\t\\t),\\t\\t% absolute value\\n\\tio:format(\\\"~p~n\\\",\\t[floor(3.1423)]\\t\\t),\\t\\t% floor\\n\\tio:format(\\\"~p~n\\\",\\t[ceil(20.125)]\\t\\t),\\t\\t% ceiling\\n\\tio:format(\\\"~p~n\\\",\\t[math:pow(3,2)]\\t ).\\t\\t% exponentiation\\n\\nfloor(X) when X < 0 ->\\n\\tT = trunc(X),\\n\\tcase X - T == 0 of\\n\\t\\ttrue -> T;\\n \\tfalse -> T - 1\\n\\tend;\\n\\nfloor(X) ->\\n\\ttrunc(X).\\n\\n\\nceil(X) when X < 0 ->\\n\\ttrunc(X);\\n\\nceil(X) ->\\n\\tT = trunc(X),\\n\\tcase X - T == 0 of\\n\\t\\ttrue -> T;\\n\\t\\tfalse -> T + 1\\n\\tend.\\t\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"PROGRAM R_C_F\\n\\nFUNCTION CEILING(X)\\n CEILING=INT(X)-(X-INT(X)>0)\\nEND FUNCTION\\n\\nFUNCTION FLOOR(X)\\n FLOOR=INT(X)\\nEND FUNCTION\\n\\nBEGIN\\n PRINT(EXP(1)) ! e not available\\n PRINT(π) ! pi is available or ....\\n PRINT(4*ATN(1)) ! .... equal to\\n\\n X=12.345\\n Y=1.23\\n\\n PRINT(SQR(X),X^0.5) ! square root\\n PRINT(LOG(X)) ! natural logarithm base e\\n PRINT(LOG(X)/LOG(10)) ! base 10 logarithm\\n PRINT(LOG(X)/LOG(Y)) ! arbitrary base logarithm (y>0)\\n PRINT(EXP(X)) ! exponential\\n PRINT(ABS(X)) ! absolute value\\n PRINT(FLOOR(X)) ! floor\\n PRINT(CEILING(X)) ! ceiling\\n PRINT(X^Y) ! power\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"open System\\n\\nlet main _ =\\n Console.WriteLine(Math.E); // e\\n Console.WriteLine(Math.PI); // Pi\\n Console.WriteLine(Math.Sqrt(10.0)); // Square Root\\n Console.WriteLine(Math.Log(10.0)); // Logarithm\\n Console.WriteLine(Math.Log10(10.0)); // Base 10 Logarithm\\n Console.WriteLine(Math.Exp(10.0)); // Exponential\\n Console.WriteLine(Math.Abs(10)); // Absolute value\\n Console.WriteLine(Math.Floor(10.0)); // Floor\\n Console.WriteLine(Math.Ceiling(10.0)); // Ceiling\\n Console.WriteLine(Math.Pow(2.0, 5.0)); // Exponentiation\\n\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"e ! e\\npi ! π\\nsqrt ! square root\\nlog ! natural logarithm\\nexp ! exponentiation\\nabs ! absolute value\\nfloor ! greatest whole number smaller than or equal\\nceiling ! smallest whole number greater than or equal\\ntruncate ! remove the fractional part (i.e. round towards 0)\\nround ! round to next whole number\\n^ ! power\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Float.e\\nFloat.pi\\n9f.sqrt\\n9f.log // natural logarithm\\n9f.log10 // logarithm to base 10\\n9f.exp // exponentiation\\n(-3f).abs // absolute value, note bracket\\n3.2f.floor // nearest Int smaller than this number\\n3.2f.ceil // nearest Int bigger than this number\\n3.2f.round // nearest Int\\n3f.pow(2f) // power\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \"1e fexp fconstant e\\n0e facos 2e f* fconstant pi \\\\ predefined in gforth\\nfsqrt ( f -- f )\\nfln ( f -- f ) \\\\ flog for base 10\\nfexp ( f -- f )\\nfabs ( f -- f )\\nfloor ( f -- f ) \\\\ round towards -inf\\n: ceil ( f -- f ) fnegate floor fnegate ; \\\\ not standard, though fround is available\\nf** ( f e -- f^e )\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" e ! Not available. Can be calculated EXP(1.0)\\n pi ! Not available. Can be calculated 4.0*ATAN(1.0)\\n SQRT(x) ! square root\\n LOG(x) ! natural logarithm\\n LOG10(x) ! logarithm to base 10\\n EXP(x) ! exponential\\n ABS(x) ! absolute value\\n FLOOR(x) ! floor - Fortran 90 or later only\\n CEILING(x) ! ceiling - Fortran 90 or later only\\n x**y ! x raised to the y power\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\n#Include \\\"crt/math.bi\\\"\\n\\nPrint M_E '' constant \\\"e\\\" from C runtime library\\nPrint M_PI '' constant \\\"pi\\\" from C runtime library\\nPrint Sqr(2) '' square root function built into FB\\nPrint Log(M_E) '' log to base \\\"e\\\" built into FB\\nPrint log10(10) '' log to base 10 from C runtime library\\nPrint Exp(1) '' exponential function built into FB\\nPrint Abs(-1) '' absolute value function (integers or floats) built into FB\\nPrint Int(-2.5) '' floor function built into FB\\nPrint ceil(-2.5) '' ceiling function from C runtime library\\nPrint 2.5 ^ 3.5 '' exponentiation operator built into FB\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"e\\npi, π // Unicode can also be written in ASCII programs as \\\\u03C0\\nsqrt[x]\\nln[x] // Natural log\\nlog[x] // Log to base 10\\nexp[x], e^x\\nabs[x]\\nfloor[x] // Except for complex numbers where there's no good interpretation.\\nceil[x] // Except for complex numbers where there's no good interpretation.\\nx^y\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"window 1\\n\\ntext ,,,,, 60// set tab width\\n\\nprint @\\\"exp:\\\", exp(1)\\nprint @\\\"pi:\\\", pi\\nprint @\\\"sqr:\\\", sqr(2)\\nprint @\\\"log:\\\", log(2)\\nprint @\\\"log2:\\\", log2(2)\\nprint @\\\"log10\\\", log10(2)\\nprint @\\\"abs:\\\", abs(-2)\\nprint @\\\"floor:\\\", int(1.534)\\nprint @\\\"ceil:\\\", val( using\\\"###\\\"; 1.534 )\\nprint @\\\"power:\\\", 1.23 ^ 4\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"Public Sub Main()\\n\\n Dim e As Float = Exp(1)\\n\\n Print \\\"e = \\\"; e ' e not available\\n Print \\\"π = \\\"; Pi ' pi\\n Dim x As Float = 12.345\\n Dim y As Float = 1.23\\n Print \\\"sqrt = \\\"; Sqr(x)' square root\\n Print \\\"ln = \\\"; Log(x)' natural logarithm base e\\n Print \\\"log10 = \\\"; Log(x) / Log(10) ' base 10 logarithm\\n Print \\\"log = \\\"; Log(x) / Log(y)' arbitrary base logarithm\\n Print \\\"exp = \\\"; Exp(x) ' exponential\\n Print \\\"abs = \\\"; Abs(-x)' absolute value\\n Print \\\"floor = \\\"; Floor(x)' floor\\n Print \\\"ceil = \\\"; Ceil(x)' ceil\\n Print \\\"power = \\\"; x ^ y ' power\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n \\\"math/big\\\"\\n)\\n\\nfunc main() {\\n // e and pi defined as constants.\\n // In Go, that means they are not of a specific data type and can be used\\n // as float32 or float64. Println takes the float64 values.\\n fmt.Println(\\\"float64 values:\\\")\\n fmt.Println(\\\"e:\\\", math.E)\\n fmt.Println(\\\"π:\\\", math.Pi)\\n\\n // The following functions all take and return the float64 data type.\\n\\n // square root. cube root also available (math.Cbrt)\\n fmt.Println(\\\"square root(1.44):\\\", math.Sqrt(1.44))\\n // natural logarithm--log base 10, 2 also available (math.Log10, math.Log2)\\n // also available is log1p, the log of 1+x. (using log1p can be more\\n // accurate when x is near zero.)\\n fmt.Println(\\\"ln(e):\\\", math.Log(math.E))\\n // exponential. also available are exp base 10, 2 (math.Pow10, math.Exp2)\\n fmt.Println(\\\"exponential(1):\\\", math.Exp(1))\\n fmt.Println(\\\"absolute value(-1.2):\\\", math.Abs(-1.2))\\n fmt.Println(\\\"floor(-1.2):\\\", math.Floor(-1.2))\\n fmt.Println(\\\"ceiling(-1.2):\\\", math.Ceil(-1.2))\\n fmt.Println(\\\"power(1.44, .5):\\\", math.Pow(1.44, .5))\\n\\n // Equivalent functions for the float32 type are not in the standard\\n // library. Here are the constants e and π as float32s however.\\n fmt.Println(\\\"\\\\nfloat32 values:\\\")\\n fmt.Println(\\\"e:\\\", float32(math.E))\\n fmt.Println(\\\"π:\\\", float32(math.Pi))\\n\\n // The standard library has an arbitrary precision floating point type but\\n // provides only the most basic methods. Also while the constants math.E\\n // and math.Pi are provided to over 80 decimal places, there is no\\n // convenient way of loading these numbers (with their full precision)\\n // into a big.Float. A hack is cutting and pasting into a string, but\\n // of course if you're going to do that you are free to cut and paste from\\n // any other source. (The documentation cites OEIS as its source.)\\n pi := \\\"3.141592653589793238462643383279502884197169399375105820974944\\\"\\n π, _, _ := big.ParseFloat(pi, 10, 200, 0)\\n fmt.Println(\\\"\\\\nbig.Float values:\\\")\\n fmt.Println(\\\"π:\\\", π)\\n // Of functions requested by the task, only absolute value is provided.\\n x := new(big.Float).Neg(π)\\n y := new(big.Float)\\n fmt.Println(\\\"x:\\\", x)\\n fmt.Println(\\\"abs(x):\\\", y.Abs(x))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"println ((-22).abs())\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"println 22**3.5\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"println ((-22)**3.5)\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"100 CLS\\n110 PRINT \\\"e = \\\"; EXP(1) ' e not available\\n120 PRINT \\\"PI = \\\"; 4 * ATN(1) ' pi not available\\n130 X = 12.345\\n140 Y = 1.23\\n150 PRINT \\\"sqrt = \\\"; SQR(X) ' square root\\n160 PRINT \\\"ln = \\\"; LOG(X) ' natural logarithm base e\\n170 PRINT \\\"log10 = \\\"; LOG(X)/LOG(10) ' base 10 logarithm\\n180 PRINT \\\"log = \\\"; LOG(X)/LOG(Y) ' arbitrary base logarithm\\n190 PRINT \\\"exp = \\\"; EXP(X) ' exponential\\n200 PRINT \\\"abs = \\\"; ABS(-X) ' absolute value\\n210 PRINT \\\"floor = \\\"; floor(X) ' floor\\n220 PRINT \\\"ceil = \\\"; : ' ceil not available\\n230 IF X < 0 THEN PRINT INT(X) ELSE PRINT INT(X)+1\\n240 PRINT \\\"power = \\\"; X ^Y ' power\\n250 END\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \"exp 1 -- Euler number\\npi -- pi\\nsqrt x -- square root\\nlog x -- natural logarithm\\nexp x -- exponential\\nabs x -- absolute value\\nfloor x -- floor\\nceiling x -- ceiling\\nx ** y -- power (e.g. floating-point exponentiation)\\nx ^ y -- power (e.g. integer exponentiation, nonnegative y only)\\nx ^^ y -- power (e.g. integer exponentiation of rationals, also negative y)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"e ! Not available. Can be calculated EXP(1)\\npi ! Not available. Can be calculated 4.0*ATAN(1.0)\\nx^0.5 ! square root\\nLOG(x) ! natural logarithm\\nLOG(x, 10) ! logarithm to base 10\\nEXP(x) ! exponential\\nABS(x) ! absolute value\\nFLOOR(x) ! floor\\nCEILING(x) ! ceiling\\nx**y ! x raised to the y power\\nx^y ! same as x**y\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"link numbers # for floor and ceil\\n\\nprocedure main()\\nwrite(\\\"e=\\\",&e)\\nwrite(\\\"pi=\\\",&pi)\\nwrite(\\\"phi=\\\",&phi)\\nwrite(\\\"sqrt(2)=\\\",sqrt(2.0))\\nwrite(\\\"log(e)=\\\",log(&e))\\nwrite(\\\"log(100.,10)=\\\",log(100,10))\\nwrite(\\\"exp(1)=\\\",exp(1.0))\\nwrite(\\\"abs(-2)=\\\",abs(-2))\\nwrite(\\\"floor(-2.2)=\\\",floor(-2.2))\\nwrite(\\\"ceil(-2.2)=\\\",ceil(-2.2))\\nwrite(\\\"power: 3^3=\\\",3^3)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"100 LET X=2:LET Y=5\\n110 PRINT EXP(1) ! value of e\\n120 PRINT PI ! value of Pi\\n130 PRINT ROUND(PI,3) ! rounds Pi to 3 decimal places\\n140 PRINT TRUNCATE(PI,3) ! cuts 3 decimal places from Pi\\n150 PRINT SQR(X) ! square root of x\\n160 PRINT LOG(X) ! the natural logarithm of number x\\n170 PRINT LOG2(X) ! logarithm of x to base 2\\n180 PRINT LOG10(X) ! logarithm of x to base 10\\n190 PRINT EXP(X) ! exponential\\n200 PRINT ABS(X) ! the absolute value of a number\\n210 PRINT INT(X) ! the largest whole number not bigger than x\\n220 PRINT IP(X) ! the integer part of x\\n230 PRINT FP(X) ! stands for fractorial part\\n240 PRINT CEIL(X) ! ceiling: gives the smallest whole number not less than x\\n250 PRINT X^Y ! power\\n260 PRINT MIN(X,Y) ! the smaller number of x and y\\n270 PRINT MAX(X,Y) ! the bigger number of x and y\\n280 PRINT EPS(X) ! the smallest quantity that can be added to or subtracted from x to make the interpreter register a change in the value of x\\n290 PRINT INF ! The largest positive number the tinterpreter can handle. This number is 9.999999999*10^62\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \"e =. 1x1 NB. Euler's number, specified as a numeric literal.\\ne =. ^ 1 NB. Euler's number, computed by exponentiation.\\npi=. 1p1 NB. pi, specified as a numeric literal.\\npi=. o.1 NB. pi, computed trigonometrically.\\nmagnitude_of_x =. |x\\nfloor_of_x =. <.x\\nceiling_of_x =. >.x\\nnatural_log_of_x =. ^.x\\nbase_x_log_of_y =. x^.y\\nx_squared =. *:x NB. special form\\nx_squared =. x^2 NB. exponential form\\nsquare_root_of_x =. %:x NB. special form\\nsquare_root_of_x =. x^0.5 NB. exponential form\\nx_to_the_y_power =. x^y\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"Math.E; //e\\nMath.PI; //pi\\nMath.sqrt(x); //square root--cube root also available (cbrt)\\nMath.log(x); //natural logarithm--log base 10 also available (log10)\\nMath.exp(x); //exponential\\nMath.abs(x); //absolute value\\nMath.floor(x); //floor\\nMath.ceil(x); //ceiling\\nMath.pow(x,y); //power\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"Math.E\\nMath.PI\\nMath.sqrt(x)\\nMath.log(x)\\nMath.exp(x)\\nMath.abs(x)\\nMath.floor(x)\\nMath.ceil(x)\\nMath.pow(x,y)\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"1 | exp # i.e. e\\n1 | atan * 4 # i.e. π\\nsqrt\\nlog # Naperian log\\nexp\\nlength # absolute value if the argument is numeric\\nfloor\\nceil # requires jq >= 1.5\\npow(x; y) # requires jq >= 1.5\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"/* real constants and functions, in JSI */\\nvar x, y;\\n\\n;Math.E;\\n;Math.PI;\\n\\n;x = 100.0;\\n;Math.sqrt(x);\\n;Math.log(x);\\n\\n;x = 2.0;\\n;Math.exp(x);\\n\\n;x = -x;\\n;Math.abs(x);\\n\\n;x = 42.42;\\n;Math.floor(x);\\n;Math.ceil(x);\\n\\n;x = 10.0;\\n;y = 5;\\n;Math.pow(x,y);\\n\\n/*\\n=!EXPECTSTART!=\\nMath.E ==> 2.718281828459045\\nMath.PI ==> 3.141592653589793\\nx = 100.0 ==> 100\\nMath.sqrt(x) ==> 10\\nMath.log(x) ==> 4.605170185988092\\nx = 2.0 ==> 2\\nMath.exp(x) ==> 7.38905609893065\\nx = -x ==> -2\\nMath.abs(x) ==> 2\\nx = 42.42 ==> 42.42\\nMath.floor(x) ==> 42\\nMath.ceil(x) ==> 43\\nx = 10.0 ==> 10\\ny = 5 ==> 5\\nMath.pow(x,y) ==> 100000\\n=!EXPECTEND!=\\n*/\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"e\\nπ, pi\\nsqrt(x)\\nlog(x)\\nexp(x)\\nabs(x)\\nfloor(x)\\nceil(x)\\nx^y\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import kotlin.math.*\\n\\nfun main() {\\n println(E)\\n println(PI)\\n println(sqrt(2.0))\\n println(ln(E))\\n println(log10(10.0))\\n println(log(4.0, 2.0)) // log base 2 of 4\\n println(exp(1.0))\\n println(abs(-1))\\n println(floor(-2.5))\\n println(ceil(-2.5))\\n println(2.5.pow(3.5)) // 2.5^3.5\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"{E} -> 2.718281828459045\\n{PI} -> 3.141592653589793\\n{sqrt 2} -> 1.4142135623730951\\n{log {E}} -> 1\\n{exp 1} -> 2.718281828459045\\n{abs -1} -> 1\\n{floor -2.5} -> -3\\n{ceil -2.5} -> -2\\n{pow 2.5 3.5} -> 24.705294220065465\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"//e\\ndefine e => 2.7182818284590452\\n\\n//π\\ndefine pi => 3.141592653589793\\n\\ne\\npi\\n9.0->sqrt\\n1.64->log\\n1.64->log10\\n1.64->exp\\n1.64->abs\\n1.64->floor\\n1.64->ceil\\n1.64->pow(10.0)\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"print exp( 1) ' e not available\\nprint 4 *atn( 1) ' pi not available\\n\\nx =12.345: y =1.23\\n\\nprint sqr( x), x^0.5 ' square root- NB the unusual name\\nprint log( x) ' natural logarithm base e\\nprint log( x) /2.303 ' base 10 logarithm\\nprint log( x) /log( y) ' arbitrary base logarithm\\nprint exp( x) ' exponential\\nprint abs( x) ' absolute value\\nprint floor( x) ' floor\\nprint ceiling( x) ' ceiling\\nprint x^y ' power\\n\\nend\\n\\nfunction floor( x)\\n if x >0 then\\n floor =int( x)\\n else\\n if x <>int( x) then floor =int( x) -1 else floor =int( x)\\n end if\\nend function\\n\\nfunction ceiling( x)\\n if x <0 then\\n ceiling =int( x)\\n else\\n ceiling =int( x) +1\\n end if\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"the floatPrecision = 8\\n\\n-- e (base of the natural logarithm)\\nput exp(1)\\n-- 2.71828183\\n\\n-- pi\\nput PI\\n-- 3.14159265\\n\\n-- square root\\nput sqrt(2.0)\\n-- 1.41421356\\n\\n-- logarithm (any base allowed)\\nx = 100\\n\\nput log(x) -- calculate log for base e\\n-- 4.60517019\\n\\nput log(x)/log(10) -- calculate log for base 10\\n-- 2.00000000\\n\\n-- exponential (ex)\\nput exp(3)\\n-- 20.08553692\\n\\n-- absolute value (a.k.a. \\\"magnitude\\\")\\nput abs(-1)\\n-- 1\\n\\n-- floor (largest integer less than or equal to this number--not the same as truncate or int)\\nn = 23.536\\nput bitOr(n, 0) -- calculates floor\\n-- 23\\n\\n-- ceiling (smallest integer not less than this number--not the same as round up)\\nn = 23.536\\n-- calculates ceil\\nfloor = bitOr(n, 0)\\nif (floor >= n) then put floor\\nelse put floor+1\\n-- 24\\n\\n-- power\\nput power(2, 8)\\n-- 256.00000000\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"e: exp(1)\\npi: pi\\nsquare root: sqrt(x)\\nlogarithm: log(x)\\nexponential (ex): exp(x)\\nabsolute value: abs(x)\\nfloor: floor(x)\\nceiling: ceil(x)\\npower: x^y\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"make \\\"e exp 1\\nmake \\\"pi 2*(RADARCTAN 0 1)\\nsqrt :x\\nln :x\\nexp :x\\n; there is no standard abs, floor, or ceiling; only INT and ROUND.\\npower :x :y\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \":- object(constants_and_functions).\\n\\n :- public(show/0).\\n show :-\\n write('e = '), E is e, write(E), nl,\\n write('pi = '), PI is pi, write(PI), nl,\\n write('sqrt(2) = '), SQRT is sqrt(2), write(SQRT), nl,\\n % only base e logorithm is avaialable as a standard built-in function\\n write('log(2) = '), LOG is log(2), write(LOG), nl,\\n write('exp(2) = '), EXP is exp(2), write(EXP), nl,\\n write('abs(-1) = '), ABS is abs(-1), write(ABS), nl,\\n write('floor(-3.4) = '), FLOOR is floor(-3.4), write(FLOOR), nl,\\n write('ceiling(-3.4) = '), CEILING is ceiling(-3.4), write(CEILING), nl,\\n write('2 ** -3.4 = '), POWER is 2 ** -3.4, write(POWER), nl.\\n\\n:- end_object.\\n\",\n \"language\": \"Logtalk\"\n },\n {\n \"code\": \"math.exp(1)\\nmath.pi\\nmath.sqrt(x)\\nmath.log(x)\\nmath.log10(x)\\nmath.exp(x)\\nmath.abs(x)\\nmath.floor(x)\\nmath.ceil(x)\\nx^y\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Checkit {\\n Def exp(x)= 2.71828182845905^x\\n Print Ln(exp(1))==1\\n Print Log(10^5)==5\\n Print Sgn(-5)=-1\\n Print Abs(-2.10#)=2.1#\\n Def exptype$(x)=type$(x)\\n Print exptype$(Abs(-2.1#))=\\\"Currency\\\"\\n Print exptype$(Abs(-2.1~))=\\\"Single\\\"\\n Print exptype$(Abs(-2.1@))=\\\"Decimal\\\"\\n Print exptype$(Abs(-2&))=\\\"Long\\\"\\n Print exptype$(Abs(-2%))=\\\"Integer\\\"\\n Print exptype$(Abs(-2.212e34))=\\\"Double\\\"\\n\\n Print exptype$(Sgn(-2.1#))=\\\"Integer\\\"\\n \\\\\\\\ Sgn return integer type\\n Print exptype$(Sgn(-2.212e34))=\\\"Integer\\\"\\n \\\\\\\\ Log, Len return double\\n Print exptype$(Log(1000))=\\\"Double\\\"\\n Print exptype$(exp(1%))=\\\"Double\\\"\\n Print exptype$(Ln(1212%))=\\\"Double\\\"\\n \\\\\\\\ power return type Double ^ and ** (are the same)\\n Print exptype$(2&^2&)=\\\"Long\\\" ' for Version <=11 is \\\"Double\\\"\\n Print exptype$(2&**2&)=\\\"Long\\\" ' for Version <=11 is \\\"Double\\\"\\n Print exptype$(2&*2&)=\\\"Long\\\"\\n \\\\\\\\ 64bit Long Long (from Version 12)\\n Print exptype$(2&&^2&&)=\\\"Long Long\\\"\\n Print exptype$(2&&**2&&)=\\\"Long Long\\\"\\n Print exptype$(2&&*2&)=\\\"Long Long\\\"\\n Print 2**2=4, 2^2=4, 2^2^2=16, 2**2**2=16\\n \\\\\\\\ floor() and Int() is the same\\n Print Int(-2.7)=-3, Int(2.7)=2\\n Print Floor(-2.7)=-3, Floor(2.7)=2\\n Print Ceil(-2.7)=-2, Ceil(2.7)=3\\n\\n Print round(-2.7, 0)=-3, round(2.7, 0)=3\\n Print round(-2.2, 0)=-2, round(2.2, 0)=2\\n\\n\\n Print Sqrt(4)=2\\n}\\nCheckit\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"> abs(ceil(floor(ln(exp(1)^sqrt(exp(Pi*I)+1)))));\\n 0\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"E\\nPi\\nSqrt[x]\\nLog[x]\\nLog[b,x]\\nExp[x]\\nAbs[x]\\nFloor[x]\\nCeiling[x]\\nPower[x, y]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"Log[1.23] => 0.207014\\nLog[10] => Log[10]\\nLog[10,100] => 2\\nLog[E^4] => 4\\nLog[1 + I] => Log[1+I]\\nLog[1. + I] => 0.346574 + 0.785398 I\\nCeiling[Pi] => 4\\nFloor[Pi] => 3\\nSqrt[2] => Sqrt[2]\\nSqrt[4] => 2\\nSqrt[9/2] => 3/Sqrt[2]\\nSqrt[3.5] => 1.87083\\nSqrt[-5 + 12 I] => 2 + 3 I\\nSqrt[-4] => 2I\\nExp[2] => E^2\\nExp[Log[4]] => 4\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"exp(1) % e\\npi % pi\\nsqrt(x) % square root\\nlog(x) % natural logarithm\\nlog2(x) % logarithm base 2\\nlog10(x) % logarithm base 10\\nexp(x) % exponential\\nabs(-x) % absolute value\\nfloor(x) % floor\\nceil(x) % ceiling\\nx^y % power\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"e -- Euler's number\\npi -- pi\\nlog x -- natural logarithm\\nlog10 x -- log base 10\\nexp x -- exponantial\\nabs x -- absolute value\\nfloor x -- floor\\nceil x -- ceiling\\npow x y -- power\\n\",\n \"language\": \"MAXScript\"\n },\n {\n \"code\": \"math.pi % Pi.\\nmath.e % Euler's number.\\nmath.sqrt(X) % Square root of X.\\nmath.ln(X) % Natural logarithm of X.\\nmath.log10(X) % Logarithm to the base 10 of X.\\nmath.log2(X) % Logarithm to the base 2 of X.\\nmath.log(B, X) % Logarithm to the base B of X.\\nmath.exp(X) % e raised to the power of X.\\nfloat.abs(X) % Absolute value of X.\\nmath.floor(X) % Floor of X.\\nmath.ceiling(X) % Ceiling of X.\\nmath.pow(X, Y) % X raised to the power of Y.\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"show mexp(256); % outputs e; since MF uses mexp(x) = exp(x/256)\\nshow 3.14159; % no pi constant built in; of course we can define it\\n % in several ways... even computing\\n % C/2r (which would be funny since MF handles paths,\\n % and a circle is a path...)\\nshow sqrt2; % 1.41422, or in general sqrt(a)\\nshow mexp(256*x); % see e.\\nshow abs(x); % returns |x| (the absolute value of the number x, or\\n % the length of the vector x); it is the same as\\n % length(x); plain Metafont in fact says:\\n % let abs = length;\\nshow floor(x); % floor\\nshow ceiling(x); % ceiling\\nshow x**y; % ** is not a built in: it is defined in the basic macros\\n % set for Metafont (plain Metafont) as a primarydef\\n\",\n \"language\": \"Metafont\"\n },\n {\n \"code\": \"e ; e\\npi ; π\\nsqrt ; square root\\nlog10 ; common logarithm\\nlog2 ; binary logarithm\\n ; no exponential\\n ; no absolute value\\nfloor ; greatest whole number smaller than or equal\\nceil ; smallest whole number greater than or equal\\ntrunc ; remove the fractional part (i.e. round towards 0)\\nround ; round number to nth decimal place\\npow ; power\\n\",\n \"language\": \"Min\"\n },\n {\n \"code\": \"Math.E;\\nMath.Pi;\\nMath.sqrt(x);\\nMath.log(x);\\nMath.exp(x);\\nABS(x); (* Built in function. *)\\nFLOOR(x); (* Built in function. *)\\nCEILING(x); (* Built in function. *)\\nMath.pow(x, y);\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"100 CLS\\n110 E = EXP(1)\\n120 PRINT \\\"e = \\\"; E ' e not available\\n130 PI = 4 * ATN(1)\\n140 PRINT \\\"PI = \\\"; PI ' pi not available\\n150 X = 12.345\\n160 Y = 1.23\\n170 PRINT \\\"sqrt = \\\"; SQR(X) ' square root\\n180 PRINT \\\"ln = \\\"; LOG(X) ' natural logarithm base e\\n190 PRINT \\\"log10 = \\\"; LOG(X)/LOG(10) ' base 10 logarithm\\n200 PRINT \\\"log = \\\"; LOG(X)/LOG(Y) ' arbitrary base logarithm\\n210 PRINT \\\"exp = \\\"; EXP(X) ' exponential\\n220 PRINT \\\"abs = \\\"; ABS(-X) ' absolute value\\n230 PRINT \\\"floor = \\\"; floor(X) ' floor\\n240 PRINT \\\"ceil = \\\"; : ' ceil not available\\n250 IF X < 0 THEN PRINT INT(X) ELSE PRINT INT(X)+1\\n260 PRINT \\\"power = \\\"; X ^Y ' power\\n270 END\\n\",\n \"language\": \"MSX-Basic\"\n },\n {\n \"code\": \"/**\\n Real constants and functions, in Neko\\n Tectonics:\\n nekoc real-constants.neko\\n neko real-constants\\n*/\\n\\nvar euler = $loader.loadprim(\\\"std@math_exp\\\", 1)(1)\\nvar pi = $loader.loadprim(\\\"std@math_pi\\\", 0)()\\n\\nvar math_sqrt = $loader.loadprim(\\\"std@math_sqrt\\\", 1)\\nvar math_log = $loader.loadprim(\\\"std@math_log\\\", 1)\\nvar math_exp = $loader.loadprim(\\\"std@math_exp\\\", 1)\\nvar math_abs = $loader.loadprim(\\\"std@math_abs\\\", 1)\\nvar math_floor = $loader.loadprim(\\\"std@math_floor\\\", 1)\\nvar math_ceil = $loader.loadprim(\\\"std@math_ceil\\\", 1)\\nvar math_pow = $loader.loadprim(\\\"std@math_pow\\\", 2)\\n\\n$print(\\\"Euler : \\\", euler, \\\"\\\\n\\\")\\n$print(\\\"Pi : \\\", pi, \\\"\\\\n\\\")\\n\\n$print(\\\"Sqrt(2) : \\\", math_sqrt(2), \\\"\\\\n\\\")\\n$print(\\\"Log(10) : \\\", math_log(10), \\\"\\\\n\\\")\\n$print(\\\"Exp(1) : \\\", math_pow(euler, 1), \\\"\\\\n\\\")\\n$print(\\\"Abs(-2.2) : \\\", math_abs(-2.2), \\\"\\\\n\\\")\\n$print(\\\"Floor(-2.2): \\\", math_floor(-2.2), \\\"\\\\n\\\")\\n$print(\\\"Ceil(-2.2) : \\\", math_ceil(-2.2), \\\"\\\\n\\\")\\n$print(\\\"Pow(2, 8) : \\\", math_pow(2, 8), \\\"\\\\n\\\")\\n\",\n \"language\": \"Neko\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary utf8\\n\\nnumeric digits 30\\n\\nx = 2.5\\ny = 3\\npad = 40\\nsay\\nsay 'Java Math constants & functions:'\\nsay Rexx(' Euler''s number (e):').left(pad) Math.E\\nsay Rexx(' Pi:').left(pad) Math.PI\\nsay Rexx(' Square root of' x':').left(pad) Math.sqrt(x)\\nsay Rexx(' Log(e) of' x':').left(pad) Math.log(x)\\nsay Rexx(' Log(e) of e:').left(pad) Math.log(Math.E)\\nsay Rexx(' Log(10) of' x':').left(pad) Math.log10(x)\\nsay Rexx(' Log(10) of 10:').left(pad) Math.log10(10)\\nsay Rexx(' Exponential (e**x) of' x':').left(pad) Math.exp(x)\\nsay Rexx(' Exponential (e**x) of log(e)' x':').left(pad) Math.exp(Math.log(x))\\nsay Rexx(' Abs of' x':').left(pad) Math.abs(x.todouble)\\nsay Rexx(' Abs of' (-x)':').left(pad) Math.abs((-x).todouble)\\nsay Rexx(' Floor of' x':').left(pad) Math.floor(x)\\nsay Rexx(' Floor of' (-x)':').left(pad) Math.floor((-x))\\nsay Rexx(' Ceiling of' x':').left(pad) Math.ceil(x)\\nsay Rexx(' Ceiling of' (-x)':').left(pad) Math.ceil((-x))\\nsay Rexx(' ' x 'to the power of' y':').left(pad) Math.pow(x, y)\\nsay Rexx(' ' x 'to the power of' 1 / y':').left(pad) Math.pow(x, 1 / y)\\nsay Rexx(' 10 to the power of log10' x':').left(pad) Math.pow(10, Math.log10(x))\\n\\n-- Extras\\nsay Rexx(' Cube root of' x':').left(pad) Math.cbrt(x)\\nsay Rexx(' Hypotenuse of' 3 'x' 4 'right triangle:').left(pad) Math.hypot(3, 4)\\nsay Rexx(' Max of' (-x) '&' x':').left(pad) Math.max((-x).todouble, x)\\nsay Rexx(' Min of' (-x) '&' x':').left(pad) Math.min((-x).todouble, x)\\nsay Rexx(' Signum of' x':').left(pad) Math.signum((x).todouble)\\nsay Rexx(' Signum of' x '-' x':').left(pad) Math.signum((x - x).todouble)\\nsay Rexx(' Signum of' (-x)':').left(pad) Math.signum((-x).todouble)\\n\\nsay\\nsay 'NetRexx built-in support for numeric data:'\\nsay Rexx(' Abs of' x':').left(pad) x.abs()\\nsay Rexx(' Abs of' (-x)':').left(pad) (-x).abs()\\nsay Rexx(' Sign of' x':').left(pad) x.sign()\\nsay Rexx(' Sign of' x '-' x':').left(pad) (x - x).sign()\\nsay Rexx(' Sign of' (-x)':').left(pad) (-x).sign()\\nsay Rexx(' Max of' (-x) '&' x':').left(pad) (-x).max(x)\\nsay Rexx(' Min of' (-x) '&' x':').left(pad) (-x).min(x)\\nsay Rexx(' Truncate' x 'by' y':').left(pad) x.trunc(y)\\nsay Rexx(' Format (with rounding)' x 'by' y':').left(pad) x.format(y, 0)\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"import math\\n\\nvar x, y = 12.5\\n\\necho E\\necho PI\\necho sqrt(x)\\necho ln(x)\\necho log10(x)\\necho exp(x)\\necho abs(x)\\necho floor(x)\\necho ceil(x)\\necho pow(x, y)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"Float->Pi();\\nFloat->E();\\n4.0->SquareRoot();\\n1.5->Log();\\n# exponential is not supported\\n3.99->Abs();\\n3.99->Floor();\\n3.99->Ceiling();\\n4.5->Ceiling(2.0);\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"Float.pi (* pi *)\\nsqrt x (* square root *)\\nlog x (* natural logarithm--log base 10 also available (log10) *)\\nexp x (* exponential *)\\nabs_float x (* absolute value *)\\nabs x (* absolute value (for integers) *)\\nfloor x (* floor *)\\nceil x (* ceiling *)\\nx ** y (* power *)\\n-. x (* negation for floats *)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"e % e\\npi % pi\\nsqrt(pi) % square root\\nlog(e) % natural logarithm\\nexp(pi) % exponential\\nabs(-e) % absolute value\\nfloor(pi) % floor\\nceil(pi) % ceiling\\ne**pi % power\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"import: math\\n\\n: testReal\\n E println\\n Pi println\\n 9 sqrt println\\n 2 ln println\\n 2 exp println\\n -3.4 abs println\\n 3.4 exp println\\n\\n 2.4 floor println\\n 3.9 floor println\\n 5.5 floor println\\n -2.4 floor println\\n -3.9 floor println\\n -5.5 floor println\\n\\n 2.4 ceil println\\n 3.9 ceil println\\n 5.5 ceil println\\n -2.4 ceil println\\n -3.9 ceil println\\n -5.5 ceil println ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"/* Rexx */\\n\\n-- MathLoadFuncs & MathDropFuncs are no longer needed and are effectively NOPs\\n-- but MathLoadFuncs does return its copyright statement when given a string argument\\nRxMathCopyright = MathLoadFuncs('')\\nsay RxMathCopyright\\n\\nnumeric digits 16\\n\\nx = 2.5\\ny = 3\\npad = 40\\ndigs = digits()\\nsay\\nsay 'Working with precision' digs\\nsay 'Math constants & functions:'\\nsay (' Euler''s number (e):')~left(pad) RxCalcExp(1, digs)\\nsay (' Pi:')~left(pad) RxCalcPi(digs)\\nsay (' Square root of' x':')~left(pad) RxCalcSqrt(x, digs)\\nsay (' Log(e) of' x':')~left(pad) RxCalcLog(x, digs)\\nsay (' Log(e) of e:')~left(pad) RxCalcLog(RxCalcExp(1, digs), digs)\\nsay (' Log(10) of' x':')~left(pad) RxCalcLog10(x, digs)\\nsay (' Log(10) of 10:')~left(pad) RxCalcLog10(10, digs)\\nsay (' Exponential (e**x) of' x':')~left(pad) RxCalcExp(x, digs)\\nsay (' Exponential (e**x) of log(e)' x':')~left(pad) RxCalcExp(RxCalcLog(x, digs), digs)\\nsay (' ' x 'to the power of' y':')~left(pad) RxCalcPower(x, y, digs)\\nsay (' ' x 'to the power of 1/'y':')~left(pad) RxCalcPower(x, 1 / y, digs)\\nsay (' 10 to the power of log10' x':')~left(pad) RxCalcPower(10, RxCalcLog10(x), digs)\\n\\nsay\\nsay 'Rexx built-in support for numeric data:'\\nsay (' Abs of' x':')~left(pad) x~abs()\\nsay (' Abs of' (-x)':')~left(pad) (-x)~abs()\\nsay (' Sign of' x':')~left(pad) x~sign()\\nsay (' Sign of' x '-' x':')~left(pad) (x - x)~sign()\\nsay (' Sign of' (-x)':')~left(pad) (-x)~sign()\\nsay (' Max of' (-x) '&' x':')~left(pad) (-x)~max(x)\\nsay (' Min of' (-x) '&' x':')~left(pad) (-x)~min(x)\\nsay (' Truncate' x 'by' y':')~left(pad) x~trunc(y)\\nsay (' Format (with rounding)' x 'by' y':')~left(pad) x~format(y, 0)\\n\\nsay\\nsay 'Use RYO functions for floor & ceiling:'\\nsay (' Floor of' x':')~left(pad) floor(x)\\nsay (' Floor of' (-x)':')~left(pad) floor((-x))\\nsay (' Ceiling of' x':')~left(pad) ceiling(x)\\nsay (' Ceiling of' (-x)':')~left(pad) ceiling((-x))\\n\\nreturn\\n\\n-- floor and ceiling functions are not part of ooRexx\\nfloor: procedure\\n return arg(1)~trunc() - (arg(1) < 0) * (arg(1) \\\\= arg(1)~trunc())\\n\\nceiling: procedure\\n return arg(1)~trunc() + (arg(1) > 0) * (arg(1) \\\\= arg(1)~trunc())\\n\\n::requires 'RxMath' library\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"{ForAll\\n [\\n {Exp 1.} %% 2.7183 Euler's number: not predefined\\n 4. * {Atan2 1. 1.} %% 3.1416 pi: not predefined\\n {Sqrt 81.} %% 9.0 square root; expects a float\\n {Log 2.7183} %% 1.0 natural logarithm\\n {Abs ~1} %% 1 absolute value; expects a float or an integer\\n {Floor 1.999} %% 1.0 floor; expects and returns a float\\n {Ceil 1.999} %% 2.0 ceiling; expects and returns a float\\n {Pow 2 3} %% 8 power; both arguments must be of the same type\\n ]\\n Show}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"[exp(1), Pi, sqrt(2), log(2), abs(2), floor(2), ceil(2), 2^3]\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"\\t{ Euler’s constant }\\n\\texp(1)\\n\\t{ principal square root of `x` }\\n\\tsqrt(x)\\n\\t{ natural logarithm }\\n\\tln(x)\\n\\t{ exponential }\\n\\texp(x)\\n\\t{ absolute value }\\n\\tabs(x)\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"\\t{ Pi }\\n\\t2 * arg(cmplx(0.0, maxReal))\\n\\t{ power, yields same data type as `base`, `exponent` has to be an `integer` }\\n\\tbase pow exponent\\n\\t{ `real` power, `exponent` may be an `integer` or `real` value, yet `base` and }\\n\\t{ `exponent` are automatically promoted to an approximate `real` value, result }\\n\\t{ is `complex` if `base` is `complex`, otherwise a `real` value }\\n\\tbase ** exponent\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use POSIX; # for floor() and ceil()\\n\\nexp(1); # e\\n4 * atan2(1, 1); # pi\\nsqrt($x); # square root\\nlog($x); # natural logarithm; log10() available in POSIX module\\nexp($x); # exponential\\nabs($x); # absolute value\\nfloor($x); # floor\\nceil($x); # ceiling\\n$x ** $y; # power\\n\\nuse Math::Trig;\\npi; # alternate way to get pi\\n\\nuse Math::Complex;\\npi; # alternate way to get pi\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #004600;\\\">E</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- Euler number</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #004600;\\\">PI</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- pi</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">log</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">E</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- natural logarithm</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">log10</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- base 10 logarithm</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">exp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">log</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">))</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- exponential</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">sqrt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- square root</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">abs</span><span style=\\\"color: #0000FF;\\\">(-</span><span style=\\\"color: #000000;\\\">1.2</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- absolute value</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(-</span><span style=\\\"color: #000000;\\\">1.2</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- floor, -2</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">ceil</span><span style=\\\"color: #0000FF;\\\">(-</span><span style=\\\"color: #000000;\\\">1.2</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- ceiling, -1</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">round</span><span style=\\\"color: #0000FF;\\\">(-</span><span style=\\\"color: #000000;\\\">1.8</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- rounded, -2</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">trunc</span><span style=\\\"color: #0000FF;\\\">(-</span><span style=\\\"color: #000000;\\\">1.8</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- truncate, -1</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">E</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">log</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">))</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- displays 5.0</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">log10</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">))</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- displays 5.0</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #004600;\\\">INVLN10</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- displays 0.434..</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">exp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #004600;\\\">INVLN10</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- displays 10.0</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"M_E; //e\\nM_PI; //pi\\nsqrt(x); //square root\\nlog(x); //natural logarithm--log base 10 also available (log10)\\nexp(x); //exponential\\nabs(x); //absolute value\\nfloor(x); //floor\\nceil(x); //ceiling\\npow(x,y); //power\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"main =>\\n println(math.e),\\n println(math.pi),\\n nl,\\n\\n println(sqrt(2)),\\n nl,\\n\\n println(log(10)), % base e\\n println(log(math.pi,10)), % some base, here pi\\n println(log2(10)), % base 2\\n println(exp(2.302585092994046)),\\n nl,\\n\\n println(abs(- math.e)),\\n nl,\\n println(floor(sqrt(101))),\\n println(ceiling(sqrt(101))),\\n nl,\\n println(math.pi**math.e), % power\\n println(pow(math.pi,math.e)), % power\\n nl.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(scl 12) # 12 places after decimal point\\n(load \\\"@lib/math.l\\\")\\n\\n(prinl (format (exp 1.0) *Scl)) # e, exp\\n(prinl (format pi *Scl)) # pi\\n\\n(prinl (format (pow 2.0 0.5) *Scl)) # sqare root\\n(prinl (format (sqrt 2.0 1.0) *Scl))\\n\\n(prinl (format (log 2.0) *Scl)) # logarithm\\n(prinl (format (exp 4.0) *Scl)) # exponential\\n\\n(prinl (format (abs -7.2) *Scl)) # absolute value\\n(prinl (abs -123))\\n\\n(prinl (format (pow 3.0 4.0) *Scl)) # power\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"/* e not available other than by using exp(1q0).*/\\n/* pi not available other than by using a trig function such as: pi=4*atan(1) */\\ny = sqrt(x);\\ny = log(x);\\ny = log2(x);\\ny = log10(x);\\ny = exp(x);\\ny = abs(x);\\ny = floor(x);\\ny = ceil(x);\\na = x**y; /* power */\\n/* extra functions: */\\ny = erf(x); /* the error function. */\\ny = erfc(x); /* the error function complemented. */\\ny = gamma (x);\\ny = loggamma (x);\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"The pizza pie is a fraction equal to 355/113. \\\\ equivalent to pi\\n\\n\\\\ square root\\nTo find a square root of a number: \\\\ rounds down\\nPrivatize the number.\\nDe-sign the number.\\nIf the number is 0, put 0 into the square root; exit.\\nIf the number is 1, put 1 into the square root; exit.\\nPut 1 into a square number.\\nPut 3 into a delta number.\\nLoop.\\nIf the square is greater than the number, break.\\nAdd the delta to the square.\\nAdd 2 to the delta.\\nRepeat.\\nPut the delta divided by 2 minus 1 into the square root.\\n\\nA square root is a number.\\n\\n\\\\ absolute value\\nTo put a fraction's absolute value into another fraction:\\nPut the fraction into the other fraction.\\nDe-sign the other fraction.\\n\\nTo put a number's absolute value into another number:\\nPut the number into the other number.\\nDe-sign the other number.\\n\\nTo put a pair's absolute value into another pair:\\nPut the pair into the other pair.\\nDe-sign the other pair.\\n\\n\\\\ power\\nTo raise a number to another number:\\nIf the other number is 0, put 1 into the number; exit.\\nIf the other number is less than 0, put 0 into the number; exit. \\\\ should be 1/the raised result, but always comes out 0 with numbers\\nPut 1 into a result number.\\nLoop.\\nIf a counter is past the other number, break.\\nMultiply the result by the number.\\nRepeat.\\nPut the result into the number.\\n\",\n \"language\": \"Plain-English\"\n },\n {\n \"code\": \"pi ;;; Number Pi\\nsqrt(x) ;;; Square root\\nlog(x) ;;; Natural logarithm\\nexp(x) ;;; Exponential function\\nabs(x) ;;; Absolute value\\nx ** y ;;; x to the power y\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \"Write-Host ([Math]::E)\\nWrite-Host ([Math]::Pi)\\nWrite-Host ([Math]::Sqrt(2))\\nWrite-Host ([Math]::Log(2))\\nWrite-Host ([Math]::Exp(2))\\nWrite-Host ([Math]::Abs(-2))\\nWrite-Host ([Math]::Floor(3.14))\\nWrite-Host ([Math]::Ceiling(3.14))\\nWrite-Host ([Math]::Pow(2, 3))\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Debug #E\\nDebug #PI\\nDebug Sqr(f)\\nDebug Log(f)\\nDebug Exp(f)\\nDebug Log10(f)\\nDebug Abs(f)\\nDebug Pow(f,f)\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import math\\n\\nmath.e # e\\nmath.pi # pi\\nmath.sqrt(x) # square root (Also commonly seen as x ** 0.5 to obviate importing the math module)\\nmath.log(x) # natural logarithm\\nmath.log10(x) # base 10 logarithm\\nmath.exp(x) # e raised to the power of x\\nabs(x) # absolute value\\nmath.floor(x) # floor\\nmath.ceil(x) # ceiling\\nx ** y # exponentiation\\npow(x, y[, n]) # exponentiation [, modulo n (useful in certain encryption/decryption algorithms)]\\n\\n# The math module constants and functions can, of course, be imported directly by:\\n# from math import e, pi, sqrt, log, log10, exp, floor, ceil\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'ceiling and floor easily implemented as functions.\\n'e & pi not available- calculate as shown.\\n\\nFUNCTION ceiling (x)\\n IF x < 0 THEN ceiling = INT(x) ELSE ceiling = INT(x) + 1\\nEND FUNCTION\\n\\nFUNCTION floor (x)\\n IF x > 0 THEN\\n floor = INT(x)\\n ELSE\\n IF x <> INT(x) THEN floor = INT(x) - 1 ELSE floor = INT(x)\\n END IF\\nEND FUNCTION\\n\\nPRINT \\\"e = \\\"; EXP(1) ' e not available\\nPRINT \\\"PI = \\\"; 4 * ATN(1) ' pi not available\\n\\nx = 12.345: y = 1.23\\n\\nPRINT \\\"sqrt = \\\"; SQR(x), x ^ .5 ' square root- NB the unusual name\\nPRINT \\\"ln = \\\"; LOG(x) ' natural logarithm base e\\nPRINT \\\"log10 = \\\"; LOG(x) / 2.303 ' base 10 logarithm\\nPRINT \\\"log = \\\"; LOG(x) / LOG(y) ' arbitrary base logarithm\\nPRINT \\\"exp = \\\"; EXP(x) ' exponential\\nPRINT \\\"abs = \\\"; ABS(-x) ' absolute value\\nPRINT \\\"floor = \\\"; floor(x) ' floor\\nPRINT \\\"ceil = \\\"; ceiling(x) ' ceiling\\nPRINT \\\"power = \\\"; x ^ y ' power\\nEND\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \"exp(1) # e\\npi # pi\\nsqrt(x) # square root\\nlog(x) # natural logarithm\\nlog10(x) # base 10 logarithm\\nlog(x, y) # arbitrary base logarithm\\nexp(x) # exponential\\nabs(x) # absolute value\\nfloor(x) # floor\\nceiling(x) # ceiling\\nx^y # power\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"(exp 1) ; e\\npi ; pi\\n(sqrt x) ; square root\\n(log x) ; natural logarithm\\n(exp x) ; exponential\\n(abs x) ; absolute value\\n(floor x) ; floor\\n(ceiling x) ; ceiling\\n(expt x y) ; power\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"say e; # e\\nsay π; # or pi # pi\\nsay τ; # or tau # tau\\n\\n# Common mathmatical function are availble\\n# as subroutines and as numeric methods.\\n# It is a matter of personal taste and\\n# programming style as to which is used.\\nsay sqrt 2; # Square root\\nsay 2.sqrt; # Square root\\n\\n# If you omit a base, does natural logarithm\\nsay log 2; # Natural logarithm\\nsay 2.log; # Natural logarithm\\n\\n# Specify a base if other than e\\nsay log 4, 10; # Base 10 logarithm\\nsay 4.log(10); # Base 10 logarithm\\nsay 4.log10; # Convenience, base 10 only logarithm\\n\\nsay exp 7; # Exponentiation base e\\nsay 7.exp; # Exponentiation base e\\n\\n# Specify a base if other than e\\nsay exp 7, 4; # Exponentiation\\nsay 7.exp(4); # Exponentiation\\nsay 4 ** 7; # Exponentiation\\n\\nsay abs -2; # Absolute value\\nsay (-2).abs; # Absolute value\\n\\nsay floor -3.5; # Floor\\nsay (-3.5).floor; # Floor\\n\\nsay ceiling pi; # Ceiling\\nsay pi.ceiling; # Ceiling\\n\\nsay e ** π\\\\i + 1 ≅ 0; # :-)\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"a=abs(y) /*takes the absolute value of y.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"r=x**y /*REXX only supports integer powers.*/\\n /*Y may be negative, zero, positive.*/\\n /*X may be any real number. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"ceiling: procedure; parse arg x; t=trunc(x); return t+(x>0)*(x\\\\=t)\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"floor: procedure; parse arg x; t=trunc(x); return t-(x<0)-(x\\\\=t)\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*──────────────────────────────────SQRT subroutine───────────────────────────*/\\nsqrt: procedure; parse arg x; if x=0 then return 0 /*handle 0 case.*/\\nif \\\\datatype(x,'N') then return '[n/a]' /*Not Applicable ───if not numeric.*/\\ni=; if x<0 then do; x=-x; i='i'; end /*handle complex numbers if X is < 0.*/\\nd=digits() /*get the current numeric precision. */\\nm.=9 /*technique uses just enough digits. */\\nh=d+6 /*use extra decimal digits for accuracy*/\\nnumeric digits 9 /*use \\\"small\\\" precision at first. */\\nnumeric form /*force scientific form of the number. */\\nif fuzz()\\\\==0 then numeric fuzz 0 /*just in case invoker has a FUZZ set.*/\\nparse value format(x,2,1,,0) 'E0' with g 'E' _ . /*get the X's exponent.*/\\n g=(g * .5) || 'e' || (_ % 2) /*1st guesstimate for the square root. */\\n /* g= g * .5 'e' (_ % 2) */ /*a shorter & concise version of above.*/\\n /*Note: to insure enough accuracy for */\\n /* the result, the precision during */\\n /* the SQRT calculations is increased */\\n /* by two extra decimal digits. */\\n do j=0 while h>9; m.j=h; h=h%2+1 /*compute the sizes (digs) of precision*/\\n end /*j*/ /* [↑] precisions are stored in M. */\\n /*now, we start to do the heavy lifting*/\\n do k=j+5 to 0 by -1 /*compute the √ with increasing digs.*/\\n numeric digits m.k /*each iteration, increase the digits. */\\n g=(g+x/g) * .5 /*perform the nitty-gritty calculations*/\\n end /*k*/ /* [↑] * .5 is faster than / 2 */\\n /* [↓] normalize √ ──► original digits*/\\nnumeric digits d /* [↓] make answer complex if X < 0. */\\nreturn (g/1)i /*normalize, and add possible I suffix.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \" ╔════════════════════════════════════════════════════════════════════╗\\n╔═╝ __ ╚═╗\\n║ √ ║\\n║ ║\\n║ While the above REXX code seems like it's doing a lot of extra work, ║\\n║ it saves a substantial amount of processing time when the precision ║\\n║ (DIGITs) is a lot greater than the default (default is nine digits). ║\\n║ ║\\n║ Indeed, when computing square roots in the hundreds (even thousands) ║\\n║ of digits, this technique reduces the amount of CPU processing time ║\\n║ by keeping the length of the computations to a minimum (due to a large ║\\n║ precision), while the accuracy at the beginning isn't important for ║\\n║ calculating the (first) guesstimate (the running square root guess). ║\\n║ ║\\n║ Each iteration of K (approximately) doubles the number of digits, ║\\n║ but takes almost four times longer to compute (actually, around 3.8). ║\\n║ ║\\n║ The REXX code could be streamlined (pruned) by removing the ║\\n║ The NUMERIC FUZZ 0 statement can be removed if it is known ║\\n║ that it is already set to zero. (which is the default). ║\\n║ ║\\n║ Also, the NUMERIC FORM statement can be removed if it is known ║\\n║ that the form is SCIENTIFIC (which is the default). ║\\n║ __ ║\\n╚═╗ √ ╔═╝\\n ╚════════════════════════════════════════════════════════════════════╝\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*──────────────────────────────────SQRT subroutine─────────────────────*/\\nsqrt: procedure; arg x /*a simplistic SQRT subroutine.*/\\nif x=0 then return 0 /*handle special case of zero. */\\nd=digits() /*get the current precision (dig)*/\\nnumeric digits d+2 /*ensure extra precision (2 digs)*/\\ng=x/4 /*try get a so-so 1st guesstimate*/\\nold=0 /*set OLD guess to zero. */\\n do forever /*keep at it 'til G (guess)=old.*/\\n g=(g+x/g) / 2 /*do the nitty-gritty calculation*/\\n if g=old then leave /*if G is the same as old, quit. */\\n old=g /*save OLD for next iteration. */\\n end /*forever*/ /* [↑] ···'til we run out of digs*/\\nnumeric digits d /*restore the original precision.*/\\nreturn g/1 /*normalize to old precision (d).*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"numeric digits ddd /*sets the current precision to DDD */\\nnumeric fuzz fff /*arithmetic comparisons with FFF fuzzy*/\\nnumeric form kkk /*exponential: scientific | engineering*/\\n\\nlow=min(a,b,c,d,e,f,g, ...) /*finds the min of specified arguments.*/\\nbig=min(a,b,c,d,e,f,g, ...) /*finds the max of specified arguments.*/\\n\\nrrr=random(low,high) /*gets a random integer from LOW-->HIGH*/\\narr=random(low,high,seed) /* ... with a seed (to make repeatable)*/\\n\\nmzp=sign(x) /*finds the sign of x (-1, 0, +1). */\\n\\n fs=format(x) /*formats X with the current DIGITS() */\\n fb=format(x,bbb) /* BBB digs before decimal*/\\n fa=format(x,bbb,aaa) /* AAA digs after decimal*/\\n fa=format(x,,0) /* rounds X to an integer.*/\\n fe=format(x,,eee) /* exponent has eee places. */\\n ft=format(x,,eee,ttt) /*if x exceeds TTT digits, force exp. */\\n\\nhh=b2x(bbb) /*converts binary/bits to hexadecimal. */\\ndd=c2d(ccc) /*converts character to decimal. */\\nhh=c2x(ccc) /*converts character to hexadecimal. */\\ncc=d2c(ddd) /*converts decimal to character. */\\nhh=d2x(ddd) /*converts decimal to hexadecimal. */\\nbb=x2b(hhh) /*converts hexadecimal to binary (bits)*/\\ncc=x2c(hhh) /*converts hexadecimal to character. */\\ndd=x2d(hhh) /*converts hexadecimal to decimal. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"See \\\"Mathematical Functions\\\" + nl\\nSee \\\"Sin(0) = \\\" + sin(0) + nl\\nSee \\\"Sin(90) radians = \\\" + sin(90) + nl\\nSee \\\"Sin(90) degree = \\\" + sin(90*3.14/180) + nl\\n\\nSee \\\"Cos(0) = \\\" + cos(0) + nl\\nSee \\\"Cos(90) radians = \\\" + cos(90) + nl\\nSee \\\"Cos(90) degree = \\\" + cos(90*3.14/180) + nl\\n\\nSee \\\"Tan(0) = \\\" + tan(0) + nl\\nSee \\\"Tan(90) radians = \\\" + tan(90) + nl\\nSee \\\"Tan(90) degree = \\\" + tan(90*3.14/180) + nl\\n\\nSee \\\"asin(0) = \\\" + asin(0) + nl\\nSee \\\"acos(0) = \\\" + acos(0) + nl\\nSee \\\"atan(0) = \\\" + atan(0) + nl\\nSee \\\"atan2(1,1) = \\\" + atan2(1,1) + nl\\n\\nSee \\\"sinh(0) = \\\" + sinh(0) + nl\\nSee \\\"sinh(1) = \\\" + sinh(1) + nl\\nSee \\\"cosh(0) = \\\" + cosh(0) + nl\\nSee \\\"cosh(1) = \\\" + cosh(1) + nl\\nSee \\\"tanh(0) = \\\" + tanh(0) + nl\\nSee \\\"tanh(1) = \\\" + tanh(1) + nl\\n\\nSee \\\"exp(0) = \\\" + exp(0) + nl\\nSee \\\"exp(1) = \\\" + exp(1) + nl\\nSee \\\"log(1) = \\\" + log(1) + nl\\nSee \\\"log(2) = \\\" + log(2) + nl\\nSee \\\"log10(1) = \\\" + log10(1) + nl\\nSee \\\"log10(2) = \\\" + log10(2) + nl\\nSee \\\"log10(10) = \\\" + log10(10) + nl\\n\\nSee \\\"Ceil(1.12) = \\\" + Ceil(1.12) + nl\\nSee \\\"Ceil(1.72) = \\\" + Ceil(1.72) + nl\\n\\nSee \\\"Floor(1.12) = \\\" + floor(1.12) + nl\\nSee \\\"Floor(1.72) = \\\" + floor(1.72) + nl\\n\\nSee \\\"fabs(1.12) = \\\" + fabs(1.12) + nl\\nSee \\\"fabs(1.72) = \\\" + fabs(1.72) + nl\\n\\nSee \\\"pow(2,3) = \\\" + pow(2,3) + nl\\n\\nsee \\\"sqrt(16) = \\\" + sqrt(16) + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \">> const\\n e euler ln10 ln2 lnpi\\n log10e log2e pi pihalf piquarter\\n rpi sqrt2 sqrt2r sqrt3 sqrtpi\\n tworpi\\n\",\n \"language\": \"RLaB\"\n },\n {\n \"code\": \">> mks\\n F G J L N\\n Na R0 Ry Tsp V0\\n a a0 acre alpha atm\\n au bar barn btu c\\n cal cgal cm cm2 cm3\\n ct cup curie day dm\\n dm2 dm3 dyne e eV\\n eps0 erg fathom floz ft\\n ftcan ftlam g gal gauss\\n gf h ha hbar hour\\n hp in inH2O inHg kSB\\n kb kcal km km2 km3\\n kmh knot kpf lam lb\\n lumen lux ly mHg mSun\\n me micron mil mile min\\n mm mm2 mm3 mmu mn\\n mp mph mu0 mub mue\\n mun mup nmi oz pal\\n parsec pf phot poise psi\\n rad roe stilb stokes tcs\\n therm tntton ton torr toz\\n tsp uam ukgal ukton uston\\n week yd\\n\",\n \"language\": \"RLaB\"\n },\n {\n \"code\": \">> x = rand()\\n>> sqrt(x)\\n 2.23606798\\n>> log(x)\\n 1.60943791\\n>> log10(x)\\n 0.698970004\\n>> exp(x)\\n 148.413159\\n>> abs(x)\\n 5\\n>> floor(x)\\n 5\\n>> ceil(x)\\n 5\\n>> x .^ 2\\n 25\\n\",\n \"language\": \"RLaB\"\n },\n {\n \"code\": \"x.abs #absolute value\\nx.magnitude #absolute value\\nx.floor #floor\\nx.ceil #ceiling\\nx ** y #power\\ninclude Math\\nE #e\\nPI #pi\\nsqrt(x) #square root\\nlog(x) #natural logarithm\\nlog(x, y) #logarithm base y\\nlog10(x) #base 10 logarithm\\nexp(x) #exponential\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"print \\\"exp:\\\";chr$(9); EXP(1)\\nprint \\\"PI:\\\";chr$(9); 22/7\\nprint \\\"Sqr2:\\\";chr$(9); SQR(2)\\nprint \\\"Log2:\\\";chr$(9); LOG(2) : REM Base 10\\nprint \\\"Exp2:\\\";chr$(9); EXP(2)\\nprint \\\"Abs2:\\\";chr$(9); ABS(-2)\\nprint \\\"Floor:\\\";chr$(9); INT(1.534)\\nprint \\\"ceil:\\\";chr$(9); val(using(\\\"###\\\",1.534))\\nprint \\\"Power:\\\";chr$(9); 1.23^4\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use std::f64::consts::*;\\n\\nfn main() {\\n // e (base of the natural logarithm)\\n let mut x = E;\\n // π\\n x += PI;\\n // square root\\n x = x.sqrt();\\n // logarithm (any base allowed)\\n x = x.ln();\\n // ceiling (smallest integer not less than this number--not the same as round up)\\n x = x.ceil();\\n // exponential (ex)\\n x = x.exp();\\n // absolute value (a.k.a. \\\"magnitude\\\")\\n x = x.abs();\\n // floor (largest integer less than or equal to this number--not the same as truncate or int)\\n x = x.floor();\\n // power (xy)\\n x = x.powf(x);\\n\\n assert_eq!(x, 4.0);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object RealConstantsFunctions extends App{\\n println(math.E) // e\\n println(math.Pi) // pi\\n println(math.sqrt(2.0)) // square root\\n println(math.log(math.E)) // log to base e\\n println(math.log10(10.0)) // log to base 10\\n println(math.exp(1.0)) // exponential\\n println(math.abs(-1)) // absolute value\\n println(math.floor(-2.5)) // floor\\n println(math.ceil(-2.5)) // ceiling\\n println(math.pow(2.5, 3.5)) // power\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(sqrt x) ;square root\\n(log x) ;natural logarithm\\n(exp x) ;exponential\\n(abs x) ;absolute value\\n(floor x) ;floor\\n(ceiling x) ;ceiling\\n(expt x y) ;power\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"Num.e # e\\nNum.pi # pi\\nx.sqrt # square root\\nx.log # natural logarithm\\nx.log10 # base 10 logarithm\\nx.exp # e raised to the power of x\\nx.abs # absolute value\\nx.floor # floor\\nx.ceil # ceiling\\nx**y # exponentiation\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"EXP 1\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"PI\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"SQR X\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"LN X\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"EXP X\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"ABS X\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"INT X\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"X**Y\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"numerics E.\\nnumerics Pi.\\nn sqrt.\\nn log10. \\\"base 10 logarithm\\\"\\nn ln. \\\"natural logarithm\\\"\\nn log: m. \\\"arbitrary base logarithm\\\"\\nn exp. \\\"exponential\\\"\\nn abs. \\\"absolute value\\\"\\nn floor.\\nn ceiling.\\nn raisedTo: anotherNumber\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"Float e.\\nFloat pi.\\naNumber sqrt.\\naNumber log. \\\"base 10 logarithm\\\"\\naNumber ln. \\\"natural logarithm\\\"\\naNumber exp. \\\"exponential\\\"\\naNumber abs. \\\"absolute value\\\"\\naNumber floor.\\naNumber ceiling.\\naNumber raisedTo: anotherNumber\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"// e:\\nprint(M_E);\\n\\n// π:\\nprint(M_PI);\\n\\n// square root:\\nlet five = sqrt(25);\\n\\n// logarithm\\n// natural:\\nlet one = log(M_E);\\n// base-2:\\nlet six = log2(64);\\n// base-10\\nlet three = log10(1000);\\n\\n// exponential\\nlet e_cubed = exp(3);\\n\\n// absolute value\\nlet ten = abs(-10);\\n\\n// floor\\nlet seven = floor(7.8);\\n\\n// ceiling\\nlet four = ceil(3.2);\\n\\n// power\\nlet eighty_one = pow(3, 4);\\n\",\n \"language\": \"Sparkling\"\n },\n {\n \"code\": \"Math.e; (* e *)\\nMath.pi; (* pi *)\\nMath.sqrt x; (* square root *)\\nMath.ln x; (* natural logarithm--log base 10 also available (Math.log10) *)\\nMath.exp x; (* exponential *)\\nabs x; (* absolute value *)\\nfloor x; (* floor *)\\nceil x; (* ceiling *)\\nMath.pow (x, y); (* power *)\\n~ x; (* negation *)\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"scalar x=2\\nscalar y=3\\ndi exp(1)\\ndi _pi\\ndi c(pi)\\ndi sqrt(x)\\ndi log(x)\\ndi log10(x)\\ndi exp(x)\\ndi abs(x)\\ndi floor(x)\\ndi ceil(x)\\ndi x^y\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"import Darwin\\n\\nM_E // e\\nM_PI // pi\\nsqrt(x) // square root--cube root also available (cbrt)\\nlog(x) // natural logarithm--log base 10 also available (log10)\\nexp(x) // exponential\\nabs(x) // absolute value\\nfloor(x) // floor\\nceil(x) // ceiling\\npow(x,y) // power\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"expr {exp(1)} ;# e\\nexpr {4 * atan(1)} ;# pi -- also, simpler: expr acos(-1)\\nexpr {sqrt($x)} ;# square root\\nexpr {log($x)} ;# natural logarithm, also log10\\nexpr {exp($x)} ;# exponential\\nexpr {abs($x)} ;# absolute value\\nexpr {floor($x)} ;# floor\\nexpr {ceil($x)} ;# ceiling\\nexpr {$x**$y} ;# power, also pow($x,$y)\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"package require math::constants\\nmath::constants::constants e pi\\nputs \\\"e = $e, pi = $pi\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"FUNCTION floor(x)\\n IF x > 0 THEN\\n LET floor = INT(x)\\n ELSE\\n IF x <> INT(x) THEN LET floor = INT(x) - 1 ELSE LET floor = INT(x)\\n END IF\\nEND FUNCTION\\n\\nPRINT \\\"e = \\\"; exp(1) ! e not available\\nPRINT \\\"PI = \\\"; PI\\n\\nLET x = 12.345\\nLET y = 1.23\\n\\nPRINT \\\"sqrt = \\\"; SQR(x), x^0.5 ! square root- NB the unusual name\\nPRINT \\\"ln = \\\"; LOG(x) ! natural logarithm base e\\nPRINT \\\"log2 = \\\"; LOG2(x) ! base 2 logarithm\\nPRINT \\\"log10 = \\\"; LOG10(x) ! base 10 logarithm\\nPRINT \\\"log = \\\"; LOG(x)/LOG(y) ! arbitrary base logarithm\\nPRINT \\\"exp = \\\"; EXP(x) ! exponential\\nPRINT \\\"abs = \\\"; ABS(-1) ! absolute value\\nPRINT \\\"floor = \\\"; floor(x) ! floor easily implemented as functions\\nPRINT \\\"ceil = \\\"; CEIL(x) ! ceiling\\nPRINT \\\"power = \\\"; x ^ y ! power\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"echo $(( exp(1) )) # e\\necho $(( acos(-1) )) # PI\\nx=5\\necho $(( sqrt(x) )) # square root\\necho $(( log(x) )) # logarithm base e\\necho $(( log2(x) )) # logarithm base 2\\necho $(( log10(x) )) # logarithm base 10\\necho $(( exp(x) )) # exponential\\nx=-42\\necho $(( abs(x) )) # absolute value\\nx=-5.5\\necho $(( floor(x) )) # floor\\necho $(( ceil(x) )) # ceiling\\nx=10 y=3\\necho $(( pow(x,y) )) # power\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"import math\\n\\nfn main() {\\n x := -1.2345\\n println(\\\"e = ${math.e}\\\")\\n println(\\\"pi = ${math.pi}\\\")\\n println(\\\"sqrt(4) = ${math.sqrt(4)}\\\")\\n println(\\\"log(e) = ${math.log(math.e)}\\\")\\n println(\\\"exp(x) = ${math.exp(x)}\\\")\\n println(\\\"abs(x) = ${math.abs(x)}\\\")\\n println(\\\"floor(x) = ${math.floor(x)}\\\")\\n println(\\\"ceil(x) = ${math.ceil(x)}\\\")\\n println(\\\"pow(-x, x) = ${math.pow(-x, x)}\\\")\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"var e = 1.exp\\n\\nSystem.print(\\\"e = %(e)\\\")\\nSystem.print(\\\"pi = %(Num.pi)\\\")\\nSystem.print(\\\"sqrt(2) = %(2.sqrt)\\\")\\nSystem.print(\\\"ln(3) = %(3.log)\\\") // log base e\\nSystem.print(\\\"exp(2) = %(2.exp)\\\")\\nSystem.print(\\\"abs(-e) = %((-e).abs)\\\")\\nSystem.print(\\\"floor(e) = %(e.floor)\\\")\\nSystem.print(\\\"ceil(e) = %(e.ceil)\\\")\\nSystem.print(\\\"pow(e, 2) = %(e.pow(2))\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"PROGRAM\\t\\\"progname\\\"\\nVERSION \\\"0.0000\\\"\\n\\nIMPORT\\t\\\"xma\\\"\\n\\nDECLARE FUNCTION Entry ()\\nDECLARE FUNCTION Ceil (x)\\nDECLARE FUNCTION Floor (x)\\n\\nFUNCTION Entry ()\\n DOUBLE e, pi, x, y\\n\\n e = EXP(1)\\n PRINT \\\"e = \\\"; e ' e not available\\n pi = 4 * ATAN(1)\\n PRINT \\\"pi = \\\"; pi ' pi not available\\n\\n x = 12.345\\n y = 1.23\\n\\n PRINT \\\"sqrt = \\\"; SQRT (x) ' square root\\n PRINT \\\"ln = \\\"; LOG (x) ' natural logarithm base e\\n PRINT \\\"log10 = \\\"; LOG10 (x) ' base 10 logarithm\\n PRINT \\\"log = \\\"; LOG (x) / LOG (y) ' arbitrary base logarithm\\n PRINT \\\"exp = \\\"; EXP (x) ' exponential\\n PRINT \\\"abs = \\\"; ABS (-x) ' absolute value\\n PRINT \\\"Floor = \\\"; Floor (x) ' Floor easily implemented as functions\\n PRINT \\\"Ceil = \\\"; Ceil (x) ' Ceil easily implemented as functions\\n PRINT \\\"power = \\\"; x ** y ' power\\nEND FUNCTION\\n\\nFUNCTION Ceil (x)\\n IF x < 0 THEN RETURN INT(x) ELSE RETURN INT(x) + 1\\nEND FUNCTION\\n\\nFUNCTION Floor (x)\\n IF x > 0 THEN\\n RETURN INT(x)\\n ELSE\\n\\t IF x <> INT(x) THEN RETURN INT(x) - 1 ELSE RETURN INT(x)\\n END IF\\nEND FUNCTION\\nEND PROGRAM\\n\",\n \"language\": \"XBasic\"\n },\n {\n \"code\": \"include c:\\\\cxpl\\\\codes; \\\\intrinsic 'code' declarations\\n\\nfunc real Power(X, Y); \\\\X raised to the Y power\\nreal X, Y;\\nreturn Exp(Y*Ln(X));\\n\\nreal E, Pi;\\n[Format(4, 16); \\\\places shown before and after .\\nE:= Exp(1.0);\\nRlOut(0, E); CrLf(0);\\nRlOut(0, Ln(E)); CrLf(0);\\nCrLf(0);\\nPi:= ATan2(0.0, -1.0); \\\\Pi is also a defined constant\\nRlOut(0, Pi); CrLf(0);\\nRlOut(0, Cos(Pi)); CrLf(0);\\nCrLf(0);\\nRlOut(0, Sqrt(2.0)); CrLf(0); \\\\Sqrt is a call to an intrinsic\\nRlOut(0, Log(100.0)); CrLf(0);\\nRlOut(0, Ln(Exp(123.456789))); CrLf(0);\\nCrLf(0);\\nRlOut(0, abs(-1234.5)); CrLf(0); \\\\abs works for both reals & ints\\nCrLf(0);\\nRlOut(0, float(fix(1.999-0.5))); CrLf(0); \\\\floor rounds toward -infinity\\nRlOut(0, float(fix(1.001+0.5))); CrLf(0); \\\\ceiling rounds toward +infinity\\nRlOut(0, Power(sqrt(2.0), 4.0)); CrLf(0); \\\\sqrt is an inline function and\\n] \\\\ can be used for both reals & ints\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"print \\\"e = \\\", euler\\nprint \\\"pi = \\\", pi\\n\\nx = 12.345\\ny = 1.23\\n\\nprint \\\"sqrt = \\\", sqrt(2) // square root\\nprint \\\"ln = \\\", log(euler) // natural logarithm base e\\nprint \\\"log = \\\", log(x, y)\\t // arbitrary base y logarithm\\nprint \\\"exp = \\\", exp(euler) // exponential\\nprint \\\"abs = \\\", abs(-1) // absolute value\\nprint \\\"floor = \\\", floor(-euler) // floor\\nprint \\\"ceil = \\\", ceil(-euler) // ceiling\\nprint \\\"power = \\\", x ^ y, \\\" \\\", x ** y // power\\nend\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"const std = @import(\\\"std\\\");\\n\\npub fn main() void {\\n var x: f64 = -1.2345;\\n std.debug.print(\\\"e = {d}\\\\n\\\", .{std.math.e});\\n std.debug.print(\\\"pi = {d}\\\\n\\\", .{std.math.pi});\\n std.debug.print(\\\"sqrt(4) = {d}\\\\n\\\", .{std.math.sqrt(4)});\\n std.debug.print(\\\"ln(e) = {d}\\\\n\\\", .{std.math.ln(std.math.e)});\\n std.debug.print(\\\"exp(x) = {d}\\\\n\\\", .{std.math.exp(x)});\\n std.debug.print(\\\"abs(x) = {d}\\\\n\\\", .{std.math.absFloat(x)});\\n std.debug.print(\\\"floor(x) = {d}\\\\n\\\", .{std.math.floor(x)});\\n std.debug.print(\\\"ceil(x) = {d}\\\\n\\\", .{std.math.ceil(x)});\\n std.debug.print(\\\"pow(f64, -x, x) = {d}\\\\n\\\", .{std.math.pow(f64, -x, x)});\\n}\\n\",\n \"language\": \"Zig\"\n },\n {\n \"code\": \"(0.0).e // Euler's number, a property of all floats\\n(0.0).e.pi // pi, yep, all floats\\n(2.0).sqrt() // square root\\n(2.0).log() // natural (base e) logarithm\\n(2.0).log10() // log base 10\\n(0.0).e.pow(x) // e^x\\n(-10.0).abs() // absolute value, both floats and ints\\nx.pow(y) // x raised to the y power\\nx.ceil() // ceiling\\nx.floor() // floor\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Real-constants-and-functions"}}},{"rowIdx":1569,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Recaman's_sequence\n","language":"00-META"},{"code":"The '''[[wp:Recamán's sequence|Recamán's sequence]]''' generates Natural numbers.\n\nStarting from a(0)=0, the n'th term <code>a(n)</code>, where n>0, is the previous term minus <code>n</code> i.e <code>a(n) = a(n-1) - n</code> but only if this is '''both''' positive ''and'' has not been previously generated.<br>\n\nIf the conditions ''don't'' hold then <code>a(n) = a(n-1) + n</code>.\n\n\n;Task:\n# Generate and show here the first 15 members of the sequence.\n# Find and show here, the first duplicated number in the sequence.\n# '''Optionally''': Find and show here, how many terms of the sequence are needed until all the integers 0..1000, inclusive, are generated.\n\n\n;References:\n* [https://oeis.org/A005132 A005132], The On-Line Encyclopedia of Integer Sequences.\n* [https://www.youtube.com/watch?v=FGC5TdIiT9U The Slightly Spooky Recamán Sequence], Numberphile video.\n* [https://en.wikipedia.org/wiki/Recam%C3%A1n%27s_sequence Recamán's sequence], on Wikipedia.\n<br><br>\n\n","language":"00-TASK"},{"code":"F recamanSucc(seen, n, r)\n ‘The successor for a given Recaman term,\n given the set of Recaman terms seen so far.’\n V back = r - n\n R I 0 > back | (back C seen) {n + r} E back\n\nF recamanUntil(p)\n ‘All terms of the Recaman series before the\n first term for which the predicate p holds.’\n V n = 1\n V r = 0\n V rs = [r]\n V seen = Set(rs)\n V blnNew = 1B\n L !p(seen, n, r, blnNew)\n r = recamanSucc(seen, n, r)\n blnNew = r !C seen\n seen.add(r)\n rs.append(r)\n n = 1 + n\n R rs\n\nF enumFromTo(m)\n ‘Integer enumeration from m to n.’\n R n -> @m .< 1 + n\n\nprint(\"First 15 Recaman:\\n \"recamanUntil((seen, n, r, _) -> n == 15))\nprint(\"First duplicated Recaman:\\n \"recamanUntil((seen, n, r, blnNew) -> !blnNew).last)\nV setK = Set(enumFromTo(0)(1000))\nprint(\"Number of Recaman terms needed to generate all integers from [0..1000]:\\n \"(recamanUntil((seen, n, r, blnNew) -> (blnNew & r < 1001 & :setK.is_subset(seen))).len - 1))\n","language":"11l"},{"code":"begin\n % calculate Recaman's sequence values %\n\n % a hash table element - holds n, A(n) and a link to the next element with the %\n % same hash value %\n record AValue ( integer eN, eAn ; reference(AValue) eNext );\n\n % hash modulus %\n integer HMOD;\n HMOD := 100000;\n\n begin\n reference(AValue) array hashTable ( 0 :: HMOD - 1 );\n integer array A ( 0 :: 14 );\n integer le1000Count, firstN, duplicateN, duplicateValue, n, An, An1, prevN, maxS;\n\n % adds an element to the hash table, returns true if an element with value An %\n % was already present, false otherwise %\n % if the value was already present, its eN value is returned in prevN %\n logical procedure addAValue( integer value n, An ; integer result prevN ) ;\n begin\n integer hash;\n logical duplicate;\n reference(AValue) element;\n hash := An rem HMOD;\n element := hashTable( hash );\n duplicate := false;\n while element not = null and eAn(element) not = An do element := eNext(element);\n duplicate := element not = null;\n if not duplicate then hashTable( hash ) := AValue( n, An, hashTable( hash ) )\n else prevN := eN(element);\n duplicate\n end addAValue ;\n\n % initialise the hash table %\n for h := 0 until HMOD - 1 do hashTable( h ) := null;\n\n % calculate the values of the sequence until we have found values that %\n % include all numbers in 1..1000 %\n % also store the first 15 values %\n\n A( 0 ) := An1 := n := 0;\n le1000Count := 0;\n maxS := firstN := duplicateN := duplicateValue := -1;\n while le1000Count < 1000 do begin\n logical le0, duplicate;\n n := n + 1;\n An := An1 - n;\n le0 := ( An <= 0 );\n if le0 then An := An1 + n;\n prevN := -1;\n duplicate := addAValue( n, An, prevN );\n if duplicate and not le0 then begin\n An := An1 + n;\n duplicate := addAValue( n, An, prevN )\n end if_duplicate_and_not_le0 ;\n if duplicate then begin\n % the value was already present %\n if firstN < 0 then begin % have the first duplicate %\n firstN := n;\n duplicateN := prevN;\n duplicateValue := An;\n end if_firstN_lt_0\n end\n else if An <= 1000 then le1000Count := le1000Count + 1;;\n if n < 15 then A( n ) := An;\n if An > maxS then maxS := An;\n An1 := An\n end while_le1000Count_lt_1000 ;\n\n % show the first 15 values of the sequence %\n write( \"A( 0 .. 14 ): \" );\n for n := 0 until 14 do writeon( i_w := 1, A( n ) );\n % positions of the first duplicate %\n write( i_w := 1\n , s_w := 0\n , \"First duplicates: \"\n , duplicateN\n , \" \"\n , firstN\n , \" (\"\n , duplicateValue\n , \")\"\n );\n % number of elements required to include the first 1000 integers %\n write( i_w := 1, \"first element to include all 1..1000: \", n );\n write( i_w := 1, \"max sequence value encountered: \", maxS )\n end\n\nend.\n","language":"ALGOL-W"},{"code":"recaman←{⎕IO←0\n genNext←{\n R←⍵[N-1]-N←≢⍵\n (R<0)∨(R∊⍵):⍵,⍵[N-1]+N\n ⍵,⍵[N-1]-N\n }\n ⎕←'First 15: '\n ⎕←reca←(genNext⍣14),0\n ⎕←'First repetition: '\n ⎕←⊃⌽reca←genNext⍣{⍺≢∪⍺}⊢reca\n ⎕←'Length of sequence containing [0..1000]:'\n ⎕←≢reca←genNext⍣{(⍳1001)∧.∊⊂⍺}⊢reca\n}\n","language":"APL"},{"code":"use AppleScript version \"2.4\"\nuse framework \"Foundation\"\nuse scripting additions\n\non run\n\n -- FIRST FIFTEEN RECAMANs ------------------------------------------------------\n\n script term15\n on |λ|(i)\n 15 = (i as integer)\n end |λ|\n end script\n set strFirst15 to unwords(snd(recamanUpto(true, term15)))\n\n set strFirstMsg to \"First 15 Recamans:\" & linefeed\n display notification strFirstMsg & strFirst15\n delay 2\n\n -- FIRST DUPLICATE RECAMAN ----------------------------------------------------\n\n script firstDuplicate\n on |λ|(_, seen, rs)\n setSize(seen) as integer is not (length of (rs as list))\n end |λ|\n end script\n set strDuplicate to (item -1 of snd(recamanUpto(true, firstDuplicate))) as integer as string\n\n set strDupMsg to \"First duplicated Recaman:\" & linefeed\n display notification strDupMsg & strDuplicate\n delay 2\n\n -- NUMBER OF RECAMAN TERMS NEEDED TO GET ALL OF [0..1000]\n -- (takes about a minute, depending on system)\n\n set setK to setFromList(enumFromTo(0, 1000))\n script supersetK\n on |λ|(i, setR)\n setK's isSubsetOfSet:(setR)\n end |λ|\n end script\n\n display notification \"Superset size result will take c. 1 min to find ...\"\n set dteStart to current date\n\n set strSetSize to (fst(recamanUpto(false, supersetK)) - 1) as string\n\n set dteEnd to current date\n\n set strSetSizeMsg to \"Number of Recaman terms needed to generate\" & ¬\n linefeed & \"all integers from [0..1000]:\" & linefeed\n set strElapsed to \"(Last result took c. \" & (dteEnd - dteStart) & \" seconds to find)\"\n display notification strSetSizeMsg & linefeed & strSetSize\n\n -- CLEARED REFERENCE TO NSMUTABLESET -------------------------------------\n set setK to missing value\n\n -- REPORT ----------------------------------------------------------------\n unlines({strFirstMsg & strFirst15, \"\", ¬\n strDupMsg & strDuplicate, \"\", ¬\n strSetSizeMsg & strSetSize, \"\", ¬\n strElapsed})\nend run\n\n-- nextR :: Set Int -> Int -> Int\non nextR(seen, i, n)\n set bk to n - i\n if 0 > bk or setMember(bk, seen) then\n n + i\n else\n bk\n end if\nend nextR\n\n-- recamanUpto :: Bool -> (Int -> Set Int > [Int] -> Bool) -> (Int, [Int])\non recamanUpto(bln, p)\n script recaman\n property mp : mReturn(p)'s |λ|\n on |λ|()\n set i to 1\n set r to 0\n set rs to {r}\n set seen to setFromList(rs)\n repeat while not mp(i, seen, rs)\n set r to nextR(seen, i, r)\n setInsert(r, seen)\n if bln then set end of rs to r\n set i to i + 1\n end repeat\n set seen to missing value -- clear pointer to NSMutableSet\n {i, rs}\n end |λ|\n end script\n recaman's |λ|()\nend recamanUpto\n\n-- GENERIC FUNCTIONS -------------------------------------------------------\n\n-- enumFromTo :: Int -> Int -> [Int]\non enumFromTo(m, n)\n if m ≤ n then\n set lst to {}\n repeat with i from m to n\n set end of lst to i\n end repeat\n return lst\n else\n return {}\n end if\nend enumFromTo\n\n-- fst :: (a, b) -> a\non fst(tpl)\n if class of tpl is record then\n |1| of tpl\n else\n item 1 of tpl\n end if\nend fst\n\n-- intercalateS :: String -> [String] -> String\non intercalateS(sep, xs)\n set {dlm, my text item delimiters} to {my text item delimiters, sep}\n set s to xs as text\n set my text item delimiters to dlm\n return s\nend intercalateS\n\n-- Lift 2nd class handler function into 1st class script wrapper\n-- mReturn :: First-class m => (a -> b) -> m (a -> b)\non mReturn(f)\n if class of f is script then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n\n-- NB All names of NSMutableSets should be set to *missing value*\n-- before the script exits.\n-- ( scpt files containing residual ObjC pointer values can not be saved)\n-- setFromList :: Ord a => [a] -> Set a\non setFromList(xs)\n set ca to current application\n ca's NSMutableSet's ¬\n setWithArray:(ca's NSArray's arrayWithArray:(xs))\nend setFromList\n\n-- setMember :: Ord a => a -> Set a -> Bool\non setMember(x, objcSet)\n missing value is not (objcSet's member:(x))\nend setMember\n\n-- setInsert :: Ord a => a -> Set a -> Set a\non setInsert(x, objcSet)\n objcSet's addObject:(x)\n objcSet\nend setInsert\n\n-- setSize :: Set a -> Int\non setSize(objcSet)\n objcSet's |count|() as integer\nend setSize\n\n-- snd :: (a, b) -> b\non snd(tpl)\n if class of tpl is record then\n |2| of tpl\n else\n item 2 of tpl\n end if\nend snd\n\n-- unlines :: [String] -> String\non unlines(xs)\n set {dlm, my text item delimiters} to ¬\n {my text item delimiters, linefeed}\n set str to xs as text\n set my text item delimiters to dlm\n str\nend unlines\n\n-- unwords :: [String] -> String\non unwords(xs)\n intercalateS(space, xs)\nend unwords\n","language":"AppleScript"},{"code":"10 DIM A(100)\n20 PRINT \"First 15 terms:\"\n30 FOR N=0 TO 14: GOSUB 100: PRINT A(N); \" \";: NEXT\n35 PRINT\n40 PRINT \"First repeated term:\"\n50 GOSUB 100\n55 FOR M=0 TO N-1\n56 IF A(M)=A(N) THEN 70\n57 NEXT\n60 N=N+1: GOTO 50\n70 PRINT \"A(\";N;\") = \";A(N)\n80 END\n100 IF N=0 THEN A(0)=0: RETURN\n110 X = A(N-1)-N: IF X<0 THEN 160\n120 FOR M=0 TO N-1\n130 IF A(M)=X THEN 160\n140 NEXT\n150 A(N)=X: RETURN\n160 A(N)=A(N-1)+N: RETURN\n","language":"Applesoft-BASIC"},{"code":"recamanSucc: function [seen, n, r].memoize[\n back: r - n\n (or? 0 > back contains? seen back)? -> n + r\n -> back\n]\n\nrecamanUntil: function [p][\n n: new 1\n r: 0\n rs: new @[r]\n seen: rs\n blnNew: true\n while [not? do p][\n r: recamanSucc seen n r\n blnNew: not? in? r seen\n seen: unique seen ++ r\n 'rs ++ r\n inc 'n\n ]\n return rs\n]\n\nprint \"First 15 Recaman numbers:\"\nprint recamanUntil [n = 15]\n\nprint \"\"\nprint \"First duplicate Recaman number:\"\nprint last recamanUntil [not? blnNew]\n","language":"Arturo"},{"code":"# syntax: GAWK -f RECAMANS_SEQUENCE.AWK\n# converted from Microsoft Small Basic\nBEGIN {\n found_dup = 0\n n = -1\n do {\n n++\n ap = a[n-1] + n\n if (a[n-1] <= n) {\n a[n] = ap\n b[ap] = 1\n }\n else {\n am = a[n-1] - n\n if (b[am] == 1) {\n a[n] = ap\n b[ap] = 1\n }\n else {\n a[n] = am\n b[am] = 1\n }\n }\n if (n <= 14) {\n terms = sprintf(\"%s%s \",terms,a[n])\n if (n == 14) {\n printf(\"first %d terms: %s\\n\",n+1,terms)\n }\n }\n if (!found_dup) {\n if (dup[a[n]] == 1) {\n printf(\"first duplicated term: a[%d]=%d\\n\",n,a[n])\n found_dup = 1\n }\n dup[a[n]] = 1\n }\n if (a[n] <= 1000) {\n arr[a[n]] = \"\"\n }\n } while (n <= 15 || !found_dup || length(arr) < 1001)\n printf(\"terms needed to generate integers 0 - 1000: %d\\n\",n)\n exit(0)\n}\n","language":"AWK"},{"code":"10 DEFINT A-Z: DIM A(100)\n20 PRINT \"First 15 terms:\"\n30 FOR N=0 TO 14: GOSUB 100: PRINT A(N);: NEXT\n35 PRINT\n40 PRINT \"First repeated term:\"\n50 GOSUB 100\n55 FOR M=0 TO N-1: IF A(M)=A(N) THEN 70 ELSE NEXT\n60 N=N+1: GOTO 50\n70 PRINT \"A(\";N;\") =\";A(N)\n80 END\n100 IF N=0 THEN A(0)=0: RETURN\n110 X = A(N-1)-N: IF X<0 THEN 160\n120 FOR M=0 TO N-1\n130 IF A(M)=X THEN 160\n140 NEXT\n150 A(N)=X: RETURN\n160 A(N)=A(N-1)+N: RETURN\n","language":"BASIC"},{"code":"get \"libhdr\"\n\n// Generate the N'th term of the Recaman sequence\n// given terms 0 to N-1.\nlet generate(a, n) be\n a!n := n=0 -> 0, valof\n $( let subterm = a!(n-1) - n\n let addterm = a!(n-1) + n\n if subterm <= 0 resultis addterm\n for i=0 to n-1\n if a!i = subterm resultis addterm\n resultis subterm\n $)\n\nlet start() be\n$( let a = vec 50 and n = 15 and rep = ?\n\n writef(\"First %N members:*N\", n)\n for i = 0 to n-1\n $( generate(a, i)\n writef(\"%N \", a!i)\n $)\n\n writef(\"*NFirst repeated term:*N\")\n rep := valof\n $( generate(a, n)\n for i = 0 to n-1\n if a!i = a!n resultis n\n n := n + 1\n $) repeat\n\n writef(\"a!%N = %N*N\", rep, a!rep)\n$)\n","language":"BCPL"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <gmodule.h>\n\ntypedef int bool;\n\nint main() {\n int i, n, k = 0, next, *a;\n bool foundDup = FALSE;\n gboolean alreadyUsed;\n GHashTable* used = g_hash_table_new(g_direct_hash, g_direct_equal);\n GHashTable* used1000 = g_hash_table_new(g_direct_hash, g_direct_equal);\n a = malloc(400000 * sizeof(int));\n a[0] = 0;\n g_hash_table_add(used, GINT_TO_POINTER(0));\n g_hash_table_add(used1000, GINT_TO_POINTER(0));\n\n for (n = 1; n <= 15 || !foundDup || k < 1001; ++n) {\n next = a[n - 1] - n;\n if (next < 1 || g_hash_table_contains(used, GINT_TO_POINTER(next))) {\n next += 2 * n;\n }\n alreadyUsed = g_hash_table_contains(used, GINT_TO_POINTER(next));\n a[n] = next;\n\n if (!alreadyUsed) {\n g_hash_table_add(used, GINT_TO_POINTER(next));\n if (next >= 0 && next <= 1000) {\n g_hash_table_add(used1000, GINT_TO_POINTER(next));\n }\n }\n\n if (n == 14) {\n printf(\"The first 15 terms of the Recaman's sequence are: \");\n printf(\"[\");\n for (i = 0; i < 15; ++i) printf(\"%d \", a[i]);\n printf(\"\\b]\\n\");\n }\n\n if (!foundDup && alreadyUsed) {\n printf(\"The first duplicated term is a[%d] = %d\\n\", n, next);\n foundDup = TRUE;\n }\n k = g_hash_table_size(used1000);\n\n if (k == 1001) {\n printf(\"Terms up to a[%d] are needed to generate 0 to 1000\\n\", n);\n }\n }\n g_hash_table_destroy(used);\n g_hash_table_destroy(used1000);\n free(a);\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <ostream>\n#include <set>\n#include <vector>\n\ntemplate<typename T>\nstd::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {\n auto i = v.cbegin();\n auto e = v.cend();\n os << '[';\n if (i != e) {\n os << *i;\n i = std::next(i);\n }\n while (i != e) {\n os << \", \" << *i;\n i = std::next(i);\n }\n return os << ']';\n}\n\nint main() {\n using namespace std;\n\n vector<int> a{ 0 };\n set<int> used{ 0 };\n set<int> used1000{ 0 };\n bool foundDup = false;\n int n = 1;\n while (n <= 15 || !foundDup || used1000.size() < 1001) {\n int next = a[n - 1] - n;\n if (next < 1 || used.find(next) != used.end()) {\n next += 2 * n;\n }\n bool alreadyUsed = used.find(next) != used.end();\n a.push_back(next);\n if (!alreadyUsed) {\n used.insert(next);\n if (0 <= next && next <= 1000) {\n used1000.insert(next);\n }\n }\n if (n == 14) {\n cout << \"The first 15 terms of the Recaman sequence are: \" << a << '\\n';\n }\n if (!foundDup && alreadyUsed) {\n cout << \"The first duplicated term is a[\" << n << \"] = \" << next << '\\n';\n foundDup = true;\n }\n if (used1000.size() == 1001) {\n cout << \"Terms up to a[\" << n << \"] are needed to generate 0 to 1000\\n\";\n }\n n++;\n }\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\n\nnamespace RecamanSequence {\n class Program {\n static void Main(string[] args) {\n List<int> a = new List<int>() { 0 };\n HashSet<int> used = new HashSet<int>() { 0 };\n HashSet<int> used1000 = new HashSet<int>() { 0 };\n bool foundDup = false;\n int n = 1;\n while (n <= 15 || !foundDup || used1000.Count < 1001) {\n int next = a[n - 1] - n;\n if (next < 1 || used.Contains(next)) {\n next += 2 * n;\n }\n bool alreadyUsed = used.Contains(next);\n a.Add(next);\n if (!alreadyUsed) {\n used.Add(next);\n if (0 <= next && next <= 1000) {\n used1000.Add(next);\n }\n }\n if (n == 14) {\n Console.WriteLine(\"The first 15 terms of the Recaman sequence are: [{0}]\", string.Join(\", \", a));\n }\n if (!foundDup && alreadyUsed) {\n Console.WriteLine(\"The first duplicated term is a[{0}] = {1}\", n, next);\n foundDup = true;\n }\n if (used1000.Count == 1001) {\n Console.WriteLine(\"Terms up to a[{0}] are needed to generate 0 to 1000\", n);\n }\n n++;\n }\n }\n }\n}\n","language":"C-sharp"},{"code":"% Recaman sequence\nrecaman = cluster is new, fetch\n rep = array[int]\n\n new = proc () returns (cvt)\n a: rep := rep$predict(0,1000000)\n rep$addh(a,0)\n return(a)\n end new\n\n % Find the N'th element of the Recaman sequence\n fetch = proc (a: cvt, n: int) returns (int)\n if n > rep$high(a) then extend(a,n) end\n return(a[n])\n end fetch\n\n % See if N has already been generated\n prev = proc (a: rep, n: int) returns (bool)\n for el: int in rep$elements(a) do\n if el = n then return(true) end\n end\n return(false)\n end prev\n\n % Generate members of the sequence until 'top' is reached\n extend = proc (a: rep, top: int)\n while rep$high(a) < top do\n n: int := rep$high(a) + 1\n sub: int := a[n-1] - n\n add: int := a[n-1] + n\n if sub>0 cand ~prev(a, sub)\n then rep$addh(a, sub)\n else rep$addh(a, add)\n end\n end\n end extend\nend recaman\n\n\nstart_up = proc ()\n po: stream := stream$primary_output()\n A: recaman := recaman$new()\n\n % Print the first 15 members\n stream$puts(po, \"First 15 items:\")\n for i: int in int$from_to(0, 14) do\n stream$puts(po, \" \" || int$unparse(A[i]))\n end\n\n % Find the first duplicated number\n begin\n i: int := 0\n while true do\n i := i + 1\n for j: int in int$from_to(0, i-1) do\n if A[i]=A[j] then exit found(i, A[i]) end\n end\n end\n end except when found(i, n: int):\n stream$putl(po, \"\\nFirst duplicated number: A(\"\n || int$unparse(i) || \") = \" || int$unparse(n))\n end\n\n % Find the amount of terms needed to generate all integers 0..1000\n begin\n seen: array[bool] := array[bool]$fill(0,1001,false)\n left: int := 1001\n n: int := -1\n while left > 0 do\n n := n + 1\n if A[n] <= 1000 cand ~seen[A[n]] then\n left := left - 1\n seen[A[n]] := true\n end\n end\n stream$putl(po, \"Terms needed to generate [0..1000]: \"\n || int$unparse(n))\n end\nend start_up\n","language":"CLU"},{"code":" IDENTIFICATION DIVISION.\n PROGRAM-ID. RECAMAN.\n\n DATA DIVISION.\n WORKING-STORAGE SECTION.\n 01 RECAMAN-SEQUENCE COMP.\n 02 A PIC 999 OCCURS 99 TIMES INDEXED BY I.\n 02 N PIC 999 VALUE 0.\n\n 01 VARIABLES COMP.\n 02 ADDC PIC S999.\n 02 SUBC PIC S999.\n 02 SPTR PIC 99 VALUE 1.\n\n 01 OUTPUT-FORMAT.\n 02 OUTI PIC Z9.\n 02 OUTN PIC BZ9.\n 02 OUTS PIC X(79).\n\n PROCEDURE DIVISION.\n BEGIN.\n PERFORM GENERATE-NEXT-ITEM 15 TIMES.\n PERFORM COLLATE-ITEM VARYING I FROM 1 BY 1\n UNTIL I IS GREATER THAN 15.\n DISPLAY 'First 15 items:' OUTS.\n\n FIND-REPEATING.\n PERFORM GENERATE-NEXT-ITEM.\n SET I TO 1.\n SEARCH A VARYING I\n WHEN I IS NOT LESS THAN N\n NEXT SENTENCE\n WHEN A(I) IS EQUAL TO A(N)\n SUBTRACT 1 FROM N GIVING OUTI\n MOVE A(N) TO OUTN\n DISPLAY 'First repeated item: A(' OUTI ') =' OUTN\n STOP RUN.\n GO TO FIND-REPEATING.\n\n GENERATE-NEXT-ITEM.\n IF N IS EQUAL TO ZERO\n MOVE ZERO TO A(1)\n ELSE\n ADD N, A(N) GIVING ADDC\n SUBTRACT N FROM A(N) GIVING SUBC\n IF SUBC IS NOT GREATER THAN ZERO\n MOVE ADDC TO A(N + 1)\n ELSE\n SET I TO 1\n SEARCH A VARYING I\n WHEN I IS NOT LESS THAN N\n MOVE SUBC TO A(N + 1)\n WHEN A(I) IS EQUAL TO SUBC\n MOVE ADDC TO A(N + 1).\n ADD 1 TO N.\n\n COLLATE-ITEM.\n MOVE A(I) TO OUTN.\n STRING OUTN DELIMITED BY SIZE INTO OUTS WITH POINTER SPTR.\n","language":"COBOL"},{"code":"0010 DIM a#(0:100)\n0020 //\n0030 // Print the first 15 items\n0040 PRINT \"First 15 items: \",\n0050 FOR i#:=0 TO 14 DO PRINT reca#(i#);\n0060 PRINT\n0070 //\n0080 // Find and print the first repeated item\n0090 i#:=15\n0100 WHILE NOT find#(i#,reca#(i#)) DO i#:+1\n0110 PRINT \"First repeated item: A(\",i#,\") = \",a#(i#)\n0120 //\n0130 // Generate the n'th member of the Recaman sequence\n0140 FUNC reca#(n#)\n0150 IF n#=0 THEN RETURN 0\n0160 a#(n#):=a#(n#-1)-n#\n0180 IF a#(n#)<=0 OR find#(n#,a#(n#)) THEN a#(n#):=a#(n#-1)+n#\n0190 RETURN a#(n#)\n0200 ENDFUNC reca#\n0210 //\n0220 // See if a number occurs before the n'th member of the Recaman sequence\n0230 FUNC find#(n#,num#)\n0240 FOR x#:=0 TO n#-1 DO IF a#(x#)=num# THEN RETURN x#\n0250 RETURN 0\n0260 ENDFUNC find#\n0270 END\n","language":"Comal"},{"code":"import std.stdio;\n\nvoid main() {\n int[] a;\n bool[int] used;\n bool[int] used1000;\n bool foundDup;\n\n a ~= 0;\n used[0] = true;\n used1000[0] = true;\n\n int n = 1;\n while (n <= 15 || !foundDup || used1000.length < 1001) {\n int next = a[n - 1] - n;\n if (next < 1 || (next in used) !is null) {\n next += 2 * n;\n }\n bool alreadyUsed = (next in used) !is null;\n a ~= next;\n if (!alreadyUsed) {\n used[next] = true;\n if (0 <= next && next <= 1000) {\n used1000[next] = true;\n }\n }\n if (n == 14) {\n writeln(\"The first 15 terms of the Recaman sequence are: \", a);\n }\n if (!foundDup && alreadyUsed) {\n writefln(\"The first duplicated term is a[%d] = %d\", n, next);\n foundDup = true;\n }\n if (used1000.length == 1001) {\n writefln(\"Terms up to a[%d] are needed to generate 0 to 1000\", n);\n }\n n++;\n }\n}\n","language":"D"},{"code":"proc nonrec find([*] int A; word top; int n) bool:\n word i;\n bool found;\n i := 0;\n found := false;\n while i < top and not found do\n found := A[i] = n;\n i := i + 1\n od;\n found\ncorp\n\nproc nonrec gen_next([*] int A; word n) int:\n int add, sub;\n add := A[n-1] + n;\n sub := A[n-1] - n;\n A[n] :=\n if sub > 0 and not find(A, n, sub)\n then sub\n else add\n fi;\n A[n]\ncorp\n\nproc nonrec main() void:\n [30] int A;\n word i;\n\n A[0] := 0;\n write(\"First 15 items: 0\");\n for i from 1 upto 14 do write(gen_next(A, i):3) od;\n writeln();\n\n while not find(A, i, gen_next(A, i)) do i := i + 1 od;\n writeln(\"First repeated item: A(\", i:2, \") = \", A[i]:2)\ncorp\n","language":"Draco"},{"code":"arrbase a[] 0\narrbase seen[] 0\nlen seen[] 100\n#\na[] &= 0\nseen[0] = 1\ni = 1\nrepeat\n h = a[i - 1] - i\n if h <= 0 or seen[h] = 1\n h = a[i - 1] + i\n .\n until seen[h] = 1\n seen[h] = 1\n a[] &= h\n if i = 14\n print a[]\n .\n i += 1\n.\nprint h\n","language":"EasyLang"},{"code":"01.10 T \"FIRST 15\"\n01.20 F N=0,14;D 2;T %2,A(N)\n01.30 T !\"FIRST REPEATED\"\n01.40 D 2;S Y=1\n01.50 F M=0,N-1;S Y=Y*(A(M)-A(N))\n01.60 I (Y)1.7,1.8,1.7\n01.70 S N=N+1;G 1.4\n01.80 T A(N),\" AT A(\",N,\")\"!\n01.90 Q\n\n02.05 I (N)2.1,2.06,2.1\n02.06 A(0)=0;R\n02.10 S X=A(N-1)-N\n02.20 I (X)2.7\n02.30 S Y=1\n02.40 F M=0,N-1;S Y=Y*(A(M)-X)\n02.50 I (Y)2.6,2.7,2.6\n02.60 S A(N)=X;R\n02.70 S A(N)=A(N-1)+N\n","language":"FOCAL"},{"code":": array ( n -- ) ( i -- addr)\n create cells allot\n does> swap cells + ;\n\n100 array sequence\n\n: sequence. ( n -- ) cr 0 ?do i sequence @ . loop ;\n\n: ?unused ( n -- t | n )\n 100 0 ?do\n dup i sequence @ = if unloop exit then\n loop drop true ;\n\n: sequence-next ( n -- a[n] )\n dup 0= if 0 0 sequence ! exit then ( case a[0]=0 )\n dup dup 1- sequence @ swap - ( a[n]=a[n-1]-n )\n dup dup 0> swap ?unused true = and if\n nip exit then drop\n dup 1- sequence @ swap + ; ( a[n]=a[n-1]+n )\n\n: sequence-gen ( n -- )\n 0 ?do i sequence-next i sequence ! loop ;\n\n: sequence-repeated\n 100 0 ?do\n i 0 ?do\n i sequence @ j sequence @ = if\n cr .\" first repeated : a[\" i . .\" ]=a[\" j . .\" ]=\" i sequence @ . unloop unloop exit then\n loop\n loop ;\n\n100 sequence-gen\n15 sequence.\nsequence-repeated\n","language":"Forth"},{"code":"' version 26-01-2019\n' compile with: fbc -s console\n\nDim As UByte used()\nDim As Integer sum, temp\nDim As UInteger n, max, count, i\n\nmax = 1000 : ReDim used(max)\n\nPrint \"The first 15 terms are 0\";\n\nFor n = 0 To 14\n temp = sum - n\n If temp < 1 OrElse used(temp) = 1 Then\n temp = sum + n\n End If\n If temp <= max Then used(temp) = 1\n sum = temp\n Print sum;\nNext\n\n\nsum = 0 : max = 1000 : ReDim used(max)\nPrint : Print\n\nFor n = 0 To 50\n temp = sum - n\n If temp < 1 OrElse used(temp) = 1 Then\n temp = sum + n\n End If\n If used(temp) = 1 Then\n Print \"First duplicated number is a(\" + Str(n) + \")\"\n Exit For\n End If\n If temp <= max Then used(temp) = 1\n sum = temp\nNext\n\n\nsum = 0 : max = 2000000 : ReDim used(max)\nPrint : Print\n\nFor n = 0 To max\n temp = sum - n\n If temp < 1 OrElse used(temp) = 1 Then\n temp = sum + n\n End If\n If temp <= max Then used(temp) = 1\n If i = temp Then\n While used(i) = 1\n i += 1\n If i > 1000 Then\n Exit For\n End If\n Wend\n End If\n sum = temp\n count += 1\nNext\n\nPrint \"All integers from 0 to 1000 are generated in \" & count & \" terms\"\nPrint\n\n' empty keyboard buffer\nWhile Inkey <> \"\" : Wend\nPrint : Print \"hit any key to end program\"\nSleep\nEnd\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\nfunc main() {\n a := []int{0}\n used := make(map[int]bool, 1001)\n used[0] = true\n used1000 := make(map[int]bool, 1001)\n used1000[0] = true\n for n, foundDup := 1, false; n <= 15 || !foundDup || len(used1000) < 1001; n++ {\n next := a[n-1] - n\n if next < 1 || used[next] {\n next += 2 * n\n }\n alreadyUsed := used[next]\n a = append(a, next)\n\n if !alreadyUsed {\n used[next] = true\n if next >= 0 && next <= 1000 {\n used1000[next] = true\n }\n }\n\n if n == 14 {\n fmt.Println(\"The first 15 terms of the Recaman's sequence are:\", a)\n }\n\n if !foundDup && alreadyUsed {\n fmt.Printf(\"The first duplicated term is a[%d] = %d\\n\", n, next)\n foundDup = true\n }\n\n if len(used1000) == 1001 {\n fmt.Printf(\"Terms up to a[%d] are needed to generate 0 to 1000\\n\", n)\n }\n }\n}\n","language":"Go"},{"code":"recaman :: Int -> [Int]\nrecaman n = fst <$> reverse (go n)\n where\n go 0 = []\n go 1 = [(0, 1)]\n go x =\n let xs@((r, i):_) = go (pred x)\n back = r - i\n in ( if 0 < back && not (any ((back ==) . fst) xs)\n then back\n else r + i\n , succ i) :\n xs\n\nmain :: IO ()\nmain = print $ recaman 15\n","language":"Haskell"},{"code":"import Data.Set (Set, fromList, insert, isSubsetOf, member, size)\nimport Data.Bool (bool)\n\nfirstNRecamans :: Int -> [Int]\nfirstNRecamans n = reverse $ recamanUpto (\\(_, i, _) -> n == i)\n\nfirstDuplicateR :: Int\nfirstDuplicateR = head $ recamanUpto (\\(rs, _, set) -> size set /= length rs)\n\nrecamanSuperset :: Set Int -> [Int]\nrecamanSuperset setInts =\n tail $ recamanUpto (\\(_, _, setR) -> isSubsetOf setInts setR)\n\nrecamanUpto :: (([Int], Int, Set Int) -> Bool) -> [Int]\nrecamanUpto p = rs\n where\n (rs, _, _) =\n until\n p\n (\\(rs@(r:_), i, seen) ->\n let n = nextR seen i r\n in (n : rs, succ i, insert n seen))\n ([0], 1, fromList [0])\n\nnextR :: Set Int -> Int -> Int -> Int\nnextR seen i r =\n let back = r - i\n in bool back (r + i) (0 > back || member back seen)\n\n-- TEST ---------------------------------------------------------------\nmain :: IO ()\nmain =\n (putStrLn . unlines)\n [ \"First 15 Recamans:\"\n , show $ firstNRecamans 15\n , []\n , \"First duplicated Recaman:\"\n , show firstDuplicateR\n , []\n , \"Length of Recaman series required to include [0..1000]:\"\n , (show . length . recamanSuperset) $ fromList [0 .. 1000]\n ]\n","language":"Haskell"},{"code":"import Data.List (find, findIndex, nub)\nimport Data.Maybe (fromJust)\nimport Data.Set (Set, fromList, insert, isSubsetOf, member)\n\n--- INFINITE STREAM OF RECAMAN SERIES OF GROWING LENGTH --\nrSeries :: [[Int]]\nrSeries =\n scanl\n ( \\rs@(r : _) i ->\n let back = r - i\n nxt\n | 0 > back || elem back rs = r + i\n | otherwise = back\n in nxt : rs\n )\n [0]\n [1 ..]\n\n----------- INFINITE STREAM OF RECAMAN-GENERATED ---------\n--------------- INTEGER SETS OF GROWING SIZE -------------\nrSets :: [(Set Int, Int)]\nrSets =\n scanl\n ( \\(seen, r) i ->\n let back = r - i\n nxt\n | 0 > back || member back seen = r + i\n | otherwise = back\n in (insert nxt seen, nxt)\n )\n (fromList [0], 0)\n [1 ..]\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain = do\n let setK = fromList [0 .. 1000]\n (putStrLn . unlines)\n [ \"First 15 Recamans:\",\n show . reverse . fromJust $ find ((15 ==) . length) rSeries,\n [],\n \"First duplicated Recaman:\",\n show . head . fromJust $ find ((/=) <$> length <*> (length . nub)) rSeries,\n [],\n \"Length of Recaman series required to include [0..1000]:\",\n show . fromJust $ findIndex (\\(setR, _) -> isSubsetOf setK setR) rSets\n ]\n","language":"Haskell"},{"code":"average =: +/ % #\nNB. extra_data u Bsearch bounds\nNB. Bsearch returns narrowed bounds depending if u return 0 (left) or 1 (right)\nNB. u is called as extra_data u index\nNB. or as index u index\nNB. u is invoked as a dyad\nBsearch =: 1 :'((0 1 + (u <.@:average)) { ({. , <.@:average, {:)@:])^:_'\n","language":"J"},{"code":"import java.util.ArrayList;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Set;\n\npublic class RecamanSequence {\n public static void main(String[] args) {\n List<Integer> a = new ArrayList<>();\n a.add(0);\n\n Set<Integer> used = new HashSet<>();\n used.add(0);\n\n Set<Integer> used1000 = new HashSet<>();\n used1000.add(0);\n\n boolean foundDup = false;\n int n = 1;\n while (n <= 15 || !foundDup || used1000.size() < 1001) {\n int next = a.get(n - 1) - n;\n if (next < 1 || used.contains(next)) {\n next += 2 * n;\n }\n boolean alreadyUsed = used.contains(next);\n a.add(next);\n if (!alreadyUsed) {\n used.add(next);\n if (0 <= next && next <= 1000) {\n used1000.add(next);\n }\n }\n if (n == 14) {\n System.out.printf(\"The first 15 terms of the Recaman sequence are : %s\\n\", a);\n }\n if (!foundDup && alreadyUsed) {\n System.out.printf(\"The first duplicate term is a[%d] = %d\\n\", n, next);\n foundDup = true;\n }\n if (used1000.size() == 1001) {\n System.out.printf(\"Terms up to a[%d] are needed to generate 0 to 1000\\n\", n);\n }\n n++;\n }\n }\n}\n","language":"Java"},{"code":"(() => {\n const main = () => {\n\n console.log(\n 'First 15 Recaman:\\n' +\n recamanUpto(i => 15 === i)\n );\n\n console.log(\n '\\n\\nFirst duplicated Recaman:\\n' +\n last(recamanUpto(\n (_, set, rs) => set.size !== rs.length\n ))\n );\n\n const setK = new Set(enumFromTo(0, 1000));\n console.log(\n '\\n\\nNumber of Recaman terms needed to generate' +\n '\\nall integers from [0..1000]:\\n' +\n (recamanUpto(\n (_, setR) => isSubSetOf(setK, setR)\n ).length - 1)\n );\n };\n\n // RECAMAN --------------------------------------------\n\n // recamanUpto :: (Int -> Set Int > [Int] -> Bool) -> [Int]\n const recamanUpto = p => {\n let\n i = 1,\n r = 0, // First term of series\n rs = [r];\n const seen = new Set(rs);\n while (!p(i, seen, rs)) {\n r = nextR(seen, i, r);\n seen.add(r);\n rs.push(r);\n i++;\n }\n return rs;\n }\n\n // Next Recaman number.\n\n // nextR :: Set Int -> Int -> Int\n const nextR = (seen, i, n) => {\n const back = n - i;\n return (0 > back || seen.has(back)) ? (\n n + i\n ) : back;\n };\n\n // GENERIC --------------------------------------------\n\n // enumFromTo :: Int -> Int -> [Int]\n const enumFromTo = (m, n) =>\n m <= n ? iterateUntil(\n x => n <= x,\n x => 1 + x,\n m\n ) : [];\n\n // isSubsetOf :: Ord a => Set a -> Set a -> Bool\n const isSubSetOf = (a, b) => {\n for (let x of a) {\n if (!b.has(x)) return false;\n }\n return true;\n };\n\n // iterateUntil :: (a -> Bool) -> (a -> a) -> a -> [a]\n const iterateUntil = (p, f, x) => {\n const vs = [x];\n let h = x;\n while (!p(h))(h = f(h), vs.push(h));\n return vs;\n };\n\n // last :: [a] -> a\n const last = xs =>\n 0 < xs.length ? xs.slice(-1)[0] : undefined;\n\n // MAIN ------------------------------------------------\n return main();\n})();\n","language":"JavaScript"},{"code":"# Let R[n] be the Recaman sequence, n >= 0, so R[0]=0.\n# Input: a number, $required, specifying the required range of integers, [1 .. $required]\n# to be covered by R[0] ... R[.n]\n# $capture: the number of elements of the sequence to retain.\n# Output: an object as described below.\n# Note that .a|length will be equal to $capture.\n#\ndef recaman_required($capture):\n . as $required\n | {\n n: 0,\n current: 0, # R[.n]\n previous: null, # R[.n-1]\n a: [0], # only maintained up to a[$capture-1]\n used: { \"0\": true }, # hash for checking whether a value has already occurred\n found: { \"0\": true }, # hash for checking how many in [0 .. $required] inclusive have been found\n nfound: 1, # .found|length\n foundDup: null, # the first duplicated entry in the sequence\n foundDupAt: null # .foundDup == R[.foundDupAt]\n }\n | until ((.n >= $capture) and .foundDup and (.nfound > $required);\n .n += 1\n | .current -= .n\n | if (.current < 1 or .used[.current|tostring]) then .current = .current + 2*.n else . end\n | (.current|tostring) as $s\n | .used[$s] as $alreadyUsed\n | if .n < $capture then .a += [.current] else . end\n | if ($alreadyUsed|not)\n then .used[$s] = true\n\t| if (.current >= 0 and .current <= $required)\n\t then .found[$s] = true | .nfound+=1\n\t else . end\n else .\n\tend\n | if (.foundDup|not) and $alreadyUsed\n then .foundDup = .current\n\t| .foundDupAt = .n\n else .\n\tend );\n\t\n1000 as $required\n| 15 as $capture\n| $required | recaman_required($capture)\n| \"The first \\($capture) terms of Recaman's sequence are: \\(.a)\",\n \"The first duplicated term is a[\\(.foundDupAt)] = \\(.foundDup)\",\n \"Terms up to a[\\(.n)] are needed to generate 0 to \\($required) inclusive.\"\n","language":"Jq"},{"code":"# Output: the stream of elements in the Recaman sequence, beginning with 0.\ndef recaman:\n 0,\n foreach range(1; infinite) as $i ({used: {\"0\": true}, current: 0};\n (.current - $i) as $next\n | .current = (if ($next < 1 or .used[$next|tostring]) then $next + 2 * $i else $next end)\n | .used[.current|tostring] = true;\n .current );\n\n# emit [.i, $x] for duplicated terms using IO==0\ndef duplicated(s):\n foreach s as $x ({used: {}, i: -1};\n .i += 1\n | ($x|tostring) as $xs\n | if .used[$xs] then .emit = [.i, $x] else .used[$xs] = true end;\n select(.emit) | .emit);\n\n# Input: an integer, $required\n# s: a stream of non-negative integers\n# Output: the index of the item in the stream s at which the stream up to and including\n# that item includes all integers in the closed interval [0 .. $required].\n#\ndef covers(s):\n . as $required\n | first(foreach s as $x ( { i: -1, found: {}, nfound: 0};\n .i += 1\n\t | ($x|tostring) as $xs\n | if .found[$xs] then .\n\t elif $x <= $required\n\t then .found[$xs] = true | .nfound += 1\n\t | if .nfound > $required then .emit=.i else . end\n\t else .\n\t end;\n select(.emit).emit) );\n","language":"Jq"},{"code":"\"First 15:\", limit(15; recaman),\n\n\"\\First duplicated:\", first(duplicated(recaman)),\n\n\"\\Index of first element to include 0 to 1000 inclusive:\",\n(1000|covers(recaman))\n","language":"Jq"},{"code":"function recaman()\n a = Vector{Int}([0])\n used = Dict{Int, Bool}(0 => true)\n used1000 = Set(0)\n founddup = false\n termcount = 1\n while length(used1000) <= 1000\n nextterm = a[termcount] - termcount\n if nextterm < 1 || haskey(used, nextterm)\n nextterm += termcount + termcount\n end\n push!(a, nextterm)\n if !haskey(used, nextterm)\n used[nextterm] = true\n if 1 <= nextterm <= 1000\n push!(used1000, nextterm)\n end\n elseif !founddup\n println(\"The first duplicated term is a[$(termcount + 1)] = $nextterm.\")\n founddup = true\n end\n if termcount == 14\n println(\"The first 15 terms of the Recaman sequence are $a\")\n end\n termcount += 1\n end\n println(\"Terms up to $(termcount - 1) are needed to generate 0 to 1000.\")\nend\n\nrecaman()\n","language":"Julia"},{"code":"// Version 1.2.60\n\nfun main(args: Array<String>) {\n val a = mutableListOf(0)\n val used = mutableSetOf(0)\n val used1000 = mutableSetOf(0)\n var foundDup = false\n var n = 1\n while (n <= 15 || !foundDup || used1000.size < 1001) {\n var next = a[n - 1] - n\n if (next < 1 || used.contains(next)) next += 2 * n\n val alreadyUsed = used.contains(next)\n a.add(next)\n if (!alreadyUsed) {\n used.add(next)\n if (next in 0..1000) used1000.add(next)\n }\n if (n == 14) {\n println(\"The first 15 terms of the Recaman's sequence are: $a\")\n }\n if (!foundDup && alreadyUsed) {\n println(\"The first duplicated term is a[$n] = $next\")\n foundDup = true\n }\n if (used1000.size == 1001) {\n println(\"Terms up to a[$n] are needed to generate 0 to 1000\")\n }\n n++\n }\n}\n","language":"Kotlin"},{"code":"local a = {[0]=0}\nlocal used = {[0]=true}\nlocal used1000 = {[0]=true}\nlocal foundDup = false\nlocal n = 1\n\nwhile n<=15 or not foundDup or #used1000<1001 do\n local nxt = a[n - 1] - n\n if nxt<1 or used[nxt] ~= nil then\n nxt = nxt + 2 * n\n end\n local alreadyUsed = used[nxt] ~= nil\n table.insert(a, nxt)\n if not alreadyUsed then\n used[nxt] = true\n if 0<=nxt and nxt<=1000 then\n used1000[nxt] = true\n end\n end\n if n==14 then\n io.write(\"The first 15 terms of the Recaman sequence are:\")\n for k=0,#a do\n io.write(\" \"..a[k])\n end\n print()\n end\n if not foundDup and alreadyUsed then\n print(\"The first duplicated term is a[\"..n..\"] = \"..nxt)\n foundDup = true\n end\n if #used1000 == 1001 then\n print(\"Terms up to a[\"..n..\"] are needed to generate 0 to 1000\")\n end\n n = n + 1\nend\n","language":"Lua"},{"code":" NORMAL MODE IS INTEGER\n VECTOR VALUES ELEMF = $2HA(,I2,4H) = ,I2*$\n DIMENSION A(100)\n A(0) = 0\n\n PRINT COMMENT $ FIRST 15 ELEMENTS$\n PRINT FORMAT ELEMF,0,0\n THROUGH EL, FOR I=1, 1, I.GE.15\nEL PRINT FORMAT ELEMF,I,NEXT.(I)\n\n PRINT COMMENT $ $\n PRINT COMMENT $ FIRST REPEATED ELEMENT$\nRPT THROUGH RPT, FOR I=I, 1, FIND.(I,NEXT.(I))\n PRINT FORMAT ELEMF,I,A(I)\n\n INTERNAL FUNCTION(N,TOP)\n ENTRY TO FIND.\n FI=0\nSRCH WHENEVER FI.GE.TOP, FUNCTION RETURN 0B\n WHENEVER A(FI).E.N, FUNCTION RETURN 1B\n FI=FI+1\n TRANSFER TO SRCH\n END OF FUNCTION\n\n INTERNAL FUNCTION(N)\n ENTRY TO NEXT.\n HI=A(N-1)+N\n LO=A(N-1)-N\n WHENEVER LO.L.0\n A(N)=HI\n OR WHENEVER FIND.(LO,N)\n A(N)=HI\n OTHERWISE\n A(N)=LO\n END OF CONDITIONAL\n FUNCTION RETURN A(N)\n END OF FUNCTION\n END OF PROGRAM\n","language":"MAD"},{"code":"ClearAll[f]\nf[s_List] := Block[{a = s[[-1]], len = Length@s},\n Append[s, If[a > len && ! MemberQ[s, a - len], a - len, a + len]]]; g = Nest[f, {0}, 70]\ng = Nest[f, {0}, 70];\nTake[g, 15]\np = Select[Tally[g], Last /* EqualTo[2]][[All, 1]]\np = Flatten[Position[g, #]] & /@ p;\nTakeSmallestBy[p, Last, 1][[1]]\n","language":"Mathematica"},{"code":"' Recaman's sequence - smallbasic - 05/08/2015\n nn=15\n TextWindow.WriteLine(\"Recaman's sequence for the first \" + nn + \" numbers:\")\n recaman()\n TextWindow.WriteLine(Text.GetSubTextToEnd(recaman,2))\n nn=\"firstdup\"\n recaman()\n TextWindow.WriteLine(\"The first duplicated term is a[\"+n+\"]=\"+a[n])\n\nSub recaman\n a=\"\"\n b=\"\"\n dup=\"\"\n recaman=\"\"\n firstdup=\"\"\n If nn=\"firstdup\" Then\n nn=1000\n firstdup=\"True\"\n EndIf\n For n=0 To nn-1\n ap=a[n-1]+n\n If a[n-1]<=n Then\n a[n]=ap 'a[n]=a[n-1]+n\n b[ap]=1\n Else\n am=a[n-1]-n\n If b[am]=1 Then\n a[n]=ap 'a[n]=a[n-1]+n\n b[ap]=1\n Else\n a[n]=am 'a[n]=a[n-1]-n\n b[am]=1\n EndIf\n EndIf\n If firstdup Then\n If dup[a[n]]=1 Then\n Goto exitsub\n EndIf\n dup[a[n]]=1\n EndIf\n recaman=recaman+\",\"+a[n]\n EndFor\n exitsub:\nEndSub\n","language":"Microsoft-Small-Basic"},{"code":"10 DIM A(100)\n20 PRINT \"FIRST 15 TERMS:\"\n30 FOR N=0 TO 14\n40 GOSUB 170\n50 PRINT A(N);\" \";\n60 NEXT N\n70 PRINT\n80 PRINT \"FIRST REPEATED TERM:\"\n90 GOSUB 170\n100 FOR M=0 TO N-1\n110 IF A(M)=A(N) THEN 150\n120 NEXT M\n130 LET N=N+1\n140 GOTO 90\n150 PRINT \"A(\";N;\") = \";A(N)\n160 STOP\n170 IF N=0 THEN 280\n180 LET X = A(N-1)-N\n190 IF X<0 THEN 250\n200 FOR M=0 TO N-1\n210 IF A(M)=X THEN 250\n220 NEXT M\n230 LET A(N)=X\n240 RETURN\n250 LET A(N)=A(N-1)+N\n260 RETURN\n270 STOP\n280 LET A(0)=0\n290 RETURN\n300 END\n","language":"Minimal-BASIC"},{"code":"import sequtils, sets, strutils\n\niterator recaman(num: Positive = Natural.high): tuple[n, a: int; duplicate: bool] =\n var a = 0\n yield (0, a, false)\n var known = [0].toHashSet\n for n in 1..<num:\n var next = a - n\n if next <= 0 or next in known:\n next = a + n\n a = next\n yield (n, a, a in known)\n known.incl a\n\necho \"First 15 numbers in Recaman’s sequence: \", toSeq(recaman(15)).mapIt(it.a).join(\" \")\n\nfor (n, a, dup) in recaman():\n if dup:\n echo \"First duplicate found: a($1) = $2\".format(n, a)\n break\n\nvar target = toSeq(0..1000).toHashSet\nfor (n, a, dup) in recaman():\n target.excl a\n if target.card == 0:\n echo \"All numbers from 0 to 1000 generated after $1 terms.\".format(n)\n break\n","language":"Nim"},{"code":"use Collection.Generic;\n\nclass RecamanSequence {\n function : Main(args : String[]) ~ Nil {\n GenerateSequence();\n }\n\n function : native : GenerateSequence() ~ Nil {\n a := Vector->New()<IntHolder>;\n a->AddBack(0);\n\n used := Set->New()<IntHolder>;\n used->Insert(0);\n\n used1000 := Set->New()<IntHolder>;\n used1000->Insert(0);\n\n foundDup := false;\n n := 1;\n while (n <= 15 | <>foundDup | used1000->Size() < 1001) {\n next := a->Get(n - 1) - n;\n if (next < 1 | used->Has(next)) {\n next += 2 * n;\n };\n alreadyUsed := used->Has(next);\n a->AddBack(next);\n if (<>alreadyUsed) {\n used->Insert(next);\n if (0 <= next & next <= 1000) {\n used1000->Insert(next);\n };\n };\n if (n = 14) {\n str := ToString(a);\n \"The first 15 terms of the Recaman sequence are : {$str}\"->PrintLine();\n };\n if (<>foundDup & alreadyUsed) {\n \"The first duplicate term is a[{$n}] := {$next}\"->PrintLine();\n foundDup := true;\n };\n if (used1000->Size() = 1001) {\n \"Terms up to a[{$n}] are needed to generate 0 to 1000\"->PrintLine();\n };\n n++;\n };\n }\n\n function : ToString(a : Vector<IntHolder>) ~ String {\n out := \"[\";\n each(i : a) {\n out += a->Get(i)->Get();\n if(i + 1 < a->Size()) {\n out += ',';\n };\n };\n out += ']';\n\n return out;\n }\n}\n","language":"Objeck"},{"code":"use bignum;\n\n$max = 1000;\n$remaining += $_ for 1..$max;\n\nmy @recamans = 0;\nmy $previous = 0;\n\nwhile ($remaining > 0) {\n $term++;\n my $this = $previous - $term;\n $this = $previous + $term unless $this > 0 and !$seen{$this};\n push @recamans, $this;\n $dup = $term if !$dup and defined $seen{$this};\n $remaining -= $this if $this <= $max and ! defined $seen{$this};\n $seen{$this}++;\n $previous = $this;\n}\n\nprint \"First fifteen terms of Recaman's sequence: \" . join(' ', @recamans[0..14]) . \"\\n\";\nprint \"First duplicate at term: a[$dup]\\n\";\nprint \"Range 0..1000 covered by terms up to a[$term]\\n\";\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">found_duplicate</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #000000;\">used</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span> <span style=\"color: #000080;font-style:italic;\">-- (grows to 1,942,300 entries)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">all_used</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">next</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">prev</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">15</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">found_duplicate</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">all_used</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">1000</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">next</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">prev</span> <span style=\"color: #0000FF;\">-</span> <span style=\"color: #000000;\">n</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">next</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">next</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">used</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">used</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">next</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">next</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">prev</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">n</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">a</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">next</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">padlen</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">next</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">used</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">already_used</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">padlen</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">used</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">next</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">already_used</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">padlen</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">used</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">padlen</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">used</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">next</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">all_used</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">used</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">used</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">all_used</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">all_used</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">15</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"The first 15 terms of the Recaman sequence are: %v\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">already_used</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">found_duplicate</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"The first duplicated term is a[%d] = %d\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">next</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">found_duplicate</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">;</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">all_used</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">1000</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Terms up to a[%d] are needed to generate 0 to 1000\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">});</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">prev</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">next</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n<!--\n","language":"Phix"},{"code":"<?php\n$a = array();\narray_push($a, 0);\n\n$used = array();\narray_push($used, 0);\n\n$used1000 = array();\narray_push($used1000, 0);\n\n$foundDup = false;\n$n = 1;\n\nwhile($n <= 15 || !$foundDup || count($used1000) < 1001) {\n\t$next = $a[$n - 1] - $n;\n\tif ($next < 1 || in_array($next, $used)) {\n\t\t$next += 2 * $n;\n\t}\n\t$alreadyUsed = in_array($next, $used);\n\tarray_push($a, $next);\n\tif (!$alreadyUsed) {\n\t\tarray_push($used, $next);\n\t\tif (0 <= $next && $next <= 1000) {\n\t\t\tarray_push($used1000, $next);\n\t\t}\n\t}\n\tif ($n == 14) {\n\t\techo \"The first 15 terms of the Recaman sequence are : [\";\n\t\tforeach($a as $i => $v) {\n\t\t\tif ( $i == count($a) - 1)\n\t\t\t\techo \"$v\";\n\t\t\telse\n\t\t\t\techo \"$v, \";\n\t\t}\n\t\techo \"]\\n\";\n\t}\n\tif (!$foundDup && $alreadyUsed) {\n\t\tprintf(\"The first duplicate term is a[%d] = %d\\n\", $n, $next);\n\t\t$foundDup = true;\n\t}\n\tif (count($used1000) == 1001) {\n\t\tprintf(\"Terms up to a[%d] are needed to generate 0 to 1000\\n\", $n);\n\t}\n\t$n++;\n}\n","language":"PHP"},{"code":"recaman: procedure options(main);\n declare A(0:30) fixed;\n\n /* is X in the first N terms of the Recaman sequence? */\n find: procedure(x, n) returns(bit);\n declare (x, n, i) fixed;\n do i=0 to n-1;\n if A(i)=x then return('1'b);\n end;\n return('0'b);\n end find;\n\n /* generate the N'th term of the Recaman sequence */\n generate: procedure(n) returns(fixed);\n declare n fixed;\n if n=0 then\n A(0) = 0;\n else do;\n declare (sub, add) fixed;\n sub = A(n-1) - n;\n add = A(n-1) + n;\n /* A(n-1) - n not positive? */\n if sub <= 0 then\n A(n) = add;\n /* A(n-1) - n already generated? */\n else if find(sub, n) then\n A(n) = add;\n else\n A(n) = sub;\n end;\n return(A(n));\n end generate;\n\n declare i fixed;\n put skip list('First 15 members:');\n do i=0 to 14;\n put edit(generate(i)) (F(3));\n end;\n\n put skip list('First repeated term: ');\n do i=15 repeat(i+1) while(^find(generate(i), i)); end;\n put edit('A(',i,') = ',A(i)) (A,F(2),A,F(2));\nend recaman;\n","language":"PL-I"},{"code":"100H:\nBDOS: PROCEDURE(F,A); DECLARE F BYTE, A ADDRESS; GO TO 5; END BDOS;\nEXIT: PROCEDURE; CALL BDOS(0,0); END EXIT;\nPRINT$CH: PROCEDURE(C); DECLARE C BYTE; CALL BDOS(2,C); END PRINT$CH;\nPRINT$STR: PROCEDURE(S); DECLARE S ADDRESS; CALL BDOS(9,S); END PRINT$STR;\n\n/* PRINT NUMBER */\nPRINT$NUM: PROCEDURE(N);\n DECLARE (N, P) ADDRESS, C BASED P BYTE;\n DECLARE S(6) BYTE INITIAL('.....$');\n P = .S(5);\nDIGIT:\n P = P-1;\n C = '0' + N MOD 10;\n N = N/10;\n IF N>0 THEN GO TO DIGIT;\n CALL PRINT$STR(P);\nEND PRINT$NUM;\n\n/* IS X IN THE FIRST N TERMS OF THE SEQUENCE */\nFIND: PROCEDURE(SEQ,X,N) BYTE;\n DECLARE SEQ ADDRESS, (I, X, N, A BASED SEQ) BYTE;\n DO I=0 TO N-1;\n IF A(I)=X THEN RETURN 0FFH;\n END;\n RETURN 0;\nEND FIND;\n\n/* GENERATE THE N'TH TERM OF THE SEQUENCE */\nGENERATE: PROCEDURE(SEQ,N) BYTE;\n DECLARE SEQ ADDRESS, (N, A BASED SEQ) BYTE;\n IF N=0 THEN\n A(N)=0;\n ELSE DO;\n DECLARE (SUB, ADD) BYTE;\n SUB = A(N-1) - N;\n ADD = A(N-1) + N;\n /* A(N-1) - N NEGATIVE? */\n IF A(N-1) <= N THEN\n A(N) = ADD;\n /* A(N-1) - N ALREADY GENERATED? */\n ELSE IF FIND(SEQ,SUB,N) THEN\n A(N) = ADD;\n ELSE\n A(N) = SUB;\n END;\n RETURN A(N);\nEND GENERATE;\n\nDECLARE I BYTE, A(30) BYTE;\nCALL PRINT$STR(.'FIRST 15 MEMBERS: $');\nDO I=0 TO 14;\n CALL PRINT$NUM(GENERATE(.A, I));\n CALL PRINT$CH(' ');\nEND;\nCALL PRINT$STR(.(13,10,'FIRST REPEATED TERM: A($'));\n\nI=15;\nDO WHILE NOT FIND(.A, GENERATE(.A, I), I);\n I = I+1;\nEND;\n\nCALL PRINT$NUM(I);\nCALL PRINT$STR(.') = $');\nCALL PRINT$NUM(A(I));\nCALL PRINT$STR(.(13,10,'$'));\nCALL EXIT;\nEOF\n","language":"PL-M"},{"code":"#MAX=500000\nDim a.i(#MAX)\nDim b.b(1)\nDim c.b(1000)\nFillMemory(@c(),1000,1,#PB_Byte)\n\nIf OpenConsole() : Else : End 1 : EndIf\nFor n_Count=0 To #MAX\n If n_Count=0\n a(n_Count)=0\n ElseIf a(n_Count-1)-n_Count>0 And b(a(n_Count-1)-n_Count)=0\n a(n_Count)=a(n_Count-1)-n_Count\n Else\n a(n_Count)=a(n_Count-1)+n_Count\n EndIf\n If ArraySize(b())<a(n_Count) : ReDim b(a(n_Count)) : EndIf\n If b(a(n_Count))=1 And fitD=0 : fitD=n_Count : EndIf\n b(a(n_Count))=1\n If CompareMemory(@b(),@c(),1000) And fit1000=0 : fit1000=n_Count : Break : EndIf\nNext\n\nPrint(\"First 15 terms: \") : For i=0 To 14 : Print(RSet(Str(a(i)),4)) : Next : PrintN(\"\")\nPrintN(\"First duplicate term : a(\"+Str(fitD)+\") = \"+Str(a(fitD)))\nPrintN(\"Number of Recaman terms needed to generate all integers from [0..1000]: \"+Str(fit1000))\nInput()\nEnd\n","language":"PureBasic"},{"code":"from itertools import islice\n\nclass Recamans():\n \"Recamán's sequence generator callable class\"\n def __init__(self):\n self.a = None # Set of results so far\n self.n = None # n'th term (counting from zero)\n\n def __call__(self):\n \"Recamán's sequence generator\"\n nxt = 0\n a, n = {nxt}, 0\n self.a = a\n self.n = n\n yield nxt\n while True:\n an1, n = nxt, n + 1\n nxt = an1 - n\n if nxt < 0 or nxt in a:\n nxt = an1 + n\n a.add(nxt)\n self.n = n\n yield nxt\n\nif __name__ == '__main__':\n recamans = Recamans()\n print(\"First fifteen members of Recamans sequence:\",\n list(islice(recamans(), 15)))\n\n so_far = set()\n for term in recamans():\n if term in so_far:\n print(f\"First duplicate number in series is: a({recamans.n}) = {term}\")\n break\n so_far.add(term)\n\n n = 1_000\n setn = set(range(n + 1)) # The target set of numbers to be covered\n for _ in recamans():\n if setn.issubset(recamans.a):\n print(f\"Range 0 ..{n} is covered by terms up to a({recamans.n})\")\n break\n","language":"Python"},{"code":"'''Recaman sequence'''\n\n\n# recamanUntil :: (Int -> Set Int > [Int] -> Bool) -> [Int]\ndef recamanUntil(p):\n '''All terms of the Recaman series before the\n first term for which the predicate p holds.'''\n n = 1\n r = 0 # First term of series\n rs = [r]\n seen = set(rs)\n blnNew = True\n while not p(seen, n, r, blnNew):\n r = recamanSucc(seen, n, r)\n blnNew = r not in seen\n seen.add(r)\n rs.append(r)\n n = 1 + n\n return rs\n\n\n# recamanSucc :: Set Int -> Int -> Int\ndef recamanSucc(seen, n, r):\n '''The successor for a given Recaman term,\n given the set of Recaman terms seen so far.'''\n back = r - n\n return n + r if 0 > back or (back in seen) else back\n\n\n# ------------------------- TEST -------------------------\n# main :: IO ()\ndef main():\n '''Test'''\n print(\n 'First 15 Recaman:\\r',\n recamanUntil(\n lambda seen, n, r, _: 15 == n\n )\n )\n print(\n 'First duplicated Recaman:\\r',\n recamanUntil(\n lambda seen, n, r, blnNew: not blnNew\n )[-1]\n )\n setK = set(enumFromTo(0)(1000))\n print(\n 'Number of Recaman terms needed to generate',\n 'all integers from [0..1000]:\\r',\n len(recamanUntil(\n lambda seen, n, r, blnNew: (\n blnNew and 1001 > r and setK.issubset(seen)\n )\n )) - 1\n )\n\n\n# ----------------------- GENERIC ------------------------\n\n# enumFromTo :: (Int, Int) -> [Int]\ndef enumFromTo(m):\n '''Integer enumeration from m to n.'''\n return lambda n: range(m, 1 + n)\n\n\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"'''Recaman by iteration of a function over a tuple.'''\n\nfrom itertools import (islice)\n\n\n# recamanTupleSucc :: Set Int -> (Int, Int, Bool) -> (Int, Int, Bool)\ndef recamanTupleSucc(seen):\n '''The Nth in a series of Recaman tuples,\n (N, previous term, boolPreviouslySeen?)\n given the set of all terms seen so far.'''\n def go(n, r, _):\n back = r - n\n nxt = n + r if 0 > back or (back in seen) else back\n bln = nxt in seen\n seen.add(nxt)\n return (1 + n, nxt, bln)\n return lambda tpl: go(*tpl)\n\n\n# ------------------------- TEST -------------------------\n# main :: IO()\ndef main():\n '''First 15, and first duplicated Recaman.'''\n f = recamanTupleSucc(set([0]))\n print(\n 'First 15 Recaman:\\n',\n list(map(\n snd,\n take(15)(iterate(f)((1, 0, False)))\n ))\n )\n f = recamanTupleSucc(set([0]))\n print(\n 'First duplicated Recaman:\\n',\n until(lambda x: x[2])(f)(\n (1, 0, False)\n )[1]\n )\n\n sk = set(enumFromTo(0)(1000))\n sr = set([0])\n f = recamanTupleSucc(sr)\n print(\n 'Number of Recaman terms needed to generate',\n 'all integers from [0..1000]:\\n',\n until(\n lambda x: not x[2] and 1001 > x[1] and sk.issubset(sr)\n )(f)(\n (1, 0, False)\n )[0] - 1\n )\n\n\n# ----------------- GENERIC ABSTRACTIONS -----------------\n\n# enumFromTo :: (Int, Int) -> [Int]\ndef enumFromTo(m):\n '''Integer enumeration from m to n.'''\n return lambda n: range(m, 1 + n)\n\n\n# iterate :: (a -> a) -> a -> Gen [a]\ndef iterate(f):\n '''An infinite list of repeated\n applications of f to x.\n '''\n def go(x):\n v = x\n while True:\n yield v\n v = f(v)\n return go\n\n\n# snd :: (a, b) -> b\ndef snd(tpl):\n '''Second component of a tuple.'''\n return tpl[1]\n\n\n# take :: Int -> [a] -> [a]\n# take :: Int -> String -> String\ndef take(n):\n '''The prefix of xs of length n,\n or xs itself if n > length xs.'''\n return lambda xs: (\n xs[0:n]\n if isinstance(xs, list)\n else islice(xs, n)\n )\n\n\n# until :: (a -> Bool) -> (a -> a) -> a -> a\ndef until(p):\n '''The result of repeatedly applying f until p holds.\n The initial seed value is x.\n '''\n def go(f):\n def g(x):\n v = x\n while not p(v):\n v = f(v)\n return v\n return g\n return go\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":" [ stack 0 ] is seennumbers ( --> s )\n\n [ bit seennumbers take\n | seennumbers put ] is seen ( n --> )\n\n [ dup 0 < iff\n [ drop true ] done\n bit seennumbers share\n & 0 != ] is seen? ( n --> b )\n\n [ 1+ bit 1 -\n seennumbers share\n over & = ] is allseen? ( n --> b )\n\n [ stack [ ] ] is repeats ( --> s )\n\n [ 1 seennumbers replace\n [] repeats replace\n ' [ 0 ] 1 ] is startseq ( --> [ n )\n\n [ over -1 peek\n over - dup seen? if\n [ over 2 * +\n dup seen? if\n [ repeats take\n over join\n repeats put ] ]\n dup seen\n swap dip join\n 1+ ] is nextterm ( [ n --> [ n )\n\n say \"first 15 terms: \"\n startseq\n 14 times nextterm\n drop echo cr\n\n say \"first duplicated term: \"\n startseq\n [ repeats share [] = while\n nextterm\n again ]\n drop -1 peek echo cr\n\n say \"terms needed to generate 0 to 1000: \"\n startseq\n [ nextterm\n 1000 allseen? until ]\n nip 1 - echo cr\n","language":"Quackery"},{"code":"visited <- vector('logical', 1e8)\n\nterms <- vector('numeric')\n\nin_a_interval <- function(v) {\n\tvisited[[v+1]]\n}\n\nadd_value <- function(v) {\n\tvisited[[v+1]] <<- TRUE\n\tterms <<- append(terms, v)\n}\n\nadd_value(0)\nstep <- 1\nvalue <- 0\n\nfounddup <- FALSE\n\nrepeat {\n\tif ((value-step>0) && (!in_a_interval(value-step))) {\n\t\tvalue <- value - step\n\t} else {\n\t\tvalue <- value + step\n\t}\n\tif (in_a_interval(value) && !founddup) {\n\t\tcat(\"The first duplicated term is a[\",step,\"] = \",value,\"\\n\", sep = \"\")\n\t\tfounddup <- TRUE\n\t}\n\tadd_value(value)\n\tif (all(visited[1:1000])) {\n\t\tcat(\"Terms up to a[\",step,\"] are needed to generate 0 to 1000\\n\",sep = \"\")\n\t\tbreak\n\t}\n\tstep <- step + 1\n\tif (step == 15) {\n\t\tcat(\"The first 15 terms are :\")\n\t\tfor (aterm in terms) { cat(aterm,\" \", sep = \"\") }\n\t\tcat(\"\\n\")\n\t}\n}\n","language":"R"},{"code":"my @recamans = 0, {\n state %seen;\n state $term;\n $term++;\n my $this = $^previous - $term;\n $this = $previous + $term unless ($this > 0) && !%seen{$this};\n %seen{$this} = True;\n $this\n} … *;\n\nput \"First fifteen terms of Recaman's sequence: \", @recamans[^15];\n\nsay \"First duplicate at term: a[{ @recamans.first({@recamans[^$_].Bag.values.max == 2})-1 }]\";\n\nmy @seen;\nmy int $i = 0;\nloop {\n next if (my int $this = @recamans[$i++]) > 1000 or @seen[$this];\n @seen[$this] = 1;\n say \"Range 0..1000 covered by terms up to a[{$i - 1}]\" and last if ++$ == 1001;\n}\n","language":"Raku"},{"code":"/*REXX pgm computes a Recamán sequence up to N; the 1st dup; # terms for a range of #'s.*/\nparse arg N h . /*obtain optional arguments from the CL*/\nif N=='' | N==\",\" then N= 15 /*Not specified? Then use the default.*/\nif h=='' | h==\",\" then h= 1000 /* \" \" \" \" \" \" */\n say \"Recamán's sequence for the first \" N \" numbers: \" recaman(N)\nsay; say \"The first duplicate number in the Recamán's sequence is: \" recaman(0)\nsay; say \"The number of terms to complete the range 0───►\"h ' is: ' recaman(-h)\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nrecaman: procedure; parse arg y,,d.; $=0; !.=0; _=0; !.0=1 /*init. array and vars.*/\n r= y<0; Reca= 0; hi= abs(y) /*for the 2nd invoke. */\n o= y==0; if y<1 then y= 1e8 /* \" \" 3rd \" */\n do #=1 for y-1; z= _ - # /*next # might be < 0. */\n if z<0 then z= _ + # /*this is faster than: */\n else if !.z then z= _ + # /*if !.z | z<0 then ···*/\n !.z= 1; _= z /*mark it; add to seq.*/\n if r then do; if z>hi then iterate /*ignore #'s too large.*/\n if d.z=='' then Reca= Reca + 1 /*Unique? Bump counter.*/\n d.z= . /*mark # as a new low. */\n if Reca>=hi then return # /*list is complete ≥ HI*/\n iterate\n end /* [↑] a range of #s. */\n if o then do; if d.z==. then return z; d.z=.; iterate /*check if dup #.*/\n end\n $= $ z /*add number to $ list?*/\n end /*#*/; return $ /*return the $ list. */\n","language":"REXX"},{"code":"/*REXX program computes & displays the Recaman sequence */\n/*improved using version 1's method for task 3 */\nCall time 'R' /* Start timer */\nParse Arg n\nIf n='' Then n=15\nSay 'the first' n 'elements:' recaman(n)\nSay ans.2\nSay ans.3\nSay time('E') 'seconds elapsed'\nExit\n\nrecaman:\nParse Arg n /* Wanted number of elements */\nhave.=0 /* Number not yet in sequence */\ne.0=0 /* First element */\nhave.0=1 /* is in the sequence */\ns=0 /* Sequence to be shodn */\ndone=0 /* turn on first duplicate switch */\nd.=0\nd.0=1\ndn=1 /* number of elements <=1000 */\n Do i=1 until dn==1001 /* Loop until all found */\n ip=i-1 /* previous index */\n temp=e.ip-i /* potential next element */\n If temp>0 & have.temp=0 Then /* to be used */\n Nop\n Else /* compute the alternative */\n temp=e.ip+i\n e.i=temp /* Set next element */\n If words(s)<n Then /* not enough in output */\n s=s temp /* add the element to the output */\n If temp<=1000 Then Do /* eligible for task 3 */\n If d.temp=0 Then Do /* not yet encountered */\n d.temp=1 /* Remember it's there */\n dn=dn+1 /* count of integers<=1000 found */\n End\n End\n If done=0 & have.temp=1 Then Do\n ans.2='First duplicate ('temp') added in iteration' i,\n 'elapsed:' time('E') 'seconds'\n done=1\n End\n ans.3='Element number' i 'is the last to satisfy task 3. It is' temp\n Have.temp=1\n End\nReturn s\n","language":"REXX"},{"code":"load \"zerolib.ring\"\n\nrecaman = Z(0:50)\nduplicate = 0\ndup = []\nrecDuplicate = []\nrecnum = 0\n\nsee \"working...\" + nl\nsee \"the first 15 Recaman's numbers are:\" + nl\n\nfor n = 1 to len(recaman) - 1\n if n = 1\n recaman[0] = 0\n add(dup,0)\n see \"\" + recaman[0] + \" \"\n ok\n recaman[n] = recaman[n-1] - n\n if recaman[n] <= 0\n recaman[n] = recaman[n-1] + n\n ok\n fnrec = find(dup,recaman[n])\n if fnrec > 0\n del(dup,fnrec)\n recaman[n] = recaman[n-1] + n\n add(dup,recaman[n])\n else\n add(dup,recaman[n])\n ok\n recnum = recnum + 1\n if recnum < 15\n see \"\" + recaman[n] + \" \"\n ok\n add(recDuplicate,recaman[n])\nnext\nsee nl\n\nsee \"the first duplicated term is a[\"\nfor n = len(recDuplicate) to 2 step -1\n for m = n-1 to 1 step -1\n if recDuplicate[n] = recDuplicate[m]\n duplicate = recDuplicate[n]\n dupnr = n\n ok\n next\nnext\n\nsee \"\" + dupnr + \"] = \" + duplicate + nl\nsee \"done...\" + nl\n","language":"Ring"},{"code":"require 'set'\n\na = [0]\nused = Set[0]\nused1000 = Set[0]\nfoundDup = false\nn = 1\nwhile n <= 15 or not foundDup or used1000.size < 1001\n nxt = a[n - 1] - n\n if nxt < 1 or used === nxt then\n nxt = nxt + 2 * n\n end\n alreadyUsed = used === nxt\n a << nxt\n if not alreadyUsed then\n used << nxt\n if nxt >= 0 and nxt <= 1000 then\n used1000 << nxt\n end\n end\n if n == 14 then\n print \"The first 15 terms of the Recaman's sequence are \", a, \"\\n\"\n end\n if not foundDup and alreadyUsed then\n print \"The first duplicated term is a[\", n, \"] = \", nxt, \"\\n\"\n foundDup = true\n end\n if used1000.size == 1001 then\n print \"Terms up to a[\", n, \"] are needed to generate 0 to 1000\\n\"\n end\n n = n + 1\nend\n","language":"Ruby"},{"code":"use std::collections::HashSet ;\n\nfn main() {\n let mut recamans : Vec<i32> = Vec::new( ) ;\n let mut reca_set : HashSet<i32> = HashSet::new() ;\n let mut first_nums : HashSet<i32> = HashSet::new( ) ;\n for i in 0i32..=1000 {\n first_nums.insert( i ) ;\n }\n recamans.push( 0 ) ;\n reca_set.insert( 0 ) ;\n let mut current : i32 = 0 ;\n while ! first_nums.is_subset( &reca_set ) {\n current += 1 ;\n let mut nextnum : i32 = recamans[( current as usize ) - 1] - current ;\n if nextnum < 0 || reca_set.contains( &nextnum ) {\n nextnum = recamans[(current as usize ) - 1 ] + current ;\n }\n recamans.push( nextnum ) ;\n reca_set.insert( nextnum ) ;\n if current == 15 {\n println!(\"The first 15 numbers of the Recaman sequence are:\" ) ;\n println!(\"{:?}\" , recamans ) ;\n }\n }\n println!(\"To generate all numbers from 0 to 1000 , one has to go to element {}\" , current) ;\n}\n","language":"Rust"},{"code":"import scala.collection.mutable\n\nobject RecamansSequence extends App {\n val (a, used) = (mutable.ArrayBuffer[Int](0), mutable.BitSet())\n var (foundDup, hop, nUsed1000) = (false, 1, 0)\n\n while (nUsed1000 < 1000) {\n val _next = a(hop - 1) - hop\n val next = if (_next < 1 || used.contains(_next)) _next + 2 * hop else _next\n val alreadyUsed = used.contains(next)\n\n a += next\n if (!alreadyUsed) {\n used.add(next)\n if (next <= 1000) nUsed1000 += 1\n }\n if (!foundDup && alreadyUsed) {\n println(s\"The first duplicate term is a($hop) = $next\")\n foundDup = true\n }\n if (nUsed1000 == 1000)\n println(s\"Terms up to $hop are needed to generate 0 to 1000\")\n\n hop += 1\n }\n\n println(s\"The first 15 terms of the Recaman sequence are : ${a.take(15)}\")\n\n}\n","language":"Scala"},{"code":"; Create a dynamically resizing vector (a \"dynvec\").\n; Returns a procedure that takes a variable number of arguments:\n; 0 : () --> Returns the vector from index 0 through the maximum index set.\n; 1 : (inx) --> Returns the value at the given index.\n; 2 : (inx val) --> Sets the given value into the given index, and returns the value.\n\n(define make-dynvec\n (lambda (init-size extra-fact init-val)\n (let ((vec (make-vector init-size init-val)) (maxinx -1))\n (lambda args\n (if (null? args)\n (let ((retvec (make-vector (1+ maxinx))))\n (do ((index 0 (1+ index)))\n ((> index maxinx) retvec)\n (vector-set! retvec index (vector-ref vec index))))\n (let ((inx (car args)))\n (when (>= inx (vector-length vec))\n (let ((newvec (make-vector\n (inexact->exact (ceiling (* extra-fact inx)))\n init-val)))\n (do ((index 0 (1+ index)))\n ((>= index (vector-length vec)))\n (vector-set! newvec index (vector-ref vec index)))\n (set! vec newvec)))\n (when (pair? (cdr args))\n (when (> inx maxinx) (set! maxinx inx))\n (vector-set! vec inx (cadr args)))\n (vector-ref vec inx)))))))\n\n; Generate the Recaman's sequence.\n; Generate the terms of Recaman's sequence until the given \"stop\" procedure\n; returns a true value; that returned value becomes the value of this procedure.\n; The arguments to the \"stop\" procedure are: n, the value of the n'th term,\n; #t if that term was seen before, #t if the term was arrived at by addition,\n; the Recaman's sequence so far (as a dynvec), and a dynvec of the n's at which\n; a value was first seen or #f if not previously seen (\"seen1st\").\n\n(define recaman-sequence\n (lambda (stop-proc)\n (let ((recaman (make-dynvec 10 2 0))\n (seen1st (make-dynvec 10 2 #f)))\n (do ((n 0 (1+ n)) (done-retval #f))\n (done-retval done-retval)\n (if (= n 0)\n (begin\n (recaman n 0)\n (seen1st 0 n)\n (set! done-retval (stop-proc n 0 #f #f recaman seen1st)))\n (let ((try-sub (- (recaman (1- n)) n)))\n (if (and (> try-sub 0) (not (seen1st try-sub)))\n (begin\n (recaman n try-sub)\n (seen1st try-sub n)\n (set! done-retval (stop-proc n try-sub #f #f recaman seen1st)))\n (let* ((val-add (+ (recaman (1- n)) n)) (seen-prev (seen1st val-add)))\n (recaman n val-add)\n (unless (seen1st val-add) (seen1st val-add n))\n (set! done-retval\n (stop-proc n val-add seen-prev #t recaman seen1st))))))))))\n\n; Generate and display the first 15 Recaman's numbers.\n\n(printf \"First 15 Recaman's numbers: ~a~%\"\n (recaman-sequence (lambda (n val seen-prev by-add recaman seen1st)\n (and (>= n (1- 15)) (recaman)))))\n\n; Find and display the first duplicated Recaman's number.\n; The only way to be a duplicate is if the number was arrived\n; at by adding 'n' and the number has been seen before.\n\n(let ((dup-n-val-1st\n (recaman-sequence (lambda (n val seen-prev by-add recaman seen1st)\n (and by-add seen-prev (list n val (seen1st val)))))))\n (printf \"First duplicate Recaman's number: a[~a] = a[~a] = ~a~%\"\n (caddr dup-n-val-1st) (car dup-n-val-1st) (cadr dup-n-val-1st)))\n\n; Find and display how many terms of the sequence are needed\n; for all the integers 0..1000, inclusive, to be generated.\n\n(let* ((all-first 1001)\n (terms-to-gen-all (recaman-sequence\n (lambda (n val seen-prev by-add recaman seen1st)\n (do ((inx 0 (1+ inx)))\n ((or (>= inx all-first) (not (seen1st inx)))\n (and (>= inx all-first) (1+ n))))))))\n (printf\n \"Terms of Recaman's sequence to generate all integers 0..~a, inclusive: ~a~%\"\n (1- all-first) terms-to-gen-all))\n","language":"Scheme"},{"code":"program recaman;\n a := {[0,0]};\n\n loop for i in [1..14] do\n extend(a);\n end loop;\n\n print(\"First 15:\", [a(n) : n in [0..14]]);\n\n loop\n doing n := extend(a);\n until #(rept:=[[r,i] : r = a(i) | r=n]) > 1\n do pass;\n end loop;\n\n print(\"First repetition:\", n, \"at\", {x:x in rept}{n});\n\n proc extend(rw a);\n n := max/ domain a;\n t := a(n) - n-1;\n if t<0 or t in range a then\n t := a(n) + n+1;\n end if;\n return a(n+1) := t;\n end proc;\nend program;\n","language":"SETL"},{"code":"func recamans_generator() {\n\n var term = 0\n var prev = 0\n var seen = Hash()\n\n {\n var this = (prev - term)\n\n if ((this <= 0) || seen{this}) {\n this = (prev + term)\n }\n\n prev = this\n seen{this} = true\n term++\n this\n }\n}\n\nwith (recamans_generator()) { |r|\n say (\"First 15 terms of the Recaman's sequence: \", 15.of { r.run }.join(', '))\n}\n\nwith (recamans_generator()) {|r|\n var seen = Hash()\n Inf.times {|i|\n var n = r.run\n if (seen{n}) {\n say \"First duplicate term in the series is a(#{i}) = #{n}\"\n break\n }\n seen{n} = true\n }\n}\n\nwith (recamans_generator()) {|r|\n var seen = Hash()\n Inf.times {|i|\n var n = r.run\n if ((n <= 1000) && (seen{n} := true) && (seen.len == 1001)) {\n say \"Terms up to a(#{i}) are needed to generate 0 to 1000\"\n break\n }\n }\n}\n","language":"Sidef"},{"code":"' Recaman's sequence - vbscript - 04/08/2015\n\tnx=15\n\th=1000\n\tWscript.StdOut.WriteLine \"Recaman's sequence for the first \" & nx & \" numbers:\"\n\tWscript.StdOut.WriteLine recaman(\"seq\",nx)\n\tWscript.StdOut.WriteLine \"The first duplicate number is: \" & recaman(\"firstdup\",0)\n\tWscript.StdOut.WriteLine \"The number of terms to complete the range 0--->\"& h &\" is: \"& recaman(\"numterm\",h)\n\tWscript.StdOut.Write vbCrlf&\".../...\": zz=Wscript.StdIn.ReadLine()\n\t\nfunction recaman(op,nn)\n\tDim b,d,h\n\tSet b = CreateObject(\"Scripting.Dictionary\")\n\tSet d = CreateObject(\"Scripting.Dictionary\")\n list=\"0\" : firstdup=0\n\tif op=\"firstdup\" then\n\t\tnn=1000 : firstdup=1\n\tend if\n\tif op=\"numterm\" then\n\t\th=nn : nn=10000000 : numterm=1\n\tend if\n\tax=0 'a(0)=0\n\tb.Add 0,1 'b(0)=1\n\ts=0\n\tfor n=1 to nn-1\n an=ax-n\n\t\tif an<=0 then\n\t\t\tan=ax+n\n\t\telseif b.Exists(an) then\n\t\t\tan=ax+n\n\t\tend if\n\t\tax=an 'a(n)=an\n\t\tif not b.Exists(an) then b.Add an,1 'b(an)=1\n\t\tif op=\"seq\" then\n\t\t\tlist=list&\" \"&an\n\t\tend if\n\t\tif firstdup then\n\t\t\tif d.Exists(an) then\n\t\t\t\trecaman=\"a(\"&n&\")=\"&an\n\t\t\t\texit function\n\t\t\telse\n\t\t\t\td.Add an,1 'd(an)=1\n\t\t\tend if\n\t\tend if\n\t\tif numterm then\n\t\t\tif an<=h then\n\t\t\t\tif not d.Exists(an) then\n\t\t\t\t\ts=s+1\n\t\t\t\t\td.Add an,1 'd(an)=1\n\t\t\t\tend if\n\t\t\t\tif s>=h then\n\t\t\t\t\trecaman=n\n\t\t\t\t\texit function\n\t\t\t\tend if\n\t\t\tend if\n\t\tend if\n\tnext 'n\n\trecaman=list\nend function 'recaman\n","language":"VBScript"},{"code":"Imports System\nImports System.Collections.Generic\n\nModule Module1\n Sub Main(ByVal args As String())\n Dim a As List(Of Integer) = New List(Of Integer)() From { 0 },\n used As HashSet(Of Integer) = New HashSet(Of Integer)() From { 0 },\n used1000 As HashSet(Of Integer) = used.ToHashSet(),\n foundDup As Boolean = False\n For n As Integer = 1 to Integer.MaxValue\n Dim nv As Integer = a(n - 1) - n\n If nv < 1 OrElse used.Contains(nv) Then nv += 2 * n\n Dim alreadyUsed As Boolean = used.Contains(nv) : a.Add(nv)\n If Not alreadyUsed Then used.Add(nv) : If nv > 0 AndAlso nv <= 1000 Then used1000.Add(nv)\n If Not foundDup Then\n If a.Count = 15 Then _\n Console.WriteLine(\"The first 15 terms of the Recamán sequence are: ({0})\", String.Join(\", \", a))\n If alreadyUsed Then _\n Console.WriteLine(\"The first duplicated term is a({0}) = {1}\", n, nv) : foundDup = True\n End If\n If used1000.Count = 1001 Then _\n Console.WriteLine(\"Terms up to a({0}) are needed to generate 0 to 1000\", n) : Exit For\n Next\n End Sub\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"var a = [0]\nvar used = { 0: true }\nvar used1000 = { 0: true }\nvar foundDup = false\nvar n = 1\nwhile (n <= 15 || !foundDup || used1000.count < 1001) {\n var next = a[n-1] - n\n if (next < 1 || used[next]) next = next + 2*n\n var alreadyUsed = used[next]\n a.add(next)\n if (!alreadyUsed) {\n used[next] = true\n if (next >= 0 && next <= 1000) used1000[next] = true\n }\n if (n == 14) System.print(\"The first 15 terms of the Recaman's sequence are:\\n%(a)\")\n if (!foundDup && alreadyUsed) {\n System.print(\"The first duplicated term is a[%(n)] = %(next)\")\n foundDup = true\n }\n if (used1000.count == 1001) {\n System.print(\"Terms up to a[%(n)] are needed to generate 0 to 1000\")\n }\n n = n + 1\n}\n","language":"Wren"},{"code":"fcn recamanW{ // -->iterator -->(n,a,True if a is a dup)\n Walker.tweak(fcn(rn,rp,d){\n n,p,a := rn.value, rp.value, p - n;\n if(a<=0 or d.find(a)) a+=2*n;\n d.incV(a); rp.set(a);\n return(rn.inc(),a,d[a]>1);\n }.fp(Ref(0),Ref(0),Dictionary()) )\n}\n","language":"Zkl"},{"code":"print(\"First 15 members of Recaman's sequence: \");\nrecamanW().walk(15).apply(\"get\",1).println();\n\nn,a := recamanW().filter1(\"get\",2); // ie filter(a[n].dup)\nprintln(\"First duplicate number in series is: a(%d) = %d\".fmt(n,a));\n\nrw,ns,n,a,dup := recamanW(),1000,0,0,0;\ndo{ n,a,dup=rw.next(); if(not dup and a<1000) ns-=1; }while(ns);\nprintln(\"Range 0..1000 is covered by terms up to a(%,d)\".fmt(n));\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Recaman's_sequence\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"The '''[[wp:Recamán's sequence|Recamán's sequence]]''' generates Natural numbers.\\n\\nStarting from a(0)=0, the n'th term <code>a(n)</code>, where n>0, is the previous term minus <code>n</code> i.e <code>a(n) = a(n-1) - n</code> but only if this is '''both''' positive ''and'' has not been previously generated.<br>\\n\\nIf the conditions ''don't'' hold then <code>a(n) = a(n-1) + n</code>.\\n\\n\\n;Task:\\n# Generate and show here the first 15 members of the sequence.\\n# Find and show here, the first duplicated number in the sequence.\\n# '''Optionally''': Find and show here, how many terms of the sequence are needed until all the integers 0..1000, inclusive, are generated.\\n\\n\\n;References:\\n* [https://oeis.org/A005132 A005132], The On-Line Encyclopedia of Integer Sequences.\\n* [https://www.youtube.com/watch?v=FGC5TdIiT9U The Slightly Spooky Recamán Sequence], Numberphile video.\\n* [https://en.wikipedia.org/wiki/Recam%C3%A1n%27s_sequence Recamán's sequence], on Wikipedia.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F recamanSucc(seen, n, r)\\n ‘The successor for a given Recaman term,\\n given the set of Recaman terms seen so far.’\\n V back = r - n\\n R I 0 > back | (back C seen) {n + r} E back\\n\\nF recamanUntil(p)\\n ‘All terms of the Recaman series before the\\n first term for which the predicate p holds.’\\n V n = 1\\n V r = 0\\n V rs = [r]\\n V seen = Set(rs)\\n V blnNew = 1B\\n L !p(seen, n, r, blnNew)\\n r = recamanSucc(seen, n, r)\\n blnNew = r !C seen\\n seen.add(r)\\n rs.append(r)\\n n = 1 + n\\n R rs\\n\\nF enumFromTo(m)\\n ‘Integer enumeration from m to n.’\\n R n -> @m .< 1 + n\\n\\nprint(\\\"First 15 Recaman:\\\\n \\\"recamanUntil((seen, n, r, _) -> n == 15))\\nprint(\\\"First duplicated Recaman:\\\\n \\\"recamanUntil((seen, n, r, blnNew) -> !blnNew).last)\\nV setK = Set(enumFromTo(0)(1000))\\nprint(\\\"Number of Recaman terms needed to generate all integers from [0..1000]:\\\\n \\\"(recamanUntil((seen, n, r, blnNew) -> (blnNew & r < 1001 & :setK.is_subset(seen))).len - 1))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"begin\\n % calculate Recaman's sequence values %\\n\\n % a hash table element - holds n, A(n) and a link to the next element with the %\\n % same hash value %\\n record AValue ( integer eN, eAn ; reference(AValue) eNext );\\n\\n % hash modulus %\\n integer HMOD;\\n HMOD := 100000;\\n\\n begin\\n reference(AValue) array hashTable ( 0 :: HMOD - 1 );\\n integer array A ( 0 :: 14 );\\n integer le1000Count, firstN, duplicateN, duplicateValue, n, An, An1, prevN, maxS;\\n\\n % adds an element to the hash table, returns true if an element with value An %\\n % was already present, false otherwise %\\n % if the value was already present, its eN value is returned in prevN %\\n logical procedure addAValue( integer value n, An ; integer result prevN ) ;\\n begin\\n integer hash;\\n logical duplicate;\\n reference(AValue) element;\\n hash := An rem HMOD;\\n element := hashTable( hash );\\n duplicate := false;\\n while element not = null and eAn(element) not = An do element := eNext(element);\\n duplicate := element not = null;\\n if not duplicate then hashTable( hash ) := AValue( n, An, hashTable( hash ) )\\n else prevN := eN(element);\\n duplicate\\n end addAValue ;\\n\\n % initialise the hash table %\\n for h := 0 until HMOD - 1 do hashTable( h ) := null;\\n\\n % calculate the values of the sequence until we have found values that %\\n % include all numbers in 1..1000 %\\n % also store the first 15 values %\\n\\n A( 0 ) := An1 := n := 0;\\n le1000Count := 0;\\n maxS := firstN := duplicateN := duplicateValue := -1;\\n while le1000Count < 1000 do begin\\n logical le0, duplicate;\\n n := n + 1;\\n An := An1 - n;\\n le0 := ( An <= 0 );\\n if le0 then An := An1 + n;\\n prevN := -1;\\n duplicate := addAValue( n, An, prevN );\\n if duplicate and not le0 then begin\\n An := An1 + n;\\n duplicate := addAValue( n, An, prevN )\\n end if_duplicate_and_not_le0 ;\\n if duplicate then begin\\n % the value was already present %\\n if firstN < 0 then begin % have the first duplicate %\\n firstN := n;\\n duplicateN := prevN;\\n duplicateValue := An;\\n end if_firstN_lt_0\\n end\\n else if An <= 1000 then le1000Count := le1000Count + 1;;\\n if n < 15 then A( n ) := An;\\n if An > maxS then maxS := An;\\n An1 := An\\n end while_le1000Count_lt_1000 ;\\n\\n % show the first 15 values of the sequence %\\n write( \\\"A( 0 .. 14 ): \\\" );\\n for n := 0 until 14 do writeon( i_w := 1, A( n ) );\\n % positions of the first duplicate %\\n write( i_w := 1\\n , s_w := 0\\n , \\\"First duplicates: \\\"\\n , duplicateN\\n , \\\" \\\"\\n , firstN\\n , \\\" (\\\"\\n , duplicateValue\\n , \\\")\\\"\\n );\\n % number of elements required to include the first 1000 integers %\\n write( i_w := 1, \\\"first element to include all 1..1000: \\\", n );\\n write( i_w := 1, \\\"max sequence value encountered: \\\", maxS )\\n end\\n\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"recaman←{⎕IO←0\\n genNext←{\\n R←⍵[N-1]-N←≢⍵\\n (R<0)∨(R∊⍵):⍵,⍵[N-1]+N\\n ⍵,⍵[N-1]-N\\n }\\n ⎕←'First 15: '\\n ⎕←reca←(genNext⍣14),0\\n ⎕←'First repetition: '\\n ⎕←⊃⌽reca←genNext⍣{⍺≢∪⍺}⊢reca\\n ⎕←'Length of sequence containing [0..1000]:'\\n ⎕←≢reca←genNext⍣{(⍳1001)∧.∊⊂⍺}⊢reca\\n}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"use AppleScript version \\\"2.4\\\"\\nuse framework \\\"Foundation\\\"\\nuse scripting additions\\n\\non run\\n\\n -- FIRST FIFTEEN RECAMANs ------------------------------------------------------\\n\\n script term15\\n on |λ|(i)\\n 15 = (i as integer)\\n end |λ|\\n end script\\n set strFirst15 to unwords(snd(recamanUpto(true, term15)))\\n\\n set strFirstMsg to \\\"First 15 Recamans:\\\" & linefeed\\n display notification strFirstMsg & strFirst15\\n delay 2\\n\\n -- FIRST DUPLICATE RECAMAN ----------------------------------------------------\\n\\n script firstDuplicate\\n on |λ|(_, seen, rs)\\n setSize(seen) as integer is not (length of (rs as list))\\n end |λ|\\n end script\\n set strDuplicate to (item -1 of snd(recamanUpto(true, firstDuplicate))) as integer as string\\n\\n set strDupMsg to \\\"First duplicated Recaman:\\\" & linefeed\\n display notification strDupMsg & strDuplicate\\n delay 2\\n\\n -- NUMBER OF RECAMAN TERMS NEEDED TO GET ALL OF [0..1000]\\n -- (takes about a minute, depending on system)\\n\\n set setK to setFromList(enumFromTo(0, 1000))\\n script supersetK\\n on |λ|(i, setR)\\n setK's isSubsetOfSet:(setR)\\n end |λ|\\n end script\\n\\n display notification \\\"Superset size result will take c. 1 min to find ...\\\"\\n set dteStart to current date\\n\\n set strSetSize to (fst(recamanUpto(false, supersetK)) - 1) as string\\n\\n set dteEnd to current date\\n\\n set strSetSizeMsg to \\\"Number of Recaman terms needed to generate\\\" & ¬\\n linefeed & \\\"all integers from [0..1000]:\\\" & linefeed\\n set strElapsed to \\\"(Last result took c. \\\" & (dteEnd - dteStart) & \\\" seconds to find)\\\"\\n display notification strSetSizeMsg & linefeed & strSetSize\\n\\n -- CLEARED REFERENCE TO NSMUTABLESET -------------------------------------\\n set setK to missing value\\n\\n -- REPORT ----------------------------------------------------------------\\n unlines({strFirstMsg & strFirst15, \\\"\\\", ¬\\n strDupMsg & strDuplicate, \\\"\\\", ¬\\n strSetSizeMsg & strSetSize, \\\"\\\", ¬\\n strElapsed})\\nend run\\n\\n-- nextR :: Set Int -> Int -> Int\\non nextR(seen, i, n)\\n set bk to n - i\\n if 0 > bk or setMember(bk, seen) then\\n n + i\\n else\\n bk\\n end if\\nend nextR\\n\\n-- recamanUpto :: Bool -> (Int -> Set Int > [Int] -> Bool) -> (Int, [Int])\\non recamanUpto(bln, p)\\n script recaman\\n property mp : mReturn(p)'s |λ|\\n on |λ|()\\n set i to 1\\n set r to 0\\n set rs to {r}\\n set seen to setFromList(rs)\\n repeat while not mp(i, seen, rs)\\n set r to nextR(seen, i, r)\\n setInsert(r, seen)\\n if bln then set end of rs to r\\n set i to i + 1\\n end repeat\\n set seen to missing value -- clear pointer to NSMutableSet\\n {i, rs}\\n end |λ|\\n end script\\n recaman's |λ|()\\nend recamanUpto\\n\\n-- GENERIC FUNCTIONS -------------------------------------------------------\\n\\n-- enumFromTo :: Int -> Int -> [Int]\\non enumFromTo(m, n)\\n if m ≤ n then\\n set lst to {}\\n repeat with i from m to n\\n set end of lst to i\\n end repeat\\n return lst\\n else\\n return {}\\n end if\\nend enumFromTo\\n\\n-- fst :: (a, b) -> a\\non fst(tpl)\\n if class of tpl is record then\\n |1| of tpl\\n else\\n item 1 of tpl\\n end if\\nend fst\\n\\n-- intercalateS :: String -> [String] -> String\\non intercalateS(sep, xs)\\n set {dlm, my text item delimiters} to {my text item delimiters, sep}\\n set s to xs as text\\n set my text item delimiters to dlm\\n return s\\nend intercalateS\\n\\n-- Lift 2nd class handler function into 1st class script wrapper\\n-- mReturn :: First-class m => (a -> b) -> m (a -> b)\\non mReturn(f)\\n if class of f is script then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\\n-- NB All names of NSMutableSets should be set to *missing value*\\n-- before the script exits.\\n-- ( scpt files containing residual ObjC pointer values can not be saved)\\n-- setFromList :: Ord a => [a] -> Set a\\non setFromList(xs)\\n set ca to current application\\n ca's NSMutableSet's ¬\\n setWithArray:(ca's NSArray's arrayWithArray:(xs))\\nend setFromList\\n\\n-- setMember :: Ord a => a -> Set a -> Bool\\non setMember(x, objcSet)\\n missing value is not (objcSet's member:(x))\\nend setMember\\n\\n-- setInsert :: Ord a => a -> Set a -> Set a\\non setInsert(x, objcSet)\\n objcSet's addObject:(x)\\n objcSet\\nend setInsert\\n\\n-- setSize :: Set a -> Int\\non setSize(objcSet)\\n objcSet's |count|() as integer\\nend setSize\\n\\n-- snd :: (a, b) -> b\\non snd(tpl)\\n if class of tpl is record then\\n |2| of tpl\\n else\\n item 2 of tpl\\n end if\\nend snd\\n\\n-- unlines :: [String] -> String\\non unlines(xs)\\n set {dlm, my text item delimiters} to ¬\\n {my text item delimiters, linefeed}\\n set str to xs as text\\n set my text item delimiters to dlm\\n str\\nend unlines\\n\\n-- unwords :: [String] -> String\\non unwords(xs)\\n intercalateS(space, xs)\\nend unwords\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"10 DIM A(100)\\n20 PRINT \\\"First 15 terms:\\\"\\n30 FOR N=0 TO 14: GOSUB 100: PRINT A(N); \\\" \\\";: NEXT\\n35 PRINT\\n40 PRINT \\\"First repeated term:\\\"\\n50 GOSUB 100\\n55 FOR M=0 TO N-1\\n56 IF A(M)=A(N) THEN 70\\n57 NEXT\\n60 N=N+1: GOTO 50\\n70 PRINT \\\"A(\\\";N;\\\") = \\\";A(N)\\n80 END\\n100 IF N=0 THEN A(0)=0: RETURN\\n110 X = A(N-1)-N: IF X<0 THEN 160\\n120 FOR M=0 TO N-1\\n130 IF A(M)=X THEN 160\\n140 NEXT\\n150 A(N)=X: RETURN\\n160 A(N)=A(N-1)+N: RETURN\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"recamanSucc: function [seen, n, r].memoize[\\n back: r - n\\n (or? 0 > back contains? seen back)? -> n + r\\n -> back\\n]\\n\\nrecamanUntil: function [p][\\n n: new 1\\n r: 0\\n rs: new @[r]\\n seen: rs\\n blnNew: true\\n while [not? do p][\\n r: recamanSucc seen n r\\n blnNew: not? in? r seen\\n seen: unique seen ++ r\\n 'rs ++ r\\n inc 'n\\n ]\\n return rs\\n]\\n\\nprint \\\"First 15 Recaman numbers:\\\"\\nprint recamanUntil [n = 15]\\n\\nprint \\\"\\\"\\nprint \\\"First duplicate Recaman number:\\\"\\nprint last recamanUntil [not? blnNew]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"# syntax: GAWK -f RECAMANS_SEQUENCE.AWK\\n# converted from Microsoft Small Basic\\nBEGIN {\\n found_dup = 0\\n n = -1\\n do {\\n n++\\n ap = a[n-1] + n\\n if (a[n-1] <= n) {\\n a[n] = ap\\n b[ap] = 1\\n }\\n else {\\n am = a[n-1] - n\\n if (b[am] == 1) {\\n a[n] = ap\\n b[ap] = 1\\n }\\n else {\\n a[n] = am\\n b[am] = 1\\n }\\n }\\n if (n <= 14) {\\n terms = sprintf(\\\"%s%s \\\",terms,a[n])\\n if (n == 14) {\\n printf(\\\"first %d terms: %s\\\\n\\\",n+1,terms)\\n }\\n }\\n if (!found_dup) {\\n if (dup[a[n]] == 1) {\\n printf(\\\"first duplicated term: a[%d]=%d\\\\n\\\",n,a[n])\\n found_dup = 1\\n }\\n dup[a[n]] = 1\\n }\\n if (a[n] <= 1000) {\\n arr[a[n]] = \\\"\\\"\\n }\\n } while (n <= 15 || !found_dup || length(arr) < 1001)\\n printf(\\\"terms needed to generate integers 0 - 1000: %d\\\\n\\\",n)\\n exit(0)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"10 DEFINT A-Z: DIM A(100)\\n20 PRINT \\\"First 15 terms:\\\"\\n30 FOR N=0 TO 14: GOSUB 100: PRINT A(N);: NEXT\\n35 PRINT\\n40 PRINT \\\"First repeated term:\\\"\\n50 GOSUB 100\\n55 FOR M=0 TO N-1: IF A(M)=A(N) THEN 70 ELSE NEXT\\n60 N=N+1: GOTO 50\\n70 PRINT \\\"A(\\\";N;\\\") =\\\";A(N)\\n80 END\\n100 IF N=0 THEN A(0)=0: RETURN\\n110 X = A(N-1)-N: IF X<0 THEN 160\\n120 FOR M=0 TO N-1\\n130 IF A(M)=X THEN 160\\n140 NEXT\\n150 A(N)=X: RETURN\\n160 A(N)=A(N-1)+N: RETURN\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\n// Generate the N'th term of the Recaman sequence\\n// given terms 0 to N-1.\\nlet generate(a, n) be\\n a!n := n=0 -> 0, valof\\n $( let subterm = a!(n-1) - n\\n let addterm = a!(n-1) + n\\n if subterm <= 0 resultis addterm\\n for i=0 to n-1\\n if a!i = subterm resultis addterm\\n resultis subterm\\n $)\\n\\nlet start() be\\n$( let a = vec 50 and n = 15 and rep = ?\\n\\n writef(\\\"First %N members:*N\\\", n)\\n for i = 0 to n-1\\n $( generate(a, i)\\n writef(\\\"%N \\\", a!i)\\n $)\\n\\n writef(\\\"*NFirst repeated term:*N\\\")\\n rep := valof\\n $( generate(a, n)\\n for i = 0 to n-1\\n if a!i = a!n resultis n\\n n := n + 1\\n $) repeat\\n\\n writef(\\\"a!%N = %N*N\\\", rep, a!rep)\\n$)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <gmodule.h>\\n\\ntypedef int bool;\\n\\nint main() {\\n int i, n, k = 0, next, *a;\\n bool foundDup = FALSE;\\n gboolean alreadyUsed;\\n GHashTable* used = g_hash_table_new(g_direct_hash, g_direct_equal);\\n GHashTable* used1000 = g_hash_table_new(g_direct_hash, g_direct_equal);\\n a = malloc(400000 * sizeof(int));\\n a[0] = 0;\\n g_hash_table_add(used, GINT_TO_POINTER(0));\\n g_hash_table_add(used1000, GINT_TO_POINTER(0));\\n\\n for (n = 1; n <= 15 || !foundDup || k < 1001; ++n) {\\n next = a[n - 1] - n;\\n if (next < 1 || g_hash_table_contains(used, GINT_TO_POINTER(next))) {\\n next += 2 * n;\\n }\\n alreadyUsed = g_hash_table_contains(used, GINT_TO_POINTER(next));\\n a[n] = next;\\n\\n if (!alreadyUsed) {\\n g_hash_table_add(used, GINT_TO_POINTER(next));\\n if (next >= 0 && next <= 1000) {\\n g_hash_table_add(used1000, GINT_TO_POINTER(next));\\n }\\n }\\n\\n if (n == 14) {\\n printf(\\\"The first 15 terms of the Recaman's sequence are: \\\");\\n printf(\\\"[\\\");\\n for (i = 0; i < 15; ++i) printf(\\\"%d \\\", a[i]);\\n printf(\\\"\\\\b]\\\\n\\\");\\n }\\n\\n if (!foundDup && alreadyUsed) {\\n printf(\\\"The first duplicated term is a[%d] = %d\\\\n\\\", n, next);\\n foundDup = TRUE;\\n }\\n k = g_hash_table_size(used1000);\\n\\n if (k == 1001) {\\n printf(\\\"Terms up to a[%d] are needed to generate 0 to 1000\\\\n\\\", n);\\n }\\n }\\n g_hash_table_destroy(used);\\n g_hash_table_destroy(used1000);\\n free(a);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <ostream>\\n#include <set>\\n#include <vector>\\n\\ntemplate<typename T>\\nstd::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {\\n auto i = v.cbegin();\\n auto e = v.cend();\\n os << '[';\\n if (i != e) {\\n os << *i;\\n i = std::next(i);\\n }\\n while (i != e) {\\n os << \\\", \\\" << *i;\\n i = std::next(i);\\n }\\n return os << ']';\\n}\\n\\nint main() {\\n using namespace std;\\n\\n vector<int> a{ 0 };\\n set<int> used{ 0 };\\n set<int> used1000{ 0 };\\n bool foundDup = false;\\n int n = 1;\\n while (n <= 15 || !foundDup || used1000.size() < 1001) {\\n int next = a[n - 1] - n;\\n if (next < 1 || used.find(next) != used.end()) {\\n next += 2 * n;\\n }\\n bool alreadyUsed = used.find(next) != used.end();\\n a.push_back(next);\\n if (!alreadyUsed) {\\n used.insert(next);\\n if (0 <= next && next <= 1000) {\\n used1000.insert(next);\\n }\\n }\\n if (n == 14) {\\n cout << \\\"The first 15 terms of the Recaman sequence are: \\\" << a << '\\\\n';\\n }\\n if (!foundDup && alreadyUsed) {\\n cout << \\\"The first duplicated term is a[\\\" << n << \\\"] = \\\" << next << '\\\\n';\\n foundDup = true;\\n }\\n if (used1000.size() == 1001) {\\n cout << \\\"Terms up to a[\\\" << n << \\\"] are needed to generate 0 to 1000\\\\n\\\";\\n }\\n n++;\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\n\\nnamespace RecamanSequence {\\n class Program {\\n static void Main(string[] args) {\\n List<int> a = new List<int>() { 0 };\\n HashSet<int> used = new HashSet<int>() { 0 };\\n HashSet<int> used1000 = new HashSet<int>() { 0 };\\n bool foundDup = false;\\n int n = 1;\\n while (n <= 15 || !foundDup || used1000.Count < 1001) {\\n int next = a[n - 1] - n;\\n if (next < 1 || used.Contains(next)) {\\n next += 2 * n;\\n }\\n bool alreadyUsed = used.Contains(next);\\n a.Add(next);\\n if (!alreadyUsed) {\\n used.Add(next);\\n if (0 <= next && next <= 1000) {\\n used1000.Add(next);\\n }\\n }\\n if (n == 14) {\\n Console.WriteLine(\\\"The first 15 terms of the Recaman sequence are: [{0}]\\\", string.Join(\\\", \\\", a));\\n }\\n if (!foundDup && alreadyUsed) {\\n Console.WriteLine(\\\"The first duplicated term is a[{0}] = {1}\\\", n, next);\\n foundDup = true;\\n }\\n if (used1000.Count == 1001) {\\n Console.WriteLine(\\\"Terms up to a[{0}] are needed to generate 0 to 1000\\\", n);\\n }\\n n++;\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"% Recaman sequence\\nrecaman = cluster is new, fetch\\n rep = array[int]\\n\\n new = proc () returns (cvt)\\n a: rep := rep$predict(0,1000000)\\n rep$addh(a,0)\\n return(a)\\n end new\\n\\n % Find the N'th element of the Recaman sequence\\n fetch = proc (a: cvt, n: int) returns (int)\\n if n > rep$high(a) then extend(a,n) end\\n return(a[n])\\n end fetch\\n\\n % See if N has already been generated\\n prev = proc (a: rep, n: int) returns (bool)\\n for el: int in rep$elements(a) do\\n if el = n then return(true) end\\n end\\n return(false)\\n end prev\\n\\n % Generate members of the sequence until 'top' is reached\\n extend = proc (a: rep, top: int)\\n while rep$high(a) < top do\\n n: int := rep$high(a) + 1\\n sub: int := a[n-1] - n\\n add: int := a[n-1] + n\\n if sub>0 cand ~prev(a, sub)\\n then rep$addh(a, sub)\\n else rep$addh(a, add)\\n end\\n end\\n end extend\\nend recaman\\n\\n\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n A: recaman := recaman$new()\\n\\n % Print the first 15 members\\n stream$puts(po, \\\"First 15 items:\\\")\\n for i: int in int$from_to(0, 14) do\\n stream$puts(po, \\\" \\\" || int$unparse(A[i]))\\n end\\n\\n % Find the first duplicated number\\n begin\\n i: int := 0\\n while true do\\n i := i + 1\\n for j: int in int$from_to(0, i-1) do\\n if A[i]=A[j] then exit found(i, A[i]) end\\n end\\n end\\n end except when found(i, n: int):\\n stream$putl(po, \\\"\\\\nFirst duplicated number: A(\\\"\\n || int$unparse(i) || \\\") = \\\" || int$unparse(n))\\n end\\n\\n % Find the amount of terms needed to generate all integers 0..1000\\n begin\\n seen: array[bool] := array[bool]$fill(0,1001,false)\\n left: int := 1001\\n n: int := -1\\n while left > 0 do\\n n := n + 1\\n if A[n] <= 1000 cand ~seen[A[n]] then\\n left := left - 1\\n seen[A[n]] := true\\n end\\n end\\n stream$putl(po, \\\"Terms needed to generate [0..1000]: \\\"\\n || int$unparse(n))\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. RECAMAN.\\n\\n DATA DIVISION.\\n WORKING-STORAGE SECTION.\\n 01 RECAMAN-SEQUENCE COMP.\\n 02 A PIC 999 OCCURS 99 TIMES INDEXED BY I.\\n 02 N PIC 999 VALUE 0.\\n\\n 01 VARIABLES COMP.\\n 02 ADDC PIC S999.\\n 02 SUBC PIC S999.\\n 02 SPTR PIC 99 VALUE 1.\\n\\n 01 OUTPUT-FORMAT.\\n 02 OUTI PIC Z9.\\n 02 OUTN PIC BZ9.\\n 02 OUTS PIC X(79).\\n\\n PROCEDURE DIVISION.\\n BEGIN.\\n PERFORM GENERATE-NEXT-ITEM 15 TIMES.\\n PERFORM COLLATE-ITEM VARYING I FROM 1 BY 1\\n UNTIL I IS GREATER THAN 15.\\n DISPLAY 'First 15 items:' OUTS.\\n\\n FIND-REPEATING.\\n PERFORM GENERATE-NEXT-ITEM.\\n SET I TO 1.\\n SEARCH A VARYING I\\n WHEN I IS NOT LESS THAN N\\n NEXT SENTENCE\\n WHEN A(I) IS EQUAL TO A(N)\\n SUBTRACT 1 FROM N GIVING OUTI\\n MOVE A(N) TO OUTN\\n DISPLAY 'First repeated item: A(' OUTI ') =' OUTN\\n STOP RUN.\\n GO TO FIND-REPEATING.\\n\\n GENERATE-NEXT-ITEM.\\n IF N IS EQUAL TO ZERO\\n MOVE ZERO TO A(1)\\n ELSE\\n ADD N, A(N) GIVING ADDC\\n SUBTRACT N FROM A(N) GIVING SUBC\\n IF SUBC IS NOT GREATER THAN ZERO\\n MOVE ADDC TO A(N + 1)\\n ELSE\\n SET I TO 1\\n SEARCH A VARYING I\\n WHEN I IS NOT LESS THAN N\\n MOVE SUBC TO A(N + 1)\\n WHEN A(I) IS EQUAL TO SUBC\\n MOVE ADDC TO A(N + 1).\\n ADD 1 TO N.\\n\\n COLLATE-ITEM.\\n MOVE A(I) TO OUTN.\\n STRING OUTN DELIMITED BY SIZE INTO OUTS WITH POINTER SPTR.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"0010 DIM a#(0:100)\\n0020 //\\n0030 // Print the first 15 items\\n0040 PRINT \\\"First 15 items: \\\",\\n0050 FOR i#:=0 TO 14 DO PRINT reca#(i#);\\n0060 PRINT\\n0070 //\\n0080 // Find and print the first repeated item\\n0090 i#:=15\\n0100 WHILE NOT find#(i#,reca#(i#)) DO i#:+1\\n0110 PRINT \\\"First repeated item: A(\\\",i#,\\\") = \\\",a#(i#)\\n0120 //\\n0130 // Generate the n'th member of the Recaman sequence\\n0140 FUNC reca#(n#)\\n0150 IF n#=0 THEN RETURN 0\\n0160 a#(n#):=a#(n#-1)-n#\\n0180 IF a#(n#)<=0 OR find#(n#,a#(n#)) THEN a#(n#):=a#(n#-1)+n#\\n0190 RETURN a#(n#)\\n0200 ENDFUNC reca#\\n0210 //\\n0220 // See if a number occurs before the n'th member of the Recaman sequence\\n0230 FUNC find#(n#,num#)\\n0240 FOR x#:=0 TO n#-1 DO IF a#(x#)=num# THEN RETURN x#\\n0250 RETURN 0\\n0260 ENDFUNC find#\\n0270 END\\n\",\n \"language\": \"Comal\"\n },\n {\n \"code\": \"import std.stdio;\\n\\nvoid main() {\\n int[] a;\\n bool[int] used;\\n bool[int] used1000;\\n bool foundDup;\\n\\n a ~= 0;\\n used[0] = true;\\n used1000[0] = true;\\n\\n int n = 1;\\n while (n <= 15 || !foundDup || used1000.length < 1001) {\\n int next = a[n - 1] - n;\\n if (next < 1 || (next in used) !is null) {\\n next += 2 * n;\\n }\\n bool alreadyUsed = (next in used) !is null;\\n a ~= next;\\n if (!alreadyUsed) {\\n used[next] = true;\\n if (0 <= next && next <= 1000) {\\n used1000[next] = true;\\n }\\n }\\n if (n == 14) {\\n writeln(\\\"The first 15 terms of the Recaman sequence are: \\\", a);\\n }\\n if (!foundDup && alreadyUsed) {\\n writefln(\\\"The first duplicated term is a[%d] = %d\\\", n, next);\\n foundDup = true;\\n }\\n if (used1000.length == 1001) {\\n writefln(\\\"Terms up to a[%d] are needed to generate 0 to 1000\\\", n);\\n }\\n n++;\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"proc nonrec find([*] int A; word top; int n) bool:\\n word i;\\n bool found;\\n i := 0;\\n found := false;\\n while i < top and not found do\\n found := A[i] = n;\\n i := i + 1\\n od;\\n found\\ncorp\\n\\nproc nonrec gen_next([*] int A; word n) int:\\n int add, sub;\\n add := A[n-1] + n;\\n sub := A[n-1] - n;\\n A[n] :=\\n if sub > 0 and not find(A, n, sub)\\n then sub\\n else add\\n fi;\\n A[n]\\ncorp\\n\\nproc nonrec main() void:\\n [30] int A;\\n word i;\\n\\n A[0] := 0;\\n write(\\\"First 15 items: 0\\\");\\n for i from 1 upto 14 do write(gen_next(A, i):3) od;\\n writeln();\\n\\n while not find(A, i, gen_next(A, i)) do i := i + 1 od;\\n writeln(\\\"First repeated item: A(\\\", i:2, \\\") = \\\", A[i]:2)\\ncorp\\n\",\n \"language\": \"Draco\"\n },\n {\n \"code\": \"arrbase a[] 0\\narrbase seen[] 0\\nlen seen[] 100\\n#\\na[] &= 0\\nseen[0] = 1\\ni = 1\\nrepeat\\n h = a[i - 1] - i\\n if h <= 0 or seen[h] = 1\\n h = a[i - 1] + i\\n .\\n until seen[h] = 1\\n seen[h] = 1\\n a[] &= h\\n if i = 14\\n print a[]\\n .\\n i += 1\\n.\\nprint h\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"01.10 T \\\"FIRST 15\\\"\\n01.20 F N=0,14;D 2;T %2,A(N)\\n01.30 T !\\\"FIRST REPEATED\\\"\\n01.40 D 2;S Y=1\\n01.50 F M=0,N-1;S Y=Y*(A(M)-A(N))\\n01.60 I (Y)1.7,1.8,1.7\\n01.70 S N=N+1;G 1.4\\n01.80 T A(N),\\\" AT A(\\\",N,\\\")\\\"!\\n01.90 Q\\n\\n02.05 I (N)2.1,2.06,2.1\\n02.06 A(0)=0;R\\n02.10 S X=A(N-1)-N\\n02.20 I (X)2.7\\n02.30 S Y=1\\n02.40 F M=0,N-1;S Y=Y*(A(M)-X)\\n02.50 I (Y)2.6,2.7,2.6\\n02.60 S A(N)=X;R\\n02.70 S A(N)=A(N-1)+N\\n\",\n \"language\": \"FOCAL\"\n },\n {\n \"code\": \": array ( n -- ) ( i -- addr)\\n create cells allot\\n does> swap cells + ;\\n\\n100 array sequence\\n\\n: sequence. ( n -- ) cr 0 ?do i sequence @ . loop ;\\n\\n: ?unused ( n -- t | n )\\n 100 0 ?do\\n dup i sequence @ = if unloop exit then\\n loop drop true ;\\n\\n: sequence-next ( n -- a[n] )\\n dup 0= if 0 0 sequence ! exit then ( case a[0]=0 )\\n dup dup 1- sequence @ swap - ( a[n]=a[n-1]-n )\\n dup dup 0> swap ?unused true = and if\\n nip exit then drop\\n dup 1- sequence @ swap + ; ( a[n]=a[n-1]+n )\\n\\n: sequence-gen ( n -- )\\n 0 ?do i sequence-next i sequence ! loop ;\\n\\n: sequence-repeated\\n 100 0 ?do\\n i 0 ?do\\n i sequence @ j sequence @ = if\\n cr .\\\" first repeated : a[\\\" i . .\\\" ]=a[\\\" j . .\\\" ]=\\\" i sequence @ . unloop unloop exit then\\n loop\\n loop ;\\n\\n100 sequence-gen\\n15 sequence.\\nsequence-repeated\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"' version 26-01-2019\\n' compile with: fbc -s console\\n\\nDim As UByte used()\\nDim As Integer sum, temp\\nDim As UInteger n, max, count, i\\n\\nmax = 1000 : ReDim used(max)\\n\\nPrint \\\"The first 15 terms are 0\\\";\\n\\nFor n = 0 To 14\\n temp = sum - n\\n If temp < 1 OrElse used(temp) = 1 Then\\n temp = sum + n\\n End If\\n If temp <= max Then used(temp) = 1\\n sum = temp\\n Print sum;\\nNext\\n\\n\\nsum = 0 : max = 1000 : ReDim used(max)\\nPrint : Print\\n\\nFor n = 0 To 50\\n temp = sum - n\\n If temp < 1 OrElse used(temp) = 1 Then\\n temp = sum + n\\n End If\\n If used(temp) = 1 Then\\n Print \\\"First duplicated number is a(\\\" + Str(n) + \\\")\\\"\\n Exit For\\n End If\\n If temp <= max Then used(temp) = 1\\n sum = temp\\nNext\\n\\n\\nsum = 0 : max = 2000000 : ReDim used(max)\\nPrint : Print\\n\\nFor n = 0 To max\\n temp = sum - n\\n If temp < 1 OrElse used(temp) = 1 Then\\n temp = sum + n\\n End If\\n If temp <= max Then used(temp) = 1\\n If i = temp Then\\n While used(i) = 1\\n i += 1\\n If i > 1000 Then\\n Exit For\\n End If\\n Wend\\n End If\\n sum = temp\\n count += 1\\nNext\\n\\nPrint \\\"All integers from 0 to 1000 are generated in \\\" & count & \\\" terms\\\"\\nPrint\\n\\n' empty keyboard buffer\\nWhile Inkey <> \\\"\\\" : Wend\\nPrint : Print \\\"hit any key to end program\\\"\\nSleep\\nEnd\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc main() {\\n a := []int{0}\\n used := make(map[int]bool, 1001)\\n used[0] = true\\n used1000 := make(map[int]bool, 1001)\\n used1000[0] = true\\n for n, foundDup := 1, false; n <= 15 || !foundDup || len(used1000) < 1001; n++ {\\n next := a[n-1] - n\\n if next < 1 || used[next] {\\n next += 2 * n\\n }\\n alreadyUsed := used[next]\\n a = append(a, next)\\n\\n if !alreadyUsed {\\n used[next] = true\\n if next >= 0 && next <= 1000 {\\n used1000[next] = true\\n }\\n }\\n\\n if n == 14 {\\n fmt.Println(\\\"The first 15 terms of the Recaman's sequence are:\\\", a)\\n }\\n\\n if !foundDup && alreadyUsed {\\n fmt.Printf(\\\"The first duplicated term is a[%d] = %d\\\\n\\\", n, next)\\n foundDup = true\\n }\\n\\n if len(used1000) == 1001 {\\n fmt.Printf(\\\"Terms up to a[%d] are needed to generate 0 to 1000\\\\n\\\", n)\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"recaman :: Int -> [Int]\\nrecaman n = fst <$> reverse (go n)\\n where\\n go 0 = []\\n go 1 = [(0, 1)]\\n go x =\\n let xs@((r, i):_) = go (pred x)\\n back = r - i\\n in ( if 0 < back && not (any ((back ==) . fst) xs)\\n then back\\n else r + i\\n , succ i) :\\n xs\\n\\nmain :: IO ()\\nmain = print $ recaman 15\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Set (Set, fromList, insert, isSubsetOf, member, size)\\nimport Data.Bool (bool)\\n\\nfirstNRecamans :: Int -> [Int]\\nfirstNRecamans n = reverse $ recamanUpto (\\\\(_, i, _) -> n == i)\\n\\nfirstDuplicateR :: Int\\nfirstDuplicateR = head $ recamanUpto (\\\\(rs, _, set) -> size set /= length rs)\\n\\nrecamanSuperset :: Set Int -> [Int]\\nrecamanSuperset setInts =\\n tail $ recamanUpto (\\\\(_, _, setR) -> isSubsetOf setInts setR)\\n\\nrecamanUpto :: (([Int], Int, Set Int) -> Bool) -> [Int]\\nrecamanUpto p = rs\\n where\\n (rs, _, _) =\\n until\\n p\\n (\\\\(rs@(r:_), i, seen) ->\\n let n = nextR seen i r\\n in (n : rs, succ i, insert n seen))\\n ([0], 1, fromList [0])\\n\\nnextR :: Set Int -> Int -> Int -> Int\\nnextR seen i r =\\n let back = r - i\\n in bool back (r + i) (0 > back || member back seen)\\n\\n-- TEST ---------------------------------------------------------------\\nmain :: IO ()\\nmain =\\n (putStrLn . unlines)\\n [ \\\"First 15 Recamans:\\\"\\n , show $ firstNRecamans 15\\n , []\\n , \\\"First duplicated Recaman:\\\"\\n , show firstDuplicateR\\n , []\\n , \\\"Length of Recaman series required to include [0..1000]:\\\"\\n , (show . length . recamanSuperset) $ fromList [0 .. 1000]\\n ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.List (find, findIndex, nub)\\nimport Data.Maybe (fromJust)\\nimport Data.Set (Set, fromList, insert, isSubsetOf, member)\\n\\n--- INFINITE STREAM OF RECAMAN SERIES OF GROWING LENGTH --\\nrSeries :: [[Int]]\\nrSeries =\\n scanl\\n ( \\\\rs@(r : _) i ->\\n let back = r - i\\n nxt\\n | 0 > back || elem back rs = r + i\\n | otherwise = back\\n in nxt : rs\\n )\\n [0]\\n [1 ..]\\n\\n----------- INFINITE STREAM OF RECAMAN-GENERATED ---------\\n--------------- INTEGER SETS OF GROWING SIZE -------------\\nrSets :: [(Set Int, Int)]\\nrSets =\\n scanl\\n ( \\\\(seen, r) i ->\\n let back = r - i\\n nxt\\n | 0 > back || member back seen = r + i\\n | otherwise = back\\n in (insert nxt seen, nxt)\\n )\\n (fromList [0], 0)\\n [1 ..]\\n\\n--------------------------- TEST -------------------------\\nmain :: IO ()\\nmain = do\\n let setK = fromList [0 .. 1000]\\n (putStrLn . unlines)\\n [ \\\"First 15 Recamans:\\\",\\n show . reverse . fromJust $ find ((15 ==) . length) rSeries,\\n [],\\n \\\"First duplicated Recaman:\\\",\\n show . head . fromJust $ find ((/=) <$> length <*> (length . nub)) rSeries,\\n [],\\n \\\"Length of Recaman series required to include [0..1000]:\\\",\\n show . fromJust $ findIndex (\\\\(setR, _) -> isSubsetOf setK setR) rSets\\n ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"average =: +/ % #\\nNB. extra_data u Bsearch bounds\\nNB. Bsearch returns narrowed bounds depending if u return 0 (left) or 1 (right)\\nNB. u is called as extra_data u index\\nNB. or as index u index\\nNB. u is invoked as a dyad\\nBsearch =: 1 :'((0 1 + (u <.@:average)) { ({. , <.@:average, {:)@:])^:_'\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.HashSet;\\nimport java.util.List;\\nimport java.util.Set;\\n\\npublic class RecamanSequence {\\n public static void main(String[] args) {\\n List<Integer> a = new ArrayList<>();\\n a.add(0);\\n\\n Set<Integer> used = new HashSet<>();\\n used.add(0);\\n\\n Set<Integer> used1000 = new HashSet<>();\\n used1000.add(0);\\n\\n boolean foundDup = false;\\n int n = 1;\\n while (n <= 15 || !foundDup || used1000.size() < 1001) {\\n int next = a.get(n - 1) - n;\\n if (next < 1 || used.contains(next)) {\\n next += 2 * n;\\n }\\n boolean alreadyUsed = used.contains(next);\\n a.add(next);\\n if (!alreadyUsed) {\\n used.add(next);\\n if (0 <= next && next <= 1000) {\\n used1000.add(next);\\n }\\n }\\n if (n == 14) {\\n System.out.printf(\\\"The first 15 terms of the Recaman sequence are : %s\\\\n\\\", a);\\n }\\n if (!foundDup && alreadyUsed) {\\n System.out.printf(\\\"The first duplicate term is a[%d] = %d\\\\n\\\", n, next);\\n foundDup = true;\\n }\\n if (used1000.size() == 1001) {\\n System.out.printf(\\\"Terms up to a[%d] are needed to generate 0 to 1000\\\\n\\\", n);\\n }\\n n++;\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"(() => {\\n const main = () => {\\n\\n console.log(\\n 'First 15 Recaman:\\\\n' +\\n recamanUpto(i => 15 === i)\\n );\\n\\n console.log(\\n '\\\\n\\\\nFirst duplicated Recaman:\\\\n' +\\n last(recamanUpto(\\n (_, set, rs) => set.size !== rs.length\\n ))\\n );\\n\\n const setK = new Set(enumFromTo(0, 1000));\\n console.log(\\n '\\\\n\\\\nNumber of Recaman terms needed to generate' +\\n '\\\\nall integers from [0..1000]:\\\\n' +\\n (recamanUpto(\\n (_, setR) => isSubSetOf(setK, setR)\\n ).length - 1)\\n );\\n };\\n\\n // RECAMAN --------------------------------------------\\n\\n // recamanUpto :: (Int -> Set Int > [Int] -> Bool) -> [Int]\\n const recamanUpto = p => {\\n let\\n i = 1,\\n r = 0, // First term of series\\n rs = [r];\\n const seen = new Set(rs);\\n while (!p(i, seen, rs)) {\\n r = nextR(seen, i, r);\\n seen.add(r);\\n rs.push(r);\\n i++;\\n }\\n return rs;\\n }\\n\\n // Next Recaman number.\\n\\n // nextR :: Set Int -> Int -> Int\\n const nextR = (seen, i, n) => {\\n const back = n - i;\\n return (0 > back || seen.has(back)) ? (\\n n + i\\n ) : back;\\n };\\n\\n // GENERIC --------------------------------------------\\n\\n // enumFromTo :: Int -> Int -> [Int]\\n const enumFromTo = (m, n) =>\\n m <= n ? iterateUntil(\\n x => n <= x,\\n x => 1 + x,\\n m\\n ) : [];\\n\\n // isSubsetOf :: Ord a => Set a -> Set a -> Bool\\n const isSubSetOf = (a, b) => {\\n for (let x of a) {\\n if (!b.has(x)) return false;\\n }\\n return true;\\n };\\n\\n // iterateUntil :: (a -> Bool) -> (a -> a) -> a -> [a]\\n const iterateUntil = (p, f, x) => {\\n const vs = [x];\\n let h = x;\\n while (!p(h))(h = f(h), vs.push(h));\\n return vs;\\n };\\n\\n // last :: [a] -> a\\n const last = xs =>\\n 0 < xs.length ? xs.slice(-1)[0] : undefined;\\n\\n // MAIN ------------------------------------------------\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Let R[n] be the Recaman sequence, n >= 0, so R[0]=0.\\n# Input: a number, $required, specifying the required range of integers, [1 .. $required]\\n# to be covered by R[0] ... R[.n]\\n# $capture: the number of elements of the sequence to retain.\\n# Output: an object as described below.\\n# Note that .a|length will be equal to $capture.\\n#\\ndef recaman_required($capture):\\n . as $required\\n | {\\n n: 0,\\n current: 0, # R[.n]\\n previous: null, # R[.n-1]\\n a: [0], # only maintained up to a[$capture-1]\\n used: { \\\"0\\\": true }, # hash for checking whether a value has already occurred\\n found: { \\\"0\\\": true }, # hash for checking how many in [0 .. $required] inclusive have been found\\n nfound: 1, # .found|length\\n foundDup: null, # the first duplicated entry in the sequence\\n foundDupAt: null # .foundDup == R[.foundDupAt]\\n }\\n | until ((.n >= $capture) and .foundDup and (.nfound > $required);\\n .n += 1\\n | .current -= .n\\n | if (.current < 1 or .used[.current|tostring]) then .current = .current + 2*.n else . end\\n | (.current|tostring) as $s\\n | .used[$s] as $alreadyUsed\\n | if .n < $capture then .a += [.current] else . end\\n | if ($alreadyUsed|not)\\n then .used[$s] = true\\n\\t| if (.current >= 0 and .current <= $required)\\n\\t then .found[$s] = true | .nfound+=1\\n\\t else . end\\n else .\\n\\tend\\n | if (.foundDup|not) and $alreadyUsed\\n then .foundDup = .current\\n\\t| .foundDupAt = .n\\n else .\\n\\tend );\\n\\t\\n1000 as $required\\n| 15 as $capture\\n| $required | recaman_required($capture)\\n| \\\"The first \\\\($capture) terms of Recaman's sequence are: \\\\(.a)\\\",\\n \\\"The first duplicated term is a[\\\\(.foundDupAt)] = \\\\(.foundDup)\\\",\\n \\\"Terms up to a[\\\\(.n)] are needed to generate 0 to \\\\($required) inclusive.\\\"\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Output: the stream of elements in the Recaman sequence, beginning with 0.\\ndef recaman:\\n 0,\\n foreach range(1; infinite) as $i ({used: {\\\"0\\\": true}, current: 0};\\n (.current - $i) as $next\\n | .current = (if ($next < 1 or .used[$next|tostring]) then $next + 2 * $i else $next end)\\n | .used[.current|tostring] = true;\\n .current );\\n\\n# emit [.i, $x] for duplicated terms using IO==0\\ndef duplicated(s):\\n foreach s as $x ({used: {}, i: -1};\\n .i += 1\\n | ($x|tostring) as $xs\\n | if .used[$xs] then .emit = [.i, $x] else .used[$xs] = true end;\\n select(.emit) | .emit);\\n\\n# Input: an integer, $required\\n# s: a stream of non-negative integers\\n# Output: the index of the item in the stream s at which the stream up to and including\\n# that item includes all integers in the closed interval [0 .. $required].\\n#\\ndef covers(s):\\n . as $required\\n | first(foreach s as $x ( { i: -1, found: {}, nfound: 0};\\n .i += 1\\n\\t | ($x|tostring) as $xs\\n | if .found[$xs] then .\\n\\t elif $x <= $required\\n\\t then .found[$xs] = true | .nfound += 1\\n\\t | if .nfound > $required then .emit=.i else . end\\n\\t else .\\n\\t end;\\n select(.emit).emit) );\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"\\\"First 15:\\\", limit(15; recaman),\\n\\n\\\"\\\\First duplicated:\\\", first(duplicated(recaman)),\\n\\n\\\"\\\\Index of first element to include 0 to 1000 inclusive:\\\",\\n(1000|covers(recaman))\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function recaman()\\n a = Vector{Int}([0])\\n used = Dict{Int, Bool}(0 => true)\\n used1000 = Set(0)\\n founddup = false\\n termcount = 1\\n while length(used1000) <= 1000\\n nextterm = a[termcount] - termcount\\n if nextterm < 1 || haskey(used, nextterm)\\n nextterm += termcount + termcount\\n end\\n push!(a, nextterm)\\n if !haskey(used, nextterm)\\n used[nextterm] = true\\n if 1 <= nextterm <= 1000\\n push!(used1000, nextterm)\\n end\\n elseif !founddup\\n println(\\\"The first duplicated term is a[$(termcount + 1)] = $nextterm.\\\")\\n founddup = true\\n end\\n if termcount == 14\\n println(\\\"The first 15 terms of the Recaman sequence are $a\\\")\\n end\\n termcount += 1\\n end\\n println(\\\"Terms up to $(termcount - 1) are needed to generate 0 to 1000.\\\")\\nend\\n\\nrecaman()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// Version 1.2.60\\n\\nfun main(args: Array<String>) {\\n val a = mutableListOf(0)\\n val used = mutableSetOf(0)\\n val used1000 = mutableSetOf(0)\\n var foundDup = false\\n var n = 1\\n while (n <= 15 || !foundDup || used1000.size < 1001) {\\n var next = a[n - 1] - n\\n if (next < 1 || used.contains(next)) next += 2 * n\\n val alreadyUsed = used.contains(next)\\n a.add(next)\\n if (!alreadyUsed) {\\n used.add(next)\\n if (next in 0..1000) used1000.add(next)\\n }\\n if (n == 14) {\\n println(\\\"The first 15 terms of the Recaman's sequence are: $a\\\")\\n }\\n if (!foundDup && alreadyUsed) {\\n println(\\\"The first duplicated term is a[$n] = $next\\\")\\n foundDup = true\\n }\\n if (used1000.size == 1001) {\\n println(\\\"Terms up to a[$n] are needed to generate 0 to 1000\\\")\\n }\\n n++\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"local a = {[0]=0}\\nlocal used = {[0]=true}\\nlocal used1000 = {[0]=true}\\nlocal foundDup = false\\nlocal n = 1\\n\\nwhile n<=15 or not foundDup or #used1000<1001 do\\n local nxt = a[n - 1] - n\\n if nxt<1 or used[nxt] ~= nil then\\n nxt = nxt + 2 * n\\n end\\n local alreadyUsed = used[nxt] ~= nil\\n table.insert(a, nxt)\\n if not alreadyUsed then\\n used[nxt] = true\\n if 0<=nxt and nxt<=1000 then\\n used1000[nxt] = true\\n end\\n end\\n if n==14 then\\n io.write(\\\"The first 15 terms of the Recaman sequence are:\\\")\\n for k=0,#a do\\n io.write(\\\" \\\"..a[k])\\n end\\n print()\\n end\\n if not foundDup and alreadyUsed then\\n print(\\\"The first duplicated term is a[\\\"..n..\\\"] = \\\"..nxt)\\n foundDup = true\\n end\\n if #used1000 == 1001 then\\n print(\\\"Terms up to a[\\\"..n..\\\"] are needed to generate 0 to 1000\\\")\\n end\\n n = n + 1\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \" NORMAL MODE IS INTEGER\\n VECTOR VALUES ELEMF = $2HA(,I2,4H) = ,I2*$\\n DIMENSION A(100)\\n A(0) = 0\\n\\n PRINT COMMENT $ FIRST 15 ELEMENTS$\\n PRINT FORMAT ELEMF,0,0\\n THROUGH EL, FOR I=1, 1, I.GE.15\\nEL PRINT FORMAT ELEMF,I,NEXT.(I)\\n\\n PRINT COMMENT $ $\\n PRINT COMMENT $ FIRST REPEATED ELEMENT$\\nRPT THROUGH RPT, FOR I=I, 1, FIND.(I,NEXT.(I))\\n PRINT FORMAT ELEMF,I,A(I)\\n\\n INTERNAL FUNCTION(N,TOP)\\n ENTRY TO FIND.\\n FI=0\\nSRCH WHENEVER FI.GE.TOP, FUNCTION RETURN 0B\\n WHENEVER A(FI).E.N, FUNCTION RETURN 1B\\n FI=FI+1\\n TRANSFER TO SRCH\\n END OF FUNCTION\\n\\n INTERNAL FUNCTION(N)\\n ENTRY TO NEXT.\\n HI=A(N-1)+N\\n LO=A(N-1)-N\\n WHENEVER LO.L.0\\n A(N)=HI\\n OR WHENEVER FIND.(LO,N)\\n A(N)=HI\\n OTHERWISE\\n A(N)=LO\\n END OF CONDITIONAL\\n FUNCTION RETURN A(N)\\n END OF FUNCTION\\n END OF PROGRAM\\n\",\n \"language\": \"MAD\"\n },\n {\n \"code\": \"ClearAll[f]\\nf[s_List] := Block[{a = s[[-1]], len = Length@s},\\n Append[s, If[a > len && ! MemberQ[s, a - len], a - len, a + len]]]; g = Nest[f, {0}, 70]\\ng = Nest[f, {0}, 70];\\nTake[g, 15]\\np = Select[Tally[g], Last /* EqualTo[2]][[All, 1]]\\np = Flatten[Position[g, #]] & /@ p;\\nTakeSmallestBy[p, Last, 1][[1]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"' Recaman's sequence - smallbasic - 05/08/2015\\n nn=15\\n TextWindow.WriteLine(\\\"Recaman's sequence for the first \\\" + nn + \\\" numbers:\\\")\\n recaman()\\n TextWindow.WriteLine(Text.GetSubTextToEnd(recaman,2))\\n nn=\\\"firstdup\\\"\\n recaman()\\n TextWindow.WriteLine(\\\"The first duplicated term is a[\\\"+n+\\\"]=\\\"+a[n])\\n\\nSub recaman\\n a=\\\"\\\"\\n b=\\\"\\\"\\n dup=\\\"\\\"\\n recaman=\\\"\\\"\\n firstdup=\\\"\\\"\\n If nn=\\\"firstdup\\\" Then\\n nn=1000\\n firstdup=\\\"True\\\"\\n EndIf\\n For n=0 To nn-1\\n ap=a[n-1]+n\\n If a[n-1]<=n Then\\n a[n]=ap 'a[n]=a[n-1]+n\\n b[ap]=1\\n Else\\n am=a[n-1]-n\\n If b[am]=1 Then\\n a[n]=ap 'a[n]=a[n-1]+n\\n b[ap]=1\\n Else\\n a[n]=am 'a[n]=a[n-1]-n\\n b[am]=1\\n EndIf\\n EndIf\\n If firstdup Then\\n If dup[a[n]]=1 Then\\n Goto exitsub\\n EndIf\\n dup[a[n]]=1\\n EndIf\\n recaman=recaman+\\\",\\\"+a[n]\\n EndFor\\n exitsub:\\nEndSub\\n\",\n \"language\": \"Microsoft-Small-Basic\"\n },\n {\n \"code\": \"10 DIM A(100)\\n20 PRINT \\\"FIRST 15 TERMS:\\\"\\n30 FOR N=0 TO 14\\n40 GOSUB 170\\n50 PRINT A(N);\\\" \\\";\\n60 NEXT N\\n70 PRINT\\n80 PRINT \\\"FIRST REPEATED TERM:\\\"\\n90 GOSUB 170\\n100 FOR M=0 TO N-1\\n110 IF A(M)=A(N) THEN 150\\n120 NEXT M\\n130 LET N=N+1\\n140 GOTO 90\\n150 PRINT \\\"A(\\\";N;\\\") = \\\";A(N)\\n160 STOP\\n170 IF N=0 THEN 280\\n180 LET X = A(N-1)-N\\n190 IF X<0 THEN 250\\n200 FOR M=0 TO N-1\\n210 IF A(M)=X THEN 250\\n220 NEXT M\\n230 LET A(N)=X\\n240 RETURN\\n250 LET A(N)=A(N-1)+N\\n260 RETURN\\n270 STOP\\n280 LET A(0)=0\\n290 RETURN\\n300 END\\n\",\n \"language\": \"Minimal-BASIC\"\n },\n {\n \"code\": \"import sequtils, sets, strutils\\n\\niterator recaman(num: Positive = Natural.high): tuple[n, a: int; duplicate: bool] =\\n var a = 0\\n yield (0, a, false)\\n var known = [0].toHashSet\\n for n in 1..<num:\\n var next = a - n\\n if next <= 0 or next in known:\\n next = a + n\\n a = next\\n yield (n, a, a in known)\\n known.incl a\\n\\necho \\\"First 15 numbers in Recaman’s sequence: \\\", toSeq(recaman(15)).mapIt(it.a).join(\\\" \\\")\\n\\nfor (n, a, dup) in recaman():\\n if dup:\\n echo \\\"First duplicate found: a($1) = $2\\\".format(n, a)\\n break\\n\\nvar target = toSeq(0..1000).toHashSet\\nfor (n, a, dup) in recaman():\\n target.excl a\\n if target.card == 0:\\n echo \\\"All numbers from 0 to 1000 generated after $1 terms.\\\".format(n)\\n break\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use Collection.Generic;\\n\\nclass RecamanSequence {\\n function : Main(args : String[]) ~ Nil {\\n GenerateSequence();\\n }\\n\\n function : native : GenerateSequence() ~ Nil {\\n a := Vector->New()<IntHolder>;\\n a->AddBack(0);\\n\\n used := Set->New()<IntHolder>;\\n used->Insert(0);\\n\\n used1000 := Set->New()<IntHolder>;\\n used1000->Insert(0);\\n\\n foundDup := false;\\n n := 1;\\n while (n <= 15 | <>foundDup | used1000->Size() < 1001) {\\n next := a->Get(n - 1) - n;\\n if (next < 1 | used->Has(next)) {\\n next += 2 * n;\\n };\\n alreadyUsed := used->Has(next);\\n a->AddBack(next);\\n if (<>alreadyUsed) {\\n used->Insert(next);\\n if (0 <= next & next <= 1000) {\\n used1000->Insert(next);\\n };\\n };\\n if (n = 14) {\\n str := ToString(a);\\n \\\"The first 15 terms of the Recaman sequence are : {$str}\\\"->PrintLine();\\n };\\n if (<>foundDup & alreadyUsed) {\\n \\\"The first duplicate term is a[{$n}] := {$next}\\\"->PrintLine();\\n foundDup := true;\\n };\\n if (used1000->Size() = 1001) {\\n \\\"Terms up to a[{$n}] are needed to generate 0 to 1000\\\"->PrintLine();\\n };\\n n++;\\n };\\n }\\n\\n function : ToString(a : Vector<IntHolder>) ~ String {\\n out := \\\"[\\\";\\n each(i : a) {\\n out += a->Get(i)->Get();\\n if(i + 1 < a->Size()) {\\n out += ',';\\n };\\n };\\n out += ']';\\n\\n return out;\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"use bignum;\\n\\n$max = 1000;\\n$remaining += $_ for 1..$max;\\n\\nmy @recamans = 0;\\nmy $previous = 0;\\n\\nwhile ($remaining > 0) {\\n $term++;\\n my $this = $previous - $term;\\n $this = $previous + $term unless $this > 0 and !$seen{$this};\\n push @recamans, $this;\\n $dup = $term if !$dup and defined $seen{$this};\\n $remaining -= $this if $this <= $max and ! defined $seen{$this};\\n $seen{$this}++;\\n $previous = $this;\\n}\\n\\nprint \\\"First fifteen terms of Recaman's sequence: \\\" . join(' ', @recamans[0..14]) . \\\"\\\\n\\\";\\nprint \\\"First duplicate at term: a[$dup]\\\\n\\\";\\nprint \\\"Range 0..1000 covered by terms up to a[$term]\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">found_duplicate</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000000;\\\">used</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (grows to 1,942,300 entries)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">all_used</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">next</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">prev</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">15</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">found_duplicate</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">all_used</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">1000</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">next</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">prev</span> <span style=\\\"color: #0000FF;\\\">-</span> <span style=\\\"color: #000000;\\\">n</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">next</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">next</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">used</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">used</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">next</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">next</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">prev</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">n</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">a</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">next</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">padlen</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">next</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">used</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">already_used</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">padlen</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">used</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">next</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">already_used</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">padlen</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">used</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">padlen</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">used</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">next</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">all_used</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">used</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">used</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">all_used</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">all_used</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">15</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"The first 15 terms of the Recaman sequence are: %v\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">already_used</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">found_duplicate</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"The first duplicated term is a[%d] = %d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">next</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">found_duplicate</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">;</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">all_used</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">1000</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Terms up to a[%d] are needed to generate 0 to 1000\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">});</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">prev</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">next</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\n$a = array();\\narray_push($a, 0);\\n\\n$used = array();\\narray_push($used, 0);\\n\\n$used1000 = array();\\narray_push($used1000, 0);\\n\\n$foundDup = false;\\n$n = 1;\\n\\nwhile($n <= 15 || !$foundDup || count($used1000) < 1001) {\\n\\t$next = $a[$n - 1] - $n;\\n\\tif ($next < 1 || in_array($next, $used)) {\\n\\t\\t$next += 2 * $n;\\n\\t}\\n\\t$alreadyUsed = in_array($next, $used);\\n\\tarray_push($a, $next);\\n\\tif (!$alreadyUsed) {\\n\\t\\tarray_push($used, $next);\\n\\t\\tif (0 <= $next && $next <= 1000) {\\n\\t\\t\\tarray_push($used1000, $next);\\n\\t\\t}\\n\\t}\\n\\tif ($n == 14) {\\n\\t\\techo \\\"The first 15 terms of the Recaman sequence are : [\\\";\\n\\t\\tforeach($a as $i => $v) {\\n\\t\\t\\tif ( $i == count($a) - 1)\\n\\t\\t\\t\\techo \\\"$v\\\";\\n\\t\\t\\telse\\n\\t\\t\\t\\techo \\\"$v, \\\";\\n\\t\\t}\\n\\t\\techo \\\"]\\\\n\\\";\\n\\t}\\n\\tif (!$foundDup && $alreadyUsed) {\\n\\t\\tprintf(\\\"The first duplicate term is a[%d] = %d\\\\n\\\", $n, $next);\\n\\t\\t$foundDup = true;\\n\\t}\\n\\tif (count($used1000) == 1001) {\\n\\t\\tprintf(\\\"Terms up to a[%d] are needed to generate 0 to 1000\\\\n\\\", $n);\\n\\t}\\n\\t$n++;\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"recaman: procedure options(main);\\n declare A(0:30) fixed;\\n\\n /* is X in the first N terms of the Recaman sequence? */\\n find: procedure(x, n) returns(bit);\\n declare (x, n, i) fixed;\\n do i=0 to n-1;\\n if A(i)=x then return('1'b);\\n end;\\n return('0'b);\\n end find;\\n\\n /* generate the N'th term of the Recaman sequence */\\n generate: procedure(n) returns(fixed);\\n declare n fixed;\\n if n=0 then\\n A(0) = 0;\\n else do;\\n declare (sub, add) fixed;\\n sub = A(n-1) - n;\\n add = A(n-1) + n;\\n /* A(n-1) - n not positive? */\\n if sub <= 0 then\\n A(n) = add;\\n /* A(n-1) - n already generated? */\\n else if find(sub, n) then\\n A(n) = add;\\n else\\n A(n) = sub;\\n end;\\n return(A(n));\\n end generate;\\n\\n declare i fixed;\\n put skip list('First 15 members:');\\n do i=0 to 14;\\n put edit(generate(i)) (F(3));\\n end;\\n\\n put skip list('First repeated term: ');\\n do i=15 repeat(i+1) while(^find(generate(i), i)); end;\\n put edit('A(',i,') = ',A(i)) (A,F(2),A,F(2));\\nend recaman;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"100H:\\nBDOS: PROCEDURE(F,A); DECLARE F BYTE, A ADDRESS; GO TO 5; END BDOS;\\nEXIT: PROCEDURE; CALL BDOS(0,0); END EXIT;\\nPRINT$CH: PROCEDURE(C); DECLARE C BYTE; CALL BDOS(2,C); END PRINT$CH;\\nPRINT$STR: PROCEDURE(S); DECLARE S ADDRESS; CALL BDOS(9,S); END PRINT$STR;\\n\\n/* PRINT NUMBER */\\nPRINT$NUM: PROCEDURE(N);\\n DECLARE (N, P) ADDRESS, C BASED P BYTE;\\n DECLARE S(6) BYTE INITIAL('.....$');\\n P = .S(5);\\nDIGIT:\\n P = P-1;\\n C = '0' + N MOD 10;\\n N = N/10;\\n IF N>0 THEN GO TO DIGIT;\\n CALL PRINT$STR(P);\\nEND PRINT$NUM;\\n\\n/* IS X IN THE FIRST N TERMS OF THE SEQUENCE */\\nFIND: PROCEDURE(SEQ,X,N) BYTE;\\n DECLARE SEQ ADDRESS, (I, X, N, A BASED SEQ) BYTE;\\n DO I=0 TO N-1;\\n IF A(I)=X THEN RETURN 0FFH;\\n END;\\n RETURN 0;\\nEND FIND;\\n\\n/* GENERATE THE N'TH TERM OF THE SEQUENCE */\\nGENERATE: PROCEDURE(SEQ,N) BYTE;\\n DECLARE SEQ ADDRESS, (N, A BASED SEQ) BYTE;\\n IF N=0 THEN\\n A(N)=0;\\n ELSE DO;\\n DECLARE (SUB, ADD) BYTE;\\n SUB = A(N-1) - N;\\n ADD = A(N-1) + N;\\n /* A(N-1) - N NEGATIVE? */\\n IF A(N-1) <= N THEN\\n A(N) = ADD;\\n /* A(N-1) - N ALREADY GENERATED? */\\n ELSE IF FIND(SEQ,SUB,N) THEN\\n A(N) = ADD;\\n ELSE\\n A(N) = SUB;\\n END;\\n RETURN A(N);\\nEND GENERATE;\\n\\nDECLARE I BYTE, A(30) BYTE;\\nCALL PRINT$STR(.'FIRST 15 MEMBERS: $');\\nDO I=0 TO 14;\\n CALL PRINT$NUM(GENERATE(.A, I));\\n CALL PRINT$CH(' ');\\nEND;\\nCALL PRINT$STR(.(13,10,'FIRST REPEATED TERM: A($'));\\n\\nI=15;\\nDO WHILE NOT FIND(.A, GENERATE(.A, I), I);\\n I = I+1;\\nEND;\\n\\nCALL PRINT$NUM(I);\\nCALL PRINT$STR(.') = $');\\nCALL PRINT$NUM(A(I));\\nCALL PRINT$STR(.(13,10,'$'));\\nCALL EXIT;\\nEOF\\n\",\n \"language\": \"PL-M\"\n },\n {\n \"code\": \"#MAX=500000\\nDim a.i(#MAX)\\nDim b.b(1)\\nDim c.b(1000)\\nFillMemory(@c(),1000,1,#PB_Byte)\\n\\nIf OpenConsole() : Else : End 1 : EndIf\\nFor n_Count=0 To #MAX\\n If n_Count=0\\n a(n_Count)=0\\n ElseIf a(n_Count-1)-n_Count>0 And b(a(n_Count-1)-n_Count)=0\\n a(n_Count)=a(n_Count-1)-n_Count\\n Else\\n a(n_Count)=a(n_Count-1)+n_Count\\n EndIf\\n If ArraySize(b())<a(n_Count) : ReDim b(a(n_Count)) : EndIf\\n If b(a(n_Count))=1 And fitD=0 : fitD=n_Count : EndIf\\n b(a(n_Count))=1\\n If CompareMemory(@b(),@c(),1000) And fit1000=0 : fit1000=n_Count : Break : EndIf\\nNext\\n\\nPrint(\\\"First 15 terms: \\\") : For i=0 To 14 : Print(RSet(Str(a(i)),4)) : Next : PrintN(\\\"\\\")\\nPrintN(\\\"First duplicate term : a(\\\"+Str(fitD)+\\\") = \\\"+Str(a(fitD)))\\nPrintN(\\\"Number of Recaman terms needed to generate all integers from [0..1000]: \\\"+Str(fit1000))\\nInput()\\nEnd\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"from itertools import islice\\n\\nclass Recamans():\\n \\\"Recamán's sequence generator callable class\\\"\\n def __init__(self):\\n self.a = None # Set of results so far\\n self.n = None # n'th term (counting from zero)\\n\\n def __call__(self):\\n \\\"Recamán's sequence generator\\\"\\n nxt = 0\\n a, n = {nxt}, 0\\n self.a = a\\n self.n = n\\n yield nxt\\n while True:\\n an1, n = nxt, n + 1\\n nxt = an1 - n\\n if nxt < 0 or nxt in a:\\n nxt = an1 + n\\n a.add(nxt)\\n self.n = n\\n yield nxt\\n\\nif __name__ == '__main__':\\n recamans = Recamans()\\n print(\\\"First fifteen members of Recamans sequence:\\\",\\n list(islice(recamans(), 15)))\\n\\n so_far = set()\\n for term in recamans():\\n if term in so_far:\\n print(f\\\"First duplicate number in series is: a({recamans.n}) = {term}\\\")\\n break\\n so_far.add(term)\\n\\n n = 1_000\\n setn = set(range(n + 1)) # The target set of numbers to be covered\\n for _ in recamans():\\n if setn.issubset(recamans.a):\\n print(f\\\"Range 0 ..{n} is covered by terms up to a({recamans.n})\\\")\\n break\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Recaman sequence'''\\n\\n\\n# recamanUntil :: (Int -> Set Int > [Int] -> Bool) -> [Int]\\ndef recamanUntil(p):\\n '''All terms of the Recaman series before the\\n first term for which the predicate p holds.'''\\n n = 1\\n r = 0 # First term of series\\n rs = [r]\\n seen = set(rs)\\n blnNew = True\\n while not p(seen, n, r, blnNew):\\n r = recamanSucc(seen, n, r)\\n blnNew = r not in seen\\n seen.add(r)\\n rs.append(r)\\n n = 1 + n\\n return rs\\n\\n\\n# recamanSucc :: Set Int -> Int -> Int\\ndef recamanSucc(seen, n, r):\\n '''The successor for a given Recaman term,\\n given the set of Recaman terms seen so far.'''\\n back = r - n\\n return n + r if 0 > back or (back in seen) else back\\n\\n\\n# ------------------------- TEST -------------------------\\n# main :: IO ()\\ndef main():\\n '''Test'''\\n print(\\n 'First 15 Recaman:\\\\r',\\n recamanUntil(\\n lambda seen, n, r, _: 15 == n\\n )\\n )\\n print(\\n 'First duplicated Recaman:\\\\r',\\n recamanUntil(\\n lambda seen, n, r, blnNew: not blnNew\\n )[-1]\\n )\\n setK = set(enumFromTo(0)(1000))\\n print(\\n 'Number of Recaman terms needed to generate',\\n 'all integers from [0..1000]:\\\\r',\\n len(recamanUntil(\\n lambda seen, n, r, blnNew: (\\n blnNew and 1001 > r and setK.issubset(seen)\\n )\\n )) - 1\\n )\\n\\n\\n# ----------------------- GENERIC ------------------------\\n\\n# enumFromTo :: (Int, Int) -> [Int]\\ndef enumFromTo(m):\\n '''Integer enumeration from m to n.'''\\n return lambda n: range(m, 1 + n)\\n\\n\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Recaman by iteration of a function over a tuple.'''\\n\\nfrom itertools import (islice)\\n\\n\\n# recamanTupleSucc :: Set Int -> (Int, Int, Bool) -> (Int, Int, Bool)\\ndef recamanTupleSucc(seen):\\n '''The Nth in a series of Recaman tuples,\\n (N, previous term, boolPreviouslySeen?)\\n given the set of all terms seen so far.'''\\n def go(n, r, _):\\n back = r - n\\n nxt = n + r if 0 > back or (back in seen) else back\\n bln = nxt in seen\\n seen.add(nxt)\\n return (1 + n, nxt, bln)\\n return lambda tpl: go(*tpl)\\n\\n\\n# ------------------------- TEST -------------------------\\n# main :: IO()\\ndef main():\\n '''First 15, and first duplicated Recaman.'''\\n f = recamanTupleSucc(set([0]))\\n print(\\n 'First 15 Recaman:\\\\n',\\n list(map(\\n snd,\\n take(15)(iterate(f)((1, 0, False)))\\n ))\\n )\\n f = recamanTupleSucc(set([0]))\\n print(\\n 'First duplicated Recaman:\\\\n',\\n until(lambda x: x[2])(f)(\\n (1, 0, False)\\n )[1]\\n )\\n\\n sk = set(enumFromTo(0)(1000))\\n sr = set([0])\\n f = recamanTupleSucc(sr)\\n print(\\n 'Number of Recaman terms needed to generate',\\n 'all integers from [0..1000]:\\\\n',\\n until(\\n lambda x: not x[2] and 1001 > x[1] and sk.issubset(sr)\\n )(f)(\\n (1, 0, False)\\n )[0] - 1\\n )\\n\\n\\n# ----------------- GENERIC ABSTRACTIONS -----------------\\n\\n# enumFromTo :: (Int, Int) -> [Int]\\ndef enumFromTo(m):\\n '''Integer enumeration from m to n.'''\\n return lambda n: range(m, 1 + n)\\n\\n\\n# iterate :: (a -> a) -> a -> Gen [a]\\ndef iterate(f):\\n '''An infinite list of repeated\\n applications of f to x.\\n '''\\n def go(x):\\n v = x\\n while True:\\n yield v\\n v = f(v)\\n return go\\n\\n\\n# snd :: (a, b) -> b\\ndef snd(tpl):\\n '''Second component of a tuple.'''\\n return tpl[1]\\n\\n\\n# take :: Int -> [a] -> [a]\\n# take :: Int -> String -> String\\ndef take(n):\\n '''The prefix of xs of length n,\\n or xs itself if n > length xs.'''\\n return lambda xs: (\\n xs[0:n]\\n if isinstance(xs, list)\\n else islice(xs, n)\\n )\\n\\n\\n# until :: (a -> Bool) -> (a -> a) -> a -> a\\ndef until(p):\\n '''The result of repeatedly applying f until p holds.\\n The initial seed value is x.\\n '''\\n def go(f):\\n def g(x):\\n v = x\\n while not p(v):\\n v = f(v)\\n return v\\n return g\\n return go\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ stack 0 ] is seennumbers ( --> s )\\n\\n [ bit seennumbers take\\n | seennumbers put ] is seen ( n --> )\\n\\n [ dup 0 < iff\\n [ drop true ] done\\n bit seennumbers share\\n & 0 != ] is seen? ( n --> b )\\n\\n [ 1+ bit 1 -\\n seennumbers share\\n over & = ] is allseen? ( n --> b )\\n\\n [ stack [ ] ] is repeats ( --> s )\\n\\n [ 1 seennumbers replace\\n [] repeats replace\\n ' [ 0 ] 1 ] is startseq ( --> [ n )\\n\\n [ over -1 peek\\n over - dup seen? if\\n [ over 2 * +\\n dup seen? if\\n [ repeats take\\n over join\\n repeats put ] ]\\n dup seen\\n swap dip join\\n 1+ ] is nextterm ( [ n --> [ n )\\n\\n say \\\"first 15 terms: \\\"\\n startseq\\n 14 times nextterm\\n drop echo cr\\n\\n say \\\"first duplicated term: \\\"\\n startseq\\n [ repeats share [] = while\\n nextterm\\n again ]\\n drop -1 peek echo cr\\n\\n say \\\"terms needed to generate 0 to 1000: \\\"\\n startseq\\n [ nextterm\\n 1000 allseen? until ]\\n nip 1 - echo cr\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"visited <- vector('logical', 1e8)\\n\\nterms <- vector('numeric')\\n\\nin_a_interval <- function(v) {\\n\\tvisited[[v+1]]\\n}\\n\\nadd_value <- function(v) {\\n\\tvisited[[v+1]] <<- TRUE\\n\\tterms <<- append(terms, v)\\n}\\n\\nadd_value(0)\\nstep <- 1\\nvalue <- 0\\n\\nfounddup <- FALSE\\n\\nrepeat {\\n\\tif ((value-step>0) && (!in_a_interval(value-step))) {\\n\\t\\tvalue <- value - step\\n\\t} else {\\n\\t\\tvalue <- value + step\\n\\t}\\n\\tif (in_a_interval(value) && !founddup) {\\n\\t\\tcat(\\\"The first duplicated term is a[\\\",step,\\\"] = \\\",value,\\\"\\\\n\\\", sep = \\\"\\\")\\n\\t\\tfounddup <- TRUE\\n\\t}\\n\\tadd_value(value)\\n\\tif (all(visited[1:1000])) {\\n\\t\\tcat(\\\"Terms up to a[\\\",step,\\\"] are needed to generate 0 to 1000\\\\n\\\",sep = \\\"\\\")\\n\\t\\tbreak\\n\\t}\\n\\tstep <- step + 1\\n\\tif (step == 15) {\\n\\t\\tcat(\\\"The first 15 terms are :\\\")\\n\\t\\tfor (aterm in terms) { cat(aterm,\\\" \\\", sep = \\\"\\\") }\\n\\t\\tcat(\\\"\\\\n\\\")\\n\\t}\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"my @recamans = 0, {\\n state %seen;\\n state $term;\\n $term++;\\n my $this = $^previous - $term;\\n $this = $previous + $term unless ($this > 0) && !%seen{$this};\\n %seen{$this} = True;\\n $this\\n} … *;\\n\\nput \\\"First fifteen terms of Recaman's sequence: \\\", @recamans[^15];\\n\\nsay \\\"First duplicate at term: a[{ @recamans.first({@recamans[^$_].Bag.values.max == 2})-1 }]\\\";\\n\\nmy @seen;\\nmy int $i = 0;\\nloop {\\n next if (my int $this = @recamans[$i++]) > 1000 or @seen[$this];\\n @seen[$this] = 1;\\n say \\\"Range 0..1000 covered by terms up to a[{$i - 1}]\\\" and last if ++$ == 1001;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm computes a Recamán sequence up to N; the 1st dup; # terms for a range of #'s.*/\\nparse arg N h . /*obtain optional arguments from the CL*/\\nif N=='' | N==\\\",\\\" then N= 15 /*Not specified? Then use the default.*/\\nif h=='' | h==\\\",\\\" then h= 1000 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n say \\\"Recamán's sequence for the first \\\" N \\\" numbers: \\\" recaman(N)\\nsay; say \\\"The first duplicate number in the Recamán's sequence is: \\\" recaman(0)\\nsay; say \\\"The number of terms to complete the range 0───►\\\"h ' is: ' recaman(-h)\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nrecaman: procedure; parse arg y,,d.; $=0; !.=0; _=0; !.0=1 /*init. array and vars.*/\\n r= y<0; Reca= 0; hi= abs(y) /*for the 2nd invoke. */\\n o= y==0; if y<1 then y= 1e8 /* \\\" \\\" 3rd \\\" */\\n do #=1 for y-1; z= _ - # /*next # might be < 0. */\\n if z<0 then z= _ + # /*this is faster than: */\\n else if !.z then z= _ + # /*if !.z | z<0 then ···*/\\n !.z= 1; _= z /*mark it; add to seq.*/\\n if r then do; if z>hi then iterate /*ignore #'s too large.*/\\n if d.z=='' then Reca= Reca + 1 /*Unique? Bump counter.*/\\n d.z= . /*mark # as a new low. */\\n if Reca>=hi then return # /*list is complete ≥ HI*/\\n iterate\\n end /* [↑] a range of #s. */\\n if o then do; if d.z==. then return z; d.z=.; iterate /*check if dup #.*/\\n end\\n $= $ z /*add number to $ list?*/\\n end /*#*/; return $ /*return the $ list. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program computes & displays the Recaman sequence */\\n/*improved using version 1's method for task 3 */\\nCall time 'R' /* Start timer */\\nParse Arg n\\nIf n='' Then n=15\\nSay 'the first' n 'elements:' recaman(n)\\nSay ans.2\\nSay ans.3\\nSay time('E') 'seconds elapsed'\\nExit\\n\\nrecaman:\\nParse Arg n /* Wanted number of elements */\\nhave.=0 /* Number not yet in sequence */\\ne.0=0 /* First element */\\nhave.0=1 /* is in the sequence */\\ns=0 /* Sequence to be shodn */\\ndone=0 /* turn on first duplicate switch */\\nd.=0\\nd.0=1\\ndn=1 /* number of elements <=1000 */\\n Do i=1 until dn==1001 /* Loop until all found */\\n ip=i-1 /* previous index */\\n temp=e.ip-i /* potential next element */\\n If temp>0 & have.temp=0 Then /* to be used */\\n Nop\\n Else /* compute the alternative */\\n temp=e.ip+i\\n e.i=temp /* Set next element */\\n If words(s)<n Then /* not enough in output */\\n s=s temp /* add the element to the output */\\n If temp<=1000 Then Do /* eligible for task 3 */\\n If d.temp=0 Then Do /* not yet encountered */\\n d.temp=1 /* Remember it's there */\\n dn=dn+1 /* count of integers<=1000 found */\\n End\\n End\\n If done=0 & have.temp=1 Then Do\\n ans.2='First duplicate ('temp') added in iteration' i,\\n 'elapsed:' time('E') 'seconds'\\n done=1\\n End\\n ans.3='Element number' i 'is the last to satisfy task 3. It is' temp\\n Have.temp=1\\n End\\nReturn s\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"load \\\"zerolib.ring\\\"\\n\\nrecaman = Z(0:50)\\nduplicate = 0\\ndup = []\\nrecDuplicate = []\\nrecnum = 0\\n\\nsee \\\"working...\\\" + nl\\nsee \\\"the first 15 Recaman's numbers are:\\\" + nl\\n\\nfor n = 1 to len(recaman) - 1\\n if n = 1\\n recaman[0] = 0\\n add(dup,0)\\n see \\\"\\\" + recaman[0] + \\\" \\\"\\n ok\\n recaman[n] = recaman[n-1] - n\\n if recaman[n] <= 0\\n recaman[n] = recaman[n-1] + n\\n ok\\n fnrec = find(dup,recaman[n])\\n if fnrec > 0\\n del(dup,fnrec)\\n recaman[n] = recaman[n-1] + n\\n add(dup,recaman[n])\\n else\\n add(dup,recaman[n])\\n ok\\n recnum = recnum + 1\\n if recnum < 15\\n see \\\"\\\" + recaman[n] + \\\" \\\"\\n ok\\n add(recDuplicate,recaman[n])\\nnext\\nsee nl\\n\\nsee \\\"the first duplicated term is a[\\\"\\nfor n = len(recDuplicate) to 2 step -1\\n for m = n-1 to 1 step -1\\n if recDuplicate[n] = recDuplicate[m]\\n duplicate = recDuplicate[n]\\n dupnr = n\\n ok\\n next\\nnext\\n\\nsee \\\"\\\" + dupnr + \\\"] = \\\" + duplicate + nl\\nsee \\\"done...\\\" + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'set'\\n\\na = [0]\\nused = Set[0]\\nused1000 = Set[0]\\nfoundDup = false\\nn = 1\\nwhile n <= 15 or not foundDup or used1000.size < 1001\\n nxt = a[n - 1] - n\\n if nxt < 1 or used === nxt then\\n nxt = nxt + 2 * n\\n end\\n alreadyUsed = used === nxt\\n a << nxt\\n if not alreadyUsed then\\n used << nxt\\n if nxt >= 0 and nxt <= 1000 then\\n used1000 << nxt\\n end\\n end\\n if n == 14 then\\n print \\\"The first 15 terms of the Recaman's sequence are \\\", a, \\\"\\\\n\\\"\\n end\\n if not foundDup and alreadyUsed then\\n print \\\"The first duplicated term is a[\\\", n, \\\"] = \\\", nxt, \\\"\\\\n\\\"\\n foundDup = true\\n end\\n if used1000.size == 1001 then\\n print \\\"Terms up to a[\\\", n, \\\"] are needed to generate 0 to 1000\\\\n\\\"\\n end\\n n = n + 1\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use std::collections::HashSet ;\\n\\nfn main() {\\n let mut recamans : Vec<i32> = Vec::new( ) ;\\n let mut reca_set : HashSet<i32> = HashSet::new() ;\\n let mut first_nums : HashSet<i32> = HashSet::new( ) ;\\n for i in 0i32..=1000 {\\n first_nums.insert( i ) ;\\n }\\n recamans.push( 0 ) ;\\n reca_set.insert( 0 ) ;\\n let mut current : i32 = 0 ;\\n while ! first_nums.is_subset( &reca_set ) {\\n current += 1 ;\\n let mut nextnum : i32 = recamans[( current as usize ) - 1] - current ;\\n if nextnum < 0 || reca_set.contains( &nextnum ) {\\n nextnum = recamans[(current as usize ) - 1 ] + current ;\\n }\\n recamans.push( nextnum ) ;\\n reca_set.insert( nextnum ) ;\\n if current == 15 {\\n println!(\\\"The first 15 numbers of the Recaman sequence are:\\\" ) ;\\n println!(\\\"{:?}\\\" , recamans ) ;\\n }\\n }\\n println!(\\\"To generate all numbers from 0 to 1000 , one has to go to element {}\\\" , current) ;\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import scala.collection.mutable\\n\\nobject RecamansSequence extends App {\\n val (a, used) = (mutable.ArrayBuffer[Int](0), mutable.BitSet())\\n var (foundDup, hop, nUsed1000) = (false, 1, 0)\\n\\n while (nUsed1000 < 1000) {\\n val _next = a(hop - 1) - hop\\n val next = if (_next < 1 || used.contains(_next)) _next + 2 * hop else _next\\n val alreadyUsed = used.contains(next)\\n\\n a += next\\n if (!alreadyUsed) {\\n used.add(next)\\n if (next <= 1000) nUsed1000 += 1\\n }\\n if (!foundDup && alreadyUsed) {\\n println(s\\\"The first duplicate term is a($hop) = $next\\\")\\n foundDup = true\\n }\\n if (nUsed1000 == 1000)\\n println(s\\\"Terms up to $hop are needed to generate 0 to 1000\\\")\\n\\n hop += 1\\n }\\n\\n println(s\\\"The first 15 terms of the Recaman sequence are : ${a.take(15)}\\\")\\n\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"; Create a dynamically resizing vector (a \\\"dynvec\\\").\\n; Returns a procedure that takes a variable number of arguments:\\n; 0 : () --> Returns the vector from index 0 through the maximum index set.\\n; 1 : (inx) --> Returns the value at the given index.\\n; 2 : (inx val) --> Sets the given value into the given index, and returns the value.\\n\\n(define make-dynvec\\n (lambda (init-size extra-fact init-val)\\n (let ((vec (make-vector init-size init-val)) (maxinx -1))\\n (lambda args\\n (if (null? args)\\n (let ((retvec (make-vector (1+ maxinx))))\\n (do ((index 0 (1+ index)))\\n ((> index maxinx) retvec)\\n (vector-set! retvec index (vector-ref vec index))))\\n (let ((inx (car args)))\\n (when (>= inx (vector-length vec))\\n (let ((newvec (make-vector\\n (inexact->exact (ceiling (* extra-fact inx)))\\n init-val)))\\n (do ((index 0 (1+ index)))\\n ((>= index (vector-length vec)))\\n (vector-set! newvec index (vector-ref vec index)))\\n (set! vec newvec)))\\n (when (pair? (cdr args))\\n (when (> inx maxinx) (set! maxinx inx))\\n (vector-set! vec inx (cadr args)))\\n (vector-ref vec inx)))))))\\n\\n; Generate the Recaman's sequence.\\n; Generate the terms of Recaman's sequence until the given \\\"stop\\\" procedure\\n; returns a true value; that returned value becomes the value of this procedure.\\n; The arguments to the \\\"stop\\\" procedure are: n, the value of the n'th term,\\n; #t if that term was seen before, #t if the term was arrived at by addition,\\n; the Recaman's sequence so far (as a dynvec), and a dynvec of the n's at which\\n; a value was first seen or #f if not previously seen (\\\"seen1st\\\").\\n\\n(define recaman-sequence\\n (lambda (stop-proc)\\n (let ((recaman (make-dynvec 10 2 0))\\n (seen1st (make-dynvec 10 2 #f)))\\n (do ((n 0 (1+ n)) (done-retval #f))\\n (done-retval done-retval)\\n (if (= n 0)\\n (begin\\n (recaman n 0)\\n (seen1st 0 n)\\n (set! done-retval (stop-proc n 0 #f #f recaman seen1st)))\\n (let ((try-sub (- (recaman (1- n)) n)))\\n (if (and (> try-sub 0) (not (seen1st try-sub)))\\n (begin\\n (recaman n try-sub)\\n (seen1st try-sub n)\\n (set! done-retval (stop-proc n try-sub #f #f recaman seen1st)))\\n (let* ((val-add (+ (recaman (1- n)) n)) (seen-prev (seen1st val-add)))\\n (recaman n val-add)\\n (unless (seen1st val-add) (seen1st val-add n))\\n (set! done-retval\\n (stop-proc n val-add seen-prev #t recaman seen1st))))))))))\\n\\n; Generate and display the first 15 Recaman's numbers.\\n\\n(printf \\\"First 15 Recaman's numbers: ~a~%\\\"\\n (recaman-sequence (lambda (n val seen-prev by-add recaman seen1st)\\n (and (>= n (1- 15)) (recaman)))))\\n\\n; Find and display the first duplicated Recaman's number.\\n; The only way to be a duplicate is if the number was arrived\\n; at by adding 'n' and the number has been seen before.\\n\\n(let ((dup-n-val-1st\\n (recaman-sequence (lambda (n val seen-prev by-add recaman seen1st)\\n (and by-add seen-prev (list n val (seen1st val)))))))\\n (printf \\\"First duplicate Recaman's number: a[~a] = a[~a] = ~a~%\\\"\\n (caddr dup-n-val-1st) (car dup-n-val-1st) (cadr dup-n-val-1st)))\\n\\n; Find and display how many terms of the sequence are needed\\n; for all the integers 0..1000, inclusive, to be generated.\\n\\n(let* ((all-first 1001)\\n (terms-to-gen-all (recaman-sequence\\n (lambda (n val seen-prev by-add recaman seen1st)\\n (do ((inx 0 (1+ inx)))\\n ((or (>= inx all-first) (not (seen1st inx)))\\n (and (>= inx all-first) (1+ n))))))))\\n (printf\\n \\\"Terms of Recaman's sequence to generate all integers 0..~a, inclusive: ~a~%\\\"\\n (1- all-first) terms-to-gen-all))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"program recaman;\\n a := {[0,0]};\\n\\n loop for i in [1..14] do\\n extend(a);\\n end loop;\\n\\n print(\\\"First 15:\\\", [a(n) : n in [0..14]]);\\n\\n loop\\n doing n := extend(a);\\n until #(rept:=[[r,i] : r = a(i) | r=n]) > 1\\n do pass;\\n end loop;\\n\\n print(\\\"First repetition:\\\", n, \\\"at\\\", {x:x in rept}{n});\\n\\n proc extend(rw a);\\n n := max/ domain a;\\n t := a(n) - n-1;\\n if t<0 or t in range a then\\n t := a(n) + n+1;\\n end if;\\n return a(n+1) := t;\\n end proc;\\nend program;\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"func recamans_generator() {\\n\\n var term = 0\\n var prev = 0\\n var seen = Hash()\\n\\n {\\n var this = (prev - term)\\n\\n if ((this <= 0) || seen{this}) {\\n this = (prev + term)\\n }\\n\\n prev = this\\n seen{this} = true\\n term++\\n this\\n }\\n}\\n\\nwith (recamans_generator()) { |r|\\n say (\\\"First 15 terms of the Recaman's sequence: \\\", 15.of { r.run }.join(', '))\\n}\\n\\nwith (recamans_generator()) {|r|\\n var seen = Hash()\\n Inf.times {|i|\\n var n = r.run\\n if (seen{n}) {\\n say \\\"First duplicate term in the series is a(#{i}) = #{n}\\\"\\n break\\n }\\n seen{n} = true\\n }\\n}\\n\\nwith (recamans_generator()) {|r|\\n var seen = Hash()\\n Inf.times {|i|\\n var n = r.run\\n if ((n <= 1000) && (seen{n} := true) && (seen.len == 1001)) {\\n say \\\"Terms up to a(#{i}) are needed to generate 0 to 1000\\\"\\n break\\n }\\n }\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"' Recaman's sequence - vbscript - 04/08/2015\\n\\tnx=15\\n\\th=1000\\n\\tWscript.StdOut.WriteLine \\\"Recaman's sequence for the first \\\" & nx & \\\" numbers:\\\"\\n\\tWscript.StdOut.WriteLine recaman(\\\"seq\\\",nx)\\n\\tWscript.StdOut.WriteLine \\\"The first duplicate number is: \\\" & recaman(\\\"firstdup\\\",0)\\n\\tWscript.StdOut.WriteLine \\\"The number of terms to complete the range 0--->\\\"& h &\\\" is: \\\"& recaman(\\\"numterm\\\",h)\\n\\tWscript.StdOut.Write vbCrlf&\\\".../...\\\": zz=Wscript.StdIn.ReadLine()\\n\\t\\nfunction recaman(op,nn)\\n\\tDim b,d,h\\n\\tSet b = CreateObject(\\\"Scripting.Dictionary\\\")\\n\\tSet d = CreateObject(\\\"Scripting.Dictionary\\\")\\n list=\\\"0\\\" : firstdup=0\\n\\tif op=\\\"firstdup\\\" then\\n\\t\\tnn=1000 : firstdup=1\\n\\tend if\\n\\tif op=\\\"numterm\\\" then\\n\\t\\th=nn : nn=10000000 : numterm=1\\n\\tend if\\n\\tax=0 'a(0)=0\\n\\tb.Add 0,1 'b(0)=1\\n\\ts=0\\n\\tfor n=1 to nn-1\\n an=ax-n\\n\\t\\tif an<=0 then\\n\\t\\t\\tan=ax+n\\n\\t\\telseif b.Exists(an) then\\n\\t\\t\\tan=ax+n\\n\\t\\tend if\\n\\t\\tax=an 'a(n)=an\\n\\t\\tif not b.Exists(an) then b.Add an,1 'b(an)=1\\n\\t\\tif op=\\\"seq\\\" then\\n\\t\\t\\tlist=list&\\\" \\\"&an\\n\\t\\tend if\\n\\t\\tif firstdup then\\n\\t\\t\\tif d.Exists(an) then\\n\\t\\t\\t\\trecaman=\\\"a(\\\"&n&\\\")=\\\"&an\\n\\t\\t\\t\\texit function\\n\\t\\t\\telse\\n\\t\\t\\t\\td.Add an,1 'd(an)=1\\n\\t\\t\\tend if\\n\\t\\tend if\\n\\t\\tif numterm then\\n\\t\\t\\tif an<=h then\\n\\t\\t\\t\\tif not d.Exists(an) then\\n\\t\\t\\t\\t\\ts=s+1\\n\\t\\t\\t\\t\\td.Add an,1 'd(an)=1\\n\\t\\t\\t\\tend if\\n\\t\\t\\t\\tif s>=h then\\n\\t\\t\\t\\t\\trecaman=n\\n\\t\\t\\t\\t\\texit function\\n\\t\\t\\t\\tend if\\n\\t\\t\\tend if\\n\\t\\tend if\\n\\tnext 'n\\n\\trecaman=list\\nend function 'recaman\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"Imports System\\nImports System.Collections.Generic\\n\\nModule Module1\\n Sub Main(ByVal args As String())\\n Dim a As List(Of Integer) = New List(Of Integer)() From { 0 },\\n used As HashSet(Of Integer) = New HashSet(Of Integer)() From { 0 },\\n used1000 As HashSet(Of Integer) = used.ToHashSet(),\\n foundDup As Boolean = False\\n For n As Integer = 1 to Integer.MaxValue\\n Dim nv As Integer = a(n - 1) - n\\n If nv < 1 OrElse used.Contains(nv) Then nv += 2 * n\\n Dim alreadyUsed As Boolean = used.Contains(nv) : a.Add(nv)\\n If Not alreadyUsed Then used.Add(nv) : If nv > 0 AndAlso nv <= 1000 Then used1000.Add(nv)\\n If Not foundDup Then\\n If a.Count = 15 Then _\\n Console.WriteLine(\\\"The first 15 terms of the Recamán sequence are: ({0})\\\", String.Join(\\\", \\\", a))\\n If alreadyUsed Then _\\n Console.WriteLine(\\\"The first duplicated term is a({0}) = {1}\\\", n, nv) : foundDup = True\\n End If\\n If used1000.Count = 1001 Then _\\n Console.WriteLine(\\\"Terms up to a({0}) are needed to generate 0 to 1000\\\", n) : Exit For\\n Next\\n End Sub\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"var a = [0]\\nvar used = { 0: true }\\nvar used1000 = { 0: true }\\nvar foundDup = false\\nvar n = 1\\nwhile (n <= 15 || !foundDup || used1000.count < 1001) {\\n var next = a[n-1] - n\\n if (next < 1 || used[next]) next = next + 2*n\\n var alreadyUsed = used[next]\\n a.add(next)\\n if (!alreadyUsed) {\\n used[next] = true\\n if (next >= 0 && next <= 1000) used1000[next] = true\\n }\\n if (n == 14) System.print(\\\"The first 15 terms of the Recaman's sequence are:\\\\n%(a)\\\")\\n if (!foundDup && alreadyUsed) {\\n System.print(\\\"The first duplicated term is a[%(n)] = %(next)\\\")\\n foundDup = true\\n }\\n if (used1000.count == 1001) {\\n System.print(\\\"Terms up to a[%(n)] are needed to generate 0 to 1000\\\")\\n }\\n n = n + 1\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn recamanW{ // -->iterator -->(n,a,True if a is a dup)\\n Walker.tweak(fcn(rn,rp,d){\\n n,p,a := rn.value, rp.value, p - n;\\n if(a<=0 or d.find(a)) a+=2*n;\\n d.incV(a); rp.set(a);\\n return(rn.inc(),a,d[a]>1);\\n }.fp(Ref(0),Ref(0),Dictionary()) )\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"print(\\\"First 15 members of Recaman's sequence: \\\");\\nrecamanW().walk(15).apply(\\\"get\\\",1).println();\\n\\nn,a := recamanW().filter1(\\\"get\\\",2); // ie filter(a[n].dup)\\nprintln(\\\"First duplicate number in series is: a(%d) = %d\\\".fmt(n,a));\\n\\nrw,ns,n,a,dup := recamanW(),1000,0,0,0;\\ndo{ n,a,dup=rw.next(); if(not dup and a<1000) ns-=1; }while(ns);\\nprintln(\\\"Range 0..1000 is covered by terms up to a(%,d)\\\".fmt(n));\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Recamans-sequence"}}},{"rowIdx":1570,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Temporal media\nfrom: http://rosettacode.org/wiki/Record_sound\nnote: Sound\n","language":"00-META"},{"code":"Record a monophonic 16-bit PCM sound into either memory space, a file or array.\n\n(This task neglects to specify the sample rate, and whether to use signed samples. \nThe programs in this page might use signed 16-bit or unsigned 16-bit samples, at 8000 Hz, 44100 Hz, or any other sample rate. \nTherefore, these programs might not record sound in the same format.)\n\n","language":"00-TASK"},{"code":"name := \"sample\"\nwaitsec := 5\nTooltip Recording %name%.wav\nMCI_SendString(\"close all wait\")\nMCI_SendString(\"open new type waveaudio alias \" . name)\nMCI_SendString(\"set \" . name . \" time format ms wait\")\n;MCI_SendString(\"set \" . name . \" bitspersample 16 wait\")\n;MCI_SendString(\"set \" . name . \" channels 1 wait\")\n;MCI_SendString(\"set \" . name . \" samplespersec 16000 wait\")\n;MCI_SendString(\"set \" . name . \" alignment 1 wait\")\n;MCI_SendString(\"set \" . name . \" bytespersec 8000 wait\")\nMCI_SendString(\"record \" . name)\nSleep waitsec*1000\nMCI_SendString(\"stop \" . name . \" wait\")\nMCI_SendString(\"save \" . name . \" \"\"\" . name . \".wav\"\"\")\nTooltip Finished ... Playing\nMCI_SendString(\"delete \" . name)\nMCI_SendString(\"close \" . name . \" wait\")\nMCI_SendString(\"open \"\"\" . name . \".wav\"\" type waveaudio alias \" . name)\nMCI_SendString(\"play \" . name . \" wait\")\nMCI_SendString(\"close \" . name . \" wait\")\nTooltip\nReturn\n\nMCI_SendString(p_lpszCommand,ByRef r_lpszReturnString=\"\",p_hwndCallback=0) {\n\tVarSetCapacity(r_lpszReturnString,512,0)\n\tReturn DllCall(\"winmm.dll\\mciSendString\" . (A_IsUnicode ? \"W\":\"A\")\n\t\t,\"Str\",p_lpszCommand\t\t\t\t\t\t;-- lpszCommand\n\t\t,\"Str\",r_lpszReturnString\t\t\t\t\t;-- lpszReturnString\n\t\t,\"UInt\",512\t\t\t\t\t\t\t\t\t;-- cchReturn\n\t\t,A_PtrSize ? \"Ptr\":\"UInt\",p_hwndCallback\t;-- hwndCallback\n\t\t,\"Cdecl Int\")\t\t\t\t\t\t\t\t;-- Return type\n}\n; For more intuitive functions, see the MCI library by jballi.\n; doc: http://www.autohotkey.net/~jballi/MCI/v1.1/MCI.html\n; download: http://www.autohotkey.net/~jballi/MCI/v1.1/MCI.ahk\n","language":"AutoHotkey"},{"code":" wavfile$ = @dir$ + \"capture.wav\"\n bitspersample% = 16\n channels% = 2\n samplespersec% = 44100\n\n alignment% = bitspersample% * channels% / 8\n bytespersec% = alignment% * samplespersec%\n\n params$ = \" bitspersample \" + STR$(bitspersample%) + \\\n \\ \" channels \" + STR$(channels%) + \\\n \\ \" alignment \" + STR$(alignment%) + \\\n \\ \" samplespersec \" + STR$(samplespersec%) + \\\n \\ \" bytespersec \" + STR$(bytespersec%)\n\n SYS \"mciSendString\", \"close all\", 0, 0, 0\n SYS \"mciSendString\", \"open new type waveaudio alias capture\", 0, 0, 0\n SYS \"mciSendString\", \"set capture\" + params$, 0, 0, 0 TO res%\n IF res% ERROR 100, \"Couldn't set capture parameters: \" + STR$(res% AND &FFFF)\n\n PRINT \"Press SPACE to start recording...\"\n REPEAT UNTIL INKEY(1) = 32\n\n SYS \"mciSendString\", \"record capture\", 0, 0, 0 TO res%\n IF res% ERROR 100, \"Couldn't start audio capture: \" + STR$(res% AND &FFFF)\n\n PRINT \"Recording, press SPACE to stop...\"\n REPEAT UNTIL INKEY(1) = 32\n\n SYS \"mciSendString\", \"stop capture\", 0, 0, 0\n SYS \"mciSendString\", \"save capture \" + wavfile$, 0, 0, 0 TO res%\n IF res% ERROR 100, \"Couldn't save to WAV file: \" + STR$(res% AND &FFFF)\n\n SYS \"mciSendString\", \"delete capture\", 0, 0, 0\n SYS \"mciSendString\", \"close capture\", 0, 0, 0\n\n PRINT \"Captured audio is stored in \" wavfile$\n","language":"BBC-BASIC"},{"code":"#include <stdlib.h>\n#include <unistd.h>\n#include <sys/types.h>\n#include <fcntl.h>\n\nvoid * record(size_t bytes)\n{\n\tint fd;\n\tif (-1 == (fd = open(\"/dev/dsp\", O_RDONLY))) return 0;\n\tvoid *a = malloc(bytes);\n\tread(fd, a, bytes);\n\tclose(fd);\n\treturn a;\n}\n\nint play(void *buf, size_t len)\n{\n\tint fd;\n\tif (-1 == (fd = open(\"/dev/dsp\", O_WRONLY))) return 0;\n\twrite(fd, buf, len);\n\tclose(fd);\n\treturn 1;\n}\n\nint main()\n{\n\tvoid *p = record(65536);\n\tplay(p, 65536);\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <string>\n#include <windows.h>\n#include <mmsystem.h>\n\n#pragma comment ( lib, \"winmm.lib\" )\nusing namespace std;\n\nclass recorder\n{\npublic:\n void start()\n {\n\tpaused = rec = false; action = \"IDLE\";\n\twhile( true )\n\t{\n\t cout << endl << \"==\" << action << \"==\" << endl << endl;\n\t cout << \"1) Record\" << endl << \"2) Play\" << endl << \"3) Pause\" << endl << \"4) Stop\" << endl << \"5) Quit\" << endl;\n\t char c; cin >> c;\n\t if( c > '0' && c < '6' )\n\t {\n\t\tswitch( c )\n\t\t{\n\t\t case '1': record(); break;\n\t\t case '2': play(); break;\n\t\t case '3': pause(); break;\n\t\t case '4': stop(); break;\n\t\t case '5': stop(); return;\n\t\t}\n\t }\n\t}\n }\nprivate:\n void record()\n {\n\tif( mciExecute( \"open new type waveaudio alias my_sound\") )\n\t{\n\t mciExecute( \"record my_sound\" );\n\t action = \"RECORDING\"; rec = true;\n\t}\n }\n void play()\n {\n\tif( paused )\n\t mciExecute( \"play my_sound\" );\n\telse\n\t if( mciExecute( \"open tmp.wav alias my_sound\" ) )\n\t\tmciExecute( \"play my_sound\" );\n\n\taction = \"PLAYING\";\n\tpaused = false;\n }\n void pause()\n {\n\tif( rec ) return;\n\tmciExecute( \"pause my_sound\" );\n\tpaused = true; action = \"PAUSED\";\n }\n void stop()\n {\n\tif( rec )\n\t{\n\t mciExecute( \"stop my_sound\" );\n\t mciExecute( \"save my_sound tmp.wav\" );\n\t mciExecute( \"close my_sound\" );\n\t action = \"IDLE\"; rec = false;\n\t}\n\telse\n\t{\n\t mciExecute( \"stop my_sound\" );\n\t mciExecute( \"close my_sound\" );\n\t action = \"IDLE\";\n\t}\n }\n bool mciExecute( string cmd )\n {\n\tif( mciSendString( cmd.c_str(), NULL, 0, NULL ) )\n\t{\n\t cout << \"Can't do this: \" << cmd << endl;\n\t return false;\n\t}\n\treturn true;\n }\n\n bool paused, rec;\n string action;\n};\n\nint main( int argc, char* argv[] )\n{\n recorder r; r.start();\n return 0;\n}\n","language":"C++"},{"code":"// chuck this with other shreds to record to file\n// example> chuck foo.ck bar.ck rec\n\n// arguments: rec:<filename>\n\n// get name\nme.arg(0) => string filename;\nif( filename.length() == 0 ) \"foo.wav\" => filename;\n\n// pull samples from the dac\ndac => Gain g => WvOut w => blackhole;\n// this is the output file name\nfilename => w.wavFilename;\n<<<\"writing to file:\", \"'\" + w.filename() + \"'\">>>;\n// any gain you want for the output\n.5 => g.gain;\n\n// temporary workaround to automatically close file on remove-shred\nnull @=> w;\n\n// infinite time loop...\n// ctrl-c will stop it, or modify to desired duration\nwhile( true ) 1::second => now;\n","language":"ChucK"},{"code":"(defun record (n)\n (with-open-file (in \"/dev/dsp\" :element-type '(unsigned-byte 8))\n (loop repeat n collect (read-byte in))\n )\n )\n(defun play (byte-list)\n (with-open-file (out \"/dev/dsp\" :direction :output :element-type '(unsigned-byte 8) :if-exists :append)\n (mapcar (lambda (b) (write-byte b out)) byte-list)\n )\n )\n(play (record 65536))\n","language":"Common-Lisp"},{"code":"begin_funct({wav}, Record sound);\n set_decision(linger);\n find_thing()_first()_microphone()_bitrate(16)_tech(PCM)_samplerate(signed16, unsigned16)_rangefrom(8000, Hz)_rangeto(44100, Hz)_export(.wav)\n ? with_found()_microphone()_label(mic);\n : err_funct[]_err(Sorry, no one has a microphone!);\n exit_funct[];\n ;\n with_microphone[mic]_record()_durat({secs}, 30)_var(recording);\n [Record sound]_ret([recording]);\n reset_decision();\nend_funct[];\n\n// Record a monophonic 16-bit PCM sound into memory space:\nexec_funct(Record sound)_var(PCMRecording)_me(); // The variable 'PCMRecording' is the sound in memory space\n\n// Record a monophonic 16-bit PCM sound into a file or array:\nexec_funct(Record sound)_file(foo.wav)_me(); // The file 'foo.wav' is the sound in a file\n","language":"Diego"},{"code":"begin_instruct(Record sound);\n set_decision(linger);\n find_thing()_first()_microphone()_bitrate(16)_tech(PCM)_samplerate(signed16, unsigned16)_rangefrom(8000, Hz)_rangeto(44100, Hz)_export(.wav)\n ? with_found()_label(recorder)_microphone()_label(mic);\n : err_instruct[]_err(Sorry, no one has a microphone!);\n exit_instruct[];\n ;\n with_microphone[mic]_record()_durat({secs}, 30)_var(recording);\n reset_decision();\nend_instruct[];\n\n// Record a monophonic 16-bit PCM sound into memory space:\nexec_instruct(Record sound)_me();\nwith_thing[recorder]_microphone[mic]_var[recording]_var(PCMRecording); // The variable 'PCMRecording' is the sound in memory space\n\n// Record a monophonic 16-bit PCM sound into a file or array:\nexec_instruct(Record sound)_me();\nwith_thing[recorder]_microphone[mic]_var[recording]_file(foo.wav)_me(); // The file 'foo.wav' is the sound in a file\n","language":"Diego"},{"code":"#define PI 4 * Atn(1)\n\n' Constants for the audio format\nDim Shared As Integer SAMPLE_RATE = 44100\nDim Shared As Integer BITS_PER_SAMPLE = 16\nDim Shared As Integer NUM_CHANNELS = 1\n\n' Generates a sine wave\nSub generateSineWave(buffer() As Short, frequency As Double)\n Dim As Double increment = 2.0 * PI * frequency / SAMPLE_RATE\n Dim As Double x = 0.0\n For i As Integer = 0 To Ubound(buffer)\n buffer(i) = (Sin(x) * 32767.0)\n x += increment\n Next i\nEnd Sub\n\n' Write the header of the .wav file\nSub writeWaveHeader(file As Integer, numSamples As Integer)\n ' Write the RIFF header\n Print #file, \"RIFF\";\n Put #file, , numSamples * 2 + 36 ' File size\n Print #file, \"WAVE\";\n\n Dim As Integer SB = 16, FA = 1\n ' Write the fmt sub-block\n Print #file, \"fmt \";\n Put #file, , SB ' Size of the fmt sub-block\n Put #file, , FA ' Audio format (1 = PCM)\n Put #file, , NUM_CHANNELS ' Number of channels\n Put #file, , SAMPLE_RATE ' Sample rate\n Put #file, , SAMPLE_RATE * NUM_CHANNELS * BITS_PER_SAMPLE / 8 ' Byte rate\n Put #file, , NUM_CHANNELS * BITS_PER_SAMPLE / 8 ' Alineación de bloques\n Put #file, , BITS_PER_SAMPLE ' Bits per sample\n\n ' Write the data sub-block\n Print #file, \"data\";\n Put #file, , numSamples * 2 ' Data size\nEnd Sub\n\nDim As Integer file = Freefile\nOpen \"output.wav\" For Binary As #file\n\n' Generates a 440 Hz sine wave for 5 seconds\nDim As Integer numSamples = SAMPLE_RATE * 5\nDim As Short buffer(numSamples - 1)\ngenerateSineWave(buffer(), 440.0)\n\n' Write the .wav file\nwriteWaveHeader(file, numSamples)\nPut #file, , buffer()\n\nClose #file\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"bufio\"\n \"fmt\"\n \"log\"\n \"os\"\n \"os/exec\"\n \"strconv\"\n)\n\nfunc check(err error) {\n if err != nil {\n log.Fatal(err)\n }\n}\n\nfunc main() {\n scanner := bufio.NewScanner(os.Stdin)\n name := \"\"\n for name == \"\" {\n fmt.Print(\"Enter output file name (without extension) : \")\n scanner.Scan()\n name = scanner.Text()\n check(scanner.Err())\n }\n name += \".wav\"\n\n rate := 0\n for rate < 2000 || rate > 192000 {\n fmt.Print(\"Enter sampling rate in Hz (2000 to 192000) : \")\n scanner.Scan()\n input := scanner.Text()\n check(scanner.Err())\n rate, _ = strconv.Atoi(input)\n }\n rateS := strconv.Itoa(rate)\n\n dur := 0.0\n for dur < 5 || dur > 30 {\n fmt.Print(\"Enter duration in seconds (5 to 30) : \")\n scanner.Scan()\n input := scanner.Text()\n check(scanner.Err())\n dur, _ = strconv.ParseFloat(input, 64)\n }\n durS := strconv.FormatFloat(dur, 'f', -1, 64)\n\n fmt.Println(\"OK, start speaking now...\")\n // Default arguments: -c 1, -t wav. Note only signed 16 bit format supported.\n args := []string{\"-r\", rateS, \"-f\", \"S16_LE\", \"-d\", durS, name}\n cmd := exec.Command(\"arecord\", args...)\n err := cmd.Run()\n check(err)\n\n fmt.Printf(\"'%s' created on disk and will now be played back...\\n\", name)\n cmd = exec.Command(\"aplay\", name)\n err = cmd.Run()\n check(err)\n fmt.Println(\"Play-back completed.\")\n}\n","language":"Go"},{"code":"Start,Programs,Accessories,Sound Recorder,Button:Record\n","language":"GUISS"},{"code":"import java.io.IOException;\nimport java.util.concurrent.Executors;\nimport java.util.concurrent.ScheduledExecutorService;\nimport java.util.concurrent.TimeUnit;\nimport java.io.File;\n\nimport javax.sound.sampled.AudioFileFormat.*;\n\npublic final class SoundRecorder {\n\n public static void main(String[] args) {\n \tSoundRecorder recorder = new SoundRecorder();\n\n ScheduledExecutorService scheduler = Executors.newSingleThreadScheduledExecutor();\n scheduler.schedule( () -> recorder.finish(), 10, TimeUnit.SECONDS);\n scheduler.shutdown();\n\n recorder.start();\n }\n\n private void start() {\n try {\n AudioFormat format = createAudioFormat();\n DataLine.Info info = new DataLine.Info(TargetDataLine.class, format);\n\n if ( ! AudioSystem.isLineSupported(info) ) {\n System.out.println(\"Data line format is not supported\");\n Runtime.getRuntime().exit(0);\n }\n\n line = (TargetDataLine) AudioSystem.getLine(info);\n line.open(format);\n line.start();\n\n System.out.println(\"Starting to capture and record audio\");\n AudioInputStream audioInputStream = new AudioInputStream(line);\n AudioSystem.write(audioInputStream, audioFileType, wavFile);\n\n } catch (LineUnavailableException | IOException exception) {\n exception.printStackTrace(System.err);\n }\n }\n\n private AudioFormat createAudioFormat() {\n final float sampleRate = 16_000.0F;\n final int sampleSizeInBits = 16;\n final int channels = 1;\n final boolean signed = true;\n final boolean bigEndian = true;\n // Monophonic 16-bit PCM audio format\n return new AudioFormat(sampleRate, sampleSizeInBits, channels, signed, bigEndian);\n }\n\n private void finish() {\n line.stop();\n line.close();\n System.out.println(\"Finished capturing and recording audio\");\n }\n\n private TargetDataLine line;\n\n private final File wavFile = new File(\"SoundRecorder.wav\");\n private final AudioFileFormat.Type audioFileType = AudioFileFormat.Type.WAVE;\n\n}\n","language":"Java"},{"code":"using PortAudio, LibSndFile\n\nstream = PortAudioStream(\"Microphone (USB Microphone)\", 1, 0) # 44100 samples/sec\nbuf = read(stream, 441000)\nsave(\"recorded10sec.wav\", buf)\n","language":"Julia"},{"code":"// version 1.1.3\n\nimport java.io.File\nimport javax.sound.sampled.*\n\nconst val RECORD_TIME = 20000L // twenty seconds say\n\nfun main(args: Array<String>) {\n val wavFile = File(\"RecordAudio.wav\")\n val fileType = AudioFileFormat.Type.WAVE\n val format = AudioFormat(16000.0f, 16, 2, true, true)\n val info = DataLine.Info(TargetDataLine::class.java, format)\n val line = AudioSystem.getLine(info) as TargetDataLine\n\n // Creates a new thread that waits for 'RECORD_TIME' before stopping\n Thread(object: Runnable {\n override fun run() {\n try {\n Thread.sleep(RECORD_TIME)\n }\n catch (ie: InterruptedException) {\n println(ie.message)\n }\n finally {\n line.stop()\n line.close()\n }\n println(\"Finished\")\n }\n }).start()\n\n // Captures the sound and saves it in a WAV file\n try {\n if (AudioSystem.isLineSupported(info)) {\n line.open(format)\n line.start()\n println(\"Recording started\")\n AudioSystem.write(AudioInputStream(line), fileType, wavFile)\n }\n else println(\"Line not supported\")\n }\n catch (lue: LineUnavailableException) {\n println(lue.message)\n }\n}\n","language":"Kotlin"},{"code":"run \"sndrec32.exe\"\n","language":"Liberty-BASIC"},{"code":" print \"Starting 5 sec. recording...\"\n r$ =mciSendString$( \"open new type waveaudio alias capture\")\n r$ =mciSendString$( \"set capture time format ms bitspersample 16\")\n r$ =mciSendString$( \"set capture channels 1 samplespersec 8000\")\n r$ =mciSendString$( \"set capture alignment 1 bytespersec 8000\")\n r$ =mciSendString$( \"record capture\")\n timer 5000, [on]\n wait\n [on]\n timer 0\n print \" .... now stopping the recording.\"\n r$ =mciSendString$( \"stop capture\")\n r$ =mciSendString$( \"save capture \" +chr$( 34) +\"sample.wav\" +chr$( 34))\n r$ =mciSendString$( \"close capture\")\n print \"Done recording.\"\n r$=mciSendString$( \"open \" +q$ +\"sample.wav\" +q$ +\" type waveaudio alias sfx\")\n r$=mciSendString$( \"play sfx wait\")\n r$=mciSendString$( \"close sfx\")\n print \"Done playing back.\"\n end\n\nfunction mciSendString$( s$)\n print s$\n buffer$ =space$( 1024) +chr$( 0)\n calldll #winmm, \"mciSendStringA\", s$ as ptr, buffer$ as ptr, 1028 as long, 0 as long, r as long\n buffer$ =left$( buffer$, instr( buffer$, chr$( 0)) -1)\n if r >0 then\n mciSendString$ =\"error\"\n print \"returned \"; mciSendString$\n else\n mciSendString$ =\"\"'buffer$\n print \"OK\"\n end if\nend function\n","language":"Liberty-BASIC"},{"code":"command makeRecording\n set the dontUseQT to false -- on windows use true\n set the recordFormat to \"wave\" -- can be wav,aiff, au\n set the recordRate to 44.1 -- sample at 44100 Hz\n set the recordSampleSize to 16 --default is 8 bit\n ask file \"Save recording as\"\n if it is not empty then\n answer record --show sound input dialog with presets above\n record sound file it -- actual record command\n wait 10 seconds\n stop recording\n end if\nend makeRecording\n","language":"LiveCode"},{"code":"SystemDialogInput[\"RecordSound\"]\n","language":"Mathematica"},{"code":"import osproc, strutils\n\nvar name = \"\"\nwhile name.len == 0:\n stdout.write \"Enter output file name (without extension): \"\n name = stdin.readLine().strip()\nname.add \".wav\"\n\nvar rate = 0\nwhile rate notin 2000..19_200:\n stdout.write \"Enter sampling rate in Hz (2000 to 192000): \"\n try: rate = parseInt(stdin.readLine().strip())\n except ValueError: discard\n\nvar duration = 0\nwhile duration notin 5..30:\n stdout.write \"Enter duration in seconds (5 to 30): \"\n try: duration = parseInt(stdin.readLine().strip())\n except ValueError: discard\n\necho \"OK, start speaking now...\"\n# Default arguments: -c 1, -t wav. Note that only signed 16 bit format is supported.\nlet args = [\"-r\", $rate, \"-f\", \"S16_LE\", \"-d\", $duration, name]\necho execProcess(\"arecord\", args = args, options = {poStdErrToStdOut, poUsePath})\n\necho \"'$1' created on disk and will now be played back...\" % name\necho execProcess(\"aplay\", args = [name], options = {poStdErrToStdOut, poUsePath})\necho \"Playback completed\"\n","language":"Nim"},{"code":"#load \"unix.cma\"\n\nlet record bytes =\n let buf = String.make bytes '\\000' in\n let ic = open_in \"/dev/dsp\" in\n let chunk = 4096 in\n for i = 0 to pred (bytes / chunk) do\n ignore (input ic buf (i * chunk) chunk)\n done;\n close_in ic;\n (buf)\n\nlet play buf len =\n let oc = open_out \"/dev/dsp\" in\n output_string oc buf;\n close_out oc\n\nlet () =\n let bytes = 65536 in\n let p = record bytes in\n play p bytes\n","language":"OCaml"},{"code":"(notonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\Record_sound.exw\n -- =============================\n --</span>\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- (file i/o)</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">wavfile</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"capture.wav\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">bitspersample</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">16</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">channels</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">samplespersec</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">44100</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">alignment</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">bitspersample</span> <span style=\"color: #0000FF;\">*</span> <span style=\"color: #000000;\">channels</span> <span style=\"color: #0000FF;\">/</span> <span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">bytespersec</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">alignment</span> <span style=\"color: #0000FF;\">*</span> <span style=\"color: #000000;\">samplespersec</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">params</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\" bitspersample %d channels %d alignment %d samplespersec %d bytespersec %d\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">bitspersample</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">channels</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">alignment</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">samplespersec</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">bytespersec</span><span style=\"color: #0000FF;\">}),</span>\n <span style=\"color: #000000;\">error_size</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2048</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">winmm</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">NULL</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">xmciSendString</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pError</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">mciSendString</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">msg</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">winmm</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">NULL</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">winmm</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">open_dll</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"winmm.dll\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">xmciSendString</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">define_c_func</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">winmm</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"mciSendStringA\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">C_PTR</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- LPCTSTR lpszCommand</span>\n <span style=\"color: #000000;\">C_PTR</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- LPTSTR lpszReturnString</span>\n <span style=\"color: #000000;\">C_INT</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- UINT cchReturn</span>\n <span style=\"color: #000000;\">C_PTR</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #000080;font-style:italic;\">-- HANDLE hwndCallback</span>\n <span style=\"color: #000000;\">C_INT</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- MCIERROR</span>\n <span style=\"color: #000000;\">pError</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">allocate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">error_size</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">c_func</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">xmciSendString</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">msg</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pError</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">error_size</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">NULL</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"error %0x: %s\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">peek_string</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pError</span><span style=\"color: #0000FF;\">)})</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">get</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span> <span style=\"color: #000080;font-style:italic;\">-- get_bytes()</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">record</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">bytes</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">fn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">open</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"/dev/dsp\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"rb\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">=-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #008000;\">\"\"</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">get_bytes</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">bytes</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">close</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">play</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">buf</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">buf</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">fn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">open</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"/dev/dsp\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"wb\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">!=-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">buf</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">close</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()=</span><span style=\"color: #004600;\">WINDOWS</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">mciSendString</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"close all\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">mciSendString</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"open new type waveaudio alias capture\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">mciSendString</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"set capture\"</span> <span style=\"color: #0000FF;\">&</span> <span style=\"color: #000000;\">params</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Press SPACE to start recording...\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">wait_key</span><span style=\"color: #0000FF;\">()!=</span><span style=\"color: #008000;\">' '</span> <span style=\"color: #008080;\">do</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n\n <span style=\"color: #000000;\">mciSendString</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"record capture\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Recording, press SPACE to stop...\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">wait_key</span><span style=\"color: #0000FF;\">()!=</span><span style=\"color: #008000;\">' '</span> <span style=\"color: #008080;\">do</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n\n <span style=\"color: #000000;\">mciSendString</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"stop capture\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">mciSendString</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"save capture \"</span> <span style=\"color: #0000FF;\">&</span> <span style=\"color: #000000;\">wavfile</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">mciSendString</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"delete capture\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">mciSendString</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"close capture\"</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Captured audio is stored in \"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">wavfile</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()=</span><span style=\"color: #004600;\">LINUX</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000080;font-style:italic;\">-- warning: untested</span>\n <span style=\"color: #000000;\">play</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">record</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">65536</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000080;font-style:italic;\">-- -- alternative, from Go (ditto)\n -- string name = \"test.wav\",\n -- rate = \"2000\", -- (2000..192000 Hz)\n -- durn = \"5\" -- (5 to 30 seconds)\n -- printf(1,\"OK, start speaking now...\\n\")\n -- -- Default arguments: -c 1, -t wav. Note only signed 16 bit format supported.\n -- string cmd = sprintf(\"arecord -r %s -f S16_LE -d %s %s\", {rate,durn,name})\n -- {} = system_exec(cmd)\n -- printf(1,\"'%s' created on disk and will now be played back...\\n\", {name})\n -- {} = system_exec(\"aplay \"&name)\n -- printf(1,\"Play-back completed.\\n\")</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n<!--\n","language":"Phix"},{"code":"(in '(rec -q -c1 -tu16 - trim 0 2) # Record 2 seconds\n (make\n (while (rd 2)\n (link @) ) ) )\n","language":"PicoLisp"},{"code":"import pyaudio\n\nchunk = 1024\nFORMAT = pyaudio.paInt16\nCHANNELS = 1\nRATE = 44100\n\np = pyaudio.PyAudio()\n\nstream = p.open(format = FORMAT,\n channels = CHANNELS,\n rate = RATE,\n input = True,\n frames_per_buffer = chunk)\n\ndata = stream.read(chunk)\nprint [ord(i) for i in data]\n","language":"Python"},{"code":"#lang racket\n(define (record n) (with-input-from-file \"/dev/dsp\" ( () (read-bytes n))))\n(define (play bs) (display-to-file bs \"/dev/dsp\" #:exists 'append))\n(play (record 65536))\n","language":"Racket"},{"code":"use Audio::PortAudio;\nuse Audio::Sndfile;\n\nsub MAIN(Str $filename, Str :$source, Int :$buffer = 256) {\n my $pa = Audio::PortAudio.new;\n my $format = Audio::Sndfile::Info::Format::WAV +| Audio::Sndfile::Info::Subformat::PCM_16;\n my $out-file = Audio::Sndfile.new(:$filename, channels => 1, samplerate => 44100, :$format, :w);\n my $st;\n\n if $source.defined {\n my $index = 0;\n for $pa.devices -> $device {\n if $device.name eq $source {\n else {\n my $la = $device.default-high-input-latency;\n my $si = Audio::PortAudio::StreamParameters.new(device => $index,\n channel-count => 1,\n sample-format => Audio::PortAudio::StreamFormat::Float32,\n suggested-latency => ($la || 0.05e0 ));\n $st = $pa.open-stream($si, Audio::PortAudio::StreamParameters, 44100, $buffer );\n last;\n }\n\n }\n $index++;\n }\n die \"Couldn't find a device for '$source'\" if !$st.defined;\n }\n else {\n $st = $pa.open-default-stream(2,0, Audio::PortAudio::StreamFormat::Float32, 44100, $buffer);\n }\n $st.start;\n my $p = Promise.new;\n signal(SIGINT).act({\n say \"stopping recording\";\n $p.keep: \"stopped\";\n $out-file.close;\n $st.close;\n exit;\n });\n my Channel $write-channel = Channel.new;\n my $write-promise = start {\n react {\n whenever $write-channel -> $item {\n if $p.status ~~ Planned {\n $out-file.write-float($item[0], $item[1]);\n $out-file.sync;\n }\n else {\n done;\n }\n }\n }\n };\n\n loop {\n if $p.status ~~ Planned {\n my $f = $buffer || $st.read-available;\n if $f > 0 {\n my $buff = $st.read($f,2, num32);\n $write-channel.send([$buff, $f]);\n }\n }\n else {\n last;\n }\n }\n\n}\n","language":"Raku"},{"code":"import java.io.{File, IOException}\nimport javax.sound.sampled.{AudioFileFormat, AudioFormat, AudioInputStream}\nimport javax.sound.sampled.{AudioSystem, DataLine, LineUnavailableException, TargetDataLine}\n\nobject SoundRecorder extends App {\n // record duration, in milliseconds\n final val RECORD_TIME = 60000 // 1 minute\n\n // path and format of the wav file\n val (wavFile, fileType) = (new File(\"RecordAudio.wav\"), AudioFileFormat.Type.WAVE)\n val format = new AudioFormat(/*sampleRate =*/ 16000f,\n /*sampleSizeInBits =*/ 16,\n /*channels =*/ 2,\n /*signed =*/ true,\n /*bigEndian =*/ true)\n\n val info = new DataLine.Info(classOf[TargetDataLine], format)\n val line: TargetDataLine = AudioSystem.getLine(info).asInstanceOf[TargetDataLine]\n\n // Entry to run the program\n\n // Creates a new thread that waits for a specified of time before stopping\n new Thread(new Runnable() {\n def run() {\n try {\n Thread.sleep(RECORD_TIME)\n } catch {\n case ex: InterruptedException => ex.printStackTrace()\n }\n finally {\n line.stop()\n line.close()\n }\n println(\"Finished\")\n }\n }).start()\n\n //Captures the sound and record into a WAV file\n try {\n // checks if system supports the data line\n if (AudioSystem.isLineSupported(info)) {\n line.open(format)\n line.start() // start capturing\n println(\"Recording started\")\n AudioSystem.write(new AudioInputStream(line), fileType, wavFile)\n } else println(\"Line not supported\")\n } catch {\n case ex: LineUnavailableException => ex.printStackTrace()\n case ioe: IOException => ioe.printStackTrace()\n }\n}\n","language":"Scala"},{"code":"package require sound\n\n# Helper to do a responsive wait\nproc delay t {after $t {set ::doneDelay ok}; vwait ::doneDelay}\n\n# Make an in-memory recording object\nset recording [snack::sound -encoding \"Lin16\" -rate 44100 -channels 1]\n\n# Set it doing the recording, wait for a second, and stop\n$recording record -append true\ndelay 1000\n$recording stop\n\n# Convert the internal buffer to viewable numbers, and print them out\nbinary scan [$recording data -byteorder littleEndian] s* words\nputs [join $words \", \"]\n\n# Destroy the recording object\n$recording destroy\n","language":"Tcl"},{"code":"print 1 \"Recording...\"\nmicrec\nprint 1 \"Playing...\"\nmicpla\nend\n","language":"Wee-Basic"},{"code":"/* Record_sound.wren */\n\nclass C {\n foreign static getInput(maxSize)\n\n foreign static arecord(args)\n\n foreign static aplay(name)\n}\n\nvar name = \"\"\nwhile (name == \"\") {\n System.write(\"Enter output file name (without extension) : \")\n name = C.getInput(80)\n}\nname = name + \".wav\"\n\nvar rate = 0\nwhile (!rate || !rate.isInteger || rate < 2000 || rate > 192000) {\n System.write(\"Enter sampling rate in Hz (2000 to 192000) : \")\n rate = Num.fromString(C.getInput(6))\n}\nvar rateS = rate.toString\n\nvar dur = 0\nwhile (!dur || dur < 5 || dur > 30) {\n System.write(\"Enter duration in seconds (5 to 30) : \")\n dur = Num.fromString(C.getInput(5))\n}\nvar durS = dur.toString\n\nSystem.print(\"\\nOK, start speaking now...\")\n// Default arguments: -c 1, -t wav. Note only signed 16 bit format supported.\nvar args = [\"-r\", rateS, \"-f\", \"S16_LE\", \"-d\", durS, name]\nC.arecord(args.join(\" \"))\n\nSystem.print(\"\\n'%(name)' created on disk and will now be played back...\")\nC.aplay(name)\nSystem.print(\"\\nPlay-back completed.\")\n","language":"Wren"},{"code":"#include <stdio.h>\n#include <stdio_ext.h>\n#include <stdlib.h>\n#include <string.h>\n#include \"wren.h\"\n\nvoid C_getInput(WrenVM* vm) {\n int maxSize = (int)wrenGetSlotDouble(vm, 1) + 2;\n char input[maxSize];\n fgets(input, maxSize, stdin);\n __fpurge(stdin);\n input[strcspn(input, \"\\n\")] = 0;\n wrenSetSlotString(vm, 0, (const char*)input);\n}\n\nvoid C_arecord(WrenVM* vm) {\n const char *args = wrenGetSlotString(vm, 1);\n char command[strlen(args) + 8];\n strcpy(command, \"arecord \");\n strcat(command, args);\n system(command);\n}\n\nvoid C_aplay(WrenVM* vm) {\n const char *name = wrenGetSlotString(vm, 1);\n char command[strlen(name) + 6];\n strcpy(command, \"aplay \");\n strcat(command, name);\n system(command);\n}\n\nWrenForeignMethodFn bindForeignMethod(\n WrenVM* vm,\n const char* module,\n const char* className,\n bool isStatic,\n const char* signature) {\n if (strcmp(module, \"main\") == 0) {\n if (strcmp(className, \"C\") == 0) {\n if (isStatic && strcmp(signature, \"getInput(_)\") == 0) return C_getInput;\n if (isStatic && strcmp(signature, \"arecord(_)\") == 0) return C_arecord;\n if (isStatic && strcmp(signature, \"aplay(_)\") == 0) return C_aplay;\n }\n }\n return NULL;\n}\n\nstatic void writeFn(WrenVM* vm, const char* text) {\n printf(\"%s\", text);\n}\n\nvoid errorFn(WrenVM* vm, WrenErrorType errorType, const char* module, const int line, const char* msg) {\n switch (errorType) {\n case WREN_ERROR_COMPILE:\n printf(\"[%s line %d] [Error] %s\\n\", module, line, msg);\n break;\n case WREN_ERROR_STACK_TRACE:\n printf(\"[%s line %d] in %s\\n\", module, line, msg);\n break;\n case WREN_ERROR_RUNTIME:\n printf(\"[Runtime Error] %s\\n\", msg);\n break;\n }\n}\n\nchar *readFile(const char *fileName) {\n FILE *f = fopen(fileName, \"r\");\n fseek(f, 0, SEEK_END);\n long fsize = ftell(f);\n rewind(f);\n char *script = malloc(fsize + 1);\n fread(script, 1, fsize, f);\n fclose(f);\n script[fsize] = 0;\n return script;\n}\n\nint main(int argc, char **argv) {\n WrenConfiguration config;\n wrenInitConfiguration(&config);\n config.writeFn = &writeFn;\n config.errorFn = &errorFn;\n config.bindForeignMethodFn = &bindForeignMethod;\n WrenVM* vm = wrenNewVM(&config);\n const char* module = \"main\";\n const char* fileName = \"Record_sound.wren\";\n char *script = readFile(fileName);\n WrenInterpretResult result = wrenInterpret(vm, module, script);\n switch (result) {\n case WREN_RESULT_COMPILE_ERROR:\n printf(\"Compile Error!\\n\");\n break;\n case WREN_RESULT_RUNTIME_ERROR:\n printf(\"Runtime Error!\\n\");\n break;\n case WREN_RESULT_SUCCESS:\n break;\n }\n wrenFreeVM(vm);\n free(script);\n return 0;\n}\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Temporal media\\nfrom: http://rosettacode.org/wiki/Record_sound\\nnote: Sound\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Record a monophonic 16-bit PCM sound into either memory space, a file or array.\\n\\n(This task neglects to specify the sample rate, and whether to use signed samples. \\nThe programs in this page might use signed 16-bit or unsigned 16-bit samples, at 8000 Hz, 44100 Hz, or any other sample rate. \\nTherefore, these programs might not record sound in the same format.)\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"name := \\\"sample\\\"\\nwaitsec := 5\\nTooltip Recording %name%.wav\\nMCI_SendString(\\\"close all wait\\\")\\nMCI_SendString(\\\"open new type waveaudio alias \\\" . name)\\nMCI_SendString(\\\"set \\\" . name . \\\" time format ms wait\\\")\\n;MCI_SendString(\\\"set \\\" . name . \\\" bitspersample 16 wait\\\")\\n;MCI_SendString(\\\"set \\\" . name . \\\" channels 1 wait\\\")\\n;MCI_SendString(\\\"set \\\" . name . \\\" samplespersec 16000 wait\\\")\\n;MCI_SendString(\\\"set \\\" . name . \\\" alignment 1 wait\\\")\\n;MCI_SendString(\\\"set \\\" . name . \\\" bytespersec 8000 wait\\\")\\nMCI_SendString(\\\"record \\\" . name)\\nSleep waitsec*1000\\nMCI_SendString(\\\"stop \\\" . name . \\\" wait\\\")\\nMCI_SendString(\\\"save \\\" . name . \\\" \\\"\\\"\\\" . name . \\\".wav\\\"\\\"\\\")\\nTooltip Finished ... Playing\\nMCI_SendString(\\\"delete \\\" . name)\\nMCI_SendString(\\\"close \\\" . name . \\\" wait\\\")\\nMCI_SendString(\\\"open \\\"\\\"\\\" . name . \\\".wav\\\"\\\" type waveaudio alias \\\" . name)\\nMCI_SendString(\\\"play \\\" . name . \\\" wait\\\")\\nMCI_SendString(\\\"close \\\" . name . \\\" wait\\\")\\nTooltip\\nReturn\\n\\nMCI_SendString(p_lpszCommand,ByRef r_lpszReturnString=\\\"\\\",p_hwndCallback=0) {\\n\\tVarSetCapacity(r_lpszReturnString,512,0)\\n\\tReturn DllCall(\\\"winmm.dll\\\\mciSendString\\\" . (A_IsUnicode ? \\\"W\\\":\\\"A\\\")\\n\\t\\t,\\\"Str\\\",p_lpszCommand\\t\\t\\t\\t\\t\\t;-- lpszCommand\\n\\t\\t,\\\"Str\\\",r_lpszReturnString\\t\\t\\t\\t\\t;-- lpszReturnString\\n\\t\\t,\\\"UInt\\\",512\\t\\t\\t\\t\\t\\t\\t\\t\\t;-- cchReturn\\n\\t\\t,A_PtrSize ? \\\"Ptr\\\":\\\"UInt\\\",p_hwndCallback\\t;-- hwndCallback\\n\\t\\t,\\\"Cdecl Int\\\")\\t\\t\\t\\t\\t\\t\\t\\t;-- Return type\\n}\\n; For more intuitive functions, see the MCI library by jballi.\\n; doc: http://www.autohotkey.net/~jballi/MCI/v1.1/MCI.html\\n; download: http://www.autohotkey.net/~jballi/MCI/v1.1/MCI.ahk\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \" wavfile$ = @dir$ + \\\"capture.wav\\\"\\n bitspersample% = 16\\n channels% = 2\\n samplespersec% = 44100\\n\\n alignment% = bitspersample% * channels% / 8\\n bytespersec% = alignment% * samplespersec%\\n\\n params$ = \\\" bitspersample \\\" + STR$(bitspersample%) + \\\\\\n \\\\ \\\" channels \\\" + STR$(channels%) + \\\\\\n \\\\ \\\" alignment \\\" + STR$(alignment%) + \\\\\\n \\\\ \\\" samplespersec \\\" + STR$(samplespersec%) + \\\\\\n \\\\ \\\" bytespersec \\\" + STR$(bytespersec%)\\n\\n SYS \\\"mciSendString\\\", \\\"close all\\\", 0, 0, 0\\n SYS \\\"mciSendString\\\", \\\"open new type waveaudio alias capture\\\", 0, 0, 0\\n SYS \\\"mciSendString\\\", \\\"set capture\\\" + params$, 0, 0, 0 TO res%\\n IF res% ERROR 100, \\\"Couldn't set capture parameters: \\\" + STR$(res% AND &FFFF)\\n\\n PRINT \\\"Press SPACE to start recording...\\\"\\n REPEAT UNTIL INKEY(1) = 32\\n\\n SYS \\\"mciSendString\\\", \\\"record capture\\\", 0, 0, 0 TO res%\\n IF res% ERROR 100, \\\"Couldn't start audio capture: \\\" + STR$(res% AND &FFFF)\\n\\n PRINT \\\"Recording, press SPACE to stop...\\\"\\n REPEAT UNTIL INKEY(1) = 32\\n\\n SYS \\\"mciSendString\\\", \\\"stop capture\\\", 0, 0, 0\\n SYS \\\"mciSendString\\\", \\\"save capture \\\" + wavfile$, 0, 0, 0 TO res%\\n IF res% ERROR 100, \\\"Couldn't save to WAV file: \\\" + STR$(res% AND &FFFF)\\n\\n SYS \\\"mciSendString\\\", \\\"delete capture\\\", 0, 0, 0\\n SYS \\\"mciSendString\\\", \\\"close capture\\\", 0, 0, 0\\n\\n PRINT \\\"Captured audio is stored in \\\" wavfile$\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdlib.h>\\n#include <unistd.h>\\n#include <sys/types.h>\\n#include <fcntl.h>\\n\\nvoid * record(size_t bytes)\\n{\\n\\tint fd;\\n\\tif (-1 == (fd = open(\\\"/dev/dsp\\\", O_RDONLY))) return 0;\\n\\tvoid *a = malloc(bytes);\\n\\tread(fd, a, bytes);\\n\\tclose(fd);\\n\\treturn a;\\n}\\n\\nint play(void *buf, size_t len)\\n{\\n\\tint fd;\\n\\tif (-1 == (fd = open(\\\"/dev/dsp\\\", O_WRONLY))) return 0;\\n\\twrite(fd, buf, len);\\n\\tclose(fd);\\n\\treturn 1;\\n}\\n\\nint main()\\n{\\n\\tvoid *p = record(65536);\\n\\tplay(p, 65536);\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <string>\\n#include <windows.h>\\n#include <mmsystem.h>\\n\\n#pragma comment ( lib, \\\"winmm.lib\\\" )\\nusing namespace std;\\n\\nclass recorder\\n{\\npublic:\\n void start()\\n {\\n\\tpaused = rec = false; action = \\\"IDLE\\\";\\n\\twhile( true )\\n\\t{\\n\\t cout << endl << \\\"==\\\" << action << \\\"==\\\" << endl << endl;\\n\\t cout << \\\"1) Record\\\" << endl << \\\"2) Play\\\" << endl << \\\"3) Pause\\\" << endl << \\\"4) Stop\\\" << endl << \\\"5) Quit\\\" << endl;\\n\\t char c; cin >> c;\\n\\t if( c > '0' && c < '6' )\\n\\t {\\n\\t\\tswitch( c )\\n\\t\\t{\\n\\t\\t case '1': record(); break;\\n\\t\\t case '2': play(); break;\\n\\t\\t case '3': pause(); break;\\n\\t\\t case '4': stop(); break;\\n\\t\\t case '5': stop(); return;\\n\\t\\t}\\n\\t }\\n\\t}\\n }\\nprivate:\\n void record()\\n {\\n\\tif( mciExecute( \\\"open new type waveaudio alias my_sound\\\") )\\n\\t{\\n\\t mciExecute( \\\"record my_sound\\\" );\\n\\t action = \\\"RECORDING\\\"; rec = true;\\n\\t}\\n }\\n void play()\\n {\\n\\tif( paused )\\n\\t mciExecute( \\\"play my_sound\\\" );\\n\\telse\\n\\t if( mciExecute( \\\"open tmp.wav alias my_sound\\\" ) )\\n\\t\\tmciExecute( \\\"play my_sound\\\" );\\n\\n\\taction = \\\"PLAYING\\\";\\n\\tpaused = false;\\n }\\n void pause()\\n {\\n\\tif( rec ) return;\\n\\tmciExecute( \\\"pause my_sound\\\" );\\n\\tpaused = true; action = \\\"PAUSED\\\";\\n }\\n void stop()\\n {\\n\\tif( rec )\\n\\t{\\n\\t mciExecute( \\\"stop my_sound\\\" );\\n\\t mciExecute( \\\"save my_sound tmp.wav\\\" );\\n\\t mciExecute( \\\"close my_sound\\\" );\\n\\t action = \\\"IDLE\\\"; rec = false;\\n\\t}\\n\\telse\\n\\t{\\n\\t mciExecute( \\\"stop my_sound\\\" );\\n\\t mciExecute( \\\"close my_sound\\\" );\\n\\t action = \\\"IDLE\\\";\\n\\t}\\n }\\n bool mciExecute( string cmd )\\n {\\n\\tif( mciSendString( cmd.c_str(), NULL, 0, NULL ) )\\n\\t{\\n\\t cout << \\\"Can't do this: \\\" << cmd << endl;\\n\\t return false;\\n\\t}\\n\\treturn true;\\n }\\n\\n bool paused, rec;\\n string action;\\n};\\n\\nint main( int argc, char* argv[] )\\n{\\n recorder r; r.start();\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"// chuck this with other shreds to record to file\\n// example> chuck foo.ck bar.ck rec\\n\\n// arguments: rec:<filename>\\n\\n// get name\\nme.arg(0) => string filename;\\nif( filename.length() == 0 ) \\\"foo.wav\\\" => filename;\\n\\n// pull samples from the dac\\ndac => Gain g => WvOut w => blackhole;\\n// this is the output file name\\nfilename => w.wavFilename;\\n<<<\\\"writing to file:\\\", \\\"'\\\" + w.filename() + \\\"'\\\">>>;\\n// any gain you want for the output\\n.5 => g.gain;\\n\\n// temporary workaround to automatically close file on remove-shred\\nnull @=> w;\\n\\n// infinite time loop...\\n// ctrl-c will stop it, or modify to desired duration\\nwhile( true ) 1::second => now;\\n\",\n \"language\": \"ChucK\"\n },\n {\n \"code\": \"(defun record (n)\\n (with-open-file (in \\\"/dev/dsp\\\" :element-type '(unsigned-byte 8))\\n (loop repeat n collect (read-byte in))\\n )\\n )\\n(defun play (byte-list)\\n (with-open-file (out \\\"/dev/dsp\\\" :direction :output :element-type '(unsigned-byte 8) :if-exists :append)\\n (mapcar (lambda (b) (write-byte b out)) byte-list)\\n )\\n )\\n(play (record 65536))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"begin_funct({wav}, Record sound);\\n set_decision(linger);\\n find_thing()_first()_microphone()_bitrate(16)_tech(PCM)_samplerate(signed16, unsigned16)_rangefrom(8000, Hz)_rangeto(44100, Hz)_export(.wav)\\n ? with_found()_microphone()_label(mic);\\n : err_funct[]_err(Sorry, no one has a microphone!);\\n exit_funct[];\\n ;\\n with_microphone[mic]_record()_durat({secs}, 30)_var(recording);\\n [Record sound]_ret([recording]);\\n reset_decision();\\nend_funct[];\\n\\n// Record a monophonic 16-bit PCM sound into memory space:\\nexec_funct(Record sound)_var(PCMRecording)_me(); // The variable 'PCMRecording' is the sound in memory space\\n\\n// Record a monophonic 16-bit PCM sound into a file or array:\\nexec_funct(Record sound)_file(foo.wav)_me(); // The file 'foo.wav' is the sound in a file\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"begin_instruct(Record sound);\\n set_decision(linger);\\n find_thing()_first()_microphone()_bitrate(16)_tech(PCM)_samplerate(signed16, unsigned16)_rangefrom(8000, Hz)_rangeto(44100, Hz)_export(.wav)\\n ? with_found()_label(recorder)_microphone()_label(mic);\\n : err_instruct[]_err(Sorry, no one has a microphone!);\\n exit_instruct[];\\n ;\\n with_microphone[mic]_record()_durat({secs}, 30)_var(recording);\\n reset_decision();\\nend_instruct[];\\n\\n// Record a monophonic 16-bit PCM sound into memory space:\\nexec_instruct(Record sound)_me();\\nwith_thing[recorder]_microphone[mic]_var[recording]_var(PCMRecording); // The variable 'PCMRecording' is the sound in memory space\\n\\n// Record a monophonic 16-bit PCM sound into a file or array:\\nexec_instruct(Record sound)_me();\\nwith_thing[recorder]_microphone[mic]_var[recording]_file(foo.wav)_me(); // The file 'foo.wav' is the sound in a file\\n\",\n \"language\": \"Diego\"\n },\n {\n \"code\": \"#define PI 4 * Atn(1)\\n\\n' Constants for the audio format\\nDim Shared As Integer SAMPLE_RATE = 44100\\nDim Shared As Integer BITS_PER_SAMPLE = 16\\nDim Shared As Integer NUM_CHANNELS = 1\\n\\n' Generates a sine wave\\nSub generateSineWave(buffer() As Short, frequency As Double)\\n Dim As Double increment = 2.0 * PI * frequency / SAMPLE_RATE\\n Dim As Double x = 0.0\\n For i As Integer = 0 To Ubound(buffer)\\n buffer(i) = (Sin(x) * 32767.0)\\n x += increment\\n Next i\\nEnd Sub\\n\\n' Write the header of the .wav file\\nSub writeWaveHeader(file As Integer, numSamples As Integer)\\n ' Write the RIFF header\\n Print #file, \\\"RIFF\\\";\\n Put #file, , numSamples * 2 + 36 ' File size\\n Print #file, \\\"WAVE\\\";\\n\\n Dim As Integer SB = 16, FA = 1\\n ' Write the fmt sub-block\\n Print #file, \\\"fmt \\\";\\n Put #file, , SB ' Size of the fmt sub-block\\n Put #file, , FA ' Audio format (1 = PCM)\\n Put #file, , NUM_CHANNELS ' Number of channels\\n Put #file, , SAMPLE_RATE ' Sample rate\\n Put #file, , SAMPLE_RATE * NUM_CHANNELS * BITS_PER_SAMPLE / 8 ' Byte rate\\n Put #file, , NUM_CHANNELS * BITS_PER_SAMPLE / 8 ' Alineación de bloques\\n Put #file, , BITS_PER_SAMPLE ' Bits per sample\\n\\n ' Write the data sub-block\\n Print #file, \\\"data\\\";\\n Put #file, , numSamples * 2 ' Data size\\nEnd Sub\\n\\nDim As Integer file = Freefile\\nOpen \\\"output.wav\\\" For Binary As #file\\n\\n' Generates a 440 Hz sine wave for 5 seconds\\nDim As Integer numSamples = SAMPLE_RATE * 5\\nDim As Short buffer(numSamples - 1)\\ngenerateSineWave(buffer(), 440.0)\\n\\n' Write the .wav file\\nwriteWaveHeader(file, numSamples)\\nPut #file, , buffer()\\n\\nClose #file\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bufio\\\"\\n \\\"fmt\\\"\\n \\\"log\\\"\\n \\\"os\\\"\\n \\\"os/exec\\\"\\n \\\"strconv\\\"\\n)\\n\\nfunc check(err error) {\\n if err != nil {\\n log.Fatal(err)\\n }\\n}\\n\\nfunc main() {\\n scanner := bufio.NewScanner(os.Stdin)\\n name := \\\"\\\"\\n for name == \\\"\\\" {\\n fmt.Print(\\\"Enter output file name (without extension) : \\\")\\n scanner.Scan()\\n name = scanner.Text()\\n check(scanner.Err())\\n }\\n name += \\\".wav\\\"\\n\\n rate := 0\\n for rate < 2000 || rate > 192000 {\\n fmt.Print(\\\"Enter sampling rate in Hz (2000 to 192000) : \\\")\\n scanner.Scan()\\n input := scanner.Text()\\n check(scanner.Err())\\n rate, _ = strconv.Atoi(input)\\n }\\n rateS := strconv.Itoa(rate)\\n\\n dur := 0.0\\n for dur < 5 || dur > 30 {\\n fmt.Print(\\\"Enter duration in seconds (5 to 30) : \\\")\\n scanner.Scan()\\n input := scanner.Text()\\n check(scanner.Err())\\n dur, _ = strconv.ParseFloat(input, 64)\\n }\\n durS := strconv.FormatFloat(dur, 'f', -1, 64)\\n\\n fmt.Println(\\\"OK, start speaking now...\\\")\\n // Default arguments: -c 1, -t wav. Note only signed 16 bit format supported.\\n args := []string{\\\"-r\\\", rateS, \\\"-f\\\", \\\"S16_LE\\\", \\\"-d\\\", durS, name}\\n cmd := exec.Command(\\\"arecord\\\", args...)\\n err := cmd.Run()\\n check(err)\\n\\n fmt.Printf(\\\"'%s' created on disk and will now be played back...\\\\n\\\", name)\\n cmd = exec.Command(\\\"aplay\\\", name)\\n err = cmd.Run()\\n check(err)\\n fmt.Println(\\\"Play-back completed.\\\")\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"Start,Programs,Accessories,Sound Recorder,Button:Record\\n\",\n \"language\": \"GUISS\"\n },\n {\n \"code\": \"import java.io.IOException;\\nimport java.util.concurrent.Executors;\\nimport java.util.concurrent.ScheduledExecutorService;\\nimport java.util.concurrent.TimeUnit;\\nimport java.io.File;\\n\\nimport javax.sound.sampled.AudioFileFormat.*;\\n\\npublic final class SoundRecorder {\\n\\n public static void main(String[] args) {\\n \\tSoundRecorder recorder = new SoundRecorder();\\n\\n ScheduledExecutorService scheduler = Executors.newSingleThreadScheduledExecutor();\\n scheduler.schedule( () -> recorder.finish(), 10, TimeUnit.SECONDS);\\n scheduler.shutdown();\\n\\n recorder.start();\\n }\\n\\n private void start() {\\n try {\\n AudioFormat format = createAudioFormat();\\n DataLine.Info info = new DataLine.Info(TargetDataLine.class, format);\\n\\n if ( ! AudioSystem.isLineSupported(info) ) {\\n System.out.println(\\\"Data line format is not supported\\\");\\n Runtime.getRuntime().exit(0);\\n }\\n\\n line = (TargetDataLine) AudioSystem.getLine(info);\\n line.open(format);\\n line.start();\\n\\n System.out.println(\\\"Starting to capture and record audio\\\");\\n AudioInputStream audioInputStream = new AudioInputStream(line);\\n AudioSystem.write(audioInputStream, audioFileType, wavFile);\\n\\n } catch (LineUnavailableException | IOException exception) {\\n exception.printStackTrace(System.err);\\n }\\n }\\n\\n private AudioFormat createAudioFormat() {\\n final float sampleRate = 16_000.0F;\\n final int sampleSizeInBits = 16;\\n final int channels = 1;\\n final boolean signed = true;\\n final boolean bigEndian = true;\\n // Monophonic 16-bit PCM audio format\\n return new AudioFormat(sampleRate, sampleSizeInBits, channels, signed, bigEndian);\\n }\\n\\n private void finish() {\\n line.stop();\\n line.close();\\n System.out.println(\\\"Finished capturing and recording audio\\\");\\n }\\n\\n private TargetDataLine line;\\n\\n private final File wavFile = new File(\\\"SoundRecorder.wav\\\");\\n private final AudioFileFormat.Type audioFileType = AudioFileFormat.Type.WAVE;\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"using PortAudio, LibSndFile\\n\\nstream = PortAudioStream(\\\"Microphone (USB Microphone)\\\", 1, 0) # 44100 samples/sec\\nbuf = read(stream, 441000)\\nsave(\\\"recorded10sec.wav\\\", buf)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.3\\n\\nimport java.io.File\\nimport javax.sound.sampled.*\\n\\nconst val RECORD_TIME = 20000L // twenty seconds say\\n\\nfun main(args: Array<String>) {\\n val wavFile = File(\\\"RecordAudio.wav\\\")\\n val fileType = AudioFileFormat.Type.WAVE\\n val format = AudioFormat(16000.0f, 16, 2, true, true)\\n val info = DataLine.Info(TargetDataLine::class.java, format)\\n val line = AudioSystem.getLine(info) as TargetDataLine\\n\\n // Creates a new thread that waits for 'RECORD_TIME' before stopping\\n Thread(object: Runnable {\\n override fun run() {\\n try {\\n Thread.sleep(RECORD_TIME)\\n }\\n catch (ie: InterruptedException) {\\n println(ie.message)\\n }\\n finally {\\n line.stop()\\n line.close()\\n }\\n println(\\\"Finished\\\")\\n }\\n }).start()\\n\\n // Captures the sound and saves it in a WAV file\\n try {\\n if (AudioSystem.isLineSupported(info)) {\\n line.open(format)\\n line.start()\\n println(\\\"Recording started\\\")\\n AudioSystem.write(AudioInputStream(line), fileType, wavFile)\\n }\\n else println(\\\"Line not supported\\\")\\n }\\n catch (lue: LineUnavailableException) {\\n println(lue.message)\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"run \\\"sndrec32.exe\\\"\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \" print \\\"Starting 5 sec. recording...\\\"\\n r$ =mciSendString$( \\\"open new type waveaudio alias capture\\\")\\n r$ =mciSendString$( \\\"set capture time format ms bitspersample 16\\\")\\n r$ =mciSendString$( \\\"set capture channels 1 samplespersec 8000\\\")\\n r$ =mciSendString$( \\\"set capture alignment 1 bytespersec 8000\\\")\\n r$ =mciSendString$( \\\"record capture\\\")\\n timer 5000, [on]\\n wait\\n [on]\\n timer 0\\n print \\\" .... now stopping the recording.\\\"\\n r$ =mciSendString$( \\\"stop capture\\\")\\n r$ =mciSendString$( \\\"save capture \\\" +chr$( 34) +\\\"sample.wav\\\" +chr$( 34))\\n r$ =mciSendString$( \\\"close capture\\\")\\n print \\\"Done recording.\\\"\\n r$=mciSendString$( \\\"open \\\" +q$ +\\\"sample.wav\\\" +q$ +\\\" type waveaudio alias sfx\\\")\\n r$=mciSendString$( \\\"play sfx wait\\\")\\n r$=mciSendString$( \\\"close sfx\\\")\\n print \\\"Done playing back.\\\"\\n end\\n\\nfunction mciSendString$( s$)\\n print s$\\n buffer$ =space$( 1024) +chr$( 0)\\n calldll #winmm, \\\"mciSendStringA\\\", s$ as ptr, buffer$ as ptr, 1028 as long, 0 as long, r as long\\n buffer$ =left$( buffer$, instr( buffer$, chr$( 0)) -1)\\n if r >0 then\\n mciSendString$ =\\\"error\\\"\\n print \\\"returned \\\"; mciSendString$\\n else\\n mciSendString$ =\\\"\\\"'buffer$\\n print \\\"OK\\\"\\n end if\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"command makeRecording\\n set the dontUseQT to false -- on windows use true\\n set the recordFormat to \\\"wave\\\" -- can be wav,aiff, au\\n set the recordRate to 44.1 -- sample at 44100 Hz\\n set the recordSampleSize to 16 --default is 8 bit\\n ask file \\\"Save recording as\\\"\\n if it is not empty then\\n answer record --show sound input dialog with presets above\\n record sound file it -- actual record command\\n wait 10 seconds\\n stop recording\\n end if\\nend makeRecording\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"SystemDialogInput[\\\"RecordSound\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import osproc, strutils\\n\\nvar name = \\\"\\\"\\nwhile name.len == 0:\\n stdout.write \\\"Enter output file name (without extension): \\\"\\n name = stdin.readLine().strip()\\nname.add \\\".wav\\\"\\n\\nvar rate = 0\\nwhile rate notin 2000..19_200:\\n stdout.write \\\"Enter sampling rate in Hz (2000 to 192000): \\\"\\n try: rate = parseInt(stdin.readLine().strip())\\n except ValueError: discard\\n\\nvar duration = 0\\nwhile duration notin 5..30:\\n stdout.write \\\"Enter duration in seconds (5 to 30): \\\"\\n try: duration = parseInt(stdin.readLine().strip())\\n except ValueError: discard\\n\\necho \\\"OK, start speaking now...\\\"\\n# Default arguments: -c 1, -t wav. Note that only signed 16 bit format is supported.\\nlet args = [\\\"-r\\\", $rate, \\\"-f\\\", \\\"S16_LE\\\", \\\"-d\\\", $duration, name]\\necho execProcess(\\\"arecord\\\", args = args, options = {poStdErrToStdOut, poUsePath})\\n\\necho \\\"'$1' created on disk and will now be played back...\\\" % name\\necho execProcess(\\\"aplay\\\", args = [name], options = {poStdErrToStdOut, poUsePath})\\necho \\\"Playback completed\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#load \\\"unix.cma\\\"\\n\\nlet record bytes =\\n let buf = String.make bytes '\\\\000' in\\n let ic = open_in \\\"/dev/dsp\\\" in\\n let chunk = 4096 in\\n for i = 0 to pred (bytes / chunk) do\\n ignore (input ic buf (i * chunk) chunk)\\n done;\\n close_in ic;\\n (buf)\\n\\nlet play buf len =\\n let oc = open_out \\\"/dev/dsp\\\" in\\n output_string oc buf;\\n close_out oc\\n\\nlet () =\\n let bytes = 65536 in\\n let p = record bytes in\\n play p bytes\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\Record_sound.exw\\n -- =============================\\n --</span>\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (file i/o)</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">wavfile</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"capture.wav\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">bitspersample</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">16</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">channels</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">samplespersec</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">44100</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">alignment</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">bitspersample</span> <span style=\\\"color: #0000FF;\\\">*</span> <span style=\\\"color: #000000;\\\">channels</span> <span style=\\\"color: #0000FF;\\\">/</span> <span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">bytespersec</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">alignment</span> <span style=\\\"color: #0000FF;\\\">*</span> <span style=\\\"color: #000000;\\\">samplespersec</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">params</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\" bitspersample %d channels %d alignment %d samplespersec %d bytespersec %d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">bitspersample</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">channels</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">alignment</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">samplespersec</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">bytespersec</span><span style=\\\"color: #0000FF;\\\">}),</span>\\n <span style=\\\"color: #000000;\\\">error_size</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2048</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">winmm</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">xmciSendString</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pError</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">mciSendString</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">msg</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">winmm</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">NULL</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">winmm</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">open_dll</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"winmm.dll\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">xmciSendString</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">define_c_func</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">winmm</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"mciSendStringA\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">C_PTR</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- LPCTSTR lpszCommand</span>\\n <span style=\\\"color: #000000;\\\">C_PTR</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- LPTSTR lpszReturnString</span>\\n <span style=\\\"color: #000000;\\\">C_INT</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- UINT cchReturn</span>\\n <span style=\\\"color: #000000;\\\">C_PTR</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- HANDLE hwndCallback</span>\\n <span style=\\\"color: #000000;\\\">C_INT</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- MCIERROR</span>\\n <span style=\\\"color: #000000;\\\">pError</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">allocate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">error_size</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">c_func</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">xmciSendString</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">msg</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pError</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">error_size</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"error %0x: %s\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">peek_string</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pError</span><span style=\\\"color: #0000FF;\\\">)})</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">get</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- get_bytes()</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">record</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">bytes</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">fn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">open</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"/dev/dsp\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"rb\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">=-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">get_bytes</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">bytes</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">close</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">play</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">buf</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">buf</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">fn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">open</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"/dev/dsp\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"wb\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">!=-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">buf</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">close</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()=</span><span style=\\\"color: #004600;\\\">WINDOWS</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">mciSendString</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"close all\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">mciSendString</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"open new type waveaudio alias capture\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">mciSendString</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"set capture\\\"</span> <span style=\\\"color: #0000FF;\\\">&</span> <span style=\\\"color: #000000;\\\">params</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Press SPACE to start recording...\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">wait_key</span><span style=\\\"color: #0000FF;\\\">()!=</span><span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #008080;\\\">do</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n\\n <span style=\\\"color: #000000;\\\">mciSendString</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"record capture\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Recording, press SPACE to stop...\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">wait_key</span><span style=\\\"color: #0000FF;\\\">()!=</span><span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #008080;\\\">do</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n\\n <span style=\\\"color: #000000;\\\">mciSendString</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"stop capture\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">mciSendString</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"save capture \\\"</span> <span style=\\\"color: #0000FF;\\\">&</span> <span style=\\\"color: #000000;\\\">wavfile</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">mciSendString</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"delete capture\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">mciSendString</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"close capture\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Captured audio is stored in \\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">wavfile</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()=</span><span style=\\\"color: #004600;\\\">LINUX</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- warning: untested</span>\\n <span style=\\\"color: #000000;\\\">play</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">record</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">65536</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- -- alternative, from Go (ditto)\\n -- string name = \\\"test.wav\\\",\\n -- rate = \\\"2000\\\", -- (2000..192000 Hz)\\n -- durn = \\\"5\\\" -- (5 to 30 seconds)\\n -- printf(1,\\\"OK, start speaking now...\\\\n\\\")\\n -- -- Default arguments: -c 1, -t wav. Note only signed 16 bit format supported.\\n -- string cmd = sprintf(\\\"arecord -r %s -f S16_LE -d %s %s\\\", {rate,durn,name})\\n -- {} = system_exec(cmd)\\n -- printf(1,\\\"'%s' created on disk and will now be played back...\\\\n\\\", {name})\\n -- {} = system_exec(\\\"aplay \\\"&name)\\n -- printf(1,\\\"Play-back completed.\\\\n\\\")</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(in '(rec -q -c1 -tu16 - trim 0 2) # Record 2 seconds\\n (make\\n (while (rd 2)\\n (link @) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"import pyaudio\\n\\nchunk = 1024\\nFORMAT = pyaudio.paInt16\\nCHANNELS = 1\\nRATE = 44100\\n\\np = pyaudio.PyAudio()\\n\\nstream = p.open(format = FORMAT,\\n channels = CHANNELS,\\n rate = RATE,\\n input = True,\\n frames_per_buffer = chunk)\\n\\ndata = stream.read(chunk)\\nprint [ord(i) for i in data]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n(define (record n) (with-input-from-file \\\"/dev/dsp\\\" ( () (read-bytes n))))\\n(define (play bs) (display-to-file bs \\\"/dev/dsp\\\" #:exists 'append))\\n(play (record 65536))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use Audio::PortAudio;\\nuse Audio::Sndfile;\\n\\nsub MAIN(Str $filename, Str :$source, Int :$buffer = 256) {\\n my $pa = Audio::PortAudio.new;\\n my $format = Audio::Sndfile::Info::Format::WAV +| Audio::Sndfile::Info::Subformat::PCM_16;\\n my $out-file = Audio::Sndfile.new(:$filename, channels => 1, samplerate => 44100, :$format, :w);\\n my $st;\\n\\n if $source.defined {\\n my $index = 0;\\n for $pa.devices -> $device {\\n if $device.name eq $source {\\n else {\\n my $la = $device.default-high-input-latency;\\n my $si = Audio::PortAudio::StreamParameters.new(device => $index,\\n channel-count => 1,\\n sample-format => Audio::PortAudio::StreamFormat::Float32,\\n suggested-latency => ($la || 0.05e0 ));\\n $st = $pa.open-stream($si, Audio::PortAudio::StreamParameters, 44100, $buffer );\\n last;\\n }\\n\\n }\\n $index++;\\n }\\n die \\\"Couldn't find a device for '$source'\\\" if !$st.defined;\\n }\\n else {\\n $st = $pa.open-default-stream(2,0, Audio::PortAudio::StreamFormat::Float32, 44100, $buffer);\\n }\\n $st.start;\\n my $p = Promise.new;\\n signal(SIGINT).act({\\n say \\\"stopping recording\\\";\\n $p.keep: \\\"stopped\\\";\\n $out-file.close;\\n $st.close;\\n exit;\\n });\\n my Channel $write-channel = Channel.new;\\n my $write-promise = start {\\n react {\\n whenever $write-channel -> $item {\\n if $p.status ~~ Planned {\\n $out-file.write-float($item[0], $item[1]);\\n $out-file.sync;\\n }\\n else {\\n done;\\n }\\n }\\n }\\n };\\n\\n loop {\\n if $p.status ~~ Planned {\\n my $f = $buffer || $st.read-available;\\n if $f > 0 {\\n my $buff = $st.read($f,2, num32);\\n $write-channel.send([$buff, $f]);\\n }\\n }\\n else {\\n last;\\n }\\n }\\n\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"import java.io.{File, IOException}\\nimport javax.sound.sampled.{AudioFileFormat, AudioFormat, AudioInputStream}\\nimport javax.sound.sampled.{AudioSystem, DataLine, LineUnavailableException, TargetDataLine}\\n\\nobject SoundRecorder extends App {\\n // record duration, in milliseconds\\n final val RECORD_TIME = 60000 // 1 minute\\n\\n // path and format of the wav file\\n val (wavFile, fileType) = (new File(\\\"RecordAudio.wav\\\"), AudioFileFormat.Type.WAVE)\\n val format = new AudioFormat(/*sampleRate =*/ 16000f,\\n /*sampleSizeInBits =*/ 16,\\n /*channels =*/ 2,\\n /*signed =*/ true,\\n /*bigEndian =*/ true)\\n\\n val info = new DataLine.Info(classOf[TargetDataLine], format)\\n val line: TargetDataLine = AudioSystem.getLine(info).asInstanceOf[TargetDataLine]\\n\\n // Entry to run the program\\n\\n // Creates a new thread that waits for a specified of time before stopping\\n new Thread(new Runnable() {\\n def run() {\\n try {\\n Thread.sleep(RECORD_TIME)\\n } catch {\\n case ex: InterruptedException => ex.printStackTrace()\\n }\\n finally {\\n line.stop()\\n line.close()\\n }\\n println(\\\"Finished\\\")\\n }\\n }).start()\\n\\n //Captures the sound and record into a WAV file\\n try {\\n // checks if system supports the data line\\n if (AudioSystem.isLineSupported(info)) {\\n line.open(format)\\n line.start() // start capturing\\n println(\\\"Recording started\\\")\\n AudioSystem.write(new AudioInputStream(line), fileType, wavFile)\\n } else println(\\\"Line not supported\\\")\\n } catch {\\n case ex: LineUnavailableException => ex.printStackTrace()\\n case ioe: IOException => ioe.printStackTrace()\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"package require sound\\n\\n# Helper to do a responsive wait\\nproc delay t {after $t {set ::doneDelay ok}; vwait ::doneDelay}\\n\\n# Make an in-memory recording object\\nset recording [snack::sound -encoding \\\"Lin16\\\" -rate 44100 -channels 1]\\n\\n# Set it doing the recording, wait for a second, and stop\\n$recording record -append true\\ndelay 1000\\n$recording stop\\n\\n# Convert the internal buffer to viewable numbers, and print them out\\nbinary scan [$recording data -byteorder littleEndian] s* words\\nputs [join $words \\\", \\\"]\\n\\n# Destroy the recording object\\n$recording destroy\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"print 1 \\\"Recording...\\\"\\nmicrec\\nprint 1 \\\"Playing...\\\"\\nmicpla\\nend\\n\",\n \"language\": \"Wee-Basic\"\n },\n {\n \"code\": \"/* Record_sound.wren */\\n\\nclass C {\\n foreign static getInput(maxSize)\\n\\n foreign static arecord(args)\\n\\n foreign static aplay(name)\\n}\\n\\nvar name = \\\"\\\"\\nwhile (name == \\\"\\\") {\\n System.write(\\\"Enter output file name (without extension) : \\\")\\n name = C.getInput(80)\\n}\\nname = name + \\\".wav\\\"\\n\\nvar rate = 0\\nwhile (!rate || !rate.isInteger || rate < 2000 || rate > 192000) {\\n System.write(\\\"Enter sampling rate in Hz (2000 to 192000) : \\\")\\n rate = Num.fromString(C.getInput(6))\\n}\\nvar rateS = rate.toString\\n\\nvar dur = 0\\nwhile (!dur || dur < 5 || dur > 30) {\\n System.write(\\\"Enter duration in seconds (5 to 30) : \\\")\\n dur = Num.fromString(C.getInput(5))\\n}\\nvar durS = dur.toString\\n\\nSystem.print(\\\"\\\\nOK, start speaking now...\\\")\\n// Default arguments: -c 1, -t wav. Note only signed 16 bit format supported.\\nvar args = [\\\"-r\\\", rateS, \\\"-f\\\", \\\"S16_LE\\\", \\\"-d\\\", durS, name]\\nC.arecord(args.join(\\\" \\\"))\\n\\nSystem.print(\\\"\\\\n'%(name)' created on disk and will now be played back...\\\")\\nC.aplay(name)\\nSystem.print(\\\"\\\\nPlay-back completed.\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdio_ext.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include \\\"wren.h\\\"\\n\\nvoid C_getInput(WrenVM* vm) {\\n int maxSize = (int)wrenGetSlotDouble(vm, 1) + 2;\\n char input[maxSize];\\n fgets(input, maxSize, stdin);\\n __fpurge(stdin);\\n input[strcspn(input, \\\"\\\\n\\\")] = 0;\\n wrenSetSlotString(vm, 0, (const char*)input);\\n}\\n\\nvoid C_arecord(WrenVM* vm) {\\n const char *args = wrenGetSlotString(vm, 1);\\n char command[strlen(args) + 8];\\n strcpy(command, \\\"arecord \\\");\\n strcat(command, args);\\n system(command);\\n}\\n\\nvoid C_aplay(WrenVM* vm) {\\n const char *name = wrenGetSlotString(vm, 1);\\n char command[strlen(name) + 6];\\n strcpy(command, \\\"aplay \\\");\\n strcat(command, name);\\n system(command);\\n}\\n\\nWrenForeignMethodFn bindForeignMethod(\\n WrenVM* vm,\\n const char* module,\\n const char* className,\\n bool isStatic,\\n const char* signature) {\\n if (strcmp(module, \\\"main\\\") == 0) {\\n if (strcmp(className, \\\"C\\\") == 0) {\\n if (isStatic && strcmp(signature, \\\"getInput(_)\\\") == 0) return C_getInput;\\n if (isStatic && strcmp(signature, \\\"arecord(_)\\\") == 0) return C_arecord;\\n if (isStatic && strcmp(signature, \\\"aplay(_)\\\") == 0) return C_aplay;\\n }\\n }\\n return NULL;\\n}\\n\\nstatic void writeFn(WrenVM* vm, const char* text) {\\n printf(\\\"%s\\\", text);\\n}\\n\\nvoid errorFn(WrenVM* vm, WrenErrorType errorType, const char* module, const int line, const char* msg) {\\n switch (errorType) {\\n case WREN_ERROR_COMPILE:\\n printf(\\\"[%s line %d] [Error] %s\\\\n\\\", module, line, msg);\\n break;\\n case WREN_ERROR_STACK_TRACE:\\n printf(\\\"[%s line %d] in %s\\\\n\\\", module, line, msg);\\n break;\\n case WREN_ERROR_RUNTIME:\\n printf(\\\"[Runtime Error] %s\\\\n\\\", msg);\\n break;\\n }\\n}\\n\\nchar *readFile(const char *fileName) {\\n FILE *f = fopen(fileName, \\\"r\\\");\\n fseek(f, 0, SEEK_END);\\n long fsize = ftell(f);\\n rewind(f);\\n char *script = malloc(fsize + 1);\\n fread(script, 1, fsize, f);\\n fclose(f);\\n script[fsize] = 0;\\n return script;\\n}\\n\\nint main(int argc, char **argv) {\\n WrenConfiguration config;\\n wrenInitConfiguration(&config);\\n config.writeFn = &writeFn;\\n config.errorFn = &errorFn;\\n config.bindForeignMethodFn = &bindForeignMethod;\\n WrenVM* vm = wrenNewVM(&config);\\n const char* module = \\\"main\\\";\\n const char* fileName = \\\"Record_sound.wren\\\";\\n char *script = readFile(fileName);\\n WrenInterpretResult result = wrenInterpret(vm, module, script);\\n switch (result) {\\n case WREN_RESULT_COMPILE_ERROR:\\n printf(\\\"Compile Error!\\\\n\\\");\\n break;\\n case WREN_RESULT_RUNTIME_ERROR:\\n printf(\\\"Runtime Error!\\\\n\\\");\\n break;\\n case WREN_RESULT_SUCCESS:\\n break;\\n }\\n wrenFreeVM(vm);\\n free(script);\\n return 0;\\n}\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Record-sound"}}},{"rowIdx":1571,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Reflection/Get_source\nnote: Reflection\n","language":"00-META"},{"code":";Task:\nThe goal is to get the source code or file path and line number where a programming object (e.g. module, class, function, method) is defined.\n<br><br>\n","language":"00-TASK"},{"code":"LDA #<foo\nsta $00\nLDA #>foo\nsta $01\njsr PrintBytecode\n\nfoo:\n;do stuff\nrts\n\nPrintBytecode:\nldy #0\n\nlda $01 ;high byte of starting address of the source\njsr PrintHex\n;unimplemented routine that separates the \"nibbles\" of the accumulator,\n; adds $30 or $37 to each depending on if it's 0-9 or A-F respectively, which converts hex to ASCII,\n; then prints the high nibble then the low.\n\nlda $00 ;low byte of the starting address of the source\njsr PrintHex\njsr NewLine ;unimplemented new line routine\n\nloop:\nlda ($00),y\ncmp #$60\nbeq Terminated\njsr PrintHex\n\njmp loop\nTerminated:\njsr PrintHex ;print the last instruction of the routine.\nrts\n","language":"6502-Assembly"},{"code":"; Use source function for source code.\n(source println)\n\n; Use meta function for filenames and line numbers (and other metadata)\n(meta #'println)\n","language":"Clojure"},{"code":"USE: see\n\\ integer see ! class\nnl\n\\ dip see ! word\n","language":"Factor"},{"code":"USE: accessors\n\\ partition def>> .\n","language":"Factor"},{"code":"USE: accessors\n\\ dip vocabulary>> print\n","language":"Factor"},{"code":"USE: vocabs.files\n\"sequences\" vocab-files .\n","language":"Factor"},{"code":"\"loc\" \\ dip props>> at\n","language":"Factor"},{"code":"' FB 1.05.0 Win64 (getsource.bas)\n\nSub Proc()\n Print __Function__ & \" is defined in \" & __Path__ & \"\\\" & __File__ & \" at line \" & ( __line__ - 1)\nEnd Sub\n\nProc()\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"path\"\n \"reflect\"\n \"runtime\"\n)\n\nfunc someFunc() {\n fmt.Println(\"someFunc called\")\n}\n\nfunc main() {\n pc := reflect.ValueOf(someFunc).Pointer()\n f := runtime.FuncForPC(pc)\n name := f.Name()\n file, line := f.FileLine(pc)\n fmt.Println(\"Name of function :\", name)\n fmt.Println(\"Name of file :\", path.Base(file))\n fmt.Println(\"Line number :\", line)\n}\n","language":"Go"},{"code":" mean=:+/ %#\n 5!:5 <'mean'\n+/ % #\n 5!:6 <'mean'\n(+/) % #\n 4!:4 <'mean'\n_1\n 4!:4 <'names'\n2\n 2 { 4!:3 ''\n┌────────────────────────────────────────────┐\n│/Applications/j64-804/system/main/stdlib.ijs│\n└────────────────────────────────────────────┘\n","language":"J"},{"code":" linrep=: 5!:5@<\n srcfile=: (4!:4@<) { a:,~ 4!:3 bind ''\n","language":"J"},{"code":" linrep 'names'\nlist_z_@nl\n srcfile 'names'\n┌────────────────────────────────────────────┐\n│/Applications/j64-804/system/main/stdlib.ijs│\n└────────────────────────────────────────────┘\n srcfile 'mean'\n┌┐\n││\n└┘\n","language":"J"},{"code":"public class ReflectionGetSource {\n\n public static void main(String[] args) {\n new ReflectionGetSource().method1();\n\n }\n\n public ReflectionGetSource() {}\n\n public void method1() {\n method2();\n }\n\n public void method2() {\n method3();\n }\n\n public void method3() {\n Throwable t = new Throwable();\n for ( StackTraceElement ste : t.getStackTrace() ) {\n System.out.printf(\"File Name = %s%n\", ste.getFileName());\n System.out.printf(\"Class Name = %s%n\", ste.getClassName());\n System.out.printf(\"Method Name = %s%n\", ste.getMethodName());\n System.out.printf(\"Line number = %s%n%n\", ste.getLineNumber());\n }\n }\n\n}\n","language":"Java"},{"code":"function foo() {...}\nfoo.toString();\n// \"function foo() {...}\"\n","language":"JavaScript"},{"code":"Math.sqrt.toString();\n// \"function sqrt() { [native code] }\"\n","language":"JavaScript"},{"code":"# Definition\nfunction foo() end\n\n@which foo() # where foo is defined\n@less foo() # first file where foo is defined\n","language":"Julia"},{"code":"// Kotlin JS Version 1.2.31\n\nfun hello() {\n println(\"Hello\")\n}\n\nfun main(args: Array<String>) {\n val code = js(\"_.hello.toString()\")\n println(code)\n}\n","language":"Kotlin"},{"code":"----------------------------------------\n-- Returns source code either for a class (parent script) or a class instance (object)\n-- @param {script|instance} class\n-- @return {string}\n----------------------------------------\non getClassCode (class)\n if ilk(class)=#instance then class=class.script\n return class.text\nend\n\n----------------------------------------\n-- Returns the source code of the movie script that defines the specified global function\n-- @param {symbol} func - function specified as symbol\n-- @return {string|VOID}\n----------------------------------------\non getGlobalFunctionCode (func)\n -- iterate over all members in all castlibs\n repeat with i = 1 to _movie.castlib.count\n repeat with j = 1 to _movie.castlib[i].member.count\n m = _movie.castlib[i].member[j]\n if m.type<>#script then next repeat\n if m.scriptType=#movie and m.script.handler(func) then return m.script.text\n end repeat\n end repeat\nend\n","language":"Lingo"},{"code":"obj = script(\"MyClass\").new()\nput getClassCode(obj)\n-- script text is printed...\n\nfunc = #startMovie\nput getGlobalFunctionCode(func)\n-- script text is printed...\n","language":"Lingo"},{"code":"debug = require(\"debug\")\nfunction foo(bar)\n info = debug.getinfo(1)\n for k,v in pairs(info) do print(k,v) end\nend\nfoo()\n","language":"Lua"},{"code":"import Nanoquery.IO\nprintln new(File, __file__).readAll()\n","language":"Nanoquery"},{"code":"import macros, strformat\n\nproc f(arg: int): int = arg+1\n\nmacro getSource(source: static[string]) =\n let module = parseStmt(source)\n for node in module.children:\n if node.kind == nnkProcDef:\n echo(&\"source of procedure {node.name} is:\\n{toStrLit(node).strVal}\")\n\nproc g(arg: float): float = arg*arg\n\ngetSource(staticRead(currentSourcePath()))\n","language":"Nim"},{"code":"# 20211213 Perl programming solution\n\nuse strict;\nuse warnings;\n\nuse Class::Inspector;\n\nprint Class::Inspector->resolved_filename( 'IO::Socket::INET' ), \"\\n\";\n","language":"Perl"},{"code":"import os\nos.__file__\n# \"/usr/local/lib/python3.5/os.pyc\"\n","language":"Python"},{"code":"say &sum.file;\nsay Date.^find_method(\"day-of-week\").file;\n","language":"Raku"},{"code":"/*REXX program gets the source function (source code) and */\n/*───────────────────────── displays the number of lines. */\n#=sourceline()\n do j=1 for sourceline()\n say 'line' right(j, length(#) ) '──►' ,\n strip( sourceline(j), 'T')\n end /*j*/\nsay\nparse source x y sID\nsay 'The name of the source file (program) is: ' sID\nsay 'The number of lines in the source program: ' #\n /*stick a fork in it, we're all done.*/\n","language":"REXX"},{"code":"# Project : Reflection/Get source\n\nfp = fopen(\"C:\\Ring\\applications\\fifteenpuzzle\\CalmoSoftFifteenPuzzleGame.ring\",\"r\")\nr = \"\"\nstr = \"\"\nflag = 0\nnumline = 0\nsee \"give the function: \"\ngive funct\nfunct = \"func \" + funct\nwhile isstring(r)\n r = fgetc(fp)\n if r = char(10)\n flag = 1\n numline = numline + 1\n else\n flag = 0\n str = str + r\n ok\n if flag = 1\n if left(str,len(funct)) = funct\n see '\"' + funct + '\"' +\" is in the line: \" + numline + nl\n ok\n str = \"\"\n ok\nend\nfclose(fp)\n","language":"Ring"},{"code":"require 'mathn'\nMath.method(:sqrt).source_location\n# [\"/usr/local/lib/ruby2.3/2.3.0/mathn.rb\", 119]\n\nClass.method(:nesting).source_location\n# nil, since Class#nesting is native\n","language":"Ruby"},{"code":"mthd := someClass compiledMethodAt:#nameOfMethod\n","language":"Smalltalk"},{"code":"mthd source\n","language":"Smalltalk"},{"code":"thisContext method source\nthisContext lineNumber\n","language":"Smalltalk"},{"code":"proc getproc {name} {\n set name [uplevel 1 [list namespace which -command $name]]\n set args [info args $name]\n set args [lmap arg $args { ;# handle default arguments, if it has them!\n if {[info default $name $arg default]} {\n list $name $default\n } else {\n return -level 0 $arg\n }\n }]\n set body [info body $name]\n list proc $name $args $body\n}\n\nputs [getproc getproc]\n","language":"Tcl"},{"code":"proc ::getproc name {\n set name [uplevel 1 [list namespace which -command $name]]\n set args [info args $name]\n set args [lmap arg $args { ;# handle default arguments, if it has them!\n if {[info default $name $arg default]} {\n list $name $default\n } else {\n return -level 0 $arg\n }\n }]\n set body [info body $name]\n list proc $name $args $body\n}\n","language":"Tcl"},{"code":"import \"os\" for Platform, Process\nimport \"io\" for File\nimport \"/.pattern\" for Pattern\n\nvar getSourceLines = Fn.new {\n var fileName = Process.allArguments[1]\n var text = File.read(fileName)\n var sep = Platform.isWindows ? \"\\r\\n\" : \"\\n\"\n return [fileName, text.split(sep)]\n}\n\nvar res = getSourceLines.call()\nvar fileName = res[0]\nvar lines = res[1]\n// look for getSourceLines function\nvar funcName = \"getSourceLines\"\nvar p = Pattern.new(\"+1/s\")\nvar i = 1\nvar found = 0\nfor (line in lines) {\n var t = p.splitAll(line.trim())\n if (t[0] == \"var\" && t[1] == funcName && t[2] == \"=\" && t[3] == \"Fn.new\") {\n found = i\n break\n }\n i = i + 1\n}\n\nSystem.print(\"File name : %(fileName)\")\nSystem.print(\"Function name : %(funcName)\")\nSystem.print(\"Line number : %(found > 0 ? found : \"Function not found\")\")\n","language":"Wren"},{"code":"src:=File(__FILE__).read();\nprintln(\"Src file is \\\"%s\\\" and has %d lines\".fmt(__FILE__,src.len(1)));\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Reflection/Get_source\\nnote: Reflection\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nThe goal is to get the source code or file path and line number where a programming object (e.g. module, class, function, method) is defined.\\n<br><br>\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"LDA #<foo\\nsta $00\\nLDA #>foo\\nsta $01\\njsr PrintBytecode\\n\\nfoo:\\n;do stuff\\nrts\\n\\nPrintBytecode:\\nldy #0\\n\\nlda $01 ;high byte of starting address of the source\\njsr PrintHex\\n;unimplemented routine that separates the \\\"nibbles\\\" of the accumulator,\\n; adds $30 or $37 to each depending on if it's 0-9 or A-F respectively, which converts hex to ASCII,\\n; then prints the high nibble then the low.\\n\\nlda $00 ;low byte of the starting address of the source\\njsr PrintHex\\njsr NewLine ;unimplemented new line routine\\n\\nloop:\\nlda ($00),y\\ncmp #$60\\nbeq Terminated\\njsr PrintHex\\n\\njmp loop\\nTerminated:\\njsr PrintHex ;print the last instruction of the routine.\\nrts\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"; Use source function for source code.\\n(source println)\\n\\n; Use meta function for filenames and line numbers (and other metadata)\\n(meta #'println)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"USE: see\\n\\\\ integer see ! class\\nnl\\n\\\\ dip see ! word\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"USE: accessors\\n\\\\ partition def>> .\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"USE: accessors\\n\\\\ dip vocabulary>> print\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"USE: vocabs.files\\n\\\"sequences\\\" vocab-files .\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"\\\"loc\\\" \\\\ dip props>> at\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64 (getsource.bas)\\n\\nSub Proc()\\n Print __Function__ & \\\" is defined in \\\" & __Path__ & \\\"\\\\\\\" & __File__ & \\\" at line \\\" & ( __line__ - 1)\\nEnd Sub\\n\\nProc()\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"path\\\"\\n \\\"reflect\\\"\\n \\\"runtime\\\"\\n)\\n\\nfunc someFunc() {\\n fmt.Println(\\\"someFunc called\\\")\\n}\\n\\nfunc main() {\\n pc := reflect.ValueOf(someFunc).Pointer()\\n f := runtime.FuncForPC(pc)\\n name := f.Name()\\n file, line := f.FileLine(pc)\\n fmt.Println(\\\"Name of function :\\\", name)\\n fmt.Println(\\\"Name of file :\\\", path.Base(file))\\n fmt.Println(\\\"Line number :\\\", line)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \" mean=:+/ %#\\n 5!:5 <'mean'\\n+/ % #\\n 5!:6 <'mean'\\n(+/) % #\\n 4!:4 <'mean'\\n_1\\n 4!:4 <'names'\\n2\\n 2 { 4!:3 ''\\n┌────────────────────────────────────────────┐\\n│/Applications/j64-804/system/main/stdlib.ijs│\\n└────────────────────────────────────────────┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" linrep=: 5!:5@<\\n srcfile=: (4!:4@<) { a:,~ 4!:3 bind ''\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" linrep 'names'\\nlist_z_@nl\\n srcfile 'names'\\n┌────────────────────────────────────────────┐\\n│/Applications/j64-804/system/main/stdlib.ijs│\\n└────────────────────────────────────────────┘\\n srcfile 'mean'\\n┌┐\\n││\\n└┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class ReflectionGetSource {\\n\\n public static void main(String[] args) {\\n new ReflectionGetSource().method1();\\n\\n }\\n\\n public ReflectionGetSource() {}\\n\\n public void method1() {\\n method2();\\n }\\n\\n public void method2() {\\n method3();\\n }\\n\\n public void method3() {\\n Throwable t = new Throwable();\\n for ( StackTraceElement ste : t.getStackTrace() ) {\\n System.out.printf(\\\"File Name = %s%n\\\", ste.getFileName());\\n System.out.printf(\\\"Class Name = %s%n\\\", ste.getClassName());\\n System.out.printf(\\\"Method Name = %s%n\\\", ste.getMethodName());\\n System.out.printf(\\\"Line number = %s%n%n\\\", ste.getLineNumber());\\n }\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function foo() {...}\\nfoo.toString();\\n// \\\"function foo() {...}\\\"\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"Math.sqrt.toString();\\n// \\\"function sqrt() { [native code] }\\\"\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Definition\\nfunction foo() end\\n\\n@which foo() # where foo is defined\\n@less foo() # first file where foo is defined\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// Kotlin JS Version 1.2.31\\n\\nfun hello() {\\n println(\\\"Hello\\\")\\n}\\n\\nfun main(args: Array<String>) {\\n val code = js(\\\"_.hello.toString()\\\")\\n println(code)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"----------------------------------------\\n-- Returns source code either for a class (parent script) or a class instance (object)\\n-- @param {script|instance} class\\n-- @return {string}\\n----------------------------------------\\non getClassCode (class)\\n if ilk(class)=#instance then class=class.script\\n return class.text\\nend\\n\\n----------------------------------------\\n-- Returns the source code of the movie script that defines the specified global function\\n-- @param {symbol} func - function specified as symbol\\n-- @return {string|VOID}\\n----------------------------------------\\non getGlobalFunctionCode (func)\\n -- iterate over all members in all castlibs\\n repeat with i = 1 to _movie.castlib.count\\n repeat with j = 1 to _movie.castlib[i].member.count\\n m = _movie.castlib[i].member[j]\\n if m.type<>#script then next repeat\\n if m.scriptType=#movie and m.script.handler(func) then return m.script.text\\n end repeat\\n end repeat\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"obj = script(\\\"MyClass\\\").new()\\nput getClassCode(obj)\\n-- script text is printed...\\n\\nfunc = #startMovie\\nput getGlobalFunctionCode(func)\\n-- script text is printed...\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"debug = require(\\\"debug\\\")\\nfunction foo(bar)\\n info = debug.getinfo(1)\\n for k,v in pairs(info) do print(k,v) end\\nend\\nfoo()\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"import Nanoquery.IO\\nprintln new(File, __file__).readAll()\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"import macros, strformat\\n\\nproc f(arg: int): int = arg+1\\n\\nmacro getSource(source: static[string]) =\\n let module = parseStmt(source)\\n for node in module.children:\\n if node.kind == nnkProcDef:\\n echo(&\\\"source of procedure {node.name} is:\\\\n{toStrLit(node).strVal}\\\")\\n\\nproc g(arg: float): float = arg*arg\\n\\ngetSource(staticRead(currentSourcePath()))\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"# 20211213 Perl programming solution\\n\\nuse strict;\\nuse warnings;\\n\\nuse Class::Inspector;\\n\\nprint Class::Inspector->resolved_filename( 'IO::Socket::INET' ), \\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"import os\\nos.__file__\\n# \\\"/usr/local/lib/python3.5/os.pyc\\\"\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"say &sum.file;\\nsay Date.^find_method(\\\"day-of-week\\\").file;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program gets the source function (source code) and */\\n/*───────────────────────── displays the number of lines. */\\n#=sourceline()\\n do j=1 for sourceline()\\n say 'line' right(j, length(#) ) '──►' ,\\n strip( sourceline(j), 'T')\\n end /*j*/\\nsay\\nparse source x y sID\\nsay 'The name of the source file (program) is: ' sID\\nsay 'The number of lines in the source program: ' #\\n /*stick a fork in it, we're all done.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Reflection/Get source\\n\\nfp = fopen(\\\"C:\\\\Ring\\\\applications\\\\fifteenpuzzle\\\\CalmoSoftFifteenPuzzleGame.ring\\\",\\\"r\\\")\\nr = \\\"\\\"\\nstr = \\\"\\\"\\nflag = 0\\nnumline = 0\\nsee \\\"give the function: \\\"\\ngive funct\\nfunct = \\\"func \\\" + funct\\nwhile isstring(r)\\n r = fgetc(fp)\\n if r = char(10)\\n flag = 1\\n numline = numline + 1\\n else\\n flag = 0\\n str = str + r\\n ok\\n if flag = 1\\n if left(str,len(funct)) = funct\\n see '\\\"' + funct + '\\\"' +\\\" is in the line: \\\" + numline + nl\\n ok\\n str = \\\"\\\"\\n ok\\nend\\nfclose(fp)\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'mathn'\\nMath.method(:sqrt).source_location\\n# [\\\"/usr/local/lib/ruby2.3/2.3.0/mathn.rb\\\", 119]\\n\\nClass.method(:nesting).source_location\\n# nil, since Class#nesting is native\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"mthd := someClass compiledMethodAt:#nameOfMethod\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"mthd source\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"thisContext method source\\nthisContext lineNumber\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"proc getproc {name} {\\n set name [uplevel 1 [list namespace which -command $name]]\\n set args [info args $name]\\n set args [lmap arg $args { ;# handle default arguments, if it has them!\\n if {[info default $name $arg default]} {\\n list $name $default\\n } else {\\n return -level 0 $arg\\n }\\n }]\\n set body [info body $name]\\n list proc $name $args $body\\n}\\n\\nputs [getproc getproc]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"proc ::getproc name {\\n set name [uplevel 1 [list namespace which -command $name]]\\n set args [info args $name]\\n set args [lmap arg $args { ;# handle default arguments, if it has them!\\n if {[info default $name $arg default]} {\\n list $name $default\\n } else {\\n return -level 0 $arg\\n }\\n }]\\n set body [info body $name]\\n list proc $name $args $body\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"os\\\" for Platform, Process\\nimport \\\"io\\\" for File\\nimport \\\"/.pattern\\\" for Pattern\\n\\nvar getSourceLines = Fn.new {\\n var fileName = Process.allArguments[1]\\n var text = File.read(fileName)\\n var sep = Platform.isWindows ? \\\"\\\\r\\\\n\\\" : \\\"\\\\n\\\"\\n return [fileName, text.split(sep)]\\n}\\n\\nvar res = getSourceLines.call()\\nvar fileName = res[0]\\nvar lines = res[1]\\n// look for getSourceLines function\\nvar funcName = \\\"getSourceLines\\\"\\nvar p = Pattern.new(\\\"+1/s\\\")\\nvar i = 1\\nvar found = 0\\nfor (line in lines) {\\n var t = p.splitAll(line.trim())\\n if (t[0] == \\\"var\\\" && t[1] == funcName && t[2] == \\\"=\\\" && t[3] == \\\"Fn.new\\\") {\\n found = i\\n break\\n }\\n i = i + 1\\n}\\n\\nSystem.print(\\\"File name : %(fileName)\\\")\\nSystem.print(\\\"Function name : %(funcName)\\\")\\nSystem.print(\\\"Line number : %(found > 0 ? found : \\\"Function not found\\\")\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"src:=File(__FILE__).read();\\nprintln(\\\"Src file is \\\\\\\"%s\\\\\\\" and has %d lines\\\".fmt(__FILE__,src.len(1)));\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Reflection-Get-source"}}},{"rowIdx":1572,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Programming Tasks\n- Object oriented\nfrom: http://rosettacode.org/wiki/Reflection/List_methods\nnote: Reflection\n","language":"00-META"},{"code":";Task:\nThe goal is to get the methods of an object, as names, values or both.\n\nSome languages offer [[Respond to an unknown method call|dynamic methods]], which in general can only be inspected if a class' public API includes a way of listing them.\n\n","language":"00-TASK"},{"code":"using System;\nusing System.Reflection;\n\npublic class Rosetta\n{\n public static void Main()\n {\n //Let's get all methods, not just public ones.\n BindingFlags flags = BindingFlags.Instance | BindingFlags.Static\n | BindingFlags.Public | BindingFlags.NonPublic\n | BindingFlags.DeclaredOnly;\n\n foreach (var method in typeof(TestForMethodReflection).GetMethods(flags))\n Console.WriteLine(method);\n }\n\n class TestForMethodReflection\n {\n public void MyPublicMethod() {}\n private void MyPrivateMethod() {}\n\n public static void MyPublicStaticMethod() {}\n private static void MyPrivateStaticMethod() {}\n }\n\n}\n","language":"C-sharp"},{"code":"; Including listing private methods in the clojure.set namespace:\n=> (keys (ns-interns 'clojure.set))\n(union map-invert join select intersection superset? index bubble-max-key subset? rename rename-keys project difference)\n\n; Only public:\n=> (keys (ns-publics 'clojure.set))\n(union map-invert join select intersection superset? index subset? rename rename-keys project difference)\n","language":"Clojure"},{"code":"struct S {\n bool b;\n\n void foo() {}\n private void bar() {}\n}\n\nclass C {\n bool b;\n\n void foo() {}\n private void bar() {}\n}\n\nvoid printMethods(T)() if (is(T == class) || is(T == struct)) {\n import std.stdio;\n import std.traits;\n\n writeln(\"Methods of \", T.stringof, \":\");\n foreach (m; __traits(allMembers, T)) {\n static if (__traits(compiles, (typeof(__traits(getMember, T, m))))) {\n alias typeof(__traits(getMember, T, m)) ti;\n static if (isFunction!ti) {\n writeln(\" \", m);\n }\n }\n }\n}\n\nvoid main() {\n printMethods!S;\n printMethods!C;\n}\n","language":"D"},{"code":"import system'routines;\nimport system'dynamic;\nimport extensions;\n\nclass MyClass\n{\n myMethod1() {}\n\n myMethod2(x) {}\n}\n\npublic program()\n{\n var o := new MyClass();\n\n o.__getClass().__getMessages().forEach::(p)\n {\n console.printLine(\"o.\",p)\n }\n}\n","language":"Elena"},{"code":"USING: io math prettyprint see ;\n\n\"The list of methods contained in the generic word + :\" print\n\\ + methods . nl\n\n\"The list of methods specializing on the fixnum class:\" print\nfixnum methods .\n","language":"Factor"},{"code":"a = new array\nmethods[a]\n","language":"Frink"},{"code":"f = newJava[\"java.io.File\", \".\"]\nmethods[f]\n","language":"Frink"},{"code":"package main\n\nimport (\n\t\"fmt\"\n\t\"image\"\n\t\"reflect\"\n)\n\ntype t int // A type definition\n\n// Some methods on the type\nfunc (r t) Twice() t { return r * 2 }\nfunc (r t) Half() t { return r / 2 }\nfunc (r t) Less(r2 t) bool { return r < r2 }\nfunc (r t) privateMethod() {}\n\nfunc main() {\n\treport(t(0))\n\treport(image.Point{})\n}\n\nfunc report(x interface{}) {\n\tv := reflect.ValueOf(x)\n\tt := reflect.TypeOf(x) // or v.Type()\n\tn := t.NumMethod()\n\tfmt.Printf(\"Type %v has %d exported methods:\\n\", t, n)\n\tconst format = \"%-6s %-46s %s\\n\"\n\tfmt.Printf(format, \"Name\", \"Method expression\", \"Method value\")\n\tfor i := 0; i < n; i++ {\n\t\tfmt.Printf(format,\n\t\t\tt.Method(i).Name,\n\t\t\tt.Method(i).Func.Type(),\n\t\t\tv.Method(i).Type(),\n\t\t)\n\t}\n\tfmt.Println()\n}\n","language":"Go"},{"code":"; lists all built-in and user-defined functions, including those within variables\n(-> (symbols)\n (map eval)\n (filter (comp type-of (= \"func\"))))\n\n; lists only user-defined functions, including those within variables\n(-> (symbols)\n (map eval)\n (filter (comp type-of (= \"func\")))\n (remove about))\n","language":"Go"},{"code":" NB. define a stack class\n coclass 'Stack'\n create =: 3 : 'items =: i. 0'\n push =: 3 : '# items =: items , < y'\n top =: 3 : '> {: items'\n pop =: 3 : ([;._2' a =. top 0; items =: }: items; a;')\n destroy =: codestroy\n cocurrent 'base'\n\n names_Stack_'' NB. all names\ncreate destroy pop push top\n\n 'p' names_Stack_ 3 NB. verbs that start with p\npop push\n\n\n NB. make an object. The dyadic definition of cownew invokes the create verb\n S =: conew~ 'Stack'\n\n names__S'' NB. object specific names\nCOCREATOR items\n\n\n pop__S NB. introspection: get the verbs definition\n3 : 0\n a =. top 0\n items =: }: items\n a\n)\n\n\n NB. get the search path of object S\n copath S\n┌─────┬─┐\n│Stack│z│\n└─────┴─┘\n\n\n names__S 0 NB. get the object specific data\nCOCREATOR items\n","language":"J"},{"code":"import java.lang.reflect.Method;\n\npublic class ListMethods {\n public int examplePublicInstanceMethod(char c, double d) {\n return 42;\n }\n\n private boolean examplePrivateInstanceMethod(String s) {\n return true;\n }\n\n public static void main(String[] args) {\n Class clazz = ListMethods.class;\n\n System.out.println(\"All public methods (including inherited):\");\n for (Method m : clazz.getMethods()) {\n System.out.println(m);\n }\n System.out.println();\n System.out.println(\"All declared methods (excluding inherited):\");\n for (Method m : clazz.getDeclaredMethods()) {\n System.out.println(m);\n }\n }\n}\n","language":"Java"},{"code":"// Sample classes for reflection\nfunction Super(name) {\n this.name = name;\n this.superOwn = function() { return 'super owned'; };\n}\nSuper.prototype = {\n constructor: Super\n className: 'super',\n toString: function() { return \"Super(\" + this.name + \")\"; },\n doSup: function() { return 'did super stuff'; }\n}\n\nfunction Sub() {\n Object.getPrototypeOf(this).constructor.apply(this, arguments);\n this.rest = [].slice.call(arguments, 1);\n this.subOwn = function() { return 'sub owned'; };\n}\nSub.prototype = Object.assign(\n new Super('prototype'),\n {\n constructor: Sub\n className: 'sub',\n toString: function() { return \"Sub(\" + this.name + \")\"; },\n doSub: function() { return 'did sub stuff'; }\n });\n\nObject.defineProperty(Sub.prototype, 'shush', {\n value: function() { return ' non-enumerable'; },\n enumerable: false // the default\n});\n\nvar sup = new Super('sup'),\n sub = new Sub('sub', 0, 'I', 'two');\n\nObject.defineProperty(sub, 'quiet', {\n value: function() { return 'sub owned non-enumerable'; },\n enumerable: false\n});\n\n// get enumerable methods on an object and its ancestors\nfunction get_method_names(obj) {\n var methods = [];\n for (var p in obj) {\n if (typeof obj[p] == 'function') {\n methods.push(p);\n }\n }\n return methods;\n}\n\nget_method_names(sub);\n//[\"subOwn\", \"superOwn\", \"toString\", \"doSub\", \"doSup\"]\n\n// get enumerable properties on an object and its ancestors\nfunction get_property_names(obj) {\n var properties = [];\n for (var p in obj) {\n properties.push(p);\n }\n return properties;\n}\n\n// alternate way to get enumerable method names on an object and its ancestors\nfunction get_method_names(obj) {\n return get_property_names(obj)\n .filter(function(p) {return typeof obj[p] == 'function';});\n}\n\nget_method_names(sub);\n//[\"subOwn\", \"superOwn\", \"toString\", \"doSub\", \"doSup\"]\n\n// get enumerable & non-enumerable method names set directly on an object\nObject.getOwnPropertyNames(sub)\n .filter(function(p) {return typeof sub[p] == 'function';})\n//[\"subOwn\", \"shhh\"]\n\n// get enumerable method names set directly on an object\nObject.keys(sub)\n .filter(function(p) {return typeof sub[p] == 'function';})\n//[\"subOwn\"]\n\n// get enumerable method names & values set directly on an object\nObject.entries(sub)\n .filter(function(p) {return typeof p[1] == 'function';})\n//[[\"subOwn\", function () {...}]]\n","language":"JavaScript"},{"code":"methods(methods)\nmethods(println)\n","language":"Julia"},{"code":"// Version 1.2.31\n\nimport kotlin.reflect.full.functions\n\nopen class MySuperClass {\n fun mySuperClassMethod(){}\n}\n\nopen class MyClass : MySuperClass() {\n fun myPublicMethod(){}\n\n internal fun myInternalMethod(){}\n\n protected fun myProtectedMethod(){}\n\n private fun myPrivateMethod(){}\n}\n\nfun main(args: Array<String>) {\n val c = MyClass::class\n println(\"List of methods declared in ${c.simpleName} and its superclasses:\\n\")\n val fs = c.functions\n for (f in fs) println(\"${f.name}, ${f.visibility}\")\n}\n","language":"Kotlin"},{"code":"-- parent script \"MyClass\"\n\non foo (me)\n put \"foo\"\nend\n\non bar (me)\n put \"bar\"\nend\n","language":"Lingo"},{"code":"obj = script(\"MyClass\").new()\nput obj.handlers()\n-- [#foo, #bar]\n\n-- The returned list contains the object's methods (\"handlers\") as \"symbols\".\n-- Those can be used like this to call the corresponding method:\ncall(#foo, obj)\n-- \"foo\"\n\ncall(#bar, obj)\n-- \"bar\"\n","language":"Lingo"},{"code":"function helloWorld()\n print \"Hello World\"\nend\n\n-- Will list all functions in the given table, but does not recurse into nexted tables\nfunction printFunctions(t)\n local s={}\n local n=0\n for k in pairs(t) do\n n=n+1 s[n]=k\n end\n table.sort(s)\n for k,v in ipairs(s) do\n f = t[v]\n if type(f) == \"function\" then\n print(v)\n end\n end\nend\n\nprintFunctions(_G)\n","language":"Lua"},{"code":"// create a class with methods that will be listed\nclass Methods\n\tdef static method1()\n\t\treturn \"this is a static method. it will not be printed\"\n\tend\n\tdef method2()\n\t\treturn \"this is not a static method\"\n\tend\n\n\tdef operator=(other)\n\t\t// operator methods are listed by both their defined name and\n\t\t// by their internal name, which in this case is isEqual\n\t\treturn true\n\tend\nend\n\n// lists all nanoquery and java native methods\nfor method in dir(new(Methods))\n\tprintln method\nend\n","language":"Nanoquery"},{"code":"type Foo = object\nproc bar(f:Foo) = echo \"bar\"\nvar f:Foo\nf.bar()\n","language":"Nim"},{"code":"import macros, fusion/matching\n{.experimental: \"caseStmtMacros\".}\nmacro listMethods(modulepath:static string, typename): untyped =\n let module = parseStmt(staticRead(modulepath))\n var procs: seq[string]\n for stmt in module:\n case stmt\n of (kind: in {nnkFuncDef,nnkProcDef..nnkIteratorDef}):#any kind of methody thing\n case stmt\n of [\n PostFix[_, @name],#only exported procs\n _,\n _,\n FormalParams[\n _, #return type\n IdentDefs[ #first parameter\n _, #paramname\n (typename | #Foo\n VarTy[typename] | #var Foo\n PtrTy[typename] | #ptr Foo\n RefTy[typename]), #ref Foo\n _],\n .._], #other params\n .._]: procs.add($name)\n result = newLit(procs)\n\n\ntype Bar = object\nproc a*(b: Bar) = discard\nfunc b*(b: Bar, c: int): string = discard\ntemplate c*(b: var Bar, c: float) = discard\niterator d*(b: ptr Bar):int = discard\nmethod e*(b:ref Bar) {.base.} = discard\nproc second_param*(a: int, b: Bar) = discard #will not match\nproc unexported(a: Bar) = discard #will not match\n\n\ntemplate thisfile:string =\n instantiationInfo().filename\necho thisfile.listMethods(Bar)\n\n#works for any module:\n#const lib = \"/path/to/nim/lib/pure/collections/tables.nim\"\necho listMethods(lib,Table[A,B])\n","language":"Nim"},{"code":"#import <Foundation/Foundation.h>\n#import <objc/runtime.h>\n\n@interface Foo : NSObject\n@end\n@implementation Foo\n- (int)bar:(double)x {\n return 42;\n}\n@end\n\nint main() {\n unsigned int methodCount;\n Method *methods = class_copyMethodList([Foo class], &methodCount);\n for (unsigned int i = 0; i < methodCount; i++) {\n Method m = methods[i];\n SEL selector = method_getName(m);\n const char *typeEncoding = method_getTypeEncoding(m);\n NSLog(@\"%@\\t%s\", NSStringFromSelector(selector), typeEncoding);\n }\n free(methods);\n return 0;\n}\n","language":"Objective-C"},{"code":"package Nums;\n\nuse overload ('<=>' => \\&compare);\nsub new { my $self = shift; bless [@_] }\nsub flip { my @a = @_; 1/$a }\nsub double { my @a = @_; 2*$a }\nsub compare { my ($a, $b) = @_; abs($a) <=> abs($b) }\n\nmy $a = Nums->new(42);\nprint \"$_\\n\" for %{ref ($a).\"::\" });\n","language":"Perl"},{"code":"use Class::MOP;\nmy $meta = Class::MOP::Class->initialize( ref $a );\nsay join \"\\n\", $meta->get_all_method_names()\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">enum</span> <span style=\"color: #000000;\">METHODS</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">PROPERTIES</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">all_methods</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">method_visitor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">key</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">object</span> <span style=\"color: #000080;font-style:italic;\">/*data*/</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">/*user_data*/</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">all_methods</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">all_methods</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">key</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">get_all_methods</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">all_methods</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #7060A8;\">traverse_dict</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">method_visitor</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">METHODS</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">all_methods</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">exists</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #008000;\">\"exists\"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #000080;font-style:italic;\">--class X: Xmethods emulates a vtable</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">Xmethods</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">new_dict</span><span style=\"color: #0000FF;\">({{</span><span style=\"color: #008000;\">\"exists\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">exists</span><span style=\"color: #0000FF;\">}})</span>\n\n <span style=\"color: #000080;font-style:italic;\">--class X: destructor</span>\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">destructor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">destroy_dict</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">PROPERTIES</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #000080;font-style:italic;\">--class X: create new instances</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">newX</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">Xproperties</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">new_dict</span><span style=\"color: #0000FF;\">({{</span><span style=\"color: #008000;\">\"x\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #008000;\">\"y\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">}})</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">delete_routine</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">Xmethods</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">Xproperties</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #000000;\">destructor</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">x</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">newX</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"string\"</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">get_all_methods</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"-->\n <span style=\"color: #008080;\">class</span> <span style=\"color: #000000;\">c</span>\n <span style=\"color: #008080;\">private</span> <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">foo</span><span style=\"color: #0000FF;\">();</span>\n <span style=\"color: #008080;\">public</span> <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">bar</span><span style=\"color: #0000FF;\">();</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">class</span>\n\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">builtins</span><span style=\"color: #0000FF;\">\\</span><span style=\"color: #000000;\">structs</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span> <span style=\"color: #7060A8;\">as</span> <span style=\"color: #000000;\">structs</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">f</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">structs</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">get_struct_fields</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">tid</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">flags</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">flags</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">SF_RTN</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">tid</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">ST_INTEGER</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span> <span style=\"color: #000080;font-style:italic;\">-- (sanity check)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s:%s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">structs</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">get_field_flags</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"<?\nclass Foo {\n function bar(int $x) {\n }\n}\n\n$method_names = get_class_methods('Foo');\nforeach ($method_names as $name) {\n echo \"$name\\n\";\n $method_info = new ReflectionMethod('Foo', $name);\n echo $method_info;\n}\n?>\n","language":"PHP"},{"code":"# The Rectangle class\n(class +Rectangle +Shape)\n# dx dy\n\n(dm T (X Y DX DY)\n (super X Y)\n (=: dx DX)\n (=: dy DY) )\n\n(dm area> ()\n (* (: dx) (: dy)) )\n\n(dm perimeter> ()\n (* 2 (+ (: dx) (: dy))) )\n\n(dm draw> ()\n (drawRect (: x) (: y) (: dx) (: dy)) ) # Hypothetical function 'drawRect'\n","language":"PicoLisp"},{"code":": (setq R (new '(+Rectangle) 0 0 30 20))\n-> $177356065126400\n\n: (methods R)\n-> ((draw> . +Rectangle) (perimeter> . +Rectangle) (area> . +Rectangle) (T . +Rectangle) (move> . +Shape))\n","language":"PicoLisp"},{"code":"import inspect\n\n# Sample classes for inspection\nclass Super(object):\n def __init__(self, name):\n self.name = name\n\n def __str__(self):\n return \"Super(%s)\" % (self.name,)\n\n def doSup(self):\n return 'did super stuff'\n\n @classmethod\n def cls(cls):\n return 'cls method (in sup)'\n\n @classmethod\n def supCls(cls):\n return 'Super method'\n\n @staticmethod\n def supStatic():\n return 'static method'\n\nclass Other(object):\n def otherMethod(self):\n return 'other method'\n\nclass Sub(Other, Super):\n def __init__(self, name, *args):\n super(Sub, self).__init__(name);\n self.rest = args;\n self.methods = {}\n\n def __dir__(self):\n return list(set( \\\n sum([dir(base) for base in type(self).__bases__], []) \\\n + type(self).__dict__.keys() \\\n + self.__dict__.keys() \\\n + self.methods.keys() \\\n ))\n\n def __getattr__(self, name):\n if name in self.methods:\n if callable(self.methods[name]) and self.methods[name].__code__.co_argcount > 0:\n if self.methods[name].__code__.co_varnames[0] == 'self':\n return self.methods[name].__get__(self, type(self))\n if self.methods[name].__code__.co_varnames[0] == 'cls':\n return self.methods[name].__get__(type(self), type)\n return self.methods[name]\n raise AttributeError(\"'%s' object has no attribute '%s'\" % (type(self).__name__, name))\n\n def __str__(self):\n return \"Sub(%s)\" % self.name\n\n def doSub():\n return 'did sub stuff'\n\n @classmethod\n def cls(cls):\n return 'cls method (in Sub)'\n\n @classmethod\n def subCls(cls):\n return 'Sub method'\n\n @staticmethod\n def subStatic():\n return 'Sub method'\n\nsup = Super('sup')\nsub = Sub('sub', 0, 'I', 'two')\nsub.methods['incr'] = lambda x: x+1\nsub.methods['strs'] = lambda self, x: str(self) * x\n\n# names\n[method for method in dir(sub) if callable(getattr(sub, method))]\n# instance methods\n[method for method in dir(sub) if callable(getattr(sub, method)) and hasattr(getattr(sub, method), '__self__') and getattr(sub, method).__self__ == sub]\n#['__dir__', '__getattr__', '__init__', '__str__', 'doSub', 'doSup', 'otherMethod', 'strs']\n# class methods\n[method for method in dir(sub) if callable(getattr(sub, method)) and hasattr(getattr(sub, method), '__self__') and getattr(sub, method).__self__ == type(sub)]\n#['__subclasshook__', 'cls', 'subCls', 'supCls']\n# static & free dynamic methods\n[method for method in dir(sub) if callable(getattr(sub, method)) and type(getattr(sub, method)) == type(lambda:nil)]\n#['incr', 'subStatic', 'supStatic']\n\n# names & values; doesn't include wrapped, C-native methods\ninspect.getmembers(sub, predicate=inspect.ismethod)\n# names using inspect\nmap(lambda t: t[0], inspect.getmembers(sub, predicate=inspect.ismethod))\n#['__dir__', '__getattr__', '__init__', '__str__', 'cls', 'doSub', 'doSup', 'otherMethod', 'strs', 'subCls', 'supCls']\n","language":"Python"},{"code":"class Foo {\n method foo ($x) { }\n method bar ($x, $y) { }\n method baz ($x, $y?) { }\n}\n\nmy $object = Foo.new;\n\nfor $object.^methods {\n say join \", \", .name, .arity, .count, .signature.gist\n}\n","language":"Raku"},{"code":"# Project : Reflection/List methods\n\no1 = new test\naList = methods(o1)\nfor x in aList\n cCode = \"o1.\"+x+\"()\"\n eval(cCode)\nnext\nClass Test\nfunc f1\n see \"hello from f1\" + nl\nfunc f2\n see \"hello from f2\" + nl\nfunc f3\n see \"hello from f3\" + nl\nfunc f4\n see \"hello from f4\" + nl\n","language":"Ring"},{"code":"# Sample classes for reflection\nclass Super\n CLASSNAME = 'super'\n\n def initialize(name)\n @name = name\n def self.superOwn\n 'super owned'\n end\n end\n\n def to_s\n \"Super(#{@name})\"\n end\n\n def doSup\n 'did super stuff'\n end\n\n def self.superClassStuff\n 'did super class stuff'\n end\n\n protected\n def protSup\n \"Super's protected\"\n end\n\n private\n def privSup\n \"Super's private\"\n end\nend\n\nmodule Other\n def otherStuff\n 'did other stuff'\n end\nend\n\nclass Sub < Super\n CLASSNAME = 'sub'\n attr_reader :dynamic\n\n include Other\n\n def initialize(name, *args)\n super(name)\n @rest = args;\n @dynamic = {}\n def self.subOwn\n 'sub owned'\n end\n end\n\n def methods(regular=true)\n super + @dynamic.keys\n end\n\n def method_missing(name, *args, &block)\n return super unless @dynamic.member?(name)\n method = @dynamic[name]\n if method.arity > 0\n if method.parameters[0][1] == :self\n args.unshift(self)\n end\n if method.lambda?\n # procs (hence methods) set missing arguments to `nil`, lambdas don't, so extend args explicitly\n args += args + [nil] * [method.arity - args.length, 0].max\n # procs (hence methods) discard extra arguments, lambdas don't, so discard arguments explicitly (unless lambda is variadic)\n if method.parameters[-1][0] != :rest\n args = args[0,method.arity]\n end\n end\n method.call(*args)\n else\n method.call\n end\n end\n\n def public_methods(all=true)\n super + @dynamic.keys\n end\n\n def respond_to?(symbol, include_all=false)\n @dynamic.member?(symbol) || super\n end\n\n def to_s\n \"Sub(#{@name})\"\n end\n\n def doSub\n 'did sub stuff'\n end\n\n def self.subClassStuff\n 'did sub class stuff'\n end\n\n protected\n def protSub\n \"Sub's protected\"\n end\n\n private\n def privSub\n \"Sub's private\"\n end\nend\n\nsup = Super.new('sup')\nsub = Sub.new('sub', 0, 'I', 'two')\nsub.dynamic[:incr] = proc {|i| i+1}\n\np sub.public_methods(false)\n#=> [:superOwn, :subOwn, :respond_to?, :method_missing, :to_s, :methods, :public_methods, :dynamic, :doSub, :incr]\n\np sub.methods - Object.methods\n#=> [:superOwn, :subOwn, :method_missing, :dynamic, :doSub, :protSub, :otherStuff, :doSup, :protSup, :incr]\n\np sub.public_methods - Object.public_methods\n#=> [:superOwn, :subOwn, :method_missing, :dynamic, :doSub, :otherStuff, :doSup, :incr]\n\np sub.methods - sup.methods\n#=> [:subOwn, :method_missing, :dynamic, :doSub, :protSub, :otherStuff, :incr]\n\n# singleton/eigenclass methods\np sub.methods(false)\n#=> [:superOwn, :subOwn, :incr]\np sub.singleton_methods\n#=> [:superOwn, :subOwn]\n","language":"Ruby"},{"code":"object ListMethods extends App {\n\n private val obj = new {\n def examplePublicInstanceMethod(c: Char, d: Double) = 42\n\n private def examplePrivateInstanceMethod(s: String) = true\n }\n private val clazz = obj.getClass\n\n println(\"All public methods (including inherited):\")\n clazz.getMethods.foreach(m => println(s\"${m}\"))\n\n println(\"\\nAll declared fields (excluding inherited):\")\n clazz.getDeclaredMethods.foreach(m => println(s\"${m}}\"))\n\n}\n","language":"Scala"},{"code":"class Example {\n method foo { }\n method bar(arg) { say \"bar(#{arg})\" }\n}\n\nvar obj = Example()\nsay obj.methods.keys.sort #=> [\"bar\", \"call\", \"foo\", \"new\"]\n\nvar meth = obj.methods.item(:bar) # `LazyMethod` representation for `obj.bar()`\nmeth(123) # calls obj.bar()\n","language":"Sidef"},{"code":"% info object methods ::oo::class -all -private\n<cloned> create createWithNamespace destroy eval new unknown variable varname\n","language":"Tcl"},{"code":"#! instance_methods(m, n, o)\n#! instance_properties(p, q, r)\nclass C {\n construct new() {}\n\n m() {}\n\n n() {}\n\n o() {}\n\n p {}\n\n q {}\n\n r {}\n}\n\nvar c = C.new() // create an object of type C\nSystem.print(\"List of instance methods available for object 'c':\")\nfor (method in c.type.attributes.self[\"instance_methods\"]) System.print(method.key)\n","language":"Wren"},{"code":"methods:=List.methods;\nmethods.println();\nList.method(methods[0]).println(); // == .Method(name) == .BaseClass(name)\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Programming Tasks\\n- Object oriented\\nfrom: http://rosettacode.org/wiki/Reflection/List_methods\\nnote: Reflection\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nThe goal is to get the methods of an object, as names, values or both.\\n\\nSome languages offer [[Respond to an unknown method call|dynamic methods]], which in general can only be inspected if a class' public API includes a way of listing them.\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"using System;\\nusing System.Reflection;\\n\\npublic class Rosetta\\n{\\n public static void Main()\\n {\\n //Let's get all methods, not just public ones.\\n BindingFlags flags = BindingFlags.Instance | BindingFlags.Static\\n | BindingFlags.Public | BindingFlags.NonPublic\\n | BindingFlags.DeclaredOnly;\\n\\n foreach (var method in typeof(TestForMethodReflection).GetMethods(flags))\\n Console.WriteLine(method);\\n }\\n\\n class TestForMethodReflection\\n {\\n public void MyPublicMethod() {}\\n private void MyPrivateMethod() {}\\n\\n public static void MyPublicStaticMethod() {}\\n private static void MyPrivateStaticMethod() {}\\n }\\n\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"; Including listing private methods in the clojure.set namespace:\\n=> (keys (ns-interns 'clojure.set))\\n(union map-invert join select intersection superset? index bubble-max-key subset? rename rename-keys project difference)\\n\\n; Only public:\\n=> (keys (ns-publics 'clojure.set))\\n(union map-invert join select intersection superset? index subset? rename rename-keys project difference)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"struct S {\\n bool b;\\n\\n void foo() {}\\n private void bar() {}\\n}\\n\\nclass C {\\n bool b;\\n\\n void foo() {}\\n private void bar() {}\\n}\\n\\nvoid printMethods(T)() if (is(T == class) || is(T == struct)) {\\n import std.stdio;\\n import std.traits;\\n\\n writeln(\\\"Methods of \\\", T.stringof, \\\":\\\");\\n foreach (m; __traits(allMembers, T)) {\\n static if (__traits(compiles, (typeof(__traits(getMember, T, m))))) {\\n alias typeof(__traits(getMember, T, m)) ti;\\n static if (isFunction!ti) {\\n writeln(\\\" \\\", m);\\n }\\n }\\n }\\n}\\n\\nvoid main() {\\n printMethods!S;\\n printMethods!C;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import system'routines;\\nimport system'dynamic;\\nimport extensions;\\n\\nclass MyClass\\n{\\n myMethod1() {}\\n\\n myMethod2(x) {}\\n}\\n\\npublic program()\\n{\\n var o := new MyClass();\\n\\n o.__getClass().__getMessages().forEach::(p)\\n {\\n console.printLine(\\\"o.\\\",p)\\n }\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"USING: io math prettyprint see ;\\n\\n\\\"The list of methods contained in the generic word + :\\\" print\\n\\\\ + methods . nl\\n\\n\\\"The list of methods specializing on the fixnum class:\\\" print\\nfixnum methods .\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"a = new array\\nmethods[a]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"f = newJava[\\\"java.io.File\\\", \\\".\\\"]\\nmethods[f]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"fmt\\\"\\n\\t\\\"image\\\"\\n\\t\\\"reflect\\\"\\n)\\n\\ntype t int // A type definition\\n\\n// Some methods on the type\\nfunc (r t) Twice() t { return r * 2 }\\nfunc (r t) Half() t { return r / 2 }\\nfunc (r t) Less(r2 t) bool { return r < r2 }\\nfunc (r t) privateMethod() {}\\n\\nfunc main() {\\n\\treport(t(0))\\n\\treport(image.Point{})\\n}\\n\\nfunc report(x interface{}) {\\n\\tv := reflect.ValueOf(x)\\n\\tt := reflect.TypeOf(x) // or v.Type()\\n\\tn := t.NumMethod()\\n\\tfmt.Printf(\\\"Type %v has %d exported methods:\\\\n\\\", t, n)\\n\\tconst format = \\\"%-6s %-46s %s\\\\n\\\"\\n\\tfmt.Printf(format, \\\"Name\\\", \\\"Method expression\\\", \\\"Method value\\\")\\n\\tfor i := 0; i < n; i++ {\\n\\t\\tfmt.Printf(format,\\n\\t\\t\\tt.Method(i).Name,\\n\\t\\t\\tt.Method(i).Func.Type(),\\n\\t\\t\\tv.Method(i).Type(),\\n\\t\\t)\\n\\t}\\n\\tfmt.Println()\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"; lists all built-in and user-defined functions, including those within variables\\n(-> (symbols)\\n (map eval)\\n (filter (comp type-of (= \\\"func\\\"))))\\n\\n; lists only user-defined functions, including those within variables\\n(-> (symbols)\\n (map eval)\\n (filter (comp type-of (= \\\"func\\\")))\\n (remove about))\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \" NB. define a stack class\\n coclass 'Stack'\\n create =: 3 : 'items =: i. 0'\\n push =: 3 : '# items =: items , < y'\\n top =: 3 : '> {: items'\\n pop =: 3 : ([;._2' a =. top 0; items =: }: items; a;')\\n destroy =: codestroy\\n cocurrent 'base'\\n\\n names_Stack_'' NB. all names\\ncreate destroy pop push top\\n\\n 'p' names_Stack_ 3 NB. verbs that start with p\\npop push\\n\\n\\n NB. make an object. The dyadic definition of cownew invokes the create verb\\n S =: conew~ 'Stack'\\n\\n names__S'' NB. object specific names\\nCOCREATOR items\\n\\n\\n pop__S NB. introspection: get the verbs definition\\n3 : 0\\n a =. top 0\\n items =: }: items\\n a\\n)\\n\\n\\n NB. get the search path of object S\\n copath S\\n┌─────┬─┐\\n│Stack│z│\\n└─────┴─┘\\n\\n\\n names__S 0 NB. get the object specific data\\nCOCREATOR items\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.lang.reflect.Method;\\n\\npublic class ListMethods {\\n public int examplePublicInstanceMethod(char c, double d) {\\n return 42;\\n }\\n\\n private boolean examplePrivateInstanceMethod(String s) {\\n return true;\\n }\\n\\n public static void main(String[] args) {\\n Class clazz = ListMethods.class;\\n\\n System.out.println(\\\"All public methods (including inherited):\\\");\\n for (Method m : clazz.getMethods()) {\\n System.out.println(m);\\n }\\n System.out.println();\\n System.out.println(\\\"All declared methods (excluding inherited):\\\");\\n for (Method m : clazz.getDeclaredMethods()) {\\n System.out.println(m);\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"// Sample classes for reflection\\nfunction Super(name) {\\n this.name = name;\\n this.superOwn = function() { return 'super owned'; };\\n}\\nSuper.prototype = {\\n constructor: Super\\n className: 'super',\\n toString: function() { return \\\"Super(\\\" + this.name + \\\")\\\"; },\\n doSup: function() { return 'did super stuff'; }\\n}\\n\\nfunction Sub() {\\n Object.getPrototypeOf(this).constructor.apply(this, arguments);\\n this.rest = [].slice.call(arguments, 1);\\n this.subOwn = function() { return 'sub owned'; };\\n}\\nSub.prototype = Object.assign(\\n new Super('prototype'),\\n {\\n constructor: Sub\\n className: 'sub',\\n toString: function() { return \\\"Sub(\\\" + this.name + \\\")\\\"; },\\n doSub: function() { return 'did sub stuff'; }\\n });\\n\\nObject.defineProperty(Sub.prototype, 'shush', {\\n value: function() { return ' non-enumerable'; },\\n enumerable: false // the default\\n});\\n\\nvar sup = new Super('sup'),\\n sub = new Sub('sub', 0, 'I', 'two');\\n\\nObject.defineProperty(sub, 'quiet', {\\n value: function() { return 'sub owned non-enumerable'; },\\n enumerable: false\\n});\\n\\n// get enumerable methods on an object and its ancestors\\nfunction get_method_names(obj) {\\n var methods = [];\\n for (var p in obj) {\\n if (typeof obj[p] == 'function') {\\n methods.push(p);\\n }\\n }\\n return methods;\\n}\\n\\nget_method_names(sub);\\n//[\\\"subOwn\\\", \\\"superOwn\\\", \\\"toString\\\", \\\"doSub\\\", \\\"doSup\\\"]\\n\\n// get enumerable properties on an object and its ancestors\\nfunction get_property_names(obj) {\\n var properties = [];\\n for (var p in obj) {\\n properties.push(p);\\n }\\n return properties;\\n}\\n\\n// alternate way to get enumerable method names on an object and its ancestors\\nfunction get_method_names(obj) {\\n return get_property_names(obj)\\n .filter(function(p) {return typeof obj[p] == 'function';});\\n}\\n\\nget_method_names(sub);\\n//[\\\"subOwn\\\", \\\"superOwn\\\", \\\"toString\\\", \\\"doSub\\\", \\\"doSup\\\"]\\n\\n// get enumerable & non-enumerable method names set directly on an object\\nObject.getOwnPropertyNames(sub)\\n .filter(function(p) {return typeof sub[p] == 'function';})\\n//[\\\"subOwn\\\", \\\"shhh\\\"]\\n\\n// get enumerable method names set directly on an object\\nObject.keys(sub)\\n .filter(function(p) {return typeof sub[p] == 'function';})\\n//[\\\"subOwn\\\"]\\n\\n// get enumerable method names & values set directly on an object\\nObject.entries(sub)\\n .filter(function(p) {return typeof p[1] == 'function';})\\n//[[\\\"subOwn\\\", function () {...}]]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"methods(methods)\\nmethods(println)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// Version 1.2.31\\n\\nimport kotlin.reflect.full.functions\\n\\nopen class MySuperClass {\\n fun mySuperClassMethod(){}\\n}\\n\\nopen class MyClass : MySuperClass() {\\n fun myPublicMethod(){}\\n\\n internal fun myInternalMethod(){}\\n\\n protected fun myProtectedMethod(){}\\n\\n private fun myPrivateMethod(){}\\n}\\n\\nfun main(args: Array<String>) {\\n val c = MyClass::class\\n println(\\\"List of methods declared in ${c.simpleName} and its superclasses:\\\\n\\\")\\n val fs = c.functions\\n for (f in fs) println(\\\"${f.name}, ${f.visibility}\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"-- parent script \\\"MyClass\\\"\\n\\non foo (me)\\n put \\\"foo\\\"\\nend\\n\\non bar (me)\\n put \\\"bar\\\"\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"obj = script(\\\"MyClass\\\").new()\\nput obj.handlers()\\n-- [#foo, #bar]\\n\\n-- The returned list contains the object's methods (\\\"handlers\\\") as \\\"symbols\\\".\\n-- Those can be used like this to call the corresponding method:\\ncall(#foo, obj)\\n-- \\\"foo\\\"\\n\\ncall(#bar, obj)\\n-- \\\"bar\\\"\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"function helloWorld()\\n print \\\"Hello World\\\"\\nend\\n\\n-- Will list all functions in the given table, but does not recurse into nexted tables\\nfunction printFunctions(t)\\n local s={}\\n local n=0\\n for k in pairs(t) do\\n n=n+1 s[n]=k\\n end\\n table.sort(s)\\n for k,v in ipairs(s) do\\n f = t[v]\\n if type(f) == \\\"function\\\" then\\n print(v)\\n end\\n end\\nend\\n\\nprintFunctions(_G)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"// create a class with methods that will be listed\\nclass Methods\\n\\tdef static method1()\\n\\t\\treturn \\\"this is a static method. it will not be printed\\\"\\n\\tend\\n\\tdef method2()\\n\\t\\treturn \\\"this is not a static method\\\"\\n\\tend\\n\\n\\tdef operator=(other)\\n\\t\\t// operator methods are listed by both their defined name and\\n\\t\\t// by their internal name, which in this case is isEqual\\n\\t\\treturn true\\n\\tend\\nend\\n\\n// lists all nanoquery and java native methods\\nfor method in dir(new(Methods))\\n\\tprintln method\\nend\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"type Foo = object\\nproc bar(f:Foo) = echo \\\"bar\\\"\\nvar f:Foo\\nf.bar()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"import macros, fusion/matching\\n{.experimental: \\\"caseStmtMacros\\\".}\\nmacro listMethods(modulepath:static string, typename): untyped =\\n let module = parseStmt(staticRead(modulepath))\\n var procs: seq[string]\\n for stmt in module:\\n case stmt\\n of (kind: in {nnkFuncDef,nnkProcDef..nnkIteratorDef}):#any kind of methody thing\\n case stmt\\n of [\\n PostFix[_, @name],#only exported procs\\n _,\\n _,\\n FormalParams[\\n _, #return type\\n IdentDefs[ #first parameter\\n _, #paramname\\n (typename | #Foo\\n VarTy[typename] | #var Foo\\n PtrTy[typename] | #ptr Foo\\n RefTy[typename]), #ref Foo\\n _],\\n .._], #other params\\n .._]: procs.add($name)\\n result = newLit(procs)\\n\\n\\ntype Bar = object\\nproc a*(b: Bar) = discard\\nfunc b*(b: Bar, c: int): string = discard\\ntemplate c*(b: var Bar, c: float) = discard\\niterator d*(b: ptr Bar):int = discard\\nmethod e*(b:ref Bar) {.base.} = discard\\nproc second_param*(a: int, b: Bar) = discard #will not match\\nproc unexported(a: Bar) = discard #will not match\\n\\n\\ntemplate thisfile:string =\\n instantiationInfo().filename\\necho thisfile.listMethods(Bar)\\n\\n#works for any module:\\n#const lib = \\\"/path/to/nim/lib/pure/collections/tables.nim\\\"\\necho listMethods(lib,Table[A,B])\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#import <Foundation/Foundation.h>\\n#import <objc/runtime.h>\\n\\n@interface Foo : NSObject\\n@end\\n@implementation Foo\\n- (int)bar:(double)x {\\n return 42;\\n}\\n@end\\n\\nint main() {\\n unsigned int methodCount;\\n Method *methods = class_copyMethodList([Foo class], &methodCount);\\n for (unsigned int i = 0; i < methodCount; i++) {\\n Method m = methods[i];\\n SEL selector = method_getName(m);\\n const char *typeEncoding = method_getTypeEncoding(m);\\n NSLog(@\\\"%@\\\\t%s\\\", NSStringFromSelector(selector), typeEncoding);\\n }\\n free(methods);\\n return 0;\\n}\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"package Nums;\\n\\nuse overload ('<=>' => \\\\&compare);\\nsub new { my $self = shift; bless [@_] }\\nsub flip { my @a = @_; 1/$a }\\nsub double { my @a = @_; 2*$a }\\nsub compare { my ($a, $b) = @_; abs($a) <=> abs($b) }\\n\\nmy $a = Nums->new(42);\\nprint \\\"$_\\\\n\\\" for %{ref ($a).\\\"::\\\" });\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use Class::MOP;\\nmy $meta = Class::MOP::Class->initialize( ref $a );\\nsay join \\\"\\\\n\\\", $meta->get_all_method_names()\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">enum</span> <span style=\\\"color: #000000;\\\">METHODS</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">PROPERTIES</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">all_methods</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">method_visitor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">key</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*data*/</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*user_data*/</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">all_methods</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">all_methods</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">key</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">get_all_methods</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">all_methods</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #7060A8;\\\">traverse_dict</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">method_visitor</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">METHODS</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">all_methods</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">exists</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008000;\\\">\\\"exists\\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">--class X: Xmethods emulates a vtable</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">Xmethods</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">new_dict</span><span style=\\\"color: #0000FF;\\\">({{</span><span style=\\\"color: #008000;\\\">\\\"exists\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">exists</span><span style=\\\"color: #0000FF;\\\">}})</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">--class X: destructor</span>\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">destructor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">destroy_dict</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">PROPERTIES</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">--class X: create new instances</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">newX</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">Xproperties</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">new_dict</span><span style=\\\"color: #0000FF;\\\">({{</span><span style=\\\"color: #008000;\\\">\\\"x\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #008000;\\\">\\\"y\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">}})</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">delete_routine</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">Xmethods</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">Xproperties</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #000000;\\\">destructor</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">newX</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"string\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">get_all_methods</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">class</span> <span style=\\\"color: #000000;\\\">c</span>\\n <span style=\\\"color: #008080;\\\">private</span> <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">foo</span><span style=\\\"color: #0000FF;\\\">();</span>\\n <span style=\\\"color: #008080;\\\">public</span> <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">bar</span><span style=\\\"color: #0000FF;\\\">();</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">class</span>\\n\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">builtins</span><span style=\\\"color: #0000FF;\\\">\\\\</span><span style=\\\"color: #000000;\\\">structs</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span> <span style=\\\"color: #7060A8;\\\">as</span> <span style=\\\"color: #000000;\\\">structs</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">f</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">structs</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">get_struct_fields</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">tid</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">flags</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">flags</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">SF_RTN</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">tid</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">ST_INTEGER</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (sanity check)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s:%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">structs</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">get_field_flags</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?\\nclass Foo {\\n function bar(int $x) {\\n }\\n}\\n\\n$method_names = get_class_methods('Foo');\\nforeach ($method_names as $name) {\\n echo \\\"$name\\\\n\\\";\\n $method_info = new ReflectionMethod('Foo', $name);\\n echo $method_info;\\n}\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"# The Rectangle class\\n(class +Rectangle +Shape)\\n# dx dy\\n\\n(dm T (X Y DX DY)\\n (super X Y)\\n (=: dx DX)\\n (=: dy DY) )\\n\\n(dm area> ()\\n (* (: dx) (: dy)) )\\n\\n(dm perimeter> ()\\n (* 2 (+ (: dx) (: dy))) )\\n\\n(dm draw> ()\\n (drawRect (: x) (: y) (: dx) (: dy)) ) # Hypothetical function 'drawRect'\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \": (setq R (new '(+Rectangle) 0 0 30 20))\\n-> $177356065126400\\n\\n: (methods R)\\n-> ((draw> . +Rectangle) (perimeter> . +Rectangle) (area> . +Rectangle) (T . +Rectangle) (move> . +Shape))\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"import inspect\\n\\n# Sample classes for inspection\\nclass Super(object):\\n def __init__(self, name):\\n self.name = name\\n\\n def __str__(self):\\n return \\\"Super(%s)\\\" % (self.name,)\\n\\n def doSup(self):\\n return 'did super stuff'\\n\\n @classmethod\\n def cls(cls):\\n return 'cls method (in sup)'\\n\\n @classmethod\\n def supCls(cls):\\n return 'Super method'\\n\\n @staticmethod\\n def supStatic():\\n return 'static method'\\n\\nclass Other(object):\\n def otherMethod(self):\\n return 'other method'\\n\\nclass Sub(Other, Super):\\n def __init__(self, name, *args):\\n super(Sub, self).__init__(name);\\n self.rest = args;\\n self.methods = {}\\n\\n def __dir__(self):\\n return list(set( \\\\\\n sum([dir(base) for base in type(self).__bases__], []) \\\\\\n + type(self).__dict__.keys() \\\\\\n + self.__dict__.keys() \\\\\\n + self.methods.keys() \\\\\\n ))\\n\\n def __getattr__(self, name):\\n if name in self.methods:\\n if callable(self.methods[name]) and self.methods[name].__code__.co_argcount > 0:\\n if self.methods[name].__code__.co_varnames[0] == 'self':\\n return self.methods[name].__get__(self, type(self))\\n if self.methods[name].__code__.co_varnames[0] == 'cls':\\n return self.methods[name].__get__(type(self), type)\\n return self.methods[name]\\n raise AttributeError(\\\"'%s' object has no attribute '%s'\\\" % (type(self).__name__, name))\\n\\n def __str__(self):\\n return \\\"Sub(%s)\\\" % self.name\\n\\n def doSub():\\n return 'did sub stuff'\\n\\n @classmethod\\n def cls(cls):\\n return 'cls method (in Sub)'\\n\\n @classmethod\\n def subCls(cls):\\n return 'Sub method'\\n\\n @staticmethod\\n def subStatic():\\n return 'Sub method'\\n\\nsup = Super('sup')\\nsub = Sub('sub', 0, 'I', 'two')\\nsub.methods['incr'] = lambda x: x+1\\nsub.methods['strs'] = lambda self, x: str(self) * x\\n\\n# names\\n[method for method in dir(sub) if callable(getattr(sub, method))]\\n# instance methods\\n[method for method in dir(sub) if callable(getattr(sub, method)) and hasattr(getattr(sub, method), '__self__') and getattr(sub, method).__self__ == sub]\\n#['__dir__', '__getattr__', '__init__', '__str__', 'doSub', 'doSup', 'otherMethod', 'strs']\\n# class methods\\n[method for method in dir(sub) if callable(getattr(sub, method)) and hasattr(getattr(sub, method), '__self__') and getattr(sub, method).__self__ == type(sub)]\\n#['__subclasshook__', 'cls', 'subCls', 'supCls']\\n# static & free dynamic methods\\n[method for method in dir(sub) if callable(getattr(sub, method)) and type(getattr(sub, method)) == type(lambda:nil)]\\n#['incr', 'subStatic', 'supStatic']\\n\\n# names & values; doesn't include wrapped, C-native methods\\ninspect.getmembers(sub, predicate=inspect.ismethod)\\n# names using inspect\\nmap(lambda t: t[0], inspect.getmembers(sub, predicate=inspect.ismethod))\\n#['__dir__', '__getattr__', '__init__', '__str__', 'cls', 'doSub', 'doSup', 'otherMethod', 'strs', 'subCls', 'supCls']\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"class Foo {\\n method foo ($x) { }\\n method bar ($x, $y) { }\\n method baz ($x, $y?) { }\\n}\\n\\nmy $object = Foo.new;\\n\\nfor $object.^methods {\\n say join \\\", \\\", .name, .arity, .count, .signature.gist\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"# Project : Reflection/List methods\\n\\no1 = new test\\naList = methods(o1)\\nfor x in aList\\n cCode = \\\"o1.\\\"+x+\\\"()\\\"\\n eval(cCode)\\nnext\\nClass Test\\nfunc f1\\n see \\\"hello from f1\\\" + nl\\nfunc f2\\n see \\\"hello from f2\\\" + nl\\nfunc f3\\n see \\\"hello from f3\\\" + nl\\nfunc f4\\n see \\\"hello from f4\\\" + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"# Sample classes for reflection\\nclass Super\\n CLASSNAME = 'super'\\n\\n def initialize(name)\\n @name = name\\n def self.superOwn\\n 'super owned'\\n end\\n end\\n\\n def to_s\\n \\\"Super(#{@name})\\\"\\n end\\n\\n def doSup\\n 'did super stuff'\\n end\\n\\n def self.superClassStuff\\n 'did super class stuff'\\n end\\n\\n protected\\n def protSup\\n \\\"Super's protected\\\"\\n end\\n\\n private\\n def privSup\\n \\\"Super's private\\\"\\n end\\nend\\n\\nmodule Other\\n def otherStuff\\n 'did other stuff'\\n end\\nend\\n\\nclass Sub < Super\\n CLASSNAME = 'sub'\\n attr_reader :dynamic\\n\\n include Other\\n\\n def initialize(name, *args)\\n super(name)\\n @rest = args;\\n @dynamic = {}\\n def self.subOwn\\n 'sub owned'\\n end\\n end\\n\\n def methods(regular=true)\\n super + @dynamic.keys\\n end\\n\\n def method_missing(name, *args, &block)\\n return super unless @dynamic.member?(name)\\n method = @dynamic[name]\\n if method.arity > 0\\n if method.parameters[0][1] == :self\\n args.unshift(self)\\n end\\n if method.lambda?\\n # procs (hence methods) set missing arguments to `nil`, lambdas don't, so extend args explicitly\\n args += args + [nil] * [method.arity - args.length, 0].max\\n # procs (hence methods) discard extra arguments, lambdas don't, so discard arguments explicitly (unless lambda is variadic)\\n if method.parameters[-1][0] != :rest\\n args = args[0,method.arity]\\n end\\n end\\n method.call(*args)\\n else\\n method.call\\n end\\n end\\n\\n def public_methods(all=true)\\n super + @dynamic.keys\\n end\\n\\n def respond_to?(symbol, include_all=false)\\n @dynamic.member?(symbol) || super\\n end\\n\\n def to_s\\n \\\"Sub(#{@name})\\\"\\n end\\n\\n def doSub\\n 'did sub stuff'\\n end\\n\\n def self.subClassStuff\\n 'did sub class stuff'\\n end\\n\\n protected\\n def protSub\\n \\\"Sub's protected\\\"\\n end\\n\\n private\\n def privSub\\n \\\"Sub's private\\\"\\n end\\nend\\n\\nsup = Super.new('sup')\\nsub = Sub.new('sub', 0, 'I', 'two')\\nsub.dynamic[:incr] = proc {|i| i+1}\\n\\np sub.public_methods(false)\\n#=> [:superOwn, :subOwn, :respond_to?, :method_missing, :to_s, :methods, :public_methods, :dynamic, :doSub, :incr]\\n\\np sub.methods - Object.methods\\n#=> [:superOwn, :subOwn, :method_missing, :dynamic, :doSub, :protSub, :otherStuff, :doSup, :protSup, :incr]\\n\\np sub.public_methods - Object.public_methods\\n#=> [:superOwn, :subOwn, :method_missing, :dynamic, :doSub, :otherStuff, :doSup, :incr]\\n\\np sub.methods - sup.methods\\n#=> [:subOwn, :method_missing, :dynamic, :doSub, :protSub, :otherStuff, :incr]\\n\\n# singleton/eigenclass methods\\np sub.methods(false)\\n#=> [:superOwn, :subOwn, :incr]\\np sub.singleton_methods\\n#=> [:superOwn, :subOwn]\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"object ListMethods extends App {\\n\\n private val obj = new {\\n def examplePublicInstanceMethod(c: Char, d: Double) = 42\\n\\n private def examplePrivateInstanceMethod(s: String) = true\\n }\\n private val clazz = obj.getClass\\n\\n println(\\\"All public methods (including inherited):\\\")\\n clazz.getMethods.foreach(m => println(s\\\"${m}\\\"))\\n\\n println(\\\"\\\\nAll declared fields (excluding inherited):\\\")\\n clazz.getDeclaredMethods.foreach(m => println(s\\\"${m}}\\\"))\\n\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"class Example {\\n method foo { }\\n method bar(arg) { say \\\"bar(#{arg})\\\" }\\n}\\n\\nvar obj = Example()\\nsay obj.methods.keys.sort #=> [\\\"bar\\\", \\\"call\\\", \\\"foo\\\", \\\"new\\\"]\\n\\nvar meth = obj.methods.item(:bar) # `LazyMethod` representation for `obj.bar()`\\nmeth(123) # calls obj.bar()\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"% info object methods ::oo::class -all -private\\n<cloned> create createWithNamespace destroy eval new unknown variable varname\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#! instance_methods(m, n, o)\\n#! instance_properties(p, q, r)\\nclass C {\\n construct new() {}\\n\\n m() {}\\n\\n n() {}\\n\\n o() {}\\n\\n p {}\\n\\n q {}\\n\\n r {}\\n}\\n\\nvar c = C.new() // create an object of type C\\nSystem.print(\\\"List of instance methods available for object 'c':\\\")\\nfor (method in c.type.attributes.self[\\\"instance_methods\\\"]) System.print(method.key)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"methods:=List.methods;\\nmethods.println();\\nList.method(methods[0]).println(); // == .Method(name) == .BaseClass(name)\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Reflection-List-methods"}}},{"rowIdx":1573,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Programming Tasks\n- Object oriented\nfrom: http://rosettacode.org/wiki/Reflection/List_properties\nnote: Reflection\n","language":"00-META"},{"code":";Task:\nThe goal is to get the properties of an object, as names, values or both.\n\nSome languages support dynamic properties, which in general can only be inspected if a class' public API includes a way of listing them.\n\n","language":"00-TASK"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Reflection;\n\npublic static class Reflection\n{\n public static void Main() {\n var t = new TestClass();\n var flags = BindingFlags.Public | BindingFlags.NonPublic | BindingFlags.Instance;\n foreach (var prop in GetPropertyValues(t, flags)) {\n Console.WriteLine(prop);\n }\n foreach (var field in GetFieldValues(t, flags)) {\n Console.WriteLine(field);\n }\n }\n\n public static IEnumerable<(string name, object value)> GetPropertyValues<T>(T obj, BindingFlags flags) =>\n from p in typeof(T).GetProperties(flags)\n where p.GetIndexParameters().Length == 0 //To filter out indexers\n select (p.Name, p.GetValue(obj, null));\n\n public static IEnumerable<(string name, object value)> GetFieldValues<T>(T obj, BindingFlags flags) =>\n typeof(T).GetFields(flags).Select(f => (f.Name, f.GetValue(obj)));\n\n class TestClass\n {\n private int privateField = 7;\n public int PublicNumber { get; } = 4;\n private int PrivateNumber { get; } = 2;\n }\n\n}\n","language":"C-sharp"},{"code":"import std.stdio;\n\nstruct S {\n bool b;\n\n void foo() {}\n private void bar() {}\n}\n\nclass C {\n bool b;\n\n void foo() {}\n private void bar() {}\n}\n\nvoid printProperties(T)() if (is(T == class) || is(T == struct)) {\n import std.stdio;\n import std.traits;\n\n writeln(\"Properties of \", T.stringof, ':');\n foreach (m; __traits(allMembers, T)) {\n static if (__traits(compiles, (typeof(__traits(getMember, T, m))))) {\n alias typeof(__traits(getMember, T, m)) ti;\n static if (!isFunction!ti) {\n writeln(\" \", m);\n }\n }\n }\n}\n\nvoid main() {\n printProperties!S;\n printProperties!C;\n}\n","language":"D"},{"code":"import system'routines;\nimport system'dynamic;\nimport extensions;\n\nclass MyClass\n{\n int X : prop;\n string Y : prop;\n}\n\npublic program()\n{\n var o := new MyClass\n {\n this X := 2;\n\n this Y := \"String\";\n };\n\n MyClass.__getProperties().forEach::(p)\n {\n console.printLine(\"o.\",p,\"=\",p.getPropertyValue(o))\n }\n}\n","language":"Elena"},{"code":"USING: assocs kernel math mirrors prettyprint strings ;\n\nTUPLE: foo\n{ bar string }\n{ baz string initial: \"hi\" }\n{ baxx integer initial: 50 read-only } ;\nC: <foo> foo\n\n\"apple\" \"banana\" 200 <foo> <mirror>\n[ >alist ] [ object-slots ] bi [ . ] bi@\n","language":"Factor"},{"code":"package main\n\nimport (\n\t\"fmt\"\n\t\"image\"\n\t\"reflect\"\n)\n\n// A type definition\ntype t struct {\n\tX int\n\tnext *t\n}\n\nfunc main() {\n\treport(t{})\n\treport(image.Point{})\n}\n\nfunc report(x interface{}) {\n\tt := reflect.TypeOf(x)\n\tn := t.NumField()\n\tfmt.Printf(\"Type %v has %d fields:\\n\", t, n)\n\tfmt.Println(\"Name Type Exported\")\n\tfor i := 0; i < n; i++ {\n\t\tf := t.Field(i)\n\t\tfmt.Printf(\"%-8s %-8v %-8t\\n\",\n\t\t\tf.Name,\n\t\t\tf.Type,\n\t\t\tf.PkgPath == \"\",\n\t\t)\n\t}\n\tfmt.Println()\n}\n","language":"Go"},{"code":"import java.lang.reflect.Field\n\n@SuppressWarnings(\"unused\")\nclass ListProperties {\n public int examplePublicField = 42\n private boolean examplePrivateField = true\n\n static void main(String[] args) {\n ListProperties obj = new ListProperties()\n Class clazz = obj.class\n\n println \"All public fields (including inherited):\"\n (clazz.fields).each { Field f ->\n printf \"%s\\t%s\\n\", f, f.get(obj)\n }\n println()\n\n println \"All declared fields (excluding inherited):\"\n clazz.getDeclaredFields().each { Field f ->\n f.accessible = true\n printf \"%s\\t%s\\n\", f, f.get(obj)\n }\n }\n}\n","language":"Groovy"},{"code":"import java.lang.reflect.Field;\n\npublic class ListFields {\n public int examplePublicField = 42;\n private boolean examplePrivateField = true;\n\n public static void main(String[] args) throws IllegalAccessException {\n ListFields obj = new ListFields();\n Class clazz = obj.getClass();\n\n System.out.println(\"All public fields (including inherited):\");\n for (Field f : clazz.getFields()) {\n System.out.printf(\"%s\\t%s\\n\", f, f.get(obj));\n }\n System.out.println();\n System.out.println(\"All declared fields (excluding inherited):\");\n for (Field f : clazz.getDeclaredFields()) {\n System.out.printf(\"%s\\t%s\\n\", f, f.get(obj));\n }\n }\n}\n","language":"Java"},{"code":"var obj = Object.create({\n name: 'proto',\n proto: true,\n doNothing: function() {}\n }, {\n name: {value: 'obj', writable: true, configurable: true, enumerable: true},\n obj: {value: true, writable: true, configurable: true, enumerable: true},\n 'non-enum': {value: 'non-enumerable', writable: true, enumerable: false},\n doStuff: {value: function() {}, enumerable: true}\n});\n\n// get enumerable properties on an object and its ancestors\nfunction get_property_names(obj) {\n var properties = [];\n for (var p in obj) {\n properties.push(p);\n }\n return properties;\n}\n\nget_property_names(obj);\n//[\"name\", \"obj\", \"doStuff\", \"proto\", \"doNothing\"]\n\nObject.getOwnPropertyNames(obj);\n//[\"name\", \"obj\", \"non-enum\", \"doStuff\"]\n\nObject.keys(obj);\n//[\"name\", \"obj\", \"doStuff\"]\n\nObject.entries(obj);\n//[[\"name\", \"obj\"], [\"obj\", true], [\"doStuff\", function()]]\n","language":"JavaScript"},{"code":"# Use jq's built-ins to generate a (recursive) synopsis of .\ndef synopsis:\n if type == \"boolean\" then \"Type: \\(type)\"\n elif type == \"object\"\n then \"Type: \\(type) length:\\(length)\",\n (keys_unsorted[] as $k\n | \"\\($k): \\(.[$k] | synopsis )\")\n else \"Type: \\(type) length: \\(length)\"\n end;\n\ntrue, null, [1,2], {\"a\": {\"b\": 3, \"c\": 4}, \"x\": \"Rosetta Code\"}, now\n| (\"\\n\\(.) ::\", synopsis)\n","language":"Jq"},{"code":"for obj in (Int, 1, 1:10, collect(1:10), now())\n println(\"\\nObject: $obj\\nDescription:\")\n dump(obj)\nend\n","language":"Julia"},{"code":"// version 1.1\n\nimport kotlin.reflect.full.memberProperties\nimport kotlin.reflect.jvm.isAccessible\n\nopen class BaseExample(val baseProp: String) {\n protected val protectedProp: String = \"inherited protected value\"\n}\n\nclass Example(val prop1: String, val prop2: Int, baseProp: String) : BaseExample(baseProp) {\n private val privateProp: String = \"private value\"\n\n val prop3: String\n get() = \"property without backing field\"\n\n val prop4 by lazy { \"delegated value\" }\n}\n\nfun main(args: Array<String>) {\n val example = Example(prop1 = \"abc\", prop2 = 1, baseProp = \"inherited public value\")\n val props = Example::class.memberProperties\n for (prop in props) {\n prop.isAccessible = true // makes non-public properties accessible\n println(\"${prop.name.padEnd(13)} -> ${prop.get(example)}\")\n }\n}\n","language":"Kotlin"},{"code":"obj = script(\"MyClass\").new()\nobj.foo = 23\nobj.bar = 42\n\n-- ...\n\n-- show obj's property names and values\ncnt = obj.count\nrepeat with i = 1 to cnt\n put obj.getPropAt(i)&\" = \"&obj[i]\nend repeat\n","language":"Lingo"},{"code":"a = 1\nb = 2.0\nc = \"hello world\"\n\nfunction listProperties(t)\n if type(t) == \"table\" then\n for k,v in pairs(t) do\n if type(v) ~= \"function\" then\n print(string.format(\"%7s: %s\", type(v), k))\n end\n end\n end\nend\n\nprint(\"Global properties\")\nlistProperties(_G)\nprint(\"Package properties\")\nlistProperties(package)\n","language":"Lua"},{"code":"// declare a class that has fields to be listed\nclass Fields\n\tdeclare static field1 = \"this is a static field. it will not be listed\"\n\tdeclare field2\n\tdeclare field3\n\tdeclare field4\nend\n\n// list all the fields in the class\nfor fieldname in Fields.getFieldNames()\n\tprintln fieldname\nend\n","language":"Nanoquery"},{"code":"type\n Foo = object\n a: float\n b: string\n c: seq[int]\nlet f = Foo(a: 0.9, b: \"hi\", c: @[1,2,3])\nfor n, v in f.fieldPairs:\n echo n, \": \", v\n","language":"Nim"},{"code":"#import <Foundation/Foundation.h>\n#import <objc/runtime.h>\n\n@interface Foo : NSObject {\n int exampleIvar;\n}\n@property (nonatomic) double exampleProperty;\n@end\n@implementation Foo\n- (instancetype)init {\n self = [super init];\n if (self) {\n exampleIvar = 42;\n _exampleProperty = 3.14;\n }\n return self;\n}\n@end\n\nint main() {\n id obj = [[Foo alloc] init];\n Class clazz = [obj class];\n\n NSLog(@\"\\Instance variables:\");\n unsigned int ivarCount;\n Ivar *ivars = class_copyIvarList(clazz, &ivarCount);\n for (unsigned int i = 0; i < ivarCount; i++) {\n Ivar ivar = ivars[i];\n const char *name = ivar_getName(ivar);\n const char *typeEncoding = ivar_getTypeEncoding(ivar);\n // for simple types we can use Key-Value Coding to access it\n // but in general we will have to use object_getIvar and cast it to the right type of function\n // corresponding to the type of the instance variable\n id value = [obj valueForKey:@(name)];\n NSLog(@\"%s\\t%s\\t%@\", name, typeEncoding, value);\n }\n free(ivars);\n\n NSLog(@\"\");\n NSLog(@\"Properties:\");\n unsigned int propCount;\n objc_property_t *properties = class_copyPropertyList([Foo class], &propCount);\n for (unsigned int i = 0; i < propCount; i++) {\n objc_property_t p = properties[i];\n const char *name = property_getName(p);\n const char *attributes = property_getAttributes(p);\n // for simple types we can use Key-Value Coding to access it\n // but in general we will have to use objc_msgSend to call the getter,\n // casting objc_msgSend to the right type of function corresponding to the type of the getter\n id value = [obj valueForKey:@(name)];\n NSLog(@\"%s\\t%s\\t%@\", name, attributes, value);\n }\n free(properties);\n\n return 0;\n}\n","language":"Objective-C"},{"code":"/* REXX demonstrate uses of datatype() */\n/* test values */\nd.1=''\nd.2='a23'\nd.3='101'\nd.4='123'\nd.5='12345678901234567890'\nd.6='abc'\nd.7='aBc'\nd.8='1'\nd.9='0'\nd.10='Walter'\nd.11='ABC'\nd.12='f23'\nd.13='123'\n/* supported options */\nt.1='A' /* Alphanumeric */\nt.2='B' /* Binary */\nt.3='I' /* Internal whole number */\nt.4='L' /* Lowercase */\nt.5='M' /* Mixed case */\nt.6='N' /* Number */\nt.7='O' /* lOgical */\nt.8='S' /* Symbol */\nt.9='U' /* Uppercase */\nt.10='V' /* Variable */\nt.11='W' /* Whole number */\nt.12='X' /* heXadecimal */\nt.13='9' /* 9 digits */\n\nhdr=left('',20)\nDo j=1 To 13\n hdr=hdr t.j\n End\nhdr=hdr 'datatype(v)'\nSay hdr\nDo i=1 To 13\n ol=left(d.i,20)\n Do j=1 To 13\n ol=ol datatype(d.i,t.j)\n End\n ol=ol datatype(d.i)\n Say ol\n End\nSay hdr\n","language":"OoRexx"},{"code":"{\n package Point;\n use Class::Spiffy -base;\n\n field 'x';\n field 'y';\n}\n\n{\n package Circle;\n use base qw(Point);\n field 'r';\n}\n\nmy $p1 = Point->new(x => 8, y => -5);\nmy $c1 = Circle->new(r => 4);\nmy $c2 = Circle->new(x => 1, y => 2, r => 3);\n\nuse Data::Dumper;\nsay Dumper $p1;\nsay Dumper $c1;\nsay Dumper $c2;\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">class</span> <span style=\"color: #000000;\">c</span> <span style=\"color: #7060A8;\">nullable</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #004080;\">int</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">public</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">atm</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2.3</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">str</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"4point5\"</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">seq</span>\n <span style=\"color: #008080;\">public</span><span style=\"color: #0000FF;\">:</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">obj</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"an object\"</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #000000;\">child</span>\n <span style=\"color: #008080;\">private</span> <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">foo</span><span style=\"color: #0000FF;\">();</span>\n <span style=\"color: #008080;\">public</span> <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">bar</span><span style=\"color: #0000FF;\">();</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">class</span>\n\n <span style=\"color: #000000;\">c</span> <span style=\"color: #000000;\">c_instance</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">new</span><span style=\"color: #0000FF;\">()</span>\n\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">builtins</span><span style=\"color: #0000FF;\">\\</span><span style=\"color: #000000;\">structs</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span> <span style=\"color: #7060A8;\">as</span> <span style=\"color: #000000;\">structs</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">nulls</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">NULL</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"NULL\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">fields</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">structs</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">get_struct_fields</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fields</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">tid</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">flags</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">fields</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">flags</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">SF_RTN</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000080;font-style:italic;\">-- (exclude foo/bar)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">nulls</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">structs</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">get_field_type</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">)),</span>\n <span style=\"color: #000000;\">f</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">nulls</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">structs</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">get_field_flags</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">v</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">nulls</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">structs</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">fetch_field</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c_instance</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"type:%-11s, name:%-5s, flags:%s, value:%v\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"<?\nclass Foo {\n}\n$obj = new Foo();\n$obj->bar = 42;\n$obj->baz = true;\n\nvar_dump(get_object_vars($obj));\n?>\n","language":"PHP"},{"code":"# The Rectangle class\n(class +Rectangle +Shape)\n# dx dy\n\n(dm T (X Y DX DY)\n (super X Y)\n (=: dx DX)\n (=: dy DY) )\n\n(dm area> ()\n (* (: dx) (: dy)) )\n\n(dm perimeter> ()\n (* 2 (+ (: dx) (: dy))) )\n\n(dm draw> ()\n (drawRect (: x) (: y) (: dx) (: dy)) ) # Hypothetical function 'drawRect'\n","language":"PicoLisp"},{"code":": (setq R (new '(+Rectangle) 0 0 30 20))\n-> $177356065126400\n\n: (show R)\n$177715702441044 (+Rectangle)\n dy 20\n dx 30\n y 0\n x 0\n-> $177715702441044\n","language":"PicoLisp"},{"code":"Get-Date | Get-Member -MemberType Property\n","language":"PowerShell"},{"code":"Get-Date | Get-Member -MemberType Method -Name Add*\n","language":"PowerShell"},{"code":"class Parent(object):\n __priv = 'private'\n\n def __init__(self, name):\n self.name = name\n\n def __repr__(self):\n return '%s(%s)' % (type(self).__name__, self.name)\n\n def doNothing(self):\n pass\n\nimport re\n\nclass Child(Parent):\n # prefix for \"private\" fields\n __rePrivate = re.compile('^_(Child|Parent)__')\n # used when setting dynamic property values\n __reBleh = re.compile('\\Wbleh$')\n @property\n def reBleh(self):\n return self.__reBleh\n\n def __init__(self, name, *args):\n super(Child, self).__init__(name)\n self.args = args\n\n def __dir__(self):\n myDir = filter(\n # filter out private fields\n lambda p: not self.__rePrivate.match(p),\n list(set( \\\n sum([dir(base) for base in type(self).__bases__], []) \\\n + type(self).__dict__.keys() \\\n + self.__dict__.keys() \\\n )))\n return myDir + map(\n # dynamic properties\n lambda p: p + '_bleh',\n filter(\n # don't add dynamic properties for methods and other special properties\n lambda p: (p[:2] != '__' or p[-2:] != '__') and not callable(getattr(self, p)),\n myDir))\n\n def __getattr__(self, name):\n if name[-5:] == '_bleh':\n # dynamic '_bleh' properties\n return str(getattr(self, name[:-5])) + ' bleh'\n if hasattr(super(Child, chld), '__getattr__'):\n return super(Child, self).__getattr__(name)\n raise AttributeError(\"'%s' object has no attribute '%s'\" % (type(self).__name__, name))\n\n def __setattr__(self, name, value):\n if name[-5:] == '_bleh':\n # skip backing properties that are methods\n if not (hasattr(self, name[:-5]) and callable(getattr(self, name[:-5]))):\n setattr(self, name[:-5], self.reBleh.sub('', value))\n elif hasattr(super(Child, self), '__setattr__'):\n super(Child, self).__setattr__(name, value)\n elif hasattr(self, '__dict__'):\n self.__dict__[name] = value\n\n def __repr__(self):\n return '%s(%s, %s)' % (type(self).__name__, self.name, str(self.args).strip('[]()'))\n\n def doStuff(self):\n return (1+1.0/1e6) ** 1e6\n\npar = Parent('par')\npar.parent = True\ndir(par)\n#['_Parent__priv', '__class__', ..., 'doNothing', 'name', 'parent']\ninspect.getmembers(par)\n#[('_Parent__priv', 'private'), ('__class__', <class '__main__.Parent'>), ..., ('doNothing', <bound method Parent.doNothing of <__main__.Parent object at 0x100777650>>), ('name', 'par'), ('parent', True)]\n\nchld = Child('chld', 0, 'I', 'two')\nchld.own = \"chld's own\"\ndir(chld)\n#['__class__', ..., 'args', 'args_bleh', 'doNothing', 'doStuff', 'name', 'name_bleh', 'own', 'own_bleh', 'reBleh', 'reBleh_bleh']\ninspect.getmembers(chld)\n#[('__class__', <class '__main__.Child'>), ..., ('args', (0, 'I', 'two')), ('args_bleh', \"(0, 'I', 'two') bleh\"), ('doNothing', <bound method Child.doNothing of Child(chld, 0, 'I', 'two')>), ('doStuff', <bound method Child.doStuff of Child(chld, 0, 'I', 'two')>), ('name', 'chld'), ('name_bleh', 'chld bleh'), ('own', \"chld's own\"), ('own_bleh', \"chld's own bleh\"), ('reBleh', <_sre.SRE_Pattern object at 0x10067bd20>), ('reBleh_bleh', '<_sre.SRE_Pattern object at 0x10067bd20> bleh')]\n","language":"Python"},{"code":"class Foo {\n has $!a = now;\n has Str $.b;\n has Int $.c is rw;\n}\n\nmy $object = Foo.new: b => \"Hello\", c => 42;\n\nfor $object.^attributes {\n say join \", \", .name, .readonly, .container.^name, .get_value($object);\n}\n","language":"Raku"},{"code":"j=2\nabc.j= -4.12\n\n\nsay 'variable abc.2 (length' length(abc.2)')=' abc.2\n","language":"REXX"},{"code":"/* REXX shows the \"equivalent\" to PL/I's PUT DATA for a simple variable */\n/* put_data2('a.') to show all a.tail values isn't that easy :-) */\nj=2\nabc.j= -4.12\nSay put_data('abc.2') /* Put Data(abc(2)) */\nstring=put_data('abc.2') /* Put string(string) Data(abc(2)) */\nSay string\nExit\nput_data:\nParse Arg variable\nreturn(variable'='''value(variable)'''')\n","language":"REXX"},{"code":"class Foo\n @@xyz = nil\n def initialize(name, age)\n @name, @age = name, age\n end\n def add_sex(sex)\n @sex = sex\n end\nend\n\np foo = Foo.new(\"Angel\", 18) #=> #<Foo:0x0000000305a688 @name=\"Angel\", @age=18>\np foo.instance_variables #=> [:@name, :@age]\np foo.instance_variable_defined?(:@age) #=> true\np foo.instance_variable_get(:@age) #=> 18\np foo.instance_variable_set(:@age, 19) #=> 19\np foo #=> #<Foo:0x0000000305a688 @name=\"Angel\", @age=19>\nfoo.add_sex(:woman)\np foo.instance_variables #=> [:@name, :@age, :@sex]\np foo #=> #<Foo:0x0000000305a688 @name=\"Angel\", @age=19, @sex=:woman>\nfoo.instance_variable_set(:@bar, nil)\np foo.instance_variables #=> [:@name, :@age, :@sex, :@bar]\n\np Foo.class_variables #=> [:@@xyz]\np Foo.class_variable_defined?(:@@xyz) #=> true\np Foo.class_variable_get(:@@xyz) #=> nil\np Foo.class_variable_set(:@@xyz, :xyz) #=> :xyz\np Foo.class_variable_get(:@@xyz) #=> :xyz\np Foo.class_variable_set(:@@abc, 123) #=> 123\np Foo.class_variables #=> [:@@xyz, :@@abc]\n","language":"Ruby"},{"code":"object ListProperties extends App {\n private val obj = new {\n val examplePublicField: Int = 42\n private val examplePrivateField: Boolean = true\n }\n private val clazz = obj.getClass\n\n println(\"All public methods (including inherited):\")\n clazz.getFields.foreach(f => println(s\"${f}\\t${f.get(obj)}\"))\n\n println(\"\\nAll declared fields (excluding inherited):\")\n clazz.getDeclaredFields.foreach(f => println(s\"${f}}\"))\n}\n","language":"Scala"},{"code":"someObject class instVarNames\n","language":"Smalltalk"},{"code":"someObject class allInstVarNames\n","language":"Smalltalk"},{"code":"someObject class allInstVarNames collect:[:nm | nm -> (someObject instVarNamed:nm)] as:Dictionary\n","language":"Smalltalk"},{"code":"% package require Tk\n8.6.5\n% . configure\n{-bd -borderwidth} {-borderwidth borderWidth BorderWidth 0 0} {-class class Class Toplevel Tclsh}\n {-menu menu Menu {} {}} {-relief relief Relief flat flat} {-screen screen Screen {} {}} {-use use Use {} {}}\n {-background background Background #d9d9d9 #d9d9d9} {-bg -background} {-colormap colormap Colormap {} {}}\n {-container container Container 0 0} {-cursor cursor Cursor {} {}} {-height height Height 0 0}\n {-highlightbackground highlightBackground HighlightBackground #d9d9d9 #d9d9d9}\n {-highlightcolor highlightColor HighlightColor #000000 #000000}\n {-highlightthickness highlightThickness HighlightThickness 0 0} {-padx padX Pad 0 0} {-pady padY Pad 0 0}\n {-takefocus takeFocus TakeFocus 0 0} {-visual visual Visual {} {}} {-width width Width 0 0}\n","language":"Tcl"},{"code":"% lmap o [. configure] {if {[llength $o] == 2} continue else {lindex $o 0}}\n-borderwidth -class -menu -relief -screen -use -background -colormap -container -cursor -height\n -highlightbackground -highlightcolor -highlightthickness -padx -pady -takefocus -visual -width\n","language":"Tcl"},{"code":"Imports System.Reflection\n\nModule Module1\n\n Class TestClass\n Private privateField = 7\n Public ReadOnly Property PublicNumber = 4\n Private ReadOnly Property PrivateNumber = 2\n End Class\n\n Function GetPropertyValues(Of T)(obj As T, flags As BindingFlags) As IEnumerable\n Return From p In obj.GetType().GetProperties(flags)\n Where p.GetIndexParameters().Length = 0\n Select New With {p.Name, Key .Value = p.GetValue(obj, Nothing)}\n End Function\n\n Function GetFieldValues(Of T)(obj As T, flags As BindingFlags) As IEnumerable\n Return obj.GetType().GetFields(flags).Select(Function(f) New With {f.Name, Key .Value = f.GetValue(obj)})\n End Function\n\n Sub Main()\n Dim t As New TestClass()\n Dim flags = BindingFlags.Public Or BindingFlags.NonPublic Or BindingFlags.Instance\n For Each prop In GetPropertyValues(t, flags)\n Console.WriteLine(prop)\n Next\n For Each field In GetFieldValues(t, flags)\n Console.WriteLine(field)\n Next\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"#! instance_methods(m, n, o)\n#! instance_properties(p, q, r)\nclass C {\n construct new() {}\n\n m() {}\n\n n() {}\n\n o() {}\n\n p {}\n\n q {}\n\n r {}\n}\n\nvar c = C.new() // create an object of type C\nSystem.print(\"List of properties available for object 'c':\")\nfor (property in c.type.attributes.self[\"instance_properties\"]) System.print(property.key)\n","language":"Wren"},{"code":"properties:=List.properties;\nproperties.println();\nList(1,2,3).property(properties[0]).println(); // get value\nList(1,2,3).Property(properties[0])().println(); // method that gets value\nList(1,2,3).BaseClass(properties[0]).println(); // another way to get value\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Programming Tasks\\n- Object oriented\\nfrom: http://rosettacode.org/wiki/Reflection/List_properties\\nnote: Reflection\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nThe goal is to get the properties of an object, as names, values or both.\\n\\nSome languages support dynamic properties, which in general can only be inspected if a class' public API includes a way of listing them.\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\nusing System.Reflection;\\n\\npublic static class Reflection\\n{\\n public static void Main() {\\n var t = new TestClass();\\n var flags = BindingFlags.Public | BindingFlags.NonPublic | BindingFlags.Instance;\\n foreach (var prop in GetPropertyValues(t, flags)) {\\n Console.WriteLine(prop);\\n }\\n foreach (var field in GetFieldValues(t, flags)) {\\n Console.WriteLine(field);\\n }\\n }\\n\\n public static IEnumerable<(string name, object value)> GetPropertyValues<T>(T obj, BindingFlags flags) =>\\n from p in typeof(T).GetProperties(flags)\\n where p.GetIndexParameters().Length == 0 //To filter out indexers\\n select (p.Name, p.GetValue(obj, null));\\n\\n public static IEnumerable<(string name, object value)> GetFieldValues<T>(T obj, BindingFlags flags) =>\\n typeof(T).GetFields(flags).Select(f => (f.Name, f.GetValue(obj)));\\n\\n class TestClass\\n {\\n private int privateField = 7;\\n public int PublicNumber { get; } = 4;\\n private int PrivateNumber { get; } = 2;\\n }\\n\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"import std.stdio;\\n\\nstruct S {\\n bool b;\\n\\n void foo() {}\\n private void bar() {}\\n}\\n\\nclass C {\\n bool b;\\n\\n void foo() {}\\n private void bar() {}\\n}\\n\\nvoid printProperties(T)() if (is(T == class) || is(T == struct)) {\\n import std.stdio;\\n import std.traits;\\n\\n writeln(\\\"Properties of \\\", T.stringof, ':');\\n foreach (m; __traits(allMembers, T)) {\\n static if (__traits(compiles, (typeof(__traits(getMember, T, m))))) {\\n alias typeof(__traits(getMember, T, m)) ti;\\n static if (!isFunction!ti) {\\n writeln(\\\" \\\", m);\\n }\\n }\\n }\\n}\\n\\nvoid main() {\\n printProperties!S;\\n printProperties!C;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import system'routines;\\nimport system'dynamic;\\nimport extensions;\\n\\nclass MyClass\\n{\\n int X : prop;\\n string Y : prop;\\n}\\n\\npublic program()\\n{\\n var o := new MyClass\\n {\\n this X := 2;\\n\\n this Y := \\\"String\\\";\\n };\\n\\n MyClass.__getProperties().forEach::(p)\\n {\\n console.printLine(\\\"o.\\\",p,\\\"=\\\",p.getPropertyValue(o))\\n }\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"USING: assocs kernel math mirrors prettyprint strings ;\\n\\nTUPLE: foo\\n{ bar string }\\n{ baz string initial: \\\"hi\\\" }\\n{ baxx integer initial: 50 read-only } ;\\nC: <foo> foo\\n\\n\\\"apple\\\" \\\"banana\\\" 200 <foo> <mirror>\\n[ >alist ] [ object-slots ] bi [ . ] bi@\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"fmt\\\"\\n\\t\\\"image\\\"\\n\\t\\\"reflect\\\"\\n)\\n\\n// A type definition\\ntype t struct {\\n\\tX int\\n\\tnext *t\\n}\\n\\nfunc main() {\\n\\treport(t{})\\n\\treport(image.Point{})\\n}\\n\\nfunc report(x interface{}) {\\n\\tt := reflect.TypeOf(x)\\n\\tn := t.NumField()\\n\\tfmt.Printf(\\\"Type %v has %d fields:\\\\n\\\", t, n)\\n\\tfmt.Println(\\\"Name Type Exported\\\")\\n\\tfor i := 0; i < n; i++ {\\n\\t\\tf := t.Field(i)\\n\\t\\tfmt.Printf(\\\"%-8s %-8v %-8t\\\\n\\\",\\n\\t\\t\\tf.Name,\\n\\t\\t\\tf.Type,\\n\\t\\t\\tf.PkgPath == \\\"\\\",\\n\\t\\t)\\n\\t}\\n\\tfmt.Println()\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import java.lang.reflect.Field\\n\\n@SuppressWarnings(\\\"unused\\\")\\nclass ListProperties {\\n public int examplePublicField = 42\\n private boolean examplePrivateField = true\\n\\n static void main(String[] args) {\\n ListProperties obj = new ListProperties()\\n Class clazz = obj.class\\n\\n println \\\"All public fields (including inherited):\\\"\\n (clazz.fields).each { Field f ->\\n printf \\\"%s\\\\t%s\\\\n\\\", f, f.get(obj)\\n }\\n println()\\n\\n println \\\"All declared fields (excluding inherited):\\\"\\n clazz.getDeclaredFields().each { Field f ->\\n f.accessible = true\\n printf \\\"%s\\\\t%s\\\\n\\\", f, f.get(obj)\\n }\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import java.lang.reflect.Field;\\n\\npublic class ListFields {\\n public int examplePublicField = 42;\\n private boolean examplePrivateField = true;\\n\\n public static void main(String[] args) throws IllegalAccessException {\\n ListFields obj = new ListFields();\\n Class clazz = obj.getClass();\\n\\n System.out.println(\\\"All public fields (including inherited):\\\");\\n for (Field f : clazz.getFields()) {\\n System.out.printf(\\\"%s\\\\t%s\\\\n\\\", f, f.get(obj));\\n }\\n System.out.println();\\n System.out.println(\\\"All declared fields (excluding inherited):\\\");\\n for (Field f : clazz.getDeclaredFields()) {\\n System.out.printf(\\\"%s\\\\t%s\\\\n\\\", f, f.get(obj));\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var obj = Object.create({\\n name: 'proto',\\n proto: true,\\n doNothing: function() {}\\n }, {\\n name: {value: 'obj', writable: true, configurable: true, enumerable: true},\\n obj: {value: true, writable: true, configurable: true, enumerable: true},\\n 'non-enum': {value: 'non-enumerable', writable: true, enumerable: false},\\n doStuff: {value: function() {}, enumerable: true}\\n});\\n\\n// get enumerable properties on an object and its ancestors\\nfunction get_property_names(obj) {\\n var properties = [];\\n for (var p in obj) {\\n properties.push(p);\\n }\\n return properties;\\n}\\n\\nget_property_names(obj);\\n//[\\\"name\\\", \\\"obj\\\", \\\"doStuff\\\", \\\"proto\\\", \\\"doNothing\\\"]\\n\\nObject.getOwnPropertyNames(obj);\\n//[\\\"name\\\", \\\"obj\\\", \\\"non-enum\\\", \\\"doStuff\\\"]\\n\\nObject.keys(obj);\\n//[\\\"name\\\", \\\"obj\\\", \\\"doStuff\\\"]\\n\\nObject.entries(obj);\\n//[[\\\"name\\\", \\\"obj\\\"], [\\\"obj\\\", true], [\\\"doStuff\\\", function()]]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Use jq's built-ins to generate a (recursive) synopsis of .\\ndef synopsis:\\n if type == \\\"boolean\\\" then \\\"Type: \\\\(type)\\\"\\n elif type == \\\"object\\\"\\n then \\\"Type: \\\\(type) length:\\\\(length)\\\",\\n (keys_unsorted[] as $k\\n | \\\"\\\\($k): \\\\(.[$k] | synopsis )\\\")\\n else \\\"Type: \\\\(type) length: \\\\(length)\\\"\\n end;\\n\\ntrue, null, [1,2], {\\\"a\\\": {\\\"b\\\": 3, \\\"c\\\": 4}, \\\"x\\\": \\\"Rosetta Code\\\"}, now\\n| (\\\"\\\\n\\\\(.) ::\\\", synopsis)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"for obj in (Int, 1, 1:10, collect(1:10), now())\\n println(\\\"\\\\nObject: $obj\\\\nDescription:\\\")\\n dump(obj)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1\\n\\nimport kotlin.reflect.full.memberProperties\\nimport kotlin.reflect.jvm.isAccessible\\n\\nopen class BaseExample(val baseProp: String) {\\n protected val protectedProp: String = \\\"inherited protected value\\\"\\n}\\n\\nclass Example(val prop1: String, val prop2: Int, baseProp: String) : BaseExample(baseProp) {\\n private val privateProp: String = \\\"private value\\\"\\n\\n val prop3: String\\n get() = \\\"property without backing field\\\"\\n\\n val prop4 by lazy { \\\"delegated value\\\" }\\n}\\n\\nfun main(args: Array<String>) {\\n val example = Example(prop1 = \\\"abc\\\", prop2 = 1, baseProp = \\\"inherited public value\\\")\\n val props = Example::class.memberProperties\\n for (prop in props) {\\n prop.isAccessible = true // makes non-public properties accessible\\n println(\\\"${prop.name.padEnd(13)} -> ${prop.get(example)}\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"obj = script(\\\"MyClass\\\").new()\\nobj.foo = 23\\nobj.bar = 42\\n\\n-- ...\\n\\n-- show obj's property names and values\\ncnt = obj.count\\nrepeat with i = 1 to cnt\\n put obj.getPropAt(i)&\\\" = \\\"&obj[i]\\nend repeat\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"a = 1\\nb = 2.0\\nc = \\\"hello world\\\"\\n\\nfunction listProperties(t)\\n if type(t) == \\\"table\\\" then\\n for k,v in pairs(t) do\\n if type(v) ~= \\\"function\\\" then\\n print(string.format(\\\"%7s: %s\\\", type(v), k))\\n end\\n end\\n end\\nend\\n\\nprint(\\\"Global properties\\\")\\nlistProperties(_G)\\nprint(\\\"Package properties\\\")\\nlistProperties(package)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"// declare a class that has fields to be listed\\nclass Fields\\n\\tdeclare static field1 = \\\"this is a static field. it will not be listed\\\"\\n\\tdeclare field2\\n\\tdeclare field3\\n\\tdeclare field4\\nend\\n\\n// list all the fields in the class\\nfor fieldname in Fields.getFieldNames()\\n\\tprintln fieldname\\nend\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"type\\n Foo = object\\n a: float\\n b: string\\n c: seq[int]\\nlet f = Foo(a: 0.9, b: \\\"hi\\\", c: @[1,2,3])\\nfor n, v in f.fieldPairs:\\n echo n, \\\": \\\", v\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#import <Foundation/Foundation.h>\\n#import <objc/runtime.h>\\n\\n@interface Foo : NSObject {\\n int exampleIvar;\\n}\\n@property (nonatomic) double exampleProperty;\\n@end\\n@implementation Foo\\n- (instancetype)init {\\n self = [super init];\\n if (self) {\\n exampleIvar = 42;\\n _exampleProperty = 3.14;\\n }\\n return self;\\n}\\n@end\\n\\nint main() {\\n id obj = [[Foo alloc] init];\\n Class clazz = [obj class];\\n\\n NSLog(@\\\"\\\\Instance variables:\\\");\\n unsigned int ivarCount;\\n Ivar *ivars = class_copyIvarList(clazz, &ivarCount);\\n for (unsigned int i = 0; i < ivarCount; i++) {\\n Ivar ivar = ivars[i];\\n const char *name = ivar_getName(ivar);\\n const char *typeEncoding = ivar_getTypeEncoding(ivar);\\n // for simple types we can use Key-Value Coding to access it\\n // but in general we will have to use object_getIvar and cast it to the right type of function\\n // corresponding to the type of the instance variable\\n id value = [obj valueForKey:@(name)];\\n NSLog(@\\\"%s\\\\t%s\\\\t%@\\\", name, typeEncoding, value);\\n }\\n free(ivars);\\n\\n NSLog(@\\\"\\\");\\n NSLog(@\\\"Properties:\\\");\\n unsigned int propCount;\\n objc_property_t *properties = class_copyPropertyList([Foo class], &propCount);\\n for (unsigned int i = 0; i < propCount; i++) {\\n objc_property_t p = properties[i];\\n const char *name = property_getName(p);\\n const char *attributes = property_getAttributes(p);\\n // for simple types we can use Key-Value Coding to access it\\n // but in general we will have to use objc_msgSend to call the getter,\\n // casting objc_msgSend to the right type of function corresponding to the type of the getter\\n id value = [obj valueForKey:@(name)];\\n NSLog(@\\\"%s\\\\t%s\\\\t%@\\\", name, attributes, value);\\n }\\n free(properties);\\n\\n return 0;\\n}\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"/* REXX demonstrate uses of datatype() */\\n/* test values */\\nd.1=''\\nd.2='a23'\\nd.3='101'\\nd.4='123'\\nd.5='12345678901234567890'\\nd.6='abc'\\nd.7='aBc'\\nd.8='1'\\nd.9='0'\\nd.10='Walter'\\nd.11='ABC'\\nd.12='f23'\\nd.13='123'\\n/* supported options */\\nt.1='A' /* Alphanumeric */\\nt.2='B' /* Binary */\\nt.3='I' /* Internal whole number */\\nt.4='L' /* Lowercase */\\nt.5='M' /* Mixed case */\\nt.6='N' /* Number */\\nt.7='O' /* lOgical */\\nt.8='S' /* Symbol */\\nt.9='U' /* Uppercase */\\nt.10='V' /* Variable */\\nt.11='W' /* Whole number */\\nt.12='X' /* heXadecimal */\\nt.13='9' /* 9 digits */\\n\\nhdr=left('',20)\\nDo j=1 To 13\\n hdr=hdr t.j\\n End\\nhdr=hdr 'datatype(v)'\\nSay hdr\\nDo i=1 To 13\\n ol=left(d.i,20)\\n Do j=1 To 13\\n ol=ol datatype(d.i,t.j)\\n End\\n ol=ol datatype(d.i)\\n Say ol\\n End\\nSay hdr\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"{\\n package Point;\\n use Class::Spiffy -base;\\n\\n field 'x';\\n field 'y';\\n}\\n\\n{\\n package Circle;\\n use base qw(Point);\\n field 'r';\\n}\\n\\nmy $p1 = Point->new(x => 8, y => -5);\\nmy $c1 = Circle->new(r => 4);\\nmy $c2 = Circle->new(x => 1, y => 2, r => 3);\\n\\nuse Data::Dumper;\\nsay Dumper $p1;\\nsay Dumper $c1;\\nsay Dumper $c2;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">class</span> <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #7060A8;\\\">nullable</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #004080;\\\">int</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">public</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">atm</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2.3</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">str</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"4point5\\\"</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">seq</span>\\n <span style=\\\"color: #008080;\\\">public</span><span style=\\\"color: #0000FF;\\\">:</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">obj</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"an object\\\"</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #000000;\\\">child</span>\\n <span style=\\\"color: #008080;\\\">private</span> <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">foo</span><span style=\\\"color: #0000FF;\\\">();</span>\\n <span style=\\\"color: #008080;\\\">public</span> <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">bar</span><span style=\\\"color: #0000FF;\\\">();</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">class</span>\\n\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #000000;\\\">c_instance</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">new</span><span style=\\\"color: #0000FF;\\\">()</span>\\n\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">builtins</span><span style=\\\"color: #0000FF;\\\">\\\\</span><span style=\\\"color: #000000;\\\">structs</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span> <span style=\\\"color: #7060A8;\\\">as</span> <span style=\\\"color: #000000;\\\">structs</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">nulls</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"NULL\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">fields</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">structs</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">get_struct_fields</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fields</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">tid</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">flags</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">fields</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">flags</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">SF_RTN</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (exclude foo/bar)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">nulls</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">structs</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">get_field_type</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">)),</span>\\n <span style=\\\"color: #000000;\\\">f</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">nulls</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">structs</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">get_field_flags</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">v</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">nulls</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">structs</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">fetch_field</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c_instance</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"type:%-11s, name:%-5s, flags:%s, value:%v\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?\\nclass Foo {\\n}\\n$obj = new Foo();\\n$obj->bar = 42;\\n$obj->baz = true;\\n\\nvar_dump(get_object_vars($obj));\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"# The Rectangle class\\n(class +Rectangle +Shape)\\n# dx dy\\n\\n(dm T (X Y DX DY)\\n (super X Y)\\n (=: dx DX)\\n (=: dy DY) )\\n\\n(dm area> ()\\n (* (: dx) (: dy)) )\\n\\n(dm perimeter> ()\\n (* 2 (+ (: dx) (: dy))) )\\n\\n(dm draw> ()\\n (drawRect (: x) (: y) (: dx) (: dy)) ) # Hypothetical function 'drawRect'\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \": (setq R (new '(+Rectangle) 0 0 30 20))\\n-> $177356065126400\\n\\n: (show R)\\n$177715702441044 (+Rectangle)\\n dy 20\\n dx 30\\n y 0\\n x 0\\n-> $177715702441044\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"Get-Date | Get-Member -MemberType Property\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Get-Date | Get-Member -MemberType Method -Name Add*\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"class Parent(object):\\n __priv = 'private'\\n\\n def __init__(self, name):\\n self.name = name\\n\\n def __repr__(self):\\n return '%s(%s)' % (type(self).__name__, self.name)\\n\\n def doNothing(self):\\n pass\\n\\nimport re\\n\\nclass Child(Parent):\\n # prefix for \\\"private\\\" fields\\n __rePrivate = re.compile('^_(Child|Parent)__')\\n # used when setting dynamic property values\\n __reBleh = re.compile('\\\\Wbleh$')\\n @property\\n def reBleh(self):\\n return self.__reBleh\\n\\n def __init__(self, name, *args):\\n super(Child, self).__init__(name)\\n self.args = args\\n\\n def __dir__(self):\\n myDir = filter(\\n # filter out private fields\\n lambda p: not self.__rePrivate.match(p),\\n list(set( \\\\\\n sum([dir(base) for base in type(self).__bases__], []) \\\\\\n + type(self).__dict__.keys() \\\\\\n + self.__dict__.keys() \\\\\\n )))\\n return myDir + map(\\n # dynamic properties\\n lambda p: p + '_bleh',\\n filter(\\n # don't add dynamic properties for methods and other special properties\\n lambda p: (p[:2] != '__' or p[-2:] != '__') and not callable(getattr(self, p)),\\n myDir))\\n\\n def __getattr__(self, name):\\n if name[-5:] == '_bleh':\\n # dynamic '_bleh' properties\\n return str(getattr(self, name[:-5])) + ' bleh'\\n if hasattr(super(Child, chld), '__getattr__'):\\n return super(Child, self).__getattr__(name)\\n raise AttributeError(\\\"'%s' object has no attribute '%s'\\\" % (type(self).__name__, name))\\n\\n def __setattr__(self, name, value):\\n if name[-5:] == '_bleh':\\n # skip backing properties that are methods\\n if not (hasattr(self, name[:-5]) and callable(getattr(self, name[:-5]))):\\n setattr(self, name[:-5], self.reBleh.sub('', value))\\n elif hasattr(super(Child, self), '__setattr__'):\\n super(Child, self).__setattr__(name, value)\\n elif hasattr(self, '__dict__'):\\n self.__dict__[name] = value\\n\\n def __repr__(self):\\n return '%s(%s, %s)' % (type(self).__name__, self.name, str(self.args).strip('[]()'))\\n\\n def doStuff(self):\\n return (1+1.0/1e6) ** 1e6\\n\\npar = Parent('par')\\npar.parent = True\\ndir(par)\\n#['_Parent__priv', '__class__', ..., 'doNothing', 'name', 'parent']\\ninspect.getmembers(par)\\n#[('_Parent__priv', 'private'), ('__class__', <class '__main__.Parent'>), ..., ('doNothing', <bound method Parent.doNothing of <__main__.Parent object at 0x100777650>>), ('name', 'par'), ('parent', True)]\\n\\nchld = Child('chld', 0, 'I', 'two')\\nchld.own = \\\"chld's own\\\"\\ndir(chld)\\n#['__class__', ..., 'args', 'args_bleh', 'doNothing', 'doStuff', 'name', 'name_bleh', 'own', 'own_bleh', 'reBleh', 'reBleh_bleh']\\ninspect.getmembers(chld)\\n#[('__class__', <class '__main__.Child'>), ..., ('args', (0, 'I', 'two')), ('args_bleh', \\\"(0, 'I', 'two') bleh\\\"), ('doNothing', <bound method Child.doNothing of Child(chld, 0, 'I', 'two')>), ('doStuff', <bound method Child.doStuff of Child(chld, 0, 'I', 'two')>), ('name', 'chld'), ('name_bleh', 'chld bleh'), ('own', \\\"chld's own\\\"), ('own_bleh', \\\"chld's own bleh\\\"), ('reBleh', <_sre.SRE_Pattern object at 0x10067bd20>), ('reBleh_bleh', '<_sre.SRE_Pattern object at 0x10067bd20> bleh')]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"class Foo {\\n has $!a = now;\\n has Str $.b;\\n has Int $.c is rw;\\n}\\n\\nmy $object = Foo.new: b => \\\"Hello\\\", c => 42;\\n\\nfor $object.^attributes {\\n say join \\\", \\\", .name, .readonly, .container.^name, .get_value($object);\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"j=2\\nabc.j= -4.12\\n\\n\\nsay 'variable abc.2 (length' length(abc.2)')=' abc.2\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/* REXX shows the \\\"equivalent\\\" to PL/I's PUT DATA for a simple variable */\\n/* put_data2('a.') to show all a.tail values isn't that easy :-) */\\nj=2\\nabc.j= -4.12\\nSay put_data('abc.2') /* Put Data(abc(2)) */\\nstring=put_data('abc.2') /* Put string(string) Data(abc(2)) */\\nSay string\\nExit\\nput_data:\\nParse Arg variable\\nreturn(variable'='''value(variable)'''')\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"class Foo\\n @@xyz = nil\\n def initialize(name, age)\\n @name, @age = name, age\\n end\\n def add_sex(sex)\\n @sex = sex\\n end\\nend\\n\\np foo = Foo.new(\\\"Angel\\\", 18) #=> #<Foo:0x0000000305a688 @name=\\\"Angel\\\", @age=18>\\np foo.instance_variables #=> [:@name, :@age]\\np foo.instance_variable_defined?(:@age) #=> true\\np foo.instance_variable_get(:@age) #=> 18\\np foo.instance_variable_set(:@age, 19) #=> 19\\np foo #=> #<Foo:0x0000000305a688 @name=\\\"Angel\\\", @age=19>\\nfoo.add_sex(:woman)\\np foo.instance_variables #=> [:@name, :@age, :@sex]\\np foo #=> #<Foo:0x0000000305a688 @name=\\\"Angel\\\", @age=19, @sex=:woman>\\nfoo.instance_variable_set(:@bar, nil)\\np foo.instance_variables #=> [:@name, :@age, :@sex, :@bar]\\n\\np Foo.class_variables #=> [:@@xyz]\\np Foo.class_variable_defined?(:@@xyz) #=> true\\np Foo.class_variable_get(:@@xyz) #=> nil\\np Foo.class_variable_set(:@@xyz, :xyz) #=> :xyz\\np Foo.class_variable_get(:@@xyz) #=> :xyz\\np Foo.class_variable_set(:@@abc, 123) #=> 123\\np Foo.class_variables #=> [:@@xyz, :@@abc]\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"object ListProperties extends App {\\n private val obj = new {\\n val examplePublicField: Int = 42\\n private val examplePrivateField: Boolean = true\\n }\\n private val clazz = obj.getClass\\n\\n println(\\\"All public methods (including inherited):\\\")\\n clazz.getFields.foreach(f => println(s\\\"${f}\\\\t${f.get(obj)}\\\"))\\n\\n println(\\\"\\\\nAll declared fields (excluding inherited):\\\")\\n clazz.getDeclaredFields.foreach(f => println(s\\\"${f}}\\\"))\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"someObject class instVarNames\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"someObject class allInstVarNames\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"someObject class allInstVarNames collect:[:nm | nm -> (someObject instVarNamed:nm)] as:Dictionary\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"% package require Tk\\n8.6.5\\n% . configure\\n{-bd -borderwidth} {-borderwidth borderWidth BorderWidth 0 0} {-class class Class Toplevel Tclsh}\\n {-menu menu Menu {} {}} {-relief relief Relief flat flat} {-screen screen Screen {} {}} {-use use Use {} {}}\\n {-background background Background #d9d9d9 #d9d9d9} {-bg -background} {-colormap colormap Colormap {} {}}\\n {-container container Container 0 0} {-cursor cursor Cursor {} {}} {-height height Height 0 0}\\n {-highlightbackground highlightBackground HighlightBackground #d9d9d9 #d9d9d9}\\n {-highlightcolor highlightColor HighlightColor #000000 #000000}\\n {-highlightthickness highlightThickness HighlightThickness 0 0} {-padx padX Pad 0 0} {-pady padY Pad 0 0}\\n {-takefocus takeFocus TakeFocus 0 0} {-visual visual Visual {} {}} {-width width Width 0 0}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"% lmap o [. configure] {if {[llength $o] == 2} continue else {lindex $o 0}}\\n-borderwidth -class -menu -relief -screen -use -background -colormap -container -cursor -height\\n -highlightbackground -highlightcolor -highlightthickness -padx -pady -takefocus -visual -width\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"Imports System.Reflection\\n\\nModule Module1\\n\\n Class TestClass\\n Private privateField = 7\\n Public ReadOnly Property PublicNumber = 4\\n Private ReadOnly Property PrivateNumber = 2\\n End Class\\n\\n Function GetPropertyValues(Of T)(obj As T, flags As BindingFlags) As IEnumerable\\n Return From p In obj.GetType().GetProperties(flags)\\n Where p.GetIndexParameters().Length = 0\\n Select New With {p.Name, Key .Value = p.GetValue(obj, Nothing)}\\n End Function\\n\\n Function GetFieldValues(Of T)(obj As T, flags As BindingFlags) As IEnumerable\\n Return obj.GetType().GetFields(flags).Select(Function(f) New With {f.Name, Key .Value = f.GetValue(obj)})\\n End Function\\n\\n Sub Main()\\n Dim t As New TestClass()\\n Dim flags = BindingFlags.Public Or BindingFlags.NonPublic Or BindingFlags.Instance\\n For Each prop In GetPropertyValues(t, flags)\\n Console.WriteLine(prop)\\n Next\\n For Each field In GetFieldValues(t, flags)\\n Console.WriteLine(field)\\n Next\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"#! instance_methods(m, n, o)\\n#! instance_properties(p, q, r)\\nclass C {\\n construct new() {}\\n\\n m() {}\\n\\n n() {}\\n\\n o() {}\\n\\n p {}\\n\\n q {}\\n\\n r {}\\n}\\n\\nvar c = C.new() // create an object of type C\\nSystem.print(\\\"List of properties available for object 'c':\\\")\\nfor (property in c.type.attributes.self[\\\"instance_properties\\\"]) System.print(property.key)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"properties:=List.properties;\\nproperties.println();\\nList(1,2,3).property(properties[0]).println(); // get value\\nList(1,2,3).Property(properties[0])().println(); // method that gets value\\nList(1,2,3).BaseClass(properties[0]).println(); // another way to get value\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Reflection-List-properties"}}},{"rowIdx":1574,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Remove_duplicate_elements\nnote: Sorting Algorithms\n","language":"00-META"},{"code":"{{Sorting Algorithm}}\n[[Category:Sorting]]\n\nGiven an Array, derive a sequence of elements in which all duplicates are removed.\n\nThere are basically three approaches seen here:\n* Put the elements into a hash table which does not allow duplicates. The complexity is O(''n'') on average, and O(''n''<sup>2</sup>) worst case. This approach requires a hash function for your type (which is compatible with equality), either built-in to your language, or provided by the user.\n* Sort the elements and remove consecutive duplicate elements. The complexity of the best sorting algorithms is O(''n'' log ''n''). This approach requires that your type be \"comparable\", i.e., have an ordering. Putting the elements into a self-balancing binary search tree is a special case of sorting.\n* Go through the list, and for each element, check the rest of the list to see if it appears again, and discard it if it does. The complexity is O(''n''<sup>2</sup>). The up-shot is that this always works on any type (provided that you can test for equality).\n<br><br>\n\n","language":"00-TASK"},{"code":"V items = [‘1’, ‘2’, ‘3’, ‘a’, ‘b’, ‘c’, ‘2’, ‘3’, ‘4’, ‘b’, ‘c’, ‘d’]\nV unique = Array(Set(items))\nprint(unique)\n","language":"11l"},{"code":"* Remove duplicate elements - 18/10/2015\nREMDUP CSECT\n USING REMDUP,R15 set base register\n SR R6,R6 i=0\n LA R8,1 k=1\nLOOPK C R8,N do k=1 to n\n BH ELOOPK\n LR R1,R8 k\n SLA R1,2\n L R9,T-4(R1) e=t(k)\n LR R7,R8 k\n BCTR R7,0 j=k-1\nLOOPJ C R7,=F'1' do j=k-1 to 1 by -1\n BL ELOOPJ\n LR R1,R7 j\n SLA R1,2\n L R2,T-4(R1) t(j)\n CR R9,R2 if e=t(j) then goto iter\n BE ITER\n BCTR R7,0 j=j-1\n B LOOPJ\nELOOPJ LA R6,1(R6) i=i+1\n LR R1,R6 i\n SLA R1,2\n ST R9,T-4(R1) t(i)=e\nITER LA R8,1(R8) k=k+1\n B LOOPK\nELOOPK LA R10,PG pgi=@pg\n LA R8,1 k=1\nLOOP CR R8,R6 do k=1 to i\n BH ELOOP\n LR R1,R8 k\n SLA R1,2\n L R2,T-4(R1) t(k)\n XDECO R2,PG+80 edit t(k)\n MVC 0(3,R10),PG+89 output t(k) on 3 char\n LA R10,3(R10) pgi=pgi+3\n LA R8,1(R8) k=k+1\n B LOOP\nELOOP XPRNT PG,80 print buffer\n XR R15,R15 set return code\n BR R14 return to caller\nT DC F'6',F'6',F'1',F'5',F'6',F'2',F'1',F'7',F'5',F'22'\n DC F'4',F'19',F'1',F'1',F'6',F'8',F'9',F'10',F'11',F'12'\nN DC A((N-T)/4) number of T items\nPG DC CL92' '\n YREGS\n END REMDUP\n","language":"360-Assembly"},{"code":"\t\torg\t100h\n\t\tjmp\ttest\n\t\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t\t;; Given an array of bytes starting at HL with length BC,\n\t\t;; remove all duplicates in the array. The new end of the array\n\t\t;; is returned in HL. A page of memory (256 bytes) is required\n\t\t;; to mark which bytes have been seen.\nuniqpage:\tequ\t3\t; Page to use - a compile-time constant.\n\t\t\t\t; This would need to be set to a page that\n\t\t\t\t; the rest of the program doesn't need.\nuniq:\t\txra\ta\t; Zero out the page\n\t\tlxi\td,uniqpage * 256\nuniqzero:\tstax\td\t; Zero out a byte\n\t\tinr\te\t; And do the next byte\n\t\tjnz\tuniqzero\n\t\tmov\td,h\t; Keep a second pointer to the array in DE\n\t\tmov\te,l\nuniqpos:\tldax\td\t; Read from high pointer\n\t\tmov\tm,a\t; Write to low pointer\n\t\tinx\td\t; Increment the high pointer\n\t\tpush\th\t; Keep low pointer around\n\t\tmvi\th,uniqpage\t\n\t\tmov\tl,a\t; Have we seen this byte yet?\n\t\tcmp\tm\t\n\t\tmov\tm,a\t; No matter what, we've certainly seen it now\n\t\tpop\th\t; Bring back the low pointer\n\t\tjz\tuniqno\t; If we already had it, don't increment low ptr\n\t\tinx\th\t; IF we didn't, do increment it\nuniqno:\t\tdcx\tb\t; One fewer byte left\n\t\tmov\ta,b\t; If there are zero bytes left,\n\t\tora\tc\n\t\trz\t\t; Then return to caller\n\t\tjmp\tuniqpos\t; Otherwise, do the next byte\n\t\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t\t;; Testing code: read a string from the CP/M console, run\n\t\t;; uniq, then print the output.\ntest:\t\tlxi\td,bufdef\t; Read a string\n\t\tmvi\tc,10\n\t\tcall\t5\n\t\tlxi\td,nl\t\t; Output on new line\n\t\tmvi\tc,9\n\t\tcall\t5\n\t\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t\tlda\tbufdef+1\t; Length of input string\n\t\tmov\tc,a\t\t; Extend to 16-bit (since uniq supports\n\t\tmvi\tb,0\t\t; long arrays)\n\t\tlxi\th,buf\t\t; Location of input string\n\t\tcall\tuniq\t\t; Only the unique bytes\n\t\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t\tmvi\tm,'$'\t\t; Mark the (string) end with '$'\n\t\tlxi \td,buf\t\t; Print the string, which now has had\n\t\tmvi\tc,9\t\t; all duplicates removed.\n\t\tjmp\t5\nnl:\t\tdb\t13,10,'$'\nbufdef:\t\tdb\t127,0\nbuf:\n","language":"8080-Assembly"},{"code":"(remove-duplicates xs)\n","language":"ACL2"},{"code":"INCLUDE \"D2:SORT.ACT\" ;from the Action! Tool Kit\n\nPROC PrintArray(INT ARRAY a INT size)\n INT i\n\n Put('[)\n FOR i=0 TO size-1\n DO\n IF i>0 THEN Put(' ) FI\n PrintI(a(i))\n OD\n Put(']) PutE()\nRETURN\n\nPROC RemoveDuplicates(INT ARRAY src INT srcLen\n INT ARRAY dst INT POINTER dstLen)\n INT i\n CHAR curr,prev\n\n IF srcLen=0 THEN\n dstLen^=0\n RETURN\n FI\n\n SortI(src,srcLen,0)\n dst(0)=src(0)\n dstLen^=1 prev=src(0)\n FOR i=1 TO srcLen-1\n DO\n curr=src(i)\n IF curr#prev THEN\n dst(dstLen^)=curr\n dstLen^==+1\n FI\n prev=curr\n OD\nRETURN\n\nPROC Test(INT ARRAY src INT srcLen)\n INT ARRAY dst(100)\n INT dstLen\n\n PrintE(\"Input array:\")\n PrintArray(src,srcLen)\n RemoveDuplicates(src,srcLen,dst,@dstLen)\n PrintE(\"Unique items:\")\n PrintArray(dst,dstLen)\n PutE()\nRETURN\n\nPROC Main()\n INT ARRAY src1(9)=[1 3 65534 0 12 1 65534 52 3]\n INT ARRAY src2(26)=[3 2 1 3 2 5 2 1 6 3 4 2 5 3 1 5 3 5 2 1 3 7 4 5 7 6]\n INT ARRAY src3(1)=[6502]\n\n Put(125) PutE() ;clear screen\n Test(src1,9)\n Test(src2,26)\n Test(src3,1)\nRETURN\n","language":"Action-"},{"code":"with Ada.Containers.Ordered_Sets, Ada.Text_IO;\nuse Ada.Text_IO;\n\nprocedure Duplicate is\t\n\tpackage Int_Sets is new Ada.Containers.Ordered_Sets (Integer);\n\tNums : constant array (Natural range <>) of Integer := (1,2,3,4,5,5,6,7,1);\n\tUnique : Int_Sets.Set;\nbegin\n\tfor n of Nums loop\n\t\tUnique.Include (n);\n\tend loop;\n\tfor e of Unique loop\n\t\tPut (e'img);\n\tend loop;\nend Duplicate;\n","language":"Ada"},{"code":"index x;\n\nlist(1, 2, 3, 1, 2, 3, 4, 1).ucall(i_add, 1, x, 0);\nx.i_vcall(o_, 1, \" \");\no_newline();\n","language":"Aime"},{"code":"index x;\n\nfor (, integer a in list(8, 2, 1, 8, 2, 1, 4, 8)) {\n if ((x[a] += 1) == 1) {\n o_(\" \", a);\n }\n}\no_newline();\n","language":"Aime"},{"code":"# use the associative array in the Associate array/iteration task #\n# this example uses strings - for other types, the associative #\n# array modes AAELEMENT and AAKEY should be modified as required #\nPR read \"aArray.a68\" PR\n\n# returns the unique elements of list #\nPROC remove duplicates = ( []STRING list )[]STRING:\n BEGIN\n REF AARRAY elements := INIT LOC AARRAY;\n INT count := 0;\n FOR pos FROM LWB list TO UPB list DO\n IF NOT ( elements CONTAINSKEY list[ pos ] ) THEN\n # first occurance of this element #\n elements // list[ pos ] := \"\";\n count +:= 1\n FI\n OD;\n # construct an array of the unique elements from the #\n # associative array - the new list will not necessarily be #\n # in the original order #\n [ count ]STRING result;\n REF AAELEMENT e := FIRST elements;\n FOR pos WHILE e ISNT nil element DO\n result[ pos ] := key OF e;\n e := NEXT elements\n OD;\n result\n END; # remove duplicates #\n\n# test the duplicate removal #\nprint( ( remove duplicates( ( \"A\", \"B\", \"D\", \"A\", \"C\", \"F\", \"F\", \"A\" ) ), newline ) )\n","language":"ALGOL-68"},{"code":"#include <hopper.h>\n\nmain:\n x=-1\n {30} rand array (x), mulby(10), ceil, mov(x)\n {\"Original Array:\\n\",x}, println\n {x}array(SORT),\n {x}sets(UNIQUE), mov(x)\n {\"Final array:\\n\",x}, println\n\n y={}\n {\"C\",\"Go\",\"Go\",\"C\",\"Cobol\",\"java\",\"Ada\"} pushall(y)\n {\"java\",\"algol-68\",\"C\",\"java\",\"fortran\"} pushall(y)\n {\"\\nOriginal Array:\\n\",y}, println\n {y}array(SORT),\n {y}sets(UNIQUE), mov(y)\n {\"Final array:\\n\",y}, println\nexit(0)\n","language":"Amazing-Hopper"},{"code":"100 REM Remove duplicate elements\n110 DIM DataArray(1 TO 7), ResultArray(1 TO 7)\n120 ! Set the data.\n130 FOR I = 1 TO 7\n140 READ DataArray(I)\n150 NEXT I\n160 ! Remove duplicates\n170 LET ResultArray(1) = DataArray(1)\n180 LET LastResultIndex = 1\n190 LET Position = 1\n200 DO WHILE Position < UBOUND(DataArray)\n210 LET Position = Position + 1\n220 LET IsNewNumber = -1\n230 FOR ResultIndex = 1 TO LastResultIndex\n240 IF DataArray(Position) = ResultArray(ResultIndex) THEN\n250 LET IsNewNumber = 0\n260 EXIT FOR\n270 END IF\n280 NEXT ResultIndex\n290 IF IsNewNumber = -1 THEN\n300 LET LastResultIndex = LastResultIndex + 1\n310 LET ResultArray(LastResultIndex) = DataArray(Position)\n320 END IF\n330 LOOP\n340 FOR ResultIndex = 1 TO LastResultIndex\n350 PRINT ResultArray(ResultIndex)\n360 NEXT ResultIndex\n370 DATA 1, 2, 2, 3, 4, 5, 5\n380 END\n","language":"ANSI-BASIC"},{"code":"∪ 1 2 3 1 2 3 4 1\n1 2 3 4\n","language":"APL"},{"code":"w←1 2 3 1 2 3 4 1\n ((⍳⍨w)=⍳⍴w)/w\n1 2 3 4\n","language":"APL"},{"code":"unique({1, 2, 3, \"a\", \"b\", \"c\", 2, 3, 4, \"b\", \"c\", \"d\"})\n\non unique(x)\n set R to {}\n repeat with i in x\n if i is not in R then set end of R to i's contents\n end repeat\n return R\nend unique\n","language":"AppleScript"},{"code":"{1, 2, 3, {4, 5}} contains {2, 3} --> true\n{1, 2, 3, {4, 5}} contains {4, 5} --> false\n{1, 2, 3, {4, 5}} contains {{4, 5}} --> true\n","language":"AppleScript"},{"code":"3 is in {1, 2, 3, {4, 5}} --> {3} is in {1, 2, 3, {4, 5}} --> true\n","language":"AppleScript"},{"code":"unique({1, 2, 3, \"a\", \"b\", \"c\", 2, 3, 4, \"c\", {b:\"c\"}, {\"c\"}, \"c\", \"d\"})\n\non unique(x)\n set R to {}\n repeat with i in x\n set i to i's contents\n if {i} is not in R then set end of R to i\n end repeat\n return R\nend unique\n","language":"AppleScript"},{"code":"{1, 2, 3, \"a\", \"b\", \"c\", 4, {b:\"c\"}, {\"c\"}, \"d\"}\n","language":"AppleScript"},{"code":"-- CASE-INSENSITIVE UNIQUE ELEMENTS ------------------------------------------\n\n-- nub :: [a] -> [a]\non nub(xs)\n -- Eq :: a -> a -> Bool\n script Eq\n on |λ|(x, y)\n ignoring case\n x = y\n end ignoring\n end |λ|\n end script\n\n nubBy(Eq, xs)\nend nub\n\n\n-- TEST ----------------------------------------------------------------------\non run\n {intercalate(space, ¬\n nub(splitOn(space, \"4 3 2 8 0 1 9 5 1 7 6 3 9 9 4 2 1 5 3 2\"))), ¬\n intercalate(\"\", ¬\n nub(characters of \"abcabc ABCABC\"))}\n\n --> {\"4 3 2 8 0 1 9 5 7 6\", \"abc \"}\nend run\n\n\n-- GENERIC FUNCTIONS ---------------------------------------------------------\n\n-- filter :: (a -> Bool) -> [a] -> [a]\non filter(f, xs)\n tell mReturn(f)\n set lst to {}\n set lng to length of xs\n repeat with i from 1 to lng\n set v to item i of xs\n if |λ|(v, i, xs) then set end of lst to v\n end repeat\n return lst\n end tell\nend filter\n\n-- intercalate :: Text -> [Text] -> Text\non intercalate(strText, lstText)\n set {dlm, my text item delimiters} to {my text item delimiters, strText}\n set strJoined to lstText as text\n set my text item delimiters to dlm\n return strJoined\nend intercalate\n\n-- Lift 2nd class handler function into 1st class script wrapper\n-- mReturn :: Handler -> Script\non mReturn(f)\n if class of f is script then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n\n-- nubBy :: (a -> a -> Bool) -> [a] -> [a]\non nubBy(fnEq, xxs)\n\n set lng to length of xxs\n if lng > 1 then\n set x to item 1 of xxs\n set xs to items 2 thru -1 of xxs\n set p to mReturn(fnEq)\n\n -- notEq :: a -> Bool\n script notEq\n on |λ|(a)\n not (p's |λ|(a, x))\n end |λ|\n end script\n\n {x} & nubBy(fnEq, filter(notEq, xs))\n else\n xxs\n end if\nend nubBy\n\n-- splitOn :: Text -> Text -> [Text]\non splitOn(strDelim, strMain)\n set {dlm, my text item delimiters} to {my text item delimiters, strDelim}\n set lstParts to text items of strMain\n set my text item delimiters to dlm\n return lstParts\nend splitOn\n","language":"AppleScript"},{"code":"{\"4 3 2 8 0 1 9 5 7 6\", \"abc \"}\n","language":"AppleScript"},{"code":"use AppleScript version \"2.4\" -- OS X 10.10 (Yosemite) or later\nuse framework \"Foundation\"\n\nset aList to {1, 2, 3, \"a\", \"b\", \"c\", 2, 3, 4, \"c\", {b:\"c\"}, {\"c\"}, \"c\", \"d\"}\nset orderedSet to current application's class \"NSOrderedSet\"'s orderedSetWithArray:(aList)\nreturn orderedSet's array() as list\n","language":"AppleScript"},{"code":"{1, 2, 3, \"a\", \"b\", \"c\", 4, {b:\"c\"}, {\"c\"}, \"d\"}\n","language":"AppleScript"},{"code":"100 DIM L$(15)\n110 L$(0) = \"NOW\"\n120 L$(1) = \"IS\"\n130 L$(2) = \"THE\"\n140 L$(3) = \"TIME\"\n150 L$(4) = \"FOR\"\n160 L$(5) = \"ALL\"\n170 L$(6) = \"GOOD\"\n180 L$(7) = \"MEN\"\n190 L$(8) = \"TO\"\n200 L$(9) = \"COME\"\n210 L$(10) = \"TO\"\n220 L$(11) = \"THE\"\n230 L$(12) = \"AID\"\n240 L$(13) = \"OF\"\n250 L$(14) = \"THE\"\n260 L$(15) = \"PARTY.\"\n\n300 N = 15\n310 GOSUB 400\n320 FOR I = 0 TO N\n330 PRINT L$(I) \" \" ;\n340 NEXT\n350 PRINT\n360 END\n\n400 REMREMOVE DUPLICATES\n410 FOR I = N TO 1 STEP -1\n420 I$ = L$(I)\n430 FOR J = 0 TO I - 1\n440 EQ = I$ = L$(J)\n450 IF NOT EQ THEN NEXT J\n460 IF EQ THEN GOSUB 500\n470 NEXT I\n480 RETURN\n\n500 REMREMOVE ELEMENT\n510 L$(I) = L$(N)\n520 L$(N) = \"\"\n530 N = N - 1\n540 RETURN\n","language":"Applesoft-BASIC"},{"code":"arr: [1 2 3 2 1 2 3 4 5 3 2 1]\n\nprint unique arr\n","language":"Arturo"},{"code":"(* Remove duplicate elements.\n\n This implementation is for elements that have an \"equals\" (or\n \"equivalence\") predicate. It runs O(n*n) in the number of\n elements. *)\n\n#include \"share/atspre_staload.hats\"\n\n(* How the remove_dups template function will be called. *)\nextern fn {a : t@ype}\nremove_dups\n {n : int}\n (eq : (a, a) -<cloref> bool,\n src : arrayref (a, n),\n n : size_t n,\n dst : arrayref (a, n),\n m : &size_t? >> size_t m)\n :<!refwrt> #[m : nat | m <= n]\n void\n\n(* An implementation of the remove_dups template function. *)\nimplement {a}\nremove_dups {n} (eq, src, n, dst, m) =\n if n = i2sz 0 then\n m := i2sz 0\n else\n let\n fun\n peruse_src\n {i : int | 1 <= i; i <= n}\n {j : int | 1 <= j; j <= i}\n .<n - i>.\n (i : size_t i,\n j : size_t j)\n :<!refwrt> [m : int | 1 <= m; m <= n]\n size_t m =\n let\n fun\n already_seen\n {k : int | 0 <= k; k <= j}\n .<j - k>.\n (x : a,\n k : size_t k)\n :<!ref> bool =\n if k = j then\n false\n else if eq (x, dst[k]) then\n true\n else\n already_seen (x, succ k)\n in\n if i = n then\n j\n else if already_seen (src[i], i2sz 0) then\n peruse_src (succ i, j)\n else\n begin\n dst[j] := src[i];\n peruse_src (succ i, succ j)\n end\n end\n\n prval () = lemma_arrayref_param src (* Prove 0 <= n. *)\n in\n dst[0] := src[0];\n m := peruse_src (i2sz 1, i2sz 1)\n end\n\nimplement (* A demonstration with strings. *)\nmain0 () =\n let\n val eq = lam (x : string, y : string) : bool =<cloref> (x = y)\n\n val src =\n arrayref_make_list<string>\n (10, $list (\"a\", \"c\", \"b\", \"e\", \"a\",\n \"a\", \"d\", \"d\", \"b\", \"c\"))\n val dst = arrayref_make_elt<string> (i2sz 10, \"?\")\n var m : size_t\n in\n remove_dups<string> (eq, src, i2sz 10, dst, m);\n let\n prval [m : int] EQINT () = eqint_make_guint m\n var i : natLte m\n in\n for (i := 0; i2sz i <> m; i := succ i)\n print! (\" \", dst[i] : string);\n println! ()\n end\n end\n","language":"ATS"},{"code":"(* Remove duplicate elements.\n\n This implementation is for elements that have an \"equals\" (or\n \"equivalence\") predicate. It runs O(n*n) in the number of\n elements. It uses a linked list and supports linear types.\n\n The equality predicate is implemented as a template function. *)\n\n#include \"share/atspre_staload.hats\"\nstaload UN = \"prelude/SATS/unsafe.sats\"\n\n#define NIL list_vt_nil ()\n#define :: list_vt_cons\n\n(*------------------------------------------------------------------*)\n(* Interfaces *)\n\nextern fn {a : vt@ype}\narray_remove_dups\n {n : int}\n {p_arr : addr}\n (pf_arr : array_v (a, p_arr, n) |\n p_arr : ptr p_arr,\n n : size_t n)\n :<!wrt> [m : nat | m <= n]\n @(array_v (a, p_arr, m),\n array_v (a?, p_arr + (m * sizeof a), n - m) |\n size_t m)\n\nextern fn {a : vt@ype}\nlist_vt_remove_dups\n {n : int}\n (lst : list_vt (a, n))\n :<!wrt> [m : nat | m <= n]\n list_vt (a, m)\n\nextern fn {a : vt@ype}\nremove_dups$eq :\n (&a, &a) -<> bool\n\nextern fn {a : vt@ype}\nremove_dups$clear :\n (&a >> a?) -< !wrt > void\n\n(*------------------------------------------------------------------*)\n(* Implementation of array_remove_dups *)\n\n(* The implementation for arrays converts to a list_vt, does the\n removal duplicates, and then writes the data back into the original\n array. *)\nimplement {a}\narray_remove_dups {n} {p_arr} (pf_arr | p_arr, n) =\n let\n var lst = array_copy_to_list_vt<a> (!p_arr, n)\n var m : int\n val lst = list_vt_remove_dups<a> lst\n val m = list_vt_length lst\n prval [m : int] EQINT () = eqint_make_gint m\n prval @(pf_uniq, pf_rest) =\n array_v_split {a?} {p_arr} {n} {m} pf_arr\n val () = array_copy_from_list_vt<a> (!p_arr, lst)\n in\n @(pf_uniq, pf_rest | i2sz m)\n end\n\n(*------------------------------------------------------------------*)\n(* Implementation of list_vt_remove_dups *)\n\n(* The list is worked on \"in place\". That is, no nodes are copied or\n moved to new locations, except those that are removed and freed. *)\n\nfn {a : vt@ype}\nremove_equal_elements\n {n : int}\n (x : &a,\n lst : &list_vt (a, n) >> list_vt (a, m))\n :<!wrt> #[m : nat | m <= n]\n void =\n let\n fun {a : vt@ype}\n remove_elements\n {n : nat}\n .<n>.\n (x : &a,\n lst : &list_vt (a, n) >> list_vt (a, m))\n :<!wrt> #[m : nat | m <= n]\n void =\n case+ lst of\n | NIL => ()\n | @ (head :: tail) =>\n if remove_dups$eq (head, x) then\n let\n val new_lst = tail\n val () = remove_dups$clear<a> head\n val () = free@{a}{0} lst\n val () = lst := new_lst\n in\n remove_elements {n - 1} (x, lst)\n end\n else\n let\n val () = remove_elements {n - 1} (x, tail)\n prval () = fold@ lst\n in\n end\n\n prval () = lemma_list_vt_param lst\n in\n remove_elements {n} (x, lst)\n end\n\nfn {a : vt@ype}\nremove_dups\n {n : int}\n (lst : &list_vt (a, n) >> list_vt (a, m))\n :<!wrt> #[m : nat | m <= n]\n void =\n let\n fun\n rmv_dups {n : nat}\n .<n>.\n (lst : &list_vt (a, n) >> list_vt (a, m))\n :<!wrt> #[m : nat | m <= n]\n void =\n case+ lst of\n | NIL => ()\n | head :: NIL => ()\n | @ head :: tail =>\n let\n val () = remove_equal_elements (head, tail)\n val () = rmv_dups tail\n prval () = fold@ lst\n in\n end\n\n prval () = lemma_list_vt_param lst\n in\n rmv_dups {n} lst\n end\n\nimplement {a}\nlist_vt_remove_dups {n} lst =\n let\n var lst = lst\n in\n remove_dups {n} lst;\n lst\n end\n\n(*------------------------------------------------------------------*)\n\nimplement\nremove_dups$eq<Strptr1> (s, t) =\n ($UN.strptr2string s = $UN.strptr2string t)\n\nimplement\nremove_dups$clear<Strptr1> s =\n strptr_free s\n\nimplement\narray_uninitize$clear<Strptr1> (i, s) =\n strptr_free s\n\nimplement\nfprint_ref<Strptr1> (outf, s) =\n fprint! (outf, $UN.strptr2string s)\n\nimplement (* A demonstration with linear strings. *)\nmain0 () =\n let\n #define N 10\n\n val data =\n $list_vt{Strptr1}\n (string0_copy \"a\", string0_copy \"c\", string0_copy \"b\",\n string0_copy \"e\", string0_copy \"a\", string0_copy \"a\",\n string0_copy \"d\", string0_copy \"d\", string0_copy \"b\",\n string0_copy \"c\")\n var arr : @[Strptr1][N]\n val () = array_copy_from_list_vt<Strptr1> (arr, data)\n\n prval pf_arr = view@ arr\n val p_arr = addr@ arr\n\n val [m : int]\n @(pf_uniq, pf_abandoned | m) =\n array_remove_dups<Strptr1> (pf_arr | p_arr, i2sz N)\n\n val () = fprint_array_sep<Strptr1> (stdout_ref, !p_arr, m, \" \")\n val () = println! ()\n\n val () = array_uninitize<Strptr1> (!p_arr, m)\n prval () = view@ arr :=\n array_v_unsplit (pf_uniq, pf_abandoned)\n in\n end\n\n(*------------------------------------------------------------------*)\n","language":"ATS"},{"code":"(* Remove duplicate elements.\n\n The elements are sorted and then only unique values are kept. *)\n\n\n#include \"share/atspre_staload.hats\"\n\n(* How the remove_dups template function will be called. *)\nextern fn {a : t@ype}\nremove_dups\n {n : int}\n (lt : (a, a) -<cloref> bool, (* \"less than\" *)\n eq : (a, a) -<cloref> bool, (* \"equals\" *)\n src : arrayref (a, n),\n n : size_t n,\n dst : arrayref (a, n),\n m : &size_t? >> size_t m)\n : #[m : nat | m <= n]\n void\n\nimplement {a}\nremove_dups {n} (lt, eq, src, n, dst, m) =\n if n = i2sz 0 then\n m := i2sz 0\n else\n let\n prval () = lemma_arrayref_param src (* Prove 0 <= n. *)\n\n (* Sort a copy of src. *)\n val arr = arrayptr_refize (arrayref_copy (src, n))\n implement array_quicksort$cmp<a> (x, y) =\n if x \\lt y then ~1 else 1\n val () = arrayref_quicksort<a> (arr, n)\n\n (* Copy only the first element of each run of equal elements. *)\n val () = dst[0] := arr[0]\n fun\n loop {i : int | 1 <= i; i <= n}\n {j : int | 1 <= j; j <= i}\n .<n - i>.\n (i : size_t i,\n j : size_t j)\n : [m : int | 1 <= m; m <= n]\n size_t m =\n if i = n then\n j\n else if arr[pred i] \\eq arr[i] then\n loop (succ i, j)\n else\n begin\n dst[j] := arr[i];\n loop (succ i, succ j)\n end\n val () = m := loop (i2sz 1, i2sz 1)\n in\n end\n\nimplement (* A demonstration. *)\nmain0 () =\n let\n val src =\n arrayref_make_list<string>\n (10, $list (\"a\", \"c\", \"b\", \"e\", \"a\",\n \"a\", \"d\", \"d\", \"b\", \"c\"))\n val dst = arrayref_make_elt<string> (i2sz 10, \"?\")\n var m : size_t\n in\n remove_dups<string> (lam (x, y) => x < y,\n lam (x, y) => x = y,\n src, i2sz 10, dst, m);\n let\n prval [m : int] EQINT () = eqint_make_guint m\n var i : natLte m\n in\n for (i := 0; i2sz i <> m; i := succ i)\n print! (\" \", dst[i]);\n println! ()\n end\n end\n","language":"ATS"},{"code":"(* Remove duplicate elements.\n\n The best sorting algorithms, it is said, are O(n log n) and require\n an order predicate.\n\n But this is true only for a general sorting routine. A radix sort\n for fixed-size integers is O(n), and requires no order predicate.\n Here I use such a radix sort. *)\n\n#include \"share/atspre_staload.hats\"\nstaload UN = \"prelude/SATS/unsafe.sats\"\n\n(* How the remove_dups template function will be called. *)\nextern fn {tk : tkind}\nremove_dups\n {n : int}\n (src : arrayref (g0uint tk, n),\n n : size_t n,\n dst : arrayref (g0uint tk, n),\n m : &size_t? >> size_t m)\n : #[m : nat | m <= n]\n void\n\n(*------------------------------------------------------------------*)\n(* A radix sort for unsigned integers, copied from my contribution to\n the radix sort task. *)\n\nextern fn {a : vt@ype}\n {tk : tkind}\ng0uint_radix_sort\n {n : int}\n (arr : &array (a, n) >> _,\n n : size_t n)\n :<!wrt> void\n\nextern fn {a : vt@ype}\n {tk : tkind}\ng0uint_radix_sort$key\n {n : int}\n {i : nat | i < n}\n (arr : &RD(array (a, n)),\n i : size_t i)\n :<> g0uint tk\n\nfn {}\nbin_sizes_to_indices\n (bin_indices : &array (size_t, 256) >> _)\n :<!wrt> void =\n let\n fun\n loop {i : int | i <= 256}\n {accum : int}\n .<256 - i>.\n (bin_indices : &array (size_t, 256) >> _,\n i : size_t i,\n accum : size_t accum)\n :<!wrt> void =\n if i <> i2sz 256 then\n let\n prval () = lemma_g1uint_param i\n val elem = bin_indices[i]\n in\n if elem = i2sz 0 then\n loop (bin_indices, succ i, accum)\n else\n begin\n bin_indices[i] := accum;\n loop (bin_indices, succ i, accum + g1ofg0 elem)\n end\n end\n in\n loop (bin_indices, i2sz 0, i2sz 0)\n end\n\nfn {a : vt@ype}\n {tk : tkind}\ncount_entries\n {n : int}\n {shift : nat}\n (arr : &RD(array (a, n)),\n n : size_t n,\n bin_indices : &array (size_t?, 256)\n >> array (size_t, 256),\n all_expended : &bool? >> bool,\n shift : int shift)\n :<!wrt> void =\n let\n fun\n loop {i : int | i <= n}\n .<n - i>.\n (arr : &RD(array (a, n)),\n bin_indices : &array (size_t, 256) >> _,\n all_expended : &bool >> bool,\n i : size_t i)\n :<!wrt> void =\n if i <> n then\n let\n prval () = lemma_g1uint_param i\n val key : g0uint tk = g0uint_radix_sort$key<a><tk> (arr, i)\n val key_shifted = key >> shift\n val digit = ($UN.cast{uint} key_shifted) land 255U\n val [digit : int] digit = g1ofg0 digit\n extern praxi set_range :\n () -<prf> [0 <= digit; digit <= 255] void\n prval () = set_range ()\n val count = bin_indices[digit]\n val () = bin_indices[digit] := succ count\n in\n all_expended := all_expended * iseqz key_shifted;\n loop (arr, bin_indices, all_expended, succ i)\n end\n\n prval () = lemma_array_param arr\n in\n array_initize_elt<size_t> (bin_indices, i2sz 256, i2sz 0);\n all_expended := true;\n loop (arr, bin_indices, all_expended, i2sz 0)\n end\n\nfn {a : vt@ype}\n {tk : tkind}\nsort_by_digit\n {n : int}\n {shift : nat}\n (arr1 : &RD(array (a, n)),\n arr2 : &array (a, n) >> _,\n n : size_t n,\n all_expended : &bool? >> bool,\n shift : int shift)\n :<!wrt> void =\n let\n var bin_indices : array (size_t, 256)\n in\n count_entries<a><tk> (arr1, n, bin_indices, all_expended, shift);\n if all_expended then\n ()\n else\n let\n fun\n rearrange {i : int | i <= n}\n .<n - i>.\n (arr1 : &RD(array (a, n)),\n arr2 : &array (a, n) >> _,\n bin_indices : &array (size_t, 256) >> _,\n i : size_t i)\n :<!wrt> void =\n if i <> n then\n let\n prval () = lemma_g1uint_param i\n val key = g0uint_radix_sort$key<a><tk> (arr1, i)\n val key_shifted = key >> shift\n val digit = ($UN.cast{uint} key_shifted) land 255U\n val [digit : int] digit = g1ofg0 digit\n extern praxi set_range :\n () -<prf> [0 <= digit; digit <= 255] void\n prval () = set_range ()\n val [j : int] j = g1ofg0 bin_indices[digit]\n\n (* One might wish to get rid of this assertion somehow,\n to eliminate the branch, should it prove a\n problem. *)\n val () = $effmask_exn assertloc (j < n)\n\n val p_dst = ptr_add<a> (addr@ arr2, j)\n and p_src = ptr_add<a> (addr@ arr1, i)\n val _ = $extfcall (ptr, \"memcpy\", p_dst, p_src,\n sizeof<a>)\n val () = bin_indices[digit] := succ (g0ofg1 j)\n in\n rearrange (arr1, arr2, bin_indices, succ i)\n end\n\n prval () = lemma_array_param arr1\n in\n bin_sizes_to_indices<> bin_indices;\n rearrange (arr1, arr2, bin_indices, i2sz 0)\n end\n end\n\nfn {a : vt@ype}\n {tk : tkind}\ng0uint_sort {n : pos}\n (arr1 : &array (a, n) >> _,\n arr2 : &array (a, n) >> _,\n n : size_t n)\n :<!wrt> void =\n let\n fun\n loop {idigit_max, idigit : nat | idigit <= idigit_max}\n .<idigit_max - idigit>.\n (arr1 : &array (a, n) >> _,\n arr2 : &array (a, n) >> _,\n from1to2 : bool,\n idigit_max : int idigit_max,\n idigit : int idigit)\n :<!wrt> void =\n if idigit = idigit_max then\n begin\n if ~from1to2 then\n let\n val _ =\n $extfcall (ptr, \"memcpy\", addr@ arr1, addr@ arr2,\n sizeof<a> * n)\n in\n end\n end\n else if from1to2 then\n let\n var all_expended : bool\n in\n sort_by_digit<a><tk> (arr1, arr2, n, all_expended,\n 8 * idigit);\n if all_expended then\n ()\n else\n loop (arr1, arr2, false, idigit_max, succ idigit)\n end\n else\n let\n var all_expended : bool\n in\n sort_by_digit<a><tk> (arr2, arr1, n, all_expended,\n 8 * idigit);\n if all_expended then\n let\n val _ =\n $extfcall (ptr, \"memcpy\", addr@ arr1, addr@ arr2,\n sizeof<a> * n)\n in\n end\n else\n loop (arr1, arr2, true, idigit_max, succ idigit)\n end\n in\n loop (arr1, arr2, true, sz2i sizeof<g1uint tk>, 0)\n end\n\n#define SIZE_THRESHOLD 256\n\nextern praxi\nunsafe_cast_array\n {a : vt@ype}\n {b : vt@ype}\n {n : int}\n (arr : &array (b, n) >> array (a, n))\n :<prf> void\n\nimplement {a} {tk}\ng0uint_radix_sort {n} (arr, n) =\n if n <> 0 then\n let\n prval () = lemma_array_param arr\n\n fn\n sort {n : pos}\n (arr1 : &array (a, n) >> _,\n arr2 : &array (a, n) >> _,\n n : size_t n)\n :<!wrt> void =\n g0uint_sort<a><tk> (arr1, arr2, n)\n in\n if n <= SIZE_THRESHOLD then\n let\n var arr2 : array (a, SIZE_THRESHOLD)\n prval @(pf_left, pf_right) =\n array_v_split {a?} {..} {SIZE_THRESHOLD} {n} (view@ arr2)\n prval () = view@ arr2 := pf_left\n prval () = unsafe_cast_array{a} arr2\n\n val () = sort (arr, arr2, n)\n\n prval () = unsafe_cast_array{a?} arr2\n prval () = view@ arr2 :=\n array_v_unsplit (view@ arr2, pf_right)\n in\n end\n else\n let\n val @(pf_arr2, pfgc_arr2 | p_arr2) = array_ptr_alloc<a> n\n macdef arr2 = !p_arr2\n prval () = unsafe_cast_array{a} arr2\n\n val () = sort (arr, arr2, n)\n\n prval () = unsafe_cast_array{a?} arr2\n val () = array_ptr_free (pf_arr2, pfgc_arr2 | p_arr2)\n in\n end\n end\n\n(*------------------------------------------------------------------*)\n(* An implementation of the remove_dups template function, which also\n sorts the elements. *)\n\nimplement {tk}\nremove_dups {n} (src, n, dst, m) =\n if n = i2sz 0 then\n m := i2sz 0\n else\n let\n prval () = lemma_arrayref_param src (* Prove 0 <= n. *)\n\n (* Sort a copy of src. *)\n val arrptr = arrayref_copy (src, n)\n val @(pf_arr | p_arr) = arrayptr_takeout_viewptr arrptr\n val () = g0uint_radix_sort<g0uint tk><tk> (!p_arr, n)\n prval () = arrayptr_addback (pf_arr | arrptr)\n\n (* Copy only the first element of each run of equals. *)\n val () = dst[0] := arrptr[0]\n fun\n loop {i : int | 1 <= i; i <= n}\n {j : int | 1 <= j; j <= i}\n .<n - i>.\n (arrptr : !arrayptr (g0uint tk, n),\n i : size_t i,\n j : size_t j)\n : [m : int | 1 <= m; m <= n]\n size_t m =\n if i = n then\n j\n else if arrptr[pred i] = arrptr[i] then\n loop (arrptr, succ i, j)\n else\n begin\n dst[j] := arrptr[i];\n loop (arrptr, succ i, succ j)\n end\n val () = m := loop (arrptr, i2sz 1, i2sz 1)\n\n val () = arrayptr_free arrptr\n in\n end\n\n(*------------------------------------------------------------------*)\n(* A demonstration. *)\n\nimplement\nmain0 () =\n let\n implement\n g0uint_radix_sort$key<uint><uintknd> (arr, i) =\n arr[i]\n\n val src =\n arrayref_make_list<uint>\n (10, $list (1U, 3U, 2U, 5U, 1U, 1U, 4U, 4U, 2U, 3U))\n\n val dst = arrayref_make_elt<uint> (i2sz 10, 123456789U)\n var m : size_t\n in\n remove_dups<uintknd> (src, i2sz 10, dst, m);\n let\n prval [m : int] EQINT () = eqint_make_guint m\n var i : natLte m\n in\n for (i := 0; i2sz i <> m; i := succ i)\n print! (\" \", dst[i]);\n println! ()\n end\n end\n\n(*------------------------------------------------------------------*)\n","language":"ATS"},{"code":"(* Remove duplicate elements.\n\n Elements already seen are put into a hash table. *)\n\n#include \"share/atspre_staload.hats\"\n\n(* Use hash tables from the libats/ML library. *)\nstaload \"libats/ML/SATS/hashtblref.sats\"\nstaload _ = \"libats/ML/DATS/hashtblref.dats\"\nstaload _ = \"libats/DATS/hashfun.dats\"\nstaload _ = \"libats/DATS/hashtbl_chain.dats\"\nstaload _ = \"libats/DATS/linmap_list.dats\"\n\n(* How the remove_dups template function will be called. *)\nextern fn {key, a : t@ype}\nremove_dups\n {n : int}\n (key : a -<cloref> key,\n src : arrayref (a, n),\n n : size_t n,\n dst : arrayref (a, n),\n m : &size_t? >> size_t m)\n : #[m : nat | m <= n]\n void\n\nimplement {key, a}\nremove_dups {n} (key, src, n, dst, m) =\n if n = i2sz 0 then\n m := i2sz 0\n else\n let\n prval () = lemma_arrayref_param src (* Prove 0 <= n. *)\n\n fun\n loop {i : nat | i <= n}\n {j : nat | j <= i}\n .<n - i>.\n (ht : hashtbl (key, a),\n i : size_t i,\n j : size_t j)\n : [m : nat | m <= n]\n size_t m =\n if i = n then\n j\n else\n let\n val x = src[i]\n val k = key x\n in\n case+ hashtbl_search<key, a> (ht, k) of\n | ~ None_vt () =>\n begin (* An element not yet encountered. Copy it. *)\n hashtbl_insert_any<key, a> (ht, k, x);\n dst[j] := x;\n loop (ht, succ i, succ j)\n end\n | ~ Some_vt _ =>\n begin (* An element already encountered. Skip it. *)\n loop (ht, succ i, j)\n end\n end;\n in\n m := loop (hashtbl_make_nil<key, a> (i2sz 1024),\n i2sz 0, i2sz 0)\n end\n\nimplement (* A demonstration. *)\nmain0 () =\n let\n val src =\n arrayref_make_list<string>\n (10, $list (\"a\", \"c\", \"b\", \"e\", \"a\",\n \"a\", \"d\", \"d\", \"b\", \"c\"))\n val dst = arrayref_make_elt<string> (i2sz 10, \"?\")\n var m : size_t\n in\n remove_dups<string, string> (lam s => s, src, i2sz 10, dst, m);\n let\n prval [m : int] EQINT () = eqint_make_guint m\n var i : natLte m\n in\n for (i := 0; i2sz i <> m; i := succ i)\n print! (\" \", dst[i]);\n println! ()\n end\n end\n","language":"ATS"},{"code":"(* Remove duplicate elements.\n\n This implementation is for elements that contain a \"this has been\n seen\" flag. It is O(n) in the number of elements.\n\n Also, this implementation demonstrates that imperative programming,\n without dependent types or proofs, is possible in ATS. *)\n\n#include \"share/atspre_staload.hats\"\n\n(* A tuple in the heap. *)\ntypedef seen_or_not (a : t@ype+) = '(a, ref bool)\n\n(* How the remove_dups function will be called. *)\nextern fn {a : t@ype}\nremove_dups\n (given_data : arrszref (seen_or_not a),\n space_for_result : arrszref (seen_or_not a),\n num_of_unique_elems : &size_t? >> size_t)\n : void\n\nimplement {a}\nremove_dups (given_data, space_for_result, num_of_unique_elems) =\n let\n macdef seen (i) = given_data[,(i)].1\n\n var i : size_t\n var j : size_t\n in\n (* Clear all the \"seen\" flags. *)\n for (i := i2sz 0; i <> size given_data; i := succ i)\n !(seen i) := false;\n\n (* Loop through given_data, copying (pointers to) any values that\n have not yet been seen. *)\n j := i2sz 0;\n for (i := i2sz 0; i <> size given_data; i := succ i)\n if !(seen i) then\n () (* Skip any element that has already been seen. *)\n else\n begin\n !(seen i) := true; (* Mark the element as seen. *)\n space_for_result[j] := given_data[i];\n j := succ j\n end;\n\n num_of_unique_elems := j\n end\n\nimplement (* A demonstration. *)\nmain0 () =\n let\n (* Define some values. *)\n val a = '(\"a\", ref<bool> false)\n val b = '(\"b\", ref<bool> false)\n val c = '(\"c\", ref<bool> false)\n val d = '(\"d\", ref<bool> false)\n val e = '(\"e\", ref<bool> false)\n\n (* Fill an array with values. *)\n val data =\n arrszref_make_list ($list (a, c, b, e, a, a, d, d, b, c))\n\n (* Allocate storage for the result. *)\n val unique_elems = arrszref_make_elt (i2sz 10, a)\n var num_of_unique_elems : size_t\n\n var i : size_t\n in\n (* Remove duplicates. *)\n remove_dups<string> (data, unique_elems, num_of_unique_elems);\n\n (* Print the results. *)\n for (i := i2sz 0; i <> num_of_unique_elems; i := succ i)\n print! (\" \", unique_elems[i].0);\n println! ()\n end\n","language":"ATS"},{"code":"a = 1,2,1,4,5,2,15,1,3,4\nSort, a, a, NUD`,\nMsgBox % a ; 1,2,3,4,5,15\n","language":"AutoHotkey"},{"code":"$ awk 'BEGIN{split(\"a b c d c b a\",a);for(i in a)b[a[i]]=1;r=\"\";for(i in b)r=r\" \"i;print r}'\na b c d\n","language":"AWK"},{"code":"arraybase 1\nmax = 10\ndim res(max)\ndim dat(max)\ndat[1] = 1: dat[2] = 2: dat[3] = 1: dat[4] = 4: dat[5] = 5\ndat[6] = 2: dat[7] = 15: dat[8] = 1: dat[9] = 3: dat[10] = 4\nres[1] = dat[1]\n\ncont = 1\nposic = 1\nwhile posic < max\n\tposic += 1\n\tesnuevo = 1\n\tindice = 1\n\twhile indice <= cont and esnuevo = 1\n\t\tif dat[posic] = res[indice] then esnuevo = 0\n\t\tindice += 1\n\tend while\n\tif esnuevo = 1 then\n\t\tcont += 1\n\t\tres[cont] = dat[posic]\n\tend if\nend while\n\nfor i = 1 to cont\n\tprint res[i]; \" \";\nnext i\nend\n","language":"BASIC256"},{"code":" DIM list$(15)\n list$() = \"Now\", \"is\", \"the\", \"time\", \"for\", \"all\", \"good\", \"men\", \\\n \\ \"to\", \"come\", \"to\", \"the\", \"aid\", \"of\", \"the\", \"party.\"\n num% = FNremoveduplicates(list$())\n FOR i% = 0 TO num%-1\n PRINT list$(i%) \" \" ;\n NEXT\n PRINT\n END\n\n DEF FNremoveduplicates(l$())\n LOCAL i%, j%, n%, i$\n n% = 1\n FOR i% = 1 TO DIM(l$(), 1)\n i$ = l$(i%)\n FOR j% = 0 TO i%-1\n IF i$ = l$(j%) EXIT FOR\n NEXT\n IF j%>=i% l$(n%) = i$ : n% += 1\n NEXT\n = n%\n","language":"BBC-BASIC"},{"code":"⍷ 2‿4‿9‿7‿3‿7‿4‿1‿9‿2‿5‿7‿2‿2‿8‿9‿6‿6‿5‿8\n","language":"BQN"},{"code":"2 3 5 7 11 13 17 19 cats 222 (-100.2) \"+11\" (1.1) \"+7\" (7.) 7 5 5 3 2 0 (4.4) 2:?LIST\n\n(A=\n ( Hashing\n = h elm list\n . new$hash:?h\n & whl\n ' ( !arg:%?elm ?arg\n & ( (h..find)$str$!elm\n | (h..insert)$(str$!elm.!elm)\n )\n )\n & :?list\n & (h..forall)\n $ (\n = .!arg:(?.?arg)&!arg !list:?list\n )\n & !list\n )\n& put$(\"Solution A:\" Hashing$!LIST \\n,LIN)\n);\n\n(B=\n ( backtracking\n = answr elm\n . :?answr\n & !arg\n : ?\n ( %?`elm\n ?\n ( !elm ?\n | &!answr !elm:?answr\n )\n & ~\n )\n | !answr\n )\n& put$(\"Solution B:\" backtracking$!LIST \\n,LIN)\n);\n\n(C=\n ( summing\n = sum car LIST\n . !arg:?LIST\n & 0:?sum\n & whl\n ' ( !LIST:%?car ?LIST\n & (.!car)+!sum:?sum\n )\n & whl\n ' ( !sum:#*(.?el)+?sum\n & !el !LIST:?LIST\n )\n & !LIST\n )\n& put$(\"Solution C:\" summing$!LIST \\n,LIN)\n);\n\n( !A\n& !B\n& !C\n&\n)\n","language":"Bracmat"},{"code":"some_array = [1 1 2 1 'redundant' [1 2 3] [1 2 3] 'redundant']\n\nunique_array = some_array.unique\n","language":"Brat"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n\nstruct list_node {int x; struct list_node *next;};\ntypedef struct list_node node;\n\nnode * uniq(int *a, unsigned alen)\n {if (alen == 0) return NULL;\n node *start = malloc(sizeof(node));\n if (start == NULL) exit(EXIT_FAILURE);\n start->x = a[0];\n start->next = NULL;\n\n for (int i = 1 ; i < alen ; ++i)\n {node *n = start;\n for (;; n = n->next)\n {if (a[i] == n->x) break;\n if (n->next == NULL)\n {n->next = malloc(sizeof(node));\n n = n->next;\n if (n == NULL) exit(EXIT_FAILURE);\n n->x = a[i];\n n->next = NULL;\n break;}}}\n\n return start;}\n\nint main(void)\n {int a[] = {1, 2, 1, 4, 5, 2, 15, 1, 3, 4};\n for (node *n = uniq(a, 10) ; n != NULL ; n = n->next)\n printf(\"%d \", n->x);\n puts(\"\");\n return 0;}\n","language":"C"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <stdbool.h>\n#include <string.h>\n\n/* Returns `true' if element `e' is in array `a'. Otherwise, returns `false'.\n * Checks only the first `n' elements. Pure, O(n).\n */\nbool elem(int *a, size_t n, int e)\n{\n for (size_t i = 0; i < n; ++i)\n if (a[i] == e)\n return true;\n\n return false;\n}\n\n/* Removes the duplicates in array `a' of given length `n'. Returns the number\n * of unique elements. In-place, order preserving, O(n ^ 2).\n */\nsize_t nub(int *a, size_t n)\n{\n size_t m = 0;\n\n for (size_t i = 0; i < n; ++i)\n if (!elem(a, m, a[i]))\n a[m++] = a[i];\n\n return m;\n}\n\n/* Out-place version of `nub'. Pure, order preserving, alloc < n * sizeof(int)\n * bytes, O(n ^ 2).\n */\nsize_t nub_new(int **b, int *a, size_t n)\n{\n int *c = malloc(n * sizeof(int));\n memcpy(c, a, n * sizeof(int));\n int m = nub(c, n);\n *b = malloc(m * sizeof(int));\n memcpy(*b, c, m * sizeof(int));\n free(c);\n return m;\n}\n\nint main(void)\n{\n int a[] = {1, 2, 1, 4, 5, 2, 15, 1, 3, 4};\n int *b;\n\n size_t n = nub_new(&b, a, sizeof(a) / sizeof(a[0]));\n\n for (size_t i = 0; i < n; ++i)\n printf(\"%d \", b[i]);\n puts(\"\");\n\n free(b);\n return 0;\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n\nint icmp(const void *a, const void *b)\n{\n#define _I(x) *(const int*)x\n\treturn _I(a) < _I(b) ? -1 : _I(a) > _I(b);\n#undef _I\n}\n\n/* filter items in place and return number of uniques. if a separate\n list is desired, duplicate it before calling this function */\nint uniq(int *a, int len)\n{\n\tint i, j;\n\tqsort(a, len, sizeof(int), icmp);\n\tfor (i = j = 0; i < len; i++)\n\t\tif (a[i] != a[j]) a[++j] = a[i];\n\treturn j + 1;\n}\n\nint main()\n{\n\tint x[] = {1, 2, 1, 4, 5, 2, 15, 1, 3, 4};\n\tint i, len = uniq(x, sizeof(x) / sizeof(x[0]));\n\tfor (i = 0; i < len; i++) printf(\"%d\\n\", x[i]);\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <set>\n#include <iostream>\nusing namespace std;\n\nint main() {\n typedef set<int> TySet;\n int data[] = {1, 2, 3, 2, 3, 4};\n\n TySet unique_set(data, data + 6);\n\n cout << \"Set items:\" << endl;\n for (TySet::iterator iter = unique_set.begin(); iter != unique_set.end(); iter++)\n cout << *iter << \" \";\n cout << endl;\n}\n","language":"C++"},{"code":"#include <ext/hash_set>\n#include <iostream>\nusing namespace std;\n\nint main() {\n typedef __gnu_cxx::hash_set<int> TyHash;\n int data[] = {1, 2, 3, 2, 3, 4};\n\n TyHash unique_set(data, data + 6);\n\n cout << \"Set items:\" << endl;\n for (TyHash::iterator iter = unique_set.begin(); iter != unique_set.end(); iter++)\n cout << *iter << \" \";\n cout << endl;\n}\n","language":"C++"},{"code":"#include <tr1/unordered_set>\n#include <iostream>\nusing namespace std;\n\nint main() {\n typedef tr1::unordered_set<int> TyHash;\n int data[] = {1, 2, 3, 2, 3, 4};\n\n TyHash unique_set(data, data + 6);\n\n cout << \"Set items:\" << endl;\n for (TyHash::iterator iter = unique_set.begin(); iter != unique_set.end(); iter++)\n cout << *iter << \" \";\n cout << endl;\n}\n","language":"C++"},{"code":"#include <iostream>\n#include <iterator>\n#include <algorithm>\n\n// helper template\ntemplate<typename T> T* end(T (&array)[size]) { return array+size; }\n\nint main()\n{\n int data[] = { 1, 2, 3, 2, 3, 4 };\n std::sort(data, end(data));\n int* new_end = std::unique(data, end(data));\n std::copy(data, new_end, std::ostream_iterator<int>(std::cout, \" \");\n std::cout << std::endl;\n}\n","language":"C++"},{"code":"#include <algorithm>\n#include <iostream>\n#include <vector>\n\nint main() {\n std::vector<int> data = {1, 2, 3, 2, 3, 4};\n\n std::sort(data.begin(), data.end());\n data.erase(std::unique(data.begin(), data.end()), data.end());\n\n for(int& i: data) std::cout << i << \" \";\n std::cout << std::endl;\n return 0;\n}\n","language":"C++"},{"code":"int[] nums = { 1, 1, 2, 3, 4, 4 };\nList<int> unique = new List<int>();\nforeach (int n in nums)\n if (!unique.Contains(n))\n unique.Add(n);\n","language":"C-sharp"},{"code":"int[] nums = {1, 1, 2, 3, 4, 4};\nint[] unique = nums.Distinct().ToArray();\n","language":"C-sharp"},{"code":"red (1 2 3 4) (3 2 1 5) .\n --> (4 5 1 2 3):Int\n","language":"CafeOBJ"},{"code":"mod! NO-DUP-LIST(ELEMENTS :: TRIV) {\n op __ : Elt Elt -> Elt { comm assoc idem assoc }\n}\n\n-- Runs on Version 1.5.1(PigNose0.99) of CafeOBJ\n-- The tests are performed after opening instantiated NO-DUP-LIST with various concrete types.\n-- Test on lists of INT\nopen NO-DUP-LIST(INT) .\nred 2 1 2 1 2 1 3 .\n-- Gives (2 1 3):Int\nopen NO-DUP-LIST(INT) .\nreduce 1 1 2 1 1 .\nclose\nopen NO-DUP-LIST(CHARACTER) .\nreduce 'a' 'b' 'a' 'a' .\nclose\nopen NO-DUP-LIST(STRING) .\nreduce \"abc\" \"def\" \"abc\" \"abc\" \"abc\" .\nclose\n","language":"CafeOBJ"},{"code":"<String|Integer>[] data = [1, 2, 3, \"a\", \"b\", \"c\", 2, 3, 4, \"b\", \"c\", \"d\"];\n<String|Integer>[] unique = HashSet { *data }.sequence();\n","language":"Ceylon"},{"code":"user=> (distinct [1 3 2 9 1 2 3 8 8 1 0 2])\n(1 3 2 9 8 0)\nuser=>\n","language":"Clojure"},{"code":"data = [ 1, 2, 3, \"a\", \"b\", \"c\", 2, 3, 4, \"b\", \"c\", \"d\" ]\nset = []\nset.push i for i in data when not (i in set)\n\nconsole.log data\nconsole.log set\n","language":"CoffeeScript"},{"code":"(remove-duplicates '(1 3 2 9 1 2 3 8 8 1 0 2))\n> (9 3 8 1 0 2)\n","language":"Common-Lisp"},{"code":"(delete-duplicates '(1 3 2 9 1 2 3 8 8 1 0 2))\n> (9 3 8 1 0 2)\n","language":"Common-Lisp"},{"code":"ary = [1, 1, 2, 2, \"a\", [1, 2, 3], [1, 2, 3], \"a\"]\np ary.uniq\n","language":"Crystal"},{"code":"void main() {\n import std.stdio, std.algorithm;\n\n [1, 3, 2, 9, 1, 2, 3, 8, 8, 1, 0, 2]\n .sort()\n .uniq\n .writeln;\n}\n","language":"D"},{"code":"void main() {\n import std.stdio;\n\n immutable data = [1, 3, 2, 9, 1, 2, 3, 8, 8, 1, 0, 2];\n\n bool[int] hash;\n foreach (el; data)\n hash[el] = true;\n hash.byKey.writeln;\n}\n","language":"D"},{"code":"void main()\n{\n import std.stdio, std.algorithm, std.array;\n\n auto a = [5,4,32,7,6,4,2,6,0,8,6,9].sort.uniq.array;\n a.writeln;\n}\n","language":"D"},{"code":"program RemoveDuplicateElements;\n\n{$APPTYPE CONSOLE}\n\nuses Generics.Collections;\n\nvar\n i: Integer;\n lIntegerList: TList<Integer>;\nconst\n INT_ARRAY: array[1..7] of Integer = (1, 2, 2, 3, 4, 5, 5);\nbegin\n lIntegerList := TList<Integer>.Create;\n try\n for i in INT_ARRAY do\n if not lIntegerList.Contains(i) then\n lIntegerList.Add(i);\n\n for i in lIntegerList do\n Writeln(i);\n finally\n lIntegerList.Free;\n end;\nend.\n","language":"Delphi"},{"code":"[1,2,3,2,3,4].asSet().getElements()\n","language":"E"},{"code":"a[] = [ 1 2 1 4 5 2 15 1 3 4 ]\nfor a in a[]\n found = 0\n for b in b[]\n if a = b\n found = 1\n break 1\n .\n .\n if found = 0\n b[] &= a\n .\n.\nprint b[]\n","language":"EasyLang"},{"code":"inNumbers := DATASET([{1},{2},{3},{4},{1},{1},{7},{8},{9},{9},{0},{0},{3},{3},{3},{3},{3}], {INTEGER Field1});\nDEDUP(SORT(inNumbers,Field1));\n","language":"ECL"},{"code":"module RetainUniqueValues {\n void run() {\n Int[] array = [1, 2, 3, 2, 1, 2, 3, 4, 5, 3, 2, 1];\n array = array.distinct().toArray();\n\n @Inject Console console;\n console.print($\"result={array}\");\n }\n}\n","language":"Ecstasy"},{"code":"import extensions;\nimport system'collections;\nimport system'routines;\n\npublic program()\n{\n var nums := new int[]{1,1,2,3,4,4};\n auto unique := new Map<int, int>();\n\n nums.forEach::(n){ unique[n] := n };\n\n console.printLine(unique.MapValues.asEnumerable())\n}\n","language":"Elena"},{"code":"defmodule RC do\n # Set approach\n def uniq1(list), do: MapSet.new(list) |> MapSet.to_list\n\n # Sort approach\n def uniq2(list), do: Enum.sort(list) |> Enum.dedup\n\n # Go through the list approach\n def uniq3(list), do: uniq3(list, [])\n\n defp uniq3([], res), do: Enum.reverse(res)\n defp uniq3([h|t], res) do\n if h in res, do: uniq3(t, res), else: uniq3(t, [h | res])\n end\nend\n\nnum = 10000\nmax = div(num, 10)\nlist = for _ <- 1..num, do: :rand.uniform(max)\nfuns = [&Enum.uniq/1, &RC.uniq1/1, &RC.uniq2/1, &RC.uniq3/1]\nEnum.each(funs, fn fun ->\n result = fun.([1,1,2,1,'redundant',1.0,[1,2,3],[1,2,3],'redundant',1.0])\n :timer.tc(fn ->\n Enum.each(1..100, fn _ -> fun.(list) end)\n end)\n |> fn{t,_} -> IO.puts \"#{inspect fun}:\\t#{t/1000000}\\t#{inspect result}\" end.()\nend)\n","language":"Elixir"},{"code":"List = [1, 2, 3, 2, 2, 4, 5, 5, 4, 6, 6, 5].\nUniqueList = gb_sets:to_list(gb_sets:from_list(List)).\n% Alternatively the builtin:\nUnique_list = lists:usort( List ).\n","language":"Erlang"},{"code":"include sort.e\n\nfunction uniq(sequence s)\n sequence out\n s = sort(s)\n out = s[1..1]\n for i = 2 to length(s) do\n if not equal(s[i],out[$]) then\n out = append(out, s[i])\n end if\n end for\n return out\nend function\n\nconstant s = {1, 2, 1, 4, 5, 2, 15, 1, 3, 4}\n? s\n? uniq(s)\n","language":"Euphoria"},{"code":"set [|1;2;3;2;3;4|]\n","language":"F-Sharp"},{"code":"val it : Set<int> = seq [1; 2; 3; 4]\n","language":"F-Sharp"},{"code":"USING: sets ;\nV{ 1 2 1 3 2 4 5 } members .\n\nV{ 1 2 3 4 5 }\n","language":"Factor"},{"code":"\\ Increments a2 until it no longer points to the same value as a1\n\\ a3 is the address beyond the data a2 is traversing.\n: skip-dups ( a1 a2 a3 -- a1 a2+n )\n dup rot ?do\n over @ i @ <> if drop i leave then\n cell +loop ;\n\n\\ Compress an array of cells by removing adjacent duplicates\n\\ Returns the new count\n: uniq ( a n -- n2 )\n over >r \\ Original addr to return stack\n cells over + >r \\ \"to\" addr now on return stack, available as r@\n dup begin ( write read )\n dup r@ <\n while\n 2dup @ swap ! \\ copy one cell\n cell+ r@ skip-dups\n cell 0 d+ \\ increment write ptr only\n repeat r> 2drop r> - cell / ;\n","language":"Forth"},{"code":": uniqv { a n \\ r e -- n }\n a n cells+ to e\n a dup to r\n \\ the write address lives on the stack\n begin\n r e <\n while\n r @ over !\n r cell+ e skip-dups to r\n cell+\n repeat\n a - cell / ;\n","language":"Forth"},{"code":"create test 1 , 2 , 3 , 2 , 6 , 4 , 5 , 3 , 6 ,\nhere test - cell / constant ntest\n: .test ( n -- ) 0 ?do test i cells + ? loop ;\n\ntest ntest 2dup cell-sort uniq .test\n","language":"Forth"},{"code":"program remove_dups\n implicit none\n integer :: example(12) ! The input\n integer :: res(size(example)) ! The output\n integer :: k ! The number of unique elements\n integer :: i, j\n\n example = [1, 2, 3, 2, 2, 4, 5, 5, 4, 6, 6, 5]\n k = 1\n res(1) = example(1)\n outer: do i=2,size(example)\n do j=1,k\n if (res(j) == example(i)) then\n ! Found a match so start looking again\n cycle outer\n end if\n end do\n ! No match found so add it to the output\n k = k + 1\n res(k) = example(i)\n end do outer\n write(*,advance='no',fmt='(a,i0,a)') 'Unique list has ',k,' elements: '\n write(*,*) res(1:k)\nend program remove_dups\n","language":"Fortran"},{"code":"program remove_dups\n implicit none\n integer :: example(12) ! The input\n integer :: res(size(example)) ! The output\n integer :: k ! The number of unique elements\n integer :: i\n\n example = [1, 2, 3, 2, 2, 4, 5, 5, 4, 6, 6, 5]\n k = 1\n res(1) = example(1)\n do i=2,size(example)\n ! if the number already exist in res check next\n if (any( res == example(i) )) cycle\n ! No match found so add it to the output\n k = k + 1\n res(k) = example(i)\n end do\n\n write(*,advance='no',fmt='(a,i0,a)') 'Unique list has ',k,' elements: '\n write(*,*) res(1:k)\nend program remove_dups\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nSub removeDuplicates(a() As Integer, b() As Integer)\n Dim lb As Integer = LBound(a)\n Dim ub As Integer = UBound(a)\n If ub = -1 Then Return '' empty array\n Redim b(lb To ub)\n b(lb) = a(lb)\n Dim count As Integer = 1\n Dim unique As Boolean\n\n For i As Integer = lb + 1 To ub\n unique = True\n For j As Integer = lb to i - 1\n If a(i) = a(j) Then\n unique = False\n Exit For\n End If\n Next j\n If unique Then\n b(lb + count) = a(i)\n count += 1\n End If\n Next i\n\n If count > 0 Then Redim Preserve b(lb To lb + count - 1)\nEnd Sub\n\nDim a(1 To 10) As Integer = {1, 2, 1, 4, 5, 2, 15, 1, 3, 4}\nDim b() As Integer\nremoveDuplicates a(), b()\n\nFor i As Integer = LBound(b) To UBound(b)\n Print b(i); \" \";\nNext\n\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"b = [1, 5, 2, 6, 6, 2, 2, 1, 9, 8, 6, 5]\n\n// One way, using OrderedList. An OrderedList is a type of array that keeps\n// its elements in order. The items must be comparable.\na = new OrderedList\nprintln[a.insertAllUnique[b]]\n\n// Another way, using the \"set\" datatype and back to an array.\nprintln[toArray[toSet[b]]\n","language":"Frink"},{"code":"include \"NSLog.incl\"\n\nCFArrayRef array, unique\nOrderedSetRef ordered\n\narray = @[@\"A\", @\"B\", @\"C\", @\"B\", @\"A\", @\"C\", @\"A\", @\"C\", @\"A\", @\"B\", @\"C\"]\nordered = fn OrderedSetWithArray( array )\nNSLog( @\"%@\", fn OrderedSetArray( ordered ) )\n\nHandleEvents\n","language":"FutureBasic"},{"code":"Public Sub Main()\nDim sString As String[] = Split(\"Now is the time for all the good men to come to the aid of the good party 1 2 1 3 3 3 2 1 1 2 3 4 33 2 5 4 333 5\", \" \")\nDim sFix As New String[]\nDim sTemp As String\n\nFor Each sTemp In sString\n sTemp &= \" \"\n If InStr(sFix.Join(\" \") & \" \", sTemp) Then Continue\n sFix.Add(Trim(sTemp))\nNext\n\nPrint sFix.Join(\" \")\n\nEnd\n","language":"Gambas"},{"code":"# Built-in, using sets (which are also lists)\na := [ 1, 2, 3, 1, [ 4 ], 5, 5, [4], 6 ];\n# [ 1, 2, 3, 1, [ 4 ], 5, 5, [ 4 ], 6 ]\nb := Set(a);\n# [ 1, 2, 3, 5, 6, [ 4 ] ]\nIsSet(b);\n# true\nIsList(b);\n# true\n","language":"GAP"},{"code":"package main\n\nimport \"fmt\"\n\nfunc uniq(list []int) []int {\n\tunique_set := make(map[int]bool, len(list))\n\tfor _, x := range list {\n\t\tunique_set[x] = true\n\t}\n\tresult := make([]int, 0, len(unique_set))\n\tfor x := range unique_set {\n\t\tresult = append(result, x)\n\t}\n\treturn result\n}\n\nfunc main() {\n\tfmt.Println(uniq([]int{1, 2, 3, 2, 3, 4})) // prints: [3 4 1 2] (but in a semi-random order)\n}\n","language":"Go"},{"code":"package main\n\nimport \"fmt\"\n\nfunc uniq(list []int) []int {\n\tunique_set := make(map[int]int, len(list))\n\ti := 0\n\tfor _, x := range list {\n\t\tif _, there := unique_set[x]; !there {\n\t\t\tunique_set[x] = i\n\t\t\ti++\n\t\t}\n\t}\n\tresult := make([]int, len(unique_set))\n\tfor x, i := range unique_set {\n\t\tresult[i] = x\n\t}\n\treturn result\n}\n\nfunc main() {\n\tfmt.Println(uniq([]int{1, 2, 3, 2, 3, 4})) // prints: [1 2 3 4]\n}\n","language":"Go"},{"code":"package main\n\nimport (\n\t\"fmt\"\n\t\"math\"\n)\n\nfunc uniq(list []float64) []float64 {\n\tunique_set := map[float64]int{}\n\ti := 0\n\tnan := false\n\tfor _, x := range list {\n\t\tif _, exists := unique_set[x]; exists {\n\t\t\tcontinue\n\t\t}\n\t\tif math.IsNaN(x) {\n\t\t\tif nan {\n\t\t\t\tcontinue\n\t\t\t} else {\n\t\t\t\tnan = true\n\t\t\t}\n\t\t}\n\t\tunique_set[x] = i\n\t\ti++\n\t}\n\tresult := make([]float64, len(unique_set))\n\tfor x, i := range unique_set {\n\t\tresult[i] = x\n\t}\n\treturn result\n}\n\nfunc main() {\n\tfmt.Println(uniq([]float64{1, 2, math.NaN(), 2, math.NaN(), 4})) // Prints [1 2 NaN 4]\n}\n","language":"Go"},{"code":"package main\n\nimport (\n\t\"fmt\"\n\t\"math\"\n\t\"reflect\"\n)\n\nfunc uniq(x interface{}) (interface{}, bool) {\n\tv := reflect.ValueOf(x)\n\tif !v.IsValid() {\n\t\tpanic(\"uniq: invalid argument\")\n\t}\n\tif k := v.Kind(); k != reflect.Array && k != reflect.Slice {\n\t\tpanic(\"uniq: argument must be an array or a slice\")\n\t}\n\telemType := v.Type().Elem()\n\tintType := reflect.TypeOf(int(0))\n\tmapType := reflect.MapOf(elemType, intType)\n\tm := reflect.MakeMap(mapType)\n\ti := 0\n\tfor j := 0; j < v.Len(); j++ {\n\t\tx := v.Index(j)\n\t\tif m.MapIndex(x).IsValid() {\n\t\t\tcontinue\n\t\t}\n\t\tm.SetMapIndex(x, reflect.ValueOf(i))\n\t\tif m.MapIndex(x).IsValid() {\n\t\t\ti++\n\t\t}\n\t}\n\tsliceType := reflect.SliceOf(elemType)\n\tresult := reflect.MakeSlice(sliceType, i, i)\n\thadNaN := false\n\tfor _, key := range m.MapKeys() {\n\t\tival := m.MapIndex(key)\n\t\tif !ival.IsValid() {\n\t\t\thadNaN = true\n\t\t} else {\n\t\t\tresult.Index(int(ival.Int())).Set(key)\n\t\t}\n\t}\n\n\treturn result.Interface(), hadNaN\n}\n\ntype MyType struct {\n\tname string\n\tvalue float32\n}\n\nfunc main() {\n\tintArray := [...]int{5, 1, 2, 3, 2, 3, 4}\n\tintSlice := []int{5, 1, 2, 3, 2, 3, 4}\n\tstringSlice := []string{\"five\", \"one\", \"two\", \"three\", \"two\", \"three\", \"four\"}\n\tfloats := []float64{1, 2, 2, 4,\n\t\tmath.NaN(), 2, math.NaN(),\n\t\tmath.Inf(1), math.Inf(1), math.Inf(-1), math.Inf(-1)}\n\tcomplexes := []complex128{1, 1i, 1 + 1i, 1 + 1i,\n\t\tcomplex(math.NaN(), 1), complex(1, math.NaN()),\n\t\tcomplex(math.Inf(+1), 1), complex(1, math.Inf(1)),\n\t\tcomplex(math.Inf(-1), 1), complex(1, math.Inf(1)),\n\t}\n\tstructs := []MyType{\n\t\t{\"foo\", 42},\n\t\t{\"foo\", 2},\n\t\t{\"foo\", 42},\n\t\t{\"bar\", 42},\n\t\t{\"bar\", 2},\n\t\t{\"fail\", float32(math.NaN())},\n\t}\n\n\tfmt.Print(\"intArray: \", intArray, \" → \")\n\tfmt.Println(uniq(intArray))\n\tfmt.Print(\"intSlice: \", intSlice, \" → \")\n\tfmt.Println(uniq(intSlice))\n\tfmt.Print(\"stringSlice: \", stringSlice, \" → \")\n\tfmt.Println(uniq(stringSlice))\n\tfmt.Print(\"floats: \", floats, \" → \")\n\tfmt.Println(uniq(floats))\n\tfmt.Print(\"complexes: \", complexes, \"\\n → \")\n\tfmt.Println(uniq(complexes))\n\tfmt.Print(\"structs: \", structs, \" → \")\n\tfmt.Println(uniq(structs))\n\t// Passing a non slice or array will compile put\n\t// then produce a run time panic:\n\t//a := 42\n\t//uniq(a)\n\t//uniq(nil)\n}\n","language":"Go"},{"code":"def list = [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\nassert list.size() == 12\nprintln \" Original List: ${list}\"\n\n// Filtering the List (non-mutating)\ndef list2 = list.unique(false)\nassert list2.size() == 8\nassert list.size() == 12\nprintln \" Filtered List: ${list2}\"\n\n// Filtering the List (in place)\nlist.unique()\nassert list.size() == 8\nprintln \" Original List, filtered: ${list}\"\n\ndef list3 = [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\nassert list3.size() == 12\n\n// Converting to Set\ndef set = list as Set\nassert set.size() == 8\nprintln \" Set: ${set}\"\n","language":"Groovy"},{"code":"10 ' Remove Duplicates\n20 OPTION BASE 1\n30 LET MAXI% = 7\n40 DIM D(7), R(7): ' data, result\n50 ' Set the data.\n60 FOR I% = 1 TO 7\n70 READ D(I%)\n80 NEXT I%\n90 ' Remove duplicates.\n100 LET R(1) = D(1)\n110 LET LRI% = 1: ' last index of result\n120 LET P% = 1: ' position\n130 WHILE P% < MAXI%\n140 LET P% = P% + 1\n150 LET ISNEW = 1: ' is a new number?\n160 LET RI% = 1: ' current index of result\n170 WHILE (RI% <= LRI%) AND ISNEW\n180 IF D(P%) = R(RI%) THEN LET ISNEW = 0\n190 LET RI% = RI% + 1\n200 WEND\n210 IF ISNEW THEN LET LRI% = LRI% + 1: LET R(LRI%) = D(P%)\n220 WEND\n230 FOR RI% = 1 TO LRI%\n240 PRINT R(RI%)\n250 NEXT RI%\n260 END\n1000 DATA 1, 2, 2, 3, 4, 5, 5\n","language":"GW-BASIC"},{"code":" print $ unique [4, 5, 4, 2, 3, 3, 4]\n\n[4,5,2,3]\n","language":"Haskell"},{"code":"import qualified Data.Set as Set\n\nunique :: Ord a => [a] -> [a]\nunique = Set.toList . Set.fromList\n","language":"Haskell"},{"code":"import Data.Set\n\nunique :: Ord a => [a] -> [a]\nunique = loop empty\n where\n loop s [] = []\n loop s (x : xs) | member x s = loop s xs\n | otherwise = x : loop (insert x s) xs\n","language":"Haskell"},{"code":"import Data.List\n\nunique :: Eq a => [a] -> [a]\nunique [] = []\nunique (x : xs) = x : unique (filter (x /=) xs)\n","language":"Haskell"},{"code":"import Data.List\nData.List.nub :: Eq a => [a] -> [a]\nData.List.Unique.unique :: Ord a => [a] -> [a]\n","language":"Haskell"},{"code":"REAL :: nums(12)\nCHARACTER :: workspace*100\n\nnums = (1, 3, 2, 9, 1, 2, 3, 8, 8, 1, 0, 2)\nWRITE(Text=workspace) nums ! convert to string\nEDIT(Text=workspace, SortDelDbls=workspace) ! do the job for a string\nREAD(Text=workspace, ItemS=individuals) nums ! convert to numeric\n\nWRITE(ClipBoard) individuals, \"individuals: \", nums ! 6 individuals: 0 1 2 3 8 9 0 0 0 0 0 0\n","language":"HicEst"},{"code":"procedure main(args)\n every write(!noDups(args))\nend\n\nprocedure noDups(L)\n every put(newL := [], notDup(set(),!L))\n return newL\nend\n\nprocedure notDup(cache, a)\n if not member(cache, a) then {\n insert(cache, a)\n return a\n }\nend\n","language":"Icon"},{"code":"non_repeated_values = array[uniq(array, sort( array))]\n","language":"IDL"},{"code":"To decide which list of Ks is (L - list of values of kind K) without duplicates:\n\tlet result be a list of Ks;\n\trepeat with X running through L:\n\t\tadd X to result, if absent;\n\tdecide on result.\n","language":"Inform-7"},{"code":"100 PROGRAM \"RemoveDu.bas\"\n110 RANDOMIZE\n120 NUMERIC ARR(1 TO 20),TOP\n130 LET TOP=FILL(ARR)\n140 CALL WRITE(ARR,TOP)\n150 LET TOP=REMOVE(ARR)\n160 CALL WRITE(ARR,TOP)\n170 DEF WRITE(REF A,N)\n180 FOR I=1 TO N\n190 PRINT A(I);\n200 NEXT\n210 PRINT\n220 END DEF\n230 DEF FILL(REF A)\n240 LET FILL=UBOUND(A):LET A(LBOUND(A))=1\n250 FOR I=LBOUND(A)+1 TO UBOUND(A)\n260 LET A(I)=A(I-1)+RND(3)\n270 NEXT\n280 END DEF\n290 DEF REMOVE(REF A)\n300 LET ST=0\n310 FOR I=LBOUND(A)+1 TO UBOUND(A)\n320 IF A(I-1)=A(I) THEN LET ST=ST+1\n330 IF ST>0 THEN LET A(I-ST)=A(I)\n340 NEXT\n350 LET REMOVE=UBOUND(A)-ST\n360 END DEF\n","language":"IS-BASIC"},{"code":" ~. 4 3 2 8 0 1 9 5 1 7 6 3 9 9 4 2 1 5 3 2\n4 3 2 8 0 1 9 5 7 6\n ~. 'chthonic eleemosynary paronomasiac'\nchtoni elmsyarp\n","language":"J"},{"code":" 0 1 1 2 0 */0 1 2\n0 0 0\n0 1 2\n0 1 2\n0 2 4\n0 0 0\n ~. 0 1 1 2 0 */0 1 2\n0 0 0\n0 1 2\n0 2 4\n","language":"J"},{"code":"fn deduplicated<T>(anon array: [T]) throws -> [T] {\n mut existing_items: {T} = {}\n mut result: [T] = []\n for value in array {\n if not existing_items.contains(value) {\n existing_items.add(value)\n result.push(value)\n }\n }\n return result\n}\n\nfn deduplicated_set<T>(anon array: [T]) throws -> {T} {\n mut result: {T} = {}\n for value in array {\n result.add(value)\n }\n return result\n}\n\n\nfn main() {\n let array = [1, 2, 3, 3, 2, 5, 4]\n println(\"{}\", deduplicated(array))\n println(\"{}\", deduplicated_set(array))\n}\n","language":"Jakt"},{"code":"import java.util.ArrayList;\nimport java.util.Iterator;\nimport java.util.LinkedHashSet;\nimport java.util.List;\nimport java.util.Set;\n","language":"Java"},{"code":"int[] removeDuplicates(int[] values) {\n /* use a LinkedHashSet to preserve order */\n Set<Integer> set = new LinkedHashSet<>();\n for (int value : values)\n set.add(value);\n values = new int[set.size()];\n Iterator<Integer> iterator = set.iterator();\n int index = 0;\n while (iterator.hasNext())\n values[index++] = iterator.next();\n return values;\n}\n","language":"Java"},{"code":"int[] removeDuplicates(int[] values) {\n List<Integer> list = new ArrayList<>();\n for (int value : values)\n if (!list.contains(value)) list.add(value);\n values = new int[list.size()];\n int index = 0;\n for (int value : list)\n values[index++] = value;\n return values;\n}\n","language":"Java"},{"code":"import java.util.*;\n\nclass Test {\n\n public static void main(String[] args) {\n\n Object[] data = {1, 1, 2, 2, 3, 3, 3, \"a\", \"a\", \"b\", \"b\", \"c\", \"d\"};\n Set<Object> uniqueSet = new HashSet<Object>(Arrays.asList(data));\n for (Object o : uniqueSet)\n System.out.printf(\"%s \", o);\n }\n}\n","language":"Java"},{"code":"import java.util.*;\n\nclass Test {\n\n public static void main(String[] args) {\n\n Object[] data = {1, 1, 2, 2, 3, 3, 3, \"a\", \"a\", \"b\", \"b\", \"c\", \"d\"};\n Arrays.stream(data).distinct().forEach((o) -> System.out.printf(\"%s \", o));\n }\n}\n","language":"Java"},{"code":"function unique(ary) {\n // concat() with no args is a way to clone an array\n var u = ary.concat().sort();\n for (var i = 1; i < u.length; ) {\n if (u[i-1] === u[i])\n u.splice(i,1);\n else\n i++;\n }\n return u;\n}\n\nvar ary = [1, 2, 3, \"a\", \"b\", \"c\", 2, 3, 4, \"b\", \"c\", \"d\", \"4\"];\nvar uniq = unique(ary);\nfor (var i = 0; i < uniq.length; i++)\n print(uniq[i] + \"\\t\" + typeof(uniq[i]));\n","language":"JavaScript"},{"code":"Array.prototype.unique = function() {\n var u = this.concat().sort();\n for (var i = 1; i < u.length; ) {\n if (u[i-1] === u[i])\n u.splice(i,1);\n else\n i++;\n }\n return u;\n}\nvar uniq = [1, 2, 3, \"a\", \"b\", \"c\", 2, 3, 4, \"b\", \"c\", \"d\"].unique();\n","language":"JavaScript"},{"code":"Array.prototype.unique = function() {\n return this.sort().reduce( (a,e) => e === a[a.length-1] ? a : (a.push(e), a), [] )\n}\n","language":"JavaScript"},{"code":"Array.prototype.unique = function() {\n return [... new Set(this)]\n}\n","language":"JavaScript"},{"code":"function uniq(lst) {\n var u = [],\n dct = {},\n i = lst.length,\n v;\n\n while (i--) {\n v = lst[i], dct[v] || (\n dct[v] = u.push(v)\n );\n }\n u.sort(); // optional\n\n return u;\n}\n","language":"JavaScript"},{"code":"(function () {\n 'use strict';\n\n // nub :: [a] -> [a]\n function nub(xs) {\n\n // Eq :: a -> a -> Bool\n function Eq(a, b) {\n return a === b;\n }\n\n // nubBy :: (a -> a -> Bool) -> [a] -> [a]\n function nubBy(fnEq, xs) {\n var x = xs.length ? xs[0] : undefined;\n\n return x !== undefined ? [x].concat(\n nubBy(fnEq, xs.slice(1)\n .filter(function (y) {\n return !fnEq(x, y);\n }))\n ) : [];\n }\n\n return nubBy(Eq, xs);\n }\n\n\n // TEST\n\n return [\n nub('4 3 2 8 0 1 9 5 1 7 6 3 9 9 4 2 1 5 3 2'.split(' '))\n .map(function (x) {\n return Number(x);\n }),\n nub('chthonic eleemosynary paronomasiac'.split(''))\n .join('')\n ]\n\n})();\n","language":"JavaScript"},{"code":"DEFINE uniq == [[]] [[in] [swap pop] [cons] ifte] primrec.\n","language":"Joy"},{"code":"[4,3,2,1,1,2,3,4] | unique\n","language":"Jq"},{"code":"def removeAllButFirst:\n\n # The hash table functions all expect the hash table to be the input.\n\n # Is x in the hash table?\n def hashed(x):\n (x|tostring) as $value\n | .[$value] as $bucket\n | $bucket and (.[$value] | index([x]));\n\n # Add x to the hash table:\n def add_hash(x):\n (x|tostring) as $value\n | .[$value] as $bucket\n | if $bucket and ($bucket | index([x])) then .\n else .[$value] += [x]\n end;\n\n reduce .[] as $item\n ( [[], {}]; # [array, hash]\n if .[1] | hashed($item) then .\n else [ (.[0] + [$item]), (.[1] | add_hash($item)) ]\n end)\n | .[0];\n","language":"Jq"},{"code":"a = [1, 2, 3, 4, 1, 2, 3, 4]\n@show unique(a) Set(a)\n","language":"Julia"},{"code":" a:4 5#20?13 / create a random 4 x 5 matrix\n(12 7 12 4 3\n 6 3 7 4 7\n 3 8 3 1 2\n 2 12 6 4 1)\n\n ,/a / flatten to array\n12 7 12 4 3 6 3 7 4 7 3 8 3 1 2 2 12 6 4 1\n\n ?,/a / distinct elements\n12 7 4 3 6 8 1 2\n\n ?\"chthonic eleemosynary paronomasiac\"\n\"chtoni elmsyarp\"\n\n ?(\"this\";\"that\";\"was\";\"that\";\"was\";\"this\")\n(\"this\"\n \"that\"\n \"was\")\n\n 0 1 1 2 0 *\\: 0 1 2\n(0 0 0\n 0 1 2\n 0 1 2\n 0 2 4\n 0 0 0)\n\n ?0 1 1 2 0 *\\: 0 1 2\n(0 0 0\n 0 1 2\n 0 2 4)\n","language":"K"},{"code":"( )\n\n( \"Now\" \"is\" \"the\" \"time\" \"for\" \"all\" \"good\" \"men\" \"to\" \"come\" \"to\" \"the\" \"aid\" \"of\" \"the\" \"party.\" )\n\nlen [\n get rot over find\n not (\n [swap 0 put]\n [nip]\n ) if\n swap\n] for\n\nswap print drop nl\n\n\"End \" input\n","language":"Klingphix"},{"code":"fun main(args: Array<String>) {\n val data = listOf(1, 2, 3, \"a\", \"b\", \"c\", 2, 3, 4, \"b\", \"c\", \"d\")\n val set = data.distinct()\n\n println(data)\n println(set)\n}\n","language":"Kotlin"},{"code":"{def removedup\n {def removedup.loop\n {lambda {:a :b}\n {if {A.empty? :a}\n then :b\n else {removedup.loop {A.rest :a}\n {if {= {A.in? {A.first :a} :b} -1}\n then {A.addlast! {A.first :a} :b}\n else :b}}}}}\n {lambda {:s}\n {S.replace (\\[|\\]|,) by space in\n {A.disp\n {removedup.loop {A.new :s} {A.new}}}}}}\n-> removedup\n\n{removedup 1 2 3 a b c 2 3 4 b c d}\n-> 1 2 3 a b c 4 d\n","language":"Lambdatalk"},{"code":": dip swap '_ set execute _ ;\n\n: remove-duplicates\n [] swap do unique? length 0 == if break then loop drop ;\n: unique?\n 0 extract swap \"2dup in if drop else append then\" dip ;\n\n[1 2 6 3 6 4 5 6] remove-duplicates .\n","language":"Lang5"},{"code":"[1 2 6 3 6 4 5 6] 's distinct\n[1 2 6 3 6 4 5 6] 's dress dup union .\n","language":"Lang5"},{"code":"local(\n\tx = array(3,4,8,1,8,1,4,5,6,8,9,6),\n\ty = array\n)\nwith n in #x where #y !>> #n do => { #y->insert(#n) }\n// result: array(3, 4, 8, 1, 5, 6, 9)\n","language":"Lasso"},{"code":"a$ =\" 1 $23.19 2 elbow 3 2 Bork 4 3 elbow 2 $23.19 \"\nprint \"Original set of elements = [\"; a$; \"]\"\nb$ =removeDuplicates$( a$)\nprint \"With duplicates removed = [\"; b$; \"]\"\nend\n\nfunction removeDuplicates$( in$)\n o$ =\" \"\n i =1\n do\n term$ =word$( in$, i, \" \")\n if instr( o$, \" \"; term$; \" \") =0 and term$ <>\" \" then o$ =o$ +term$ +\" \"\n i =i +1\n loop until term$ =\"\"\n removeDuplicates$ =o$\nend function\n","language":"Liberty-BASIC"},{"code":"show remdup [1 2 3 a b c 2 3 4 b c d] ; [1 a 2 3 4 b c d]\n","language":"Logo"},{"code":"items = {1,2,3,4,1,2,3,4,\"bird\",\"cat\",\"dog\",\"dog\",\"bird\"}\nflags = {}\nio.write('Unique items are:')\nfor i=1,#items do\n if not flags[items[i]] then\n io.write(' ' .. items[i])\n flags[items[i]] = true\n end\nend\nio.write('\\n')\n","language":"Lua"},{"code":"local items = {1,2,3,4,1,2,3,4,0/0,nil,\"bird\",\"cat\",\"dog\",\"dog\",\"bird\",0/0}\n\nfunction rmdup(t)\n local r,dup,c,NaN = {},{},1,{}\n for i=1,#t do\n local e = t[i]\n local k = e~=e and NaN or e\n if k~=nil and not dup[k] then\n c, r[c], dup[k]= c+1, e, true\n end\n end\n return r\nend\n\nprint(table.concat(rmdup(items),' '))\n","language":"Lua"},{"code":"Flush // current stack has no items\n// Number pop a number from stack of values\n// Letter pop a string from stack of values\nModule TestList {\n\t// current stack has a number, 101\n\t// we can create a private stack\n\ta=stack:=1, 1, \"c\", \"d\", 2, 2, 3, 3, 3, \"a\", \"a\", \"b\", \"b\"\n\t// A list use key/values or key/Key as value. Keys can be number or strings\n\t// Duplicate not allowed. Exist( list_type, key_to_exam) return true if key exist\n\t// Lists are inventories types wich can't hold duplicates (error produce if append a duplicate)\n\t// Lists have O(1) for insert, delete, search (using Hash Table)\n\tb=list\n\tstack a {\n\t\t// replace current stack with a, old current stack kept\n\t\twhile not empty\n\t\t\tif islet then // if is letter (string)\n\t\t\t\tif not exist(b, stackitem$()) then Append b, letter$ else drop\n\t\t\telse.if not exist(b, stackitem()) then\n\t\t\t\tAppend b, number\n\t\t\telse\n\t\t\t\tdrop // drop the item\n\t\t\tend if\n\t\tend while\n\t}\n\t// now old current stack return as current stack\n\t// we can sort the b list\n\tSort b\n\tPrint b // print the list, using right align on columns for numbers, left for strings.\n\tPrint Number=101 // true\n}\nTestList 101\n","language":"M2000-Interpreter"},{"code":"> L := [ 1, 2, 1, 2, 3, 3, 2, 1, \"a\", \"b\", \"b\", \"a\", \"c\", \"b\" ];\n L := [1, 2, 1, 2, 3, 3, 2, 1, \"a\", \"b\", \"b\", \"a\", \"c\", \"b\"]\n\n> [op]({op}(L));\n [1, 2, 3, \"a\", \"b\", \"c\"]\n","language":"Maple"},{"code":"> convert( convert( L, 'set' ), 'list' );\n [1, 2, 3, \"a\", \"b\", \"c\"]\n","language":"Maple"},{"code":"> A := Array( L ):\n> for u in A do T[u] := 1 end: Array( [indices]( T, 'nolist' ) );\n [1, 2, 3, \"c\", \"a\", \"b\"]\n","language":"Maple"},{"code":"DeleteDuplicates[{0, 2, 1, 4, 2, 0, 3, 1, 1, 1, 0, 3}]\n","language":"Mathematica"},{"code":"{0, 2, 1, 4, 3}\n","language":"Mathematica"},{"code":"Union[{0, 2, 1, 4, 2, 0, 3, 1, 1, 1, 0, 3}]\n","language":"Mathematica"},{"code":"{0, 1, 2, 3, 4}\n","language":"Mathematica"},{"code":">> unique([1 2 6 3 6 4 5 6])\n\nans =\n\n 1 2 3 4 5 6\n","language":"MATLAB"},{"code":"unique([8, 9, 5, 2, 0, 7, 0, 0, 4, 2, 7, 3, 9, 6, 6, 2, 4, 7, 9, 8, 3, 8, 0, 3, 7, 0, 2, 7, 6, 0]);\n[0, 2, 3, 4, 5, 6, 7, 8, 9]\n","language":"Maxima"},{"code":"uniques = #(1, 2, 3, \"a\", \"b\", \"c\", 2, 3, 4, \"b\", \"c\", \"d\")\nfor i in uniques.count to 1 by -1 do\n(\n id = findItem uniques uniques[i]\n if (id != i) do deleteItem uniques i\n)\n","language":"MAXScript"},{"code":"' Set the data.\ndataArray[1] = 1\ndataArray[2] = 2\ndataArray[3] = 2\ndataArray[4] = 3\ndataArray[5] = 4\ndataArray[6] = 5\ndataArray[7] = 5\n\nresultArray[1] = dataArray[1]\nlastResultIndex = 1\nposition = 1\nWhile position < Array.GetItemCount(dataArray)\n position = position + 1\n isNewNumber = 1 ' logical 1\n resultIndex = 1\n While (resultIndex <= lastResultIndex) And isNewNumber = 1\n If dataArray[position] = resultArray[resultIndex] Then\n isNewNumber = 0\n EndIf\n resultIndex = resultIndex + 1\n EndWhile\n If isNewNumber = 1 Then\n lastResultIndex = lastResultIndex + 1\n resultArray[lastResultIndex] = dataArray[position]\n EndIf\nEndWhile\nFor resultIndex = 1 To lastResultIndex\n TextWindow.WriteLine(resultArray[resultIndex])\nEndFor\n","language":"Microsoft-Small-Basic"},{"code":"items = [1, 2, 3, \"a\", \"b\", \"c\", 2, 3, 4, \"b\", \"c\", \"d\"]\nd = {}\nfor i in items\n d.push i\nend for\nprint d.indexes\n","language":"MiniScript"},{"code":"fun mem (x, []) = false\n | (x eql a, a :: as) = true\n | (x, _ :: as) = mem (x, as)\n;\t\nfun remdup\n\t\t([], uniq) = rev uniq\n\t|\t(h :: t, uniq) = if mem(h, uniq) then\n\t\t\t\tremdup (t, uniq)\n\t\t\telse\n\t\t\t\tremdup (t, h :: uniq)\n\t|\tL =\tremdup (L, [])\n\t\n;\t\nprintln ` implode ` remdup ` explode \"the quick brown fox jumped over the lazy dog\";\nprintln ` remdup [1,2,3,4,4,3,2,1, \"dog\",\"cat\",\"dog\", 1.1, 2.2, 3.3, 1.1];\n","language":"MLite"},{"code":"MODULE RemoveDuplicates;\n\nFROM STextIO IMPORT\n WriteLn;\nFROM SWholeIO IMPORT\n WriteInt;\n\nTYPE\n TArrayRange = [1 .. 7];\n TArray = ARRAY TArrayRange OF INTEGER;\n\nVAR\n DataArray, ResultArray: TArray;\n ResultIndex, LastResultIndex, Position: CARDINAL;\n IsNewNumber: BOOLEAN;\n\nBEGIN\n (* Set the data. *);\n DataArray[1] := 1;\n DataArray[2] := 2;\n DataArray[3] := 2;\n DataArray[4] := 3;\n DataArray[5] := 4;\n DataArray[6] := 5;\n DataArray[7] := 5;\n\n ResultArray[1] := DataArray[1];\n LastResultIndex := 1;\n Position := 1;\n WHILE Position < HIGH(DataArray) DO\n INC(Position);\n IsNewNumber := TRUE;\n ResultIndex := 1;\n WHILE (ResultIndex <= LastResultIndex) AND IsNewNumber DO\n IF DataArray[Position] = ResultArray[ResultIndex] THEN\n IsNewNumber := FALSE;\n END;\n INC(ResultIndex);\n END;\n IF IsNewNumber THEN\n INC(LastResultIndex);\n ResultArray[LastResultIndex] := DataArray[Position];\n END\n END;\n FOR ResultIndex := 1 TO LastResultIndex DO\n WriteInt(ResultArray[ResultIndex], 1);\n WriteLn;\n END;\nEND RemoveDuplicates.\n","language":"Modula-2"},{"code":"REMDUPE(L,S)\n ;L is the input listing\n ;S is the separator between entries\n ;R is the list to be returned\n NEW Z,I,R\n FOR I=1:1:$LENGTH(L,S) SET Z($PIECE(L,S,I))=\"\"\n ;Repack for return\n SET I=\"\",R=\"\"\n FOR SET I=$O(Z(I)) QUIT:I=\"\" SET R=$SELECT($L(R)=0:I,1:R_S_I)\n KILL Z,I\n QUIT R\n","language":"MUMPS"},{"code":"items = {1, 2, 3, \"a\", \"b\", \"c\", 2, 3, 4, \"b\", \"c\", \"d\"}\nunique = {}\n\nfor item in items\n if not item in unique\n unique.append(item)\n end\nend\n","language":"Nanoquery"},{"code":"/**\n Remove duplicate elements, in Neko\n*/\n\nvar original = $array(1, 2, 1, 4, 5, 2, 15, 1, 3, 4)\n\n/* Create a table with only unique elements from the array */\nvar dedup = function(a) {\n var size = $asize(a)\n var hash = $hnew(size)\n while size > 0 {\n var v = a[size - 1]\n var k = $hkey(v)\n $hset(hash, k, v, null)\n size -= 1\n }\n return hash\n}\n\n/* Show the original list and the unique values */\n$print(original, \"\\n\")\nvar show = function(k, v) $print(v, \" \")\n$hiter(dedup(original), show)\n$print(\"\\n\")\n","language":"Neko"},{"code":"using System.Console;\n\nmodule RemDups\n{\n Main() : void\n {\n def nums = array[1, 4, 6, 3, 6, 2, 7, 2, 5, 2, 6, 8];\n def unique = $[n | n in nums].RemoveDuplicates();\n WriteLine(unique);\n }\n}\n","language":"Nemerle"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary\n\n-- Note: Task requirement is to process \"arrays\". The following converts arrays into simple lists of words:\n-- Putting the resulting list back into an array is left as an exercise for the reader.\na1 = [2, 3, 5, 7, 11, 13, 17, 19, 'cats', 222, -100.2, +11, 1.1, +7, '7.', 7, 5, 5, 3, 2, 0, 4.4, 2]\na2 = [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\na3 = ['Now', 'is', 'the', 'time', 'for', 'all', 'good', 'men', 'to', 'come', 'to', 'the', 'aid', 'of', 'the', 'party.']\nx = 0\nlists = ''\nx = x + 1; lists[0] = x; lists[x] = array2wordlist(a1)\nx = x + 1; lists[0] = x; lists[x] = array2wordlist(a2)\nx = x + 1; lists[0] = x; lists[x] = array2wordlist(a3)\n\nloop ix = 1 to lists[0]\n nodups_list = remove_dups(lists[ix])\n say ix.right(4)':' lists[ix]\n say ''.right(4)':' nodups_list\n say\n end ix\n\nreturn\n\n-- =============================================================================\nmethod remove_dups(list) public static\n\n newlist = ''\n nodups = '0'\n loop w_ = 1 to list.words()\n ix = list.word(w_)\n nodups[ix] = nodups[ix] + 1 -- we can even collect a count of dups if we want\n end w_\n loop k_ over nodups\n newlist = newlist k_\n end k_\n\n return newlist.space\n\n-- =============================================================================\nmethod array2wordlist(ra = Rexx[]) public static\n\n wordlist = ''\n loop r_ over ra\n wordlist = wordlist r_\n end r_\n\n return wordlist.space\n","language":"NetRexx"},{"code":"(unique '(1 2 3 a b c 2 3 4 b c d))\n","language":"NewLISP"},{"code":"uniques := [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\ncull uniques\n=+-+-+-+-+-+-+-+-+\n=|1|2|3|a|b|c|4|d|\n=+-+-+-+-+-+-+-+-+\n","language":"Nial"},{"code":"cull 1 1 2 2 3 3\n=1 2 3\n","language":"Nial"},{"code":"import sequtils, algorithm, intsets\n\n# Go through the list, and for each element, check the rest of the list to see\n# if it appears again,\nvar items = @[1, 2, 3, 2, 3, 4, 5, 6, 7]\necho deduplicate(items) # O(n^2)\n\nproc filterDup(xs: openArray[int]): seq[int] =\n result = @[xs[0]]\n var last = xs[0]\n for x in xs[1..xs.high]:\n if x != last:\n result.add(x)\n last = x\n\n# Put the elements into a hash table which does not allow duplicates.\nvar s = initIntSet()\nfor x in items:\n s.incl(x)\necho s\n\n# Sort the elements and remove consecutive duplicate elements.\nsort(items, system.cmp[int]) # O(n log n)\necho filterDup(items) # O(n)\n","language":"Nim"},{"code":"MODULE RD;\n\nIMPORT Out;\n\nTYPE\n TArray = ARRAY 7 OF INTEGER;\n\nVAR\n DataArray,ResultArray:TArray;\n ResultIndex,LastResultIndex,Position:LONGINT;\n IsNewNumber:BOOLEAN;\n\nPROCEDURE Init(VAR A:TArray);\nBEGIN\n A[0] := 1; A[1] := 2; A[2] := 2; A[3] := 3;\n A[4] := 4; A[5] := 5; A[6] := 5;\nEND Init;\n\nBEGIN\n Init(DataArray);\n ResultArray[0] := DataArray[0];\n LastResultIndex := 0;\n Position := 0;\n WHILE Position < LEN(DataArray)-1 DO\n INC(Position);\n IsNewNumber := TRUE;\n ResultIndex := 0;\n WHILE(ResultIndex <= LastResultIndex) & (IsNewNumber) DO\n IF DataArray[Position] = ResultArray[ResultIndex] THEN\n\tIsNewNumber := FALSE;\n END;\n INC(ResultIndex);\n END;\n IF IsNewNumber THEN\n INC(LastResultIndex);\n ResultArray[LastResultIndex] := DataArray[Position];\n END;\n END;\n FOR ResultIndex := 0 TO LastResultIndex DO\n Out.Int(ResultArray[ResultIndex],0); Out.Char(' ');\n END;\n Out.Ln;\nEND RD.\n","language":"Oberon"},{"code":"use Structure;\n\nbundle Default {\n class Unique {\n function : Main(args : String[]) ~ Nil {\n nums := [1, 1, 2, 3, 4, 4];\n unique := IntVector->New();\n\n each(i : nums) {\n n := nums[i];\n if(unique->Has(n) = false) {\n unique->AddBack(n);\n };\n };\n\n each(i : unique) {\n unique->Get(i)->PrintLine();\n };\n }\n }\n}\n","language":"Objeck"},{"code":"NSArray *items = [NSArray arrayWithObjects:@\"A\", @\"B\", @\"C\", @\"B\", @\"A\", nil];\n\nNSSet *unique = [NSSet setWithArray:items];\n","language":"Objective-C"},{"code":"let uniq lst =\n let unique_set = Hashtbl.create (List.length lst) in\n List.iter (fun x -> Hashtbl.replace unique_set x ()) lst;\n Hashtbl.fold (fun x () xs -> x :: xs) unique_set []\n\nlet _ =\n uniq [1;2;3;2;3;4]\n","language":"OCaml"},{"code":"let uniq lst =\n let seen = Hashtbl.create (List.length lst) in\n List.filter (fun x -> let tmp = not (Hashtbl.mem seen x) in\n Hashtbl.replace seen x ();\n tmp) lst\n\nlet _ =\n uniq [1;2;3;2;3;4]\n","language":"OCaml"},{"code":"let uniq l =\n let rec tail_uniq a l =\n match l with\n | [] -> a\n | hd::tl -> tail_uniq (hd::a) (List.filter (fun x -> x != hd) tl) in\n tail_uniq [] l\n","language":"OCaml"},{"code":"List.sort_uniq compare [1;2;3;2;3;4]\n","language":"OCaml"},{"code":"input=[1 2 6 4 2 32 5 5 4 3 3 5 1 2 32 4 4];\noutput=unique(input);\n","language":"Octave"},{"code":"data = .array~of(1, 2, 3, \"a\", \"b\", \"c\", 2, 3, 4, \"b\", \"c\", \"d\")\nuniqueData = .set~new~union(data)~makearray~sort\n\nsay \"Unique elements are\"\nsay\ndo item over uniqueData\n say item\nend\n","language":"OoRexx"},{"code":"declare\n\n fun {Nub Xs}\n D = {Dictionary.new}\n in\n for X in Xs do D.X := unit end\n {Dictionary.keys D}\n end\n\nin\n\n {Show {Nub [1 2 1 3 5 4 3 4 4]}}\n","language":"Oz"},{"code":"rd(v)={\n vecsort(v,,8)\n};\n","language":"PARI-GP"},{"code":"Program RemoveDuplicates;\n\nconst\n iArray: array[1..7] of integer = (1, 2, 2, 3, 4, 5, 5);\n\nvar\n rArray: array[1..7] of integer;\n i, pos, last: integer;\n newNumber: boolean;\n\nbegin\n rArray[1] := iArray[1];\n last := 1;\n pos := 1;\n while pos < high(iArray) do\n begin\n inc(pos);\n newNumber := true;\n for i := low(rArray) to last do\n if iArray[pos] = rArray[i] then\n begin\n newNumber := false;\n\tbreak;\n end;\n if newNumber then\n begin\n inc(last);\n rArray[last] := iArray[pos];\n end;\n end;\n for i := low(rArray) to last do\n writeln (rArray[i]);\nend.\n","language":"Pascal"},{"code":"use List::MoreUtils qw(uniq);\n\nmy @uniq = uniq qw(1 2 3 a b c 2 3 4 b c d);\n","language":"Perl"},{"code":"my %seen;\nmy @uniq = grep {!$seen{$_}++} qw(1 2 3 a b c 2 3 4 b c d);\n","language":"Perl"},{"code":"my %hash = map { $_ => 1 } qw(1 2 3 a b c 2 3 4 b c d);\nmy @uniq = keys %hash;\n","language":"Perl"},{"code":"my %seen;\n@seen{qw(1 2 3 a b c 2 3 4 b c d)} = ();\nmy @uniq = keys %seen;\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">unique</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Now is the time for all good men to come to the aid of the party.\"</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #008000;\">\"STABLE\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">unique</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">15</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #008000;\">\"STABLE\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">unique</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"a\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"b\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"c\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"b\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"c\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"d\"</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #008000;\">\"STABLE\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">unique</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #008000;\">\"STABLE\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">unique</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"chthonic eleemosynary paronomasiac\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"STABLE\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"\"Now\" \"is\" \"the\" \"time\" \"for\" \"all\" \"good\" \"men\" \"to\" \"come\" \"to\" \"the\" \"aid\" \"of\" \"the\" \"party.\" stklen tolist\n\n0 tolist var newlist\n\nlen for\n get newlist over find\n not if\n swap 0 put var newlist\n else\n drop drop\n endif\nendfor\n\nnewlist print drop\n","language":"Phixmonti"},{"code":"$list = array(1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd');\n$unique_list = array_unique($list);\n","language":"PHP"},{"code":"(uniq (2 4 6 1 2 3 4 5 6 1 3 5))\n","language":"PicoLisp"},{"code":"*process mar(1,72);\nremdup: Proc options(main);\n declare t(20) fixed initial (6, 6, 1, 5, 6, 2, 1, 7,\n 5, 22, 4, 19, 1, 1, 6, 8, 9, 10, 11, 12);\n declare (i, j, k, n, e) fixed;\n\n put skip list ('Input:');\n put edit ((t(k) do k = 1 to hbound(t))) (skip,20(f(3)));\n n = hbound(t,1);\n i = 0;\nouter:\n do k = 1 to n;\n e = t(k);\n do j = k-1 to 1 by -1;\n if e = t(j) then iterate outer;\n end;\n i = i + 1;\n t(i) = e;\n end;\n\n put skip list ('Unique elements are:');\n put edit ((t(k) do k = 1 to i)) (skip,20(f(3)));\nend;\n","language":"PL-I"},{"code":";;; Initial array\nlvars ar = {1 2 3 2 3 4};\n;;; Create a hash table\nlvars ht= newmapping([], 50, 0, true);\n;;; Put all array as keys into the hash table\nlvars i;\nfor i from 1 to length(ar) do\n 1 -> ht(ar(i))\nendfor;\n\n;;; Collect keys into a list\nlvars ls = [];\nappdata(ht, procedure(x); cons(front(x), ls) -> ls; endprocedure);\n","language":"Pop11"},{"code":" [10 8 8 98 32 2 4 5 10 ] dup length dict begin aload let* currentdict {pop} map end\n","language":"PostScript"},{"code":"$data = 1,2,3,1,2,3,4,1\n","language":"PowerShell"},{"code":"$h = @{}\nforeach ($x in $data) {\n $h[$x] = 1\n}\n$h.Keys\n","language":"PowerShell"},{"code":"$data | Sort-Object -Unique\n","language":"PowerShell"},{"code":"$data | Select-Object -Unique\n","language":"PowerShell"},{"code":"uniq(Data,Uniques) :- sort(Data,Uniques).\n","language":"Prolog"},{"code":"?- uniq([1, 2, 3, 2, 3, 4],Xs).\nXs = [1, 2, 3, 4]\n","language":"Prolog"},{"code":"member1(X,[H|_]) :- X==H,!.\nmember1(X,[_|T]) :- member1(X,T).\n\ndistinct([],[]).\ndistinct([H|T],C) :- member1(H,T),!, distinct(T,C).\ndistinct([H|T],[H|C]) :- distinct(T,C).\n","language":"Prolog"},{"code":"?- distinct([A, A, 1, 2, 3, 2, 3, 4],Xs).\nXs = [A, 1, 2, 3, 4]\n","language":"Prolog"},{"code":"NewMap MyElements.s()\n\nFor i=0 To 9 ;Mark 10 items at random, causing high risk of duplication items.\n x=Random(9)\n t$=\"Number \"+str(x)+\" is marked\"\n MyElements(str(x))=t$ ; Add element 'X' to the hash list or overwrite if already included.\nNext\n\nForEach MyElements()\n Debug MyElements()\nNext\n","language":"PureBasic"},{"code":"items = [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\nunique = list(set(items))\n","language":"Python"},{"code":"items = [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\nunique = []\nhelperset = set()\nfor x in items:\n if x not in helperset:\n unique.append(x)\n helperset.add(x)\n","language":"Python"},{"code":"import itertools\nitems = [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\nunique = [k for k,g in itertools.groupby(sorted(items))]\n","language":"Python"},{"code":"items = [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\nunique = []\nfor x in items:\n if x not in unique:\n unique.append(x)\n","language":"Python"},{"code":"from collections import OrderedDict as od\n\nprint(list(od.fromkeys([1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']).keys()))\n","language":"Python"},{"code":"from itertools import (groupby)\n\n\n# nubByKey :: (a -> b) -> [a] -> [a]\ndef nubByKey(k, xs):\n return list(list(v)[0] for _, v in groupby(sorted(xs, key=k), key=k))\n\n\nxs = [\n 'apple', 'apple',\n 'ampersand', 'aPPLE', 'Apple',\n 'orange', 'ORANGE', 'Orange', 'orange', 'apple'\n]\nfor k in [\n id, # default case sensitive uniqueness\n lambda x: x.lower(), # case-insensitive uniqueness\n lambda x: x[0], # unique first character (case-sensitive)\n lambda x: x[0].lower(), # unique first character (case-insensitive)\n]:\n print (\n nubByKey(k, xs)\n )\n","language":"Python"},{"code":"# nubByEq :: (a -> a -> Bool) -> [a] -> [a]\ndef nubByEq(eq, xs):\n def go(yys, xxs):\n if yys:\n y = yys[0]\n ys = yys[1:]\n return go(ys, xxs) if (\n elemBy(eq, y, xxs)\n ) else (\n [y] + go(ys, [y] + xxs)\n )\n else:\n return []\n return go(xs, [])\n\n\n# elemBy :: (a -> a -> Bool) -> a -> [a] -> Bool\ndef elemBy(eq, x, xs):\n if xs:\n return eq(x, xs[0]) or elemBy(eq, x, xs[1:])\n else:\n return False\n\n\nxs = [\n 'apple', 'apple',\n 'ampersand', 'aPPLE', 'Apple',\n 'orange', 'ORANGE', 'Orange', 'orange', 'apple'\n]\nfor eq in [\n lambda a, b: a == b, # default case sensitive uniqueness\n lambda a, b: a.lower() == b.lower(), # case-insensitive uniqueness\n lambda a, b: a[0] == b[0], # unique first char (case-sensitive)\n lambda a, b: a[0].lower() == b[0].lower(), # unique first char (any case)\n]:\n print (\n nubByEq(eq, xs)\n )\n","language":"Python"},{"code":"# nubBy :: (a -> a -> Bool) -> [a] -> [a]\ndef nubBy(p, xs):\n def go(xs):\n if xs:\n x = xs[0]\n return [x] + go(\n list(filter(\n lambda y: not p(x, y),\n xs[1:]\n ))\n )\n else:\n return []\n return go(xs)\n","language":"Python"},{"code":"(define remove-duplicates\n [] -> []\n [A|R] -> (remove-duplicates R) where (element? A R)\n [A|R] -> [A|(remove-duplicates R)])\n\n(remove-duplicates [a b a a b b c d e])\n","language":"Qi"},{"code":" [ dup [] = iff ]else[ done\n ' sortwith nested\n ]'[ nested join do\n behead dup dip nested rot\n witheach\n [ tuck != if\n [ dup dip\n [ nested join ] ] ]\n drop ] is uniquewith ( [ --> [ )\n\n ' [ 1 2 3 5 6 7 8 1 2 3 4 5 6 7 ] uniquewith > echo\n","language":"Quackery"},{"code":"items <- c(1,2,3,2,4,3,2)\nunique (items)\n","language":"R"},{"code":"-> (remove-duplicates '(2 1 3 2.0 a 4 5 b 4 3 a 7 1 3 x 2))\n'(2 1 3 2.0 a 4 5 b 7 x)\n","language":"Racket"},{"code":"(define (unique/hash lst)\n (hash-keys (for/hash ([x (in-list lst)]) (values x #t))))\n","language":"Racket"},{"code":"(define unique/set (compose1 set->list list->set))\n","language":"Racket"},{"code":"(define (unique seq #:same-test [same? equal?])\n (for/fold ([res '()])\n ([x seq] #:unless (memf (curry same? x) res))\n (cons x res)))\n","language":"Racket"},{"code":"my @unique = [1, 2, 3, 5, 2, 4, 3, -3, 7, 5, 6].unique;\n","language":"Raku"},{"code":"set(1,2,3,5,2,4,3,-3,7,5,6).list\n","language":"Raku"},{"code":"[ 1 2 3 'a' 'b' 'c' 2 3 4 'b' 'c' 'd' ] as items\nitems copy unique print\n\nlist (8 items)\n 0 => 1\n 1 => 2\n 2 => 3\n 3 => \"a\"\n 4 => \"b\"\n 5 => \"c\"\n 6 => 4\n 7 => \"d\"\n","language":"Raven"},{"code":"print mold unique [1 $23.19 2 elbow 3 2 Bork 4 3 elbow 2 $23.19]\n","language":"REBOL"},{"code":">> items: [1 \"a\" \"c\" 1 3 4 5 \"c\" 3 4 5]\n>> unique items\n== [1 \"a\" \"c\" 3 4 5]\n","language":"Red"},{"code":"/*REXX program removes any duplicate elements (items) that are in a list (using a hash).*/\n$= '2 3 5 7 11 13 17 19 cats 222 -100.2 +11 1.1 +7 7. 7 5 5 3 2 0 4.4 2' /*item list.*/\nsay 'original list:' $\nsay right( words($), 17, '─') 'words in the original list.'\nz=; @.= /*initialize the NEW list & index list.*/\n do j=1 for words($); y= word($, j) /*process the words (items) in the list*/\n if @.y=='' then z= z y; @.y= . /*Not duplicated? Add to Z list,@ array*/\n end /*j*/\nsay\nsay 'modified list:' space(z) /*stick a fork in it, we're all done. */\nsay right( words(z), 17, '─') 'words in the modified list.'\n","language":"REXX"},{"code":"/*REXX program removes any duplicate elements (items) that are in a list (using a list).*/\n$= '2 3 5 7 11 13 17 19 cats 222 -100.2 +11 1.1 +7 7. 7 5 5 3 2 0 4.4 2' /*item list.*/\nsay 'original list:' $\nsay right( words($), 17, '─') 'words in the original list.'\n#= words($) /*process all the words in the list. */\n do j=# by -1 for #; y= word($, j) /*get right-to-Left. */\n _= wordpos(y, $, j + 1); if _\\==0 then $= delword($, _, 1) /*Dup? Then delete it*/\n end /*j*/\nsay\nsay 'modified list:' space($) /*stick a fork in it, we're all done. */\nsay right( words(z), 17, '─') 'words in the modified list.'\n","language":"REXX"},{"code":"/*REXX program removes any duplicate elements (items) that are in a list (using 2 lists)*/\nold = '2 3 5 7 11 13 17 19 cats 222 -100.2 +11 1.1 +7 7. 7 5 5 3 2 0 4.4 2'\nsay 'original list:' old\nsay right( words(old), 17, '─') 'words in the original list.'\nnew= /*start with a clean (list) slate. */\n do j=1 for words(old); _= word(old, j) /*process the words in the OLD list. */\n if wordpos(_, new)==0 then new= new _ /*Doesn't exist? Then add word to NEW.*/\n end /*j*/\nsay\nsay 'modified list:' space(new) /*stick a fork in it, we're all done. */\nsay right( words(new), 17, '─') 'words in the modified list.'\n","language":"REXX"},{"code":"/* REXX ************************************************************\n* 26.11.2012 Walter Pachl\n* added: show multiple occurrences\n**********************************************************************/\nold='2 3 5 7 11 13 17 19 cats 222 -100.2 +11 1.1 +7 7. 7 5 5',\n '3 2 0 4.4 2'\nsay 'old list='old\nsay 'words in the old list=' words(old)\nnew=''\nfound.=0\ncount.=0\nDo While old<>''\n Parse Var old w old\n If found.w=0 Then Do\n new=new w\n found.w=1\n End\n count.w=count.w+1\n End\nsay 'new list='strip(new)\nsay 'words in the new list=' words(new)\nSay 'Multiple occurrences:'\nSay 'occ word'\nDo While new<>''\n Parse Var new w new\n If count.w>1 Then\n Say right(count.w,3) w\n End\n","language":"REXX"},{"code":"list = [\"Now\", \"is\", \"the\", \"time\", \"for\", \"all\", \"good\", \"men\", \"to\", \"come\", \"to\", \"the\", \"aid\", \"of\", \"the\", \"party.\"]\nfor i = 1 to len(list)\n for j = i + 1 to len(list)\n if list[i] = list[j] del(list, j) j-- ok\n next\nnext\n\nfor n = 1 to len(list)\n see list[n] + \" \"\nnext\nsee nl\n","language":"Ring"},{"code":"ary = [1,1,2,1,'redundant',[1,2,3],[1,2,3],'redundant']\np ary.uniq # => [1, 2, \"redundant\", [1, 2, 3]]\n","language":"Ruby"},{"code":"class Array\n # used Hash\n def uniq1\n each_with_object({}) {|elem, h| h[elem] = true}.keys\n end\n # sort (requires comparable)\n def uniq2\n sorted = sort\n pre = sorted.first\n sorted.each_with_object([pre]){|elem, uniq| uniq << (pre = elem) if elem != pre}\n end\n # go through the list\n def uniq3\n each_with_object([]) {|elem, uniq| uniq << elem unless uniq.include?(elem)}\n end\nend\n\nary = [1,1,2,1,'redundant',[1,2,3],[1,2,3],'redundant']\np ary.uniq1 #=> [1, 2, \"redundant\", [1, 2, 3]]\np ary.uniq2 rescue nil # Error (not comparable)\np ary.uniq3 #=> [1, 2, \"redundant\", [1, 2, 3]]\n\nary = [1,2,3,7,6,5,2,3,4,5,6,1,1,1]\np ary.uniq1 #=> [1, 2, 3, 7, 6, 5, 4]\np ary.uniq2 #=> [1, 2, 3, 4, 5, 6, 7]\np ary.uniq3 #=> [1, 2, 3, 7, 6, 5, 4]\n","language":"Ruby"},{"code":"def unique(array)\n pure = Array.new\n for i in array\n flag = false\n for j in pure\n flag = true if j==i\n end\n pure << i unless flag\n end\n return pure\nend\n\nunique [\"hi\",\"hey\",\"hello\",\"hi\",\"hey\",\"heyo\"] # => [\"hi\", \"hey\", \"hello\", \"heyo\"]\nunique [1,2,3,4,1,2,3,5,1,2,3,4,5] # => [1,2,3,4,5]\n","language":"Ruby"},{"code":"a$ = \"2 3 5 7 11 13 17 19 cats 222 -100.2 +11 1.1 +7 7. 7 5 5 3 2 0 4.4 2\"\n\nfor i = 1 to len(a$)\n a1$ = word$(a$,i)\n if a1$ = \"\" then exit for\n for i1 = 1 to len(b$)\n if a1$ = word$(b$,i1) then [nextWord]\n next i1\n b$ = b$ + a1$ + \" \"\n[nextWord]\nnext i\n\n print \"Dups:\";a$\n print \"No Dups:\";b$\n","language":"Run-BASIC"},{"code":"use std::collections::HashSet;\nuse std::hash::Hash;\n\nfn remove_duplicate_elements_hashing<T: Hash + Eq>(elements: &mut Vec<T>) {\n let set: HashSet<_> = elements.drain(..).collect();\n elements.extend(set.into_iter());\n}\n\nfn remove_duplicate_elements_sorting<T: Ord>(elements: &mut Vec<T>) {\n elements.sort_unstable(); // order does not matter\n elements.dedup();\n}\n\nfn main() {\n let mut sample_elements = vec![0, 0, 1, 1, 2, 3, 2];\n println!(\"Before removal of duplicates : {:?}\", sample_elements);\n remove_duplicate_elements_sorting(&mut sample_elements);\n println!(\"After removal of duplicates : {:?}\", sample_elements);\n}\n","language":"Rust"},{"code":"val list = List(1,2,3,4,2,3,4,99)\nval l2 = list.distinct\n// l2: scala.List[scala.Int] = List(1,2,3,4,99)\n\nval arr = Array(1,2,3,4,2,3,4,99)\nval arr2 = arr.distinct\n// arr2: Array[Int] = Array(1, 2, 3, 4, 99)\n","language":"Scala"},{"code":"(define (remove-duplicates l)\n (cond ((null? l)\n '())\n ((member (car l) (cdr l))\n (remove-duplicates (cdr l)))\n (else\n (cons (car l) (remove-duplicates (cdr l))))))\n\n(remove-duplicates '(1 2 1 3 2 4 5))\n","language":"Scheme"},{"code":"(1 3 2 4 5)\n","language":"Scheme"},{"code":"(define (remove-duplicates l)\n (do ((a '() (if (member (car l) a) a (cons (car l) a)))\n (l l (cdr l)))\n ((null? l) (reverse a))))\n\n(remove-duplicates '(1 2 1 3 2 4 5))\n","language":"Scheme"},{"code":"(1 2 3 4 5)\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n\nconst proc: main is func\n local\n const array integer: data is [] (1, 3, 2, 9, 1, 2, 3, 8, 8, 1, 0, 2);\n var set of integer: dataSet is (set of integer).value;\n var integer: number is 0;\n begin\n for number range data do\n incl(dataSet, number);\n end for;\n writeln(dataSet);\n end func;\n","language":"Seed7"},{"code":"items := [0,7,6,6,4,9,7,1,2,3,2];\nprint(unique(items));\n","language":"SETL"},{"code":"proc unique(items);\n return [item: item in {item: item in items}];\nend proc;\n","language":"SETL"},{"code":"proc unique(items);\n seen := {};\n return [item: item in items, nps in {#seen} | #(seen with:= item) > nps];\nend proc;\n","language":"SETL"},{"code":"proc unique(items);\n seen := {};\n return [item: item in items, nps in {#seen} | #(seen with:= item) > nps];\nend proc;\n","language":"SETL"},{"code":"items := [0,7,6,6,4,9,7,1,2,3,2];\nprint(unique(items));\n","language":"SETL"},{"code":"proc unique(items);\n return [item: item in {item: item in items}];\nend proc;\n","language":"SETL"},{"code":"set = new('set')\n* Add all the elements of the array to the set.\nadd(set,array)\n","language":"Setl4"},{"code":"var ary = [1,1,2,1,'redundant',[1,2,3],[1,2,3],'redundant'];\nsay ary.uniq.dump;\nsay ary.last_uniq.dump;\n","language":"Sidef"},{"code":"[|:s| #(1 2 3 4 1 2 3 4) >> s] writingAs: Set.\n\n\"==> {\"Set traitsWindow\" 1. 2. 3. 4}\"\n","language":"Slate"},{"code":"\"Example of creating a collection\"\n|a|\na := #( 1 1 2 'hello' 'world' #symbol #another 2 'hello' #symbol ).\na asSet.\n","language":"Smalltalk"},{"code":"|a|\na := #( 1 1 2 'hello' 'world' #symbol #another 2 'hello' #symbol ).\na asOrderedSet.\n","language":"Smalltalk"},{"code":"function undupe(arr) {\n\tvar t = {};\n\tforeach(arr, function(key, val) {\n\t\tt[val] = true;\n\t});\n\n\tvar r = {};\n\tforeach(t, function(key) {\n\t\tr[sizeof r] = key;\n\t});\n\n\treturn r;\n}\n","language":"Sparkling"},{"code":"/*\nThis code is an implementation of \"Remove duplicate elements\" in SQL ORACLE 19c\np_in_str -- input string\np_delimiter -- delimeter\n*/\nwith\n function remove_duplicate_elements(p_in_str in varchar2, p_delimiter in varchar2 default ',') return varchar2 is\n v_in_str varchar2(32767) := replace(p_in_str,p_delimiter,',');\n v_res varchar2(32767);\nbegin\n --\n execute immediate 'select listagg(distinct cv,:p_delimiter) from (select (column_value).getstringval() cv from xmltable(:v_in_str))'\n into v_res using p_delimiter, v_in_str;\n --\n return v_res;\n --\nend;\n\n--Test\nselect remove_duplicate_elements('1, 2, 3, \"a\", \"b\", \"c\", 2, 3, 4, \"b\", \"c\", \"d\"') as res from dual\nunion all\nselect remove_duplicate_elements('3 9 1 10 3 7 6 5 2 7 4 7 4 2 2 2 2 8 2 10 4 9 2 4 9 3 4 3 4 7',' ') as res from dual\n;\n","language":"SQL"},{"code":". clear all\n. input x y\n1 1\n1 1\n1 2\n2 1\n2 2\n1 1\n2 1\n2 1\n1 2\n2 2\nend\n\n. duplicates drop x y, force\n. list\n\n +-------+\n | x y |\n |-------|\n 1. | 1 1 |\n 2. | 1 2 |\n 3. | 2 1 |\n 4. | 2 2 |\n +-------+\n","language":"Stata"},{"code":". mata\n: a=1,1\\1,1\\1,2\\2,1\\2,2\\1,1\\2,1\\2,1\\1,2\\2,2\n\n: a\n 1 2\n +---------+\n 1 | 1 1 |\n 2 | 1 1 |\n 3 | 1 2 |\n 4 | 2 1 |\n 5 | 2 2 |\n 6 | 1 1 |\n 7 | 2 1 |\n 8 | 2 1 |\n 9 | 1 2 |\n 10 | 2 2 |\n +---------+\n\n: uniqrows(a)\n 1 2\n +---------+\n 1 | 1 1 |\n 2 | 1 2 |\n 3 | 2 1 |\n 4 | 2 2 |\n +---------+\n","language":"Stata"},{"code":"println(Array(Set([3,2,1,2,3,4])))\n","language":"Swift"},{"code":"func uniq<T: Hashable>(lst: [T]) -> [T] {\n var seen = Set<T>(minimumCapacity: lst.count)\n return lst.filter { x in\n let unseen = !seen.contains(x)\n seen.insert(x)\n return unseen\n }\n}\n\nprintln(uniq([3,2,1,2,3,4]))\n","language":"Swift"},{"code":"func uniq<T: Equatable>(lst: [T]) -> [T] {\n var seen = [T]()\n return lst.filter { x in\n let unseen = find(seen, x) == nil\n if (unseen) {\n seen.append(x)\n }\n return unseen\n }\n}\n\nprintln(uniq([3,2,1,2,3,4]))\n","language":"Swift"},{"code":"set result [lsort -unique $listname]\n","language":"Tcl"},{"code":"OPTION BASE 1\nLET max = 10\nDIM dat(10), res(10)\nFOR i = 1 TO max\n READ dat(i)\nNEXT i\n\nDATA 1, 2, 1, 4, 5, 2, 15, 1, 3, 4\n\nLET res(1) = dat(1)\nLET count = 1\nLET posic = 1\nDO WHILE posic < max\n LET posic = posic + 1\n LET esnuevo = 1\n LET indice = 1\n DO WHILE (indice <= count) AND esnuevo = 1\n IF dat(posic) = res(indice) THEN LET esnuevo = 0\n LET indice = indice + 1\n LOOP\n IF esnuevo = 1 THEN\n LET count = count + 1\n LET res(count) = dat(posic)\n END IF\nLOOP\n\nFOR i = 1 TO count\n PRINT res(i);\nNEXT i\nEND\n","language":"True-BASIC"},{"code":"//\n// Go through the list, and for each element, check the rest of the list to see if it appears again, and discard it if it does.\n//\nINTEGER PROC FNBlockGetUniqueAllToBufferB( INTEGER bufferI )\n INTEGER B = FALSE\n INTEGER downB = TRUE\n STRING s[255] = \"\"\n IF ( NOT ( IsBlockInCurrFile() ) ) Warn( \"Please mark a block\" ) B = FALSE RETURN( B ) ENDIF // return from the current procedure if no block is marked\n PushPosition()\n PushBlock()\n GotoBlockBegin()\n WHILE ( ( IsCursorInBlock() ) AND ( downB ) )\n s = GetText( 1, MAXSTRINGLEN )\n PushPosition()\n PushBlock()\n GotoBufferId( bufferI )\n IF NOT LFind( s, \"\" )\n AddLine( s )\n ENDIF\n PopBlock()\n PopPosition()\n downB = Down()\n ENDWHILE\n PopPosition()\n PopBlock()\n B = TRUE\n RETURN( B )\nEND\n//\nPROC Main()\n INTEGER bufferI = 0\n PushPosition()\n bufferI = CreateTempBuffer()\n PopPosition()\n Message( FNBlockGetUniqueAllToBufferB( bufferI ) ) // gives e.g. TRUE\n GotoBufferId( bufferI )\nEND\n","language":"TSE-SAL"},{"code":"$$ MODE TUSCRIPT\nlist_old=\"b'A'A'5'1'2'3'2'3'4\"\nlist_sort=MIXED_SORT (list_old)\nlist_new=REDUCE (list_sort)\nPRINT list_old\nPRINT list_new\n","language":"TUSCRIPT"},{"code":"$$ MODE TUSCRIPT\nlist_old=\"b'A'A'5'1'2'3'2'3'4\"\nDICT list CREATE\nLOOP l=list_old\nDICT list LOOKUP l,num\nIF (num==0) DICT list ADD l\nENDLOOP\nDICT list unload list\nlist_new=JOIN (list)\nPRINT list_old\nPRINT list_new\n","language":"TUSCRIPT"},{"code":"bash$ # original list\nbash$ printf '6\\n2\\n3\\n6\\n4\\n2\\n'\n6\n2\n3\n6\n4\n2\nbash$ # made uniq\nbash$ printf '6\\n2\\n3\\n6\\n4\\n2\\n'|sort -n|uniq\n2\n3\n4\n6\nbash$\n","language":"UnixPipes"},{"code":"bash$ # made uniq\nbash$ printf '6\\n2\\n3\\n6\\n4\\n2\\n'|sort -nu\n2\n3\n4\n6\nbash$\n","language":"UnixPipes"},{"code":"#cast %s\n\nexample = |=hS& 'mississippi'\n","language":"Ursala"},{"code":"const list = 'a,1,a,b,b,c,d,e,d,0,f,f,5,f,g,h,1,3,3'\n\nfn main() {\n\tprintln(unique(list))\n}\n\nfn unique(list string) []string {\n mut new_list := []string{}\n for word in list.split(',') {\n if new_list.any(it == word.str()) == false {\n new_list << word\n }\n }\n new_list.sort()\n return new_list\n}\n","language":"V-(Vlang)"},{"code":"Option Explicit\n\nSub Main()\nDim myArr() As Variant, i As Long\n\n myArr = Remove_Duplicate(Array(1.23456789101112E+16, True, False, True, \"Alpha\", 1, 235, 4, 1.25, 1.25, \"Beta\", 1.23456789101112E+16, \"Delta\", \"Alpha\", \"Charlie\", 1, 2, \"Foxtrot\", \"Foxtrot\", \"Alpha\", 235))\n'return :\n For i = LBound(myArr) To UBound(myArr)\n Debug.Print myArr(i)\n Next\nEnd Sub\n\nPrivate Function Remove_Duplicate(Arr As Variant) As Variant()\nDim myColl As New Collection, Temp() As Variant, i As Long, cpt As Long\n\n ReDim Temp(UBound(Arr))\n For i = LBound(Arr) To UBound(Arr)\n On Error Resume Next\n myColl.Add CStr(Arr(i)), CStr(Arr(i))\n If Err.Number > 0 Then\n On Error GoTo 0\n Else\n Temp(cpt) = Arr(i)\n cpt = cpt + 1\n End If\n Next i\n ReDim Preserve Temp(cpt - 1)\n Remove_Duplicate = Temp\nEnd Function\n","language":"VBA"},{"code":"Function remove_duplicates(list)\n\tarr = Split(list,\",\")\n\tSet dict = CreateObject(\"Scripting.Dictionary\")\n\tFor i = 0 To UBound(arr)\n\t\tIf dict.Exists(arr(i)) = False Then\n\t\t\tdict.Add arr(i),\"\"\n\t\tEnd If\n\tNext\n\tFor Each key In dict.Keys\n\t\ttmp = tmp & key & \",\"\n\tNext\n\tremove_duplicates = Left(tmp,Len(tmp)-1)\nEnd Function\n\nWScript.Echo remove_duplicates(\"a,a,b,b,c,d,e,d,f,f,f,g,h\")\n","language":"VBScript"},{"code":"Sort(0, File_Size) // sort the data\nWhile(Replace(\"^(.*)\\N\\1$\", \"\\1\", REGEXP+BEGIN+NOERR)){} // remove duplicates\n","language":"Vedit-macro-language"},{"code":"call filter(list, 'count(list, v:val) == 1')\n","language":"Vim-Script"},{"code":"LOCAL i As Integer, n As Integer, lcOut As String\nCLOSE DATABASES ALL\nCLEAR\nCREATE CURSOR nums (num I)\nINDEX ON num TAG num COLLATE \"Machine\"\nSET ORDER TO 0\nn = 50\nRAND(-1)\nFOR i = 1 TO n\n INSERT INTO nums VALUES (RanInt(1, 10))\nENDFOR\nSELECT num, COUNT(num) As cnt FROM nums ;\nGROUP BY num INTO CURSOR grouped\nLIST OFF TO FILE grouped.txt NOCONSOLE\nlcOut = \"\"\nSCAN\n lcOut = lcOut + TRANSFORM(num) + \",\"\nENDSCAN\nlcOut = LEFT(lcOut, LEN(lcOut)-1)\n? lcOut\t\n\nFUNCTION RanInt(tnLow As Integer, tnHigh As Integer) As Integer\nRETURN INT((tnHigh - tnLow + 1)*RAND() + tnLow)\nENDFUNC\n","language":"Visual-FoxPro"},{"code":"def (dedup l)\n let exists (table)\n collect+each x l\n unless exists.x\n yield x\n exists.x <- 1\n","language":"Wart"},{"code":"@uniq [1 2 3 2 1 2 3] ; returns [1 2 3]\n","language":"Wortel"},{"code":"import \"./sort\" for Sort\n\n// Using a map - order of distinct items is undefined.\nvar removeDuplicates1 = Fn.new { |a|\n if (a.count <= 1) return a\n var m = {}\n for (e in a) m[e] = true\n return m.keys.toList\n}\n\n// Sort elements and remove consecutive duplicates.\nvar removeDuplicates2 = Fn.new { |a|\n if (a.count <= 1) return a\n Sort.insertion(a)\n for (i in a.count-1..1) {\n if (a[i] == a[i-1]) a.removeAt(i)\n }\n return a\n}\n\n// Iterate through list and for each element check if it occurs later in the list.\n// If it does, discard it.\nvar removeDuplicates3 = Fn.new { |a|\n if (a.count <= 1) return a\n var i = 0\n while (i < a.count-1) {\n var j = i + 1\n while(j < a.count) {\n if (a[i] == a[j]) {\n a.removeAt(j)\n } else {\n j = j + 1\n }\n }\n i = i + 1\n }\n return a\n}\n\nvar a = [1,2,3,4,1,2,3,5,1,2,3,4,5]\nSystem.print(\"Original: %(a)\")\nSystem.print(\"Method 1: %(removeDuplicates1.call(a.toList))\") // copy original each time\nSystem.print(\"Method 2: %(removeDuplicates2.call(a.toList))\")\nSystem.print(\"Method 3: %(removeDuplicates3.call(a.toList))\")\n","language":"Wren"},{"code":"func RemoveDuplicates(Array){\n\tset NewArray = [];\n\tforeach(k,v as Array){\n\t\tif (NewArray->includes(v)){\n\t\t\tArray->splice(toint(k),1);\n\t\t} else {\n\t\t\tNewArray->push(v);\n\t\t}\n\t}\n}\n\nset Arr = [\"Hello\",1,2,\"Hello\",3,1];\nlog(Arr);\nRemoveDuplicates(Arr);\nlog(Arr);\n","language":"XBS"},{"code":"code Text=12; \\built-in routine to display a string of characters\nstring 0; \\use zero-terminated strings (not MSb terminated)\n\nfunc StrLen(S); \\Return number of characters in an ASCIIZ string\nchar S;\nint I;\nfor I:= 0, -1>>1-1 do \\(limit = 2,147,483,646 if 32 bit, or 32766 if 16 bit)\n if S(I) = 0 then return I;\n\nfunc Unique(S); \\Remove duplicate bytes from string\nchar S;\nint I, J, K, L;\n[L:= StrLen(S); \\string length\nfor I:= 0 to L-1 do \\for all characters in string...\n for J:= I+1 to L-1 do \\scan rest of string for duplicates\n if S(I) = S(J) then \\if duplicate then\n [for K:= J+1 to L do \\ shift rest of string down (including\n S(K-1):= S(K); \\ terminating zero)\n L:= L-1 \\ string is now one character shorter\n ];\nreturn S; \\return pointer to string\n];\n\nText(0, Unique(\"Pack my box with five dozen liquor jugs.\"))\n","language":"XPL0"},{"code":"data \"Now\", \"is\", \"the\", \"time\", \"for\", \"all\", \"good\", \"men\", \"to\", \"come\", \"to\", \"the\", \"aid\", \"of\", \"the\", \"party.\", \"\"\n\ndo\n read p$\n if p$ = \"\" break\n if not instr(r$, p$) r$ = r$ + p$ + \" \"\nloop\n\nprint r$\n","language":"Yabasic"},{"code":"zkl: Utils.Helpers.listUnique(T(1,3,2,9,1,2,3,8,8,\"8\",1,0,2,\"8\"))\nL(1,3,2,9,8,\"8\",0)\nzkl: \"1,3,2,9,1,2,3,8,8,1,0,2\".unique()\n,012389\n","language":"Zkl"},{"code":"fcn listUnique(xs){\n xs.reduce(fcn(us,s){us.holds(s) and us or us.append(s)},L()) }\n","language":"Zkl"},{"code":"program: remove_duplicate_elements\n input: [1,2,1,3,2,4,1]\n output: [1,2,3,4]\n","language":"Zoea"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Remove_duplicate_elements\\nnote: Sorting Algorithms\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"{{Sorting Algorithm}}\\n[[Category:Sorting]]\\n\\nGiven an Array, derive a sequence of elements in which all duplicates are removed.\\n\\nThere are basically three approaches seen here:\\n* Put the elements into a hash table which does not allow duplicates. The complexity is O(''n'') on average, and O(''n''<sup>2</sup>) worst case. This approach requires a hash function for your type (which is compatible with equality), either built-in to your language, or provided by the user.\\n* Sort the elements and remove consecutive duplicate elements. The complexity of the best sorting algorithms is O(''n'' log ''n''). This approach requires that your type be \\\"comparable\\\", i.e., have an ordering. Putting the elements into a self-balancing binary search tree is a special case of sorting.\\n* Go through the list, and for each element, check the rest of the list to see if it appears again, and discard it if it does. The complexity is O(''n''<sup>2</sup>). The up-shot is that this always works on any type (provided that you can test for equality).\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V items = [‘1’, ‘2’, ‘3’, ‘a’, ‘b’, ‘c’, ‘2’, ‘3’, ‘4’, ‘b’, ‘c’, ‘d’]\\nV unique = Array(Set(items))\\nprint(unique)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Remove duplicate elements - 18/10/2015\\nREMDUP CSECT\\n USING REMDUP,R15 set base register\\n SR R6,R6 i=0\\n LA R8,1 k=1\\nLOOPK C R8,N do k=1 to n\\n BH ELOOPK\\n LR R1,R8 k\\n SLA R1,2\\n L R9,T-4(R1) e=t(k)\\n LR R7,R8 k\\n BCTR R7,0 j=k-1\\nLOOPJ C R7,=F'1' do j=k-1 to 1 by -1\\n BL ELOOPJ\\n LR R1,R7 j\\n SLA R1,2\\n L R2,T-4(R1) t(j)\\n CR R9,R2 if e=t(j) then goto iter\\n BE ITER\\n BCTR R7,0 j=j-1\\n B LOOPJ\\nELOOPJ LA R6,1(R6) i=i+1\\n LR R1,R6 i\\n SLA R1,2\\n ST R9,T-4(R1) t(i)=e\\nITER LA R8,1(R8) k=k+1\\n B LOOPK\\nELOOPK LA R10,PG pgi=@pg\\n LA R8,1 k=1\\nLOOP CR R8,R6 do k=1 to i\\n BH ELOOP\\n LR R1,R8 k\\n SLA R1,2\\n L R2,T-4(R1) t(k)\\n XDECO R2,PG+80 edit t(k)\\n MVC 0(3,R10),PG+89 output t(k) on 3 char\\n LA R10,3(R10) pgi=pgi+3\\n LA R8,1(R8) k=k+1\\n B LOOP\\nELOOP XPRNT PG,80 print buffer\\n XR R15,R15 set return code\\n BR R14 return to caller\\nT DC F'6',F'6',F'1',F'5',F'6',F'2',F'1',F'7',F'5',F'22'\\n DC F'4',F'19',F'1',F'1',F'6',F'8',F'9',F'10',F'11',F'12'\\nN DC A((N-T)/4) number of T items\\nPG DC CL92' '\\n YREGS\\n END REMDUP\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"\\t\\torg\\t100h\\n\\t\\tjmp\\ttest\\n\\t\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t\\t;; Given an array of bytes starting at HL with length BC,\\n\\t\\t;; remove all duplicates in the array. The new end of the array\\n\\t\\t;; is returned in HL. A page of memory (256 bytes) is required\\n\\t\\t;; to mark which bytes have been seen.\\nuniqpage:\\tequ\\t3\\t; Page to use - a compile-time constant.\\n\\t\\t\\t\\t; This would need to be set to a page that\\n\\t\\t\\t\\t; the rest of the program doesn't need.\\nuniq:\\t\\txra\\ta\\t; Zero out the page\\n\\t\\tlxi\\td,uniqpage * 256\\nuniqzero:\\tstax\\td\\t; Zero out a byte\\n\\t\\tinr\\te\\t; And do the next byte\\n\\t\\tjnz\\tuniqzero\\n\\t\\tmov\\td,h\\t; Keep a second pointer to the array in DE\\n\\t\\tmov\\te,l\\nuniqpos:\\tldax\\td\\t; Read from high pointer\\n\\t\\tmov\\tm,a\\t; Write to low pointer\\n\\t\\tinx\\td\\t; Increment the high pointer\\n\\t\\tpush\\th\\t; Keep low pointer around\\n\\t\\tmvi\\th,uniqpage\\t\\n\\t\\tmov\\tl,a\\t; Have we seen this byte yet?\\n\\t\\tcmp\\tm\\t\\n\\t\\tmov\\tm,a\\t; No matter what, we've certainly seen it now\\n\\t\\tpop\\th\\t; Bring back the low pointer\\n\\t\\tjz\\tuniqno\\t; If we already had it, don't increment low ptr\\n\\t\\tinx\\th\\t; IF we didn't, do increment it\\nuniqno:\\t\\tdcx\\tb\\t; One fewer byte left\\n\\t\\tmov\\ta,b\\t; If there are zero bytes left,\\n\\t\\tora\\tc\\n\\t\\trz\\t\\t; Then return to caller\\n\\t\\tjmp\\tuniqpos\\t; Otherwise, do the next byte\\n\\t\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t\\t;; Testing code: read a string from the CP/M console, run\\n\\t\\t;; uniq, then print the output.\\ntest:\\t\\tlxi\\td,bufdef\\t; Read a string\\n\\t\\tmvi\\tc,10\\n\\t\\tcall\\t5\\n\\t\\tlxi\\td,nl\\t\\t; Output on new line\\n\\t\\tmvi\\tc,9\\n\\t\\tcall\\t5\\n\\t\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t\\tlda\\tbufdef+1\\t; Length of input string\\n\\t\\tmov\\tc,a\\t\\t; Extend to 16-bit (since uniq supports\\n\\t\\tmvi\\tb,0\\t\\t; long arrays)\\n\\t\\tlxi\\th,buf\\t\\t; Location of input string\\n\\t\\tcall\\tuniq\\t\\t; Only the unique bytes\\n\\t\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t\\tmvi\\tm,'$'\\t\\t; Mark the (string) end with '$'\\n\\t\\tlxi \\td,buf\\t\\t; Print the string, which now has had\\n\\t\\tmvi\\tc,9\\t\\t; all duplicates removed.\\n\\t\\tjmp\\t5\\nnl:\\t\\tdb\\t13,10,'$'\\nbufdef:\\t\\tdb\\t127,0\\nbuf:\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \"(remove-duplicates xs)\\n\",\n \"language\": \"ACL2\"\n },\n {\n \"code\": \"INCLUDE \\\"D2:SORT.ACT\\\" ;from the Action! Tool Kit\\n\\nPROC PrintArray(INT ARRAY a INT size)\\n INT i\\n\\n Put('[)\\n FOR i=0 TO size-1\\n DO\\n IF i>0 THEN Put(' ) FI\\n PrintI(a(i))\\n OD\\n Put(']) PutE()\\nRETURN\\n\\nPROC RemoveDuplicates(INT ARRAY src INT srcLen\\n INT ARRAY dst INT POINTER dstLen)\\n INT i\\n CHAR curr,prev\\n\\n IF srcLen=0 THEN\\n dstLen^=0\\n RETURN\\n FI\\n\\n SortI(src,srcLen,0)\\n dst(0)=src(0)\\n dstLen^=1 prev=src(0)\\n FOR i=1 TO srcLen-1\\n DO\\n curr=src(i)\\n IF curr#prev THEN\\n dst(dstLen^)=curr\\n dstLen^==+1\\n FI\\n prev=curr\\n OD\\nRETURN\\n\\nPROC Test(INT ARRAY src INT srcLen)\\n INT ARRAY dst(100)\\n INT dstLen\\n\\n PrintE(\\\"Input array:\\\")\\n PrintArray(src,srcLen)\\n RemoveDuplicates(src,srcLen,dst,@dstLen)\\n PrintE(\\\"Unique items:\\\")\\n PrintArray(dst,dstLen)\\n PutE()\\nRETURN\\n\\nPROC Main()\\n INT ARRAY src1(9)=[1 3 65534 0 12 1 65534 52 3]\\n INT ARRAY src2(26)=[3 2 1 3 2 5 2 1 6 3 4 2 5 3 1 5 3 5 2 1 3 7 4 5 7 6]\\n INT ARRAY src3(1)=[6502]\\n\\n Put(125) PutE() ;clear screen\\n Test(src1,9)\\n Test(src2,26)\\n Test(src3,1)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Containers.Ordered_Sets, Ada.Text_IO;\\nuse Ada.Text_IO;\\n\\nprocedure Duplicate is\\t\\n\\tpackage Int_Sets is new Ada.Containers.Ordered_Sets (Integer);\\n\\tNums : constant array (Natural range <>) of Integer := (1,2,3,4,5,5,6,7,1);\\n\\tUnique : Int_Sets.Set;\\nbegin\\n\\tfor n of Nums loop\\n\\t\\tUnique.Include (n);\\n\\tend loop;\\n\\tfor e of Unique loop\\n\\t\\tPut (e'img);\\n\\tend loop;\\nend Duplicate;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"index x;\\n\\nlist(1, 2, 3, 1, 2, 3, 4, 1).ucall(i_add, 1, x, 0);\\nx.i_vcall(o_, 1, \\\" \\\");\\no_newline();\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"index x;\\n\\nfor (, integer a in list(8, 2, 1, 8, 2, 1, 4, 8)) {\\n if ((x[a] += 1) == 1) {\\n o_(\\\" \\\", a);\\n }\\n}\\no_newline();\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"# use the associative array in the Associate array/iteration task #\\n# this example uses strings - for other types, the associative #\\n# array modes AAELEMENT and AAKEY should be modified as required #\\nPR read \\\"aArray.a68\\\" PR\\n\\n# returns the unique elements of list #\\nPROC remove duplicates = ( []STRING list )[]STRING:\\n BEGIN\\n REF AARRAY elements := INIT LOC AARRAY;\\n INT count := 0;\\n FOR pos FROM LWB list TO UPB list DO\\n IF NOT ( elements CONTAINSKEY list[ pos ] ) THEN\\n # first occurance of this element #\\n elements // list[ pos ] := \\\"\\\";\\n count +:= 1\\n FI\\n OD;\\n # construct an array of the unique elements from the #\\n # associative array - the new list will not necessarily be #\\n # in the original order #\\n [ count ]STRING result;\\n REF AAELEMENT e := FIRST elements;\\n FOR pos WHILE e ISNT nil element DO\\n result[ pos ] := key OF e;\\n e := NEXT elements\\n OD;\\n result\\n END; # remove duplicates #\\n\\n# test the duplicate removal #\\nprint( ( remove duplicates( ( \\\"A\\\", \\\"B\\\", \\\"D\\\", \\\"A\\\", \\\"C\\\", \\\"F\\\", \\\"F\\\", \\\"A\\\" ) ), newline ) )\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <hopper.h>\\n\\nmain:\\n x=-1\\n {30} rand array (x), mulby(10), ceil, mov(x)\\n {\\\"Original Array:\\\\n\\\",x}, println\\n {x}array(SORT),\\n {x}sets(UNIQUE), mov(x)\\n {\\\"Final array:\\\\n\\\",x}, println\\n\\n y={}\\n {\\\"C\\\",\\\"Go\\\",\\\"Go\\\",\\\"C\\\",\\\"Cobol\\\",\\\"java\\\",\\\"Ada\\\"} pushall(y)\\n {\\\"java\\\",\\\"algol-68\\\",\\\"C\\\",\\\"java\\\",\\\"fortran\\\"} pushall(y)\\n {\\\"\\\\nOriginal Array:\\\\n\\\",y}, println\\n {y}array(SORT),\\n {y}sets(UNIQUE), mov(y)\\n {\\\"Final array:\\\\n\\\",y}, println\\nexit(0)\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"100 REM Remove duplicate elements\\n110 DIM DataArray(1 TO 7), ResultArray(1 TO 7)\\n120 ! Set the data.\\n130 FOR I = 1 TO 7\\n140 READ DataArray(I)\\n150 NEXT I\\n160 ! Remove duplicates\\n170 LET ResultArray(1) = DataArray(1)\\n180 LET LastResultIndex = 1\\n190 LET Position = 1\\n200 DO WHILE Position < UBOUND(DataArray)\\n210 LET Position = Position + 1\\n220 LET IsNewNumber = -1\\n230 FOR ResultIndex = 1 TO LastResultIndex\\n240 IF DataArray(Position) = ResultArray(ResultIndex) THEN\\n250 LET IsNewNumber = 0\\n260 EXIT FOR\\n270 END IF\\n280 NEXT ResultIndex\\n290 IF IsNewNumber = -1 THEN\\n300 LET LastResultIndex = LastResultIndex + 1\\n310 LET ResultArray(LastResultIndex) = DataArray(Position)\\n320 END IF\\n330 LOOP\\n340 FOR ResultIndex = 1 TO LastResultIndex\\n350 PRINT ResultArray(ResultIndex)\\n360 NEXT ResultIndex\\n370 DATA 1, 2, 2, 3, 4, 5, 5\\n380 END\\n\",\n \"language\": \"ANSI-BASIC\"\n },\n {\n \"code\": \"∪ 1 2 3 1 2 3 4 1\\n1 2 3 4\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"w←1 2 3 1 2 3 4 1\\n ((⍳⍨w)=⍳⍴w)/w\\n1 2 3 4\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"unique({1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\", 2, 3, 4, \\\"b\\\", \\\"c\\\", \\\"d\\\"})\\n\\non unique(x)\\n set R to {}\\n repeat with i in x\\n if i is not in R then set end of R to i's contents\\n end repeat\\n return R\\nend unique\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{1, 2, 3, {4, 5}} contains {2, 3} --> true\\n{1, 2, 3, {4, 5}} contains {4, 5} --> false\\n{1, 2, 3, {4, 5}} contains {{4, 5}} --> true\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"3 is in {1, 2, 3, {4, 5}} --> {3} is in {1, 2, 3, {4, 5}} --> true\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"unique({1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\", 2, 3, 4, \\\"c\\\", {b:\\\"c\\\"}, {\\\"c\\\"}, \\\"c\\\", \\\"d\\\"})\\n\\non unique(x)\\n set R to {}\\n repeat with i in x\\n set i to i's contents\\n if {i} is not in R then set end of R to i\\n end repeat\\n return R\\nend unique\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\", 4, {b:\\\"c\\\"}, {\\\"c\\\"}, \\\"d\\\"}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"-- CASE-INSENSITIVE UNIQUE ELEMENTS ------------------------------------------\\n\\n-- nub :: [a] -> [a]\\non nub(xs)\\n -- Eq :: a -> a -> Bool\\n script Eq\\n on |λ|(x, y)\\n ignoring case\\n x = y\\n end ignoring\\n end |λ|\\n end script\\n\\n nubBy(Eq, xs)\\nend nub\\n\\n\\n-- TEST ----------------------------------------------------------------------\\non run\\n {intercalate(space, ¬\\n nub(splitOn(space, \\\"4 3 2 8 0 1 9 5 1 7 6 3 9 9 4 2 1 5 3 2\\\"))), ¬\\n intercalate(\\\"\\\", ¬\\n nub(characters of \\\"abcabc ABCABC\\\"))}\\n\\n --> {\\\"4 3 2 8 0 1 9 5 7 6\\\", \\\"abc \\\"}\\nend run\\n\\n\\n-- GENERIC FUNCTIONS ---------------------------------------------------------\\n\\n-- filter :: (a -> Bool) -> [a] -> [a]\\non filter(f, xs)\\n tell mReturn(f)\\n set lst to {}\\n set lng to length of xs\\n repeat with i from 1 to lng\\n set v to item i of xs\\n if |λ|(v, i, xs) then set end of lst to v\\n end repeat\\n return lst\\n end tell\\nend filter\\n\\n-- intercalate :: Text -> [Text] -> Text\\non intercalate(strText, lstText)\\n set {dlm, my text item delimiters} to {my text item delimiters, strText}\\n set strJoined to lstText as text\\n set my text item delimiters to dlm\\n return strJoined\\nend intercalate\\n\\n-- Lift 2nd class handler function into 1st class script wrapper\\n-- mReturn :: Handler -> Script\\non mReturn(f)\\n if class of f is script then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\\n-- nubBy :: (a -> a -> Bool) -> [a] -> [a]\\non nubBy(fnEq, xxs)\\n\\n set lng to length of xxs\\n if lng > 1 then\\n set x to item 1 of xxs\\n set xs to items 2 thru -1 of xxs\\n set p to mReturn(fnEq)\\n\\n -- notEq :: a -> Bool\\n script notEq\\n on |λ|(a)\\n not (p's |λ|(a, x))\\n end |λ|\\n end script\\n\\n {x} & nubBy(fnEq, filter(notEq, xs))\\n else\\n xxs\\n end if\\nend nubBy\\n\\n-- splitOn :: Text -> Text -> [Text]\\non splitOn(strDelim, strMain)\\n set {dlm, my text item delimiters} to {my text item delimiters, strDelim}\\n set lstParts to text items of strMain\\n set my text item delimiters to dlm\\n return lstParts\\nend splitOn\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{\\\"4 3 2 8 0 1 9 5 7 6\\\", \\\"abc \\\"}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"use AppleScript version \\\"2.4\\\" -- OS X 10.10 (Yosemite) or later\\nuse framework \\\"Foundation\\\"\\n\\nset aList to {1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\", 2, 3, 4, \\\"c\\\", {b:\\\"c\\\"}, {\\\"c\\\"}, \\\"c\\\", \\\"d\\\"}\\nset orderedSet to current application's class \\\"NSOrderedSet\\\"'s orderedSetWithArray:(aList)\\nreturn orderedSet's array() as list\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\", 4, {b:\\\"c\\\"}, {\\\"c\\\"}, \\\"d\\\"}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"100 DIM L$(15)\\n110 L$(0) = \\\"NOW\\\"\\n120 L$(1) = \\\"IS\\\"\\n130 L$(2) = \\\"THE\\\"\\n140 L$(3) = \\\"TIME\\\"\\n150 L$(4) = \\\"FOR\\\"\\n160 L$(5) = \\\"ALL\\\"\\n170 L$(6) = \\\"GOOD\\\"\\n180 L$(7) = \\\"MEN\\\"\\n190 L$(8) = \\\"TO\\\"\\n200 L$(9) = \\\"COME\\\"\\n210 L$(10) = \\\"TO\\\"\\n220 L$(11) = \\\"THE\\\"\\n230 L$(12) = \\\"AID\\\"\\n240 L$(13) = \\\"OF\\\"\\n250 L$(14) = \\\"THE\\\"\\n260 L$(15) = \\\"PARTY.\\\"\\n\\n300 N = 15\\n310 GOSUB 400\\n320 FOR I = 0 TO N\\n330 PRINT L$(I) \\\" \\\" ;\\n340 NEXT\\n350 PRINT\\n360 END\\n\\n400 REMREMOVE DUPLICATES\\n410 FOR I = N TO 1 STEP -1\\n420 I$ = L$(I)\\n430 FOR J = 0 TO I - 1\\n440 EQ = I$ = L$(J)\\n450 IF NOT EQ THEN NEXT J\\n460 IF EQ THEN GOSUB 500\\n470 NEXT I\\n480 RETURN\\n\\n500 REMREMOVE ELEMENT\\n510 L$(I) = L$(N)\\n520 L$(N) = \\\"\\\"\\n530 N = N - 1\\n540 RETURN\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"arr: [1 2 3 2 1 2 3 4 5 3 2 1]\\n\\nprint unique arr\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"(* Remove duplicate elements.\\n\\n This implementation is for elements that have an \\\"equals\\\" (or\\n \\\"equivalence\\\") predicate. It runs O(n*n) in the number of\\n elements. *)\\n\\n#include \\\"share/atspre_staload.hats\\\"\\n\\n(* How the remove_dups template function will be called. *)\\nextern fn {a : t@ype}\\nremove_dups\\n {n : int}\\n (eq : (a, a) -<cloref> bool,\\n src : arrayref (a, n),\\n n : size_t n,\\n dst : arrayref (a, n),\\n m : &size_t? >> size_t m)\\n :<!refwrt> #[m : nat | m <= n]\\n void\\n\\n(* An implementation of the remove_dups template function. *)\\nimplement {a}\\nremove_dups {n} (eq, src, n, dst, m) =\\n if n = i2sz 0 then\\n m := i2sz 0\\n else\\n let\\n fun\\n peruse_src\\n {i : int | 1 <= i; i <= n}\\n {j : int | 1 <= j; j <= i}\\n .<n - i>.\\n (i : size_t i,\\n j : size_t j)\\n :<!refwrt> [m : int | 1 <= m; m <= n]\\n size_t m =\\n let\\n fun\\n already_seen\\n {k : int | 0 <= k; k <= j}\\n .<j - k>.\\n (x : a,\\n k : size_t k)\\n :<!ref> bool =\\n if k = j then\\n false\\n else if eq (x, dst[k]) then\\n true\\n else\\n already_seen (x, succ k)\\n in\\n if i = n then\\n j\\n else if already_seen (src[i], i2sz 0) then\\n peruse_src (succ i, j)\\n else\\n begin\\n dst[j] := src[i];\\n peruse_src (succ i, succ j)\\n end\\n end\\n\\n prval () = lemma_arrayref_param src (* Prove 0 <= n. *)\\n in\\n dst[0] := src[0];\\n m := peruse_src (i2sz 1, i2sz 1)\\n end\\n\\nimplement (* A demonstration with strings. *)\\nmain0 () =\\n let\\n val eq = lam (x : string, y : string) : bool =<cloref> (x = y)\\n\\n val src =\\n arrayref_make_list<string>\\n (10, $list (\\\"a\\\", \\\"c\\\", \\\"b\\\", \\\"e\\\", \\\"a\\\",\\n \\\"a\\\", \\\"d\\\", \\\"d\\\", \\\"b\\\", \\\"c\\\"))\\n val dst = arrayref_make_elt<string> (i2sz 10, \\\"?\\\")\\n var m : size_t\\n in\\n remove_dups<string> (eq, src, i2sz 10, dst, m);\\n let\\n prval [m : int] EQINT () = eqint_make_guint m\\n var i : natLte m\\n in\\n for (i := 0; i2sz i <> m; i := succ i)\\n print! (\\\" \\\", dst[i] : string);\\n println! ()\\n end\\n end\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \"(* Remove duplicate elements.\\n\\n This implementation is for elements that have an \\\"equals\\\" (or\\n \\\"equivalence\\\") predicate. It runs O(n*n) in the number of\\n elements. It uses a linked list and supports linear types.\\n\\n The equality predicate is implemented as a template function. *)\\n\\n#include \\\"share/atspre_staload.hats\\\"\\nstaload UN = \\\"prelude/SATS/unsafe.sats\\\"\\n\\n#define NIL list_vt_nil ()\\n#define :: list_vt_cons\\n\\n(*------------------------------------------------------------------*)\\n(* Interfaces *)\\n\\nextern fn {a : vt@ype}\\narray_remove_dups\\n {n : int}\\n {p_arr : addr}\\n (pf_arr : array_v (a, p_arr, n) |\\n p_arr : ptr p_arr,\\n n : size_t n)\\n :<!wrt> [m : nat | m <= n]\\n @(array_v (a, p_arr, m),\\n array_v (a?, p_arr + (m * sizeof a), n - m) |\\n size_t m)\\n\\nextern fn {a : vt@ype}\\nlist_vt_remove_dups\\n {n : int}\\n (lst : list_vt (a, n))\\n :<!wrt> [m : nat | m <= n]\\n list_vt (a, m)\\n\\nextern fn {a : vt@ype}\\nremove_dups$eq :\\n (&a, &a) -<> bool\\n\\nextern fn {a : vt@ype}\\nremove_dups$clear :\\n (&a >> a?) -< !wrt > void\\n\\n(*------------------------------------------------------------------*)\\n(* Implementation of array_remove_dups *)\\n\\n(* The implementation for arrays converts to a list_vt, does the\\n removal duplicates, and then writes the data back into the original\\n array. *)\\nimplement {a}\\narray_remove_dups {n} {p_arr} (pf_arr | p_arr, n) =\\n let\\n var lst = array_copy_to_list_vt<a> (!p_arr, n)\\n var m : int\\n val lst = list_vt_remove_dups<a> lst\\n val m = list_vt_length lst\\n prval [m : int] EQINT () = eqint_make_gint m\\n prval @(pf_uniq, pf_rest) =\\n array_v_split {a?} {p_arr} {n} {m} pf_arr\\n val () = array_copy_from_list_vt<a> (!p_arr, lst)\\n in\\n @(pf_uniq, pf_rest | i2sz m)\\n end\\n\\n(*------------------------------------------------------------------*)\\n(* Implementation of list_vt_remove_dups *)\\n\\n(* The list is worked on \\\"in place\\\". That is, no nodes are copied or\\n moved to new locations, except those that are removed and freed. *)\\n\\nfn {a : vt@ype}\\nremove_equal_elements\\n {n : int}\\n (x : &a,\\n lst : &list_vt (a, n) >> list_vt (a, m))\\n :<!wrt> #[m : nat | m <= n]\\n void =\\n let\\n fun {a : vt@ype}\\n remove_elements\\n {n : nat}\\n .<n>.\\n (x : &a,\\n lst : &list_vt (a, n) >> list_vt (a, m))\\n :<!wrt> #[m : nat | m <= n]\\n void =\\n case+ lst of\\n | NIL => ()\\n | @ (head :: tail) =>\\n if remove_dups$eq (head, x) then\\n let\\n val new_lst = tail\\n val () = remove_dups$clear<a> head\\n val () = free@{a}{0} lst\\n val () = lst := new_lst\\n in\\n remove_elements {n - 1} (x, lst)\\n end\\n else\\n let\\n val () = remove_elements {n - 1} (x, tail)\\n prval () = fold@ lst\\n in\\n end\\n\\n prval () = lemma_list_vt_param lst\\n in\\n remove_elements {n} (x, lst)\\n end\\n\\nfn {a : vt@ype}\\nremove_dups\\n {n : int}\\n (lst : &list_vt (a, n) >> list_vt (a, m))\\n :<!wrt> #[m : nat | m <= n]\\n void =\\n let\\n fun\\n rmv_dups {n : nat}\\n .<n>.\\n (lst : &list_vt (a, n) >> list_vt (a, m))\\n :<!wrt> #[m : nat | m <= n]\\n void =\\n case+ lst of\\n | NIL => ()\\n | head :: NIL => ()\\n | @ head :: tail =>\\n let\\n val () = remove_equal_elements (head, tail)\\n val () = rmv_dups tail\\n prval () = fold@ lst\\n in\\n end\\n\\n prval () = lemma_list_vt_param lst\\n in\\n rmv_dups {n} lst\\n end\\n\\nimplement {a}\\nlist_vt_remove_dups {n} lst =\\n let\\n var lst = lst\\n in\\n remove_dups {n} lst;\\n lst\\n end\\n\\n(*------------------------------------------------------------------*)\\n\\nimplement\\nremove_dups$eq<Strptr1> (s, t) =\\n ($UN.strptr2string s = $UN.strptr2string t)\\n\\nimplement\\nremove_dups$clear<Strptr1> s =\\n strptr_free s\\n\\nimplement\\narray_uninitize$clear<Strptr1> (i, s) =\\n strptr_free s\\n\\nimplement\\nfprint_ref<Strptr1> (outf, s) =\\n fprint! (outf, $UN.strptr2string s)\\n\\nimplement (* A demonstration with linear strings. *)\\nmain0 () =\\n let\\n #define N 10\\n\\n val data =\\n $list_vt{Strptr1}\\n (string0_copy \\\"a\\\", string0_copy \\\"c\\\", string0_copy \\\"b\\\",\\n string0_copy \\\"e\\\", string0_copy \\\"a\\\", string0_copy \\\"a\\\",\\n string0_copy \\\"d\\\", string0_copy \\\"d\\\", string0_copy \\\"b\\\",\\n string0_copy \\\"c\\\")\\n var arr : @[Strptr1][N]\\n val () = array_copy_from_list_vt<Strptr1> (arr, data)\\n\\n prval pf_arr = view@ arr\\n val p_arr = addr@ arr\\n\\n val [m : int]\\n @(pf_uniq, pf_abandoned | m) =\\n array_remove_dups<Strptr1> (pf_arr | p_arr, i2sz N)\\n\\n val () = fprint_array_sep<Strptr1> (stdout_ref, !p_arr, m, \\\" \\\")\\n val () = println! ()\\n\\n val () = array_uninitize<Strptr1> (!p_arr, m)\\n prval () = view@ arr :=\\n array_v_unsplit (pf_uniq, pf_abandoned)\\n in\\n end\\n\\n(*------------------------------------------------------------------*)\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \"(* Remove duplicate elements.\\n\\n The elements are sorted and then only unique values are kept. *)\\n\\n\\n#include \\\"share/atspre_staload.hats\\\"\\n\\n(* How the remove_dups template function will be called. *)\\nextern fn {a : t@ype}\\nremove_dups\\n {n : int}\\n (lt : (a, a) -<cloref> bool, (* \\\"less than\\\" *)\\n eq : (a, a) -<cloref> bool, (* \\\"equals\\\" *)\\n src : arrayref (a, n),\\n n : size_t n,\\n dst : arrayref (a, n),\\n m : &size_t? >> size_t m)\\n : #[m : nat | m <= n]\\n void\\n\\nimplement {a}\\nremove_dups {n} (lt, eq, src, n, dst, m) =\\n if n = i2sz 0 then\\n m := i2sz 0\\n else\\n let\\n prval () = lemma_arrayref_param src (* Prove 0 <= n. *)\\n\\n (* Sort a copy of src. *)\\n val arr = arrayptr_refize (arrayref_copy (src, n))\\n implement array_quicksort$cmp<a> (x, y) =\\n if x \\\\lt y then ~1 else 1\\n val () = arrayref_quicksort<a> (arr, n)\\n\\n (* Copy only the first element of each run of equal elements. *)\\n val () = dst[0] := arr[0]\\n fun\\n loop {i : int | 1 <= i; i <= n}\\n {j : int | 1 <= j; j <= i}\\n .<n - i>.\\n (i : size_t i,\\n j : size_t j)\\n : [m : int | 1 <= m; m <= n]\\n size_t m =\\n if i = n then\\n j\\n else if arr[pred i] \\\\eq arr[i] then\\n loop (succ i, j)\\n else\\n begin\\n dst[j] := arr[i];\\n loop (succ i, succ j)\\n end\\n val () = m := loop (i2sz 1, i2sz 1)\\n in\\n end\\n\\nimplement (* A demonstration. *)\\nmain0 () =\\n let\\n val src =\\n arrayref_make_list<string>\\n (10, $list (\\\"a\\\", \\\"c\\\", \\\"b\\\", \\\"e\\\", \\\"a\\\",\\n \\\"a\\\", \\\"d\\\", \\\"d\\\", \\\"b\\\", \\\"c\\\"))\\n val dst = arrayref_make_elt<string> (i2sz 10, \\\"?\\\")\\n var m : size_t\\n in\\n remove_dups<string> (lam (x, y) => x < y,\\n lam (x, y) => x = y,\\n src, i2sz 10, dst, m);\\n let\\n prval [m : int] EQINT () = eqint_make_guint m\\n var i : natLte m\\n in\\n for (i := 0; i2sz i <> m; i := succ i)\\n print! (\\\" \\\", dst[i]);\\n println! ()\\n end\\n end\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \"(* Remove duplicate elements.\\n\\n The best sorting algorithms, it is said, are O(n log n) and require\\n an order predicate.\\n\\n But this is true only for a general sorting routine. A radix sort\\n for fixed-size integers is O(n), and requires no order predicate.\\n Here I use such a radix sort. *)\\n\\n#include \\\"share/atspre_staload.hats\\\"\\nstaload UN = \\\"prelude/SATS/unsafe.sats\\\"\\n\\n(* How the remove_dups template function will be called. *)\\nextern fn {tk : tkind}\\nremove_dups\\n {n : int}\\n (src : arrayref (g0uint tk, n),\\n n : size_t n,\\n dst : arrayref (g0uint tk, n),\\n m : &size_t? >> size_t m)\\n : #[m : nat | m <= n]\\n void\\n\\n(*------------------------------------------------------------------*)\\n(* A radix sort for unsigned integers, copied from my contribution to\\n the radix sort task. *)\\n\\nextern fn {a : vt@ype}\\n {tk : tkind}\\ng0uint_radix_sort\\n {n : int}\\n (arr : &array (a, n) >> _,\\n n : size_t n)\\n :<!wrt> void\\n\\nextern fn {a : vt@ype}\\n {tk : tkind}\\ng0uint_radix_sort$key\\n {n : int}\\n {i : nat | i < n}\\n (arr : &RD(array (a, n)),\\n i : size_t i)\\n :<> g0uint tk\\n\\nfn {}\\nbin_sizes_to_indices\\n (bin_indices : &array (size_t, 256) >> _)\\n :<!wrt> void =\\n let\\n fun\\n loop {i : int | i <= 256}\\n {accum : int}\\n .<256 - i>.\\n (bin_indices : &array (size_t, 256) >> _,\\n i : size_t i,\\n accum : size_t accum)\\n :<!wrt> void =\\n if i <> i2sz 256 then\\n let\\n prval () = lemma_g1uint_param i\\n val elem = bin_indices[i]\\n in\\n if elem = i2sz 0 then\\n loop (bin_indices, succ i, accum)\\n else\\n begin\\n bin_indices[i] := accum;\\n loop (bin_indices, succ i, accum + g1ofg0 elem)\\n end\\n end\\n in\\n loop (bin_indices, i2sz 0, i2sz 0)\\n end\\n\\nfn {a : vt@ype}\\n {tk : tkind}\\ncount_entries\\n {n : int}\\n {shift : nat}\\n (arr : &RD(array (a, n)),\\n n : size_t n,\\n bin_indices : &array (size_t?, 256)\\n >> array (size_t, 256),\\n all_expended : &bool? >> bool,\\n shift : int shift)\\n :<!wrt> void =\\n let\\n fun\\n loop {i : int | i <= n}\\n .<n - i>.\\n (arr : &RD(array (a, n)),\\n bin_indices : &array (size_t, 256) >> _,\\n all_expended : &bool >> bool,\\n i : size_t i)\\n :<!wrt> void =\\n if i <> n then\\n let\\n prval () = lemma_g1uint_param i\\n val key : g0uint tk = g0uint_radix_sort$key<a><tk> (arr, i)\\n val key_shifted = key >> shift\\n val digit = ($UN.cast{uint} key_shifted) land 255U\\n val [digit : int] digit = g1ofg0 digit\\n extern praxi set_range :\\n () -<prf> [0 <= digit; digit <= 255] void\\n prval () = set_range ()\\n val count = bin_indices[digit]\\n val () = bin_indices[digit] := succ count\\n in\\n all_expended := all_expended * iseqz key_shifted;\\n loop (arr, bin_indices, all_expended, succ i)\\n end\\n\\n prval () = lemma_array_param arr\\n in\\n array_initize_elt<size_t> (bin_indices, i2sz 256, i2sz 0);\\n all_expended := true;\\n loop (arr, bin_indices, all_expended, i2sz 0)\\n end\\n\\nfn {a : vt@ype}\\n {tk : tkind}\\nsort_by_digit\\n {n : int}\\n {shift : nat}\\n (arr1 : &RD(array (a, n)),\\n arr2 : &array (a, n) >> _,\\n n : size_t n,\\n all_expended : &bool? >> bool,\\n shift : int shift)\\n :<!wrt> void =\\n let\\n var bin_indices : array (size_t, 256)\\n in\\n count_entries<a><tk> (arr1, n, bin_indices, all_expended, shift);\\n if all_expended then\\n ()\\n else\\n let\\n fun\\n rearrange {i : int | i <= n}\\n .<n - i>.\\n (arr1 : &RD(array (a, n)),\\n arr2 : &array (a, n) >> _,\\n bin_indices : &array (size_t, 256) >> _,\\n i : size_t i)\\n :<!wrt> void =\\n if i <> n then\\n let\\n prval () = lemma_g1uint_param i\\n val key = g0uint_radix_sort$key<a><tk> (arr1, i)\\n val key_shifted = key >> shift\\n val digit = ($UN.cast{uint} key_shifted) land 255U\\n val [digit : int] digit = g1ofg0 digit\\n extern praxi set_range :\\n () -<prf> [0 <= digit; digit <= 255] void\\n prval () = set_range ()\\n val [j : int] j = g1ofg0 bin_indices[digit]\\n\\n (* One might wish to get rid of this assertion somehow,\\n to eliminate the branch, should it prove a\\n problem. *)\\n val () = $effmask_exn assertloc (j < n)\\n\\n val p_dst = ptr_add<a> (addr@ arr2, j)\\n and p_src = ptr_add<a> (addr@ arr1, i)\\n val _ = $extfcall (ptr, \\\"memcpy\\\", p_dst, p_src,\\n sizeof<a>)\\n val () = bin_indices[digit] := succ (g0ofg1 j)\\n in\\n rearrange (arr1, arr2, bin_indices, succ i)\\n end\\n\\n prval () = lemma_array_param arr1\\n in\\n bin_sizes_to_indices<> bin_indices;\\n rearrange (arr1, arr2, bin_indices, i2sz 0)\\n end\\n end\\n\\nfn {a : vt@ype}\\n {tk : tkind}\\ng0uint_sort {n : pos}\\n (arr1 : &array (a, n) >> _,\\n arr2 : &array (a, n) >> _,\\n n : size_t n)\\n :<!wrt> void =\\n let\\n fun\\n loop {idigit_max, idigit : nat | idigit <= idigit_max}\\n .<idigit_max - idigit>.\\n (arr1 : &array (a, n) >> _,\\n arr2 : &array (a, n) >> _,\\n from1to2 : bool,\\n idigit_max : int idigit_max,\\n idigit : int idigit)\\n :<!wrt> void =\\n if idigit = idigit_max then\\n begin\\n if ~from1to2 then\\n let\\n val _ =\\n $extfcall (ptr, \\\"memcpy\\\", addr@ arr1, addr@ arr2,\\n sizeof<a> * n)\\n in\\n end\\n end\\n else if from1to2 then\\n let\\n var all_expended : bool\\n in\\n sort_by_digit<a><tk> (arr1, arr2, n, all_expended,\\n 8 * idigit);\\n if all_expended then\\n ()\\n else\\n loop (arr1, arr2, false, idigit_max, succ idigit)\\n end\\n else\\n let\\n var all_expended : bool\\n in\\n sort_by_digit<a><tk> (arr2, arr1, n, all_expended,\\n 8 * idigit);\\n if all_expended then\\n let\\n val _ =\\n $extfcall (ptr, \\\"memcpy\\\", addr@ arr1, addr@ arr2,\\n sizeof<a> * n)\\n in\\n end\\n else\\n loop (arr1, arr2, true, idigit_max, succ idigit)\\n end\\n in\\n loop (arr1, arr2, true, sz2i sizeof<g1uint tk>, 0)\\n end\\n\\n#define SIZE_THRESHOLD 256\\n\\nextern praxi\\nunsafe_cast_array\\n {a : vt@ype}\\n {b : vt@ype}\\n {n : int}\\n (arr : &array (b, n) >> array (a, n))\\n :<prf> void\\n\\nimplement {a} {tk}\\ng0uint_radix_sort {n} (arr, n) =\\n if n <> 0 then\\n let\\n prval () = lemma_array_param arr\\n\\n fn\\n sort {n : pos}\\n (arr1 : &array (a, n) >> _,\\n arr2 : &array (a, n) >> _,\\n n : size_t n)\\n :<!wrt> void =\\n g0uint_sort<a><tk> (arr1, arr2, n)\\n in\\n if n <= SIZE_THRESHOLD then\\n let\\n var arr2 : array (a, SIZE_THRESHOLD)\\n prval @(pf_left, pf_right) =\\n array_v_split {a?} {..} {SIZE_THRESHOLD} {n} (view@ arr2)\\n prval () = view@ arr2 := pf_left\\n prval () = unsafe_cast_array{a} arr2\\n\\n val () = sort (arr, arr2, n)\\n\\n prval () = unsafe_cast_array{a?} arr2\\n prval () = view@ arr2 :=\\n array_v_unsplit (view@ arr2, pf_right)\\n in\\n end\\n else\\n let\\n val @(pf_arr2, pfgc_arr2 | p_arr2) = array_ptr_alloc<a> n\\n macdef arr2 = !p_arr2\\n prval () = unsafe_cast_array{a} arr2\\n\\n val () = sort (arr, arr2, n)\\n\\n prval () = unsafe_cast_array{a?} arr2\\n val () = array_ptr_free (pf_arr2, pfgc_arr2 | p_arr2)\\n in\\n end\\n end\\n\\n(*------------------------------------------------------------------*)\\n(* An implementation of the remove_dups template function, which also\\n sorts the elements. *)\\n\\nimplement {tk}\\nremove_dups {n} (src, n, dst, m) =\\n if n = i2sz 0 then\\n m := i2sz 0\\n else\\n let\\n prval () = lemma_arrayref_param src (* Prove 0 <= n. *)\\n\\n (* Sort a copy of src. *)\\n val arrptr = arrayref_copy (src, n)\\n val @(pf_arr | p_arr) = arrayptr_takeout_viewptr arrptr\\n val () = g0uint_radix_sort<g0uint tk><tk> (!p_arr, n)\\n prval () = arrayptr_addback (pf_arr | arrptr)\\n\\n (* Copy only the first element of each run of equals. *)\\n val () = dst[0] := arrptr[0]\\n fun\\n loop {i : int | 1 <= i; i <= n}\\n {j : int | 1 <= j; j <= i}\\n .<n - i>.\\n (arrptr : !arrayptr (g0uint tk, n),\\n i : size_t i,\\n j : size_t j)\\n : [m : int | 1 <= m; m <= n]\\n size_t m =\\n if i = n then\\n j\\n else if arrptr[pred i] = arrptr[i] then\\n loop (arrptr, succ i, j)\\n else\\n begin\\n dst[j] := arrptr[i];\\n loop (arrptr, succ i, succ j)\\n end\\n val () = m := loop (arrptr, i2sz 1, i2sz 1)\\n\\n val () = arrayptr_free arrptr\\n in\\n end\\n\\n(*------------------------------------------------------------------*)\\n(* A demonstration. *)\\n\\nimplement\\nmain0 () =\\n let\\n implement\\n g0uint_radix_sort$key<uint><uintknd> (arr, i) =\\n arr[i]\\n\\n val src =\\n arrayref_make_list<uint>\\n (10, $list (1U, 3U, 2U, 5U, 1U, 1U, 4U, 4U, 2U, 3U))\\n\\n val dst = arrayref_make_elt<uint> (i2sz 10, 123456789U)\\n var m : size_t\\n in\\n remove_dups<uintknd> (src, i2sz 10, dst, m);\\n let\\n prval [m : int] EQINT () = eqint_make_guint m\\n var i : natLte m\\n in\\n for (i := 0; i2sz i <> m; i := succ i)\\n print! (\\\" \\\", dst[i]);\\n println! ()\\n end\\n end\\n\\n(*------------------------------------------------------------------*)\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \"(* Remove duplicate elements.\\n\\n Elements already seen are put into a hash table. *)\\n\\n#include \\\"share/atspre_staload.hats\\\"\\n\\n(* Use hash tables from the libats/ML library. *)\\nstaload \\\"libats/ML/SATS/hashtblref.sats\\\"\\nstaload _ = \\\"libats/ML/DATS/hashtblref.dats\\\"\\nstaload _ = \\\"libats/DATS/hashfun.dats\\\"\\nstaload _ = \\\"libats/DATS/hashtbl_chain.dats\\\"\\nstaload _ = \\\"libats/DATS/linmap_list.dats\\\"\\n\\n(* How the remove_dups template function will be called. *)\\nextern fn {key, a : t@ype}\\nremove_dups\\n {n : int}\\n (key : a -<cloref> key,\\n src : arrayref (a, n),\\n n : size_t n,\\n dst : arrayref (a, n),\\n m : &size_t? >> size_t m)\\n : #[m : nat | m <= n]\\n void\\n\\nimplement {key, a}\\nremove_dups {n} (key, src, n, dst, m) =\\n if n = i2sz 0 then\\n m := i2sz 0\\n else\\n let\\n prval () = lemma_arrayref_param src (* Prove 0 <= n. *)\\n\\n fun\\n loop {i : nat | i <= n}\\n {j : nat | j <= i}\\n .<n - i>.\\n (ht : hashtbl (key, a),\\n i : size_t i,\\n j : size_t j)\\n : [m : nat | m <= n]\\n size_t m =\\n if i = n then\\n j\\n else\\n let\\n val x = src[i]\\n val k = key x\\n in\\n case+ hashtbl_search<key, a> (ht, k) of\\n | ~ None_vt () =>\\n begin (* An element not yet encountered. Copy it. *)\\n hashtbl_insert_any<key, a> (ht, k, x);\\n dst[j] := x;\\n loop (ht, succ i, succ j)\\n end\\n | ~ Some_vt _ =>\\n begin (* An element already encountered. Skip it. *)\\n loop (ht, succ i, j)\\n end\\n end;\\n in\\n m := loop (hashtbl_make_nil<key, a> (i2sz 1024),\\n i2sz 0, i2sz 0)\\n end\\n\\nimplement (* A demonstration. *)\\nmain0 () =\\n let\\n val src =\\n arrayref_make_list<string>\\n (10, $list (\\\"a\\\", \\\"c\\\", \\\"b\\\", \\\"e\\\", \\\"a\\\",\\n \\\"a\\\", \\\"d\\\", \\\"d\\\", \\\"b\\\", \\\"c\\\"))\\n val dst = arrayref_make_elt<string> (i2sz 10, \\\"?\\\")\\n var m : size_t\\n in\\n remove_dups<string, string> (lam s => s, src, i2sz 10, dst, m);\\n let\\n prval [m : int] EQINT () = eqint_make_guint m\\n var i : natLte m\\n in\\n for (i := 0; i2sz i <> m; i := succ i)\\n print! (\\\" \\\", dst[i]);\\n println! ()\\n end\\n end\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \"(* Remove duplicate elements.\\n\\n This implementation is for elements that contain a \\\"this has been\\n seen\\\" flag. It is O(n) in the number of elements.\\n\\n Also, this implementation demonstrates that imperative programming,\\n without dependent types or proofs, is possible in ATS. *)\\n\\n#include \\\"share/atspre_staload.hats\\\"\\n\\n(* A tuple in the heap. *)\\ntypedef seen_or_not (a : t@ype+) = '(a, ref bool)\\n\\n(* How the remove_dups function will be called. *)\\nextern fn {a : t@ype}\\nremove_dups\\n (given_data : arrszref (seen_or_not a),\\n space_for_result : arrszref (seen_or_not a),\\n num_of_unique_elems : &size_t? >> size_t)\\n : void\\n\\nimplement {a}\\nremove_dups (given_data, space_for_result, num_of_unique_elems) =\\n let\\n macdef seen (i) = given_data[,(i)].1\\n\\n var i : size_t\\n var j : size_t\\n in\\n (* Clear all the \\\"seen\\\" flags. *)\\n for (i := i2sz 0; i <> size given_data; i := succ i)\\n !(seen i) := false;\\n\\n (* Loop through given_data, copying (pointers to) any values that\\n have not yet been seen. *)\\n j := i2sz 0;\\n for (i := i2sz 0; i <> size given_data; i := succ i)\\n if !(seen i) then\\n () (* Skip any element that has already been seen. *)\\n else\\n begin\\n !(seen i) := true; (* Mark the element as seen. *)\\n space_for_result[j] := given_data[i];\\n j := succ j\\n end;\\n\\n num_of_unique_elems := j\\n end\\n\\nimplement (* A demonstration. *)\\nmain0 () =\\n let\\n (* Define some values. *)\\n val a = '(\\\"a\\\", ref<bool> false)\\n val b = '(\\\"b\\\", ref<bool> false)\\n val c = '(\\\"c\\\", ref<bool> false)\\n val d = '(\\\"d\\\", ref<bool> false)\\n val e = '(\\\"e\\\", ref<bool> false)\\n\\n (* Fill an array with values. *)\\n val data =\\n arrszref_make_list ($list (a, c, b, e, a, a, d, d, b, c))\\n\\n (* Allocate storage for the result. *)\\n val unique_elems = arrszref_make_elt (i2sz 10, a)\\n var num_of_unique_elems : size_t\\n\\n var i : size_t\\n in\\n (* Remove duplicates. *)\\n remove_dups<string> (data, unique_elems, num_of_unique_elems);\\n\\n (* Print the results. *)\\n for (i := i2sz 0; i <> num_of_unique_elems; i := succ i)\\n print! (\\\" \\\", unique_elems[i].0);\\n println! ()\\n end\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \"a = 1,2,1,4,5,2,15,1,3,4\\nSort, a, a, NUD`,\\nMsgBox % a ; 1,2,3,4,5,15\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"$ awk 'BEGIN{split(\\\"a b c d c b a\\\",a);for(i in a)b[a[i]]=1;r=\\\"\\\";for(i in b)r=r\\\" \\\"i;print r}'\\na b c d\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"arraybase 1\\nmax = 10\\ndim res(max)\\ndim dat(max)\\ndat[1] = 1: dat[2] = 2: dat[3] = 1: dat[4] = 4: dat[5] = 5\\ndat[6] = 2: dat[7] = 15: dat[8] = 1: dat[9] = 3: dat[10] = 4\\nres[1] = dat[1]\\n\\ncont = 1\\nposic = 1\\nwhile posic < max\\n\\tposic += 1\\n\\tesnuevo = 1\\n\\tindice = 1\\n\\twhile indice <= cont and esnuevo = 1\\n\\t\\tif dat[posic] = res[indice] then esnuevo = 0\\n\\t\\tindice += 1\\n\\tend while\\n\\tif esnuevo = 1 then\\n\\t\\tcont += 1\\n\\t\\tres[cont] = dat[posic]\\n\\tend if\\nend while\\n\\nfor i = 1 to cont\\n\\tprint res[i]; \\\" \\\";\\nnext i\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \" DIM list$(15)\\n list$() = \\\"Now\\\", \\\"is\\\", \\\"the\\\", \\\"time\\\", \\\"for\\\", \\\"all\\\", \\\"good\\\", \\\"men\\\", \\\\\\n \\\\ \\\"to\\\", \\\"come\\\", \\\"to\\\", \\\"the\\\", \\\"aid\\\", \\\"of\\\", \\\"the\\\", \\\"party.\\\"\\n num% = FNremoveduplicates(list$())\\n FOR i% = 0 TO num%-1\\n PRINT list$(i%) \\\" \\\" ;\\n NEXT\\n PRINT\\n END\\n\\n DEF FNremoveduplicates(l$())\\n LOCAL i%, j%, n%, i$\\n n% = 1\\n FOR i% = 1 TO DIM(l$(), 1)\\n i$ = l$(i%)\\n FOR j% = 0 TO i%-1\\n IF i$ = l$(j%) EXIT FOR\\n NEXT\\n IF j%>=i% l$(n%) = i$ : n% += 1\\n NEXT\\n = n%\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"⍷ 2‿4‿9‿7‿3‿7‿4‿1‿9‿2‿5‿7‿2‿2‿8‿9‿6‿6‿5‿8\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"2 3 5 7 11 13 17 19 cats 222 (-100.2) \\\"+11\\\" (1.1) \\\"+7\\\" (7.) 7 5 5 3 2 0 (4.4) 2:?LIST\\n\\n(A=\\n ( Hashing\\n = h elm list\\n . new$hash:?h\\n & whl\\n ' ( !arg:%?elm ?arg\\n & ( (h..find)$str$!elm\\n | (h..insert)$(str$!elm.!elm)\\n )\\n )\\n & :?list\\n & (h..forall)\\n $ (\\n = .!arg:(?.?arg)&!arg !list:?list\\n )\\n & !list\\n )\\n& put$(\\\"Solution A:\\\" Hashing$!LIST \\\\n,LIN)\\n);\\n\\n(B=\\n ( backtracking\\n = answr elm\\n . :?answr\\n & !arg\\n : ?\\n ( %?`elm\\n ?\\n ( !elm ?\\n | &!answr !elm:?answr\\n )\\n & ~\\n )\\n | !answr\\n )\\n& put$(\\\"Solution B:\\\" backtracking$!LIST \\\\n,LIN)\\n);\\n\\n(C=\\n ( summing\\n = sum car LIST\\n . !arg:?LIST\\n & 0:?sum\\n & whl\\n ' ( !LIST:%?car ?LIST\\n & (.!car)+!sum:?sum\\n )\\n & whl\\n ' ( !sum:#*(.?el)+?sum\\n & !el !LIST:?LIST\\n )\\n & !LIST\\n )\\n& put$(\\\"Solution C:\\\" summing$!LIST \\\\n,LIN)\\n);\\n\\n( !A\\n& !B\\n& !C\\n&\\n)\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"some_array = [1 1 2 1 'redundant' [1 2 3] [1 2 3] 'redundant']\\n\\nunique_array = some_array.unique\\n\",\n \"language\": \"Brat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n\\nstruct list_node {int x; struct list_node *next;};\\ntypedef struct list_node node;\\n\\nnode * uniq(int *a, unsigned alen)\\n {if (alen == 0) return NULL;\\n node *start = malloc(sizeof(node));\\n if (start == NULL) exit(EXIT_FAILURE);\\n start->x = a[0];\\n start->next = NULL;\\n\\n for (int i = 1 ; i < alen ; ++i)\\n {node *n = start;\\n for (;; n = n->next)\\n {if (a[i] == n->x) break;\\n if (n->next == NULL)\\n {n->next = malloc(sizeof(node));\\n n = n->next;\\n if (n == NULL) exit(EXIT_FAILURE);\\n n->x = a[i];\\n n->next = NULL;\\n break;}}}\\n\\n return start;}\\n\\nint main(void)\\n {int a[] = {1, 2, 1, 4, 5, 2, 15, 1, 3, 4};\\n for (node *n = uniq(a, 10) ; n != NULL ; n = n->next)\\n printf(\\\"%d \\\", n->x);\\n puts(\\\"\\\");\\n return 0;}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <stdbool.h>\\n#include <string.h>\\n\\n/* Returns `true' if element `e' is in array `a'. Otherwise, returns `false'.\\n * Checks only the first `n' elements. Pure, O(n).\\n */\\nbool elem(int *a, size_t n, int e)\\n{\\n for (size_t i = 0; i < n; ++i)\\n if (a[i] == e)\\n return true;\\n\\n return false;\\n}\\n\\n/* Removes the duplicates in array `a' of given length `n'. Returns the number\\n * of unique elements. In-place, order preserving, O(n ^ 2).\\n */\\nsize_t nub(int *a, size_t n)\\n{\\n size_t m = 0;\\n\\n for (size_t i = 0; i < n; ++i)\\n if (!elem(a, m, a[i]))\\n a[m++] = a[i];\\n\\n return m;\\n}\\n\\n/* Out-place version of `nub'. Pure, order preserving, alloc < n * sizeof(int)\\n * bytes, O(n ^ 2).\\n */\\nsize_t nub_new(int **b, int *a, size_t n)\\n{\\n int *c = malloc(n * sizeof(int));\\n memcpy(c, a, n * sizeof(int));\\n int m = nub(c, n);\\n *b = malloc(m * sizeof(int));\\n memcpy(*b, c, m * sizeof(int));\\n free(c);\\n return m;\\n}\\n\\nint main(void)\\n{\\n int a[] = {1, 2, 1, 4, 5, 2, 15, 1, 3, 4};\\n int *b;\\n\\n size_t n = nub_new(&b, a, sizeof(a) / sizeof(a[0]));\\n\\n for (size_t i = 0; i < n; ++i)\\n printf(\\\"%d \\\", b[i]);\\n puts(\\\"\\\");\\n\\n free(b);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n\\nint icmp(const void *a, const void *b)\\n{\\n#define _I(x) *(const int*)x\\n\\treturn _I(a) < _I(b) ? -1 : _I(a) > _I(b);\\n#undef _I\\n}\\n\\n/* filter items in place and return number of uniques. if a separate\\n list is desired, duplicate it before calling this function */\\nint uniq(int *a, int len)\\n{\\n\\tint i, j;\\n\\tqsort(a, len, sizeof(int), icmp);\\n\\tfor (i = j = 0; i < len; i++)\\n\\t\\tif (a[i] != a[j]) a[++j] = a[i];\\n\\treturn j + 1;\\n}\\n\\nint main()\\n{\\n\\tint x[] = {1, 2, 1, 4, 5, 2, 15, 1, 3, 4};\\n\\tint i, len = uniq(x, sizeof(x) / sizeof(x[0]));\\n\\tfor (i = 0; i < len; i++) printf(\\\"%d\\\\n\\\", x[i]);\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <set>\\n#include <iostream>\\nusing namespace std;\\n\\nint main() {\\n typedef set<int> TySet;\\n int data[] = {1, 2, 3, 2, 3, 4};\\n\\n TySet unique_set(data, data + 6);\\n\\n cout << \\\"Set items:\\\" << endl;\\n for (TySet::iterator iter = unique_set.begin(); iter != unique_set.end(); iter++)\\n cout << *iter << \\\" \\\";\\n cout << endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <ext/hash_set>\\n#include <iostream>\\nusing namespace std;\\n\\nint main() {\\n typedef __gnu_cxx::hash_set<int> TyHash;\\n int data[] = {1, 2, 3, 2, 3, 4};\\n\\n TyHash unique_set(data, data + 6);\\n\\n cout << \\\"Set items:\\\" << endl;\\n for (TyHash::iterator iter = unique_set.begin(); iter != unique_set.end(); iter++)\\n cout << *iter << \\\" \\\";\\n cout << endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <tr1/unordered_set>\\n#include <iostream>\\nusing namespace std;\\n\\nint main() {\\n typedef tr1::unordered_set<int> TyHash;\\n int data[] = {1, 2, 3, 2, 3, 4};\\n\\n TyHash unique_set(data, data + 6);\\n\\n cout << \\\"Set items:\\\" << endl;\\n for (TyHash::iterator iter = unique_set.begin(); iter != unique_set.end(); iter++)\\n cout << *iter << \\\" \\\";\\n cout << endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <iterator>\\n#include <algorithm>\\n\\n// helper template\\ntemplate<typename T> T* end(T (&array)[size]) { return array+size; }\\n\\nint main()\\n{\\n int data[] = { 1, 2, 3, 2, 3, 4 };\\n std::sort(data, end(data));\\n int* new_end = std::unique(data, end(data));\\n std::copy(data, new_end, std::ostream_iterator<int>(std::cout, \\\" \\\");\\n std::cout << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n\\nint main() {\\n std::vector<int> data = {1, 2, 3, 2, 3, 4};\\n\\n std::sort(data.begin(), data.end());\\n data.erase(std::unique(data.begin(), data.end()), data.end());\\n\\n for(int& i: data) std::cout << i << \\\" \\\";\\n std::cout << std::endl;\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"int[] nums = { 1, 1, 2, 3, 4, 4 };\\nList<int> unique = new List<int>();\\nforeach (int n in nums)\\n if (!unique.Contains(n))\\n unique.Add(n);\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"int[] nums = {1, 1, 2, 3, 4, 4};\\nint[] unique = nums.Distinct().ToArray();\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"red (1 2 3 4) (3 2 1 5) .\\n --> (4 5 1 2 3):Int\\n\",\n \"language\": \"CafeOBJ\"\n },\n {\n \"code\": \"mod! NO-DUP-LIST(ELEMENTS :: TRIV) {\\n op __ : Elt Elt -> Elt { comm assoc idem assoc }\\n}\\n\\n-- Runs on Version 1.5.1(PigNose0.99) of CafeOBJ\\n-- The tests are performed after opening instantiated NO-DUP-LIST with various concrete types.\\n-- Test on lists of INT\\nopen NO-DUP-LIST(INT) .\\nred 2 1 2 1 2 1 3 .\\n-- Gives (2 1 3):Int\\nopen NO-DUP-LIST(INT) .\\nreduce 1 1 2 1 1 .\\nclose\\nopen NO-DUP-LIST(CHARACTER) .\\nreduce 'a' 'b' 'a' 'a' .\\nclose\\nopen NO-DUP-LIST(STRING) .\\nreduce \\\"abc\\\" \\\"def\\\" \\\"abc\\\" \\\"abc\\\" \\\"abc\\\" .\\nclose\\n\",\n \"language\": \"CafeOBJ\"\n },\n {\n \"code\": \"<String|Integer>[] data = [1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\", 2, 3, 4, \\\"b\\\", \\\"c\\\", \\\"d\\\"];\\n<String|Integer>[] unique = HashSet { *data }.sequence();\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"user=> (distinct [1 3 2 9 1 2 3 8 8 1 0 2])\\n(1 3 2 9 8 0)\\nuser=>\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"data = [ 1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\", 2, 3, 4, \\\"b\\\", \\\"c\\\", \\\"d\\\" ]\\nset = []\\nset.push i for i in data when not (i in set)\\n\\nconsole.log data\\nconsole.log set\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(remove-duplicates '(1 3 2 9 1 2 3 8 8 1 0 2))\\n> (9 3 8 1 0 2)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(delete-duplicates '(1 3 2 9 1 2 3 8 8 1 0 2))\\n> (9 3 8 1 0 2)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"ary = [1, 1, 2, 2, \\\"a\\\", [1, 2, 3], [1, 2, 3], \\\"a\\\"]\\np ary.uniq\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.algorithm;\\n\\n [1, 3, 2, 9, 1, 2, 3, 8, 8, 1, 0, 2]\\n .sort()\\n .uniq\\n .writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio;\\n\\n immutable data = [1, 3, 2, 9, 1, 2, 3, 8, 8, 1, 0, 2];\\n\\n bool[int] hash;\\n foreach (el; data)\\n hash[el] = true;\\n hash.byKey.writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"void main()\\n{\\n import std.stdio, std.algorithm, std.array;\\n\\n auto a = [5,4,32,7,6,4,2,6,0,8,6,9].sort.uniq.array;\\n a.writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program RemoveDuplicateElements;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses Generics.Collections;\\n\\nvar\\n i: Integer;\\n lIntegerList: TList<Integer>;\\nconst\\n INT_ARRAY: array[1..7] of Integer = (1, 2, 2, 3, 4, 5, 5);\\nbegin\\n lIntegerList := TList<Integer>.Create;\\n try\\n for i in INT_ARRAY do\\n if not lIntegerList.Contains(i) then\\n lIntegerList.Add(i);\\n\\n for i in lIntegerList do\\n Writeln(i);\\n finally\\n lIntegerList.Free;\\n end;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"[1,2,3,2,3,4].asSet().getElements()\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"a[] = [ 1 2 1 4 5 2 15 1 3 4 ]\\nfor a in a[]\\n found = 0\\n for b in b[]\\n if a = b\\n found = 1\\n break 1\\n .\\n .\\n if found = 0\\n b[] &= a\\n .\\n.\\nprint b[]\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"inNumbers := DATASET([{1},{2},{3},{4},{1},{1},{7},{8},{9},{9},{0},{0},{3},{3},{3},{3},{3}], {INTEGER Field1});\\nDEDUP(SORT(inNumbers,Field1));\\n\",\n \"language\": \"ECL\"\n },\n {\n \"code\": \"module RetainUniqueValues {\\n void run() {\\n Int[] array = [1, 2, 3, 2, 1, 2, 3, 4, 5, 3, 2, 1];\\n array = array.distinct().toArray();\\n\\n @Inject Console console;\\n console.print($\\\"result={array}\\\");\\n }\\n}\\n\",\n \"language\": \"Ecstasy\"\n },\n {\n \"code\": \"import extensions;\\nimport system'collections;\\nimport system'routines;\\n\\npublic program()\\n{\\n var nums := new int[]{1,1,2,3,4,4};\\n auto unique := new Map<int, int>();\\n\\n nums.forEach::(n){ unique[n] := n };\\n\\n console.printLine(unique.MapValues.asEnumerable())\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"defmodule RC do\\n # Set approach\\n def uniq1(list), do: MapSet.new(list) |> MapSet.to_list\\n\\n # Sort approach\\n def uniq2(list), do: Enum.sort(list) |> Enum.dedup\\n\\n # Go through the list approach\\n def uniq3(list), do: uniq3(list, [])\\n\\n defp uniq3([], res), do: Enum.reverse(res)\\n defp uniq3([h|t], res) do\\n if h in res, do: uniq3(t, res), else: uniq3(t, [h | res])\\n end\\nend\\n\\nnum = 10000\\nmax = div(num, 10)\\nlist = for _ <- 1..num, do: :rand.uniform(max)\\nfuns = [&Enum.uniq/1, &RC.uniq1/1, &RC.uniq2/1, &RC.uniq3/1]\\nEnum.each(funs, fn fun ->\\n result = fun.([1,1,2,1,'redundant',1.0,[1,2,3],[1,2,3],'redundant',1.0])\\n :timer.tc(fn ->\\n Enum.each(1..100, fn _ -> fun.(list) end)\\n end)\\n |> fn{t,_} -> IO.puts \\\"#{inspect fun}:\\\\t#{t/1000000}\\\\t#{inspect result}\\\" end.()\\nend)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"List = [1, 2, 3, 2, 2, 4, 5, 5, 4, 6, 6, 5].\\nUniqueList = gb_sets:to_list(gb_sets:from_list(List)).\\n% Alternatively the builtin:\\nUnique_list = lists:usort( List ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"include sort.e\\n\\nfunction uniq(sequence s)\\n sequence out\\n s = sort(s)\\n out = s[1..1]\\n for i = 2 to length(s) do\\n if not equal(s[i],out[$]) then\\n out = append(out, s[i])\\n end if\\n end for\\n return out\\nend function\\n\\nconstant s = {1, 2, 1, 4, 5, 2, 15, 1, 3, 4}\\n? s\\n? uniq(s)\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"set [|1;2;3;2;3;4|]\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"val it : Set<int> = seq [1; 2; 3; 4]\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: sets ;\\nV{ 1 2 1 3 2 4 5 } members .\\n\\nV{ 1 2 3 4 5 }\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"\\\\ Increments a2 until it no longer points to the same value as a1\\n\\\\ a3 is the address beyond the data a2 is traversing.\\n: skip-dups ( a1 a2 a3 -- a1 a2+n )\\n dup rot ?do\\n over @ i @ <> if drop i leave then\\n cell +loop ;\\n\\n\\\\ Compress an array of cells by removing adjacent duplicates\\n\\\\ Returns the new count\\n: uniq ( a n -- n2 )\\n over >r \\\\ Original addr to return stack\\n cells over + >r \\\\ \\\"to\\\" addr now on return stack, available as r@\\n dup begin ( write read )\\n dup r@ <\\n while\\n 2dup @ swap ! \\\\ copy one cell\\n cell+ r@ skip-dups\\n cell 0 d+ \\\\ increment write ptr only\\n repeat r> 2drop r> - cell / ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": uniqv { a n \\\\ r e -- n }\\n a n cells+ to e\\n a dup to r\\n \\\\ the write address lives on the stack\\n begin\\n r e <\\n while\\n r @ over !\\n r cell+ e skip-dups to r\\n cell+\\n repeat\\n a - cell / ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"create test 1 , 2 , 3 , 2 , 6 , 4 , 5 , 3 , 6 ,\\nhere test - cell / constant ntest\\n: .test ( n -- ) 0 ?do test i cells + ? loop ;\\n\\ntest ntest 2dup cell-sort uniq .test\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"program remove_dups\\n implicit none\\n integer :: example(12) ! The input\\n integer :: res(size(example)) ! The output\\n integer :: k ! The number of unique elements\\n integer :: i, j\\n\\n example = [1, 2, 3, 2, 2, 4, 5, 5, 4, 6, 6, 5]\\n k = 1\\n res(1) = example(1)\\n outer: do i=2,size(example)\\n do j=1,k\\n if (res(j) == example(i)) then\\n ! Found a match so start looking again\\n cycle outer\\n end if\\n end do\\n ! No match found so add it to the output\\n k = k + 1\\n res(k) = example(i)\\n end do outer\\n write(*,advance='no',fmt='(a,i0,a)') 'Unique list has ',k,' elements: '\\n write(*,*) res(1:k)\\nend program remove_dups\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"program remove_dups\\n implicit none\\n integer :: example(12) ! The input\\n integer :: res(size(example)) ! The output\\n integer :: k ! The number of unique elements\\n integer :: i\\n\\n example = [1, 2, 3, 2, 2, 4, 5, 5, 4, 6, 6, 5]\\n k = 1\\n res(1) = example(1)\\n do i=2,size(example)\\n ! if the number already exist in res check next\\n if (any( res == example(i) )) cycle\\n ! No match found so add it to the output\\n k = k + 1\\n res(k) = example(i)\\n end do\\n\\n write(*,advance='no',fmt='(a,i0,a)') 'Unique list has ',k,' elements: '\\n write(*,*) res(1:k)\\nend program remove_dups\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nSub removeDuplicates(a() As Integer, b() As Integer)\\n Dim lb As Integer = LBound(a)\\n Dim ub As Integer = UBound(a)\\n If ub = -1 Then Return '' empty array\\n Redim b(lb To ub)\\n b(lb) = a(lb)\\n Dim count As Integer = 1\\n Dim unique As Boolean\\n\\n For i As Integer = lb + 1 To ub\\n unique = True\\n For j As Integer = lb to i - 1\\n If a(i) = a(j) Then\\n unique = False\\n Exit For\\n End If\\n Next j\\n If unique Then\\n b(lb + count) = a(i)\\n count += 1\\n End If\\n Next i\\n\\n If count > 0 Then Redim Preserve b(lb To lb + count - 1)\\nEnd Sub\\n\\nDim a(1 To 10) As Integer = {1, 2, 1, 4, 5, 2, 15, 1, 3, 4}\\nDim b() As Integer\\nremoveDuplicates a(), b()\\n\\nFor i As Integer = LBound(b) To UBound(b)\\n Print b(i); \\\" \\\";\\nNext\\n\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"b = [1, 5, 2, 6, 6, 2, 2, 1, 9, 8, 6, 5]\\n\\n// One way, using OrderedList. An OrderedList is a type of array that keeps\\n// its elements in order. The items must be comparable.\\na = new OrderedList\\nprintln[a.insertAllUnique[b]]\\n\\n// Another way, using the \\\"set\\\" datatype and back to an array.\\nprintln[toArray[toSet[b]]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"include \\\"NSLog.incl\\\"\\n\\nCFArrayRef array, unique\\nOrderedSetRef ordered\\n\\narray = @[@\\\"A\\\", @\\\"B\\\", @\\\"C\\\", @\\\"B\\\", @\\\"A\\\", @\\\"C\\\", @\\\"A\\\", @\\\"C\\\", @\\\"A\\\", @\\\"B\\\", @\\\"C\\\"]\\nordered = fn OrderedSetWithArray( array )\\nNSLog( @\\\"%@\\\", fn OrderedSetArray( ordered ) )\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"Public Sub Main()\\nDim sString As String[] = Split(\\\"Now is the time for all the good men to come to the aid of the good party 1 2 1 3 3 3 2 1 1 2 3 4 33 2 5 4 333 5\\\", \\\" \\\")\\nDim sFix As New String[]\\nDim sTemp As String\\n\\nFor Each sTemp In sString\\n sTemp &= \\\" \\\"\\n If InStr(sFix.Join(\\\" \\\") & \\\" \\\", sTemp) Then Continue\\n sFix.Add(Trim(sTemp))\\nNext\\n\\nPrint sFix.Join(\\\" \\\")\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"# Built-in, using sets (which are also lists)\\na := [ 1, 2, 3, 1, [ 4 ], 5, 5, [4], 6 ];\\n# [ 1, 2, 3, 1, [ 4 ], 5, 5, [ 4 ], 6 ]\\nb := Set(a);\\n# [ 1, 2, 3, 5, 6, [ 4 ] ]\\nIsSet(b);\\n# true\\nIsList(b);\\n# true\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc uniq(list []int) []int {\\n\\tunique_set := make(map[int]bool, len(list))\\n\\tfor _, x := range list {\\n\\t\\tunique_set[x] = true\\n\\t}\\n\\tresult := make([]int, 0, len(unique_set))\\n\\tfor x := range unique_set {\\n\\t\\tresult = append(result, x)\\n\\t}\\n\\treturn result\\n}\\n\\nfunc main() {\\n\\tfmt.Println(uniq([]int{1, 2, 3, 2, 3, 4})) // prints: [3 4 1 2] (but in a semi-random order)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc uniq(list []int) []int {\\n\\tunique_set := make(map[int]int, len(list))\\n\\ti := 0\\n\\tfor _, x := range list {\\n\\t\\tif _, there := unique_set[x]; !there {\\n\\t\\t\\tunique_set[x] = i\\n\\t\\t\\ti++\\n\\t\\t}\\n\\t}\\n\\tresult := make([]int, len(unique_set))\\n\\tfor x, i := range unique_set {\\n\\t\\tresult[i] = x\\n\\t}\\n\\treturn result\\n}\\n\\nfunc main() {\\n\\tfmt.Println(uniq([]int{1, 2, 3, 2, 3, 4})) // prints: [1 2 3 4]\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"fmt\\\"\\n\\t\\\"math\\\"\\n)\\n\\nfunc uniq(list []float64) []float64 {\\n\\tunique_set := map[float64]int{}\\n\\ti := 0\\n\\tnan := false\\n\\tfor _, x := range list {\\n\\t\\tif _, exists := unique_set[x]; exists {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tif math.IsNaN(x) {\\n\\t\\t\\tif nan {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tnan = true\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tunique_set[x] = i\\n\\t\\ti++\\n\\t}\\n\\tresult := make([]float64, len(unique_set))\\n\\tfor x, i := range unique_set {\\n\\t\\tresult[i] = x\\n\\t}\\n\\treturn result\\n}\\n\\nfunc main() {\\n\\tfmt.Println(uniq([]float64{1, 2, math.NaN(), 2, math.NaN(), 4})) // Prints [1 2 NaN 4]\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"fmt\\\"\\n\\t\\\"math\\\"\\n\\t\\\"reflect\\\"\\n)\\n\\nfunc uniq(x interface{}) (interface{}, bool) {\\n\\tv := reflect.ValueOf(x)\\n\\tif !v.IsValid() {\\n\\t\\tpanic(\\\"uniq: invalid argument\\\")\\n\\t}\\n\\tif k := v.Kind(); k != reflect.Array && k != reflect.Slice {\\n\\t\\tpanic(\\\"uniq: argument must be an array or a slice\\\")\\n\\t}\\n\\telemType := v.Type().Elem()\\n\\tintType := reflect.TypeOf(int(0))\\n\\tmapType := reflect.MapOf(elemType, intType)\\n\\tm := reflect.MakeMap(mapType)\\n\\ti := 0\\n\\tfor j := 0; j < v.Len(); j++ {\\n\\t\\tx := v.Index(j)\\n\\t\\tif m.MapIndex(x).IsValid() {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tm.SetMapIndex(x, reflect.ValueOf(i))\\n\\t\\tif m.MapIndex(x).IsValid() {\\n\\t\\t\\ti++\\n\\t\\t}\\n\\t}\\n\\tsliceType := reflect.SliceOf(elemType)\\n\\tresult := reflect.MakeSlice(sliceType, i, i)\\n\\thadNaN := false\\n\\tfor _, key := range m.MapKeys() {\\n\\t\\tival := m.MapIndex(key)\\n\\t\\tif !ival.IsValid() {\\n\\t\\t\\thadNaN = true\\n\\t\\t} else {\\n\\t\\t\\tresult.Index(int(ival.Int())).Set(key)\\n\\t\\t}\\n\\t}\\n\\n\\treturn result.Interface(), hadNaN\\n}\\n\\ntype MyType struct {\\n\\tname string\\n\\tvalue float32\\n}\\n\\nfunc main() {\\n\\tintArray := [...]int{5, 1, 2, 3, 2, 3, 4}\\n\\tintSlice := []int{5, 1, 2, 3, 2, 3, 4}\\n\\tstringSlice := []string{\\\"five\\\", \\\"one\\\", \\\"two\\\", \\\"three\\\", \\\"two\\\", \\\"three\\\", \\\"four\\\"}\\n\\tfloats := []float64{1, 2, 2, 4,\\n\\t\\tmath.NaN(), 2, math.NaN(),\\n\\t\\tmath.Inf(1), math.Inf(1), math.Inf(-1), math.Inf(-1)}\\n\\tcomplexes := []complex128{1, 1i, 1 + 1i, 1 + 1i,\\n\\t\\tcomplex(math.NaN(), 1), complex(1, math.NaN()),\\n\\t\\tcomplex(math.Inf(+1), 1), complex(1, math.Inf(1)),\\n\\t\\tcomplex(math.Inf(-1), 1), complex(1, math.Inf(1)),\\n\\t}\\n\\tstructs := []MyType{\\n\\t\\t{\\\"foo\\\", 42},\\n\\t\\t{\\\"foo\\\", 2},\\n\\t\\t{\\\"foo\\\", 42},\\n\\t\\t{\\\"bar\\\", 42},\\n\\t\\t{\\\"bar\\\", 2},\\n\\t\\t{\\\"fail\\\", float32(math.NaN())},\\n\\t}\\n\\n\\tfmt.Print(\\\"intArray: \\\", intArray, \\\" → \\\")\\n\\tfmt.Println(uniq(intArray))\\n\\tfmt.Print(\\\"intSlice: \\\", intSlice, \\\" → \\\")\\n\\tfmt.Println(uniq(intSlice))\\n\\tfmt.Print(\\\"stringSlice: \\\", stringSlice, \\\" → \\\")\\n\\tfmt.Println(uniq(stringSlice))\\n\\tfmt.Print(\\\"floats: \\\", floats, \\\" → \\\")\\n\\tfmt.Println(uniq(floats))\\n\\tfmt.Print(\\\"complexes: \\\", complexes, \\\"\\\\n → \\\")\\n\\tfmt.Println(uniq(complexes))\\n\\tfmt.Print(\\\"structs: \\\", structs, \\\" → \\\")\\n\\tfmt.Println(uniq(structs))\\n\\t// Passing a non slice or array will compile put\\n\\t// then produce a run time panic:\\n\\t//a := 42\\n\\t//uniq(a)\\n\\t//uniq(nil)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def list = [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\\nassert list.size() == 12\\nprintln \\\" Original List: ${list}\\\"\\n\\n// Filtering the List (non-mutating)\\ndef list2 = list.unique(false)\\nassert list2.size() == 8\\nassert list.size() == 12\\nprintln \\\" Filtered List: ${list2}\\\"\\n\\n// Filtering the List (in place)\\nlist.unique()\\nassert list.size() == 8\\nprintln \\\" Original List, filtered: ${list}\\\"\\n\\ndef list3 = [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\\nassert list3.size() == 12\\n\\n// Converting to Set\\ndef set = list as Set\\nassert set.size() == 8\\nprintln \\\" Set: ${set}\\\"\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"10 ' Remove Duplicates\\n20 OPTION BASE 1\\n30 LET MAXI% = 7\\n40 DIM D(7), R(7): ' data, result\\n50 ' Set the data.\\n60 FOR I% = 1 TO 7\\n70 READ D(I%)\\n80 NEXT I%\\n90 ' Remove duplicates.\\n100 LET R(1) = D(1)\\n110 LET LRI% = 1: ' last index of result\\n120 LET P% = 1: ' position\\n130 WHILE P% < MAXI%\\n140 LET P% = P% + 1\\n150 LET ISNEW = 1: ' is a new number?\\n160 LET RI% = 1: ' current index of result\\n170 WHILE (RI% <= LRI%) AND ISNEW\\n180 IF D(P%) = R(RI%) THEN LET ISNEW = 0\\n190 LET RI% = RI% + 1\\n200 WEND\\n210 IF ISNEW THEN LET LRI% = LRI% + 1: LET R(LRI%) = D(P%)\\n220 WEND\\n230 FOR RI% = 1 TO LRI%\\n240 PRINT R(RI%)\\n250 NEXT RI%\\n260 END\\n1000 DATA 1, 2, 2, 3, 4, 5, 5\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \" print $ unique [4, 5, 4, 2, 3, 3, 4]\\n\\n[4,5,2,3]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import qualified Data.Set as Set\\n\\nunique :: Ord a => [a] -> [a]\\nunique = Set.toList . Set.fromList\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Set\\n\\nunique :: Ord a => [a] -> [a]\\nunique = loop empty\\n where\\n loop s [] = []\\n loop s (x : xs) | member x s = loop s xs\\n | otherwise = x : loop (insert x s) xs\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.List\\n\\nunique :: Eq a => [a] -> [a]\\nunique [] = []\\nunique (x : xs) = x : unique (filter (x /=) xs)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.List\\nData.List.nub :: Eq a => [a] -> [a]\\nData.List.Unique.unique :: Ord a => [a] -> [a]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"REAL :: nums(12)\\nCHARACTER :: workspace*100\\n\\nnums = (1, 3, 2, 9, 1, 2, 3, 8, 8, 1, 0, 2)\\nWRITE(Text=workspace) nums ! convert to string\\nEDIT(Text=workspace, SortDelDbls=workspace) ! do the job for a string\\nREAD(Text=workspace, ItemS=individuals) nums ! convert to numeric\\n\\nWRITE(ClipBoard) individuals, \\\"individuals: \\\", nums ! 6 individuals: 0 1 2 3 8 9 0 0 0 0 0 0\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"procedure main(args)\\n every write(!noDups(args))\\nend\\n\\nprocedure noDups(L)\\n every put(newL := [], notDup(set(),!L))\\n return newL\\nend\\n\\nprocedure notDup(cache, a)\\n if not member(cache, a) then {\\n insert(cache, a)\\n return a\\n }\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"non_repeated_values = array[uniq(array, sort( array))]\\n\",\n \"language\": \"IDL\"\n },\n {\n \"code\": \"To decide which list of Ks is (L - list of values of kind K) without duplicates:\\n\\tlet result be a list of Ks;\\n\\trepeat with X running through L:\\n\\t\\tadd X to result, if absent;\\n\\tdecide on result.\\n\",\n \"language\": \"Inform-7\"\n },\n {\n \"code\": \"100 PROGRAM \\\"RemoveDu.bas\\\"\\n110 RANDOMIZE\\n120 NUMERIC ARR(1 TO 20),TOP\\n130 LET TOP=FILL(ARR)\\n140 CALL WRITE(ARR,TOP)\\n150 LET TOP=REMOVE(ARR)\\n160 CALL WRITE(ARR,TOP)\\n170 DEF WRITE(REF A,N)\\n180 FOR I=1 TO N\\n190 PRINT A(I);\\n200 NEXT\\n210 PRINT\\n220 END DEF\\n230 DEF FILL(REF A)\\n240 LET FILL=UBOUND(A):LET A(LBOUND(A))=1\\n250 FOR I=LBOUND(A)+1 TO UBOUND(A)\\n260 LET A(I)=A(I-1)+RND(3)\\n270 NEXT\\n280 END DEF\\n290 DEF REMOVE(REF A)\\n300 LET ST=0\\n310 FOR I=LBOUND(A)+1 TO UBOUND(A)\\n320 IF A(I-1)=A(I) THEN LET ST=ST+1\\n330 IF ST>0 THEN LET A(I-ST)=A(I)\\n340 NEXT\\n350 LET REMOVE=UBOUND(A)-ST\\n360 END DEF\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \" ~. 4 3 2 8 0 1 9 5 1 7 6 3 9 9 4 2 1 5 3 2\\n4 3 2 8 0 1 9 5 7 6\\n ~. 'chthonic eleemosynary paronomasiac'\\nchtoni elmsyarp\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 0 1 1 2 0 */0 1 2\\n0 0 0\\n0 1 2\\n0 1 2\\n0 2 4\\n0 0 0\\n ~. 0 1 1 2 0 */0 1 2\\n0 0 0\\n0 1 2\\n0 2 4\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"fn deduplicated<T>(anon array: [T]) throws -> [T] {\\n mut existing_items: {T} = {}\\n mut result: [T] = []\\n for value in array {\\n if not existing_items.contains(value) {\\n existing_items.add(value)\\n result.push(value)\\n }\\n }\\n return result\\n}\\n\\nfn deduplicated_set<T>(anon array: [T]) throws -> {T} {\\n mut result: {T} = {}\\n for value in array {\\n result.add(value)\\n }\\n return result\\n}\\n\\n\\nfn main() {\\n let array = [1, 2, 3, 3, 2, 5, 4]\\n println(\\\"{}\\\", deduplicated(array))\\n println(\\\"{}\\\", deduplicated_set(array))\\n}\\n\",\n \"language\": \"Jakt\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.Iterator;\\nimport java.util.LinkedHashSet;\\nimport java.util.List;\\nimport java.util.Set;\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"int[] removeDuplicates(int[] values) {\\n /* use a LinkedHashSet to preserve order */\\n Set<Integer> set = new LinkedHashSet<>();\\n for (int value : values)\\n set.add(value);\\n values = new int[set.size()];\\n Iterator<Integer> iterator = set.iterator();\\n int index = 0;\\n while (iterator.hasNext())\\n values[index++] = iterator.next();\\n return values;\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"int[] removeDuplicates(int[] values) {\\n List<Integer> list = new ArrayList<>();\\n for (int value : values)\\n if (!list.contains(value)) list.add(value);\\n values = new int[list.size()];\\n int index = 0;\\n for (int value : list)\\n values[index++] = value;\\n return values;\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.util.*;\\n\\nclass Test {\\n\\n public static void main(String[] args) {\\n\\n Object[] data = {1, 1, 2, 2, 3, 3, 3, \\\"a\\\", \\\"a\\\", \\\"b\\\", \\\"b\\\", \\\"c\\\", \\\"d\\\"};\\n Set<Object> uniqueSet = new HashSet<Object>(Arrays.asList(data));\\n for (Object o : uniqueSet)\\n System.out.printf(\\\"%s \\\", o);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.util.*;\\n\\nclass Test {\\n\\n public static void main(String[] args) {\\n\\n Object[] data = {1, 1, 2, 2, 3, 3, 3, \\\"a\\\", \\\"a\\\", \\\"b\\\", \\\"b\\\", \\\"c\\\", \\\"d\\\"};\\n Arrays.stream(data).distinct().forEach((o) -> System.out.printf(\\\"%s \\\", o));\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function unique(ary) {\\n // concat() with no args is a way to clone an array\\n var u = ary.concat().sort();\\n for (var i = 1; i < u.length; ) {\\n if (u[i-1] === u[i])\\n u.splice(i,1);\\n else\\n i++;\\n }\\n return u;\\n}\\n\\nvar ary = [1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\", 2, 3, 4, \\\"b\\\", \\\"c\\\", \\\"d\\\", \\\"4\\\"];\\nvar uniq = unique(ary);\\nfor (var i = 0; i < uniq.length; i++)\\n print(uniq[i] + \\\"\\\\t\\\" + typeof(uniq[i]));\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"Array.prototype.unique = function() {\\n var u = this.concat().sort();\\n for (var i = 1; i < u.length; ) {\\n if (u[i-1] === u[i])\\n u.splice(i,1);\\n else\\n i++;\\n }\\n return u;\\n}\\nvar uniq = [1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\", 2, 3, 4, \\\"b\\\", \\\"c\\\", \\\"d\\\"].unique();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"Array.prototype.unique = function() {\\n return this.sort().reduce( (a,e) => e === a[a.length-1] ? a : (a.push(e), a), [] )\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"Array.prototype.unique = function() {\\n return [... new Set(this)]\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"function uniq(lst) {\\n var u = [],\\n dct = {},\\n i = lst.length,\\n v;\\n\\n while (i--) {\\n v = lst[i], dct[v] || (\\n dct[v] = u.push(v)\\n );\\n }\\n u.sort(); // optional\\n\\n return u;\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(function () {\\n 'use strict';\\n\\n // nub :: [a] -> [a]\\n function nub(xs) {\\n\\n // Eq :: a -> a -> Bool\\n function Eq(a, b) {\\n return a === b;\\n }\\n\\n // nubBy :: (a -> a -> Bool) -> [a] -> [a]\\n function nubBy(fnEq, xs) {\\n var x = xs.length ? xs[0] : undefined;\\n\\n return x !== undefined ? [x].concat(\\n nubBy(fnEq, xs.slice(1)\\n .filter(function (y) {\\n return !fnEq(x, y);\\n }))\\n ) : [];\\n }\\n\\n return nubBy(Eq, xs);\\n }\\n\\n\\n // TEST\\n\\n return [\\n nub('4 3 2 8 0 1 9 5 1 7 6 3 9 9 4 2 1 5 3 2'.split(' '))\\n .map(function (x) {\\n return Number(x);\\n }),\\n nub('chthonic eleemosynary paronomasiac'.split(''))\\n .join('')\\n ]\\n\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"DEFINE uniq == [[]] [[in] [swap pop] [cons] ifte] primrec.\\n\",\n \"language\": \"Joy\"\n },\n {\n \"code\": \"[4,3,2,1,1,2,3,4] | unique\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def removeAllButFirst:\\n\\n # The hash table functions all expect the hash table to be the input.\\n\\n # Is x in the hash table?\\n def hashed(x):\\n (x|tostring) as $value\\n | .[$value] as $bucket\\n | $bucket and (.[$value] | index([x]));\\n\\n # Add x to the hash table:\\n def add_hash(x):\\n (x|tostring) as $value\\n | .[$value] as $bucket\\n | if $bucket and ($bucket | index([x])) then .\\n else .[$value] += [x]\\n end;\\n\\n reduce .[] as $item\\n ( [[], {}]; # [array, hash]\\n if .[1] | hashed($item) then .\\n else [ (.[0] + [$item]), (.[1] | add_hash($item)) ]\\n end)\\n | .[0];\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"a = [1, 2, 3, 4, 1, 2, 3, 4]\\n@show unique(a) Set(a)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \" a:4 5#20?13 / create a random 4 x 5 matrix\\n(12 7 12 4 3\\n 6 3 7 4 7\\n 3 8 3 1 2\\n 2 12 6 4 1)\\n\\n ,/a / flatten to array\\n12 7 12 4 3 6 3 7 4 7 3 8 3 1 2 2 12 6 4 1\\n\\n ?,/a / distinct elements\\n12 7 4 3 6 8 1 2\\n\\n ?\\\"chthonic eleemosynary paronomasiac\\\"\\n\\\"chtoni elmsyarp\\\"\\n\\n ?(\\\"this\\\";\\\"that\\\";\\\"was\\\";\\\"that\\\";\\\"was\\\";\\\"this\\\")\\n(\\\"this\\\"\\n \\\"that\\\"\\n \\\"was\\\")\\n\\n 0 1 1 2 0 *\\\\: 0 1 2\\n(0 0 0\\n 0 1 2\\n 0 1 2\\n 0 2 4\\n 0 0 0)\\n\\n ?0 1 1 2 0 *\\\\: 0 1 2\\n(0 0 0\\n 0 1 2\\n 0 2 4)\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"( )\\n\\n( \\\"Now\\\" \\\"is\\\" \\\"the\\\" \\\"time\\\" \\\"for\\\" \\\"all\\\" \\\"good\\\" \\\"men\\\" \\\"to\\\" \\\"come\\\" \\\"to\\\" \\\"the\\\" \\\"aid\\\" \\\"of\\\" \\\"the\\\" \\\"party.\\\" )\\n\\nlen [\\n get rot over find\\n not (\\n [swap 0 put]\\n [nip]\\n ) if\\n swap\\n] for\\n\\nswap print drop nl\\n\\n\\\"End \\\" input\\n\",\n \"language\": \"Klingphix\"\n },\n {\n \"code\": \"fun main(args: Array<String>) {\\n val data = listOf(1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\", 2, 3, 4, \\\"b\\\", \\\"c\\\", \\\"d\\\")\\n val set = data.distinct()\\n\\n println(data)\\n println(set)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"{def removedup\\n {def removedup.loop\\n {lambda {:a :b}\\n {if {A.empty? :a}\\n then :b\\n else {removedup.loop {A.rest :a}\\n {if {= {A.in? {A.first :a} :b} -1}\\n then {A.addlast! {A.first :a} :b}\\n else :b}}}}}\\n {lambda {:s}\\n {S.replace (\\\\[|\\\\]|,) by space in\\n {A.disp\\n {removedup.loop {A.new :s} {A.new}}}}}}\\n-> removedup\\n\\n{removedup 1 2 3 a b c 2 3 4 b c d}\\n-> 1 2 3 a b c 4 d\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \": dip swap '_ set execute _ ;\\n\\n: remove-duplicates\\n [] swap do unique? length 0 == if break then loop drop ;\\n: unique?\\n 0 extract swap \\\"2dup in if drop else append then\\\" dip ;\\n\\n[1 2 6 3 6 4 5 6] remove-duplicates .\\n\",\n \"language\": \"Lang5\"\n },\n {\n \"code\": \"[1 2 6 3 6 4 5 6] 's distinct\\n[1 2 6 3 6 4 5 6] 's dress dup union .\\n\",\n \"language\": \"Lang5\"\n },\n {\n \"code\": \"local(\\n\\tx = array(3,4,8,1,8,1,4,5,6,8,9,6),\\n\\ty = array\\n)\\nwith n in #x where #y !>> #n do => { #y->insert(#n) }\\n// result: array(3, 4, 8, 1, 5, 6, 9)\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"a$ =\\\" 1 $23.19 2 elbow 3 2 Bork 4 3 elbow 2 $23.19 \\\"\\nprint \\\"Original set of elements = [\\\"; a$; \\\"]\\\"\\nb$ =removeDuplicates$( a$)\\nprint \\\"With duplicates removed = [\\\"; b$; \\\"]\\\"\\nend\\n\\nfunction removeDuplicates$( in$)\\n o$ =\\\" \\\"\\n i =1\\n do\\n term$ =word$( in$, i, \\\" \\\")\\n if instr( o$, \\\" \\\"; term$; \\\" \\\") =0 and term$ <>\\\" \\\" then o$ =o$ +term$ +\\\" \\\"\\n i =i +1\\n loop until term$ =\\\"\\\"\\n removeDuplicates$ =o$\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"show remdup [1 2 3 a b c 2 3 4 b c d] ; [1 a 2 3 4 b c d]\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"items = {1,2,3,4,1,2,3,4,\\\"bird\\\",\\\"cat\\\",\\\"dog\\\",\\\"dog\\\",\\\"bird\\\"}\\nflags = {}\\nio.write('Unique items are:')\\nfor i=1,#items do\\n if not flags[items[i]] then\\n io.write(' ' .. items[i])\\n flags[items[i]] = true\\n end\\nend\\nio.write('\\\\n')\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"local items = {1,2,3,4,1,2,3,4,0/0,nil,\\\"bird\\\",\\\"cat\\\",\\\"dog\\\",\\\"dog\\\",\\\"bird\\\",0/0}\\n\\nfunction rmdup(t)\\n local r,dup,c,NaN = {},{},1,{}\\n for i=1,#t do\\n local e = t[i]\\n local k = e~=e and NaN or e\\n if k~=nil and not dup[k] then\\n c, r[c], dup[k]= c+1, e, true\\n end\\n end\\n return r\\nend\\n\\nprint(table.concat(rmdup(items),' '))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Flush // current stack has no items\\n// Number pop a number from stack of values\\n// Letter pop a string from stack of values\\nModule TestList {\\n\\t// current stack has a number, 101\\n\\t// we can create a private stack\\n\\ta=stack:=1, 1, \\\"c\\\", \\\"d\\\", 2, 2, 3, 3, 3, \\\"a\\\", \\\"a\\\", \\\"b\\\", \\\"b\\\"\\n\\t// A list use key/values or key/Key as value. Keys can be number or strings\\n\\t// Duplicate not allowed. Exist( list_type, key_to_exam) return true if key exist\\n\\t// Lists are inventories types wich can't hold duplicates (error produce if append a duplicate)\\n\\t// Lists have O(1) for insert, delete, search (using Hash Table)\\n\\tb=list\\n\\tstack a {\\n\\t\\t// replace current stack with a, old current stack kept\\n\\t\\twhile not empty\\n\\t\\t\\tif islet then // if is letter (string)\\n\\t\\t\\t\\tif not exist(b, stackitem$()) then Append b, letter$ else drop\\n\\t\\t\\telse.if not exist(b, stackitem()) then\\n\\t\\t\\t\\tAppend b, number\\n\\t\\t\\telse\\n\\t\\t\\t\\tdrop // drop the item\\n\\t\\t\\tend if\\n\\t\\tend while\\n\\t}\\n\\t// now old current stack return as current stack\\n\\t// we can sort the b list\\n\\tSort b\\n\\tPrint b // print the list, using right align on columns for numbers, left for strings.\\n\\tPrint Number=101 // true\\n}\\nTestList 101\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"> L := [ 1, 2, 1, 2, 3, 3, 2, 1, \\\"a\\\", \\\"b\\\", \\\"b\\\", \\\"a\\\", \\\"c\\\", \\\"b\\\" ];\\n L := [1, 2, 1, 2, 3, 3, 2, 1, \\\"a\\\", \\\"b\\\", \\\"b\\\", \\\"a\\\", \\\"c\\\", \\\"b\\\"]\\n\\n> [op]({op}(L));\\n [1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\"]\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"> convert( convert( L, 'set' ), 'list' );\\n [1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\"]\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"> A := Array( L ):\\n> for u in A do T[u] := 1 end: Array( [indices]( T, 'nolist' ) );\\n [1, 2, 3, \\\"c\\\", \\\"a\\\", \\\"b\\\"]\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"DeleteDuplicates[{0, 2, 1, 4, 2, 0, 3, 1, 1, 1, 0, 3}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"{0, 2, 1, 4, 3}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"Union[{0, 2, 1, 4, 2, 0, 3, 1, 1, 1, 0, 3}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"{0, 1, 2, 3, 4}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \">> unique([1 2 6 3 6 4 5 6])\\n\\nans =\\n\\n 1 2 3 4 5 6\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"unique([8, 9, 5, 2, 0, 7, 0, 0, 4, 2, 7, 3, 9, 6, 6, 2, 4, 7, 9, 8, 3, 8, 0, 3, 7, 0, 2, 7, 6, 0]);\\n[0, 2, 3, 4, 5, 6, 7, 8, 9]\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"uniques = #(1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\", 2, 3, 4, \\\"b\\\", \\\"c\\\", \\\"d\\\")\\nfor i in uniques.count to 1 by -1 do\\n(\\n id = findItem uniques uniques[i]\\n if (id != i) do deleteItem uniques i\\n)\\n\",\n \"language\": \"MAXScript\"\n },\n {\n \"code\": \"' Set the data.\\ndataArray[1] = 1\\ndataArray[2] = 2\\ndataArray[3] = 2\\ndataArray[4] = 3\\ndataArray[5] = 4\\ndataArray[6] = 5\\ndataArray[7] = 5\\n\\nresultArray[1] = dataArray[1]\\nlastResultIndex = 1\\nposition = 1\\nWhile position < Array.GetItemCount(dataArray)\\n position = position + 1\\n isNewNumber = 1 ' logical 1\\n resultIndex = 1\\n While (resultIndex <= lastResultIndex) And isNewNumber = 1\\n If dataArray[position] = resultArray[resultIndex] Then\\n isNewNumber = 0\\n EndIf\\n resultIndex = resultIndex + 1\\n EndWhile\\n If isNewNumber = 1 Then\\n lastResultIndex = lastResultIndex + 1\\n resultArray[lastResultIndex] = dataArray[position]\\n EndIf\\nEndWhile\\nFor resultIndex = 1 To lastResultIndex\\n TextWindow.WriteLine(resultArray[resultIndex])\\nEndFor\\n\",\n \"language\": \"Microsoft-Small-Basic\"\n },\n {\n \"code\": \"items = [1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\", 2, 3, 4, \\\"b\\\", \\\"c\\\", \\\"d\\\"]\\nd = {}\\nfor i in items\\n d.push i\\nend for\\nprint d.indexes\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"fun mem (x, []) = false\\n | (x eql a, a :: as) = true\\n | (x, _ :: as) = mem (x, as)\\n;\\t\\nfun remdup\\n\\t\\t([], uniq) = rev uniq\\n\\t|\\t(h :: t, uniq) = if mem(h, uniq) then\\n\\t\\t\\t\\tremdup (t, uniq)\\n\\t\\t\\telse\\n\\t\\t\\t\\tremdup (t, h :: uniq)\\n\\t|\\tL =\\tremdup (L, [])\\n\\t\\n;\\t\\nprintln ` implode ` remdup ` explode \\\"the quick brown fox jumped over the lazy dog\\\";\\nprintln ` remdup [1,2,3,4,4,3,2,1, \\\"dog\\\",\\\"cat\\\",\\\"dog\\\", 1.1, 2.2, 3.3, 1.1];\\n\",\n \"language\": \"MLite\"\n },\n {\n \"code\": \"MODULE RemoveDuplicates;\\n\\nFROM STextIO IMPORT\\n WriteLn;\\nFROM SWholeIO IMPORT\\n WriteInt;\\n\\nTYPE\\n TArrayRange = [1 .. 7];\\n TArray = ARRAY TArrayRange OF INTEGER;\\n\\nVAR\\n DataArray, ResultArray: TArray;\\n ResultIndex, LastResultIndex, Position: CARDINAL;\\n IsNewNumber: BOOLEAN;\\n\\nBEGIN\\n (* Set the data. *);\\n DataArray[1] := 1;\\n DataArray[2] := 2;\\n DataArray[3] := 2;\\n DataArray[4] := 3;\\n DataArray[5] := 4;\\n DataArray[6] := 5;\\n DataArray[7] := 5;\\n\\n ResultArray[1] := DataArray[1];\\n LastResultIndex := 1;\\n Position := 1;\\n WHILE Position < HIGH(DataArray) DO\\n INC(Position);\\n IsNewNumber := TRUE;\\n ResultIndex := 1;\\n WHILE (ResultIndex <= LastResultIndex) AND IsNewNumber DO\\n IF DataArray[Position] = ResultArray[ResultIndex] THEN\\n IsNewNumber := FALSE;\\n END;\\n INC(ResultIndex);\\n END;\\n IF IsNewNumber THEN\\n INC(LastResultIndex);\\n ResultArray[LastResultIndex] := DataArray[Position];\\n END\\n END;\\n FOR ResultIndex := 1 TO LastResultIndex DO\\n WriteInt(ResultArray[ResultIndex], 1);\\n WriteLn;\\n END;\\nEND RemoveDuplicates.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"REMDUPE(L,S)\\n ;L is the input listing\\n ;S is the separator between entries\\n ;R is the list to be returned\\n NEW Z,I,R\\n FOR I=1:1:$LENGTH(L,S) SET Z($PIECE(L,S,I))=\\\"\\\"\\n ;Repack for return\\n SET I=\\\"\\\",R=\\\"\\\"\\n FOR SET I=$O(Z(I)) QUIT:I=\\\"\\\" SET R=$SELECT($L(R)=0:I,1:R_S_I)\\n KILL Z,I\\n QUIT R\\n\",\n \"language\": \"MUMPS\"\n },\n {\n \"code\": \"items = {1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\", 2, 3, 4, \\\"b\\\", \\\"c\\\", \\\"d\\\"}\\nunique = {}\\n\\nfor item in items\\n if not item in unique\\n unique.append(item)\\n end\\nend\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"/**\\n Remove duplicate elements, in Neko\\n*/\\n\\nvar original = $array(1, 2, 1, 4, 5, 2, 15, 1, 3, 4)\\n\\n/* Create a table with only unique elements from the array */\\nvar dedup = function(a) {\\n var size = $asize(a)\\n var hash = $hnew(size)\\n while size > 0 {\\n var v = a[size - 1]\\n var k = $hkey(v)\\n $hset(hash, k, v, null)\\n size -= 1\\n }\\n return hash\\n}\\n\\n/* Show the original list and the unique values */\\n$print(original, \\\"\\\\n\\\")\\nvar show = function(k, v) $print(v, \\\" \\\")\\n$hiter(dedup(original), show)\\n$print(\\\"\\\\n\\\")\\n\",\n \"language\": \"Neko\"\n },\n {\n \"code\": \"using System.Console;\\n\\nmodule RemDups\\n{\\n Main() : void\\n {\\n def nums = array[1, 4, 6, 3, 6, 2, 7, 2, 5, 2, 6, 8];\\n def unique = $[n | n in nums].RemoveDuplicates();\\n WriteLine(unique);\\n }\\n}\\n\",\n \"language\": \"Nemerle\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary\\n\\n-- Note: Task requirement is to process \\\"arrays\\\". The following converts arrays into simple lists of words:\\n-- Putting the resulting list back into an array is left as an exercise for the reader.\\na1 = [2, 3, 5, 7, 11, 13, 17, 19, 'cats', 222, -100.2, +11, 1.1, +7, '7.', 7, 5, 5, 3, 2, 0, 4.4, 2]\\na2 = [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\\na3 = ['Now', 'is', 'the', 'time', 'for', 'all', 'good', 'men', 'to', 'come', 'to', 'the', 'aid', 'of', 'the', 'party.']\\nx = 0\\nlists = ''\\nx = x + 1; lists[0] = x; lists[x] = array2wordlist(a1)\\nx = x + 1; lists[0] = x; lists[x] = array2wordlist(a2)\\nx = x + 1; lists[0] = x; lists[x] = array2wordlist(a3)\\n\\nloop ix = 1 to lists[0]\\n nodups_list = remove_dups(lists[ix])\\n say ix.right(4)':' lists[ix]\\n say ''.right(4)':' nodups_list\\n say\\n end ix\\n\\nreturn\\n\\n-- =============================================================================\\nmethod remove_dups(list) public static\\n\\n newlist = ''\\n nodups = '0'\\n loop w_ = 1 to list.words()\\n ix = list.word(w_)\\n nodups[ix] = nodups[ix] + 1 -- we can even collect a count of dups if we want\\n end w_\\n loop k_ over nodups\\n newlist = newlist k_\\n end k_\\n\\n return newlist.space\\n\\n-- =============================================================================\\nmethod array2wordlist(ra = Rexx[]) public static\\n\\n wordlist = ''\\n loop r_ over ra\\n wordlist = wordlist r_\\n end r_\\n\\n return wordlist.space\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"(unique '(1 2 3 a b c 2 3 4 b c d))\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"uniques := [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\\ncull uniques\\n=+-+-+-+-+-+-+-+-+\\n=|1|2|3|a|b|c|4|d|\\n=+-+-+-+-+-+-+-+-+\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \"cull 1 1 2 2 3 3\\n=1 2 3\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \"import sequtils, algorithm, intsets\\n\\n# Go through the list, and for each element, check the rest of the list to see\\n# if it appears again,\\nvar items = @[1, 2, 3, 2, 3, 4, 5, 6, 7]\\necho deduplicate(items) # O(n^2)\\n\\nproc filterDup(xs: openArray[int]): seq[int] =\\n result = @[xs[0]]\\n var last = xs[0]\\n for x in xs[1..xs.high]:\\n if x != last:\\n result.add(x)\\n last = x\\n\\n# Put the elements into a hash table which does not allow duplicates.\\nvar s = initIntSet()\\nfor x in items:\\n s.incl(x)\\necho s\\n\\n# Sort the elements and remove consecutive duplicate elements.\\nsort(items, system.cmp[int]) # O(n log n)\\necho filterDup(items) # O(n)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"MODULE RD;\\n\\nIMPORT Out;\\n\\nTYPE\\n TArray = ARRAY 7 OF INTEGER;\\n\\nVAR\\n DataArray,ResultArray:TArray;\\n ResultIndex,LastResultIndex,Position:LONGINT;\\n IsNewNumber:BOOLEAN;\\n\\nPROCEDURE Init(VAR A:TArray);\\nBEGIN\\n A[0] := 1; A[1] := 2; A[2] := 2; A[3] := 3;\\n A[4] := 4; A[5] := 5; A[6] := 5;\\nEND Init;\\n\\nBEGIN\\n Init(DataArray);\\n ResultArray[0] := DataArray[0];\\n LastResultIndex := 0;\\n Position := 0;\\n WHILE Position < LEN(DataArray)-1 DO\\n INC(Position);\\n IsNewNumber := TRUE;\\n ResultIndex := 0;\\n WHILE(ResultIndex <= LastResultIndex) & (IsNewNumber) DO\\n IF DataArray[Position] = ResultArray[ResultIndex] THEN\\n\\tIsNewNumber := FALSE;\\n END;\\n INC(ResultIndex);\\n END;\\n IF IsNewNumber THEN\\n INC(LastResultIndex);\\n ResultArray[LastResultIndex] := DataArray[Position];\\n END;\\n END;\\n FOR ResultIndex := 0 TO LastResultIndex DO\\n Out.Int(ResultArray[ResultIndex],0); Out.Char(' ');\\n END;\\n Out.Ln;\\nEND RD.\\n\",\n \"language\": \"Oberon\"\n },\n {\n \"code\": \"use Structure;\\n\\nbundle Default {\\n class Unique {\\n function : Main(args : String[]) ~ Nil {\\n nums := [1, 1, 2, 3, 4, 4];\\n unique := IntVector->New();\\n\\n each(i : nums) {\\n n := nums[i];\\n if(unique->Has(n) = false) {\\n unique->AddBack(n);\\n };\\n };\\n\\n each(i : unique) {\\n unique->Get(i)->PrintLine();\\n };\\n }\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"NSArray *items = [NSArray arrayWithObjects:@\\\"A\\\", @\\\"B\\\", @\\\"C\\\", @\\\"B\\\", @\\\"A\\\", nil];\\n\\nNSSet *unique = [NSSet setWithArray:items];\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"let uniq lst =\\n let unique_set = Hashtbl.create (List.length lst) in\\n List.iter (fun x -> Hashtbl.replace unique_set x ()) lst;\\n Hashtbl.fold (fun x () xs -> x :: xs) unique_set []\\n\\nlet _ =\\n uniq [1;2;3;2;3;4]\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let uniq lst =\\n let seen = Hashtbl.create (List.length lst) in\\n List.filter (fun x -> let tmp = not (Hashtbl.mem seen x) in\\n Hashtbl.replace seen x ();\\n tmp) lst\\n\\nlet _ =\\n uniq [1;2;3;2;3;4]\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let uniq l =\\n let rec tail_uniq a l =\\n match l with\\n | [] -> a\\n | hd::tl -> tail_uniq (hd::a) (List.filter (fun x -> x != hd) tl) in\\n tail_uniq [] l\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"List.sort_uniq compare [1;2;3;2;3;4]\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"input=[1 2 6 4 2 32 5 5 4 3 3 5 1 2 32 4 4];\\noutput=unique(input);\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"data = .array~of(1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\", 2, 3, 4, \\\"b\\\", \\\"c\\\", \\\"d\\\")\\nuniqueData = .set~new~union(data)~makearray~sort\\n\\nsay \\\"Unique elements are\\\"\\nsay\\ndo item over uniqueData\\n say item\\nend\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"declare\\n\\n fun {Nub Xs}\\n D = {Dictionary.new}\\n in\\n for X in Xs do D.X := unit end\\n {Dictionary.keys D}\\n end\\n\\nin\\n\\n {Show {Nub [1 2 1 3 5 4 3 4 4]}}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"rd(v)={\\n vecsort(v,,8)\\n};\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"Program RemoveDuplicates;\\n\\nconst\\n iArray: array[1..7] of integer = (1, 2, 2, 3, 4, 5, 5);\\n\\nvar\\n rArray: array[1..7] of integer;\\n i, pos, last: integer;\\n newNumber: boolean;\\n\\nbegin\\n rArray[1] := iArray[1];\\n last := 1;\\n pos := 1;\\n while pos < high(iArray) do\\n begin\\n inc(pos);\\n newNumber := true;\\n for i := low(rArray) to last do\\n if iArray[pos] = rArray[i] then\\n begin\\n newNumber := false;\\n\\tbreak;\\n end;\\n if newNumber then\\n begin\\n inc(last);\\n rArray[last] := iArray[pos];\\n end;\\n end;\\n for i := low(rArray) to last do\\n writeln (rArray[i]);\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use List::MoreUtils qw(uniq);\\n\\nmy @uniq = uniq qw(1 2 3 a b c 2 3 4 b c d);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"my %seen;\\nmy @uniq = grep {!$seen{$_}++} qw(1 2 3 a b c 2 3 4 b c d);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"my %hash = map { $_ => 1 } qw(1 2 3 a b c 2 3 4 b c d);\\nmy @uniq = keys %hash;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"my %seen;\\n@seen{qw(1 2 3 a b c 2 3 4 b c d)} = ();\\nmy @uniq = keys %seen;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">unique</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Now is the time for all good men to come to the aid of the party.\\\"</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">\\\"STABLE\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">unique</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">15</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #008000;\\\">\\\"STABLE\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">unique</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"a\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"b\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"c\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"b\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"c\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"d\\\"</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #008000;\\\">\\\"STABLE\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">unique</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #008000;\\\">\\\"STABLE\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">unique</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"chthonic eleemosynary paronomasiac\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"STABLE\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"\\\"Now\\\" \\\"is\\\" \\\"the\\\" \\\"time\\\" \\\"for\\\" \\\"all\\\" \\\"good\\\" \\\"men\\\" \\\"to\\\" \\\"come\\\" \\\"to\\\" \\\"the\\\" \\\"aid\\\" \\\"of\\\" \\\"the\\\" \\\"party.\\\" stklen tolist\\n\\n0 tolist var newlist\\n\\nlen for\\n get newlist over find\\n not if\\n swap 0 put var newlist\\n else\\n drop drop\\n endif\\nendfor\\n\\nnewlist print drop\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"$list = array(1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd');\\n$unique_list = array_unique($list);\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(uniq (2 4 6 1 2 3 4 5 6 1 3 5))\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"*process mar(1,72);\\nremdup: Proc options(main);\\n declare t(20) fixed initial (6, 6, 1, 5, 6, 2, 1, 7,\\n 5, 22, 4, 19, 1, 1, 6, 8, 9, 10, 11, 12);\\n declare (i, j, k, n, e) fixed;\\n\\n put skip list ('Input:');\\n put edit ((t(k) do k = 1 to hbound(t))) (skip,20(f(3)));\\n n = hbound(t,1);\\n i = 0;\\nouter:\\n do k = 1 to n;\\n e = t(k);\\n do j = k-1 to 1 by -1;\\n if e = t(j) then iterate outer;\\n end;\\n i = i + 1;\\n t(i) = e;\\n end;\\n\\n put skip list ('Unique elements are:');\\n put edit ((t(k) do k = 1 to i)) (skip,20(f(3)));\\nend;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \";;; Initial array\\nlvars ar = {1 2 3 2 3 4};\\n;;; Create a hash table\\nlvars ht= newmapping([], 50, 0, true);\\n;;; Put all array as keys into the hash table\\nlvars i;\\nfor i from 1 to length(ar) do\\n 1 -> ht(ar(i))\\nendfor;\\n\\n;;; Collect keys into a list\\nlvars ls = [];\\nappdata(ht, procedure(x); cons(front(x), ls) -> ls; endprocedure);\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \" [10 8 8 98 32 2 4 5 10 ] dup length dict begin aload let* currentdict {pop} map end\\n\",\n \"language\": \"PostScript\"\n },\n {\n \"code\": \"$data = 1,2,3,1,2,3,4,1\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$h = @{}\\nforeach ($x in $data) {\\n $h[$x] = 1\\n}\\n$h.Keys\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$data | Sort-Object -Unique\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$data | Select-Object -Unique\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"uniq(Data,Uniques) :- sort(Data,Uniques).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"?- uniq([1, 2, 3, 2, 3, 4],Xs).\\nXs = [1, 2, 3, 4]\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"member1(X,[H|_]) :- X==H,!.\\nmember1(X,[_|T]) :- member1(X,T).\\n\\ndistinct([],[]).\\ndistinct([H|T],C) :- member1(H,T),!, distinct(T,C).\\ndistinct([H|T],[H|C]) :- distinct(T,C).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"?- distinct([A, A, 1, 2, 3, 2, 3, 4],Xs).\\nXs = [A, 1, 2, 3, 4]\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"NewMap MyElements.s()\\n\\nFor i=0 To 9 ;Mark 10 items at random, causing high risk of duplication items.\\n x=Random(9)\\n t$=\\\"Number \\\"+str(x)+\\\" is marked\\\"\\n MyElements(str(x))=t$ ; Add element 'X' to the hash list or overwrite if already included.\\nNext\\n\\nForEach MyElements()\\n Debug MyElements()\\nNext\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"items = [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\\nunique = list(set(items))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"items = [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\\nunique = []\\nhelperset = set()\\nfor x in items:\\n if x not in helperset:\\n unique.append(x)\\n helperset.add(x)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import itertools\\nitems = [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\\nunique = [k for k,g in itertools.groupby(sorted(items))]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"items = [1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']\\nunique = []\\nfor x in items:\\n if x not in unique:\\n unique.append(x)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from collections import OrderedDict as od\\n\\nprint(list(od.fromkeys([1, 2, 3, 'a', 'b', 'c', 2, 3, 4, 'b', 'c', 'd']).keys()))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from itertools import (groupby)\\n\\n\\n# nubByKey :: (a -> b) -> [a] -> [a]\\ndef nubByKey(k, xs):\\n return list(list(v)[0] for _, v in groupby(sorted(xs, key=k), key=k))\\n\\n\\nxs = [\\n 'apple', 'apple',\\n 'ampersand', 'aPPLE', 'Apple',\\n 'orange', 'ORANGE', 'Orange', 'orange', 'apple'\\n]\\nfor k in [\\n id, # default case sensitive uniqueness\\n lambda x: x.lower(), # case-insensitive uniqueness\\n lambda x: x[0], # unique first character (case-sensitive)\\n lambda x: x[0].lower(), # unique first character (case-insensitive)\\n]:\\n print (\\n nubByKey(k, xs)\\n )\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"# nubByEq :: (a -> a -> Bool) -> [a] -> [a]\\ndef nubByEq(eq, xs):\\n def go(yys, xxs):\\n if yys:\\n y = yys[0]\\n ys = yys[1:]\\n return go(ys, xxs) if (\\n elemBy(eq, y, xxs)\\n ) else (\\n [y] + go(ys, [y] + xxs)\\n )\\n else:\\n return []\\n return go(xs, [])\\n\\n\\n# elemBy :: (a -> a -> Bool) -> a -> [a] -> Bool\\ndef elemBy(eq, x, xs):\\n if xs:\\n return eq(x, xs[0]) or elemBy(eq, x, xs[1:])\\n else:\\n return False\\n\\n\\nxs = [\\n 'apple', 'apple',\\n 'ampersand', 'aPPLE', 'Apple',\\n 'orange', 'ORANGE', 'Orange', 'orange', 'apple'\\n]\\nfor eq in [\\n lambda a, b: a == b, # default case sensitive uniqueness\\n lambda a, b: a.lower() == b.lower(), # case-insensitive uniqueness\\n lambda a, b: a[0] == b[0], # unique first char (case-sensitive)\\n lambda a, b: a[0].lower() == b[0].lower(), # unique first char (any case)\\n]:\\n print (\\n nubByEq(eq, xs)\\n )\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"# nubBy :: (a -> a -> Bool) -> [a] -> [a]\\ndef nubBy(p, xs):\\n def go(xs):\\n if xs:\\n x = xs[0]\\n return [x] + go(\\n list(filter(\\n lambda y: not p(x, y),\\n xs[1:]\\n ))\\n )\\n else:\\n return []\\n return go(xs)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"(define remove-duplicates\\n [] -> []\\n [A|R] -> (remove-duplicates R) where (element? A R)\\n [A|R] -> [A|(remove-duplicates R)])\\n\\n(remove-duplicates [a b a a b b c d e])\\n\",\n \"language\": \"Qi\"\n },\n {\n \"code\": \" [ dup [] = iff ]else[ done\\n ' sortwith nested\\n ]'[ nested join do\\n behead dup dip nested rot\\n witheach\\n [ tuck != if\\n [ dup dip\\n [ nested join ] ] ]\\n drop ] is uniquewith ( [ --> [ )\\n\\n ' [ 1 2 3 5 6 7 8 1 2 3 4 5 6 7 ] uniquewith > echo\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"items <- c(1,2,3,2,4,3,2)\\nunique (items)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"-> (remove-duplicates '(2 1 3 2.0 a 4 5 b 4 3 a 7 1 3 x 2))\\n'(2 1 3 2.0 a 4 5 b 7 x)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(define (unique/hash lst)\\n (hash-keys (for/hash ([x (in-list lst)]) (values x #t))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(define unique/set (compose1 set->list list->set))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(define (unique seq #:same-test [same? equal?])\\n (for/fold ([res '()])\\n ([x seq] #:unless (memf (curry same? x) res))\\n (cons x res)))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my @unique = [1, 2, 3, 5, 2, 4, 3, -3, 7, 5, 6].unique;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"set(1,2,3,5,2,4,3,-3,7,5,6).list\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"[ 1 2 3 'a' 'b' 'c' 2 3 4 'b' 'c' 'd' ] as items\\nitems copy unique print\\n\\nlist (8 items)\\n 0 => 1\\n 1 => 2\\n 2 => 3\\n 3 => \\\"a\\\"\\n 4 => \\\"b\\\"\\n 5 => \\\"c\\\"\\n 6 => 4\\n 7 => \\\"d\\\"\\n\",\n \"language\": \"Raven\"\n },\n {\n \"code\": \"print mold unique [1 $23.19 2 elbow 3 2 Bork 4 3 elbow 2 $23.19]\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \">> items: [1 \\\"a\\\" \\\"c\\\" 1 3 4 5 \\\"c\\\" 3 4 5]\\n>> unique items\\n== [1 \\\"a\\\" \\\"c\\\" 3 4 5]\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"/*REXX program removes any duplicate elements (items) that are in a list (using a hash).*/\\n$= '2 3 5 7 11 13 17 19 cats 222 -100.2 +11 1.1 +7 7. 7 5 5 3 2 0 4.4 2' /*item list.*/\\nsay 'original list:' $\\nsay right( words($), 17, '─') 'words in the original list.'\\nz=; @.= /*initialize the NEW list & index list.*/\\n do j=1 for words($); y= word($, j) /*process the words (items) in the list*/\\n if @.y=='' then z= z y; @.y= . /*Not duplicated? Add to Z list,@ array*/\\n end /*j*/\\nsay\\nsay 'modified list:' space(z) /*stick a fork in it, we're all done. */\\nsay right( words(z), 17, '─') 'words in the modified list.'\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program removes any duplicate elements (items) that are in a list (using a list).*/\\n$= '2 3 5 7 11 13 17 19 cats 222 -100.2 +11 1.1 +7 7. 7 5 5 3 2 0 4.4 2' /*item list.*/\\nsay 'original list:' $\\nsay right( words($), 17, '─') 'words in the original list.'\\n#= words($) /*process all the words in the list. */\\n do j=# by -1 for #; y= word($, j) /*get right-to-Left. */\\n _= wordpos(y, $, j + 1); if _\\\\==0 then $= delword($, _, 1) /*Dup? Then delete it*/\\n end /*j*/\\nsay\\nsay 'modified list:' space($) /*stick a fork in it, we're all done. */\\nsay right( words(z), 17, '─') 'words in the modified list.'\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program removes any duplicate elements (items) that are in a list (using 2 lists)*/\\nold = '2 3 5 7 11 13 17 19 cats 222 -100.2 +11 1.1 +7 7. 7 5 5 3 2 0 4.4 2'\\nsay 'original list:' old\\nsay right( words(old), 17, '─') 'words in the original list.'\\nnew= /*start with a clean (list) slate. */\\n do j=1 for words(old); _= word(old, j) /*process the words in the OLD list. */\\n if wordpos(_, new)==0 then new= new _ /*Doesn't exist? Then add word to NEW.*/\\n end /*j*/\\nsay\\nsay 'modified list:' space(new) /*stick a fork in it, we're all done. */\\nsay right( words(new), 17, '─') 'words in the modified list.'\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/* REXX ************************************************************\\n* 26.11.2012 Walter Pachl\\n* added: show multiple occurrences\\n**********************************************************************/\\nold='2 3 5 7 11 13 17 19 cats 222 -100.2 +11 1.1 +7 7. 7 5 5',\\n '3 2 0 4.4 2'\\nsay 'old list='old\\nsay 'words in the old list=' words(old)\\nnew=''\\nfound.=0\\ncount.=0\\nDo While old<>''\\n Parse Var old w old\\n If found.w=0 Then Do\\n new=new w\\n found.w=1\\n End\\n count.w=count.w+1\\n End\\nsay 'new list='strip(new)\\nsay 'words in the new list=' words(new)\\nSay 'Multiple occurrences:'\\nSay 'occ word'\\nDo While new<>''\\n Parse Var new w new\\n If count.w>1 Then\\n Say right(count.w,3) w\\n End\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"list = [\\\"Now\\\", \\\"is\\\", \\\"the\\\", \\\"time\\\", \\\"for\\\", \\\"all\\\", \\\"good\\\", \\\"men\\\", \\\"to\\\", \\\"come\\\", \\\"to\\\", \\\"the\\\", \\\"aid\\\", \\\"of\\\", \\\"the\\\", \\\"party.\\\"]\\nfor i = 1 to len(list)\\n for j = i + 1 to len(list)\\n if list[i] = list[j] del(list, j) j-- ok\\n next\\nnext\\n\\nfor n = 1 to len(list)\\n see list[n] + \\\" \\\"\\nnext\\nsee nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"ary = [1,1,2,1,'redundant',[1,2,3],[1,2,3],'redundant']\\np ary.uniq # => [1, 2, \\\"redundant\\\", [1, 2, 3]]\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"class Array\\n # used Hash\\n def uniq1\\n each_with_object({}) {|elem, h| h[elem] = true}.keys\\n end\\n # sort (requires comparable)\\n def uniq2\\n sorted = sort\\n pre = sorted.first\\n sorted.each_with_object([pre]){|elem, uniq| uniq << (pre = elem) if elem != pre}\\n end\\n # go through the list\\n def uniq3\\n each_with_object([]) {|elem, uniq| uniq << elem unless uniq.include?(elem)}\\n end\\nend\\n\\nary = [1,1,2,1,'redundant',[1,2,3],[1,2,3],'redundant']\\np ary.uniq1 #=> [1, 2, \\\"redundant\\\", [1, 2, 3]]\\np ary.uniq2 rescue nil # Error (not comparable)\\np ary.uniq3 #=> [1, 2, \\\"redundant\\\", [1, 2, 3]]\\n\\nary = [1,2,3,7,6,5,2,3,4,5,6,1,1,1]\\np ary.uniq1 #=> [1, 2, 3, 7, 6, 5, 4]\\np ary.uniq2 #=> [1, 2, 3, 4, 5, 6, 7]\\np ary.uniq3 #=> [1, 2, 3, 7, 6, 5, 4]\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"def unique(array)\\n pure = Array.new\\n for i in array\\n flag = false\\n for j in pure\\n flag = true if j==i\\n end\\n pure << i unless flag\\n end\\n return pure\\nend\\n\\nunique [\\\"hi\\\",\\\"hey\\\",\\\"hello\\\",\\\"hi\\\",\\\"hey\\\",\\\"heyo\\\"] # => [\\\"hi\\\", \\\"hey\\\", \\\"hello\\\", \\\"heyo\\\"]\\nunique [1,2,3,4,1,2,3,5,1,2,3,4,5] # => [1,2,3,4,5]\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"a$ = \\\"2 3 5 7 11 13 17 19 cats 222 -100.2 +11 1.1 +7 7. 7 5 5 3 2 0 4.4 2\\\"\\n\\nfor i = 1 to len(a$)\\n a1$ = word$(a$,i)\\n if a1$ = \\\"\\\" then exit for\\n for i1 = 1 to len(b$)\\n if a1$ = word$(b$,i1) then [nextWord]\\n next i1\\n b$ = b$ + a1$ + \\\" \\\"\\n[nextWord]\\nnext i\\n\\n print \\\"Dups:\\\";a$\\n print \\\"No Dups:\\\";b$\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use std::collections::HashSet;\\nuse std::hash::Hash;\\n\\nfn remove_duplicate_elements_hashing<T: Hash + Eq>(elements: &mut Vec<T>) {\\n let set: HashSet<_> = elements.drain(..).collect();\\n elements.extend(set.into_iter());\\n}\\n\\nfn remove_duplicate_elements_sorting<T: Ord>(elements: &mut Vec<T>) {\\n elements.sort_unstable(); // order does not matter\\n elements.dedup();\\n}\\n\\nfn main() {\\n let mut sample_elements = vec![0, 0, 1, 1, 2, 3, 2];\\n println!(\\\"Before removal of duplicates : {:?}\\\", sample_elements);\\n remove_duplicate_elements_sorting(&mut sample_elements);\\n println!(\\\"After removal of duplicates : {:?}\\\", sample_elements);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"val list = List(1,2,3,4,2,3,4,99)\\nval l2 = list.distinct\\n// l2: scala.List[scala.Int] = List(1,2,3,4,99)\\n\\nval arr = Array(1,2,3,4,2,3,4,99)\\nval arr2 = arr.distinct\\n// arr2: Array[Int] = Array(1, 2, 3, 4, 99)\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (remove-duplicates l)\\n (cond ((null? l)\\n '())\\n ((member (car l) (cdr l))\\n (remove-duplicates (cdr l)))\\n (else\\n (cons (car l) (remove-duplicates (cdr l))))))\\n\\n(remove-duplicates '(1 2 1 3 2 4 5))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"(1 3 2 4 5)\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"(define (remove-duplicates l)\\n (do ((a '() (if (member (car l) a) a (cons (car l) a)))\\n (l l (cdr l)))\\n ((null? l) (reverse a))))\\n\\n(remove-duplicates '(1 2 1 3 2 4 5))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"(1 2 3 4 5)\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst proc: main is func\\n local\\n const array integer: data is [] (1, 3, 2, 9, 1, 2, 3, 8, 8, 1, 0, 2);\\n var set of integer: dataSet is (set of integer).value;\\n var integer: number is 0;\\n begin\\n for number range data do\\n incl(dataSet, number);\\n end for;\\n writeln(dataSet);\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"items := [0,7,6,6,4,9,7,1,2,3,2];\\nprint(unique(items));\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"proc unique(items);\\n return [item: item in {item: item in items}];\\nend proc;\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"proc unique(items);\\n seen := {};\\n return [item: item in items, nps in {#seen} | #(seen with:= item) > nps];\\nend proc;\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"proc unique(items);\\n seen := {};\\n return [item: item in items, nps in {#seen} | #(seen with:= item) > nps];\\nend proc;\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"items := [0,7,6,6,4,9,7,1,2,3,2];\\nprint(unique(items));\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"proc unique(items);\\n return [item: item in {item: item in items}];\\nend proc;\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"set = new('set')\\n* Add all the elements of the array to the set.\\nadd(set,array)\\n\",\n \"language\": \"Setl4\"\n },\n {\n \"code\": \"var ary = [1,1,2,1,'redundant',[1,2,3],[1,2,3],'redundant'];\\nsay ary.uniq.dump;\\nsay ary.last_uniq.dump;\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"[|:s| #(1 2 3 4 1 2 3 4) >> s] writingAs: Set.\\n\\n\\\"==> {\\\"Set traitsWindow\\\" 1. 2. 3. 4}\\\"\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"\\\"Example of creating a collection\\\"\\n|a|\\na := #( 1 1 2 'hello' 'world' #symbol #another 2 'hello' #symbol ).\\na asSet.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"|a|\\na := #( 1 1 2 'hello' 'world' #symbol #another 2 'hello' #symbol ).\\na asOrderedSet.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"function undupe(arr) {\\n\\tvar t = {};\\n\\tforeach(arr, function(key, val) {\\n\\t\\tt[val] = true;\\n\\t});\\n\\n\\tvar r = {};\\n\\tforeach(t, function(key) {\\n\\t\\tr[sizeof r] = key;\\n\\t});\\n\\n\\treturn r;\\n}\\n\",\n \"language\": \"Sparkling\"\n },\n {\n \"code\": \"/*\\nThis code is an implementation of \\\"Remove duplicate elements\\\" in SQL ORACLE 19c\\np_in_str -- input string\\np_delimiter -- delimeter\\n*/\\nwith\\n function remove_duplicate_elements(p_in_str in varchar2, p_delimiter in varchar2 default ',') return varchar2 is\\n v_in_str varchar2(32767) := replace(p_in_str,p_delimiter,',');\\n v_res varchar2(32767);\\nbegin\\n --\\n execute immediate 'select listagg(distinct cv,:p_delimiter) from (select (column_value).getstringval() cv from xmltable(:v_in_str))'\\n into v_res using p_delimiter, v_in_str;\\n --\\n return v_res;\\n --\\nend;\\n\\n--Test\\nselect remove_duplicate_elements('1, 2, 3, \\\"a\\\", \\\"b\\\", \\\"c\\\", 2, 3, 4, \\\"b\\\", \\\"c\\\", \\\"d\\\"') as res from dual\\nunion all\\nselect remove_duplicate_elements('3 9 1 10 3 7 6 5 2 7 4 7 4 2 2 2 2 8 2 10 4 9 2 4 9 3 4 3 4 7',' ') as res from dual\\n;\\n\",\n \"language\": \"SQL\"\n },\n {\n \"code\": \". clear all\\n. input x y\\n1 1\\n1 1\\n1 2\\n2 1\\n2 2\\n1 1\\n2 1\\n2 1\\n1 2\\n2 2\\nend\\n\\n. duplicates drop x y, force\\n. list\\n\\n +-------+\\n | x y |\\n |-------|\\n 1. | 1 1 |\\n 2. | 1 2 |\\n 3. | 2 1 |\\n 4. | 2 2 |\\n +-------+\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \". mata\\n: a=1,1\\\\1,1\\\\1,2\\\\2,1\\\\2,2\\\\1,1\\\\2,1\\\\2,1\\\\1,2\\\\2,2\\n\\n: a\\n 1 2\\n +---------+\\n 1 | 1 1 |\\n 2 | 1 1 |\\n 3 | 1 2 |\\n 4 | 2 1 |\\n 5 | 2 2 |\\n 6 | 1 1 |\\n 7 | 2 1 |\\n 8 | 2 1 |\\n 9 | 1 2 |\\n 10 | 2 2 |\\n +---------+\\n\\n: uniqrows(a)\\n 1 2\\n +---------+\\n 1 | 1 1 |\\n 2 | 1 2 |\\n 3 | 2 1 |\\n 4 | 2 2 |\\n +---------+\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"println(Array(Set([3,2,1,2,3,4])))\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"func uniq<T: Hashable>(lst: [T]) -> [T] {\\n var seen = Set<T>(minimumCapacity: lst.count)\\n return lst.filter { x in\\n let unseen = !seen.contains(x)\\n seen.insert(x)\\n return unseen\\n }\\n}\\n\\nprintln(uniq([3,2,1,2,3,4]))\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"func uniq<T: Equatable>(lst: [T]) -> [T] {\\n var seen = [T]()\\n return lst.filter { x in\\n let unseen = find(seen, x) == nil\\n if (unseen) {\\n seen.append(x)\\n }\\n return unseen\\n }\\n}\\n\\nprintln(uniq([3,2,1,2,3,4]))\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"set result [lsort -unique $listname]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"OPTION BASE 1\\nLET max = 10\\nDIM dat(10), res(10)\\nFOR i = 1 TO max\\n READ dat(i)\\nNEXT i\\n\\nDATA 1, 2, 1, 4, 5, 2, 15, 1, 3, 4\\n\\nLET res(1) = dat(1)\\nLET count = 1\\nLET posic = 1\\nDO WHILE posic < max\\n LET posic = posic + 1\\n LET esnuevo = 1\\n LET indice = 1\\n DO WHILE (indice <= count) AND esnuevo = 1\\n IF dat(posic) = res(indice) THEN LET esnuevo = 0\\n LET indice = indice + 1\\n LOOP\\n IF esnuevo = 1 THEN\\n LET count = count + 1\\n LET res(count) = dat(posic)\\n END IF\\nLOOP\\n\\nFOR i = 1 TO count\\n PRINT res(i);\\nNEXT i\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"//\\n// Go through the list, and for each element, check the rest of the list to see if it appears again, and discard it if it does.\\n//\\nINTEGER PROC FNBlockGetUniqueAllToBufferB( INTEGER bufferI )\\n INTEGER B = FALSE\\n INTEGER downB = TRUE\\n STRING s[255] = \\\"\\\"\\n IF ( NOT ( IsBlockInCurrFile() ) ) Warn( \\\"Please mark a block\\\" ) B = FALSE RETURN( B ) ENDIF // return from the current procedure if no block is marked\\n PushPosition()\\n PushBlock()\\n GotoBlockBegin()\\n WHILE ( ( IsCursorInBlock() ) AND ( downB ) )\\n s = GetText( 1, MAXSTRINGLEN )\\n PushPosition()\\n PushBlock()\\n GotoBufferId( bufferI )\\n IF NOT LFind( s, \\\"\\\" )\\n AddLine( s )\\n ENDIF\\n PopBlock()\\n PopPosition()\\n downB = Down()\\n ENDWHILE\\n PopPosition()\\n PopBlock()\\n B = TRUE\\n RETURN( B )\\nEND\\n//\\nPROC Main()\\n INTEGER bufferI = 0\\n PushPosition()\\n bufferI = CreateTempBuffer()\\n PopPosition()\\n Message( FNBlockGetUniqueAllToBufferB( bufferI ) ) // gives e.g. TRUE\\n GotoBufferId( bufferI )\\nEND\\n\",\n \"language\": \"TSE-SAL\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nlist_old=\\\"b'A'A'5'1'2'3'2'3'4\\\"\\nlist_sort=MIXED_SORT (list_old)\\nlist_new=REDUCE (list_sort)\\nPRINT list_old\\nPRINT list_new\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nlist_old=\\\"b'A'A'5'1'2'3'2'3'4\\\"\\nDICT list CREATE\\nLOOP l=list_old\\nDICT list LOOKUP l,num\\nIF (num==0) DICT list ADD l\\nENDLOOP\\nDICT list unload list\\nlist_new=JOIN (list)\\nPRINT list_old\\nPRINT list_new\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"bash$ # original list\\nbash$ printf '6\\\\n2\\\\n3\\\\n6\\\\n4\\\\n2\\\\n'\\n6\\n2\\n3\\n6\\n4\\n2\\nbash$ # made uniq\\nbash$ printf '6\\\\n2\\\\n3\\\\n6\\\\n4\\\\n2\\\\n'|sort -n|uniq\\n2\\n3\\n4\\n6\\nbash$\\n\",\n \"language\": \"UnixPipes\"\n },\n {\n \"code\": \"bash$ # made uniq\\nbash$ printf '6\\\\n2\\\\n3\\\\n6\\\\n4\\\\n2\\\\n'|sort -nu\\n2\\n3\\n4\\n6\\nbash$\\n\",\n \"language\": \"UnixPipes\"\n },\n {\n \"code\": \"#cast %s\\n\\nexample = |=hS& 'mississippi'\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"const list = 'a,1,a,b,b,c,d,e,d,0,f,f,5,f,g,h,1,3,3'\\n\\nfn main() {\\n\\tprintln(unique(list))\\n}\\n\\nfn unique(list string) []string {\\n mut new_list := []string{}\\n for word in list.split(',') {\\n if new_list.any(it == word.str()) == false {\\n new_list << word\\n }\\n }\\n new_list.sort()\\n return new_list\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Option Explicit\\n\\nSub Main()\\nDim myArr() As Variant, i As Long\\n\\n myArr = Remove_Duplicate(Array(1.23456789101112E+16, True, False, True, \\\"Alpha\\\", 1, 235, 4, 1.25, 1.25, \\\"Beta\\\", 1.23456789101112E+16, \\\"Delta\\\", \\\"Alpha\\\", \\\"Charlie\\\", 1, 2, \\\"Foxtrot\\\", \\\"Foxtrot\\\", \\\"Alpha\\\", 235))\\n'return :\\n For i = LBound(myArr) To UBound(myArr)\\n Debug.Print myArr(i)\\n Next\\nEnd Sub\\n\\nPrivate Function Remove_Duplicate(Arr As Variant) As Variant()\\nDim myColl As New Collection, Temp() As Variant, i As Long, cpt As Long\\n\\n ReDim Temp(UBound(Arr))\\n For i = LBound(Arr) To UBound(Arr)\\n On Error Resume Next\\n myColl.Add CStr(Arr(i)), CStr(Arr(i))\\n If Err.Number > 0 Then\\n On Error GoTo 0\\n Else\\n Temp(cpt) = Arr(i)\\n cpt = cpt + 1\\n End If\\n Next i\\n ReDim Preserve Temp(cpt - 1)\\n Remove_Duplicate = Temp\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Function remove_duplicates(list)\\n\\tarr = Split(list,\\\",\\\")\\n\\tSet dict = CreateObject(\\\"Scripting.Dictionary\\\")\\n\\tFor i = 0 To UBound(arr)\\n\\t\\tIf dict.Exists(arr(i)) = False Then\\n\\t\\t\\tdict.Add arr(i),\\\"\\\"\\n\\t\\tEnd If\\n\\tNext\\n\\tFor Each key In dict.Keys\\n\\t\\ttmp = tmp & key & \\\",\\\"\\n\\tNext\\n\\tremove_duplicates = Left(tmp,Len(tmp)-1)\\nEnd Function\\n\\nWScript.Echo remove_duplicates(\\\"a,a,b,b,c,d,e,d,f,f,f,g,h\\\")\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"Sort(0, File_Size) // sort the data\\nWhile(Replace(\\\"^(.*)\\\\N\\\\1$\\\", \\\"\\\\1\\\", REGEXP+BEGIN+NOERR)){} // remove duplicates\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"call filter(list, 'count(list, v:val) == 1')\\n\",\n \"language\": \"Vim-Script\"\n },\n {\n \"code\": \"LOCAL i As Integer, n As Integer, lcOut As String\\nCLOSE DATABASES ALL\\nCLEAR\\nCREATE CURSOR nums (num I)\\nINDEX ON num TAG num COLLATE \\\"Machine\\\"\\nSET ORDER TO 0\\nn = 50\\nRAND(-1)\\nFOR i = 1 TO n\\n INSERT INTO nums VALUES (RanInt(1, 10))\\nENDFOR\\nSELECT num, COUNT(num) As cnt FROM nums ;\\nGROUP BY num INTO CURSOR grouped\\nLIST OFF TO FILE grouped.txt NOCONSOLE\\nlcOut = \\\"\\\"\\nSCAN\\n lcOut = lcOut + TRANSFORM(num) + \\\",\\\"\\nENDSCAN\\nlcOut = LEFT(lcOut, LEN(lcOut)-1)\\n? lcOut\\t\\n\\nFUNCTION RanInt(tnLow As Integer, tnHigh As Integer) As Integer\\nRETURN INT((tnHigh - tnLow + 1)*RAND() + tnLow)\\nENDFUNC\\n\",\n \"language\": \"Visual-FoxPro\"\n },\n {\n \"code\": \"def (dedup l)\\n let exists (table)\\n collect+each x l\\n unless exists.x\\n yield x\\n exists.x <- 1\\n\",\n \"language\": \"Wart\"\n },\n {\n \"code\": \"@uniq [1 2 3 2 1 2 3] ; returns [1 2 3]\\n\",\n \"language\": \"Wortel\"\n },\n {\n \"code\": \"import \\\"./sort\\\" for Sort\\n\\n// Using a map - order of distinct items is undefined.\\nvar removeDuplicates1 = Fn.new { |a|\\n if (a.count <= 1) return a\\n var m = {}\\n for (e in a) m[e] = true\\n return m.keys.toList\\n}\\n\\n// Sort elements and remove consecutive duplicates.\\nvar removeDuplicates2 = Fn.new { |a|\\n if (a.count <= 1) return a\\n Sort.insertion(a)\\n for (i in a.count-1..1) {\\n if (a[i] == a[i-1]) a.removeAt(i)\\n }\\n return a\\n}\\n\\n// Iterate through list and for each element check if it occurs later in the list.\\n// If it does, discard it.\\nvar removeDuplicates3 = Fn.new { |a|\\n if (a.count <= 1) return a\\n var i = 0\\n while (i < a.count-1) {\\n var j = i + 1\\n while(j < a.count) {\\n if (a[i] == a[j]) {\\n a.removeAt(j)\\n } else {\\n j = j + 1\\n }\\n }\\n i = i + 1\\n }\\n return a\\n}\\n\\nvar a = [1,2,3,4,1,2,3,5,1,2,3,4,5]\\nSystem.print(\\\"Original: %(a)\\\")\\nSystem.print(\\\"Method 1: %(removeDuplicates1.call(a.toList))\\\") // copy original each time\\nSystem.print(\\\"Method 2: %(removeDuplicates2.call(a.toList))\\\")\\nSystem.print(\\\"Method 3: %(removeDuplicates3.call(a.toList))\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func RemoveDuplicates(Array){\\n\\tset NewArray = [];\\n\\tforeach(k,v as Array){\\n\\t\\tif (NewArray->includes(v)){\\n\\t\\t\\tArray->splice(toint(k),1);\\n\\t\\t} else {\\n\\t\\t\\tNewArray->push(v);\\n\\t\\t}\\n\\t}\\n}\\n\\nset Arr = [\\\"Hello\\\",1,2,\\\"Hello\\\",3,1];\\nlog(Arr);\\nRemoveDuplicates(Arr);\\nlog(Arr);\\n\",\n \"language\": \"XBS\"\n },\n {\n \"code\": \"code Text=12; \\\\built-in routine to display a string of characters\\nstring 0; \\\\use zero-terminated strings (not MSb terminated)\\n\\nfunc StrLen(S); \\\\Return number of characters in an ASCIIZ string\\nchar S;\\nint I;\\nfor I:= 0, -1>>1-1 do \\\\(limit = 2,147,483,646 if 32 bit, or 32766 if 16 bit)\\n if S(I) = 0 then return I;\\n\\nfunc Unique(S); \\\\Remove duplicate bytes from string\\nchar S;\\nint I, J, K, L;\\n[L:= StrLen(S); \\\\string length\\nfor I:= 0 to L-1 do \\\\for all characters in string...\\n for J:= I+1 to L-1 do \\\\scan rest of string for duplicates\\n if S(I) = S(J) then \\\\if duplicate then\\n [for K:= J+1 to L do \\\\ shift rest of string down (including\\n S(K-1):= S(K); \\\\ terminating zero)\\n L:= L-1 \\\\ string is now one character shorter\\n ];\\nreturn S; \\\\return pointer to string\\n];\\n\\nText(0, Unique(\\\"Pack my box with five dozen liquor jugs.\\\"))\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"data \\\"Now\\\", \\\"is\\\", \\\"the\\\", \\\"time\\\", \\\"for\\\", \\\"all\\\", \\\"good\\\", \\\"men\\\", \\\"to\\\", \\\"come\\\", \\\"to\\\", \\\"the\\\", \\\"aid\\\", \\\"of\\\", \\\"the\\\", \\\"party.\\\", \\\"\\\"\\n\\ndo\\n read p$\\n if p$ = \\\"\\\" break\\n if not instr(r$, p$) r$ = r$ + p$ + \\\" \\\"\\nloop\\n\\nprint r$\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"zkl: Utils.Helpers.listUnique(T(1,3,2,9,1,2,3,8,8,\\\"8\\\",1,0,2,\\\"8\\\"))\\nL(1,3,2,9,8,\\\"8\\\",0)\\nzkl: \\\"1,3,2,9,1,2,3,8,8,1,0,2\\\".unique()\\n,012389\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn listUnique(xs){\\n xs.reduce(fcn(us,s){us.holds(s) and us or us.append(s)},L()) }\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"program: remove_duplicate_elements\\n input: [1,2,1,3,2,4,1]\\n output: [1,2,3,4]\\n\",\n \"language\": \"Zoea\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Remove-duplicate-elements"}}},{"rowIdx":1575,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- File handling\nfrom: http://rosettacode.org/wiki/Remove_lines_from_a_file\n","language":"00-META"},{"code":";Task:\nRemove a specific line or a number of lines from a file. \n\nThis should be implemented as a routine that takes three parameters (filename, starting line, and the number of lines to be removed). \n\nFor the purpose of this task, line numbers and the number of lines start at one, so to remove the first two lines from the file <tt>foobar.txt</tt>, the parameters should be: <tt>foobar.txt</tt>, <tt>1</tt>, <tt>2</tt>\n\nEmpty lines are considered and should still be counted, and if the specified line is empty, it should still be removed. \n\nAn appropriate message should appear if an attempt is made to remove lines beyond the end of the file.\n<br><br>\n\n","language":"00-TASK"},{"code":":start:\nV l = File(:argv[1]).read_lines()\nl.del(Int(:argv[2]) - 1 .+ Int(:argv[3]))\nFile(:argv[1], WRITE).write(l.join(\"\\n\"))\n","language":"11l"},{"code":"with Ada.Text_IO, Ada.Directories, Ada.Command_Line, Ada.IO_Exceptions;\nuse Ada.Text_IO;\n\nprocedure Remove_Lines_From_File is\n Temporary: constant String := \".tmp\";\nbegin\n if Ada.Command_Line.Argument_Count /= 3 then\n raise Constraint_Error;\n end if;\n declare\n Filename: String := Ada.Command_Line.Argument(1);\n First: Positive := Integer'Value(Ada.Command_Line.Argument(2));\n Last: Natural := Integer'Value(Ada.Command_Line.Argument(3)) + First - 1;\n Input, Output: File_Type;\n Line_Number: Positive := 1;\n begin\n Open(Input, In_File, Filename); -- open original file for reading\n Create(Output, Out_File, Filename & Temporary); -- write to temp. file\n while not End_Of_File(Input) loop\n declare\n Line: String := Get_Line(Input);\n begin\n if Line_Number < First or else Line_Number > Last then\n Put_Line(Output, Line);\n end if;\n end;\n Line_Number := Line_Number + 1;\n end loop;\n Close(Input);\n Close(Output);\n Ada.Directories.Rename(Old_Name => Filename & Temporary,\n New_Name => Filename);\n end;\nexception\n when Constraint_Error | Ada.IO_Exceptions.Name_Error =>\n Put_Line(\"usage: \" & Ada.Command_Line.Command_Name &\n \" <filename> <first> <length>\");\n Put_Line(\" opens <filename> for reading and \" &\n \"<filename>\" & Temporary & \" for temporary writing\");\n Put_Line(\" requires first > 0, length >= 0\");\nend Remove_Lines_From_File;\n","language":"Ada"},{"code":"# removes the specified number of lines from a file, starting at start line (numbered from 1) #\n# returns TRUE if successful, FALSE otherwise #\nPROC remove lines = ( STRING file name, INT start line, INT number of lines )BOOL:\n IF number of lines < 0 OR start line < 1\n THEN\n # invalid parameters #\n print( ( \"number of lines must be >= 0 and start line must be >= 1\", newline ) );\n FALSE\n ELIF FILE temp file;\n create( temp file, stand back channel ) /= 0\n THEN\n # unable to create a temporary output file #\n print( ( \"Unable to create temporary file\", newline ) );\n FALSE\n ELIF NOT reset possible( temp file )\n THEN\n # rewinding the temporary file is not possible #\n # we would have to get its name ( with \"idf( temp file )\", close it and re-open it #\n print( ( \"Temp file is not rewindable\", newline ) );\n FALSE\n ELIF FILE input file;\n open( input file, file name, stand in channel ) /= 0\n THEN\n # failed to open the file #\n print( ( \"Unable to open \"\"\" + file name + \"\"\"\", newline ) );\n FALSE\n ELSE\n # files opened OK #\n BOOL at eof := FALSE;\n # set the EOF handler for the original file #\n on logical file end( input file\n , ( REF FILE f )BOOL:\n BEGIN\n # note that we reached EOF on the latest read #\n at eof := TRUE;\n # return TRUE so processing can continue #\n TRUE\n END\n );\n # copy the input file to the temp file #\n WHILE STRING line;\n get( input file, ( line, newline ) );\n NOT at eof\n DO\n put( temp file, ( line, newline ) )\n OD;\n # copy the temp file back to the input, removing the specified lines #\n close( input file );\n IF open( input file, file name, stand out channel ) /= 0\n THEN\n # failed to open the original file for output #\n print( ( \"Unable to open \", file name, \" for output\", newline ) );\n FALSE\n ELSE\n # opened OK - copy the temporary file #\n reset( temp file ); # rewinds the input file #\n at eof := FALSE;\n on logical file end( temp file\n , ( REF FILE f )BOOL:\n BEGIN\n # note that we reached EOF on the latest read #\n at eof := TRUE;\n # return TRUE so processing can continue #\n TRUE\n END\n );\n INT end line = ( start line - 1 ) + number of lines;\n INT line number := 0;\n WHILE STRING line;\n get( temp file, ( line, newline ) );\n NOT at eof\n DO\n # have another line #\n line number +:= 1;\n IF line number < start line OR line number > end line\n THEN\n put( input file, ( line, newline ) )\n FI\n OD;\n # close the files #\n close( input file );\n scratch( temp file );\n IF line number < start line\n THEN\n # didn't find the start line #\n print( ( \"Specified start line (\", whole( start line, 0 ), \") not in \", file name, newline ) );\n FALSE\n ELIF line number < end line\n THEN\n # the ending line was not in the file #\n print( ( \"Final omitted line not in the file \", file name, newline ) );\n FALSE\n ELSE\n # successful operation #\n TRUE\n FI\n FI\n FI # remove lines # ;\n\n# test the line removal #\nBEGIN\n FILE t;\n open( t, \"test.txt\", stand out channel );\n print( ( \"Before...\", newline ) );\n FOR i TO 10 DO\n STRING line = whole( i, - ( ( i MOD 5 ) + 3 ) );\n put( t, ( line, newline ) );\n print( ( line, newline ) )\n OD;\n close( t );\n remove lines( \"test.txt\", 2, 3 );\n print( ( \"After...\", newline ) );\n open( t, \"test.txt\", stand in channel );\n FOR i TO 7 DO\n STRING line;\n get( t, ( line, newline ) );\n print( ( line, newline ) )\n OD;\n close( t );\n print( ( \"----\", newline ) )\nEND\n","language":"ALGOL-68"},{"code":"#include <hopper.h>\n\nmain:\n .ctrlc\n fd=0,fw=0\n fopen(OPEN_READ,\"archivo.txt\")(fd)\n if file error?\n {\"no pude abrir el archivo de lectura: \"}\n jsub(show error)\n else\n fcreate(CREATE_NORMAL,\"archivoTmp.txt\")(fw)\n if file error?\n {\"no pude crear el archivo para escritura: \"}\n jsub(show error)\n else\n get arg number(2,desde), // from line\n get arg number(3,hasta), // to line\n\n line read=0\n while( not(feof(fd)))\n fread line(1000)(fd), ++line read\n if(not( {line read} between(desde, hasta)))\n {\"\\n\"}cat,writeline(fw)\n endif\n wend\n endif\n endif\n fclose(fw)\n fclose(fd)\n system(\"mv archivoTmp.txt archivo.txt\")\nexit(0)\n.locals\nshow error:\n file error, println\nback\n","language":"Amazing-Hopper"},{"code":"removeFileLines: function [filename, start, cnt][\n previous: ø\n ensure -> all? @[\n exists? filename\n previous: read.lines filename\n start < size previous\n (start + cnt) < size previous\n ]\n\n final: previous\\[0..start-1] ++ previous\\[start+cnt..dec size previous]\n write filename join.with:\"\\n\" final\n]\n\nremoveFileLines \"myfile.txt\" 3 10\n","language":"Arturo"},{"code":"RemoveLines(filename, startingLine, numOfLines){\n Loop, Read, %filename%\n if ( A_Index < StartingLine )\n || ( A_Index >= StartingLine + numOfLines )\n ret .= \"`r`n\" . A_LoopReadLine\n FileDelete, % FileName\n FileAppend, % SubStr(ret, 3), % FileName\n}\n\nSetWorkingDir, % A_ScriptDir\nRemoveLines(\"test.txt\", 4, 3)\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f REMOVE_LINES_FROM_A_FILE.AWK\n# show files after lines are removed:\n# GAWK \"FNR==1{print(FILENAME)};{print(FNR,$0)}\" TEST1 TEST2 TEST3\nBEGIN {\n build_test_data()\n remove_lines(\"TEST0\",1,1)\n remove_lines(\"TEST1\",3,4)\n remove_lines(\"TEST2\",9,3)\n remove_lines(\"TEST3\",11,1)\n exit(errors+0)\n}\nfunction build_test_data( fn,i,j) { # create 3 files with 10 lines each\n for (i=1; i<=3; i++) {\n fn = \"TEST\" i\n for (j=1; j<=10; j++) {\n printf(\"line %d\\n\",j) >fn\n }\n close(fn)\n }\n}\nfunction remove_lines(fn,start,number_of_lines, arr,fnr,i,n,rec,stop) {\n stop = start + number_of_lines - 1\n while (getline rec <fn > 0) { # read file\n fnr++\n if (fnr < start || fnr > stop) {\n arr[++n] = rec\n }\n }\n close(fn)\n if (fnr == 0) {\n printf(\"error: file %s not found\\n\",fn)\n errors = 1\n return\n }\n for (i=1; i<=n; i++) { # write file\n printf(\"%s\\n\",arr[i]) >fn\n }\n close(fn)\n if (stop > fnr) {\n printf(\"error: file %s trying to remove nonexistent lines\\n\",fn)\n errors = 1\n }\n}\n","language":"AWK"},{"code":"' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' '\n' Remove File Lines V1.1 '\n' '\n' Developed by A. David Garza Marín in VB-DOS for '\n' RosettaCode. November 30, 2016. '\n' '\n' Date | Change '\n'-------------------------------------------------- '\n' 2016/11/30| Original version '\n' 2016/12/30| Added functionality to read parameters'\n' | from Command Line '\n' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' '\n\n'OPTION _EXPLICIT ' For QB45\nOPTION EXPLICIT ' For VBDOS, PDS 7.1\n\n' SUBs and FUNCTIONs\nDECLARE FUNCTION DeleteLinesFromFile% (WhichFile AS STRING, Start AS LONG, HowMany AS LONG)\nDECLARE FUNCTION FileExists% (WhichFile AS STRING)\nDECLARE FUNCTION GetDummyFile$ (WhichFile AS STRING)\nDECLARE FUNCTION getFileName$ (CommandString AS STRING)\nDECLARE FUNCTION getHowManyLines& (CommandLine AS STRING)\nDECLARE FUNCTION getStartPoint& (CommandLine AS STRING)\nDECLARE FUNCTION ErrorMessage$ (WhichError AS INTEGER)\nDECLARE FUNCTION CountLines& (WhichFile AS STRING)\n\n' Var\nDIM iOk AS INTEGER, iErr AS INTEGER, lStart AS LONG, lHowMany AS LONG, lSize AS LONG\nDIM sFile AS STRING, sCommand AS STRING\n\n' Const\nCONST ProgramName = \"RemFLine (Remove File Lines) Enhanced V1.1\"\n\n' ----------------------------- Main program cycle --------------------------------\nCLS\nPRINT ProgramName\nPRINT\nPRINT \"This program will remove as many lines of a text file as you state, starting\"\nPRINT \"with the line number you also state. If the starting line number is beyond\"\nPRINT \"total lines in the text file stated, then the process will be aborted. If the\"\nPRINT \"quantity of lines stated to be deleted is beyond the total lines in the text\"\nPRINT \"file, the process also will be aborted. The program will give you a message\"\nPRINT \"if everything ran ok or if any error happened. Includes a function to count\"\nPRINT \"how many lines has the intended file.\"\n' Verifies if parameters are specified\nsCommand = COMMAND$\nIF sCommand <> \"\" THEN\n sFile = getFileName$(sCommand)\n lSize = CountLines&(sFile)\n lStart = getStartPoint&(sCommand) ' Defaults to 1\n lHowMany = getHowManyLines&(sCommand) ' Defaults to 1\nELSE\n PRINT\n INPUT \"Please, type the name of the file\"; sFile\n sFile = LTRIM$(RTRIM$(sFile))\n IF sFile <> \"\" THEN\n lSize = CountLines&(sFile)\n IF lSize > 0 THEN\n PRINT \"Delete starting on which line (Default=1, Max=\"; lSize; \")\";\n INPUT lStart\n\n IF lStart = 0 THEN lStart = 1\n IF lStart < lSize THEN\n PRINT \"How many lines do you want to remove (Default=1, Max=\"; (lSize - lStart) + 1; \")\";\n INPUT lHowMany\n IF lHowMany = 0 THEN lHowMany = 1\n END IF\n END IF\n END IF\nEND IF\n\nPRINT\nPRINT \"Erasing \"; lHowMany; \"lines from \"; sFile; \" starting on line\"; lStart; \".\"\nIF lSize > 0 THEN\n IF lHowMany + lStart <= lSize THEN\n iOk = DeleteLinesFromFile%(sFile, lStart, lHowMany)\n ELSEIF lHowMany + lStart > lSize THEN\n iOk = 1\n ELSEIF lStart > lSize THEN\n iOk = 2\n END IF\nELSEIF lSize = -1 THEN\n iOk = 3\nEND IF\n\nIF lSize = -1 THEN\n iOk = 3\nELSEIF lSize = 0 THEN\n iOk = 4 ' The file is not a text file\nEND IF\n\nIF sFile = \"\" THEN\n iOk = 5 ' Null file name not allowed\nEND IF\n\nPRINT\nPRINT ErrorMessage$(iOk)\n'----------------End of Main program Cycle ----------------\n\nEND\n\nFileError:\n iErr = ERR\nRESUME NEXT\n\nFUNCTION CountLines& (WhichFile AS STRING)\n ' Var\n DIM iFile AS INTEGER\n DIM l AS LONG, li AS LONG, j AS LONG, lFileSize AS LONG, lLines AS LONG\n DIM sLine AS STRING, strR AS STRING\n\n ' This function will count how many lines has the file\n IF FileExists%(WhichFile) THEN\n strR = CHR$(13)\n li = 1\n iFile = FREEFILE\n sLine = SPACE$(128)\n lLines = 0\n OPEN WhichFile FOR BINARY AS #iFile\n lFileSize = LOF(iFile)\n DO\n IF (LOC(iFile) + LEN(sLine)) > lFileSize THEN\n sLine = SPACE$(lFileSize - LOC(iFile))\n END IF\n IF LEN(sLine) > 0 THEN\n GET #iFile, , sLine\n GOSUB AnalizeLine\n END IF\n LOOP UNTIL LEN(sLine) < 128\n CLOSE iFile\n ELSE\n lLines = -1\n END IF\n\n CountLines& = lLines\n\nEXIT FUNCTION\n\nAnalizeLine:\n li = 1\n DO\n l = INSTR(li, sLine, strR)\n IF l > 0 THEN\n lLines = lLines + 1\n li = l + 1\n END IF\n LOOP UNTIL l = 0\nRETURN\nEND FUNCTION\n\nFUNCTION DeleteLinesFromFile% (WhichFile AS STRING, Start AS LONG, HowMany AS LONG)\n ' Var\n DIM lCount AS LONG, iFile AS INTEGER, iFile2 AS INTEGER, lhm AS LONG, iError AS INTEGER\n DIM sLine AS STRING, sDummyFile AS STRING\n\n IF FileExists%(WhichFile) THEN\n sDummyFile = GetDummyFile$(WhichFile)\n\n ' It is assumed a text file\n iFile = FREEFILE\n OPEN WhichFile FOR INPUT AS #iFile\n\n iFile2 = FREEFILE\n OPEN sDummyFile FOR OUTPUT AS #iFile2\n\n lhm = 0\n DO WHILE NOT EOF(iFile)\n LINE INPUT #iFile, sLine\n lCount = lCount + 1\n IF lCount >= Start AND lhm < HowMany THEN\n lhm = lhm + 1\n ELSE\n PRINT #iFile2, sLine\n END IF\n LOOP\n\n CLOSE iFile2, iFile\n\n ' Check if everything went ok or not\n iError = 0\n IF lCount < Start THEN\n iError = 2 ' Full file is shorter than the start line stated,\n ' process will be aborted.\n ELSEIF lhm < HowMany THEN\n iError = 1 ' File was shorter than lines requested to be removed,\n ' process will be aborted.\n END IF\n\n IF iError > 0 THEN\n KILL sDummyFile ' Process aborted\n ELSE\n KILL WhichFile\n NAME sDummyFile AS WhichFile\n END IF\n ELSE\n iError = 3 ' The file doesn't exist. The process is aborted.\n END IF\n\n DeleteLinesFromFile% = iError\n\nEND FUNCTION\n\nFUNCTION ErrorMessage$ (WhichError AS INTEGER)\n ' Var\n DIM sError AS STRING\n\n SELECT CASE WhichError\n CASE 0: sError = \"Everything went Ok. Lines removed from file.\"\n CASE 1: sError = \"File is shorter than the number of lines stated to remove. Process aborted.\"\n CASE 2: sError = \"Whole file is shorter than the starting point stated. Process aborted.\"\n CASE 3: sError = \"File doesn't exist. Process aborted.\"\n CASE 4: sError = \"The file doesn't seem to be a text file. Process aborted.\"\n CASE 5: sError = \"You need to provide a valid file name, please.\"\n END SELECT\n\n ErrorMessage$ = sError\nEND FUNCTION\n\nFUNCTION FileExists% (WhichFile AS STRING)\n ' Var\n DIM iFile AS INTEGER\n DIM iItExists AS INTEGER\n SHARED iErr AS INTEGER\n\n ON ERROR GOTO FileError\n iFile = FREEFILE\n iErr = 0\n OPEN WhichFile FOR BINARY AS #iFile\n IF iErr = 0 THEN\n iItExists = LOF(iFile) > 0\n CLOSE #iFile\n\n IF NOT iItExists THEN\n KILL WhichFile\n END IF\n END IF\n ON ERROR GOTO 0\n FileExists% = iItExists\n\nEND FUNCTION\n\nFUNCTION GetDummyFile$ (WhichFile AS STRING)\n ' Var\n DIM i AS INTEGER, j AS INTEGER\n\n ' Gets the path specified in WhichFile\n i = 1\n DO\n j = INSTR(i, WhichFile, \"\\\")\n IF j > 0 THEN i = j + 1\n LOOP UNTIL j = 0\n\n GetDummyFile$ = LEFT$(WhichFile, i - 1) + \"$dummyf$.tmp\"\nEND FUNCTION\n\nFUNCTION getFileName$ (CommandString AS STRING)\n ' Var\n DIM i AS INTEGER\n DIM sFileName AS STRING\n\n i = INSTR(CommandString, \",\")\n IF i > 0 THEN\n sFileName = LEFT$(CommandString, i - 1)\n ELSEIF LEN(CommandString) > 0 THEN\n sFileName = CommandString\n END IF\n\n getFileName$ = sFileName\nEND FUNCTION\n\nFUNCTION getHowManyLines& (CommandLine AS STRING)\n ' Var\n DIM i AS INTEGER, j AS INTEGER\n DIM l AS LONG\n\n i = INSTR(CommandLine, \",\")\n IF i > 0 THEN\n j = INSTR(i + 1, CommandLine, \",\")\n IF j = 0 THEN\n l = 1\n ELSE\n l = CLNG(VAL(MID$(CommandLine, j + 1)))\n END IF\n END IF\n\n getHowManyLines& = l\n\nEND FUNCTION\n\nFUNCTION getStartPoint& (CommandLine AS STRING)\n ' Var\n DIM i AS INTEGER, j AS INTEGER\n DIM l AS LONG\n\n i = INSTR(CommandLine, \",\")\n IF i > 0 THEN\n j = INSTR(i + 1, CommandLine, \",\")\n IF j = 0 THEN j = LEN(CommandLine)\n l = CLNG(VAL(MID$(CommandLine, i + 1, j - i)))\n ELSE\n i = 1\n END IF\n\n getStartPoint& = l\n\nEND FUNCTION\n","language":"BASIC"},{"code":"#include <stdio.h>\n#include <stdlib.h> /* for atoi() and malloc() */\n#include <string.h> /* for memmove() */\n\n/* Conveniently print to standard error and exit nonzero. */\n#define ERROR(fmt, arg) return fprintf(stderr, fmt \"\\n\", arg)\n\nint main(int argc, char **argv)\n{\n FILE *fp;\n char *buf;\n size_t sz;\n int start, count, lines = 1;\n int dest = 0, src = 0, pos = -1;\n\n /* Initialization and sanity checks */\n if (argc != 4)\n ERROR(\"Usage: %s <file> <start> <count>\", argv[0]);\n\n if ((count = atoi(argv[3])) < 1) /* We're a no-op. */\n return 0;\n\n if ((start = atoi(argv[2])) < 1)\n ERROR(\"Error: <start> (%d) must be positive\", start);\n\n if ((fp = fopen(argv[1], \"r\")) == NULL)\n ERROR(\"No such file: %s\", argv[1]);\n\n /* Determine filesize and allocate a buffer accordingly. */\n fseek(fp, 0, SEEK_END);\n sz = ftell(fp);\n buf = malloc(sz + 1);\n rewind(fp);\n\n /* Fill the buffer, count lines, and remember a few important offsets. */\n while ((buf[++pos] = fgetc(fp)) != EOF) {\n if (buf[pos] == '\\n') {\n ++lines;\n if (lines == start) dest = pos + 1;\n if (lines == start + count) src = pos + 1;\n }\n }\n\n /* We've been asked to do something weird; clean up and bail. */\n if (start + count > lines) {\n free(buf);\n fclose(fp);\n ERROR(\"Error: invalid parameters for file with %d lines\", --lines);\n }\n\n /* Overwrite the lines to be deleted with the survivors. */\n memmove(buf + dest, buf + src, pos - src);\n\n /* Reopen the file and write back just enough of the buffer. */\n freopen(argv[1], \"w\", fp);\n fwrite(buf, pos - src + dest, 1, fp);\n\n free(buf);\n fclose(fp);\n return 0;\n}\n","language":"C"},{"code":"#include <fstream>\n#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <list>\n\nvoid deleteLines( const std::string & , int , int ) ;\n\nint main( int argc, char * argv[ ] ) {\n if ( argc != 4 ) {\n std::cerr << \"Error! Invoke with <deletelines filename startline skipnumber>!\\n\" ;\n return 1 ;\n }\n std::string filename( argv[ 1 ] ) ;\n int startfrom = atoi( argv[ 2 ] ) ;\n int howmany = atoi( argv[ 3 ] ) ;\n deleteLines ( filename , startfrom , howmany ) ;\n return 0 ;\n}\n\nvoid deleteLines( const std::string & filename , int start , int skip ) {\n std::ifstream infile( filename.c_str( ) , std::ios::in ) ;\n if ( infile.is_open( ) ) {\n std::string line ;\n std::list<std::string> filelines ;\n while ( infile ) {\n\t getline( infile , line ) ;\n\t filelines.push_back( line ) ;\n }\n infile.close( ) ;\n if ( start > filelines.size( ) ) {\n\t std::cerr << \"Error! Starting to delete lines past the end of the file!\\n\" ;\n\t return ;\n }\n if ( ( start + skip ) > filelines.size( ) ) {\n\t std::cerr << \"Error! Trying to delete lines past the end of the file!\\n\" ;\n\t return ;\n }\n std::list<std::string>::iterator deletebegin = filelines.begin( ) , deleteend ;\n for ( int i = 1 ; i < start ; i++ )\n\t deletebegin++ ;\n deleteend = deletebegin ;\n for( int i = 0 ; i < skip ; i++ )\n\t deleteend++ ;\n filelines.erase( deletebegin , deleteend ) ;\n std::ofstream outfile( filename.c_str( ) , std::ios::out | std::ios::trunc ) ;\n if ( outfile.is_open( ) ) {\n\t for ( std::list<std::string>::const_iterator sli = filelines.begin( ) ;\n\t sli != filelines.end( ) ; sli++ )\n\t outfile << *sli << \"\\n\" ;\n }\n outfile.close( ) ;\n }\n else {\n std::cerr << \"Error! Could not find file \" << filename << \" !\\n\" ;\n return ;\n }\n}\n","language":"C++"},{"code":"using System;\nusing System.IO;\nusing System.Linq;\n\npublic class Rosetta\n{\n public static void Main() => RemoveLines(\"foobar.txt\", start: 1, count: 2);\n\n static void RemoveLines(string filename, int start, int count = 1) =>\n File.WriteAllLines(filename, File.ReadAllLines(filename)\n .Where((line, index) => index < start - 1 || index >= start + count - 1));\n}\n","language":"C-sharp"},{"code":"(require '[clojure.java.io :as jio]\n '[clojure.string :as str])\n\n(defn remove-lines1 [filepath start nskip]\n (let [lines (str/split-lines (slurp filepath))\n new-lines (concat (take (dec start) lines)\n (drop (+ (dec start) nskip) lines))\n diff (- (count lines) (count new-lines))]\n (when-not (zero? diff)\n (println \"WARN: You are trying to remove lines beyond EOF\"))\n (with-open [wrt (jio/writer (str filepath \".tmp\"))]\n (.write wrt (str/join \"\\n\" new-lines)))\n (.renameTo (jio/file (str filepath \".tmp\")) (jio/file filepath))))\n","language":"Clojure"},{"code":"(require '[clojure.java.io :as jio]\n '[clojure.string :as str])\n\n(defn remove-lines2 [filepath start nskip]\n (with-open [rdr (jio/reader filepath)]\n (with-open [wrt (jio/writer (str filepath \".tmp\"))]\n (loop [s start n nskip]\n (if-let [line (.readLine rdr)]\n (cond\n (> s 1) (do (doto wrt (.write line) (.newLine))\n (recur (dec s) n))\n (pos? n) (recur s (dec n))\n :else (do (doto wrt (.write line) (.newLine))\n (recur s n)))\n (when (pos? n)\n (println \"WARN: You are trying to remove lines beyond EOF\"))))))\n (.renameTo (jio/file (str filepath \".tmp\")) (jio/file filepath)))\n","language":"Clojure"},{"code":"(defun remove-lines (filename start num)\n (let ((tmp-filename (concatenate 'string filename \".tmp\"))\n\t(lines-omitted 0))\n ;; Open a temp file to write the result to\n (with-open-file (out tmp-filename\n\t\t\t :direction :output\n\t\t\t :if-exists :supersede\n\t\t\t :if-does-not-exist :create)\n ;; Open the original file for reading\n (with-open-file (in filename)\n\t(loop\n\t for line = (read-line in nil 'eof)\n\t for i from 1\n\t until (eql line 'eof)\n\t ;; Write the line to temp file if it is not in the omitted range\n\t do (if (or (< i start)\n\t\t (>= i (+ start num)))\n\t\t(write-line line out)\n\t\t(setf lines-omitted (1+ lines-omitted))))))\n ;; Swap in the temp file for the original\n (delete-file filename)\n (rename-file tmp-filename filename)\n ;; Warn if line removal went past the end of the file\n (when (< lines-omitted num)\n (warn \"End of file reached with only ~d lines removed.\" lines-omitted))))\n","language":"Common-Lisp"},{"code":"import std.stdio, std.file, std.string;\n\nvoid main() {\n deleteLines(\"deleteline_test.txt\", 1, 2);\n}\n\nvoid deleteLines(string name, int start, int num)\nin {\n assert(start > 0, \"Line counting must start at 1\");\n} body {\n start--;\n\n if (!exists(name) || !isFile(name))\n throw new FileException(\"File not found\");\n\n auto lines = readText(name).splitLines();\n if (lines.length < start + num)\n throw new Exception(\"Can't delete lines past the end of file!\");\n\n auto f = File(name, \"w\");\n foreach (int i, line; lines) {\n if (start > i || i >= start + num)\n f.writeln(line);\n }\n}\n","language":"D"},{"code":"program Remove_lines_from_a_file_using_TStringDynArray;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils,\n System.IoUtils;\n\n// zero started Index\nprocedure RemoveLines(FileName: TFileName; Index, Line_count: Cardinal);\nbegin\n if not FileExists(FileName) then\n exit;\n\n var lines := TFile.ReadAllLines(FileName);\n\n Delete(lines, Index, Line_count);\n TFile.WriteAllLines(FileName, lines);\nend;\n\nbegin\n // Remove 2th & 3td line of file\n RemoveLines('input.txt', 1, 2);\nend.\n","language":"Delphi"},{"code":"program Remove_lines_from_a_file_using_TStringList;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils,\n System.Classes;\n\n// zero started Index\nprocedure RemoveLines(FileName: TFileName; Index, Line_count: Cardinal);\nbegin\n if not FileExists(FileName) then\n exit;\n\n with TStringList.Create do\n begin\n LoadFromFile(FileName);\n for var _ := 1 to Line_count do\n begin\n if Index >= Count then\n Break;\n Delete(Index);\n end;\n SaveToFile(FileName);\n Free;\n end;\nend;\n\nbegin\n // Remove 2th & 3td line of file\n RemoveLines('input.txt', 1, 2);\nend.\n","language":"Delphi"},{"code":"IMPORT STD;\nRemoveLines(logicalfile, startline, numlines) := FUNCTIONMACRO\n EndLine := startline + numlines - 1;\n RecCnt := COUNT(logicalfile);\n Res := logicalfile[1..startline-1] + logicalfile[endline+1..];\n RETURN WHEN(IF(RecCnt < EndLine,logicalfile,Res),\n IF(RecCnt < EndLine,STD.System.Log.addWorkunitWarning('Attempted removal past end of file-removal ignored')));\nENDMACRO;\n","language":"ECL"},{"code":"MyFile := DATASET(100,TRANSFORM({UNSIGNED1 RecID},SELF.RecID := COUNTER));\nRemoveLines(MyFile,3,10);\n","language":"ECL"},{"code":"defmodule RC do\n def remove_lines(filename, start, number) do\n File.open!(filename, [:read], fn file ->\n remove_lines(file, start, number, IO.read(file, :line))\n end)\n end\n\n defp remove_lines(_file, 0, 0, :eof), do: :ok\n defp remove_lines(_file, _, _, :eof) do\n IO.puts(:stderr, \"Warning: End of file encountered before all lines removed\")\n end\n defp remove_lines(file, 0, 0, line) do\n IO.write line\n remove_lines(file, 0, 0, IO.read(file, :line))\n end\n defp remove_lines(file, 0, number, _line) do\n remove_lines(file, 0, number-1, IO.read(file, :line))\n end\n defp remove_lines(file, start, number, line) do\n IO.write line\n remove_lines(file, start-1, number, IO.read(file, :line))\n end\nend\n\n[filename, start, number] = System.argv\nIO.puts \"before:\"\nIO.puts File.read!(filename)\nIO.puts \"after:\"\nRC.remove_lines(filename, String.to_integer(start), String.to_integer(number)\n","language":"Elixir"},{"code":"-module( remove_lines ).\n\n-export( [from_file/3, task/0] ).\n\nfrom_file( Name, Start, How_many ) ->\n\t{Name, {ok, Binary}} = {Name, file:read_file( Name )},\n\tLines = compensate_for_last_newline( lists:reverse([X || X <- binary:split( Binary, <<\"\\n\">>, [global] )]) ),\n\t{Message, Keep_lines} = keep_lines( Start - 1, How_many, Lines, erlang:length(Lines) - 1 ),\n\tok = file:write_file( Name, [binary:list_to_bin([X, <<\"\\n\">>]) || X <- Keep_lines] ),\n\tio:fwrite( \"~s~n\", [Message] ).\n\ntask() ->\n\tfile:copy( \"priv/foobar.txt\", \"foobar.txt\" ),\n\tfrom_file( \"foobar.txt\", 1, 2 ).\n\n\n\ncompensate_for_last_newline( [<<>> | T] ) -> lists:reverse( T );\ncompensate_for_last_newline( Reversed_lines ) -> lists:reverse( Reversed_lines ).\n\nkeep_lines( Start, _How_many, Lines, Available ) when Start > Available ->\n\t{\"Start > avaliable. Nothing removed.\", Lines};\nkeep_lines( Start, How_many, Lines, Available ) when Start + How_many > Available ->\n\tMessage = lists:flatten( io_lib:format(\"Start + How_many > avaliable. Only ~p removed.\", [(Start + How_many) - Available]) ),\n\t{Keeps, _Removes} = lists:split( Start, Lines ),\n\t{Message, Keeps};\nkeep_lines( Start, How_many, Lines, _Available ) ->\n\t{Keeps, Removes} = lists:split( Start, Lines ),\n\t{\"ok\", Keeps ++ lists:nthtail( How_many, Removes )}.\n","language":"Erlang"},{"code":"open System\nopen System.IO\n\nlet cutOut (arr : 'a[]) from n = // confine syntax highlighting confusion'\n let slicer = fun i -> if i < from || (from + n) <= i then Some(arr.[i-1]) else None\n ((Array.choose slicer [| 1 .. arr.Length |]), from + n - arr.Length > 1)\n\n[<EntryPoint>]\nlet main argv =\n let nums = Array.choose (System.Int32.TryParse >> function | true, v -> Some v | false, _ -> None) argv.[1..2]\n let lines = File.ReadAllLines(argv.[0])\n let (sliced, tooShort) = cutOut lines nums.[0] nums.[1]\n if tooShort then Console.Error.WriteLine \"Not enough lines\"\n File.WriteAllLines(argv.[0], sliced)\n 0\n","language":"F-Sharp"},{"code":"D:\\Projects\\Rosetta>for /l %i in (1,1,5) do @echo %i >> foo\n\nD:\\Projects\\Rosetta>Remove_lines_from_a_file.exe foo 1 2\n\nD:\\Projects\\Rosetta>type foo\n3\n4\n5\n\nD:\\Projects\\Rosetta>\n","language":"F-Sharp"},{"code":" SUBROUTINE CROAK(GASP)\t!Something bad has happened.\n CHARACTER*(*) GASP\t!As noted.\n WRITE (6,*) \"Oh dear. \",GASP\t!So, gasp away.\n STOP \"++ungood.\"\t!Farewell, cruel world.\n END\t\t\t!No return from this.\n\n SUBROUTINE FILEHACK(FNAME,IST,N)\n CHARACTER*(*) FNAME\t!Name for the file.\n INTEGER IST\t\t!First record to be omitted.\n INTEGER N\t\t!Number of records to be omitted.\n INTEGER ENUFF,L\t\t!Some lengths.\n PARAMETER (ENUFF = 66666)!Surely?\n CHARACTER*(ENUFF) ALINE\t!But not in general...\n INTEGER NREC\t\t!A counter.\n INTEGER F,T\t\t!Mnemonics for file unit numbers.\n PARAMETER (F=66,T=67)\t!These should do.\n LOGICAL EXIST\n IF (FNAME.EQ.\"\") CALL CROAK(\"Blank file name!\")\n IF (IST.LE.0) CALL CROAK(\"First record must be positive!\")\n IF (N.LE.0) CALL CROAK(\"Remove count must be positive!\")\n INQUIRE(FILE = FNAME, EXIST = EXIST)\t!This mishap is frequent, so attend to it.\n IF (.NOT.EXIST) CALL CROAK(\"Can't find a file called \"//FNAME)\t!Tough love.\n OPEN (F,FILE=FNAME,STATUS=\"OLD\",ACTION=\"READ\",FORM=\"FORMATTED\")\t!Grab the source file.\n OPEN (T,STATUS=\"SCRATCH\",FORM=\"FORMATTED\")\t!Request a temporary file.\n NREC = 0\t\t!Number of records read so far.\nCopy the desired records to a temporary file.\n 10 READ (F,11,END = 20) L,ALINE(1:MIN(L,ENUFF))\t!Minimal protection.\n 11 FORMAT (Q,A)\t\t!Obviously, Q = # of characters to come, A = their format.\n IF (L.GT.ENUFF) CALL CROAK(\"Ow! Lengthy record!!\")\n NREC = NREC + 1\t\t!If we're here. we've read a record.\n IF (NREC.LT.IST .OR. NREC.GE.IST + N) WRITE (T,12) ALINE(1:L)\t!A desired record?\n 12 FORMAT (A)\t\t!No character count is explicitly specified.\n GO TO 10\t\t!Keep on thumping.\nConvert from input to output...\n 20 IF (NREC.LT.IST + N) CALL CROAK(\"Insufficient records!\")\t!Finished ignoring records?\n REWIND T\t\t!Not CLOSE! That would discard the file!\n CLOSE(F)\t\t!The source file still exists.\n OPEN (F,FILE=FNAME,FORM=\"FORMATTED\",\t!But,\n 1 ACTION=\"WRITE\",STATUS=\"REPLACE\")\t!This dooms it!\nCopy from the temporary file.\n 21 READ (T,11,END = 30) L,ALINE(1:L)\t!All records are not longer than ALINE.\n WRITE (F,12) ALINE(1:L)\t\t\t!Out it goes.\n GO TO 21\t\t!Keep on thumping.\nCompleted.\n 30 CLOSE(T)\t\t!Abandon the temporary file.\n CLOSE(F)\t\t!Finished with the source file.\n END\t\t!Done.\n\n PROGRAM CHOPPER\n CALL FILEHACK(\"foobar.txt\",1,2)\n END\n","language":"Fortran"},{"code":" CHARACTER*42 FUNCTION ERRORWORDS(IT)\t!Look for an explanation. One day, the system may offer coherent messages.\nCurious collection of encountered codes. Will they differ on other systems?\nCompaq's compiler was taken over by unintel; http://software.intel.com/sites/products/documentation/hpc/compilerpro/en-us/fortran/lin/compiler_f/bldaps_for/common/bldaps_rterrs.htm\ncontains a schedule of error numbers that matched those I'd found for Compaq, and so some assumptions are added.\nCopying all (hundreds!) is excessive; these seem possible for the usage so far made of error diversion.\nCompaq's compiler interface (\"visual\" blah) has a help offering, which can provide error code information.\nCompaq messages also appear in http://cens.ioc.ee/local/man/CompaqCompilers/cf/dfuum028.htm#tab_runtime_errors\nCombines IOSTAT codes (file open, read etc) with STAT codes (allocate/deallocate) as their numbers are distinct.\nCompleteness and context remains a problem. Excess brevity means cause and effect can be confused.\n INTEGER IT\t\t\t!The error code in question.\n INTEGER LASTKNOWN \t\t!Some codes I know about.\n PARAMETER (LASTKNOWN = 26)\t!But only a few, discovered by experiment and mishap.\n TYPE HINT\t\t\t!For them, I can supply a table.\n INTEGER\tCODE\t\t!The code number. (But, different systems..??)\n CHARACTER*42\tEXPLICATION\t!An explanation. Will it be te answer?\n END TYPE HINT\t\t\t!Simple enough.\n TYPE(HINT) ERROR(LASTKNOWN)\t!So, let's have a collection.\n PARAMETER (ERROR = (/\t\t!With these values.\n 1 HINT(-1,\"End-of-file at the start of reading!\"),\t!From examples supplied with the Compaq compiler involving IOSTAT.\n 2 HINT( 0,\"No worries.\"),\t\t\t!Apparently the only standard value.\n 3 HINT( 9,\"Permissions - read only?\"),\n 4 HINT(10,\"File already exists!\"),\n 5 HINT(17,\"Syntax error in NameList input.\"),\n 6 HINT(18,\"Too many values for the recipient.\"),\n 7 HINT(19,\"Invalid naming of a variable.\"),\n 8 HINT(24,\"Surprise end-of-file during read!\"),\t!From example source.\n 9 HINT(25,\"Invalid record number!\"),\n o HINT(29,\"File name not found.\"),\n 1 HINT(30,\"Unavailable - exclusive use?\"),\n 2 HINT(32,\"Invalid fileunit number!\"),\n 3 HINT(35,\"'Binary' form usage is rejected.\"),\t!From example source.\n 4 HINT(36,\"Record number for a non-existing record!\"),\n 5 HINT(37,\"No record length has been specified.\"),\n 6 HINT(38,\"I/O error during a write!\"),\n 7 HINT(39,\"I/O error during a read!\"),\n 8 HINT(41,\"Insufficient memory available!\"),\n 9 HINT(43,\"Malformed file name.\"),\n o HINT(47,\"Attempting a write, but read-only is set.\"),\n 1 HINT(66,\"Output overflows single record size.\"),\t!This one from experience.\n 2 HINT(67,\"Input demand exceeds single record size.\"),\t!These two are for unformatted I/O.\n 3 HINT(151,\"Can't allocate: already allocated!\"),\t!These different numbers are for memory allocation failures.\n 4 HINT(153,\"Can't deallocate: not allocated!\"),\n 5 HINT(173,\"The fingered item was not allocated!\"),\t!Such as an ordinary array that was not allocated.\n 6 HINT(179,\"Size exceeds addressable memory!\")/))\n INTEGER I\t\t!A stepper.\n DO I = LASTKNOWN,1,-1\t!So, step through the known codes.\n IF (IT .EQ. ERROR(I).CODE) GO TO 1\t!This one?\n END DO\t\t\t!On to the next.\n 1 IF (I.LE.0) THEN\t!Fail with I = 0.\n ERRORWORDS = I8FMT(IT)//\" is a novel code!\"\t!Reveal the mysterious number.\n ELSE\t\t\t!But otherwise, it is found.\n ERRORWORDS = ERROR(I).EXPLICATION\t!And these words might even apply.\n END IF\t\t\t!But on all systems?\n END FUNCTION ERRORWORDS\t!Hopefully, helpful.\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nSub removeLines(fileName As String, startLine As UInteger, numLines As UInteger)\n If startLine = 0 Then\n Print \"Starting line must be more than zero\"\n Return\n End If\n If numLines = 0 Then\n Print \"No lines to remove\"\n Return\n End If\n Dim fileNum As Integer = FreeFile\n Open fileName For Input As #fileNum\n If err > 0 Then\n Print \"File could not be opened\"\n Return\n End If\n Dim tempFileName As String = \"temp_\" + fileName\n Dim fileNum2 As Integer = FreeFile\n Open tempFileName For Output As #fileNum2\n Dim count As Integer = 0\n Dim ln As String\n Dim endLine As UInteger = startLine + numLines - 1\n While Not Eof(fileNum)\n Input #fileNum, ln\n count += 1\n If count >= startLine AndAlso count <= endLine Then Continue While\n Print #fileNum2, ln\n Wend\n\n If count < startLine Then\n Print \"No lines were removed as starting line was beyond end of file\"\n Print\n ElseIf count < endLine Then\n Print \"Only \"; count - startLine + 1; \" line(s) were removed as not enough lines to remove more\"\n Print\n Else\n Print Str(numLines); \" line(s) were removed\"\n Print\n End If\n Close #fileNum : Close #fileNum2\n Kill(fileName)\n Name (tempFileName, fileName)\nEnd Sub\n\nremoveLines(\"foobar.txt\", 2, 2)\nremoveLines(\"foobar.txt\", 5, 2)\nremoveLines(\"foobar.txt\", 3, 4)\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"removeLines[filename, start, len] :=\n{\n lines = array[lines[filenameToURL[filename]]]\n modified = lines.removeLen[start-1, len]\n if modified != len\n println[\"Was only able to remove $modified lines due to end-of-file.\"]\n\n w = new Writer[filename]\n for line = lines\n w.println[line]\n w.close[]\n}\n","language":"Frink"},{"code":"sNewFile As String 'Global string for the 'New file' details\n\nPublic Sub Main()\nDim sFileName As String = User.Home &/ \"foobar.txt\" 'File name\n\nsNewFile = DeleteLines(sFileName, 1, 2) 'Send the details to the DeleteLine routine 'The parameters should be: foobar.txt, 1, 2'\nPrint \"New file: -\" & gb.NewLine & sNewFile 'Print details of the changed file\nFile.Save(sFileName, sNewFile) 'Save the file with the original name\n\nEnd\n\nPublic Sub DeleteLines(sFile As String, siStart As Short, siNum As Short) As String 'DeleteLines routine\nDim sData As New String[] 'To store the existing file data\nDim siCount As Short 'Counter\nDim sTemp, sDel As String 'String variables\n\nFor Each sTemp In Split(File.Load(sFile), gb.NewLine) 'Load the file, split the lines by NewLine\n sData.Add(sTemp) 'Add to sData\nNext\n\nPrint \"Original file: -\" 'Print Title\n\nIf siStart + siNum > sData.max Then 'Check an attempt is made to remove lines beyond the end of the file\n Print \"Not enough lines in file to carry out request\" 'An appropriate message should appear if so\n Return \"\" 'Return nothing\nEndif\n\nDec siStart 'For the purpose of this task, line numbers start at one (Program starts at 0)\n\nFor siCount = siStart To (siStart + siNum) - 1 'Loop through the lines to be deleted\n sDel &= Str(siCount) & \" \" 'Add then to sDel\nNext\n\nsiCount = -1 'Reset counter\n\nFor Each sTemp In sData 'For each line in the file..\n Inc siCount 'Increase counter\n Print sTemp 'Print the line\n If InStr(sDel, Str(siCount) & \" \") Then Continue 'If the line number is listed in sDel then jump to the end of the loop\n sNewFile &= sTemp & gb.NewLine 'Add the lines not to be removed into sNewFile\nNext\n\nReturn sNewFile 'Return the details\n\nEnd\n","language":"Gambas"},{"code":"package main\n\nimport (\n \"bytes\"\n \"errors\"\n \"fmt\"\n \"io/ioutil\"\n \"os\"\n)\n\nfunc main() {\n if err := removeLines(\"foobar.txt\", 1, 2); err != nil {\n fmt.Println(err)\n }\n}\n\nfunc removeLines(fn string, start, n int) (err error) {\n if start < 1 {\n return errors.New(\"invalid request. line numbers start at 1.\")\n }\n if n < 0 {\n return errors.New(\"invalid request. negative number to remove.\")\n }\n var f *os.File\n if f, err = os.OpenFile(fn, os.O_RDWR, 0); err != nil {\n return\n }\n defer func() {\n if cErr := f.Close(); err == nil {\n err = cErr\n }\n }()\n var b []byte\n if b, err = ioutil.ReadAll(f); err != nil {\n return\n }\n cut, ok := skip(b, start-1)\n if !ok {\n return fmt.Errorf(\"less than %d lines\", start)\n }\n if n == 0 {\n return nil\n }\n tail, ok := skip(cut, n)\n if !ok {\n return fmt.Errorf(\"less than %d lines after line %d\", n, start)\n }\n t := int64(len(b) - len(cut))\n if err = f.Truncate(t); err != nil {\n return\n }\n if len(tail) > 0 {\n _, err = f.WriteAt(tail, t)\n }\n return\n}\n\nfunc skip(b []byte, n int) ([]byte, bool) {\n for ; n > 0; n-- {\n if len(b) == 0 {\n return nil, false\n }\n x := bytes.IndexByte(b, '\\n')\n if x < 0 {\n x = len(b)\n } else {\n x++\n }\n b = b[x:]\n }\n return b, true\n}\n","language":"Go"},{"code":"static def removeLines(String filename, int startingLine, int lineCount) {\n def sourceFile = new File(filename).getAbsoluteFile()\n def outputFile = File.createTempFile(\"remove\", \".tmp\", sourceFile.getParentFile())\n\n outputFile.withPrintWriter { outputWriter ->\n sourceFile.eachLine { line, lineNumber ->\n if (lineNumber < startingLine || lineNumber - startingLine >= lineCount)\n outputWriter.println(line)\n }\n }\n\n outputFile.renameTo(sourceFile)\n}\n\nremoveLines(args[0], args[1] as Integer, args[2] as Integer)\n","language":"Groovy"},{"code":"import System.Environment (getArgs)\n\nmain = getArgs >>= (\\[a, b, c] ->\n do contents <- fmap lines $ readFile a\n let b1 = read b :: Int\n c1 = read c :: Int\n putStr $ unlines $ concat [take (b1 - 1) contents, drop c1 $ drop b1 contents]\n )\n","language":"Haskell"},{"code":"procedure main() # remove lines\n removelines(\"foo.bar\",3,2) | stop(\"Failed to remove lines.\")\nend\n\nprocedure removelines(fn,start,skip)\n\n f := open(fn,\"r\") | fail # open to read\n every put(F := [],|read(f)) # file to list\n close(f)\n\n if *F < start-1+skip then fail\n every F[start - 1 + (1 to skip)] := &null # mark delete\n\n f := open(fn,\"w\") | fail # open to rewrite\n every write(\\!F) # write non-nulls\n close(f)\n return # done\nend\n","language":"Icon"},{"code":"100 PROGRAM \"RemLines.bas\"\n110 CALL REMOVELINES(\"fub.txt\",5,3)\n120 DEF REMOVELINES(NAME$,ST,N)\n130 STRING S$*254\n140 WHEN EXCEPTION USE OPENERROR\n150 LET P=POS(NAME$,\".\")\n160 IF P=0 THEN LET P=LEN(NAME$)+1\n170 LET CM$=\"copy \"&NAME$&\" \"&NAME$(1:P-1)&\".bak\"\n180 EXT CM$\n190 OPEN #1:NAME$(1:P-1)&\".bak\"\n200 OPEN #2:NAME$ ACCESS OUTPUT\n210 END WHEN\n220 WHEN EXCEPTION USE IOERROR\n230 LET LIN=0\n240 DO\n250 LINE INPUT #1:S$\n260 LET LIN=LIN+1\n270 IF LIN<ST OR LIN>ST+N-1 THEN PRINT #2:S$\n280 LOOP\n290 END WHEN\n300 HANDLER OPENERROR\n310 PRINT EXSTRING$(EXTYPE)\n320 STOP\n330 END HANDLER\n340 HANDLER IOERROR\n350 IF EXTYPE<>8001 THEN\n360 PRINT EXSTRING$(EXLINE)\n375 STOP\n380 ELSE\n390 IF LIN>=ST+N-1 THEN PRINT N;\"line(s) removed.\"\n400 IF LIN>=ST AND LIN<ST+N-1 THEN PRINT \"Only\";LIN-ST+1;\"line(s) were removed as not enough lines to remove more.\"\n410 IF LIN<ST THEN PRINT \"No lines were removed as starting line was beyond end of file.\"\n420 END IF\n430 CLOSE #2\n440 CLOSE #1\n450 END HANDLER\n460 END DEF\n","language":"IS-BASIC"},{"code":"removeLines=: 4 :0\n 'count start'=. x\n file=. boxxopen y\n lines=. <;.2 fread file\n (;lines {~ <<< (start-1)+i.count) fwrite file\n)\n","language":"J"},{"code":"$ cal >cal.txt\n$ cat cal.txt\n July 2011\nSu Mo Tu We Th Fr Sa\n 1 2\n 3 4 5 6 7 8 9\n10 11 12 13 14 15 16\n17 18 19 20 21 22 23\n24 25 26 27 28 29 30\n31\n","language":"J"},{"code":" 2 1 removeLines 'cal.txt'\n","language":"J"},{"code":"$ cat cal.txt\n 1 2\n 3 4 5 6 7 8 9\n10 11 12 13 14 15 16\n17 18 19 20 21 22 23\n24 25 26 27 28 29 30\n31\n","language":"J"},{"code":"import java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileReader;\nimport java.io.FileWriter;\n\npublic class RemoveLines\n{\n\tpublic static void main(String[] args)\n\t{\n\t\t//Enter name of the file here\n\t\tString filename=\"foobar.txt\";\n\t\t//Enter starting line here\n\t\tint startline=1;\n\t\t//Enter number of lines here.\n\t\tint numlines=2;\n\t\t\n\t\tRemoveLines now=new RemoveLines();\n\t\tnow.delete(filename,startline,numlines);\n\t}\n\tvoid delete(String filename, int startline, int numlines)\n\t{\n\t\ttry\n\t\t{\n\t\t\tBufferedReader br=new BufferedReader(new FileReader(filename));\n\t\t\t\n\t\t\t//String buffer to store contents of the file\n\t\t\tStringBuffer sb=new StringBuffer(\"\");\n\t\t\t\n\t\t\t//Keep track of the line number\n\t\t\tint linenumber=1;\n\t\t\tString line;\n\t\t\t\n\t\t\twhile((line=br.readLine())!=null)\n\t\t\t{\n\t\t\t\t//Store each valid line in the string buffer\n\t\t\t\tif(linenumber<startline||linenumber>=startline+numlines)\n\t\t\t\t\tsb.append(line+\"\\n\");\n\t\t\t\tlinenumber++;\n\t\t\t}\n\t\t\tif(startline+numlines>linenumber)\n\t\t\t\tSystem.out.println(\"End of file reached.\");\n\t\t\tbr.close();\n\t\t\t\n\t\t\tFileWriter fw=new FileWriter(new File(filename));\n\t\t\t//Write entire string buffer into the file\n\t\t\tfw.write(sb.toString());\n\t\t\tfw.close();\n\t\t}\n\t\tcatch (Exception e)\n\t\t{\n\t\t\tSystem.out.println(\"Something went horribly wrong: \"+e.getMessage());\n\t\t}\n\t}\n}\n","language":"Java"},{"code":"jq -s -R -r --arg start START --arg number NUMBER -f remove.jq INFILE\n","language":"Jq"},{"code":"# Counting the first line in the file as line 1,\n# attempt to remove \"number\" lines from line number \"start\" onwards:\ndef remove_lines(start; number):\n (start+number - 1) as $max\n | reduce split(\"\\n\")[] as $line\n ( [0, []];\n .[0] += 1\n | .[0] as $i\n | if start <= $i and $i <= $max then . else .[1] += [$line] end)\n | .[0] as $count\n | .[1]\n | join(\"\\n\")\n | (if $count < $max then \"WARNING: there are only \\($count) lines\" else empty end), .;\n\nremove_lines($start|tonumber; $number|tonumber)\n","language":"Jq"},{"code":"jq -n -R -r --arg start 1 --arg number 2 -f Remove_lines_from_a_file.jq input.txt\n","language":"Jq"},{"code":"# Counting the first line in the file as line 1, attempt to remove \"number\" lines from line\n# number \"start\" onwards:\ndef remove_lines_streaming(start; number):\n (start+number - 1) as $max\n # In the following line, null will serve to signal EOF so that the warning can be emitted.\n | foreach (inputs,null) as $line\n ( 0;\n . += 1;\n if $line == null then # EOF\n if . <= $max then \"WARNING: there were only \\(.) lines\" else empty end\n elif start <= . and . <= $max then empty\n else $line\n end) ;\n\nremove_lines_streaming($start|tonumber; $number|tonumber)\n","language":"Jq"},{"code":"#!/usr/bin/env julia\n\nconst prgm = basename(Base.source_path())\n\nif length(ARGS) < 2\n println(\"usage: \", prgm, \" <file> [line]...\")\n exit(1)\nend\n\nfile = ARGS[1]\n\nconst numbers = map(x -> begin\n try\n parse(Uint, x)\n catch\n println(prgm, \": \", x, \": not a number\")\n exit(1)\n end\nend, ARGS[2:end])\n\nf = open(file)\nlines = readlines(f)\nclose(f)\n\nif maximum(numbers) > length(lines)\n println(prgm, \": detected extraneous line number\")\n exit(1)\nend\n\ndeleteat!(lines, sort(unique(numbers)))\nf = open(file, \"w\")\nwrite(f, join(lines))\nclose(f)\n","language":"Julia"},{"code":"// version 1.1.2\n\nimport java.io.File\n\nfun removeLines(fileName: String, startLine: Int, numLines: Int) {\n require(!fileName.isEmpty() && startLine >= 1 && numLines >= 1)\n val f = File(fileName)\n if (!f.exists()) {\n println(\"$fileName does not exist\")\n return\n }\n var lines = f.readLines()\n val size = lines.size\n if (startLine > size) {\n println(\"The starting line is beyond the length of the file\")\n return\n }\n var n = numLines\n if (startLine + numLines - 1 > size) {\n println(\"Attempting to remove some lines which are beyond the end of the file\")\n n = size - startLine + 1\n }\n lines = lines.take(startLine - 1) + lines.drop(startLine + n - 1)\n val text = lines.joinToString(System.lineSeparator())\n f.writeText(text)\n}\n\nfun printFile(fileName: String, message: String) {\n require(!fileName.isEmpty())\n val f = File(fileName)\n if (!f.exists()) {\n println(\"$fileName does not exist\")\n return\n }\n println(\"\\nContents of $fileName $message:\\n\")\n f.forEachLine { println(it) }\n}\n\nfun main(args: Array<String>) {\n printFile(\"input.txt\", \"before removal\")\n removeLines(\"input.txt\", 2, 3)\n printFile(\"input.txt\", \"after removal of 3 lines starting from the second\")\n}\n","language":"Kotlin"},{"code":"#!/usr/bin/lasso9\n\nlocal(\n\torgfilename\t\t= $argv -> second,\n\tfile\t\t\t= file(#orgfilename),\n\tregexp\t\t\t= regexp(-find = `(?m)$`),\n\tcontent\t\t\t= #regexp -> split(-input = #file -> readstring) -> asarray,\n\tstart\t\t\t= integer($argv -> get(3) || 1),\n\trange\t\t\t= integer($argv -> get(4) || 1)\n)\nstdout(#content)\n#file -> copyto(#orgfilename + '.org')\n\nfail_if(#content -> size < (#start + #range), -1, 'Not that many rows in the file')\n\n#content -> remove(#start, #range)\n\n#file = file(#orgfilename)\n#file -> opentruncate\n#file -> dowithclose => {\n\t#file -> writestring(#content -> join(''))\n}\n","language":"Lasso"},{"code":"./removelines textfile.txt 2 2\n","language":"Lasso"},{"code":"call removeLines \"foobar.txt\", 1, 2\nend\n\nsub removeLines filename$, start, count\n open filename$ for input as #in\n open filename$ + \".tmp\" for output as #out\n lineCounter = 1\n firstAfterIgnored = start + count\n while not(eof(#in))\n line input #in, s$\n if lineCounter < start or lineCounter >= firstAfterIgnored then\n print #out, s$\n end if\n lineCounter = lineCounter + 1\n wend\n close #in\n close #out\n 'kill filename$\n 'name filename$ + \".tmp\" as filename$\nend sub\n","language":"Liberty-BASIC"},{"code":"function remove( filename, starting_line, num_lines )\n local fp = io.open( filename, \"r\" )\n if fp == nil then return nil end\n\n content = {}\n i = 1;\n for line in fp:lines() do\n if i < starting_line or i >= starting_line + num_lines then\n\t content[#content+1] = line\n\tend\n\ti = i + 1\n end\n\n if i > starting_line and i < starting_line + num_lines then\n\tprint( \"Warning: Tried to remove lines after EOF.\" )\n end\n\n fp:close()\n fp = io.open( filename, \"w+\" )\n\n for i = 1, #content do\n\tfp:write( string.format( \"%s\\n\", content[i] ) )\n end\n\n fp:close()\nend\n","language":"Lua"},{"code":"f[doc_String, start_Integer, n_Integer] := Module[{p, newdoc},\n p = Import[doc, \"List\"];\n If[start + n - 1 <= Length@p,\n p = Drop[p, {start, start + n - 1}];\n newdoc = FileNameJoin[{DirectoryName[doc], FileBaseName[doc] <> \"_removed.txt\"}];\n Export[newdoc, p, \"List\"];\n ,\n Print[\"Too few lines in document. Operation aborted.\"]\n ]\n ]\n","language":"Mathematica"},{"code":"(context 'ABC)\n\n(define (remove-lines-from-a-file filename start num)\n (setf new-content \"\")\n (setf row-counter 0)\n (setf start-delete-row start)\n (setf end-delete-row (+ start num -1))\n (setf file-content (read-file filename))\n (setf max-rows (length (parse file-content \"\\n\" 0)))\n\n (cond\n ((<= start 0)\n (println \"Start line must be >= 1. Value passed: \" start))\n ((<= num 0)\n (println \"# of lines to remove must be >= 1. Value passed: \" num))\n ((> start max-rows)\n (println \"Start line must be <= \" max-rows \". Value passed: \" start))\n ((> end-delete-row max-rows)\n (println \"Not so much lines available to be removed. Max \" (- max-rows start-delete-row) \". Value passed: \" num))\n (true\n (dolist (row (parse file-content \"\\n\" 0))\n (++ row-counter)\n (if (or (< row-counter start-delete-row) (> row-counter end-delete-row))\n (setf new-content (append new-content row \"\\n\"))\n )\n )\n (write-file filename new-content)\n )\n )\n)\n\n(context 'MAIN)\n\n(ABC:remove-lines-from-a-file \"foobar.txt\" 8 3)\n(exit)\n","language":"NewLISP"},{"code":"import sequtils, strutils\n\nproc removeLines*(filename: string; start, count: Positive) =\n\n # Read the whole file, split into lines but keep the ends of line.\n var lines = filename.readFile().splitLines(keepEol = true)\n\n # Remove final empty string if any.\n if lines[^1].len == 0: lines.setLen(lines.len - 1)\n\n # Compute indices and check validity.\n let first = start - 1\n let last = first + count - 1\n if last >= lines.len:\n raise newException(IOError, \"trying to delete lines after end of file.\")\n\n # Delete the lines and write the file.\n lines.delete(first, last)\n filename.writeFile(lines.join())\n","language":"Nim"},{"code":"let input_line_opt ic =\n try Some (input_line ic)\n with End_of_file -> None\n\nlet delete_lines filename start skip =\n if start < 1 || skip < 1 then\n invalid_arg \"delete_lines\";\n let tmp_file = filename ^ \".tmp\" in\n let ic = open_in filename\n and oc = open_out tmp_file in\n let until = start + skip - 1 in\n let rec aux i =\n match input_line_opt ic with\n | Some line ->\n if i < start || i > until\n then (output_string oc line; output_char oc '\\n');\n aux (succ i)\n | None ->\n close_in ic;\n close_out oc;\n Sys.remove filename;\n Sys.rename tmp_file filename\n in\n aux 1\n\nlet usage () =\n Printf.printf \"Usage:\\n%s <filename> <startline> <skipnumber>\\n\" Sys.argv.(0);\n exit 0\n\nlet () =\n if Array.length Sys.argv < 4 then usage ();\n delete_lines\n Sys.argv.(1) (int_of_string Sys.argv.(2)) (int_of_string Sys.argv.(3))\n","language":"OCaml"},{"code":": removeLines(filename, startLine, numLines)\n| line b endLine |\n ListBuffer new ->b\n startLine numLines + 1 - ->endLine\n\n 0 File new(filename) forEach: line [\n 1+ dup between(startLine, endLine) ifFalse: [ b add(line) continue ]\n numLines 1- ->numLines\n ]\n drop numLines 0 == ifFalse: [ \"Error : Removing lines beyond end of file\" println return ]\n\n File new(filename) dup open(File.WRITE) b apply(#[ << dup cr ]) close ;\n","language":"Oforth"},{"code":"program RemLines;\n\n{$mode objfpc}{$H+}\n\nuses\n {$IFDEF UNIX}{$IFDEF UseCThreads}\n cthreads,\n {$ENDIF}{$ENDIF}\n Classes, SysUtils;\n\ntype\n TRLResponse=(rlrOk, rlrEmptyFile, rlrNotEnoughLines);\n\nfunction RemoveLines(const FileName: String; const From, Count: Integer): TRLResponse;\nconst\n LineOffs = Length(LineEnding);\n\nvar\n TIn, TOut: TFileStream;\n tmpFn, MemBuff, FileBuff: String;\n EndingPos, CharRead, LineNumber: Integer;\n\n procedure WriteLine(Line: String);\n begin\n if ((From > 1) and (LineNumber = 1)) or ((From = 1) and (LineNumber = (From+Count))) then\n // First line to write, without LineEnding => Line unchanged\n else if ((From = 1) or (From <= LineNumber)) and (LineNumber < (From+Count)) then\n // No line to write\n Line := ''\n else\n // all other cases, write Line preceded (!) by LineEnding\n Line := LineEnding + Line;\n // Write\n if Line <> '' then\n TOut.Write(Line[1], Length(Line));\n End;\n\nbegin\n if not FileExists(FileName) then\n raise Exception.CreateFmt('No such file %s', [FileName]);\n if From < 1 then\n raise Exception.Create('First line must be >= 1');\n\n tmpFn := GetTempFileName(ExtractFilePath(FileName), '');\n\n TIn := TFileStream.Create(FileName, fmOpenRead);\n try\n TOut := TFileStream.Create(tmpFn, fmCreate);\n try\n FileBuff := StringOfChar(' ', 1024); // Reserve memory in a string\n LineNumber := 0;\n MemBuff := '';\n while True do\n begin\n CharRead := TIn.Read(FileBuff[1], 1024);\n if (CharRead = 0) then\n break; // no more char to process\n MemBuff += Copy(FileBuff, 1, CharRead); // op += is FPC specific\n while True do\n begin\n // LineEnding can contain 1 or 2 chars, depending on the OS\n EndingPos := Pos(LineEnding, MemBuff);\n if EndingPos = 0 then\n break; // EndingLine in the next reading, maybe\n Inc(LineNumber);\n WriteLine(Copy(MemBuff, 1, EndingPos - 1));\n MemBuff := Copy(MemBuff, EndingPos + LineOffs, MaxInt);\n // Loop for another line in MemBuff\n end;\n end;\n Inc(LineNumber);\n WriteLine(MemBuff); // Writes what remains\n finally\n TOut.Free;\n end;\n finally\n TIn.Free;\n end;\n // Temp File replaces the original file.\n if DeleteFile(FileName) then\n RenameFile(tmpFn, FileName)\n else\n raise Exception.Create('Unable to process the file');\n // Response\n if (LineNumber = 0) then\n Result := rlrEmptyFile\n else if (LineNumber < (From+Count-1)) then\n Result := rlrNotEnoughLines\n else\n Result := rlrOk;\nEnd;\n\nvar\n FileName: String;\n\nbegin\n FileName := IncludeTrailingPathDelimiter(ExtractFilePath(ParamStr(0))) + 'test.txt';\n try\n case RemoveLines(FileName, 4, 3) of\n rlrOk: WriteLn('Lines deleted');\n rlrEmptyFile: WriteLn(Format('File \"%s\" is empty!', [FileName]));\n rlrNotEnoughLines: WriteLn('Can''t delete lines past the end of file');\n end\n except\n on E: Exception do\n WriteLn('Error: ' + E.Message);\n end;\n ReadLn;\nEnd.\n","language":"Pascal"},{"code":"#!/usr/bin/perl -n -s -i\nprint unless $. >= $from && $. <= $to;\n","language":"Perl"},{"code":"#!/usr/bin/perl -w\nuse strict ;\nuse Tie::File ;\n\nsub deletelines {\n my $arguments = shift ;\n my( $file , $startfrom , $howmany ) = @{$arguments} ;\n tie my @lines , 'Tie::File' , $file or die \"Can't find file $file!\\n\" ;\n my $nrecs = @lines ;\n if ( $startfrom > $nrecs ) {\n print \"Error! Starting to delete lines past the end of the file!\\n\" ;\n return ;\n }\n if ( ( $startfrom + $howmany ) > $nrecs ) {\n print \"Error! Trying to delete lines past the end of the file!\\n\" ;\n return ;\n }\n splice @lines , $startfrom - 1 , $howmany ;\n untie @lines ;\n}\n\nif ( @ARGV != 3 ) {\n print \"Error! Invoke with deletelines <filename> <start> <skiplines> !\\n\" ;\n exit( 1 ) ;\n}\n\ndeletelines( \\@ARGV ) ;\n","language":"Perl"},{"code":"(notonline)-->\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- (file i/o)</span>\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">remove_lines</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">fn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">open</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">'r'</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">!=-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"cannot open file!\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">lines</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">get_text</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">GT_LF_STRIPPED</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">close</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lines</span><span style=\"color: #0000FF;\">)<</span><span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"bad parameters!\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">lines</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #000000;\">fn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">open</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">'w'</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lines</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">close</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n<!--\n","language":"Phix"},{"code":"\"aFile.txt\" var fileName\n100 var startLine\n10 var lineCount\n0 var lineNum\n\nfileName \"r\" fopen var in\nfileName \"_tmp\" chain \"w\" fopen var out\n\nin 0 > out 0 > and if\n true\n while\n in fgets dup\n -1 == if\n drop\n in fclose out fclose\n false\n else\n lineNum 1 + var lineNum\n lineNum startLine < lineNum startLine lineCount + >= or\n if out fputs else drop endif\n true\n endif\n endwhile\n \"del \" fileName chain cmd drop\n \"rename \" fileName chain \"_tmp \" chain fileName chain cmd drop\nelse\n \"WRONG! error in file operation\" print\nendif\n","language":"Phixmonti"},{"code":"(de deleteLines (File Start Cnt)\n (let L (in File (make (until (eof) (link (line)))))\n (if (> (+ (dec 'Start) Cnt) (length L))\n (quit \"Not enough lines\")\n (out File\n (mapc prinl (cut Start 'L))\n (mapc prinl (nth L (inc Cnt))) ) ) ) )\n","language":"PicoLisp"},{"code":"#DIM ALL\n\nFUNCTION PBMAIN () AS LONG\n DIM filespec AS STRING, linein AS STRING\n DIM linecount AS LONG, L0 AS LONG, ok AS LONG\n\n filespec = DIR$(COMMAND$(1))\n WHILE LEN(filespec)\n linecount = 0: ok = 0\n OPEN filespec FOR INPUT AS 1\n OPEN filespec & \".tmp\" FOR OUTPUT AS 2\n DO UNTIL EOF(1)\n LINE INPUT #1, linein\n INCR linecount\n IF VAL(COMMAND$(2)) <> linecount THEN\n PRINT #2, linein\n ELSE\n ok = -1\n FOR L0 = 2 TO VAL(COMMAND$(3))\n IF EOF(1) THEN\n ok = 1\n PRINT \"Tried to remove beyond the end of \"; filespec\n EXIT DO\n END IF\n LINE INPUT #1, linein\n NEXT\n END IF\n LOOP\n IF 0 = ok THEN\n PRINT \"Lines to remove are beyond the end of \"; filespec\n ELSEIF -1 = ok THEN\n PRINT filespec; \": done\"\n END IF\n CLOSE\n filespec = DIR$\n WEND\nEND FUNCTION\n","language":"PowerBASIC"},{"code":"function del-line($file, $start, $end) {\n $i = 0\n $start--\n $end--\n (Get-Content $file) | where{\n ($i -lt $start -or $i -gt $end)\n $i++\n } > $file\n (Get-Content $file)\n}\ndel-line \"foobar.txt\" 1 2\n","language":"PowerShell"},{"code":"; Contents of file 'input.txt' before deletion of lines :\n;\n; cat\n; dog\n; giraffe\n; lion\n; mouse\n; pig\n; tiger\n; zebra\n\nEnableExplicit\n\n#Output$ = \"output.txt\"; insert path to temporary output file\n\nProcedure RemoveLines(Input$, StartLine, NbLines)\n Protected lineCount = 0\n Protected endline = StartLine + NbLines - 1\n Protected row$\n\n If Not ReadFile(0, Input$)\n PrintN(\"Error opening input file\")\n ProcedureReturn\n EndIf\n\n If Not CreateFile(1, #Output$)\n PrintN(\"Error creating output file\")\n CloseFile(0)\n ProcedureReturn\n EndIf\n\n While Not Eof(0)\n row$ = ReadString(0)\n lineCount + 1\n If lineCount < StartLine Or lineCount > endLine\n WriteStringN(1, row$)\n EndIf\n Wend\n\n If endLine > lineCount\n PrintN(\"Attempted to remove lines beyond the end of the file\")\n ; but still allow removal of lines (if any) up to the end of the file\n EndIf\n\n CloseFile(0)\n CloseFile(1)\n\n If Not DeleteFile(Input$)\n PrintN(\"Unable to delete input file so output file can be renamed\")\n ProcedureReturn\n EndIf\n\n If Not RenameFile(#Output$, Input$)\n PrintN(\"Unable to rename output file\")\n EndIf\n\nEndProcedure\n\nDefine fInput$\n\nIf OpenConsole()\n ; delete lines 2,3 amnd 4 of 'input.txt'\n fInput$ = \"input.txt\"; insert path to input file\n RemoveLines(fInput$, 2, 3)\n PrintN(\"\")\n PrintN(\"Press any key to close the console\")\n Repeat: Delay(10) : Until Inkey() <> \"\"\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"#!/usr/bin/env python\n\nimport fileinput, sys\n\nfname, start, count = sys.argv[1:4]\nstart, count = int(start), int(count)\n\nfor line in fileinput.input(fname, inplace=1, backup='.orig'):\n if start <= fileinput.lineno() < start + count:\n pass\n else:\n print line.rstrip(\"\\n\")\nfileinput.close()\n","language":"Python"},{"code":"#lang racket\n(define (remove-lines file from num)\n (define lines (file->lines file))\n (define-values [pfx rest] (split-at lines (sub1 from)))\n (display-lines-to-file (append pfx (drop rest num)) file #:exists 'replace))\n","language":"Racket"},{"code":"sub MAIN ($filename, $beg, $len) {\n my @lines = split /^^/, slurp $filename;\n unlink $filename; # or rename\n splice(@lines,$beg,$len) == $len or warn \"Too few lines\";\n spurt $filename, @lines;\n}\n","language":"Raku"},{"code":"/*REXX program reads and writes a specified file and delete(s) specified record(s). */\nparse arg iFID ',' N \",\" many . /*input FID, start of delete, how many.*/\nif iFID='' then call er \"no input fileID specified.\" /*oops.*/\nif N='' then call er \"no start number specified.\" /*oops.*/\nif many='' then many=1 /*Not specified? Assume delete 1 line.*/\nstop=N+many-1 /*calculate high end of delete range.*/\noFID=iFID'.$$$' /*temp name (fileID) of the output file*/\n#=0 /*the count (so far) of records written*/\n do j=1 while lines(iFID)\\==0 /*J is the record# (line) being read.*/\n @=linein(iFID) /*read a record (line) from input file.*/\n if j>=N & j<=stop then iterate /*if it's in the range, then ignore it.*/\n call lineout oFID,@; #=#+1 /*write record (line);, bump write cnt.*/\n end /*j*/ /* [↑] by ignoring it is to delete it.*/\nj=j-1 /*adjust J (because of DO loop advance)*/\nif j<stop then say \"The number of lines in file is less than the range given.\"\n$='\"' /*handle cases of blanks in the FID(s).*/\n'ERASE' $ || iFID || $ /*erase the original file. */\n'RENAME' $ || oFID || $ $ || iFID || $ /*rename \" new \" to original. */\nsay 'file ' iFID \" had\" j 'record's(j)\", it now has\" # 'record's(w)\".\"\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ner: say; say '***error***'; say; say arg(1); say; exit 13\ns: if arg(1)==1 then return arg(3); return word(arg(2) 's', 1) /*pluralizer.*/\n","language":"REXX"},{"code":"cStr = read(\"C:\\Ring\\bin\\filename.txt\")\naList = str2list(cStr)\nsee aList + nl\nlineStart = 3\nlineCount = 5\nnum = -1\nfor n = lineStart to lineStart+lineCount-1\n num += 1\n del(aList,n-num)\nnext\ncStr = list2str(aList)\nsee cStr + nl\nwrite(\"C:\\Ring\\bin\\filename.txt\",cStr)\n","language":"Ring"},{"code":"require 'tempfile'\n\ndef remove_lines(filename, start, num)\n tmp = Tempfile.open(filename) do |fp|\n File.foreach(filename) do |line|\n if $. >= start and num > 0\n num -= 1\n else\n fp.puts line\n end\n end\n fp\n end\n puts \"Warning: End of file encountered before all lines removed\" if num > 0\n FileUtils.copy(tmp.path, filename)\n tmp.unlink\nend\n\n# Test code\ndef setup(filename, start, remove)\n puts \"remove #{remove} lines starting at line #{start}\"\n File.open(filename, \"w\") {|fh| (1..5).each {|i| fh.puts \" \"*i + i.to_s}}\n puts \"before:\", File.read(filename)\nend\n\ndef teardown(filename)\n puts \"after:\", File.read(filename)\n puts\n File.unlink(filename)\nend\n\nfilename = \"foobar.txt\"\nstart = 2\n[2, 6].each do |remove|\n setup(filename, start, remove)\n remove_lines(filename, start, remove)\n teardown(filename)\nend\n","language":"Ruby"},{"code":"fileName$ = \"aFile.txt\"\nstartLine = 100\nlineCount = 10\n\nopen filename$ for input as #in\nopen filename$ ; \"_tmp\" for output as #out\n\nwhile not(eof(#in))\n lineNum = lineNum + 1\n line input #in, a$\n if lineNum < startLine or lineNum >= startLine + lineCount then print #out, a$\nwend\nclose #in\nclose #out\n","language":"Run-BASIC"},{"code":"extern crate rustc_serialize;\nextern crate docopt;\n\nuse docopt::Docopt;\n\nuse std::io::{BufReader,BufRead};\nuse std::fs::File;\n\nconst USAGE: &'static str = \"\nUsage: rosetta <start> <count> <file>\n\";\n\n#[derive(Debug, RustcDecodable)]\nstruct Args {\n arg_start: usize,\n arg_count: usize,\n arg_file: String,\n}\n\nfn main() {\n let args: Args = Docopt::new(USAGE)\n .and_then(|d| d.decode())\n .unwrap_or_else(|e| e.exit());\n\n let file = BufReader::new(File::open(args.arg_file).unwrap());\n\n for (i, line) in file.lines().enumerate() {\n let cur = i + 1;\n\n if cur < args.arg_start || cur >= (args.arg_start + args.arg_count) {\n println!(\"{}\", line.unwrap());\n }\n }\n}\n","language":"Rust"},{"code":"object RemoveLinesFromAFile extends App {\n args match {\n case Array(filename, start, num) =>\n\n import java.nio.file.{Files,Paths}\n val lines = scala.io.Source.fromFile(filename).getLines\n val keep = start.toInt - 1\n val top = lines.take(keep).toList\n val drop = lines.take(num.toInt).toList\n Files.write(Paths.get(filename), scala.collection.JavaConversions.asJavaIterable(top ++ lines))\n\n if (top.size < keep || drop.size < num.toInt)\n println(s\"Too few lines: removed only ${drop.size} of $num lines starting at $start\")\n\n case _ =>\n println(\"Usage: RemoveLinesFromAFile <filename> <startLine> <numLines>\")\n }\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n include \"osfiles.s7i\";\n\nconst proc: removeLines (in string: fileName, in integer: start, in integer: count) is func\n local\n var file: inFile is STD_NULL;\n var file: outFile is STD_NULL;\n var integer: lineNumber is 1;\n var string: line is \"\";\n begin\n inFile := open(fileName, \"r\");\n outFile := open(fileName & \".tmp\", \"w\");\n while hasNext(inFile) do\n line := getln(inFile);\n if lineNumber < start or lineNumber >= start + count then\n writeln(outFile, line);\n end if;\n incr(lineNumber);\n end while;\n close(inFile);\n close(outFile);\n removeFile(fileName);\n moveFile(fileName & \".tmp\", fileName);\n end func;\n\nconst proc: main is func\n begin\n if length(argv(PROGRAM)) = 3 then\n removeLines(argv(PROGRAM)[1], integer parse (argv(PROGRAM)[2]), integer parse (argv(PROGRAM)[3]));\n end if;\n end func;\n","language":"Seed7"},{"code":"removeLines \"foobar.txt\", 1, 2\nto handle removeLines fileName, startingLine, linesToRemove\n\tIf there is no file fileName then\n\t\tput !\"No such file: [[the folder & fileName]]\"\n\t\tReturn\n\tEnd if\n\tset endingLine to startingLine + linesToRemove - 1\n\tIf endingLine is more than number of lines in file fileName then\n\t\tput !\"Cannot delete lines past the end of the file ([[number of lines in file fileName]] lines)\"\n\t\tReturn\n\tEnd If\n\tdelete lines startingLine to endingLine of file fileName\nend removeLines\n","language":"SenseTalk"},{"code":"func remove_lines(file, beg, len) {\n var lines = file.open_r.lines\n lines.splice(beg, len).len == len || warn \"Too few lines\";\n file.write(lines.join(\"\\n\"), :utf8)\n}\n\nremove_lines(File(__FILE__), 2, 3)\n","language":"Sidef"},{"code":"* Remove lines from a file\n\n* Function to remove a chunk of lines from a file, will go backward, too, if numlines < 0\n define(\"remlines(filename,startline,numlines)row,rowcount,lastline,swap\")\n :(remlines_end)\nremlines\n\tinput(.inp1,1,filename)\t\t:f(freturn)\n\toutput(.tmp1,2,\"/tmp/Removem\")\t:f(freturn)\n\trowcount = 0\n\tlastline = (ge(numlines,0) startline + numlines - 1, startline + numlines + 1)\n\tge(numlines,0) :s(remlines2)\n\tswap = lastline\n\tlastline = startline\n\tstartline = swap\nremlines2\n\trow = inp1\t\t\t:f(remlines3)\n\trowcount = rowcount + 1\n\tge(rowcount,startline) le(rowcount,lastline)\t:s(remlines2)\n\ttmp1 = row\n\t:(remlines2)\nremlines3\n\tendfile(1)\n\tendfile(2)\n\tinput(.rmv1,2,\"/tmp/Removem\")\t:f(freturn)\n\toutput(.fnout1,1,filename)\t:f(freturn)\nremlines4\n\tfnout1 = rmv1\t\t\t:s(remlines4)\n\tendfile(1)\n\tendfile(2)\n\t:(return)\nremlines_end\n\n\ttestfile = \"/tmp/foobar.txt\"\n\n* Populate test file with 5 rows, 1, 2, 3, 4, and 5\n\toutput(.testout,60,testfile) :f(failed)\n\ti = 1\npop1\n\ttestout = i\n\ti = lt(i,5) i + 1 :s(pop1)\n\tendfile(60)\n\n\n* Now remove lines 2, 3, and 4 from test file\n\tremlines(testfile,2,3) :f(failed)\n\n\n* Print revised file\n\tinput(.testprt,70,testfile) :f(failed)\nprint1\n\toutput = testprt :s(print1)\n\t:(end)\n\nfailed\n\toutput = \"Either the main file or the temporary file failed to open\"\nend\n","language":"SNOBOL4"},{"code":"* drop lines 20 to 30\ndrop in 20/30\n\n* keep lines 20 to 30, and remove everything else\nkeep in 20/30\n","language":"Stata"},{"code":"proc removeLines {fileName startLine count} {\n # Work out range to remove\n set from [expr {$startLine - 1}]\n set to [expr {$startLine + $count - 2}]\n # Read the lines\n set f [open $fileName]\n set lines [split [read $f] \"\\n\"]\n close $f\n # Write the lines back out, without removed range\n set f [open $fileName w]\n puts -nonewline $f [join [lreplace $lines $from $to] \"\\n\"]\n close $f\n}\n","language":"Tcl"},{"code":"$$! input=testfile,begnr=3,endnr=4\n$$ MODE TUSCRIPT\n- CREATE inputfile\nERROR/STOP CREATE (input,FDF-o,-std-)\nFILE/ERASE $input\n LOOP n=1,9\n content=CONCAT (\"line\",n)\n DATA {content}\n ENDLOOP\nENDFILE\n\n- CREATE outputfile\noutput=\"outputfile\"\n\nERROR/STOP CREATE (output,fdf-o,-std-)\nACCESS q: READ/RECORDS/utf8 $input L,line\nACCESS z: WRITE/RECORDS/utf8 $output L,line\nPRINT \"content: of output-file\"\nLOOP/9999\nREAD/NEXT/EXIT q\nIF (begnr<=L&&endnr>=L) CYCLE\nPRINT line\nWRITE z\nENDLOOP\nENDACCESS/PRINT q\nENDACCESS/PRINT z\n","language":"TUSCRIPT"},{"code":"#!/bin/sh\nerror() {\n echo >&2 \"$0: $*\"\n exit 1\n}\n\n[ $# -ne 3 ] && error \"Incorrect number of parameters\"\n\nfile=$1\nstart=$2\ncount=$3\nend=`expr $start + $count - 1`\n\n[ -f \"$file\" ] || error \"$file does not exist\"\n\nsed \"$start,${end}d\" \"$file\" >/tmp/$$ && mv /tmp/$$ \"$file\"\n","language":"UNIX-Shell"},{"code":"sed -i \"$start,${end}d\" \"$file\"\n","language":"UNIX-Shell"},{"code":"sed -i \"\" \"$start,${end}d\" \"$file\"\n","language":"UNIX-Shell"},{"code":"Option Explicit\n\nSub Main()\n 'See Output #1\n RemoveLines \"C:\\Users\\\" & Environ(\"username\") & \"\\Desktop\\foobar.txt\", 11, 5\n 'See Output #2\n RemoveLines \"C:\\Users\\\" & Environ(\"username\") & \"\\Desktop\\foobar.txt\", 8, 5\n 'See Output #3\n RemoveLines \"C:\\Users\\\" & Environ(\"username\") & \"\\Desktop\\foobar.txt\", 3, 5\nEnd Sub\n\nPrivate Sub RemoveLines(StrFile As String, StartLine As Long, NumberOfLines As Long)\nDim Nb As Integer, s As String, count As Long, out As String\n Nb = FreeFile\n Open StrFile For Input As #Nb\n While Not EOF(Nb)\n count = count + 1\n Line Input #Nb, s\n If count < StartLine Or count >= StartLine + NumberOfLines Then\n out = out & s & vbCrLf\n End If\n Wend\n Close #Nb\n If StartLine >= count Then\n MsgBox \"The file contains only \" & count & \" lines\"\n ElseIf StartLine + NumberOfLines > count Then\n MsgBox \"You only can remove \" & count - StartLine & \" lines\"\n Else\n Nb = FreeFile\n Open StrFile For Output As #Nb\n Print #Nb, out\n Close #Nb\n End If\nEnd Sub\n","language":"VBA"},{"code":"Option Explicit\n\nSub Main()\n 'See Output First call\n OtherWay \"C:\\Users\\\" & Environ(\"username\") & \"\\Desktop\\foobar.txt\", 11, 5\n 'See Output Second call\n OtherWay \"C:\\Users\\\" & Environ(\"username\") & \"\\Desktop\\foobar.txt\", 8, 5\n 'See Output Third call\n OtherWay \"C:\\Users\\\" & Environ(\"username\") & \"\\Desktop\\foobar.txt\", 3, 5\nEnd Sub\n\nPrivate Sub OtherWay(StrFile As String, StartLine As Long, NumberOfLines As Long)\nDim Nb As Integer, s As String, arr, i As Long, out() As String, j As Long\n Nb = FreeFile\n Open StrFile For Input As #Nb\n s = Input(LOF(1), #Nb)\n Close #Nb\n arr = Split(s, Chr(13))\n If StartLine >= UBound(arr) + 1 Then\n MsgBox \"First call : \" & vbCrLf & \" The file contains only \" & UBound(arr) + 1 & \" lines\"\n ElseIf StartLine + NumberOfLines > UBound(arr) + 1 Then\n MsgBox \"Second call : \" & vbCrLf & \" You only can remove \" & UBound(arr) + 1 - StartLine & \" lines\"\n Else\n For i = LBound(arr) To UBound(arr)\n If i < StartLine - 1 Or i >= StartLine + NumberOfLines - 1 Then\n ReDim Preserve out(j)\n out(j) = arr(i)\n j = j + 1\n End If\n Next i\n Nb = FreeFile\n Open StrFile For Output As #Nb\n Print #Nb, Join(out, Chr(13))\n Close #Nb\n End If\nEnd Sub\n","language":"VBA"},{"code":"Sub remove_lines(filepath,start,number)\n\tSet objFSO = CreateObject(\"Scripting.FileSystemObject\")\n\tSet InFile = objFSO.OpenTextFile(filepath,1,False)\n\tline_count = 1\n\tdiscard_count = 1\n\tout_txt = \"\"\n\tDo Until InFile.AtEndOfStream\n\t\tline = InFile.ReadLine\n\t\tIf line_count <> start Then\n\t\t\tIf InFile.AtEndOfStream = False Then\n\t\t\t\tout_txt = out_txt & line & vbCrLf\n\t\t\tElse\n\t\t\t\tout_txt = out_txt & line\n\t\t\tEnd If\n\t\t\tline_count = line_count + 1\n\t\tElse\n\t\t\tDo Until discard_count = number\n\t\t\t\tInFile.SkipLine\n\t\t\t\tdiscard_count = discard_count + 1\n\t\t\tLoop\n\t\tline_count = line_count + 1\n\t\tEnd If\n\tLoop\n\tInFile.Close\n\tSet OutFile = objFSO.OpenTextFile(filepath,2,False)\n\tOutFile.Write(out_txt)\n\tOutFile.Close\n\tSet objFSO = Nothing\nEnd Sub\n\nCall remove_lines(\"C:\\Test.txt\",3,4)\n","language":"VBScript"},{"code":"import \"os\" for Platform\nimport \"io\" for File\n\nvar removeLines = Fn.new { |fileName, startLine, numLines|\n if (fileName == \"\" || startLine < 1 || numLines < 1) Fiber.abort(\"Invalid argument(s).\")\n if (!File.exists(fileName)) Fiber.abort(\"Can't find %(fileName).\")\n var text = File.read(fileName)\n System.print(\"Contents of %(fileName) before removal:\\n%(text)\")\n var sep = Platform.isWindows ? \"\\r\\n\" : \"\\n\"\n var lines = text.split(sep)\n var size = lines.count\n if (startLine > size) {\n System.print(\"The starting line is beyond the length of the file.\")\n return\n }\n var n = numLines\n if (startLine + numLines - 1 > size) {\n System.print(\"Attempting to remove some lines which are beyond the end of the file.\")\n n = size - startLine + 1\n }\n lines = lines.take(startLine - 1).toList + lines.skip(startLine + n - 1).toList\n text = lines.join(sep)\n File.create(fileName) { |file| // effectively overwrites the file\n file.writeBytes(text)\n }\n System.print(\"Contents of %(fileName) after removal of %(numLines) lines starting from line %(startLine):\")\n System.print(File.read(fileName))\n}\n\nremoveLines.call(\"foobar.txt\", 2, 3)\n","language":"Wren"},{"code":"def LF=$0A, EOF=$1A;\n\nproc EatLine; \\Read and discard a text line from input file\nint Ch;\n[repeat Ch:= ChIn(3);\n if Ch = EOF then\n [Text(0, \"Attempted to remove a line beyond EOF\"); exit];\nuntil Ch = LF;\n];\n\nproc CopyLine; \\Read and write a text line\nint Ch;\n[repeat Ch:= ChIn(3);\n if Ch = EOF then\n [Text(0, \"Attempted to copy a line beyond EOF\"); exit];\n ChOut(3, Ch);\nuntil Ch = LF;\n];\n\nproc RemoveLines(FileName, StartLine, NumLines);\nint FileName, StartLine, NumLines;\nint N, Ch, IH, OH;\n[IH:= FOpen(FileName, 0);\nFSet(IH, ^i); \\open specified file for input\nOpenI(3);\n\nOH:= FOpen(\"file.tmp\", 1);\nFSet(OH, ^o); \\open temporary file for output\nOpenO(3);\n\nfor N:= 1 to StartLine-1 do CopyLine; \\copy lines up to start of Start line\nfor N:= 1 to NumLines do EatLine; \\discard NumLines\nloop [Ch:= ChIn(3); \\copy remainder of input file\n if Ch = EOF then quit;\n ChOut(3, Ch);\n ];\nClose(3);\nFClose(OH); FClose(IH);\n\nOH:= FOpen(\"foobar.txt\", 1);\nFSet(OH, ^o); \\open file for output\nOpenO(3);\n\nIH:= FOpen(\"file.tmp\", 0);\nFSet(IH, ^i); \\open temp file for input\nOpenI(3);\n\nloop [Ch:= ChIn(3); \\copy file\n if Ch = EOF then quit;\n ChOut(3, Ch);\n ];\nClose(3);\n];\n\nRemoveLines(\"foobar.txt\", 1, 2)\n]\n","language":"XPL0"},{"code":"fcn deleteLinesM(fname, start,num){\n blob:=File(fname).read(); // file to memory\n n:=blob.seek(Void,start-1); // seek to line and remember it\n blob.del(n,blob.seek(Void,num)-n);\n\n File.stdout.write(blob);\n}\ndeleteLinesM(\"nn.zkl\", 2,5);\n","language":"Zkl"},{"code":"fcn deleteLinesL(fname, start,num){\n if (start < 1) throw(Exception.ValueError);\n f:=File(fname);\n do(start-1) { File.stdout.write(f.readln()) }\n do(num) { f.readln(); }\n f.pump(File.stdout.write);\n}\ndeleteLinesL(\"nn.zkl\", 2,5);\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- File handling\\nfrom: http://rosettacode.org/wiki/Remove_lines_from_a_file\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nRemove a specific line or a number of lines from a file. \\n\\nThis should be implemented as a routine that takes three parameters (filename, starting line, and the number of lines to be removed). \\n\\nFor the purpose of this task, line numbers and the number of lines start at one, so to remove the first two lines from the file <tt>foobar.txt</tt>, the parameters should be: <tt>foobar.txt</tt>, <tt>1</tt>, <tt>2</tt>\\n\\nEmpty lines are considered and should still be counted, and if the specified line is empty, it should still be removed. \\n\\nAn appropriate message should appear if an attempt is made to remove lines beyond the end of the file.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \":start:\\nV l = File(:argv[1]).read_lines()\\nl.del(Int(:argv[2]) - 1 .+ Int(:argv[3]))\\nFile(:argv[1], WRITE).write(l.join(\\\"\\\\n\\\"))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Text_IO, Ada.Directories, Ada.Command_Line, Ada.IO_Exceptions;\\nuse Ada.Text_IO;\\n\\nprocedure Remove_Lines_From_File is\\n Temporary: constant String := \\\".tmp\\\";\\nbegin\\n if Ada.Command_Line.Argument_Count /= 3 then\\n raise Constraint_Error;\\n end if;\\n declare\\n Filename: String := Ada.Command_Line.Argument(1);\\n First: Positive := Integer'Value(Ada.Command_Line.Argument(2));\\n Last: Natural := Integer'Value(Ada.Command_Line.Argument(3)) + First - 1;\\n Input, Output: File_Type;\\n Line_Number: Positive := 1;\\n begin\\n Open(Input, In_File, Filename); -- open original file for reading\\n Create(Output, Out_File, Filename & Temporary); -- write to temp. file\\n while not End_Of_File(Input) loop\\n declare\\n Line: String := Get_Line(Input);\\n begin\\n if Line_Number < First or else Line_Number > Last then\\n Put_Line(Output, Line);\\n end if;\\n end;\\n Line_Number := Line_Number + 1;\\n end loop;\\n Close(Input);\\n Close(Output);\\n Ada.Directories.Rename(Old_Name => Filename & Temporary,\\n New_Name => Filename);\\n end;\\nexception\\n when Constraint_Error | Ada.IO_Exceptions.Name_Error =>\\n Put_Line(\\\"usage: \\\" & Ada.Command_Line.Command_Name &\\n \\\" <filename> <first> <length>\\\");\\n Put_Line(\\\" opens <filename> for reading and \\\" &\\n \\\"<filename>\\\" & Temporary & \\\" for temporary writing\\\");\\n Put_Line(\\\" requires first > 0, length >= 0\\\");\\nend Remove_Lines_From_File;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# removes the specified number of lines from a file, starting at start line (numbered from 1) #\\n# returns TRUE if successful, FALSE otherwise #\\nPROC remove lines = ( STRING file name, INT start line, INT number of lines )BOOL:\\n IF number of lines < 0 OR start line < 1\\n THEN\\n # invalid parameters #\\n print( ( \\\"number of lines must be >= 0 and start line must be >= 1\\\", newline ) );\\n FALSE\\n ELIF FILE temp file;\\n create( temp file, stand back channel ) /= 0\\n THEN\\n # unable to create a temporary output file #\\n print( ( \\\"Unable to create temporary file\\\", newline ) );\\n FALSE\\n ELIF NOT reset possible( temp file )\\n THEN\\n # rewinding the temporary file is not possible #\\n # we would have to get its name ( with \\\"idf( temp file )\\\", close it and re-open it #\\n print( ( \\\"Temp file is not rewindable\\\", newline ) );\\n FALSE\\n ELIF FILE input file;\\n open( input file, file name, stand in channel ) /= 0\\n THEN\\n # failed to open the file #\\n print( ( \\\"Unable to open \\\"\\\"\\\" + file name + \\\"\\\"\\\"\\\", newline ) );\\n FALSE\\n ELSE\\n # files opened OK #\\n BOOL at eof := FALSE;\\n # set the EOF handler for the original file #\\n on logical file end( input file\\n , ( REF FILE f )BOOL:\\n BEGIN\\n # note that we reached EOF on the latest read #\\n at eof := TRUE;\\n # return TRUE so processing can continue #\\n TRUE\\n END\\n );\\n # copy the input file to the temp file #\\n WHILE STRING line;\\n get( input file, ( line, newline ) );\\n NOT at eof\\n DO\\n put( temp file, ( line, newline ) )\\n OD;\\n # copy the temp file back to the input, removing the specified lines #\\n close( input file );\\n IF open( input file, file name, stand out channel ) /= 0\\n THEN\\n # failed to open the original file for output #\\n print( ( \\\"Unable to open \\\", file name, \\\" for output\\\", newline ) );\\n FALSE\\n ELSE\\n # opened OK - copy the temporary file #\\n reset( temp file ); # rewinds the input file #\\n at eof := FALSE;\\n on logical file end( temp file\\n , ( REF FILE f )BOOL:\\n BEGIN\\n # note that we reached EOF on the latest read #\\n at eof := TRUE;\\n # return TRUE so processing can continue #\\n TRUE\\n END\\n );\\n INT end line = ( start line - 1 ) + number of lines;\\n INT line number := 0;\\n WHILE STRING line;\\n get( temp file, ( line, newline ) );\\n NOT at eof\\n DO\\n # have another line #\\n line number +:= 1;\\n IF line number < start line OR line number > end line\\n THEN\\n put( input file, ( line, newline ) )\\n FI\\n OD;\\n # close the files #\\n close( input file );\\n scratch( temp file );\\n IF line number < start line\\n THEN\\n # didn't find the start line #\\n print( ( \\\"Specified start line (\\\", whole( start line, 0 ), \\\") not in \\\", file name, newline ) );\\n FALSE\\n ELIF line number < end line\\n THEN\\n # the ending line was not in the file #\\n print( ( \\\"Final omitted line not in the file \\\", file name, newline ) );\\n FALSE\\n ELSE\\n # successful operation #\\n TRUE\\n FI\\n FI\\n FI # remove lines # ;\\n\\n# test the line removal #\\nBEGIN\\n FILE t;\\n open( t, \\\"test.txt\\\", stand out channel );\\n print( ( \\\"Before...\\\", newline ) );\\n FOR i TO 10 DO\\n STRING line = whole( i, - ( ( i MOD 5 ) + 3 ) );\\n put( t, ( line, newline ) );\\n print( ( line, newline ) )\\n OD;\\n close( t );\\n remove lines( \\\"test.txt\\\", 2, 3 );\\n print( ( \\\"After...\\\", newline ) );\\n open( t, \\\"test.txt\\\", stand in channel );\\n FOR i TO 7 DO\\n STRING line;\\n get( t, ( line, newline ) );\\n print( ( line, newline ) )\\n OD;\\n close( t );\\n print( ( \\\"----\\\", newline ) )\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <hopper.h>\\n\\nmain:\\n .ctrlc\\n fd=0,fw=0\\n fopen(OPEN_READ,\\\"archivo.txt\\\")(fd)\\n if file error?\\n {\\\"no pude abrir el archivo de lectura: \\\"}\\n jsub(show error)\\n else\\n fcreate(CREATE_NORMAL,\\\"archivoTmp.txt\\\")(fw)\\n if file error?\\n {\\\"no pude crear el archivo para escritura: \\\"}\\n jsub(show error)\\n else\\n get arg number(2,desde), // from line\\n get arg number(3,hasta), // to line\\n\\n line read=0\\n while( not(feof(fd)))\\n fread line(1000)(fd), ++line read\\n if(not( {line read} between(desde, hasta)))\\n {\\\"\\\\n\\\"}cat,writeline(fw)\\n endif\\n wend\\n endif\\n endif\\n fclose(fw)\\n fclose(fd)\\n system(\\\"mv archivoTmp.txt archivo.txt\\\")\\nexit(0)\\n.locals\\nshow error:\\n file error, println\\nback\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"removeFileLines: function [filename, start, cnt][\\n previous: ø\\n ensure -> all? @[\\n exists? filename\\n previous: read.lines filename\\n start < size previous\\n (start + cnt) < size previous\\n ]\\n\\n final: previous\\\\[0..start-1] ++ previous\\\\[start+cnt..dec size previous]\\n write filename join.with:\\\"\\\\n\\\" final\\n]\\n\\nremoveFileLines \\\"myfile.txt\\\" 3 10\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"RemoveLines(filename, startingLine, numOfLines){\\n Loop, Read, %filename%\\n if ( A_Index < StartingLine )\\n || ( A_Index >= StartingLine + numOfLines )\\n ret .= \\\"`r`n\\\" . A_LoopReadLine\\n FileDelete, % FileName\\n FileAppend, % SubStr(ret, 3), % FileName\\n}\\n\\nSetWorkingDir, % A_ScriptDir\\nRemoveLines(\\\"test.txt\\\", 4, 3)\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f REMOVE_LINES_FROM_A_FILE.AWK\\n# show files after lines are removed:\\n# GAWK \\\"FNR==1{print(FILENAME)};{print(FNR,$0)}\\\" TEST1 TEST2 TEST3\\nBEGIN {\\n build_test_data()\\n remove_lines(\\\"TEST0\\\",1,1)\\n remove_lines(\\\"TEST1\\\",3,4)\\n remove_lines(\\\"TEST2\\\",9,3)\\n remove_lines(\\\"TEST3\\\",11,1)\\n exit(errors+0)\\n}\\nfunction build_test_data( fn,i,j) { # create 3 files with 10 lines each\\n for (i=1; i<=3; i++) {\\n fn = \\\"TEST\\\" i\\n for (j=1; j<=10; j++) {\\n printf(\\\"line %d\\\\n\\\",j) >fn\\n }\\n close(fn)\\n }\\n}\\nfunction remove_lines(fn,start,number_of_lines, arr,fnr,i,n,rec,stop) {\\n stop = start + number_of_lines - 1\\n while (getline rec <fn > 0) { # read file\\n fnr++\\n if (fnr < start || fnr > stop) {\\n arr[++n] = rec\\n }\\n }\\n close(fn)\\n if (fnr == 0) {\\n printf(\\\"error: file %s not found\\\\n\\\",fn)\\n errors = 1\\n return\\n }\\n for (i=1; i<=n; i++) { # write file\\n printf(\\\"%s\\\\n\\\",arr[i]) >fn\\n }\\n close(fn)\\n if (stop > fnr) {\\n printf(\\\"error: file %s trying to remove nonexistent lines\\\\n\\\",fn)\\n errors = 1\\n }\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' '\\n' Remove File Lines V1.1 '\\n' '\\n' Developed by A. David Garza Marín in VB-DOS for '\\n' RosettaCode. November 30, 2016. '\\n' '\\n' Date | Change '\\n'-------------------------------------------------- '\\n' 2016/11/30| Original version '\\n' 2016/12/30| Added functionality to read parameters'\\n' | from Command Line '\\n' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' '\\n\\n'OPTION _EXPLICIT ' For QB45\\nOPTION EXPLICIT ' For VBDOS, PDS 7.1\\n\\n' SUBs and FUNCTIONs\\nDECLARE FUNCTION DeleteLinesFromFile% (WhichFile AS STRING, Start AS LONG, HowMany AS LONG)\\nDECLARE FUNCTION FileExists% (WhichFile AS STRING)\\nDECLARE FUNCTION GetDummyFile$ (WhichFile AS STRING)\\nDECLARE FUNCTION getFileName$ (CommandString AS STRING)\\nDECLARE FUNCTION getHowManyLines& (CommandLine AS STRING)\\nDECLARE FUNCTION getStartPoint& (CommandLine AS STRING)\\nDECLARE FUNCTION ErrorMessage$ (WhichError AS INTEGER)\\nDECLARE FUNCTION CountLines& (WhichFile AS STRING)\\n\\n' Var\\nDIM iOk AS INTEGER, iErr AS INTEGER, lStart AS LONG, lHowMany AS LONG, lSize AS LONG\\nDIM sFile AS STRING, sCommand AS STRING\\n\\n' Const\\nCONST ProgramName = \\\"RemFLine (Remove File Lines) Enhanced V1.1\\\"\\n\\n' ----------------------------- Main program cycle --------------------------------\\nCLS\\nPRINT ProgramName\\nPRINT\\nPRINT \\\"This program will remove as many lines of a text file as you state, starting\\\"\\nPRINT \\\"with the line number you also state. If the starting line number is beyond\\\"\\nPRINT \\\"total lines in the text file stated, then the process will be aborted. If the\\\"\\nPRINT \\\"quantity of lines stated to be deleted is beyond the total lines in the text\\\"\\nPRINT \\\"file, the process also will be aborted. The program will give you a message\\\"\\nPRINT \\\"if everything ran ok or if any error happened. Includes a function to count\\\"\\nPRINT \\\"how many lines has the intended file.\\\"\\n' Verifies if parameters are specified\\nsCommand = COMMAND$\\nIF sCommand <> \\\"\\\" THEN\\n sFile = getFileName$(sCommand)\\n lSize = CountLines&(sFile)\\n lStart = getStartPoint&(sCommand) ' Defaults to 1\\n lHowMany = getHowManyLines&(sCommand) ' Defaults to 1\\nELSE\\n PRINT\\n INPUT \\\"Please, type the name of the file\\\"; sFile\\n sFile = LTRIM$(RTRIM$(sFile))\\n IF sFile <> \\\"\\\" THEN\\n lSize = CountLines&(sFile)\\n IF lSize > 0 THEN\\n PRINT \\\"Delete starting on which line (Default=1, Max=\\\"; lSize; \\\")\\\";\\n INPUT lStart\\n\\n IF lStart = 0 THEN lStart = 1\\n IF lStart < lSize THEN\\n PRINT \\\"How many lines do you want to remove (Default=1, Max=\\\"; (lSize - lStart) + 1; \\\")\\\";\\n INPUT lHowMany\\n IF lHowMany = 0 THEN lHowMany = 1\\n END IF\\n END IF\\n END IF\\nEND IF\\n\\nPRINT\\nPRINT \\\"Erasing \\\"; lHowMany; \\\"lines from \\\"; sFile; \\\" starting on line\\\"; lStart; \\\".\\\"\\nIF lSize > 0 THEN\\n IF lHowMany + lStart <= lSize THEN\\n iOk = DeleteLinesFromFile%(sFile, lStart, lHowMany)\\n ELSEIF lHowMany + lStart > lSize THEN\\n iOk = 1\\n ELSEIF lStart > lSize THEN\\n iOk = 2\\n END IF\\nELSEIF lSize = -1 THEN\\n iOk = 3\\nEND IF\\n\\nIF lSize = -1 THEN\\n iOk = 3\\nELSEIF lSize = 0 THEN\\n iOk = 4 ' The file is not a text file\\nEND IF\\n\\nIF sFile = \\\"\\\" THEN\\n iOk = 5 ' Null file name not allowed\\nEND IF\\n\\nPRINT\\nPRINT ErrorMessage$(iOk)\\n'----------------End of Main program Cycle ----------------\\n\\nEND\\n\\nFileError:\\n iErr = ERR\\nRESUME NEXT\\n\\nFUNCTION CountLines& (WhichFile AS STRING)\\n ' Var\\n DIM iFile AS INTEGER\\n DIM l AS LONG, li AS LONG, j AS LONG, lFileSize AS LONG, lLines AS LONG\\n DIM sLine AS STRING, strR AS STRING\\n\\n ' This function will count how many lines has the file\\n IF FileExists%(WhichFile) THEN\\n strR = CHR$(13)\\n li = 1\\n iFile = FREEFILE\\n sLine = SPACE$(128)\\n lLines = 0\\n OPEN WhichFile FOR BINARY AS #iFile\\n lFileSize = LOF(iFile)\\n DO\\n IF (LOC(iFile) + LEN(sLine)) > lFileSize THEN\\n sLine = SPACE$(lFileSize - LOC(iFile))\\n END IF\\n IF LEN(sLine) > 0 THEN\\n GET #iFile, , sLine\\n GOSUB AnalizeLine\\n END IF\\n LOOP UNTIL LEN(sLine) < 128\\n CLOSE iFile\\n ELSE\\n lLines = -1\\n END IF\\n\\n CountLines& = lLines\\n\\nEXIT FUNCTION\\n\\nAnalizeLine:\\n li = 1\\n DO\\n l = INSTR(li, sLine, strR)\\n IF l > 0 THEN\\n lLines = lLines + 1\\n li = l + 1\\n END IF\\n LOOP UNTIL l = 0\\nRETURN\\nEND FUNCTION\\n\\nFUNCTION DeleteLinesFromFile% (WhichFile AS STRING, Start AS LONG, HowMany AS LONG)\\n ' Var\\n DIM lCount AS LONG, iFile AS INTEGER, iFile2 AS INTEGER, lhm AS LONG, iError AS INTEGER\\n DIM sLine AS STRING, sDummyFile AS STRING\\n\\n IF FileExists%(WhichFile) THEN\\n sDummyFile = GetDummyFile$(WhichFile)\\n\\n ' It is assumed a text file\\n iFile = FREEFILE\\n OPEN WhichFile FOR INPUT AS #iFile\\n\\n iFile2 = FREEFILE\\n OPEN sDummyFile FOR OUTPUT AS #iFile2\\n\\n lhm = 0\\n DO WHILE NOT EOF(iFile)\\n LINE INPUT #iFile, sLine\\n lCount = lCount + 1\\n IF lCount >= Start AND lhm < HowMany THEN\\n lhm = lhm + 1\\n ELSE\\n PRINT #iFile2, sLine\\n END IF\\n LOOP\\n\\n CLOSE iFile2, iFile\\n\\n ' Check if everything went ok or not\\n iError = 0\\n IF lCount < Start THEN\\n iError = 2 ' Full file is shorter than the start line stated,\\n ' process will be aborted.\\n ELSEIF lhm < HowMany THEN\\n iError = 1 ' File was shorter than lines requested to be removed,\\n ' process will be aborted.\\n END IF\\n\\n IF iError > 0 THEN\\n KILL sDummyFile ' Process aborted\\n ELSE\\n KILL WhichFile\\n NAME sDummyFile AS WhichFile\\n END IF\\n ELSE\\n iError = 3 ' The file doesn't exist. The process is aborted.\\n END IF\\n\\n DeleteLinesFromFile% = iError\\n\\nEND FUNCTION\\n\\nFUNCTION ErrorMessage$ (WhichError AS INTEGER)\\n ' Var\\n DIM sError AS STRING\\n\\n SELECT CASE WhichError\\n CASE 0: sError = \\\"Everything went Ok. Lines removed from file.\\\"\\n CASE 1: sError = \\\"File is shorter than the number of lines stated to remove. Process aborted.\\\"\\n CASE 2: sError = \\\"Whole file is shorter than the starting point stated. Process aborted.\\\"\\n CASE 3: sError = \\\"File doesn't exist. Process aborted.\\\"\\n CASE 4: sError = \\\"The file doesn't seem to be a text file. Process aborted.\\\"\\n CASE 5: sError = \\\"You need to provide a valid file name, please.\\\"\\n END SELECT\\n\\n ErrorMessage$ = sError\\nEND FUNCTION\\n\\nFUNCTION FileExists% (WhichFile AS STRING)\\n ' Var\\n DIM iFile AS INTEGER\\n DIM iItExists AS INTEGER\\n SHARED iErr AS INTEGER\\n\\n ON ERROR GOTO FileError\\n iFile = FREEFILE\\n iErr = 0\\n OPEN WhichFile FOR BINARY AS #iFile\\n IF iErr = 0 THEN\\n iItExists = LOF(iFile) > 0\\n CLOSE #iFile\\n\\n IF NOT iItExists THEN\\n KILL WhichFile\\n END IF\\n END IF\\n ON ERROR GOTO 0\\n FileExists% = iItExists\\n\\nEND FUNCTION\\n\\nFUNCTION GetDummyFile$ (WhichFile AS STRING)\\n ' Var\\n DIM i AS INTEGER, j AS INTEGER\\n\\n ' Gets the path specified in WhichFile\\n i = 1\\n DO\\n j = INSTR(i, WhichFile, \\\"\\\\\\\")\\n IF j > 0 THEN i = j + 1\\n LOOP UNTIL j = 0\\n\\n GetDummyFile$ = LEFT$(WhichFile, i - 1) + \\\"$dummyf$.tmp\\\"\\nEND FUNCTION\\n\\nFUNCTION getFileName$ (CommandString AS STRING)\\n ' Var\\n DIM i AS INTEGER\\n DIM sFileName AS STRING\\n\\n i = INSTR(CommandString, \\\",\\\")\\n IF i > 0 THEN\\n sFileName = LEFT$(CommandString, i - 1)\\n ELSEIF LEN(CommandString) > 0 THEN\\n sFileName = CommandString\\n END IF\\n\\n getFileName$ = sFileName\\nEND FUNCTION\\n\\nFUNCTION getHowManyLines& (CommandLine AS STRING)\\n ' Var\\n DIM i AS INTEGER, j AS INTEGER\\n DIM l AS LONG\\n\\n i = INSTR(CommandLine, \\\",\\\")\\n IF i > 0 THEN\\n j = INSTR(i + 1, CommandLine, \\\",\\\")\\n IF j = 0 THEN\\n l = 1\\n ELSE\\n l = CLNG(VAL(MID$(CommandLine, j + 1)))\\n END IF\\n END IF\\n\\n getHowManyLines& = l\\n\\nEND FUNCTION\\n\\nFUNCTION getStartPoint& (CommandLine AS STRING)\\n ' Var\\n DIM i AS INTEGER, j AS INTEGER\\n DIM l AS LONG\\n\\n i = INSTR(CommandLine, \\\",\\\")\\n IF i > 0 THEN\\n j = INSTR(i + 1, CommandLine, \\\",\\\")\\n IF j = 0 THEN j = LEN(CommandLine)\\n l = CLNG(VAL(MID$(CommandLine, i + 1, j - i)))\\n ELSE\\n i = 1\\n END IF\\n\\n getStartPoint& = l\\n\\nEND FUNCTION\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h> /* for atoi() and malloc() */\\n#include <string.h> /* for memmove() */\\n\\n/* Conveniently print to standard error and exit nonzero. */\\n#define ERROR(fmt, arg) return fprintf(stderr, fmt \\\"\\\\n\\\", arg)\\n\\nint main(int argc, char **argv)\\n{\\n FILE *fp;\\n char *buf;\\n size_t sz;\\n int start, count, lines = 1;\\n int dest = 0, src = 0, pos = -1;\\n\\n /* Initialization and sanity checks */\\n if (argc != 4)\\n ERROR(\\\"Usage: %s <file> <start> <count>\\\", argv[0]);\\n\\n if ((count = atoi(argv[3])) < 1) /* We're a no-op. */\\n return 0;\\n\\n if ((start = atoi(argv[2])) < 1)\\n ERROR(\\\"Error: <start> (%d) must be positive\\\", start);\\n\\n if ((fp = fopen(argv[1], \\\"r\\\")) == NULL)\\n ERROR(\\\"No such file: %s\\\", argv[1]);\\n\\n /* Determine filesize and allocate a buffer accordingly. */\\n fseek(fp, 0, SEEK_END);\\n sz = ftell(fp);\\n buf = malloc(sz + 1);\\n rewind(fp);\\n\\n /* Fill the buffer, count lines, and remember a few important offsets. */\\n while ((buf[++pos] = fgetc(fp)) != EOF) {\\n if (buf[pos] == '\\\\n') {\\n ++lines;\\n if (lines == start) dest = pos + 1;\\n if (lines == start + count) src = pos + 1;\\n }\\n }\\n\\n /* We've been asked to do something weird; clean up and bail. */\\n if (start + count > lines) {\\n free(buf);\\n fclose(fp);\\n ERROR(\\\"Error: invalid parameters for file with %d lines\\\", --lines);\\n }\\n\\n /* Overwrite the lines to be deleted with the survivors. */\\n memmove(buf + dest, buf + src, pos - src);\\n\\n /* Reopen the file and write back just enough of the buffer. */\\n freopen(argv[1], \\\"w\\\", fp);\\n fwrite(buf, pos - src + dest, 1, fp);\\n\\n free(buf);\\n fclose(fp);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <fstream>\\n#include <iostream>\\n#include <string>\\n#include <cstdlib>\\n#include <list>\\n\\nvoid deleteLines( const std::string & , int , int ) ;\\n\\nint main( int argc, char * argv[ ] ) {\\n if ( argc != 4 ) {\\n std::cerr << \\\"Error! Invoke with <deletelines filename startline skipnumber>!\\\\n\\\" ;\\n return 1 ;\\n }\\n std::string filename( argv[ 1 ] ) ;\\n int startfrom = atoi( argv[ 2 ] ) ;\\n int howmany = atoi( argv[ 3 ] ) ;\\n deleteLines ( filename , startfrom , howmany ) ;\\n return 0 ;\\n}\\n\\nvoid deleteLines( const std::string & filename , int start , int skip ) {\\n std::ifstream infile( filename.c_str( ) , std::ios::in ) ;\\n if ( infile.is_open( ) ) {\\n std::string line ;\\n std::list<std::string> filelines ;\\n while ( infile ) {\\n\\t getline( infile , line ) ;\\n\\t filelines.push_back( line ) ;\\n }\\n infile.close( ) ;\\n if ( start > filelines.size( ) ) {\\n\\t std::cerr << \\\"Error! Starting to delete lines past the end of the file!\\\\n\\\" ;\\n\\t return ;\\n }\\n if ( ( start + skip ) > filelines.size( ) ) {\\n\\t std::cerr << \\\"Error! Trying to delete lines past the end of the file!\\\\n\\\" ;\\n\\t return ;\\n }\\n std::list<std::string>::iterator deletebegin = filelines.begin( ) , deleteend ;\\n for ( int i = 1 ; i < start ; i++ )\\n\\t deletebegin++ ;\\n deleteend = deletebegin ;\\n for( int i = 0 ; i < skip ; i++ )\\n\\t deleteend++ ;\\n filelines.erase( deletebegin , deleteend ) ;\\n std::ofstream outfile( filename.c_str( ) , std::ios::out | std::ios::trunc ) ;\\n if ( outfile.is_open( ) ) {\\n\\t for ( std::list<std::string>::const_iterator sli = filelines.begin( ) ;\\n\\t sli != filelines.end( ) ; sli++ )\\n\\t outfile << *sli << \\\"\\\\n\\\" ;\\n }\\n outfile.close( ) ;\\n }\\n else {\\n std::cerr << \\\"Error! Could not find file \\\" << filename << \\\" !\\\\n\\\" ;\\n return ;\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.IO;\\nusing System.Linq;\\n\\npublic class Rosetta\\n{\\n public static void Main() => RemoveLines(\\\"foobar.txt\\\", start: 1, count: 2);\\n\\n static void RemoveLines(string filename, int start, int count = 1) =>\\n File.WriteAllLines(filename, File.ReadAllLines(filename)\\n .Where((line, index) => index < start - 1 || index >= start + count - 1));\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(require '[clojure.java.io :as jio]\\n '[clojure.string :as str])\\n\\n(defn remove-lines1 [filepath start nskip]\\n (let [lines (str/split-lines (slurp filepath))\\n new-lines (concat (take (dec start) lines)\\n (drop (+ (dec start) nskip) lines))\\n diff (- (count lines) (count new-lines))]\\n (when-not (zero? diff)\\n (println \\\"WARN: You are trying to remove lines beyond EOF\\\"))\\n (with-open [wrt (jio/writer (str filepath \\\".tmp\\\"))]\\n (.write wrt (str/join \\\"\\\\n\\\" new-lines)))\\n (.renameTo (jio/file (str filepath \\\".tmp\\\")) (jio/file filepath))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(require '[clojure.java.io :as jio]\\n '[clojure.string :as str])\\n\\n(defn remove-lines2 [filepath start nskip]\\n (with-open [rdr (jio/reader filepath)]\\n (with-open [wrt (jio/writer (str filepath \\\".tmp\\\"))]\\n (loop [s start n nskip]\\n (if-let [line (.readLine rdr)]\\n (cond\\n (> s 1) (do (doto wrt (.write line) (.newLine))\\n (recur (dec s) n))\\n (pos? n) (recur s (dec n))\\n :else (do (doto wrt (.write line) (.newLine))\\n (recur s n)))\\n (when (pos? n)\\n (println \\\"WARN: You are trying to remove lines beyond EOF\\\"))))))\\n (.renameTo (jio/file (str filepath \\\".tmp\\\")) (jio/file filepath)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defun remove-lines (filename start num)\\n (let ((tmp-filename (concatenate 'string filename \\\".tmp\\\"))\\n\\t(lines-omitted 0))\\n ;; Open a temp file to write the result to\\n (with-open-file (out tmp-filename\\n\\t\\t\\t :direction :output\\n\\t\\t\\t :if-exists :supersede\\n\\t\\t\\t :if-does-not-exist :create)\\n ;; Open the original file for reading\\n (with-open-file (in filename)\\n\\t(loop\\n\\t for line = (read-line in nil 'eof)\\n\\t for i from 1\\n\\t until (eql line 'eof)\\n\\t ;; Write the line to temp file if it is not in the omitted range\\n\\t do (if (or (< i start)\\n\\t\\t (>= i (+ start num)))\\n\\t\\t(write-line line out)\\n\\t\\t(setf lines-omitted (1+ lines-omitted))))))\\n ;; Swap in the temp file for the original\\n (delete-file filename)\\n (rename-file tmp-filename filename)\\n ;; Warn if line removal went past the end of the file\\n (when (< lines-omitted num)\\n (warn \\\"End of file reached with only ~d lines removed.\\\" lines-omitted))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.file, std.string;\\n\\nvoid main() {\\n deleteLines(\\\"deleteline_test.txt\\\", 1, 2);\\n}\\n\\nvoid deleteLines(string name, int start, int num)\\nin {\\n assert(start > 0, \\\"Line counting must start at 1\\\");\\n} body {\\n start--;\\n\\n if (!exists(name) || !isFile(name))\\n throw new FileException(\\\"File not found\\\");\\n\\n auto lines = readText(name).splitLines();\\n if (lines.length < start + num)\\n throw new Exception(\\\"Can't delete lines past the end of file!\\\");\\n\\n auto f = File(name, \\\"w\\\");\\n foreach (int i, line; lines) {\\n if (start > i || i >= start + num)\\n f.writeln(line);\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Remove_lines_from_a_file_using_TStringDynArray;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils,\\n System.IoUtils;\\n\\n// zero started Index\\nprocedure RemoveLines(FileName: TFileName; Index, Line_count: Cardinal);\\nbegin\\n if not FileExists(FileName) then\\n exit;\\n\\n var lines := TFile.ReadAllLines(FileName);\\n\\n Delete(lines, Index, Line_count);\\n TFile.WriteAllLines(FileName, lines);\\nend;\\n\\nbegin\\n // Remove 2th & 3td line of file\\n RemoveLines('input.txt', 1, 2);\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"program Remove_lines_from_a_file_using_TStringList;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils,\\n System.Classes;\\n\\n// zero started Index\\nprocedure RemoveLines(FileName: TFileName; Index, Line_count: Cardinal);\\nbegin\\n if not FileExists(FileName) then\\n exit;\\n\\n with TStringList.Create do\\n begin\\n LoadFromFile(FileName);\\n for var _ := 1 to Line_count do\\n begin\\n if Index >= Count then\\n Break;\\n Delete(Index);\\n end;\\n SaveToFile(FileName);\\n Free;\\n end;\\nend;\\n\\nbegin\\n // Remove 2th & 3td line of file\\n RemoveLines('input.txt', 1, 2);\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"IMPORT STD;\\nRemoveLines(logicalfile, startline, numlines) := FUNCTIONMACRO\\n EndLine := startline + numlines - 1;\\n RecCnt := COUNT(logicalfile);\\n Res := logicalfile[1..startline-1] + logicalfile[endline+1..];\\n RETURN WHEN(IF(RecCnt < EndLine,logicalfile,Res),\\n IF(RecCnt < EndLine,STD.System.Log.addWorkunitWarning('Attempted removal past end of file-removal ignored')));\\nENDMACRO;\\n\",\n \"language\": \"ECL\"\n },\n {\n \"code\": \"MyFile := DATASET(100,TRANSFORM({UNSIGNED1 RecID},SELF.RecID := COUNTER));\\nRemoveLines(MyFile,3,10);\\n\",\n \"language\": \"ECL\"\n },\n {\n \"code\": \"defmodule RC do\\n def remove_lines(filename, start, number) do\\n File.open!(filename, [:read], fn file ->\\n remove_lines(file, start, number, IO.read(file, :line))\\n end)\\n end\\n\\n defp remove_lines(_file, 0, 0, :eof), do: :ok\\n defp remove_lines(_file, _, _, :eof) do\\n IO.puts(:stderr, \\\"Warning: End of file encountered before all lines removed\\\")\\n end\\n defp remove_lines(file, 0, 0, line) do\\n IO.write line\\n remove_lines(file, 0, 0, IO.read(file, :line))\\n end\\n defp remove_lines(file, 0, number, _line) do\\n remove_lines(file, 0, number-1, IO.read(file, :line))\\n end\\n defp remove_lines(file, start, number, line) do\\n IO.write line\\n remove_lines(file, start-1, number, IO.read(file, :line))\\n end\\nend\\n\\n[filename, start, number] = System.argv\\nIO.puts \\\"before:\\\"\\nIO.puts File.read!(filename)\\nIO.puts \\\"after:\\\"\\nRC.remove_lines(filename, String.to_integer(start), String.to_integer(number)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-module( remove_lines ).\\n\\n-export( [from_file/3, task/0] ).\\n\\nfrom_file( Name, Start, How_many ) ->\\n\\t{Name, {ok, Binary}} = {Name, file:read_file( Name )},\\n\\tLines = compensate_for_last_newline( lists:reverse([X || X <- binary:split( Binary, <<\\\"\\\\n\\\">>, [global] )]) ),\\n\\t{Message, Keep_lines} = keep_lines( Start - 1, How_many, Lines, erlang:length(Lines) - 1 ),\\n\\tok = file:write_file( Name, [binary:list_to_bin([X, <<\\\"\\\\n\\\">>]) || X <- Keep_lines] ),\\n\\tio:fwrite( \\\"~s~n\\\", [Message] ).\\n\\ntask() ->\\n\\tfile:copy( \\\"priv/foobar.txt\\\", \\\"foobar.txt\\\" ),\\n\\tfrom_file( \\\"foobar.txt\\\", 1, 2 ).\\n\\n\\n\\ncompensate_for_last_newline( [<<>> | T] ) -> lists:reverse( T );\\ncompensate_for_last_newline( Reversed_lines ) -> lists:reverse( Reversed_lines ).\\n\\nkeep_lines( Start, _How_many, Lines, Available ) when Start > Available ->\\n\\t{\\\"Start > avaliable. Nothing removed.\\\", Lines};\\nkeep_lines( Start, How_many, Lines, Available ) when Start + How_many > Available ->\\n\\tMessage = lists:flatten( io_lib:format(\\\"Start + How_many > avaliable. Only ~p removed.\\\", [(Start + How_many) - Available]) ),\\n\\t{Keeps, _Removes} = lists:split( Start, Lines ),\\n\\t{Message, Keeps};\\nkeep_lines( Start, How_many, Lines, _Available ) ->\\n\\t{Keeps, Removes} = lists:split( Start, Lines ),\\n\\t{\\\"ok\\\", Keeps ++ lists:nthtail( How_many, Removes )}.\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"open System\\nopen System.IO\\n\\nlet cutOut (arr : 'a[]) from n = // confine syntax highlighting confusion'\\n let slicer = fun i -> if i < from || (from + n) <= i then Some(arr.[i-1]) else None\\n ((Array.choose slicer [| 1 .. arr.Length |]), from + n - arr.Length > 1)\\n\\n[<EntryPoint>]\\nlet main argv =\\n let nums = Array.choose (System.Int32.TryParse >> function | true, v -> Some v | false, _ -> None) argv.[1..2]\\n let lines = File.ReadAllLines(argv.[0])\\n let (sliced, tooShort) = cutOut lines nums.[0] nums.[1]\\n if tooShort then Console.Error.WriteLine \\\"Not enough lines\\\"\\n File.WriteAllLines(argv.[0], sliced)\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"D:\\\\Projects\\\\Rosetta>for /l %i in (1,1,5) do @echo %i >> foo\\n\\nD:\\\\Projects\\\\Rosetta>Remove_lines_from_a_file.exe foo 1 2\\n\\nD:\\\\Projects\\\\Rosetta>type foo\\n3\\n4\\n5\\n\\nD:\\\\Projects\\\\Rosetta>\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \" SUBROUTINE CROAK(GASP)\\t!Something bad has happened.\\n CHARACTER*(*) GASP\\t!As noted.\\n WRITE (6,*) \\\"Oh dear. \\\",GASP\\t!So, gasp away.\\n STOP \\\"++ungood.\\\"\\t!Farewell, cruel world.\\n END\\t\\t\\t!No return from this.\\n\\n SUBROUTINE FILEHACK(FNAME,IST,N)\\n CHARACTER*(*) FNAME\\t!Name for the file.\\n INTEGER IST\\t\\t!First record to be omitted.\\n INTEGER N\\t\\t!Number of records to be omitted.\\n INTEGER ENUFF,L\\t\\t!Some lengths.\\n PARAMETER (ENUFF = 66666)!Surely?\\n CHARACTER*(ENUFF) ALINE\\t!But not in general...\\n INTEGER NREC\\t\\t!A counter.\\n INTEGER F,T\\t\\t!Mnemonics for file unit numbers.\\n PARAMETER (F=66,T=67)\\t!These should do.\\n LOGICAL EXIST\\n IF (FNAME.EQ.\\\"\\\") CALL CROAK(\\\"Blank file name!\\\")\\n IF (IST.LE.0) CALL CROAK(\\\"First record must be positive!\\\")\\n IF (N.LE.0) CALL CROAK(\\\"Remove count must be positive!\\\")\\n INQUIRE(FILE = FNAME, EXIST = EXIST)\\t!This mishap is frequent, so attend to it.\\n IF (.NOT.EXIST) CALL CROAK(\\\"Can't find a file called \\\"//FNAME)\\t!Tough love.\\n OPEN (F,FILE=FNAME,STATUS=\\\"OLD\\\",ACTION=\\\"READ\\\",FORM=\\\"FORMATTED\\\")\\t!Grab the source file.\\n OPEN (T,STATUS=\\\"SCRATCH\\\",FORM=\\\"FORMATTED\\\")\\t!Request a temporary file.\\n NREC = 0\\t\\t!Number of records read so far.\\nCopy the desired records to a temporary file.\\n 10 READ (F,11,END = 20) L,ALINE(1:MIN(L,ENUFF))\\t!Minimal protection.\\n 11 FORMAT (Q,A)\\t\\t!Obviously, Q = # of characters to come, A = their format.\\n IF (L.GT.ENUFF) CALL CROAK(\\\"Ow! Lengthy record!!\\\")\\n NREC = NREC + 1\\t\\t!If we're here. we've read a record.\\n IF (NREC.LT.IST .OR. NREC.GE.IST + N) WRITE (T,12) ALINE(1:L)\\t!A desired record?\\n 12 FORMAT (A)\\t\\t!No character count is explicitly specified.\\n GO TO 10\\t\\t!Keep on thumping.\\nConvert from input to output...\\n 20 IF (NREC.LT.IST + N) CALL CROAK(\\\"Insufficient records!\\\")\\t!Finished ignoring records?\\n REWIND T\\t\\t!Not CLOSE! That would discard the file!\\n CLOSE(F)\\t\\t!The source file still exists.\\n OPEN (F,FILE=FNAME,FORM=\\\"FORMATTED\\\",\\t!But,\\n 1 ACTION=\\\"WRITE\\\",STATUS=\\\"REPLACE\\\")\\t!This dooms it!\\nCopy from the temporary file.\\n 21 READ (T,11,END = 30) L,ALINE(1:L)\\t!All records are not longer than ALINE.\\n WRITE (F,12) ALINE(1:L)\\t\\t\\t!Out it goes.\\n GO TO 21\\t\\t!Keep on thumping.\\nCompleted.\\n 30 CLOSE(T)\\t\\t!Abandon the temporary file.\\n CLOSE(F)\\t\\t!Finished with the source file.\\n END\\t\\t!Done.\\n\\n PROGRAM CHOPPER\\n CALL FILEHACK(\\\"foobar.txt\\\",1,2)\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" CHARACTER*42 FUNCTION ERRORWORDS(IT)\\t!Look for an explanation. One day, the system may offer coherent messages.\\nCurious collection of encountered codes. Will they differ on other systems?\\nCompaq's compiler was taken over by unintel; http://software.intel.com/sites/products/documentation/hpc/compilerpro/en-us/fortran/lin/compiler_f/bldaps_for/common/bldaps_rterrs.htm\\ncontains a schedule of error numbers that matched those I'd found for Compaq, and so some assumptions are added.\\nCopying all (hundreds!) is excessive; these seem possible for the usage so far made of error diversion.\\nCompaq's compiler interface (\\\"visual\\\" blah) has a help offering, which can provide error code information.\\nCompaq messages also appear in http://cens.ioc.ee/local/man/CompaqCompilers/cf/dfuum028.htm#tab_runtime_errors\\nCombines IOSTAT codes (file open, read etc) with STAT codes (allocate/deallocate) as their numbers are distinct.\\nCompleteness and context remains a problem. Excess brevity means cause and effect can be confused.\\n INTEGER IT\\t\\t\\t!The error code in question.\\n INTEGER LASTKNOWN \\t\\t!Some codes I know about.\\n PARAMETER (LASTKNOWN = 26)\\t!But only a few, discovered by experiment and mishap.\\n TYPE HINT\\t\\t\\t!For them, I can supply a table.\\n INTEGER\\tCODE\\t\\t!The code number. (But, different systems..??)\\n CHARACTER*42\\tEXPLICATION\\t!An explanation. Will it be te answer?\\n END TYPE HINT\\t\\t\\t!Simple enough.\\n TYPE(HINT) ERROR(LASTKNOWN)\\t!So, let's have a collection.\\n PARAMETER (ERROR = (/\\t\\t!With these values.\\n 1 HINT(-1,\\\"End-of-file at the start of reading!\\\"),\\t!From examples supplied with the Compaq compiler involving IOSTAT.\\n 2 HINT( 0,\\\"No worries.\\\"),\\t\\t\\t!Apparently the only standard value.\\n 3 HINT( 9,\\\"Permissions - read only?\\\"),\\n 4 HINT(10,\\\"File already exists!\\\"),\\n 5 HINT(17,\\\"Syntax error in NameList input.\\\"),\\n 6 HINT(18,\\\"Too many values for the recipient.\\\"),\\n 7 HINT(19,\\\"Invalid naming of a variable.\\\"),\\n 8 HINT(24,\\\"Surprise end-of-file during read!\\\"),\\t!From example source.\\n 9 HINT(25,\\\"Invalid record number!\\\"),\\n o HINT(29,\\\"File name not found.\\\"),\\n 1 HINT(30,\\\"Unavailable - exclusive use?\\\"),\\n 2 HINT(32,\\\"Invalid fileunit number!\\\"),\\n 3 HINT(35,\\\"'Binary' form usage is rejected.\\\"),\\t!From example source.\\n 4 HINT(36,\\\"Record number for a non-existing record!\\\"),\\n 5 HINT(37,\\\"No record length has been specified.\\\"),\\n 6 HINT(38,\\\"I/O error during a write!\\\"),\\n 7 HINT(39,\\\"I/O error during a read!\\\"),\\n 8 HINT(41,\\\"Insufficient memory available!\\\"),\\n 9 HINT(43,\\\"Malformed file name.\\\"),\\n o HINT(47,\\\"Attempting a write, but read-only is set.\\\"),\\n 1 HINT(66,\\\"Output overflows single record size.\\\"),\\t!This one from experience.\\n 2 HINT(67,\\\"Input demand exceeds single record size.\\\"),\\t!These two are for unformatted I/O.\\n 3 HINT(151,\\\"Can't allocate: already allocated!\\\"),\\t!These different numbers are for memory allocation failures.\\n 4 HINT(153,\\\"Can't deallocate: not allocated!\\\"),\\n 5 HINT(173,\\\"The fingered item was not allocated!\\\"),\\t!Such as an ordinary array that was not allocated.\\n 6 HINT(179,\\\"Size exceeds addressable memory!\\\")/))\\n INTEGER I\\t\\t!A stepper.\\n DO I = LASTKNOWN,1,-1\\t!So, step through the known codes.\\n IF (IT .EQ. ERROR(I).CODE) GO TO 1\\t!This one?\\n END DO\\t\\t\\t!On to the next.\\n 1 IF (I.LE.0) THEN\\t!Fail with I = 0.\\n ERRORWORDS = I8FMT(IT)//\\\" is a novel code!\\\"\\t!Reveal the mysterious number.\\n ELSE\\t\\t\\t!But otherwise, it is found.\\n ERRORWORDS = ERROR(I).EXPLICATION\\t!And these words might even apply.\\n END IF\\t\\t\\t!But on all systems?\\n END FUNCTION ERRORWORDS\\t!Hopefully, helpful.\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nSub removeLines(fileName As String, startLine As UInteger, numLines As UInteger)\\n If startLine = 0 Then\\n Print \\\"Starting line must be more than zero\\\"\\n Return\\n End If\\n If numLines = 0 Then\\n Print \\\"No lines to remove\\\"\\n Return\\n End If\\n Dim fileNum As Integer = FreeFile\\n Open fileName For Input As #fileNum\\n If err > 0 Then\\n Print \\\"File could not be opened\\\"\\n Return\\n End If\\n Dim tempFileName As String = \\\"temp_\\\" + fileName\\n Dim fileNum2 As Integer = FreeFile\\n Open tempFileName For Output As #fileNum2\\n Dim count As Integer = 0\\n Dim ln As String\\n Dim endLine As UInteger = startLine + numLines - 1\\n While Not Eof(fileNum)\\n Input #fileNum, ln\\n count += 1\\n If count >= startLine AndAlso count <= endLine Then Continue While\\n Print #fileNum2, ln\\n Wend\\n\\n If count < startLine Then\\n Print \\\"No lines were removed as starting line was beyond end of file\\\"\\n Print\\n ElseIf count < endLine Then\\n Print \\\"Only \\\"; count - startLine + 1; \\\" line(s) were removed as not enough lines to remove more\\\"\\n Print\\n Else\\n Print Str(numLines); \\\" line(s) were removed\\\"\\n Print\\n End If\\n Close #fileNum : Close #fileNum2\\n Kill(fileName)\\n Name (tempFileName, fileName)\\nEnd Sub\\n\\nremoveLines(\\\"foobar.txt\\\", 2, 2)\\nremoveLines(\\\"foobar.txt\\\", 5, 2)\\nremoveLines(\\\"foobar.txt\\\", 3, 4)\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"removeLines[filename, start, len] :=\\n{\\n lines = array[lines[filenameToURL[filename]]]\\n modified = lines.removeLen[start-1, len]\\n if modified != len\\n println[\\\"Was only able to remove $modified lines due to end-of-file.\\\"]\\n\\n w = new Writer[filename]\\n for line = lines\\n w.println[line]\\n w.close[]\\n}\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"sNewFile As String 'Global string for the 'New file' details\\n\\nPublic Sub Main()\\nDim sFileName As String = User.Home &/ \\\"foobar.txt\\\" 'File name\\n\\nsNewFile = DeleteLines(sFileName, 1, 2) 'Send the details to the DeleteLine routine 'The parameters should be: foobar.txt, 1, 2'\\nPrint \\\"New file: -\\\" & gb.NewLine & sNewFile 'Print details of the changed file\\nFile.Save(sFileName, sNewFile) 'Save the file with the original name\\n\\nEnd\\n\\nPublic Sub DeleteLines(sFile As String, siStart As Short, siNum As Short) As String 'DeleteLines routine\\nDim sData As New String[] 'To store the existing file data\\nDim siCount As Short 'Counter\\nDim sTemp, sDel As String 'String variables\\n\\nFor Each sTemp In Split(File.Load(sFile), gb.NewLine) 'Load the file, split the lines by NewLine\\n sData.Add(sTemp) 'Add to sData\\nNext\\n\\nPrint \\\"Original file: -\\\" 'Print Title\\n\\nIf siStart + siNum > sData.max Then 'Check an attempt is made to remove lines beyond the end of the file\\n Print \\\"Not enough lines in file to carry out request\\\" 'An appropriate message should appear if so\\n Return \\\"\\\" 'Return nothing\\nEndif\\n\\nDec siStart 'For the purpose of this task, line numbers start at one (Program starts at 0)\\n\\nFor siCount = siStart To (siStart + siNum) - 1 'Loop through the lines to be deleted\\n sDel &= Str(siCount) & \\\" \\\" 'Add then to sDel\\nNext\\n\\nsiCount = -1 'Reset counter\\n\\nFor Each sTemp In sData 'For each line in the file..\\n Inc siCount 'Increase counter\\n Print sTemp 'Print the line\\n If InStr(sDel, Str(siCount) & \\\" \\\") Then Continue 'If the line number is listed in sDel then jump to the end of the loop\\n sNewFile &= sTemp & gb.NewLine 'Add the lines not to be removed into sNewFile\\nNext\\n\\nReturn sNewFile 'Return the details\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bytes\\\"\\n \\\"errors\\\"\\n \\\"fmt\\\"\\n \\\"io/ioutil\\\"\\n \\\"os\\\"\\n)\\n\\nfunc main() {\\n if err := removeLines(\\\"foobar.txt\\\", 1, 2); err != nil {\\n fmt.Println(err)\\n }\\n}\\n\\nfunc removeLines(fn string, start, n int) (err error) {\\n if start < 1 {\\n return errors.New(\\\"invalid request. line numbers start at 1.\\\")\\n }\\n if n < 0 {\\n return errors.New(\\\"invalid request. negative number to remove.\\\")\\n }\\n var f *os.File\\n if f, err = os.OpenFile(fn, os.O_RDWR, 0); err != nil {\\n return\\n }\\n defer func() {\\n if cErr := f.Close(); err == nil {\\n err = cErr\\n }\\n }()\\n var b []byte\\n if b, err = ioutil.ReadAll(f); err != nil {\\n return\\n }\\n cut, ok := skip(b, start-1)\\n if !ok {\\n return fmt.Errorf(\\\"less than %d lines\\\", start)\\n }\\n if n == 0 {\\n return nil\\n }\\n tail, ok := skip(cut, n)\\n if !ok {\\n return fmt.Errorf(\\\"less than %d lines after line %d\\\", n, start)\\n }\\n t := int64(len(b) - len(cut))\\n if err = f.Truncate(t); err != nil {\\n return\\n }\\n if len(tail) > 0 {\\n _, err = f.WriteAt(tail, t)\\n }\\n return\\n}\\n\\nfunc skip(b []byte, n int) ([]byte, bool) {\\n for ; n > 0; n-- {\\n if len(b) == 0 {\\n return nil, false\\n }\\n x := bytes.IndexByte(b, '\\\\n')\\n if x < 0 {\\n x = len(b)\\n } else {\\n x++\\n }\\n b = b[x:]\\n }\\n return b, true\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"static def removeLines(String filename, int startingLine, int lineCount) {\\n def sourceFile = new File(filename).getAbsoluteFile()\\n def outputFile = File.createTempFile(\\\"remove\\\", \\\".tmp\\\", sourceFile.getParentFile())\\n\\n outputFile.withPrintWriter { outputWriter ->\\n sourceFile.eachLine { line, lineNumber ->\\n if (lineNumber < startingLine || lineNumber - startingLine >= lineCount)\\n outputWriter.println(line)\\n }\\n }\\n\\n outputFile.renameTo(sourceFile)\\n}\\n\\nremoveLines(args[0], args[1] as Integer, args[2] as Integer)\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import System.Environment (getArgs)\\n\\nmain = getArgs >>= (\\\\[a, b, c] ->\\n do contents <- fmap lines $ readFile a\\n let b1 = read b :: Int\\n c1 = read c :: Int\\n putStr $ unlines $ concat [take (b1 - 1) contents, drop c1 $ drop b1 contents]\\n )\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main() # remove lines\\n removelines(\\\"foo.bar\\\",3,2) | stop(\\\"Failed to remove lines.\\\")\\nend\\n\\nprocedure removelines(fn,start,skip)\\n\\n f := open(fn,\\\"r\\\") | fail # open to read\\n every put(F := [],|read(f)) # file to list\\n close(f)\\n\\n if *F < start-1+skip then fail\\n every F[start - 1 + (1 to skip)] := &null # mark delete\\n\\n f := open(fn,\\\"w\\\") | fail # open to rewrite\\n every write(\\\\!F) # write non-nulls\\n close(f)\\n return # done\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"100 PROGRAM \\\"RemLines.bas\\\"\\n110 CALL REMOVELINES(\\\"fub.txt\\\",5,3)\\n120 DEF REMOVELINES(NAME$,ST,N)\\n130 STRING S$*254\\n140 WHEN EXCEPTION USE OPENERROR\\n150 LET P=POS(NAME$,\\\".\\\")\\n160 IF P=0 THEN LET P=LEN(NAME$)+1\\n170 LET CM$=\\\"copy \\\"&NAME$&\\\" \\\"&NAME$(1:P-1)&\\\".bak\\\"\\n180 EXT CM$\\n190 OPEN #1:NAME$(1:P-1)&\\\".bak\\\"\\n200 OPEN #2:NAME$ ACCESS OUTPUT\\n210 END WHEN\\n220 WHEN EXCEPTION USE IOERROR\\n230 LET LIN=0\\n240 DO\\n250 LINE INPUT #1:S$\\n260 LET LIN=LIN+1\\n270 IF LIN<ST OR LIN>ST+N-1 THEN PRINT #2:S$\\n280 LOOP\\n290 END WHEN\\n300 HANDLER OPENERROR\\n310 PRINT EXSTRING$(EXTYPE)\\n320 STOP\\n330 END HANDLER\\n340 HANDLER IOERROR\\n350 IF EXTYPE<>8001 THEN\\n360 PRINT EXSTRING$(EXLINE)\\n375 STOP\\n380 ELSE\\n390 IF LIN>=ST+N-1 THEN PRINT N;\\\"line(s) removed.\\\"\\n400 IF LIN>=ST AND LIN<ST+N-1 THEN PRINT \\\"Only\\\";LIN-ST+1;\\\"line(s) were removed as not enough lines to remove more.\\\"\\n410 IF LIN<ST THEN PRINT \\\"No lines were removed as starting line was beyond end of file.\\\"\\n420 END IF\\n430 CLOSE #2\\n440 CLOSE #1\\n450 END HANDLER\\n460 END DEF\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \"removeLines=: 4 :0\\n 'count start'=. x\\n file=. boxxopen y\\n lines=. <;.2 fread file\\n (;lines {~ <<< (start-1)+i.count) fwrite file\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"$ cal >cal.txt\\n$ cat cal.txt\\n July 2011\\nSu Mo Tu We Th Fr Sa\\n 1 2\\n 3 4 5 6 7 8 9\\n10 11 12 13 14 15 16\\n17 18 19 20 21 22 23\\n24 25 26 27 28 29 30\\n31\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 2 1 removeLines 'cal.txt'\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"$ cat cal.txt\\n 1 2\\n 3 4 5 6 7 8 9\\n10 11 12 13 14 15 16\\n17 18 19 20 21 22 23\\n24 25 26 27 28 29 30\\n31\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.io.BufferedReader;\\nimport java.io.File;\\nimport java.io.FileReader;\\nimport java.io.FileWriter;\\n\\npublic class RemoveLines\\n{\\n\\tpublic static void main(String[] args)\\n\\t{\\n\\t\\t//Enter name of the file here\\n\\t\\tString filename=\\\"foobar.txt\\\";\\n\\t\\t//Enter starting line here\\n\\t\\tint startline=1;\\n\\t\\t//Enter number of lines here.\\n\\t\\tint numlines=2;\\n\\t\\t\\n\\t\\tRemoveLines now=new RemoveLines();\\n\\t\\tnow.delete(filename,startline,numlines);\\n\\t}\\n\\tvoid delete(String filename, int startline, int numlines)\\n\\t{\\n\\t\\ttry\\n\\t\\t{\\n\\t\\t\\tBufferedReader br=new BufferedReader(new FileReader(filename));\\n\\t\\t\\t\\n\\t\\t\\t//String buffer to store contents of the file\\n\\t\\t\\tStringBuffer sb=new StringBuffer(\\\"\\\");\\n\\t\\t\\t\\n\\t\\t\\t//Keep track of the line number\\n\\t\\t\\tint linenumber=1;\\n\\t\\t\\tString line;\\n\\t\\t\\t\\n\\t\\t\\twhile((line=br.readLine())!=null)\\n\\t\\t\\t{\\n\\t\\t\\t\\t//Store each valid line in the string buffer\\n\\t\\t\\t\\tif(linenumber<startline||linenumber>=startline+numlines)\\n\\t\\t\\t\\t\\tsb.append(line+\\\"\\\\n\\\");\\n\\t\\t\\t\\tlinenumber++;\\n\\t\\t\\t}\\n\\t\\t\\tif(startline+numlines>linenumber)\\n\\t\\t\\t\\tSystem.out.println(\\\"End of file reached.\\\");\\n\\t\\t\\tbr.close();\\n\\t\\t\\t\\n\\t\\t\\tFileWriter fw=new FileWriter(new File(filename));\\n\\t\\t\\t//Write entire string buffer into the file\\n\\t\\t\\tfw.write(sb.toString());\\n\\t\\t\\tfw.close();\\n\\t\\t}\\n\\t\\tcatch (Exception e)\\n\\t\\t{\\n\\t\\t\\tSystem.out.println(\\\"Something went horribly wrong: \\\"+e.getMessage());\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"jq -s -R -r --arg start START --arg number NUMBER -f remove.jq INFILE\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Counting the first line in the file as line 1,\\n# attempt to remove \\\"number\\\" lines from line number \\\"start\\\" onwards:\\ndef remove_lines(start; number):\\n (start+number - 1) as $max\\n | reduce split(\\\"\\\\n\\\")[] as $line\\n ( [0, []];\\n .[0] += 1\\n | .[0] as $i\\n | if start <= $i and $i <= $max then . else .[1] += [$line] end)\\n | .[0] as $count\\n | .[1]\\n | join(\\\"\\\\n\\\")\\n | (if $count < $max then \\\"WARNING: there are only \\\\($count) lines\\\" else empty end), .;\\n\\nremove_lines($start|tonumber; $number|tonumber)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"jq -n -R -r --arg start 1 --arg number 2 -f Remove_lines_from_a_file.jq input.txt\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Counting the first line in the file as line 1, attempt to remove \\\"number\\\" lines from line\\n# number \\\"start\\\" onwards:\\ndef remove_lines_streaming(start; number):\\n (start+number - 1) as $max\\n # In the following line, null will serve to signal EOF so that the warning can be emitted.\\n | foreach (inputs,null) as $line\\n ( 0;\\n . += 1;\\n if $line == null then # EOF\\n if . <= $max then \\\"WARNING: there were only \\\\(.) lines\\\" else empty end\\n elif start <= . and . <= $max then empty\\n else $line\\n end) ;\\n\\nremove_lines_streaming($start|tonumber; $number|tonumber)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"#!/usr/bin/env julia\\n\\nconst prgm = basename(Base.source_path())\\n\\nif length(ARGS) < 2\\n println(\\\"usage: \\\", prgm, \\\" <file> [line]...\\\")\\n exit(1)\\nend\\n\\nfile = ARGS[1]\\n\\nconst numbers = map(x -> begin\\n try\\n parse(Uint, x)\\n catch\\n println(prgm, \\\": \\\", x, \\\": not a number\\\")\\n exit(1)\\n end\\nend, ARGS[2:end])\\n\\nf = open(file)\\nlines = readlines(f)\\nclose(f)\\n\\nif maximum(numbers) > length(lines)\\n println(prgm, \\\": detected extraneous line number\\\")\\n exit(1)\\nend\\n\\ndeleteat!(lines, sort(unique(numbers)))\\nf = open(file, \\\"w\\\")\\nwrite(f, join(lines))\\nclose(f)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nimport java.io.File\\n\\nfun removeLines(fileName: String, startLine: Int, numLines: Int) {\\n require(!fileName.isEmpty() && startLine >= 1 && numLines >= 1)\\n val f = File(fileName)\\n if (!f.exists()) {\\n println(\\\"$fileName does not exist\\\")\\n return\\n }\\n var lines = f.readLines()\\n val size = lines.size\\n if (startLine > size) {\\n println(\\\"The starting line is beyond the length of the file\\\")\\n return\\n }\\n var n = numLines\\n if (startLine + numLines - 1 > size) {\\n println(\\\"Attempting to remove some lines which are beyond the end of the file\\\")\\n n = size - startLine + 1\\n }\\n lines = lines.take(startLine - 1) + lines.drop(startLine + n - 1)\\n val text = lines.joinToString(System.lineSeparator())\\n f.writeText(text)\\n}\\n\\nfun printFile(fileName: String, message: String) {\\n require(!fileName.isEmpty())\\n val f = File(fileName)\\n if (!f.exists()) {\\n println(\\\"$fileName does not exist\\\")\\n return\\n }\\n println(\\\"\\\\nContents of $fileName $message:\\\\n\\\")\\n f.forEachLine { println(it) }\\n}\\n\\nfun main(args: Array<String>) {\\n printFile(\\\"input.txt\\\", \\\"before removal\\\")\\n removeLines(\\\"input.txt\\\", 2, 3)\\n printFile(\\\"input.txt\\\", \\\"after removal of 3 lines starting from the second\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"#!/usr/bin/lasso9\\n\\nlocal(\\n\\torgfilename\\t\\t= $argv -> second,\\n\\tfile\\t\\t\\t= file(#orgfilename),\\n\\tregexp\\t\\t\\t= regexp(-find = `(?m)$`),\\n\\tcontent\\t\\t\\t= #regexp -> split(-input = #file -> readstring) -> asarray,\\n\\tstart\\t\\t\\t= integer($argv -> get(3) || 1),\\n\\trange\\t\\t\\t= integer($argv -> get(4) || 1)\\n)\\nstdout(#content)\\n#file -> copyto(#orgfilename + '.org')\\n\\nfail_if(#content -> size < (#start + #range), -1, 'Not that many rows in the file')\\n\\n#content -> remove(#start, #range)\\n\\n#file = file(#orgfilename)\\n#file -> opentruncate\\n#file -> dowithclose => {\\n\\t#file -> writestring(#content -> join(''))\\n}\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"./removelines textfile.txt 2 2\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"call removeLines \\\"foobar.txt\\\", 1, 2\\nend\\n\\nsub removeLines filename$, start, count\\n open filename$ for input as #in\\n open filename$ + \\\".tmp\\\" for output as #out\\n lineCounter = 1\\n firstAfterIgnored = start + count\\n while not(eof(#in))\\n line input #in, s$\\n if lineCounter < start or lineCounter >= firstAfterIgnored then\\n print #out, s$\\n end if\\n lineCounter = lineCounter + 1\\n wend\\n close #in\\n close #out\\n 'kill filename$\\n 'name filename$ + \\\".tmp\\\" as filename$\\nend sub\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"function remove( filename, starting_line, num_lines )\\n local fp = io.open( filename, \\\"r\\\" )\\n if fp == nil then return nil end\\n\\n content = {}\\n i = 1;\\n for line in fp:lines() do\\n if i < starting_line or i >= starting_line + num_lines then\\n\\t content[#content+1] = line\\n\\tend\\n\\ti = i + 1\\n end\\n\\n if i > starting_line and i < starting_line + num_lines then\\n\\tprint( \\\"Warning: Tried to remove lines after EOF.\\\" )\\n end\\n\\n fp:close()\\n fp = io.open( filename, \\\"w+\\\" )\\n\\n for i = 1, #content do\\n\\tfp:write( string.format( \\\"%s\\\\n\\\", content[i] ) )\\n end\\n\\n fp:close()\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"f[doc_String, start_Integer, n_Integer] := Module[{p, newdoc},\\n p = Import[doc, \\\"List\\\"];\\n If[start + n - 1 <= Length@p,\\n p = Drop[p, {start, start + n - 1}];\\n newdoc = FileNameJoin[{DirectoryName[doc], FileBaseName[doc] <> \\\"_removed.txt\\\"}];\\n Export[newdoc, p, \\\"List\\\"];\\n ,\\n Print[\\\"Too few lines in document. Operation aborted.\\\"]\\n ]\\n ]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"(context 'ABC)\\n\\n(define (remove-lines-from-a-file filename start num)\\n (setf new-content \\\"\\\")\\n (setf row-counter 0)\\n (setf start-delete-row start)\\n (setf end-delete-row (+ start num -1))\\n (setf file-content (read-file filename))\\n (setf max-rows (length (parse file-content \\\"\\\\n\\\" 0)))\\n\\n (cond\\n ((<= start 0)\\n (println \\\"Start line must be >= 1. Value passed: \\\" start))\\n ((<= num 0)\\n (println \\\"# of lines to remove must be >= 1. Value passed: \\\" num))\\n ((> start max-rows)\\n (println \\\"Start line must be <= \\\" max-rows \\\". Value passed: \\\" start))\\n ((> end-delete-row max-rows)\\n (println \\\"Not so much lines available to be removed. Max \\\" (- max-rows start-delete-row) \\\". Value passed: \\\" num))\\n (true\\n (dolist (row (parse file-content \\\"\\\\n\\\" 0))\\n (++ row-counter)\\n (if (or (< row-counter start-delete-row) (> row-counter end-delete-row))\\n (setf new-content (append new-content row \\\"\\\\n\\\"))\\n )\\n )\\n (write-file filename new-content)\\n )\\n )\\n)\\n\\n(context 'MAIN)\\n\\n(ABC:remove-lines-from-a-file \\\"foobar.txt\\\" 8 3)\\n(exit)\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"import sequtils, strutils\\n\\nproc removeLines*(filename: string; start, count: Positive) =\\n\\n # Read the whole file, split into lines but keep the ends of line.\\n var lines = filename.readFile().splitLines(keepEol = true)\\n\\n # Remove final empty string if any.\\n if lines[^1].len == 0: lines.setLen(lines.len - 1)\\n\\n # Compute indices and check validity.\\n let first = start - 1\\n let last = first + count - 1\\n if last >= lines.len:\\n raise newException(IOError, \\\"trying to delete lines after end of file.\\\")\\n\\n # Delete the lines and write the file.\\n lines.delete(first, last)\\n filename.writeFile(lines.join())\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let input_line_opt ic =\\n try Some (input_line ic)\\n with End_of_file -> None\\n\\nlet delete_lines filename start skip =\\n if start < 1 || skip < 1 then\\n invalid_arg \\\"delete_lines\\\";\\n let tmp_file = filename ^ \\\".tmp\\\" in\\n let ic = open_in filename\\n and oc = open_out tmp_file in\\n let until = start + skip - 1 in\\n let rec aux i =\\n match input_line_opt ic with\\n | Some line ->\\n if i < start || i > until\\n then (output_string oc line; output_char oc '\\\\n');\\n aux (succ i)\\n | None ->\\n close_in ic;\\n close_out oc;\\n Sys.remove filename;\\n Sys.rename tmp_file filename\\n in\\n aux 1\\n\\nlet usage () =\\n Printf.printf \\\"Usage:\\\\n%s <filename> <startline> <skipnumber>\\\\n\\\" Sys.argv.(0);\\n exit 0\\n\\nlet () =\\n if Array.length Sys.argv < 4 then usage ();\\n delete_lines\\n Sys.argv.(1) (int_of_string Sys.argv.(2)) (int_of_string Sys.argv.(3))\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \": removeLines(filename, startLine, numLines)\\n| line b endLine |\\n ListBuffer new ->b\\n startLine numLines + 1 - ->endLine\\n\\n 0 File new(filename) forEach: line [\\n 1+ dup between(startLine, endLine) ifFalse: [ b add(line) continue ]\\n numLines 1- ->numLines\\n ]\\n drop numLines 0 == ifFalse: [ \\\"Error : Removing lines beyond end of file\\\" println return ]\\n\\n File new(filename) dup open(File.WRITE) b apply(#[ << dup cr ]) close ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"program RemLines;\\n\\n{$mode objfpc}{$H+}\\n\\nuses\\n {$IFDEF UNIX}{$IFDEF UseCThreads}\\n cthreads,\\n {$ENDIF}{$ENDIF}\\n Classes, SysUtils;\\n\\ntype\\n TRLResponse=(rlrOk, rlrEmptyFile, rlrNotEnoughLines);\\n\\nfunction RemoveLines(const FileName: String; const From, Count: Integer): TRLResponse;\\nconst\\n LineOffs = Length(LineEnding);\\n\\nvar\\n TIn, TOut: TFileStream;\\n tmpFn, MemBuff, FileBuff: String;\\n EndingPos, CharRead, LineNumber: Integer;\\n\\n procedure WriteLine(Line: String);\\n begin\\n if ((From > 1) and (LineNumber = 1)) or ((From = 1) and (LineNumber = (From+Count))) then\\n // First line to write, without LineEnding => Line unchanged\\n else if ((From = 1) or (From <= LineNumber)) and (LineNumber < (From+Count)) then\\n // No line to write\\n Line := ''\\n else\\n // all other cases, write Line preceded (!) by LineEnding\\n Line := LineEnding + Line;\\n // Write\\n if Line <> '' then\\n TOut.Write(Line[1], Length(Line));\\n End;\\n\\nbegin\\n if not FileExists(FileName) then\\n raise Exception.CreateFmt('No such file %s', [FileName]);\\n if From < 1 then\\n raise Exception.Create('First line must be >= 1');\\n\\n tmpFn := GetTempFileName(ExtractFilePath(FileName), '');\\n\\n TIn := TFileStream.Create(FileName, fmOpenRead);\\n try\\n TOut := TFileStream.Create(tmpFn, fmCreate);\\n try\\n FileBuff := StringOfChar(' ', 1024); // Reserve memory in a string\\n LineNumber := 0;\\n MemBuff := '';\\n while True do\\n begin\\n CharRead := TIn.Read(FileBuff[1], 1024);\\n if (CharRead = 0) then\\n break; // no more char to process\\n MemBuff += Copy(FileBuff, 1, CharRead); // op += is FPC specific\\n while True do\\n begin\\n // LineEnding can contain 1 or 2 chars, depending on the OS\\n EndingPos := Pos(LineEnding, MemBuff);\\n if EndingPos = 0 then\\n break; // EndingLine in the next reading, maybe\\n Inc(LineNumber);\\n WriteLine(Copy(MemBuff, 1, EndingPos - 1));\\n MemBuff := Copy(MemBuff, EndingPos + LineOffs, MaxInt);\\n // Loop for another line in MemBuff\\n end;\\n end;\\n Inc(LineNumber);\\n WriteLine(MemBuff); // Writes what remains\\n finally\\n TOut.Free;\\n end;\\n finally\\n TIn.Free;\\n end;\\n // Temp File replaces the original file.\\n if DeleteFile(FileName) then\\n RenameFile(tmpFn, FileName)\\n else\\n raise Exception.Create('Unable to process the file');\\n // Response\\n if (LineNumber = 0) then\\n Result := rlrEmptyFile\\n else if (LineNumber < (From+Count-1)) then\\n Result := rlrNotEnoughLines\\n else\\n Result := rlrOk;\\nEnd;\\n\\nvar\\n FileName: String;\\n\\nbegin\\n FileName := IncludeTrailingPathDelimiter(ExtractFilePath(ParamStr(0))) + 'test.txt';\\n try\\n case RemoveLines(FileName, 4, 3) of\\n rlrOk: WriteLn('Lines deleted');\\n rlrEmptyFile: WriteLn(Format('File \\\"%s\\\" is empty!', [FileName]));\\n rlrNotEnoughLines: WriteLn('Can''t delete lines past the end of file');\\n end\\n except\\n on E: Exception do\\n WriteLn('Error: ' + E.Message);\\n end;\\n ReadLn;\\nEnd.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"#!/usr/bin/perl -n -s -i\\nprint unless $. >= $from && $. <= $to;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"#!/usr/bin/perl -w\\nuse strict ;\\nuse Tie::File ;\\n\\nsub deletelines {\\n my $arguments = shift ;\\n my( $file , $startfrom , $howmany ) = @{$arguments} ;\\n tie my @lines , 'Tie::File' , $file or die \\\"Can't find file $file!\\\\n\\\" ;\\n my $nrecs = @lines ;\\n if ( $startfrom > $nrecs ) {\\n print \\\"Error! Starting to delete lines past the end of the file!\\\\n\\\" ;\\n return ;\\n }\\n if ( ( $startfrom + $howmany ) > $nrecs ) {\\n print \\\"Error! Trying to delete lines past the end of the file!\\\\n\\\" ;\\n return ;\\n }\\n splice @lines , $startfrom - 1 , $howmany ;\\n untie @lines ;\\n}\\n\\nif ( @ARGV != 3 ) {\\n print \\\"Error! Invoke with deletelines <filename> <start> <skiplines> !\\\\n\\\" ;\\n exit( 1 ) ;\\n}\\n\\ndeletelines( \\\\@ARGV ) ;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (file i/o)</span>\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">remove_lines</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">fn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">open</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">'r'</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">!=-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"cannot open file!\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">lines</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">get_text</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">GT_LF_STRIPPED</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">close</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lines</span><span style=\\\"color: #0000FF;\\\">)<</span><span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"bad parameters!\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">lines</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #000000;\\\">fn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">open</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">'w'</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lines</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">close</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"\\\"aFile.txt\\\" var fileName\\n100 var startLine\\n10 var lineCount\\n0 var lineNum\\n\\nfileName \\\"r\\\" fopen var in\\nfileName \\\"_tmp\\\" chain \\\"w\\\" fopen var out\\n\\nin 0 > out 0 > and if\\n true\\n while\\n in fgets dup\\n -1 == if\\n drop\\n in fclose out fclose\\n false\\n else\\n lineNum 1 + var lineNum\\n lineNum startLine < lineNum startLine lineCount + >= or\\n if out fputs else drop endif\\n true\\n endif\\n endwhile\\n \\\"del \\\" fileName chain cmd drop\\n \\\"rename \\\" fileName chain \\\"_tmp \\\" chain fileName chain cmd drop\\nelse\\n \\\"WRONG! error in file operation\\\" print\\nendif\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"(de deleteLines (File Start Cnt)\\n (let L (in File (make (until (eof) (link (line)))))\\n (if (> (+ (dec 'Start) Cnt) (length L))\\n (quit \\\"Not enough lines\\\")\\n (out File\\n (mapc prinl (cut Start 'L))\\n (mapc prinl (nth L (inc Cnt))) ) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"#DIM ALL\\n\\nFUNCTION PBMAIN () AS LONG\\n DIM filespec AS STRING, linein AS STRING\\n DIM linecount AS LONG, L0 AS LONG, ok AS LONG\\n\\n filespec = DIR$(COMMAND$(1))\\n WHILE LEN(filespec)\\n linecount = 0: ok = 0\\n OPEN filespec FOR INPUT AS 1\\n OPEN filespec & \\\".tmp\\\" FOR OUTPUT AS 2\\n DO UNTIL EOF(1)\\n LINE INPUT #1, linein\\n INCR linecount\\n IF VAL(COMMAND$(2)) <> linecount THEN\\n PRINT #2, linein\\n ELSE\\n ok = -1\\n FOR L0 = 2 TO VAL(COMMAND$(3))\\n IF EOF(1) THEN\\n ok = 1\\n PRINT \\\"Tried to remove beyond the end of \\\"; filespec\\n EXIT DO\\n END IF\\n LINE INPUT #1, linein\\n NEXT\\n END IF\\n LOOP\\n IF 0 = ok THEN\\n PRINT \\\"Lines to remove are beyond the end of \\\"; filespec\\n ELSEIF -1 = ok THEN\\n PRINT filespec; \\\": done\\\"\\n END IF\\n CLOSE\\n filespec = DIR$\\n WEND\\nEND FUNCTION\\n\",\n \"language\": \"PowerBASIC\"\n },\n {\n \"code\": \"function del-line($file, $start, $end) {\\n $i = 0\\n $start--\\n $end--\\n (Get-Content $file) | where{\\n ($i -lt $start -or $i -gt $end)\\n $i++\\n } > $file\\n (Get-Content $file)\\n}\\ndel-line \\\"foobar.txt\\\" 1 2\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"; Contents of file 'input.txt' before deletion of lines :\\n;\\n; cat\\n; dog\\n; giraffe\\n; lion\\n; mouse\\n; pig\\n; tiger\\n; zebra\\n\\nEnableExplicit\\n\\n#Output$ = \\\"output.txt\\\"; insert path to temporary output file\\n\\nProcedure RemoveLines(Input$, StartLine, NbLines)\\n Protected lineCount = 0\\n Protected endline = StartLine + NbLines - 1\\n Protected row$\\n\\n If Not ReadFile(0, Input$)\\n PrintN(\\\"Error opening input file\\\")\\n ProcedureReturn\\n EndIf\\n\\n If Not CreateFile(1, #Output$)\\n PrintN(\\\"Error creating output file\\\")\\n CloseFile(0)\\n ProcedureReturn\\n EndIf\\n\\n While Not Eof(0)\\n row$ = ReadString(0)\\n lineCount + 1\\n If lineCount < StartLine Or lineCount > endLine\\n WriteStringN(1, row$)\\n EndIf\\n Wend\\n\\n If endLine > lineCount\\n PrintN(\\\"Attempted to remove lines beyond the end of the file\\\")\\n ; but still allow removal of lines (if any) up to the end of the file\\n EndIf\\n\\n CloseFile(0)\\n CloseFile(1)\\n\\n If Not DeleteFile(Input$)\\n PrintN(\\\"Unable to delete input file so output file can be renamed\\\")\\n ProcedureReturn\\n EndIf\\n\\n If Not RenameFile(#Output$, Input$)\\n PrintN(\\\"Unable to rename output file\\\")\\n EndIf\\n\\nEndProcedure\\n\\nDefine fInput$\\n\\nIf OpenConsole()\\n ; delete lines 2,3 amnd 4 of 'input.txt'\\n fInput$ = \\\"input.txt\\\"; insert path to input file\\n RemoveLines(fInput$, 2, 3)\\n PrintN(\\\"\\\")\\n PrintN(\\\"Press any key to close the console\\\")\\n Repeat: Delay(10) : Until Inkey() <> \\\"\\\"\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"#!/usr/bin/env python\\n\\nimport fileinput, sys\\n\\nfname, start, count = sys.argv[1:4]\\nstart, count = int(start), int(count)\\n\\nfor line in fileinput.input(fname, inplace=1, backup='.orig'):\\n if start <= fileinput.lineno() < start + count:\\n pass\\n else:\\n print line.rstrip(\\\"\\\\n\\\")\\nfileinput.close()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n(define (remove-lines file from num)\\n (define lines (file->lines file))\\n (define-values [pfx rest] (split-at lines (sub1 from)))\\n (display-lines-to-file (append pfx (drop rest num)) file #:exists 'replace))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub MAIN ($filename, $beg, $len) {\\n my @lines = split /^^/, slurp $filename;\\n unlink $filename; # or rename\\n splice(@lines,$beg,$len) == $len or warn \\\"Too few lines\\\";\\n spurt $filename, @lines;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program reads and writes a specified file and delete(s) specified record(s). */\\nparse arg iFID ',' N \\\",\\\" many . /*input FID, start of delete, how many.*/\\nif iFID='' then call er \\\"no input fileID specified.\\\" /*oops.*/\\nif N='' then call er \\\"no start number specified.\\\" /*oops.*/\\nif many='' then many=1 /*Not specified? Assume delete 1 line.*/\\nstop=N+many-1 /*calculate high end of delete range.*/\\noFID=iFID'.$$$' /*temp name (fileID) of the output file*/\\n#=0 /*the count (so far) of records written*/\\n do j=1 while lines(iFID)\\\\==0 /*J is the record# (line) being read.*/\\n @=linein(iFID) /*read a record (line) from input file.*/\\n if j>=N & j<=stop then iterate /*if it's in the range, then ignore it.*/\\n call lineout oFID,@; #=#+1 /*write record (line);, bump write cnt.*/\\n end /*j*/ /* [↑] by ignoring it is to delete it.*/\\nj=j-1 /*adjust J (because of DO loop advance)*/\\nif j<stop then say \\\"The number of lines in file is less than the range given.\\\"\\n$='\\\"' /*handle cases of blanks in the FID(s).*/\\n'ERASE' $ || iFID || $ /*erase the original file. */\\n'RENAME' $ || oFID || $ $ || iFID || $ /*rename \\\" new \\\" to original. */\\nsay 'file ' iFID \\\" had\\\" j 'record's(j)\\\", it now has\\\" # 'record's(w)\\\".\\\"\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ner: say; say '***error***'; say; say arg(1); say; exit 13\\ns: if arg(1)==1 then return arg(3); return word(arg(2) 's', 1) /*pluralizer.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"cStr = read(\\\"C:\\\\Ring\\\\bin\\\\filename.txt\\\")\\naList = str2list(cStr)\\nsee aList + nl\\nlineStart = 3\\nlineCount = 5\\nnum = -1\\nfor n = lineStart to lineStart+lineCount-1\\n num += 1\\n del(aList,n-num)\\nnext\\ncStr = list2str(aList)\\nsee cStr + nl\\nwrite(\\\"C:\\\\Ring\\\\bin\\\\filename.txt\\\",cStr)\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'tempfile'\\n\\ndef remove_lines(filename, start, num)\\n tmp = Tempfile.open(filename) do |fp|\\n File.foreach(filename) do |line|\\n if $. >= start and num > 0\\n num -= 1\\n else\\n fp.puts line\\n end\\n end\\n fp\\n end\\n puts \\\"Warning: End of file encountered before all lines removed\\\" if num > 0\\n FileUtils.copy(tmp.path, filename)\\n tmp.unlink\\nend\\n\\n# Test code\\ndef setup(filename, start, remove)\\n puts \\\"remove #{remove} lines starting at line #{start}\\\"\\n File.open(filename, \\\"w\\\") {|fh| (1..5).each {|i| fh.puts \\\" \\\"*i + i.to_s}}\\n puts \\\"before:\\\", File.read(filename)\\nend\\n\\ndef teardown(filename)\\n puts \\\"after:\\\", File.read(filename)\\n puts\\n File.unlink(filename)\\nend\\n\\nfilename = \\\"foobar.txt\\\"\\nstart = 2\\n[2, 6].each do |remove|\\n setup(filename, start, remove)\\n remove_lines(filename, start, remove)\\n teardown(filename)\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"fileName$ = \\\"aFile.txt\\\"\\nstartLine = 100\\nlineCount = 10\\n\\nopen filename$ for input as #in\\nopen filename$ ; \\\"_tmp\\\" for output as #out\\n\\nwhile not(eof(#in))\\n lineNum = lineNum + 1\\n line input #in, a$\\n if lineNum < startLine or lineNum >= startLine + lineCount then print #out, a$\\nwend\\nclose #in\\nclose #out\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"extern crate rustc_serialize;\\nextern crate docopt;\\n\\nuse docopt::Docopt;\\n\\nuse std::io::{BufReader,BufRead};\\nuse std::fs::File;\\n\\nconst USAGE: &'static str = \\\"\\nUsage: rosetta <start> <count> <file>\\n\\\";\\n\\n#[derive(Debug, RustcDecodable)]\\nstruct Args {\\n arg_start: usize,\\n arg_count: usize,\\n arg_file: String,\\n}\\n\\nfn main() {\\n let args: Args = Docopt::new(USAGE)\\n .and_then(|d| d.decode())\\n .unwrap_or_else(|e| e.exit());\\n\\n let file = BufReader::new(File::open(args.arg_file).unwrap());\\n\\n for (i, line) in file.lines().enumerate() {\\n let cur = i + 1;\\n\\n if cur < args.arg_start || cur >= (args.arg_start + args.arg_count) {\\n println!(\\\"{}\\\", line.unwrap());\\n }\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object RemoveLinesFromAFile extends App {\\n args match {\\n case Array(filename, start, num) =>\\n\\n import java.nio.file.{Files,Paths}\\n val lines = scala.io.Source.fromFile(filename).getLines\\n val keep = start.toInt - 1\\n val top = lines.take(keep).toList\\n val drop = lines.take(num.toInt).toList\\n Files.write(Paths.get(filename), scala.collection.JavaConversions.asJavaIterable(top ++ lines))\\n\\n if (top.size < keep || drop.size < num.toInt)\\n println(s\\\"Too few lines: removed only ${drop.size} of $num lines starting at $start\\\")\\n\\n case _ =>\\n println(\\\"Usage: RemoveLinesFromAFile <filename> <startLine> <numLines>\\\")\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"osfiles.s7i\\\";\\n\\nconst proc: removeLines (in string: fileName, in integer: start, in integer: count) is func\\n local\\n var file: inFile is STD_NULL;\\n var file: outFile is STD_NULL;\\n var integer: lineNumber is 1;\\n var string: line is \\\"\\\";\\n begin\\n inFile := open(fileName, \\\"r\\\");\\n outFile := open(fileName & \\\".tmp\\\", \\\"w\\\");\\n while hasNext(inFile) do\\n line := getln(inFile);\\n if lineNumber < start or lineNumber >= start + count then\\n writeln(outFile, line);\\n end if;\\n incr(lineNumber);\\n end while;\\n close(inFile);\\n close(outFile);\\n removeFile(fileName);\\n moveFile(fileName & \\\".tmp\\\", fileName);\\n end func;\\n\\nconst proc: main is func\\n begin\\n if length(argv(PROGRAM)) = 3 then\\n removeLines(argv(PROGRAM)[1], integer parse (argv(PROGRAM)[2]), integer parse (argv(PROGRAM)[3]));\\n end if;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"removeLines \\\"foobar.txt\\\", 1, 2\\nto handle removeLines fileName, startingLine, linesToRemove\\n\\tIf there is no file fileName then\\n\\t\\tput !\\\"No such file: [[the folder & fileName]]\\\"\\n\\t\\tReturn\\n\\tEnd if\\n\\tset endingLine to startingLine + linesToRemove - 1\\n\\tIf endingLine is more than number of lines in file fileName then\\n\\t\\tput !\\\"Cannot delete lines past the end of the file ([[number of lines in file fileName]] lines)\\\"\\n\\t\\tReturn\\n\\tEnd If\\n\\tdelete lines startingLine to endingLine of file fileName\\nend removeLines\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"func remove_lines(file, beg, len) {\\n var lines = file.open_r.lines\\n lines.splice(beg, len).len == len || warn \\\"Too few lines\\\";\\n file.write(lines.join(\\\"\\\\n\\\"), :utf8)\\n}\\n\\nremove_lines(File(__FILE__), 2, 3)\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"* Remove lines from a file\\n\\n* Function to remove a chunk of lines from a file, will go backward, too, if numlines < 0\\n define(\\\"remlines(filename,startline,numlines)row,rowcount,lastline,swap\\\")\\n :(remlines_end)\\nremlines\\n\\tinput(.inp1,1,filename)\\t\\t:f(freturn)\\n\\toutput(.tmp1,2,\\\"/tmp/Removem\\\")\\t:f(freturn)\\n\\trowcount = 0\\n\\tlastline = (ge(numlines,0) startline + numlines - 1, startline + numlines + 1)\\n\\tge(numlines,0) :s(remlines2)\\n\\tswap = lastline\\n\\tlastline = startline\\n\\tstartline = swap\\nremlines2\\n\\trow = inp1\\t\\t\\t:f(remlines3)\\n\\trowcount = rowcount + 1\\n\\tge(rowcount,startline) le(rowcount,lastline)\\t:s(remlines2)\\n\\ttmp1 = row\\n\\t:(remlines2)\\nremlines3\\n\\tendfile(1)\\n\\tendfile(2)\\n\\tinput(.rmv1,2,\\\"/tmp/Removem\\\")\\t:f(freturn)\\n\\toutput(.fnout1,1,filename)\\t:f(freturn)\\nremlines4\\n\\tfnout1 = rmv1\\t\\t\\t:s(remlines4)\\n\\tendfile(1)\\n\\tendfile(2)\\n\\t:(return)\\nremlines_end\\n\\n\\ttestfile = \\\"/tmp/foobar.txt\\\"\\n\\n* Populate test file with 5 rows, 1, 2, 3, 4, and 5\\n\\toutput(.testout,60,testfile) :f(failed)\\n\\ti = 1\\npop1\\n\\ttestout = i\\n\\ti = lt(i,5) i + 1 :s(pop1)\\n\\tendfile(60)\\n\\n\\n* Now remove lines 2, 3, and 4 from test file\\n\\tremlines(testfile,2,3) :f(failed)\\n\\n\\n* Print revised file\\n\\tinput(.testprt,70,testfile) :f(failed)\\nprint1\\n\\toutput = testprt :s(print1)\\n\\t:(end)\\n\\nfailed\\n\\toutput = \\\"Either the main file or the temporary file failed to open\\\"\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"* drop lines 20 to 30\\ndrop in 20/30\\n\\n* keep lines 20 to 30, and remove everything else\\nkeep in 20/30\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"proc removeLines {fileName startLine count} {\\n # Work out range to remove\\n set from [expr {$startLine - 1}]\\n set to [expr {$startLine + $count - 2}]\\n # Read the lines\\n set f [open $fileName]\\n set lines [split [read $f] \\\"\\\\n\\\"]\\n close $f\\n # Write the lines back out, without removed range\\n set f [open $fileName w]\\n puts -nonewline $f [join [lreplace $lines $from $to] \\\"\\\\n\\\"]\\n close $f\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"$$! input=testfile,begnr=3,endnr=4\\n$$ MODE TUSCRIPT\\n- CREATE inputfile\\nERROR/STOP CREATE (input,FDF-o,-std-)\\nFILE/ERASE $input\\n LOOP n=1,9\\n content=CONCAT (\\\"line\\\",n)\\n DATA {content}\\n ENDLOOP\\nENDFILE\\n\\n- CREATE outputfile\\noutput=\\\"outputfile\\\"\\n\\nERROR/STOP CREATE (output,fdf-o,-std-)\\nACCESS q: READ/RECORDS/utf8 $input L,line\\nACCESS z: WRITE/RECORDS/utf8 $output L,line\\nPRINT \\\"content: of output-file\\\"\\nLOOP/9999\\nREAD/NEXT/EXIT q\\nIF (begnr<=L&&endnr>=L) CYCLE\\nPRINT line\\nWRITE z\\nENDLOOP\\nENDACCESS/PRINT q\\nENDACCESS/PRINT z\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"#!/bin/sh\\nerror() {\\n echo >&2 \\\"$0: $*\\\"\\n exit 1\\n}\\n\\n[ $# -ne 3 ] && error \\\"Incorrect number of parameters\\\"\\n\\nfile=$1\\nstart=$2\\ncount=$3\\nend=`expr $start + $count - 1`\\n\\n[ -f \\\"$file\\\" ] || error \\\"$file does not exist\\\"\\n\\nsed \\\"$start,${end}d\\\" \\\"$file\\\" >/tmp/$$ && mv /tmp/$$ \\\"$file\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"sed -i \\\"$start,${end}d\\\" \\\"$file\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"sed -i \\\"\\\" \\\"$start,${end}d\\\" \\\"$file\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"Option Explicit\\n\\nSub Main()\\n 'See Output #1\\n RemoveLines \\\"C:\\\\Users\\\\\\\" & Environ(\\\"username\\\") & \\\"\\\\Desktop\\\\foobar.txt\\\", 11, 5\\n 'See Output #2\\n RemoveLines \\\"C:\\\\Users\\\\\\\" & Environ(\\\"username\\\") & \\\"\\\\Desktop\\\\foobar.txt\\\", 8, 5\\n 'See Output #3\\n RemoveLines \\\"C:\\\\Users\\\\\\\" & Environ(\\\"username\\\") & \\\"\\\\Desktop\\\\foobar.txt\\\", 3, 5\\nEnd Sub\\n\\nPrivate Sub RemoveLines(StrFile As String, StartLine As Long, NumberOfLines As Long)\\nDim Nb As Integer, s As String, count As Long, out As String\\n Nb = FreeFile\\n Open StrFile For Input As #Nb\\n While Not EOF(Nb)\\n count = count + 1\\n Line Input #Nb, s\\n If count < StartLine Or count >= StartLine + NumberOfLines Then\\n out = out & s & vbCrLf\\n End If\\n Wend\\n Close #Nb\\n If StartLine >= count Then\\n MsgBox \\\"The file contains only \\\" & count & \\\" lines\\\"\\n ElseIf StartLine + NumberOfLines > count Then\\n MsgBox \\\"You only can remove \\\" & count - StartLine & \\\" lines\\\"\\n Else\\n Nb = FreeFile\\n Open StrFile For Output As #Nb\\n Print #Nb, out\\n Close #Nb\\n End If\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Option Explicit\\n\\nSub Main()\\n 'See Output First call\\n OtherWay \\\"C:\\\\Users\\\\\\\" & Environ(\\\"username\\\") & \\\"\\\\Desktop\\\\foobar.txt\\\", 11, 5\\n 'See Output Second call\\n OtherWay \\\"C:\\\\Users\\\\\\\" & Environ(\\\"username\\\") & \\\"\\\\Desktop\\\\foobar.txt\\\", 8, 5\\n 'See Output Third call\\n OtherWay \\\"C:\\\\Users\\\\\\\" & Environ(\\\"username\\\") & \\\"\\\\Desktop\\\\foobar.txt\\\", 3, 5\\nEnd Sub\\n\\nPrivate Sub OtherWay(StrFile As String, StartLine As Long, NumberOfLines As Long)\\nDim Nb As Integer, s As String, arr, i As Long, out() As String, j As Long\\n Nb = FreeFile\\n Open StrFile For Input As #Nb\\n s = Input(LOF(1), #Nb)\\n Close #Nb\\n arr = Split(s, Chr(13))\\n If StartLine >= UBound(arr) + 1 Then\\n MsgBox \\\"First call : \\\" & vbCrLf & \\\" The file contains only \\\" & UBound(arr) + 1 & \\\" lines\\\"\\n ElseIf StartLine + NumberOfLines > UBound(arr) + 1 Then\\n MsgBox \\\"Second call : \\\" & vbCrLf & \\\" You only can remove \\\" & UBound(arr) + 1 - StartLine & \\\" lines\\\"\\n Else\\n For i = LBound(arr) To UBound(arr)\\n If i < StartLine - 1 Or i >= StartLine + NumberOfLines - 1 Then\\n ReDim Preserve out(j)\\n out(j) = arr(i)\\n j = j + 1\\n End If\\n Next i\\n Nb = FreeFile\\n Open StrFile For Output As #Nb\\n Print #Nb, Join(out, Chr(13))\\n Close #Nb\\n End If\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Sub remove_lines(filepath,start,number)\\n\\tSet objFSO = CreateObject(\\\"Scripting.FileSystemObject\\\")\\n\\tSet InFile = objFSO.OpenTextFile(filepath,1,False)\\n\\tline_count = 1\\n\\tdiscard_count = 1\\n\\tout_txt = \\\"\\\"\\n\\tDo Until InFile.AtEndOfStream\\n\\t\\tline = InFile.ReadLine\\n\\t\\tIf line_count <> start Then\\n\\t\\t\\tIf InFile.AtEndOfStream = False Then\\n\\t\\t\\t\\tout_txt = out_txt & line & vbCrLf\\n\\t\\t\\tElse\\n\\t\\t\\t\\tout_txt = out_txt & line\\n\\t\\t\\tEnd If\\n\\t\\t\\tline_count = line_count + 1\\n\\t\\tElse\\n\\t\\t\\tDo Until discard_count = number\\n\\t\\t\\t\\tInFile.SkipLine\\n\\t\\t\\t\\tdiscard_count = discard_count + 1\\n\\t\\t\\tLoop\\n\\t\\tline_count = line_count + 1\\n\\t\\tEnd If\\n\\tLoop\\n\\tInFile.Close\\n\\tSet OutFile = objFSO.OpenTextFile(filepath,2,False)\\n\\tOutFile.Write(out_txt)\\n\\tOutFile.Close\\n\\tSet objFSO = Nothing\\nEnd Sub\\n\\nCall remove_lines(\\\"C:\\\\Test.txt\\\",3,4)\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"import \\\"os\\\" for Platform\\nimport \\\"io\\\" for File\\n\\nvar removeLines = Fn.new { |fileName, startLine, numLines|\\n if (fileName == \\\"\\\" || startLine < 1 || numLines < 1) Fiber.abort(\\\"Invalid argument(s).\\\")\\n if (!File.exists(fileName)) Fiber.abort(\\\"Can't find %(fileName).\\\")\\n var text = File.read(fileName)\\n System.print(\\\"Contents of %(fileName) before removal:\\\\n%(text)\\\")\\n var sep = Platform.isWindows ? \\\"\\\\r\\\\n\\\" : \\\"\\\\n\\\"\\n var lines = text.split(sep)\\n var size = lines.count\\n if (startLine > size) {\\n System.print(\\\"The starting line is beyond the length of the file.\\\")\\n return\\n }\\n var n = numLines\\n if (startLine + numLines - 1 > size) {\\n System.print(\\\"Attempting to remove some lines which are beyond the end of the file.\\\")\\n n = size - startLine + 1\\n }\\n lines = lines.take(startLine - 1).toList + lines.skip(startLine + n - 1).toList\\n text = lines.join(sep)\\n File.create(fileName) { |file| // effectively overwrites the file\\n file.writeBytes(text)\\n }\\n System.print(\\\"Contents of %(fileName) after removal of %(numLines) lines starting from line %(startLine):\\\")\\n System.print(File.read(fileName))\\n}\\n\\nremoveLines.call(\\\"foobar.txt\\\", 2, 3)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"def LF=$0A, EOF=$1A;\\n\\nproc EatLine; \\\\Read and discard a text line from input file\\nint Ch;\\n[repeat Ch:= ChIn(3);\\n if Ch = EOF then\\n [Text(0, \\\"Attempted to remove a line beyond EOF\\\"); exit];\\nuntil Ch = LF;\\n];\\n\\nproc CopyLine; \\\\Read and write a text line\\nint Ch;\\n[repeat Ch:= ChIn(3);\\n if Ch = EOF then\\n [Text(0, \\\"Attempted to copy a line beyond EOF\\\"); exit];\\n ChOut(3, Ch);\\nuntil Ch = LF;\\n];\\n\\nproc RemoveLines(FileName, StartLine, NumLines);\\nint FileName, StartLine, NumLines;\\nint N, Ch, IH, OH;\\n[IH:= FOpen(FileName, 0);\\nFSet(IH, ^i); \\\\open specified file for input\\nOpenI(3);\\n\\nOH:= FOpen(\\\"file.tmp\\\", 1);\\nFSet(OH, ^o); \\\\open temporary file for output\\nOpenO(3);\\n\\nfor N:= 1 to StartLine-1 do CopyLine; \\\\copy lines up to start of Start line\\nfor N:= 1 to NumLines do EatLine; \\\\discard NumLines\\nloop [Ch:= ChIn(3); \\\\copy remainder of input file\\n if Ch = EOF then quit;\\n ChOut(3, Ch);\\n ];\\nClose(3);\\nFClose(OH); FClose(IH);\\n\\nOH:= FOpen(\\\"foobar.txt\\\", 1);\\nFSet(OH, ^o); \\\\open file for output\\nOpenO(3);\\n\\nIH:= FOpen(\\\"file.tmp\\\", 0);\\nFSet(IH, ^i); \\\\open temp file for input\\nOpenI(3);\\n\\nloop [Ch:= ChIn(3); \\\\copy file\\n if Ch = EOF then quit;\\n ChOut(3, Ch);\\n ];\\nClose(3);\\n];\\n\\nRemoveLines(\\\"foobar.txt\\\", 1, 2)\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"fcn deleteLinesM(fname, start,num){\\n blob:=File(fname).read(); // file to memory\\n n:=blob.seek(Void,start-1); // seek to line and remember it\\n blob.del(n,blob.seek(Void,num)-n);\\n\\n File.stdout.write(blob);\\n}\\ndeleteLinesM(\\\"nn.zkl\\\", 2,5);\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn deleteLinesL(fname, start,num){\\n if (start < 1) throw(Exception.ValueError);\\n f:=File(fname);\\n do(start-1) { File.stdout.write(f.readln()) }\\n do(num) { f.readln(); }\\n f.pump(File.stdout.write);\\n}\\ndeleteLinesL(\\\"nn.zkl\\\", 2,5);\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Remove-lines-from-a-file"}}},{"rowIdx":1576,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Rename_a_file\nnote: File System Operations\n","language":"00-META"},{"code":";Task:\nRename:\n:::* a file called '''input.txt''' into '''output.txt''' and \n:::* a directory called '''docs''' into '''mydocs'''.\n\n\nThis should be done twice: \nonce \"here\", i.e. in the current working directory and once in the filesystem root.\n\nIt can be assumed that the user has the rights to do so.\n\n(In unix-type systems, only the user root would have\nsufficient permissions in the filesystem root.)\n<br><br>\n\n","language":"00-TASK"},{"code":"fs:rename(‘input.txt’, ‘output.txt’)\nfs:rename(‘docs’, ‘mydocs’)\n\nfs:rename(fs:path:sep‘input.txt’, fs:path:sep‘output.txt’)\nfs:rename(fs:path:sep‘docs’, fs:path:sep‘mydocs’)\n","language":"11l"},{"code":"INCLUDE \"D2:IO.ACT\" ;from the Action! Tool Kit\n\nPROC Dir(CHAR ARRAY filter)\n BYTE dev=[1]\n CHAR ARRAY line(255)\n\n Close(dev)\n Open(dev,filter,6)\n DO\n InputSD(dev,line)\n PrintE(line)\n IF line(0)=0 THEN\n EXIT\n FI\n OD\n Close(dev)\nRETURN\n\nPROC Main()\n CHAR ARRAY filter=\"D:*.*\",\n cmd=\"D:INPUT.TXT OUTPUT.TXT\"\n\n Put(125) PutE() ;clear screen\n\n PrintF(\"Dir \"\"%S\"\"%E\",filter)\n Dir(filter)\n\n PrintF(\"Rename \"\"%S\"\"%E%E\",cmd)\n Rename(cmd)\n\n PrintF(\"Dir \"\"%S\"\"%E\",filter)\n Dir(filter)\nRETURN\n","language":"Action-"},{"code":"with Ada.Directories; use Ada.Directories;\n ...\nRename (\"input.txt\", \"output.txt\");\nRename (\"docs\", \"mydocs\");\nRename (\"/input.txt\", \"/output.txt\");\nRename (\"/docs\", \"/mydocs\");\n","language":"Ada"},{"code":"main:(\n PROC rename = (STRING source name, dest name)INT:\n BEGIN\n FILE actual file;\n INT errno = open(actual file, source name, stand back channel);\n IF errno NE 0 THEN\n errno\n ELSE\n IF reidf possible(actual file) THEN\n reidf(actual file, dest name); # change the identification of the book #\n errno\n ELSE\n close(actual file);\n -1\n FI\n FI\n END;\n rename(\"input.txt\", \"output.txt\");\n rename(\"/input.txt\", \"/output.txt\");\n rename(\"docs\", \"mydocs\");\n rename(\"/docs\", \"/mydocs\")\n)\n","language":"ALGOL-68"},{"code":"RENAME INPUT.TXT,OUTPUT.TXT\n","language":"Applesoft-BASIC"},{"code":"10 PRINT CHR$ (4)\"RENAME INPUT.TXT,OUTPUT.TXT\"\n","language":"Applesoft-BASIC"},{"code":"10 PRINT CHR$ (4)\"RENAME INPUT.TXT,OUTPUT.TXT\"\n20 PRINT CHR$ (4)\"RENAME DOCS,MYDOCS\"\n30 PRINT CHR$ (4)\"PREFIX /\"\n40 PRINT CHR$ (4)\"RENAME INPUT.TXT,OUTPUT.TXT\"\n50 PRINT CHR$ (4)\"RENAME DOCS,MYDOCS\"\n","language":"Applesoft-BASIC"},{"code":"fileFrom: \"input.txt\"\nfileTo: \"output.txt\"\ndocsFrom: \"docs\"\ndocsTo: \"mydocs\"\n\nrename fileFrom fileTo\nrename.directory docsFrom docsTo\n\nrename join.path [\"/\" fileFrom]\n join.path [\"/\" fileTo]\n\nrename.directory join.path [\"/\" docsFrom]\n join.path [\"/\" docsTo]\n","language":"Arturo"},{"code":"FileMove, oldname, newname\n","language":"AutoHotkey"},{"code":"$ awk 'BEGIN{system(\"mv input.txt output.txt\")}'\n$ awk 'BEGIN{system(\"mv docs mydocs\")}'\n$ awk 'BEGIN{system(\"mv /input.txt /output.txt\")}'\n$ awk 'BEGIN{system(\"mv docs mydocs\")}'\n","language":"AWK"},{"code":"RENAME \"input.txt\" TO \"output.txt\"\nRENAME \"/input.txt\" TO \"/output.txt\"\nRENAME \"docs\" TO \"mydocs\"\nRENAME \"/docs\" TO \"/mydocs\"\n","language":"BaCon"},{"code":"NAME \"input.txt\" AS \"output.txt\"\nNAME \"\\input.txt\" AS \"\\output.txt\"\nNAME \"docs\" AS \"mydocs\"\nNAME \"\\docs\" AS \"\\mydocs\"\n","language":"BASIC"},{"code":"ren input.txt output.txt\nren \\input.txt output.txt\nren docs mydocs\nren \\docs mydocs\n","language":"Batch-File"},{"code":" *RENAME input.txt output.txt\n *RENAME \\input.txt \\output.txt\n *RENAME docs. mydocs.\n *RENAME \\docs. \\mydocs.\n","language":"BBC-BASIC"},{"code":" OSCLI \"RENAME input.txt output.txt\"\n OSCLI \"RENAME \\input.txt \\output.txt\"\n OSCLI \"RENAME docs. mydocs.\"\n OSCLI \"RENAME \\docs. \\mydocs.\"\n","language":"BBC-BASIC"},{"code":"ren$(\"input.txt\".\"output.txt\") { 'ren' is based on standard C function 'rename()' }\nren$(docs.mydocs) { No quotes needed: names don't contain dots or colons. }\nren$(\"d:\\\\input.txt\".\"d:\\\\output.txt\") { Backslash is escape character, so we need to escape it. }\nren$(@\"d:\\docs\".@\"d:\\mydocs\") { @ used as syntactic sugar as in C# for inhibiting escape. }\n","language":"Bracmat"},{"code":"#include <stdio.h>\n\nint main()\n{\n rename(\"input.txt\", \"output.txt\");\n rename(\"docs\", \"mydocs\");\n rename(\"/input.txt\", \"/output.txt\");\n rename(\"/docs\", \"/mydocs\");\n return 0;\n}\n","language":"C"},{"code":"#include <cstdio>\n\nint main()\n{\n std::rename(\"input.txt\", \"output.txt\");\n std::rename(\"docs\", \"mydocs\");\n std::rename(\"/input.txt\", \"/output.txt\");\n std::rename(\"/docs\", \"/mydocs\");\n return 0;\n}\n","language":"C++"},{"code":"#include \"boost/filesystem.hpp\"\n\nint main()\n{\n boost::filesystem::rename(\n boost::filesystem::path(\"input.txt\"),\n boost::filesystem::path(\"output.txt\"));\n boost::filesystem::rename(\n boost::filesystem::path(\"docs\"),\n boost::filesystem::path(\"mydocs\"));\n boost::filesystem::rename(\n boost::filesystem::path(\"/input.txt\"),\n boost::filesystem::path(\"/output.txt\"));\n boost::filesystem::rename(\n boost::filesystem::path(\"/docs\"),\n boost::filesystem::path(\"/mydocs\"));*/\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.IO;\n\nclass Program {\n static void Main(string[] args) {\n File.Move(\"input.txt\",\"output.txt\");\n File.Move(@\"\\input.txt\",@\"\\output.txt\");\n\n Directory.Move(\"docs\",\"mydocs\");\n Directory.Move(@\"\\docs\",@\"\\mydocs\");\n }\n}\n","language":"C-sharp"},{"code":"FRename( \"input.txt\",\"output.txt\")\nor\nRENAME input.txt TO output.txt\n\nFRename(\"\\input.txt\",\"\\output.txt\")\nor\nRENAME \\input.txt TO \\output.txt\n","language":"Clipper"},{"code":"(import '(java.io File))\n\n(.renameTo (File. \"input.txt\") (File. \"output.txt\"))\n(.renameTo (File. \"docs\") (File. \"mydocs\"))\n\n(.renameTo\n (File. (str (File/separator) \"input.txt\"))\n (File. (str (File/separator) \"output.txt\")))\n(.renameTo\n (File. (str (File/separator) \"docs\"))\n (File. (str (File/separator) \"mydocs\")))\n","language":"Clojure"},{"code":"OPEN 15,<Device>,15,\"R<DRIVE>:FilenameOLD=FilenameNEW\":CLOSE 15\n","language":"Commodore-BASIC"},{"code":"RENAME <FilenameOLD>[,D<DRIVE>] TO <FilenameNEW> [ON U<Deviceadress>]\n","language":"Commodore-BASIC"},{"code":"(rename-file \"input.txt\" \"output.txt\")\n(rename-file \"docs\" \"mydocs\")\n(rename-file \"/input.txt\" \"/output.txt\")\n(rename-file \"/docs\" \"/mydocs\")\n","language":"Common-Lisp"},{"code":"std.file.rename(\"input.txt\",\"output.txt\");\nstd.file.rename(\"/input.txt\",\"/output.txt\");\nstd.file.rename(\"docs\",\"mydocs\");\nstd.file.rename(\"/docs\",\"/mydocs\");\n","language":"D"},{"code":"XCALL RENAM (\"output.txt\",\"input.txt\")\n.IFDEF UNIX\nXCALL SPAWN (\"mv docs mydocs\")\n.ENDC\n.IFDEF DOS\nXCALL SPAWN (\"ren docs mydocs\")\n.ENDC\n.IFDEF VMS\nXCALL SPAWN (\"rename docs.dir mydocs.dir\")\n.ENDC\n","language":"DBL"},{"code":"rename input.txt output.txt\nrename docs.dir mydocs.dir\nrename [000000]input.txt [000000]output.txt\nrename [000000]docs.dir [000000]mydocs.dir\n","language":"DCL"},{"code":"program RenameFile;\n\n{$APPTYPE CONSOLE}\n\nuses SysUtils;\n\nbegin\n SysUtils.RenameFile('input.txt', 'output.txt');\n SysUtils.RenameFile('\\input.txt', '\\output.txt');\n\n // RenameFile works for both files and folders\n SysUtils.RenameFile('docs', 'MyDocs');\n SysUtils.RenameFile('\\docs', '\\MyDocs');\nend.\n","language":"Delphi"},{"code":"for where in [<file:.>, <file:///>] {\n where[\"input.txt\"].renameTo(where[\"output.txt\"], null)\n where[\"docs\"].renameTo(where[\"mydocs\"], null)\n}\n","language":"E"},{"code":"File.rename \"input.txt\",\"output.txt\"\nFile.rename \"docs\", \"mydocs\"\nFile.rename \"/input.txt\", \"/output.txt\"\nFile.rename \"/docs\", \"/mydocs\"\n","language":"Elixir"},{"code":"(rename-file \"input.txt\" \"output.txt\")\n(rename-file \"/input.txt\" \"/output.txt\")\n(rename-file \"docs\" \"mydocs\")\n(rename-file \"/docs\" \"/mydocs\")\n","language":"Emacs-Lisp"},{"code":"file:rename(\"input.txt\",\"output.txt\"),\nfile:rename( \"docs\", \"mydocs\" ),\nfile:rename( \"/input.txt\", \"/output.txt\" ),\nfile:rename( \"/docs\", \"/mydocs\" ).\n","language":"Erlang"},{"code":"open System.IO\n\n[<EntryPoint>]\nlet main args =\n File.Move(\"input.txt\",\"output.txt\")\n File.Move(@\"\\input.txt\",@\"\\output.txt\")\n Directory.Move(\"docs\",\"mydocs\")\n Directory.Move(@\"\\docs\",@\"\\mydocs\")\n 0\n","language":"F-Sharp"},{"code":"\"\" \"/\" [\n [ \"input.txt\" \"output.txt\" move-file \"docs\" \"mydocs\" move-file ] with-directory\n] bi@\n","language":"Factor"},{"code":"class Rename\n{\n public static Void main ()\n {\n // rename file/dir in current directory\n File.rename(\"input.txt\".toUri).rename(\"output.txt\")\n File.rename(\"docs/\".toUri).rename(\"mydocs/\")\n // rename file/dir in root directory\n File.rename(\"/input.txt\".toUri).rename(\"/output.txt\")\n File.rename(\"/docs/\".toUri).rename(\"/mydocs/\")\n }\n}\n","language":"Fantom"},{"code":" s\" input.txt\" s\" output.txt\" rename-file throw\ns\" /input.txt\" s\" /output.txt\" rename-file throw\n","language":"Forth"},{"code":" PROGRAM EX_RENAME\n CALL RENAME('input.txt','output.txt')\n CALL RENAME('docs','mydocs')\n CALL RENAME('/input.txt','/output.txt')\n CALL RENAME('/docs','/mydocs')\n END\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nDim result As Long\nresult = Name(\"input.txt\", \"output.txt\")\nIf result <> 0 Then\n Print \"Renaming file failed\"\nEnd If\n\nresult = Name(\"docs\", \"mydocs\")\nIf result <> 0 Then\n Print \"Renaming directory failed\"\nEnd If\n\nSleep\n","language":"FreeBASIC"},{"code":"CFURLRef inputText, outputText, docs, myDocs\ninputText = fn URLFileURLWithPath( @\"~/Desktop/input.txt\" )\noutputText = fn URLFileURLWithPath( @\"~/Desktop/output.txt\" )\ndocs = fn URLFileURLWithPath( @\"~/Desktop/docs/\" )\nmyDocs = fn URLFileURLWithPath( @\"~/Desktop/myDocs/\" )\n\nfn FileManagerMoveItemAtURL( inputText, outputText )\nfn FileManagerMoveItemAtURL( docs, myDocs )\n","language":"FutureBasic"},{"code":"package main\nimport \"os\"\n\nfunc main() {\n os.Rename(\"input.txt\", \"output.txt\")\n os.Rename(\"docs\", \"mydocs\")\n os.Rename(\"/input.txt\", \"/output.txt\")\n os.Rename(\"/docs\", \"/mydocs\")\n}\n","language":"Go"},{"code":"['input.txt':'output.txt', 'docs':'mydocs'].each { src, dst ->\n ['.', ''].each { dir ->\n new File(\"$dir/$src\").renameTo(new File(\"$dir/$dst\"))\n }\n}\n","language":"Groovy"},{"code":"['input.txt':'output.txt', 'docs':'mydocs'].each { src, dst ->\n ['.', ''].each { dir ->\n new AntBuilder().move(file:\"$dir/$src\", toFile:\"$dir/$dst\")\n }\n}\n","language":"Groovy"},{"code":"FRename( \"input.txt\",\"output.txt\")\n// or\nRENAME input.txt TO output.txt\n\nFRename( hb_ps() + \"input.txt\", hb_ps() + \"output.txt\")\n","language":"Harbour"},{"code":"import System.IO\nimport System.Directory\n\nmain = do\n renameFile \"input.txt\" \"output.txt\"\n renameDirectory \"docs\" \"mydocs\"\n renameFile \"/input.txt\" \"/output.txt\"\n renameDirectory \"/docs\" \"/mydocs\"\n","language":"Haskell"},{"code":"WRITE(FIle='input.txt', REName='.\\output.txt')\nSYSTEM(DIR='E:\\HicEst\\Rosetta')\nWRITE(FIle='.\\docs', REName='.\\mydocs')\n\nWRITE(FIle='\\input.txt', REName='\\output.txt')\nSYSTEM(DIR='\\')\nWRITE(FIle='\\docs', REName='\\mydocs')\n","language":"HicEst"},{"code":"every dir := ![\"./\",\"/\"] do {\n rename(f := dir || \"input.txt\", dir || \"output.txt\") |stop(\"failure for file rename \",f)\n rename(f := dir || \"docs\", dir || \"mydocs\") |stop(\"failure for directory rename \",f)\n }\n","language":"Icon"},{"code":"// rename file in current directory\nf := File with(\"input.txt\")\nf moveTo(\"output.txt\")\n\n// rename file in root directory\nf := File with(\"/input.txt\")\nf moveTo(\"/output.txt\")\n\n// rename directory in current directory\nd := Directory with(\"docs\")\nd moveTo(\"mydocs\")\n\n// rename directory in root directory\nd := Directory with(\"/docs\")\nd moveTo(\"/mydocs\")\n","language":"Io"},{"code":"frename=: 4 : 0\n if. x -: y do. return. end.\n if. IFUNIX do.\n hostcmd=. [: 2!:0 '('\"_ , ] , ' || true)'\"_\n hostcmd 'mv \"',y,'\" \"',x,'\"'\n else.\n 'kernel32 MoveFileA i *c *c' 15!:0 y;x\n end.\n)\n","language":"J"},{"code":"'output.txt' frename 'input.txt'\n'/output.txt' frename '/input.txt'\n'mydocs' frename 'docs'\n'/mydocs' frename '/docs'\n","language":"J"},{"code":"import java.io.File;\npublic class FileRenameTest {\n public static boolean renameFile(String oldname, String newname) {\n // File (or directory) with old name\n File file = new File(oldname);\n\n // File (or directory) with new name\n File file2 = new File(newname);\n\n // Rename file (or directory)\n boolean success = file.renameTo(file2);\n return success;\n }\n public static void test(String type, String oldname, String newname) {\n System.out.println(\"The following \" + type + \" called \" + oldname +\n ( renameFile(oldname, newname) ? \" was renamed as \" : \" could not be renamed into \")\n + newname + \".\"\n );\n }\n public static void main(String args[]) {\n test(\"file\", \"input.txt\", \"output.txt\");\n test(\"file\", File.separator + \"input.txt\", File.separator + \"output.txt\");\n test(\"directory\", \"docs\", \"mydocs\");\n test(\"directory\", File.separator + \"docs\" + File.separator, File.separator + \"mydocs\" + File.separator);\n }\n}\n","language":"Java"},{"code":"var fso = new ActiveXObject(\"Scripting.FileSystemObject\")\nfso.MoveFile(\"input.txt\", \"output.txt\")\nfso.MoveFile(\"c:/input.txt\", \"c:/output.txt\")\nfso.MoveFolder(\"docs\", \"mydocs\")\nfso.MoveFolder(\"c:/docs\", \"c:/mydocs\")\n","language":"JavaScript"},{"code":"\"input.txt\" \"output.txt\" frename\n\"/input.txt\" \"/output.txt\" frename\n\"docs\" \"mydocs\" frename\n\"/docs\" \"/mydocs\" frename.\n","language":"Joy"},{"code":"/* File rename, in jsish */\ntry { File.rename('input.txt', 'output.txt', false); } catch (str) { puts(str); }\n\nexec('touch input.txt');\nputs(\"overwrite set true if output.txt exists\");\nFile.rename('input.txt', 'output.txt', true);\n\ntry { File.rename('docs', 'mydocs', false); } catch (str) { puts(str); }\ntry { File.rename('/docs', '/mydocs', false); } catch (str) { puts(str); }\n","language":"Jsish"},{"code":"mv(\"input.txt\", \"output.txt\")\nmv(\"docs\", \"mydocs\")\nmv(\"/input.txt\", \"/output.txt\")\nmv(\"/docs\", \"/mydocs\")\n","language":"Julia"},{"code":"// version 1.0.6\n\n/* testing on Windows 10 which needs administrative privileges\n to rename files in the root */\n\nimport java.io.File\n\nfun main(args: Array<String>) {\n val oldPaths = arrayOf(\"input.txt\", \"docs\", \"c:\\\\input.txt\", \"c:\\\\docs\")\n val newPaths = arrayOf(\"output.txt\", \"mydocs\", \"c:\\\\output.txt\", \"c:\\\\mydocs\")\n var oldFile: File\n var newFile: File\n for (i in 0 until oldPaths.size) {\n oldFile = File(oldPaths[i])\n newFile = File(newPaths[i])\n if (oldFile.renameTo(newFile))\n println(\"${oldPaths[i]} successfully renamed to ${newPaths[i]}\")\n else\n println(\"${oldPaths[i]} could not be renamed\")\n }\n}\n","language":"Kotlin"},{"code":"# Load the IO module\n# Replace \"<pathToIO.lm>\" with the location where the io.lm Lang module was installed to without \"<\" and \">\"\nln.loadModule(<pathToIO.lm>)\n\nfp.rename = ($from, $to) -> {\n\t$fileFrom = [[io]]::fp.openFile($from)\n\t$fileTo = [[io]]::fp.openFile($to)\n\t\n\t[[io]]::fp.rename($fileFrom, $fileTo)\n\t\n\t[[io]]::fp.closeFile($fileFrom)\n\t[[io]]::fp.closeFile($fileTo)\n}\n\nfp.rename(input.txt, output.txt)\nfp.rename(/input.txt, /output.txt)\nfp.rename(docs, mydocs)\nfp.rename(/docs, /mydocs)\n","language":"Lang"},{"code":"// move file\nlocal(f = file('input.txt'))\n#f->moveTo('output.txt')\n#f->close\n\n// move directory, just like a file\nlocal(d = dir('docs'))\n#d->moveTo('mydocs')\n\n// move file in root file system (requires permissions at user OS level)\nlocal(f = file('//input.txt'))\n#f->moveTo('//output.txt')\n#f->close\n\n// move directory in root file system (requires permissions at user OS level)\nlocal(d = file('//docs'))\n#d->moveTo('//mydocs')\n","language":"Lasso"},{"code":"(file:rename \"input.txt\" \"output.txt\")\n(file:rename \"docs\" \"mydocs\")\n(file:rename \"/input.txt\" \"/output.txt\")\n(file:rename \"/docs\" \"/mydocs\")\n","language":"LFE"},{"code":"' LB has inbuilt 'name' command, but can also run batch files\n\nnomainwin\n\nname \"input.txt\" as \"output.txt\"\nrun \"cmd.exe /c ren docs mydocs\", HIDE\nname \"C:\\input.txt\" as \"C:\\output.txt\"\nrun \"cmd.exe /c ren C:\\docs mydocs\", HIDE\n\nend\n","language":"Liberty-BASIC"},{"code":"rename file \"input.txt\" to \"output.txt\"\nrename folder \"docs\" to \"mydocs\"\nrename file \"/input.txt\" to \"/output.txt\"\nrename folder \"/docs\" to \"/mydocs\"\n","language":"LiveCode"},{"code":"|ren,\"input.txt\",\"output.txt\"\n","language":"Locomotive-Basic"},{"code":"os.rename( \"input.txt\", \"output.txt\" )\nos.rename( \"/input.txt\", \"/output.txt\" )\nos.rename( \"docs\", \"mydocs\" )\nos.rename( \"/docs\", \"/mydocs\" )\n","language":"Lua"},{"code":"Module checkit {\n Document A$={Alfa, beta}\n Save.Doc A$, \"this.aaa\"\n Print Exist(\"this.aaa\")=true\n dos \"cd \"+quote$(dir$)+\" && del this.bbb\", 100; ' using; to close dos window, and 100ms for waiting\n Name this.aaa as this.bbb\n Rem : Name \"this.aaa\" as \"this.bbb\" ' we can use strings or variables\n Print Exist(\"this.bbb\")=true\n}\ncheckit\n","language":"M2000-Interpreter"},{"code":"use FileTools in\n Rename( \"input.txt\", \"output.txt\" );\n Rename( \"docs\", \"mydocs\" );\n Rename( \"/input.txt\", \"/output.txt\" ); # assuming permissions in /\n Rename( \"/docs\", \"/mydocs\" ) # assuming permissions in /\nend use:\n","language":"Maple"},{"code":"SetDirectory[NotebookDirectory[]]\nRenameFile[\"input.txt\", \"output.txt\"]\nRenameDirectory[\"docs\", \"mydocs\"]\nSetDirectory[$RootDirectory]\nRenameFile[\"input.txt\", \"output.txt\"]\nRenameDirectory[\"docs\", \"mydocs\"]\n","language":"Mathematica"},{"code":" [STATUS, MSG, MSGID] = movefile (F1, F2);\n","language":"MATLAB"},{"code":"-- Here\nrenameFile \"input.txt\" \"output.txt\"\n-- Root\nrenameFile \"/input.txt\" \"/output.txt\"\n","language":"MAXScript"},{"code":":- module rename_file.\n:- interface.\n\n:- import_module io.\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\n\n:- import_module dir.\n\nmain(!IO) :-\n rename_file(\"input.txt\", \"output.txt\", !IO),\n rename_file(\"docs\", \"mydocs\", !IO),\n rename_file(\"/input.txt\", \"/output.txt\", !IO),\n rename_file(\"/docs\", \"/mydocs\", !IO).\n\n:- pred rename_file(string::in, string::in, io::di, io::uo) is det.\n\nrename_file(OldName, NewName, !IO) :-\n io.rename_file(OldName, NewName, Result, !IO),\n (\n Result = ok\n ;\n Result = error(Error),\n print_io_error(Error, !IO)\n ).\n\n:- pred print_io_error(io.error::in, io::di, io::uo) is det.\n\nprint_io_error(Error, !IO) :-\n io.stderr_stream(Stderr, !IO),\n io.write_string(Stderr, io.error_message(Error), !IO),\n io.nl(Stderr, !IO),\n io.set_exit_status(1, !IO).\n","language":"Mercury"},{"code":"\"input.txt\" \"output.txt\" mv\n\"docs\" \"mydocs\" mv\n\n\"/input.txt\" \"/output.txt\" mv\n\"/docs\" \"/mydocs\" mv\n","language":"Min"},{"code":" ;Local\n S X=$ZF(-1,\"rename input.txt output.txt\")\n S X=$ZF(-1,\"rename docs.dir mydocs.dir\")\n ;Root of current device\n S X=$ZF(-1,\"rename [000000]input.txt [000000]output.txt\")\n S X=$ZF(-1,\"rename [000000]docs.dir [000000]mydocs.dir\")\n","language":"MUMPS"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols binary\n\nrunSample(arg)\nreturn\n\n-- . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .\nmethod isFileRenamed(oldFile, newFile) public static returns boolean\n fo = File(oldFile)\n fn = File(newFile)\n fRenamed = fo.renameTo(fn)\n return fRenamed\n\n-- 09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)~~\nmethod runSample(arg) private static\n parse arg files\n if files = '' then files = 'input.txt output.txt F docs mydocs D /input.txt /output.txt F /docs /mydocs D'\n loop while files.length > 0\n parse files of nf ft files\n select case(ft.upper())\n when 'F' then do\n ft = 'File'\n end\n when 'D' then do\n ft = 'Directory'\n end\n otherwise do\n ft = 'File'\n end\n end\n if isFileRenamed(of, nf) then dl = 'renamed'\n else dl = 'not renamed'\n say ft ''''of'''' dl 'to' nf\n end\n\n return\n","language":"NetRexx"},{"code":"(rename-file \"./input.txt\" \"./output.txt\")\n(rename-file \"./docs\" \"./mydocs\")\n(rename-file \"/input.txt\" \"/output.txt\")\n(rename-file \"/docs\" \"/mydocs\")\n","language":"NewLISP"},{"code":"import os\n\nmoveFile(\"input.txt\", \"output.txt\")\nmoveFile(\"docs\", \"mydocs\")\n\nmoveFile(DirSep & \"input.txt\", DirSep & \"output.txt\")\nmoveFile(DirSep & \"docs\", DirSep & \"mydocs\")\n","language":"Nim"},{"code":"use IO;\nbundle Default {\n class FileExample {\n function : Main(args : String[]) ~ Nil {\n File->Rename(\"input.txt\", \"output.txt\");\n File->Rename(\"docs\", \"mydocs\");\n File->Rename(\"/input.txt\", \"/output.txt\");\n File->Rename(\"/docs\", \"/mydocs\");\n }\n }\n}\n","language":"Objeck"},{"code":"NSFileManager *fm = [NSFileManager defaultManager];\n\n// Pre-OS X 10.5\n[fm movePath:@\"input.txt\" toPath:@\"output.txt\" handler:nil];\n[fm movePath:@\"docs\" toPath:@\"mydocs\" handler:nil];\n\n// OS X 10.5+\n[fm moveItemAtPath:@\"input.txt\" toPath:@\"output.txt\" error:NULL];\n[fm moveItemAtPath:@\"docs\" toPath:@\"mydocs\" error:NULL];\n","language":"Objective-C"},{"code":"let () =\n Sys.rename \"input.txt\" \"output.txt\";\n Sys.rename \"docs\" \"mydocs\";\n Sys.rename \"/input.txt\" \"/output.txt\";\n Sys.rename \"/docs\" \"/mydocs\";\n","language":"OCaml"},{"code":"rename('docs','mydocs');\nrename('input.txt','/output.txt');\nrename('/docs','/mydocs');\n","language":"Octave"},{"code":"OS-RENAME \"input.txt\" \"output.txt\".\nOS-RENAME \"docs\" \"mydocs\".\n\nOS-RENAME \"/input.txt\" \"/output.txt\".\nOS-RENAME \"/docs\" \"/mydocs\".\n","language":"OpenEdge-Progress"},{"code":"system(\"mv input.txt output.txt\");\nsystem(\"mv /input.txt /output.txt\");\nsystem(\"mv docs mydocs\");\nsystem(\"mv /docs /mydocs\");\n","language":"PARI-GP"},{"code":"install(\"rename\",\"iss\",\"rename\");\nrename(\"input.txt\", \"output.txt\");\n","language":"PARI-GP"},{"code":" var\n f : file ; // Untyped file\n begin\n\n // as current directory\n AssignFile(f,'input.doc');\n Rename(f,'output.doc');\n\n // as root directory\n AssignFile(f,'\\input.doc');\n Rename(f,'\\output.doc');\n\n // rename a directory\n AssignFile(f,'docs');\n Rename(f,'mydocs');\n\n //rename a directory off the root\n\n AssignFile(f,'\\docs');\n Rename(f,'\\mydocs');\n\nend;\n","language":"Pascal"},{"code":"use File::Copy qw(move);\nuse File::Spec::Functions qw(catfile rootdir);\n# here\nmove 'input.txt', 'output.txt';\nmove 'docs', 'mydocs';\n# root dir\nmove (catfile rootdir, 'input.txt'), (catfile rootdir, 'output.txt');\nmove (catfile rootdir, 'docs'), (catfile rootdir, 'mydocs');\n","language":"Perl"},{"code":"(notonline)-->\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- (file i/o)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">rename_file</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"input.txt\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"output.txt\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">rename_file</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"docs\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"mydocs\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">rename_file</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"C:\\\\Copy.txt\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Copy.xxx\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">rename_file</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"C:\\\\docs\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"C:\\\\mydocs\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"_platform \"windows\" == if \"\\\\\" \"ren \" else \"/\" \"mv \" endif\nvar com var slash\n\ncom \"input.txt output.txt\" chain cmd\ncom \"docs mydocs\" chain cmd\ncom slash chain \"input.txt \" chain slash chain \"output.txt\" chain cmd\ncom slash chain \"docs \" chain slash chain \"mydocs\" chain cmd\n","language":"Phixmonti"},{"code":"<?php\nrename('input.txt', 'output.txt');\nrename('docs', 'mydocs');\nrename('/input.txt', '/output.txt');\nrename('/docs', '/mydocs');\n?>\n","language":"PHP"},{"code":"(call 'mv \"input.txt\" \"output.txt\")\n(call 'mv \"docs\" \"mydocs\")\n(call 'mv \"/input.txt\" \"/output.txt\")\n(call 'mv \"/docs\" \"/mydocs\")\n","language":"PicoLisp"},{"code":"int main(){\n mv(\"input.txt\", \"output.txt\");\n mv(\"/input.txt\", \"/output.txt\");\n mv(\"docs\", \"mydocs\");\n mv(\"/docs\", \"/mydocs\");\n}\n","language":"Pike"},{"code":"To run:\nStart up.\n\\ In the current working directory\nRename \".\\input.txt\" to \".\\output.txt\" in the file system.\nRename \".\\docs\\\" to \".\\mydocs\\\" in the file system.\n\\ In the filesystem root\nRename \"C:\\input.txt\" to \"C:\\output.txt\" in the file system.\nRename \"C:\\docs\\\" to \"C:\\mydocs\\\" in the file system.\nShut down.\n","language":"Plain-English"},{"code":"sys_file_move('inputs.txt', 'output.txt');\nsys_file_move('docs', 'mydocs');\nsys_file_move('/inputs.txt', '/output.txt');\nsys_file_move(/'docs', '/mydocs');\n","language":"Pop11"},{"code":"Rename-Item input.txt output.txt\n\n# The Rename-item has the alias ren\nren input.txt output.txt\n","language":"PowerShell"},{"code":"void setup(){\n boolean sketchfile = rename(sketchPath(\"input.txt\"), sketchPath(\"output.txt\"));\n boolean sketchfold = rename(sketchPath(\"docs\"), sketchPath(\"mydocs\"));\n // sketches will seldom have write permission to root files/folders\n boolean rootfile = rename(\"input.txt\", \"output.txt\");\n boolean rootfold = rename(\"docs\", \"mydocs\");\n // true if succeeded, false if failed\n println(sketchfile, sketchfold, rootfile, rootfold);\n}\n\nboolean rename(String oldname, String newname) {\n // File (or directory) with old name\n File file = new File(oldname);\n // File (or directory) with new name\n File file2 = new File(newname);\n // Rename file (or directory)\n boolean success = file.renameTo(file2);\n return success;\n}\n","language":"Processing"},{"code":"from java.io import File\n\ndef setup():\n # rename local file\n sketchfile = rename(sketchPath(\"input.txt\"), sketchPath(\"output.txt\"))\n # rename local folder\n sketchfold = rename(sketchPath(\"docs\"), sketchPath(\"mydocs\"))\n # rename root file (if permitted)\n rootfile = rename(\"input.txt\", \"output.txt\")\n # rename root folder (if permitted)\n rootfold = rename(\"docs\", \"mydocs\")\n\n # display results of four operations: True=success, False=fail\n println(str(sketchfile) + ' ' +\n str(sketchfold) + ' ' +\n str(rootfile) + ' ' +\n str(rootfold))\n # output:\n # True True False False\n\n\ndef rename(oldname, newname):\n # File (or directory) with old name\n file = File(oldname)\n # File (or directory) with new name\n file2 = File(newname)\n # Rename file (or directory)\n success = file.renameTo(file2)\n return success\n","language":"Processing"},{"code":"rename input.txt to output.txt\nrename docs to mydocs\n","language":"ProDOS"},{"code":"RenameFile(\"input.txt\", \"output.txt\")\nRenameFile(\"docs\\\", \"mydocs\\\")\n\nRenameFile(\"/input.txt\",\"/output.txt\")\nRenameFile(\"/docs\\\",\"/mydocs\\\")\n","language":"PureBasic"},{"code":"import os\n\nos.rename(\"input.txt\", \"output.txt\")\nos.rename(\"docs\", \"mydocs\")\n\nos.rename(os.sep + \"input.txt\", os.sep + \"output.txt\")\nos.rename(os.sep + \"docs\", os.sep + \"mydocs\")\n","language":"Python"},{"code":"import shutil\n\nshutil.move(\"input.txt\", \"output.txt\")\nshutil.move(\"docs\", \"mydocs\")\n\nshutil.move(\"/input.txt\", \"/output.txt\")\nshutil.move(\"/docs\", \"/mydocs\")\n","language":"Python"},{"code":" $ \"\nimport os\nif os.path.exists('input.txt'):\n os.rename('input.txt', 'output.txt')\n\" python\n\n $ \"\nimport os\nif os.path.exists('docs'):\n os.rename('docs', 'mydocs')\n\" python\n\n $ \"\nimport os\nif os.path.exists('/input.txt'):\n os.rename('/input.txt', '/output.txt')\n\" python\n\n $ \"\nimport os\nif os.path.exists('/docs'):\n os.rename('/docs', '/mydocs')\n\" python\n","language":"Quackery"},{"code":"#lang racket\n\n(rename-file-or-directory \"input.txt\" \"output.txt\")\n(rename-file-or-directory \"docs\" \"mydocs\")\n\n;; find the filesystem roots, and pick the first one\n(define root (first (filesystem-root-list)))\n\n(rename-file-or-directory (build-path root \"input.txt\")\n (build-path root \"output.txt\"))\n(rename-file-or-directory (build-path root \"docs\")\n (build-path root \"mydocs\"))\n","language":"Racket"},{"code":"rename 'input.txt', 'output.txt';\nrename 'docs', 'mydocs';\nrename '/input.txt', '/output.txt';\nrename '/docs', '/mydocs';\n","language":"Raku"},{"code":"`mv /path/to/file/oldfile /path/to/file/newfile` shell\n","language":"Raven"},{"code":"Sub Renamer()\n Dim f As FolderItem, r As FolderItem\n\n f = GetFolderItem(\"input.txt\")\n 'Changing a FolderItem's Name attribute renames the file or directory.\n If f.Exists Then f.Name = \"output.txt\"\n 'Files and directories are handled almost identically in RB.\n f = GetFolderItem(\"docs\")\n If f.Exists Then f.Name = \"mydocs\"\n\n 'Jump through hoops to find the root directory.\n r = RootDir(GetFolderItem(\".\"))\n\n f = r.Child(\"input.txt\")\n 'Renaming in a different directory identical to renaming in current directory.\n If f.Exists Then f.Name = \"output.txt\"\n f = r.Child(\"docs\")\n If f.Exists Then f.Name = \"mydocs\"\nEnd Sub\n\nFunction RootDir(what As FolderItem) As FolderItem\n 'RB doesn't have an easy way to find the root of the current drive;\n 'not an issue under *nix but troublesome under Windows.\n If what.Parent <> Nil Then 'Nil = no parent = root.\n Return RootDir(what.Parent) 'Recursive.\n Else\n Return what\n End If\nEnd Function\n","language":"REALbasic"},{"code":"rename %input.txt %output.txt\nrename %docs/ %mydocs/\n\n; Unix. Note that there's no path specification used for the\n; new name. \"Rename\" is not \"move\".\n\nrename %/input.txt %output.txt\nrename %/docs/ %mydocs/\n\n; DOS/Windows:\n\nrename %/c/input.txt %output.txt\nrename %/c/docs/ %mydocs/\n\n; Because REBOL treats data access schemes as uniformly as possible,\n; you can do tricks like this:\n\nrename ftp://username:password@ftp.site.com/www/input.txt %output.txt\nrename ftp://username:password@ftp.site.com/www/docs/ %mydocs/\n","language":"REBOL"},{"code":"/*REXX program renames a file & a directory (in current dir & in root).*/\ntrace off /*suppress error messages, bad RC*/\n\n do 2 /* [↓] perform this code twice. */\n 'RENAME' \"input.txt output.txt\" /*rename a particular DOS file. */\n 'MOVE' \"\\docs \\mydocs\" /*use (DOS) MOVE to rename a dir.*/\n 'CD' \"\\\" /*for 2nd pass, change──►root dir*/\n end /*2*/\n /*stick a fork in it, we're done.*/\n","language":"REXX"},{"code":"/*REXX program renames a file & a directory (in current dir & in root).*/\ntrace off /*suppress error messages, bad RC*/\n$ = '2> NUL' /*used to suppress error messages*/\n\n do 2 /* [↓] perform this code twice. */\n 'RENAME' \"input.txt output.txt\" $ /*rename a particular DOS file. */\n 'MOVE' \"\\docs \\mydocs\" $ /*use (DOS) MOVE to rename a dir.*/\n 'CD' \"\\\" $ /*for 2nd pass, change──►root dir*/\n end /*2*/\n /*stick a fork in it, we're done.*/\n","language":"REXX"},{"code":" rename(\"input.txt\", \"output.txt\")\n rename(\"docs\", \"mydocs\")\n rename(\"/input.txt\", \"/output.txt\")\n rename(\"/docs\", \"/mydocs\")\n","language":"Ring"},{"code":"File.rename('input.txt', 'output.txt')\nFile.rename('/input.txt', '/output.txt')\nFile.rename('docs', 'mydocs')\nFile.rename('/docs', '/mydocs')\n","language":"Ruby"},{"code":"require 'fileutils'\nmoves = { \"input.txt\" => \"output.txt\", \"/input.txt\" => \"/output.txt\", \"docs\" => \"mydocs\",\"/docs\" => \"/mydocs\"}\nmoves.each{ |src, dest| FileUtils.move( src, dest, :verbose => true ) }\n","language":"Ruby"},{"code":"a$ = shell$(\"RENAME input.txt output.txt\")\na$ = shell$(\"RENAME docs mydocs\")\na$ = shell$(\"RENAME \\input.txt \\output.txt\")\na$ = shell$(\"RENAME \\docs \\mydocs\")\n","language":"Run-BASIC"},{"code":"use std::fs;\n\nfn main() {\n let err = \"File move error\";\n fs::rename(\"input.txt\", \"output.txt\").ok().expect(err);\n fs::rename(\"docs\", \"mydocs\").ok().expect(err);\n fs::rename(\"/input.txt\", \"/output.txt\").ok().expect(err);\n fs::rename(\"/docs\", \"/mydocs\").ok().expect(err);\n}\n","language":"Rust"},{"code":"import scala.language.implicitConversions\nimport java.io.File\n\nobject Rename0 {\n def main(args: Array[String]) { // The implicit causes every String to File mapping,\n implicit def file(s: String) = new File(s) // will be converted to new File(String)\n \"myfile.txt\" renameTo \"anotherfile.txt\"\n \"/tmp/myfile.txt\" renameTo \"/tmp/anotherfile.txt\"\n \"mydir\" renameTo \"anotherdir\"\n \"/tmp/mydir\" renameTo \"/tmp/anotherdir\"\n }\n}\n","language":"Scala"},{"code":"object Rename1 {\n def main(args: Array[String]) {\n List((\"myfile.txt\", \"anotherfile.txt\"),(\"/tmp/myfile.txt\", \"/tmp/anotherfile.txt\"),\n (\"mydir\", \"anotherdir\"),(\"/tmp/mydir\", \"/tmp/anotherdir\")).foreach{ case (oldf, newf) ⇒\n new java.io.File(oldf) renameTo new java.io.File(newf)\n }\n }\n}\n","language":"Scala"},{"code":"(rename-file \"input.txt\" \"output.txt\")\n(rename-file \"docs\" \"mydocs\")\n(rename-file \"/input.txt\" \"/output.txt\")\n(rename-file \"/docs\" \"/mydocs\")\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n include \"osfiles.s7i\";\n\nconst proc: main is func\n begin\n moveFile(\"input.txt\", \"output.txt\");\n moveFile(\"docs\", \"mydocs\");\n moveFile(\"/input.txt\", \"/output.txt\");\n moveFile(\"/docs\", \"/mydocs\");\n end func;\n","language":"Seed7"},{"code":"# Here\nFile.rename('input.txt', 'output.txt');\nFile.rename('docs', 'mydocs');\n\n# Root dir\nFile.rename(Dir.root + %f'input.txt', Dir.root + %f'output.txt');\nFile.rename(Dir.root + %f'docs', Dir.root + %f'mydocs');\n","language":"Sidef"},{"code":"(File newNamed: 'input.txt') renameTo: 'output.txt'.\n(File newNamed: '/input.txt') renameTo: '/output.txt'.\n(Directory newNamed: 'docs') renameTo: 'mydocs'.\n(Directory newNamed: '/docs') renameTo: '/mydocs'.\n","language":"Slate"},{"code":"File rename: 'input.txt' to: 'output.txt'.\nFile rename: 'docs' to: 'mydocs'.\n\"as for other example, this works on systems\n where the root is / ...\"\nFile rename: '/input.txt' to: '/output.txt'.\nFile rename: '/docs' to: '/mydocs'\n","language":"Smalltalk"},{"code":"'input.txt' asFilename renameTo: 'output.txt'.\n'docs' asFilename renameTo: 'mydocs'.\n'/input.txt' asFilename renameTo: '/output.txt'.\n'/docs' asFilename renameTo: '/mydocs'\n","language":"Smalltalk"},{"code":"'input.txt' asFileReference renameTo: 'output.txt'.\n'docs' asFileReference renameTo: 'mydocs'.\n'/input.txt' asFileReference renameTo: '/output.txt'.\n'/docs' asFileReference renameTo: '/mydocs'\n","language":"Smalltalk"},{"code":"OS.FileSys.rename {old = \"input.txt\", new = \"output.txt\"};\nOS.FileSys.rename {old = \"docs\", new = \"mydocs\"};\nOS.FileSys.rename {old = \"/input.txt\", new = \"/output.txt\"};\nOS.FileSys.rename {old = \"/docs\", new = \"/mydocs\"};\n","language":"Standard-ML"},{"code":"!ren input.txt output.txt\n!ren docs mydocs\n","language":"Stata"},{"code":"file rename inputs.txt output.txt\nfile rename docs mydocs\n\nfile rename [file nativename /inputs.txt] [file nativename /output.txt]\nfile rename [file nativename /docs] [file nativename /mydocs]\n","language":"Tcl"},{"code":"file rename inputs.txt output.txt\nfile rename docs mydocs\n\nfile rename /inputs.txt /output.txt\nfile rename /docs /mydocs\n","language":"Tcl"},{"code":"needs shell\n\" input.txt\" \" output.txt\" rename\n\" /input.txt\" \" /output.txt\" rename\n\n\" docs\" \" mydocs\" rename\n\" /docs\" \" /mydocs\" rename\n","language":"Toka"},{"code":"fileCopy(\"Input.txt\", \"Output.txt\");\nfileDelete(\"Input.txt\");\n\nfor(%File = FindFirstFile(\"Path/*.*\"); %File !$= \"\"; %File = FindNextFile(\"Path/*.*\"))\n{\n\tfileCopy(%File, \"OtherPath/\" @ %File);\n\tfileDelete(%File);\n}\n","language":"TorqueScript"},{"code":"$$ MODE TUSCRIPT\n- rename file\nERROR/STOP RENAME (\"input.txt\",\"output.txt\")\n- rename directory\nERROR/STOP RENAME (\"docs\",\"mydocs\",-std-)\n","language":"TUSCRIPT"},{"code":"(rename-path \"input.txt\" \"output.txt\")\n;; Windows (MinGW based port)\n(rename-path \"C:\\\\input.txt\" \"C:\\\\output.txt\")\n;; Unix; Windows (Cygwin port)\n(rename-path \"/input.txt\" \"/output.txt\"))\n","language":"TXR"},{"code":"mv input.txt output.txt\nmv /input.txt /output.txt\nmv docs mydocs\nmv /docs /mydocs\n","language":"UNIX-Shell"},{"code":"// In current directory\nFile_Rename(\"input.txt\", \"output.txt\")\nFile_Rename(\"docs\", \"mydocs\")\n\n// In the root directory\nFile_Rename(\"/input.txt\", \"/output.txt\")\nFile_Rename(\"/docs\", \"/mydocs\")\n","language":"Vedit-macro-language"},{"code":"'Current Directory\nIO.Directory.Move(\"docs\", \"mydocs\")\nIO.File.Move(\"input.txt\", \"output.txt\")\n\n'Root\nIO.Directory.Move(\"\\docs\", \"\\mydocs\")\nIO.File.Move(\"\\input.txt\", \"\\output.txt\")\n\n'Root, platform independent\nIO.Directory.Move(IO.Path.DirectorySeparatorChar & \"docs\", _\n IO.Path.DirectorySeparatorChar & \"mydocs\")\nIO.File.Move(IO.Path.DirectorySeparatorChar & \"input.txt\", _\n IO.Path.DirectorySeparatorChar & \"output.txt\")\n","language":"Visual-Basic-.NET"},{"code":"import \"./ioutil\" for FileUtil\n\nFileUtil.move(\"input.txt\", \"output.txt\")\nFileUtil.move(\"/input.txt\", \"/output.txt\")\n","language":"Wren"},{"code":"if peek$(\"os\") = \"windows\" then\n slash$ = \"\\\\\" : com$ = \"ren \"\nelse\n slash$ = \"/\" : com$ = \"mv \"\nend if\n\nsystem(com$ + \"input.txt output.txt\")\nsystem(com$ + \"docs mydocs\")\nsystem(com$ + slash$ + \"input.txt \" + slash$ + \"output.txt\")\nsystem(com$ + slash$ + \"docs \" + slash$ + \"mydocs\")\n","language":"Yabasic"},{"code":"rename, \"input.txt\", \"output.txt\";\nrename, \"/input.txt\", \"/output.txt\";\nrename, \"docs\", \"mydocs\";\nrename, \"/docs\", \"/mydocs\";\n","language":"Yorick"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Rename_a_file\\nnote: File System Operations\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nRename:\\n:::* a file called '''input.txt''' into '''output.txt''' and \\n:::* a directory called '''docs''' into '''mydocs'''.\\n\\n\\nThis should be done twice: \\nonce \\\"here\\\", i.e. in the current working directory and once in the filesystem root.\\n\\nIt can be assumed that the user has the rights to do so.\\n\\n(In unix-type systems, only the user root would have\\nsufficient permissions in the filesystem root.)\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"fs:rename(‘input.txt’, ‘output.txt’)\\nfs:rename(‘docs’, ‘mydocs’)\\n\\nfs:rename(fs:path:sep‘input.txt’, fs:path:sep‘output.txt’)\\nfs:rename(fs:path:sep‘docs’, fs:path:sep‘mydocs’)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"INCLUDE \\\"D2:IO.ACT\\\" ;from the Action! Tool Kit\\n\\nPROC Dir(CHAR ARRAY filter)\\n BYTE dev=[1]\\n CHAR ARRAY line(255)\\n\\n Close(dev)\\n Open(dev,filter,6)\\n DO\\n InputSD(dev,line)\\n PrintE(line)\\n IF line(0)=0 THEN\\n EXIT\\n FI\\n OD\\n Close(dev)\\nRETURN\\n\\nPROC Main()\\n CHAR ARRAY filter=\\\"D:*.*\\\",\\n cmd=\\\"D:INPUT.TXT OUTPUT.TXT\\\"\\n\\n Put(125) PutE() ;clear screen\\n\\n PrintF(\\\"Dir \\\"\\\"%S\\\"\\\"%E\\\",filter)\\n Dir(filter)\\n\\n PrintF(\\\"Rename \\\"\\\"%S\\\"\\\"%E%E\\\",cmd)\\n Rename(cmd)\\n\\n PrintF(\\\"Dir \\\"\\\"%S\\\"\\\"%E\\\",filter)\\n Dir(filter)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Directories; use Ada.Directories;\\n ...\\nRename (\\\"input.txt\\\", \\\"output.txt\\\");\\nRename (\\\"docs\\\", \\\"mydocs\\\");\\nRename (\\\"/input.txt\\\", \\\"/output.txt\\\");\\nRename (\\\"/docs\\\", \\\"/mydocs\\\");\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"main:(\\n PROC rename = (STRING source name, dest name)INT:\\n BEGIN\\n FILE actual file;\\n INT errno = open(actual file, source name, stand back channel);\\n IF errno NE 0 THEN\\n errno\\n ELSE\\n IF reidf possible(actual file) THEN\\n reidf(actual file, dest name); # change the identification of the book #\\n errno\\n ELSE\\n close(actual file);\\n -1\\n FI\\n FI\\n END;\\n rename(\\\"input.txt\\\", \\\"output.txt\\\");\\n rename(\\\"/input.txt\\\", \\\"/output.txt\\\");\\n rename(\\\"docs\\\", \\\"mydocs\\\");\\n rename(\\\"/docs\\\", \\\"/mydocs\\\")\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"RENAME INPUT.TXT,OUTPUT.TXT\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"10 PRINT CHR$ (4)\\\"RENAME INPUT.TXT,OUTPUT.TXT\\\"\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"10 PRINT CHR$ (4)\\\"RENAME INPUT.TXT,OUTPUT.TXT\\\"\\n20 PRINT CHR$ (4)\\\"RENAME DOCS,MYDOCS\\\"\\n30 PRINT CHR$ (4)\\\"PREFIX /\\\"\\n40 PRINT CHR$ (4)\\\"RENAME INPUT.TXT,OUTPUT.TXT\\\"\\n50 PRINT CHR$ (4)\\\"RENAME DOCS,MYDOCS\\\"\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"fileFrom: \\\"input.txt\\\"\\nfileTo: \\\"output.txt\\\"\\ndocsFrom: \\\"docs\\\"\\ndocsTo: \\\"mydocs\\\"\\n\\nrename fileFrom fileTo\\nrename.directory docsFrom docsTo\\n\\nrename join.path [\\\"/\\\" fileFrom]\\n join.path [\\\"/\\\" fileTo]\\n\\nrename.directory join.path [\\\"/\\\" docsFrom]\\n join.path [\\\"/\\\" docsTo]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"FileMove, oldname, newname\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"$ awk 'BEGIN{system(\\\"mv input.txt output.txt\\\")}'\\n$ awk 'BEGIN{system(\\\"mv docs mydocs\\\")}'\\n$ awk 'BEGIN{system(\\\"mv /input.txt /output.txt\\\")}'\\n$ awk 'BEGIN{system(\\\"mv docs mydocs\\\")}'\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"RENAME \\\"input.txt\\\" TO \\\"output.txt\\\"\\nRENAME \\\"/input.txt\\\" TO \\\"/output.txt\\\"\\nRENAME \\\"docs\\\" TO \\\"mydocs\\\"\\nRENAME \\\"/docs\\\" TO \\\"/mydocs\\\"\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"NAME \\\"input.txt\\\" AS \\\"output.txt\\\"\\nNAME \\\"\\\\input.txt\\\" AS \\\"\\\\output.txt\\\"\\nNAME \\\"docs\\\" AS \\\"mydocs\\\"\\nNAME \\\"\\\\docs\\\" AS \\\"\\\\mydocs\\\"\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"ren input.txt output.txt\\nren \\\\input.txt output.txt\\nren docs mydocs\\nren \\\\docs mydocs\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" *RENAME input.txt output.txt\\n *RENAME \\\\input.txt \\\\output.txt\\n *RENAME docs. mydocs.\\n *RENAME \\\\docs. \\\\mydocs.\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \" OSCLI \\\"RENAME input.txt output.txt\\\"\\n OSCLI \\\"RENAME \\\\input.txt \\\\output.txt\\\"\\n OSCLI \\\"RENAME docs. mydocs.\\\"\\n OSCLI \\\"RENAME \\\\docs. \\\\mydocs.\\\"\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"ren$(\\\"input.txt\\\".\\\"output.txt\\\") { 'ren' is based on standard C function 'rename()' }\\nren$(docs.mydocs) { No quotes needed: names don't contain dots or colons. }\\nren$(\\\"d:\\\\\\\\input.txt\\\".\\\"d:\\\\\\\\output.txt\\\") { Backslash is escape character, so we need to escape it. }\\nren$(@\\\"d:\\\\docs\\\".@\\\"d:\\\\mydocs\\\") { @ used as syntactic sugar as in C# for inhibiting escape. }\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nint main()\\n{\\n rename(\\\"input.txt\\\", \\\"output.txt\\\");\\n rename(\\\"docs\\\", \\\"mydocs\\\");\\n rename(\\\"/input.txt\\\", \\\"/output.txt\\\");\\n rename(\\\"/docs\\\", \\\"/mydocs\\\");\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <cstdio>\\n\\nint main()\\n{\\n std::rename(\\\"input.txt\\\", \\\"output.txt\\\");\\n std::rename(\\\"docs\\\", \\\"mydocs\\\");\\n std::rename(\\\"/input.txt\\\", \\\"/output.txt\\\");\\n std::rename(\\\"/docs\\\", \\\"/mydocs\\\");\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include \\\"boost/filesystem.hpp\\\"\\n\\nint main()\\n{\\n boost::filesystem::rename(\\n boost::filesystem::path(\\\"input.txt\\\"),\\n boost::filesystem::path(\\\"output.txt\\\"));\\n boost::filesystem::rename(\\n boost::filesystem::path(\\\"docs\\\"),\\n boost::filesystem::path(\\\"mydocs\\\"));\\n boost::filesystem::rename(\\n boost::filesystem::path(\\\"/input.txt\\\"),\\n boost::filesystem::path(\\\"/output.txt\\\"));\\n boost::filesystem::rename(\\n boost::filesystem::path(\\\"/docs\\\"),\\n boost::filesystem::path(\\\"/mydocs\\\"));*/\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.IO;\\n\\nclass Program {\\n static void Main(string[] args) {\\n File.Move(\\\"input.txt\\\",\\\"output.txt\\\");\\n File.Move(@\\\"\\\\input.txt\\\",@\\\"\\\\output.txt\\\");\\n\\n Directory.Move(\\\"docs\\\",\\\"mydocs\\\");\\n Directory.Move(@\\\"\\\\docs\\\",@\\\"\\\\mydocs\\\");\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"FRename( \\\"input.txt\\\",\\\"output.txt\\\")\\nor\\nRENAME input.txt TO output.txt\\n\\nFRename(\\\"\\\\input.txt\\\",\\\"\\\\output.txt\\\")\\nor\\nRENAME \\\\input.txt TO \\\\output.txt\\n\",\n \"language\": \"Clipper\"\n },\n {\n \"code\": \"(import '(java.io File))\\n\\n(.renameTo (File. \\\"input.txt\\\") (File. \\\"output.txt\\\"))\\n(.renameTo (File. \\\"docs\\\") (File. \\\"mydocs\\\"))\\n\\n(.renameTo\\n (File. (str (File/separator) \\\"input.txt\\\"))\\n (File. (str (File/separator) \\\"output.txt\\\")))\\n(.renameTo\\n (File. (str (File/separator) \\\"docs\\\"))\\n (File. (str (File/separator) \\\"mydocs\\\")))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"OPEN 15,<Device>,15,\\\"R<DRIVE>:FilenameOLD=FilenameNEW\\\":CLOSE 15\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"RENAME <FilenameOLD>[,D<DRIVE>] TO <FilenameNEW> [ON U<Deviceadress>]\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"(rename-file \\\"input.txt\\\" \\\"output.txt\\\")\\n(rename-file \\\"docs\\\" \\\"mydocs\\\")\\n(rename-file \\\"/input.txt\\\" \\\"/output.txt\\\")\\n(rename-file \\\"/docs\\\" \\\"/mydocs\\\")\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"std.file.rename(\\\"input.txt\\\",\\\"output.txt\\\");\\nstd.file.rename(\\\"/input.txt\\\",\\\"/output.txt\\\");\\nstd.file.rename(\\\"docs\\\",\\\"mydocs\\\");\\nstd.file.rename(\\\"/docs\\\",\\\"/mydocs\\\");\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"XCALL RENAM (\\\"output.txt\\\",\\\"input.txt\\\")\\n.IFDEF UNIX\\nXCALL SPAWN (\\\"mv docs mydocs\\\")\\n.ENDC\\n.IFDEF DOS\\nXCALL SPAWN (\\\"ren docs mydocs\\\")\\n.ENDC\\n.IFDEF VMS\\nXCALL SPAWN (\\\"rename docs.dir mydocs.dir\\\")\\n.ENDC\\n\",\n \"language\": \"DBL\"\n },\n {\n \"code\": \"rename input.txt output.txt\\nrename docs.dir mydocs.dir\\nrename [000000]input.txt [000000]output.txt\\nrename [000000]docs.dir [000000]mydocs.dir\\n\",\n \"language\": \"DCL\"\n },\n {\n \"code\": \"program RenameFile;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses SysUtils;\\n\\nbegin\\n SysUtils.RenameFile('input.txt', 'output.txt');\\n SysUtils.RenameFile('\\\\input.txt', '\\\\output.txt');\\n\\n // RenameFile works for both files and folders\\n SysUtils.RenameFile('docs', 'MyDocs');\\n SysUtils.RenameFile('\\\\docs', '\\\\MyDocs');\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"for where in [<file:.>, <file:///>] {\\n where[\\\"input.txt\\\"].renameTo(where[\\\"output.txt\\\"], null)\\n where[\\\"docs\\\"].renameTo(where[\\\"mydocs\\\"], null)\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"File.rename \\\"input.txt\\\",\\\"output.txt\\\"\\nFile.rename \\\"docs\\\", \\\"mydocs\\\"\\nFile.rename \\\"/input.txt\\\", \\\"/output.txt\\\"\\nFile.rename \\\"/docs\\\", \\\"/mydocs\\\"\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"(rename-file \\\"input.txt\\\" \\\"output.txt\\\")\\n(rename-file \\\"/input.txt\\\" \\\"/output.txt\\\")\\n(rename-file \\\"docs\\\" \\\"mydocs\\\")\\n(rename-file \\\"/docs\\\" \\\"/mydocs\\\")\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"file:rename(\\\"input.txt\\\",\\\"output.txt\\\"),\\nfile:rename( \\\"docs\\\", \\\"mydocs\\\" ),\\nfile:rename( \\\"/input.txt\\\", \\\"/output.txt\\\" ),\\nfile:rename( \\\"/docs\\\", \\\"/mydocs\\\" ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"open System.IO\\n\\n[<EntryPoint>]\\nlet main args =\\n File.Move(\\\"input.txt\\\",\\\"output.txt\\\")\\n File.Move(@\\\"\\\\input.txt\\\",@\\\"\\\\output.txt\\\")\\n Directory.Move(\\\"docs\\\",\\\"mydocs\\\")\\n Directory.Move(@\\\"\\\\docs\\\",@\\\"\\\\mydocs\\\")\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"\\\"\\\" \\\"/\\\" [\\n [ \\\"input.txt\\\" \\\"output.txt\\\" move-file \\\"docs\\\" \\\"mydocs\\\" move-file ] with-directory\\n] bi@\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"class Rename\\n{\\n public static Void main ()\\n {\\n // rename file/dir in current directory\\n File.rename(\\\"input.txt\\\".toUri).rename(\\\"output.txt\\\")\\n File.rename(\\\"docs/\\\".toUri).rename(\\\"mydocs/\\\")\\n // rename file/dir in root directory\\n File.rename(\\\"/input.txt\\\".toUri).rename(\\\"/output.txt\\\")\\n File.rename(\\\"/docs/\\\".toUri).rename(\\\"/mydocs/\\\")\\n }\\n}\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \" s\\\" input.txt\\\" s\\\" output.txt\\\" rename-file throw\\ns\\\" /input.txt\\\" s\\\" /output.txt\\\" rename-file throw\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" PROGRAM EX_RENAME\\n CALL RENAME('input.txt','output.txt')\\n CALL RENAME('docs','mydocs')\\n CALL RENAME('/input.txt','/output.txt')\\n CALL RENAME('/docs','/mydocs')\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nDim result As Long\\nresult = Name(\\\"input.txt\\\", \\\"output.txt\\\")\\nIf result <> 0 Then\\n Print \\\"Renaming file failed\\\"\\nEnd If\\n\\nresult = Name(\\\"docs\\\", \\\"mydocs\\\")\\nIf result <> 0 Then\\n Print \\\"Renaming directory failed\\\"\\nEnd If\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"CFURLRef inputText, outputText, docs, myDocs\\ninputText = fn URLFileURLWithPath( @\\\"~/Desktop/input.txt\\\" )\\noutputText = fn URLFileURLWithPath( @\\\"~/Desktop/output.txt\\\" )\\ndocs = fn URLFileURLWithPath( @\\\"~/Desktop/docs/\\\" )\\nmyDocs = fn URLFileURLWithPath( @\\\"~/Desktop/myDocs/\\\" )\\n\\nfn FileManagerMoveItemAtURL( inputText, outputText )\\nfn FileManagerMoveItemAtURL( docs, myDocs )\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"package main\\nimport \\\"os\\\"\\n\\nfunc main() {\\n os.Rename(\\\"input.txt\\\", \\\"output.txt\\\")\\n os.Rename(\\\"docs\\\", \\\"mydocs\\\")\\n os.Rename(\\\"/input.txt\\\", \\\"/output.txt\\\")\\n os.Rename(\\\"/docs\\\", \\\"/mydocs\\\")\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"['input.txt':'output.txt', 'docs':'mydocs'].each { src, dst ->\\n ['.', ''].each { dir ->\\n new File(\\\"$dir/$src\\\").renameTo(new File(\\\"$dir/$dst\\\"))\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"['input.txt':'output.txt', 'docs':'mydocs'].each { src, dst ->\\n ['.', ''].each { dir ->\\n new AntBuilder().move(file:\\\"$dir/$src\\\", toFile:\\\"$dir/$dst\\\")\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"FRename( \\\"input.txt\\\",\\\"output.txt\\\")\\n// or\\nRENAME input.txt TO output.txt\\n\\nFRename( hb_ps() + \\\"input.txt\\\", hb_ps() + \\\"output.txt\\\")\\n\",\n \"language\": \"Harbour\"\n },\n {\n \"code\": \"import System.IO\\nimport System.Directory\\n\\nmain = do\\n renameFile \\\"input.txt\\\" \\\"output.txt\\\"\\n renameDirectory \\\"docs\\\" \\\"mydocs\\\"\\n renameFile \\\"/input.txt\\\" \\\"/output.txt\\\"\\n renameDirectory \\\"/docs\\\" \\\"/mydocs\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"WRITE(FIle='input.txt', REName='.\\\\output.txt')\\nSYSTEM(DIR='E:\\\\HicEst\\\\Rosetta')\\nWRITE(FIle='.\\\\docs', REName='.\\\\mydocs')\\n\\nWRITE(FIle='\\\\input.txt', REName='\\\\output.txt')\\nSYSTEM(DIR='\\\\')\\nWRITE(FIle='\\\\docs', REName='\\\\mydocs')\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"every dir := ![\\\"./\\\",\\\"/\\\"] do {\\n rename(f := dir || \\\"input.txt\\\", dir || \\\"output.txt\\\") |stop(\\\"failure for file rename \\\",f)\\n rename(f := dir || \\\"docs\\\", dir || \\\"mydocs\\\") |stop(\\\"failure for directory rename \\\",f)\\n }\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"// rename file in current directory\\nf := File with(\\\"input.txt\\\")\\nf moveTo(\\\"output.txt\\\")\\n\\n// rename file in root directory\\nf := File with(\\\"/input.txt\\\")\\nf moveTo(\\\"/output.txt\\\")\\n\\n// rename directory in current directory\\nd := Directory with(\\\"docs\\\")\\nd moveTo(\\\"mydocs\\\")\\n\\n// rename directory in root directory\\nd := Directory with(\\\"/docs\\\")\\nd moveTo(\\\"/mydocs\\\")\\n\",\n \"language\": \"Io\"\n },\n {\n \"code\": \"frename=: 4 : 0\\n if. x -: y do. return. end.\\n if. IFUNIX do.\\n hostcmd=. [: 2!:0 '('\\\"_ , ] , ' || true)'\\\"_\\n hostcmd 'mv \\\"',y,'\\\" \\\"',x,'\\\"'\\n else.\\n 'kernel32 MoveFileA i *c *c' 15!:0 y;x\\n end.\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"'output.txt' frename 'input.txt'\\n'/output.txt' frename '/input.txt'\\n'mydocs' frename 'docs'\\n'/mydocs' frename '/docs'\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.io.File;\\npublic class FileRenameTest {\\n public static boolean renameFile(String oldname, String newname) {\\n // File (or directory) with old name\\n File file = new File(oldname);\\n\\n // File (or directory) with new name\\n File file2 = new File(newname);\\n\\n // Rename file (or directory)\\n boolean success = file.renameTo(file2);\\n return success;\\n }\\n public static void test(String type, String oldname, String newname) {\\n System.out.println(\\\"The following \\\" + type + \\\" called \\\" + oldname +\\n ( renameFile(oldname, newname) ? \\\" was renamed as \\\" : \\\" could not be renamed into \\\")\\n + newname + \\\".\\\"\\n );\\n }\\n public static void main(String args[]) {\\n test(\\\"file\\\", \\\"input.txt\\\", \\\"output.txt\\\");\\n test(\\\"file\\\", File.separator + \\\"input.txt\\\", File.separator + \\\"output.txt\\\");\\n test(\\\"directory\\\", \\\"docs\\\", \\\"mydocs\\\");\\n test(\\\"directory\\\", File.separator + \\\"docs\\\" + File.separator, File.separator + \\\"mydocs\\\" + File.separator);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var fso = new ActiveXObject(\\\"Scripting.FileSystemObject\\\")\\nfso.MoveFile(\\\"input.txt\\\", \\\"output.txt\\\")\\nfso.MoveFile(\\\"c:/input.txt\\\", \\\"c:/output.txt\\\")\\nfso.MoveFolder(\\\"docs\\\", \\\"mydocs\\\")\\nfso.MoveFolder(\\\"c:/docs\\\", \\\"c:/mydocs\\\")\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"\\\"input.txt\\\" \\\"output.txt\\\" frename\\n\\\"/input.txt\\\" \\\"/output.txt\\\" frename\\n\\\"docs\\\" \\\"mydocs\\\" frename\\n\\\"/docs\\\" \\\"/mydocs\\\" frename.\\n\",\n \"language\": \"Joy\"\n },\n {\n \"code\": \"/* File rename, in jsish */\\ntry { File.rename('input.txt', 'output.txt', false); } catch (str) { puts(str); }\\n\\nexec('touch input.txt');\\nputs(\\\"overwrite set true if output.txt exists\\\");\\nFile.rename('input.txt', 'output.txt', true);\\n\\ntry { File.rename('docs', 'mydocs', false); } catch (str) { puts(str); }\\ntry { File.rename('/docs', '/mydocs', false); } catch (str) { puts(str); }\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"mv(\\\"input.txt\\\", \\\"output.txt\\\")\\nmv(\\\"docs\\\", \\\"mydocs\\\")\\nmv(\\\"/input.txt\\\", \\\"/output.txt\\\")\\nmv(\\\"/docs\\\", \\\"/mydocs\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\n/* testing on Windows 10 which needs administrative privileges\\n to rename files in the root */\\n\\nimport java.io.File\\n\\nfun main(args: Array<String>) {\\n val oldPaths = arrayOf(\\\"input.txt\\\", \\\"docs\\\", \\\"c:\\\\\\\\input.txt\\\", \\\"c:\\\\\\\\docs\\\")\\n val newPaths = arrayOf(\\\"output.txt\\\", \\\"mydocs\\\", \\\"c:\\\\\\\\output.txt\\\", \\\"c:\\\\\\\\mydocs\\\")\\n var oldFile: File\\n var newFile: File\\n for (i in 0 until oldPaths.size) {\\n oldFile = File(oldPaths[i])\\n newFile = File(newPaths[i])\\n if (oldFile.renameTo(newFile))\\n println(\\\"${oldPaths[i]} successfully renamed to ${newPaths[i]}\\\")\\n else\\n println(\\\"${oldPaths[i]} could not be renamed\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"# Load the IO module\\n# Replace \\\"<pathToIO.lm>\\\" with the location where the io.lm Lang module was installed to without \\\"<\\\" and \\\">\\\"\\nln.loadModule(<pathToIO.lm>)\\n\\nfp.rename = ($from, $to) -> {\\n\\t$fileFrom = [[io]]::fp.openFile($from)\\n\\t$fileTo = [[io]]::fp.openFile($to)\\n\\t\\n\\t[[io]]::fp.rename($fileFrom, $fileTo)\\n\\t\\n\\t[[io]]::fp.closeFile($fileFrom)\\n\\t[[io]]::fp.closeFile($fileTo)\\n}\\n\\nfp.rename(input.txt, output.txt)\\nfp.rename(/input.txt, /output.txt)\\nfp.rename(docs, mydocs)\\nfp.rename(/docs, /mydocs)\\n\",\n \"language\": \"Lang\"\n },\n {\n \"code\": \"// move file\\nlocal(f = file('input.txt'))\\n#f->moveTo('output.txt')\\n#f->close\\n\\n// move directory, just like a file\\nlocal(d = dir('docs'))\\n#d->moveTo('mydocs')\\n\\n// move file in root file system (requires permissions at user OS level)\\nlocal(f = file('//input.txt'))\\n#f->moveTo('//output.txt')\\n#f->close\\n\\n// move directory in root file system (requires permissions at user OS level)\\nlocal(d = file('//docs'))\\n#d->moveTo('//mydocs')\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"(file:rename \\\"input.txt\\\" \\\"output.txt\\\")\\n(file:rename \\\"docs\\\" \\\"mydocs\\\")\\n(file:rename \\\"/input.txt\\\" \\\"/output.txt\\\")\\n(file:rename \\\"/docs\\\" \\\"/mydocs\\\")\\n\",\n \"language\": \"LFE\"\n },\n {\n \"code\": \"' LB has inbuilt 'name' command, but can also run batch files\\n\\nnomainwin\\n\\nname \\\"input.txt\\\" as \\\"output.txt\\\"\\nrun \\\"cmd.exe /c ren docs mydocs\\\", HIDE\\nname \\\"C:\\\\input.txt\\\" as \\\"C:\\\\output.txt\\\"\\nrun \\\"cmd.exe /c ren C:\\\\docs mydocs\\\", HIDE\\n\\nend\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"rename file \\\"input.txt\\\" to \\\"output.txt\\\"\\nrename folder \\\"docs\\\" to \\\"mydocs\\\"\\nrename file \\\"/input.txt\\\" to \\\"/output.txt\\\"\\nrename folder \\\"/docs\\\" to \\\"/mydocs\\\"\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"|ren,\\\"input.txt\\\",\\\"output.txt\\\"\\n\",\n \"language\": \"Locomotive-Basic\"\n },\n {\n \"code\": \"os.rename( \\\"input.txt\\\", \\\"output.txt\\\" )\\nos.rename( \\\"/input.txt\\\", \\\"/output.txt\\\" )\\nos.rename( \\\"docs\\\", \\\"mydocs\\\" )\\nos.rename( \\\"/docs\\\", \\\"/mydocs\\\" )\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module checkit {\\n Document A$={Alfa, beta}\\n Save.Doc A$, \\\"this.aaa\\\"\\n Print Exist(\\\"this.aaa\\\")=true\\n dos \\\"cd \\\"+quote$(dir$)+\\\" && del this.bbb\\\", 100; ' using; to close dos window, and 100ms for waiting\\n Name this.aaa as this.bbb\\n Rem : Name \\\"this.aaa\\\" as \\\"this.bbb\\\" ' we can use strings or variables\\n Print Exist(\\\"this.bbb\\\")=true\\n}\\ncheckit\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"use FileTools in\\n Rename( \\\"input.txt\\\", \\\"output.txt\\\" );\\n Rename( \\\"docs\\\", \\\"mydocs\\\" );\\n Rename( \\\"/input.txt\\\", \\\"/output.txt\\\" ); # assuming permissions in /\\n Rename( \\\"/docs\\\", \\\"/mydocs\\\" ) # assuming permissions in /\\nend use:\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"SetDirectory[NotebookDirectory[]]\\nRenameFile[\\\"input.txt\\\", \\\"output.txt\\\"]\\nRenameDirectory[\\\"docs\\\", \\\"mydocs\\\"]\\nSetDirectory[$RootDirectory]\\nRenameFile[\\\"input.txt\\\", \\\"output.txt\\\"]\\nRenameDirectory[\\\"docs\\\", \\\"mydocs\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \" [STATUS, MSG, MSGID] = movefile (F1, F2);\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"-- Here\\nrenameFile \\\"input.txt\\\" \\\"output.txt\\\"\\n-- Root\\nrenameFile \\\"/input.txt\\\" \\\"/output.txt\\\"\\n\",\n \"language\": \"MAXScript\"\n },\n {\n \"code\": \":- module rename_file.\\n:- interface.\\n\\n:- import_module io.\\n:- pred main(io::di, io::uo) is det.\\n\\n:- implementation.\\n\\n:- import_module dir.\\n\\nmain(!IO) :-\\n rename_file(\\\"input.txt\\\", \\\"output.txt\\\", !IO),\\n rename_file(\\\"docs\\\", \\\"mydocs\\\", !IO),\\n rename_file(\\\"/input.txt\\\", \\\"/output.txt\\\", !IO),\\n rename_file(\\\"/docs\\\", \\\"/mydocs\\\", !IO).\\n\\n:- pred rename_file(string::in, string::in, io::di, io::uo) is det.\\n\\nrename_file(OldName, NewName, !IO) :-\\n io.rename_file(OldName, NewName, Result, !IO),\\n (\\n Result = ok\\n ;\\n Result = error(Error),\\n print_io_error(Error, !IO)\\n ).\\n\\n:- pred print_io_error(io.error::in, io::di, io::uo) is det.\\n\\nprint_io_error(Error, !IO) :-\\n io.stderr_stream(Stderr, !IO),\\n io.write_string(Stderr, io.error_message(Error), !IO),\\n io.nl(Stderr, !IO),\\n io.set_exit_status(1, !IO).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"\\\"input.txt\\\" \\\"output.txt\\\" mv\\n\\\"docs\\\" \\\"mydocs\\\" mv\\n\\n\\\"/input.txt\\\" \\\"/output.txt\\\" mv\\n\\\"/docs\\\" \\\"/mydocs\\\" mv\\n\",\n \"language\": \"Min\"\n },\n {\n \"code\": \" ;Local\\n S X=$ZF(-1,\\\"rename input.txt output.txt\\\")\\n S X=$ZF(-1,\\\"rename docs.dir mydocs.dir\\\")\\n ;Root of current device\\n S X=$ZF(-1,\\\"rename [000000]input.txt [000000]output.txt\\\")\\n S X=$ZF(-1,\\\"rename [000000]docs.dir [000000]mydocs.dir\\\")\\n\",\n \"language\": \"MUMPS\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols binary\\n\\nrunSample(arg)\\nreturn\\n\\n-- . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .\\nmethod isFileRenamed(oldFile, newFile) public static returns boolean\\n fo = File(oldFile)\\n fn = File(newFile)\\n fRenamed = fo.renameTo(fn)\\n return fRenamed\\n\\n-- 09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)09:11, 27 August 2022 (UTC)~~\\nmethod runSample(arg) private static\\n parse arg files\\n if files = '' then files = 'input.txt output.txt F docs mydocs D /input.txt /output.txt F /docs /mydocs D'\\n loop while files.length > 0\\n parse files of nf ft files\\n select case(ft.upper())\\n when 'F' then do\\n ft = 'File'\\n end\\n when 'D' then do\\n ft = 'Directory'\\n end\\n otherwise do\\n ft = 'File'\\n end\\n end\\n if isFileRenamed(of, nf) then dl = 'renamed'\\n else dl = 'not renamed'\\n say ft ''''of'''' dl 'to' nf\\n end\\n\\n return\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"(rename-file \\\"./input.txt\\\" \\\"./output.txt\\\")\\n(rename-file \\\"./docs\\\" \\\"./mydocs\\\")\\n(rename-file \\\"/input.txt\\\" \\\"/output.txt\\\")\\n(rename-file \\\"/docs\\\" \\\"/mydocs\\\")\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"import os\\n\\nmoveFile(\\\"input.txt\\\", \\\"output.txt\\\")\\nmoveFile(\\\"docs\\\", \\\"mydocs\\\")\\n\\nmoveFile(DirSep & \\\"input.txt\\\", DirSep & \\\"output.txt\\\")\\nmoveFile(DirSep & \\\"docs\\\", DirSep & \\\"mydocs\\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use IO;\\nbundle Default {\\n class FileExample {\\n function : Main(args : String[]) ~ Nil {\\n File->Rename(\\\"input.txt\\\", \\\"output.txt\\\");\\n File->Rename(\\\"docs\\\", \\\"mydocs\\\");\\n File->Rename(\\\"/input.txt\\\", \\\"/output.txt\\\");\\n File->Rename(\\\"/docs\\\", \\\"/mydocs\\\");\\n }\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"NSFileManager *fm = [NSFileManager defaultManager];\\n\\n// Pre-OS X 10.5\\n[fm movePath:@\\\"input.txt\\\" toPath:@\\\"output.txt\\\" handler:nil];\\n[fm movePath:@\\\"docs\\\" toPath:@\\\"mydocs\\\" handler:nil];\\n\\n// OS X 10.5+\\n[fm moveItemAtPath:@\\\"input.txt\\\" toPath:@\\\"output.txt\\\" error:NULL];\\n[fm moveItemAtPath:@\\\"docs\\\" toPath:@\\\"mydocs\\\" error:NULL];\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"let () =\\n Sys.rename \\\"input.txt\\\" \\\"output.txt\\\";\\n Sys.rename \\\"docs\\\" \\\"mydocs\\\";\\n Sys.rename \\\"/input.txt\\\" \\\"/output.txt\\\";\\n Sys.rename \\\"/docs\\\" \\\"/mydocs\\\";\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"rename('docs','mydocs');\\nrename('input.txt','/output.txt');\\nrename('/docs','/mydocs');\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"OS-RENAME \\\"input.txt\\\" \\\"output.txt\\\".\\nOS-RENAME \\\"docs\\\" \\\"mydocs\\\".\\n\\nOS-RENAME \\\"/input.txt\\\" \\\"/output.txt\\\".\\nOS-RENAME \\\"/docs\\\" \\\"/mydocs\\\".\\n\",\n \"language\": \"OpenEdge-Progress\"\n },\n {\n \"code\": \"system(\\\"mv input.txt output.txt\\\");\\nsystem(\\\"mv /input.txt /output.txt\\\");\\nsystem(\\\"mv docs mydocs\\\");\\nsystem(\\\"mv /docs /mydocs\\\");\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"install(\\\"rename\\\",\\\"iss\\\",\\\"rename\\\");\\nrename(\\\"input.txt\\\", \\\"output.txt\\\");\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \" var\\n f : file ; // Untyped file\\n begin\\n\\n // as current directory\\n AssignFile(f,'input.doc');\\n Rename(f,'output.doc');\\n\\n // as root directory\\n AssignFile(f,'\\\\input.doc');\\n Rename(f,'\\\\output.doc');\\n\\n // rename a directory\\n AssignFile(f,'docs');\\n Rename(f,'mydocs');\\n\\n //rename a directory off the root\\n\\n AssignFile(f,'\\\\docs');\\n Rename(f,'\\\\mydocs');\\n\\nend;\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use File::Copy qw(move);\\nuse File::Spec::Functions qw(catfile rootdir);\\n# here\\nmove 'input.txt', 'output.txt';\\nmove 'docs', 'mydocs';\\n# root dir\\nmove (catfile rootdir, 'input.txt'), (catfile rootdir, 'output.txt');\\nmove (catfile rootdir, 'docs'), (catfile rootdir, 'mydocs');\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (file i/o)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">rename_file</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"input.txt\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"output.txt\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">rename_file</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"docs\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"mydocs\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">rename_file</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"C:\\\\\\\\Copy.txt\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Copy.xxx\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">rename_file</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"C:\\\\\\\\docs\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"C:\\\\\\\\mydocs\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"_platform \\\"windows\\\" == if \\\"\\\\\\\\\\\" \\\"ren \\\" else \\\"/\\\" \\\"mv \\\" endif\\nvar com var slash\\n\\ncom \\\"input.txt output.txt\\\" chain cmd\\ncom \\\"docs mydocs\\\" chain cmd\\ncom slash chain \\\"input.txt \\\" chain slash chain \\\"output.txt\\\" chain cmd\\ncom slash chain \\\"docs \\\" chain slash chain \\\"mydocs\\\" chain cmd\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"<?php\\nrename('input.txt', 'output.txt');\\nrename('docs', 'mydocs');\\nrename('/input.txt', '/output.txt');\\nrename('/docs', '/mydocs');\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(call 'mv \\\"input.txt\\\" \\\"output.txt\\\")\\n(call 'mv \\\"docs\\\" \\\"mydocs\\\")\\n(call 'mv \\\"/input.txt\\\" \\\"/output.txt\\\")\\n(call 'mv \\\"/docs\\\" \\\"/mydocs\\\")\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"int main(){\\n mv(\\\"input.txt\\\", \\\"output.txt\\\");\\n mv(\\\"/input.txt\\\", \\\"/output.txt\\\");\\n mv(\\\"docs\\\", \\\"mydocs\\\");\\n mv(\\\"/docs\\\", \\\"/mydocs\\\");\\n}\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"To run:\\nStart up.\\n\\\\ In the current working directory\\nRename \\\".\\\\input.txt\\\" to \\\".\\\\output.txt\\\" in the file system.\\nRename \\\".\\\\docs\\\\\\\" to \\\".\\\\mydocs\\\\\\\" in the file system.\\n\\\\ In the filesystem root\\nRename \\\"C:\\\\input.txt\\\" to \\\"C:\\\\output.txt\\\" in the file system.\\nRename \\\"C:\\\\docs\\\\\\\" to \\\"C:\\\\mydocs\\\\\\\" in the file system.\\nShut down.\\n\",\n \"language\": \"Plain-English\"\n },\n {\n \"code\": \"sys_file_move('inputs.txt', 'output.txt');\\nsys_file_move('docs', 'mydocs');\\nsys_file_move('/inputs.txt', '/output.txt');\\nsys_file_move(/'docs', '/mydocs');\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \"Rename-Item input.txt output.txt\\n\\n# The Rename-item has the alias ren\\nren input.txt output.txt\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"void setup(){\\n boolean sketchfile = rename(sketchPath(\\\"input.txt\\\"), sketchPath(\\\"output.txt\\\"));\\n boolean sketchfold = rename(sketchPath(\\\"docs\\\"), sketchPath(\\\"mydocs\\\"));\\n // sketches will seldom have write permission to root files/folders\\n boolean rootfile = rename(\\\"input.txt\\\", \\\"output.txt\\\");\\n boolean rootfold = rename(\\\"docs\\\", \\\"mydocs\\\");\\n // true if succeeded, false if failed\\n println(sketchfile, sketchfold, rootfile, rootfold);\\n}\\n\\nboolean rename(String oldname, String newname) {\\n // File (or directory) with old name\\n File file = new File(oldname);\\n // File (or directory) with new name\\n File file2 = new File(newname);\\n // Rename file (or directory)\\n boolean success = file.renameTo(file2);\\n return success;\\n}\\n\",\n \"language\": \"Processing\"\n },\n {\n \"code\": \"from java.io import File\\n\\ndef setup():\\n # rename local file\\n sketchfile = rename(sketchPath(\\\"input.txt\\\"), sketchPath(\\\"output.txt\\\"))\\n # rename local folder\\n sketchfold = rename(sketchPath(\\\"docs\\\"), sketchPath(\\\"mydocs\\\"))\\n # rename root file (if permitted)\\n rootfile = rename(\\\"input.txt\\\", \\\"output.txt\\\")\\n # rename root folder (if permitted)\\n rootfold = rename(\\\"docs\\\", \\\"mydocs\\\")\\n\\n # display results of four operations: True=success, False=fail\\n println(str(sketchfile) + ' ' +\\n str(sketchfold) + ' ' +\\n str(rootfile) + ' ' +\\n str(rootfold))\\n # output:\\n # True True False False\\n\\n\\ndef rename(oldname, newname):\\n # File (or directory) with old name\\n file = File(oldname)\\n # File (or directory) with new name\\n file2 = File(newname)\\n # Rename file (or directory)\\n success = file.renameTo(file2)\\n return success\\n\",\n \"language\": \"Processing\"\n },\n {\n \"code\": \"rename input.txt to output.txt\\nrename docs to mydocs\\n\",\n \"language\": \"ProDOS\"\n },\n {\n \"code\": \"RenameFile(\\\"input.txt\\\", \\\"output.txt\\\")\\nRenameFile(\\\"docs\\\\\\\", \\\"mydocs\\\\\\\")\\n\\nRenameFile(\\\"/input.txt\\\",\\\"/output.txt\\\")\\nRenameFile(\\\"/docs\\\\\\\",\\\"/mydocs\\\\\\\")\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import os\\n\\nos.rename(\\\"input.txt\\\", \\\"output.txt\\\")\\nos.rename(\\\"docs\\\", \\\"mydocs\\\")\\n\\nos.rename(os.sep + \\\"input.txt\\\", os.sep + \\\"output.txt\\\")\\nos.rename(os.sep + \\\"docs\\\", os.sep + \\\"mydocs\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import shutil\\n\\nshutil.move(\\\"input.txt\\\", \\\"output.txt\\\")\\nshutil.move(\\\"docs\\\", \\\"mydocs\\\")\\n\\nshutil.move(\\\"/input.txt\\\", \\\"/output.txt\\\")\\nshutil.move(\\\"/docs\\\", \\\"/mydocs\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" $ \\\"\\nimport os\\nif os.path.exists('input.txt'):\\n os.rename('input.txt', 'output.txt')\\n\\\" python\\n\\n $ \\\"\\nimport os\\nif os.path.exists('docs'):\\n os.rename('docs', 'mydocs')\\n\\\" python\\n\\n $ \\\"\\nimport os\\nif os.path.exists('/input.txt'):\\n os.rename('/input.txt', '/output.txt')\\n\\\" python\\n\\n $ \\\"\\nimport os\\nif os.path.exists('/docs'):\\n os.rename('/docs', '/mydocs')\\n\\\" python\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"#lang racket\\n\\n(rename-file-or-directory \\\"input.txt\\\" \\\"output.txt\\\")\\n(rename-file-or-directory \\\"docs\\\" \\\"mydocs\\\")\\n\\n;; find the filesystem roots, and pick the first one\\n(define root (first (filesystem-root-list)))\\n\\n(rename-file-or-directory (build-path root \\\"input.txt\\\")\\n (build-path root \\\"output.txt\\\"))\\n(rename-file-or-directory (build-path root \\\"docs\\\")\\n (build-path root \\\"mydocs\\\"))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"rename 'input.txt', 'output.txt';\\nrename 'docs', 'mydocs';\\nrename '/input.txt', '/output.txt';\\nrename '/docs', '/mydocs';\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"`mv /path/to/file/oldfile /path/to/file/newfile` shell\\n\",\n \"language\": \"Raven\"\n },\n {\n \"code\": \"Sub Renamer()\\n Dim f As FolderItem, r As FolderItem\\n\\n f = GetFolderItem(\\\"input.txt\\\")\\n 'Changing a FolderItem's Name attribute renames the file or directory.\\n If f.Exists Then f.Name = \\\"output.txt\\\"\\n 'Files and directories are handled almost identically in RB.\\n f = GetFolderItem(\\\"docs\\\")\\n If f.Exists Then f.Name = \\\"mydocs\\\"\\n\\n 'Jump through hoops to find the root directory.\\n r = RootDir(GetFolderItem(\\\".\\\"))\\n\\n f = r.Child(\\\"input.txt\\\")\\n 'Renaming in a different directory identical to renaming in current directory.\\n If f.Exists Then f.Name = \\\"output.txt\\\"\\n f = r.Child(\\\"docs\\\")\\n If f.Exists Then f.Name = \\\"mydocs\\\"\\nEnd Sub\\n\\nFunction RootDir(what As FolderItem) As FolderItem\\n 'RB doesn't have an easy way to find the root of the current drive;\\n 'not an issue under *nix but troublesome under Windows.\\n If what.Parent <> Nil Then 'Nil = no parent = root.\\n Return RootDir(what.Parent) 'Recursive.\\n Else\\n Return what\\n End If\\nEnd Function\\n\",\n \"language\": \"REALbasic\"\n },\n {\n \"code\": \"rename %input.txt %output.txt\\nrename %docs/ %mydocs/\\n\\n; Unix. Note that there's no path specification used for the\\n; new name. \\\"Rename\\\" is not \\\"move\\\".\\n\\nrename %/input.txt %output.txt\\nrename %/docs/ %mydocs/\\n\\n; DOS/Windows:\\n\\nrename %/c/input.txt %output.txt\\nrename %/c/docs/ %mydocs/\\n\\n; Because REBOL treats data access schemes as uniformly as possible,\\n; you can do tricks like this:\\n\\nrename ftp://username:password@ftp.site.com/www/input.txt %output.txt\\nrename ftp://username:password@ftp.site.com/www/docs/ %mydocs/\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \"/*REXX program renames a file & a directory (in current dir & in root).*/\\ntrace off /*suppress error messages, bad RC*/\\n\\n do 2 /* [↓] perform this code twice. */\\n 'RENAME' \\\"input.txt output.txt\\\" /*rename a particular DOS file. */\\n 'MOVE' \\\"\\\\docs \\\\mydocs\\\" /*use (DOS) MOVE to rename a dir.*/\\n 'CD' \\\"\\\\\\\" /*for 2nd pass, change──►root dir*/\\n end /*2*/\\n /*stick a fork in it, we're done.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program renames a file & a directory (in current dir & in root).*/\\ntrace off /*suppress error messages, bad RC*/\\n$ = '2> NUL' /*used to suppress error messages*/\\n\\n do 2 /* [↓] perform this code twice. */\\n 'RENAME' \\\"input.txt output.txt\\\" $ /*rename a particular DOS file. */\\n 'MOVE' \\\"\\\\docs \\\\mydocs\\\" $ /*use (DOS) MOVE to rename a dir.*/\\n 'CD' \\\"\\\\\\\" $ /*for 2nd pass, change──►root dir*/\\n end /*2*/\\n /*stick a fork in it, we're done.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \" rename(\\\"input.txt\\\", \\\"output.txt\\\")\\n rename(\\\"docs\\\", \\\"mydocs\\\")\\n rename(\\\"/input.txt\\\", \\\"/output.txt\\\")\\n rename(\\\"/docs\\\", \\\"/mydocs\\\")\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"File.rename('input.txt', 'output.txt')\\nFile.rename('/input.txt', '/output.txt')\\nFile.rename('docs', 'mydocs')\\nFile.rename('/docs', '/mydocs')\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"require 'fileutils'\\nmoves = { \\\"input.txt\\\" => \\\"output.txt\\\", \\\"/input.txt\\\" => \\\"/output.txt\\\", \\\"docs\\\" => \\\"mydocs\\\",\\\"/docs\\\" => \\\"/mydocs\\\"}\\nmoves.each{ |src, dest| FileUtils.move( src, dest, :verbose => true ) }\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"a$ = shell$(\\\"RENAME input.txt output.txt\\\")\\na$ = shell$(\\\"RENAME docs mydocs\\\")\\na$ = shell$(\\\"RENAME \\\\input.txt \\\\output.txt\\\")\\na$ = shell$(\\\"RENAME \\\\docs \\\\mydocs\\\")\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use std::fs;\\n\\nfn main() {\\n let err = \\\"File move error\\\";\\n fs::rename(\\\"input.txt\\\", \\\"output.txt\\\").ok().expect(err);\\n fs::rename(\\\"docs\\\", \\\"mydocs\\\").ok().expect(err);\\n fs::rename(\\\"/input.txt\\\", \\\"/output.txt\\\").ok().expect(err);\\n fs::rename(\\\"/docs\\\", \\\"/mydocs\\\").ok().expect(err);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import scala.language.implicitConversions\\nimport java.io.File\\n\\nobject Rename0 {\\n def main(args: Array[String]) { // The implicit causes every String to File mapping,\\n implicit def file(s: String) = new File(s) // will be converted to new File(String)\\n \\\"myfile.txt\\\" renameTo \\\"anotherfile.txt\\\"\\n \\\"/tmp/myfile.txt\\\" renameTo \\\"/tmp/anotherfile.txt\\\"\\n \\\"mydir\\\" renameTo \\\"anotherdir\\\"\\n \\\"/tmp/mydir\\\" renameTo \\\"/tmp/anotherdir\\\"\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"object Rename1 {\\n def main(args: Array[String]) {\\n List((\\\"myfile.txt\\\", \\\"anotherfile.txt\\\"),(\\\"/tmp/myfile.txt\\\", \\\"/tmp/anotherfile.txt\\\"),\\n (\\\"mydir\\\", \\\"anotherdir\\\"),(\\\"/tmp/mydir\\\", \\\"/tmp/anotherdir\\\")).foreach{ case (oldf, newf) ⇒\\n new java.io.File(oldf) renameTo new java.io.File(newf)\\n }\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(rename-file \\\"input.txt\\\" \\\"output.txt\\\")\\n(rename-file \\\"docs\\\" \\\"mydocs\\\")\\n(rename-file \\\"/input.txt\\\" \\\"/output.txt\\\")\\n(rename-file \\\"/docs\\\" \\\"/mydocs\\\")\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"osfiles.s7i\\\";\\n\\nconst proc: main is func\\n begin\\n moveFile(\\\"input.txt\\\", \\\"output.txt\\\");\\n moveFile(\\\"docs\\\", \\\"mydocs\\\");\\n moveFile(\\\"/input.txt\\\", \\\"/output.txt\\\");\\n moveFile(\\\"/docs\\\", \\\"/mydocs\\\");\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"# Here\\nFile.rename('input.txt', 'output.txt');\\nFile.rename('docs', 'mydocs');\\n\\n# Root dir\\nFile.rename(Dir.root + %f'input.txt', Dir.root + %f'output.txt');\\nFile.rename(Dir.root + %f'docs', Dir.root + %f'mydocs');\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"(File newNamed: 'input.txt') renameTo: 'output.txt'.\\n(File newNamed: '/input.txt') renameTo: '/output.txt'.\\n(Directory newNamed: 'docs') renameTo: 'mydocs'.\\n(Directory newNamed: '/docs') renameTo: '/mydocs'.\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"File rename: 'input.txt' to: 'output.txt'.\\nFile rename: 'docs' to: 'mydocs'.\\n\\\"as for other example, this works on systems\\n where the root is / ...\\\"\\nFile rename: '/input.txt' to: '/output.txt'.\\nFile rename: '/docs' to: '/mydocs'\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"'input.txt' asFilename renameTo: 'output.txt'.\\n'docs' asFilename renameTo: 'mydocs'.\\n'/input.txt' asFilename renameTo: '/output.txt'.\\n'/docs' asFilename renameTo: '/mydocs'\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"'input.txt' asFileReference renameTo: 'output.txt'.\\n'docs' asFileReference renameTo: 'mydocs'.\\n'/input.txt' asFileReference renameTo: '/output.txt'.\\n'/docs' asFileReference renameTo: '/mydocs'\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"OS.FileSys.rename {old = \\\"input.txt\\\", new = \\\"output.txt\\\"};\\nOS.FileSys.rename {old = \\\"docs\\\", new = \\\"mydocs\\\"};\\nOS.FileSys.rename {old = \\\"/input.txt\\\", new = \\\"/output.txt\\\"};\\nOS.FileSys.rename {old = \\\"/docs\\\", new = \\\"/mydocs\\\"};\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"!ren input.txt output.txt\\n!ren docs mydocs\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"file rename inputs.txt output.txt\\nfile rename docs mydocs\\n\\nfile rename [file nativename /inputs.txt] [file nativename /output.txt]\\nfile rename [file nativename /docs] [file nativename /mydocs]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"file rename inputs.txt output.txt\\nfile rename docs mydocs\\n\\nfile rename /inputs.txt /output.txt\\nfile rename /docs /mydocs\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"needs shell\\n\\\" input.txt\\\" \\\" output.txt\\\" rename\\n\\\" /input.txt\\\" \\\" /output.txt\\\" rename\\n\\n\\\" docs\\\" \\\" mydocs\\\" rename\\n\\\" /docs\\\" \\\" /mydocs\\\" rename\\n\",\n \"language\": \"Toka\"\n },\n {\n \"code\": \"fileCopy(\\\"Input.txt\\\", \\\"Output.txt\\\");\\nfileDelete(\\\"Input.txt\\\");\\n\\nfor(%File = FindFirstFile(\\\"Path/*.*\\\"); %File !$= \\\"\\\"; %File = FindNextFile(\\\"Path/*.*\\\"))\\n{\\n\\tfileCopy(%File, \\\"OtherPath/\\\" @ %File);\\n\\tfileDelete(%File);\\n}\\n\",\n \"language\": \"TorqueScript\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\n- rename file\\nERROR/STOP RENAME (\\\"input.txt\\\",\\\"output.txt\\\")\\n- rename directory\\nERROR/STOP RENAME (\\\"docs\\\",\\\"mydocs\\\",-std-)\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"(rename-path \\\"input.txt\\\" \\\"output.txt\\\")\\n;; Windows (MinGW based port)\\n(rename-path \\\"C:\\\\\\\\input.txt\\\" \\\"C:\\\\\\\\output.txt\\\")\\n;; Unix; Windows (Cygwin port)\\n(rename-path \\\"/input.txt\\\" \\\"/output.txt\\\"))\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"mv input.txt output.txt\\nmv /input.txt /output.txt\\nmv docs mydocs\\nmv /docs /mydocs\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"// In current directory\\nFile_Rename(\\\"input.txt\\\", \\\"output.txt\\\")\\nFile_Rename(\\\"docs\\\", \\\"mydocs\\\")\\n\\n// In the root directory\\nFile_Rename(\\\"/input.txt\\\", \\\"/output.txt\\\")\\nFile_Rename(\\\"/docs\\\", \\\"/mydocs\\\")\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"'Current Directory\\nIO.Directory.Move(\\\"docs\\\", \\\"mydocs\\\")\\nIO.File.Move(\\\"input.txt\\\", \\\"output.txt\\\")\\n\\n'Root\\nIO.Directory.Move(\\\"\\\\docs\\\", \\\"\\\\mydocs\\\")\\nIO.File.Move(\\\"\\\\input.txt\\\", \\\"\\\\output.txt\\\")\\n\\n'Root, platform independent\\nIO.Directory.Move(IO.Path.DirectorySeparatorChar & \\\"docs\\\", _\\n IO.Path.DirectorySeparatorChar & \\\"mydocs\\\")\\nIO.File.Move(IO.Path.DirectorySeparatorChar & \\\"input.txt\\\", _\\n IO.Path.DirectorySeparatorChar & \\\"output.txt\\\")\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./ioutil\\\" for FileUtil\\n\\nFileUtil.move(\\\"input.txt\\\", \\\"output.txt\\\")\\nFileUtil.move(\\\"/input.txt\\\", \\\"/output.txt\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"if peek$(\\\"os\\\") = \\\"windows\\\" then\\n slash$ = \\\"\\\\\\\\\\\" : com$ = \\\"ren \\\"\\nelse\\n slash$ = \\\"/\\\" : com$ = \\\"mv \\\"\\nend if\\n\\nsystem(com$ + \\\"input.txt output.txt\\\")\\nsystem(com$ + \\\"docs mydocs\\\")\\nsystem(com$ + slash$ + \\\"input.txt \\\" + slash$ + \\\"output.txt\\\")\\nsystem(com$ + slash$ + \\\"docs \\\" + slash$ + \\\"mydocs\\\")\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"rename, \\\"input.txt\\\", \\\"output.txt\\\";\\nrename, \\\"/input.txt\\\", \\\"/output.txt\\\";\\nrename, \\\"docs\\\", \\\"mydocs\\\";\\nrename, \\\"/docs\\\", \\\"/mydocs\\\";\\n\",\n \"language\": \"Yorick\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Rename-a-file"}}},{"rowIdx":1577,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Rep-string\n","language":"00-META"},{"code":"Given a series of ones and zeroes in a string, define a repeated string or ''rep-string'' as a string which is created by repeating a substring of the ''first'' N characters of the string ''truncated on the right to the length of the input string, and in which the substring appears repeated at least twice in the original''.\n\nFor example, the string '''10011001100''' is a rep-string as the leftmost four characters of '''1001''' are repeated three times and truncated on the right to give the original string.\n\nNote that the requirement for having the repeat occur two or more times means that the repeating unit is ''never'' longer than half the length of the input string.\n\n\n;Task:\n* Write a function/subroutine/method/... that takes a string and returns an indication of if it is a rep-string and the repeated string. (Either the string that is repeated, or the number of repeated characters would suffice). \n* There may be multiple sub-strings that make a string a rep-string - in that case an indication of all, or the longest, or the shortest would suffice.\n* Use the function to indicate the repeating substring if any, in the following:\n<dl><dd>\n<pre>\n1001110011\n1110111011\n0010010010\n1010101010\n1111111111\n0100101101\n0100100\n101\n11\n00\n1\n</pre>\n</dl>\n* Show your output on this page.\n\n\n{{Template:Strings}}\n<br><br>\n\n","language":"00-TASK"},{"code":"F reps(text)\n R (1 .< 1 + text.len I/ 2).filter(x -> @text.starts_with(@text[x..])).map(x -> @text[0 .< x])\n\nV matchstr =\n|‘1001110011\n 1110111011\n 0010010010\n 1010101010\n 1111111111\n 0100101101\n 0100100\n 101\n 11\n 00\n 1’\n\nL(line) matchstr.split(\"\\n\")\n print(‘'#.' has reps #.’.format(line, reps(line)))\n","language":"11l"},{"code":"HOW TO RETURN repstrings str:\n PUT {} IN reps\n FOR len IN {0..floor(#str/2-1)}:\n PUT str|floor(#str/2-len) IN rep\n PUT rep IN rpt\n WHILE #rpt < #str: PUT rpt^rep IN rpt\n IF rpt|#str = str: INSERT rep IN reps\n RETURN reps\n\nPUT {} IN tests\nPUT \"1001110011\" IN tests[1]\nPUT \"1110111011\" IN tests[2]\nPUT \"0010010010\" IN tests[3]\nPUT \"1010101010\" IN tests[4]\nPUT \"1111111111\" IN tests[5]\nPUT \"0100101101\" IN tests[6]\nPUT \"0100100\" IN tests[7]\nPUT \"101\" IN tests[8]\nPUT \"11\" IN tests[9]\nPUT \"00\" IN tests[10]\nPUT \"1\" IN tests[11]\n\nFOR t IN tests:\n WRITE t, repstrings t /\n","language":"ABC"},{"code":"BYTE FUNC IsCycle(CHAR ARRAY s,sub)\n BYTE i,j,count\n\n IF sub(0)=0 OR s(0)<sub(0) THEN\n RETURN (0)\n FI\n\n j=1 count=0\n FOR i=1 TO s(0)\n DO\n IF s(i)#sub(j) THEN\n RETURN (0)\n FI\n j==+1\n IF j>sub(0) THEN\n j=1 count==+1\n FI\n OD\n IF count>1 THEN\n RETURN (1)\n FI\nRETURN (0)\n\nPROC Test(CHAR ARRAY s)\n CHAR ARRAY sub\n BYTE len,count\n\n PrintF(\"%S -> \",s)\n count=0\n FOR len=1 TO s(0)-1\n DO\n SCopyS(sub,s,1,len)\n IF IsCycle(s,sub) THEN\n IF count>0 THEN\n Print(\", \")\n FI\n Print(sub)\n count==+1\n FI\n OD\n IF count=0 THEN\n Print(\"none\")\n FI\n PutE()\nRETURN\n\nPROC Main()\n Test(\"1001110011\")\n Test(\"1110111011\")\n Test(\"0010010010\")\n Test(\"1010101010\")\n Test(\"1111111111\")\n Test(\"0100101101\")\n Test(\"0100100\")\n Test(\"101\")\n Test(\"11\")\n Test(\"00\")\n Test(\"1\")\nRETURN\n","language":"Action-"},{"code":"with Ada.Command_Line, Ada.Text_IO, Ada.Strings.Fixed;\n\nprocedure Rep_String is\n\n function Find_Largest_Rep_String(S:String) return String is\n L: Natural := S'Length;\n begin\n for I in reverse 1 .. L/2 loop\n\t declare\n\t use Ada.Strings.Fixed;\n\t T: String := S(S'First .. S'First + I-1); -- the first I characters of S\n\t U: String := (1+(L/I)) * T; -- repeat T so often that U'Length >= L\n\t begin -- compare first L characers of U with S\n\t if U(U'First .. U'First + S'Length -1) = S then\n\t return T; -- T is a rep-string\n\t end if;\n\t end;\n end loop;\n return \"\"; -- no rep string;\n end Find_Largest_Rep_String;\n\n X: String := Ada.Command_Line.Argument(1);\n Y: String := Find_Largest_Rep_String(X);\n\nbegin\n if Y=\"\" then\n Ada.Text_IO.Put_Line(\"No rep-string for \"\"\" & X & \"\"\"\");\n else\n Ada.Text_IO.Put_Line(\"Longest rep-string for \"\"\"& X &\"\"\": \"\"\"& Y &\"\"\"\");\n end if;\nend Rep_String;\n","language":"Ada"},{"code":"# procedure to find the longest rep-string in a given string #\n# the input string is not validated to contain only \"0\" and \"1\" characters #\nPROC longest rep string = ( STRING input )STRING:\nBEGIN\n\n STRING result := \"\";\n\n # ensure the string we are working on has a lower-bound of 1 #\n STRING str = input[ AT 1 ];\n\n # work backwards from half the input string looking for a rep-string #\n FOR string length FROM UPB str OVER 2 BY -1 TO 1\n WHILE\n STRING left substring = str[ 1 : string length ];\n # if the left substgring repeated a sufficient number of times #\n # (truncated on the right) is equal to the original string, then #\n # we have found the longest rep-string #\n STRING repeated string = ( left substring\n * ( ( UPB str OVER string length ) + 1 )\n )[ 1 : UPB str ];\n IF str = repeated string\n THEN\n # found a rep-string #\n result := left substring;\n FALSE\n ELSE\n # not a rep-string, keep looking #\n TRUE\n FI\n DO\n SKIP\n OD;\n\n result\nEND; # longest rep string #\n\n\n# test the longest rep string procedure #\nmain:\n(\n\n []STRING tests = ( \"1001110011\"\n , \"1110111011\"\n , \"0010010010\"\n , \"1010101010\"\n , \"1111111111\"\n , \"0100101101\"\n , \"0100100\"\n , \"101\"\n , \"11\"\n , \"00\"\n , \"1\"\n );\n\n FOR test number FROM LWB tests TO UPB tests\n DO\n STRING rep string = longest rep string( tests[ test number ] );\n print( ( tests[ test number ]\n , \": \"\n , IF rep string = \"\"\n THEN \"no rep string\"\n ELSE \"longest rep string: \"\"\" + rep string + \"\"\"\"\n FI\n , newline\n )\n )\n OD\n)\n","language":"ALGOL-68"},{"code":"rep ← ⊢ (⊢(/⍨)(⊂⊣)≡¨(≢⊣)⍴¨⊢) ⍳∘(⌊0.5×≢)↑¨⊂\n","language":"APL"},{"code":"------------------------REP-CYCLES-------------------------\n\n-- repCycles :: String -> [String]\non repCycles(xs)\n set n to length of xs\n\n script isCycle\n on |λ|(cs)\n xs = takeCycle(n, cs)\n end |λ|\n end script\n\n filter(isCycle, tail(inits(take(quot(n, 2), xs))))\nend repCycles\n\n-- cycleReport :: String -> [String]\non cycleReport(xs)\n set reps to repCycles(xs)\n\n if isNull(reps) then\n {xs, \"(n/a)\"}\n else\n {xs, item -1 of reps}\n end if\nend cycleReport\n\n\n---------------------------TEST----------------------------\non run\n set samples to {\"1001110011\", \"1110111011\", \"0010010010\", ¬\n \"1010101010\", \"1111111111\", \"0100101101\", \"0100100\", ¬\n \"101\", \"11\", \"00\", \"1\"}\n\n unlines(cons(\"Longest cycle:\" & linefeed, ¬\n map(intercalate(\" -> \"), ¬\n map(cycleReport, samples))))\n\nend run\n\n\n---------------------GENERIC FUNCTIONS---------------------\n\n-- concat :: [[a]] -> [a] | [String] -> String\non concat(xs)\n if length of xs > 0 and class of (item 1 of xs) is string then\n set acc to \"\"\n else\n set acc to {}\n end if\n repeat with i from 1 to length of xs\n set acc to acc & item i of xs\n end repeat\n acc\nend concat\n\n-- cons :: a -> [a] -> [a]\non cons(x, xs)\n {x} & xs\nend cons\n\n-- filter :: (a -> Bool) -> [a] -> [a]\non filter(f, xs)\n tell mReturn(f)\n set lst to {}\n set lng to length of xs\n repeat with i from 1 to lng\n set v to item i of xs\n if |λ|(v, i, xs) then set end of lst to v\n end repeat\n return lst\n end tell\nend filter\n\n-- foldl :: (a -> b -> a) -> a -> [b] -> a\non foldl(f, startValue, xs)\n tell mReturn(f)\n set v to startValue\n set lng to length of xs\n repeat with i from 1 to lng\n set v to |λ|(v, item i of xs, i, xs)\n end repeat\n return v\n end tell\nend foldl\n\n-- inits :: [a] -> [[a]]\n-- inits :: String -> [String]\non inits(xs)\n script elemInit\n on |λ|(_, i, xs)\n items 1 thru i of xs\n end |λ|\n end script\n\n script charInit\n on |λ|(_, i, xs)\n text 1 thru i of xs\n end |λ|\n end script\n\n if class of xs is string then\n {\"\"} & map(charInit, xs)\n else\n {{}} & map(elemInit, xs)\n end if\nend inits\n\n-- intercalate :: Text -> [Text] -> Text\non intercalate(strText)\n script\n on |λ|(xs)\n set {dlm, my text item delimiters} to {my text item delimiters, strText}\n set strJoined to xs as text\n set my text item delimiters to dlm\n return strJoined\n end |λ|\n end script\nend intercalate\n\n-- map :: (a -> b) -> [a] -> [b]\non map(f, xs)\n tell mReturn(f)\n set lng to length of xs\n set lst to {}\n repeat with i from 1 to lng\n set end of lst to |λ|(item i of xs, i, xs)\n end repeat\n return lst\n end tell\nend map\n\n-- Lift 2nd class handler function into 1st class script wrapper\n-- mReturn :: Handler -> Script\non mReturn(f)\n if class of f is script then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n\n-- isNull :: [a] -> Bool\non isNull(xs)\n xs = {}\nend isNull\n\n-- min :: Ord a => a -> a -> a\non min(x, y)\n if y < x then\n y\n else\n x\n end if\nend min\n\n-- quot :: Integral a => a -> a -> a\non quot(n, m)\n n div m\nend quot\n\n-- replicate :: Int -> a -> [a]\non replicate(n, a)\n set out to {}\n if n < 1 then return out\n set dbl to {a}\n\n repeat while (n > 1)\n if (n mod 2) > 0 then set out to out & dbl\n set n to (n div 2)\n set dbl to (dbl & dbl)\n end repeat\n return out & dbl\nend replicate\n\n-- tail :: [a] -> [a]\non tail(xs)\n if length of xs > 1 then\n items 2 thru -1 of xs\n else\n {}\n end if\nend tail\n\n-- take :: Int -> [a] -> [a]\non take(n, xs)\n if class of xs is string then\n if n > 0 then\n text 1 thru min(n, length of xs) of xs\n else\n \"\"\n end if\n else\n if n > 0 then\n items 1 thru min(n, length of xs) of xs\n else\n {}\n end if\n end if\nend take\n\n-- takeCycle :: Int -> [a] -> [a]\non takeCycle(n, xs)\n set lng to length of xs\n if lng ≥ n then\n set cycle to xs\n else\n set cycle to concat(replicate((n div lng) + 1, xs))\n end if\n\n if class of xs is string then\n items 1 thru n of cycle as string\n else\n items 1 thru n of cycle\n end if\nend takeCycle\n\n-- unlines :: [String] -> String\non unlines(xs)\n |λ|(xs) of intercalate(linefeed)\nend unlines\n","language":"AppleScript"},{"code":"repeated?: function [text][\n loop ((size text)/2)..0 'x [\n if prefix? text slice text x (size text)-1 [\n (x>0)? -> return slice text 0 x-1\n -> return false\n ]\n ]\n return false\n]\n\nstrings: {\n 1001110011\n 1110111011\n 0010010010\n 1010101010\n 1111111111\n 0100101101\n 0100100\n 101\n 11\n 00\n 1\n}\n\nloop split.lines strings 'str [\n rep: repeated? str\n if? false = rep ->\n print [str \"-> *not* a rep-string\"]\n else ->\n print [str \"->\" rep \"( length:\" size rep \")\"]\n]\n","language":"Arturo"},{"code":"In := [\"1001110011\", \"1110111011\", \"0010010010\", \"1010101010\"\n , \"1111111111\", \"0100101101\", \"0100100\", \"101\", \"11\", \"00\", \"1\"]\nfor k, v in In\n\tOut .= RepString(v) \"`t\" v \"`n\"\nMsgBox, % Out\n\nRepString(s) {\n\tLoop, % StrLen(s) // 2 {\n\t\ti := A_Index\n\t\tLoop, Parse, s\n\t\t{\n\t\t\tpos := Mod(A_Index, i)\n\t\t\tif (A_LoopField != SubStr(s, !pos ? i : pos, 1))\n\t\t\t\tcontinue, 2\n\t\t}\n\t\treturn SubStr(s, 1, i)\n\t}\n\treturn \"N/A\"\n}\n","language":"AutoHotkey"},{"code":"all$ = \"1001110011 1110111011 0010010010 1010101010 1111111111 0100101101 0100100 101 11 00 1\"\n\nFOR word$ IN all$\n FOR x = LEN(word$)/2 DOWNTO 1\n\n ex$ = EXPLODE$(word$, x)\n\n FOR st$ IN UNIQ$(ex$)\n IF NOT(REGEX(HEAD$(ex$, 1), \"^\" & st$)) THEN CONTINUE 2\n NEXT\n\n PRINT \"Repeating string: \", word$, \" -> \", HEAD$(ex$, 1)\n CONTINUE 2\n NEXT\n\n PRINT \"Not a repeating string: \", word$\nNEXT\n","language":"BaCon"},{"code":"10 DEFINT I: DEFSTR S,T\n20 READ S: IF S=\"\" THEN END\n30 IF LEN(S)<2 THEN 80 ELSE FOR I = LEN(S)\\2 TO 1 STEP -1\n40 T = \"\"\n50 IF LEN(T)<LEN(S) THEN T=T+LEFT$(S,I): GOTO 50\n60 IF LEFT$(T,LEN(S))=S THEN PRINT S;\": \";LEFT$(S,I): GOTO 20\n70 NEXT I\n80 PRINT S;\": none\"\n90 GOTO 20\n100 DATA \"1001110011\",\"1110111011\"\n110 DATA \"0010010010\",\"1010101010\"\n120 DATA \"1111111111\",\"0100101101\"\n130 DATA \"0100100\",\"101\"\n140 DATA \"11\",\"00\"\n150 DATA \"1\",\"\"\n","language":"BASIC"},{"code":"get \"libhdr\"\n\n// Returns the length of the longest rep-string\n// (0 if there are none)\nlet repstring(s) = valof\n$( for i = s%0/2 to 1 by -1 do\n $( for j = 1 to i\n $( let k = i\n while j+k <= s%0 do\n $( unless s%(j+k)=s%j goto next\n k := k + i\n $)\n $)\n resultis i\n next: loop\n $)\n resultis 0\n$)\n\n// Print first N characters of string\nlet writefirst(s, n) be\n$( let x = s%0\n s%0 := n\n writes(s)\n s%0 := x\n$)\n\n// Test string\nlet rep(s) be\n$( let n = repstring(s)\n writef(\"%S: \",s)\n test n=0\n do writes(\"none\")\n or writefirst(s,n)\n wrch('*N')\n$)\n\nlet start() be\n$( rep(\"1001110011\")\n rep(\"1110111011\")\n rep(\"0010010010\")\n rep(\"1010101010\")\n rep(\"1111111111\")\n rep(\"0100101101\")\n rep(\"0100100\")\n rep(\"101\")\n rep(\"11\")\n rep(\"00\")\n rep(\"1\")\n$)\n","language":"BCPL"},{"code":"# Returns a list of all rep-strings\nReps←(⌊≠÷2˙)((⊣≥≠¨∘⊢)/⊢)(<≡¨≠⥊¨1↓↑)/1↓↑\n\n# Tests\ntests←⟨\n \"1001110011\", \"1110111011\", \"0010010010\",\n \"1010101010\", \"1111111111\", \"0100101101\",\n \"0100100\", \"101\", \"11\", \"00\", \"1\"\n⟩\n\n∾´{ 𝕩∾':'∾(•Fmt Reps 𝕩)∾@+10 }¨tests\n","language":"BQN"},{"code":"( ( rep-string\n = reps L x y\n . ( reps\n = x y z\n . !arg:(?x.?y)\n & ( @(!y:!x ?z)&reps$(!x.!z)\n | @(!x:!y ?)\n )\n )\n & ( :?L\n & @( !arg\n : %?x\n !x\n ( ?y\n & reps$(!x.!y)\n & !x !L:?L\n & ~\n )\n )\n | !L:\n & out$(str$(!arg \" is not a rep-string\"))\n | out$(!arg \":\" !L)\n )\n )\n& rep-string$1001110011\n& rep-string$1110111011\n& rep-string$0010010010\n& rep-string$1010101010\n& rep-string$1111111111\n& rep-string$0100101101\n& rep-string$0100100\n& rep-string$101\n& rep-string$11\n& rep-string$00\n& rep-string$1\n);\n","language":"Bracmat"},{"code":"#include <stdio.h>\n#include <string.h>\n\nint repstr(char *str)\n{\n if (!str) return 0;\n\n size_t sl = strlen(str) / 2;\n while (sl > 0) {\n if (strstr(str, str + sl) == str)\n return sl;\n --sl;\n }\n\n return 0;\n}\n\nint main(void)\n{\n char *strs[] = { \"1001110011\", \"1110111011\", \"0010010010\", \"1111111111\",\n \"0100101101\", \"0100100\", \"101\", \"11\", \"00\", \"1\" };\n\n size_t strslen = sizeof(strs) / sizeof(strs[0]);\n size_t i;\n for (i = 0; i < strslen; ++i) {\n int n = repstr(strs[i]);\n if (n)\n printf(\"\\\"%s\\\" = rep-string \\\"%.*s\\\"\\n\", strs[i], n, strs[i]);\n else\n printf(\"\\\"%s\\\" = not a rep-string\\n\", strs[i]);\n }\n\n return 0;\n}\n","language":"C"},{"code":"// strstr : Returns a pointer to the first occurrence of str2 in str1, or a null pointer if str2 is not part of str1.\n// size_t is an unsigned integer typ\n// lokks for the shortest substring\nint repstr(char *str)\n{\n if (!str) return 0; // if empty input\n\n size_t sl = 1;\n size_t sl_max = strlen(str) ;\n\n while (sl < sl_max) {\n if (strstr(str, str + sl) == str) // How it works ???? It checks the whole string str\n \treturn sl;\n ++sl;\n }\n\n return 0;\n}\n","language":"C"},{"code":"#include <string>\n#include <vector>\n#include <boost/regex.hpp>\n\nbool is_repstring( const std::string & teststring , std::string & repunit ) {\n std::string regex( \"^(.+)\\\\1+(.*)$\" ) ;\n boost::regex e ( regex ) ;\n boost::smatch what ;\n if ( boost::regex_match( teststring , what , e , boost::match_extra ) ) {\n std::string firstbracket( what[1 ] ) ;\n std::string secondbracket( what[ 2 ] ) ;\n if ( firstbracket.length( ) >= secondbracket.length( ) &&\n\t firstbracket.find( secondbracket ) != std::string::npos ) {\n\t repunit = firstbracket ;\n }\n }\n return !repunit.empty( ) ;\n}\n\nint main( ) {\n std::vector<std::string> teststrings { \"1001110011\" , \"1110111011\" , \"0010010010\" ,\n \"1010101010\" , \"1111111111\" , \"0100101101\" , \"0100100\" , \"101\" , \"11\" , \"00\" , \"1\" } ;\n std::string theRep ;\n for ( std::string myString : teststrings ) {\n if ( is_repstring( myString , theRep ) ) {\n\t std::cout << myString << \" is a rep string! Here is a repeating string:\\n\" ;\n\t std::cout << theRep << \" \" ;\n }\n else {\n\t std::cout << myString << \" is no rep string!\" ;\n }\n theRep.clear( ) ;\n std::cout << std::endl ;\n }\n return 0 ;\n}\n","language":"C++"},{"code":"#include <cstdint>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <sstream>\n#include <string>\n#include <vector>\n\nstd::string repeat(const std::string& text, const int32_t& repetitions) {\n std::stringstream stream;\n std::fill_n(std::ostream_iterator<std::string>(stream), repetitions, text);\n return stream.str();\n}\n\nstd::vector<std::string> rep_string(const std::string& text) {\n\tstd::vector<std::string> repetitions;\n\n\tfor ( uint64_t len = 1; len <= text.length() / 2; ++len ) {\n\t\tstd::string possible = text.substr(0, len);\n\t\tuint64_t quotient = text.length() / len;\n\t\tuint64_t remainder = text.length() % len;\n\t\tstd::string candidate = repeat(possible, quotient) + possible.substr(0, remainder);\n\t\tif ( candidate == text ) {\n\t\t\trepetitions.emplace_back(possible);\n\t\t}\n\t}\n\treturn repetitions;\n}\n\nint main() {\n\tconst std::vector<std::string> tests = { \"1001110011\", \"1110111011\", \"0010010010\",\n\t\t\"1010101010\", \"1111111111\", \"0100101101\", \"0100100\", \"101\", \"11\", \"00\", \"1\" };\n\n\tstd::cout << \"The longest rep-strings are:\" << std::endl;\n\tfor ( const std::string& test : tests ) {\n\t\tstd::vector<std::string> repeats = rep_string(test);\n\t\tstd::string result = repeats.empty() ? \"Not a rep-string\" : repeats.back();\n\t\tstd::cout << std::setw(10) << test << \" -> \" << result << std::endl;\n\t}\n}\n","language":"C++"},{"code":"using System;\n\npublic class RepString\n{\n static readonly string[] input = {\"1001110011\", \"1110111011\", \"0010010010\",\n \"1010101010\", \"1111111111\", \"0100101101\", \"0100100\", \"101\", \"11\",\n \"00\", \"1\", \"0100101\"};\n\n public static void Main(string[] args)\n {\n foreach (string s in input)\n Console.WriteLine($\"{s} : {repString(s)}\");\n }\n\n static string repString(string s)\n {\n int len = s.Length;\n for (int part = len / 2; part > 0; part--)\n {\n int tail = len % part;\n if (tail > 0 && !s.Substring(0, tail).Equals(s.Substring(len - tail)))\n continue;\n bool isRepeated = true;\n for (int j = 0; j < len / part - 1; j++)\n {\n int a = j * part;\n int b = (j + 1) * part;\n int c = (j + 2) * part;\n if (!s.Substring(a, part).Equals(s.Substring(b, part)))\n {\n isRepeated = false;\n break;\n }\n }\n if (isRepeated)\n return s.Substring(0, part);\n }\n return \"none\";\n }\n}\n","language":"C-sharp"},{"code":"(defn rep-string [s]\n (let [len (count s)\n first-half (subs s 0 (/ len 2))\n test-group (take-while seq (iterate butlast first-half))\n test-reptd (map #(take len (cycle %)) test-group)]\n (some #(= (seq s) %) test-reptd)))\n","language":"Clojure"},{"code":"(def test-strings [\"1001110011\"\n \"1110111011\"\n \"0010010010\"\n \"1010101010\"\n \"1111111111\"\n \"0100101101\"\n \"0100100\"\n \"101\"\n \"11\"\n \"00\"\n \"1\"])\n\n(map (juxt identity rep-string) test-strings)\n","language":"Clojure"},{"code":"rep_strings = iter (s: string) yields (string)\n for len: int in int$from_to_by(string$size(s)/2, 1, -1) do\n repstr: string := string$substr(s, 1, len)\n attempt: string := \"\"\n while string$size(attempt) < string$size(s) do\n attempt := attempt || repstr\n end\n if s = string$substr(attempt, 1, string$size(s)) then\n yield(repstr)\n end\n end\nend rep_strings\n\nstart_up = proc ()\n as = array[string]\n po: stream := stream$primary_output()\n tests: as := as$[\"1001110011\",\"1110111011\",\"0010010010\",\"1010101010\",\n \"1111111111\",\"0100101101\",\"0100100\",\"101\",\"11\",\"00\",\n \"1\"]\n\n for test: string in as$elements(tests) do\n stream$puts(po, test || \": \")\n for rep_str: string in rep_strings(test) do\n stream$puts(po, \"<\" || rep_str || \"> \")\n end\n stream$putc(po, '\\n')\n end\nend start_up\n","language":"CLU"},{"code":"(ql:quickload :alexandria)\n(defun rep-stringv (a-str &optional (max-rotation (floor (/ (length a-str) 2))))\n ;; Exit condition if no repetition found.\n (cond ((< max-rotation 1) \"Not a repeating string\")\n ;; Two checks:\n ;; 1. Truncated string must be equal to rotation by repetion size.\n ;; 2. Remaining chars (rest-str) are identical to starting chars (beg-str)\n ((let* ((trunc (* max-rotation (truncate (length a-str) max-rotation)))\n (truncated-str (subseq a-str 0 trunc))\n (rest-str (subseq a-str trunc))\n (beg-str (subseq a-str 0 (rem (length a-str) max-rotation))))\n (and (string= beg-str rest-str)\n (string= (alexandria:rotate (copy-seq truncated-str) max-rotation)\n truncated-str)))\n ;; If both checks pass, return the repeting string.\n (subseq a-str 0 max-rotation))\n ;; Recurse function reducing length of rotation.\n (t (rep-stringv a-str (1- max-rotation)))))\n","language":"Common-Lisp"},{"code":"(setf test-strings '(\"1001110011\"\n \"1110111011\"\n \"0010010010\"\n \"1010101010\"\n \"1111111111\"\n \"0100101101\"\n \"0100100\"\n \"101\"\n \"11\"\n \"00\"\n \"1\"\n ))\n\n(loop for item in test-strings\n collecting (cons item (rep-stringv item)))\n","language":"Common-Lisp"},{"code":"def rep(s : String) : Int32\n x = s.size // 2\n\n while x > 0\n return x if s.starts_with? s[x..]\n x -= 1\n end\n\n 0\nend\n\ndef main\n %w(\n 1001110011\n 1110111011\n 0010010010\n 1010101010\n 1111111111\n 0100101101\n 0100100\n 101\n 11\n 00\n 1\n ).each do |s|\n n = rep s\n puts n > 0 ? \"\\\"#{s}\\\" #{n} rep-string \\\"#{s[..(n - 1)]}\\\"\" : \"\\\"#{s}\\\" not a rep-string\"\n end\nend\n\nmain\n","language":"Crystal"},{"code":"import std.stdio, std.string, std.conv, std.range, std.algorithm,\n std.ascii, std.typecons;\n\nNullable!(size_t, 0) repString1(in string s) pure nothrow @safe @nogc\nin {\n //assert(s.all!isASCII);\n assert(s.representation.all!isASCII);\n} body {\n immutable sr = s.representation;\n foreach_reverse (immutable n; 1 .. sr.length / 2 + 1)\n if (sr.take(n).cycle.take(sr.length).equal(sr))\n return typeof(return)(n);\n return typeof(return)();\n}\n\nNullable!(size_t, 0) repString2(in string s) pure @safe /*@nogc*/\nin {\n assert(s.countchars(\"01\") == s.length);\n} body {\n immutable bits = s.to!ulong(2);\n\n foreach_reverse (immutable left; 1 .. s.length / 2 + 1) {\n immutable right = s.length - left;\n if ((bits ^ (bits >> left)) == ((bits >> right) << right))\n return typeof(return)(left);\n }\n return typeof(return)();\n}\n\nvoid main() {\n immutable words = \"1001110011 1110111011 0010010010 1010101010\n 1111111111 0100101101 0100100 101 11 00 1\".split;\n\n foreach (immutable w; words) {\n immutable r1 = w.repString1;\n //assert(r1 == w.repString2);\n immutable r2 = w.repString2;\n assert((r1.isNull && r2.isNull) || r1 == r2);\n if (r1.isNull)\n writeln(w, \" (no repeat)\");\n else\n writefln(\"%(%s %)\", w.chunks(r1));\n }\n}\n","language":"D"},{"code":"program Rep_string;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils;\n\nconst\n m = '1001110011'#10 +\n '1110111011'#10 +\n '0010010010'#10 +\n '1010101010'#10 +\n '1111111111'#10 +\n '0100101101'#10 +\n '0100100'#10 +\n '101'#10 +\n '11'#10 +\n '00'#10 +\n '1';\n\nfunction Rep(s: string; var sub:string): Integer;\nvar\n x: Integer;\nbegin\n for x := s.Length div 2 downto 1 do\n begin\n sub := s.Substring(x);\n if s.StartsWith(sub) then\n exit(x);\n end;\n sub := '';\n Result := 0;\nend;\n\nbegin\n for var s in m.Split([#10]) do\n begin\n var sub := '';\n var n := rep(s,sub);\n if n > 0 then\n writeln(format('\"%s\" %d rep-string \"%s\"', [s, n, sub]))\n else\n writeln(format('\"%s\" not a rep-string', [s]));\n end;\n {$IFNDEF UNIX}readln;{$ENDIF}\nend.\n","language":"Delphi"},{"code":"func rep(s) {\n var x = s.Length() / 2\n while x > 0 {\n if s.StartsWith(s.Substring(x)) {\n return x\n }\n x -= 1\n }\n return 0\n}\n\nlet m = [\n \"1001110011\",\n \"1110111011\",\n \"0010010010\",\n \"1010101010\",\n \"1111111111\",\n \"0100101101\",\n \"0100100\",\n \"101\",\n \"11\",\n \"00\",\n \"1\"\n]\n\nfor s in m {\n if (rep(s) is n) && n > 0 {\n print(\"\\(s) \\(n) rep-string \\(s.Substring(n))\")\n } else {\n print(\"\\(s) not a rep-string\")\n }\n}\n","language":"Dyalect"},{"code":"func$ repstr s$ .\n sl = len s$ div 2 + 1\n while sl > 1\n r$ = substr s$ sl 999\n if r$ = substr s$ 1 len r$\n return substr r$ 1 (sl - 1)\n .\n sl -= 1\n .\n return \"\"\n.\nrepeat\n s$ = input\n until s$ = \"\"\n print s$ & \" -> \" & repstr s$\n.\ninput_data\n1001110011\n1110111011\n0010010010\n1010101010\n1111111111\n0100101101\n0100100\n101\n11\n00\n1\n","language":"EasyLang"},{"code":"(lib 'list) ;; list-rotate\n\n;; a list is a rep-list if equal? to itself after a rotation of lam units\n;; lam <= list length / 2\n;; truncate to a multiple of lam before rotating\n;; try cycles in decreasing lam order (longest wins)\n\n(define (cyclic? cyclic)\n (define len (length cyclic))\n (define trunc null)\n\n (if (> len 1)\n (for ((lam (in-range (quotient len 2) 0 -1)))\n (set! trunc (take cyclic (- len (modulo len lam))))\n #:break (equal? trunc (list-rotate trunc lam)) => (list->string (take cyclic lam))\n 'no-rep )\n 'too-short-no-rep))\n","language":"EchoLisp"},{"code":"(define strings '[\"1001110011\" \"1110111011\" \"0010010010\" \"1010101010\"\n \"1111111111\" \"0100101101\" \"0100100\" \"101\" \"11\" \"00\" \"1\"])\n\n(define (task strings)\n\t(for-each (lambda (s)\n\t(writeln s (cyclic? (string->list s)))) strings))\n\n(task strings)\n\n\"1001110011\" \"10011\"\n\"1110111011\" \"1110\"\n\"0010010010\" \"001\"\n\"1010101010\" \"1010\"\n\"1111111111\" \"11111\"\n\"0100101101\" no-rep\n\"0100100\" \"010\"\n\"101\" no-rep\n\"11\" \"1\"\n\"00\" \"0\"\n\"1\" too-short-no-rep\n","language":"EchoLisp"},{"code":"defmodule Rep_string do\n def find(\"\"), do: IO.puts \"String was empty (no repetition)\"\n def find(str) do\n IO.puts str\n rep_pos = Enum.find(div(String.length(str),2)..1, fn pos ->\n String.starts_with?(str, String.slice(str, pos..-1))\n end)\n if rep_pos && rep_pos>0 do\n IO.puts String.duplicate(\" \", rep_pos) <> String.slice(str, 0, rep_pos)\n else\n IO.puts \"(no repetition)\"\n end\n IO.puts \"\"\n end\nend\n\nstrs = ~w(1001110011\n 1110111011\n 0010010010\n 1010101010\n 1111111111\n 0100101101\n 0100100\n 101\n 11\n 00\n 1)\n\nEnum.each(strs, fn str -> Rep_string.find(str) end)\n","language":"Elixir"},{"code":"REPCYCLES\n=LAMBDA(s,\n LET(\n n, LEN(s),\n xs, FILTERP(\n LAMBDA(pfx,\n s = TAKECYCLESTRING(n)(pfx)\n )\n )(\n TAILCOLS(\n INITS(\n MID(s, 1, QUOTIENT(n, 2))\n )\n )\n ),\n\n IF(ISERROR(xs), NA(), xs)\n )\n)\n\n\nTAKECYCLESTRING\n=LAMBDA(n,\n LAMBDA(s,\n LET(\n lng, LEN(s),\n\n MID(\n IF(n < lng,\n s,\n REPT(s, CEILING.MATH(n / lng))\n ),\n 1, n\n )\n )\n )\n)\n","language":"Excel"},{"code":"FILTERP\n=LAMBDA(p,\n LAMBDA(xs,\n FILTER(xs, p(xs))\n )\n)\n\n\nINITS\n=LAMBDA(s,\n MID(\n s,\n 1, SEQUENCE(\n 1, 1 + LEN(s),\n 0, 1\n )\n )\n)\n\n\nLASTCOL\n=LAMBDA(xs,\n IF(AND(1 = COLUMNS(xs), ISBLANK(xs)),\n NA(),\n INDEX(xs, 1, COLUMNS(xs))\n )\n)\n\n\nTAILCOLS\n=LAMBDA(xs,\n IF(1 < COLUMNS(xs),\n INDEX(\n xs,\n 1,\n SEQUENCE(1, COLUMNS(xs) - 1, 2, 1)\n ),\n NA()\n )\n)\n","language":"Excel"},{"code":"let isPrefix p (s : string) = s.StartsWith(p)\nlet getPrefix n (s : string) = s.Substring(0,n)\n\nlet repPrefixOf str =\n let rec isRepeatedPrefix p s =\n if isPrefix p s then isRepeatedPrefix p (s.Substring (p.Length))\n else isPrefix s p\n\n let rec getLongestRepeatedPrefix n =\n if n = 0 then None\n elif isRepeatedPrefix (getPrefix n str) str then Some(getPrefix n str)\n else getLongestRepeatedPrefix (n-1)\n\n getLongestRepeatedPrefix (str.Length/2)\n\n[<EntryPoint>]\nlet main argv =\n printfn \"Testing for rep-string (and showing the longest repeated prefix in case):\"\n [\n \"1001110011\"\n \"1110111011\"\n \"0010010010\"\n \"1010101010\"\n \"1111111111\"\n \"0100101101\"\n \"0100100\"\n \"101\"\n \"11\"\n \"00\"\n \"1\"\n ] |>\n List.map (fun s ->\n match repPrefixOf s with | None -> s + \": NO\" | Some(p) -> s + \": YES (\"+ p + \")\")\n |> List.iter (printfn \"%s\")\n 0\n","language":"F-Sharp"},{"code":"USING: formatting grouping kernel math math.ranges qw sequences ;\nIN: rosetta-code.rep-string\n\n: (find-rep-string) ( str -- str )\n dup dup length 2/ [1,b]\n [ <groups> [ head? ] monotonic? ] with find nip dup\n [ head ] [ 2drop \"N/A\" ] if ;\n\n: find-rep-string ( str -- str )\n dup length 1 <= [ drop \"N/A\" ] [ (find-rep-string) ] if ;\n\nqw{ 1001110011 1110111011 0010010010 1010101010 1111111111\n 0100101101 0100100 101 11 00 1 }\n\"Shortest cycle:\\n\\n\" printf\n[ dup find-rep-string \"%-10s -> %s\\n\" printf ] each\n","language":"Factor"},{"code":": rep-string ( caddr1 u1 -- caddr2 u2 ) \\ u2=0: not a rep-string\n 2dup dup >r r@ 2/ /string\n begin 2over 2over string-prefix? 0= over r@ < and while -1 /string repeat\n r> swap - >r 2drop r> ;\n\n: test ( caddr u -- )\n 2dup type .\" has \"\n rep-string ?dup 0= if drop .\" no \" else type .\" as \" then\n .\" repeating substring\" cr ;\n: tests\n s\" 1001110011\" test\n s\" 1110111011\" test\n s\" 0010010010\" test\n s\" 1010101010\" test\n s\" 1111111111\" test\n s\" 0100101101\" test\n s\" 0100100\" test\n s\" 101\" test\n s\" 11\" test\n s\" 00\" test\n s\" 1\" test ;\n","language":"Forth"},{"code":"cr tests\n1001110011 has 10011 as repeating substring\n1110111011 has 1110 as repeating substring\n0010010010 has 001 as repeating substring\n1010101010 has 1010 as repeating substring\n1111111111 has 11111 as repeating substring\n0100101101 has no repeating substring\n0100100 has 010 as repeating substring\n101 has no repeating substring\n11 has 1 as repeating substring\n00 has 0 as repeating substring\n1 has no repeating substring\n ok\n","language":"Forth"},{"code":"Data \"1001110011\", \"1110111011\", \"0010010010\", \"1010101010\", \"1111111111\", \"0100101101\", \"0100100\", \"101\", \"11\", \"00\", \"1\", \"\"\n\nFunction rep(c As String, n As Integer) As String\n Dim As String r\n\n For i As Integer = 1 To n\n r = r + c\n Next i\n Return r\nEnd Function\n\nDo\n Dim As String p, b = \"\", t, s\n Read p : If p = \"\" Then Exit Do\n Dim As Integer l = Len(p), m = Int(l / 2)\n\n For i As Integer = m To 1 Step -1\n t = Left(p, i)\n s = rep(t, l / i + 1)\n If p = Left(s, l) Then b = t : Exit For\n Next i\n\n If b = \"\" Then\n Print p; \" no es una cadena repetida\"\n Else\n Print p; \" secuencia m s larga: \"; b\n End If\nLoop\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"strings\"\n)\n\nfunc rep(s string) int {\n for x := len(s) / 2; x > 0; x-- {\n if strings.HasPrefix(s, s[x:]) {\n return x\n }\n }\n return 0\n}\n\nconst m = `\n1001110011\n1110111011\n0010010010\n1010101010\n1111111111\n0100101101\n0100100\n101\n11\n00\n1`\n\nfunc main() {\n for _, s := range strings.Fields(m) {\n if n := rep(s); n > 0 {\n fmt.Printf(\"%q %d rep-string %q\\n\", s, n, s[:n])\n } else {\n fmt.Printf(\"%q not a rep-string\\n\", s)\n }\n }\n}\n","language":"Go"},{"code":"import Data.List (inits, maximumBy)\nimport Data.Maybe (fromMaybe)\n\nrepstring :: String -> Maybe String\n-- empty strings are not rep strings\nrepstring [] = Nothing\n-- strings with only one character are not rep strings\nrepstring [_] = Nothing\nrepstring xs\n | any (`notElem` \"01\") xs = Nothing\n | otherwise = longest xs\n where\n -- length of the original string\n lxs = length xs\n -- half that length\n lq2 = lxs `quot` 2\n -- make a string of same length using repetitions of a part\n -- of the original string, and also return the substring used\n subrepeat x = (x, take lxs $ concat $ repeat x)\n -- check if a repeated string matches the original string\n sndValid (_, ys) = ys == xs\n -- make all possible strings out of repetitions of parts of\n -- the original string, which have max. length lq2\n possible = map subrepeat . take lq2 . tail . inits\n -- filter only valid possibilities, and return the substrings\n -- used for building them\n valid = map fst . filter sndValid . possible\n -- see which string is longer\n compLength a b = compare (length a) (length b)\n -- get the longest substring that, repeated, builds a string\n -- that matches the original string\n longest ys = case valid ys of\n [] -> Nothing\n zs -> Just $ maximumBy compLength zs\n\nmain :: IO ()\nmain =\n mapM_ processIO examples\n where\n examples =\n [ \"1001110011\",\n \"1110111011\",\n \"0010010010\",\n \"1010101010\",\n \"1111111111\",\n \"0100101101\",\n \"0100100\",\n \"101\",\n \"11\",\n \"00\",\n \"1\"\n ]\n process = fromMaybe \"Not a rep string\" . repstring\n processIO xs = do\n putStr (xs <> \": \")\n putStrLn $ process xs\n","language":"Haskell"},{"code":"import Data.Bool (bool)\nimport Data.List (inits, intercalate, transpose)\n\n------------------------ REP-CYCLES ----------------------\n\nrepCycles :: String -> [String]\nrepCycles cs =\n filter\n ((cs ==) . take n . cycle)\n ((tail . inits) $ take (quot n 2) cs)\n where\n n = length cs\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain =\n putStrLn $\n fTable\n \"Longest cycles:\\n\"\n id\n ((flip bool \"n/a\" . last) <*> null)\n repCycles\n [ \"1001110011\",\n \"1110111011\",\n \"0010010010\",\n \"1010101010\",\n \"1111111111\",\n \"0100101101\",\n \"0100100\",\n \"101\",\n \"11\",\n \"00\",\n \"1\"\n ]\n\n------------------------- GENERIC ------------------------\nfTable ::\n String ->\n (a -> String) ->\n (b -> String) ->\n (a -> b) ->\n [a] ->\n String\nfTable s xShow fxShow f xs =\n let rjust n c = drop . length <*> (replicate n c <>)\n w = maximum (length . xShow <$> xs)\n in unlines $\n s :\n fmap\n ( ((<>) . rjust w ' ' . xShow)\n <*> ((\" -> \" <>) . fxShow . f)\n )\n xs\n","language":"Haskell"},{"code":"procedure main(A)\n every write(s := !A,\": \",(repString(s) | \"Not a rep string!\")\\1)\nend\n\nprocedure repString(s)\n rs := s[1+:*s/2]\n while (*rs > 0) & (s ~== lrepl(rs,*s,rs)) do rs := rs[1:-1]\n return (*rs > 0, rs)\nend\n\nprocedure lrepl(s1,n,s2) # The standard left() procedure won't work.\n while *s1 < n do s1 ||:= s2\n return s1[1+:n]\nend\n","language":"Icon"},{"code":"replengths=: >:@i.@<.@-:@#\nrep=: $@] $ $\n\nisRepStr=: +./@((] -: rep)\"0 1~ replengths)\n","language":"J"},{"code":" isRepStr '1001110011'\n1\n Tests=: noun define\n1001110011\n1110111011\n0010010010\n1010101010\n1111111111\n0100101101\n0100100\n101\n11\n00\n1\n)\n isRepStr;._2 Tests NB. run all tests\n1 1 1 1 1 0 1 0 1 1 0\n","language":"J"},{"code":"nRepStr=: 0 -.~ (([ * ] -: rep)\"0 1~ replengths)\n","language":"J"},{"code":" \":@nRepStr;._2 Tests\n5\n4\n3\n2 4\n1 2 3 4 5\n\n3\n\n1\n1\n","language":"J"},{"code":"public class RepString {\n\n static final String[] input = {\"1001110011\", \"1110111011\", \"0010010010\",\n \"1010101010\", \"1111111111\", \"0100101101\", \"0100100\", \"101\", \"11\",\n \"00\", \"1\", \"0100101\"};\n\n public static void main(String[] args) {\n for (String s : input)\n System.out.printf(\"%s : %s%n\", s, repString(s));\n }\n\n static String repString(String s) {\n int len = s.length();\n outer:\n for (int part = len / 2; part > 0; part--) {\n int tail = len % part;\n if (tail > 0 && !s.substring(0, tail).equals(s.substring(len - tail)))\n continue;\n for (int j = 0; j < len / part - 1; j++) {\n int a = j * part;\n int b = (j + 1) * part;\n int c = (j + 2) * part;\n if (!s.substring(a, b).equals(s.substring(b, c)))\n continue outer;\n }\n return s.substring(0, part);\n }\n return \"none\";\n }\n}\n","language":"Java"},{"code":"import java.util.ArrayList;\nimport java.util.List;\n\npublic final class RepStrings {\n\n\tpublic static void main(String[] aArgs) {\n\t\tList<String> tests = List.of( \"1001110011\", \"1110111011\", \"0010010010\",\n\t\t\t\"1010101010\", \"1111111111\", \"0100101101\", \"0100100\", \"101\", \"11\", \"00\", \"1\" );\n\n\t\tSystem.out.println(\"The longest rep-strings are:\");\n\t\tfor ( String test : tests ) {\n\t\t\tList<String> repeats = repString(test);\n\t\t\tString result = repeats.isEmpty() ? \"Not a rep-string\" : repeats.get(repeats.size() - 1);\n\t\t\tSystem.out.println(String.format(\"%10s%s%s\", test, \" -> \", result));\n\t\t}\n\t}\n\t\n\tprivate static List<String> repString(String aText) {\n\t\tList<String> repetitions = new ArrayList<String>();\n\t\t\n\t\tfor ( int length = 1; length <= aText.length() / 2; length++ ) {\n\t\t\tString possible = aText.substring(0, length);\n\t\t\tint quotient = aText.length() / length;\n\t\t\tint remainder = aText.length() % length;\n\t\t\tString candidate = possible.repeat(quotient) + possible.substring(0, remainder);\n\t\t\tif ( candidate.equals(aText) ) {\n\t\t\t\trepetitions.add(possible);\n\t\t\t}\n\t\t}\n\t\treturn repetitions;\n\t}\n\n}\n","language":"Java"},{"code":"(() => {\n 'use strict';\n\n const main = () => {\n\n // REP-CYCLES -------------------------------------\n\n // repCycles :: String -> [String]\n const repCycles = s => {\n const n = s.length;\n return filter(\n x => s === take(n, cycle(x)).join(''),\n tail(inits(take(quot(n, 2), s)))\n );\n };\n\n // TEST -------------------------------------------\n console.log(fTable(\n 'Longest cycles:\\n',\n str,\n xs => 0 < xs.length ? concat(last(xs)) : '(none)',\n repCycles,\n [\n '1001110011',\n '1110111011',\n '0010010010',\n '1010101010',\n '1111111111',\n '0100101101',\n '0100100',\n '101',\n '11',\n '00',\n '1'\n ]\n ));\n };\n\n // GENERIC FUNCTIONS ----------------------------------\n\n // concat :: [[a]] -> [a]\n // concat :: [String] -> String\n const concat = xs =>\n 0 < xs.length ? (() => {\n const unit = 'string' !== typeof xs[0] ? (\n []\n ) : '';\n return unit.concat.apply(unit, xs);\n })() : [];\n\n // cycle :: [a] -> Generator [a]\n function* cycle(xs) {\n const lng = xs.length;\n let i = 0;\n while (true) {\n yield(xs[i])\n i = (1 + i) % lng;\n }\n }\n\n // filter :: (a -> Bool) -> [a] -> [a]\n const filter = (f, xs) => xs.filter(f);\n\n // fTable :: String -> (a -> String) ->\n // (b -> String) -> (a -> b) -> [a] -> String\n const fTable = (s, xShow, fxShow, f, xs) => {\n // Heading -> x display function ->\n // fx display function ->\n // f -> values -> tabular string\n const\n ys = xs.map(xShow),\n w = Math.max(...ys.map(length));\n return s + '\\n' + zipWith(\n (a, b) => a.padStart(w, ' ') + ' -> ' + b,\n ys,\n xs.map(x => fxShow(f(x)))\n ).join('\\n');\n };\n\n // inits([1, 2, 3]) -> [[], [1], [1, 2], [1, 2, 3]\n // inits('abc') -> [\"\", \"a\", \"ab\", \"abc\"]\n\n // inits :: [a] -> [[a]]\n // inits :: String -> [String]\n const inits = xs => [\n []\n ]\n .concat(('string' === typeof xs ? xs.split('') : xs)\n .map((_, i, lst) => lst.slice(0, 1 + i)));\n\n // last :: [a] -> a\n const last = xs =>\n 0 < xs.length ? xs.slice(-1)[0] : undefined;\n\n // Returns Infinity over objects without finite length.\n // This enables zip and zipWith to choose the shorter\n // argument when one is non-finite, like cycle, repeat etc\n\n // length :: [a] -> Int\n const length = xs =>\n (Array.isArray(xs) || 'string' === typeof xs) ? (\n xs.length\n ) : Infinity;\n\n // quot :: Int -> Int -> Int\n const quot = (n, m) => Math.floor(n / m);\n\n // str :: a -> String\n const str = x => x.toString();\n\n // tail :: [a] -> [a]\n const tail = xs => 0 < xs.length ? xs.slice(1) : [];\n\n // take :: Int -> [a] -> [a]\n // take :: Int -> String -> String\n const take = (n, xs) =>\n 'GeneratorFunction' !== xs.constructor.constructor.name ? (\n xs.slice(0, n)\n ) : [].concat.apply([], Array.from({\n length: n\n }, () => {\n const x = xs.next();\n return x.done ? [] : [x.value];\n }));\n\n // unlines :: [String] -> String\n const unlines = xs => xs.join('\\n');\n\n // Use of `take` and `length` here allows zipping with non-finite lists\n // i.e. generators like cycle, repeat, iterate.\n\n // zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\n const zipWith = (f, xs, ys) => {\n const\n lng = Math.min(length(xs), length(ys)),\n as = take(lng, xs),\n bs = take(lng, ys);\n return Array.from({\n length: lng\n }, (_, i) => f(as[i], bs[i], i));\n };\n\n // MAIN ---\n return main();\n})();\n","language":"JavaScript"},{"code":"def is_rep_string:\n # if self is a rep-string then return [n, prefix]\n # where n is the number of full occurrences of prefix\n def _check(prefix; n; sofar):\n length as $length\n | if length <= (sofar|length) then [n, prefix]\n else (sofar+prefix) as $sofar\n | if startswith($sofar) then _check(prefix; n+1; $sofar)\n elif ($sofar|length) > $length and\n startswith($sofar[0:$length]) then [n, prefix]\n else [0, prefix]\n end\n end\n ;\n\n [range (1; length/2 + 1) as $i\n | .[0:$i] as $prefix\n | _check($prefix; 1; $prefix)\n | select( .[0] > 1 ) ]\n ;\n","language":"Jq"},{"code":"def test:\n (\n \"1001110011\",\n \"1110111011\",\n \"0010010010\",\n \"1010101010\",\n \"1111111111\",\n \"0100101101\",\n \"0100100\",\n \"101\",\n \"11\",\n \"00\",\n \"1\"\n ) | { (.) : is_rep_string }\n;\n\ntest\n","language":"Jq"},{"code":" $ jq -n -c -f rep-string.jq\n {\"1001110011\":[[2,\"10011\"]]}\n {\"1110111011\":[[2,\"1110\"]]}\n {\"0010010010\":[[3,\"001\"]]}\n {\"1010101010\":[[5,\"10\"],[2,\"1010\"]]}\n {\"1111111111\":[[10,\"1\"],[5,\"11\"],[3,\"111\"],[2,\"1111\"],[2,\"11111\"]]}\n {\"0100101101\":[]}\n {\"0100100\":[[2,\"010\"]]}\n {\"101\":[]}\n {\"11\":[[2,\"1\"]]}\n {\"00\":[[2,\"0\"]]}\n {\"1\":[]}\n","language":"Jq"},{"code":"function repstring(r::AbstractString)\n n = length(r)\n replst = String[]\n for m in 1:n÷2\n s = r[1:chr2ind(r, m)]\n if (s ^ cld(n, m))[1:chr2ind(r, n)] != r continue end\n push!(replst, s)\n end\n return replst\nend\n\ntests = [\"1001110011\", \"1110111011\", \"0010010010\", \"1010101010\", \"1111111111\",\n \"0100101101\", \"0100100\", \"101\", \"11\", \"00\", \"1\",\n \"\\u2200\\u2203\\u2200\\u2203\\u2200\\u2203\\u2200\\u2203\"]\n\nfor r in tests\n replst = repstring(r)\n if isempty(replst)\n println(\"$r is not a rep-string.\")\n else\n println(\"$r is a rep-string of \", join(replst, \", \"), \".\")\n end\nend\n","language":"Julia"},{"code":"// version 1.0.6\n\nfun repString(s: String): MutableList<String> {\n val reps = mutableListOf<String>()\n if (s.length < 2) return reps\n for (c in s) if (c != '0' && c != '1') throw IllegalArgumentException(\"Not a binary string\")\n for (len in 1..s.length / 2) {\n val t = s.take(len)\n val n = s.length / len\n val r = s.length % len\n val u = t.repeat(n) + t.take(r)\n if (u == s) reps.add(t)\n }\n return reps\n}\n\nfun main(args: Array<String>) {\n val strings = listOf(\n \"1001110011\",\n \"1110111011\",\n \"0010010010\",\n \"1010101010\",\n \"1111111111\",\n \"0100101101\",\n \"0100100\",\n \"101\",\n \"11\",\n \"00\",\n \"1\"\n )\n println(\"The (longest) rep-strings are:\\n\")\n for (s in strings) {\n val reps = repString(s)\n val size = reps.size\n println(\"${s.padStart(10)} -> ${if (size > 0) reps[size - 1] else \"Not a rep-string\"}\")\n }\n}\n","language":"Kotlin"},{"code":"(defun get-reps (text)\n (lists:filtermap\n (lambda (x)\n (case (get-rep text (lists:split x text))\n ('() 'false)\n (x `#(true ,x))))\n (lists:seq 1 (div (length text) 2))))\n\n(defun get-rep\n ((text `#(,head ,tail))\n (case (string:str text tail)\n (1 head)\n (_ '()))))\n","language":"LFE"},{"code":"(defun report\n ((`#(,text ()))\n (io:format \"~p has no repeating characters.~n\" `(,text)))\n ((`#(,text (,head . ,_)))\n (io:format \"~p repeats ~p every ~p character(s).~n\" `(,text ,head ,(length head))))\n ((data)\n (lists:map\n #'report/1\n (lists:zip data (lists:map #'get-reps/1 data)))\n 'ok))\n","language":"LFE"},{"code":"repstr? := proc( s :: string )\n local per := StringTools:-Period( s );\n if 2 * per <= length( s ) then\n true, s[ 1 .. per ]\n else\n false, \"\"\n end if\nend proc:\n","language":"Maple"},{"code":"> Test := [\"1001110011\", \"1110111011\", \"0010010010\", \"1010101010\", \"1111111111\", \\\n \"0100101101\", \"0100100\", \"101\", \"11\", \"00\", \"1\"]:\n> for s in Test do\n> printf( \"%*s\\t%5s %s\\n\", 3 + max(map(length,Test)), s, repstr?( s ) )\n> end do:\n 1001110011 true 10011\n 1110111011 true 1110\n 0010010010 true 001\n 1010101010 true 10\n 1111111111 true 1\n 0100101101 false\n 0100100 true 010\n 101 false\n 11 true 1\n 00 true 0\n 1 false\n","language":"Maple"},{"code":"RepStringQ[strin_String]:=StringCases[strin,StartOfString~~Repeated[x__,{2,\\[Infinity]}]~~y___~~EndOfString/;StringMatchQ[x,StartOfString~~y~~___]:>x, Overlaps -> All]\n","language":"Mathematica"},{"code":"str={\"1001110011\",\"1110111011\",\"0010010010\",\"1010101010\",\"1111111111\",\"0100101101\",\"0100100\",\"101\",\"11\",\"00\",\"1\"};\n{#,RepStringQ[#]}&/@str//Grid\n","language":"Mathematica"},{"code":"main :: [sys_message]\nmain = [Stdout (lay (map test tests))]\n\ntest :: [char]->[char]\ntest s = s ++ \": \" ++ show (repstrings s)\n\ntests :: [[char]]\ntests = [\"1001110011\", \"1110111011\", \"0010010010\", \"1010101010\",\n \"1111111111\", \"0100101101\", \"0100100\", \"101\", \"11\", \"00\",\n \"1\"]\n\nrepstrings :: [*]->[[*]]\nrepstrings s = filter matching bases\n where bases = [take n s | n<-[1..#s div 2]]\n matching r = s = take (#s) (concat (repeat r))\n","language":"Miranda"},{"code":"MODULE RepStrings;\nFROM InOut IMPORT Write, WriteString, WriteLn, WriteCard;\nFROM Strings IMPORT Copy, Length;\n\n(* Find the length of the longest rep-string given a string.\n If there is no rep-string, the result is 0. *)\nPROCEDURE repLength(s: ARRAY OF CHAR): CARDINAL;\n VAR strlen, replen, i, j: CARDINAL;\n ok: BOOLEAN;\nBEGIN\n strlen := Length(s);\n FOR replen := strlen DIV 2 TO 1 BY -1 DO\n ok := TRUE;\n i := 0;\n WHILE ok AND (i < replen) DO\n j := i + replen;\n WHILE (i+j < strlen) AND (s[i] = s[j]) DO\n j := j + replen;\n END;\n ok := ok AND (i+j >= strlen);\n INC(i);\n END;\n IF ok THEN RETURN replen; END;\n END;\n RETURN 0;\nEND repLength;\n\n(* Store the longest rep-string in the given buffer. *)\nPROCEDURE repString(in: ARRAY OF CHAR; VAR out: ARRAY OF CHAR);\n VAR len: CARDINAL;\nBEGIN\n len := repLength(in);\n Copy(in, 0, len, out);\n out[len] := CHR(0);\nEND repString;\n\n(* Display the longest rep-string given a string *)\nPROCEDURE rep(s: ARRAY OF CHAR);\n VAR buf: ARRAY [0..63] OF CHAR;\nBEGIN\n WriteString(s);\n WriteString(\": \");\n repString(s, buf);\n WriteString(buf);\n WriteLn();\nEND rep;\n\n(* Test cases *)\nBEGIN\n rep(\"1001110011\");\n rep(\"1110111011\");\n rep(\"0010010010\");\n rep(\"1010101010\");\n rep(\"1111111111\");\n rep(\"0100101101\");\n rep(\"0100100\");\n rep(\"101\");\n rep(\"11\");\n rep(\"00\");\n rep(\"1\");\nEND RepStrings.\n","language":"Modula-2"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary\n\n/* REXX ***************************************************************\n* 11.05.2013 Walter Pachl\n**********************************************************************/\nrunSample(arg)\nreturn\n\n/**\n * Test for rep-strings\n * @param s_str a string to check for rep-strings\n * @return Rexx string: boolean indication of reps, length, repeated value\n */\nmethod repstring(s_str) public static\n s_str_n = s_str.length()\n rep_str = ''\n Loop lx = s_str.length() % 2 to 1 By -1\n If s_str.substr(lx + 1, lx) = s_str.left(lx) Then Leave lx\n End lx\n If lx > 0 Then Do label reps\n rep_str = s_str.left(lx)\n Loop ix = 1 By 1\n If s_str.substr(ix * lx + 1, lx) <> rep_str Then\n Leave ix\n End ix\n If rep_str.copies(s_str_n).left(s_str.length()) <> s_str Then\n rep_str = ''\n End reps\n Return (rep_str.length() > 0) rep_str.length() rep_str\n\n-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\nmethod runSample(arg) public static\n parse arg samples\n if samples = '' then -\n samples = -\n '1001110011' -\n '1110111011' -\n '0010010010' -\n '1010101010' -\n '1111111111' -\n '0100101101' -\n '0100100' -\n '101' -\n '11' -\n '00' -\n '1'\n\n loop w_ = 1 to samples.words()\n in_str = samples.word(w_)\n parse repstring(in_str) is_rep_str rep_str_len rep_str\n\n sq = ''''in_str''''\n tstrlen = sq.length().max(20)\n sq=sq.right(tstrlen)\n if is_rep_str then\n Say sq 'has a repetition length of' rep_str_len \"i.e. '\"rep_str\"'\"\n else\n Say sq 'is not a repeated string'\n end w_\n return\n","language":"NetRexx"},{"code":"tests = [\n\t'1001110011'\n\t'1110111011'\n\t'0010010010'\n\t'1010101010'\n\t'1111111111'\n\t'0100101101'\n\t'0100100'\n\t'101'\n\t'11'\n\t'00'\n\t'1'\n]\n\nF is_repeated(s:Str) (s.len()/2..0).first(F(x) s.starts_with(s[x..null]))\n\n{\n\ttests.each(F(test) {\n\t\tlocal r = is_repeated(test)\n\t\techo(\"${test} ${if r \"has repetition of length ${r} (i.e. ${test[0..r]})\" \"is not a rep-string\"}\")\n\t})\n}\n","language":"NGS"},{"code":"import strutils\n\nproc isRepeated(text: string): int =\n for x in countdown(text.len div 2, 0):\n if text.startsWith(text[x..text.high]): return x\n\nconst matchstr = \"\"\"1001110011\n1110111011\n0010010010\n1010101010\n1111111111\n0100101101\n0100100\n101\n11\n00\n1\"\"\"\n\nfor line in matchstr.split():\n let ln = isRepeated(line)\n echo \"'\", line, \"' has a repetition length of \", ln, \" i.e \",\n (if ln > 0: \"'\" & line[0 ..< ln] & \"'\" else: \"*not* a rep-string\")\n","language":"Nim"},{"code":"class RepString {\n function : Main(args : String[]) ~ Nil {\n strings := [\"1001110011\", \"1110111011\", \"0010010010\", \"1111111111\",\n \"0100101101\", \"0100100\", \"101\", \"11\", \"00\", \"1\"];\n each(i : strings) {\n string := strings[i];\n repstring := RepString(string);\n if(repstring->Size() > 0) {\n \"\\\"{$string}\\\" = rep-string \\\"{$repstring}\\\"\"->PrintLine();\n }\n else {\n \"\\\"{$string}\\\" = not a rep-string\"->PrintLine();\n };\n };\n }\n\n function : RepString(string : String) ~ String {\n offset := string->Size() / 2;\n\n while(offset > 0) {\n left := string->SubString(offset);\n right := string->SubString(left->Size(),left->Size());\n if(left->Equals(right)) {\n if(ValidateMatch(left, string)) {\n return left;\n }\n else {\n return \"\";\n };\n };\n\n offset--;\n };\n\n return \"\";\n }\n\n function : ValidateMatch(left : String, string : String) ~ Bool {\n parts := string->Size() / left->Size();\n tail := string->Size() % left->Size() <> 0;\n\n for(i := 1; i < parts; i+=1;) {\n offset := i * left->Size();\n right := string->SubString(offset, left->Size());\n if(<>left->Equals(right)) {\n return false;\n };\n };\n\n if(tail) {\n offset := parts * left->Size();\n right := string->SubString(offset, string->Size() - offset);\n each(i : right) {\n if(left->Get(i) <> right->Get(i)) {\n return false;\n };\n };\n };\n\n return true;\n }\n}\n","language":"Objeck"},{"code":": repString(s)\n| sz i |\n s size dup ->sz 2 / 1 -1 step: i [\n s left(sz i - ) s right(sz i -) == ifTrue: [ s left(i) return ]\n ]\n null ;\n","language":"Oforth"},{"code":"rep(v)=for(i=1,#v\\2,for(j=i+1,#v,if(v[j]!=v[j-i],next(2)));return(i));0;\nv=[\"1001110011\",\"1110111011\",\"0010010010\",\"1010101010\",\"1111111111\",\"0100101101\",\"0100100\",\"101\",\"11\",\"00\",\"1\"];\nfor(i=1,#v,print(v[i]\" \"rep(Vec(v[i]))))\n","language":"PARI-GP"},{"code":"foreach (qw(1001110011 1110111011 0010010010 1010101010 1111111111 0100101101 0100100 101 11 00 1)) {\n print \"$_\\n\";\n if (/^(.+)\\1+(.*$)(?(?{ substr($1, 0, length $2) eq $2 })|(?!))/) {\n print ' ' x length $1, \"$1\\n\\n\";\n } else {\n print \" (no repeat)\\n\\n\";\n }\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">list_reps</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">replist</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">)+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">)[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #000000;\">r</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">replist</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">replist</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">replist</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">tests</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"1001110011\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"1110111011\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"0010010010\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"1010101010\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"1111111111\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"0100101101\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"0100100\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"101\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"11\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"00\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"1\"</span><span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tests</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">tests</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">replist</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">list_reps</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tests</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">replist</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"not a rep-string.\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">replist</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">rj</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">replist</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #7060A8;\">pad</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">' '</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rj</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s%s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">pad</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rj</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"include ..\\Utilitys.pmt\n\ndef repstr /# s n -- s #/\n \"\" swap\n for drop\n over chain\n endfor\n nip\nenddef\n\n\ndef repString /# s -- s #/\n len dup var sz\n 2 / 1 swap 2 tolist for\n var i\n 1 i slice var chunk\n chunk sz i / 1 + repstr\n 1 sz slice nip over\n == if chunk exitfor endif\n endfor\n len sz == sz 1 == or if \": No repeat string\" chain else \": \" swap chain chain endif\nenddef\n\n( \"1001110011\" \"1110111011\" \"0010010010\" \"1010101010\" \"1111111111\" \"0100101101\" \"0100100\" \"101\" \"11\" \"00\" \"1\" )\n\nlen for\n get repString print nl\nendfor\n","language":"Phixmonti"},{"code":"go =>\n Strings = [\n \"1001110011\", % 10011\n \"1110111011\", % 1110\n \"0010010010\", % 001\n \"1010101010\", % 1010\n \"1111111111\", % 11111\n \"0100101101\", % no solution\n \"0100100\", % 010\n \"101\", % no solution\n \"11\", % 1\n \"00\", % 0\n \"1\", % no solution\n \"\", % no solution\n \"123123123123123\", % 123123\n \"12312312312312\", % 123123\n \"123123123123124\", % no solution\n \"abcabcdabcabcdabc\", % abcabcd\n [1,2,3,4,1,2,3,4,1,2,3] % 1,2,3,4\n\n ],\n foreach(S in Strings)\n printf(\"%w: \", S),\n if maxrep(S,Substr,N) then\n println([substr=Substr,n=N])\n else\n println(\"no solution\")\n end\n end,\n nl.\n\n% the largest repeating substring\nmaxrep(S,Substr,N) =>\n maxof(rep(S,Substr,N),N).\n\nrep(S,Substr,N) =>\n between(1,S.length div 2, N),\n Len = S.length,\n Len2 = Len - (Len mod N),\n Substr = slice(S,1,N),\n % count the number of proper slices\n SS = [1 : I in 1..N..Len2, slice(S,I,I+N-1) = Substr],\n SS.length = Len div N,\n % the last (truncated) slice (or []) must be a substring of Substr\n Rest = slice(S,Len2+1,Len),\n find(Substr,Rest,1,_).\n","language":"Picat"},{"code":"(de repString (Str)\n (let Lst (chop Str)\n (for (N (/ (length Lst) 2) (gt0 N) (dec N))\n (T\n (use (Lst X)\n (let H (cut N 'Lst)\n (loop\n (setq X (cut N 'Lst))\n (NIL (head X H))\n (NIL Lst T) ) ) )\n N ) ) ) )\n","language":"PicoLisp"},{"code":"(test 5 (repString \"1001110011\"))\n(test 4 (repString \"1110111011\"))\n(test 3 (repString \"0010010010\"))\n(test 4 (repString \"1010101010\"))\n(test 5 (repString \"1111111111\"))\n(test NIL (repString \"0100101101\"))\n(test 3 (repString \"0100100\"))\n(test NIL (repString \"101\"))\n(test 1 (repString \"11\"))\n(test 1 (repString \"00\"))\n(test NIL (repString \"1\"))\n(test NIL (repString \"0100101\"))\n","language":"PicoLisp"},{"code":"rep: procedure options (main); /* 5 May 2015 */\n declare s bit (10) varying;\n declare (i, k) fixed binary;\n\nmain_loop:\n do s = '1001110011'b, '1110111011'b, '0010010010'b, '1010101010'b,\n '1111111111'b, '0100101101'b, '0100100'b, '101'b, '11'b, '00'b, '1'b;\n k = length(s);\n do i = k/2 to 1 by -1;\n if substr(s, 1, i) = substr(s, i+1, i) then\n do;\n put skip edit (s, ' is a rep-string containing ', substr(s, 1, i) ) (a);\n iterate main_loop;\n end;\n end;\n put skip edit (s, ' is not a rep-string') (a);\n end;\n\nend rep;\n","language":"PL-I"},{"code":"100H:\n\n DECLARE MAX$REP LITERALLY '32';\n DECLARE FALSE LITERALLY '0';\n DECLARE TRUE LITERALLY '1';\n DECLARE CR LITERALLY '0DH';\n DECLARE LF LITERALLY '0AH';\n\n /* CP/M BDOS SYSTEM CALL */\n BDOS: PROCEDURE( FN, ARG ); DECLARE FN BYTE, ARG ADDRESS; GOTO 5; END;\n /* PRINTS A BYTE AS A CHARACTER */\n PRINT$CHAR: PROCEDURE( CH ); DECLARE CH BYTE; CALL BDOS( 2, CH ); END;\n /* PRINTS A $ TERMINATED STRING */\n PRINT$STRING: PROCEDURE( S ); DECLARE S ADDRESS; CALL BDOS( 9, S ); END;\n\n /* PRINTS A BYTE AS A NUMBER */\n PRINT$BYTE: PROCEDURE( N );\n DECLARE N BYTE;\n DECLARE ( V, D2, D3 ) BYTE;\n V = N;\n D3 = V MOD 10;\n IF ( V := V / 10 ) <> 0 THEN DO;\n D2 = V MOD 10;\n IF ( V := V / 10 ) <> 0 THEN CALL PRINT$CHAR( '0' + V );\n CALL PRINT$CHAR( '0' + D2 );\n END;\n CALL PRINT$CHAR( '0' + D3 );\n END PRINT$BYTE;\n /* PRINTS A FIXED LENGTH STRING */\n PRINT$SUBSTRING: PROCEDURE( S$PTR, LEN );\n DECLARE S$PTR ADDRESS, LEN BYTE, S BASED S$PTR ( MAX$REP )BYTE;\n DECLARE S$POS BYTE;\n DO S$POS = 0 TO LEN - 1;\n CALL PRINT$CHAR( S( S$POS ) );\n END;\n END PRINT$SUBSTRING;\n\n /* RETURNS THE LENGTH OF A $ TERMINATED STRING */\n STR$LENGTH: PROCEDURE( S$PTR )BYTE;\n DECLARE S$PTR ADDRESS, S BASED S$PTR ( MAX$REP )BYTE;\n DECLARE RESULT BYTE;\n RESULT = 0;\n DO WHILE( S( RESULT ) <> '$' );\n RESULT = RESULT + 1;\n END;\n RETURN RESULT;\n END STR$LENGTH;\n\n /* RETURNS THE LENGTH OF THE LONGEST REP-STRING IN S$PTR, */\n LONGEST$REP$STRING: PROCEDURE( S$PTR )BYTE;\n DECLARE S$PTR ADDRESS, S BASED S$PTR ( MAX$REP )BYTE;\n DECLARE ( S$LEN, RESULT, S$POS, R$POS, I, FOUND ) BYTE;\n RESULT = 0;\n FOUND = FALSE;\n S$LEN = STR$LENGTH( S$PTR );\n S$POS = ( S$LEN / 2 ) - 1; /* IF ( S$LEN / 2 ) = 0, S$POS WILL BE 255 */\n DO WHILE( NOT FOUND AND S$POS < 255 ); /* AS BYTE/ADDRESS ARE UNSIGNED */\n /* CHECK THE POTENTIAL REP-STRING REPEATED A SUFFICIENT NUMBER */\n /* OF TIMES (TRUNCATED IF NECESSARY) EQUALS THE ORIGINAL STRING */\n FOUND = TRUE;\n R$POS = S$POS + 1;\n DO WHILE( FOUND AND R$POS < S$LEN AND FOUND );\n I = 0;\n DO WHILE( I <= S$POS AND R$POS < S$LEN AND FOUND );\n FOUND = S( R$POS ) = S( I );\n R$POS = R$POS + 1;\n I = I + 1;\n END;\n END;\n IF NOT FOUND THEN DO;\n /* HAVEN'T FOUND A REP-STRING, TRY A SHORTER ONE */\n S$POS = S$POS - 1; /* S$POS WILL BECOME 255 IF S$POS = 0 */\n END;\n END;\n IF FOUND THEN DO;\n RESULT = S$POS + 1;\n END;\n RETURN RESULT;\n END LONGEST$REP$STRING;\n\n DECLARE ( TEST$NUMBER, REP$STRING$LEN ) BYTE;\n DECLARE TESTS ( 11 )ADDRESS;\n TESTS( 0 ) = .'1001110011$';\n TESTS( 1 ) = .'1110111011$';\n TESTS( 2 ) = .'0010010010$';\n TESTS( 3 ) = .'1010101010$';\n TESTS( 4 ) = .'1111111111$';\n TESTS( 5 ) = .'0100101101$';\n TESTS( 6 ) = .'0100100$';\n TESTS( 7 ) = .'101$';\n TESTS( 8 ) = .'11$';\n TESTS( 9 ) = .'00$';\n TESTS( 10 ) = .'1$';\n\n DO TEST$NUMBER = 0 TO LAST( TESTS );\n REP$STRING$LEN = LONGEST$REP$STRING( TESTS( TEST$NUMBER ) );\n CALL PRINT$STRING( TESTS( TEST$NUMBER ) );\n IF REP$STRING$LEN = 0 THEN DO;\n CALL PRINT$STRING( .': NO REP STRING$' );\n END;\n ELSE DO;\n CALL PRINT$STRING( .': LONGEST REP STRING: $' );\n CALL PRINT$SUBSTRING( TESTS( TEST$NUMBER ), REP$STRING$LEN );\n END;\n CALL PRINT$STRING( .( CR, LF, '$' ) );\n END;\nEOF\n","language":"PL-M"},{"code":":- use_module(library(func)).\n\n%% Implementation logic:\n\ntest_for_repstring(String, (String, Result, Reps)) :-\n ( setof(Rep, repstring(String, Rep), Reps)\n -> Result = 'no repstring'\n ; Result = 'repstrings', Reps = []\n ).\n\nrepstring(Codes, R) :-\n RepLength = between(1) of (_//2) of length $ Codes,\n length(R, RepLength),\n phrase( (rep(R), prefix(~,R)),\n Codes).\n\nrep(X) --> X, X.\nrep(X) --> X, rep(X).\n\n\n%% Demonstration output:\n\ntest_strings([`1001110011`, `1110111011`, `0010010010`, `1010101010`,\n `1111111111`, `0100101101`, `0100100`, `101`, `11`, `00`, `1`]).\n\nreport_repstring((S,Result,Reps)):-\n format('~s -- ~w: ', [S, Result]),\n foreach(member(R, Reps), format('~s, ', [R])), nl.\n\nreport_repstrings :-\n Results = maplist(test_for_repstring) $ test_strings(~),\n maplist(report_repstring, Results).\n","language":"Prolog"},{"code":"a$=\"1001110011\"+#CRLF$+\"1110111011\"+#CRLF$+\"0010010010\"+#CRLF$+\"1010101010\"+#CRLF$+\"1111111111\"+#CRLF$+\n \"0100101101\"+#CRLF$+\"0100100\" +#CRLF$+\"101\" +#CRLF$+\"11\" +#CRLF$+\"00\" +#CRLF$+\n \"1\" +#CRLF$\n\nOpenConsole()\n\nProcedure isRepStr(s1$,s2$)\n If Int(Len(s1$)/Len(s2$))>=2 : ProcedureReturn isRepStr(s1$,s2$+s2$) : EndIf\n If Len(s1$)>Len(s2$) : ProcedureReturn isRepStr(s1$,s2$+Left(s2$,Len(s1$)%Len(s2$))) : EndIf\n If s1$=s2$ : ProcedureReturn #True : Else : ProcedureReturn #False : EndIf\nEndProcedure\n\nFor k=1 To CountString(a$,#CRLF$)\n s1$=StringField(a$,k,#CRLF$) : s2$=Left(s1$,Len(s1$)/2)\n While Len(s2$)\n r=isRepStr(s1$,s2$)\n If Not r : s2$=Left(s2$,Len(s2$)-1) : Else : Break : EndIf\n Wend\n If Len(s2$) And r : PrintN(LSet(s1$,15,Chr(32))+#TAB$+\"longest sequence: \"+s2$) : EndIf\n If Not Len(s2$) : PrintN(LSet(s1$,15,Chr(32))+#TAB$+\"found nothing.\") : EndIf\nNext\nInput()\n","language":"PureBasic"},{"code":"def is_repeated(text):\n 'check if the first part of the string is repeated throughout the string'\n for x in range(len(text)//2, 0, -1):\n if text.startswith(text[x:]): return x\n return 0\n\nmatchstr = \"\"\"\\\n1001110011\n1110111011\n0010010010\n1010101010\n1111111111\n0100101101\n0100100\n101\n11\n00\n1\n\"\"\"\nfor line in matchstr.split():\n ln = is_repeated(line)\n print('%r has a repetition length of %i i.e. %s'\n % (line, ln, repr(line[:ln]) if ln else '*not* a rep-string'))\n","language":"Python"},{"code":">>> def reps(text):\n return [text[:x] for x in range(1, 1 + len(text) // 2)\n if text.startswith(text[x:])]\n\n>>> matchstr = \"\"\"\\\n1001110011\n1110111011\n0010010010\n1010101010\n1111111111\n0100101101\n0100100\n101\n11\n00\n1\n\"\"\"\n>>> print('\\n'.join('%r has reps %r' % (line, reps(line)) for line in matchstr.split()))\n'1001110011' has reps ['10011']\n'1110111011' has reps ['1110']\n'0010010010' has reps ['001']\n'1010101010' has reps ['10', '1010']\n'1111111111' has reps ['1', '11', '111', '1111', '11111']\n'0100101101' has reps []\n'0100100' has reps ['010']\n'101' has reps []\n'11' has reps ['1']\n'00' has reps ['0']\n'1' has reps []\n>>>\n","language":"Python"},{"code":"'''Rep-strings'''\n\nfrom itertools import (accumulate, chain, cycle, islice)\n\n\n# repCycles :: String -> [String]\ndef repCycles(s):\n '''Repeated sequences of characters in s.'''\n n = len(s)\n cs = list(s)\n\n return [\n x for x in\n tail(inits(take(n // 2)(s)))\n if cs == take(n)(cycle(x))\n ]\n\n\n# TEST ----------------------------------------------------\n# main :: IO ()\ndef main():\n '''Tests - longest cycle (if any) in each string.'''\n print(\n fTable('Longest cycles:\\n')(repr)(\n lambda xs: ''.join(xs[-1]) if xs else '(none)'\n )(repCycles)([\n '1001110011',\n '1110111011',\n '0010010010',\n '1010101010',\n '1111111111',\n '0100101101',\n '0100100',\n '101',\n '11',\n '00',\n '1',\n ])\n )\n\n\n# GENERIC -------------------------------------------------\n\n# inits :: [a] -> [[a]]\ndef inits(xs):\n '''all initial segments of xs, shortest first.'''\n return accumulate(chain([[]], xs), lambda a, x: a + [x])\n\n\n# tail :: [a] -> [a]\n# tail :: Gen [a] -> [a]\ndef tail(xs):\n '''The elements following the head of a\n (non-empty) list or generator stream.'''\n if isinstance(xs, list):\n return xs[1:]\n else:\n list(islice(xs, 1)) # First item dropped.\n return xs\n\n\n# take :: Int -> [a] -> [a]\n# take :: Int -> String -> String\ndef take(n):\n '''The prefix of xs of length n,\n or xs itself if n > length xs.'''\n return lambda xs: (\n xs[0:n]\n if isinstance(xs, (list, tuple))\n else list(islice(xs, n))\n )\n\n\n# OUTPUT FORMATTING ---------------------------------------\n\n# fTable :: String -> (a -> String) ->\n# (b -> String) -> (a -> b) -> [a] -> String\ndef fTable(s):\n '''Heading -> x display function ->\n fx display function ->\n f -> value list -> tabular string.\n '''\n def go(xShow, fxShow, f, xs):\n ys = [xShow(x) for x in xs]\n w = max(map(len, ys))\n return s + '\\n' + '\\n'.join(map(\n lambda x, y: y.rjust(w, ' ') + ' -> ' + fxShow(f(x)),\n xs, ys\n ))\n return lambda xShow: lambda fxShow: lambda f: lambda xs: go(\n xShow, fxShow, f, xs\n )\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"import re\n\nmatchstr = \"\"\"\\\n1001110011\n1110111011\n0010010010\n1010101010\n1111111111\n0100101101\n0100100\n101\n11\n00\n1\"\"\"\n\ndef _checker(matchobj):\n g0, (g1, g2, g3, g4) = matchobj.group(0), matchobj.groups()\n if not g4 and g1 and g1.startswith(g3):\n return '%r repeats %r' % (g0, g1)\n return '%r is not a rep-string' % (g0,)\n\ndef checkit(txt):\n print(re.sub(r'(.+)(\\1+)(.*)|(.*)', _checker, txt))\n\ncheckit(matchstr)\n","language":"Python"},{"code":" [ false swap\n dup size 1 > if\n [ [] temp put\n dup size factors\n -1 split drop\n witheach\n [ 2dup split drop\n dip [ over size swap / ]\n dup temp replace\n swap of over = if\n [ drop not\n temp share\n conclude ] ]\n temp release ] swap ] is rep$ ( $ --> $ b )\n\n [ dup rep$ iff\n [ say 'The shortest rep-string in \"'\n swap echo$\n say '\" is \"' echo$\n say '\".' ]\n else\n [ say 'There is no rep-string for \"'\n nip echo$ say '\".' ]\n cr ] is task ( $ --> )\n","language":"Quackery"},{"code":"#lang racket\n\n(define (rep-string str)\n (define len (string-length str))\n (for/or ([n (in-range 1 len)])\n (and (let loop ([from n])\n (or (>= from len)\n (let ([m (min (- len from) n)])\n (and (equal? (substring str from (+ from m))\n (substring str 0 m))\n (loop (+ n from))))))\n (<= n (quotient len 2))\n (substring str 0 n))))\n\n(for ([str '(\"1001110011\"\n \"1110111011\"\n \"0010010010\"\n \"1010101010\"\n \"1111111111\"\n \"0100101101\"\n \"0100100\"\n \"101\"\n \"11\"\n \"00\"\n \"1\")])\n (printf \"~a => ~a\\n\" str (or (rep-string str) \"not a rep-string\")))\n","language":"Racket"},{"code":"for <1001110011 1110111011 0010010010 1010101010 1111111111 0100101101 0100100 101 11 00 1> {\n if /^ (.+) $0+: (.*$) <?{ $0.substr(0,$1.chars) eq $1 }> / {\n\tmy $rep = $0.chars;\n\tsay .substr(0,$rep), .substr($rep,$rep).trans('01' => '𝟘𝟙'), .substr($rep*2);\n }\n else {\n\tsay \"$_ (no repeat)\";\n }\n}\n","language":"Raku"},{"code":"sub repstr(Str $s) {\n my $bits = :2($s);\n for reverse 1 .. $s.chars div 2 -> $left {\n\tmy $right = $s.chars - $left;\n\treturn $left if $bits +^ ($bits +> $left) == $bits +> $right +< $right;\n }\n}\n\n\nfor '1001110011 1110111011 0010010010 1010101010 1111111111 0100101101 0100100 101 11 00 1'.words {\n if repstr $_ -> $rep {\n\tsay .substr(0,$rep), .substr($rep,$rep).trans('01' => '𝟘𝟙'), .substr($rep*2);\n }\n else {\n\tsay \"$_ (no repeat)\";\n }\n}\n","language":"Raku"},{"code":"$ENTRY Go {\n , ('1001110011') ('1110111011') ('0010010010')\n ('1010101010') ('1111111111') ('0100101101')\n ('0100100') ('101') ('11') ('00') ('1'): e.Tests\n = <Each Show e.Tests>;\n};\n\nEach {\n s.F = ;\n s.F t.I e.R = <Mu s.F t.I> <Each s.F e.R>;\n};\n\nShow {\n (e.S), <RepString e.S>: e.R = <Prout e.S ' => ' e.R>;\n};\n\nRepString {\n () e.S = ;\n (e.R) e.S, <Lengthen (e.R) e.S>: e.S e.X = e.R;\n (e.R s.C) e.S = <RepString (e.R) e.S>;\n e.S, <Lenw e.S>: s.L e.S,\n <First <Div s.L 2> e.S>: (e.F) e.X\n = <RepString (e.F) e.S>;\n};\n\nLengthen {\n (e.A) e.B, <Lenw e.A>: s.LA e.A,\n <Lenw e.B>: s.LB e.B,\n <Compare s.LA s.LB>: '-'\n = <Lengthen (e.A e.A) e.B>;\n (e.A) e.B, <Lenw e.B>: s.LB e.B,\n <First s.LB e.A>: (e.FA) e.RA\n = e.FA;\n};\n","language":"Refal"},{"code":"/* REXX ***************************************************************\n* 11.05.2013 Walter Pachl\n* 14.05.2013 Walter Pachl extend to show additional rep-strings\n**********************************************************************/\nCall repstring '1001110011'\nCall repstring '1110111011'\nCall repstring '0010010010'\nCall repstring '1010101010'\nCall repstring '1111111111'\nCall repstring '0100101101'\nCall repstring '0100100'\nCall repstring '101'\nCall repstring '11'\nCall repstring '00'\nCall repstring '1'\nExit\n\nrepstring:\nParse Arg s\nsq=''''s''''\nn=length(s)\nDo l=length(s)%2 to 1 By -1\n If substr(s,l+1,l)=left(s,l) Then Leave\n End\nIf l>0 Then Do\n rep_str=left(s,l)\n Do i=1 By 1\n If substr(s,i*l+1,l)<>rep_str Then\n Leave\n End\n If left(copies(rep_str,n),length(s))=s Then Do\n Call show_rep rep_str /* show result */\n Do i=length(rep_str)-1 To 1 By -1 /* look for shorter rep_str-s */\n rep_str=left(s,i)\n If left(copies(rep_str,n),length(s))=s Then\n Call show_rep rep_str\n End\n End\n Else\n Call show_norep\n End\nElse\n Call show_norep\nReturn\n\nshow_rep:\n Parse Arg rs\n Say right(sq,12) 'has a repetition length of' length(rs) 'i.e.' ''''rs''''\n Return\nshow_norep:\n Say right(sq,12) 'is not a repeated string'\n Return\n","language":"REXX"},{"code":"/*REXX pgm determines if a string is a repString, it returns minimum length repString.*/\nparse arg s /*get optional strings from the C.L. */\nif s='' then s=1001110011 1110111011 0010010010 1010101010 1111111111 0100101101 0100100 101 11 00 1 45\n /* [↑] S not specified? Use defaults*/\n do k=1 for words(s); _=word(s,k); w=length(_) /*process binary strings. */\n say right(_,max(25,w)) repString(_) /*show repString & result.*/\n end /*k*/ /* [↑] the \"result\" may be negatory.*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nrepString: procedure; parse arg x; L=length(x); @rep=' rep string='\n if \\datatype(x,'B') then return \" ***error*** string isn't a binary string.\"\n h=L%2\n do j=1 for L-1 while j<=h; $=left(x,j); $$=copies($,L)\n if left($$,L)==x then return @rep left($,15) \"[length\" j']'\n end /*j*/ /* [↑] we have found a good repString.*/\n return ' (no repetitions)' /*failure to find repString.*/\n","language":"REXX"},{"code":"# Project : Rep-string\n\ntest = [\"1001110011\",\n \"1110111011\",\n \"0010010010\",\n \"1010101010\",\n \"1111111111\",\n \"0100101101\",\n \"0100100\",\n \"101\",\n \"11\",\n \"00\",\n \"1\"]\n\nfor n = 1 to len(test)\n strend = \"\"\n for m=1 to len(test[n])\n strbegin = substr(test[n], 1, m)\n strcut = right(test[n], len(test[n]) - m)\n nr = substr(strcut, strbegin)\n if nr=1 and len(test[n]) > 1\n strend = strbegin\n ok\n next\n if strend = \"\"\n see \"\" + test[n] + \" -> (none)\" + nl\n else\n see \"\" + test[n] + \" -> \" + strend + nl\n ok\nnext\n","language":"Ring"},{"code":"ar = %w(1001110011\n 1110111011\n 0010010010\n 1010101010\n 1111111111\n 0100101101\n 0100100\n 101\n 11\n 00\n 1)\n\nar.each do |str|\n rep_pos = (str.size/2).downto(1).find{|pos| str.start_with? str[pos..-1]}\n puts str, rep_pos ? \" \"*rep_pos + str[0, rep_pos] : \"(no repetition)\", \"\"\nend\n","language":"Ruby"},{"code":"fn main() {\n let strings = vec![\n String::from(\"1001110011\"),\n String::from(\"1110111011\"),\n String::from(\"0010010010\"),\n String::from(\"1010101010\"),\n String::from(\"1111111111\"),\n String::from(\"0100101101\"),\n String::from(\"0100100\"),\n String::from(\"101\"),\n String::from(\"11\"),\n String::from(\"00\"),\n String::from(\"1\"),\n ];\n for string in strings {\n match rep_string(&string) {\n Some(rep_string) => println!(\n \"Longuest rep-string for '{}' is '{}' ({} chars)\",\n string,\n rep_string,\n rep_string.len(),\n ),\n None => println!(\"No rep-string found for '{}'\", string),\n };\n }\n}\n\nfn rep_string(string: &str) -> Option<&str> {\n let index = string.len() / 2;\n\n for split_index in (1..=index).rev() {\n let mut is_rep_string = true;\n let (first, last) = string.split_at(split_index);\n\n let inter = last.chars().collect::<Vec<char>>();\n let mut iter = inter.chunks_exact(split_index);\n for chunk in iter.by_ref() {\n if first != chunk.iter().collect::<String>() {\n is_rep_string = false;\n break;\n }\n }\n let rmnd = iter.remainder().iter().collect::<String>();\n\n // Check that the remainder starts with the rep-string\n if !first.starts_with(rmnd.as_str()) {\n is_rep_string = false;\n }\n\n if is_rep_string {\n return Some(first);\n }\n }\n None\n}\n\n#[cfg(test)]\nmod tests {\n use super::rep_string;\n use std::collections::HashMap;\n\n #[test]\n fn test_rep_string() {\n let mut results = HashMap::new();\n results.insert(String::from(\"1001110011\"), Some(\"10011\"));\n results.insert(String::from(\"1110111011\"), Some(\"1110\"));\n results.insert(String::from(\"0010010010\"), Some(\"001\"));\n results.insert(String::from(\"1010101010\"), Some(\"1010\"));\n results.insert(String::from(\"1111111111\"), Some(\"11111\"));\n results.insert(String::from(\"0100101101\"), None);\n results.insert(String::from(\"0100100\"), Some(\"010\"));\n results.insert(String::from(\"101\"), None);\n results.insert(String::from(\"11\"), Some(\"1\"));\n results.insert(String::from(\"00\"), Some(\"0\"));\n results.insert(String::from(\"1\"), None);\n\n for (input, expected) in results {\n assert_eq!(expected, rep_string(&input));\n }\n }\n}\n","language":"Rust"},{"code":"object RepString extends App {\n def repsOf(s: String) = s.trim match {\n case s if s.length < 2 => Nil\n case s => (1 to (s.length/2)).map(s take _)\n .filter(_ * s.length take s.length equals s)\n }\n\n val tests = Array(\n \"1001110011\",\n \"1110111011\",\n \"0010010010\",\n \"1010101010\",\n \"1111111111\",\n \"0100101101\",\n \"0100100\",\n \"101\",\n \"11\",\n \"00\",\n \"1\"\n )\n def printReps(s: String) = repsOf(s) match {\n case Nil => s+\": NO\"\n case r => s+\": YES (\"+r.mkString(\", \")+\")\"\n }\n val todo = if (args.length > 0) args else tests\n todo.map(printReps).foreach(println)\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n\nconst func integer: repeatLength (in string: text) is func\n result\n var integer: length is 0;\n local\n var integer: pos is 0;\n begin\n for pos range succ(length(text) div 2) downto 1 until length <> 0 do\n if startsWith(text, text[pos ..]) then\n length := pred(pos);\n end if;\n end for;\n end func;\n\nconst proc: main is func\n local\n var string: line is \"\";\n var integer: length is 0;\n begin\n for line range [] (\"1001110011\", \"1110111011\", \"0010010010\", \"1010101010\",\n \"1111111111\", \"0100101101\", \"0100100\", \"101\", \"11\", \"00\", \"1\") do\n length := repeatLength(line);\n if length = 0 then\n writeln(\"No rep-string for \" <& literal(line));\n else\n writeln(\"Longest rep-string for \" <& literal(line) <& \": \" <& literal(line[.. length]));\n end if;\n end for;\n end func;\n","language":"Seed7"},{"code":"program repstring;\n tests := [\n \"1001110011\", \"1110111011\", \"0010010010\", \"1010101010\",\n \"1111111111\", \"0100101101\", \"0100100\", \"101\", \"11\", \"00\", \"1\"\n ];\n\n loop for test in tests do\n print(test + \": \" + str repstrings(test));\n end loop;\n\n proc repstrings(s);\n return {\n s(..l) : l in [1..#s div 2]\n | (s(..l)*(#s div l+1))(..#s) = s\n };\n end proc;\nend program;\n","language":"SETL"},{"code":"var arr = <1001110011 1110111011\n 0010010010 1010101010\n 1111111111 0100101101\n 0100100 101 11 00 1>;\n \n arr.each { |n|\n if (var m = /^(.+)\\1+(.*$)(?(?{ substr($1, 0, length $2) eq $2 })|(?!))/.match(n)) {\n var i = m[0].len;\n say (n.substr(0, i),\n n.substr(i, i).tr('01', '𝟘𝟙'),\n n.substr(i*2));\n } else {\n say \"#{n} (no repeat)\";\n }\n}\n","language":"Sidef"},{"code":"* Rep-string\n\tstrings = \"1001110011 1110111011 0010010010 1010101010 1111111111 0100101101 0100100 101 11 00 1 \"\n\tpat1 = (len(1) $ fc breakx(*fc)) $ x *x (arbno(*x) (rpos(0) | rem $ y *?(x ? y)))\ngetstring\n\tstrings ? (break(\" \") . rs len(1)) = :f(end)\n\trs ? pat1 :s(yes)\n\toutput = rs \" is not a rep-string -> n/a\" :(getstring)\nyes\n\toutput = rs \" has shortest rep-string value of -> \" x\n\t:(getstring)\nend\n","language":"SNOBOL4"},{"code":"import Foundation\n\nfunc repString(_ input: String) -> [String] {\n return (1..<(1 + input.count / 2)).compactMap({x -> String? in\n let i = input.index(input.startIndex, offsetBy: x)\n return input.hasPrefix(input[i...]) ? String(input.prefix(x)) : nil\n })\n}\n\nlet testCases = \"\"\"\n 1001110011\n 1110111011\n 0010010010\n 1010101010\n 1111111111\n 0100101101\n 0100100\n 101\n 11\n 00\n 1\n \"\"\".components(separatedBy: \"\\n\")\n\nfor testCase in testCases {\n print(\"\\(testCase) has reps: \\(repString(testCase))\")\n}\n","language":"Swift"},{"code":"proc repstring {text} {\n set len [string length $text]\n for {set i [expr {$len/2}]} {$i > 0} {incr i -1} {\n\tset sub [string range $text 0 [expr {$i-1}]]\n\tset eq [string repeat $sub [expr {int(ceil($len/double($i)))}]]\n\tif {[string equal -length $len $text $eq]} {\n\t return $sub\n\t}\n }\n error \"no repetition\"\n}\n","language":"Tcl"},{"code":"foreach sample {\n \"1001110011\" \"1110111011\" \"0010010010\" \"1010101010\" \"1111111111\"\n \"0100101101\" \"0100100\" \"101\" \"11\" \"00\" \"1\"\n} {\n if {[catch {\n\tset rep [repstring $sample]\n\tputs [format \"\\\"%s\\\" has repetition (length: %d) of \\\"%s\\\"\" \\\n\t\t $sample [string length $rep] $rep]\n }]} {\n\tputs [format \"\\\"%s\\\" is not a repeated string\" $sample]\n }\n}\n","language":"Tcl"},{"code":"is_repeated() {\n local str=$1 len rep part\n for (( len = ${#str} / 2; len > 0; len-- )); do\n part=${str:0:len}\n rep=\"\"\n while (( ${#rep} < ${#str} )); do\n rep+=$part\n done\n if [[ ${rep:0:${#str}} == $str ]] && (( $len < ${#str} )); then\n echo \"$part\"\n return 0\n fi\n done\n return 1\n}\n\nwhile read test; do\n if part=$( is_repeated \"$test\" ); then\n echo \"$test is composed of $part repeated\"\n else\n echo \"$test is not a repeated string\"\n fi\ndone <<END_TESTS\n1001110011\n1110111011\n0010010010\n1010101010\n1111111111\n0100101101\n0100100\n101\n11\n00\n1\nEND_TESTS\n","language":"UNIX-Shell"},{"code":"fn rep(s string) int {\n for x := s.len / 2; x > 0; x-- {\n if s.starts_with(s[x..]) {\n return x\n }\n }\n return 0\n}\n\nconst m = '\n1001110011\n1110111011\n0010010010\n1010101010\n1111111111\n0100101101\n0100100\n101\n11\n00\n1'\n\nfn main() {\n for s in m.fields() {\n n := rep(s)\n if n > 0 {\n println(\"$s $n rep-string ${s[..n]}\")\n } else {\n println(\"$s not a rep-string\")\n }\n }\n}\n","language":"V-(Vlang)"},{"code":"Function rep_string(s)\n\tmax_len = Int(Len(s)/2)\n\ttmp = \"\"\n\tIf max_len = 0 Then\n\t\trep_string = \"No Repeating String\"\n\t\tExit Function\n\tEnd If\n\tFor i = 1 To max_len\n\t\tIf InStr(i+1,s,tmp & Mid(s,i,1))Then\n\t\t\ttmp = tmp & Mid(s,i,1)\n\t\tElse\n\t\t\tExit For\n\t\tEnd If\n\tNext\n\tDo While Len(tmp) > 0\n\t\tIf Mid(s,Len(tmp)+1,Len(tmp)) = tmp Then\n\t\t\trep_string = tmp\n\t\t\tExit Do\n\t\tElse\n\t\t\ttmp = Mid(tmp,1,Len(tmp)-1)\n\t\tEnd If\n\tLoop\n\tIf Len(tmp) > 0 Then\n\t\trep_string = tmp\n\tElse\n\t\trep_string = \"No Repeating String\"\n\tEnd If\nEnd Function\n\n'testing the function\narr = Array(\"1001110011\",\"1110111011\",\"0010010010\",\"1010101010\",_\n\t\t\"1111111111\",\"0100101101\",\"0100100\",\"101\",\"11\",\"00\",\"1\")\n\nFor n = 0 To UBound(arr)\n\tWScript.StdOut.Write arr(n) & \": \" & rep_string(arr(n))\n\tWScript.StdOut.WriteLine\nNext\n","language":"VBScript"},{"code":"import \"./fmt\" for Fmt\n\nvar repString = Fn.new { |s|\n var reps = []\n if (s.count < 2) return reps\n for (c in s) if (c != \"0\" && c != \"1\") Fiber.abort(\"Argument is not a binary string.\")\n var size = s.count\n for (len in 1..(size/2).floor) {\n var t = s[0...len]\n var n = (size/len).floor\n var r = size % len\n var u = t * n + t[0...r]\n if (u == s) reps.add(t)\n }\n return reps\n}\n\nvar strings = [\n \"1001110011\",\n \"1110111011\",\n \"0010010010\",\n \"1010101010\",\n \"1111111111\",\n \"0100101101\",\n \"0100100\",\n \"101\",\n \"11\",\n \"00\",\n \"1\"\n]\nSystem.print(\"The (longest) rep-strings are:\\n\")\nfor (s in strings) {\n var reps = repString.call(s)\n var t = (reps.count > 0) ? reps[-1] : \"Not a rep-string\"\n Fmt.print(\"$10s -> $s\", s, t)\n}\n","language":"Wren"},{"code":"data \"1001110011\", \"1110111011\", \"0010010010\", \"1010101010\", \"1111111111\", \"0100101101\", \"0100100\", \"101\", \"11\", \"00\", \"1\", \"\"\n\nsub rep$(c$, n)\n local r$, i\n\n for i = 1 to n\n r$ = r$ + c$\n next\n return r$\nend sub\n\ndo\n read p$ : if p$ = \"\" break\n b$ = \"\" : l = len(p$) : m = int(l / 2)\n\n for i = m to 1 step -1\n t$ = left$(p$, i)\n s$ = rep$(t$, l / i + 1)\n if p$ = left$(s$, l) b$ = t$ : break\n next\n\n if b$ = \"\" then\n print p$, \" is not a repeated string\"\n else\n print p$, \" is composed of \", b$, \" repeated\"\n end if\nloop\n","language":"Yabasic"},{"code":"fcn repString(s){\n foreach n in ([s.len()/2+1..1,-1]){\n Walker.cycle(s[0,n]).pump(s.len(),String) :\n if(_==s and n*2<=s.len()) return(n);\n }\n return(False)\n}\n","language":"Zkl"},{"code":"fcn repString(s){\n foreach n in ([s.len()/2..0,-1]){\n if(s.matches(s[n,*] + \"*\") and n*2<=s.len()) return(n);\n }\n return(False)\n}\n","language":"Zkl"},{"code":"words:=(\"1001110011 1110111011 0010010010 1010101010 \"\n \"1111111111 0100101101 0100100 101 11 00 1\").split(\" \");\nforeach w in (words){\n if(not n:=repString2(w)) \"No repeat in \".println(w);\n else [0..*,n].tweak('wrap(z){ if(s:=w[z,n]) s else Void.Stop })\n .walk().concat(\" \").println();\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Rep-string\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Given a series of ones and zeroes in a string, define a repeated string or ''rep-string'' as a string which is created by repeating a substring of the ''first'' N characters of the string ''truncated on the right to the length of the input string, and in which the substring appears repeated at least twice in the original''.\\n\\nFor example, the string '''10011001100''' is a rep-string as the leftmost four characters of '''1001''' are repeated three times and truncated on the right to give the original string.\\n\\nNote that the requirement for having the repeat occur two or more times means that the repeating unit is ''never'' longer than half the length of the input string.\\n\\n\\n;Task:\\n* Write a function/subroutine/method/... that takes a string and returns an indication of if it is a rep-string and the repeated string. (Either the string that is repeated, or the number of repeated characters would suffice). \\n* There may be multiple sub-strings that make a string a rep-string - in that case an indication of all, or the longest, or the shortest would suffice.\\n* Use the function to indicate the repeating substring if any, in the following:\\n<dl><dd>\\n<pre>\\n1001110011\\n1110111011\\n0010010010\\n1010101010\\n1111111111\\n0100101101\\n0100100\\n101\\n11\\n00\\n1\\n</pre>\\n</dl>\\n* Show your output on this page.\\n\\n\\n{{Template:Strings}}\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F reps(text)\\n R (1 .< 1 + text.len I/ 2).filter(x -> @text.starts_with(@text[x..])).map(x -> @text[0 .< x])\\n\\nV matchstr =\\n|‘1001110011\\n 1110111011\\n 0010010010\\n 1010101010\\n 1111111111\\n 0100101101\\n 0100100\\n 101\\n 11\\n 00\\n 1’\\n\\nL(line) matchstr.split(\\\"\\\\n\\\")\\n print(‘'#.' has reps #.’.format(line, reps(line)))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"HOW TO RETURN repstrings str:\\n PUT {} IN reps\\n FOR len IN {0..floor(#str/2-1)}:\\n PUT str|floor(#str/2-len) IN rep\\n PUT rep IN rpt\\n WHILE #rpt < #str: PUT rpt^rep IN rpt\\n IF rpt|#str = str: INSERT rep IN reps\\n RETURN reps\\n\\nPUT {} IN tests\\nPUT \\\"1001110011\\\" IN tests[1]\\nPUT \\\"1110111011\\\" IN tests[2]\\nPUT \\\"0010010010\\\" IN tests[3]\\nPUT \\\"1010101010\\\" IN tests[4]\\nPUT \\\"1111111111\\\" IN tests[5]\\nPUT \\\"0100101101\\\" IN tests[6]\\nPUT \\\"0100100\\\" IN tests[7]\\nPUT \\\"101\\\" IN tests[8]\\nPUT \\\"11\\\" IN tests[9]\\nPUT \\\"00\\\" IN tests[10]\\nPUT \\\"1\\\" IN tests[11]\\n\\nFOR t IN tests:\\n WRITE t, repstrings t /\\n\",\n \"language\": \"ABC\"\n },\n {\n \"code\": \"BYTE FUNC IsCycle(CHAR ARRAY s,sub)\\n BYTE i,j,count\\n\\n IF sub(0)=0 OR s(0)<sub(0) THEN\\n RETURN (0)\\n FI\\n\\n j=1 count=0\\n FOR i=1 TO s(0)\\n DO\\n IF s(i)#sub(j) THEN\\n RETURN (0)\\n FI\\n j==+1\\n IF j>sub(0) THEN\\n j=1 count==+1\\n FI\\n OD\\n IF count>1 THEN\\n RETURN (1)\\n FI\\nRETURN (0)\\n\\nPROC Test(CHAR ARRAY s)\\n CHAR ARRAY sub\\n BYTE len,count\\n\\n PrintF(\\\"%S -> \\\",s)\\n count=0\\n FOR len=1 TO s(0)-1\\n DO\\n SCopyS(sub,s,1,len)\\n IF IsCycle(s,sub) THEN\\n IF count>0 THEN\\n Print(\\\", \\\")\\n FI\\n Print(sub)\\n count==+1\\n FI\\n OD\\n IF count=0 THEN\\n Print(\\\"none\\\")\\n FI\\n PutE()\\nRETURN\\n\\nPROC Main()\\n Test(\\\"1001110011\\\")\\n Test(\\\"1110111011\\\")\\n Test(\\\"0010010010\\\")\\n Test(\\\"1010101010\\\")\\n Test(\\\"1111111111\\\")\\n Test(\\\"0100101101\\\")\\n Test(\\\"0100100\\\")\\n Test(\\\"101\\\")\\n Test(\\\"11\\\")\\n Test(\\\"00\\\")\\n Test(\\\"1\\\")\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Command_Line, Ada.Text_IO, Ada.Strings.Fixed;\\n\\nprocedure Rep_String is\\n\\n function Find_Largest_Rep_String(S:String) return String is\\n L: Natural := S'Length;\\n begin\\n for I in reverse 1 .. L/2 loop\\n\\t declare\\n\\t use Ada.Strings.Fixed;\\n\\t T: String := S(S'First .. S'First + I-1); -- the first I characters of S\\n\\t U: String := (1+(L/I)) * T; -- repeat T so often that U'Length >= L\\n\\t begin -- compare first L characers of U with S\\n\\t if U(U'First .. U'First + S'Length -1) = S then\\n\\t return T; -- T is a rep-string\\n\\t end if;\\n\\t end;\\n end loop;\\n return \\\"\\\"; -- no rep string;\\n end Find_Largest_Rep_String;\\n\\n X: String := Ada.Command_Line.Argument(1);\\n Y: String := Find_Largest_Rep_String(X);\\n\\nbegin\\n if Y=\\\"\\\" then\\n Ada.Text_IO.Put_Line(\\\"No rep-string for \\\"\\\"\\\" & X & \\\"\\\"\\\"\\\");\\n else\\n Ada.Text_IO.Put_Line(\\\"Longest rep-string for \\\"\\\"\\\"& X &\\\"\\\"\\\": \\\"\\\"\\\"& Y &\\\"\\\"\\\"\\\");\\n end if;\\nend Rep_String;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# procedure to find the longest rep-string in a given string #\\n# the input string is not validated to contain only \\\"0\\\" and \\\"1\\\" characters #\\nPROC longest rep string = ( STRING input )STRING:\\nBEGIN\\n\\n STRING result := \\\"\\\";\\n\\n # ensure the string we are working on has a lower-bound of 1 #\\n STRING str = input[ AT 1 ];\\n\\n # work backwards from half the input string looking for a rep-string #\\n FOR string length FROM UPB str OVER 2 BY -1 TO 1\\n WHILE\\n STRING left substring = str[ 1 : string length ];\\n # if the left substgring repeated a sufficient number of times #\\n # (truncated on the right) is equal to the original string, then #\\n # we have found the longest rep-string #\\n STRING repeated string = ( left substring\\n * ( ( UPB str OVER string length ) + 1 )\\n )[ 1 : UPB str ];\\n IF str = repeated string\\n THEN\\n # found a rep-string #\\n result := left substring;\\n FALSE\\n ELSE\\n # not a rep-string, keep looking #\\n TRUE\\n FI\\n DO\\n SKIP\\n OD;\\n\\n result\\nEND; # longest rep string #\\n\\n\\n# test the longest rep string procedure #\\nmain:\\n(\\n\\n []STRING tests = ( \\\"1001110011\\\"\\n , \\\"1110111011\\\"\\n , \\\"0010010010\\\"\\n , \\\"1010101010\\\"\\n , \\\"1111111111\\\"\\n , \\\"0100101101\\\"\\n , \\\"0100100\\\"\\n , \\\"101\\\"\\n , \\\"11\\\"\\n , \\\"00\\\"\\n , \\\"1\\\"\\n );\\n\\n FOR test number FROM LWB tests TO UPB tests\\n DO\\n STRING rep string = longest rep string( tests[ test number ] );\\n print( ( tests[ test number ]\\n , \\\": \\\"\\n , IF rep string = \\\"\\\"\\n THEN \\\"no rep string\\\"\\n ELSE \\\"longest rep string: \\\"\\\"\\\" + rep string + \\\"\\\"\\\"\\\"\\n FI\\n , newline\\n )\\n )\\n OD\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"rep ← ⊢ (⊢(/⍨)(⊂⊣)≡¨(≢⊣)⍴¨⊢) ⍳∘(⌊0.5×≢)↑¨⊂\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"------------------------REP-CYCLES-------------------------\\n\\n-- repCycles :: String -> [String]\\non repCycles(xs)\\n set n to length of xs\\n\\n script isCycle\\n on |λ|(cs)\\n xs = takeCycle(n, cs)\\n end |λ|\\n end script\\n\\n filter(isCycle, tail(inits(take(quot(n, 2), xs))))\\nend repCycles\\n\\n-- cycleReport :: String -> [String]\\non cycleReport(xs)\\n set reps to repCycles(xs)\\n\\n if isNull(reps) then\\n {xs, \\\"(n/a)\\\"}\\n else\\n {xs, item -1 of reps}\\n end if\\nend cycleReport\\n\\n\\n---------------------------TEST----------------------------\\non run\\n set samples to {\\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\", ¬\\n \\\"1010101010\\\", \\\"1111111111\\\", \\\"0100101101\\\", \\\"0100100\\\", ¬\\n \\\"101\\\", \\\"11\\\", \\\"00\\\", \\\"1\\\"}\\n\\n unlines(cons(\\\"Longest cycle:\\\" & linefeed, ¬\\n map(intercalate(\\\" -> \\\"), ¬\\n map(cycleReport, samples))))\\n\\nend run\\n\\n\\n---------------------GENERIC FUNCTIONS---------------------\\n\\n-- concat :: [[a]] -> [a] | [String] -> String\\non concat(xs)\\n if length of xs > 0 and class of (item 1 of xs) is string then\\n set acc to \\\"\\\"\\n else\\n set acc to {}\\n end if\\n repeat with i from 1 to length of xs\\n set acc to acc & item i of xs\\n end repeat\\n acc\\nend concat\\n\\n-- cons :: a -> [a] -> [a]\\non cons(x, xs)\\n {x} & xs\\nend cons\\n\\n-- filter :: (a -> Bool) -> [a] -> [a]\\non filter(f, xs)\\n tell mReturn(f)\\n set lst to {}\\n set lng to length of xs\\n repeat with i from 1 to lng\\n set v to item i of xs\\n if |λ|(v, i, xs) then set end of lst to v\\n end repeat\\n return lst\\n end tell\\nend filter\\n\\n-- foldl :: (a -> b -> a) -> a -> [b] -> a\\non foldl(f, startValue, xs)\\n tell mReturn(f)\\n set v to startValue\\n set lng to length of xs\\n repeat with i from 1 to lng\\n set v to |λ|(v, item i of xs, i, xs)\\n end repeat\\n return v\\n end tell\\nend foldl\\n\\n-- inits :: [a] -> [[a]]\\n-- inits :: String -> [String]\\non inits(xs)\\n script elemInit\\n on |λ|(_, i, xs)\\n items 1 thru i of xs\\n end |λ|\\n end script\\n\\n script charInit\\n on |λ|(_, i, xs)\\n text 1 thru i of xs\\n end |λ|\\n end script\\n\\n if class of xs is string then\\n {\\\"\\\"} & map(charInit, xs)\\n else\\n {{}} & map(elemInit, xs)\\n end if\\nend inits\\n\\n-- intercalate :: Text -> [Text] -> Text\\non intercalate(strText)\\n script\\n on |λ|(xs)\\n set {dlm, my text item delimiters} to {my text item delimiters, strText}\\n set strJoined to xs as text\\n set my text item delimiters to dlm\\n return strJoined\\n end |λ|\\n end script\\nend intercalate\\n\\n-- map :: (a -> b) -> [a] -> [b]\\non map(f, xs)\\n tell mReturn(f)\\n set lng to length of xs\\n set lst to {}\\n repeat with i from 1 to lng\\n set end of lst to |λ|(item i of xs, i, xs)\\n end repeat\\n return lst\\n end tell\\nend map\\n\\n-- Lift 2nd class handler function into 1st class script wrapper\\n-- mReturn :: Handler -> Script\\non mReturn(f)\\n if class of f is script then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\\n-- isNull :: [a] -> Bool\\non isNull(xs)\\n xs = {}\\nend isNull\\n\\n-- min :: Ord a => a -> a -> a\\non min(x, y)\\n if y < x then\\n y\\n else\\n x\\n end if\\nend min\\n\\n-- quot :: Integral a => a -> a -> a\\non quot(n, m)\\n n div m\\nend quot\\n\\n-- replicate :: Int -> a -> [a]\\non replicate(n, a)\\n set out to {}\\n if n < 1 then return out\\n set dbl to {a}\\n\\n repeat while (n > 1)\\n if (n mod 2) > 0 then set out to out & dbl\\n set n to (n div 2)\\n set dbl to (dbl & dbl)\\n end repeat\\n return out & dbl\\nend replicate\\n\\n-- tail :: [a] -> [a]\\non tail(xs)\\n if length of xs > 1 then\\n items 2 thru -1 of xs\\n else\\n {}\\n end if\\nend tail\\n\\n-- take :: Int -> [a] -> [a]\\non take(n, xs)\\n if class of xs is string then\\n if n > 0 then\\n text 1 thru min(n, length of xs) of xs\\n else\\n \\\"\\\"\\n end if\\n else\\n if n > 0 then\\n items 1 thru min(n, length of xs) of xs\\n else\\n {}\\n end if\\n end if\\nend take\\n\\n-- takeCycle :: Int -> [a] -> [a]\\non takeCycle(n, xs)\\n set lng to length of xs\\n if lng ≥ n then\\n set cycle to xs\\n else\\n set cycle to concat(replicate((n div lng) + 1, xs))\\n end if\\n\\n if class of xs is string then\\n items 1 thru n of cycle as string\\n else\\n items 1 thru n of cycle\\n end if\\nend takeCycle\\n\\n-- unlines :: [String] -> String\\non unlines(xs)\\n |λ|(xs) of intercalate(linefeed)\\nend unlines\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"repeated?: function [text][\\n loop ((size text)/2)..0 'x [\\n if prefix? text slice text x (size text)-1 [\\n (x>0)? -> return slice text 0 x-1\\n -> return false\\n ]\\n ]\\n return false\\n]\\n\\nstrings: {\\n 1001110011\\n 1110111011\\n 0010010010\\n 1010101010\\n 1111111111\\n 0100101101\\n 0100100\\n 101\\n 11\\n 00\\n 1\\n}\\n\\nloop split.lines strings 'str [\\n rep: repeated? str\\n if? false = rep ->\\n print [str \\\"-> *not* a rep-string\\\"]\\n else ->\\n print [str \\\"->\\\" rep \\\"( length:\\\" size rep \\\")\\\"]\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"In := [\\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\", \\\"1010101010\\\"\\n , \\\"1111111111\\\", \\\"0100101101\\\", \\\"0100100\\\", \\\"101\\\", \\\"11\\\", \\\"00\\\", \\\"1\\\"]\\nfor k, v in In\\n\\tOut .= RepString(v) \\\"`t\\\" v \\\"`n\\\"\\nMsgBox, % Out\\n\\nRepString(s) {\\n\\tLoop, % StrLen(s) // 2 {\\n\\t\\ti := A_Index\\n\\t\\tLoop, Parse, s\\n\\t\\t{\\n\\t\\t\\tpos := Mod(A_Index, i)\\n\\t\\t\\tif (A_LoopField != SubStr(s, !pos ? i : pos, 1))\\n\\t\\t\\t\\tcontinue, 2\\n\\t\\t}\\n\\t\\treturn SubStr(s, 1, i)\\n\\t}\\n\\treturn \\\"N/A\\\"\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"all$ = \\\"1001110011 1110111011 0010010010 1010101010 1111111111 0100101101 0100100 101 11 00 1\\\"\\n\\nFOR word$ IN all$\\n FOR x = LEN(word$)/2 DOWNTO 1\\n\\n ex$ = EXPLODE$(word$, x)\\n\\n FOR st$ IN UNIQ$(ex$)\\n IF NOT(REGEX(HEAD$(ex$, 1), \\\"^\\\" & st$)) THEN CONTINUE 2\\n NEXT\\n\\n PRINT \\\"Repeating string: \\\", word$, \\\" -> \\\", HEAD$(ex$, 1)\\n CONTINUE 2\\n NEXT\\n\\n PRINT \\\"Not a repeating string: \\\", word$\\nNEXT\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"10 DEFINT I: DEFSTR S,T\\n20 READ S: IF S=\\\"\\\" THEN END\\n30 IF LEN(S)<2 THEN 80 ELSE FOR I = LEN(S)\\\\2 TO 1 STEP -1\\n40 T = \\\"\\\"\\n50 IF LEN(T)<LEN(S) THEN T=T+LEFT$(S,I): GOTO 50\\n60 IF LEFT$(T,LEN(S))=S THEN PRINT S;\\\": \\\";LEFT$(S,I): GOTO 20\\n70 NEXT I\\n80 PRINT S;\\\": none\\\"\\n90 GOTO 20\\n100 DATA \\\"1001110011\\\",\\\"1110111011\\\"\\n110 DATA \\\"0010010010\\\",\\\"1010101010\\\"\\n120 DATA \\\"1111111111\\\",\\\"0100101101\\\"\\n130 DATA \\\"0100100\\\",\\\"101\\\"\\n140 DATA \\\"11\\\",\\\"00\\\"\\n150 DATA \\\"1\\\",\\\"\\\"\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\n// Returns the length of the longest rep-string\\n// (0 if there are none)\\nlet repstring(s) = valof\\n$( for i = s%0/2 to 1 by -1 do\\n $( for j = 1 to i\\n $( let k = i\\n while j+k <= s%0 do\\n $( unless s%(j+k)=s%j goto next\\n k := k + i\\n $)\\n $)\\n resultis i\\n next: loop\\n $)\\n resultis 0\\n$)\\n\\n// Print first N characters of string\\nlet writefirst(s, n) be\\n$( let x = s%0\\n s%0 := n\\n writes(s)\\n s%0 := x\\n$)\\n\\n// Test string\\nlet rep(s) be\\n$( let n = repstring(s)\\n writef(\\\"%S: \\\",s)\\n test n=0\\n do writes(\\\"none\\\")\\n or writefirst(s,n)\\n wrch('*N')\\n$)\\n\\nlet start() be\\n$( rep(\\\"1001110011\\\")\\n rep(\\\"1110111011\\\")\\n rep(\\\"0010010010\\\")\\n rep(\\\"1010101010\\\")\\n rep(\\\"1111111111\\\")\\n rep(\\\"0100101101\\\")\\n rep(\\\"0100100\\\")\\n rep(\\\"101\\\")\\n rep(\\\"11\\\")\\n rep(\\\"00\\\")\\n rep(\\\"1\\\")\\n$)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"# Returns a list of all rep-strings\\nReps←(⌊≠÷2˙)((⊣≥≠¨∘⊢)/⊢)(<≡¨≠⥊¨1↓↑)/1↓↑\\n\\n# Tests\\ntests←⟨\\n \\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\",\\n \\\"1010101010\\\", \\\"1111111111\\\", \\\"0100101101\\\",\\n \\\"0100100\\\", \\\"101\\\", \\\"11\\\", \\\"00\\\", \\\"1\\\"\\n⟩\\n\\n∾´{ 𝕩∾':'∾(•Fmt Reps 𝕩)∾@+10 }¨tests\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"( ( rep-string\\n = reps L x y\\n . ( reps\\n = x y z\\n . !arg:(?x.?y)\\n & ( @(!y:!x ?z)&reps$(!x.!z)\\n | @(!x:!y ?)\\n )\\n )\\n & ( :?L\\n & @( !arg\\n : %?x\\n !x\\n ( ?y\\n & reps$(!x.!y)\\n & !x !L:?L\\n & ~\\n )\\n )\\n | !L:\\n & out$(str$(!arg \\\" is not a rep-string\\\"))\\n | out$(!arg \\\":\\\" !L)\\n )\\n )\\n& rep-string$1001110011\\n& rep-string$1110111011\\n& rep-string$0010010010\\n& rep-string$1010101010\\n& rep-string$1111111111\\n& rep-string$0100101101\\n& rep-string$0100100\\n& rep-string$101\\n& rep-string$11\\n& rep-string$00\\n& rep-string$1\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <string.h>\\n\\nint repstr(char *str)\\n{\\n if (!str) return 0;\\n\\n size_t sl = strlen(str) / 2;\\n while (sl > 0) {\\n if (strstr(str, str + sl) == str)\\n return sl;\\n --sl;\\n }\\n\\n return 0;\\n}\\n\\nint main(void)\\n{\\n char *strs[] = { \\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\", \\\"1111111111\\\",\\n \\\"0100101101\\\", \\\"0100100\\\", \\\"101\\\", \\\"11\\\", \\\"00\\\", \\\"1\\\" };\\n\\n size_t strslen = sizeof(strs) / sizeof(strs[0]);\\n size_t i;\\n for (i = 0; i < strslen; ++i) {\\n int n = repstr(strs[i]);\\n if (n)\\n printf(\\\"\\\\\\\"%s\\\\\\\" = rep-string \\\\\\\"%.*s\\\\\\\"\\\\n\\\", strs[i], n, strs[i]);\\n else\\n printf(\\\"\\\\\\\"%s\\\\\\\" = not a rep-string\\\\n\\\", strs[i]);\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"// strstr : Returns a pointer to the first occurrence of str2 in str1, or a null pointer if str2 is not part of str1.\\n// size_t is an unsigned integer typ\\n// lokks for the shortest substring\\nint repstr(char *str)\\n{\\n if (!str) return 0; // if empty input\\n\\n size_t sl = 1;\\n size_t sl_max = strlen(str) ;\\n\\n while (sl < sl_max) {\\n if (strstr(str, str + sl) == str) // How it works ???? It checks the whole string str\\n \\treturn sl;\\n ++sl;\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <string>\\n#include <vector>\\n#include <boost/regex.hpp>\\n\\nbool is_repstring( const std::string & teststring , std::string & repunit ) {\\n std::string regex( \\\"^(.+)\\\\\\\\1+(.*)$\\\" ) ;\\n boost::regex e ( regex ) ;\\n boost::smatch what ;\\n if ( boost::regex_match( teststring , what , e , boost::match_extra ) ) {\\n std::string firstbracket( what[1 ] ) ;\\n std::string secondbracket( what[ 2 ] ) ;\\n if ( firstbracket.length( ) >= secondbracket.length( ) &&\\n\\t firstbracket.find( secondbracket ) != std::string::npos ) {\\n\\t repunit = firstbracket ;\\n }\\n }\\n return !repunit.empty( ) ;\\n}\\n\\nint main( ) {\\n std::vector<std::string> teststrings { \\\"1001110011\\\" , \\\"1110111011\\\" , \\\"0010010010\\\" ,\\n \\\"1010101010\\\" , \\\"1111111111\\\" , \\\"0100101101\\\" , \\\"0100100\\\" , \\\"101\\\" , \\\"11\\\" , \\\"00\\\" , \\\"1\\\" } ;\\n std::string theRep ;\\n for ( std::string myString : teststrings ) {\\n if ( is_repstring( myString , theRep ) ) {\\n\\t std::cout << myString << \\\" is a rep string! Here is a repeating string:\\\\n\\\" ;\\n\\t std::cout << theRep << \\\" \\\" ;\\n }\\n else {\\n\\t std::cout << myString << \\\" is no rep string!\\\" ;\\n }\\n theRep.clear( ) ;\\n std::cout << std::endl ;\\n }\\n return 0 ;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <cstdint>\\n#include <iomanip>\\n#include <iostream>\\n#include <iterator>\\n#include <sstream>\\n#include <string>\\n#include <vector>\\n\\nstd::string repeat(const std::string& text, const int32_t& repetitions) {\\n std::stringstream stream;\\n std::fill_n(std::ostream_iterator<std::string>(stream), repetitions, text);\\n return stream.str();\\n}\\n\\nstd::vector<std::string> rep_string(const std::string& text) {\\n\\tstd::vector<std::string> repetitions;\\n\\n\\tfor ( uint64_t len = 1; len <= text.length() / 2; ++len ) {\\n\\t\\tstd::string possible = text.substr(0, len);\\n\\t\\tuint64_t quotient = text.length() / len;\\n\\t\\tuint64_t remainder = text.length() % len;\\n\\t\\tstd::string candidate = repeat(possible, quotient) + possible.substr(0, remainder);\\n\\t\\tif ( candidate == text ) {\\n\\t\\t\\trepetitions.emplace_back(possible);\\n\\t\\t}\\n\\t}\\n\\treturn repetitions;\\n}\\n\\nint main() {\\n\\tconst std::vector<std::string> tests = { \\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\",\\n\\t\\t\\\"1010101010\\\", \\\"1111111111\\\", \\\"0100101101\\\", \\\"0100100\\\", \\\"101\\\", \\\"11\\\", \\\"00\\\", \\\"1\\\" };\\n\\n\\tstd::cout << \\\"The longest rep-strings are:\\\" << std::endl;\\n\\tfor ( const std::string& test : tests ) {\\n\\t\\tstd::vector<std::string> repeats = rep_string(test);\\n\\t\\tstd::string result = repeats.empty() ? \\\"Not a rep-string\\\" : repeats.back();\\n\\t\\tstd::cout << std::setw(10) << test << \\\" -> \\\" << result << std::endl;\\n\\t}\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\npublic class RepString\\n{\\n static readonly string[] input = {\\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\",\\n \\\"1010101010\\\", \\\"1111111111\\\", \\\"0100101101\\\", \\\"0100100\\\", \\\"101\\\", \\\"11\\\",\\n \\\"00\\\", \\\"1\\\", \\\"0100101\\\"};\\n\\n public static void Main(string[] args)\\n {\\n foreach (string s in input)\\n Console.WriteLine($\\\"{s} : {repString(s)}\\\");\\n }\\n\\n static string repString(string s)\\n {\\n int len = s.Length;\\n for (int part = len / 2; part > 0; part--)\\n {\\n int tail = len % part;\\n if (tail > 0 && !s.Substring(0, tail).Equals(s.Substring(len - tail)))\\n continue;\\n bool isRepeated = true;\\n for (int j = 0; j < len / part - 1; j++)\\n {\\n int a = j * part;\\n int b = (j + 1) * part;\\n int c = (j + 2) * part;\\n if (!s.Substring(a, part).Equals(s.Substring(b, part)))\\n {\\n isRepeated = false;\\n break;\\n }\\n }\\n if (isRepeated)\\n return s.Substring(0, part);\\n }\\n return \\\"none\\\";\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn rep-string [s]\\n (let [len (count s)\\n first-half (subs s 0 (/ len 2))\\n test-group (take-while seq (iterate butlast first-half))\\n test-reptd (map #(take len (cycle %)) test-group)]\\n (some #(= (seq s) %) test-reptd)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(def test-strings [\\\"1001110011\\\"\\n \\\"1110111011\\\"\\n \\\"0010010010\\\"\\n \\\"1010101010\\\"\\n \\\"1111111111\\\"\\n \\\"0100101101\\\"\\n \\\"0100100\\\"\\n \\\"101\\\"\\n \\\"11\\\"\\n \\\"00\\\"\\n \\\"1\\\"])\\n\\n(map (juxt identity rep-string) test-strings)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"rep_strings = iter (s: string) yields (string)\\n for len: int in int$from_to_by(string$size(s)/2, 1, -1) do\\n repstr: string := string$substr(s, 1, len)\\n attempt: string := \\\"\\\"\\n while string$size(attempt) < string$size(s) do\\n attempt := attempt || repstr\\n end\\n if s = string$substr(attempt, 1, string$size(s)) then\\n yield(repstr)\\n end\\n end\\nend rep_strings\\n\\nstart_up = proc ()\\n as = array[string]\\n po: stream := stream$primary_output()\\n tests: as := as$[\\\"1001110011\\\",\\\"1110111011\\\",\\\"0010010010\\\",\\\"1010101010\\\",\\n \\\"1111111111\\\",\\\"0100101101\\\",\\\"0100100\\\",\\\"101\\\",\\\"11\\\",\\\"00\\\",\\n \\\"1\\\"]\\n\\n for test: string in as$elements(tests) do\\n stream$puts(po, test || \\\": \\\")\\n for rep_str: string in rep_strings(test) do\\n stream$puts(po, \\\"<\\\" || rep_str || \\\"> \\\")\\n end\\n stream$putc(po, '\\\\n')\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \"(ql:quickload :alexandria)\\n(defun rep-stringv (a-str &optional (max-rotation (floor (/ (length a-str) 2))))\\n ;; Exit condition if no repetition found.\\n (cond ((< max-rotation 1) \\\"Not a repeating string\\\")\\n ;; Two checks:\\n ;; 1. Truncated string must be equal to rotation by repetion size.\\n ;; 2. Remaining chars (rest-str) are identical to starting chars (beg-str)\\n ((let* ((trunc (* max-rotation (truncate (length a-str) max-rotation)))\\n (truncated-str (subseq a-str 0 trunc))\\n (rest-str (subseq a-str trunc))\\n (beg-str (subseq a-str 0 (rem (length a-str) max-rotation))))\\n (and (string= beg-str rest-str)\\n (string= (alexandria:rotate (copy-seq truncated-str) max-rotation)\\n truncated-str)))\\n ;; If both checks pass, return the repeting string.\\n (subseq a-str 0 max-rotation))\\n ;; Recurse function reducing length of rotation.\\n (t (rep-stringv a-str (1- max-rotation)))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(setf test-strings '(\\\"1001110011\\\"\\n \\\"1110111011\\\"\\n \\\"0010010010\\\"\\n \\\"1010101010\\\"\\n \\\"1111111111\\\"\\n \\\"0100101101\\\"\\n \\\"0100100\\\"\\n \\\"101\\\"\\n \\\"11\\\"\\n \\\"00\\\"\\n \\\"1\\\"\\n ))\\n\\n(loop for item in test-strings\\n collecting (cons item (rep-stringv item)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"def rep(s : String) : Int32\\n x = s.size // 2\\n\\n while x > 0\\n return x if s.starts_with? s[x..]\\n x -= 1\\n end\\n\\n 0\\nend\\n\\ndef main\\n %w(\\n 1001110011\\n 1110111011\\n 0010010010\\n 1010101010\\n 1111111111\\n 0100101101\\n 0100100\\n 101\\n 11\\n 00\\n 1\\n ).each do |s|\\n n = rep s\\n puts n > 0 ? \\\"\\\\\\\"#{s}\\\\\\\" #{n} rep-string \\\\\\\"#{s[..(n - 1)]}\\\\\\\"\\\" : \\\"\\\\\\\"#{s}\\\\\\\" not a rep-string\\\"\\n end\\nend\\n\\nmain\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio, std.string, std.conv, std.range, std.algorithm,\\n std.ascii, std.typecons;\\n\\nNullable!(size_t, 0) repString1(in string s) pure nothrow @safe @nogc\\nin {\\n //assert(s.all!isASCII);\\n assert(s.representation.all!isASCII);\\n} body {\\n immutable sr = s.representation;\\n foreach_reverse (immutable n; 1 .. sr.length / 2 + 1)\\n if (sr.take(n).cycle.take(sr.length).equal(sr))\\n return typeof(return)(n);\\n return typeof(return)();\\n}\\n\\nNullable!(size_t, 0) repString2(in string s) pure @safe /*@nogc*/\\nin {\\n assert(s.countchars(\\\"01\\\") == s.length);\\n} body {\\n immutable bits = s.to!ulong(2);\\n\\n foreach_reverse (immutable left; 1 .. s.length / 2 + 1) {\\n immutable right = s.length - left;\\n if ((bits ^ (bits >> left)) == ((bits >> right) << right))\\n return typeof(return)(left);\\n }\\n return typeof(return)();\\n}\\n\\nvoid main() {\\n immutable words = \\\"1001110011 1110111011 0010010010 1010101010\\n 1111111111 0100101101 0100100 101 11 00 1\\\".split;\\n\\n foreach (immutable w; words) {\\n immutable r1 = w.repString1;\\n //assert(r1 == w.repString2);\\n immutable r2 = w.repString2;\\n assert((r1.isNull && r2.isNull) || r1 == r2);\\n if (r1.isNull)\\n writeln(w, \\\" (no repeat)\\\");\\n else\\n writefln(\\\"%(%s %)\\\", w.chunks(r1));\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Rep_string;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils;\\n\\nconst\\n m = '1001110011'#10 +\\n '1110111011'#10 +\\n '0010010010'#10 +\\n '1010101010'#10 +\\n '1111111111'#10 +\\n '0100101101'#10 +\\n '0100100'#10 +\\n '101'#10 +\\n '11'#10 +\\n '00'#10 +\\n '1';\\n\\nfunction Rep(s: string; var sub:string): Integer;\\nvar\\n x: Integer;\\nbegin\\n for x := s.Length div 2 downto 1 do\\n begin\\n sub := s.Substring(x);\\n if s.StartsWith(sub) then\\n exit(x);\\n end;\\n sub := '';\\n Result := 0;\\nend;\\n\\nbegin\\n for var s in m.Split([#10]) do\\n begin\\n var sub := '';\\n var n := rep(s,sub);\\n if n > 0 then\\n writeln(format('\\\"%s\\\" %d rep-string \\\"%s\\\"', [s, n, sub]))\\n else\\n writeln(format('\\\"%s\\\" not a rep-string', [s]));\\n end;\\n {$IFNDEF UNIX}readln;{$ENDIF}\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"func rep(s) {\\n var x = s.Length() / 2\\n while x > 0 {\\n if s.StartsWith(s.Substring(x)) {\\n return x\\n }\\n x -= 1\\n }\\n return 0\\n}\\n\\nlet m = [\\n \\\"1001110011\\\",\\n \\\"1110111011\\\",\\n \\\"0010010010\\\",\\n \\\"1010101010\\\",\\n \\\"1111111111\\\",\\n \\\"0100101101\\\",\\n \\\"0100100\\\",\\n \\\"101\\\",\\n \\\"11\\\",\\n \\\"00\\\",\\n \\\"1\\\"\\n]\\n\\nfor s in m {\\n if (rep(s) is n) && n > 0 {\\n print(\\\"\\\\(s) \\\\(n) rep-string \\\\(s.Substring(n))\\\")\\n } else {\\n print(\\\"\\\\(s) not a rep-string\\\")\\n }\\n}\\n\",\n \"language\": \"Dyalect\"\n },\n {\n \"code\": \"func$ repstr s$ .\\n sl = len s$ div 2 + 1\\n while sl > 1\\n r$ = substr s$ sl 999\\n if r$ = substr s$ 1 len r$\\n return substr r$ 1 (sl - 1)\\n .\\n sl -= 1\\n .\\n return \\\"\\\"\\n.\\nrepeat\\n s$ = input\\n until s$ = \\\"\\\"\\n print s$ & \\\" -> \\\" & repstr s$\\n.\\ninput_data\\n1001110011\\n1110111011\\n0010010010\\n1010101010\\n1111111111\\n0100101101\\n0100100\\n101\\n11\\n00\\n1\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"(lib 'list) ;; list-rotate\\n\\n;; a list is a rep-list if equal? to itself after a rotation of lam units\\n;; lam <= list length / 2\\n;; truncate to a multiple of lam before rotating\\n;; try cycles in decreasing lam order (longest wins)\\n\\n(define (cyclic? cyclic)\\n (define len (length cyclic))\\n (define trunc null)\\n\\n (if (> len 1)\\n (for ((lam (in-range (quotient len 2) 0 -1)))\\n (set! trunc (take cyclic (- len (modulo len lam))))\\n #:break (equal? trunc (list-rotate trunc lam)) => (list->string (take cyclic lam))\\n 'no-rep )\\n 'too-short-no-rep))\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"(define strings '[\\\"1001110011\\\" \\\"1110111011\\\" \\\"0010010010\\\" \\\"1010101010\\\"\\n \\\"1111111111\\\" \\\"0100101101\\\" \\\"0100100\\\" \\\"101\\\" \\\"11\\\" \\\"00\\\" \\\"1\\\"])\\n\\n(define (task strings)\\n\\t(for-each (lambda (s)\\n\\t(writeln s (cyclic? (string->list s)))) strings))\\n\\n(task strings)\\n\\n\\\"1001110011\\\" \\\"10011\\\"\\n\\\"1110111011\\\" \\\"1110\\\"\\n\\\"0010010010\\\" \\\"001\\\"\\n\\\"1010101010\\\" \\\"1010\\\"\\n\\\"1111111111\\\" \\\"11111\\\"\\n\\\"0100101101\\\" no-rep\\n\\\"0100100\\\" \\\"010\\\"\\n\\\"101\\\" no-rep\\n\\\"11\\\" \\\"1\\\"\\n\\\"00\\\" \\\"0\\\"\\n\\\"1\\\" too-short-no-rep\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"defmodule Rep_string do\\n def find(\\\"\\\"), do: IO.puts \\\"String was empty (no repetition)\\\"\\n def find(str) do\\n IO.puts str\\n rep_pos = Enum.find(div(String.length(str),2)..1, fn pos ->\\n String.starts_with?(str, String.slice(str, pos..-1))\\n end)\\n if rep_pos && rep_pos>0 do\\n IO.puts String.duplicate(\\\" \\\", rep_pos) <> String.slice(str, 0, rep_pos)\\n else\\n IO.puts \\\"(no repetition)\\\"\\n end\\n IO.puts \\\"\\\"\\n end\\nend\\n\\nstrs = ~w(1001110011\\n 1110111011\\n 0010010010\\n 1010101010\\n 1111111111\\n 0100101101\\n 0100100\\n 101\\n 11\\n 00\\n 1)\\n\\nEnum.each(strs, fn str -> Rep_string.find(str) end)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"REPCYCLES\\n=LAMBDA(s,\\n LET(\\n n, LEN(s),\\n xs, FILTERP(\\n LAMBDA(pfx,\\n s = TAKECYCLESTRING(n)(pfx)\\n )\\n )(\\n TAILCOLS(\\n INITS(\\n MID(s, 1, QUOTIENT(n, 2))\\n )\\n )\\n ),\\n\\n IF(ISERROR(xs), NA(), xs)\\n )\\n)\\n\\n\\nTAKECYCLESTRING\\n=LAMBDA(n,\\n LAMBDA(s,\\n LET(\\n lng, LEN(s),\\n\\n MID(\\n IF(n < lng,\\n s,\\n REPT(s, CEILING.MATH(n / lng))\\n ),\\n 1, n\\n )\\n )\\n )\\n)\\n\",\n \"language\": \"Excel\"\n },\n {\n \"code\": \"FILTERP\\n=LAMBDA(p,\\n LAMBDA(xs,\\n FILTER(xs, p(xs))\\n )\\n)\\n\\n\\nINITS\\n=LAMBDA(s,\\n MID(\\n s,\\n 1, SEQUENCE(\\n 1, 1 + LEN(s),\\n 0, 1\\n )\\n )\\n)\\n\\n\\nLASTCOL\\n=LAMBDA(xs,\\n IF(AND(1 = COLUMNS(xs), ISBLANK(xs)),\\n NA(),\\n INDEX(xs, 1, COLUMNS(xs))\\n )\\n)\\n\\n\\nTAILCOLS\\n=LAMBDA(xs,\\n IF(1 < COLUMNS(xs),\\n INDEX(\\n xs,\\n 1,\\n SEQUENCE(1, COLUMNS(xs) - 1, 2, 1)\\n ),\\n NA()\\n )\\n)\\n\",\n \"language\": \"Excel\"\n },\n {\n \"code\": \"let isPrefix p (s : string) = s.StartsWith(p)\\nlet getPrefix n (s : string) = s.Substring(0,n)\\n\\nlet repPrefixOf str =\\n let rec isRepeatedPrefix p s =\\n if isPrefix p s then isRepeatedPrefix p (s.Substring (p.Length))\\n else isPrefix s p\\n\\n let rec getLongestRepeatedPrefix n =\\n if n = 0 then None\\n elif isRepeatedPrefix (getPrefix n str) str then Some(getPrefix n str)\\n else getLongestRepeatedPrefix (n-1)\\n\\n getLongestRepeatedPrefix (str.Length/2)\\n\\n[<EntryPoint>]\\nlet main argv =\\n printfn \\\"Testing for rep-string (and showing the longest repeated prefix in case):\\\"\\n [\\n \\\"1001110011\\\"\\n \\\"1110111011\\\"\\n \\\"0010010010\\\"\\n \\\"1010101010\\\"\\n \\\"1111111111\\\"\\n \\\"0100101101\\\"\\n \\\"0100100\\\"\\n \\\"101\\\"\\n \\\"11\\\"\\n \\\"00\\\"\\n \\\"1\\\"\\n ] |>\\n List.map (fun s ->\\n match repPrefixOf s with | None -> s + \\\": NO\\\" | Some(p) -> s + \\\": YES (\\\"+ p + \\\")\\\")\\n |> List.iter (printfn \\\"%s\\\")\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: formatting grouping kernel math math.ranges qw sequences ;\\nIN: rosetta-code.rep-string\\n\\n: (find-rep-string) ( str -- str )\\n dup dup length 2/ [1,b]\\n [ <groups> [ head? ] monotonic? ] with find nip dup\\n [ head ] [ 2drop \\\"N/A\\\" ] if ;\\n\\n: find-rep-string ( str -- str )\\n dup length 1 <= [ drop \\\"N/A\\\" ] [ (find-rep-string) ] if ;\\n\\nqw{ 1001110011 1110111011 0010010010 1010101010 1111111111\\n 0100101101 0100100 101 11 00 1 }\\n\\\"Shortest cycle:\\\\n\\\\n\\\" printf\\n[ dup find-rep-string \\\"%-10s -> %s\\\\n\\\" printf ] each\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": rep-string ( caddr1 u1 -- caddr2 u2 ) \\\\ u2=0: not a rep-string\\n 2dup dup >r r@ 2/ /string\\n begin 2over 2over string-prefix? 0= over r@ < and while -1 /string repeat\\n r> swap - >r 2drop r> ;\\n\\n: test ( caddr u -- )\\n 2dup type .\\\" has \\\"\\n rep-string ?dup 0= if drop .\\\" no \\\" else type .\\\" as \\\" then\\n .\\\" repeating substring\\\" cr ;\\n: tests\\n s\\\" 1001110011\\\" test\\n s\\\" 1110111011\\\" test\\n s\\\" 0010010010\\\" test\\n s\\\" 1010101010\\\" test\\n s\\\" 1111111111\\\" test\\n s\\\" 0100101101\\\" test\\n s\\\" 0100100\\\" test\\n s\\\" 101\\\" test\\n s\\\" 11\\\" test\\n s\\\" 00\\\" test\\n s\\\" 1\\\" test ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"cr tests\\n1001110011 has 10011 as repeating substring\\n1110111011 has 1110 as repeating substring\\n0010010010 has 001 as repeating substring\\n1010101010 has 1010 as repeating substring\\n1111111111 has 11111 as repeating substring\\n0100101101 has no repeating substring\\n0100100 has 010 as repeating substring\\n101 has no repeating substring\\n11 has 1 as repeating substring\\n00 has 0 as repeating substring\\n1 has no repeating substring\\n ok\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"Data \\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\", \\\"1010101010\\\", \\\"1111111111\\\", \\\"0100101101\\\", \\\"0100100\\\", \\\"101\\\", \\\"11\\\", \\\"00\\\", \\\"1\\\", \\\"\\\"\\n\\nFunction rep(c As String, n As Integer) As String\\n Dim As String r\\n\\n For i As Integer = 1 To n\\n r = r + c\\n Next i\\n Return r\\nEnd Function\\n\\nDo\\n Dim As String p, b = \\\"\\\", t, s\\n Read p : If p = \\\"\\\" Then Exit Do\\n Dim As Integer l = Len(p), m = Int(l / 2)\\n\\n For i As Integer = m To 1 Step -1\\n t = Left(p, i)\\n s = rep(t, l / i + 1)\\n If p = Left(s, l) Then b = t : Exit For\\n Next i\\n\\n If b = \\\"\\\" Then\\n Print p; \\\" no es una cadena repetida\\\"\\n Else\\n Print p; \\\" secuencia m s larga: \\\"; b\\n End If\\nLoop\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"strings\\\"\\n)\\n\\nfunc rep(s string) int {\\n for x := len(s) / 2; x > 0; x-- {\\n if strings.HasPrefix(s, s[x:]) {\\n return x\\n }\\n }\\n return 0\\n}\\n\\nconst m = `\\n1001110011\\n1110111011\\n0010010010\\n1010101010\\n1111111111\\n0100101101\\n0100100\\n101\\n11\\n00\\n1`\\n\\nfunc main() {\\n for _, s := range strings.Fields(m) {\\n if n := rep(s); n > 0 {\\n fmt.Printf(\\\"%q %d rep-string %q\\\\n\\\", s, n, s[:n])\\n } else {\\n fmt.Printf(\\\"%q not a rep-string\\\\n\\\", s)\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List (inits, maximumBy)\\nimport Data.Maybe (fromMaybe)\\n\\nrepstring :: String -> Maybe String\\n-- empty strings are not rep strings\\nrepstring [] = Nothing\\n-- strings with only one character are not rep strings\\nrepstring [_] = Nothing\\nrepstring xs\\n | any (`notElem` \\\"01\\\") xs = Nothing\\n | otherwise = longest xs\\n where\\n -- length of the original string\\n lxs = length xs\\n -- half that length\\n lq2 = lxs `quot` 2\\n -- make a string of same length using repetitions of a part\\n -- of the original string, and also return the substring used\\n subrepeat x = (x, take lxs $ concat $ repeat x)\\n -- check if a repeated string matches the original string\\n sndValid (_, ys) = ys == xs\\n -- make all possible strings out of repetitions of parts of\\n -- the original string, which have max. length lq2\\n possible = map subrepeat . take lq2 . tail . inits\\n -- filter only valid possibilities, and return the substrings\\n -- used for building them\\n valid = map fst . filter sndValid . possible\\n -- see which string is longer\\n compLength a b = compare (length a) (length b)\\n -- get the longest substring that, repeated, builds a string\\n -- that matches the original string\\n longest ys = case valid ys of\\n [] -> Nothing\\n zs -> Just $ maximumBy compLength zs\\n\\nmain :: IO ()\\nmain =\\n mapM_ processIO examples\\n where\\n examples =\\n [ \\\"1001110011\\\",\\n \\\"1110111011\\\",\\n \\\"0010010010\\\",\\n \\\"1010101010\\\",\\n \\\"1111111111\\\",\\n \\\"0100101101\\\",\\n \\\"0100100\\\",\\n \\\"101\\\",\\n \\\"11\\\",\\n \\\"00\\\",\\n \\\"1\\\"\\n ]\\n process = fromMaybe \\\"Not a rep string\\\" . repstring\\n processIO xs = do\\n putStr (xs <> \\\": \\\")\\n putStrLn $ process xs\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Bool (bool)\\nimport Data.List (inits, intercalate, transpose)\\n\\n------------------------ REP-CYCLES ----------------------\\n\\nrepCycles :: String -> [String]\\nrepCycles cs =\\n filter\\n ((cs ==) . take n . cycle)\\n ((tail . inits) $ take (quot n 2) cs)\\n where\\n n = length cs\\n\\n--------------------------- TEST -------------------------\\nmain :: IO ()\\nmain =\\n putStrLn $\\n fTable\\n \\\"Longest cycles:\\\\n\\\"\\n id\\n ((flip bool \\\"n/a\\\" . last) <*> null)\\n repCycles\\n [ \\\"1001110011\\\",\\n \\\"1110111011\\\",\\n \\\"0010010010\\\",\\n \\\"1010101010\\\",\\n \\\"1111111111\\\",\\n \\\"0100101101\\\",\\n \\\"0100100\\\",\\n \\\"101\\\",\\n \\\"11\\\",\\n \\\"00\\\",\\n \\\"1\\\"\\n ]\\n\\n------------------------- GENERIC ------------------------\\nfTable ::\\n String ->\\n (a -> String) ->\\n (b -> String) ->\\n (a -> b) ->\\n [a] ->\\n String\\nfTable s xShow fxShow f xs =\\n let rjust n c = drop . length <*> (replicate n c <>)\\n w = maximum (length . xShow <$> xs)\\n in unlines $\\n s :\\n fmap\\n ( ((<>) . rjust w ' ' . xShow)\\n <*> ((\\\" -> \\\" <>) . fxShow . f)\\n )\\n xs\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main(A)\\n every write(s := !A,\\\": \\\",(repString(s) | \\\"Not a rep string!\\\")\\\\1)\\nend\\n\\nprocedure repString(s)\\n rs := s[1+:*s/2]\\n while (*rs > 0) & (s ~== lrepl(rs,*s,rs)) do rs := rs[1:-1]\\n return (*rs > 0, rs)\\nend\\n\\nprocedure lrepl(s1,n,s2) # The standard left() procedure won't work.\\n while *s1 < n do s1 ||:= s2\\n return s1[1+:n]\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"replengths=: >:@i.@<.@-:@#\\nrep=: $@] $ $\\n\\nisRepStr=: +./@((] -: rep)\\\"0 1~ replengths)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" isRepStr '1001110011'\\n1\\n Tests=: noun define\\n1001110011\\n1110111011\\n0010010010\\n1010101010\\n1111111111\\n0100101101\\n0100100\\n101\\n11\\n00\\n1\\n)\\n isRepStr;._2 Tests NB. run all tests\\n1 1 1 1 1 0 1 0 1 1 0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"nRepStr=: 0 -.~ (([ * ] -: rep)\\\"0 1~ replengths)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" \\\":@nRepStr;._2 Tests\\n5\\n4\\n3\\n2 4\\n1 2 3 4 5\\n\\n3\\n\\n1\\n1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class RepString {\\n\\n static final String[] input = {\\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\",\\n \\\"1010101010\\\", \\\"1111111111\\\", \\\"0100101101\\\", \\\"0100100\\\", \\\"101\\\", \\\"11\\\",\\n \\\"00\\\", \\\"1\\\", \\\"0100101\\\"};\\n\\n public static void main(String[] args) {\\n for (String s : input)\\n System.out.printf(\\\"%s : %s%n\\\", s, repString(s));\\n }\\n\\n static String repString(String s) {\\n int len = s.length();\\n outer:\\n for (int part = len / 2; part > 0; part--) {\\n int tail = len % part;\\n if (tail > 0 && !s.substring(0, tail).equals(s.substring(len - tail)))\\n continue;\\n for (int j = 0; j < len / part - 1; j++) {\\n int a = j * part;\\n int b = (j + 1) * part;\\n int c = (j + 2) * part;\\n if (!s.substring(a, b).equals(s.substring(b, c)))\\n continue outer;\\n }\\n return s.substring(0, part);\\n }\\n return \\\"none\\\";\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.List;\\n\\npublic final class RepStrings {\\n\\n\\tpublic static void main(String[] aArgs) {\\n\\t\\tList<String> tests = List.of( \\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\",\\n\\t\\t\\t\\\"1010101010\\\", \\\"1111111111\\\", \\\"0100101101\\\", \\\"0100100\\\", \\\"101\\\", \\\"11\\\", \\\"00\\\", \\\"1\\\" );\\n\\n\\t\\tSystem.out.println(\\\"The longest rep-strings are:\\\");\\n\\t\\tfor ( String test : tests ) {\\n\\t\\t\\tList<String> repeats = repString(test);\\n\\t\\t\\tString result = repeats.isEmpty() ? \\\"Not a rep-string\\\" : repeats.get(repeats.size() - 1);\\n\\t\\t\\tSystem.out.println(String.format(\\\"%10s%s%s\\\", test, \\\" -> \\\", result));\\n\\t\\t}\\n\\t}\\n\\t\\n\\tprivate static List<String> repString(String aText) {\\n\\t\\tList<String> repetitions = new ArrayList<String>();\\n\\t\\t\\n\\t\\tfor ( int length = 1; length <= aText.length() / 2; length++ ) {\\n\\t\\t\\tString possible = aText.substring(0, length);\\n\\t\\t\\tint quotient = aText.length() / length;\\n\\t\\t\\tint remainder = aText.length() % length;\\n\\t\\t\\tString candidate = possible.repeat(quotient) + possible.substring(0, remainder);\\n\\t\\t\\tif ( candidate.equals(aText) ) {\\n\\t\\t\\t\\trepetitions.add(possible);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn repetitions;\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"(() => {\\n 'use strict';\\n\\n const main = () => {\\n\\n // REP-CYCLES -------------------------------------\\n\\n // repCycles :: String -> [String]\\n const repCycles = s => {\\n const n = s.length;\\n return filter(\\n x => s === take(n, cycle(x)).join(''),\\n tail(inits(take(quot(n, 2), s)))\\n );\\n };\\n\\n // TEST -------------------------------------------\\n console.log(fTable(\\n 'Longest cycles:\\\\n',\\n str,\\n xs => 0 < xs.length ? concat(last(xs)) : '(none)',\\n repCycles,\\n [\\n '1001110011',\\n '1110111011',\\n '0010010010',\\n '1010101010',\\n '1111111111',\\n '0100101101',\\n '0100100',\\n '101',\\n '11',\\n '00',\\n '1'\\n ]\\n ));\\n };\\n\\n // GENERIC FUNCTIONS ----------------------------------\\n\\n // concat :: [[a]] -> [a]\\n // concat :: [String] -> String\\n const concat = xs =>\\n 0 < xs.length ? (() => {\\n const unit = 'string' !== typeof xs[0] ? (\\n []\\n ) : '';\\n return unit.concat.apply(unit, xs);\\n })() : [];\\n\\n // cycle :: [a] -> Generator [a]\\n function* cycle(xs) {\\n const lng = xs.length;\\n let i = 0;\\n while (true) {\\n yield(xs[i])\\n i = (1 + i) % lng;\\n }\\n }\\n\\n // filter :: (a -> Bool) -> [a] -> [a]\\n const filter = (f, xs) => xs.filter(f);\\n\\n // fTable :: String -> (a -> String) ->\\n // (b -> String) -> (a -> b) -> [a] -> String\\n const fTable = (s, xShow, fxShow, f, xs) => {\\n // Heading -> x display function ->\\n // fx display function ->\\n // f -> values -> tabular string\\n const\\n ys = xs.map(xShow),\\n w = Math.max(...ys.map(length));\\n return s + '\\\\n' + zipWith(\\n (a, b) => a.padStart(w, ' ') + ' -> ' + b,\\n ys,\\n xs.map(x => fxShow(f(x)))\\n ).join('\\\\n');\\n };\\n\\n // inits([1, 2, 3]) -> [[], [1], [1, 2], [1, 2, 3]\\n // inits('abc') -> [\\\"\\\", \\\"a\\\", \\\"ab\\\", \\\"abc\\\"]\\n\\n // inits :: [a] -> [[a]]\\n // inits :: String -> [String]\\n const inits = xs => [\\n []\\n ]\\n .concat(('string' === typeof xs ? xs.split('') : xs)\\n .map((_, i, lst) => lst.slice(0, 1 + i)));\\n\\n // last :: [a] -> a\\n const last = xs =>\\n 0 < xs.length ? xs.slice(-1)[0] : undefined;\\n\\n // Returns Infinity over objects without finite length.\\n // This enables zip and zipWith to choose the shorter\\n // argument when one is non-finite, like cycle, repeat etc\\n\\n // length :: [a] -> Int\\n const length = xs =>\\n (Array.isArray(xs) || 'string' === typeof xs) ? (\\n xs.length\\n ) : Infinity;\\n\\n // quot :: Int -> Int -> Int\\n const quot = (n, m) => Math.floor(n / m);\\n\\n // str :: a -> String\\n const str = x => x.toString();\\n\\n // tail :: [a] -> [a]\\n const tail = xs => 0 < xs.length ? xs.slice(1) : [];\\n\\n // take :: Int -> [a] -> [a]\\n // take :: Int -> String -> String\\n const take = (n, xs) =>\\n 'GeneratorFunction' !== xs.constructor.constructor.name ? (\\n xs.slice(0, n)\\n ) : [].concat.apply([], Array.from({\\n length: n\\n }, () => {\\n const x = xs.next();\\n return x.done ? [] : [x.value];\\n }));\\n\\n // unlines :: [String] -> String\\n const unlines = xs => xs.join('\\\\n');\\n\\n // Use of `take` and `length` here allows zipping with non-finite lists\\n // i.e. generators like cycle, repeat, iterate.\\n\\n // zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\\n const zipWith = (f, xs, ys) => {\\n const\\n lng = Math.min(length(xs), length(ys)),\\n as = take(lng, xs),\\n bs = take(lng, ys);\\n return Array.from({\\n length: lng\\n }, (_, i) => f(as[i], bs[i], i));\\n };\\n\\n // MAIN ---\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def is_rep_string:\\n # if self is a rep-string then return [n, prefix]\\n # where n is the number of full occurrences of prefix\\n def _check(prefix; n; sofar):\\n length as $length\\n | if length <= (sofar|length) then [n, prefix]\\n else (sofar+prefix) as $sofar\\n | if startswith($sofar) then _check(prefix; n+1; $sofar)\\n elif ($sofar|length) > $length and\\n startswith($sofar[0:$length]) then [n, prefix]\\n else [0, prefix]\\n end\\n end\\n ;\\n\\n [range (1; length/2 + 1) as $i\\n | .[0:$i] as $prefix\\n | _check($prefix; 1; $prefix)\\n | select( .[0] > 1 ) ]\\n ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def test:\\n (\\n \\\"1001110011\\\",\\n \\\"1110111011\\\",\\n \\\"0010010010\\\",\\n \\\"1010101010\\\",\\n \\\"1111111111\\\",\\n \\\"0100101101\\\",\\n \\\"0100100\\\",\\n \\\"101\\\",\\n \\\"11\\\",\\n \\\"00\\\",\\n \\\"1\\\"\\n ) | { (.) : is_rep_string }\\n;\\n\\ntest\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \" $ jq -n -c -f rep-string.jq\\n {\\\"1001110011\\\":[[2,\\\"10011\\\"]]}\\n {\\\"1110111011\\\":[[2,\\\"1110\\\"]]}\\n {\\\"0010010010\\\":[[3,\\\"001\\\"]]}\\n {\\\"1010101010\\\":[[5,\\\"10\\\"],[2,\\\"1010\\\"]]}\\n {\\\"1111111111\\\":[[10,\\\"1\\\"],[5,\\\"11\\\"],[3,\\\"111\\\"],[2,\\\"1111\\\"],[2,\\\"11111\\\"]]}\\n {\\\"0100101101\\\":[]}\\n {\\\"0100100\\\":[[2,\\\"010\\\"]]}\\n {\\\"101\\\":[]}\\n {\\\"11\\\":[[2,\\\"1\\\"]]}\\n {\\\"00\\\":[[2,\\\"0\\\"]]}\\n {\\\"1\\\":[]}\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function repstring(r::AbstractString)\\n n = length(r)\\n replst = String[]\\n for m in 1:n÷2\\n s = r[1:chr2ind(r, m)]\\n if (s ^ cld(n, m))[1:chr2ind(r, n)] != r continue end\\n push!(replst, s)\\n end\\n return replst\\nend\\n\\ntests = [\\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\", \\\"1010101010\\\", \\\"1111111111\\\",\\n \\\"0100101101\\\", \\\"0100100\\\", \\\"101\\\", \\\"11\\\", \\\"00\\\", \\\"1\\\",\\n \\\"\\\\u2200\\\\u2203\\\\u2200\\\\u2203\\\\u2200\\\\u2203\\\\u2200\\\\u2203\\\"]\\n\\nfor r in tests\\n replst = repstring(r)\\n if isempty(replst)\\n println(\\\"$r is not a rep-string.\\\")\\n else\\n println(\\\"$r is a rep-string of \\\", join(replst, \\\", \\\"), \\\".\\\")\\n end\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nfun repString(s: String): MutableList<String> {\\n val reps = mutableListOf<String>()\\n if (s.length < 2) return reps\\n for (c in s) if (c != '0' && c != '1') throw IllegalArgumentException(\\\"Not a binary string\\\")\\n for (len in 1..s.length / 2) {\\n val t = s.take(len)\\n val n = s.length / len\\n val r = s.length % len\\n val u = t.repeat(n) + t.take(r)\\n if (u == s) reps.add(t)\\n }\\n return reps\\n}\\n\\nfun main(args: Array<String>) {\\n val strings = listOf(\\n \\\"1001110011\\\",\\n \\\"1110111011\\\",\\n \\\"0010010010\\\",\\n \\\"1010101010\\\",\\n \\\"1111111111\\\",\\n \\\"0100101101\\\",\\n \\\"0100100\\\",\\n \\\"101\\\",\\n \\\"11\\\",\\n \\\"00\\\",\\n \\\"1\\\"\\n )\\n println(\\\"The (longest) rep-strings are:\\\\n\\\")\\n for (s in strings) {\\n val reps = repString(s)\\n val size = reps.size\\n println(\\\"${s.padStart(10)} -> ${if (size > 0) reps[size - 1] else \\\"Not a rep-string\\\"}\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"(defun get-reps (text)\\n (lists:filtermap\\n (lambda (x)\\n (case (get-rep text (lists:split x text))\\n ('() 'false)\\n (x `#(true ,x))))\\n (lists:seq 1 (div (length text) 2))))\\n\\n(defun get-rep\\n ((text `#(,head ,tail))\\n (case (string:str text tail)\\n (1 head)\\n (_ '()))))\\n\",\n \"language\": \"LFE\"\n },\n {\n \"code\": \"(defun report\\n ((`#(,text ()))\\n (io:format \\\"~p has no repeating characters.~n\\\" `(,text)))\\n ((`#(,text (,head . ,_)))\\n (io:format \\\"~p repeats ~p every ~p character(s).~n\\\" `(,text ,head ,(length head))))\\n ((data)\\n (lists:map\\n #'report/1\\n (lists:zip data (lists:map #'get-reps/1 data)))\\n 'ok))\\n\",\n \"language\": \"LFE\"\n },\n {\n \"code\": \"repstr? := proc( s :: string )\\n local per := StringTools:-Period( s );\\n if 2 * per <= length( s ) then\\n true, s[ 1 .. per ]\\n else\\n false, \\\"\\\"\\n end if\\nend proc:\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"> Test := [\\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\", \\\"1010101010\\\", \\\"1111111111\\\", \\\\\\n \\\"0100101101\\\", \\\"0100100\\\", \\\"101\\\", \\\"11\\\", \\\"00\\\", \\\"1\\\"]:\\n> for s in Test do\\n> printf( \\\"%*s\\\\t%5s %s\\\\n\\\", 3 + max(map(length,Test)), s, repstr?( s ) )\\n> end do:\\n 1001110011 true 10011\\n 1110111011 true 1110\\n 0010010010 true 001\\n 1010101010 true 10\\n 1111111111 true 1\\n 0100101101 false\\n 0100100 true 010\\n 101 false\\n 11 true 1\\n 00 true 0\\n 1 false\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"RepStringQ[strin_String]:=StringCases[strin,StartOfString~~Repeated[x__,{2,\\\\[Infinity]}]~~y___~~EndOfString/;StringMatchQ[x,StartOfString~~y~~___]:>x, Overlaps -> All]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"str={\\\"1001110011\\\",\\\"1110111011\\\",\\\"0010010010\\\",\\\"1010101010\\\",\\\"1111111111\\\",\\\"0100101101\\\",\\\"0100100\\\",\\\"101\\\",\\\"11\\\",\\\"00\\\",\\\"1\\\"};\\n{#,RepStringQ[#]}&/@str//Grid\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"main :: [sys_message]\\nmain = [Stdout (lay (map test tests))]\\n\\ntest :: [char]->[char]\\ntest s = s ++ \\\": \\\" ++ show (repstrings s)\\n\\ntests :: [[char]]\\ntests = [\\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\", \\\"1010101010\\\",\\n \\\"1111111111\\\", \\\"0100101101\\\", \\\"0100100\\\", \\\"101\\\", \\\"11\\\", \\\"00\\\",\\n \\\"1\\\"]\\n\\nrepstrings :: [*]->[[*]]\\nrepstrings s = filter matching bases\\n where bases = [take n s | n<-[1..#s div 2]]\\n matching r = s = take (#s) (concat (repeat r))\\n\",\n \"language\": \"Miranda\"\n },\n {\n \"code\": \"MODULE RepStrings;\\nFROM InOut IMPORT Write, WriteString, WriteLn, WriteCard;\\nFROM Strings IMPORT Copy, Length;\\n\\n(* Find the length of the longest rep-string given a string.\\n If there is no rep-string, the result is 0. *)\\nPROCEDURE repLength(s: ARRAY OF CHAR): CARDINAL;\\n VAR strlen, replen, i, j: CARDINAL;\\n ok: BOOLEAN;\\nBEGIN\\n strlen := Length(s);\\n FOR replen := strlen DIV 2 TO 1 BY -1 DO\\n ok := TRUE;\\n i := 0;\\n WHILE ok AND (i < replen) DO\\n j := i + replen;\\n WHILE (i+j < strlen) AND (s[i] = s[j]) DO\\n j := j + replen;\\n END;\\n ok := ok AND (i+j >= strlen);\\n INC(i);\\n END;\\n IF ok THEN RETURN replen; END;\\n END;\\n RETURN 0;\\nEND repLength;\\n\\n(* Store the longest rep-string in the given buffer. *)\\nPROCEDURE repString(in: ARRAY OF CHAR; VAR out: ARRAY OF CHAR);\\n VAR len: CARDINAL;\\nBEGIN\\n len := repLength(in);\\n Copy(in, 0, len, out);\\n out[len] := CHR(0);\\nEND repString;\\n\\n(* Display the longest rep-string given a string *)\\nPROCEDURE rep(s: ARRAY OF CHAR);\\n VAR buf: ARRAY [0..63] OF CHAR;\\nBEGIN\\n WriteString(s);\\n WriteString(\\\": \\\");\\n repString(s, buf);\\n WriteString(buf);\\n WriteLn();\\nEND rep;\\n\\n(* Test cases *)\\nBEGIN\\n rep(\\\"1001110011\\\");\\n rep(\\\"1110111011\\\");\\n rep(\\\"0010010010\\\");\\n rep(\\\"1010101010\\\");\\n rep(\\\"1111111111\\\");\\n rep(\\\"0100101101\\\");\\n rep(\\\"0100100\\\");\\n rep(\\\"101\\\");\\n rep(\\\"11\\\");\\n rep(\\\"00\\\");\\n rep(\\\"1\\\");\\nEND RepStrings.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary\\n\\n/* REXX ***************************************************************\\n* 11.05.2013 Walter Pachl\\n**********************************************************************/\\nrunSample(arg)\\nreturn\\n\\n/**\\n * Test for rep-strings\\n * @param s_str a string to check for rep-strings\\n * @return Rexx string: boolean indication of reps, length, repeated value\\n */\\nmethod repstring(s_str) public static\\n s_str_n = s_str.length()\\n rep_str = ''\\n Loop lx = s_str.length() % 2 to 1 By -1\\n If s_str.substr(lx + 1, lx) = s_str.left(lx) Then Leave lx\\n End lx\\n If lx > 0 Then Do label reps\\n rep_str = s_str.left(lx)\\n Loop ix = 1 By 1\\n If s_str.substr(ix * lx + 1, lx) <> rep_str Then\\n Leave ix\\n End ix\\n If rep_str.copies(s_str_n).left(s_str.length()) <> s_str Then\\n rep_str = ''\\n End reps\\n Return (rep_str.length() > 0) rep_str.length() rep_str\\n\\n-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\nmethod runSample(arg) public static\\n parse arg samples\\n if samples = '' then -\\n samples = -\\n '1001110011' -\\n '1110111011' -\\n '0010010010' -\\n '1010101010' -\\n '1111111111' -\\n '0100101101' -\\n '0100100' -\\n '101' -\\n '11' -\\n '00' -\\n '1'\\n\\n loop w_ = 1 to samples.words()\\n in_str = samples.word(w_)\\n parse repstring(in_str) is_rep_str rep_str_len rep_str\\n\\n sq = ''''in_str''''\\n tstrlen = sq.length().max(20)\\n sq=sq.right(tstrlen)\\n if is_rep_str then\\n Say sq 'has a repetition length of' rep_str_len \\\"i.e. '\\\"rep_str\\\"'\\\"\\n else\\n Say sq 'is not a repeated string'\\n end w_\\n return\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"tests = [\\n\\t'1001110011'\\n\\t'1110111011'\\n\\t'0010010010'\\n\\t'1010101010'\\n\\t'1111111111'\\n\\t'0100101101'\\n\\t'0100100'\\n\\t'101'\\n\\t'11'\\n\\t'00'\\n\\t'1'\\n]\\n\\nF is_repeated(s:Str) (s.len()/2..0).first(F(x) s.starts_with(s[x..null]))\\n\\n{\\n\\ttests.each(F(test) {\\n\\t\\tlocal r = is_repeated(test)\\n\\t\\techo(\\\"${test} ${if r \\\"has repetition of length ${r} (i.e. ${test[0..r]})\\\" \\\"is not a rep-string\\\"}\\\")\\n\\t})\\n}\\n\",\n \"language\": \"NGS\"\n },\n {\n \"code\": \"import strutils\\n\\nproc isRepeated(text: string): int =\\n for x in countdown(text.len div 2, 0):\\n if text.startsWith(text[x..text.high]): return x\\n\\nconst matchstr = \\\"\\\"\\\"1001110011\\n1110111011\\n0010010010\\n1010101010\\n1111111111\\n0100101101\\n0100100\\n101\\n11\\n00\\n1\\\"\\\"\\\"\\n\\nfor line in matchstr.split():\\n let ln = isRepeated(line)\\n echo \\\"'\\\", line, \\\"' has a repetition length of \\\", ln, \\\" i.e \\\",\\n (if ln > 0: \\\"'\\\" & line[0 ..< ln] & \\\"'\\\" else: \\\"*not* a rep-string\\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"class RepString {\\n function : Main(args : String[]) ~ Nil {\\n strings := [\\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\", \\\"1111111111\\\",\\n \\\"0100101101\\\", \\\"0100100\\\", \\\"101\\\", \\\"11\\\", \\\"00\\\", \\\"1\\\"];\\n each(i : strings) {\\n string := strings[i];\\n repstring := RepString(string);\\n if(repstring->Size() > 0) {\\n \\\"\\\\\\\"{$string}\\\\\\\" = rep-string \\\\\\\"{$repstring}\\\\\\\"\\\"->PrintLine();\\n }\\n else {\\n \\\"\\\\\\\"{$string}\\\\\\\" = not a rep-string\\\"->PrintLine();\\n };\\n };\\n }\\n\\n function : RepString(string : String) ~ String {\\n offset := string->Size() / 2;\\n\\n while(offset > 0) {\\n left := string->SubString(offset);\\n right := string->SubString(left->Size(),left->Size());\\n if(left->Equals(right)) {\\n if(ValidateMatch(left, string)) {\\n return left;\\n }\\n else {\\n return \\\"\\\";\\n };\\n };\\n\\n offset--;\\n };\\n\\n return \\\"\\\";\\n }\\n\\n function : ValidateMatch(left : String, string : String) ~ Bool {\\n parts := string->Size() / left->Size();\\n tail := string->Size() % left->Size() <> 0;\\n\\n for(i := 1; i < parts; i+=1;) {\\n offset := i * left->Size();\\n right := string->SubString(offset, left->Size());\\n if(<>left->Equals(right)) {\\n return false;\\n };\\n };\\n\\n if(tail) {\\n offset := parts * left->Size();\\n right := string->SubString(offset, string->Size() - offset);\\n each(i : right) {\\n if(left->Get(i) <> right->Get(i)) {\\n return false;\\n };\\n };\\n };\\n\\n return true;\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \": repString(s)\\n| sz i |\\n s size dup ->sz 2 / 1 -1 step: i [\\n s left(sz i - ) s right(sz i -) == ifTrue: [ s left(i) return ]\\n ]\\n null ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"rep(v)=for(i=1,#v\\\\2,for(j=i+1,#v,if(v[j]!=v[j-i],next(2)));return(i));0;\\nv=[\\\"1001110011\\\",\\\"1110111011\\\",\\\"0010010010\\\",\\\"1010101010\\\",\\\"1111111111\\\",\\\"0100101101\\\",\\\"0100100\\\",\\\"101\\\",\\\"11\\\",\\\"00\\\",\\\"1\\\"];\\nfor(i=1,#v,print(v[i]\\\" \\\"rep(Vec(v[i]))))\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"foreach (qw(1001110011 1110111011 0010010010 1010101010 1111111111 0100101101 0100100 101 11 00 1)) {\\n print \\\"$_\\\\n\\\";\\n if (/^(.+)\\\\1+(.*$)(?(?{ substr($1, 0, length $2) eq $2 })|(?!))/) {\\n print ' ' x length $1, \\\"$1\\\\n\\\\n\\\";\\n } else {\\n print \\\" (no repeat)\\\\n\\\\n\\\";\\n }\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">list_reps</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">replist</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">)+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">)[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">replist</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">replist</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">replist</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">tests</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"1001110011\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"1110111011\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"0010010010\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"1010101010\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"1111111111\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"0100101101\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"0100100\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"101\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"11\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"00\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"1\\\"</span><span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tests</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">tests</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]})</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">replist</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">list_reps</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tests</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">replist</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"not a rep-string.\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">replist</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">rj</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">replist</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #7060A8;\\\">pad</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">' '</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rj</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">pad</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rj</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\ndef repstr /# s n -- s #/\\n \\\"\\\" swap\\n for drop\\n over chain\\n endfor\\n nip\\nenddef\\n\\n\\ndef repString /# s -- s #/\\n len dup var sz\\n 2 / 1 swap 2 tolist for\\n var i\\n 1 i slice var chunk\\n chunk sz i / 1 + repstr\\n 1 sz slice nip over\\n == if chunk exitfor endif\\n endfor\\n len sz == sz 1 == or if \\\": No repeat string\\\" chain else \\\": \\\" swap chain chain endif\\nenddef\\n\\n( \\\"1001110011\\\" \\\"1110111011\\\" \\\"0010010010\\\" \\\"1010101010\\\" \\\"1111111111\\\" \\\"0100101101\\\" \\\"0100100\\\" \\\"101\\\" \\\"11\\\" \\\"00\\\" \\\"1\\\" )\\n\\nlen for\\n get repString print nl\\nendfor\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"go =>\\n Strings = [\\n \\\"1001110011\\\", % 10011\\n \\\"1110111011\\\", % 1110\\n \\\"0010010010\\\", % 001\\n \\\"1010101010\\\", % 1010\\n \\\"1111111111\\\", % 11111\\n \\\"0100101101\\\", % no solution\\n \\\"0100100\\\", % 010\\n \\\"101\\\", % no solution\\n \\\"11\\\", % 1\\n \\\"00\\\", % 0\\n \\\"1\\\", % no solution\\n \\\"\\\", % no solution\\n \\\"123123123123123\\\", % 123123\\n \\\"12312312312312\\\", % 123123\\n \\\"123123123123124\\\", % no solution\\n \\\"abcabcdabcabcdabc\\\", % abcabcd\\n [1,2,3,4,1,2,3,4,1,2,3] % 1,2,3,4\\n\\n ],\\n foreach(S in Strings)\\n printf(\\\"%w: \\\", S),\\n if maxrep(S,Substr,N) then\\n println([substr=Substr,n=N])\\n else\\n println(\\\"no solution\\\")\\n end\\n end,\\n nl.\\n\\n% the largest repeating substring\\nmaxrep(S,Substr,N) =>\\n maxof(rep(S,Substr,N),N).\\n\\nrep(S,Substr,N) =>\\n between(1,S.length div 2, N),\\n Len = S.length,\\n Len2 = Len - (Len mod N),\\n Substr = slice(S,1,N),\\n % count the number of proper slices\\n SS = [1 : I in 1..N..Len2, slice(S,I,I+N-1) = Substr],\\n SS.length = Len div N,\\n % the last (truncated) slice (or []) must be a substring of Substr\\n Rest = slice(S,Len2+1,Len),\\n find(Substr,Rest,1,_).\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de repString (Str)\\n (let Lst (chop Str)\\n (for (N (/ (length Lst) 2) (gt0 N) (dec N))\\n (T\\n (use (Lst X)\\n (let H (cut N 'Lst)\\n (loop\\n (setq X (cut N 'Lst))\\n (NIL (head X H))\\n (NIL Lst T) ) ) )\\n N ) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"(test 5 (repString \\\"1001110011\\\"))\\n(test 4 (repString \\\"1110111011\\\"))\\n(test 3 (repString \\\"0010010010\\\"))\\n(test 4 (repString \\\"1010101010\\\"))\\n(test 5 (repString \\\"1111111111\\\"))\\n(test NIL (repString \\\"0100101101\\\"))\\n(test 3 (repString \\\"0100100\\\"))\\n(test NIL (repString \\\"101\\\"))\\n(test 1 (repString \\\"11\\\"))\\n(test 1 (repString \\\"00\\\"))\\n(test NIL (repString \\\"1\\\"))\\n(test NIL (repString \\\"0100101\\\"))\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"rep: procedure options (main); /* 5 May 2015 */\\n declare s bit (10) varying;\\n declare (i, k) fixed binary;\\n\\nmain_loop:\\n do s = '1001110011'b, '1110111011'b, '0010010010'b, '1010101010'b,\\n '1111111111'b, '0100101101'b, '0100100'b, '101'b, '11'b, '00'b, '1'b;\\n k = length(s);\\n do i = k/2 to 1 by -1;\\n if substr(s, 1, i) = substr(s, i+1, i) then\\n do;\\n put skip edit (s, ' is a rep-string containing ', substr(s, 1, i) ) (a);\\n iterate main_loop;\\n end;\\n end;\\n put skip edit (s, ' is not a rep-string') (a);\\n end;\\n\\nend rep;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"100H:\\n\\n DECLARE MAX$REP LITERALLY '32';\\n DECLARE FALSE LITERALLY '0';\\n DECLARE TRUE LITERALLY '1';\\n DECLARE CR LITERALLY '0DH';\\n DECLARE LF LITERALLY '0AH';\\n\\n /* CP/M BDOS SYSTEM CALL */\\n BDOS: PROCEDURE( FN, ARG ); DECLARE FN BYTE, ARG ADDRESS; GOTO 5; END;\\n /* PRINTS A BYTE AS A CHARACTER */\\n PRINT$CHAR: PROCEDURE( CH ); DECLARE CH BYTE; CALL BDOS( 2, CH ); END;\\n /* PRINTS A $ TERMINATED STRING */\\n PRINT$STRING: PROCEDURE( S ); DECLARE S ADDRESS; CALL BDOS( 9, S ); END;\\n\\n /* PRINTS A BYTE AS A NUMBER */\\n PRINT$BYTE: PROCEDURE( N );\\n DECLARE N BYTE;\\n DECLARE ( V, D2, D3 ) BYTE;\\n V = N;\\n D3 = V MOD 10;\\n IF ( V := V / 10 ) <> 0 THEN DO;\\n D2 = V MOD 10;\\n IF ( V := V / 10 ) <> 0 THEN CALL PRINT$CHAR( '0' + V );\\n CALL PRINT$CHAR( '0' + D2 );\\n END;\\n CALL PRINT$CHAR( '0' + D3 );\\n END PRINT$BYTE;\\n /* PRINTS A FIXED LENGTH STRING */\\n PRINT$SUBSTRING: PROCEDURE( S$PTR, LEN );\\n DECLARE S$PTR ADDRESS, LEN BYTE, S BASED S$PTR ( MAX$REP )BYTE;\\n DECLARE S$POS BYTE;\\n DO S$POS = 0 TO LEN - 1;\\n CALL PRINT$CHAR( S( S$POS ) );\\n END;\\n END PRINT$SUBSTRING;\\n\\n /* RETURNS THE LENGTH OF A $ TERMINATED STRING */\\n STR$LENGTH: PROCEDURE( S$PTR )BYTE;\\n DECLARE S$PTR ADDRESS, S BASED S$PTR ( MAX$REP )BYTE;\\n DECLARE RESULT BYTE;\\n RESULT = 0;\\n DO WHILE( S( RESULT ) <> '$' );\\n RESULT = RESULT + 1;\\n END;\\n RETURN RESULT;\\n END STR$LENGTH;\\n\\n /* RETURNS THE LENGTH OF THE LONGEST REP-STRING IN S$PTR, */\\n LONGEST$REP$STRING: PROCEDURE( S$PTR )BYTE;\\n DECLARE S$PTR ADDRESS, S BASED S$PTR ( MAX$REP )BYTE;\\n DECLARE ( S$LEN, RESULT, S$POS, R$POS, I, FOUND ) BYTE;\\n RESULT = 0;\\n FOUND = FALSE;\\n S$LEN = STR$LENGTH( S$PTR );\\n S$POS = ( S$LEN / 2 ) - 1; /* IF ( S$LEN / 2 ) = 0, S$POS WILL BE 255 */\\n DO WHILE( NOT FOUND AND S$POS < 255 ); /* AS BYTE/ADDRESS ARE UNSIGNED */\\n /* CHECK THE POTENTIAL REP-STRING REPEATED A SUFFICIENT NUMBER */\\n /* OF TIMES (TRUNCATED IF NECESSARY) EQUALS THE ORIGINAL STRING */\\n FOUND = TRUE;\\n R$POS = S$POS + 1;\\n DO WHILE( FOUND AND R$POS < S$LEN AND FOUND );\\n I = 0;\\n DO WHILE( I <= S$POS AND R$POS < S$LEN AND FOUND );\\n FOUND = S( R$POS ) = S( I );\\n R$POS = R$POS + 1;\\n I = I + 1;\\n END;\\n END;\\n IF NOT FOUND THEN DO;\\n /* HAVEN'T FOUND A REP-STRING, TRY A SHORTER ONE */\\n S$POS = S$POS - 1; /* S$POS WILL BECOME 255 IF S$POS = 0 */\\n END;\\n END;\\n IF FOUND THEN DO;\\n RESULT = S$POS + 1;\\n END;\\n RETURN RESULT;\\n END LONGEST$REP$STRING;\\n\\n DECLARE ( TEST$NUMBER, REP$STRING$LEN ) BYTE;\\n DECLARE TESTS ( 11 )ADDRESS;\\n TESTS( 0 ) = .'1001110011$';\\n TESTS( 1 ) = .'1110111011$';\\n TESTS( 2 ) = .'0010010010$';\\n TESTS( 3 ) = .'1010101010$';\\n TESTS( 4 ) = .'1111111111$';\\n TESTS( 5 ) = .'0100101101$';\\n TESTS( 6 ) = .'0100100$';\\n TESTS( 7 ) = .'101$';\\n TESTS( 8 ) = .'11$';\\n TESTS( 9 ) = .'00$';\\n TESTS( 10 ) = .'1$';\\n\\n DO TEST$NUMBER = 0 TO LAST( TESTS );\\n REP$STRING$LEN = LONGEST$REP$STRING( TESTS( TEST$NUMBER ) );\\n CALL PRINT$STRING( TESTS( TEST$NUMBER ) );\\n IF REP$STRING$LEN = 0 THEN DO;\\n CALL PRINT$STRING( .': NO REP STRING$' );\\n END;\\n ELSE DO;\\n CALL PRINT$STRING( .': LONGEST REP STRING: $' );\\n CALL PRINT$SUBSTRING( TESTS( TEST$NUMBER ), REP$STRING$LEN );\\n END;\\n CALL PRINT$STRING( .( CR, LF, '$' ) );\\n END;\\nEOF\\n\",\n \"language\": \"PL-M\"\n },\n {\n \"code\": \":- use_module(library(func)).\\n\\n%% Implementation logic:\\n\\ntest_for_repstring(String, (String, Result, Reps)) :-\\n ( setof(Rep, repstring(String, Rep), Reps)\\n -> Result = 'no repstring'\\n ; Result = 'repstrings', Reps = []\\n ).\\n\\nrepstring(Codes, R) :-\\n RepLength = between(1) of (_//2) of length $ Codes,\\n length(R, RepLength),\\n phrase( (rep(R), prefix(~,R)),\\n Codes).\\n\\nrep(X) --> X, X.\\nrep(X) --> X, rep(X).\\n\\n\\n%% Demonstration output:\\n\\ntest_strings([`1001110011`, `1110111011`, `0010010010`, `1010101010`,\\n `1111111111`, `0100101101`, `0100100`, `101`, `11`, `00`, `1`]).\\n\\nreport_repstring((S,Result,Reps)):-\\n format('~s -- ~w: ', [S, Result]),\\n foreach(member(R, Reps), format('~s, ', [R])), nl.\\n\\nreport_repstrings :-\\n Results = maplist(test_for_repstring) $ test_strings(~),\\n maplist(report_repstring, Results).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"a$=\\\"1001110011\\\"+#CRLF$+\\\"1110111011\\\"+#CRLF$+\\\"0010010010\\\"+#CRLF$+\\\"1010101010\\\"+#CRLF$+\\\"1111111111\\\"+#CRLF$+\\n \\\"0100101101\\\"+#CRLF$+\\\"0100100\\\" +#CRLF$+\\\"101\\\" +#CRLF$+\\\"11\\\" +#CRLF$+\\\"00\\\" +#CRLF$+\\n \\\"1\\\" +#CRLF$\\n\\nOpenConsole()\\n\\nProcedure isRepStr(s1$,s2$)\\n If Int(Len(s1$)/Len(s2$))>=2 : ProcedureReturn isRepStr(s1$,s2$+s2$) : EndIf\\n If Len(s1$)>Len(s2$) : ProcedureReturn isRepStr(s1$,s2$+Left(s2$,Len(s1$)%Len(s2$))) : EndIf\\n If s1$=s2$ : ProcedureReturn #True : Else : ProcedureReturn #False : EndIf\\nEndProcedure\\n\\nFor k=1 To CountString(a$,#CRLF$)\\n s1$=StringField(a$,k,#CRLF$) : s2$=Left(s1$,Len(s1$)/2)\\n While Len(s2$)\\n r=isRepStr(s1$,s2$)\\n If Not r : s2$=Left(s2$,Len(s2$)-1) : Else : Break : EndIf\\n Wend\\n If Len(s2$) And r : PrintN(LSet(s1$,15,Chr(32))+#TAB$+\\\"longest sequence: \\\"+s2$) : EndIf\\n If Not Len(s2$) : PrintN(LSet(s1$,15,Chr(32))+#TAB$+\\\"found nothing.\\\") : EndIf\\nNext\\nInput()\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"def is_repeated(text):\\n 'check if the first part of the string is repeated throughout the string'\\n for x in range(len(text)//2, 0, -1):\\n if text.startswith(text[x:]): return x\\n return 0\\n\\nmatchstr = \\\"\\\"\\\"\\\\\\n1001110011\\n1110111011\\n0010010010\\n1010101010\\n1111111111\\n0100101101\\n0100100\\n101\\n11\\n00\\n1\\n\\\"\\\"\\\"\\nfor line in matchstr.split():\\n ln = is_repeated(line)\\n print('%r has a repetition length of %i i.e. %s'\\n % (line, ln, repr(line[:ln]) if ln else '*not* a rep-string'))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \">>> def reps(text):\\n return [text[:x] for x in range(1, 1 + len(text) // 2)\\n if text.startswith(text[x:])]\\n\\n>>> matchstr = \\\"\\\"\\\"\\\\\\n1001110011\\n1110111011\\n0010010010\\n1010101010\\n1111111111\\n0100101101\\n0100100\\n101\\n11\\n00\\n1\\n\\\"\\\"\\\"\\n>>> print('\\\\n'.join('%r has reps %r' % (line, reps(line)) for line in matchstr.split()))\\n'1001110011' has reps ['10011']\\n'1110111011' has reps ['1110']\\n'0010010010' has reps ['001']\\n'1010101010' has reps ['10', '1010']\\n'1111111111' has reps ['1', '11', '111', '1111', '11111']\\n'0100101101' has reps []\\n'0100100' has reps ['010']\\n'101' has reps []\\n'11' has reps ['1']\\n'00' has reps ['0']\\n'1' has reps []\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Rep-strings'''\\n\\nfrom itertools import (accumulate, chain, cycle, islice)\\n\\n\\n# repCycles :: String -> [String]\\ndef repCycles(s):\\n '''Repeated sequences of characters in s.'''\\n n = len(s)\\n cs = list(s)\\n\\n return [\\n x for x in\\n tail(inits(take(n // 2)(s)))\\n if cs == take(n)(cycle(x))\\n ]\\n\\n\\n# TEST ----------------------------------------------------\\n# main :: IO ()\\ndef main():\\n '''Tests - longest cycle (if any) in each string.'''\\n print(\\n fTable('Longest cycles:\\\\n')(repr)(\\n lambda xs: ''.join(xs[-1]) if xs else '(none)'\\n )(repCycles)([\\n '1001110011',\\n '1110111011',\\n '0010010010',\\n '1010101010',\\n '1111111111',\\n '0100101101',\\n '0100100',\\n '101',\\n '11',\\n '00',\\n '1',\\n ])\\n )\\n\\n\\n# GENERIC -------------------------------------------------\\n\\n# inits :: [a] -> [[a]]\\ndef inits(xs):\\n '''all initial segments of xs, shortest first.'''\\n return accumulate(chain([[]], xs), lambda a, x: a + [x])\\n\\n\\n# tail :: [a] -> [a]\\n# tail :: Gen [a] -> [a]\\ndef tail(xs):\\n '''The elements following the head of a\\n (non-empty) list or generator stream.'''\\n if isinstance(xs, list):\\n return xs[1:]\\n else:\\n list(islice(xs, 1)) # First item dropped.\\n return xs\\n\\n\\n# take :: Int -> [a] -> [a]\\n# take :: Int -> String -> String\\ndef take(n):\\n '''The prefix of xs of length n,\\n or xs itself if n > length xs.'''\\n return lambda xs: (\\n xs[0:n]\\n if isinstance(xs, (list, tuple))\\n else list(islice(xs, n))\\n )\\n\\n\\n# OUTPUT FORMATTING ---------------------------------------\\n\\n# fTable :: String -> (a -> String) ->\\n# (b -> String) -> (a -> b) -> [a] -> String\\ndef fTable(s):\\n '''Heading -> x display function ->\\n fx display function ->\\n f -> value list -> tabular string.\\n '''\\n def go(xShow, fxShow, f, xs):\\n ys = [xShow(x) for x in xs]\\n w = max(map(len, ys))\\n return s + '\\\\n' + '\\\\n'.join(map(\\n lambda x, y: y.rjust(w, ' ') + ' -> ' + fxShow(f(x)),\\n xs, ys\\n ))\\n return lambda xShow: lambda fxShow: lambda f: lambda xs: go(\\n xShow, fxShow, f, xs\\n )\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import re\\n\\nmatchstr = \\\"\\\"\\\"\\\\\\n1001110011\\n1110111011\\n0010010010\\n1010101010\\n1111111111\\n0100101101\\n0100100\\n101\\n11\\n00\\n1\\\"\\\"\\\"\\n\\ndef _checker(matchobj):\\n g0, (g1, g2, g3, g4) = matchobj.group(0), matchobj.groups()\\n if not g4 and g1 and g1.startswith(g3):\\n return '%r repeats %r' % (g0, g1)\\n return '%r is not a rep-string' % (g0,)\\n\\ndef checkit(txt):\\n print(re.sub(r'(.+)(\\\\1+)(.*)|(.*)', _checker, txt))\\n\\ncheckit(matchstr)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ false swap\\n dup size 1 > if\\n [ [] temp put\\n dup size factors\\n -1 split drop\\n witheach\\n [ 2dup split drop\\n dip [ over size swap / ]\\n dup temp replace\\n swap of over = if\\n [ drop not\\n temp share\\n conclude ] ]\\n temp release ] swap ] is rep$ ( $ --> $ b )\\n\\n [ dup rep$ iff\\n [ say 'The shortest rep-string in \\\"'\\n swap echo$\\n say '\\\" is \\\"' echo$\\n say '\\\".' ]\\n else\\n [ say 'There is no rep-string for \\\"'\\n nip echo$ say '\\\".' ]\\n cr ] is task ( $ --> )\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (rep-string str)\\n (define len (string-length str))\\n (for/or ([n (in-range 1 len)])\\n (and (let loop ([from n])\\n (or (>= from len)\\n (let ([m (min (- len from) n)])\\n (and (equal? (substring str from (+ from m))\\n (substring str 0 m))\\n (loop (+ n from))))))\\n (<= n (quotient len 2))\\n (substring str 0 n))))\\n\\n(for ([str '(\\\"1001110011\\\"\\n \\\"1110111011\\\"\\n \\\"0010010010\\\"\\n \\\"1010101010\\\"\\n \\\"1111111111\\\"\\n \\\"0100101101\\\"\\n \\\"0100100\\\"\\n \\\"101\\\"\\n \\\"11\\\"\\n \\\"00\\\"\\n \\\"1\\\")])\\n (printf \\\"~a => ~a\\\\n\\\" str (or (rep-string str) \\\"not a rep-string\\\")))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"for <1001110011 1110111011 0010010010 1010101010 1111111111 0100101101 0100100 101 11 00 1> {\\n if /^ (.+) $0+: (.*$) <?{ $0.substr(0,$1.chars) eq $1 }> / {\\n\\tmy $rep = $0.chars;\\n\\tsay .substr(0,$rep), .substr($rep,$rep).trans('01' => '𝟘𝟙'), .substr($rep*2);\\n }\\n else {\\n\\tsay \\\"$_ (no repeat)\\\";\\n }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"sub repstr(Str $s) {\\n my $bits = :2($s);\\n for reverse 1 .. $s.chars div 2 -> $left {\\n\\tmy $right = $s.chars - $left;\\n\\treturn $left if $bits +^ ($bits +> $left) == $bits +> $right +< $right;\\n }\\n}\\n\\n\\nfor '1001110011 1110111011 0010010010 1010101010 1111111111 0100101101 0100100 101 11 00 1'.words {\\n if repstr $_ -> $rep {\\n\\tsay .substr(0,$rep), .substr($rep,$rep).trans('01' => '𝟘𝟙'), .substr($rep*2);\\n }\\n else {\\n\\tsay \\\"$_ (no repeat)\\\";\\n }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"$ENTRY Go {\\n , ('1001110011') ('1110111011') ('0010010010')\\n ('1010101010') ('1111111111') ('0100101101')\\n ('0100100') ('101') ('11') ('00') ('1'): e.Tests\\n = <Each Show e.Tests>;\\n};\\n\\nEach {\\n s.F = ;\\n s.F t.I e.R = <Mu s.F t.I> <Each s.F e.R>;\\n};\\n\\nShow {\\n (e.S), <RepString e.S>: e.R = <Prout e.S ' => ' e.R>;\\n};\\n\\nRepString {\\n () e.S = ;\\n (e.R) e.S, <Lengthen (e.R) e.S>: e.S e.X = e.R;\\n (e.R s.C) e.S = <RepString (e.R) e.S>;\\n e.S, <Lenw e.S>: s.L e.S,\\n <First <Div s.L 2> e.S>: (e.F) e.X\\n = <RepString (e.F) e.S>;\\n};\\n\\nLengthen {\\n (e.A) e.B, <Lenw e.A>: s.LA e.A,\\n <Lenw e.B>: s.LB e.B,\\n <Compare s.LA s.LB>: '-'\\n = <Lengthen (e.A e.A) e.B>;\\n (e.A) e.B, <Lenw e.B>: s.LB e.B,\\n <First s.LB e.A>: (e.FA) e.RA\\n = e.FA;\\n};\\n\",\n \"language\": \"Refal\"\n },\n {\n \"code\": \"/* REXX ***************************************************************\\n* 11.05.2013 Walter Pachl\\n* 14.05.2013 Walter Pachl extend to show additional rep-strings\\n**********************************************************************/\\nCall repstring '1001110011'\\nCall repstring '1110111011'\\nCall repstring '0010010010'\\nCall repstring '1010101010'\\nCall repstring '1111111111'\\nCall repstring '0100101101'\\nCall repstring '0100100'\\nCall repstring '101'\\nCall repstring '11'\\nCall repstring '00'\\nCall repstring '1'\\nExit\\n\\nrepstring:\\nParse Arg s\\nsq=''''s''''\\nn=length(s)\\nDo l=length(s)%2 to 1 By -1\\n If substr(s,l+1,l)=left(s,l) Then Leave\\n End\\nIf l>0 Then Do\\n rep_str=left(s,l)\\n Do i=1 By 1\\n If substr(s,i*l+1,l)<>rep_str Then\\n Leave\\n End\\n If left(copies(rep_str,n),length(s))=s Then Do\\n Call show_rep rep_str /* show result */\\n Do i=length(rep_str)-1 To 1 By -1 /* look for shorter rep_str-s */\\n rep_str=left(s,i)\\n If left(copies(rep_str,n),length(s))=s Then\\n Call show_rep rep_str\\n End\\n End\\n Else\\n Call show_norep\\n End\\nElse\\n Call show_norep\\nReturn\\n\\nshow_rep:\\n Parse Arg rs\\n Say right(sq,12) 'has a repetition length of' length(rs) 'i.e.' ''''rs''''\\n Return\\nshow_norep:\\n Say right(sq,12) 'is not a repeated string'\\n Return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX pgm determines if a string is a repString, it returns minimum length repString.*/\\nparse arg s /*get optional strings from the C.L. */\\nif s='' then s=1001110011 1110111011 0010010010 1010101010 1111111111 0100101101 0100100 101 11 00 1 45\\n /* [↑] S not specified? Use defaults*/\\n do k=1 for words(s); _=word(s,k); w=length(_) /*process binary strings. */\\n say right(_,max(25,w)) repString(_) /*show repString & result.*/\\n end /*k*/ /* [↑] the \\\"result\\\" may be negatory.*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nrepString: procedure; parse arg x; L=length(x); @rep=' rep string='\\n if \\\\datatype(x,'B') then return \\\" ***error*** string isn't a binary string.\\\"\\n h=L%2\\n do j=1 for L-1 while j<=h; $=left(x,j); $$=copies($,L)\\n if left($$,L)==x then return @rep left($,15) \\\"[length\\\" j']'\\n end /*j*/ /* [↑] we have found a good repString.*/\\n return ' (no repetitions)' /*failure to find repString.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Rep-string\\n\\ntest = [\\\"1001110011\\\",\\n \\\"1110111011\\\",\\n \\\"0010010010\\\",\\n \\\"1010101010\\\",\\n \\\"1111111111\\\",\\n \\\"0100101101\\\",\\n \\\"0100100\\\",\\n \\\"101\\\",\\n \\\"11\\\",\\n \\\"00\\\",\\n \\\"1\\\"]\\n\\nfor n = 1 to len(test)\\n strend = \\\"\\\"\\n for m=1 to len(test[n])\\n strbegin = substr(test[n], 1, m)\\n strcut = right(test[n], len(test[n]) - m)\\n nr = substr(strcut, strbegin)\\n if nr=1 and len(test[n]) > 1\\n strend = strbegin\\n ok\\n next\\n if strend = \\\"\\\"\\n see \\\"\\\" + test[n] + \\\" -> (none)\\\" + nl\\n else\\n see \\\"\\\" + test[n] + \\\" -> \\\" + strend + nl\\n ok\\nnext\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"ar = %w(1001110011\\n 1110111011\\n 0010010010\\n 1010101010\\n 1111111111\\n 0100101101\\n 0100100\\n 101\\n 11\\n 00\\n 1)\\n\\nar.each do |str|\\n rep_pos = (str.size/2).downto(1).find{|pos| str.start_with? str[pos..-1]}\\n puts str, rep_pos ? \\\" \\\"*rep_pos + str[0, rep_pos] : \\\"(no repetition)\\\", \\\"\\\"\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"fn main() {\\n let strings = vec![\\n String::from(\\\"1001110011\\\"),\\n String::from(\\\"1110111011\\\"),\\n String::from(\\\"0010010010\\\"),\\n String::from(\\\"1010101010\\\"),\\n String::from(\\\"1111111111\\\"),\\n String::from(\\\"0100101101\\\"),\\n String::from(\\\"0100100\\\"),\\n String::from(\\\"101\\\"),\\n String::from(\\\"11\\\"),\\n String::from(\\\"00\\\"),\\n String::from(\\\"1\\\"),\\n ];\\n for string in strings {\\n match rep_string(&string) {\\n Some(rep_string) => println!(\\n \\\"Longuest rep-string for '{}' is '{}' ({} chars)\\\",\\n string,\\n rep_string,\\n rep_string.len(),\\n ),\\n None => println!(\\\"No rep-string found for '{}'\\\", string),\\n };\\n }\\n}\\n\\nfn rep_string(string: &str) -> Option<&str> {\\n let index = string.len() / 2;\\n\\n for split_index in (1..=index).rev() {\\n let mut is_rep_string = true;\\n let (first, last) = string.split_at(split_index);\\n\\n let inter = last.chars().collect::<Vec<char>>();\\n let mut iter = inter.chunks_exact(split_index);\\n for chunk in iter.by_ref() {\\n if first != chunk.iter().collect::<String>() {\\n is_rep_string = false;\\n break;\\n }\\n }\\n let rmnd = iter.remainder().iter().collect::<String>();\\n\\n // Check that the remainder starts with the rep-string\\n if !first.starts_with(rmnd.as_str()) {\\n is_rep_string = false;\\n }\\n\\n if is_rep_string {\\n return Some(first);\\n }\\n }\\n None\\n}\\n\\n#[cfg(test)]\\nmod tests {\\n use super::rep_string;\\n use std::collections::HashMap;\\n\\n #[test]\\n fn test_rep_string() {\\n let mut results = HashMap::new();\\n results.insert(String::from(\\\"1001110011\\\"), Some(\\\"10011\\\"));\\n results.insert(String::from(\\\"1110111011\\\"), Some(\\\"1110\\\"));\\n results.insert(String::from(\\\"0010010010\\\"), Some(\\\"001\\\"));\\n results.insert(String::from(\\\"1010101010\\\"), Some(\\\"1010\\\"));\\n results.insert(String::from(\\\"1111111111\\\"), Some(\\\"11111\\\"));\\n results.insert(String::from(\\\"0100101101\\\"), None);\\n results.insert(String::from(\\\"0100100\\\"), Some(\\\"010\\\"));\\n results.insert(String::from(\\\"101\\\"), None);\\n results.insert(String::from(\\\"11\\\"), Some(\\\"1\\\"));\\n results.insert(String::from(\\\"00\\\"), Some(\\\"0\\\"));\\n results.insert(String::from(\\\"1\\\"), None);\\n\\n for (input, expected) in results {\\n assert_eq!(expected, rep_string(&input));\\n }\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object RepString extends App {\\n def repsOf(s: String) = s.trim match {\\n case s if s.length < 2 => Nil\\n case s => (1 to (s.length/2)).map(s take _)\\n .filter(_ * s.length take s.length equals s)\\n }\\n\\n val tests = Array(\\n \\\"1001110011\\\",\\n \\\"1110111011\\\",\\n \\\"0010010010\\\",\\n \\\"1010101010\\\",\\n \\\"1111111111\\\",\\n \\\"0100101101\\\",\\n \\\"0100100\\\",\\n \\\"101\\\",\\n \\\"11\\\",\\n \\\"00\\\",\\n \\\"1\\\"\\n )\\n def printReps(s: String) = repsOf(s) match {\\n case Nil => s+\\\": NO\\\"\\n case r => s+\\\": YES (\\\"+r.mkString(\\\", \\\")+\\\")\\\"\\n }\\n val todo = if (args.length > 0) args else tests\\n todo.map(printReps).foreach(println)\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst func integer: repeatLength (in string: text) is func\\n result\\n var integer: length is 0;\\n local\\n var integer: pos is 0;\\n begin\\n for pos range succ(length(text) div 2) downto 1 until length <> 0 do\\n if startsWith(text, text[pos ..]) then\\n length := pred(pos);\\n end if;\\n end for;\\n end func;\\n\\nconst proc: main is func\\n local\\n var string: line is \\\"\\\";\\n var integer: length is 0;\\n begin\\n for line range [] (\\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\", \\\"1010101010\\\",\\n \\\"1111111111\\\", \\\"0100101101\\\", \\\"0100100\\\", \\\"101\\\", \\\"11\\\", \\\"00\\\", \\\"1\\\") do\\n length := repeatLength(line);\\n if length = 0 then\\n writeln(\\\"No rep-string for \\\" <& literal(line));\\n else\\n writeln(\\\"Longest rep-string for \\\" <& literal(line) <& \\\": \\\" <& literal(line[.. length]));\\n end if;\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"program repstring;\\n tests := [\\n \\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\", \\\"1010101010\\\",\\n \\\"1111111111\\\", \\\"0100101101\\\", \\\"0100100\\\", \\\"101\\\", \\\"11\\\", \\\"00\\\", \\\"1\\\"\\n ];\\n\\n loop for test in tests do\\n print(test + \\\": \\\" + str repstrings(test));\\n end loop;\\n\\n proc repstrings(s);\\n return {\\n s(..l) : l in [1..#s div 2]\\n | (s(..l)*(#s div l+1))(..#s) = s\\n };\\n end proc;\\nend program;\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"var arr = <1001110011 1110111011\\n 0010010010 1010101010\\n 1111111111 0100101101\\n 0100100 101 11 00 1>;\\n \\n arr.each { |n|\\n if (var m = /^(.+)\\\\1+(.*$)(?(?{ substr($1, 0, length $2) eq $2 })|(?!))/.match(n)) {\\n var i = m[0].len;\\n say (n.substr(0, i),\\n n.substr(i, i).tr('01', '𝟘𝟙'),\\n n.substr(i*2));\\n } else {\\n say \\\"#{n} (no repeat)\\\";\\n }\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"* Rep-string\\n\\tstrings = \\\"1001110011 1110111011 0010010010 1010101010 1111111111 0100101101 0100100 101 11 00 1 \\\"\\n\\tpat1 = (len(1) $ fc breakx(*fc)) $ x *x (arbno(*x) (rpos(0) | rem $ y *?(x ? y)))\\ngetstring\\n\\tstrings ? (break(\\\" \\\") . rs len(1)) = :f(end)\\n\\trs ? pat1 :s(yes)\\n\\toutput = rs \\\" is not a rep-string -> n/a\\\" :(getstring)\\nyes\\n\\toutput = rs \\\" has shortest rep-string value of -> \\\" x\\n\\t:(getstring)\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"import Foundation\\n\\nfunc repString(_ input: String) -> [String] {\\n return (1..<(1 + input.count / 2)).compactMap({x -> String? in\\n let i = input.index(input.startIndex, offsetBy: x)\\n return input.hasPrefix(input[i...]) ? String(input.prefix(x)) : nil\\n })\\n}\\n\\nlet testCases = \\\"\\\"\\\"\\n 1001110011\\n 1110111011\\n 0010010010\\n 1010101010\\n 1111111111\\n 0100101101\\n 0100100\\n 101\\n 11\\n 00\\n 1\\n \\\"\\\"\\\".components(separatedBy: \\\"\\\\n\\\")\\n\\nfor testCase in testCases {\\n print(\\\"\\\\(testCase) has reps: \\\\(repString(testCase))\\\")\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"proc repstring {text} {\\n set len [string length $text]\\n for {set i [expr {$len/2}]} {$i > 0} {incr i -1} {\\n\\tset sub [string range $text 0 [expr {$i-1}]]\\n\\tset eq [string repeat $sub [expr {int(ceil($len/double($i)))}]]\\n\\tif {[string equal -length $len $text $eq]} {\\n\\t return $sub\\n\\t}\\n }\\n error \\\"no repetition\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"foreach sample {\\n \\\"1001110011\\\" \\\"1110111011\\\" \\\"0010010010\\\" \\\"1010101010\\\" \\\"1111111111\\\"\\n \\\"0100101101\\\" \\\"0100100\\\" \\\"101\\\" \\\"11\\\" \\\"00\\\" \\\"1\\\"\\n} {\\n if {[catch {\\n\\tset rep [repstring $sample]\\n\\tputs [format \\\"\\\\\\\"%s\\\\\\\" has repetition (length: %d) of \\\\\\\"%s\\\\\\\"\\\" \\\\\\n\\t\\t $sample [string length $rep] $rep]\\n }]} {\\n\\tputs [format \\\"\\\\\\\"%s\\\\\\\" is not a repeated string\\\" $sample]\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"is_repeated() {\\n local str=$1 len rep part\\n for (( len = ${#str} / 2; len > 0; len-- )); do\\n part=${str:0:len}\\n rep=\\\"\\\"\\n while (( ${#rep} < ${#str} )); do\\n rep+=$part\\n done\\n if [[ ${rep:0:${#str}} == $str ]] && (( $len < ${#str} )); then\\n echo \\\"$part\\\"\\n return 0\\n fi\\n done\\n return 1\\n}\\n\\nwhile read test; do\\n if part=$( is_repeated \\\"$test\\\" ); then\\n echo \\\"$test is composed of $part repeated\\\"\\n else\\n echo \\\"$test is not a repeated string\\\"\\n fi\\ndone <<END_TESTS\\n1001110011\\n1110111011\\n0010010010\\n1010101010\\n1111111111\\n0100101101\\n0100100\\n101\\n11\\n00\\n1\\nEND_TESTS\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"fn rep(s string) int {\\n for x := s.len / 2; x > 0; x-- {\\n if s.starts_with(s[x..]) {\\n return x\\n }\\n }\\n return 0\\n}\\n\\nconst m = '\\n1001110011\\n1110111011\\n0010010010\\n1010101010\\n1111111111\\n0100101101\\n0100100\\n101\\n11\\n00\\n1'\\n\\nfn main() {\\n for s in m.fields() {\\n n := rep(s)\\n if n > 0 {\\n println(\\\"$s $n rep-string ${s[..n]}\\\")\\n } else {\\n println(\\\"$s not a rep-string\\\")\\n }\\n }\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Function rep_string(s)\\n\\tmax_len = Int(Len(s)/2)\\n\\ttmp = \\\"\\\"\\n\\tIf max_len = 0 Then\\n\\t\\trep_string = \\\"No Repeating String\\\"\\n\\t\\tExit Function\\n\\tEnd If\\n\\tFor i = 1 To max_len\\n\\t\\tIf InStr(i+1,s,tmp & Mid(s,i,1))Then\\n\\t\\t\\ttmp = tmp & Mid(s,i,1)\\n\\t\\tElse\\n\\t\\t\\tExit For\\n\\t\\tEnd If\\n\\tNext\\n\\tDo While Len(tmp) > 0\\n\\t\\tIf Mid(s,Len(tmp)+1,Len(tmp)) = tmp Then\\n\\t\\t\\trep_string = tmp\\n\\t\\t\\tExit Do\\n\\t\\tElse\\n\\t\\t\\ttmp = Mid(tmp,1,Len(tmp)-1)\\n\\t\\tEnd If\\n\\tLoop\\n\\tIf Len(tmp) > 0 Then\\n\\t\\trep_string = tmp\\n\\tElse\\n\\t\\trep_string = \\\"No Repeating String\\\"\\n\\tEnd If\\nEnd Function\\n\\n'testing the function\\narr = Array(\\\"1001110011\\\",\\\"1110111011\\\",\\\"0010010010\\\",\\\"1010101010\\\",_\\n\\t\\t\\\"1111111111\\\",\\\"0100101101\\\",\\\"0100100\\\",\\\"101\\\",\\\"11\\\",\\\"00\\\",\\\"1\\\")\\n\\nFor n = 0 To UBound(arr)\\n\\tWScript.StdOut.Write arr(n) & \\\": \\\" & rep_string(arr(n))\\n\\tWScript.StdOut.WriteLine\\nNext\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar repString = Fn.new { |s|\\n var reps = []\\n if (s.count < 2) return reps\\n for (c in s) if (c != \\\"0\\\" && c != \\\"1\\\") Fiber.abort(\\\"Argument is not a binary string.\\\")\\n var size = s.count\\n for (len in 1..(size/2).floor) {\\n var t = s[0...len]\\n var n = (size/len).floor\\n var r = size % len\\n var u = t * n + t[0...r]\\n if (u == s) reps.add(t)\\n }\\n return reps\\n}\\n\\nvar strings = [\\n \\\"1001110011\\\",\\n \\\"1110111011\\\",\\n \\\"0010010010\\\",\\n \\\"1010101010\\\",\\n \\\"1111111111\\\",\\n \\\"0100101101\\\",\\n \\\"0100100\\\",\\n \\\"101\\\",\\n \\\"11\\\",\\n \\\"00\\\",\\n \\\"1\\\"\\n]\\nSystem.print(\\\"The (longest) rep-strings are:\\\\n\\\")\\nfor (s in strings) {\\n var reps = repString.call(s)\\n var t = (reps.count > 0) ? reps[-1] : \\\"Not a rep-string\\\"\\n Fmt.print(\\\"$10s -> $s\\\", s, t)\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"data \\\"1001110011\\\", \\\"1110111011\\\", \\\"0010010010\\\", \\\"1010101010\\\", \\\"1111111111\\\", \\\"0100101101\\\", \\\"0100100\\\", \\\"101\\\", \\\"11\\\", \\\"00\\\", \\\"1\\\", \\\"\\\"\\n\\nsub rep$(c$, n)\\n local r$, i\\n\\n for i = 1 to n\\n r$ = r$ + c$\\n next\\n return r$\\nend sub\\n\\ndo\\n read p$ : if p$ = \\\"\\\" break\\n b$ = \\\"\\\" : l = len(p$) : m = int(l / 2)\\n\\n for i = m to 1 step -1\\n t$ = left$(p$, i)\\n s$ = rep$(t$, l / i + 1)\\n if p$ = left$(s$, l) b$ = t$ : break\\n next\\n\\n if b$ = \\\"\\\" then\\n print p$, \\\" is not a repeated string\\\"\\n else\\n print p$, \\\" is composed of \\\", b$, \\\" repeated\\\"\\n end if\\nloop\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"fcn repString(s){\\n foreach n in ([s.len()/2+1..1,-1]){\\n Walker.cycle(s[0,n]).pump(s.len(),String) :\\n if(_==s and n*2<=s.len()) return(n);\\n }\\n return(False)\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn repString(s){\\n foreach n in ([s.len()/2..0,-1]){\\n if(s.matches(s[n,*] + \\\"*\\\") and n*2<=s.len()) return(n);\\n }\\n return(False)\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"words:=(\\\"1001110011 1110111011 0010010010 1010101010 \\\"\\n \\\"1111111111 0100101101 0100100 101 11 00 1\\\").split(\\\" \\\");\\nforeach w in (words){\\n if(not n:=repString2(w)) \\\"No repeat in \\\".println(w);\\n else [0..*,n].tweak('wrap(z){ if(s:=w[z,n]) s else Void.Stop })\\n .walk().concat(\\\" \\\").println();\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Rep-string"}}},{"rowIdx":1578,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Repeat\n","language":"00-META"},{"code":";Task:\nWrite a procedure which accepts as arguments another procedure and a positive integer. \n\nThe latter procedure is executed a number of times equal to the accepted integer.\n<br><br>\n\n","language":"00-TASK"},{"code":"F repeat(f, n)\n L 1..n\n f()\n\nF procedure()\n print(‘Example’)\n\nrepeat(procedure, 3)\n","language":"11l"},{"code":"macro RepeatProc,addr,count ;VASM macro syntax\n; input:\n; addr = the label of the routine you wish to call repeatedly\n; count = how many times you want to DO the procedure. 1 = once, 2 = twice, 3 = three times, etc. Enter \"0\" for 256 times.\nlda #<\\addr\nsta z_L ;a label for a zero-page memory address\nlda #>\\addr\nsta z_H ;a label for the zero-page memory address immediately after z_L\nlda \\count\njsr doRepeatProc\nendm\n\ndoRepeatProc:\nsta z_C ;another zero-page memory location\nloop_RepeatProc:\njsr Trampoline_RepeatProc\ndec z_C\nlda z_C\nbne loop_RepeatProc\nrts\n\nTrampoline_RepeatProc:\ndb $6c,z_L,$00\n;when executed, becomes an indirect JMP to the address stored at z_L and z_H. Some assemblers will let you type\n;JMP (z_L) and it will automatically replace it with the above during the assembly process.\n;This causes an indirect JMP to the routine. Its RTS will return execution to just after the \"JSR Trampoline_RepeatProc\"\n;and flow into the loop overhead.\n","language":"6502-Assembly"},{"code":"RepeatProc foo,#20 ;perform the subroutine \"foo\" twenty times.\n","language":"6502-Assembly"},{"code":"RepeatProc:\n;input: low byte of desired function address in A\n; high byte of desired function address in X\n; repeat count in Y\n\nSTA smc_repeatproc+1\nSTX smc_repeatproc+2\nsmc_repeatproc:\njsr $0000 ;this is modified by the STA and STX above.\ndey\nbne smc_repeatproc\nrts\n","language":"6502-Assembly"},{"code":"\tlea foo,a5 ;function to execute\n\tmove.w #4-1,d7 ;times to repeat\n\tjsr Repeater\n\t\n\tjmp * ;halt the CPU, we're done\n\t\nrepeater:\n\tjsr repeaterhelper ;this also need to be a call, so that the RTS of the desired procedure\n ;returns us to the loop rather than the line after \"jsr Repeater\".\n\tDBRA D7,repeater\n\trts\n\t\nrepeaterhelper:\n\tjmp (a5) ;keep in mind, this is NOT a dereference, it simply sets the program counter equal to A5.\n ;A bit misleading if you ask me.\nfoo:\n\tMOVE.B #'!',D0\n\tJSR PrintChar\n\trts\n","language":"68000-Assembly"},{"code":"DEFINE PTR=\"CARD\"\n\nPROC OutputText(CHAR ARRAY s)\n PrintE(s)\nRETURN\n\nPROC Procedure=*(CHAR ARRAY s)\n DEFINE JSR=\"$20\"\n DEFINE RTS=\"$60\"\n [JSR $00 $00 ;JSR to address set by SetProcedure\n RTS]\n\nPROC SetProcedure(PTR p)\n PTR addr\n\n addr=Procedure+1 ;location of address of JSR\n PokeC(addr,p)\nRETURN\n\nPROC Repeat(PTR procFun CHAR ARRAY s BYTE n)\n BYTE i\n\n SetProcedure(procFun)\n FOR i=1 TO n\n DO\n Procedure(s)\n OD\nRETURN\n\nPROC Main()\n Repeat(OutputText,\"Action!\",5)\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_IO;\n\nprocedure Repeat_Example is\n\n procedure Repeat(P: access Procedure; Reps: Natural) is\n begin\n for I in 1 .. Reps loop\n\t P.all; -- P points to a procedure, and P.all actually calls that procedure\n end loop;\n end Repeat;\n\n procedure Hello is\n begin\n Ada.Text_IO.Put(\"Hello! \");\n end Hello;\n\nbegin\n Repeat(Hello'Access, 3); -- Hello'Access points to the procedure Hello\nend Repeat_Example;\n","language":"Ada"},{"code":"# operator that executes a procedure the specified number of times #\nOP REPEAT = ( INT count, PROC VOID routine )VOID:\n TO count DO routine OD;\n\n# make REPEAT a low priority operater #\nPRIO REPEAT = 1;\n\n\n# can also create variant that passes the iteration count as a parameter #\nOP REPEAT = ( INT count, PROC( INT )VOID routine )VOID:\n FOR iteration TO count DO routine( iteration ) OD;\n\nmain: (\n\n # PROC to test the REPEAT operator with #\n PROC say something = VOID: print( ( \"something\", newline ) );\n\n 3 REPEAT say something;\n\n # PROC to test the variant #\n PROC show squares = ( INT n )VOID: print( ( n, n * n, newline ) );\n\n 3 REPEAT show squares\n\n)\n","language":"ALGOL-68"},{"code":"begin\n % executes the procedure routine the specified number of times %\n procedure repeat ( integer value count; procedure routine ) ;\n for i := 1 until count do routine;\n begin\n integer x;\n % print \"hello\" three times %\n repeat( 3, write( \"hello\" ) );\n % print the first 10 squares %\n write();\n x := 1;\n repeat( 10\n , begin\n writeon( i_w := s_w := 1, x * x );\n x := x + 1\n end\n )\n end\nend.\n","language":"ALGOL-W"},{"code":"-- applyN :: Int -> (a -> a) -> a -> a\non applyN(n, f, x)\n script go\n on |λ|(a, g)\n |λ|(a) of mReturn(g)\n end |λ|\n end script\n foldl(go, x, replicate(n, f))\nend applyN\n\n\n-------- SAMPLE FUNCTIONS FOR REPEATED APPLICATION --------\n\non double(x)\n 2 * x\nend double\n\n\non plusArrow(s)\n s & \" -> \"\nend plusArrow\n\n\non squareRoot(n)\n n ^ 0.5\nend squareRoot\n\n-------------------------- TESTS --------------------------\non run\n log applyN(10, double, 1)\n --> 1024\n\n log applyN(5, plusArrow, \"\")\n --> \" -> -> -> -> -> \"\n\n log applyN(3, squareRoot, 65536)\n --> 4.0\nend run\n\n\n-------------------- GENERIC FUNCTIONS --------------------\n\n-- foldl :: (a -> b -> a) -> a -> [b] -> a\non foldl(f, startValue, xs)\n tell mReturn(f)\n set v to startValue\n set lng to length of xs\n repeat with i from 1 to lng\n set v to |λ|(v, item i of xs, i, xs)\n end repeat\n return v\n end tell\nend foldl\n\n\n-- mReturn :: First-class m => (a -> b) -> m (a -> b)\non mReturn(f)\n -- 2nd class handler function lifted into 1st class script wrapper.\n if script is class of f then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n\n-- Egyptian multiplication - progressively doubling a list, appending\n-- stages of doubling to an accumulator where needed for binary\n-- assembly of a target length\n-- replicate :: Int -> a -> [a]\non replicate(n, a)\n set out to {}\n if 1 > n then return out\n set dbl to {a}\n\n repeat while (1 < n)\n if 0 < (n mod 2) then set out to out & dbl\n set n to (n div 2)\n set dbl to (dbl & dbl)\n end repeat\n return out & dbl\nend replicate\n","language":"AppleScript"},{"code":"print \"---------------------------\"\nprint \"As a loop\"\nprint \"---------------------------\"\nloop 4 'x ->\n print \"Example 1\"\n\nrepeatFunc: function [f,times][\n loop times 'x ->\n do f\n]\n\nprint \"---------------------------\"\nprint \"With a block param\"\nprint \"---------------------------\"\nrepeatFunc [print \"Example 2\"] 4\n\nrepeatFunc: function [f,times][\n loop times 'x ->\n f\n]\n\nprint \"---------------------------\"\nprint \"With a function param\"\nprint \"---------------------------\"\nrepeatFunc $[][print \"Example 3\"] 4\n","language":"Arturo"},{"code":"repeat(\"fMsgBox\",3)\nreturn\n\nrepeat(f, n){\n\tloop % n\n\t\t%f%()\n}\n\nfMsgBox(){\n\tMsgBox hello\n}\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f REPEAT.AWK\nBEGIN {\n for (i=0; i<=3; i++) {\n f = (i % 2 == 0) ? \"even\" : \"odd\"\n @f(i) # indirect function call\n }\n exit(0)\n}\nfunction even(n, i) {\n for (i=1; i<=n; i++) {\n printf(\"inside even %d\\n\",n)\n }\n}\nfunction odd(n, i) {\n for (i=1; i<=n; i++) {\n printf(\"inside odd %d\\n\",n)\n }\n}\n","language":"AWK"},{"code":"subroutine proc()\n\tprint \" Inside loop\"\nend subroutine\n\nsubroutine repeat(func, times)\n\tfor i = 1 to times\n\t\tcall proc()\n\tnext\nend subroutine\n\ncall repeat(\"proc\", 5)\nprint \"Loop Ended\n","language":"BASIC256"},{"code":"@echo off\n\n:_main\nsetlocal\ncall:_func1 _func2 3\npause>nul\nexit/b\n\n:_func1\nsetlocal enabledelayedexpansion\nfor /l %%i in (1,1,%2) do call:%1\nexit /b\n\n:_func2\nsetlocal\necho _func2 has been executed\nexit /b\n","language":"Batch-File"},{"code":"•Show {2+𝕩}⍟3 1\n\n_repeat_ ← {(𝕘>0)◶⊢‿(𝔽_𝕣_(𝕘-1)𝔽)𝕩}\n\n•Show {2+𝕩} _repeat_ 3 1\n","language":"BQN"},{"code":"7\n7\n","language":"BQN"},{"code":"#include <stdio.h>\n\nvoid repeat(void (*f)(void), unsigned int n) {\n while (n-->0)\n (*f)(); //or just f()\n}\n\nvoid example() {\n printf(\"Example\\n\");\n}\n\nint main(int argc, char *argv[]) {\n repeat(example, 4);\n return 0;\n}\n","language":"C"},{"code":"template <typename Function>\nvoid repeat(Function f, unsigned int n) {\n for(unsigned int i=n; 0<i; i--)\n f();\n}\n","language":"C++"},{"code":"#include <iostream>\nvoid example() {\n std::cout << \"Example\\n\";\n}\n\nrepeat(example, 4);\n","language":"C++"},{"code":" repeat([]{std::cout << \"Example\\n\";}, 4);\n","language":"C++"},{"code":"using System;\n\nnamespace Repeat {\n class Program {\n static void Repeat(int count, Action<int> fn) {\n if (null == fn) {\n throw new ArgumentNullException(\"fn\");\n }\n for (int i = 0; i < count; i++) {\n fn.Invoke(i + 1);\n }\n }\n\n static void Main(string[] args) {\n Repeat(3, x => Console.WriteLine(\"Example {0}\", x));\n }\n }\n}\n","language":"C-sharp"},{"code":"10 sub proc()\n20 print \" Inside loop\"\n30 end sub\n40 sub repeat(func$,times)\n50 for i = 1 to times\n60 proc()\n70 next i\n80 end sub\n90 repeat(\"proc\",5)\n100 print \"Loop Ended\"\n110 end\n","language":"Chipmunk-Basic"},{"code":"(defn repeat-function [f n]\n (dotimes [i n] (f)))\n","language":"Clojure"},{"code":"(defun repeat (f n)\n (dotimes (i n) (funcall f)))\n\n(repeat (lambda () (format T \"Example~%\")) 5)\n","language":"Common-Lisp"},{"code":"include \"cowgol.coh\";\n\n# Only functions that implement an interface can be passed around\n# The interface is a type and must be defined before it is used\n# This defines an interface for a function that takes no arguments\ninterface Fn();\n\n# This function repeats a function that implements Fn\nsub Repeat(f: Fn, n: uint32) is\n while n != 0 loop\n f();\n n := n - 1;\n end loop;\nend sub;\n\n# Here is a function\nsub Foo implements Fn is\n print(\"foo \");\nend sub;\n\n# Prints \"foo foo foo foo\"\nRepeat(Foo, 4);\nprint_nl();\n","language":"Cowgol"},{"code":"void repeat(void function() fun, in uint times) {\n foreach (immutable _; 0 .. times)\n fun();\n}\n\nvoid procedure() {\n import std.stdio;\n \"Example\".writeln;\n}\n\nvoid main() {\n repeat(&procedure, 3);\n}\n","language":"D"},{"code":"program Repeater;\n\n{$APPTYPE CONSOLE}\n{$R *.res}\n\ntype\n TSimpleProc = procedure; // Can also define types for procedures (& functions) which\n // require params.\n\nprocedure Once;\nbegin\n writeln('Hello World');\nend;\n\nprocedure Iterate(proc : TSimpleProc; Iterations : integer);\nvar\n i : integer;\nbegin\n for i := 1 to Iterations do\n proc;\nend;\n\nbegin\n Iterate(Once, 3);\n readln;\nend.\n","language":"Delphi"},{"code":"program Repeater;\n\n{$APPTYPE CONSOLE}\n{$R *.res}\n\nuses\n System.SysUtils;\n\nprocedure Iterate(proc: TProc; Iterations: integer);\nvar\n i: integer;\nbegin\n for i := 1 to Iterations do\n proc;\nend;\n\nbegin\n Iterate(\n procedure\n begin\n writeln('Hello World');\n end, 3);\n readln;\nend.\n","language":"Delphi"},{"code":"(define (repeat f n) (for ((i n)) (f)))\n\n(repeat (lambda () (write (random 1000))) 5)\n → 287 798 930 989 794\n\n;; Remark\n;; It is also possible to iterate a function : f(f(f(f( ..(f x)))))\n(define cos10 (iterate cos 10)\n(define cos100 (iterate cos10 10))\n(cos100 0.6)\n → 0.7390851332151605\n(cos 0.7390851332151605)\n → 0.7390851332151608 ;; fixed point found\n","language":"EchoLisp"},{"code":"open System\n\nlet Repeat c f =\n for _ in 1 .. c do\n f()\n\nlet Hello _ =\n printfn \"Hello world\"\n\n[<EntryPoint>]\nlet main _ =\n Repeat 3 Hello\n\n 0 // return an integer exit code\n","language":"F-Sharp"},{"code":"3 [ \"Hello!\" print ] times\n","language":"Factor"},{"code":": times ( ... n quot: ( ... -- ... ) -- ... )\n [ drop ] prepose each-integer ; inline\n","language":"Factor"},{"code":"(= repeat (mac (i n . body)\n (list 'do\n (list 'let i 0)\n (list 'while (list '< i n)\n (list '= i (list '+ i 1))\n (cons 'do body)))))\n\n; print multiplication table\n(repeat i 10\n (repeat j 10\n (print i \"x\" j \"=\" (* i j)))\n (print))\n","language":"Fe"},{"code":": times ( xt n -- )\n 0 ?do dup execute loop drop ;\n","language":"Forth"},{"code":": times { xt n -- }\n n 0 ?do xt execute loop ;\n","language":"Forth"},{"code":": times[ ]] 0 ?do [[ ; immediate compile-only\n: ]times postpone loop ; immediate compile-only\n","language":"Forth"},{"code":"[: cr .\" Hello\" ;] 3 times\n\n: 3-byes ( -- ) 3 times[ cr .\" Bye\" ]times ;\n3-byes\n","language":"Forth"},{"code":"' FB 1.05.0 Win64\n\nSub proc()\n Print \" proc called\"\nEnd Sub\n\nSub repeat(s As Sub, n As UInteger)\n For i As Integer = 1 To n\n Print Using \"##\"; i;\n s()\n Next\nEnd Sub\n\nrepeat(@proc, 5)\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"include \"NSLog.incl\"\n\nvoid local fn Example( value as long )\n NSLog(@\"Example %ld\",value)\nend fn\n\nvoid local fn DoIt( fnAddress as ptr, count as long )\n def fn Repeat( j as long ) using fnAddress\n\n long i\n for i = 1 to count\n fn Repeat( i )\n next\nend fn\n\nfn DoIt( @fn Example, 3 )\n\nHandleEvents\n","language":"FutureBasic"},{"code":"Public Sub Main()\n\n RepeatIt(\"RepeatableOne\", 2)\n\n RepeatIt(\"RepeatableTwo\", 3)\n\nEnd\n\n'Cannot pass procedure pointer in Gambas; must pass procedure name and use Object.Call()\nPublic Sub RepeatIt(sDelegateName As String, iCount As Integer)\n\n For iCounter As Integer = 1 To iCount\n Object.Call(Me, sDelegateName, [])\n Next\n\nEnd\n\nPublic Sub RepeatableOne()\n\n Print \"RepeatableOne\"\n\nEnd\n\nPublic Sub RepeatableTwo()\n\n Print \"RepeatableTwo\"\n\nEnd\n","language":"Gambas"},{"code":"package main\n\nimport \"fmt\"\n\nfunc repeat(n int, f func()) {\n for i := 0; i < n; i++ {\n f()\n }\n}\n\nfunc fn() {\n fmt.Println(\"Example\")\n}\n\nfunc main() {\n repeat(4, fn)\n}\n","language":"Go"},{"code":"100 let f$ = \"proc\"\n110 let c = 5\n120 gosub 170\n130 print \"Loop Ended\"\n140 goto 220\n150 print \" Inside loop\"\n160 return\n170 rem repeat(f$,c)\n180 for i = 1 to c\n190 gosub 150\n200 next i\n210 return\n220 end\n","language":"GW-BASIC"},{"code":"import Control.Monad (replicateM_)\n\nsampleFunction :: IO ()\nsampleFunction = putStrLn \"a\"\n\nmain = replicateM_ 5 sampleFunction\n","language":"Haskell"},{"code":"applyN :: Int -> (a -> a) -> a -> a\napplyN n f = foldr (.) id (replicate n f)\n\nmain :: IO ()\nmain = print $ applyN 10 (\\x -> 2 * x) 1\n","language":"Haskell"},{"code":"theory Scratch\n imports Main\nbegin\n\ntext‹\nGiven the function we want to execute multiple times is of\ntype \\<^typ>‹unit ⇒ unit›.\n›\nfun pure_repeat :: \"(unit ⇒ unit) ⇒ nat ⇒ unit\" where\n \"pure_repeat _ 0 = ()\"\n| \"pure_repeat f (Suc n) = f (pure_repeat f n)\"\n\ntext‹\nFunctions are pure in Isabelle. They don't have side effects.\nThis means, the \\<^const>‹pure_repeat› we implemented is always equal\nto \\<^term>‹() :: unit›, independent of the function \\<^typ>‹unit ⇒ unit›\nor \\<^typ>‹nat›.\nTechnically, functions are not even \"executed\", but only evaluated.\n›\nlemma \"pure_repeat f n = ()\" by simp\n\ntext‹\nBut we can repeat a value of \\<^typ>‹'a› \\<^term>‹n› times and return the result\nin a list of length \\<^term>‹n›\n›\nfun repeat :: \"'a ⇒ nat ⇒ 'a list\" where\n \"repeat _ 0 = []\"\n| \"repeat f (Suc n) = f # (repeat f n)\"\n\nlemma \"repeat ''Hello'' 4 = [''Hello'', ''Hello'', ''Hello'', ''Hello'']\"\n by code_simp\n\nlemma \"length (repeat a n) = n\" by(induction n) simp+\n\ntext‹\nTechnically, \\<^typ>‹'a› is not a function. We can wrap it in a dummy function\nwhich takes a \\<^typ>‹unit› as first argument. This gives a function of type\n\\<^typ>‹unit ⇒ 'a›.\n›\n\nfun fun_repeat :: \"(unit ⇒ 'a) ⇒ nat ⇒ 'a list\" where\n \"fun_repeat _ 0 = []\"\n| \"fun_repeat f (Suc n) = (f ()) # (fun_repeat f n)\"\n\nlemma \"fun_repeat (λ_. ''Hello'') 4 =\n [''Hello'', ''Hello'', ''Hello'', ''Hello'']\"\n by code_simp\n\ntext‹\nYet, \\<^const>‹fun_repeat› with the dummy function \\<^typ>‹unit ⇒ 'a› is\nequivalent to \\<^const>‹repeat› with the value \\<^typ>‹'a› directly.\n›\nlemma \"fun_repeat (λ_. a) n = repeat a n\" by(induction n) simp+\n\nend\n","language":"Isabelle"},{"code":" NB. ^: (J's power conjunction) repeatedly evaluates a verb.\n\n NB. Appending to a vector the sum of the most recent\n NB. 2 items can generate the Fibonacci sequence.\n\n (, [: +/ _2&{.) (^:4) 0 1\n0 1 1 2 3 5\n\n\n NB. Repeat an infinite number of times\n NB. computes the stable point at convergence\n\n cosine =: 2&o.\n\n cosine (^:_ ) 2 NB. 2 is the initial value\n0.739085\n\n cosine 0.739085 NB. demonstrate the stable point x==Cos(x)\n0.739085\n\n\n cosine^:(<_) 2 NB. show the convergence\n2 _0.416147 0.914653 0.610065 0.819611 0.682506 0.775995 0.713725 0.755929 0.727635 0.74675 0.733901 0.742568 0.736735 0.740666 0.738019 0.739803 0.738602 0.739411 0.738866 0.739233 0.738986 0.739152 0.73904 0.739116 0.739065 0.739099 0.739076 0.739091 0.7...\n\n\n # cosine^:(<_) 2 NB. iteration tallyft\n78\n\n f =: 3 :'smoutput ''hi'''\n\n f''\nhi\n\n NB. pass verbs via a gerund\n repeat =: dyad def 'for_i. i.y do. (x`:0)0 end. EMPTY'\n\n (f`'')repeat 4\nhi\nhi\nhi\nhi\n\n\n\n NB. pass a verb directly to an adverb\n\n Repeat =: adverb def 'for_i. i.y do. u 0 end. EMPTY'\n\n f Repeat 4\nhi\nhi\nhi\nhi\n","language":"J"},{"code":"import java.lang.reflect.Method;\n\npublic class Program {\n public static void main(String[] args) throws ReflectiveOperationException {\n Method method = Program.class.getMethod(\"printRosettaCode\");\n repeat(method, 5);\n }\n\n public static void printRosettaCode() {\n System.out.println(\"Rosetta Code\");\n }\n\n public static void repeat(Method method, int count) throws ReflectiveOperationException {\n while (count-- > 0)\n method.invoke(null);\n }\n}\n","language":"Java"},{"code":"import java.util.function.Consumer;\nimport java.util.stream.IntStream;\n\npublic class Repeat {\n\n public static void main(String[] args) {\n repeat(3, (x) -> System.out.println(\"Example \" + x));\n }\n\n static void repeat (int n, Consumer<Integer> fun) {\n IntStream.range(0, n).forEach(i -> fun.accept(i + 1));\n }\n}\n","language":"Java"},{"code":"def unoptimized_repeat(f; n):\n if n <= 0 then empty\n else f, repeat(f; n-1)\n end;\n","language":"Jq"},{"code":"def repeat(f; n):\n # state: [count, in]\n def r:\n if .[0] >= n then empty else (.[1] | f), (.[0] += 1 | r) end;\n [0, .] | r;\n","language":"Jq"},{"code":"# If n is a non-negative integer,\n# then emit a stream of (n + 1) terms: ., f, f|f, f|f|f, ...\ndef repeatedly(f; n):\n # state: [count, in]\n def r:\n if .[0] < 0 then empty\n else .[1], ([.[0] - 1, (.[1] | f)] | r)\n end;\n [n, .] | r;\n","language":"Jq"},{"code":"0 | [ repeat(.+1; 3) ]\n","language":"Jq"},{"code":"0 | repeatedly(.+1; 3)\n","language":"Jq"},{"code":"function sayHi()\n\tprintln(\"Hi\")\nend\n\nfunction rep(f, n)\n\tfor i = 1:n f() end\nend\n\nrep(sayHi, 3)\n","language":"Julia"},{"code":"// version 1.0.6\n\nfun repeat(n: Int, f: () -> Unit) {\n for (i in 1..n) {\n f()\n println(i)\n }\n}\n\nfun main(args: Array<String>) {\n repeat(5) { print(\"Example \") }\n}\n","language":"Kotlin"},{"code":"def repeat : ℕ → (ℕ → string) → string\n | 0 f := \"done\"\n | (n + 1) f := (f n) ++ (repeat n f)\n\n\n#eval repeat 5 $ λ b : ℕ , \"me \"\n","language":"Lean"},{"code":"def repeatf (f : Nat -> String) (n : Nat) : String :=\n match n with\n | 0 => \".\"\n | (k + 1) => (f k) ++ (repeatf f k)\n\ndef example1 : String :=\n repeatf (fun (x : Nat) => toString (x) ++ \" \") (10)\n\n#eval example1\n","language":"Lean"},{"code":"rep \"answer\",3\n\ncommand rep x,n\n repeat n times\n do merge(\"[[x]] [[n]]\")\n end repeat\nend rep\n","language":"LiveCode"},{"code":"function myFunc ()\n print(\"Sure looks like a function in here...\")\nend\n\nfunction rep (func, times)\n for count = 1, times do\n func()\n end\nend\n\nrep(myFunc, 4)\n","language":"Lua"},{"code":"repeat[f_, n_] := Do[f[], {n}];\nrepeat[Print[\"Hello, world!\"] &, 5];\n","language":"Mathematica"},{"code":"(\"Hello\" puts!) 3 times\n","language":"Min"},{"code":"sayHi = function()\n print \"Hi!\"\nend function\n\nrep = function(f, n)\n for i in range(1, n)\n f\n end for\nend function\n\nrep @sayHi, 3\n","language":"MiniScript"},{"code":"MODULE Repeat;\nFROM Terminal IMPORT WriteString,WriteLn,ReadChar;\n\nTYPE F = PROCEDURE;\n\nPROCEDURE Repeat(fun : F; c : INTEGER);\nVAR i : INTEGER;\nBEGIN\n FOR i:=1 TO c DO\n fun\n END\nEND Repeat;\n\nPROCEDURE Print;\nBEGIN\n WriteString(\"Hello\");\n WriteLn\nEND Print;\n\nBEGIN\n Repeat(Print, 3);\n\n ReadChar\nEND Repeat.\n","language":"Modula-2"},{"code":"def repeat(f,n)\n for i in range(1, n)\n f()\n end\nend\n\ndef procedure()\n println \"Example\"\nend\n\nrepeat(procedure, 3)\n","language":"Nanoquery"},{"code":"proc example =\n echo \"Example\"\n\n# Ordinary procedure\nproc repeatProc(fn: proc, n: int) =\n for x in 0..<n:\n fn()\n\nrepeatProc(example, 4)\n\n# Template (code substitution), simplest form of metaprogramming\n# that Nim has\ntemplate repeatTmpl(n: int, body: untyped): untyped =\n for x in 0..<n:\n body\n\n# This gets rewritten into a for loop\nrepeatTmpl 4:\n example()\n\nimport std/macros\n# A macro which takes some code block and returns code\n# with that code block repeated n times. Macros run at\n# compile-time\nmacro repeatMacro(n: static[int], body: untyped): untyped =\n result = newStmtList()\n\n for x in 0..<n:\n result.add body\n\n# This gets rewritten into 4 calls to example()\n# at compile-time\nrepeatMacro 4:\n example()\n","language":"Nim"},{"code":"class Repeat {\n function : Main(args : String[]) ~ Nil {\n Repeat(Example() ~ Nil, 3);\n }\n\n function : Repeat(e : () ~ Nil, i : Int) ~ Nil {\n while(i-- > 0) {\n e();\n };\n }\n\n function : Example() ~ Nil {\n \"Example\"->PrintLine();\n }\n}\n","language":"Objeck"},{"code":"let repeat ~f ~n =\n for i = 1 to n do\n f ()\n done\n\nlet func () =\n print_endline \"Example\"\n\nlet () =\n repeat ~n:4 ~f:func\n","language":"OCaml"},{"code":": hello \"Hello, World!\" println ;\n10 #hello times\n","language":"Oforth"},{"code":"; sample function\n(define (function) (display \"+\"))\n\n; simple case for 80 times\n(for-each (lambda (unused) (function)) (iota 80))\n(print) ; print newline\n; ==> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n\n; detailed case for 80 times\n(let loop ((fnc function) (n 80))\n (unless (zero? n)\n (begin\n (fnc)\n (loop fnc (- n 1)))))\n(print) ; print newline\n; ==> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n","language":"Ol"},{"code":"repeat(f, n)=for(i=1,n,f());\nrepeat( ()->print(\"Hi!\"), 2);\n","language":"PARI-GP"},{"code":"program Repeater;\n\ntype\n TProc = procedure(I: Integer);\n\nprocedure P(I: Integer);\nbegin\n WriteLn('Iteration ', I);\nend;\n\nprocedure Iterate(P: TProc; N: Integer);\nvar\n I: Integer;\nbegin\n for I := 1 to N do\n P(I);\nend;\n\nbegin\n Iterate(P, 3);\nend.\n","language":"Pascal"},{"code":"sub repeat {\n my ($sub, $n) = @_;\n $sub->() for 1..$n;\n}\n\nsub example {\n print \"Example\\n\";\n}\n\nrepeat(\\&example, 4);\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">Repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">rid</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">rid</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">Hello</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"Hello\"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #000000;\">Repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">Hello</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"def myFunc\n \"Sure looks like a function in here...\" print nl\nenddef\n\ndef rep /# func times -- #/\n for drop\n\tdup exec\n endfor\n drop\nenddef\n\ngetid myFunc 4 rep\n","language":"Phixmonti"},{"code":"# The built-in function \"do\" can be used to achieve our goal,\n# however, it has a slightly different syntax than what the\n# problem specifies.\n\n# Native solution.\n(do 10 (version))\n\n# Our solution.\n(de dofn (Fn N)\n (do N (Fn)) )\n\n(dofn version 10)\n","language":"PicoLisp"},{"code":"function Out-Example\n{\n \"Example\"\n}\n\nfunction Step-Function ([string]$Function, [int]$Repeat)\n{\n for ($i = 1; $i -le $Repeat; $i++)\n {\n \"$(Invoke-Expression -Command $Function) $i\"\n }\n}\n\nStep-Function Out-Example -Repeat 3\n","language":"PowerShell"},{"code":"repeat(_, 0).\nrepeat(Callable, Times) :-\n\tsucc(TimesLess1, Times),\n\tCallable,\n\trepeat(Callable, TimesLess1).\n\ntest :- write('Hello, World'), nl.\t\ntest(Name) :- format('Hello, ~w~n', Name).\n","language":"Prolog"},{"code":"Prototype.i fun(x.i)\n\nProcedure.i quark(z.i)\n Debug \"Quark \"+Str(z) : ProcedureReturn z-1\nEndProcedure\n\nProcedure rep(q.fun,n.i)\n Repeat : n=q(n) : Until n=0\nEndProcedure\n\nrep(@quark(),3)\n","language":"PureBasic"},{"code":"#!/usr/bin/python\ndef repeat(f,n):\n for i in range(n):\n f();\n\ndef procedure():\n print(\"Example\");\n\nrepeat(procedure,3); #prints \"Example\" (without quotes) three times, separated by newlines.\n","language":"Python"},{"code":"'''Application of a given function, repeated N times'''\n\nfrom itertools import repeat\nfrom functools import reduce\nfrom inspect import getsource\n\n\n# applyN :: Int -> (a -> a) -> a -> a\ndef applyN(n):\n '''n compounding applications of the supplied\n function f. Equivalent to Church numeral n.\n '''\n def go(f):\n return lambda x: reduce(\n lambda a, g: g(a), repeat(f, n), x\n )\n return lambda f: go(f)\n\n\n# MAIN ----------------------------------------------------\ndef main():\n '''Tests - compounding repetition\n of function application.\n '''\n def f(x):\n return x + 'Example\\n'\n\n def g(x):\n return 2 * x\n\n def h(x):\n return 1.05 * x\n\n print(\n fTable(__doc__ + ':')(\n lambda fx: '\\nRepeated * 3:\\n (' + (\n getsource(fst(fx)).strip() + ')(' +\n repr(snd(fx)) + ')'\n )\n )(str)(\n liftA2(applyN(3))(fst)(snd)\n )([(f, '\\n'), (g, 1), (h, 100)])\n )\n\n\n# GENERIC -------------------------------------------------\n\n# compose (<<<) :: (b -> c) -> (a -> b) -> a -> c\ndef compose(g):\n '''Right to left function composition.'''\n return lambda f: lambda x: g(f(x))\n\n\n# fst :: (a, b) -> a\ndef fst(tpl):\n '''First member of a pair.'''\n return tpl[0]\n\n\n# liftA2 :: (a0 -> b -> c) -> (a -> a0) -> (a -> b) -> a -> c\ndef liftA2(op):\n '''Lift a binary function to a composition\n over two other functions.\n liftA2 (*) (+ 2) (+ 3) 7 == 90\n '''\n def go(f, g):\n return lambda x: op(\n f(x)\n )(g(x))\n return lambda f: lambda g: go(f, g)\n\n\n# snd :: (a, b) -> b\ndef snd(tpl):\n '''Second member of a pair.'''\n return tpl[1]\n\n\n# fTable :: String -> (a -> String) ->\n# (b -> String) -> (a -> b) -> [a] -> String\ndef fTable(s):\n '''Heading -> x display function -> fx display function ->\n f -> xs -> tabular string.\n '''\n def go(xShow, fxShow, f, xs):\n ys = [xShow(x) for x in xs]\n w = max(map(len, ys))\n return s + '\\n' + '\\n'.join(map(\n lambda x, y: y.rjust(w, ' ') + ' -> ' + fxShow(f(x)),\n xs, ys\n ))\n return lambda xShow: lambda fxShow: lambda f: lambda xs: go(\n xShow, fxShow, f, xs\n )\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"DECLARE SUB rep (func AS STRING, c AS INTEGER)\nDECLARE SUB proc ()\n\nCALL rep(\"proc\", 5)\nPRINT \"Loop Ended\"\n\nSUB proc\n\tPRINT \" Inside loop\"\nEND SUB\n\nSUB rep (func AS STRING, c AS INTEGER)\n\tFOR i = 1 TO c\n\t\tproc\n\tNEXT\nEND SUB\n","language":"QBasic"},{"code":" [ stack ] is times.start ( --> s )\n protect times.start\n\n [ stack ] is times.count ( --> s )\n protect times.count\n\n [ stack ] is times.action ( --> s )\n protect times.action\n\n [ ]'[ times.action put\n dup times.start put\n [ 1 - dup -1 > while\n times.count put\n times.action share do\n times.count take again ]\n drop\n times.action release\n times.start release ] is times ( n --> )\n\n [ times.count share ] is i ( --> n )\n\n [ times.start share i 1+ - ] is i^ ( --> n )\n\n [ 0 times.count replace ] is conclude ( --> )\n\n [ times.start share\n times.count replace ] is refresh ( --> )\n\n [ times.count take 1+\n swap - times.count put ] is step ( --> s )\n\n [ nested ' times nested\n swap join do ] is rosetta-times ( n x --> )\n","language":"Quackery"},{"code":"f1 <- function(...){print(\"coucou\")}\n\nf2 <-function(f,n){\nlapply(seq_len(n),eval(f))\n}\n\nf2(f1,4)\n","language":"R"},{"code":"#lang racket/base\n(define (repeat f n) ; the for loop is idiomatic of (although not exclusive to) racket\n (for ((_ n)) (f)))\n\n(define (repeat2 f n) ; This is a bit more \"functional programmingy\"\n (when (positive? n) (f) (repeat2 f (sub1 n))))\n\n(display \"...\")\n(repeat (λ () (display \" and over\")) 5)\n(display \"...\")\n(repeat2 (λ () (display \" & over\")) 5)\n(newline)\n","language":"Racket"},{"code":"sub repeat (&f, $n) { f() xx $n };\n\nsub example { say rand }\n\nrepeat(&example, 3);\n","language":"Raku"},{"code":"Red[]\n\nmyrepeat: function [fn n] [loop n [do fn]]\n\nmyrepeat [print \"hello\"] 3\n","language":"Red"},{"code":"/*REXX program executes a named procedure a specified number of times. */\nparse arg pN # . /*obtain optional arguments from the CL*/\nif #=='' | #==\",\" then #= 1 /*assume once if not specified. */\nif pN\\=='' then call repeats pN, # /*invoke the REPEATS procedure for pN.*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nrepeats: procedure; parse arg x,n /*obtain the procedureName & # of times*/\n do n; interpret 'CALL' x; end /*repeat the invocation N times. */\n return /*return to invoker of the REPEATS proc*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nyabba: say 'Yabba, yabba do!'; return /*simple code; no need for PROCEDURE.*/\n","language":"REXX"},{"code":"Func Main\n times(5,:test)\n\nFunc Test\n see \"Message from the test function!\" + nl\n\nFunc Times nCount, F\n for x = 1 to nCount\n Call F()\n next\n","language":"Ring"},{"code":"4.times{ puts \"Example\" } # idiomatic way\n\ndef repeat(proc,num)\n num.times{ proc.call }\nend\n\nrepeat(->{ puts \"Example\" }, 4)\n","language":"Ruby"},{"code":"fn repeat(f: impl FnMut(usize), n: usize) {\n (0..n).for_each(f);\n}\n","language":"Rust"},{"code":"fn main() {\n repeat(|x| print!(\"{};\", x), 5);\n}\n","language":"Rust"},{"code":"fn function(x: usize) {\n print!(\"{};\", x);\n}\n\nfn main() {\n repeat(function, 4);\n}\n","language":"Rust"},{"code":"struct Foo;\nimpl Foo {\n fn associated(x: usize) {\n print!(\"{};\", x);\n }\n}\n\nfn main() {\n repeat(Foo::associated, 8);\n}\n","language":"Rust"},{"code":"trait Bar {\n fn run(self);\n}\n\nimpl Bar for usize {\n fn run(self) {\n print!(\"{};\", self);\n }\n}\n\nfn main() {\n repeat(Bar::run, 6);\n}\n","language":"Rust"},{"code":"fn repeat(f: impl FnMut(usize), n: usize) {\n (0..n).for_each(f);\n}\n\nfn main() {\n let mut mult = 1;\n repeat(|x| {\n print!(\"{};\", x * mult);\n mult += x;\n }, 5);\n}\n","language":"Rust"},{"code":" def repeat[A](n:Int)(f: => A)= ( 0 until n).foreach(_ => f)\n\n repeat(3) { println(\"Example\") }\n","language":"Scala"},{"code":"object Repeat2 extends App {\n\n implicit class IntWithTimes(x: Int) {\n def times[A](f: => A):Unit = {\n @tailrec\n def loop( current: Int): Unit =\n if (current > 0) {\n f\n loop(current - 1)\n }\n loop(x)\n }\n }\n\n 5 times println(\"ha\") // Not recommended infix for 5.times(println(\"ha\")) aka dot notation\n}\n","language":"Scala"},{"code":"import scala.annotation.tailrec\n\nobject Repeat3 extends App {\n\n implicit class UnitWithNtimes(f: => Unit) {\n def *[A](n: Int): Unit = { // Symbol * used instead of literal method name\n @tailrec\n def loop(current: Int): Unit =\n if (current > 0) {\n f\n loop(current - 1)\n }\n loop(n)\n }\n }\n\n print(\"ha\") * 5 // * is the method, effective should be A.*(5)\n}\n","language":"Scala"},{"code":"(import (scheme base)\n (scheme write))\n\n(define (repeat proc n)\n (do ((i 0 (+ 1 i))\n (res '() (cons (proc) res)))\n ((= i n) res)))\n\n;; example returning an unspecified value\n(display (repeat (lambda () (display \"hi\\n\")) 4)) (newline)\n\n;; example returning a number\n(display (repeat (lambda () (+ 1 2)) 5)) (newline)\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n\nconst proc: myRepeat (in integer: times, in proc: aProcedure) is func\n local\n var integer: n is 0;\n begin\n for n range 1 to times do\n aProcedure;\n end for;\n end func;\n\nconst proc: main is func\n begin\n myRepeat(3, writeln(\"Hello!\"));\n end func;\n","language":"Seed7"},{"code":"func repeat(f, n) {\n { f() } * n;\n}\n\nfunc example {\n say \"Example\";\n}\n\nrepeat(example, 4);\n","language":"Sidef"},{"code":"fun repeat (_, 0) = ()\n | repeat (f, n) = (f (); repeat (f, n - 1))\n\nfun testProcedure () =\n print \"test\\n\"\n\nval () = repeat (testProcedure, 5)\n","language":"Standard-ML"},{"code":"function repeat(f,n) {\n\tfor (i=1; i<=n; i++) (*f)()\n}\n\nfunction hello() {\n\tprintf(\"Hello\\n\")\n}\n\nrepeat(&hello(),3)\n","language":"Stata"},{"code":"func repeat(n: Int, f: () -> ()) {\n for _ in 0..<n {\n f()\n }\n}\n\nrepeat(4) { println(\"Example\") }\n","language":"Swift"},{"code":"proc repeat {command count} {\n for {set i 0} {$i < $count} {incr i} {\n uplevel 1 $command\n }\n}\n\nproc example {} {puts \"This is an example\"}\nrepeat example 4\n","language":"Tcl"},{"code":"time example 4\n","language":"Tcl"},{"code":"repeat {puts \"hello world\"} 3\n","language":"Tcl"},{"code":"SUB proc\n PRINT \" Inside loop\"\nEND SUB\n\nSUB rep (func$, c)\n FOR i = 1 to c\n CALL proc\n NEXT i\nEND SUB\n\nCALL rep (\"proc\", 5)\nPRINT \"Loop Ended\"\nEND\n","language":"True-BASIC"},{"code":"def repeat (function f, int n)\n\tfor (set n n) (> n 0) (dec n)\n\t\tf\n\tend for\nend repeat\n\ndef procedure ()\n\tout \"Hello! \" console\nend procedure\n\n# outputs \"Hello! \" 5 times\nrepeat procedure 5\n","language":"Ursa"},{"code":"fn repeat(n int, f fn()) {\n for _ in 0.. n {\n f()\n }\n}\n\nfn func() {\n println(\"Example\")\n}\n\nfn main() {\n repeat(4, func)\n}\n","language":"V-(Vlang)"},{"code":"Private Sub Repeat(rid As String, n As Integer)\n For i = 1 To n\n Application.Run rid\n Next i\nEnd Sub\n\nPrivate Sub Hello()\n Debug.Print \"Hello\"\nEnd Sub\n\nPublic Sub main()\n Repeat \"Hello\", 5\nEnd Sub\n","language":"VBA"},{"code":"module main;\n initial begin\n repeat(5) begin\n $display(\"Inside loop\");\n end\n $display(\"Loop Ended\");\n end\nendmodule\n","language":"Verilog"},{"code":"Module Module1\n\n Sub Repeat(count As Integer, fn As Action(Of Integer))\n If IsNothing(fn) Then\n Throw New ArgumentNullException(\"fn\")\n End If\n\n For i = 1 To count\n fn.Invoke(i)\n Next\n End Sub\n\n Sub Main()\n Repeat(3, Sub(x) Console.WriteLine(\"Example {0}\", x))\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"var f = Fn.new { |g, n|\n for (i in 1..n) g.call(n)\n}\n\nvar g = Fn.new { |k|\n for (i in 1..k) System.write(\"%(i) \")\n System.print()\n}\n\nf.call(g, 5)\n","language":"Wren"},{"code":"PROGRAM\t\"Repeat\"\nVERSION\t\"0.0000\"\n\nDECLARE FUNCTION Entry ()\nDECLARE FUNCTION Proc ()\nDECLARE FUNCTION Repe (func$, c)\n\nFUNCTION Entry ()\n Repe (\"proc\", 5)\nPRINT \"Loop Ended\"\n\nEND FUNCTION\n\nFUNCTION Proc ()\n PRINT \" Inside loop\"\nEND FUNCTION\n\nFUNCTION Repe (func$, c)\n FOR i = 1 TO c\n Proc ()\n NEXT i\nEND FUNCTION\nEND PROGRAM\n","language":"XBasic"},{"code":"func rep(callback:function,amount:number,*args:array=[]):null{\n\trepeat amount {\n\t\tcallback(*args);\n\t}\n}\n\nrep(func(a,b,c){\n\tlog(a+b+c);\n},3,1,2,3);\n","language":"XBS"},{"code":"(defun repeat (f n)\n (f)\n (if (> n 1)\n (repeat f (- n 1)) ) )\n\n;; an example to test it:\n(repeat (lambda () (print '(hello rosetta code))) 5)\n","language":"XLISP"},{"code":"sub myFunc ()\n print \"Sure looks like a function in here...\"\nend sub\n\nsub rep (func$, times)\n for count = 1 to times\n execute(func$)\n next\nend sub\n\nrep(\"myFunc\", 4)\n","language":"Yabasic"},{"code":"ld b,&05 ;load the decrement value into b\nld hl,myFunc ;load the address of \"myFunc\" into HL\n\ncall repeatProcedure\n\nforever:\njp forever ;trap the program counter here\n\nrepeatProcedure: ;input: b = times to repeat, hl = which procedure to repeat\ncall trampoline\n; the \"ret\" in myFunc will bring you here\ndjnz repeatProcedure\nret ;exit \"repeatProcedure\" and proceed to \"forever\"\n\ntrampoline:\npush hl\nret\n;this is effectively a call to whatever is in HL, in this case \"myFunc.\" The \"ret\" at the end of myFunc will return us to\n;just after the line \"call trampoline\"\n\n\nmyFunc: ;this doesn't do anything useful but that's not the point\npush hl ;not needed for this routine but if it altered HL we would need this so that we come back here next time we loop\nor a\npop hl\nret\n","language":"Z80-Assembly"},{"code":"trampoline:\njp (hl) ;despite the parentheses this does NOT dereference HL, it merely acts as \"LD PC,HL\".\n","language":"Z80-Assembly"},{"code":"LD HL,myFunc\nLD (repeatproc+1),HL\nLD B,5 ;repeat count\nCALL repeatProc\n\n;somewhere far away from here:\nrepeatProc:\ncall &0000 ;gets overwritten with the address of MyFunc\ndjnz repeatProc\nret\n","language":"Z80-Assembly"},{"code":"fcn repeat(f,n){ do(n){ f() } }\nrepeat(\"ho \".print,3);\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Repeat\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nWrite a procedure which accepts as arguments another procedure and a positive integer. \\n\\nThe latter procedure is executed a number of times equal to the accepted integer.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F repeat(f, n)\\n L 1..n\\n f()\\n\\nF procedure()\\n print(‘Example’)\\n\\nrepeat(procedure, 3)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"macro RepeatProc,addr,count ;VASM macro syntax\\n; input:\\n; addr = the label of the routine you wish to call repeatedly\\n; count = how many times you want to DO the procedure. 1 = once, 2 = twice, 3 = three times, etc. Enter \\\"0\\\" for 256 times.\\nlda #<\\\\addr\\nsta z_L ;a label for a zero-page memory address\\nlda #>\\\\addr\\nsta z_H ;a label for the zero-page memory address immediately after z_L\\nlda \\\\count\\njsr doRepeatProc\\nendm\\n\\ndoRepeatProc:\\nsta z_C ;another zero-page memory location\\nloop_RepeatProc:\\njsr Trampoline_RepeatProc\\ndec z_C\\nlda z_C\\nbne loop_RepeatProc\\nrts\\n\\nTrampoline_RepeatProc:\\ndb $6c,z_L,$00\\n;when executed, becomes an indirect JMP to the address stored at z_L and z_H. Some assemblers will let you type\\n;JMP (z_L) and it will automatically replace it with the above during the assembly process.\\n;This causes an indirect JMP to the routine. Its RTS will return execution to just after the \\\"JSR Trampoline_RepeatProc\\\"\\n;and flow into the loop overhead.\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"RepeatProc foo,#20 ;perform the subroutine \\\"foo\\\" twenty times.\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"RepeatProc:\\n;input: low byte of desired function address in A\\n; high byte of desired function address in X\\n; repeat count in Y\\n\\nSTA smc_repeatproc+1\\nSTX smc_repeatproc+2\\nsmc_repeatproc:\\njsr $0000 ;this is modified by the STA and STX above.\\ndey\\nbne smc_repeatproc\\nrts\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"\\tlea foo,a5 ;function to execute\\n\\tmove.w #4-1,d7 ;times to repeat\\n\\tjsr Repeater\\n\\t\\n\\tjmp * ;halt the CPU, we're done\\n\\t\\nrepeater:\\n\\tjsr repeaterhelper ;this also need to be a call, so that the RTS of the desired procedure\\n ;returns us to the loop rather than the line after \\\"jsr Repeater\\\".\\n\\tDBRA D7,repeater\\n\\trts\\n\\t\\nrepeaterhelper:\\n\\tjmp (a5) ;keep in mind, this is NOT a dereference, it simply sets the program counter equal to A5.\\n ;A bit misleading if you ask me.\\nfoo:\\n\\tMOVE.B #'!',D0\\n\\tJSR PrintChar\\n\\trts\\n\",\n \"language\": \"68000-Assembly\"\n },\n {\n \"code\": \"DEFINE PTR=\\\"CARD\\\"\\n\\nPROC OutputText(CHAR ARRAY s)\\n PrintE(s)\\nRETURN\\n\\nPROC Procedure=*(CHAR ARRAY s)\\n DEFINE JSR=\\\"$20\\\"\\n DEFINE RTS=\\\"$60\\\"\\n [JSR $00 $00 ;JSR to address set by SetProcedure\\n RTS]\\n\\nPROC SetProcedure(PTR p)\\n PTR addr\\n\\n addr=Procedure+1 ;location of address of JSR\\n PokeC(addr,p)\\nRETURN\\n\\nPROC Repeat(PTR procFun CHAR ARRAY s BYTE n)\\n BYTE i\\n\\n SetProcedure(procFun)\\n FOR i=1 TO n\\n DO\\n Procedure(s)\\n OD\\nRETURN\\n\\nPROC Main()\\n Repeat(OutputText,\\\"Action!\\\",5)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\n\\nprocedure Repeat_Example is\\n\\n procedure Repeat(P: access Procedure; Reps: Natural) is\\n begin\\n for I in 1 .. Reps loop\\n\\t P.all; -- P points to a procedure, and P.all actually calls that procedure\\n end loop;\\n end Repeat;\\n\\n procedure Hello is\\n begin\\n Ada.Text_IO.Put(\\\"Hello! \\\");\\n end Hello;\\n\\nbegin\\n Repeat(Hello'Access, 3); -- Hello'Access points to the procedure Hello\\nend Repeat_Example;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# operator that executes a procedure the specified number of times #\\nOP REPEAT = ( INT count, PROC VOID routine )VOID:\\n TO count DO routine OD;\\n\\n# make REPEAT a low priority operater #\\nPRIO REPEAT = 1;\\n\\n\\n# can also create variant that passes the iteration count as a parameter #\\nOP REPEAT = ( INT count, PROC( INT )VOID routine )VOID:\\n FOR iteration TO count DO routine( iteration ) OD;\\n\\nmain: (\\n\\n # PROC to test the REPEAT operator with #\\n PROC say something = VOID: print( ( \\\"something\\\", newline ) );\\n\\n 3 REPEAT say something;\\n\\n # PROC to test the variant #\\n PROC show squares = ( INT n )VOID: print( ( n, n * n, newline ) );\\n\\n 3 REPEAT show squares\\n\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin\\n % executes the procedure routine the specified number of times %\\n procedure repeat ( integer value count; procedure routine ) ;\\n for i := 1 until count do routine;\\n begin\\n integer x;\\n % print \\\"hello\\\" three times %\\n repeat( 3, write( \\\"hello\\\" ) );\\n % print the first 10 squares %\\n write();\\n x := 1;\\n repeat( 10\\n , begin\\n writeon( i_w := s_w := 1, x * x );\\n x := x + 1\\n end\\n )\\n end\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"-- applyN :: Int -> (a -> a) -> a -> a\\non applyN(n, f, x)\\n script go\\n on |λ|(a, g)\\n |λ|(a) of mReturn(g)\\n end |λ|\\n end script\\n foldl(go, x, replicate(n, f))\\nend applyN\\n\\n\\n-------- SAMPLE FUNCTIONS FOR REPEATED APPLICATION --------\\n\\non double(x)\\n 2 * x\\nend double\\n\\n\\non plusArrow(s)\\n s & \\\" -> \\\"\\nend plusArrow\\n\\n\\non squareRoot(n)\\n n ^ 0.5\\nend squareRoot\\n\\n-------------------------- TESTS --------------------------\\non run\\n log applyN(10, double, 1)\\n --> 1024\\n\\n log applyN(5, plusArrow, \\\"\\\")\\n --> \\\" -> -> -> -> -> \\\"\\n\\n log applyN(3, squareRoot, 65536)\\n --> 4.0\\nend run\\n\\n\\n-------------------- GENERIC FUNCTIONS --------------------\\n\\n-- foldl :: (a -> b -> a) -> a -> [b] -> a\\non foldl(f, startValue, xs)\\n tell mReturn(f)\\n set v to startValue\\n set lng to length of xs\\n repeat with i from 1 to lng\\n set v to |λ|(v, item i of xs, i, xs)\\n end repeat\\n return v\\n end tell\\nend foldl\\n\\n\\n-- mReturn :: First-class m => (a -> b) -> m (a -> b)\\non mReturn(f)\\n -- 2nd class handler function lifted into 1st class script wrapper.\\n if script is class of f then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\\n-- Egyptian multiplication - progressively doubling a list, appending\\n-- stages of doubling to an accumulator where needed for binary\\n-- assembly of a target length\\n-- replicate :: Int -> a -> [a]\\non replicate(n, a)\\n set out to {}\\n if 1 > n then return out\\n set dbl to {a}\\n\\n repeat while (1 < n)\\n if 0 < (n mod 2) then set out to out & dbl\\n set n to (n div 2)\\n set dbl to (dbl & dbl)\\n end repeat\\n return out & dbl\\nend replicate\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"print \\\"---------------------------\\\"\\nprint \\\"As a loop\\\"\\nprint \\\"---------------------------\\\"\\nloop 4 'x ->\\n print \\\"Example 1\\\"\\n\\nrepeatFunc: function [f,times][\\n loop times 'x ->\\n do f\\n]\\n\\nprint \\\"---------------------------\\\"\\nprint \\\"With a block param\\\"\\nprint \\\"---------------------------\\\"\\nrepeatFunc [print \\\"Example 2\\\"] 4\\n\\nrepeatFunc: function [f,times][\\n loop times 'x ->\\n f\\n]\\n\\nprint \\\"---------------------------\\\"\\nprint \\\"With a function param\\\"\\nprint \\\"---------------------------\\\"\\nrepeatFunc $[][print \\\"Example 3\\\"] 4\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"repeat(\\\"fMsgBox\\\",3)\\nreturn\\n\\nrepeat(f, n){\\n\\tloop % n\\n\\t\\t%f%()\\n}\\n\\nfMsgBox(){\\n\\tMsgBox hello\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f REPEAT.AWK\\nBEGIN {\\n for (i=0; i<=3; i++) {\\n f = (i % 2 == 0) ? \\\"even\\\" : \\\"odd\\\"\\n @f(i) # indirect function call\\n }\\n exit(0)\\n}\\nfunction even(n, i) {\\n for (i=1; i<=n; i++) {\\n printf(\\\"inside even %d\\\\n\\\",n)\\n }\\n}\\nfunction odd(n, i) {\\n for (i=1; i<=n; i++) {\\n printf(\\\"inside odd %d\\\\n\\\",n)\\n }\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"subroutine proc()\\n\\tprint \\\" Inside loop\\\"\\nend subroutine\\n\\nsubroutine repeat(func, times)\\n\\tfor i = 1 to times\\n\\t\\tcall proc()\\n\\tnext\\nend subroutine\\n\\ncall repeat(\\\"proc\\\", 5)\\nprint \\\"Loop Ended\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off\\n\\n:_main\\nsetlocal\\ncall:_func1 _func2 3\\npause>nul\\nexit/b\\n\\n:_func1\\nsetlocal enabledelayedexpansion\\nfor /l %%i in (1,1,%2) do call:%1\\nexit /b\\n\\n:_func2\\nsetlocal\\necho _func2 has been executed\\nexit /b\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \"•Show {2+𝕩}⍟3 1\\n\\n_repeat_ ← {(𝕘>0)◶⊢‿(𝔽_𝕣_(𝕘-1)𝔽)𝕩}\\n\\n•Show {2+𝕩} _repeat_ 3 1\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"7\\n7\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nvoid repeat(void (*f)(void), unsigned int n) {\\n while (n-->0)\\n (*f)(); //or just f()\\n}\\n\\nvoid example() {\\n printf(\\\"Example\\\\n\\\");\\n}\\n\\nint main(int argc, char *argv[]) {\\n repeat(example, 4);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"template <typename Function>\\nvoid repeat(Function f, unsigned int n) {\\n for(unsigned int i=n; 0<i; i--)\\n f();\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <iostream>\\nvoid example() {\\n std::cout << \\\"Example\\\\n\\\";\\n}\\n\\nrepeat(example, 4);\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \" repeat([]{std::cout << \\\"Example\\\\n\\\";}, 4);\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nnamespace Repeat {\\n class Program {\\n static void Repeat(int count, Action<int> fn) {\\n if (null == fn) {\\n throw new ArgumentNullException(\\\"fn\\\");\\n }\\n for (int i = 0; i < count; i++) {\\n fn.Invoke(i + 1);\\n }\\n }\\n\\n static void Main(string[] args) {\\n Repeat(3, x => Console.WriteLine(\\\"Example {0}\\\", x));\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"10 sub proc()\\n20 print \\\" Inside loop\\\"\\n30 end sub\\n40 sub repeat(func$,times)\\n50 for i = 1 to times\\n60 proc()\\n70 next i\\n80 end sub\\n90 repeat(\\\"proc\\\",5)\\n100 print \\\"Loop Ended\\\"\\n110 end\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"(defn repeat-function [f n]\\n (dotimes [i n] (f)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defun repeat (f n)\\n (dotimes (i n) (funcall f)))\\n\\n(repeat (lambda () (format T \\\"Example~%\\\")) 5)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\n# Only functions that implement an interface can be passed around\\n# The interface is a type and must be defined before it is used\\n# This defines an interface for a function that takes no arguments\\ninterface Fn();\\n\\n# This function repeats a function that implements Fn\\nsub Repeat(f: Fn, n: uint32) is\\n while n != 0 loop\\n f();\\n n := n - 1;\\n end loop;\\nend sub;\\n\\n# Here is a function\\nsub Foo implements Fn is\\n print(\\\"foo \\\");\\nend sub;\\n\\n# Prints \\\"foo foo foo foo\\\"\\nRepeat(Foo, 4);\\nprint_nl();\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"void repeat(void function() fun, in uint times) {\\n foreach (immutable _; 0 .. times)\\n fun();\\n}\\n\\nvoid procedure() {\\n import std.stdio;\\n \\\"Example\\\".writeln;\\n}\\n\\nvoid main() {\\n repeat(&procedure, 3);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Repeater;\\n\\n{$APPTYPE CONSOLE}\\n{$R *.res}\\n\\ntype\\n TSimpleProc = procedure; // Can also define types for procedures (& functions) which\\n // require params.\\n\\nprocedure Once;\\nbegin\\n writeln('Hello World');\\nend;\\n\\nprocedure Iterate(proc : TSimpleProc; Iterations : integer);\\nvar\\n i : integer;\\nbegin\\n for i := 1 to Iterations do\\n proc;\\nend;\\n\\nbegin\\n Iterate(Once, 3);\\n readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"program Repeater;\\n\\n{$APPTYPE CONSOLE}\\n{$R *.res}\\n\\nuses\\n System.SysUtils;\\n\\nprocedure Iterate(proc: TProc; Iterations: integer);\\nvar\\n i: integer;\\nbegin\\n for i := 1 to Iterations do\\n proc;\\nend;\\n\\nbegin\\n Iterate(\\n procedure\\n begin\\n writeln('Hello World');\\n end, 3);\\n readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"(define (repeat f n) (for ((i n)) (f)))\\n\\n(repeat (lambda () (write (random 1000))) 5)\\n → 287 798 930 989 794\\n\\n;; Remark\\n;; It is also possible to iterate a function : f(f(f(f( ..(f x)))))\\n(define cos10 (iterate cos 10)\\n(define cos100 (iterate cos10 10))\\n(cos100 0.6)\\n → 0.7390851332151605\\n(cos 0.7390851332151605)\\n → 0.7390851332151608 ;; fixed point found\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"open System\\n\\nlet Repeat c f =\\n for _ in 1 .. c do\\n f()\\n\\nlet Hello _ =\\n printfn \\\"Hello world\\\"\\n\\n[<EntryPoint>]\\nlet main _ =\\n Repeat 3 Hello\\n\\n 0 // return an integer exit code\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"3 [ \\\"Hello!\\\" print ] times\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": times ( ... n quot: ( ... -- ... ) -- ... )\\n [ drop ] prepose each-integer ; inline\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"(= repeat (mac (i n . body)\\n (list 'do\\n (list 'let i 0)\\n (list 'while (list '< i n)\\n (list '= i (list '+ i 1))\\n (cons 'do body)))))\\n\\n; print multiplication table\\n(repeat i 10\\n (repeat j 10\\n (print i \\\"x\\\" j \\\"=\\\" (* i j)))\\n (print))\\n\",\n \"language\": \"Fe\"\n },\n {\n \"code\": \": times ( xt n -- )\\n 0 ?do dup execute loop drop ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": times { xt n -- }\\n n 0 ?do xt execute loop ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": times[ ]] 0 ?do [[ ; immediate compile-only\\n: ]times postpone loop ; immediate compile-only\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"[: cr .\\\" Hello\\\" ;] 3 times\\n\\n: 3-byes ( -- ) 3 times[ cr .\\\" Bye\\\" ]times ;\\n3-byes\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nSub proc()\\n Print \\\" proc called\\\"\\nEnd Sub\\n\\nSub repeat(s As Sub, n As UInteger)\\n For i As Integer = 1 To n\\n Print Using \\\"##\\\"; i;\\n s()\\n Next\\nEnd Sub\\n\\nrepeat(@proc, 5)\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"include \\\"NSLog.incl\\\"\\n\\nvoid local fn Example( value as long )\\n NSLog(@\\\"Example %ld\\\",value)\\nend fn\\n\\nvoid local fn DoIt( fnAddress as ptr, count as long )\\n def fn Repeat( j as long ) using fnAddress\\n\\n long i\\n for i = 1 to count\\n fn Repeat( i )\\n next\\nend fn\\n\\nfn DoIt( @fn Example, 3 )\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"Public Sub Main()\\n\\n RepeatIt(\\\"RepeatableOne\\\", 2)\\n\\n RepeatIt(\\\"RepeatableTwo\\\", 3)\\n\\nEnd\\n\\n'Cannot pass procedure pointer in Gambas; must pass procedure name and use Object.Call()\\nPublic Sub RepeatIt(sDelegateName As String, iCount As Integer)\\n\\n For iCounter As Integer = 1 To iCount\\n Object.Call(Me, sDelegateName, [])\\n Next\\n\\nEnd\\n\\nPublic Sub RepeatableOne()\\n\\n Print \\\"RepeatableOne\\\"\\n\\nEnd\\n\\nPublic Sub RepeatableTwo()\\n\\n Print \\\"RepeatableTwo\\\"\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc repeat(n int, f func()) {\\n for i := 0; i < n; i++ {\\n f()\\n }\\n}\\n\\nfunc fn() {\\n fmt.Println(\\\"Example\\\")\\n}\\n\\nfunc main() {\\n repeat(4, fn)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"100 let f$ = \\\"proc\\\"\\n110 let c = 5\\n120 gosub 170\\n130 print \\\"Loop Ended\\\"\\n140 goto 220\\n150 print \\\" Inside loop\\\"\\n160 return\\n170 rem repeat(f$,c)\\n180 for i = 1 to c\\n190 gosub 150\\n200 next i\\n210 return\\n220 end\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \"import Control.Monad (replicateM_)\\n\\nsampleFunction :: IO ()\\nsampleFunction = putStrLn \\\"a\\\"\\n\\nmain = replicateM_ 5 sampleFunction\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"applyN :: Int -> (a -> a) -> a -> a\\napplyN n f = foldr (.) id (replicate n f)\\n\\nmain :: IO ()\\nmain = print $ applyN 10 (\\\\x -> 2 * x) 1\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"theory Scratch\\n imports Main\\nbegin\\n\\ntext‹\\nGiven the function we want to execute multiple times is of\\ntype \\\\<^typ>‹unit ⇒ unit›.\\n›\\nfun pure_repeat :: \\\"(unit ⇒ unit) ⇒ nat ⇒ unit\\\" where\\n \\\"pure_repeat _ 0 = ()\\\"\\n| \\\"pure_repeat f (Suc n) = f (pure_repeat f n)\\\"\\n\\ntext‹\\nFunctions are pure in Isabelle. They don't have side effects.\\nThis means, the \\\\<^const>‹pure_repeat› we implemented is always equal\\nto \\\\<^term>‹() :: unit›, independent of the function \\\\<^typ>‹unit ⇒ unit›\\nor \\\\<^typ>‹nat›.\\nTechnically, functions are not even \\\"executed\\\", but only evaluated.\\n›\\nlemma \\\"pure_repeat f n = ()\\\" by simp\\n\\ntext‹\\nBut we can repeat a value of \\\\<^typ>‹'a› \\\\<^term>‹n› times and return the result\\nin a list of length \\\\<^term>‹n›\\n›\\nfun repeat :: \\\"'a ⇒ nat ⇒ 'a list\\\" where\\n \\\"repeat _ 0 = []\\\"\\n| \\\"repeat f (Suc n) = f # (repeat f n)\\\"\\n\\nlemma \\\"repeat ''Hello'' 4 = [''Hello'', ''Hello'', ''Hello'', ''Hello'']\\\"\\n by code_simp\\n\\nlemma \\\"length (repeat a n) = n\\\" by(induction n) simp+\\n\\ntext‹\\nTechnically, \\\\<^typ>‹'a› is not a function. We can wrap it in a dummy function\\nwhich takes a \\\\<^typ>‹unit› as first argument. This gives a function of type\\n\\\\<^typ>‹unit ⇒ 'a›.\\n›\\n\\nfun fun_repeat :: \\\"(unit ⇒ 'a) ⇒ nat ⇒ 'a list\\\" where\\n \\\"fun_repeat _ 0 = []\\\"\\n| \\\"fun_repeat f (Suc n) = (f ()) # (fun_repeat f n)\\\"\\n\\nlemma \\\"fun_repeat (λ_. ''Hello'') 4 =\\n [''Hello'', ''Hello'', ''Hello'', ''Hello'']\\\"\\n by code_simp\\n\\ntext‹\\nYet, \\\\<^const>‹fun_repeat› with the dummy function \\\\<^typ>‹unit ⇒ 'a› is\\nequivalent to \\\\<^const>‹repeat› with the value \\\\<^typ>‹'a› directly.\\n›\\nlemma \\\"fun_repeat (λ_. a) n = repeat a n\\\" by(induction n) simp+\\n\\nend\\n\",\n \"language\": \"Isabelle\"\n },\n {\n \"code\": \" NB. ^: (J's power conjunction) repeatedly evaluates a verb.\\n\\n NB. Appending to a vector the sum of the most recent\\n NB. 2 items can generate the Fibonacci sequence.\\n\\n (, [: +/ _2&{.) (^:4) 0 1\\n0 1 1 2 3 5\\n\\n\\n NB. Repeat an infinite number of times\\n NB. computes the stable point at convergence\\n\\n cosine =: 2&o.\\n\\n cosine (^:_ ) 2 NB. 2 is the initial value\\n0.739085\\n\\n cosine 0.739085 NB. demonstrate the stable point x==Cos(x)\\n0.739085\\n\\n\\n cosine^:(<_) 2 NB. show the convergence\\n2 _0.416147 0.914653 0.610065 0.819611 0.682506 0.775995 0.713725 0.755929 0.727635 0.74675 0.733901 0.742568 0.736735 0.740666 0.738019 0.739803 0.738602 0.739411 0.738866 0.739233 0.738986 0.739152 0.73904 0.739116 0.739065 0.739099 0.739076 0.739091 0.7...\\n\\n\\n # cosine^:(<_) 2 NB. iteration tallyft\\n78\\n\\n f =: 3 :'smoutput ''hi'''\\n\\n f''\\nhi\\n\\n NB. pass verbs via a gerund\\n repeat =: dyad def 'for_i. i.y do. (x`:0)0 end. EMPTY'\\n\\n (f`'')repeat 4\\nhi\\nhi\\nhi\\nhi\\n\\n\\n\\n NB. pass a verb directly to an adverb\\n\\n Repeat =: adverb def 'for_i. i.y do. u 0 end. EMPTY'\\n\\n f Repeat 4\\nhi\\nhi\\nhi\\nhi\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.lang.reflect.Method;\\n\\npublic class Program {\\n public static void main(String[] args) throws ReflectiveOperationException {\\n Method method = Program.class.getMethod(\\\"printRosettaCode\\\");\\n repeat(method, 5);\\n }\\n\\n public static void printRosettaCode() {\\n System.out.println(\\\"Rosetta Code\\\");\\n }\\n\\n public static void repeat(Method method, int count) throws ReflectiveOperationException {\\n while (count-- > 0)\\n method.invoke(null);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.util.function.Consumer;\\nimport java.util.stream.IntStream;\\n\\npublic class Repeat {\\n\\n public static void main(String[] args) {\\n repeat(3, (x) -> System.out.println(\\\"Example \\\" + x));\\n }\\n\\n static void repeat (int n, Consumer<Integer> fun) {\\n IntStream.range(0, n).forEach(i -> fun.accept(i + 1));\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"def unoptimized_repeat(f; n):\\n if n <= 0 then empty\\n else f, repeat(f; n-1)\\n end;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def repeat(f; n):\\n # state: [count, in]\\n def r:\\n if .[0] >= n then empty else (.[1] | f), (.[0] += 1 | r) end;\\n [0, .] | r;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# If n is a non-negative integer,\\n# then emit a stream of (n + 1) terms: ., f, f|f, f|f|f, ...\\ndef repeatedly(f; n):\\n # state: [count, in]\\n def r:\\n if .[0] < 0 then empty\\n else .[1], ([.[0] - 1, (.[1] | f)] | r)\\n end;\\n [n, .] | r;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"0 | [ repeat(.+1; 3) ]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"0 | repeatedly(.+1; 3)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function sayHi()\\n\\tprintln(\\\"Hi\\\")\\nend\\n\\nfunction rep(f, n)\\n\\tfor i = 1:n f() end\\nend\\n\\nrep(sayHi, 3)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nfun repeat(n: Int, f: () -> Unit) {\\n for (i in 1..n) {\\n f()\\n println(i)\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n repeat(5) { print(\\\"Example \\\") }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"def repeat : ℕ → (ℕ → string) → string\\n | 0 f := \\\"done\\\"\\n | (n + 1) f := (f n) ++ (repeat n f)\\n\\n\\n#eval repeat 5 $ λ b : ℕ , \\\"me \\\"\\n\",\n \"language\": \"Lean\"\n },\n {\n \"code\": \"def repeatf (f : Nat -> String) (n : Nat) : String :=\\n match n with\\n | 0 => \\\".\\\"\\n | (k + 1) => (f k) ++ (repeatf f k)\\n\\ndef example1 : String :=\\n repeatf (fun (x : Nat) => toString (x) ++ \\\" \\\") (10)\\n\\n#eval example1\\n\",\n \"language\": \"Lean\"\n },\n {\n \"code\": \"rep \\\"answer\\\",3\\n\\ncommand rep x,n\\n repeat n times\\n do merge(\\\"[[x]] [[n]]\\\")\\n end repeat\\nend rep\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"function myFunc ()\\n print(\\\"Sure looks like a function in here...\\\")\\nend\\n\\nfunction rep (func, times)\\n for count = 1, times do\\n func()\\n end\\nend\\n\\nrep(myFunc, 4)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"repeat[f_, n_] := Do[f[], {n}];\\nrepeat[Print[\\\"Hello, world!\\\"] &, 5];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"(\\\"Hello\\\" puts!) 3 times\\n\",\n \"language\": \"Min\"\n },\n {\n \"code\": \"sayHi = function()\\n print \\\"Hi!\\\"\\nend function\\n\\nrep = function(f, n)\\n for i in range(1, n)\\n f\\n end for\\nend function\\n\\nrep @sayHi, 3\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"MODULE Repeat;\\nFROM Terminal IMPORT WriteString,WriteLn,ReadChar;\\n\\nTYPE F = PROCEDURE;\\n\\nPROCEDURE Repeat(fun : F; c : INTEGER);\\nVAR i : INTEGER;\\nBEGIN\\n FOR i:=1 TO c DO\\n fun\\n END\\nEND Repeat;\\n\\nPROCEDURE Print;\\nBEGIN\\n WriteString(\\\"Hello\\\");\\n WriteLn\\nEND Print;\\n\\nBEGIN\\n Repeat(Print, 3);\\n\\n ReadChar\\nEND Repeat.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"def repeat(f,n)\\n for i in range(1, n)\\n f()\\n end\\nend\\n\\ndef procedure()\\n println \\\"Example\\\"\\nend\\n\\nrepeat(procedure, 3)\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"proc example =\\n echo \\\"Example\\\"\\n\\n# Ordinary procedure\\nproc repeatProc(fn: proc, n: int) =\\n for x in 0..<n:\\n fn()\\n\\nrepeatProc(example, 4)\\n\\n# Template (code substitution), simplest form of metaprogramming\\n# that Nim has\\ntemplate repeatTmpl(n: int, body: untyped): untyped =\\n for x in 0..<n:\\n body\\n\\n# This gets rewritten into a for loop\\nrepeatTmpl 4:\\n example()\\n\\nimport std/macros\\n# A macro which takes some code block and returns code\\n# with that code block repeated n times. Macros run at\\n# compile-time\\nmacro repeatMacro(n: static[int], body: untyped): untyped =\\n result = newStmtList()\\n\\n for x in 0..<n:\\n result.add body\\n\\n# This gets rewritten into 4 calls to example()\\n# at compile-time\\nrepeatMacro 4:\\n example()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"class Repeat {\\n function : Main(args : String[]) ~ Nil {\\n Repeat(Example() ~ Nil, 3);\\n }\\n\\n function : Repeat(e : () ~ Nil, i : Int) ~ Nil {\\n while(i-- > 0) {\\n e();\\n };\\n }\\n\\n function : Example() ~ Nil {\\n \\\"Example\\\"->PrintLine();\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"let repeat ~f ~n =\\n for i = 1 to n do\\n f ()\\n done\\n\\nlet func () =\\n print_endline \\\"Example\\\"\\n\\nlet () =\\n repeat ~n:4 ~f:func\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \": hello \\\"Hello, World!\\\" println ;\\n10 #hello times\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"; sample function\\n(define (function) (display \\\"+\\\"))\\n\\n; simple case for 80 times\\n(for-each (lambda (unused) (function)) (iota 80))\\n(print) ; print newline\\n; ==> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\\n\\n; detailed case for 80 times\\n(let loop ((fnc function) (n 80))\\n (unless (zero? n)\\n (begin\\n (fnc)\\n (loop fnc (- n 1)))))\\n(print) ; print newline\\n; ==> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"repeat(f, n)=for(i=1,n,f());\\nrepeat( ()->print(\\\"Hi!\\\"), 2);\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"program Repeater;\\n\\ntype\\n TProc = procedure(I: Integer);\\n\\nprocedure P(I: Integer);\\nbegin\\n WriteLn('Iteration ', I);\\nend;\\n\\nprocedure Iterate(P: TProc; N: Integer);\\nvar\\n I: Integer;\\nbegin\\n for I := 1 to N do\\n P(I);\\nend;\\n\\nbegin\\n Iterate(P, 3);\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"sub repeat {\\n my ($sub, $n) = @_;\\n $sub->() for 1..$n;\\n}\\n\\nsub example {\\n print \\\"Example\\\\n\\\";\\n}\\n\\nrepeat(\\\\&example, 4);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">Repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">rid</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">rid</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">Hello</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"Hello\\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #000000;\\\">Repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">Hello</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"def myFunc\\n \\\"Sure looks like a function in here...\\\" print nl\\nenddef\\n\\ndef rep /# func times -- #/\\n for drop\\n\\tdup exec\\n endfor\\n drop\\nenddef\\n\\ngetid myFunc 4 rep\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"# The built-in function \\\"do\\\" can be used to achieve our goal,\\n# however, it has a slightly different syntax than what the\\n# problem specifies.\\n\\n# Native solution.\\n(do 10 (version))\\n\\n# Our solution.\\n(de dofn (Fn N)\\n (do N (Fn)) )\\n\\n(dofn version 10)\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"function Out-Example\\n{\\n \\\"Example\\\"\\n}\\n\\nfunction Step-Function ([string]$Function, [int]$Repeat)\\n{\\n for ($i = 1; $i -le $Repeat; $i++)\\n {\\n \\\"$(Invoke-Expression -Command $Function) $i\\\"\\n }\\n}\\n\\nStep-Function Out-Example -Repeat 3\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"repeat(_, 0).\\nrepeat(Callable, Times) :-\\n\\tsucc(TimesLess1, Times),\\n\\tCallable,\\n\\trepeat(Callable, TimesLess1).\\n\\ntest :- write('Hello, World'), nl.\\t\\ntest(Name) :- format('Hello, ~w~n', Name).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Prototype.i fun(x.i)\\n\\nProcedure.i quark(z.i)\\n Debug \\\"Quark \\\"+Str(z) : ProcedureReturn z-1\\nEndProcedure\\n\\nProcedure rep(q.fun,n.i)\\n Repeat : n=q(n) : Until n=0\\nEndProcedure\\n\\nrep(@quark(),3)\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"#!/usr/bin/python\\ndef repeat(f,n):\\n for i in range(n):\\n f();\\n\\ndef procedure():\\n print(\\\"Example\\\");\\n\\nrepeat(procedure,3); #prints \\\"Example\\\" (without quotes) three times, separated by newlines.\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Application of a given function, repeated N times'''\\n\\nfrom itertools import repeat\\nfrom functools import reduce\\nfrom inspect import getsource\\n\\n\\n# applyN :: Int -> (a -> a) -> a -> a\\ndef applyN(n):\\n '''n compounding applications of the supplied\\n function f. Equivalent to Church numeral n.\\n '''\\n def go(f):\\n return lambda x: reduce(\\n lambda a, g: g(a), repeat(f, n), x\\n )\\n return lambda f: go(f)\\n\\n\\n# MAIN ----------------------------------------------------\\ndef main():\\n '''Tests - compounding repetition\\n of function application.\\n '''\\n def f(x):\\n return x + 'Example\\\\n'\\n\\n def g(x):\\n return 2 * x\\n\\n def h(x):\\n return 1.05 * x\\n\\n print(\\n fTable(__doc__ + ':')(\\n lambda fx: '\\\\nRepeated * 3:\\\\n (' + (\\n getsource(fst(fx)).strip() + ')(' +\\n repr(snd(fx)) + ')'\\n )\\n )(str)(\\n liftA2(applyN(3))(fst)(snd)\\n )([(f, '\\\\n'), (g, 1), (h, 100)])\\n )\\n\\n\\n# GENERIC -------------------------------------------------\\n\\n# compose (<<<) :: (b -> c) -> (a -> b) -> a -> c\\ndef compose(g):\\n '''Right to left function composition.'''\\n return lambda f: lambda x: g(f(x))\\n\\n\\n# fst :: (a, b) -> a\\ndef fst(tpl):\\n '''First member of a pair.'''\\n return tpl[0]\\n\\n\\n# liftA2 :: (a0 -> b -> c) -> (a -> a0) -> (a -> b) -> a -> c\\ndef liftA2(op):\\n '''Lift a binary function to a composition\\n over two other functions.\\n liftA2 (*) (+ 2) (+ 3) 7 == 90\\n '''\\n def go(f, g):\\n return lambda x: op(\\n f(x)\\n )(g(x))\\n return lambda f: lambda g: go(f, g)\\n\\n\\n# snd :: (a, b) -> b\\ndef snd(tpl):\\n '''Second member of a pair.'''\\n return tpl[1]\\n\\n\\n# fTable :: String -> (a -> String) ->\\n# (b -> String) -> (a -> b) -> [a] -> String\\ndef fTable(s):\\n '''Heading -> x display function -> fx display function ->\\n f -> xs -> tabular string.\\n '''\\n def go(xShow, fxShow, f, xs):\\n ys = [xShow(x) for x in xs]\\n w = max(map(len, ys))\\n return s + '\\\\n' + '\\\\n'.join(map(\\n lambda x, y: y.rjust(w, ' ') + ' -> ' + fxShow(f(x)),\\n xs, ys\\n ))\\n return lambda xShow: lambda fxShow: lambda f: lambda xs: go(\\n xShow, fxShow, f, xs\\n )\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"DECLARE SUB rep (func AS STRING, c AS INTEGER)\\nDECLARE SUB proc ()\\n\\nCALL rep(\\\"proc\\\", 5)\\nPRINT \\\"Loop Ended\\\"\\n\\nSUB proc\\n\\tPRINT \\\" Inside loop\\\"\\nEND SUB\\n\\nSUB rep (func AS STRING, c AS INTEGER)\\n\\tFOR i = 1 TO c\\n\\t\\tproc\\n\\tNEXT\\nEND SUB\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \" [ stack ] is times.start ( --> s )\\n protect times.start\\n\\n [ stack ] is times.count ( --> s )\\n protect times.count\\n\\n [ stack ] is times.action ( --> s )\\n protect times.action\\n\\n [ ]'[ times.action put\\n dup times.start put\\n [ 1 - dup -1 > while\\n times.count put\\n times.action share do\\n times.count take again ]\\n drop\\n times.action release\\n times.start release ] is times ( n --> )\\n\\n [ times.count share ] is i ( --> n )\\n\\n [ times.start share i 1+ - ] is i^ ( --> n )\\n\\n [ 0 times.count replace ] is conclude ( --> )\\n\\n [ times.start share\\n times.count replace ] is refresh ( --> )\\n\\n [ times.count take 1+\\n swap - times.count put ] is step ( --> s )\\n\\n [ nested ' times nested\\n swap join do ] is rosetta-times ( n x --> )\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"f1 <- function(...){print(\\\"coucou\\\")}\\n\\nf2 <-function(f,n){\\nlapply(seq_len(n),eval(f))\\n}\\n\\nf2(f1,4)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket/base\\n(define (repeat f n) ; the for loop is idiomatic of (although not exclusive to) racket\\n (for ((_ n)) (f)))\\n\\n(define (repeat2 f n) ; This is a bit more \\\"functional programmingy\\\"\\n (when (positive? n) (f) (repeat2 f (sub1 n))))\\n\\n(display \\\"...\\\")\\n(repeat (λ () (display \\\" and over\\\")) 5)\\n(display \\\"...\\\")\\n(repeat2 (λ () (display \\\" & over\\\")) 5)\\n(newline)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub repeat (&f, $n) { f() xx $n };\\n\\nsub example { say rand }\\n\\nrepeat(&example, 3);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"Red[]\\n\\nmyrepeat: function [fn n] [loop n [do fn]]\\n\\nmyrepeat [print \\\"hello\\\"] 3\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"/*REXX program executes a named procedure a specified number of times. */\\nparse arg pN # . /*obtain optional arguments from the CL*/\\nif #=='' | #==\\\",\\\" then #= 1 /*assume once if not specified. */\\nif pN\\\\=='' then call repeats pN, # /*invoke the REPEATS procedure for pN.*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nrepeats: procedure; parse arg x,n /*obtain the procedureName & # of times*/\\n do n; interpret 'CALL' x; end /*repeat the invocation N times. */\\n return /*return to invoker of the REPEATS proc*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nyabba: say 'Yabba, yabba do!'; return /*simple code; no need for PROCEDURE.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"Func Main\\n times(5,:test)\\n\\nFunc Test\\n see \\\"Message from the test function!\\\" + nl\\n\\nFunc Times nCount, F\\n for x = 1 to nCount\\n Call F()\\n next\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"4.times{ puts \\\"Example\\\" } # idiomatic way\\n\\ndef repeat(proc,num)\\n num.times{ proc.call }\\nend\\n\\nrepeat(->{ puts \\\"Example\\\" }, 4)\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"fn repeat(f: impl FnMut(usize), n: usize) {\\n (0..n).for_each(f);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"fn main() {\\n repeat(|x| print!(\\\"{};\\\", x), 5);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"fn function(x: usize) {\\n print!(\\\"{};\\\", x);\\n}\\n\\nfn main() {\\n repeat(function, 4);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"struct Foo;\\nimpl Foo {\\n fn associated(x: usize) {\\n print!(\\\"{};\\\", x);\\n }\\n}\\n\\nfn main() {\\n repeat(Foo::associated, 8);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"trait Bar {\\n fn run(self);\\n}\\n\\nimpl Bar for usize {\\n fn run(self) {\\n print!(\\\"{};\\\", self);\\n }\\n}\\n\\nfn main() {\\n repeat(Bar::run, 6);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"fn repeat(f: impl FnMut(usize), n: usize) {\\n (0..n).for_each(f);\\n}\\n\\nfn main() {\\n let mut mult = 1;\\n repeat(|x| {\\n print!(\\\"{};\\\", x * mult);\\n mult += x;\\n }, 5);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \" def repeat[A](n:Int)(f: => A)= ( 0 until n).foreach(_ => f)\\n\\n repeat(3) { println(\\\"Example\\\") }\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"object Repeat2 extends App {\\n\\n implicit class IntWithTimes(x: Int) {\\n def times[A](f: => A):Unit = {\\n @tailrec\\n def loop( current: Int): Unit =\\n if (current > 0) {\\n f\\n loop(current - 1)\\n }\\n loop(x)\\n }\\n }\\n\\n 5 times println(\\\"ha\\\") // Not recommended infix for 5.times(println(\\\"ha\\\")) aka dot notation\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"import scala.annotation.tailrec\\n\\nobject Repeat3 extends App {\\n\\n implicit class UnitWithNtimes(f: => Unit) {\\n def *[A](n: Int): Unit = { // Symbol * used instead of literal method name\\n @tailrec\\n def loop(current: Int): Unit =\\n if (current > 0) {\\n f\\n loop(current - 1)\\n }\\n loop(n)\\n }\\n }\\n\\n print(\\\"ha\\\") * 5 // * is the method, effective should be A.*(5)\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(import (scheme base)\\n (scheme write))\\n\\n(define (repeat proc n)\\n (do ((i 0 (+ 1 i))\\n (res '() (cons (proc) res)))\\n ((= i n) res)))\\n\\n;; example returning an unspecified value\\n(display (repeat (lambda () (display \\\"hi\\\\n\\\")) 4)) (newline)\\n\\n;; example returning a number\\n(display (repeat (lambda () (+ 1 2)) 5)) (newline)\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst proc: myRepeat (in integer: times, in proc: aProcedure) is func\\n local\\n var integer: n is 0;\\n begin\\n for n range 1 to times do\\n aProcedure;\\n end for;\\n end func;\\n\\nconst proc: main is func\\n begin\\n myRepeat(3, writeln(\\\"Hello!\\\"));\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"func repeat(f, n) {\\n { f() } * n;\\n}\\n\\nfunc example {\\n say \\\"Example\\\";\\n}\\n\\nrepeat(example, 4);\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"fun repeat (_, 0) = ()\\n | repeat (f, n) = (f (); repeat (f, n - 1))\\n\\nfun testProcedure () =\\n print \\\"test\\\\n\\\"\\n\\nval () = repeat (testProcedure, 5)\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"function repeat(f,n) {\\n\\tfor (i=1; i<=n; i++) (*f)()\\n}\\n\\nfunction hello() {\\n\\tprintf(\\\"Hello\\\\n\\\")\\n}\\n\\nrepeat(&hello(),3)\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"func repeat(n: Int, f: () -> ()) {\\n for _ in 0..<n {\\n f()\\n }\\n}\\n\\nrepeat(4) { println(\\\"Example\\\") }\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"proc repeat {command count} {\\n for {set i 0} {$i < $count} {incr i} {\\n uplevel 1 $command\\n }\\n}\\n\\nproc example {} {puts \\\"This is an example\\\"}\\nrepeat example 4\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"time example 4\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"repeat {puts \\\"hello world\\\"} 3\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"SUB proc\\n PRINT \\\" Inside loop\\\"\\nEND SUB\\n\\nSUB rep (func$, c)\\n FOR i = 1 to c\\n CALL proc\\n NEXT i\\nEND SUB\\n\\nCALL rep (\\\"proc\\\", 5)\\nPRINT \\\"Loop Ended\\\"\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"def repeat (function f, int n)\\n\\tfor (set n n) (> n 0) (dec n)\\n\\t\\tf\\n\\tend for\\nend repeat\\n\\ndef procedure ()\\n\\tout \\\"Hello! \\\" console\\nend procedure\\n\\n# outputs \\\"Hello! \\\" 5 times\\nrepeat procedure 5\\n\",\n \"language\": \"Ursa\"\n },\n {\n \"code\": \"fn repeat(n int, f fn()) {\\n for _ in 0.. n {\\n f()\\n }\\n}\\n\\nfn func() {\\n println(\\\"Example\\\")\\n}\\n\\nfn main() {\\n repeat(4, func)\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Private Sub Repeat(rid As String, n As Integer)\\n For i = 1 To n\\n Application.Run rid\\n Next i\\nEnd Sub\\n\\nPrivate Sub Hello()\\n Debug.Print \\\"Hello\\\"\\nEnd Sub\\n\\nPublic Sub main()\\n Repeat \\\"Hello\\\", 5\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"module main;\\n initial begin\\n repeat(5) begin\\n $display(\\\"Inside loop\\\");\\n end\\n $display(\\\"Loop Ended\\\");\\n end\\nendmodule\\n\",\n \"language\": \"Verilog\"\n },\n {\n \"code\": \"Module Module1\\n\\n Sub Repeat(count As Integer, fn As Action(Of Integer))\\n If IsNothing(fn) Then\\n Throw New ArgumentNullException(\\\"fn\\\")\\n End If\\n\\n For i = 1 To count\\n fn.Invoke(i)\\n Next\\n End Sub\\n\\n Sub Main()\\n Repeat(3, Sub(x) Console.WriteLine(\\\"Example {0}\\\", x))\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"var f = Fn.new { |g, n|\\n for (i in 1..n) g.call(n)\\n}\\n\\nvar g = Fn.new { |k|\\n for (i in 1..k) System.write(\\\"%(i) \\\")\\n System.print()\\n}\\n\\nf.call(g, 5)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"PROGRAM\\t\\\"Repeat\\\"\\nVERSION\\t\\\"0.0000\\\"\\n\\nDECLARE FUNCTION Entry ()\\nDECLARE FUNCTION Proc ()\\nDECLARE FUNCTION Repe (func$, c)\\n\\nFUNCTION Entry ()\\n Repe (\\\"proc\\\", 5)\\nPRINT \\\"Loop Ended\\\"\\n\\nEND FUNCTION\\n\\nFUNCTION Proc ()\\n PRINT \\\" Inside loop\\\"\\nEND FUNCTION\\n\\nFUNCTION Repe (func$, c)\\n FOR i = 1 TO c\\n Proc ()\\n NEXT i\\nEND FUNCTION\\nEND PROGRAM\\n\",\n \"language\": \"XBasic\"\n },\n {\n \"code\": \"func rep(callback:function,amount:number,*args:array=[]):null{\\n\\trepeat amount {\\n\\t\\tcallback(*args);\\n\\t}\\n}\\n\\nrep(func(a,b,c){\\n\\tlog(a+b+c);\\n},3,1,2,3);\\n\",\n \"language\": \"XBS\"\n },\n {\n \"code\": \"(defun repeat (f n)\\n (f)\\n (if (> n 1)\\n (repeat f (- n 1)) ) )\\n\\n;; an example to test it:\\n(repeat (lambda () (print '(hello rosetta code))) 5)\\n\",\n \"language\": \"XLISP\"\n },\n {\n \"code\": \"sub myFunc ()\\n print \\\"Sure looks like a function in here...\\\"\\nend sub\\n\\nsub rep (func$, times)\\n for count = 1 to times\\n execute(func$)\\n next\\nend sub\\n\\nrep(\\\"myFunc\\\", 4)\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"ld b,&05 ;load the decrement value into b\\nld hl,myFunc ;load the address of \\\"myFunc\\\" into HL\\n\\ncall repeatProcedure\\n\\nforever:\\njp forever ;trap the program counter here\\n\\nrepeatProcedure: ;input: b = times to repeat, hl = which procedure to repeat\\ncall trampoline\\n; the \\\"ret\\\" in myFunc will bring you here\\ndjnz repeatProcedure\\nret ;exit \\\"repeatProcedure\\\" and proceed to \\\"forever\\\"\\n\\ntrampoline:\\npush hl\\nret\\n;this is effectively a call to whatever is in HL, in this case \\\"myFunc.\\\" The \\\"ret\\\" at the end of myFunc will return us to\\n;just after the line \\\"call trampoline\\\"\\n\\n\\nmyFunc: ;this doesn't do anything useful but that's not the point\\npush hl ;not needed for this routine but if it altered HL we would need this so that we come back here next time we loop\\nor a\\npop hl\\nret\\n\",\n \"language\": \"Z80-Assembly\"\n },\n {\n \"code\": \"trampoline:\\njp (hl) ;despite the parentheses this does NOT dereference HL, it merely acts as \\\"LD PC,HL\\\".\\n\",\n \"language\": \"Z80-Assembly\"\n },\n {\n \"code\": \"LD HL,myFunc\\nLD (repeatproc+1),HL\\nLD B,5 ;repeat count\\nCALL repeatProc\\n\\n;somewhere far away from here:\\nrepeatProc:\\ncall &0000 ;gets overwritten with the address of MyFunc\\ndjnz repeatProc\\nret\\n\",\n \"language\": \"Z80-Assembly\"\n },\n {\n \"code\": \"fcn repeat(f,n){ do(n){ f() } }\\nrepeat(\\\"ho \\\".print,3);\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Repeat"}}},{"rowIdx":1579,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Repeat_a_string\nnote: String manipulation\n","language":"00-META"},{"code":"Take a string and repeat it some number of times. \n\nExample: repeat(\"ha\", 5) => \"hahahahaha\"\n\nIf there is a simpler/more efficient way to repeat a single “character” (i.e. creating a string filled with a certain character), you might want to show that as well (i.e. repeat-char(\"*\", 5) => \"*****\").\n\n\n{{Template:Strings}}\n<br><br>\n\n","language":"00-TASK"},{"code":"print(‘ha’ * 5)\n","language":"11l"},{"code":"* Repeat a string - 19/04/2020\nREPEATS CSECT\n USING REPEATS,R13 base register\n B 72(R15) skip savearea\n DC 17F'0' savearea\n SAVE (14,12) save previous context\n ST R13,4(R15) link backward\n ST R15,8(R13) link forward\n LR R13,R15 set addressability\n XPRNT C24,24 print c24\n LA R1,PARMLST pg=repeat(cx,ii) - repeat('abc ',6)\n BAL R14,REPEAT call repeat\n XPRNT PG,L'PG print pg\n L R13,4(0,R13) restore previous savearea pointer\n RETURN (14,12),RC=0 restore registers from calling save\nREPEAT CNOP 0,4 procedure repeat(b,a,i)\n STM R2,R8,REPEATSA save registers\n L R2,0(R1) @b=%r1\n L R3,4(R1) @a=%(r1+4)\n L R4,8(R1) @i=%(r1+8)\n LR R5,R3 length(a) before a\n SH R5,=H'2' @lengh(a)\n LH R6,0(R5) l=length(a)\n LR R7,R6 l\n BCTR R7,0 l-1\n L R8,0(R4) i=%r4\n LTR R8,R8 if i<=0\n BNP RET then return\nLOOP EX R7,MVCX move a to b len R6\n AR R2,R6 @b+=l\n BCT R8,LOOP loop i times\nRET LM R2,R8,REPEATSA restore registers\n BR R14 return\nPARMLST DC A(PG,CX,II) parmlist\nREPEATSA DS 7F local savearea\nMVCX MVC 0(0,R2),0(R3) move @ R3 to @ R2\nC24 DC 6C'xyz ' constant repeat - repeat('xyz ',6)\nLCX DC AL2(L'CX) lengh(cc)\nCX DC CL4'abc ' cx\nII DC F'6' ii\nPG DC CL80' ' pg\n REGEQU\n END REPEATS\n","language":"360-Assembly"},{"code":"gosub repeat ha 5\necho %@repeat[*,5]\nquit\n\n:Repeat [String Times]\n do %Times%\n echos %String%\n enddo\n echo.\nreturn\n","language":"4DOS-Batch"},{"code":"CHROUT equ $FFD2 ;KERNAL call, prints the accumulator to the screen as an ascii value.\n\n\torg $0801\t\t\n\n\n\tdb $0E,$08,$0A,$00,$9E,$20,$28,$32,$30,$36,$34,$29,$00,$00,$00\n\n\n\n\t\n\tlda #>TestStr\n\tsta $11\n\t\n\tlda #<TestStr\t\n\tsta $10\n\n\t\n\tldx #5\t\t\t\t;number of times to repeat\n\nloop:\t\n\tjsr PrintString\n\tdex\n\tbne loop\n\t\n\n\tRTS\t\t\t\t\t;RETURN TO BASIC\n\t\n\t\nPrintString:\n\tldy #0\t\t\t\t\nloop_PrintString:\n\tlda ($10),y\t\t\t;this doesn't actually increment the pointer itself, so we don't need to back it up.\n\tbeq donePrinting\t\n\tjsr CHROUT\t\n\tiny\n\tjmp loop_PrintString\t\ndonePrinting:\n\trts\t\t\t\t\t\n\t\n\t\t\n\t\nTestStr:\t\t\t\t\n\tdb \"HA\",0\n","language":"6502-Assembly"},{"code":"MOVE.W #5-1,D1\nRepString:\nLEA A3, MyString\nMOVE.L A3,-(SP) ;PUSH A3\nJSR PrintString ;unimplemented hardware-dependent printing routine, assumed to not clobber D1\nMOVE.L (SP)+,A3 ;POP A3\nDBRA D1,RepString\nRTS ;return to basic or whatever\n\nMyString:\nDC.B \"ha\",0\neven\n","language":"68000-Assembly"},{"code":" org 100h\n jmp demo\n\n ; Repeat the string at DE into HL, B times\nrepeat: mvi c,'$' ; string terminator\n xra a ; repeat 0x?\n ora b\n mov m,c ; then empty string\n rz\nrpt1: push d ; save begin of string to repeat\nchcpy: ldax d ; copy character from input to output\n mov m,a\n inx d ; advance pointers\n inx h\n cmp c ; end of string?\n jnz chcpy\n pop d ; restore begin of string to repeat\n dcx h ; move back past terminator in copy\n dcr b ; done yet?\n jnz rpt1 ; if not add another copy\n ret\n\ndemo: lxi d,ha ; get string to repeat\n lxi h,buf ; place to store result\n mvi b,5 ; repeat 5 times\n call repeat\n lxi d,buf ; print result using CP/M call\n mvi c,9\n jmp 5\n\nha: db 'ha$' ; string to repeat\nbuf: ds 32 ; place to store repeated string\n","language":"8080-Assembly"},{"code":"\"ha\" 5 s:*\n. cr\n","language":"8th"},{"code":"report z_repeat_string.\n\nwrite repeat( val = `ha` occ = 5 ).\n","language":"ABAP"},{"code":"Proc Main()\n byte REPEAT\n\n REPEAT=5\n Do\n Print(\"ha\")\n REPEAT==-1\n Until REPEAT=0\n Do\n\nReturn\n","language":"Action-"},{"code":"function repeatString(string:String, numTimes:uint):String\n{\n\tvar output:String = \"\";\n\tfor(var i:uint = 0; i < numTimes; i++)\n\t\toutput += string;\n\treturn output;\n}\n","language":"ActionScript"},{"code":"function repeatRecursive(string:String, numTimes:uint):String\n{\n\tif(numTimes == 0) return \"\";\n\tif(numTimes & 1) return string + repeatRecursive(string, numTimes - 1);\n\tvar tmp:String = repeatRecursive(string, numTimes/2);\n\treturn tmp + tmp;\n}\n","language":"ActionScript"},{"code":"import mx.utils.StringUtil;\ntrace(StringUtil.repeat(\"ha\", 5));\n","language":"ActionScript"},{"code":"with Ada.Strings.Fixed; use Ada.Strings.Fixed;\nwith Ada.Text_IO; use Ada.Text_IO;\n\nprocedure String_Multiplication is\nbegin\n Put_Line (5 * \"ha\");\nend String_Multiplication;\n","language":"Ada"},{"code":"call_n(5, o_text, \"ha\");\n","language":"Aime"},{"code":"print (5 * \"ha\")\n","language":"ALGOL-68"},{"code":"#!/usr/bin/hopper\n#include <hopper.h>\n\nmain:\n {\"ha\"}replyby(5), println\n {\"ha\",5}replicate, println\n{0}return\n","language":"Amazing-Hopper"},{"code":" 10⍴'ha'\nhahahahaha\n","language":"APL"},{"code":" REPEAT←{(⍺×⍴⍵)⍴⍵}\n 5 REPEAT 'ha'\nhahahahaha\n","language":"APL"},{"code":"set str to \"ha\"\nset final_string to \"\"\nrepeat 5 times\n set final_string to final_string & str\nend repeat\n","language":"AppleScript"},{"code":"replicate(5000, \"ha\")\n\n-- Repetition by 'Egyptian multiplication' -\n-- progressively doubling a list, appending\n-- stages of doubling to an accumulator where needed for\n-- binary assembly of a target length.\n\n-- replicate :: Int -> String -> String\non replicate(n, s)\n set out to \"\"\n if n < 1 then return out\n set dbl to s\n\n repeat while (n > 1)\n if (n mod 2) > 0 then set out to out & dbl\n set n to (n div 2)\n set dbl to (dbl & dbl)\n end repeat\n return out & dbl\nend replicate\n","language":"AppleScript"},{"code":"FOR I = 1 TO 5 : S$ = S$ + \"HA\" : NEXT\n\n? \"X\" SPC(20) \"X\"\n","language":"Applesoft-BASIC"},{"code":"print repeat \"ha\" 5\n","language":"Arturo"},{"code":"MsgBox % Repeat(\"ha\",5)\n\nRepeat(String,Times)\n{\n Loop, %Times%\n Output .= String\n Return Output\n}\n","language":"AutoHotkey"},{"code":"#include <String.au3>\n\nConsoleWrite(_StringRepeat(\"ha\", 5) & @CRLF)\n","language":"AutoIt"},{"code":"function repeat( str, n, rep, i )\n{\n for( ; i<n; i++ )\n rep = rep str\n return rep\n}\n\nBEGIN {\n print repeat( \"ha\", 5 )\n}\n","language":"AWK"},{"code":"main: { \"ha\" 5 print_repeat }\n\nprint_repeat!: { <- { dup << } -> times }\n","language":"Babel"},{"code":"hahahahaha\n","language":"Babel"},{"code":"DOTIMES 5\n s$ = s$ & \"ha\"\nDONE\nPRINT s$\n","language":"BaCon"},{"code":"PRINT FILL$(5, ASC(\"x\"))\n","language":"BaCon"},{"code":"function StringRepeat$ (s$, n)\n\tcad$ = \"\"\n\tfor i = 1 to n\n\t\tcad$ += s$\n\tnext i\n\treturn cad$\nend function\n\nprint StringRepeat$(\"rosetta\", 1)\nprint StringRepeat$(\"ha\", 5)\nprint StringRepeat$(\"*\", 5)\nend\n","language":"BASIC256"},{"code":"@echo off\nif \"%2\" equ \"\" goto fail\nsetlocal enabledelayedexpansion\nset char=%1\nset num=%2\nfor /l %%i in (1,1,%num%) do set res=!res!%char%\necho %res%\n:fail\n","language":"Batch-File"},{"code":"@echo off\nset /p a=Enter string to repeat :\nset /p b=Enter how many times to repeat :\nset \"c=1\"\nset \"d=%b%\"\n:a\necho %a%\nset \"c=%c%+=1\"\nif /i _\"%c%\"==_\"%d%\" (exit /b)\ngoto :a\n","language":"Batch-File"},{"code":"@echo off\n@FOR /L %%i in (0,1,9) DO @CALL :REPEAT %%i\n@echo That's it!\n@FOR /L %%i in (0,1,9) DO @CALL :REPEAT %%i\n@echo.\n@echo And that!\n@GOTO END\n\n:REPEAT\n@echo|set /p=\"*\"\n@GOTO:EOF\n\n:END\n","language":"Batch-File"},{"code":" PRINT STRING$(5, \"ha\")\n","language":"BBC-BASIC"},{"code":"String s = new String('X', 5);\ns.Replace(\"X\", \"ha\");\n","language":"Beef"},{"code":"String s1 = scope .();\ns1.PadLeft(5, '*');\n","language":"Beef"},{"code":" p <\n p0~1<}~< d@<\n_VT@1~>yg~9PKd@M'd;\n","language":"Beeswax"},{"code":"v> \">:#,_v\n>29*+00p>~:\"0\"- #v_v $\n v ^p0p00:-1g00< $ >\n v p00&p0-1g00+4*65< >00g1-:00p#^_@\n","language":"Befunge"},{"code":"Repeat ← ×⟜≠ ⥊ ⊢\n\n•Show 5 Repeat \"Hello\"\n","language":"BQN"},{"code":"\"HelloHelloHelloHelloHello\"\n","language":"BQN"},{"code":"(repeat=\n string N rep\n. !arg:(?string.?N)\n & !string:?rep\n & whl\n ' (!N+-1:>0:?N&!string !rep:?rep)\n & str$!rep\n);\n","language":"Bracmat"},{"code":"+++++ +++++\tinit first as 10 counter\n[-> +++++ +++++<] we add 10 to second each loopround\n\n\t\tNow we want to loop 5 times to follow std\n+++++\n[-> ++++ . ----- -- . +++<] print h and a each loop\n\nand a newline because I'm kind and it looks good\n+++++ +++++ +++ . --- .\n","language":"Brainf---"},{"code":"p \"ha\" * 5 #Prints \"hahahahaha\"\n","language":"Brat"},{"code":"blsq ) 'h5?*\n\"hhhhh\"\nblsq ) \"ha\"5.*\\[\n\"hahahahaha\"\n","language":"Burlesque"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nchar * string_repeat( int n, const char * s ) {\n size_t slen = strlen(s);\n char * dest = malloc(n*slen+1);\n\n int i; char * p;\n for ( i=0, p = dest; i < n; ++i, p += slen ) {\n memcpy(p, s, slen);\n }\n *p = '\\0';\n return dest;\n}\n\nint main() {\n char * result = string_repeat(5, \"ha\");\n puts(result);\n free(result);\n return 0;\n}\n","language":"C"},{"code":"...\nchar *string_repeat(const char *str, int n)\n{\n char *pa, *pb;\n size_t slen = strlen(str);\n char *dest = malloc(n*slen+1);\n\n pa = dest + (n-1)*slen;\n strcpy(pa, str);\n pb = --pa + slen;\n while (pa>=dest) *pa-- = *pb--;\n return dest;\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nchar * char_repeat( int n, char c ) {\n char * dest = malloc(n+1);\n memset(dest, c, n);\n dest[n] = '\\0';\n return dest;\n}\n\nint main() {\n char * result = char_repeat(5, '*');\n puts(result);\n free(result);\n return 0;\n}\n","language":"C"},{"code":"#include <string>\n#include <iostream>\n\nstd::string repeat( const std::string &word, int times ) {\n std::string result ;\n result.reserve(times*word.length()); // avoid repeated reallocation\n for ( int a = 0 ; a < times ; a++ )\n result += word ;\n return result ;\n}\n\nint main( ) {\n std::cout << repeat( \"Ha\" , 5 ) << std::endl ;\n return 0 ;\n}\n","language":"C++"},{"code":"#include <string>\n#include <iostream>\n\nint main( ) {\n std::cout << std::string( 5, '*' ) << std::endl ;\n return 0 ;\n}\n","language":"C++"},{"code":"#include <string>\n#include <iostream>\n\nstd::string repeat( const std::string &word, uint times ) {\n return\n times == 0 ? \"\" :\n times == 1 ? word :\n times == 2 ? word + word :\n repeat(repeat(word, times / 2), 2) +\n repeat(word, times % 2);\n}\n\nint main( ) {\n std::cout << repeat( \"Ha\" , 5 ) << std::endl ;\n return 0 ;\n}\n","language":"C++"},{"code":"string s = \"\".PadLeft(5, 'X').Replace(\"X\", \"ha\");\n","language":"C-sharp"},{"code":"string s = new String('X', 5).Replace(\"X\", \"ha\");\n","language":"C-sharp"},{"code":"string s = String.Join(\"ha\", new string[5 + 1]);\n","language":"C-sharp"},{"code":"string s = String.Concat(Enumerable.Repeat(\"ha\", 5));\n","language":"C-sharp"},{"code":"string s = \"\".PadLeft(5, '*');\n","language":"C-sharp"},{"code":"string s = new String('*', 5);\n","language":"C-sharp"},{"code":"shared void repeatAString() {\n\tprint(\"ha\".repeat(5));\n}\n","language":"Ceylon"},{"code":"100 cls\n110 print stringrepeat$(\"rosetta\",1)\n120 print stringrepeat$(\"ha\",5)\n130 print stringrepeat$(\"*\",5)\n140 end\n150 function stringrepeat$(s$,n)\n160 cad$ = \"\"\n170 for i = 1 to n\n180 cad$ = cad$+s$\n190 next i\n200 stringrepeat$ = cad$\n210 end function\n","language":"Chipmunk-Basic"},{"code":" Replicate( \"Ha\", 5 )\n","language":"Clipper"},{"code":"(apply str (repeat 5 \"ha\"))\n","language":"Clojure"},{"code":"IDENTIFICATION DIVISION.\nPROGRAM-ID. REPEAT-PROGRAM.\nDATA DIVISION.\nWORKING-STORAGE SECTION.\n77 HAHA PIC A(10).\nPROCEDURE DIVISION.\n MOVE ALL 'ha' TO HAHA.\n DISPLAY HAHA.\n STOP RUN.\n","language":"COBOL"},{"code":"<cfset word = 'ha'>\n<Cfset n = 5>\n<Cfoutput>\n<Cfloop from=\"1\" to=\"#n#\" index=\"i\">#word#</Cfloop>\n</Cfoutput>\n","language":"ColdFusion"},{"code":"(defun repeat-string (n string)\n (with-output-to-string (stream)\n (loop repeat n do (write-string string stream))))\n","language":"Common-Lisp"},{"code":"(defun repeat-string (n string\n &aux\n (len (length string))\n (result (make-string (* n len)\n :element-type (array-element-type string))))\n (loop repeat n\n for i from 0 by len\n do (setf (subseq result i (+ i len)) string))\n result)\n","language":"Common-Lisp"},{"code":"(defun repeat-string (n string)\n (format nil \"~V@{~a~:*~}\" n string))\n","language":"Common-Lisp"},{"code":"(princ (repeat-string 5 \"hi\"))\n","language":"Common-Lisp"},{"code":"(make-string 5 :initial-element #\\X)\n","language":"Common-Lisp"},{"code":"puts \"ha\" * 5\n","language":"Crystal"},{"code":"import std.stdio, std.array;\n\nvoid main() {\n writeln(\"ha\".replicate(5));\n}\n","language":"D"},{"code":"import std.stdio;\n\nvoid main() {\n char[] chars; // create the dynamic array\n chars.length = 5; // set the length\n chars[] = '*'; // set all characters in the string to '*'\n writeln(chars);\n}\n","language":"D"},{"code":"$ write sys$output f$fao( \"!AS!-!AS!-!AS!-!AS!-!AS\", \"ha\" )\n$ write sys$output f$fao( \"!12*d\" )\n","language":"DCL"},{"code":"function RepeatString(const s: string; count: cardinal): string;\nvar\n i: Integer;\nbegin\n for i := 1 to count do\n Result := Result + s;\nend;\n\nWriteln(RepeatString('ha',5));\n","language":"Delphi"},{"code":"Writeln( StringOfChar('a',5) );\n","language":"Delphi"},{"code":"function RepeatStr(const s: string; i: Cardinal): string;\nbegin\n if i = 0 then\n result := ''\n else\n result := s + RepeatStr(s, i-1)\nend;\n","language":"Delphi"},{"code":"StrUtils.DupeString\n","language":"Delphi"},{"code":"PrintLn( StringOfString('abc',5) );\n","language":"DWScript"},{"code":"PrintLn( StringOfChar('a',5) );\n","language":"DWScript"},{"code":"String.Repeat(\"ha\", 5)\n","language":"Dyalect"},{"code":"\"ha\" * 5\n","language":"E"},{"code":"func$ rep s$ n .\n for i to n\n r$ &= s$\n .\n return r$\n.\nprint rep \"ha\" 5\n","language":"EasyLang"},{"code":"IMPORT STD; //Imports the Standard Library\n\nSTRING MyBaseString := 'abc';\nRepeatedString := STD.Str.Repeat(MyBaseString,3);\nRepeatedString; //returns 'abcabcabc'\n","language":"ECL"},{"code":"RepeatString(STRING InStr, INTEGER Cnt) := FUNCTION\n rec := {STRING Str};\n ds := DATASET(Cnt,TRANSFORM(rec,SELF.Str := InStr));\n res := ITERATE(ds,TRANSFORM(rec,SELF.Str := LEFT.Str + RIGHT.Str));\n RETURN Res[Cnt].Str;\nEND;\n\nRepeatString('ha',3);\nRepeatString('Who',2);\n","language":"ECL"},{"code":"String funny = \"ha\" * 5;\nString stars = '*' * 80;\n","language":"Ecstasy"},{"code":"(S.concat (take 5 (repeat1 \"ha\")))\n","language":"Egison"},{"code":" repeat_string(a_string: STRING; times: INTEGER): STRING\n require\n times_positive: times > 0\n do\n Result := a_string.multiply(times)\n end\n","language":"Eiffel"},{"code":"import system'routines;\nimport extensions;\nimport extensions'text;\n\npublic program()\n{\n var s := new Range(0, 5).selectBy::(x => \"ha\").summarize(new StringWriter())\n}\n","language":"Elena"},{"code":"String.duplicate(\"ha\", 5)\n","language":"Elixir"},{"code":"(apply 'concat (make-list 5 \"ha\"))\n","language":"Emacs-Lisp"},{"code":"(make-string 5 ?x)\n","language":"Emacs-Lisp"},{"code":"(require 'cl-lib)\n(cl-loop repeat 5 concat \"ha\")\n","language":"Emacs-Lisp"},{"code":"repeat(X,N) ->\n lists:flatten(lists:duplicate(N,X)).\n","language":"Erlang"},{"code":"PROCEDURE REPEAT_STRING(S$,N%->REP$)\n LOCAL I%\n REP$=\"\"\n FOR I%=1 TO N% DO\n REP$=REP$+S$\n END FOR\nEND PROCEDURE\n","language":"ERRE"},{"code":"sequence s = \"\"\nfor i = 1 to 5 do s &= \"ha\" end for\nputs(1,s)\n\nhahahahaha\n","language":"Euphoria"},{"code":"sequence s = repeat('*',5)\n\n*****\n","language":"Euphoria"},{"code":"include std/console.e -- for display\ninclude std/sequence.e -- for repeat_pattern\nsequence s = repeat_pattern(\"ha\",5)\nsequence n = repeat_pattern({1,2,3},5)\ndisplay(s)\ndisplay(n)\n\nhahahahaha\n{1,2,3,1,2,3,1,2,3,1,2,3,1,2,3}\n","language":"Euphoria"},{"code":"include std/console.e -- for display\ninclude std/sequence.e -- for flatten\nsequence s = flatten(repeat(\"ha\",5))\ndisplay(s)\n","language":"Euphoria"},{"code":"{\n \"ha\",\n \"ha\",\n \"ha\",\n \"ha\",\n \"ha\"\n}\n","language":"Euphoria"},{"code":"> String.replicate 5 \"ha\";;\nval it : string = \"hahahahaha\"\n","language":"F-Sharp"},{"code":"> String.Concat( Array.create 5 \"ha\" );;\nval it : string = \"hahahahaha\"\n","language":"F-Sharp"},{"code":": repeat-string ( str n -- str' ) swap <repetition> concat ;\n\n\"ha\" 5 repeat-string print\n","language":"Factor"},{"code":": place-n { src len dest n -- }\n 0 dest c!\n n 0 ?do src len dest +place loop ;\n\ns\" ha\" pad 5 place-n\npad count type \\ hahahahaha\n","language":"Forth"},{"code":": place-n ( src len dest n -- )\n swap >r 0 r@ c!\n begin dup while -rot 2dup r@ +place rot 1- repeat\n r> 2drop 2drop ;\n\ns\" ha\" pad 5 place-n\npad count type \\ hahahahaha\n","language":"Forth"},{"code":"pad 10 char * fill \\ repeat a single character\npad 10 type \\ **********\n","language":"Forth"},{"code":"program test_repeat\n\n write (*, '(a)') repeat ('ha', 5)\n\nend program test_repeat\n","language":"Fortran"},{"code":"strUtils.dupeString('ha', 5)\n","language":"Free-Pascal-Lazarus"},{"code":"stringOfChar('*', 5)\n","language":"Free-Pascal-Lazarus"},{"code":"space(5)\n","language":"Free-Pascal-Lazarus"},{"code":"' FB 1.05.0 Win64\n\n' A character is essentially a string of length 1 in FB though there is a built-in function, String,\n' which creates a string by repeating a character a given number of times.\n\n' To avoid repeated concatenation (a slow operation) when the string to be repeated has a length\n' greater than one, we instead create a buffer of the required size and then fill that.\n\nFunction repeat(s As String, n As Integer) As String\n If n < 1 Then Return \"\"\n If n = 1 Then Return s\n Var size = Len(s)\n If size = 0 Then Return s ' empty string\n If size = 1 Then Return String(n, s[0]) ' repeated single character\n Var buffer = Space(size * n) 'create buffer for size > 1\n For i As Integer = 0 To n - 1\n For j As Integer = 0 To size - 1\n buffer[i * size + j] = s[j]\n Next j\n Next i\n Return buffer\nEnd Function\n\nPrint repeat(\"rosetta\", 1)\nPrint repeat(\"ha\", 5)\nPrint repeat(\"*\", 5)\nPrint\nPrint \"Press any key to quit program\"\nSleep\n","language":"FreeBASIC"},{"code":"println[repeat[\"ha\", 5]]\n","language":"Frink"},{"code":"include \"NSLog.incl\"\n\nCFStringRef repeatStr\nrepeatStr = @\"Hello, World!\\n\"\nNSLog( @\"%@\", fn StringByPaddingToLength( @\"\", 50 * len(repeatStr), repeatStr, 0 ) )\n\nHandleEvents\n","language":"FutureBasic"},{"code":"Public Sub Main()\n\nPrint String$(5, \"ha\")\n\nEnd\n","language":"Gambas"},{"code":"Concatenation(ListWithIdenticalEntries(10, \"BOB \"));\n\"BOB BOB BOB BOB BOB BOB BOB BOB BOB BOB \"\n","language":"GAP"},{"code":"'*' %% 5\n","language":"Glee"},{"code":"'ha' => Str;\nStr# => Len;\n1..Len %% (Len * 5) => Idx;\nStr [Idx] $;\n","language":"Glee"},{"code":"'ha'=>S[1..(S#)%%(S# *5)]\n","language":"Glee"},{"code":"fmt.Println(strings.Repeat(\"ha\", 5)) // ==> \"hahahahaha\"\n","language":"Go"},{"code":"fmt.Println(strings.Repeat(string('h'), 5)) // prints hhhhh\n","language":"Go"},{"code":" println 'ha' * 5\n","language":"Groovy"},{"code":"100 CLS : rem 100 HOME for Applesoft BASIC\n110 S$ = \"rosetta\" : N = 1\n120 GOSUB 210\n130 PRINT CAD$\n140 S$ = \"ha\" : N = 5\n150 GOSUB 210\n160 PRINT CAD$\n170 S$ = \"*\" : N = 5\n180 GOSUB 210\n190 PRINT CAD$\n200 END\n210 REM FUNCTION STRINGREPEAT$(S$,N)\n220 CAD$ = \"\"\n230 FOR I = 1 TO N\n240 CAD$ = CAD$+S$\n250 NEXT I\n260 RETURN\n","language":"GW-BASIC"},{"code":"? Replicate( \"Ha\", 5 )\n","language":"Harbour"},{"code":"concat $ replicate 5 \"ha\"\n","language":"Haskell"},{"code":"[1..5] >> \"ha\"\n","language":"Haskell"},{"code":"[1..5] *> \"ha\"\n","language":"Haskell"},{"code":"cycle \"ha\"\n","language":"Haskell"},{"code":"replicate 5 '*'\n","language":"Haskell"},{"code":"repString :: String -> Int -> String\nrepString s n =\n let rep x = xs\n where\n xs = mappend x xs\n in take (n * length s) (rep s)\n\nmain :: IO ()\nmain = print $ repString \"ha\" 5\n","language":"Haskell"},{"code":"import Data.Tuple (swap)\nimport Data.List (unfoldr)\nimport Control.Monad (join)\n\n-- BY RHIND PAPYRUS 'EGYPTIAN' OR 'ETHIOPIAN' MULTIPLICATION ------------------\nrepString :: Int -> String -> String\nrepString n s =\n foldr\n (\\(d, x) a ->\n if d > 0 -- Is this power of 2 needed for the binary recomposition ?\n then mappend a x\n else a)\n mempty $\n zip\n (unfoldr\n (\\h ->\n if h > 0\n then Just $ swap (quotRem h 2) -- Binary decomposition of n\n else Nothing)\n n)\n (iterate (join mappend) s) -- Iterative duplication ( mappend to self )\n\n-- TEST -----------------------------------------------------------------------\nmain :: IO ()\nmain = print $ repString 500 \"ha\"\n","language":"Haskell"},{"code":"CHARACTER out*20\n\nEDIT(Text=out, Insert=\"ha\", DO=5)\n","language":"HicEst"},{"code":"procedure main(args)\n write(repl(integer(!args) | 5))\nend\n","language":"Icon"},{"code":"procedure repl(s, n)\n every (ns := \"\") ||:= |s\\(0 <= n)\n return ns\nend\n","language":"Icon"},{"code":"strRepeat : Nat -> String -> String\nstrRepeat Z s = \"\"\nstrRepeat (S n) s = s ++ strRepeat n s\n\nchrRepeat : Nat -> Char -> String\nchrRepeat Z c = \"\"\nchrRepeat (S n) c = strCons c $ chrRepeat n c\n","language":"Idris"},{"code":"Home is a room.\n\nTo decide which indexed text is (T - indexed text) repeated (N - number) times:\n\tlet temp be indexed text;\n\trepeat with M running from 1 to N:\n\t\tlet temp be \"[temp][T]\";\n\tdecide on temp.\n\nWhen play begins:\n\tsay \"ha\" repeated 5 times;\n\tend the story.\n","language":"Inform-7"},{"code":"(str* \"ha\" 5)\n","language":"Inform-7"},{"code":" 10 PRINT STRING$(\"ha\",5)\n100 DEF STRING$(S$,N)\n105 LET ST$=\"\"\n110 FOR I=1 TO N\n120 LET ST$=ST$&S$\n130 NEXT\n140 LET STRING$=ST$\n150 END DEF\n","language":"IS-BASIC"},{"code":" 5 # '*' NB. repeat each item 5 times\n*****\n 5 # 'ha' NB. repeat each item 5 times\nhhhhhaaaaa\n 5 ((* #) $ ]) 'ha' NB. repeat array 5 times\nhahahahaha\n 5 ;@# < 'ha' NB. using boxing to treat the array as a whole\nhahahahaha\n","language":"J"},{"code":"\"ha\".repeat(5);\n","language":"Java"},{"code":"String[] strings = new String[5];\nArrays.fill(strings, \"ha\");\nStringBuilder repeated = new StringBuilder();\nfor (String string : strings)\n repeated.append(string);\n","language":"Java"},{"code":"String string = \"ha\";\nStringBuilder repeated = new StringBuilder();\nint count = 5;\nwhile (count-- > 0)\n repeated.append(string);\n","language":"Java"},{"code":"public static String repeat(String str, int times) {\n StringBuilder sb = new StringBuilder(str.length() * times);\n for (int i = 0; i < times; i++)\n sb.append(str);\n return sb.toString();\n}\n\npublic static void main(String[] args) {\n System.out.println(repeat(\"ha\", 5));\n}\n","language":"Java"},{"code":"public static String repeat(String str, int times) {\n return new String(new char[times]).replace(\"\\0\", str);\n}\n","language":"Java"},{"code":"String.prototype.repeat = function(n) {\n return new Array(1 + (n || 0)).join(this);\n}\n\nconsole.log(\"ha\".repeat(5)); // hahahahaha\n","language":"JavaScript"},{"code":"console.log(\"ha\".repeat(5)); // hahahahaha\n","language":"JavaScript"},{"code":"(() => {\n 'use strict';\n\n // replicate :: Int -> String -> String\n const replicate = (n, s) => {\n let v = [s],\n o = [];\n if (n < 1) return o;\n while (n > 1) {\n if (n & 1) o = o + v;\n n >>= 1;\n v = v + v;\n }\n return o.concat(v);\n };\n\n\n return replicate(5000, \"ha\")\n})();\n","language":"JavaScript"},{"code":"(() => {\n 'use strict';\n\n // repeat :: Int -> String -> String\n const repeat = (n, s) =>\n concat(replicate(n, s));\n\n\n // GENERIC FUNCTIONS ------------------------------------------------------\n\n // concat :: [[a]] -> [a] | [String] -> String\n const concat = xs =>\n xs.length > 0 ? (() => {\n const unit = typeof xs[0] === 'string' ? '' : [];\n return unit.concat.apply(unit, xs);\n })() : [];\n\n // replicate :: Int -> a -> [a]\n const replicate = (n, x) =>\n Array.from({\n length: n\n }, () => x);\n\n\n // TEST -------------------------------------------------------------------\n return repeat(5, 'ha');\n})();\n","language":"JavaScript"},{"code":"DEFINE repeat == \"\" rotate [concat] cons times.\n\n\"ha\" 5 repeat.\n","language":"Joy"},{"code":"\"a \" * 3 # => \"a a a \"\n","language":"Jq"},{"code":"@show \"ha\" ^ 5\n\n# The ^ operator is really just call to the `repeat` function\n@show repeat(\"ha\", 5)\n","language":"Julia"},{"code":" ,/5#,\"ha\"\n\"hahahahaha\"\n\n 5#\"*\"\n\"*****\"\n","language":"K"},{"code":"fun main(args: Array<String>) {\n println(\"ha\".repeat(5))\n}\n","language":"Kotlin"},{"code":"operator fun String.times(n: Int) = this.repeat(n)\n\nfun main(args: Array<String>) = println(\"ha\" * 5)\n","language":"Kotlin"},{"code":"{S.map {lambda {_} ha} {S.serie 1 10}}\n-> ha ha ha ha ha ha ha ha ha ha\n\nor\n\n{S.replace \\s\n by\n in {S.map {lambda {_} ha}\n {S.serie 1 10}}}\n-> hahahahahahahahahaha\n\nor\n\n{def repeat\n {lambda {:w :n}\n {if {< :n 0}\n then\n else :w{repeat :w {- :n 1}}}}}\n-> repeat\n\n{repeat ha 10}\n-> hahahahahahahahahahaha\n","language":"Lambdatalk"},{"code":"# Repeat text function\nfn.println(fn.repeatText(5, ha))\n# Output: hahahahaha\n\n# Mul operator\nfn.println(parser.op(ha * 5))\n# Output: hahahahaha\n\n# Mul operator function\nfn.println(fn.mul(ha, 5))\n# Output: hahahahaha\n","language":"Lang"},{"code":"\"ha\" * 5\n","language":"Langur"},{"code":"'ha'*5 // hahahahaha\n","language":"Lasso"},{"code":"loop(5) => {^ 'ha' ^} // hahahahaha\n","language":"Lasso"},{"code":"(string:copies '\"ha\" 5)\n","language":"LFE"},{"code":"a$ =\"ha \"\nprint StringRepeat$( a$, 5)\n\nend\n\nfunction StringRepeat$( in$, n)\n o$ =\"\"\n for i =1 to n\n o$ =o$ +in$\n next i\n StringRepeat$ =o$\nend function\n","language":"Liberty-BASIC"},{"code":"on rep (str, n)\n res = \"\"\n repeat with i = 1 to n\n put str after res\n end repeat\n return res\nend\n","language":"Lingo"},{"code":"put rep(\"ha\", 5)\n-- \"hahahahaha\"\n","language":"Lingo"},{"code":"put bytearray(5, chartonum(\"*\")).readRawString(5)\n-- \"*****\"\n","language":"Lingo"},{"code":"on mouseUp\n put repeatString(\"ha\", 5)\nend mouseUp\n\nfunction repeatString str n\n repeat n times\n put str after t\n end repeat\n return t\nend repeatString\n","language":"LiveCode"},{"code":"to copies :n :thing [:acc \"||]\n if :n = 0 [output :acc]\n output (copies :n-1 :thing combine :acc :thing)\nend\n","language":"Logo"},{"code":"show cascade 5 [combine \"ha ?] \"|| ; hahahahaha\n","language":"Logo"},{"code":"to copies :n :thing :acc\n if :n = 0 [output :acc]\n output (copies :n-1 :thing combine :acc :thing)\nend\n\nprint copies 5 \"ha \"||\n","language":"Logo"},{"code":"function repeats(s, n) return n > 0 and s .. repeats(s, n-1) or \"\" end\n","language":"Lua"},{"code":"string.rep(s,n)\n","language":"Lua"},{"code":"> use StringTools in\n> Repeat( \"abc\", 10 ); # repeat an arbitrary string\n> Fill( \"x\", 20 ) # repeat a character\n> end use;\n \"abcabcabcabcabcabcabcabcabcabc\"\n\n \"xxxxxxxxxxxxxxxxxxxx\"\n","language":"Maple"},{"code":"> cat( \"abc\" $ 10 );\n \"abcabcabcabcabcabcabcabcabcabc\"\n\n> cat( seq( \"abc\", i = 1 .. 10 ) );\n \"abcabcabcabcabcabcabcabcabcabc\"\n","language":"Maple"},{"code":"> s := \"\":\n> to 10 do s := cat( s, \"abc\" ) end: s;\n \"abcabcabcabcabcabcabcabcabcabc\"\n","language":"Maple"},{"code":"StringRepeat[\"ha\", 5]\n","language":"Mathematica"},{"code":"function S = repeat(s , n)\n S = repmat(s , [1,n]) ;\nreturn\n","language":"MATLAB"},{"code":"\"$*\"(s, n) := apply(sconcat, makelist(s, n))$\ninfix(\"$*\")$\n\n\"abc\" $* 5;\n/* \"abcabcabcabcabc\" */\n","language":"Maxima"},{"code":":- module repeat.\n:- interface.\n:- import_module string, char, int.\n\n:- func repeat_char(char, int) = string.\n:- func repeat(string, int) = string.\n\n:- implementation.\n:- import_module stream, stream.string_writer, string.builder.\n\nrepeat_char(C, N) = string.duplicate_char(C, N).\n\nrepeat(String, Count) = Repeated :-\n S0 = string.builder.init,\n Repeated = string.builder.to_string(S),\n printn(string.builder.handle, Count, String, S0, S).\n\n:- pred printn(Stream, int, string, State, State)\n <= (stream.writer(Stream, string, State),\n stream.writer(Stream, character, State)).\n:- mode printn(in, in, in, di, uo) is det.\nprintn(Stream, N, String, !S) :-\n ( N > 0 ->\n print(Stream, String, !S),\n printn(Stream, N - 1, String, !S)\n ; true ).\n","language":"Mercury"},{"code":"\"ha\" 5 repeat print\n","language":"Min"},{"code":"100 REM Repeat a string\n110 LET S$ = \"rosetta\"\n120 LET N = 1\n130 GOSUB 210\n140 LET S$ = \"ha\"\n150 LET N = 5\n160 GOSUB 210\n170 LET S$ = \"*\"\n180 LET N = 5\n190 GOSUB 210\n200 STOP\n210 REM FUNCTION StringRepeat$(S$,N)\n220 FOR I = 1 TO N\n230 PRINT S$;\n240 NEXT I\n250 PRINT\n260 RETURN\n270 END\n","language":"Minimal-BASIC"},{"code":"str = \"Lol\"\nprint str * 5\n","language":"MiniScript"},{"code":"x = StringBuilder.new\n\n5.times do\n x.append \"ha\"\nend\n\nputs x # ==> \"hahahahaha\"\n","language":"Mirah"},{"code":"var s := \"ha \" * 5\ntraceln(s)\n","language":"Monte"},{"code":"|ha| 5 * PRINT .\n","language":"MontiLang"},{"code":"FOR 5\n |ha| OUT .\nENDFOR || PRINT .\n","language":"MontiLang"},{"code":"|ha| FOR 5 OUT ENDFOR . || PRINT .\n","language":"MontiLang"},{"code":"RPTSTR(S,N)\n ;Repeat a string S for N times\n NEW I\n FOR I=1:1:N WRITE S\n KILL I\n QUIT\nRPTSTR1(S,N) ;Functionally equivalent, but denser to read\n F I=1:1:N W S\n Q\n","language":"MUMPS"},{"code":" ;Even better (more terse)\n S x=\"\",$P(x,\"-\",10)=\"-\"\n W x\n","language":"MUMPS"},{"code":"\"ha\" * 5\n","language":"Nanoquery"},{"code":"/* Repeat a string, in Neko */\nvar srep = function(s, n) {\n var str = \"\"\n while n > 0 {\n str += s\n n -= 1\n }\n return str\n}\n\n$print(srep(\"ha\", 5), \"\\n\")\n","language":"Neko"},{"code":"using System;\nusing System.Console;\n\nmodule StrRep\n{\n Repeat(this s : string, n : int) : string\n {\n String('x', n).Replace(\"x\", s)\n }\n\n Main() : void\n {\n WriteLine(\"ha\".Repeat(5));\n WriteLine(\"*\".Repeat(5));\n WriteLine(String('*', 5)); // repeating single char\n\n }\n}\n","language":"Nemerle"},{"code":"/* NetRexx */\n\nha5 = 'ha'.copies(5)\n","language":"NetRexx"},{"code":"/* NetRexx */\nsampleStr = 'ha' -- string to duplicate\nsay ' COPIES:' sampleStr.copies(5)\nsay 'CHANGESTR:' '.....'.changestr('.', sampleStr)\n\nsampleChr = '*' -- character to duplicate\nsay ' LEFT:' sampleChr.left(5, sampleChr)\nsay ' RIGHT:' sampleChr.right(5, sampleChr)\nsay ' CENTRE:' sampleChr.centre(5, sampleChr)\nsay ' OVERLAY:' sampleChr.overlay(sampleChr, 1, 5, sampleChr)\nsay ' SUBSTR:' ''.substr(1, 5, sampleChr)\nsay 'TRANSLATE:' '.....'.translate(sampleChr, '.')\n","language":"NetRexx"},{"code":"(dup \"ha\" 5)\n","language":"NewLISP"},{"code":"import strutils\n\n# Repeat a char.\necho repeat('a', 5) # -> \"aaaaa\".\n\n# Repeat a string.\necho repeat(\"ha\", 5) # -> \"hahahahaha\".\n","language":"Nim"},{"code":"bundle Default {\n class Repeat {\n function : Main(args : String[]) ~ Nil {\n Repeat(\"ha\", 5)->PrintLine();\n }\n\n function : Repeat(string : String, max : Int) ~ String {\n repeat : String := String->New();\n for(i := 0; i < max; i += 1;) {\n repeat->Append(string);\n };\n\n return repeat;\n }\n }\n}\n","language":"Objeck"},{"code":"@interface NSString (RosettaCodeAddition)\n- (NSString *) repeatStringByNumberOfTimes: (NSUInteger) times;\n@end\n\n@implementation NSString (RosettaCodeAddition)\n- (NSString *) repeatStringByNumberOfTimes: (NSUInteger) times {\n return [@\"\" stringByPaddingToLength:[self length]*times withString:self startingAtIndex:0];\n}\n@end\n","language":"Objective-C"},{"code":" // Instantiate an NSString by sending an NSString literal our new\n // -repeatByNumberOfTimes: selector.\n NSString *aString = [@\"ha\" repeatStringByNumberOfTimes:5];\n\n // Display the NSString.\n NSLog(@\"%@\", aString);\n","language":"Objective-C"},{"code":"let string_repeat s n =\n let s = Bytes.of_string s in\n let len = Bytes.length s in\n let res = Bytes.create (n * len) in\n for i = 0 to pred n do\n Bytes.blit s 0 res (i * len) len\n done;\n (Bytes.to_string res)\n;;\n","language":"OCaml"},{"code":"val string_repeat : string -> int -> string = <fun>\n","language":"OCaml"},{"code":"# string_repeat \"Hiuoa\" 3 ;;\n- : string = \"HiuoaHiuoaHiuoa\"\n","language":"OCaml"},{"code":"let string_repeat s n =\n String.concat \"\" (Array.to_list (Array.make n s))\n;;\n","language":"OCaml"},{"code":"let string_repeat s n =\n Array.fold_left (^) \"\" (Array.make n s)\n;;\n","language":"OCaml"},{"code":"String.make 5 '*'\n","language":"OCaml"},{"code":"StringBuffer new \"abcd\" <<n(5)\n","language":"Oforth"},{"code":"MESSAGE FILL( \"ha\", 5 ) VIEW-AS ALERT-BOX.\n","language":"OpenEdge-Progress"},{"code":"'REPEATING A CHARACTER\n\nprint string 10,\"A\" 'result AAAAAAAAAA\n\n'REPEATING A STRING\n\nfunction RepeatString(string s,sys n) as string\n sys i, le=len s\n if le=0 then exit function\n n*=le\n function=nuls n\n '\n for i=1 to n step le\n mid function,i,s\n next\nend function\n\nprint RepeatString \"ABC\",3 'result ABCABCABC\n","language":"OxygenBasic"},{"code":"declare\n fun {Repeat Xs N}\n if N > 0 then\n {Append Xs {Repeat Xs N-1}}\n else\n nil\n end\n end\nin\n {System.showInfo {Repeat \"Ha\" 5}}\n","language":"Oz"},{"code":"repeat(s,n)={\n if(n, Str(repeat(s, n-1), s), \"\")\n};\n","language":"PARI-GP"},{"code":"repeat(s,n)=concat(vector(n,i, s));\n","language":"PARI-GP"},{"code":"repeat(s,n)={\n if(n<4, return(concat(vector(n,i, s))));\n if(n%2,\n Str(repeat(Str(s,s),n\\2),s)\n ,\n repeat(Str(s,s),n\\2)\n );\n}\n","language":"PARI-GP"},{"code":"\\\\ Repeat a string str the specified number of times ntimes and return composed string.\n\\\\ 3/3/2016 aev\nsrepeat(str,ntimes)={\nmy(srez=str,nt=ntimes-1);\nif(ntimes<1||#str==0,return(\"\"));\nif(ntimes==1,return(str));\nfor(i=1,nt, srez=concat(srez,str));\nreturn(srez);\n}\n\n{\n\\\\ TESTS\nprint(\" *** Testing srepeat:\");\nprint(\"1.\",srepeat(\"a\",5));\nprint(\"2.\",srepeat(\"ab\",5));\nprint(\"3.\",srepeat(\"c\",1));\nprint(\"4.|\",srepeat(\"d\",0),\"|\");\nprint(\"5.|\",srepeat(\"\",5),\"|\");\nprint1(\"6.\"); for(i=1,10000000, srepeat(\"e\",10));\n}\n","language":"PARI-GP"},{"code":"\"ha\" x 5\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">'*'</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"ha\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"def rep /# s n -- s #/\n \"\" swap\n for drop\n\tover chain\n endfor\n nip\nenddef\n\n\"ha\" 5 rep print\n","language":"Phixmonti"},{"code":"65 5 rep\n65 5 repeat\n'A' 5 repeat\n","language":"Phixmonti"},{"code":"str_repeat(\"ha\", 5)\n","language":"PHP"},{"code":"(pack (need 5 \"ha\"))\n-> \"hahahahaha\"\n","language":"PicoLisp"},{"code":"(pack (make (do 5 (link \"ha\"))))\n-> \"hahahahaha\"\n","language":"PicoLisp"},{"code":"\"ha\"*5;\n","language":"Pike"},{"code":"/* To repeat a string a variable number of times: */\n\ns = repeat('ha', 4);\n\n /* or */\n\ns = copy('ha', 5);\n\n/* To repeat a single character a fixed number of times: */\n\ns = (5)'h'; /* asigns 'hhhhh' to s. */\n","language":"PL-I"},{"code":"To run:\nStart up.\nPut \"ha\" into a string.\nAppend the string to itself given 5.\nWrite the string on the console.\nFill another string with the asterisk byte given 5.\nWrite the other string on the console.\nWait for the escape key.\nShut down.\n\nTo append a string to itself given a number:\nIf the number is less than 1, exit.\nPrivatize the string.\nPrivatize the number.\nSubtract 1 from the number.\nAppend the string to the original string given the number.\n","language":"Plain-English"},{"code":"% the comments show the stack content after the line was executed\n% where rcount is the repeat count, \"o\" is for orignal,\n% \"f\" is for final, and iter is the for loop variable\n%\n% usage: rcount ostring times -> fstring\n\n/times {\n dup length dup % rcount ostring olength olength\n 4 3 roll % ostring olength olength rcount\n mul dup string % ostring olength flength fstring\n 4 1 roll % fstring ostring olength flength\n 1 sub 0 3 1 roll % fstring ostring 0 olength flength_minus_one\n { % fstring ostring iter\n 1 index 3 index % fstring ostring iter ostring fstring\n 3 1 roll % fstring ostring fstring iter ostring\n putinterval % fstring ostring\n } for\n pop % fstring\n} def\n","language":"PostScript"},{"code":"MSGBOX REPEAT$(5, \"ha\")\n","language":"PowerBASIC"},{"code":"\"ha\" * 5 # ==> \"hahahahaha\"\n","language":"PowerShell"},{"code":"void setup() {\n String rep = repeat(\"ha\", 5);\n println(rep);\n}\nString repeat(String str, int times) {\n // make an array of n chars,\n // replace each char with str,\n // and return as a new String\n return new String(new char[times]).replace(\"\\0\", str);\n}\n","language":"Processing"},{"code":"def setup():\n rep = repeat(\"ha\", 5)\n println(rep)\n\ndef repeat(s, times):\n return s * times\n","language":"Processing-Python-mode"},{"code":"%repeat(Str,Num,Res).\nrepeat(Str,1,Str).\nrepeat(Str,Num,Res):-\n Num1 is Num-1,\n repeat(Str,Num1,Res1),\n string_concat(Str, Res1, Res).\n","language":"Prolog"},{"code":":- system:set_prolog_flag(double_quotes,chars) .\n\nrepeat(SOURCEz0,COUNT0,TARGETz)\n:-\nprolog:phrase(repeat(SOURCEz0,COUNT0),TARGETz)\n.\n\n%! repeat(SOURCEz0,COUNT0)//2\n\nrepeat(_SOURCEz0_,0)\n-->\n! ,\n[]\n.\n\nrepeat(SOURCEz0,COUNT0)\n-->\nSOURCEz0 ,\n{ COUNT is COUNT0 - 1 } ,\nrepeat(SOURCEz0,COUNT)\n.\n","language":"Prolog"},{"code":"> str_repeat 0 s = \"\";\n> str_repeat n s = s + (str_repeat (n-1) s) if n>0;\n> str_repeat 5 \"ha\";\n\"hahahahaha\"\n>\n","language":"Pure"},{"code":"str_repeat n::int s::string = string $ take n $ cycle (s:[]);\n","language":"Pure"},{"code":"Procedure.s RepeatString(count, text$=\" \")\n Protected i, ret$=\"\"\n\n For i = 1 To count\n ret$ + text$\n Next\n ProcedureReturn ret$\nEndProcedure\n\nDebug RepeatString(5, \"ha\")\n","language":"PureBasic"},{"code":"\"ha\" * 5 # ==> \"hahahahaha\"\n","language":"Python"},{"code":"5 * \"ha\" # ==> \"hahahahaha\"\n","language":"Python"},{"code":"def repeat(s, times):\n return s * times\n\nprint(repeat(\"ha\", 5))\n","language":"Python"},{"code":"x = lambda a: a * 5\nprint(x(\"ha\"))\n","language":"Python"},{"code":"FUNCTION StringRepeat$ (s$, n)\n cad$ = \"\"\n FOR i = 1 TO n\n cad$ = cad$ + s$\n NEXT i\n StringRepeat$ = cad$\nEND FUNCTION\n\nPRINT StringRepeat$(\"rosetta\", 1)\nPRINT StringRepeat$(\"ha\", 5)\nPRINT StringRepeat$(\"*\", 5)\nEND\n","language":"QBasic"},{"code":"$ \"ha\" 5 of echo$\n","language":"Quackery"},{"code":"100 CLS\n110 LET S$ = \"rosetta\"\n115 LET N = 1\n120 GOSUB 210\n130 PRINT C$\n140 LET S$ = \"ha\"\n145 LET N = 5\n150 GOSUB 210\n160 PRINT C$\n170 LET S$ = \"*\"\n175 LET N = 5\n180 GOSUB 210\n190 PRINT C$\n200 END\n210 REM FUNCTION STRINGREPEAT$(S$,N)\n220 LET C$ = \"\"\n230 FOR I = 1 TO N\n240 LET C$ = C$ + S$\n250 NEXT I\n260 RETURN\n","language":"Quite-BASIC"},{"code":"strrep(\"ha\", 5)\n","language":"R"},{"code":"#lang racket\n;; fast\n(define (string-repeat n str)\n (string-append* (make-list n str)))\n(string-repeat 5 \"ha\") ; => \"hahahahaha\"\n","language":"Racket"},{"code":"(make-string 5 #\\*) => \"*****\"\n","language":"Racket"},{"code":"print \"ha\" x 5\n","language":"Raku"},{"code":"'For a single char\nshowmessage String$(10, \"-\")\n\n'For strings with more than one char\nfunction Repeat$(Expr as string, Count as integer) as string\n dim x as integer\n for x = 1 to Count\n Result = Result + Expr\n next\nend function\n\nshowmessage Repeat$(\"ha\", 5)\n","language":"RapidQ"},{"code":"Function Repeat(s As String, count As Integer) As String\n Dim output As String\n For i As Integer = 0 To count\n output = output + s\n Next\n Return output\nEnd Function\n","language":"REALbasic"},{"code":"head insert/dup \"\" \"ha\" 5\n","language":"REBOL"},{"code":">> str: \"Add duplicates to string\"\n>> insert/dup str \"ha\" 3\n== \"hahahaAdd duplicates to string\"\n>> insert/dup tail str \"ha\" 3\n== \"hahahaAdd duplicates to stringhahaha\"\n","language":"Red"},{"code":"Js.log(Js.String2.repeat(\"ha\", 5))\n","language":"ReScript"},{"code":"with strings'\n: repeatString ( $n-$ )\n 1- [ dup ] dip [ over prepend ] times nip ;\n\n\"ha\" 5 repeatString\n","language":"Retro"},{"code":"/*REXX program to show various ways to repeat a string (or repeat a single char).*/\n\n/*all examples are equivalent, but not created equal.*/\n\n /*───────────────────────────────────────────*/\ny='ha'\nz=copies(y,5)\n /*───────────────────────────────────────────*/\nz=copies( 'ha', 5 )\n /*───────────────────────────────────────────*/\ny='ha'\nz=y||y||y||y||y\n /*───────────────────────────────────────────*/\ny='ha'\nz=y || y || y || y || y /*same as previous, but the \"big sky\" version*/\n /*───────────────────────────────────────────*/\ny='ha'\nz=''\n do 5\n z=z||y\n end\n /*───────────────────────────────────────────*/\ny=\"ha\"\nz=\n do 5\n z=z||y\n end\n /*───────────────────────────────────────────*/\ny=\"ha\"\nz=\n do i=101 to 105\n z=z||y\n end\n\n /*───────────────────────────────────────────*/\ny='+'\nz=left('',5,y)\n /*───────────────────────────────────────────*/\ny='+'\nz=right('',5,y)\n /*───────────────────────────────────────────*/\ny='+'\nz=substr('',1,5,y)\n /*───────────────────────────────────────────*/\ny='+'\nz=center('',5,y)\n /*───────────────────────────────────────────*/\ny='+'\nz=centre('',5,y)\n /*───────────────────────────────────────────*/\ny='+'\nz=space('',5,y)\n /*───────────────────────────────────────────*/\ny='+'\nz=translate('@@@@@',y,\"@\")\n /*───────────────────────────────────────────*/\ny='abcdef'\nz=five(y)\nexit\n\nfive: procedure expose y; parse arg g\nif length(g)>=5*length(y) then return g\nreturn five(y||g)\n /*───────────────────────────────────────────*/\ny='something wicked this way comes.'\nz=y||y||y||y||y||y||y||y||y||y||y||y|\\y||y||y\nz=left(z,5*length(y))\n /*───────────────────────────────────────────*/\ny='+'\nz=copies('',5,y)\n /*───────────────────────────────────────────*/\ny='+'\nz=lower('',1,5,y)\n /*───────────────────────────────────────────*/\ny='+'\nz=lower('',,5,y)\n /*───────────────────────────────────────────*/\nz='+'\nz=upper('',1,5,y)\n /*───────────────────────────────────────────*/\nz=upper('',,5,y)\n /*───────────────────────────────────────────*/\n\ny='charter bus.'\nz='*****'\nz=changestr('*',z,y)\n /*───────────────────────────────────────────*/\ny='what the hey!'\nz=\n do until length(z)==5*length(y)\n z=z||y\n end\n /*───────────────────────────────────────────*/\ny='what the hey!'\nz=\n do until length(z)==5*length(y)\n z=insert(z,0,y)\n end\n /*───────────────────────────────────────────*/\ny='yippie ki yay'\nz=\n do i=1 by 5 for 5\n z=overlay(y,z,i)\n end\n /*───────────────────────────────────────────*/\ny='+'\nz=justify('',5,y)\n /*───────────────────────────────────────────*/\nwhatever_this_variable_is_____it_aint_referenced_directly= 'boy oh boy.'\nz=; signal me; me:\n do 5\n z=z||strip(subword(sourceline(sigl-1),2),,\"'\")\n end\n /*───────────────────────────────────────────*/\ny=\"any more examples & the angry townfolk with pitchforks will burn the castle.\"\nparse value y||y||y||y||y with z\n\nexit /*stick a fork in it, we're done.*/\n","language":"REXX"},{"code":" Copy(\"ha\" , 5) # ==> \"hahahahaha\"\n","language":"Ring"},{"code":"\"ha\" * 5 # ==> \"hahahahaha\"\n","language":"Ruby"},{"code":"a$ = \"ha \"\nfor i = 1 to 5\n a1$ = a1$ + a$\nnext i\na$ = a1$\nprint a$\n","language":"Run-BASIC"},{"code":"std::iter::repeat(\"ha\").take(5).collect::<String>(); // ==> \"hahahahaha\"\n","language":"Rust"},{"code":"\"ha\".repeat(5); // ==> \"hahahahaha\"\n","language":"Rust"},{"code":"\"ha\" * 5 // ==> \"hahahahaha\"\n","language":"Scala"},{"code":"(define (string-repeat n str)\n (apply string-append (vector->list (make-vector n str))))\n","language":"Scheme"},{"code":"(define (string-repeat n str)\n\t(fold string-append \"\" (make-list n str)))\n(string-repeat 5 \"ha\") ==> \"hahahahaha\"\n","language":"Scheme"},{"code":"(make-string 5 #\\*)\n","language":"Scheme"},{"code":"$ echo ha | sed 's/.*/&&&&&/'\nhahahahaha\n","language":"Sed"},{"code":"$ include \"seed7_05.s7i\";\n\nconst proc: main is func\n begin\n writeln(\"ha\" mult 5);\n end func;\n","language":"Seed7"},{"code":"put \"Ho!\" repeated 3 times\n\nput \"Merry\" repeated to length 12\n","language":"SenseTalk"},{"code":"'ha' * 5; # ==> 'hahahahaha'\n","language":"Sidef"},{"code":" 10 LET S$=\"HA\"\n 20 LET N=5\n 30 GOSUB 60\n 40 PRINT T$\n 50 STOP\n 60 LET T$=\"\"\n 70 FOR I=1 TO N\n 80 LET T$=T$+S$\n 90 NEXT I\n100 RETURN\n","language":"Sinclair-ZX81-BASIC"},{"code":"v := 'ha'.\nv,v,v,v,v\n","language":"Smalltalk"},{"code":"((1 to: n) collect: [:x | 'ha']) joinUsing: ''.\n","language":"Smalltalk"},{"code":"(Array new:n withAll:'ha') asStringWith:''.\n","language":"Smalltalk"},{"code":"ws := '' writeStream.\nn timesRepeat: [ws nextPutAll: 'ha'].\nws contents.\n","language":"Smalltalk"},{"code":"(String streamContents:[:ws | n timesRepeat: [ws nextPutAll: 'ha']])\n","language":"Smalltalk"},{"code":"String new:n withAll:$*\n","language":"Smalltalk"},{"code":"(String new:n) atAllPut:$*\n","language":"Smalltalk"},{"code":"\toutput = dupl(\"ha\",5)\nend\n","language":"SNOBOL4"},{"code":"spn:3> repeat(\"na\", 8) .. \" Batman!\"\n= nananananananana Batman!\n","language":"Sparkling"},{"code":"select rpad('', 10, 'ha')\n","language":"SQL"},{"code":"VALUES REPEAT('ha', 5);\nVALUES RPAD('', 10, 'ha');\n","language":"SQL-PL"},{"code":"fun string_repeat (s, n) =\n concat (List.tabulate (n, fn _ => s))\n;\n","language":"Standard-ML"},{"code":"- string_repeat (\"Hiuoa\", 3) ;\nval it = \"HiuoaHiuoaHiuoa\" : string\n","language":"Standard-ML"},{"code":"fun char_repeat (c, n) =\n implode (List.tabulate (n, fn _ => c))\n;\n","language":"Standard-ML"},{"code":". scalar a=\"ha\"\n. scalar b=a*5\n. display b\nhahahahaha\n","language":"Stata"},{"code":"'ha'.Repeat(5) --> \"hahahahaha\"\n'*'.Repeat(5) --> \"*****\"\n","language":"Suneido"},{"code":"print(String(repeating:\"*\", count: 5))\n","language":"Swift"},{"code":"func * (left:String, right:Int) -> String {\n return String(repeating:left, count:right)\n}\n\nprint (\"HA\" * 5)\n","language":"Swift"},{"code":"extension String {\n // Slower version\n func repeatString(n: Int) -> String {\n return Array(count: n, repeatedValue: self).joinWithSeparator(\"\")\n }\n\n // Faster version\n // benchmarked with a 1000 characters and 100 repeats the fast version is approx 500 000 times faster :-)\n func repeatString2(n:Int) -> String {\n var result = self\n for _ in 1 ..< n {\n result.appendContentsOf(self) // Note that String.appendContentsOf is up to 10 times faster than \"result += self\"\n }\n return result\n }\n}\n\nprint( \"ha\".repeatString(5) )\nprint( \"he\".repeatString2(5) )\n","language":"Swift"},{"code":"String(count:5, repeatedValue:\"*\" as Character)\n","language":"Swift"},{"code":"extension String {\n func repeatBiterative(count: Int) -> String {\n var reduceCount = count\n var result = \"\"\n var doubled = self\n while reduceCount != 0 {\n if reduceCount & 1 == 1 {\n result.appendContentsOf(doubled)\n }\n reduceCount >>= 1\n if reduceCount != 0 {\n doubled.appendContentsOf(doubled)\n }\n }\n return result\n }\n}\n\n\"He\".repeatBiterative(5)\n","language":"Swift"},{"code":"'$:1..5 -> 'ha';' -> !OUT::write\n","language":"Tailspin"},{"code":"string repeat \"ha\" 5 ;# => hahahahaha\n","language":"Tcl"},{"code":"function strRep(%str,%int)\n{\n\tfor(%i = 0; %i < %int; %i++)\n\t{\n\t\t%rstr = %rstr@%str;\n\t}\n\n\treturn %rstr;\n}\n","language":"TorqueScript"},{"code":"when flag clicked\nset String to \"meow\"\nset Count to 4\nset Repeated to \"\"\nrepeat Count\n\tset Repeated to (join (Repeated) (String))\nend\nstop this script\n","language":"Tosh"},{"code":"select REPLICATE( 'ha', 5 )\n","language":"Transact-SQL"},{"code":"FUNCTION StringRepeat$ (s$, n)\n LET cad$ = \"\"\n FOR i = 1 TO n\n LET cad$ = cad$ & s$\n NEXT i\n LET StringRepeat$ = cad$\nEND FUNCTION\n\nPRINT StringRepeat$(\"rosetta\", 1)\nPRINT StringRepeat$(\"ha\", 5)\nPRINT StringRepeat$(\"*\", 5)\nEND\n","language":"True-BASIC"},{"code":"$$ MODE TUSCRIPT\nrepeatstring=REPEAT (\"ha\",5)\n","language":"TUSCRIPT"},{"code":"printf \"ha\"%.0s {1..5}\n","language":"UNIX-Shell"},{"code":"i=5\nprintf \"ha\"%.0s {1..$i}\n","language":"UNIX-Shell"},{"code":"i=5\neval \"printf 'ha'%.0s {1..$i}\"\n","language":"UNIX-Shell"},{"code":"reprint() {\n typeset e=\"$(sed -e 's,%,%%,g' -e 's,\\\\,\\\\\\\\,g' <<<\"$1\")\"\n eval 'printf \"$e\"%.0s '\"{1..$2}\"\n}\nreprint '% ha \\' 5\n","language":"UNIX-Shell"},{"code":"len=12; str='='\nrepeat $len printf \"$str\"\n","language":"UNIX-Shell"},{"code":"width=72; char='='\nhead -c ${width} < /dev/zero | tr '\\0' \"$char\"\n","language":"UNIX-Shell"},{"code":"#import nat\n\nrepeat = ^|DlSL/~& iota\n\n#cast %s\n\nexample = repeat('ha',5)\n","language":"Ursala"},{"code":"// Repeat a string, in V\n// Tectonics: v run repeat-a-string.v\nmodule main\nimport strings\n\n// starts here\npub fn main() {\n // A strings module function to repeat strings\n println(strings.repeat_string(\"ha\", 5))\n\n // Another strings module function to repeat a byte\n // This indexes the string to get the first byte of the rune array\n println(strings.repeat(\"*\"[0], 5))\n}\n","language":"V-(Vlang)"},{"code":"string s = \"ha\";\nstring copy = \"\";\nfor (int x = 0; x < 5; x++)\n\tcopy += s;\n","language":"Vala"},{"code":"string s = string.nfill(5, 'c');\n","language":"Vala"},{"code":"Public Function RepeatStr(aString As String, aNumber As Integer) As String\n\tDim bString As String, i As Integer\n\tbString = \"\"\n\tFor i = 1 To aNumber\n\t\tbString = bString & aString\n\tNext i\n\tRepeatStr = bString\nEnd Function\n\nDebug.Print RepeatStr(\"ha\", 5)\n","language":"VBA"},{"code":"Public Function RepeatString(stText As String, iQty As Integer) As String\n RepeatString = Replace(String(iQty, \"x\"), \"x\", stText)\nEnd Function\n","language":"VBA"},{"code":"Debug.Print String(5, \"x\")\n","language":"VBA"},{"code":"replace(string(5,\"@\"),\"@\",\"hello\")\n","language":"VBScript"},{"code":"Ins_Text(\"ha\", COUNT, 5)\n","language":"Vedit-macro-language"},{"code":"Public Function StrRepeat(s As String, n As Integer) As String\n\tDim r As String, i As Integer\n\tr = \"\"\n\tFor i = 1 To n\n\t\tr = r & s\n\tNext i\n\tStrRepeat = r\nEnd Function\n\nDebug.Print StrRepeat(\"ha\", 5)\n","language":"Visual-Basic"},{"code":"Public Function StrRepeat(sText As String, n As Integer) As String\n\tStrRepeat = Replace(String(n, \"*\"), \"*\", sText)\nEnd Function\n","language":"Visual-Basic"},{"code":"Debug.Print String(5, \"x\")\n","language":"Visual-Basic"},{"code":"Debug.Print(Replace(Space(5), \" \", \"Ha\"))\n","language":"Visual-Basic-.NET"},{"code":"Debug.Print(StrDup(5, \"x\"))\nDebug.Print(\"\".PadRight(5, \"x\"))\nDebug.Print(\"\".PadLeft(5, \"x\"))\n","language":"Visual-Basic-.NET"},{"code":"? REPLICATE(\"HO\", 3)\n","language":"Visual-FoxPro"},{"code":"def (s * n) :case (string? s)\n with outstring\n repeat n\n pr s\n\n(\"ha\" * 5)\n=> \"hahahahaha\"\n","language":"Wart"},{"code":"@join \"\" @rep 5 \"ha\" ; returns \"hahahahaha\"\n","language":"Wortel"},{"code":"^(\\@join \"\" @rep)\n","language":"Wortel"},{"code":"System.print(\"ha\" * 5)\n","language":"Wren"},{"code":"PROGRAM\t\"Repeat a string\"\nVERSION\t\"0.0000\"\n\nDECLARE FUNCTION Entry ()\nDECLARE FUNCTION StringRepeat$ (s$, n)\n\nFUNCTION Entry ()\n\nPRINT StringRepeat$ (\"rosetta\", 1)\nPRINT StringRepeat$ (\"ha\", 5)\nPRINT StringRepeat$ (\"*\", 5)\n\nEND FUNCTION\nFUNCTION StringRepeat$ (s$, n)\n cad$ = \"\"\n FOR i = 1 TO n\n cad$ = cad$ + s$\n NEXT i\n RETURN cad$\nEND FUNCTION\nEND PROGRAM\n","language":"XBasic"},{"code":"cod T=12; int I; for I gets 1,5 do T(0,\"ha\")\n","language":"XPL0"},{"code":"sub StringRepeat$ (s$, n)\n cad$ = \"\"\n for i = 1 to n\n cad$ = cad$ + s$\n next i\n return cad$\nend sub\n\nprint StringRepeat$(\"rosetta\", 1)\nprint StringRepeat$(\"ha\", 5)\nprint StringRepeat$(\"*\", 5)\nend\n","language":"Yabasic"},{"code":"array(\"ha\", 5)(sum)\n","language":"Yorick"},{"code":"PrintChar equ &BB5A ;Amstrad CPC BIOS call, prints the ascii code in the accumulator to the screen.\n\norg &8000\nld b,5 ; repeat 5 times\n\nloop:\ncall PrintImmediate\nbyte \"ha\",0\ndjnz loop\n\nret ; return to basic\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\nPrintImmediate:\npop hl ; get the return address into HL, it's the start of the embedded string.\ncall PrintString\n; inc hl ; if your strings are null-terminated you can omit this, since a 0 equals the \"NOP\" instruction\njp (hl) ; acts as a ret, returning execution to the instruction just after the embedded string.\n\nPrintString:\nld a,(hl) ; read in a character from the string\nor a ; if your strings are null-terminated you can use this as a shortcut, otherwise use the compare instruction\nret z ; exit once the terminator is reached.\ncall PrintChar ; BIOS call, all regs are preserved.\ninc hl ; next char\njr PrintString ; back to start.\n","language":"Z80-Assembly"},{"code":"const laugh = \"ha\" ** 5;\n","language":"Zig"},{"code":"const std = @import(\"std\");\nconst warn = std.debug.warn;\n\nconst Allocator = std.mem.Allocator;\n\nfn repeat(s: []const u8, times: u16, allocator: *Allocator) ![]u8 {\n const repeated = try allocator.alloc(u8, s.len*times);\n\n var i: usize = 0;\n while (i < s.len*times) : (i += 1) {\n repeated[i] = s[i % 2];\n }\n\n return repeated;\n}\n\npub fn main() !void {\n const allocator = std.debug.global_allocator;\n const ex = try repeat(\"ha\", 5, allocator);\n defer allocator.free(ex);\n}\n","language":"Zig"},{"code":"\"ha\" * 5 # --> \"hahahahaha\"\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Repeat_a_string\\nnote: String manipulation\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Take a string and repeat it some number of times. \\n\\nExample: repeat(\\\"ha\\\", 5) => \\\"hahahahaha\\\"\\n\\nIf there is a simpler/more efficient way to repeat a single “character” (i.e. creating a string filled with a certain character), you might want to show that as well (i.e. repeat-char(\\\"*\\\", 5) => \\\"*****\\\").\\n\\n\\n{{Template:Strings}}\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"print(‘ha’ * 5)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Repeat a string - 19/04/2020\\nREPEATS CSECT\\n USING REPEATS,R13 base register\\n B 72(R15) skip savearea\\n DC 17F'0' savearea\\n SAVE (14,12) save previous context\\n ST R13,4(R15) link backward\\n ST R15,8(R13) link forward\\n LR R13,R15 set addressability\\n XPRNT C24,24 print c24\\n LA R1,PARMLST pg=repeat(cx,ii) - repeat('abc ',6)\\n BAL R14,REPEAT call repeat\\n XPRNT PG,L'PG print pg\\n L R13,4(0,R13) restore previous savearea pointer\\n RETURN (14,12),RC=0 restore registers from calling save\\nREPEAT CNOP 0,4 procedure repeat(b,a,i)\\n STM R2,R8,REPEATSA save registers\\n L R2,0(R1) @b=%r1\\n L R3,4(R1) @a=%(r1+4)\\n L R4,8(R1) @i=%(r1+8)\\n LR R5,R3 length(a) before a\\n SH R5,=H'2' @lengh(a)\\n LH R6,0(R5) l=length(a)\\n LR R7,R6 l\\n BCTR R7,0 l-1\\n L R8,0(R4) i=%r4\\n LTR R8,R8 if i<=0\\n BNP RET then return\\nLOOP EX R7,MVCX move a to b len R6\\n AR R2,R6 @b+=l\\n BCT R8,LOOP loop i times\\nRET LM R2,R8,REPEATSA restore registers\\n BR R14 return\\nPARMLST DC A(PG,CX,II) parmlist\\nREPEATSA DS 7F local savearea\\nMVCX MVC 0(0,R2),0(R3) move @ R3 to @ R2\\nC24 DC 6C'xyz ' constant repeat - repeat('xyz ',6)\\nLCX DC AL2(L'CX) lengh(cc)\\nCX DC CL4'abc ' cx\\nII DC F'6' ii\\nPG DC CL80' ' pg\\n REGEQU\\n END REPEATS\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"gosub repeat ha 5\\necho %@repeat[*,5]\\nquit\\n\\n:Repeat [String Times]\\n do %Times%\\n echos %String%\\n enddo\\n echo.\\nreturn\\n\",\n \"language\": \"4DOS-Batch\"\n },\n {\n \"code\": \"CHROUT equ $FFD2 ;KERNAL call, prints the accumulator to the screen as an ascii value.\\n\\n\\torg $0801\\t\\t\\n\\n\\n\\tdb $0E,$08,$0A,$00,$9E,$20,$28,$32,$30,$36,$34,$29,$00,$00,$00\\n\\n\\n\\n\\t\\n\\tlda #>TestStr\\n\\tsta $11\\n\\t\\n\\tlda #<TestStr\\t\\n\\tsta $10\\n\\n\\t\\n\\tldx #5\\t\\t\\t\\t;number of times to repeat\\n\\nloop:\\t\\n\\tjsr PrintString\\n\\tdex\\n\\tbne loop\\n\\t\\n\\n\\tRTS\\t\\t\\t\\t\\t;RETURN TO BASIC\\n\\t\\n\\t\\nPrintString:\\n\\tldy #0\\t\\t\\t\\t\\nloop_PrintString:\\n\\tlda ($10),y\\t\\t\\t;this doesn't actually increment the pointer itself, so we don't need to back it up.\\n\\tbeq donePrinting\\t\\n\\tjsr CHROUT\\t\\n\\tiny\\n\\tjmp loop_PrintString\\t\\ndonePrinting:\\n\\trts\\t\\t\\t\\t\\t\\n\\t\\n\\t\\t\\n\\t\\nTestStr:\\t\\t\\t\\t\\n\\tdb \\\"HA\\\",0\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"MOVE.W #5-1,D1\\nRepString:\\nLEA A3, MyString\\nMOVE.L A3,-(SP) ;PUSH A3\\nJSR PrintString ;unimplemented hardware-dependent printing routine, assumed to not clobber D1\\nMOVE.L (SP)+,A3 ;POP A3\\nDBRA D1,RepString\\nRTS ;return to basic or whatever\\n\\nMyString:\\nDC.B \\\"ha\\\",0\\neven\\n\",\n \"language\": \"68000-Assembly\"\n },\n {\n \"code\": \" org 100h\\n jmp demo\\n\\n ; Repeat the string at DE into HL, B times\\nrepeat: mvi c,'$' ; string terminator\\n xra a ; repeat 0x?\\n ora b\\n mov m,c ; then empty string\\n rz\\nrpt1: push d ; save begin of string to repeat\\nchcpy: ldax d ; copy character from input to output\\n mov m,a\\n inx d ; advance pointers\\n inx h\\n cmp c ; end of string?\\n jnz chcpy\\n pop d ; restore begin of string to repeat\\n dcx h ; move back past terminator in copy\\n dcr b ; done yet?\\n jnz rpt1 ; if not add another copy\\n ret\\n\\ndemo: lxi d,ha ; get string to repeat\\n lxi h,buf ; place to store result\\n mvi b,5 ; repeat 5 times\\n call repeat\\n lxi d,buf ; print result using CP/M call\\n mvi c,9\\n jmp 5\\n\\nha: db 'ha$' ; string to repeat\\nbuf: ds 32 ; place to store repeated string\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \"\\\"ha\\\" 5 s:*\\n. cr\\n\",\n \"language\": \"8th\"\n },\n {\n \"code\": \"report z_repeat_string.\\n\\nwrite repeat( val = `ha` occ = 5 ).\\n\",\n \"language\": \"ABAP\"\n },\n {\n \"code\": \"Proc Main()\\n byte REPEAT\\n\\n REPEAT=5\\n Do\\n Print(\\\"ha\\\")\\n REPEAT==-1\\n Until REPEAT=0\\n Do\\n\\nReturn\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"function repeatString(string:String, numTimes:uint):String\\n{\\n\\tvar output:String = \\\"\\\";\\n\\tfor(var i:uint = 0; i < numTimes; i++)\\n\\t\\toutput += string;\\n\\treturn output;\\n}\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"function repeatRecursive(string:String, numTimes:uint):String\\n{\\n\\tif(numTimes == 0) return \\\"\\\";\\n\\tif(numTimes & 1) return string + repeatRecursive(string, numTimes - 1);\\n\\tvar tmp:String = repeatRecursive(string, numTimes/2);\\n\\treturn tmp + tmp;\\n}\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"import mx.utils.StringUtil;\\ntrace(StringUtil.repeat(\\\"ha\\\", 5));\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"with Ada.Strings.Fixed; use Ada.Strings.Fixed;\\nwith Ada.Text_IO; use Ada.Text_IO;\\n\\nprocedure String_Multiplication is\\nbegin\\n Put_Line (5 * \\\"ha\\\");\\nend String_Multiplication;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"call_n(5, o_text, \\\"ha\\\");\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"print (5 * \\\"ha\\\")\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#!/usr/bin/hopper\\n#include <hopper.h>\\n\\nmain:\\n {\\\"ha\\\"}replyby(5), println\\n {\\\"ha\\\",5}replicate, println\\n{0}return\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \" 10⍴'ha'\\nhahahahaha\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \" REPEAT←{(⍺×⍴⍵)⍴⍵}\\n 5 REPEAT 'ha'\\nhahahahaha\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"set str to \\\"ha\\\"\\nset final_string to \\\"\\\"\\nrepeat 5 times\\n set final_string to final_string & str\\nend repeat\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"replicate(5000, \\\"ha\\\")\\n\\n-- Repetition by 'Egyptian multiplication' -\\n-- progressively doubling a list, appending\\n-- stages of doubling to an accumulator where needed for\\n-- binary assembly of a target length.\\n\\n-- replicate :: Int -> String -> String\\non replicate(n, s)\\n set out to \\\"\\\"\\n if n < 1 then return out\\n set dbl to s\\n\\n repeat while (n > 1)\\n if (n mod 2) > 0 then set out to out & dbl\\n set n to (n div 2)\\n set dbl to (dbl & dbl)\\n end repeat\\n return out & dbl\\nend replicate\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"FOR I = 1 TO 5 : S$ = S$ + \\\"HA\\\" : NEXT\\n\\n? \\\"X\\\" SPC(20) \\\"X\\\"\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"print repeat \\\"ha\\\" 5\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"MsgBox % Repeat(\\\"ha\\\",5)\\n\\nRepeat(String,Times)\\n{\\n Loop, %Times%\\n Output .= String\\n Return Output\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#include <String.au3>\\n\\nConsoleWrite(_StringRepeat(\\\"ha\\\", 5) & @CRLF)\\n\",\n \"language\": \"AutoIt\"\n },\n {\n \"code\": \"function repeat( str, n, rep, i )\\n{\\n for( ; i<n; i++ )\\n rep = rep str\\n return rep\\n}\\n\\nBEGIN {\\n print repeat( \\\"ha\\\", 5 )\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"main: { \\\"ha\\\" 5 print_repeat }\\n\\nprint_repeat!: { <- { dup << } -> times }\\n\",\n \"language\": \"Babel\"\n },\n {\n \"code\": \"hahahahaha\\n\",\n \"language\": \"Babel\"\n },\n {\n \"code\": \"DOTIMES 5\\n s$ = s$ & \\\"ha\\\"\\nDONE\\nPRINT s$\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"PRINT FILL$(5, ASC(\\\"x\\\"))\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"function StringRepeat$ (s$, n)\\n\\tcad$ = \\\"\\\"\\n\\tfor i = 1 to n\\n\\t\\tcad$ += s$\\n\\tnext i\\n\\treturn cad$\\nend function\\n\\nprint StringRepeat$(\\\"rosetta\\\", 1)\\nprint StringRepeat$(\\\"ha\\\", 5)\\nprint StringRepeat$(\\\"*\\\", 5)\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off\\nif \\\"%2\\\" equ \\\"\\\" goto fail\\nsetlocal enabledelayedexpansion\\nset char=%1\\nset num=%2\\nfor /l %%i in (1,1,%num%) do set res=!res!%char%\\necho %res%\\n:fail\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \"@echo off\\nset /p a=Enter string to repeat :\\nset /p b=Enter how many times to repeat :\\nset \\\"c=1\\\"\\nset \\\"d=%b%\\\"\\n:a\\necho %a%\\nset \\\"c=%c%+=1\\\"\\nif /i _\\\"%c%\\\"==_\\\"%d%\\\" (exit /b)\\ngoto :a\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \"@echo off\\n@FOR /L %%i in (0,1,9) DO @CALL :REPEAT %%i\\n@echo That's it!\\n@FOR /L %%i in (0,1,9) DO @CALL :REPEAT %%i\\n@echo.\\n@echo And that!\\n@GOTO END\\n\\n:REPEAT\\n@echo|set /p=\\\"*\\\"\\n@GOTO:EOF\\n\\n:END\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" PRINT STRING$(5, \\\"ha\\\")\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"String s = new String('X', 5);\\ns.Replace(\\\"X\\\", \\\"ha\\\");\\n\",\n \"language\": \"Beef\"\n },\n {\n \"code\": \"String s1 = scope .();\\ns1.PadLeft(5, '*');\\n\",\n \"language\": \"Beef\"\n },\n {\n \"code\": \" p <\\n p0~1<}~< d@<\\n_VT@1~>yg~9PKd@M'd;\\n\",\n \"language\": \"Beeswax\"\n },\n {\n \"code\": \"v> \\\">:#,_v\\n>29*+00p>~:\\\"0\\\"- #v_v $\\n v ^p0p00:-1g00< $ >\\n v p00&p0-1g00+4*65< >00g1-:00p#^_@\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \"Repeat ← ×⟜≠ ⥊ ⊢\\n\\n•Show 5 Repeat \\\"Hello\\\"\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"\\\"HelloHelloHelloHelloHello\\\"\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"(repeat=\\n string N rep\\n. !arg:(?string.?N)\\n & !string:?rep\\n & whl\\n ' (!N+-1:>0:?N&!string !rep:?rep)\\n & str$!rep\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"+++++ +++++\\tinit first as 10 counter\\n[-> +++++ +++++<] we add 10 to second each loopround\\n\\n\\t\\tNow we want to loop 5 times to follow std\\n+++++\\n[-> ++++ . ----- -- . +++<] print h and a each loop\\n\\nand a newline because I'm kind and it looks good\\n+++++ +++++ +++ . --- .\\n\",\n \"language\": \"Brainf---\"\n },\n {\n \"code\": \"p \\\"ha\\\" * 5 #Prints \\\"hahahahaha\\\"\\n\",\n \"language\": \"Brat\"\n },\n {\n \"code\": \"blsq ) 'h5?*\\n\\\"hhhhh\\\"\\nblsq ) \\\"ha\\\"5.*\\\\[\\n\\\"hahahahaha\\\"\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n\\nchar * string_repeat( int n, const char * s ) {\\n size_t slen = strlen(s);\\n char * dest = malloc(n*slen+1);\\n\\n int i; char * p;\\n for ( i=0, p = dest; i < n; ++i, p += slen ) {\\n memcpy(p, s, slen);\\n }\\n *p = '\\\\0';\\n return dest;\\n}\\n\\nint main() {\\n char * result = string_repeat(5, \\\"ha\\\");\\n puts(result);\\n free(result);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"...\\nchar *string_repeat(const char *str, int n)\\n{\\n char *pa, *pb;\\n size_t slen = strlen(str);\\n char *dest = malloc(n*slen+1);\\n\\n pa = dest + (n-1)*slen;\\n strcpy(pa, str);\\n pb = --pa + slen;\\n while (pa>=dest) *pa-- = *pb--;\\n return dest;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n\\nchar * char_repeat( int n, char c ) {\\n char * dest = malloc(n+1);\\n memset(dest, c, n);\\n dest[n] = '\\\\0';\\n return dest;\\n}\\n\\nint main() {\\n char * result = char_repeat(5, '*');\\n puts(result);\\n free(result);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <string>\\n#include <iostream>\\n\\nstd::string repeat( const std::string &word, int times ) {\\n std::string result ;\\n result.reserve(times*word.length()); // avoid repeated reallocation\\n for ( int a = 0 ; a < times ; a++ )\\n result += word ;\\n return result ;\\n}\\n\\nint main( ) {\\n std::cout << repeat( \\\"Ha\\\" , 5 ) << std::endl ;\\n return 0 ;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <string>\\n#include <iostream>\\n\\nint main( ) {\\n std::cout << std::string( 5, '*' ) << std::endl ;\\n return 0 ;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <string>\\n#include <iostream>\\n\\nstd::string repeat( const std::string &word, uint times ) {\\n return\\n times == 0 ? \\\"\\\" :\\n times == 1 ? word :\\n times == 2 ? word + word :\\n repeat(repeat(word, times / 2), 2) +\\n repeat(word, times % 2);\\n}\\n\\nint main( ) {\\n std::cout << repeat( \\\"Ha\\\" , 5 ) << std::endl ;\\n return 0 ;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"string s = \\\"\\\".PadLeft(5, 'X').Replace(\\\"X\\\", \\\"ha\\\");\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"string s = new String('X', 5).Replace(\\\"X\\\", \\\"ha\\\");\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"string s = String.Join(\\\"ha\\\", new string[5 + 1]);\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"string s = String.Concat(Enumerable.Repeat(\\\"ha\\\", 5));\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"string s = \\\"\\\".PadLeft(5, '*');\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"string s = new String('*', 5);\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"shared void repeatAString() {\\n\\tprint(\\\"ha\\\".repeat(5));\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"100 cls\\n110 print stringrepeat$(\\\"rosetta\\\",1)\\n120 print stringrepeat$(\\\"ha\\\",5)\\n130 print stringrepeat$(\\\"*\\\",5)\\n140 end\\n150 function stringrepeat$(s$,n)\\n160 cad$ = \\\"\\\"\\n170 for i = 1 to n\\n180 cad$ = cad$+s$\\n190 next i\\n200 stringrepeat$ = cad$\\n210 end function\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \" Replicate( \\\"Ha\\\", 5 )\\n\",\n \"language\": \"Clipper\"\n },\n {\n \"code\": \"(apply str (repeat 5 \\\"ha\\\"))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"IDENTIFICATION DIVISION.\\nPROGRAM-ID. REPEAT-PROGRAM.\\nDATA DIVISION.\\nWORKING-STORAGE SECTION.\\n77 HAHA PIC A(10).\\nPROCEDURE DIVISION.\\n MOVE ALL 'ha' TO HAHA.\\n DISPLAY HAHA.\\n STOP RUN.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"<cfset word = 'ha'>\\n<Cfset n = 5>\\n<Cfoutput>\\n<Cfloop from=\\\"1\\\" to=\\\"#n#\\\" index=\\\"i\\\">#word#</Cfloop>\\n</Cfoutput>\\n\",\n \"language\": \"ColdFusion\"\n },\n {\n \"code\": \"(defun repeat-string (n string)\\n (with-output-to-string (stream)\\n (loop repeat n do (write-string string stream))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defun repeat-string (n string\\n &aux\\n (len (length string))\\n (result (make-string (* n len)\\n :element-type (array-element-type string))))\\n (loop repeat n\\n for i from 0 by len\\n do (setf (subseq result i (+ i len)) string))\\n result)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defun repeat-string (n string)\\n (format nil \\\"~V@{~a~:*~}\\\" n string))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(princ (repeat-string 5 \\\"hi\\\"))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(make-string 5 :initial-element #\\\\X)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"puts \\\"ha\\\" * 5\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio, std.array;\\n\\nvoid main() {\\n writeln(\\\"ha\\\".replicate(5));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio;\\n\\nvoid main() {\\n char[] chars; // create the dynamic array\\n chars.length = 5; // set the length\\n chars[] = '*'; // set all characters in the string to '*'\\n writeln(chars);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"$ write sys$output f$fao( \\\"!AS!-!AS!-!AS!-!AS!-!AS\\\", \\\"ha\\\" )\\n$ write sys$output f$fao( \\\"!12*d\\\" )\\n\",\n \"language\": \"DCL\"\n },\n {\n \"code\": \"function RepeatString(const s: string; count: cardinal): string;\\nvar\\n i: Integer;\\nbegin\\n for i := 1 to count do\\n Result := Result + s;\\nend;\\n\\nWriteln(RepeatString('ha',5));\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"Writeln( StringOfChar('a',5) );\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"function RepeatStr(const s: string; i: Cardinal): string;\\nbegin\\n if i = 0 then\\n result := ''\\n else\\n result := s + RepeatStr(s, i-1)\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"StrUtils.DupeString\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"PrintLn( StringOfString('abc',5) );\\n\",\n \"language\": \"DWScript\"\n },\n {\n \"code\": \"PrintLn( StringOfChar('a',5) );\\n\",\n \"language\": \"DWScript\"\n },\n {\n \"code\": \"String.Repeat(\\\"ha\\\", 5)\\n\",\n \"language\": \"Dyalect\"\n },\n {\n \"code\": \"\\\"ha\\\" * 5\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"func$ rep s$ n .\\n for i to n\\n r$ &= s$\\n .\\n return r$\\n.\\nprint rep \\\"ha\\\" 5\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"IMPORT STD; //Imports the Standard Library\\n\\nSTRING MyBaseString := 'abc';\\nRepeatedString := STD.Str.Repeat(MyBaseString,3);\\nRepeatedString; //returns 'abcabcabc'\\n\",\n \"language\": \"ECL\"\n },\n {\n \"code\": \"RepeatString(STRING InStr, INTEGER Cnt) := FUNCTION\\n rec := {STRING Str};\\n ds := DATASET(Cnt,TRANSFORM(rec,SELF.Str := InStr));\\n res := ITERATE(ds,TRANSFORM(rec,SELF.Str := LEFT.Str + RIGHT.Str));\\n RETURN Res[Cnt].Str;\\nEND;\\n\\nRepeatString('ha',3);\\nRepeatString('Who',2);\\n\",\n \"language\": \"ECL\"\n },\n {\n \"code\": \"String funny = \\\"ha\\\" * 5;\\nString stars = '*' * 80;\\n\",\n \"language\": \"Ecstasy\"\n },\n {\n \"code\": \"(S.concat (take 5 (repeat1 \\\"ha\\\")))\\n\",\n \"language\": \"Egison\"\n },\n {\n \"code\": \" repeat_string(a_string: STRING; times: INTEGER): STRING\\n require\\n times_positive: times > 0\\n do\\n Result := a_string.multiply(times)\\n end\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"import system'routines;\\nimport extensions;\\nimport extensions'text;\\n\\npublic program()\\n{\\n var s := new Range(0, 5).selectBy::(x => \\\"ha\\\").summarize(new StringWriter())\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"String.duplicate(\\\"ha\\\", 5)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"(apply 'concat (make-list 5 \\\"ha\\\"))\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"(make-string 5 ?x)\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"(require 'cl-lib)\\n(cl-loop repeat 5 concat \\\"ha\\\")\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"repeat(X,N) ->\\n lists:flatten(lists:duplicate(N,X)).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"PROCEDURE REPEAT_STRING(S$,N%->REP$)\\n LOCAL I%\\n REP$=\\\"\\\"\\n FOR I%=1 TO N% DO\\n REP$=REP$+S$\\n END FOR\\nEND PROCEDURE\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"sequence s = \\\"\\\"\\nfor i = 1 to 5 do s &= \\\"ha\\\" end for\\nputs(1,s)\\n\\nhahahahaha\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"sequence s = repeat('*',5)\\n\\n*****\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"include std/console.e -- for display\\ninclude std/sequence.e -- for repeat_pattern\\nsequence s = repeat_pattern(\\\"ha\\\",5)\\nsequence n = repeat_pattern({1,2,3},5)\\ndisplay(s)\\ndisplay(n)\\n\\nhahahahaha\\n{1,2,3,1,2,3,1,2,3,1,2,3,1,2,3}\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"include std/console.e -- for display\\ninclude std/sequence.e -- for flatten\\nsequence s = flatten(repeat(\\\"ha\\\",5))\\ndisplay(s)\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"{\\n \\\"ha\\\",\\n \\\"ha\\\",\\n \\\"ha\\\",\\n \\\"ha\\\",\\n \\\"ha\\\"\\n}\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"> String.replicate 5 \\\"ha\\\";;\\nval it : string = \\\"hahahahaha\\\"\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"> String.Concat( Array.create 5 \\\"ha\\\" );;\\nval it : string = \\\"hahahahaha\\\"\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \": repeat-string ( str n -- str' ) swap <repetition> concat ;\\n\\n\\\"ha\\\" 5 repeat-string print\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": place-n { src len dest n -- }\\n 0 dest c!\\n n 0 ?do src len dest +place loop ;\\n\\ns\\\" ha\\\" pad 5 place-n\\npad count type \\\\ hahahahaha\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": place-n ( src len dest n -- )\\n swap >r 0 r@ c!\\n begin dup while -rot 2dup r@ +place rot 1- repeat\\n r> 2drop 2drop ;\\n\\ns\\\" ha\\\" pad 5 place-n\\npad count type \\\\ hahahahaha\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"pad 10 char * fill \\\\ repeat a single character\\npad 10 type \\\\ **********\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"program test_repeat\\n\\n write (*, '(a)') repeat ('ha', 5)\\n\\nend program test_repeat\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"strUtils.dupeString('ha', 5)\\n\",\n \"language\": \"Free-Pascal-Lazarus\"\n },\n {\n \"code\": \"stringOfChar('*', 5)\\n\",\n \"language\": \"Free-Pascal-Lazarus\"\n },\n {\n \"code\": \"space(5)\\n\",\n \"language\": \"Free-Pascal-Lazarus\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\n' A character is essentially a string of length 1 in FB though there is a built-in function, String,\\n' which creates a string by repeating a character a given number of times.\\n\\n' To avoid repeated concatenation (a slow operation) when the string to be repeated has a length\\n' greater than one, we instead create a buffer of the required size and then fill that.\\n\\nFunction repeat(s As String, n As Integer) As String\\n If n < 1 Then Return \\\"\\\"\\n If n = 1 Then Return s\\n Var size = Len(s)\\n If size = 0 Then Return s ' empty string\\n If size = 1 Then Return String(n, s[0]) ' repeated single character\\n Var buffer = Space(size * n) 'create buffer for size > 1\\n For i As Integer = 0 To n - 1\\n For j As Integer = 0 To size - 1\\n buffer[i * size + j] = s[j]\\n Next j\\n Next i\\n Return buffer\\nEnd Function\\n\\nPrint repeat(\\\"rosetta\\\", 1)\\nPrint repeat(\\\"ha\\\", 5)\\nPrint repeat(\\\"*\\\", 5)\\nPrint\\nPrint \\\"Press any key to quit program\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"println[repeat[\\\"ha\\\", 5]]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"include \\\"NSLog.incl\\\"\\n\\nCFStringRef repeatStr\\nrepeatStr = @\\\"Hello, World!\\\\n\\\"\\nNSLog( @\\\"%@\\\", fn StringByPaddingToLength( @\\\"\\\", 50 * len(repeatStr), repeatStr, 0 ) )\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"Public Sub Main()\\n\\nPrint String$(5, \\\"ha\\\")\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"Concatenation(ListWithIdenticalEntries(10, \\\"BOB \\\"));\\n\\\"BOB BOB BOB BOB BOB BOB BOB BOB BOB BOB \\\"\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"'*' %% 5\\n\",\n \"language\": \"Glee\"\n },\n {\n \"code\": \"'ha' => Str;\\nStr# => Len;\\n1..Len %% (Len * 5) => Idx;\\nStr [Idx] $;\\n\",\n \"language\": \"Glee\"\n },\n {\n \"code\": \"'ha'=>S[1..(S#)%%(S# *5)]\\n\",\n \"language\": \"Glee\"\n },\n {\n \"code\": \"fmt.Println(strings.Repeat(\\\"ha\\\", 5)) // ==> \\\"hahahahaha\\\"\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"fmt.Println(strings.Repeat(string('h'), 5)) // prints hhhhh\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \" println 'ha' * 5\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"100 CLS : rem 100 HOME for Applesoft BASIC\\n110 S$ = \\\"rosetta\\\" : N = 1\\n120 GOSUB 210\\n130 PRINT CAD$\\n140 S$ = \\\"ha\\\" : N = 5\\n150 GOSUB 210\\n160 PRINT CAD$\\n170 S$ = \\\"*\\\" : N = 5\\n180 GOSUB 210\\n190 PRINT CAD$\\n200 END\\n210 REM FUNCTION STRINGREPEAT$(S$,N)\\n220 CAD$ = \\\"\\\"\\n230 FOR I = 1 TO N\\n240 CAD$ = CAD$+S$\\n250 NEXT I\\n260 RETURN\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \"? Replicate( \\\"Ha\\\", 5 )\\n\",\n \"language\": \"Harbour\"\n },\n {\n \"code\": \"concat $ replicate 5 \\\"ha\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"[1..5] >> \\\"ha\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"[1..5] *> \\\"ha\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"cycle \\\"ha\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"replicate 5 '*'\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"repString :: String -> Int -> String\\nrepString s n =\\n let rep x = xs\\n where\\n xs = mappend x xs\\n in take (n * length s) (rep s)\\n\\nmain :: IO ()\\nmain = print $ repString \\\"ha\\\" 5\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Tuple (swap)\\nimport Data.List (unfoldr)\\nimport Control.Monad (join)\\n\\n-- BY RHIND PAPYRUS 'EGYPTIAN' OR 'ETHIOPIAN' MULTIPLICATION ------------------\\nrepString :: Int -> String -> String\\nrepString n s =\\n foldr\\n (\\\\(d, x) a ->\\n if d > 0 -- Is this power of 2 needed for the binary recomposition ?\\n then mappend a x\\n else a)\\n mempty $\\n zip\\n (unfoldr\\n (\\\\h ->\\n if h > 0\\n then Just $ swap (quotRem h 2) -- Binary decomposition of n\\n else Nothing)\\n n)\\n (iterate (join mappend) s) -- Iterative duplication ( mappend to self )\\n\\n-- TEST -----------------------------------------------------------------------\\nmain :: IO ()\\nmain = print $ repString 500 \\\"ha\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"CHARACTER out*20\\n\\nEDIT(Text=out, Insert=\\\"ha\\\", DO=5)\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"procedure main(args)\\n write(repl(integer(!args) | 5))\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"procedure repl(s, n)\\n every (ns := \\\"\\\") ||:= |s\\\\(0 <= n)\\n return ns\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"strRepeat : Nat -> String -> String\\nstrRepeat Z s = \\\"\\\"\\nstrRepeat (S n) s = s ++ strRepeat n s\\n\\nchrRepeat : Nat -> Char -> String\\nchrRepeat Z c = \\\"\\\"\\nchrRepeat (S n) c = strCons c $ chrRepeat n c\\n\",\n \"language\": \"Idris\"\n },\n {\n \"code\": \"Home is a room.\\n\\nTo decide which indexed text is (T - indexed text) repeated (N - number) times:\\n\\tlet temp be indexed text;\\n\\trepeat with M running from 1 to N:\\n\\t\\tlet temp be \\\"[temp][T]\\\";\\n\\tdecide on temp.\\n\\nWhen play begins:\\n\\tsay \\\"ha\\\" repeated 5 times;\\n\\tend the story.\\n\",\n \"language\": \"Inform-7\"\n },\n {\n \"code\": \"(str* \\\"ha\\\" 5)\\n\",\n \"language\": \"Inform-7\"\n },\n {\n \"code\": \" 10 PRINT STRING$(\\\"ha\\\",5)\\n100 DEF STRING$(S$,N)\\n105 LET ST$=\\\"\\\"\\n110 FOR I=1 TO N\\n120 LET ST$=ST$&S$\\n130 NEXT\\n140 LET STRING$=ST$\\n150 END DEF\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \" 5 # '*' NB. repeat each item 5 times\\n*****\\n 5 # 'ha' NB. repeat each item 5 times\\nhhhhhaaaaa\\n 5 ((* #) $ ]) 'ha' NB. repeat array 5 times\\nhahahahaha\\n 5 ;@# < 'ha' NB. using boxing to treat the array as a whole\\nhahahahaha\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"\\\"ha\\\".repeat(5);\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"String[] strings = new String[5];\\nArrays.fill(strings, \\\"ha\\\");\\nStringBuilder repeated = new StringBuilder();\\nfor (String string : strings)\\n repeated.append(string);\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"String string = \\\"ha\\\";\\nStringBuilder repeated = new StringBuilder();\\nint count = 5;\\nwhile (count-- > 0)\\n repeated.append(string);\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"public static String repeat(String str, int times) {\\n StringBuilder sb = new StringBuilder(str.length() * times);\\n for (int i = 0; i < times; i++)\\n sb.append(str);\\n return sb.toString();\\n}\\n\\npublic static void main(String[] args) {\\n System.out.println(repeat(\\\"ha\\\", 5));\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"public static String repeat(String str, int times) {\\n return new String(new char[times]).replace(\\\"\\\\0\\\", str);\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"String.prototype.repeat = function(n) {\\n return new Array(1 + (n || 0)).join(this);\\n}\\n\\nconsole.log(\\\"ha\\\".repeat(5)); // hahahahaha\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"console.log(\\\"ha\\\".repeat(5)); // hahahahaha\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n 'use strict';\\n\\n // replicate :: Int -> String -> String\\n const replicate = (n, s) => {\\n let v = [s],\\n o = [];\\n if (n < 1) return o;\\n while (n > 1) {\\n if (n & 1) o = o + v;\\n n >>= 1;\\n v = v + v;\\n }\\n return o.concat(v);\\n };\\n\\n\\n return replicate(5000, \\\"ha\\\")\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n 'use strict';\\n\\n // repeat :: Int -> String -> String\\n const repeat = (n, s) =>\\n concat(replicate(n, s));\\n\\n\\n // GENERIC FUNCTIONS ------------------------------------------------------\\n\\n // concat :: [[a]] -> [a] | [String] -> String\\n const concat = xs =>\\n xs.length > 0 ? (() => {\\n const unit = typeof xs[0] === 'string' ? '' : [];\\n return unit.concat.apply(unit, xs);\\n })() : [];\\n\\n // replicate :: Int -> a -> [a]\\n const replicate = (n, x) =>\\n Array.from({\\n length: n\\n }, () => x);\\n\\n\\n // TEST -------------------------------------------------------------------\\n return repeat(5, 'ha');\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"DEFINE repeat == \\\"\\\" rotate [concat] cons times.\\n\\n\\\"ha\\\" 5 repeat.\\n\",\n \"language\": \"Joy\"\n },\n {\n \"code\": \"\\\"a \\\" * 3 # => \\\"a a a \\\"\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"@show \\\"ha\\\" ^ 5\\n\\n# The ^ operator is really just call to the `repeat` function\\n@show repeat(\\\"ha\\\", 5)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \" ,/5#,\\\"ha\\\"\\n\\\"hahahahaha\\\"\\n\\n 5#\\\"*\\\"\\n\\\"*****\\\"\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"fun main(args: Array<String>) {\\n println(\\\"ha\\\".repeat(5))\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"operator fun String.times(n: Int) = this.repeat(n)\\n\\nfun main(args: Array<String>) = println(\\\"ha\\\" * 5)\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"{S.map {lambda {_} ha} {S.serie 1 10}}\\n-> ha ha ha ha ha ha ha ha ha ha\\n\\nor\\n\\n{S.replace \\\\s\\n by\\n in {S.map {lambda {_} ha}\\n {S.serie 1 10}}}\\n-> hahahahahahahahahaha\\n\\nor\\n\\n{def repeat\\n {lambda {:w :n}\\n {if {< :n 0}\\n then\\n else :w{repeat :w {- :n 1}}}}}\\n-> repeat\\n\\n{repeat ha 10}\\n-> hahahahahahahahahahaha\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"# Repeat text function\\nfn.println(fn.repeatText(5, ha))\\n# Output: hahahahaha\\n\\n# Mul operator\\nfn.println(parser.op(ha * 5))\\n# Output: hahahahaha\\n\\n# Mul operator function\\nfn.println(fn.mul(ha, 5))\\n# Output: hahahahaha\\n\",\n \"language\": \"Lang\"\n },\n {\n \"code\": \"\\\"ha\\\" * 5\\n\",\n \"language\": \"Langur\"\n },\n {\n \"code\": \"'ha'*5 // hahahahaha\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"loop(5) => {^ 'ha' ^} // hahahahaha\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"(string:copies '\\\"ha\\\" 5)\\n\",\n \"language\": \"LFE\"\n },\n {\n \"code\": \"a$ =\\\"ha \\\"\\nprint StringRepeat$( a$, 5)\\n\\nend\\n\\nfunction StringRepeat$( in$, n)\\n o$ =\\\"\\\"\\n for i =1 to n\\n o$ =o$ +in$\\n next i\\n StringRepeat$ =o$\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"on rep (str, n)\\n res = \\\"\\\"\\n repeat with i = 1 to n\\n put str after res\\n end repeat\\n return res\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"put rep(\\\"ha\\\", 5)\\n-- \\\"hahahahaha\\\"\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"put bytearray(5, chartonum(\\\"*\\\")).readRawString(5)\\n-- \\\"*****\\\"\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"on mouseUp\\n put repeatString(\\\"ha\\\", 5)\\nend mouseUp\\n\\nfunction repeatString str n\\n repeat n times\\n put str after t\\n end repeat\\n return t\\nend repeatString\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"to copies :n :thing [:acc \\\"||]\\n if :n = 0 [output :acc]\\n output (copies :n-1 :thing combine :acc :thing)\\nend\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"show cascade 5 [combine \\\"ha ?] \\\"|| ; hahahahaha\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"to copies :n :thing :acc\\n if :n = 0 [output :acc]\\n output (copies :n-1 :thing combine :acc :thing)\\nend\\n\\nprint copies 5 \\\"ha \\\"||\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"function repeats(s, n) return n > 0 and s .. repeats(s, n-1) or \\\"\\\" end\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"string.rep(s,n)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"> use StringTools in\\n> Repeat( \\\"abc\\\", 10 ); # repeat an arbitrary string\\n> Fill( \\\"x\\\", 20 ) # repeat a character\\n> end use;\\n \\\"abcabcabcabcabcabcabcabcabcabc\\\"\\n\\n \\\"xxxxxxxxxxxxxxxxxxxx\\\"\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"> cat( \\\"abc\\\" $ 10 );\\n \\\"abcabcabcabcabcabcabcabcabcabc\\\"\\n\\n> cat( seq( \\\"abc\\\", i = 1 .. 10 ) );\\n \\\"abcabcabcabcabcabcabcabcabcabc\\\"\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"> s := \\\"\\\":\\n> to 10 do s := cat( s, \\\"abc\\\" ) end: s;\\n \\\"abcabcabcabcabcabcabcabcabcabc\\\"\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"StringRepeat[\\\"ha\\\", 5]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function S = repeat(s , n)\\n S = repmat(s , [1,n]) ;\\nreturn\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"\\\"$*\\\"(s, n) := apply(sconcat, makelist(s, n))$\\ninfix(\\\"$*\\\")$\\n\\n\\\"abc\\\" $* 5;\\n/* \\\"abcabcabcabcabc\\\" */\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \":- module repeat.\\n:- interface.\\n:- import_module string, char, int.\\n\\n:- func repeat_char(char, int) = string.\\n:- func repeat(string, int) = string.\\n\\n:- implementation.\\n:- import_module stream, stream.string_writer, string.builder.\\n\\nrepeat_char(C, N) = string.duplicate_char(C, N).\\n\\nrepeat(String, Count) = Repeated :-\\n S0 = string.builder.init,\\n Repeated = string.builder.to_string(S),\\n printn(string.builder.handle, Count, String, S0, S).\\n\\n:- pred printn(Stream, int, string, State, State)\\n <= (stream.writer(Stream, string, State),\\n stream.writer(Stream, character, State)).\\n:- mode printn(in, in, in, di, uo) is det.\\nprintn(Stream, N, String, !S) :-\\n ( N > 0 ->\\n print(Stream, String, !S),\\n printn(Stream, N - 1, String, !S)\\n ; true ).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"\\\"ha\\\" 5 repeat print\\n\",\n \"language\": \"Min\"\n },\n {\n \"code\": \"100 REM Repeat a string\\n110 LET S$ = \\\"rosetta\\\"\\n120 LET N = 1\\n130 GOSUB 210\\n140 LET S$ = \\\"ha\\\"\\n150 LET N = 5\\n160 GOSUB 210\\n170 LET S$ = \\\"*\\\"\\n180 LET N = 5\\n190 GOSUB 210\\n200 STOP\\n210 REM FUNCTION StringRepeat$(S$,N)\\n220 FOR I = 1 TO N\\n230 PRINT S$;\\n240 NEXT I\\n250 PRINT\\n260 RETURN\\n270 END\\n\",\n \"language\": \"Minimal-BASIC\"\n },\n {\n \"code\": \"str = \\\"Lol\\\"\\nprint str * 5\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"x = StringBuilder.new\\n\\n5.times do\\n x.append \\\"ha\\\"\\nend\\n\\nputs x # ==> \\\"hahahahaha\\\"\\n\",\n \"language\": \"Mirah\"\n },\n {\n \"code\": \"var s := \\\"ha \\\" * 5\\ntraceln(s)\\n\",\n \"language\": \"Monte\"\n },\n {\n \"code\": \"|ha| 5 * PRINT .\\n\",\n \"language\": \"MontiLang\"\n },\n {\n \"code\": \"FOR 5\\n |ha| OUT .\\nENDFOR || PRINT .\\n\",\n \"language\": \"MontiLang\"\n },\n {\n \"code\": \"|ha| FOR 5 OUT ENDFOR . || PRINT .\\n\",\n \"language\": \"MontiLang\"\n },\n {\n \"code\": \"RPTSTR(S,N)\\n ;Repeat a string S for N times\\n NEW I\\n FOR I=1:1:N WRITE S\\n KILL I\\n QUIT\\nRPTSTR1(S,N) ;Functionally equivalent, but denser to read\\n F I=1:1:N W S\\n Q\\n\",\n \"language\": \"MUMPS\"\n },\n {\n \"code\": \" ;Even better (more terse)\\n S x=\\\"\\\",$P(x,\\\"-\\\",10)=\\\"-\\\"\\n W x\\n\",\n \"language\": \"MUMPS\"\n },\n {\n \"code\": \"\\\"ha\\\" * 5\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"/* Repeat a string, in Neko */\\nvar srep = function(s, n) {\\n var str = \\\"\\\"\\n while n > 0 {\\n str += s\\n n -= 1\\n }\\n return str\\n}\\n\\n$print(srep(\\\"ha\\\", 5), \\\"\\\\n\\\")\\n\",\n \"language\": \"Neko\"\n },\n {\n \"code\": \"using System;\\nusing System.Console;\\n\\nmodule StrRep\\n{\\n Repeat(this s : string, n : int) : string\\n {\\n String('x', n).Replace(\\\"x\\\", s)\\n }\\n\\n Main() : void\\n {\\n WriteLine(\\\"ha\\\".Repeat(5));\\n WriteLine(\\\"*\\\".Repeat(5));\\n WriteLine(String('*', 5)); // repeating single char\\n\\n }\\n}\\n\",\n \"language\": \"Nemerle\"\n },\n {\n \"code\": \"/* NetRexx */\\n\\nha5 = 'ha'.copies(5)\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"/* NetRexx */\\nsampleStr = 'ha' -- string to duplicate\\nsay ' COPIES:' sampleStr.copies(5)\\nsay 'CHANGESTR:' '.....'.changestr('.', sampleStr)\\n\\nsampleChr = '*' -- character to duplicate\\nsay ' LEFT:' sampleChr.left(5, sampleChr)\\nsay ' RIGHT:' sampleChr.right(5, sampleChr)\\nsay ' CENTRE:' sampleChr.centre(5, sampleChr)\\nsay ' OVERLAY:' sampleChr.overlay(sampleChr, 1, 5, sampleChr)\\nsay ' SUBSTR:' ''.substr(1, 5, sampleChr)\\nsay 'TRANSLATE:' '.....'.translate(sampleChr, '.')\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"(dup \\\"ha\\\" 5)\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"import strutils\\n\\n# Repeat a char.\\necho repeat('a', 5) # -> \\\"aaaaa\\\".\\n\\n# Repeat a string.\\necho repeat(\\\"ha\\\", 5) # -> \\\"hahahahaha\\\".\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"bundle Default {\\n class Repeat {\\n function : Main(args : String[]) ~ Nil {\\n Repeat(\\\"ha\\\", 5)->PrintLine();\\n }\\n\\n function : Repeat(string : String, max : Int) ~ String {\\n repeat : String := String->New();\\n for(i := 0; i < max; i += 1;) {\\n repeat->Append(string);\\n };\\n\\n return repeat;\\n }\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"@interface NSString (RosettaCodeAddition)\\n- (NSString *) repeatStringByNumberOfTimes: (NSUInteger) times;\\n@end\\n\\n@implementation NSString (RosettaCodeAddition)\\n- (NSString *) repeatStringByNumberOfTimes: (NSUInteger) times {\\n return [@\\\"\\\" stringByPaddingToLength:[self length]*times withString:self startingAtIndex:0];\\n}\\n@end\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \" // Instantiate an NSString by sending an NSString literal our new\\n // -repeatByNumberOfTimes: selector.\\n NSString *aString = [@\\\"ha\\\" repeatStringByNumberOfTimes:5];\\n\\n // Display the NSString.\\n NSLog(@\\\"%@\\\", aString);\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"let string_repeat s n =\\n let s = Bytes.of_string s in\\n let len = Bytes.length s in\\n let res = Bytes.create (n * len) in\\n for i = 0 to pred n do\\n Bytes.blit s 0 res (i * len) len\\n done;\\n (Bytes.to_string res)\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"val string_repeat : string -> int -> string = <fun>\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"# string_repeat \\\"Hiuoa\\\" 3 ;;\\n- : string = \\\"HiuoaHiuoaHiuoa\\\"\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let string_repeat s n =\\n String.concat \\\"\\\" (Array.to_list (Array.make n s))\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let string_repeat s n =\\n Array.fold_left (^) \\\"\\\" (Array.make n s)\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"String.make 5 '*'\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"StringBuffer new \\\"abcd\\\" <<n(5)\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"MESSAGE FILL( \\\"ha\\\", 5 ) VIEW-AS ALERT-BOX.\\n\",\n \"language\": \"OpenEdge-Progress\"\n },\n {\n \"code\": \"'REPEATING A CHARACTER\\n\\nprint string 10,\\\"A\\\" 'result AAAAAAAAAA\\n\\n'REPEATING A STRING\\n\\nfunction RepeatString(string s,sys n) as string\\n sys i, le=len s\\n if le=0 then exit function\\n n*=le\\n function=nuls n\\n '\\n for i=1 to n step le\\n mid function,i,s\\n next\\nend function\\n\\nprint RepeatString \\\"ABC\\\",3 'result ABCABCABC\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"declare\\n fun {Repeat Xs N}\\n if N > 0 then\\n {Append Xs {Repeat Xs N-1}}\\n else\\n nil\\n end\\n end\\nin\\n {System.showInfo {Repeat \\\"Ha\\\" 5}}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"repeat(s,n)={\\n if(n, Str(repeat(s, n-1), s), \\\"\\\")\\n};\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"repeat(s,n)=concat(vector(n,i, s));\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"repeat(s,n)={\\n if(n<4, return(concat(vector(n,i, s))));\\n if(n%2,\\n Str(repeat(Str(s,s),n\\\\2),s)\\n ,\\n repeat(Str(s,s),n\\\\2)\\n );\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"\\\\\\\\ Repeat a string str the specified number of times ntimes and return composed string.\\n\\\\\\\\ 3/3/2016 aev\\nsrepeat(str,ntimes)={\\nmy(srez=str,nt=ntimes-1);\\nif(ntimes<1||#str==0,return(\\\"\\\"));\\nif(ntimes==1,return(str));\\nfor(i=1,nt, srez=concat(srez,str));\\nreturn(srez);\\n}\\n\\n{\\n\\\\\\\\ TESTS\\nprint(\\\" *** Testing srepeat:\\\");\\nprint(\\\"1.\\\",srepeat(\\\"a\\\",5));\\nprint(\\\"2.\\\",srepeat(\\\"ab\\\",5));\\nprint(\\\"3.\\\",srepeat(\\\"c\\\",1));\\nprint(\\\"4.|\\\",srepeat(\\\"d\\\",0),\\\"|\\\");\\nprint(\\\"5.|\\\",srepeat(\\\"\\\",5),\\\"|\\\");\\nprint1(\\\"6.\\\"); for(i=1,10000000, srepeat(\\\"e\\\",10));\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"\\\"ha\\\" x 5\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">'*'</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"ha\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"def rep /# s n -- s #/\\n \\\"\\\" swap\\n for drop\\n\\tover chain\\n endfor\\n nip\\nenddef\\n\\n\\\"ha\\\" 5 rep print\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"65 5 rep\\n65 5 repeat\\n'A' 5 repeat\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"str_repeat(\\\"ha\\\", 5)\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(pack (need 5 \\\"ha\\\"))\\n-> \\\"hahahahaha\\\"\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"(pack (make (do 5 (link \\\"ha\\\"))))\\n-> \\\"hahahahaha\\\"\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"\\\"ha\\\"*5;\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"/* To repeat a string a variable number of times: */\\n\\ns = repeat('ha', 4);\\n\\n /* or */\\n\\ns = copy('ha', 5);\\n\\n/* To repeat a single character a fixed number of times: */\\n\\ns = (5)'h'; /* asigns 'hhhhh' to s. */\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"To run:\\nStart up.\\nPut \\\"ha\\\" into a string.\\nAppend the string to itself given 5.\\nWrite the string on the console.\\nFill another string with the asterisk byte given 5.\\nWrite the other string on the console.\\nWait for the escape key.\\nShut down.\\n\\nTo append a string to itself given a number:\\nIf the number is less than 1, exit.\\nPrivatize the string.\\nPrivatize the number.\\nSubtract 1 from the number.\\nAppend the string to the original string given the number.\\n\",\n \"language\": \"Plain-English\"\n },\n {\n \"code\": \"% the comments show the stack content after the line was executed\\n% where rcount is the repeat count, \\\"o\\\" is for orignal,\\n% \\\"f\\\" is for final, and iter is the for loop variable\\n%\\n% usage: rcount ostring times -> fstring\\n\\n/times {\\n dup length dup % rcount ostring olength olength\\n 4 3 roll % ostring olength olength rcount\\n mul dup string % ostring olength flength fstring\\n 4 1 roll % fstring ostring olength flength\\n 1 sub 0 3 1 roll % fstring ostring 0 olength flength_minus_one\\n { % fstring ostring iter\\n 1 index 3 index % fstring ostring iter ostring fstring\\n 3 1 roll % fstring ostring fstring iter ostring\\n putinterval % fstring ostring\\n } for\\n pop % fstring\\n} def\\n\",\n \"language\": \"PostScript\"\n },\n {\n \"code\": \"MSGBOX REPEAT$(5, \\\"ha\\\")\\n\",\n \"language\": \"PowerBASIC\"\n },\n {\n \"code\": \"\\\"ha\\\" * 5 # ==> \\\"hahahahaha\\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"void setup() {\\n String rep = repeat(\\\"ha\\\", 5);\\n println(rep);\\n}\\nString repeat(String str, int times) {\\n // make an array of n chars,\\n // replace each char with str,\\n // and return as a new String\\n return new String(new char[times]).replace(\\\"\\\\0\\\", str);\\n}\\n\",\n \"language\": \"Processing\"\n },\n {\n \"code\": \"def setup():\\n rep = repeat(\\\"ha\\\", 5)\\n println(rep)\\n\\ndef repeat(s, times):\\n return s * times\\n\",\n \"language\": \"Processing-Python-mode\"\n },\n {\n \"code\": \"%repeat(Str,Num,Res).\\nrepeat(Str,1,Str).\\nrepeat(Str,Num,Res):-\\n Num1 is Num-1,\\n repeat(Str,Num1,Res1),\\n string_concat(Str, Res1, Res).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \":- system:set_prolog_flag(double_quotes,chars) .\\n\\nrepeat(SOURCEz0,COUNT0,TARGETz)\\n:-\\nprolog:phrase(repeat(SOURCEz0,COUNT0),TARGETz)\\n.\\n\\n%! repeat(SOURCEz0,COUNT0)//2\\n\\nrepeat(_SOURCEz0_,0)\\n-->\\n! ,\\n[]\\n.\\n\\nrepeat(SOURCEz0,COUNT0)\\n-->\\nSOURCEz0 ,\\n{ COUNT is COUNT0 - 1 } ,\\nrepeat(SOURCEz0,COUNT)\\n.\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"> str_repeat 0 s = \\\"\\\";\\n> str_repeat n s = s + (str_repeat (n-1) s) if n>0;\\n> str_repeat 5 \\\"ha\\\";\\n\\\"hahahahaha\\\"\\n>\\n\",\n \"language\": \"Pure\"\n },\n {\n \"code\": \"str_repeat n::int s::string = string $ take n $ cycle (s:[]);\\n\",\n \"language\": \"Pure\"\n },\n {\n \"code\": \"Procedure.s RepeatString(count, text$=\\\" \\\")\\n Protected i, ret$=\\\"\\\"\\n\\n For i = 1 To count\\n ret$ + text$\\n Next\\n ProcedureReturn ret$\\nEndProcedure\\n\\nDebug RepeatString(5, \\\"ha\\\")\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"\\\"ha\\\" * 5 # ==> \\\"hahahahaha\\\"\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"5 * \\\"ha\\\" # ==> \\\"hahahahaha\\\"\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def repeat(s, times):\\n return s * times\\n\\nprint(repeat(\\\"ha\\\", 5))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"x = lambda a: a * 5\\nprint(x(\\\"ha\\\"))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"FUNCTION StringRepeat$ (s$, n)\\n cad$ = \\\"\\\"\\n FOR i = 1 TO n\\n cad$ = cad$ + s$\\n NEXT i\\n StringRepeat$ = cad$\\nEND FUNCTION\\n\\nPRINT StringRepeat$(\\\"rosetta\\\", 1)\\nPRINT StringRepeat$(\\\"ha\\\", 5)\\nPRINT StringRepeat$(\\\"*\\\", 5)\\nEND\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \"$ \\\"ha\\\" 5 of echo$\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"100 CLS\\n110 LET S$ = \\\"rosetta\\\"\\n115 LET N = 1\\n120 GOSUB 210\\n130 PRINT C$\\n140 LET S$ = \\\"ha\\\"\\n145 LET N = 5\\n150 GOSUB 210\\n160 PRINT C$\\n170 LET S$ = \\\"*\\\"\\n175 LET N = 5\\n180 GOSUB 210\\n190 PRINT C$\\n200 END\\n210 REM FUNCTION STRINGREPEAT$(S$,N)\\n220 LET C$ = \\\"\\\"\\n230 FOR I = 1 TO N\\n240 LET C$ = C$ + S$\\n250 NEXT I\\n260 RETURN\\n\",\n \"language\": \"Quite-BASIC\"\n },\n {\n \"code\": \"strrep(\\\"ha\\\", 5)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n;; fast\\n(define (string-repeat n str)\\n (string-append* (make-list n str)))\\n(string-repeat 5 \\\"ha\\\") ; => \\\"hahahahaha\\\"\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(make-string 5 #\\\\*) => \\\"*****\\\"\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"print \\\"ha\\\" x 5\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"'For a single char\\nshowmessage String$(10, \\\"-\\\")\\n\\n'For strings with more than one char\\nfunction Repeat$(Expr as string, Count as integer) as string\\n dim x as integer\\n for x = 1 to Count\\n Result = Result + Expr\\n next\\nend function\\n\\nshowmessage Repeat$(\\\"ha\\\", 5)\\n\",\n \"language\": \"RapidQ\"\n },\n {\n \"code\": \"Function Repeat(s As String, count As Integer) As String\\n Dim output As String\\n For i As Integer = 0 To count\\n output = output + s\\n Next\\n Return output\\nEnd Function\\n\",\n \"language\": \"REALbasic\"\n },\n {\n \"code\": \"head insert/dup \\\"\\\" \\\"ha\\\" 5\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \">> str: \\\"Add duplicates to string\\\"\\n>> insert/dup str \\\"ha\\\" 3\\n== \\\"hahahaAdd duplicates to string\\\"\\n>> insert/dup tail str \\\"ha\\\" 3\\n== \\\"hahahaAdd duplicates to stringhahaha\\\"\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"Js.log(Js.String2.repeat(\\\"ha\\\", 5))\\n\",\n \"language\": \"ReScript\"\n },\n {\n \"code\": \"with strings'\\n: repeatString ( $n-$ )\\n 1- [ dup ] dip [ over prepend ] times nip ;\\n\\n\\\"ha\\\" 5 repeatString\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"/*REXX program to show various ways to repeat a string (or repeat a single char).*/\\n\\n/*all examples are equivalent, but not created equal.*/\\n\\n /*───────────────────────────────────────────*/\\ny='ha'\\nz=copies(y,5)\\n /*───────────────────────────────────────────*/\\nz=copies( 'ha', 5 )\\n /*───────────────────────────────────────────*/\\ny='ha'\\nz=y||y||y||y||y\\n /*───────────────────────────────────────────*/\\ny='ha'\\nz=y || y || y || y || y /*same as previous, but the \\\"big sky\\\" version*/\\n /*───────────────────────────────────────────*/\\ny='ha'\\nz=''\\n do 5\\n z=z||y\\n end\\n /*───────────────────────────────────────────*/\\ny=\\\"ha\\\"\\nz=\\n do 5\\n z=z||y\\n end\\n /*───────────────────────────────────────────*/\\ny=\\\"ha\\\"\\nz=\\n do i=101 to 105\\n z=z||y\\n end\\n\\n /*───────────────────────────────────────────*/\\ny='+'\\nz=left('',5,y)\\n /*───────────────────────────────────────────*/\\ny='+'\\nz=right('',5,y)\\n /*───────────────────────────────────────────*/\\ny='+'\\nz=substr('',1,5,y)\\n /*───────────────────────────────────────────*/\\ny='+'\\nz=center('',5,y)\\n /*───────────────────────────────────────────*/\\ny='+'\\nz=centre('',5,y)\\n /*───────────────────────────────────────────*/\\ny='+'\\nz=space('',5,y)\\n /*───────────────────────────────────────────*/\\ny='+'\\nz=translate('@@@@@',y,\\\"@\\\")\\n /*───────────────────────────────────────────*/\\ny='abcdef'\\nz=five(y)\\nexit\\n\\nfive: procedure expose y; parse arg g\\nif length(g)>=5*length(y) then return g\\nreturn five(y||g)\\n /*───────────────────────────────────────────*/\\ny='something wicked this way comes.'\\nz=y||y||y||y||y||y||y||y||y||y||y||y|\\\\y||y||y\\nz=left(z,5*length(y))\\n /*───────────────────────────────────────────*/\\ny='+'\\nz=copies('',5,y)\\n /*───────────────────────────────────────────*/\\ny='+'\\nz=lower('',1,5,y)\\n /*───────────────────────────────────────────*/\\ny='+'\\nz=lower('',,5,y)\\n /*───────────────────────────────────────────*/\\nz='+'\\nz=upper('',1,5,y)\\n /*───────────────────────────────────────────*/\\nz=upper('',,5,y)\\n /*───────────────────────────────────────────*/\\n\\ny='charter bus.'\\nz='*****'\\nz=changestr('*',z,y)\\n /*───────────────────────────────────────────*/\\ny='what the hey!'\\nz=\\n do until length(z)==5*length(y)\\n z=z||y\\n end\\n /*───────────────────────────────────────────*/\\ny='what the hey!'\\nz=\\n do until length(z)==5*length(y)\\n z=insert(z,0,y)\\n end\\n /*───────────────────────────────────────────*/\\ny='yippie ki yay'\\nz=\\n do i=1 by 5 for 5\\n z=overlay(y,z,i)\\n end\\n /*───────────────────────────────────────────*/\\ny='+'\\nz=justify('',5,y)\\n /*───────────────────────────────────────────*/\\nwhatever_this_variable_is_____it_aint_referenced_directly= 'boy oh boy.'\\nz=; signal me; me:\\n do 5\\n z=z||strip(subword(sourceline(sigl-1),2),,\\\"'\\\")\\n end\\n /*───────────────────────────────────────────*/\\ny=\\\"any more examples & the angry townfolk with pitchforks will burn the castle.\\\"\\nparse value y||y||y||y||y with z\\n\\nexit /*stick a fork in it, we're done.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \" Copy(\\\"ha\\\" , 5) # ==> \\\"hahahahaha\\\"\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"\\\"ha\\\" * 5 # ==> \\\"hahahahaha\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"a$ = \\\"ha \\\"\\nfor i = 1 to 5\\n a1$ = a1$ + a$\\nnext i\\na$ = a1$\\nprint a$\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"std::iter::repeat(\\\"ha\\\").take(5).collect::<String>(); // ==> \\\"hahahahaha\\\"\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"\\\"ha\\\".repeat(5); // ==> \\\"hahahahaha\\\"\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"\\\"ha\\\" * 5 // ==> \\\"hahahahaha\\\"\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (string-repeat n str)\\n (apply string-append (vector->list (make-vector n str))))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"(define (string-repeat n str)\\n\\t(fold string-append \\\"\\\" (make-list n str)))\\n(string-repeat 5 \\\"ha\\\") ==> \\\"hahahahaha\\\"\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"(make-string 5 #\\\\*)\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ echo ha | sed 's/.*/&&&&&/'\\nhahahahaha\\n\",\n \"language\": \"Sed\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst proc: main is func\\n begin\\n writeln(\\\"ha\\\" mult 5);\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"put \\\"Ho!\\\" repeated 3 times\\n\\nput \\\"Merry\\\" repeated to length 12\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"'ha' * 5; # ==> 'hahahahaha'\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \" 10 LET S$=\\\"HA\\\"\\n 20 LET N=5\\n 30 GOSUB 60\\n 40 PRINT T$\\n 50 STOP\\n 60 LET T$=\\\"\\\"\\n 70 FOR I=1 TO N\\n 80 LET T$=T$+S$\\n 90 NEXT I\\n100 RETURN\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"v := 'ha'.\\nv,v,v,v,v\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"((1 to: n) collect: [:x | 'ha']) joinUsing: ''.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"(Array new:n withAll:'ha') asStringWith:''.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"ws := '' writeStream.\\nn timesRepeat: [ws nextPutAll: 'ha'].\\nws contents.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"(String streamContents:[:ws | n timesRepeat: [ws nextPutAll: 'ha']])\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"String new:n withAll:$*\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"(String new:n) atAllPut:$*\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"\\toutput = dupl(\\\"ha\\\",5)\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"spn:3> repeat(\\\"na\\\", 8) .. \\\" Batman!\\\"\\n= nananananananana Batman!\\n\",\n \"language\": \"Sparkling\"\n },\n {\n \"code\": \"select rpad('', 10, 'ha')\\n\",\n \"language\": \"SQL\"\n },\n {\n \"code\": \"VALUES REPEAT('ha', 5);\\nVALUES RPAD('', 10, 'ha');\\n\",\n \"language\": \"SQL-PL\"\n },\n {\n \"code\": \"fun string_repeat (s, n) =\\n concat (List.tabulate (n, fn _ => s))\\n;\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"- string_repeat (\\\"Hiuoa\\\", 3) ;\\nval it = \\\"HiuoaHiuoaHiuoa\\\" : string\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"fun char_repeat (c, n) =\\n implode (List.tabulate (n, fn _ => c))\\n;\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \". scalar a=\\\"ha\\\"\\n. scalar b=a*5\\n. display b\\nhahahahaha\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"'ha'.Repeat(5) --> \\\"hahahahaha\\\"\\n'*'.Repeat(5) --> \\\"*****\\\"\\n\",\n \"language\": \"Suneido\"\n },\n {\n \"code\": \"print(String(repeating:\\\"*\\\", count: 5))\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"func * (left:String, right:Int) -> String {\\n return String(repeating:left, count:right)\\n}\\n\\nprint (\\\"HA\\\" * 5)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"extension String {\\n // Slower version\\n func repeatString(n: Int) -> String {\\n return Array(count: n, repeatedValue: self).joinWithSeparator(\\\"\\\")\\n }\\n\\n // Faster version\\n // benchmarked with a 1000 characters and 100 repeats the fast version is approx 500 000 times faster :-)\\n func repeatString2(n:Int) -> String {\\n var result = self\\n for _ in 1 ..< n {\\n result.appendContentsOf(self) // Note that String.appendContentsOf is up to 10 times faster than \\\"result += self\\\"\\n }\\n return result\\n }\\n}\\n\\nprint( \\\"ha\\\".repeatString(5) )\\nprint( \\\"he\\\".repeatString2(5) )\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"String(count:5, repeatedValue:\\\"*\\\" as Character)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"extension String {\\n func repeatBiterative(count: Int) -> String {\\n var reduceCount = count\\n var result = \\\"\\\"\\n var doubled = self\\n while reduceCount != 0 {\\n if reduceCount & 1 == 1 {\\n result.appendContentsOf(doubled)\\n }\\n reduceCount >>= 1\\n if reduceCount != 0 {\\n doubled.appendContentsOf(doubled)\\n }\\n }\\n return result\\n }\\n}\\n\\n\\\"He\\\".repeatBiterative(5)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"'$:1..5 -> 'ha';' -> !OUT::write\\n\",\n \"language\": \"Tailspin\"\n },\n {\n \"code\": \"string repeat \\\"ha\\\" 5 ;# => hahahahaha\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"function strRep(%str,%int)\\n{\\n\\tfor(%i = 0; %i < %int; %i++)\\n\\t{\\n\\t\\t%rstr = %rstr@%str;\\n\\t}\\n\\n\\treturn %rstr;\\n}\\n\",\n \"language\": \"TorqueScript\"\n },\n {\n \"code\": \"when flag clicked\\nset String to \\\"meow\\\"\\nset Count to 4\\nset Repeated to \\\"\\\"\\nrepeat Count\\n\\tset Repeated to (join (Repeated) (String))\\nend\\nstop this script\\n\",\n \"language\": \"Tosh\"\n },\n {\n \"code\": \"select REPLICATE( 'ha', 5 )\\n\",\n \"language\": \"Transact-SQL\"\n },\n {\n \"code\": \"FUNCTION StringRepeat$ (s$, n)\\n LET cad$ = \\\"\\\"\\n FOR i = 1 TO n\\n LET cad$ = cad$ & s$\\n NEXT i\\n LET StringRepeat$ = cad$\\nEND FUNCTION\\n\\nPRINT StringRepeat$(\\\"rosetta\\\", 1)\\nPRINT StringRepeat$(\\\"ha\\\", 5)\\nPRINT StringRepeat$(\\\"*\\\", 5)\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nrepeatstring=REPEAT (\\\"ha\\\",5)\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"printf \\\"ha\\\"%.0s {1..5}\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"i=5\\nprintf \\\"ha\\\"%.0s {1..$i}\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"i=5\\neval \\\"printf 'ha'%.0s {1..$i}\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"reprint() {\\n typeset e=\\\"$(sed -e 's,%,%%,g' -e 's,\\\\\\\\,\\\\\\\\\\\\\\\\,g' <<<\\\"$1\\\")\\\"\\n eval 'printf \\\"$e\\\"%.0s '\\\"{1..$2}\\\"\\n}\\nreprint '% ha \\\\' 5\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"len=12; str='='\\nrepeat $len printf \\\"$str\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"width=72; char='='\\nhead -c ${width} < /dev/zero | tr '\\\\0' \\\"$char\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#import nat\\n\\nrepeat = ^|DlSL/~& iota\\n\\n#cast %s\\n\\nexample = repeat('ha',5)\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"// Repeat a string, in V\\n// Tectonics: v run repeat-a-string.v\\nmodule main\\nimport strings\\n\\n// starts here\\npub fn main() {\\n // A strings module function to repeat strings\\n println(strings.repeat_string(\\\"ha\\\", 5))\\n\\n // Another strings module function to repeat a byte\\n // This indexes the string to get the first byte of the rune array\\n println(strings.repeat(\\\"*\\\"[0], 5))\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"string s = \\\"ha\\\";\\nstring copy = \\\"\\\";\\nfor (int x = 0; x < 5; x++)\\n\\tcopy += s;\\n\",\n \"language\": \"Vala\"\n },\n {\n \"code\": \"string s = string.nfill(5, 'c');\\n\",\n \"language\": \"Vala\"\n },\n {\n \"code\": \"Public Function RepeatStr(aString As String, aNumber As Integer) As String\\n\\tDim bString As String, i As Integer\\n\\tbString = \\\"\\\"\\n\\tFor i = 1 To aNumber\\n\\t\\tbString = bString & aString\\n\\tNext i\\n\\tRepeatStr = bString\\nEnd Function\\n\\nDebug.Print RepeatStr(\\\"ha\\\", 5)\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Public Function RepeatString(stText As String, iQty As Integer) As String\\n RepeatString = Replace(String(iQty, \\\"x\\\"), \\\"x\\\", stText)\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Debug.Print String(5, \\\"x\\\")\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"replace(string(5,\\\"@\\\"),\\\"@\\\",\\\"hello\\\")\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"Ins_Text(\\\"ha\\\", COUNT, 5)\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"Public Function StrRepeat(s As String, n As Integer) As String\\n\\tDim r As String, i As Integer\\n\\tr = \\\"\\\"\\n\\tFor i = 1 To n\\n\\t\\tr = r & s\\n\\tNext i\\n\\tStrRepeat = r\\nEnd Function\\n\\nDebug.Print StrRepeat(\\\"ha\\\", 5)\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"Public Function StrRepeat(sText As String, n As Integer) As String\\n\\tStrRepeat = Replace(String(n, \\\"*\\\"), \\\"*\\\", sText)\\nEnd Function\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"Debug.Print String(5, \\\"x\\\")\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"Debug.Print(Replace(Space(5), \\\" \\\", \\\"Ha\\\"))\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"Debug.Print(StrDup(5, \\\"x\\\"))\\nDebug.Print(\\\"\\\".PadRight(5, \\\"x\\\"))\\nDebug.Print(\\\"\\\".PadLeft(5, \\\"x\\\"))\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"? REPLICATE(\\\"HO\\\", 3)\\n\",\n \"language\": \"Visual-FoxPro\"\n },\n {\n \"code\": \"def (s * n) :case (string? s)\\n with outstring\\n repeat n\\n pr s\\n\\n(\\\"ha\\\" * 5)\\n=> \\\"hahahahaha\\\"\\n\",\n \"language\": \"Wart\"\n },\n {\n \"code\": \"@join \\\"\\\" @rep 5 \\\"ha\\\" ; returns \\\"hahahahaha\\\"\\n\",\n \"language\": \"Wortel\"\n },\n {\n \"code\": \"^(\\\\@join \\\"\\\" @rep)\\n\",\n \"language\": \"Wortel\"\n },\n {\n \"code\": \"System.print(\\\"ha\\\" * 5)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"PROGRAM\\t\\\"Repeat a string\\\"\\nVERSION\\t\\\"0.0000\\\"\\n\\nDECLARE FUNCTION Entry ()\\nDECLARE FUNCTION StringRepeat$ (s$, n)\\n\\nFUNCTION Entry ()\\n\\nPRINT StringRepeat$ (\\\"rosetta\\\", 1)\\nPRINT StringRepeat$ (\\\"ha\\\", 5)\\nPRINT StringRepeat$ (\\\"*\\\", 5)\\n\\nEND FUNCTION\\nFUNCTION StringRepeat$ (s$, n)\\n cad$ = \\\"\\\"\\n FOR i = 1 TO n\\n cad$ = cad$ + s$\\n NEXT i\\n RETURN cad$\\nEND FUNCTION\\nEND PROGRAM\\n\",\n \"language\": \"XBasic\"\n },\n {\n \"code\": \"cod T=12; int I; for I gets 1,5 do T(0,\\\"ha\\\")\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"sub StringRepeat$ (s$, n)\\n cad$ = \\\"\\\"\\n for i = 1 to n\\n cad$ = cad$ + s$\\n next i\\n return cad$\\nend sub\\n\\nprint StringRepeat$(\\\"rosetta\\\", 1)\\nprint StringRepeat$(\\\"ha\\\", 5)\\nprint StringRepeat$(\\\"*\\\", 5)\\nend\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"array(\\\"ha\\\", 5)(sum)\\n\",\n \"language\": \"Yorick\"\n },\n {\n \"code\": \"PrintChar equ &BB5A ;Amstrad CPC BIOS call, prints the ascii code in the accumulator to the screen.\\n\\norg &8000\\nld b,5 ; repeat 5 times\\n\\nloop:\\ncall PrintImmediate\\nbyte \\\"ha\\\",0\\ndjnz loop\\n\\nret ; return to basic\\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\nPrintImmediate:\\npop hl ; get the return address into HL, it's the start of the embedded string.\\ncall PrintString\\n; inc hl ; if your strings are null-terminated you can omit this, since a 0 equals the \\\"NOP\\\" instruction\\njp (hl) ; acts as a ret, returning execution to the instruction just after the embedded string.\\n\\nPrintString:\\nld a,(hl) ; read in a character from the string\\nor a ; if your strings are null-terminated you can use this as a shortcut, otherwise use the compare instruction\\nret z ; exit once the terminator is reached.\\ncall PrintChar ; BIOS call, all regs are preserved.\\ninc hl ; next char\\njr PrintString ; back to start.\\n\",\n \"language\": \"Z80-Assembly\"\n },\n {\n \"code\": \"const laugh = \\\"ha\\\" ** 5;\\n\",\n \"language\": \"Zig\"\n },\n {\n \"code\": \"const std = @import(\\\"std\\\");\\nconst warn = std.debug.warn;\\n\\nconst Allocator = std.mem.Allocator;\\n\\nfn repeat(s: []const u8, times: u16, allocator: *Allocator) ![]u8 {\\n const repeated = try allocator.alloc(u8, s.len*times);\\n\\n var i: usize = 0;\\n while (i < s.len*times) : (i += 1) {\\n repeated[i] = s[i % 2];\\n }\\n\\n return repeated;\\n}\\n\\npub fn main() !void {\\n const allocator = std.debug.global_allocator;\\n const ex = try repeat(\\\"ha\\\", 5, allocator);\\n defer allocator.free(ex);\\n}\\n\",\n \"language\": \"Zig\"\n },\n {\n \"code\": \"\\\"ha\\\" * 5 # --> \\\"hahahahaha\\\"\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Repeat-a-string"}}},{"rowIdx":1580,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Electronics\nfrom: http://rosettacode.org/wiki/Resistor_mesh\n","language":"00-META"},{"code":"[[image:resistor-mesh.svg|300px||right]]\n\n;Task:\nGiven <big> 10×10 </big> grid nodes (as shown in the image) interconnected by <big> 1Ω </big> resistors as shown,\n<br>find the resistance between points '''A''' and '''B'''.\n\n\n;See also:\n* (humor, nerd sniping) [http://xkcd.com/356/ xkcd.com cartoon] (you can solve that for extra credits)\n* [https://www.paulinternet.nl/?page=resistors An article on how to calculate this and an implementation in Mathematica]\n<br><br>\n\n\n","language":"00-TASK"},{"code":"-V DIFF_THRESHOLD = 1e-40\n\nT.enum Fixed\n FREE\n A\n B\n\nT Node\n Float voltage\n Fixed fixed\n F (v = 0.0, f = Fixed.FREE)\n .voltage = v\n .fixed = f\n\nF set_boundary(&m)\n m[1][1] = Node( 1.0, Fixed.A)\n m[6][7] = Node(-1.0, Fixed.B)\n\nF calc_difference(m, &d)\n V h = m.len\n V w = m[0].len\n V total = 0.0\n\n L(i) 0 .< h\n L(j) 0 .< w\n V v = 0.0\n V n = 0\n I i != 0 {v += m[i - 1][j].voltage; n++}\n I j != 0 {v += m[i][j - 1].voltage; n++}\n I i < h-1 {v += m[i + 1][j].voltage; n++}\n I j < w-1 {v += m[i][j + 1].voltage; n++}\n v = m[i][j].voltage - v / n\n d[i][j].voltage = v\n I m[i][j].fixed == FREE\n total += v ^ 2\n R total\n\nF iter(&m)\n V h = m.len\n V w = m[0].len\n V difference = [[Node()] * w] * h\n\n L\n set_boundary(&m)\n I calc_difference(m, &difference) < :DIFF_THRESHOLD\n L.break\n L(di) difference\n V i = L.index\n L(dij) di\n V j = L.index\n m[i][j].voltage -= dij.voltage\n\n V cur = [0.0] * 3\n L(di) difference\n V i = L.index\n L(dij) di\n V j = L.index\n cur[Int(m[i][j].fixed)] += (dij.voltage *\n (Int(i != 0) + Int(j != 0) + (i < h - 1) + (j < w - 1)))\n\n R (cur[Int(Fixed.A)] - cur[Int(Fixed.B)]) / 2.0\n\nV w = 10\nV h = 10\nV mesh = [[Node()] * w] * h\nprint(‘R = #.16’.format(2 / iter(&mesh)))\n","language":"11l"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\nprocedure ResistMesh is\n H, W : constant Positive := 10;\n rowA, colA : constant Positive := 2; -- row/col indexed from 1\n rowB : constant Positive := 7;\n colB : constant Positive := 8;\n\n type Ntype is (A, B, Free);\n type Vtype is digits 15;\n type Node is record\n volt : Vtype := 0.0;\n name : Ntype := Free;\n end record;\n type NodeMesh is array (Positive range <>, Positive range <>) of Node;\n package IIO is new Ada.Text_IO.Float_IO (Vtype);\n mesh, dmesh : NodeMesh (1 .. H, 1 .. W);\n curA, curB, diff : Vtype;\n\n procedure set_AB (mesh : in out NodeMesh) is begin\n mesh (rowA, colA).volt := 1.0; mesh (rowA, colA).name := A;\n mesh (rowB, colB).volt := -1.0; mesh (rowB, colB).name := B;\n end set_AB;\n\n function sides (i : Positive; j : Positive) return Vtype is\n s : Integer := 0;\n begin\n if i /= 1 and i /= H then s := s + 2; else s := s + 1; end if;\n if j /= 1 and j /= W then s := s + 2; else s := s + 1; end if;\n return Vtype (s);\n end sides;\n\n procedure calc_diff (mesh : NodeMesh; dmesh : out NodeMesh;\n total : out Vtype) is\n n : Natural;\n v : Vtype := 0.0;\n begin\n total := 0.0;\n for i in Positive range 1 .. H loop\n for j in Positive range 1 .. W loop\n n := 0; v := 0.0;\n if i /= 1 then v := v + mesh (i - 1, j).volt; n := n + 1; end if;\n if j /= 1 then v := v + mesh (i, j - 1).volt; n := n + 1; end if;\n if i < H then v := v + mesh (i + 1, j).volt; n := n + 1; end if;\n if j < W then v := v + mesh (i, j + 1).volt; n := n + 1; end if;\n v := mesh (i, j).volt - v / Vtype (n);\n dmesh (i, j).volt := v;\n if mesh (i, j).name = Free then total := total + v ** 2; end if;\n end loop;\n end loop;\n end calc_diff;\n\nbegin\n\n loop\n set_AB (mesh);\n calc_diff (mesh, dmesh, diff);\n exit when diff < 1.0e-40;\n for i in Positive range 1 .. H loop\n for j in Positive range 1 .. W loop\n mesh (i, j).volt := mesh (i, j).volt - dmesh (i, j).volt;\n end loop;\n end loop;\n end loop;\n\n curA := dmesh (rowA, colA).volt * sides (rowA, colA);\n curB := dmesh (rowB, colB).volt * sides (rowB, colB);\n diff := 4.0 / (curA - curB);\n IIO.Put (diff, Exp => 0); New_Line;\nend ResistMesh;\n","language":"Ada"},{"code":" INSTALL @lib$+\"ARRAYLIB\"\n *FLOAT 64\n @% = &F0F\n\n PRINT \"Resistance = \"; FNresistormesh(10, 10, 1, 1, 7, 6) \" ohms\"\n END\n\n DEF FNresistormesh(ni%, nj%, ai%, aj%, bi%, bj%)\n LOCAL c%, i%, j%, k%, n%, A(), B()\n n% = ni% * nj%\n DIM A(n%-1, n%-1), B(n%-1, 0)\n FOR i% = 0 TO ni%-1\n FOR j% = 0 TO nj%-1\n k% = i% * nj% + j%\n IF i% = ai% AND j% = aj% THEN\n A(k%, k%) = 1\n ELSE\n c% = 0\n IF (i% + 1) < ni% c% += 1 : A(k%, k% + nj%) = -1\n IF i% > 0 c% += 1 : A(k%, k% - nj%) = -1\n IF (j% + 1) < nj% c% += 1 : A(k%, k% + 1) = -1\n IF j% > 0 c% += 1 : A(k%, k% - 1) = -1\n A(k%, k%) = c%\n ENDIF\n NEXT\n NEXT\n k% = bi% * nj% + bj%\n B(k%, 0) = 1\n PROC_invert(A())\n B() = A().B()\n = B(k%, 0)\n","language":"BBC-BASIC"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n\n#define S 10\ntypedef struct { double v; int fixed; } node;\n\n#define each(i, x) for(i = 0; i < x; i++)\nnode **alloc2(int w, int h)\n{\n\tint i;\n\tnode **a = calloc(1, sizeof(node*)*h + sizeof(node)*w*h);\n\teach(i, h) a[i] = i ? a[i-1] + w : (node*)(a + h);\n\treturn a;\n}\n\nvoid set_boundary(node **m)\n{\n\tm[1][1].fixed = 1; m[1][1].v = 1;\n\tm[6][7].fixed = -1; m[6][7].v = -1;\n}\n\ndouble calc_diff(node **m, node **d, int w, int h)\n{\n\tint i, j, n;\n\tdouble v, total = 0;\n\teach(i, h) each(j, w) {\n\t\tv = 0; n = 0;\n\t\tif (i) v += m[i-1][j].v, n++;\n\t\tif (j) v += m[i][j-1].v, n++;\n\t\tif (i+1 < h) v += m[i+1][j].v, n++;\n\t\tif (j+1 < w) v += m[i][j+1].v, n++;\n\n\t\td[i][j].v = v = m[i][j].v - v / n;\n\t\tif (!m[i][j].fixed) total += v * v;\n\t}\n\treturn total;\n}\n\ndouble iter(node **m, int w, int h)\n{\n\tnode **d = alloc2(w, h);\n\tint i, j;\n\tdouble diff = 1e10;\n\tdouble cur[] = {0, 0, 0};\n\n\twhile (diff > 1e-24) {\n\t\tset_boundary(m);\n\t\tdiff = calc_diff(m, d, w, h);\n\t\teach(i,h) each(j, w) m[i][j].v -= d[i][j].v;\n\t}\n\n\teach(i, h) each(j, w)\n\t\tcur[ m[i][j].fixed + 1 ] += d[i][j].v *\n\t\t\t\t(!!i + !!j + (i < h-1) + (j < w -1));\n\n\tfree(d);\n\treturn (cur[2] - cur[0])/2;\n}\n\nint main()\n{\n\tnode **mesh = alloc2(S, S);\n\tprintf(\"R = %g\\n\", 2 / iter(mesh, S, S));\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iomanip>\n#include <iostream>\n#include <vector>\n\nclass Node {\nprivate:\n double v;\n int fixed;\n\npublic:\n Node() : v(0.0), fixed(0) {\n // empty\n }\n\n Node(double v, int fixed) : v(v), fixed(fixed) {\n // empty\n }\n\n double getV() const {\n return v;\n }\n\n void setV(double nv) {\n v = nv;\n }\n\n int getFixed() const {\n return fixed;\n }\n\n void setFixed(int nf) {\n fixed = nf;\n }\n};\n\nvoid setBoundary(std::vector<std::vector<Node>>& m) {\n m[1][1].setV(1.0);\n m[1][1].setFixed(1);\n\n m[6][7].setV(-1.0);\n m[6][7].setFixed(-1);\n}\n\ndouble calculateDifference(const std::vector<std::vector<Node>>& m, std::vector<std::vector<Node>>& d, const int w, const int h) {\n double total = 0.0;\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n double v = 0.0;\n int n = 0;\n if (i > 0) {\n v += m[i - 1][j].getV();\n n++;\n }\n if (j > 0) {\n v += m[i][j - 1].getV();\n n++;\n }\n if (i + 1 < h) {\n v += m[i + 1][j].getV();\n n++;\n }\n if (j + 1 < w) {\n v += m[i][j + 1].getV();\n n++;\n }\n v = m[i][j].getV() - v / n;\n d[i][j].setV(v);\n if (m[i][j].getFixed() == 0) {\n total += v * v;\n }\n }\n }\n return total;\n}\n\ndouble iter(std::vector<std::vector<Node>>& m, const int w, const int h) {\n using namespace std;\n vector<vector<Node>> d;\n for (int i = 0; i < h; ++i) {\n vector<Node> t(w);\n d.push_back(t);\n }\n\n double curr[] = { 0.0, 0.0, 0.0 };\n double diff = 1e10;\n\n while (diff > 1e-24) {\n setBoundary(m);\n diff = calculateDifference(m, d, w, h);\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n m[i][j].setV(m[i][j].getV() - d[i][j].getV());\n }\n }\n }\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n int k = 0;\n if (i != 0) ++k;\n if (j != 0) ++k;\n if (i < h - 1) ++k;\n if (j < w - 1) ++k;\n curr[m[i][j].getFixed() + 1] += d[i][j].getV()*k;\n }\n }\n\n return (curr[2] - curr[0]) / 2.0;\n}\n\nconst int S = 10;\nint main() {\n using namespace std;\n vector<vector<Node>> mesh;\n\n for (int i = 0; i < S; ++i) {\n vector<Node> t(S);\n mesh.push_back(t);\n }\n\n double r = 2.0 / iter(mesh, S, S);\n cout << \"R = \" << setprecision(15) << r << '\\n';\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\n\nnamespace ResistorMesh {\n class Node {\n public Node(double v, int fixed_) {\n V = v;\n Fixed = fixed_;\n }\n\n public double V { get; set; }\n public int Fixed { get; set; }\n }\n\n class Program {\n static void SetBoundary(List<List<Node>> m) {\n m[1][1].V = 1.0;\n m[1][1].Fixed = 1;\n\n m[6][7].V = -1.0;\n m[6][7].Fixed = -1;\n }\n\n static double CalcuateDifference(List<List<Node>> m, List<List<Node>> d, int w, int h) {\n double total = 0.0;\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n double v = 0.0;\n int n = 0;\n if (i > 0) {\n v += m[i - 1][j].V;\n n++;\n }\n if (j > 0) {\n v += m[i][j - 1].V;\n n++;\n }\n if (i + 1 < h) {\n v += m[i + 1][j].V;\n n++;\n }\n if (j + 1 < w) {\n v += m[i][j + 1].V;\n n++;\n }\n v = m[i][j].V - v / n;\n d[i][j].V = v;\n if (m[i][j].Fixed == 0) {\n total += v * v;\n }\n }\n }\n return total;\n }\n\n static double Iter(List<List<Node>> m, int w, int h) {\n List<List<Node>> d = new List<List<Node>>(h);\n for (int i = 0; i < h; i++) {\n List<Node> t = new List<Node>(w);\n for (int j = 0; j < w; j++) {\n t.Add(new Node(0.0, 0));\n }\n d.Add(t);\n }\n\n double[] curr = new double[3];\n double diff = 1e10;\n\n while (diff > 1e-24) {\n SetBoundary(m);\n diff = CalcuateDifference(m, d, w, h);\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n m[i][j].V -= d[i][j].V;\n }\n }\n }\n\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n int k = 0;\n if (i != 0) k++;\n if (j != 0) k++;\n if (i < h - 1) k++;\n if (j < w - 1) k++;\n curr[m[i][j].Fixed + 1] += d[i][j].V * k;\n }\n }\n\n return (curr[2] - curr[0]) / 2.0;\n }\n\n const int S = 10;\n static void Main(string[] args) {\n List<List<Node>> mesh = new List<List<Node>>(S);\n for (int i = 0; i < S; i++) {\n List<Node> t = new List<Node>(S);\n for (int j = 0; j < S; j++) {\n t.Add(new Node(0.0, 0));\n }\n mesh.Add(t);\n }\n\n double r = 2.0 / Iter(mesh, S, S);\n Console.WriteLine(\"R = {0:F15}\", r);\n }\n }\n}\n","language":"C-sharp"},{"code":"import std.stdio, std.traits;\n\nenum Node.FP differenceThreshold = 1e-40;\n\nstruct Node {\n alias FP = real;\n enum Kind : size_t { free, A, B }\n\n FP voltage = 0.0;\n\n /*const*/ private Kind kind = Kind.free;\n // Remove kindGet once kind is const.\n @property Kind kindGet() const pure nothrow @nogc {return kind; }\n}\n\nNode.FP iter(size_t w, size_t h)(ref Node[w][h] m) pure nothrow @nogc {\n static void enforceBoundaryConditions(ref Node[w][h] m)\n pure nothrow @nogc {\n m[1][1].voltage = 1.0;\n m[6][7].voltage = -1.0;\n }\n\n static Node.FP calcDifference(in ref Node[w][h] m,\n ref Node[w][h] d) pure nothrow @nogc {\n Node.FP total = 0.0;\n\n foreach (immutable i; 0 .. h) {\n foreach (immutable j; 0 .. w) {\n Node.FP v = 0.0;\n {\n size_t n = 0;\n if (i != 0) { v += m[i - 1][j].voltage; n++; }\n if (j != 0) { v += m[i][j - 1].voltage; n++; }\n if (i < h - 1) { v += m[i + 1][j].voltage; n++; }\n if (j < w - 1) { v += m[i][j + 1].voltage; n++; }\n v = m[i][j].voltage - v / n;\n }\n\n d[i][j].voltage = v;\n if (m[i][j].kindGet == Node.Kind.free)\n total += v ^^ 2;\n }\n }\n\n return total;\n }\n\n Node[w][h] difference;\n\n while (true) {\n enforceBoundaryConditions(m);\n if (calcDifference(m, difference) < differenceThreshold)\n break;\n foreach (immutable i, const di; difference)\n foreach (immutable j, const ref dij; di)\n m[i][j].voltage -= dij.voltage;\n }\n\n Node.FP[EnumMembers!(Node.Kind).length] cur = 0.0;\n foreach (immutable i, const di; difference)\n foreach (immutable j, const ref dij; di)\n cur[m[i][j].kindGet] += dij.voltage *\n (!!i + !!j + (i < h-1) + (j < w-1));\n\n return (cur[Node.Kind.A] - cur[Node.Kind.B]) / 2.0;\n}\n\nvoid main() {\n enum size_t w = 10,\n h = w;\n Node[w][h] mesh;\n\n // Set A and B Nodes.\n mesh[1][1] = Node( 1.0, Node.Kind.A);\n mesh[6][7] = Node(-1.0, Node.Kind.B);\n\n writefln(\"R = %.19f\", 2 / mesh.iter);\n}\n","language":"D"},{"code":" PROGRAM RESISTENCE_MESH\n\n !$BASE=1\n\n !$DYNAMIC\n DIM A[0,0]\n\n BEGIN\n\n N=10\n NN=N*N\n !$DIM A[NN,NN+1]\n\n PRINT(CHR$(12);) !CLS\n ! generate matrix data\n NODE=0\n FOR ROW=1 TO N DO\n FOR COL=1 TO N DO\n NODE=NODE+1\n IF ROW>1 THEN\n A[NODE,NODE]=A[NODE,NODE]+1\n A[NODE,NODE-N]=-1\n END IF\n IF ROW<N THEN\n A[NODE,NODE]=A[NODE,NODE]+1\n A[NODE,NODE+N]=-1\n END IF\n IF COL>1 THEN\n A[NODE,NODE]=A[NODE,NODE]+1\n A[NODE,NODE-1]=-1\n END IF\n IF COL<N THEN\n A[NODE,NODE]=A[NODE,NODE]+1\n A[NODE,NODE+1]=-1\n END IF\n END FOR\n END FOR\n\n AR=2 AC=2 A=AC+N*(AR-1)\n BR=7 BC=8 B=BC+N*(BR-1)\n A[A,NN+1]=-1\n A[B,NN+1]=1\n\n PRINT(\"Nodes \";A,B)\n\n ! solve linear system\n ! using Gauss-Seidel method\n ! with pivoting\n R=NN\n\n FOR J=1 TO R DO\n FOR I=J TO R DO\n EXIT IF A[I,J]<>0\n END FOR\n IF I=R+1 THEN\n PRINT(\"No solution!\")\n !$STOP\n END IF\n FOR K=1 TO R+1 DO\n SWAP(A[J,K],A[I,K])\n END FOR\n Y=1/A[J,J]\n FOR K=1 TO R+1 DO\n A[J,K]=Y*A[J,K]\n END FOR\n FOR I=1 TO R DO\n IF I<>J THEN\n Y=-A[I,J]\n FOR K=1 TO R+1 DO\n A[I,K]=A[I,K]+Y*A[J,K]\n END FOR\n END IF\n END FOR\n END FOR\n PRINT(\"Resistence=\";ABS(A[A,NN+1]-A[B,NN+1]))\n END PROGRAM\n","language":"ERRE"},{"code":">load incidence;\n>{u,r}=solvePotentialX(makeRectangleX(10,10),12,68); r,\n 1.60899124173\n","language":"Euler"},{"code":"function makeRectangleX (n:index,m:index)\n## Make the incidence matrix of a rectangle grid in compact form.\n## see: makeRectangleIncidence\n\tK=zeros(n*(m-1)+m*(n-1),3);\n\tk=1;\n\tfor i=1 to n;\n\t\tfor j=1 to m-1;\n\t\tK[k,1]=(i-1)*m+j; K[k,2]=(i-1)*m+j+1; K[k,3]=1;\n\t\tk=k+1;\n\t\tend;\n\tend;\n\tfor i=1 to n-1;\n\t\tfor j=1 to m;\n\t\tK[k,1]=(i-1)*m+j; K[k,2]=i*m+j; K[k,3]=1;\n\t\tk=k+1;\n\t\tend;\n\tend;\n\tH=cpxzeros([n*m,n*m]);\n\tH=cpxset(H,K);\n\tH=cpxset(H,K[:,[2,1,3]]);\n\treturn H;\nendfunction\n\nfunction solvePotentialX (A:cpx, i:index ,j:index)\n## Solve the potential problem of resistance in a graph.\n## This functions uses the conjugate gradient method.\n## A is a compressed incidence matrix.\n## Return the potential u for the nodes in A,\n## such that u[i]=1, u[j]=-1, and the flow\n## to each knot is equal to the flow from the knot,\n## and the flow from i to j is (u[i]-u[j])*A[i,j].\n## see: makeIncidence\n\tn=size(A)[1];\n\tb=ones(n,1); f=-cpxmult(A,b);\n\th=1:n; B=cpxset(A,h'|h'|f);\n\tB=cpxset(B,i|h'|0);\n\tB=cpxset(B,[i,i,1]);\n\tB=cpxset(B,j|h'|0);\n\tB=cpxset(B,[j,j,1]);\n\tv=zeros(n,1); v[i]=1; v[j]=-1;\n\tu=cpxfit(B,v);\n\tf=(-f[i])*u[i]-cpxmult(A,u)[i];\n\treturn {u,2/f}\nendfunction\n","language":"Euler"},{"code":"function cgX (H:cpx, b:real column, x0:real column=none, f:index=10)\n## Conjugate gradient method to solve Hx=b for compressed H.\n##\n## This is the method of choice for large, sparse matrices. In most\n## cases, it will work well, fast, and accurate.\n##\n## H must be positive definite. Use cpxfit, if it is not.\n##\n## The accuarcy can be controlled with an additional parameter\n## eps. The algorithm stops, when the error gets smaller then eps, or\n## after f*n iterations, if the error gets larger. x0 is an optional\n## start vector.\n##\n## H : compressed matrix (nxm)\n## b : column vector (mx1)\n## x0 : optional start point (mx1)\n## f : number of steps, when the method should be restarted\n##\n## See: cpxfit, cg, cgXnormal\n\tif isvar(\"eps\") then localepsilon(eps); endif;\n\tn=cols(H);\n\tif x0==none then x=zeros(size(b));\n\telse; x=x0;\n\tendif;\n\tloop 1 to 10\n\t\tr=b-cpxmult(H,x); p=r; fehler=r'.r;\n\t\tloop 1 to f*n\n\t\t\tif sqrt(fehler)~=0 then return x; endif;\n\t\t\tHp=cpxmult(H,p);\n\t\t\ta=fehler/(p'.Hp);\n\t\t\tx=x+a*p;\n\t\t\trn=r-a*Hp;\n\t\t\tfehlerneu=rn'.rn;\n\t\t\tp=rn+fehlerneu/fehler*p;\n\t\t\tr=rn; fehler=fehlerneu;\n\t\tend;\n\tend;\n\treturn x;\nendfunction\n","language":"Euler"},{"code":"' version 01-07-2018\n' compile with: fbc -s console\n\n#Define n 10\n\nDim As UInteger nn = n * n\nDim As Double g(-nn To nn +1, -nn To nn +1)\nDim As UInteger node, row, col\n\nFor row = 1 To n\n For col = 1 To n\n node += 1\n If row > 1 Then\n g(node, node) += 1\n g(node, node - n) = -1\n End If\n If row < n Then\n g(node, node) += 1\n g(node, node + n) = -1\n End If\n If col > 1 Then\n g(node, node) += 1\n g(node, node -1) = -1\n End If\n If col < n Then\n g(node, node) += 1\n g(node, node +1) = -1\n End If\n Next\nNext\n\nDim As UInteger ar = 2, ac = 2\nDim As UInteger br = 7, bc = 8\nDim As UInteger a = ac + n * (ar -1)\nDim As UInteger b = bc + n * (br -1)\n\ng(a, nn +1) = -1\ng(b, nn +1) = 1\n\nPrint : Print \"Nodes a: \"; a, \" b: \"; b\n\n' solve linear system using Gauss-Seidel method with pivoting\nDim As UInteger i, j, k\nDim As Double y\n\nDo\n For j = 1 To nn\n For i = j To nn\n If g(i, j) <> 0 Then Exit For\n Next\n If i = nn +1 Then\n Print : Print \"No solution\"\n Exit Do\n End If\n For k = 1 To nn +1\n Swap g(j, k), g(i, k)\n Next\n y = g(j, j)\n For k = 1 To nn +1\n g(j, k) = g(j, k) / y\n Next\n For i = 1 To nn\n If i <> j Then\n y = -g(i, j)\n For k = 1 To nn +1\n g(i, k) = g(i, k) + y * g(j, k)\n Next\n End If\n Next\n Next\n\n Print\n Print \"Resistance =\"; Abs(g(a, nn +1) - g(b, nn +1)); \" Ohm\"\n Exit Do\nLoop\n\n' empty keyboard buffer\nWhile Inkey <> \"\" : Wend\nPrint : Print \"hit any key to end program\"\nSleep\nEnd\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\nconst (\n\tS = 10\n)\n\ntype node struct {\n\tv float64\n\tfixed int\n}\n\nfunc alloc2(w, h int) [][]node {\n\ta := make([][]node, h)\n\n\tfor i := range a {\n\t\ta[i] = make([]node, w)\n\t}\n\treturn a\n}\n\nfunc set_boundary(m [][]node) {\n\tm[1][1].fixed = 1\n\tm[1][1].v = 1\n\tm[6][7].fixed = -1\n\tm[6][7].v = -1\n}\n\nfunc calc_diff(m [][]node, d [][]node, w, h int) float64 {\n\ttotal := 0.0\n\tfor i := 0; i < h; i++ {\n\t\tfor j := 0; j < w; j++ {\n\t\t\tv := 0.0\n\t\t\tn := 0\n\t\t\tif i != 0 {\n\t\t\t\tv += m[i-1][j].v\n\t\t\t\tn++\n\t\t\t}\n\t\t\tif j != 0 {\n\t\t\t\tv += m[i][j-1].v\n\t\t\t\tn++\n\t\t\t}\n\t\t\tif i+1 < h {\n\t\t\t\tv += m[i+1][j].v\n\t\t\t\tn++\n\t\t\t}\n\t\t\tif j+1 < w {\n\t\t\t\tv += m[i][j+1].v\n\t\t\t\tn++\n\t\t\t}\n\n\t\t\tv = m[i][j].v - v/float64(n)\n\t\t\td[i][j].v = v\n\t\t\tif m[i][j].fixed == 0 {\n\t\t\t\ttotal += v * v\n\t\t\t}\n\t\t}\n\t}\n\treturn total\n}\n\nfunc iter(m [][]node, w, h int) float64 {\n\td := alloc2(w, h)\n\tdiff := 1.0e10\n\tcur := []float64{0, 0, 0}\n\n\tfor diff > 1e-24 {\n\t\tset_boundary(m)\n\t\tdiff = calc_diff(m, d, w, h)\n\t\tfor i := 0; i < h; i++ {\n\t\t\tfor j := 0; j < w; j++ {\n\t\t\t\tm[i][j].v -= d[i][j].v\n\t\t\t}\n\t\t}\n\t}\n\n\tfor i := 0; i < h; i++ {\n\t\tfor j := 0; j < w; j++ {\n\t\t\tt := 0\n\t\t\tif i != 0 {\n\t\t\t\tt += 1\n\t\t\t}\n\t\t\tif j != 0 {\n\t\t\t\tt += 1\n\t\t\t}\n\t\t\tif i < h-1 {\n\t\t\t\tt += 1\n\t\t\t}\n\t\t\tif j < w-1 {\n\t\t\t\tt += 1\n\t\t\t}\n\t\t\tcur[m[i][j].fixed+1] += d[i][j].v * float64(t)\n\t\t}\n\t}\n\treturn (cur[2] - cur[0]) / 2\n}\n\nfunc main() {\n\tmesh := alloc2(S, S)\n\tfmt.Printf(\"R = %g\\n\", 2/iter(mesh, S, S))\n}\n","language":"Go"},{"code":"{-# LANGUAGE ParallelListComp #-}\nimport Numeric.LinearAlgebra (linearSolve, toDense, (!), flatten)\nimport Data.Monoid ((<>), Sum(..))\n\nrMesh n (ar, ac) (br, bc)\n | n < 2 = Nothing\n | any (\\x -> x < 1 || x > n) [ar, ac, br, bc] = Nothing\n | otherwise = between a b <$> voltage\n where\n a = (ac - 1) + n*(ar - 1)\n b = (bc - 1) + n*(br - 1)\n\n between x y v = abs (v ! a - v ! b)\n\n voltage = flatten <$> linearSolve matrixG current\n\n matrixG = toDense $ concat [ element row col node\n | row <- [1..n], col <- [1..n]\n | node <- [0..] ]\n\n element row col node =\n let (Sum c, elements) =\n (Sum 1, [((node, node-n), -1)]) `when` (row > 1) <>\n (Sum 1, [((node, node+n), -1)]) `when` (row < n) <>\n (Sum 1, [((node, node-1), -1)]) `when` (col > 1) <>\n (Sum 1, [((node, node+1), -1)]) `when` (col < n)\n in [((node, node), c)] <> elements\n\n x `when` p = if p then x else mempty\n\n current = toDense [ ((a, 0), -1) , ((b, 0), 1) , ((n^2-1, 0), 0) ]\n","language":"Haskell"},{"code":"nodes=: 10 10 #: i. 100\nnodeA=: 1 1\nnodeB=: 6 7\n\nNB. verb to pair up coordinates along a specific offset\nconn =: [: (#~ e.~/@|:~&0 2) ([ ,: +)\"1\n\nref =: ~. nodeA,nodes-.nodeB NB. all nodes, with A first and B omitted\nwiring=: /:~ ref i. ,/ nodes conn\"2 1 (,-)=i.2 NB. connected pairs (indices into ref)\nYii=: (* =@i.@#) #/.~ {.\"1 wiring NB. diagonal of Y represents connections to B\nYij=: -1:`(<\"1@[)`]}&(+/~ 0*i.1+#ref) wiring NB. off diagonal of Y represents wiring\nY=: _1 _1 }. Yii+Yij\n","language":"J"},{"code":" {.{. %. Y\n1.60899\n","language":"J"},{"code":" {.{.%. x:Y\n455859137025721r283319837425200\n","language":"J"},{"code":" 3 3 #: i.9\n0 0\n0 1\n0 2\n1 0\n1 1\n1 2\n2 0\n2 1\n2 2\n (3 3 #: i.9) conn 0 1\n0 0\n0 1\n\n0 1\n0 2\n\n1 0\n1 1\n\n1 1\n1 2\n\n2 0\n2 1\n\n2 1\n2 2\n","language":"J"},{"code":"import java.util.ArrayList;\nimport java.util.List;\n\npublic class ResistorMesh {\n private static final int S = 10;\n\n private static class Node {\n double v;\n int fixed;\n\n Node(double v, int fixed) {\n this.v = v;\n this.fixed = fixed;\n }\n }\n\n private static void setBoundary(List<List<Node>> m) {\n m.get(1).get(1).v = 1.0;\n m.get(1).get(1).fixed = 1;\n\n m.get(6).get(7).v = -1.0;\n m.get(6).get(7).fixed = -1;\n }\n\n private static double calcDiff(List<List<Node>> m, List<List<Node>> d, int w, int h) {\n double total = 0.0;\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n double v = 0.0;\n int n = 0;\n if (i > 0) {\n v += m.get(i - 1).get(j).v;\n n++;\n }\n if (j > 0) {\n v += m.get(i).get(j - 1).v;\n n++;\n }\n if (i + 1 < h) {\n v += m.get(i + 1).get(j).v;\n n++;\n }\n if (j + 1 < w) {\n v += m.get(i).get(j + 1).v;\n n++;\n }\n v = m.get(i).get(j).v - v / n;\n d.get(i).get(j).v = v;\n if (m.get(i).get(j).fixed == 0) {\n total += v * v;\n }\n }\n }\n return total;\n }\n\n private static double iter(List<List<Node>> m, int w, int h) {\n List<List<Node>> d = new ArrayList<>(h);\n for (int i = 0; i < h; ++i) {\n List<Node> t = new ArrayList<>(w);\n for (int j = 0; j < w; ++j) {\n t.add(new Node(0.0, 0));\n }\n d.add(t);\n }\n\n double[] cur = new double[3];\n double diff = 1e10;\n\n while (diff > 1e-24) {\n setBoundary(m);\n diff = calcDiff(m, d, w, h);\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n m.get(i).get(j).v -= d.get(i).get(j).v;\n }\n }\n }\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n int k = 0;\n if (i != 0) k++;\n if (j != 0) k++;\n if (i < h - 1) k++;\n if (j < w - 1) k++;\n cur[m.get(i).get(j).fixed + 1] += d.get(i).get(j).v * k;\n }\n }\n\n return (cur[2] - cur[0]) / 2.0;\n }\n\n public static void main(String[] args) {\n List<List<Node>> mesh = new ArrayList<>(S);\n for (int i = 0; i < S; ++i) {\n List<Node> t = new ArrayList<>(S);\n for (int j = 0; j < S; ++j) {\n t.add(new Node(0.0, 0));\n }\n mesh.add(t);\n }\n\n double r = 2.0 / iter(mesh, S, S);\n System.out.printf(\"R = %.15f\", r);\n }\n}\n","language":"Java"},{"code":"// Vector addition, scalar multiplication & dot product:\nconst add = (u, v) => {let i = u.length; while(i--) u[i] += v[i]; return u;};\nconst sub = (u, v) => {let i = u.length; while(i--) u[i] -= v[i]; return u;};\nconst mul = (a, u) => {let i = u.length; while(i--) u[i] *= a; return u;};\nconst dot = (u, v) => {let s = 0, i = u.length; while(i--) s += u[i]*v[i]; return s;};\n\nconst W = 10, H = 10, A = 11, B = 67;\n\nfunction getAdjacent(node){ // Adjacency lists for square grid\n let list = [], x = node % W, y = Math.floor(node / W);\n if (x > 0) list.push(node - 1);\n if (y > 0) list.push(node - W);\n if (x < W - 1) list.push(node + 1);\n if (y < H - 1) list.push(node + W);\n return list;\n}\n\nfunction linOp(u){ // LHS of the linear equation\n let v = new Float64Array(W * H);\n for(let i = 0; i < v.length; i++){\n if ( i === A || i === B ) {\n v[i] = u[i];\n continue;\n }\n // For each node other then A, B calculate the net current flow:\n for(let j of getAdjacent(i)){\n v[i] += (j === A || j === B) ? u[i] : u[i] - u[j];\n }\n }\n return v;\n}\n\nfunction getRHS(phiA = 1, phiB = 0){ // RHS of the linear equation\n let b = new Float64Array(W * H);\n // Setting boundary conditions (electric potential at A and B):\n b[A] = phiA;\n b[B] = phiB;\n for(let j of getAdjacent(A)) b[j] = phiA;\n for(let j of getAdjacent(B)) b[j] = phiB;\n return b;\n}\n\nfunction init(phiA = 1, phiB = 0){ // initialize unknown vector\n let u = new Float64Array(W * H);\n u[A] = phiA;\n u[B] = phiB;\n return u;\n}\n\nfunction solveLinearSystem(err = 1e-20){ // conjugate gradient solver\n\n let b = getRHS();\n let u = init();\n let r = sub(linOp(u), b);\n let p = r;\n let e = dot(r,r);\n\n while(true){\n let Ap = linOp(p);\n let alpha = e / dot(p, Ap);\n u = sub(u, mul(alpha, p.slice()));\n r = sub(linOp(u), b);\n let e_new = dot(r,r);\n let beta = e_new / e;\n\n if(e_new < err) return u;\n\n e = e_new;\n p = add(r, mul(beta, p));\n }\n}\n\nfunction getResistance(u){\n let curr = 0;\n for(let j of getAdjacent(A)) curr += u[A] - u[j];\n return 1 / curr;\n}\n\nlet phi = solveLinearSystem();\nlet res = getResistance(phi);\nconsole.log(`R = ${res} Ohm`);\n","language":"JavaScript"},{"code":"# Create a $rows * $columns matrix initialized with the input value\ndef matrix($rows; $columns):\n . as $in\n | [range(0;$columns)|$in] as $row\n | [range(0;$rows)|$row];\n\ndef Node($v; $fixed):\n {$v, $fixed};\n\n# input: a suitable matrix of Nodes\ndef setBoundary:\n .[1][1].v = 1\n | .[1][1].fixed = 1\n | .[6][7].v = -1\n | .[6][7].fixed = -1 ;\n\n# input: {d, m} where\n# .d and .m are matrices (as produced by matrix(h; w)) of Nodes\n# output: {d, m, diff} with d updated\ndef calcDiff($w; $h):\n def adjust($cond; action): if $cond then action | .n += 1 else . end;\n\n reduce range(0; $h) as $i (.diff = 0;\n reduce range(0; $w) as $j (.;\n .v = 0\n | .n = 0\n | adjust($i > 0; .v += .m[$i-1][$j].v)\n | adjust($j > 0; .v += .m[$i][$j-1].v)\n | adjust($i + 1 < $h; .v += .m[$i+1][$j].v)\n | adjust($j + 1 < $w; .v += .m[$i][$j+1].v)\n | .v = .m[$i][$j].v - .v/.n\n | .d[$i][$j].v = .v\n | if (.m[$i][$j].fixed == 0) then .diff += .v * .v else . end ) ) ;\n\n# input: a mesh of width w and height h, i.e. a matrix as prodcued by matrix(h;w)\ndef iter:\n length as $h\n | (.[0]|length) as $w\n | { m : .,\n d : (Node(0;0) | matrix($h; $w)),\n cur: [0,0,0],\n diff: 1e10 }\n | until (.diff <= 1e-24;\n .m |= setBoundary\n | calcDiff($w; $h)\n | reduce range(0;$h) as $i (.;\n reduce range(0;$w) as $j (.;\n .m[$i][$j].v += (- .d[$i][$j].v) )) )\n | reduce range(0; $h) as $i (.;\n reduce range(0; $w) as $j (.;\n .k = 0\n | if ($i != 0) then .k += 1 else . end\n | if ($j != 0) then .k += 1 else . end\n | if ($i < $h - 1) then .k += 1 else . end\n | if ($j < $w - 1) then .k += 1 else . end\n | .cur[.m[$i][$j].fixed + 1] += .d[$i][$j].v * .k ))\n | (.cur[2] - .cur[0]) / 2 ;\n\ndef task($S):\n def mesh: Node(0; 0) | matrix($S; $S);\n (2 / (mesh | iter)) as $r\n | \"R = \\($r) ohms\";\n\ntask(10)\n","language":"Jq"},{"code":"N = 10\nD1 = speye(N-1,N) - spdiagm(ones(N-1),1,N-1,N)\nD = [ kron(D1, speye(N)); kron(speye(N), D1) ]\ni, j = N*1 + 2, N*7+7\nb = zeros(N^2); b[i], b[j] = 1, -1\nv = (D' * D) \\ b\nv[i] - v[j]\n","language":"Julia"},{"code":"// version 1.1.4-3\n\ntypealias List2D<T> = List<List<T>>\n\nconst val S = 10\n\nclass Node(var v: Double, var fixed: Int)\n\nfun setBoundary(m: List2D<Node>) {\n m[1][1].v = 1.0; m[1][1].fixed = 1\n m[6][7].v = -1.0; m[6][7].fixed = -1\n}\n\nfun calcDiff(m: List2D<Node>, d: List2D<Node>, w: Int, h: Int): Double {\n var total = 0.0\n for (i in 0 until h) {\n for (j in 0 until w) {\n var v = 0.0\n var n = 0\n if (i > 0) { v += m[i - 1][j].v; n++ }\n if (j > 0) { v += m[i][j - 1].v; n++ }\n if (i + 1 < h) { v += m[i + 1][j].v; n++ }\n if (j + 1 < w) { v += m[i][j + 1].v; n++ }\n v = m[i][j].v - v / n\n d[i][j].v = v\n if (m[i][j].fixed == 0) total += v * v\n }\n }\n return total\n}\n\nfun iter(m: List2D<Node>, w: Int, h: Int): Double {\n val d = List(h) { List(w) { Node(0.0, 0) } }\n val cur = DoubleArray(3)\n var diff = 1e10\n\n while (diff > 1e-24) {\n setBoundary(m)\n diff = calcDiff(m, d, w, h)\n for (i in 0 until h) {\n for (j in 0 until w) m[i][j].v -= d[i][j].v\n }\n }\n\n for (i in 0 until h) {\n for (j in 0 until w) {\n var k = 0\n if (i != 0) k++\n if (j != 0) k++\n if (i < h - 1) k++\n if (j < w - 1) k++\n cur[m[i][j].fixed + 1] += d[i][j].v * k\n }\n }\n return (cur[2] - cur[0]) / 2.0\n}\n\nfun main(args: Array<String>) {\n val mesh = List(S) { List(S) { Node(0.0, 0) } }\n val r = 2.0 / iter(mesh, S, S)\n println(\"R = $r\")\n}\n","language":"Kotlin"},{"code":"ResistanceMatrix[g_Graph] := With[{n = VertexCount[g], km = KirchhoffMatrix[g]},\n Table[ ReplacePart[ Diagonal[ DrazinInverse[ ReplacePart[km, k -> UnitVector[n, k]]]], k -> 0],\n {k, n}]\n]\n\nrm = ResistanceMatrix[GridGraph[{10, 10}]];\n\nN[rm[[12, 68]], 40]\n","language":"Mathematica"},{"code":"ResistanceMatrix[g_, prec_:$MachinePrecision]:= With[{m = PseudoInverse[N[KirchhoffMatrix[g], prec]]},\n Outer[Plus, Diagonal[m], Diagonal[m]] - m - Transpose[m]\n]\n\nrm = ResistanceMatrix[GridGraph[{10, 10}], 40];\n\nrm[[12, 68]]\n","language":"Mathematica"},{"code":"/* Place a current souce between A and B, providing 1 A. Then we are really looking\n for the potential at A and B, since I = R (V(B) - V(A)) where I is given and we want R.\n\n Atually, we will compute potential at each node, except A where we assume it's 0.\n Without this assumption, there would be infinitely many solutions since potential\n is known up to a constant. For A we will simply write the equation V(A) = 0, to\n keep the program simple.\n\n Hence, for a general grid of p rows and q columns, there are n = p * q nodes,\n so n unknowns, and n equations. Write Kirchhoff's current law at each node.\n Be careful with the node A (equation A = 0) and the node B (there is a constant\n current to add, from the source, that will go in the constant terms of the system).\n\n Finally, we have a n x n linear system of equations to solve. Simply use Maxima's\n builtin LU decomposition.\n\n Since all computations are exact, the result will be also exact, written as a fraction.\n Also, the program can work with any grid, and any two nodes on the grid.\n\n For those who want more speed and less space, notice the system is sparse and necessarily\n symmetric, so one can use conjugate gradient or any other sparse symmetric solver. */\n\n\n/* Auxiliary function to get rid of the borders */\nongrid(i, j, p, q) := is(i >= 1 and i <= p and j >= 1 and j <= q)$\n\ngrid_resistor(p, q, ai, aj, bi, bj) := block(\n [n: p * q, A, B, M, k, c, V],\n A: zeromatrix(n, n),\n for i thru p do\n for j thru q do (\n k: (i - 1) * q + j,\n if i = ai and j = aj then\n A[k, k]: 1\n else (\n c: 0,\n if ongrid(i + 1, j, p, q) then (c: c + 1, A[k, k + q]: -1),\n if ongrid(i - 1, j, p, q) then (c: c + 1, A[k, k - q]: -1),\n if ongrid(i, j + 1, p, q) then (c: c + 1, A[k, k + 1]: -1),\n if ongrid(i, j - 1, p, q) then (c: c + 1, A[k, k - 1]: -1),\n A[k, k]: c\n )\n ),\n B: zeromatrix(n, 1),\n B[k: (bi - 1) * q + bj, 1]: 1,\n M: lu_factor(A),\n V: lu_backsub(M, B),\n V[k, 1]\n)$\n\ngrid_resistor(10, 10, 2, 2, 8, 7);\n455859137025721 / 283319837425200\n\nbfloat(%), fpprec = 40;\n1.608991241730729655954495520510088761201b0\n\n/* Some larger example */\ngrid_resistor(20, 20, 1, 1, 20, 20);\n129548954101732562831760781545158173626645023 / 33283688571680493510612137844679320717594861\n\nbfloat(%), fpprec = 40;\n3.89226554090400912102670691601064387507b0\n","language":"Maxima"},{"code":"MODULE ResistorMesh;\nFROM RConversions IMPORT RealToStringFixed;\nFROM Terminal IMPORT WriteString,WriteLn,ReadChar;\n\nCONST S = 10;\n\nTYPE Node = RECORD\n v : LONGREAL;\n fixed : INTEGER;\nEND;\n\nPROCEDURE SetBoundary(VAR m : ARRAY OF ARRAY OF Node);\nBEGIN\n m[1][1].v := 1.0;\n m[1][1].fixed := 1;\n\n m[6][7].v := -1.0;\n m[6][7].fixed := -1;\nEND SetBoundary;\n\nPROCEDURE CalcDiff(VAR m,d : ARRAY OF ARRAY OF Node) : LONGREAL;\nVAR\n total,v : LONGREAL;\n i,j,n : INTEGER;\nBEGIN\n total := 0.0;\n FOR i:=0 TO S DO\n FOR j:=0 TO S DO\n v := 0.0;\n n := 0;\n IF i>0 THEN\n v := v + m[i-1][j].v;\n INC(n);\n END;\n IF j>0 THEN\n v := v + m[i][j-1].v;\n INC(n);\n END;\n IF i+1<S THEN\n v := v + m[i+1][j].v;\n INC(n);\n END;\n IF j+1<S THEN\n v := v + m[i][j+1].v;\n INC(n);\n END;\n v := m[i][j].v - v / LFLOAT(n);\n d[i][j].v := v;\n IF m[i][j].fixed=0 THEN\n total := total + v*v;\n END;\n END;\n END;\n RETURN total;\nEND CalcDiff;\n\nPROCEDURE Iter(m : ARRAY OF ARRAY OF Node) : LONGREAL;\nVAR\n d : ARRAY[0..S] OF ARRAY[0..S] OF Node;\n i,j,k : INTEGER;\n cur : ARRAY[0..2] OF LONGREAL;\n diff : LONGREAL;\nBEGIN\n FOR i:=0 TO S DO\n FOR j:=0 TO S DO\n d[i][j] := Node{0.0,0};\n END;\n END;\n\n diff := 1.0E10;\n WHILE diff>1.0E-24 DO\n SetBoundary(m);\n diff := CalcDiff(m,d);\n FOR i:=0 TO S DO\n FOR j:=0 TO S DO\n m[i][j].v := m[i][j].v - d[i][j].v;\n END;\n END;\n END;\n\n FOR i:=0 TO S DO\n FOR j:=0 TO S DO\n k:=0;\n IF i#0 THEN INC(k) END;\n IF j#0 THEN INC(k) END;\n IF i<S-1 THEN INC(k) END;\n IF j<S-1 THEN INC(k) END;\n cur[m[i][j].fixed+1] := cur[m[i][j].fixed+1] + d[i][j].v*LFLOAT(k);\n END;\n END;\n\n RETURN (cur[2]-cur[0]) / 2.0;\nEND Iter;\n\nVAR\n mesh : ARRAY[0..S] OF ARRAY[0..S] OF Node;\n buf : ARRAY[0..32] OF CHAR;\n r : LONGREAL;\n pos : CARDINAL;\n ok : BOOLEAN;\nBEGIN\n pos := 0;\n r := 2.0 / Iter(mesh);\n WriteString(\"R = \");\n RealToStringFixed(r, 15,0, buf, pos, ok);\n WriteString(buf);\n WriteString(\" ohms\");\n WriteLn;\n\n ReadChar;\nEND ResistorMesh.\n","language":"Modula-2"},{"code":"const S = 10\n\ntype\n\n NodeKind = enum nodeFree, nodeA, nodeB\n\n Node = object\n v: float\n fixed: NodeKind\n\n Mesh[H, W: static int] = array[H, array[W, Node]]\n\n\nfunc setBoundary(m: var Mesh) =\n m[1][1].v = 1.0\n m[1][1].fixed = nodeA\n m[6][7].v = -1.0\n m[6][7].fixed = nodeB\n\n\nfunc calcDiff[H, W: static int](m,: Mesh[H, W]; d: var Mesh[H, W]): float =\n for i in 0..<H:\n for j in 0..<W:\n var v = 0.0\n var n = 0\n if i > 0:\n v += m[i - 1][j].v\n inc n\n if j > 0:\n v += m[i][j - 1].v\n inc n\n if i + 1 < m.H:\n v += m[i + 1][j].v\n inc n\n if j + 1 < m.W:\n v += m[i][j + 1].v\n inc n\n v = m[i][j].v - v / n.toFloat\n d[i][j].v = v\n if m[i][j].fixed == nodeFree:\n result += v * v\n\n\nfunc iter[H, W: static int](m: var Mesh[H, W]): float =\n var\n d: Mesh[H, W]\n cur: array[NodeKind, float]\n diff = 1e10\n\n while diff > 1e-24:\n m.setBoundary()\n diff = calcDiff(m, d)\n for i in 0..<H:\n for j in 0..<W:\n m[i][j].v -= d[i][j].v\n\n for i in 0..<H:\n for j in 0..<W:\n var k = 0\n if i != 0: inc k\n if j != 0: inc k\n if i < m.H - 1: inc k\n if j < m.W - 1: inc k\n cur[m[i][j].fixed] += d[i][j].v * k.toFloat\n\n result = (cur[nodeA] - cur[nodeB]) / 2\n\n\nwhen isMainModule:\n\n var mesh: Mesh[S, S]\n let r = 2 / mesh.iter()\n echo \"R = \", r\n","language":"Nim"},{"code":"N = 10;\nNN = N*N;\nG = sparse(NN, NN);\n\nnode = 0;\nfor row=1:N;\n for col=1:N;\n\tnode++;\n\tif row > 1\n\t G(node, node)++;\n\t G(node, node - N) = -1;\n\tend\n\tif row < N;\n\t G(node, node)++;\n\t G(node, node + N) = -1;\n\tend\n\tif col > 1\n\t G(node, node)++;\n\t G(node, node - 1) = -1;\n\tend\n\tif col < N;\n\t G(node, node)++;\n\t G(node, node + 1) = -1;\n\tend\n end\nend\n\ncurrent = sparse(NN, 1);\n\nAr = 2; Ac = 2; A = Ac + N*( Ar - 1 );\nBr = 7; Bc = 8; B = Bc + N*( Br - 1 );\ncurrent( A ) = -1;\ncurrent( B ) = +1;\n\nvoltage = G \\ current;\n\nVA = voltage( A );\nVB = voltage( B );\n\nfull( abs( VA - VB ) )\n","language":"Octave"},{"code":"use strict;\nuse warnings;\n\nmy ($w, $h) = (9, 9);\nmy @v = map([ (0) x ($w + 1) ], 0 .. $h); # voltage\nmy @f = map([ (0) x ($w + 1) ], 0 .. $h); # fixed condition\nmy @d = map([ (0) x ($w + 1) ], 0 .. $h); # diff\n\nmy @n; # neighbors\nfor my $i (0 .. $h) {\n\tpush @{$n[$i][$_]}, [$i, $_ - 1] for 1 .. $w;\n\tpush @{$n[$i][$_]}, [$i, $_ + 1] for 0 .. $w - 1;\n}\nfor my $j (0 .. $w) {\n\tpush @{$n[$_][$j]}, [$_ - 1, $j] for 1 .. $h;\n\tpush @{$n[$_][$j]}, [$_ + 1, $j] for 0 .. $h - 1;\n}\n\nsub set_boundary {\n\t$f[1][1] = 1; $f[6][7] = -1;\n\t$v[1][1] = 1; $v[6][7] = -1;\n}\n\nsub calc_diff {\n\tmy $total_diff;\n\tfor my $i (0 .. $h) {\n\t\tfor my $j (0 .. $w) {\n\t\t\tmy ($p, $v) = $n[$i][$j];\n\t\t\t$v += $v[$_->[0]][$_->[1]] for @$p;\n\t\t\t$d[$i][$j] = $v = $v[$i][$j] - $v / scalar(@$p);\n\t\t\t$total_diff += $v * $v unless $f[$i][$j];\n\t\t}\n\t}\n\t$total_diff;\n}\n\nsub iter {\n\tmy $diff = 1;\n\twhile ($diff > 1e-15) {\n\t\tset_boundary();\n\t\t$diff = calc_diff();\n\t\t#print \"error^2: $diff\\n\"; # un-comment to see slow convergence\n\t\tfor my $i (0 .. $h) {\n\t\t\tfor my $j (0 .. $w) {\n\t\t\t\t$v[$i][$j] -= $d[$i][$j];\n\t\t\t}\n\t\t}\n\t}\n\n\tmy @current = (0) x 3;\n\tfor my $i (0 .. $h) {\n\t\tfor my $j (0 .. $w) {\n\t\t\t$current[ $f[$i][$j] ] +=\n\t\t\t\t$d[$i][$j] * scalar(@{$n[$i][$j]});\n\t\t}\n\t}\n\treturn ($current[1] - $current[-1]) / 2;\n}\n\nprintf \"R = %.6f\\n\", 2 / iter();\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">resistormesh</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">ni</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">nj</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ai</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">aj</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">bi</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">bj</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ni</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">nj</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">c</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">A</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">B</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">ni</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">nj</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">nj</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">j</span><span style=\"color: #000080;font-style:italic;\">--1</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">ai</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">aj</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">A</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">ni</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">;</span> <span style=\"color: #000000;\">A</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">nj</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">;</span> <span style=\"color: #000000;\">A</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">nj</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">nj</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">;</span> <span style=\"color: #000000;\">A</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">;</span> <span style=\"color: #000000;\">A</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">A</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">c</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">bi</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">nj</span> <span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">bj</span>\n <span style=\"color: #000000;\">B</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">A</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">inverse</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">A</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">B</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">matrix_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">A</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">B</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">B</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Resistance = %.13f ohms\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">resistormesh</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">))</span>\n<!--\n","language":"Phix"},{"code":"DIFF_THRESHOLD = 1e-40\n\nclass Fixed:\n FREE = 0\n A = 1\n B = 2\n\nclass Node:\n __slots__ = [\"voltage\", \"fixed\"]\n def __init__(self, v=0.0, f=Fixed.FREE):\n self.voltage = v\n self.fixed = f\n\ndef set_boundary(m):\n m[1][1] = Node( 1.0, Fixed.A)\n m[6][7] = Node(-1.0, Fixed.B)\n\ndef calc_difference(m, d):\n h = len(m)\n w = len(m[0])\n total = 0.0\n\n for i in xrange(h):\n for j in xrange(w):\n v = 0.0\n n = 0\n if i != 0: v += m[i-1][j].voltage; n += 1\n if j != 0: v += m[i][j-1].voltage; n += 1\n if i < h-1: v += m[i+1][j].voltage; n += 1\n if j < w-1: v += m[i][j+1].voltage; n += 1\n v = m[i][j].voltage - v / n\n\n d[i][j].voltage = v\n if m[i][j].fixed == Fixed.FREE:\n total += v ** 2\n return total\n\ndef iter(m):\n h = len(m)\n w = len(m[0])\n difference = [[Node() for j in xrange(w)] for i in xrange(h)]\n\n while True:\n set_boundary(m) # Enforce boundary conditions.\n if calc_difference(m, difference) < DIFF_THRESHOLD:\n break\n for i, di in enumerate(difference):\n for j, dij in enumerate(di):\n m[i][j].voltage -= dij.voltage\n\n cur = [0.0] * 3\n for i, di in enumerate(difference):\n for j, dij in enumerate(di):\n cur[m[i][j].fixed] += (dij.voltage *\n (bool(i) + bool(j) + (i < h-1) + (j < w-1)))\n\n return (cur[Fixed.A] - cur[Fixed.B]) / 2.0\n\ndef main():\n w = h = 10\n mesh = [[Node() for j in xrange(w)] for i in xrange(h)]\n print \"R = %.16f\" % (2 / iter(mesh))\n\nmain()\n","language":"Python"},{"code":"import sys, copy\nfrom fractions import Fraction\n\ndef gauss(a, b):\n n, p = len(a), len(a[0])\n for i in range(n):\n t = abs(a[i][i])\n k = i\n for j in range(i + 1, n):\n if abs(a[j][i]) > t:\n t = abs(a[j][i])\n k = j\n if k != i:\n for j in range(i, n):\n a[i][j], a[k][j] = a[k][j], a[i][j]\n b[i], b[k] = b[k], b[i]\n t = 1/a[i][i]\n for j in range(i + 1, n):\n a[i][j] *= t\n b[i] *= t\n for j in range(i + 1, n):\n t = a[j][i]\n for k in range(i + 1, n):\n a[j][k] -= t*a[i][k]\n b[j] -= t * b[i]\n for i in range(n - 1, -1, -1):\n for j in range(i):\n b[j] -= a[j][i]*b[i]\n return b\n\ndef resistor_grid(p, q, ai, aj, bi, bj):\n n = p*q\n I = Fraction(1, 1)\n v = [0*I]*n\n a = [copy.copy(v) for i in range(n)]\n for i in range(p):\n for j in range(q):\n k = i*q + j\n if i == ai and j == aj:\n a[k][k] = I\n else:\n c = 0\n if i + 1 < p:\n c += 1\n a[k][k + q] = -1\n if i >= 1:\n c += 1\n a[k][k - q] = -1\n if j + 1 < q:\n c += 1\n a[k][k + 1] = -1\n if j >= 1:\n c += 1\n a[k][k - 1] = -1\n a[k][k] = c*I\n b = [0*I]*n\n k = bi*q + bj\n b[k] = 1\n return gauss(a, b)[k]\n\ndef main(arg):\n r = resistor_grid(int(arg[0]), int(arg[1]), int(arg[2]), int(arg[3]), int(arg[4]), int(arg[5]))\n print(r)\n print(float(r))\n\nmain(sys.argv[1:])\n\n# Output:\n# python grid.py 10 10 1 1 7 6\n# 455859137025721/283319837425200\n# 1.6089912417307297\n","language":"Python"},{"code":"#lang racket\n(require racket/flonum)\n\n(define-syntax-rule (fi c t f) (if c f t))\n\n(define (neighbours w h)\n (define h-1 (sub1 h))\n (define w-1 (sub1 w))\n (lambda (i j)\n (+ (fi (zero? i) 1 0)\n (fi (zero? j) 1 0)\n (if (< i h-1) 1 0)\n (if (< j w-1) 1 0))))\n\n(define (mesh-R probes w h)\n (define h-1 (sub1 h))\n (define w-1 (sub1 w))\n\n (define-syntax-rule (v2ref v r c) ; 2D vector ref\n (flvector-ref v (+ (* r w) c)))\n\n (define w*h (* w h))\n\n (define (alloc2 (v 0.))\n (make-flvector w*h v))\n\n (define nghbrs (neighbours w h))\n\n (match-define `((,fix+r ,fix+c) (,fix-r ,fix-c)) probes)\n (define fix+idx (+ fix+c (* fix+r w)))\n (define fix-idx (+ fix-c (* fix-r w)))\n (define fix-val\n (match-lambda**\n [((== fix+idx) _) 1.]\n [((== fix-idx) _) -1.]\n [(_ v) v]))\n\n (define (calc-diff m)\n (define d\n (for*/flvector #:length w*h ((i (in-range h)) (j (in-range w)))\n (define v\n (+ (fi (zero? i) (v2ref m (- i 1) j) 0)\n (fi (zero? j) (v2ref m i (- j 1)) 0)\n (if (< i h-1) (v2ref m (+ i 1) j) 0)\n (if (< j w-1) (v2ref m i (+ j 1)) 0)))\n (- (v2ref m i j) (/ v (nghbrs i j)))))\n\n (define Δ\n (for/sum ((i (in-naturals)) (d.v (in-flvector d)) #:when (= (fix-val i 0.) 0.))\n (sqr d.v)))\n\n (values d Δ))\n\n (define final-d\n (let loop ((m (alloc2)) (d (alloc2)))\n (define m+ ; do this first will get the boundaries on\n (for/flvector #:length w*h ((j (in-naturals)) (m.v (in-flvector m)) (d.v (in-flvector d)))\n (fix-val j (- m.v d.v))))\n\n (define-values (d- Δ) (calc-diff m+))\n\n (if (< Δ 1e-24) d (loop m+ d-))))\n\n (/ 2\n (/ (- (* (v2ref final-d fix+r fix+c) (nghbrs fix+r fix+c))\n (* (v2ref final-d fix-r fix-c) (nghbrs fix-r fix-c)))\n 2)))\n\n(module+ main\n (printf \"R = ~a~%\" (mesh-R '((1 1) (6 7)) 10 10)))\n","language":"Racket"},{"code":"my $*TOLERANCE = 1e-12;\n\nsub set-boundary(@mesh,@p1,@p2) {\n @mesh[ @p1[0] ; @p1[1] ] = 1;\n @mesh[ @p2[0] ; @p2[1] ] = -1;\n}\n\nsub solve(@p1, @p2, Int \\w, Int \\h) {\n my @d = [0 xx w] xx h;\n my @V = [0 xx w] xx h;\n my @fixed = [0 xx w] xx h;\n set-boundary(@fixed,@p1,@p2);\n\n loop {\n set-boundary(@V,@p1,@p2);\n my $diff = 0;\n for (flat ^h X ^w) -> \\i, \\j {\n my @neighbors = (@V[i-1;j], @V[i;j-1], @V[i+1;j], @V[i;j+1]).grep: *.defined;\n @d[i;j] = my \\v = @V[i;j] - @neighbors.sum / @neighbors;\n $diff += v × v unless @fixed[i;j];\n }\n last if $diff =~= 0;\n\n for (flat ^h X ^w) -> \\i, \\j {\n @V[i;j] -= @d[i;j];\n }\n }\n\n my @current;\n for (flat ^h X ^w) -> \\i, \\j {\n @current[ @fixed[i;j]+1 ] += @d[i;j] × (?i + ?j + (i < h-1) + (j < w-1) );\n }\n (@current[2] - @current[0]) / 2\n}\n\nsay 2 / solve (1,1), (6,7), 10, 10;\n","language":"Raku"},{"code":"/*REXX program calculates the resistance between any two points on a resistor grid.*/\nif 2=='f2'x then ohms = \"ohms\" /*EBCDIC machine? Then use 'ohms'. */\n else ohms = \"Ω\" /* ASCII \" \" \" Greek Ω.*/\nparse arg high wide Arow Acol Brow Bcol digs . /*obtain optional arguments from the CL*/\nif high=='' | high==\",\" then high= 10 /*Not specified? Then use the default.*/\nif wide=='' | wide==\",\" then wide= 10 /* \" \" \" \" \" \" */\nif Arow=='' | Arow==\",\" then Arow= 2 /* \" \" \" \" \" \" */\nif Acol=='' | Acol==\",\" then Acol= 2 /* \" \" \" \" \" \" */\nif Brow=='' | Brow==\",\" then Brow= 7 /* \" \" \" \" \" \" */\nif Bcol=='' | Bcol==\",\" then Bcol= 8 /* \" \" \" \" \" \" */\nif digs=='' | digs==\",\" then digs= 20 /* \" \" \" \" \" \" */\nnumeric digits digs /*use moderate decimal digs (precision)*/\nminVal = 1'e-' || (digs*2) /*calculate the threshold minimal value*/\nsay ' minimum value is ' format(minVal,,,,0) \" using \" digs ' decimal digits'; say\nsay ' resistor mesh size is: ' wide \"wide, \" high 'high' ; say\nsay ' point A is at (row,col): ' Arow\",\" Acol\nsay ' point B is at (row,col): ' Brow\",\" Bcol\n@.=0; cell.= 1\n do until $<=minVal; v= 0\n @.Arow.Acol= 1 ; cell.Arow.Acol= 0\n @.Brow.Bcol= '-1' ; cell.Brow.Bcol= 0\n $=0\n do i=1 for high; im= i-1; ip= i+1\n do j=1 for wide; n= 0; v= 0\n if i\\==1 then do; v= v + @.im.j; n= n+1; end\n if j\\==1 then do; jm= j-1; v= v + @.i.jm; n= n+1; end\n if i<high then do; v= v + @.ip.j; n= n+1; end\n if j<wide then do; jp= j+1; v= v + @.i.jp; n= n+1; end\n v= @.i.j - v / n; #.i.j= v; if cell.i.j then $= $ + v*v\n end /*j*/\n end /*i*/\n do r=1 for High\n do c=1 for Wide; @.r.c= @.r.c - #.r.c\n end /*c*/\n end /*r*/\n end /*until*/\nsay\nAcur= #.Arow.Acol * sides(Arow, Acol)\nBcur= #.Brow.Bcol * sides(Brow, Bcol)\nsay ' resistance between point A and point B is: ' 4 / (Acur - Bcur) ohms\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nsides: parse arg row,col; z=0; if row\\==1 & row\\==high then z= z+2; else z= z+1\n if col\\==1 & col\\==wide then z= z+2; else z= z+1\n return z\n","language":"REXX"},{"code":"var (w, h) = (10, 10)\n\nvar v = h.of { w.of(0) } # voltage\nvar f = h.of { w.of(0) } # fixed condition\nvar d = h.of { w.of(0) } # diff\nvar n = [] # neighbors\n\nfor i in ^h {\n for j in (1 ..^ w ) { n[i][j] := [] << [i, j-1] }\n for j in (0 ..^ w-1) { n[i][j] := [] << [i, j+1] }\n}\n\nfor j in ^w {\n for i in (1 ..^ h ) { n[i][j] := [] << [i-1, j] }\n for i in (0 ..^ h-1) { n[i][j] := [] << [i+1, j] }\n}\n\nfunc set_boundary {\n f[1][1] = 1; f[6][7] = -1;\n v[1][1] = 1; v[6][7] = -1;\n}\n\nfunc calc_diff {\n var total_diff = 0\n for i,j in (^h ~X ^w) {\n var w = n[i][j].map { |a| v.dig(a...) }.sum\n d[i][j] = (w = (v[i][j] - w/n[i][j].len))\n f[i][j] || (total_diff += w*w)\n }\n total_diff\n}\n\nfunc iter {\n var diff = 1\n while (diff > 1e-24) {\n set_boundary()\n diff = calc_diff()\n for i,j in (^h ~X ^w) {\n v[i][j] -= d[i][j]\n }\n }\n\n var current = 3.of(0)\n for i,j in (^h ~X ^w) {\n current[ f[i][j] ] += (d[i][j] * n[i][j].len)\n }\n (current[1] - current[-1]) / 2\n}\n\nsay \"R = #{2 / iter()}\"\n","language":"Sidef"},{"code":"package require Tcl 8.6; # Or 8.5 with the TclOO package\n\n# This code is structured as a class with a little trivial DSL parser\n# so it is easy to change what problem is being worked on.\noo::class create ResistorMesh {\n variable forcePoints V fixed w h\n\n constructor {boundaryConditions} {\n\tforeach {op condition} $boundaryConditions {\n\t switch $op {\n\t\tsize {\n\t\t lassign $condition w h\n\t\t set fixed [lrepeat $h [lrepeat $w 0]]\n\t\t set V [lrepeat $h [lrepeat $w 0.0]]\n\t\t}\n\t\tfixed {\n\t\t lassign $condition j i v\n\t\t lset fixed $i $j [incr ctr]\n\t\t lappend forcePoints $j $i $v\n\t\t}\n\t }\n\t}\n }\n\n method CalculateDifferences {*dV} {\n\tupvar 1 ${*dV} dV\n\tset error 0.0\n\tfor {set i 0} {$i < $h} {incr i} {\n\t for {set j 0} {$j < $w} {incr j} {\n\t\tset v 0.0\n\t\tset n 0\n\t\tif {$i} {\n\t\t set v [expr {$v + [lindex $V [expr {$i-1}] $j]}]\n\t\t incr n\n\t\t}\n\t\tif {$j} {\n\t\t set v [expr {$v + [lindex $V $i [expr {$j-1}]]}]\n\t\t incr n\n\t\t}\n\t\tif {$i+1 < $h} {\n\t\t set v [expr {$v + [lindex $V [expr {$i+1}] $j]}]\n\t\t incr n\n\t\t}\n\t\tif {$j+1 < $w} {\n\t\t set v [expr {$v + [lindex $V $i [expr {$j+1}]]}]\n\t\t incr n\n\t\t}\n\t\tlset dV $i $j [set v [expr {[lindex $V $i $j] - $v/$n}]]\n\t\tif {![lindex $fixed $i $j]} {\n\t\t set error [expr {$error + $v**2}]\n\t\t}\n\t }\n\t}\n\treturn $error\n }\n\n method FindCurrentFixpoint {epsilon} {\n\tset dV [lrepeat $h [lrepeat $w 0.0]]\n\tset current {0.0 0.0 0.0}\n\twhile true {\n\t # Enforce the boundary conditions\n\t foreach {j i v} $forcePoints {\n\t\tlset V $i $j $v\n\t }\n\t # Compute the differences and the error\n\t set error [my CalculateDifferences dV]\n\t # Apply the differences\n\t for {set i 0} {$i < $h} {incr i} {\n\t\tfor {set j 0} {$j < $w} {incr j} {\n\t\t lset V $i $j [expr {\n\t\t\t[lindex $V $i $j] - [lindex $dV $i $j]}]\n\t\t}\n\t }\n\t # Done if the error is small enough\n\t if {$error < $epsilon} break\n\t}\n\t# Compute the currents from the error\n\tfor {set i 0} {$i < $h} {incr i} {\n\t for {set j 0} {$j < $w} {incr j} {\n\t\tlset current [lindex $fixed $i $j] [expr {\n\t\t [lindex $current [lindex $fixed $i $j]] +\n\t\t [lindex $dV $i $j] * (!!$i+!!$j+($i<$h-1)+($j<$w-1))}]\n\t }\n\t}\n\t# Compute the actual current flowing between source and sink\n\treturn [expr {([lindex $current 1] - [lindex $current 2]) / 2.0}]\n }\n\n # Public entry point\n method solveForResistance {{epsilon 1e-24}} {\n\tset voltageDifference [expr {\n\t [lindex $forcePoints 2] - [lindex $forcePoints 5]}]\n\texpr {$voltageDifference / [my FindCurrentFixpoint $epsilon]}\n }\n}\n","language":"Tcl"},{"code":"ResistorMesh create mesh {\n size {10 10}\n fixed {1 1 1.0}\n fixed {6 7 -1.0}\n}\nputs [format \"R = %.12g\" [mesh solveForResistance]]\n","language":"Tcl"},{"code":"class Node {\n construct new(v, fixed) {\n _v = v\n _fixed = fixed\n }\n\n v { _v }\n v=(value) { _v = value }\n\n fixed { _fixed }\n fixed=(value) { _fixed = value }\n}\n\nvar setBoundary = Fn.new { |m|\n m[1][1].v = 1\n m[1][1].fixed = 1\n m[6][7].v = -1\n m[6][7].fixed = -1\n}\n\nvar calcDiff = Fn.new { |m, d, w, h|\n var total = 0\n for (i in 0...h) {\n for (j in 0...w) {\n var v = 0\n var n = 0\n if (i > 0) {\n v = v + m[i-1][j].v\n n = n + 1\n }\n if (j > 0) {\n v = v + m[i][j-1].v\n n = n + 1\n }\n if (i + 1 < h) {\n v = v + m[i+1][j].v\n n = n + 1\n }\n if (j + 1 < w) {\n v = v + m[i][j+1].v\n n = n + 1\n }\n v = m[i][j].v - v/n\n d[i][j].v = v\n if (m[i][j].fixed == 0) total = total + v*v\n }\n }\n return total\n}\n\nvar iter = Fn.new { |m, w, h|\n var d = List.filled(h, null)\n for (i in 0...h) {\n d[i] = List.filled(w, null)\n for (j in 0...w) d[i][j] = Node.new(0, 0)\n }\n var cur = [0] * 3\n var diff = 1e10\n while (diff > 1e-24) {\n setBoundary.call(m)\n diff = calcDiff.call(m, d, w, h)\n for (i in 0...h) {\n for (j in 0...w) m[i][j].v = m[i][j].v - d[i][j].v\n }\n }\n for (i in 0...h) {\n for (j in 0...w) {\n var k = 0\n if (i != 0) k = k + 1\n if (j != 0) k = k + 1\n if (i < h - 1) k = k + 1\n if (j < w - 1) k = k + 1\n cur[m[i][j].fixed + 1] = cur[m[i][j].fixed + 1] + d[i][j].v * k\n }\n }\n return (cur[2] - cur[0]) / 2\n}\n\nvar S = 10\nvar mesh = List.filled(S, null)\nfor (i in 0...S) {\n mesh[i] = List.filled(S, null)\n for (j in 0...S) mesh[i][j] = Node.new(0, 0)\n}\nvar r = 2 / iter.call(mesh, S, S)\nSystem.print(\"R = %(r)\")\n","language":"Wren"},{"code":"code real RlRes=46, RlOut=48;\ndef S = 10;\n\nproc SetBoundary(MV, MF);\nreal MV; int MF;\n[MF(1,1):= 1; MV(1,1):= 1.0;\n MF(6,7):= -1; MV(6,7):= -1.0;\n];\n\nfunc real CalcDiff(MV, MF, DV, W, H);\nreal MV; int MF; real DV; int W, H;\nint I, J, N; real V, Total;\n[Total:= 0.0;\nfor I:= 0 to H-1 do\n for J:= 0 to W-1 do\n [V:= 0.0; N:= 0;\n if I then [V:= V + MV(I-1,J); N:= N+1];\n if J then [V:= V + MV(I,J-1); N:= N+1];\n if I+1 < H then [V:= V + MV(I+1,J); N:= N+1];\n if J+1 < W then [V:= V + MV(I,J+1); N:= N+1];\n V:= MV(I,J) - V/float(N); DV(I,J):= V;\n if MF(I,J) = 0 then Total:= Total + V*V;\n ];\nreturn Total;\n];\n\nfunc real Iter(MV, MF, W, H);\nreal MV; int MF, W, H;\nreal DV, Diff, Cur; int I, J;\n[DV:= RlRes(W); for I:= 0 to W-1 do DV(I):= RlRes(H);\nDiff:= 1E10;\nCur:= [0.0, 0.0, 0.0];\nwhile Diff > 1E-24 do\n [SetBoundary(MV, MF);\n Diff:= CalcDiff(MV, MF, DV, W, H);\n for I:= 0 to H-1 do\n for J:= 0 to W-1 do\n MV(I,J):= MV(I,J) - DV(I,J);\n ];\nfor I:= 0 to H-1 do\n for J:= 0 to W-1 do\n Cur(MF(I,J)+1):= Cur(MF(I,J)+1) +\n DV(I,J) * float(-(I>0) - (J>0) - (I<H-1) - (J<W-1));\n \\middle=4; side=3; corner=2\nreturn (Cur(2)-Cur(0))/2.0;\n];\n\nreal MeshV(S,S); int MeshF(S,S);\nRlOut(0, 2.0 / Iter(MeshV, MeshF, S, S))\n","language":"XPL0"},{"code":" N=10\n NN=N*N\n DIM A(NN,NN+1)\n\n NODE=0\n FOR ROW=1 TO N\n FOR COL=1 TO N\n NODE=NODE+1\n IF ROW>1 THEN\n A(NODE,NODE)=A(NODE,NODE)+1\n A(NODE,NODE-N)=-1\n END IF\n IF ROW<N THEN\n A(NODE,NODE)=A(NODE,NODE)+1\n A(NODE,NODE+N)=-1\n END IF\n IF COL>1 THEN\n A(NODE,NODE)=A(NODE,NODE)+1\n A(NODE,NODE-1)=-1\n END IF\n IF COL<N THEN\n A(NODE,NODE)=A(NODE,NODE)+1\n A(NODE,NODE+1)=-1\n END IF\n NEXT\n NEXT\n\n AR=2 : AC=2 : A=AC+N*(AR-1)\n BR=7 : BC=8 : B=BC+N*(BR-1)\n A(A,NN+1)=-1\n A(B,NN+1)=1\n\n PRINT \"Nodes \",A,B\n\n // solve linear system\n // using Gauss-Seidel method\n // with pivoting\n R=NN\n\n FOR J=1 TO R\n FOR I=J TO R\n IF A(I,J)<>0 BREAK\n NEXT\n IF I=R+1 THEN\n PRINT \"No solution!\"\n END\n END IF\n FOR K=1 TO R+1\n T = A(J,K)\n A(J,K) = A(I,K)\n A(I,K) = T\n NEXT\n Y=1/A(J,J)\n FOR K=1 TO R+1\n A(J,K)=Y*A(J,K)\n NEXT\n FOR I=1 TO R\n IF I<>J THEN\n Y=-A(I,J)\n FOR K=1 TO R+1\n A(I,K)=A(I,K)+Y*A(J,K)\n NEXT\n END IF\n NEXT\n NEXT\n PRINT \"Resistence = \"; : PRINT ABS(A(A,NN+1)-A(B,NN+1)) USING \"%1.13f\"\n","language":"Yabasic"},{"code":"var [const] GSL=Import(\"zklGSL\");\t// libGSL (GNU Scientific Library)\nfcn onGrid(i,j,p,q){ ((0<=i<p) and (0<=j<q)) }\nfcn gridResistor(p,q, ai,aj, bi,bj){\n n,A := p*q, GSL.Matrix(n,n); // zero filled\n foreach i,j in (p,q){\n k:=i*q + j;\n if(i==ai and j==aj) A[k,k]=1;\n else{\n\t c:=0;\n\t if(onGrid(i+1,j, p,q)){ c+=1; A[k, k+q]=-1 }\n\t if(onGrid(i-1,j, p,q)){ c+=1; A[k, k-q]=-1 }\n\t if(onGrid(i, j+1, p,q)){ c+=1; A[k, k+1]=-1 }\n\t if(onGrid(i, j-1, p,q)){ c+=1; A[k, k-1]=-1 }\n\t A[k,k]=c;\n }\n }\n b:=GSL.Vector(n); // zero filled\n b[k:=bi*q + bj]=1;\n A.AxEQb(b)[k];\n}\n","language":"Zkl"},{"code":"gridResistor(10,10, 1,1, 7,6).println();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Electronics\\nfrom: http://rosettacode.org/wiki/Resistor_mesh\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"[[image:resistor-mesh.svg|300px||right]]\\n\\n;Task:\\nGiven <big> 10×10 </big> grid nodes (as shown in the image) interconnected by <big> 1Ω </big> resistors as shown,\\n<br>find the resistance between points '''A''' and '''B'''.\\n\\n\\n;See also:\\n* (humor, nerd sniping) [http://xkcd.com/356/ xkcd.com cartoon] (you can solve that for extra credits)\\n* [https://www.paulinternet.nl/?page=resistors An article on how to calculate this and an implementation in Mathematica]\\n<br><br>\\n\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"-V DIFF_THRESHOLD = 1e-40\\n\\nT.enum Fixed\\n FREE\\n A\\n B\\n\\nT Node\\n Float voltage\\n Fixed fixed\\n F (v = 0.0, f = Fixed.FREE)\\n .voltage = v\\n .fixed = f\\n\\nF set_boundary(&m)\\n m[1][1] = Node( 1.0, Fixed.A)\\n m[6][7] = Node(-1.0, Fixed.B)\\n\\nF calc_difference(m, &d)\\n V h = m.len\\n V w = m[0].len\\n V total = 0.0\\n\\n L(i) 0 .< h\\n L(j) 0 .< w\\n V v = 0.0\\n V n = 0\\n I i != 0 {v += m[i - 1][j].voltage; n++}\\n I j != 0 {v += m[i][j - 1].voltage; n++}\\n I i < h-1 {v += m[i + 1][j].voltage; n++}\\n I j < w-1 {v += m[i][j + 1].voltage; n++}\\n v = m[i][j].voltage - v / n\\n d[i][j].voltage = v\\n I m[i][j].fixed == FREE\\n total += v ^ 2\\n R total\\n\\nF iter(&m)\\n V h = m.len\\n V w = m[0].len\\n V difference = [[Node()] * w] * h\\n\\n L\\n set_boundary(&m)\\n I calc_difference(m, &difference) < :DIFF_THRESHOLD\\n L.break\\n L(di) difference\\n V i = L.index\\n L(dij) di\\n V j = L.index\\n m[i][j].voltage -= dij.voltage\\n\\n V cur = [0.0] * 3\\n L(di) difference\\n V i = L.index\\n L(dij) di\\n V j = L.index\\n cur[Int(m[i][j].fixed)] += (dij.voltage *\\n (Int(i != 0) + Int(j != 0) + (i < h - 1) + (j < w - 1)))\\n\\n R (cur[Int(Fixed.A)] - cur[Int(Fixed.B)]) / 2.0\\n\\nV w = 10\\nV h = 10\\nV mesh = [[Node()] * w] * h\\nprint(‘R = #.16’.format(2 / iter(&mesh)))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\nprocedure ResistMesh is\\n H, W : constant Positive := 10;\\n rowA, colA : constant Positive := 2; -- row/col indexed from 1\\n rowB : constant Positive := 7;\\n colB : constant Positive := 8;\\n\\n type Ntype is (A, B, Free);\\n type Vtype is digits 15;\\n type Node is record\\n volt : Vtype := 0.0;\\n name : Ntype := Free;\\n end record;\\n type NodeMesh is array (Positive range <>, Positive range <>) of Node;\\n package IIO is new Ada.Text_IO.Float_IO (Vtype);\\n mesh, dmesh : NodeMesh (1 .. H, 1 .. W);\\n curA, curB, diff : Vtype;\\n\\n procedure set_AB (mesh : in out NodeMesh) is begin\\n mesh (rowA, colA).volt := 1.0; mesh (rowA, colA).name := A;\\n mesh (rowB, colB).volt := -1.0; mesh (rowB, colB).name := B;\\n end set_AB;\\n\\n function sides (i : Positive; j : Positive) return Vtype is\\n s : Integer := 0;\\n begin\\n if i /= 1 and i /= H then s := s + 2; else s := s + 1; end if;\\n if j /= 1 and j /= W then s := s + 2; else s := s + 1; end if;\\n return Vtype (s);\\n end sides;\\n\\n procedure calc_diff (mesh : NodeMesh; dmesh : out NodeMesh;\\n total : out Vtype) is\\n n : Natural;\\n v : Vtype := 0.0;\\n begin\\n total := 0.0;\\n for i in Positive range 1 .. H loop\\n for j in Positive range 1 .. W loop\\n n := 0; v := 0.0;\\n if i /= 1 then v := v + mesh (i - 1, j).volt; n := n + 1; end if;\\n if j /= 1 then v := v + mesh (i, j - 1).volt; n := n + 1; end if;\\n if i < H then v := v + mesh (i + 1, j).volt; n := n + 1; end if;\\n if j < W then v := v + mesh (i, j + 1).volt; n := n + 1; end if;\\n v := mesh (i, j).volt - v / Vtype (n);\\n dmesh (i, j).volt := v;\\n if mesh (i, j).name = Free then total := total + v ** 2; end if;\\n end loop;\\n end loop;\\n end calc_diff;\\n\\nbegin\\n\\n loop\\n set_AB (mesh);\\n calc_diff (mesh, dmesh, diff);\\n exit when diff < 1.0e-40;\\n for i in Positive range 1 .. H loop\\n for j in Positive range 1 .. W loop\\n mesh (i, j).volt := mesh (i, j).volt - dmesh (i, j).volt;\\n end loop;\\n end loop;\\n end loop;\\n\\n curA := dmesh (rowA, colA).volt * sides (rowA, colA);\\n curB := dmesh (rowB, colB).volt * sides (rowB, colB);\\n diff := 4.0 / (curA - curB);\\n IIO.Put (diff, Exp => 0); New_Line;\\nend ResistMesh;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \" INSTALL @lib$+\\\"ARRAYLIB\\\"\\n *FLOAT 64\\n @% = &F0F\\n\\n PRINT \\\"Resistance = \\\"; FNresistormesh(10, 10, 1, 1, 7, 6) \\\" ohms\\\"\\n END\\n\\n DEF FNresistormesh(ni%, nj%, ai%, aj%, bi%, bj%)\\n LOCAL c%, i%, j%, k%, n%, A(), B()\\n n% = ni% * nj%\\n DIM A(n%-1, n%-1), B(n%-1, 0)\\n FOR i% = 0 TO ni%-1\\n FOR j% = 0 TO nj%-1\\n k% = i% * nj% + j%\\n IF i% = ai% AND j% = aj% THEN\\n A(k%, k%) = 1\\n ELSE\\n c% = 0\\n IF (i% + 1) < ni% c% += 1 : A(k%, k% + nj%) = -1\\n IF i% > 0 c% += 1 : A(k%, k% - nj%) = -1\\n IF (j% + 1) < nj% c% += 1 : A(k%, k% + 1) = -1\\n IF j% > 0 c% += 1 : A(k%, k% - 1) = -1\\n A(k%, k%) = c%\\n ENDIF\\n NEXT\\n NEXT\\n k% = bi% * nj% + bj%\\n B(k%, 0) = 1\\n PROC_invert(A())\\n B() = A().B()\\n = B(k%, 0)\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n\\n#define S 10\\ntypedef struct { double v; int fixed; } node;\\n\\n#define each(i, x) for(i = 0; i < x; i++)\\nnode **alloc2(int w, int h)\\n{\\n\\tint i;\\n\\tnode **a = calloc(1, sizeof(node*)*h + sizeof(node)*w*h);\\n\\teach(i, h) a[i] = i ? a[i-1] + w : (node*)(a + h);\\n\\treturn a;\\n}\\n\\nvoid set_boundary(node **m)\\n{\\n\\tm[1][1].fixed = 1; m[1][1].v = 1;\\n\\tm[6][7].fixed = -1; m[6][7].v = -1;\\n}\\n\\ndouble calc_diff(node **m, node **d, int w, int h)\\n{\\n\\tint i, j, n;\\n\\tdouble v, total = 0;\\n\\teach(i, h) each(j, w) {\\n\\t\\tv = 0; n = 0;\\n\\t\\tif (i) v += m[i-1][j].v, n++;\\n\\t\\tif (j) v += m[i][j-1].v, n++;\\n\\t\\tif (i+1 < h) v += m[i+1][j].v, n++;\\n\\t\\tif (j+1 < w) v += m[i][j+1].v, n++;\\n\\n\\t\\td[i][j].v = v = m[i][j].v - v / n;\\n\\t\\tif (!m[i][j].fixed) total += v * v;\\n\\t}\\n\\treturn total;\\n}\\n\\ndouble iter(node **m, int w, int h)\\n{\\n\\tnode **d = alloc2(w, h);\\n\\tint i, j;\\n\\tdouble diff = 1e10;\\n\\tdouble cur[] = {0, 0, 0};\\n\\n\\twhile (diff > 1e-24) {\\n\\t\\tset_boundary(m);\\n\\t\\tdiff = calc_diff(m, d, w, h);\\n\\t\\teach(i,h) each(j, w) m[i][j].v -= d[i][j].v;\\n\\t}\\n\\n\\teach(i, h) each(j, w)\\n\\t\\tcur[ m[i][j].fixed + 1 ] += d[i][j].v *\\n\\t\\t\\t\\t(!!i + !!j + (i < h-1) + (j < w -1));\\n\\n\\tfree(d);\\n\\treturn (cur[2] - cur[0])/2;\\n}\\n\\nint main()\\n{\\n\\tnode **mesh = alloc2(S, S);\\n\\tprintf(\\\"R = %g\\\\n\\\", 2 / iter(mesh, S, S));\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iomanip>\\n#include <iostream>\\n#include <vector>\\n\\nclass Node {\\nprivate:\\n double v;\\n int fixed;\\n\\npublic:\\n Node() : v(0.0), fixed(0) {\\n // empty\\n }\\n\\n Node(double v, int fixed) : v(v), fixed(fixed) {\\n // empty\\n }\\n\\n double getV() const {\\n return v;\\n }\\n\\n void setV(double nv) {\\n v = nv;\\n }\\n\\n int getFixed() const {\\n return fixed;\\n }\\n\\n void setFixed(int nf) {\\n fixed = nf;\\n }\\n};\\n\\nvoid setBoundary(std::vector<std::vector<Node>>& m) {\\n m[1][1].setV(1.0);\\n m[1][1].setFixed(1);\\n\\n m[6][7].setV(-1.0);\\n m[6][7].setFixed(-1);\\n}\\n\\ndouble calculateDifference(const std::vector<std::vector<Node>>& m, std::vector<std::vector<Node>>& d, const int w, const int h) {\\n double total = 0.0;\\n for (int i = 0; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n double v = 0.0;\\n int n = 0;\\n if (i > 0) {\\n v += m[i - 1][j].getV();\\n n++;\\n }\\n if (j > 0) {\\n v += m[i][j - 1].getV();\\n n++;\\n }\\n if (i + 1 < h) {\\n v += m[i + 1][j].getV();\\n n++;\\n }\\n if (j + 1 < w) {\\n v += m[i][j + 1].getV();\\n n++;\\n }\\n v = m[i][j].getV() - v / n;\\n d[i][j].setV(v);\\n if (m[i][j].getFixed() == 0) {\\n total += v * v;\\n }\\n }\\n }\\n return total;\\n}\\n\\ndouble iter(std::vector<std::vector<Node>>& m, const int w, const int h) {\\n using namespace std;\\n vector<vector<Node>> d;\\n for (int i = 0; i < h; ++i) {\\n vector<Node> t(w);\\n d.push_back(t);\\n }\\n\\n double curr[] = { 0.0, 0.0, 0.0 };\\n double diff = 1e10;\\n\\n while (diff > 1e-24) {\\n setBoundary(m);\\n diff = calculateDifference(m, d, w, h);\\n for (int i = 0; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n m[i][j].setV(m[i][j].getV() - d[i][j].getV());\\n }\\n }\\n }\\n\\n for (int i = 0; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n int k = 0;\\n if (i != 0) ++k;\\n if (j != 0) ++k;\\n if (i < h - 1) ++k;\\n if (j < w - 1) ++k;\\n curr[m[i][j].getFixed() + 1] += d[i][j].getV()*k;\\n }\\n }\\n\\n return (curr[2] - curr[0]) / 2.0;\\n}\\n\\nconst int S = 10;\\nint main() {\\n using namespace std;\\n vector<vector<Node>> mesh;\\n\\n for (int i = 0; i < S; ++i) {\\n vector<Node> t(S);\\n mesh.push_back(t);\\n }\\n\\n double r = 2.0 / iter(mesh, S, S);\\n cout << \\\"R = \\\" << setprecision(15) << r << '\\\\n';\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\n\\nnamespace ResistorMesh {\\n class Node {\\n public Node(double v, int fixed_) {\\n V = v;\\n Fixed = fixed_;\\n }\\n\\n public double V { get; set; }\\n public int Fixed { get; set; }\\n }\\n\\n class Program {\\n static void SetBoundary(List<List<Node>> m) {\\n m[1][1].V = 1.0;\\n m[1][1].Fixed = 1;\\n\\n m[6][7].V = -1.0;\\n m[6][7].Fixed = -1;\\n }\\n\\n static double CalcuateDifference(List<List<Node>> m, List<List<Node>> d, int w, int h) {\\n double total = 0.0;\\n for (int i = 0; i < h; i++) {\\n for (int j = 0; j < w; j++) {\\n double v = 0.0;\\n int n = 0;\\n if (i > 0) {\\n v += m[i - 1][j].V;\\n n++;\\n }\\n if (j > 0) {\\n v += m[i][j - 1].V;\\n n++;\\n }\\n if (i + 1 < h) {\\n v += m[i + 1][j].V;\\n n++;\\n }\\n if (j + 1 < w) {\\n v += m[i][j + 1].V;\\n n++;\\n }\\n v = m[i][j].V - v / n;\\n d[i][j].V = v;\\n if (m[i][j].Fixed == 0) {\\n total += v * v;\\n }\\n }\\n }\\n return total;\\n }\\n\\n static double Iter(List<List<Node>> m, int w, int h) {\\n List<List<Node>> d = new List<List<Node>>(h);\\n for (int i = 0; i < h; i++) {\\n List<Node> t = new List<Node>(w);\\n for (int j = 0; j < w; j++) {\\n t.Add(new Node(0.0, 0));\\n }\\n d.Add(t);\\n }\\n\\n double[] curr = new double[3];\\n double diff = 1e10;\\n\\n while (diff > 1e-24) {\\n SetBoundary(m);\\n diff = CalcuateDifference(m, d, w, h);\\n for (int i = 0; i < h; i++) {\\n for (int j = 0; j < w; j++) {\\n m[i][j].V -= d[i][j].V;\\n }\\n }\\n }\\n\\n for (int i = 0; i < h; i++) {\\n for (int j = 0; j < w; j++) {\\n int k = 0;\\n if (i != 0) k++;\\n if (j != 0) k++;\\n if (i < h - 1) k++;\\n if (j < w - 1) k++;\\n curr[m[i][j].Fixed + 1] += d[i][j].V * k;\\n }\\n }\\n\\n return (curr[2] - curr[0]) / 2.0;\\n }\\n\\n const int S = 10;\\n static void Main(string[] args) {\\n List<List<Node>> mesh = new List<List<Node>>(S);\\n for (int i = 0; i < S; i++) {\\n List<Node> t = new List<Node>(S);\\n for (int j = 0; j < S; j++) {\\n t.Add(new Node(0.0, 0));\\n }\\n mesh.Add(t);\\n }\\n\\n double r = 2.0 / Iter(mesh, S, S);\\n Console.WriteLine(\\\"R = {0:F15}\\\", r);\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"import std.stdio, std.traits;\\n\\nenum Node.FP differenceThreshold = 1e-40;\\n\\nstruct Node {\\n alias FP = real;\\n enum Kind : size_t { free, A, B }\\n\\n FP voltage = 0.0;\\n\\n /*const*/ private Kind kind = Kind.free;\\n // Remove kindGet once kind is const.\\n @property Kind kindGet() const pure nothrow @nogc {return kind; }\\n}\\n\\nNode.FP iter(size_t w, size_t h)(ref Node[w][h] m) pure nothrow @nogc {\\n static void enforceBoundaryConditions(ref Node[w][h] m)\\n pure nothrow @nogc {\\n m[1][1].voltage = 1.0;\\n m[6][7].voltage = -1.0;\\n }\\n\\n static Node.FP calcDifference(in ref Node[w][h] m,\\n ref Node[w][h] d) pure nothrow @nogc {\\n Node.FP total = 0.0;\\n\\n foreach (immutable i; 0 .. h) {\\n foreach (immutable j; 0 .. w) {\\n Node.FP v = 0.0;\\n {\\n size_t n = 0;\\n if (i != 0) { v += m[i - 1][j].voltage; n++; }\\n if (j != 0) { v += m[i][j - 1].voltage; n++; }\\n if (i < h - 1) { v += m[i + 1][j].voltage; n++; }\\n if (j < w - 1) { v += m[i][j + 1].voltage; n++; }\\n v = m[i][j].voltage - v / n;\\n }\\n\\n d[i][j].voltage = v;\\n if (m[i][j].kindGet == Node.Kind.free)\\n total += v ^^ 2;\\n }\\n }\\n\\n return total;\\n }\\n\\n Node[w][h] difference;\\n\\n while (true) {\\n enforceBoundaryConditions(m);\\n if (calcDifference(m, difference) < differenceThreshold)\\n break;\\n foreach (immutable i, const di; difference)\\n foreach (immutable j, const ref dij; di)\\n m[i][j].voltage -= dij.voltage;\\n }\\n\\n Node.FP[EnumMembers!(Node.Kind).length] cur = 0.0;\\n foreach (immutable i, const di; difference)\\n foreach (immutable j, const ref dij; di)\\n cur[m[i][j].kindGet] += dij.voltage *\\n (!!i + !!j + (i < h-1) + (j < w-1));\\n\\n return (cur[Node.Kind.A] - cur[Node.Kind.B]) / 2.0;\\n}\\n\\nvoid main() {\\n enum size_t w = 10,\\n h = w;\\n Node[w][h] mesh;\\n\\n // Set A and B Nodes.\\n mesh[1][1] = Node( 1.0, Node.Kind.A);\\n mesh[6][7] = Node(-1.0, Node.Kind.B);\\n\\n writefln(\\\"R = %.19f\\\", 2 / mesh.iter);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \" PROGRAM RESISTENCE_MESH\\n\\n !$BASE=1\\n\\n !$DYNAMIC\\n DIM A[0,0]\\n\\n BEGIN\\n\\n N=10\\n NN=N*N\\n !$DIM A[NN,NN+1]\\n\\n PRINT(CHR$(12);) !CLS\\n ! generate matrix data\\n NODE=0\\n FOR ROW=1 TO N DO\\n FOR COL=1 TO N DO\\n NODE=NODE+1\\n IF ROW>1 THEN\\n A[NODE,NODE]=A[NODE,NODE]+1\\n A[NODE,NODE-N]=-1\\n END IF\\n IF ROW<N THEN\\n A[NODE,NODE]=A[NODE,NODE]+1\\n A[NODE,NODE+N]=-1\\n END IF\\n IF COL>1 THEN\\n A[NODE,NODE]=A[NODE,NODE]+1\\n A[NODE,NODE-1]=-1\\n END IF\\n IF COL<N THEN\\n A[NODE,NODE]=A[NODE,NODE]+1\\n A[NODE,NODE+1]=-1\\n END IF\\n END FOR\\n END FOR\\n\\n AR=2 AC=2 A=AC+N*(AR-1)\\n BR=7 BC=8 B=BC+N*(BR-1)\\n A[A,NN+1]=-1\\n A[B,NN+1]=1\\n\\n PRINT(\\\"Nodes \\\";A,B)\\n\\n ! solve linear system\\n ! using Gauss-Seidel method\\n ! with pivoting\\n R=NN\\n\\n FOR J=1 TO R DO\\n FOR I=J TO R DO\\n EXIT IF A[I,J]<>0\\n END FOR\\n IF I=R+1 THEN\\n PRINT(\\\"No solution!\\\")\\n !$STOP\\n END IF\\n FOR K=1 TO R+1 DO\\n SWAP(A[J,K],A[I,K])\\n END FOR\\n Y=1/A[J,J]\\n FOR K=1 TO R+1 DO\\n A[J,K]=Y*A[J,K]\\n END FOR\\n FOR I=1 TO R DO\\n IF I<>J THEN\\n Y=-A[I,J]\\n FOR K=1 TO R+1 DO\\n A[I,K]=A[I,K]+Y*A[J,K]\\n END FOR\\n END IF\\n END FOR\\n END FOR\\n PRINT(\\\"Resistence=\\\";ABS(A[A,NN+1]-A[B,NN+1]))\\n END PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \">load incidence;\\n>{u,r}=solvePotentialX(makeRectangleX(10,10),12,68); r,\\n 1.60899124173\\n\",\n \"language\": \"Euler\"\n },\n {\n \"code\": \"function makeRectangleX (n:index,m:index)\\n## Make the incidence matrix of a rectangle grid in compact form.\\n## see: makeRectangleIncidence\\n\\tK=zeros(n*(m-1)+m*(n-1),3);\\n\\tk=1;\\n\\tfor i=1 to n;\\n\\t\\tfor j=1 to m-1;\\n\\t\\tK[k,1]=(i-1)*m+j; K[k,2]=(i-1)*m+j+1; K[k,3]=1;\\n\\t\\tk=k+1;\\n\\t\\tend;\\n\\tend;\\n\\tfor i=1 to n-1;\\n\\t\\tfor j=1 to m;\\n\\t\\tK[k,1]=(i-1)*m+j; K[k,2]=i*m+j; K[k,3]=1;\\n\\t\\tk=k+1;\\n\\t\\tend;\\n\\tend;\\n\\tH=cpxzeros([n*m,n*m]);\\n\\tH=cpxset(H,K);\\n\\tH=cpxset(H,K[:,[2,1,3]]);\\n\\treturn H;\\nendfunction\\n\\nfunction solvePotentialX (A:cpx, i:index ,j:index)\\n## Solve the potential problem of resistance in a graph.\\n## This functions uses the conjugate gradient method.\\n## A is a compressed incidence matrix.\\n## Return the potential u for the nodes in A,\\n## such that u[i]=1, u[j]=-1, and the flow\\n## to each knot is equal to the flow from the knot,\\n## and the flow from i to j is (u[i]-u[j])*A[i,j].\\n## see: makeIncidence\\n\\tn=size(A)[1];\\n\\tb=ones(n,1); f=-cpxmult(A,b);\\n\\th=1:n; B=cpxset(A,h'|h'|f);\\n\\tB=cpxset(B,i|h'|0);\\n\\tB=cpxset(B,[i,i,1]);\\n\\tB=cpxset(B,j|h'|0);\\n\\tB=cpxset(B,[j,j,1]);\\n\\tv=zeros(n,1); v[i]=1; v[j]=-1;\\n\\tu=cpxfit(B,v);\\n\\tf=(-f[i])*u[i]-cpxmult(A,u)[i];\\n\\treturn {u,2/f}\\nendfunction\\n\",\n \"language\": \"Euler\"\n },\n {\n \"code\": \"function cgX (H:cpx, b:real column, x0:real column=none, f:index=10)\\n## Conjugate gradient method to solve Hx=b for compressed H.\\n##\\n## This is the method of choice for large, sparse matrices. In most\\n## cases, it will work well, fast, and accurate.\\n##\\n## H must be positive definite. Use cpxfit, if it is not.\\n##\\n## The accuarcy can be controlled with an additional parameter\\n## eps. The algorithm stops, when the error gets smaller then eps, or\\n## after f*n iterations, if the error gets larger. x0 is an optional\\n## start vector.\\n##\\n## H : compressed matrix (nxm)\\n## b : column vector (mx1)\\n## x0 : optional start point (mx1)\\n## f : number of steps, when the method should be restarted\\n##\\n## See: cpxfit, cg, cgXnormal\\n\\tif isvar(\\\"eps\\\") then localepsilon(eps); endif;\\n\\tn=cols(H);\\n\\tif x0==none then x=zeros(size(b));\\n\\telse; x=x0;\\n\\tendif;\\n\\tloop 1 to 10\\n\\t\\tr=b-cpxmult(H,x); p=r; fehler=r'.r;\\n\\t\\tloop 1 to f*n\\n\\t\\t\\tif sqrt(fehler)~=0 then return x; endif;\\n\\t\\t\\tHp=cpxmult(H,p);\\n\\t\\t\\ta=fehler/(p'.Hp);\\n\\t\\t\\tx=x+a*p;\\n\\t\\t\\trn=r-a*Hp;\\n\\t\\t\\tfehlerneu=rn'.rn;\\n\\t\\t\\tp=rn+fehlerneu/fehler*p;\\n\\t\\t\\tr=rn; fehler=fehlerneu;\\n\\t\\tend;\\n\\tend;\\n\\treturn x;\\nendfunction\\n\",\n \"language\": \"Euler\"\n },\n {\n \"code\": \"' version 01-07-2018\\n' compile with: fbc -s console\\n\\n#Define n 10\\n\\nDim As UInteger nn = n * n\\nDim As Double g(-nn To nn +1, -nn To nn +1)\\nDim As UInteger node, row, col\\n\\nFor row = 1 To n\\n For col = 1 To n\\n node += 1\\n If row > 1 Then\\n g(node, node) += 1\\n g(node, node - n) = -1\\n End If\\n If row < n Then\\n g(node, node) += 1\\n g(node, node + n) = -1\\n End If\\n If col > 1 Then\\n g(node, node) += 1\\n g(node, node -1) = -1\\n End If\\n If col < n Then\\n g(node, node) += 1\\n g(node, node +1) = -1\\n End If\\n Next\\nNext\\n\\nDim As UInteger ar = 2, ac = 2\\nDim As UInteger br = 7, bc = 8\\nDim As UInteger a = ac + n * (ar -1)\\nDim As UInteger b = bc + n * (br -1)\\n\\ng(a, nn +1) = -1\\ng(b, nn +1) = 1\\n\\nPrint : Print \\\"Nodes a: \\\"; a, \\\" b: \\\"; b\\n\\n' solve linear system using Gauss-Seidel method with pivoting\\nDim As UInteger i, j, k\\nDim As Double y\\n\\nDo\\n For j = 1 To nn\\n For i = j To nn\\n If g(i, j) <> 0 Then Exit For\\n Next\\n If i = nn +1 Then\\n Print : Print \\\"No solution\\\"\\n Exit Do\\n End If\\n For k = 1 To nn +1\\n Swap g(j, k), g(i, k)\\n Next\\n y = g(j, j)\\n For k = 1 To nn +1\\n g(j, k) = g(j, k) / y\\n Next\\n For i = 1 To nn\\n If i <> j Then\\n y = -g(i, j)\\n For k = 1 To nn +1\\n g(i, k) = g(i, k) + y * g(j, k)\\n Next\\n End If\\n Next\\n Next\\n\\n Print\\n Print \\\"Resistance =\\\"; Abs(g(a, nn +1) - g(b, nn +1)); \\\" Ohm\\\"\\n Exit Do\\nLoop\\n\\n' empty keyboard buffer\\nWhile Inkey <> \\\"\\\" : Wend\\nPrint : Print \\\"hit any key to end program\\\"\\nSleep\\nEnd\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nconst (\\n\\tS = 10\\n)\\n\\ntype node struct {\\n\\tv float64\\n\\tfixed int\\n}\\n\\nfunc alloc2(w, h int) [][]node {\\n\\ta := make([][]node, h)\\n\\n\\tfor i := range a {\\n\\t\\ta[i] = make([]node, w)\\n\\t}\\n\\treturn a\\n}\\n\\nfunc set_boundary(m [][]node) {\\n\\tm[1][1].fixed = 1\\n\\tm[1][1].v = 1\\n\\tm[6][7].fixed = -1\\n\\tm[6][7].v = -1\\n}\\n\\nfunc calc_diff(m [][]node, d [][]node, w, h int) float64 {\\n\\ttotal := 0.0\\n\\tfor i := 0; i < h; i++ {\\n\\t\\tfor j := 0; j < w; j++ {\\n\\t\\t\\tv := 0.0\\n\\t\\t\\tn := 0\\n\\t\\t\\tif i != 0 {\\n\\t\\t\\t\\tv += m[i-1][j].v\\n\\t\\t\\t\\tn++\\n\\t\\t\\t}\\n\\t\\t\\tif j != 0 {\\n\\t\\t\\t\\tv += m[i][j-1].v\\n\\t\\t\\t\\tn++\\n\\t\\t\\t}\\n\\t\\t\\tif i+1 < h {\\n\\t\\t\\t\\tv += m[i+1][j].v\\n\\t\\t\\t\\tn++\\n\\t\\t\\t}\\n\\t\\t\\tif j+1 < w {\\n\\t\\t\\t\\tv += m[i][j+1].v\\n\\t\\t\\t\\tn++\\n\\t\\t\\t}\\n\\n\\t\\t\\tv = m[i][j].v - v/float64(n)\\n\\t\\t\\td[i][j].v = v\\n\\t\\t\\tif m[i][j].fixed == 0 {\\n\\t\\t\\t\\ttotal += v * v\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn total\\n}\\n\\nfunc iter(m [][]node, w, h int) float64 {\\n\\td := alloc2(w, h)\\n\\tdiff := 1.0e10\\n\\tcur := []float64{0, 0, 0}\\n\\n\\tfor diff > 1e-24 {\\n\\t\\tset_boundary(m)\\n\\t\\tdiff = calc_diff(m, d, w, h)\\n\\t\\tfor i := 0; i < h; i++ {\\n\\t\\t\\tfor j := 0; j < w; j++ {\\n\\t\\t\\t\\tm[i][j].v -= d[i][j].v\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor i := 0; i < h; i++ {\\n\\t\\tfor j := 0; j < w; j++ {\\n\\t\\t\\tt := 0\\n\\t\\t\\tif i != 0 {\\n\\t\\t\\t\\tt += 1\\n\\t\\t\\t}\\n\\t\\t\\tif j != 0 {\\n\\t\\t\\t\\tt += 1\\n\\t\\t\\t}\\n\\t\\t\\tif i < h-1 {\\n\\t\\t\\t\\tt += 1\\n\\t\\t\\t}\\n\\t\\t\\tif j < w-1 {\\n\\t\\t\\t\\tt += 1\\n\\t\\t\\t}\\n\\t\\t\\tcur[m[i][j].fixed+1] += d[i][j].v * float64(t)\\n\\t\\t}\\n\\t}\\n\\treturn (cur[2] - cur[0]) / 2\\n}\\n\\nfunc main() {\\n\\tmesh := alloc2(S, S)\\n\\tfmt.Printf(\\\"R = %g\\\\n\\\", 2/iter(mesh, S, S))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"{-# LANGUAGE ParallelListComp #-}\\nimport Numeric.LinearAlgebra (linearSolve, toDense, (!), flatten)\\nimport Data.Monoid ((<>), Sum(..))\\n\\nrMesh n (ar, ac) (br, bc)\\n | n < 2 = Nothing\\n | any (\\\\x -> x < 1 || x > n) [ar, ac, br, bc] = Nothing\\n | otherwise = between a b <$> voltage\\n where\\n a = (ac - 1) + n*(ar - 1)\\n b = (bc - 1) + n*(br - 1)\\n\\n between x y v = abs (v ! a - v ! b)\\n\\n voltage = flatten <$> linearSolve matrixG current\\n\\n matrixG = toDense $ concat [ element row col node\\n | row <- [1..n], col <- [1..n]\\n | node <- [0..] ]\\n\\n element row col node =\\n let (Sum c, elements) =\\n (Sum 1, [((node, node-n), -1)]) `when` (row > 1) <>\\n (Sum 1, [((node, node+n), -1)]) `when` (row < n) <>\\n (Sum 1, [((node, node-1), -1)]) `when` (col > 1) <>\\n (Sum 1, [((node, node+1), -1)]) `when` (col < n)\\n in [((node, node), c)] <> elements\\n\\n x `when` p = if p then x else mempty\\n\\n current = toDense [ ((a, 0), -1) , ((b, 0), 1) , ((n^2-1, 0), 0) ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"nodes=: 10 10 #: i. 100\\nnodeA=: 1 1\\nnodeB=: 6 7\\n\\nNB. verb to pair up coordinates along a specific offset\\nconn =: [: (#~ e.~/@|:~&0 2) ([ ,: +)\\\"1\\n\\nref =: ~. nodeA,nodes-.nodeB NB. all nodes, with A first and B omitted\\nwiring=: /:~ ref i. ,/ nodes conn\\\"2 1 (,-)=i.2 NB. connected pairs (indices into ref)\\nYii=: (* =@i.@#) #/.~ {.\\\"1 wiring NB. diagonal of Y represents connections to B\\nYij=: -1:`(<\\\"1@[)`]}&(+/~ 0*i.1+#ref) wiring NB. off diagonal of Y represents wiring\\nY=: _1 _1 }. Yii+Yij\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" {.{. %. Y\\n1.60899\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" {.{.%. x:Y\\n455859137025721r283319837425200\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 3 3 #: i.9\\n0 0\\n0 1\\n0 2\\n1 0\\n1 1\\n1 2\\n2 0\\n2 1\\n2 2\\n (3 3 #: i.9) conn 0 1\\n0 0\\n0 1\\n\\n0 1\\n0 2\\n\\n1 0\\n1 1\\n\\n1 1\\n1 2\\n\\n2 0\\n2 1\\n\\n2 1\\n2 2\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.List;\\n\\npublic class ResistorMesh {\\n private static final int S = 10;\\n\\n private static class Node {\\n double v;\\n int fixed;\\n\\n Node(double v, int fixed) {\\n this.v = v;\\n this.fixed = fixed;\\n }\\n }\\n\\n private static void setBoundary(List<List<Node>> m) {\\n m.get(1).get(1).v = 1.0;\\n m.get(1).get(1).fixed = 1;\\n\\n m.get(6).get(7).v = -1.0;\\n m.get(6).get(7).fixed = -1;\\n }\\n\\n private static double calcDiff(List<List<Node>> m, List<List<Node>> d, int w, int h) {\\n double total = 0.0;\\n for (int i = 0; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n double v = 0.0;\\n int n = 0;\\n if (i > 0) {\\n v += m.get(i - 1).get(j).v;\\n n++;\\n }\\n if (j > 0) {\\n v += m.get(i).get(j - 1).v;\\n n++;\\n }\\n if (i + 1 < h) {\\n v += m.get(i + 1).get(j).v;\\n n++;\\n }\\n if (j + 1 < w) {\\n v += m.get(i).get(j + 1).v;\\n n++;\\n }\\n v = m.get(i).get(j).v - v / n;\\n d.get(i).get(j).v = v;\\n if (m.get(i).get(j).fixed == 0) {\\n total += v * v;\\n }\\n }\\n }\\n return total;\\n }\\n\\n private static double iter(List<List<Node>> m, int w, int h) {\\n List<List<Node>> d = new ArrayList<>(h);\\n for (int i = 0; i < h; ++i) {\\n List<Node> t = new ArrayList<>(w);\\n for (int j = 0; j < w; ++j) {\\n t.add(new Node(0.0, 0));\\n }\\n d.add(t);\\n }\\n\\n double[] cur = new double[3];\\n double diff = 1e10;\\n\\n while (diff > 1e-24) {\\n setBoundary(m);\\n diff = calcDiff(m, d, w, h);\\n for (int i = 0; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n m.get(i).get(j).v -= d.get(i).get(j).v;\\n }\\n }\\n }\\n\\n for (int i = 0; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n int k = 0;\\n if (i != 0) k++;\\n if (j != 0) k++;\\n if (i < h - 1) k++;\\n if (j < w - 1) k++;\\n cur[m.get(i).get(j).fixed + 1] += d.get(i).get(j).v * k;\\n }\\n }\\n\\n return (cur[2] - cur[0]) / 2.0;\\n }\\n\\n public static void main(String[] args) {\\n List<List<Node>> mesh = new ArrayList<>(S);\\n for (int i = 0; i < S; ++i) {\\n List<Node> t = new ArrayList<>(S);\\n for (int j = 0; j < S; ++j) {\\n t.add(new Node(0.0, 0));\\n }\\n mesh.add(t);\\n }\\n\\n double r = 2.0 / iter(mesh, S, S);\\n System.out.printf(\\\"R = %.15f\\\", r);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"// Vector addition, scalar multiplication & dot product:\\nconst add = (u, v) => {let i = u.length; while(i--) u[i] += v[i]; return u;};\\nconst sub = (u, v) => {let i = u.length; while(i--) u[i] -= v[i]; return u;};\\nconst mul = (a, u) => {let i = u.length; while(i--) u[i] *= a; return u;};\\nconst dot = (u, v) => {let s = 0, i = u.length; while(i--) s += u[i]*v[i]; return s;};\\n\\nconst W = 10, H = 10, A = 11, B = 67;\\n\\nfunction getAdjacent(node){ // Adjacency lists for square grid\\n let list = [], x = node % W, y = Math.floor(node / W);\\n if (x > 0) list.push(node - 1);\\n if (y > 0) list.push(node - W);\\n if (x < W - 1) list.push(node + 1);\\n if (y < H - 1) list.push(node + W);\\n return list;\\n}\\n\\nfunction linOp(u){ // LHS of the linear equation\\n let v = new Float64Array(W * H);\\n for(let i = 0; i < v.length; i++){\\n if ( i === A || i === B ) {\\n v[i] = u[i];\\n continue;\\n }\\n // For each node other then A, B calculate the net current flow:\\n for(let j of getAdjacent(i)){\\n v[i] += (j === A || j === B) ? u[i] : u[i] - u[j];\\n }\\n }\\n return v;\\n}\\n\\nfunction getRHS(phiA = 1, phiB = 0){ // RHS of the linear equation\\n let b = new Float64Array(W * H);\\n // Setting boundary conditions (electric potential at A and B):\\n b[A] = phiA;\\n b[B] = phiB;\\n for(let j of getAdjacent(A)) b[j] = phiA;\\n for(let j of getAdjacent(B)) b[j] = phiB;\\n return b;\\n}\\n\\nfunction init(phiA = 1, phiB = 0){ // initialize unknown vector\\n let u = new Float64Array(W * H);\\n u[A] = phiA;\\n u[B] = phiB;\\n return u;\\n}\\n\\nfunction solveLinearSystem(err = 1e-20){ // conjugate gradient solver\\n\\n let b = getRHS();\\n let u = init();\\n let r = sub(linOp(u), b);\\n let p = r;\\n let e = dot(r,r);\\n\\n while(true){\\n let Ap = linOp(p);\\n let alpha = e / dot(p, Ap);\\n u = sub(u, mul(alpha, p.slice()));\\n r = sub(linOp(u), b);\\n let e_new = dot(r,r);\\n let beta = e_new / e;\\n\\n if(e_new < err) return u;\\n\\n e = e_new;\\n p = add(r, mul(beta, p));\\n }\\n}\\n\\nfunction getResistance(u){\\n let curr = 0;\\n for(let j of getAdjacent(A)) curr += u[A] - u[j];\\n return 1 / curr;\\n}\\n\\nlet phi = solveLinearSystem();\\nlet res = getResistance(phi);\\nconsole.log(`R = ${res} Ohm`);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Create a $rows * $columns matrix initialized with the input value\\ndef matrix($rows; $columns):\\n . as $in\\n | [range(0;$columns)|$in] as $row\\n | [range(0;$rows)|$row];\\n\\ndef Node($v; $fixed):\\n {$v, $fixed};\\n\\n# input: a suitable matrix of Nodes\\ndef setBoundary:\\n .[1][1].v = 1\\n | .[1][1].fixed = 1\\n | .[6][7].v = -1\\n | .[6][7].fixed = -1 ;\\n\\n# input: {d, m} where\\n# .d and .m are matrices (as produced by matrix(h; w)) of Nodes\\n# output: {d, m, diff} with d updated\\ndef calcDiff($w; $h):\\n def adjust($cond; action): if $cond then action | .n += 1 else . end;\\n\\n reduce range(0; $h) as $i (.diff = 0;\\n reduce range(0; $w) as $j (.;\\n .v = 0\\n | .n = 0\\n | adjust($i > 0; .v += .m[$i-1][$j].v)\\n | adjust($j > 0; .v += .m[$i][$j-1].v)\\n | adjust($i + 1 < $h; .v += .m[$i+1][$j].v)\\n | adjust($j + 1 < $w; .v += .m[$i][$j+1].v)\\n | .v = .m[$i][$j].v - .v/.n\\n | .d[$i][$j].v = .v\\n | if (.m[$i][$j].fixed == 0) then .diff += .v * .v else . end ) ) ;\\n\\n# input: a mesh of width w and height h, i.e. a matrix as prodcued by matrix(h;w)\\ndef iter:\\n length as $h\\n | (.[0]|length) as $w\\n | { m : .,\\n d : (Node(0;0) | matrix($h; $w)),\\n cur: [0,0,0],\\n diff: 1e10 }\\n | until (.diff <= 1e-24;\\n .m |= setBoundary\\n | calcDiff($w; $h)\\n | reduce range(0;$h) as $i (.;\\n reduce range(0;$w) as $j (.;\\n .m[$i][$j].v += (- .d[$i][$j].v) )) )\\n | reduce range(0; $h) as $i (.;\\n reduce range(0; $w) as $j (.;\\n .k = 0\\n | if ($i != 0) then .k += 1 else . end\\n | if ($j != 0) then .k += 1 else . end\\n | if ($i < $h - 1) then .k += 1 else . end\\n | if ($j < $w - 1) then .k += 1 else . end\\n | .cur[.m[$i][$j].fixed + 1] += .d[$i][$j].v * .k ))\\n | (.cur[2] - .cur[0]) / 2 ;\\n\\ndef task($S):\\n def mesh: Node(0; 0) | matrix($S; $S);\\n (2 / (mesh | iter)) as $r\\n | \\\"R = \\\\($r) ohms\\\";\\n\\ntask(10)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"N = 10\\nD1 = speye(N-1,N) - spdiagm(ones(N-1),1,N-1,N)\\nD = [ kron(D1, speye(N)); kron(speye(N), D1) ]\\ni, j = N*1 + 2, N*7+7\\nb = zeros(N^2); b[i], b[j] = 1, -1\\nv = (D' * D) \\\\ b\\nv[i] - v[j]\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.4-3\\n\\ntypealias List2D<T> = List<List<T>>\\n\\nconst val S = 10\\n\\nclass Node(var v: Double, var fixed: Int)\\n\\nfun setBoundary(m: List2D<Node>) {\\n m[1][1].v = 1.0; m[1][1].fixed = 1\\n m[6][7].v = -1.0; m[6][7].fixed = -1\\n}\\n\\nfun calcDiff(m: List2D<Node>, d: List2D<Node>, w: Int, h: Int): Double {\\n var total = 0.0\\n for (i in 0 until h) {\\n for (j in 0 until w) {\\n var v = 0.0\\n var n = 0\\n if (i > 0) { v += m[i - 1][j].v; n++ }\\n if (j > 0) { v += m[i][j - 1].v; n++ }\\n if (i + 1 < h) { v += m[i + 1][j].v; n++ }\\n if (j + 1 < w) { v += m[i][j + 1].v; n++ }\\n v = m[i][j].v - v / n\\n d[i][j].v = v\\n if (m[i][j].fixed == 0) total += v * v\\n }\\n }\\n return total\\n}\\n\\nfun iter(m: List2D<Node>, w: Int, h: Int): Double {\\n val d = List(h) { List(w) { Node(0.0, 0) } }\\n val cur = DoubleArray(3)\\n var diff = 1e10\\n\\n while (diff > 1e-24) {\\n setBoundary(m)\\n diff = calcDiff(m, d, w, h)\\n for (i in 0 until h) {\\n for (j in 0 until w) m[i][j].v -= d[i][j].v\\n }\\n }\\n\\n for (i in 0 until h) {\\n for (j in 0 until w) {\\n var k = 0\\n if (i != 0) k++\\n if (j != 0) k++\\n if (i < h - 1) k++\\n if (j < w - 1) k++\\n cur[m[i][j].fixed + 1] += d[i][j].v * k\\n }\\n }\\n return (cur[2] - cur[0]) / 2.0\\n}\\n\\nfun main(args: Array<String>) {\\n val mesh = List(S) { List(S) { Node(0.0, 0) } }\\n val r = 2.0 / iter(mesh, S, S)\\n println(\\\"R = $r\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"ResistanceMatrix[g_Graph] := With[{n = VertexCount[g], km = KirchhoffMatrix[g]},\\n Table[ ReplacePart[ Diagonal[ DrazinInverse[ ReplacePart[km, k -> UnitVector[n, k]]]], k -> 0],\\n {k, n}]\\n]\\n\\nrm = ResistanceMatrix[GridGraph[{10, 10}]];\\n\\nN[rm[[12, 68]], 40]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"ResistanceMatrix[g_, prec_:$MachinePrecision]:= With[{m = PseudoInverse[N[KirchhoffMatrix[g], prec]]},\\n Outer[Plus, Diagonal[m], Diagonal[m]] - m - Transpose[m]\\n]\\n\\nrm = ResistanceMatrix[GridGraph[{10, 10}], 40];\\n\\nrm[[12, 68]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"/* Place a current souce between A and B, providing 1 A. Then we are really looking\\n for the potential at A and B, since I = R (V(B) - V(A)) where I is given and we want R.\\n\\n Atually, we will compute potential at each node, except A where we assume it's 0.\\n Without this assumption, there would be infinitely many solutions since potential\\n is known up to a constant. For A we will simply write the equation V(A) = 0, to\\n keep the program simple.\\n\\n Hence, for a general grid of p rows and q columns, there are n = p * q nodes,\\n so n unknowns, and n equations. Write Kirchhoff's current law at each node.\\n Be careful with the node A (equation A = 0) and the node B (there is a constant\\n current to add, from the source, that will go in the constant terms of the system).\\n\\n Finally, we have a n x n linear system of equations to solve. Simply use Maxima's\\n builtin LU decomposition.\\n\\n Since all computations are exact, the result will be also exact, written as a fraction.\\n Also, the program can work with any grid, and any two nodes on the grid.\\n\\n For those who want more speed and less space, notice the system is sparse and necessarily\\n symmetric, so one can use conjugate gradient or any other sparse symmetric solver. */\\n\\n\\n/* Auxiliary function to get rid of the borders */\\nongrid(i, j, p, q) := is(i >= 1 and i <= p and j >= 1 and j <= q)$\\n\\ngrid_resistor(p, q, ai, aj, bi, bj) := block(\\n [n: p * q, A, B, M, k, c, V],\\n A: zeromatrix(n, n),\\n for i thru p do\\n for j thru q do (\\n k: (i - 1) * q + j,\\n if i = ai and j = aj then\\n A[k, k]: 1\\n else (\\n c: 0,\\n if ongrid(i + 1, j, p, q) then (c: c + 1, A[k, k + q]: -1),\\n if ongrid(i - 1, j, p, q) then (c: c + 1, A[k, k - q]: -1),\\n if ongrid(i, j + 1, p, q) then (c: c + 1, A[k, k + 1]: -1),\\n if ongrid(i, j - 1, p, q) then (c: c + 1, A[k, k - 1]: -1),\\n A[k, k]: c\\n )\\n ),\\n B: zeromatrix(n, 1),\\n B[k: (bi - 1) * q + bj, 1]: 1,\\n M: lu_factor(A),\\n V: lu_backsub(M, B),\\n V[k, 1]\\n)$\\n\\ngrid_resistor(10, 10, 2, 2, 8, 7);\\n455859137025721 / 283319837425200\\n\\nbfloat(%), fpprec = 40;\\n1.608991241730729655954495520510088761201b0\\n\\n/* Some larger example */\\ngrid_resistor(20, 20, 1, 1, 20, 20);\\n129548954101732562831760781545158173626645023 / 33283688571680493510612137844679320717594861\\n\\nbfloat(%), fpprec = 40;\\n3.89226554090400912102670691601064387507b0\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"MODULE ResistorMesh;\\nFROM RConversions IMPORT RealToStringFixed;\\nFROM Terminal IMPORT WriteString,WriteLn,ReadChar;\\n\\nCONST S = 10;\\n\\nTYPE Node = RECORD\\n v : LONGREAL;\\n fixed : INTEGER;\\nEND;\\n\\nPROCEDURE SetBoundary(VAR m : ARRAY OF ARRAY OF Node);\\nBEGIN\\n m[1][1].v := 1.0;\\n m[1][1].fixed := 1;\\n\\n m[6][7].v := -1.0;\\n m[6][7].fixed := -1;\\nEND SetBoundary;\\n\\nPROCEDURE CalcDiff(VAR m,d : ARRAY OF ARRAY OF Node) : LONGREAL;\\nVAR\\n total,v : LONGREAL;\\n i,j,n : INTEGER;\\nBEGIN\\n total := 0.0;\\n FOR i:=0 TO S DO\\n FOR j:=0 TO S DO\\n v := 0.0;\\n n := 0;\\n IF i>0 THEN\\n v := v + m[i-1][j].v;\\n INC(n);\\n END;\\n IF j>0 THEN\\n v := v + m[i][j-1].v;\\n INC(n);\\n END;\\n IF i+1<S THEN\\n v := v + m[i+1][j].v;\\n INC(n);\\n END;\\n IF j+1<S THEN\\n v := v + m[i][j+1].v;\\n INC(n);\\n END;\\n v := m[i][j].v - v / LFLOAT(n);\\n d[i][j].v := v;\\n IF m[i][j].fixed=0 THEN\\n total := total + v*v;\\n END;\\n END;\\n END;\\n RETURN total;\\nEND CalcDiff;\\n\\nPROCEDURE Iter(m : ARRAY OF ARRAY OF Node) : LONGREAL;\\nVAR\\n d : ARRAY[0..S] OF ARRAY[0..S] OF Node;\\n i,j,k : INTEGER;\\n cur : ARRAY[0..2] OF LONGREAL;\\n diff : LONGREAL;\\nBEGIN\\n FOR i:=0 TO S DO\\n FOR j:=0 TO S DO\\n d[i][j] := Node{0.0,0};\\n END;\\n END;\\n\\n diff := 1.0E10;\\n WHILE diff>1.0E-24 DO\\n SetBoundary(m);\\n diff := CalcDiff(m,d);\\n FOR i:=0 TO S DO\\n FOR j:=0 TO S DO\\n m[i][j].v := m[i][j].v - d[i][j].v;\\n END;\\n END;\\n END;\\n\\n FOR i:=0 TO S DO\\n FOR j:=0 TO S DO\\n k:=0;\\n IF i#0 THEN INC(k) END;\\n IF j#0 THEN INC(k) END;\\n IF i<S-1 THEN INC(k) END;\\n IF j<S-1 THEN INC(k) END;\\n cur[m[i][j].fixed+1] := cur[m[i][j].fixed+1] + d[i][j].v*LFLOAT(k);\\n END;\\n END;\\n\\n RETURN (cur[2]-cur[0]) / 2.0;\\nEND Iter;\\n\\nVAR\\n mesh : ARRAY[0..S] OF ARRAY[0..S] OF Node;\\n buf : ARRAY[0..32] OF CHAR;\\n r : LONGREAL;\\n pos : CARDINAL;\\n ok : BOOLEAN;\\nBEGIN\\n pos := 0;\\n r := 2.0 / Iter(mesh);\\n WriteString(\\\"R = \\\");\\n RealToStringFixed(r, 15,0, buf, pos, ok);\\n WriteString(buf);\\n WriteString(\\\" ohms\\\");\\n WriteLn;\\n\\n ReadChar;\\nEND ResistorMesh.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"const S = 10\\n\\ntype\\n\\n NodeKind = enum nodeFree, nodeA, nodeB\\n\\n Node = object\\n v: float\\n fixed: NodeKind\\n\\n Mesh[H, W: static int] = array[H, array[W, Node]]\\n\\n\\nfunc setBoundary(m: var Mesh) =\\n m[1][1].v = 1.0\\n m[1][1].fixed = nodeA\\n m[6][7].v = -1.0\\n m[6][7].fixed = nodeB\\n\\n\\nfunc calcDiff[H, W: static int](m,: Mesh[H, W]; d: var Mesh[H, W]): float =\\n for i in 0..<H:\\n for j in 0..<W:\\n var v = 0.0\\n var n = 0\\n if i > 0:\\n v += m[i - 1][j].v\\n inc n\\n if j > 0:\\n v += m[i][j - 1].v\\n inc n\\n if i + 1 < m.H:\\n v += m[i + 1][j].v\\n inc n\\n if j + 1 < m.W:\\n v += m[i][j + 1].v\\n inc n\\n v = m[i][j].v - v / n.toFloat\\n d[i][j].v = v\\n if m[i][j].fixed == nodeFree:\\n result += v * v\\n\\n\\nfunc iter[H, W: static int](m: var Mesh[H, W]): float =\\n var\\n d: Mesh[H, W]\\n cur: array[NodeKind, float]\\n diff = 1e10\\n\\n while diff > 1e-24:\\n m.setBoundary()\\n diff = calcDiff(m, d)\\n for i in 0..<H:\\n for j in 0..<W:\\n m[i][j].v -= d[i][j].v\\n\\n for i in 0..<H:\\n for j in 0..<W:\\n var k = 0\\n if i != 0: inc k\\n if j != 0: inc k\\n if i < m.H - 1: inc k\\n if j < m.W - 1: inc k\\n cur[m[i][j].fixed] += d[i][j].v * k.toFloat\\n\\n result = (cur[nodeA] - cur[nodeB]) / 2\\n\\n\\nwhen isMainModule:\\n\\n var mesh: Mesh[S, S]\\n let r = 2 / mesh.iter()\\n echo \\\"R = \\\", r\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"N = 10;\\nNN = N*N;\\nG = sparse(NN, NN);\\n\\nnode = 0;\\nfor row=1:N;\\n for col=1:N;\\n\\tnode++;\\n\\tif row > 1\\n\\t G(node, node)++;\\n\\t G(node, node - N) = -1;\\n\\tend\\n\\tif row < N;\\n\\t G(node, node)++;\\n\\t G(node, node + N) = -1;\\n\\tend\\n\\tif col > 1\\n\\t G(node, node)++;\\n\\t G(node, node - 1) = -1;\\n\\tend\\n\\tif col < N;\\n\\t G(node, node)++;\\n\\t G(node, node + 1) = -1;\\n\\tend\\n end\\nend\\n\\ncurrent = sparse(NN, 1);\\n\\nAr = 2; Ac = 2; A = Ac + N*( Ar - 1 );\\nBr = 7; Bc = 8; B = Bc + N*( Br - 1 );\\ncurrent( A ) = -1;\\ncurrent( B ) = +1;\\n\\nvoltage = G \\\\ current;\\n\\nVA = voltage( A );\\nVB = voltage( B );\\n\\nfull( abs( VA - VB ) )\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\n\\nmy ($w, $h) = (9, 9);\\nmy @v = map([ (0) x ($w + 1) ], 0 .. $h); # voltage\\nmy @f = map([ (0) x ($w + 1) ], 0 .. $h); # fixed condition\\nmy @d = map([ (0) x ($w + 1) ], 0 .. $h); # diff\\n\\nmy @n; # neighbors\\nfor my $i (0 .. $h) {\\n\\tpush @{$n[$i][$_]}, [$i, $_ - 1] for 1 .. $w;\\n\\tpush @{$n[$i][$_]}, [$i, $_ + 1] for 0 .. $w - 1;\\n}\\nfor my $j (0 .. $w) {\\n\\tpush @{$n[$_][$j]}, [$_ - 1, $j] for 1 .. $h;\\n\\tpush @{$n[$_][$j]}, [$_ + 1, $j] for 0 .. $h - 1;\\n}\\n\\nsub set_boundary {\\n\\t$f[1][1] = 1; $f[6][7] = -1;\\n\\t$v[1][1] = 1; $v[6][7] = -1;\\n}\\n\\nsub calc_diff {\\n\\tmy $total_diff;\\n\\tfor my $i (0 .. $h) {\\n\\t\\tfor my $j (0 .. $w) {\\n\\t\\t\\tmy ($p, $v) = $n[$i][$j];\\n\\t\\t\\t$v += $v[$_->[0]][$_->[1]] for @$p;\\n\\t\\t\\t$d[$i][$j] = $v = $v[$i][$j] - $v / scalar(@$p);\\n\\t\\t\\t$total_diff += $v * $v unless $f[$i][$j];\\n\\t\\t}\\n\\t}\\n\\t$total_diff;\\n}\\n\\nsub iter {\\n\\tmy $diff = 1;\\n\\twhile ($diff > 1e-15) {\\n\\t\\tset_boundary();\\n\\t\\t$diff = calc_diff();\\n\\t\\t#print \\\"error^2: $diff\\\\n\\\"; # un-comment to see slow convergence\\n\\t\\tfor my $i (0 .. $h) {\\n\\t\\t\\tfor my $j (0 .. $w) {\\n\\t\\t\\t\\t$v[$i][$j] -= $d[$i][$j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tmy @current = (0) x 3;\\n\\tfor my $i (0 .. $h) {\\n\\t\\tfor my $j (0 .. $w) {\\n\\t\\t\\t$current[ $f[$i][$j] ] +=\\n\\t\\t\\t\\t$d[$i][$j] * scalar(@{$n[$i][$j]});\\n\\t\\t}\\n\\t}\\n\\treturn ($current[1] - $current[-1]) / 2;\\n}\\n\\nprintf \\\"R = %.6f\\\\n\\\", 2 / iter();\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">resistormesh</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">ni</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">nj</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ai</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">aj</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">bi</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">bj</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ni</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">nj</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">c</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">A</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">B</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">ni</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">nj</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">nj</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #000080;font-style:italic;\\\">--1</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">ai</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">aj</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">A</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">ni</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">;</span> <span style=\\\"color: #000000;\\\">A</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">nj</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">;</span> <span style=\\\"color: #000000;\\\">A</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">nj</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">nj</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">;</span> <span style=\\\"color: #000000;\\\">A</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">;</span> <span style=\\\"color: #000000;\\\">A</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">A</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">c</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">bi</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">nj</span> <span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">bj</span>\\n <span style=\\\"color: #000000;\\\">B</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">A</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">inverse</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">A</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">B</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">matrix_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">A</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">B</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">B</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Resistance = %.13f ohms\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">resistormesh</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">))</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"DIFF_THRESHOLD = 1e-40\\n\\nclass Fixed:\\n FREE = 0\\n A = 1\\n B = 2\\n\\nclass Node:\\n __slots__ = [\\\"voltage\\\", \\\"fixed\\\"]\\n def __init__(self, v=0.0, f=Fixed.FREE):\\n self.voltage = v\\n self.fixed = f\\n\\ndef set_boundary(m):\\n m[1][1] = Node( 1.0, Fixed.A)\\n m[6][7] = Node(-1.0, Fixed.B)\\n\\ndef calc_difference(m, d):\\n h = len(m)\\n w = len(m[0])\\n total = 0.0\\n\\n for i in xrange(h):\\n for j in xrange(w):\\n v = 0.0\\n n = 0\\n if i != 0: v += m[i-1][j].voltage; n += 1\\n if j != 0: v += m[i][j-1].voltage; n += 1\\n if i < h-1: v += m[i+1][j].voltage; n += 1\\n if j < w-1: v += m[i][j+1].voltage; n += 1\\n v = m[i][j].voltage - v / n\\n\\n d[i][j].voltage = v\\n if m[i][j].fixed == Fixed.FREE:\\n total += v ** 2\\n return total\\n\\ndef iter(m):\\n h = len(m)\\n w = len(m[0])\\n difference = [[Node() for j in xrange(w)] for i in xrange(h)]\\n\\n while True:\\n set_boundary(m) # Enforce boundary conditions.\\n if calc_difference(m, difference) < DIFF_THRESHOLD:\\n break\\n for i, di in enumerate(difference):\\n for j, dij in enumerate(di):\\n m[i][j].voltage -= dij.voltage\\n\\n cur = [0.0] * 3\\n for i, di in enumerate(difference):\\n for j, dij in enumerate(di):\\n cur[m[i][j].fixed] += (dij.voltage *\\n (bool(i) + bool(j) + (i < h-1) + (j < w-1)))\\n\\n return (cur[Fixed.A] - cur[Fixed.B]) / 2.0\\n\\ndef main():\\n w = h = 10\\n mesh = [[Node() for j in xrange(w)] for i in xrange(h)]\\n print \\\"R = %.16f\\\" % (2 / iter(mesh))\\n\\nmain()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import sys, copy\\nfrom fractions import Fraction\\n\\ndef gauss(a, b):\\n n, p = len(a), len(a[0])\\n for i in range(n):\\n t = abs(a[i][i])\\n k = i\\n for j in range(i + 1, n):\\n if abs(a[j][i]) > t:\\n t = abs(a[j][i])\\n k = j\\n if k != i:\\n for j in range(i, n):\\n a[i][j], a[k][j] = a[k][j], a[i][j]\\n b[i], b[k] = b[k], b[i]\\n t = 1/a[i][i]\\n for j in range(i + 1, n):\\n a[i][j] *= t\\n b[i] *= t\\n for j in range(i + 1, n):\\n t = a[j][i]\\n for k in range(i + 1, n):\\n a[j][k] -= t*a[i][k]\\n b[j] -= t * b[i]\\n for i in range(n - 1, -1, -1):\\n for j in range(i):\\n b[j] -= a[j][i]*b[i]\\n return b\\n\\ndef resistor_grid(p, q, ai, aj, bi, bj):\\n n = p*q\\n I = Fraction(1, 1)\\n v = [0*I]*n\\n a = [copy.copy(v) for i in range(n)]\\n for i in range(p):\\n for j in range(q):\\n k = i*q + j\\n if i == ai and j == aj:\\n a[k][k] = I\\n else:\\n c = 0\\n if i + 1 < p:\\n c += 1\\n a[k][k + q] = -1\\n if i >= 1:\\n c += 1\\n a[k][k - q] = -1\\n if j + 1 < q:\\n c += 1\\n a[k][k + 1] = -1\\n if j >= 1:\\n c += 1\\n a[k][k - 1] = -1\\n a[k][k] = c*I\\n b = [0*I]*n\\n k = bi*q + bj\\n b[k] = 1\\n return gauss(a, b)[k]\\n\\ndef main(arg):\\n r = resistor_grid(int(arg[0]), int(arg[1]), int(arg[2]), int(arg[3]), int(arg[4]), int(arg[5]))\\n print(r)\\n print(float(r))\\n\\nmain(sys.argv[1:])\\n\\n# Output:\\n# python grid.py 10 10 1 1 7 6\\n# 455859137025721/283319837425200\\n# 1.6089912417307297\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n(require racket/flonum)\\n\\n(define-syntax-rule (fi c t f) (if c f t))\\n\\n(define (neighbours w h)\\n (define h-1 (sub1 h))\\n (define w-1 (sub1 w))\\n (lambda (i j)\\n (+ (fi (zero? i) 1 0)\\n (fi (zero? j) 1 0)\\n (if (< i h-1) 1 0)\\n (if (< j w-1) 1 0))))\\n\\n(define (mesh-R probes w h)\\n (define h-1 (sub1 h))\\n (define w-1 (sub1 w))\\n\\n (define-syntax-rule (v2ref v r c) ; 2D vector ref\\n (flvector-ref v (+ (* r w) c)))\\n\\n (define w*h (* w h))\\n\\n (define (alloc2 (v 0.))\\n (make-flvector w*h v))\\n\\n (define nghbrs (neighbours w h))\\n\\n (match-define `((,fix+r ,fix+c) (,fix-r ,fix-c)) probes)\\n (define fix+idx (+ fix+c (* fix+r w)))\\n (define fix-idx (+ fix-c (* fix-r w)))\\n (define fix-val\\n (match-lambda**\\n [((== fix+idx) _) 1.]\\n [((== fix-idx) _) -1.]\\n [(_ v) v]))\\n\\n (define (calc-diff m)\\n (define d\\n (for*/flvector #:length w*h ((i (in-range h)) (j (in-range w)))\\n (define v\\n (+ (fi (zero? i) (v2ref m (- i 1) j) 0)\\n (fi (zero? j) (v2ref m i (- j 1)) 0)\\n (if (< i h-1) (v2ref m (+ i 1) j) 0)\\n (if (< j w-1) (v2ref m i (+ j 1)) 0)))\\n (- (v2ref m i j) (/ v (nghbrs i j)))))\\n\\n (define Δ\\n (for/sum ((i (in-naturals)) (d.v (in-flvector d)) #:when (= (fix-val i 0.) 0.))\\n (sqr d.v)))\\n\\n (values d Δ))\\n\\n (define final-d\\n (let loop ((m (alloc2)) (d (alloc2)))\\n (define m+ ; do this first will get the boundaries on\\n (for/flvector #:length w*h ((j (in-naturals)) (m.v (in-flvector m)) (d.v (in-flvector d)))\\n (fix-val j (- m.v d.v))))\\n\\n (define-values (d- Δ) (calc-diff m+))\\n\\n (if (< Δ 1e-24) d (loop m+ d-))))\\n\\n (/ 2\\n (/ (- (* (v2ref final-d fix+r fix+c) (nghbrs fix+r fix+c))\\n (* (v2ref final-d fix-r fix-c) (nghbrs fix-r fix-c)))\\n 2)))\\n\\n(module+ main\\n (printf \\\"R = ~a~%\\\" (mesh-R '((1 1) (6 7)) 10 10)))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my $*TOLERANCE = 1e-12;\\n\\nsub set-boundary(@mesh,@p1,@p2) {\\n @mesh[ @p1[0] ; @p1[1] ] = 1;\\n @mesh[ @p2[0] ; @p2[1] ] = -1;\\n}\\n\\nsub solve(@p1, @p2, Int \\\\w, Int \\\\h) {\\n my @d = [0 xx w] xx h;\\n my @V = [0 xx w] xx h;\\n my @fixed = [0 xx w] xx h;\\n set-boundary(@fixed,@p1,@p2);\\n\\n loop {\\n set-boundary(@V,@p1,@p2);\\n my $diff = 0;\\n for (flat ^h X ^w) -> \\\\i, \\\\j {\\n my @neighbors = (@V[i-1;j], @V[i;j-1], @V[i+1;j], @V[i;j+1]).grep: *.defined;\\n @d[i;j] = my \\\\v = @V[i;j] - @neighbors.sum / @neighbors;\\n $diff += v × v unless @fixed[i;j];\\n }\\n last if $diff =~= 0;\\n\\n for (flat ^h X ^w) -> \\\\i, \\\\j {\\n @V[i;j] -= @d[i;j];\\n }\\n }\\n\\n my @current;\\n for (flat ^h X ^w) -> \\\\i, \\\\j {\\n @current[ @fixed[i;j]+1 ] += @d[i;j] × (?i + ?j + (i < h-1) + (j < w-1) );\\n }\\n (@current[2] - @current[0]) / 2\\n}\\n\\nsay 2 / solve (1,1), (6,7), 10, 10;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program calculates the resistance between any two points on a resistor grid.*/\\nif 2=='f2'x then ohms = \\\"ohms\\\" /*EBCDIC machine? Then use 'ohms'. */\\n else ohms = \\\"Ω\\\" /* ASCII \\\" \\\" \\\" Greek Ω.*/\\nparse arg high wide Arow Acol Brow Bcol digs . /*obtain optional arguments from the CL*/\\nif high=='' | high==\\\",\\\" then high= 10 /*Not specified? Then use the default.*/\\nif wide=='' | wide==\\\",\\\" then wide= 10 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif Arow=='' | Arow==\\\",\\\" then Arow= 2 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif Acol=='' | Acol==\\\",\\\" then Acol= 2 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif Brow=='' | Brow==\\\",\\\" then Brow= 7 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif Bcol=='' | Bcol==\\\",\\\" then Bcol= 8 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif digs=='' | digs==\\\",\\\" then digs= 20 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nnumeric digits digs /*use moderate decimal digs (precision)*/\\nminVal = 1'e-' || (digs*2) /*calculate the threshold minimal value*/\\nsay ' minimum value is ' format(minVal,,,,0) \\\" using \\\" digs ' decimal digits'; say\\nsay ' resistor mesh size is: ' wide \\\"wide, \\\" high 'high' ; say\\nsay ' point A is at (row,col): ' Arow\\\",\\\" Acol\\nsay ' point B is at (row,col): ' Brow\\\",\\\" Bcol\\n@.=0; cell.= 1\\n do until $<=minVal; v= 0\\n @.Arow.Acol= 1 ; cell.Arow.Acol= 0\\n @.Brow.Bcol= '-1' ; cell.Brow.Bcol= 0\\n $=0\\n do i=1 for high; im= i-1; ip= i+1\\n do j=1 for wide; n= 0; v= 0\\n if i\\\\==1 then do; v= v + @.im.j; n= n+1; end\\n if j\\\\==1 then do; jm= j-1; v= v + @.i.jm; n= n+1; end\\n if i<high then do; v= v + @.ip.j; n= n+1; end\\n if j<wide then do; jp= j+1; v= v + @.i.jp; n= n+1; end\\n v= @.i.j - v / n; #.i.j= v; if cell.i.j then $= $ + v*v\\n end /*j*/\\n end /*i*/\\n do r=1 for High\\n do c=1 for Wide; @.r.c= @.r.c - #.r.c\\n end /*c*/\\n end /*r*/\\n end /*until*/\\nsay\\nAcur= #.Arow.Acol * sides(Arow, Acol)\\nBcur= #.Brow.Bcol * sides(Brow, Bcol)\\nsay ' resistance between point A and point B is: ' 4 / (Acur - Bcur) ohms\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nsides: parse arg row,col; z=0; if row\\\\==1 & row\\\\==high then z= z+2; else z= z+1\\n if col\\\\==1 & col\\\\==wide then z= z+2; else z= z+1\\n return z\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"var (w, h) = (10, 10)\\n\\nvar v = h.of { w.of(0) } # voltage\\nvar f = h.of { w.of(0) } # fixed condition\\nvar d = h.of { w.of(0) } # diff\\nvar n = [] # neighbors\\n\\nfor i in ^h {\\n for j in (1 ..^ w ) { n[i][j] := [] << [i, j-1] }\\n for j in (0 ..^ w-1) { n[i][j] := [] << [i, j+1] }\\n}\\n\\nfor j in ^w {\\n for i in (1 ..^ h ) { n[i][j] := [] << [i-1, j] }\\n for i in (0 ..^ h-1) { n[i][j] := [] << [i+1, j] }\\n}\\n\\nfunc set_boundary {\\n f[1][1] = 1; f[6][7] = -1;\\n v[1][1] = 1; v[6][7] = -1;\\n}\\n\\nfunc calc_diff {\\n var total_diff = 0\\n for i,j in (^h ~X ^w) {\\n var w = n[i][j].map { |a| v.dig(a...) }.sum\\n d[i][j] = (w = (v[i][j] - w/n[i][j].len))\\n f[i][j] || (total_diff += w*w)\\n }\\n total_diff\\n}\\n\\nfunc iter {\\n var diff = 1\\n while (diff > 1e-24) {\\n set_boundary()\\n diff = calc_diff()\\n for i,j in (^h ~X ^w) {\\n v[i][j] -= d[i][j]\\n }\\n }\\n\\n var current = 3.of(0)\\n for i,j in (^h ~X ^w) {\\n current[ f[i][j] ] += (d[i][j] * n[i][j].len)\\n }\\n (current[1] - current[-1]) / 2\\n}\\n\\nsay \\\"R = #{2 / iter()}\\\"\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"package require Tcl 8.6; # Or 8.5 with the TclOO package\\n\\n# This code is structured as a class with a little trivial DSL parser\\n# so it is easy to change what problem is being worked on.\\noo::class create ResistorMesh {\\n variable forcePoints V fixed w h\\n\\n constructor {boundaryConditions} {\\n\\tforeach {op condition} $boundaryConditions {\\n\\t switch $op {\\n\\t\\tsize {\\n\\t\\t lassign $condition w h\\n\\t\\t set fixed [lrepeat $h [lrepeat $w 0]]\\n\\t\\t set V [lrepeat $h [lrepeat $w 0.0]]\\n\\t\\t}\\n\\t\\tfixed {\\n\\t\\t lassign $condition j i v\\n\\t\\t lset fixed $i $j [incr ctr]\\n\\t\\t lappend forcePoints $j $i $v\\n\\t\\t}\\n\\t }\\n\\t}\\n }\\n\\n method CalculateDifferences {*dV} {\\n\\tupvar 1 ${*dV} dV\\n\\tset error 0.0\\n\\tfor {set i 0} {$i < $h} {incr i} {\\n\\t for {set j 0} {$j < $w} {incr j} {\\n\\t\\tset v 0.0\\n\\t\\tset n 0\\n\\t\\tif {$i} {\\n\\t\\t set v [expr {$v + [lindex $V [expr {$i-1}] $j]}]\\n\\t\\t incr n\\n\\t\\t}\\n\\t\\tif {$j} {\\n\\t\\t set v [expr {$v + [lindex $V $i [expr {$j-1}]]}]\\n\\t\\t incr n\\n\\t\\t}\\n\\t\\tif {$i+1 < $h} {\\n\\t\\t set v [expr {$v + [lindex $V [expr {$i+1}] $j]}]\\n\\t\\t incr n\\n\\t\\t}\\n\\t\\tif {$j+1 < $w} {\\n\\t\\t set v [expr {$v + [lindex $V $i [expr {$j+1}]]}]\\n\\t\\t incr n\\n\\t\\t}\\n\\t\\tlset dV $i $j [set v [expr {[lindex $V $i $j] - $v/$n}]]\\n\\t\\tif {![lindex $fixed $i $j]} {\\n\\t\\t set error [expr {$error + $v**2}]\\n\\t\\t}\\n\\t }\\n\\t}\\n\\treturn $error\\n }\\n\\n method FindCurrentFixpoint {epsilon} {\\n\\tset dV [lrepeat $h [lrepeat $w 0.0]]\\n\\tset current {0.0 0.0 0.0}\\n\\twhile true {\\n\\t # Enforce the boundary conditions\\n\\t foreach {j i v} $forcePoints {\\n\\t\\tlset V $i $j $v\\n\\t }\\n\\t # Compute the differences and the error\\n\\t set error [my CalculateDifferences dV]\\n\\t # Apply the differences\\n\\t for {set i 0} {$i < $h} {incr i} {\\n\\t\\tfor {set j 0} {$j < $w} {incr j} {\\n\\t\\t lset V $i $j [expr {\\n\\t\\t\\t[lindex $V $i $j] - [lindex $dV $i $j]}]\\n\\t\\t}\\n\\t }\\n\\t # Done if the error is small enough\\n\\t if {$error < $epsilon} break\\n\\t}\\n\\t# Compute the currents from the error\\n\\tfor {set i 0} {$i < $h} {incr i} {\\n\\t for {set j 0} {$j < $w} {incr j} {\\n\\t\\tlset current [lindex $fixed $i $j] [expr {\\n\\t\\t [lindex $current [lindex $fixed $i $j]] +\\n\\t\\t [lindex $dV $i $j] * (!!$i+!!$j+($i<$h-1)+($j<$w-1))}]\\n\\t }\\n\\t}\\n\\t# Compute the actual current flowing between source and sink\\n\\treturn [expr {([lindex $current 1] - [lindex $current 2]) / 2.0}]\\n }\\n\\n # Public entry point\\n method solveForResistance {{epsilon 1e-24}} {\\n\\tset voltageDifference [expr {\\n\\t [lindex $forcePoints 2] - [lindex $forcePoints 5]}]\\n\\texpr {$voltageDifference / [my FindCurrentFixpoint $epsilon]}\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"ResistorMesh create mesh {\\n size {10 10}\\n fixed {1 1 1.0}\\n fixed {6 7 -1.0}\\n}\\nputs [format \\\"R = %.12g\\\" [mesh solveForResistance]]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"class Node {\\n construct new(v, fixed) {\\n _v = v\\n _fixed = fixed\\n }\\n\\n v { _v }\\n v=(value) { _v = value }\\n\\n fixed { _fixed }\\n fixed=(value) { _fixed = value }\\n}\\n\\nvar setBoundary = Fn.new { |m|\\n m[1][1].v = 1\\n m[1][1].fixed = 1\\n m[6][7].v = -1\\n m[6][7].fixed = -1\\n}\\n\\nvar calcDiff = Fn.new { |m, d, w, h|\\n var total = 0\\n for (i in 0...h) {\\n for (j in 0...w) {\\n var v = 0\\n var n = 0\\n if (i > 0) {\\n v = v + m[i-1][j].v\\n n = n + 1\\n }\\n if (j > 0) {\\n v = v + m[i][j-1].v\\n n = n + 1\\n }\\n if (i + 1 < h) {\\n v = v + m[i+1][j].v\\n n = n + 1\\n }\\n if (j + 1 < w) {\\n v = v + m[i][j+1].v\\n n = n + 1\\n }\\n v = m[i][j].v - v/n\\n d[i][j].v = v\\n if (m[i][j].fixed == 0) total = total + v*v\\n }\\n }\\n return total\\n}\\n\\nvar iter = Fn.new { |m, w, h|\\n var d = List.filled(h, null)\\n for (i in 0...h) {\\n d[i] = List.filled(w, null)\\n for (j in 0...w) d[i][j] = Node.new(0, 0)\\n }\\n var cur = [0] * 3\\n var diff = 1e10\\n while (diff > 1e-24) {\\n setBoundary.call(m)\\n diff = calcDiff.call(m, d, w, h)\\n for (i in 0...h) {\\n for (j in 0...w) m[i][j].v = m[i][j].v - d[i][j].v\\n }\\n }\\n for (i in 0...h) {\\n for (j in 0...w) {\\n var k = 0\\n if (i != 0) k = k + 1\\n if (j != 0) k = k + 1\\n if (i < h - 1) k = k + 1\\n if (j < w - 1) k = k + 1\\n cur[m[i][j].fixed + 1] = cur[m[i][j].fixed + 1] + d[i][j].v * k\\n }\\n }\\n return (cur[2] - cur[0]) / 2\\n}\\n\\nvar S = 10\\nvar mesh = List.filled(S, null)\\nfor (i in 0...S) {\\n mesh[i] = List.filled(S, null)\\n for (j in 0...S) mesh[i][j] = Node.new(0, 0)\\n}\\nvar r = 2 / iter.call(mesh, S, S)\\nSystem.print(\\\"R = %(r)\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"code real RlRes=46, RlOut=48;\\ndef S = 10;\\n\\nproc SetBoundary(MV, MF);\\nreal MV; int MF;\\n[MF(1,1):= 1; MV(1,1):= 1.0;\\n MF(6,7):= -1; MV(6,7):= -1.0;\\n];\\n\\nfunc real CalcDiff(MV, MF, DV, W, H);\\nreal MV; int MF; real DV; int W, H;\\nint I, J, N; real V, Total;\\n[Total:= 0.0;\\nfor I:= 0 to H-1 do\\n for J:= 0 to W-1 do\\n [V:= 0.0; N:= 0;\\n if I then [V:= V + MV(I-1,J); N:= N+1];\\n if J then [V:= V + MV(I,J-1); N:= N+1];\\n if I+1 < H then [V:= V + MV(I+1,J); N:= N+1];\\n if J+1 < W then [V:= V + MV(I,J+1); N:= N+1];\\n V:= MV(I,J) - V/float(N); DV(I,J):= V;\\n if MF(I,J) = 0 then Total:= Total + V*V;\\n ];\\nreturn Total;\\n];\\n\\nfunc real Iter(MV, MF, W, H);\\nreal MV; int MF, W, H;\\nreal DV, Diff, Cur; int I, J;\\n[DV:= RlRes(W); for I:= 0 to W-1 do DV(I):= RlRes(H);\\nDiff:= 1E10;\\nCur:= [0.0, 0.0, 0.0];\\nwhile Diff > 1E-24 do\\n [SetBoundary(MV, MF);\\n Diff:= CalcDiff(MV, MF, DV, W, H);\\n for I:= 0 to H-1 do\\n for J:= 0 to W-1 do\\n MV(I,J):= MV(I,J) - DV(I,J);\\n ];\\nfor I:= 0 to H-1 do\\n for J:= 0 to W-1 do\\n Cur(MF(I,J)+1):= Cur(MF(I,J)+1) +\\n DV(I,J) * float(-(I>0) - (J>0) - (I<H-1) - (J<W-1));\\n \\\\middle=4; side=3; corner=2\\nreturn (Cur(2)-Cur(0))/2.0;\\n];\\n\\nreal MeshV(S,S); int MeshF(S,S);\\nRlOut(0, 2.0 / Iter(MeshV, MeshF, S, S))\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \" N=10\\n NN=N*N\\n DIM A(NN,NN+1)\\n\\n NODE=0\\n FOR ROW=1 TO N\\n FOR COL=1 TO N\\n NODE=NODE+1\\n IF ROW>1 THEN\\n A(NODE,NODE)=A(NODE,NODE)+1\\n A(NODE,NODE-N)=-1\\n END IF\\n IF ROW<N THEN\\n A(NODE,NODE)=A(NODE,NODE)+1\\n A(NODE,NODE+N)=-1\\n END IF\\n IF COL>1 THEN\\n A(NODE,NODE)=A(NODE,NODE)+1\\n A(NODE,NODE-1)=-1\\n END IF\\n IF COL<N THEN\\n A(NODE,NODE)=A(NODE,NODE)+1\\n A(NODE,NODE+1)=-1\\n END IF\\n NEXT\\n NEXT\\n\\n AR=2 : AC=2 : A=AC+N*(AR-1)\\n BR=7 : BC=8 : B=BC+N*(BR-1)\\n A(A,NN+1)=-1\\n A(B,NN+1)=1\\n\\n PRINT \\\"Nodes \\\",A,B\\n\\n // solve linear system\\n // using Gauss-Seidel method\\n // with pivoting\\n R=NN\\n\\n FOR J=1 TO R\\n FOR I=J TO R\\n IF A(I,J)<>0 BREAK\\n NEXT\\n IF I=R+1 THEN\\n PRINT \\\"No solution!\\\"\\n END\\n END IF\\n FOR K=1 TO R+1\\n T = A(J,K)\\n A(J,K) = A(I,K)\\n A(I,K) = T\\n NEXT\\n Y=1/A(J,J)\\n FOR K=1 TO R+1\\n A(J,K)=Y*A(J,K)\\n NEXT\\n FOR I=1 TO R\\n IF I<>J THEN\\n Y=-A(I,J)\\n FOR K=1 TO R+1\\n A(I,K)=A(I,K)+Y*A(J,K)\\n NEXT\\n END IF\\n NEXT\\n NEXT\\n PRINT \\\"Resistence = \\\"; : PRINT ABS(A(A,NN+1)-A(B,NN+1)) USING \\\"%1.13f\\\"\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"var [const] GSL=Import(\\\"zklGSL\\\");\\t// libGSL (GNU Scientific Library)\\nfcn onGrid(i,j,p,q){ ((0<=i<p) and (0<=j<q)) }\\nfcn gridResistor(p,q, ai,aj, bi,bj){\\n n,A := p*q, GSL.Matrix(n,n); // zero filled\\n foreach i,j in (p,q){\\n k:=i*q + j;\\n if(i==ai and j==aj) A[k,k]=1;\\n else{\\n\\t c:=0;\\n\\t if(onGrid(i+1,j, p,q)){ c+=1; A[k, k+q]=-1 }\\n\\t if(onGrid(i-1,j, p,q)){ c+=1; A[k, k-q]=-1 }\\n\\t if(onGrid(i, j+1, p,q)){ c+=1; A[k, k+1]=-1 }\\n\\t if(onGrid(i, j-1, p,q)){ c+=1; A[k, k-1]=-1 }\\n\\t A[k,k]=c;\\n }\\n }\\n b:=GSL.Vector(n); // zero filled\\n b[k:=bi*q + bj]=1;\\n A.AxEQb(b)[k];\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"gridResistor(10,10, 1,1, 7,6).println();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Resistor-mesh"}}},{"rowIdx":1581,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Respond_to_an_unknown_method_call\nnote: Object oriented\n","language":"00-META"},{"code":";Task:\nDemonstrate how to make the object respond (sensibly/usefully) to an invocation of a method on it that it does not support through its class definitions. \n\nNote that this is not the same as just invoking a defined method whose name is given dynamically; the method named at the point of invocation must not be defined.\n\nThis task is intended only for object systems that use a dynamic dispatch mechanism without static checking.\n\n\n;Related task:\n* [[Send an unknown method call]].\n<br><br>\n\n","language":"00-TASK"},{"code":"class example\n{\n foo()\n {\n Msgbox Called example.foo()\n }\n\n __Call(method, params*)\n {\n funcRef := Func(funcName := this.__class \".\" method)\n if !IsObject(funcRef)\n {\n str := \"Called undefined method \" funcName \"() with these parameters:\"\n for k,v in params\n str .= \"`n\" v\n Msgbox %str%\n }\n else\n {\n return funcRef.(this, params*)\n }\n }\n}\n\nex := new example\nex.foo()\nex.bar(1,2)\n","language":"AutoHotkey"},{"code":"example = object.new\n\nexample.no_method = { meth_name, *args |\n p \"#{meth_name} was called with these arguments: #{args}\"\n}\n\nexample.this_does_not_exist \"at all\" #Prints \"this_does_not_exist was called with these arguments: [at all]\"\n","language":"Brat"},{"code":"class animal {\npublic:\n virtual void bark() // concrete virtual, not pure\n {\n throw \"implement me: do not know how to bark\";\n }\n};\n\nclass elephant : public animal // does not implement bark()\n{\n};\n\nint main()\n{\n elephant e;\n e.bark(); // throws exception\n}\n","language":"C++"},{"code":"using System;\nusing System.Dynamic;\n\nclass Example : DynamicObject\n{\n public override bool TryInvokeMember(InvokeMemberBinder binder, object[] args, out object result)\n {\n result = null;\n\n Console.WriteLine(\"This is {0}.\", binder.Name);\n return true;\n }\n}\n\nclass Program\n{\n static void Main(string[] args)\n {\n dynamic ex = new Example();\n\n ex.Foo();\n ex.Bar();\n }\n}\n","language":"C-sharp"},{"code":"(defgeneric do-something (thing)\n (:documentation \"Do something to thing.\"))\n\n(defmethod no-applicable-method ((method (eql #'do-something)) &rest args)\n (format nil \"No method for ~w on ~w.\" method args))\n\n(defmethod do-something ((thing (eql 3)))\n (format nil \"Do something to ~w.\" thing))\n","language":"Common-Lisp"},{"code":"(list (do-something 3) (do-something 4))\n","language":"Common-Lisp"},{"code":"(\"Do something to 3.\"\n \"No method for #<STANDARD-GENERIC-FUNCTION DO-SOMETHING 214FC042> on (4).\")\n","language":"Common-Lisp"},{"code":"import std.stdio;\n\nstruct Catcher {\n void foo() { writeln(\"This is foo\"); }\n\n void bar() { writeln(\"This is bar\"); }\n\n void opDispatch(string name, ArgsTypes...)(ArgsTypes args) {\n writef(\"Tried to handle unknown method '%s'\", name);\n if (ArgsTypes.length) {\n write(\", with arguments: \");\n foreach (arg; args)\n write(arg, \" \");\n }\n writeln();\n }\n}\n\nvoid main() {\n Catcher ca;\n ca.foo();\n ca.bar();\n ca.grill();\n ca.ding(\"dong\", 11);\n}\n","language":"D"},{"code":"def example {\n to foo() { println(\"this is foo\") }\n to bar() { println(\"this is bar\") }\n match [verb, args] {\n println(`got unrecognized message $verb`)\n if (args.size() > 0) {\n println(`it had arguments: $args`)\n }\n }\n}\n","language":"E"},{"code":"import extensions;\n\nclass Example\n{\n generic()\n {\n // __received is an built-in variable containing the incoming message name\n console.printLine(__received,\" was invoked\")\n }\n\n generic(x)\n {\n console.printLine(__received,\"(\",x,\") was invoked\")\n }\n\n generic(x,y)\n {\n console.printLine(__received,\"(\",x,\",\",y,\") was invoked\")\n }\n}\n\npublic program()\n{\n var o := new Example();\n\n o.foo();\n o.bar(1);\n o.someMethod(1,2)\n}\n","language":"Elena"},{"code":"class CatchThemAll {\n def foo {\n \"foo received\" println\n }\n\n def bar {\n \"bar received\" println\n }\n\n def unknown_message: msg with_params: params {\n \"message: \" ++ msg print\n \"arguments: \" ++ (params join: \", \") println\n }\n}\n\na = CatchThemAll new\na foo\na bar\na we_can_do_it\na they_can_too: \"eat\" and: \"walk\"\n","language":"Fancy"},{"code":"class A\n{\n public Void doit (Int n)\n {\n echo (\"known function called on $n\")\n }\n\n // override the 'trap' method, which catches dynamic invocations of methods\n override Obj? trap(Str name, Obj?[]? args := null)\n {\n try\n {\n return super.trap(name, args)\n }\n catch (UnknownSlotErr err)\n {\n echo (\"In trap, you called: \" + name + \" with args \" + args.join(\",\"))\n return null\n }\n }\n}\n\nclass Main\n{\n public static Void main ()\n {\n a := A()\n // note the dynamic dispatch\n a->doit (1)\n a->methodName (1, 2, 3)\n }\n}\n","language":"Fantom"},{"code":"include FMS-SI.f\ninclude FMS-SILib.f\n\nvar x \\ instantiate a class var object named x\nx add: \\ => \"aborted: message not understood\"\n","language":"Forth"},{"code":"Type Method\n Func As Function() As String\nEnd Type\n\nFunction DefaultMethod() As String\n Return \"no such method\"\nEnd Function\n\nType Objeto\n Methods As Method Ptr\nEnd Type\n\nSub Invoke(obj As Objeto, methodName As String)\n If methodName = \"exists\" Then\n Print obj.Methods->Func()\n Else\n Print DefaultMethod()\n End If\nEnd Sub\n\nFunction exists() As String\n Return \"exists\"\nEnd Function\n\nFunction CreateObject() As Objeto\n Dim As Objeto obj\n Dim As Method met\n met.Func = @exists\n obj.Methods = @met\n Return obj\nEnd Function\n\nDim As Objeto o = CreateObject()\nInvoke(o, \"exists\")\nInvoke(o, \"non_existent_method\")\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"reflect\"\n)\n\ntype example struct{}\n\nfunc (example) Foo() int {\n return 42\n}\n\n// a method to call another method by name\nfunc (e example) CallMethod(n string) int {\n if m := reflect.ValueOf(e).MethodByName(n); m.IsValid() {\n // it's known. call it.\n return int(m.Call(nil)[0].Int())\n }\n // otherwise it's unknown. handle as needed.\n fmt.Println(\"Unknown method:\", n)\n return 0\n}\n\nfunc main() {\n var e example\n fmt.Println(e.CallMethod(\"Foo\"))\n fmt.Println(e.CallMethod(\"Bar\"))\n}\n","language":"Go"},{"code":"class MyObject {\n def foo() {\n println 'Invoked foo'\n }\n def methodMissing(String name, args) {\n println \"Invoked missing method $name$args\"\n }\n}\n","language":"Groovy"},{"code":"def o = new MyObject()\no.foo()\no.bar()\no.bar(1, 2, 'Test')\n","language":"Groovy"},{"code":"procedure DynMethod(obj,meth,arglist[])\n local m\n\n if not (type(obj) ? ( tab(find(\"__\")), =\"__state\", pos(0))) then\n runerr(205,obj) # invalid value - not an object\n\n if meth == (\"initially\"|\"UndefinedMethod\") then fail # avoid protected\n\n m := obj.__m # get methods list\n if fieldnames(m) == meth then # method exists?\n return m[meth]!push(copy(arglist),obj) # ... call it\n else\n if fieldnames(m) == \"UndefinedMethod\" then # handler exists?\n return obj.UndefinedMethod!arglist # ... call it\n else runerr(207,obj) # error invalid method (i.e. field)\nend\n","language":"Groovy"},{"code":"procedure main()\n x := foo()\n y := foo2()\n\n x.a() # example of normal method call\n DynMethod(x,\"a\") # using DynMethod\n DynMethod(x,\"simplydoesntexist\") # results in error\n DynMethod(y,\"simplydoesntexist\") # catches error\n DynMethod(y,\"simplydoesntexist\",1,2,3,4,5) # with parameters\nend\n\nclass foo(A) # sample class and methods\n method a(p1)\n l1 := p1\n return\n end\n method b(p2)\n l2 := p2\n return\n end\n initially\n i1 := 0\n return\nend\n\nclass foo2 : foo (A)\n method UndefinedMethod(x[]) # Undefined Method handler\n write(&errout,\"You called an undefinded method of this object.\")\n return\n end\nend\n","language":"Groovy"},{"code":"Example := Object clone do(\n foo := method(writeln(\"this is foo\"))\n bar := method(writeln(\"this is bar\"))\n forward := method(\n writeln(\"tried to handle unknown method \",call message name)\n if( call hasArgs,\n writeln(\"it had arguments: \",call evalArgs)\n )\n )\n)\n\nexample := Example clone\n\nexample foo // prints \"this is foo\"\nexample bar // prints \"this is bar\"\nexample grill // prints \"tried to handle unknown method grill\"\nexample ding(\"dong\") // prints \"tried to handle unknown method ding\"\n // prints \"it had arguments: list(\"dong\")\"\n","language":"Io"},{"code":"example=:3 :0\n doSomething_z_=: assert&0 bind 'doSomething was not implemented'\n doSomething__y ''\n)\n\ndoSomething_adhoc1_=: smoutput bind 'hello world'\ndSomethingElse_adhoc2_=: smoutput bind 'hello world'\n","language":"J"},{"code":" example <'adhoc1'\nhello world\n example<'adhoc2'\n|doSomething was not implemented: assert\n","language":"J"},{"code":"obj = new Proxy({},\n { get : function(target, prop)\n {\n if(target[prop] === undefined)\n return function() {\n console.log('an otherwise undefined function!!');\n };\n else\n return target[prop];\n }\n });\nobj.f() ///'an otherwise undefined function!!'\nobj.l = function() {console.log(45);};\nobj.l(); ///45\n","language":"JavaScript"},{"code":"var example = new Object;\nexample.foo = function () {\n alert(\"this is foo\");\n}\nexample.bar = function () {\n alert(\"this is bar\");\n}\nexample.__noSuchMethod__ = function (id, args) {\n alert(\"tried to handle unknown method \" + id);\n if (args.length != 0)\n alert(\"it had arguments: \" + args);\n}\n\nexample.foo(); // alerts \"this is foo\"\nexample.bar(); // alerts \"this is bar\"\nexample.grill(); // alerts \"tried to handle unknown method grill\"\nexample.ding(\"dong\"); // alerts \"tried to handle unknown method ding\"\n // alerts \"it had arguments: dong\n","language":"JavaScript"},{"code":"function add(a, b)\n try\n a + b\n catch\n println(\"caught exception\")\n a * b\n end\nend\n\n\nprintln(add(2, 6))\nprintln(add(1//2, 1//2))\nprintln(add(\"Hello \", \"world\"))\n","language":"Julia"},{"code":"// Kotlin JS version 1.2.0 (Firefox 43)\n\nclass C {\n // this method prevents a TypeError being thrown if an unknown method is called\n fun __noSuchMethod__(id: String, args: Array<Any>) {\n println(\"Class C does not have a method called $id\")\n if (args.size > 0) println(\"which takes arguments: ${args.asList()}\")\n }\n}\n\nfun main(args: Array<String>) {\n val c: dynamic = C() // 'dynamic' turns off compile time checks\n c.foo() // the compiler now allows this call even though foo() is undefined\n}\n","language":"Kotlin"},{"code":"define exampletype => type {\n\tpublic foo() => {\n\t\treturn 'this is foo\\r'\n\t}\n\tpublic bar() => {\n\t\treturn 'this is bar\\r'\n\t}\n\tpublic _unknownTag(...) => {\n\t\tlocal(n = method_name->asString)\n\t\treturn 'tried to handle unknown method called \"'+#n+'\"'+\n\t\t\t(#rest->size ? ' with args: \"'+#rest->join(',')+'\"')+'\\r'\n\t}\n}\n\nlocal(e = exampletype)\n\n#e->foo()\n// outputs 'this is foo'\n\n#e->bar()\n// outputs 'this is bar'\n\n#e->stuff()\n// outputs 'tried to handle unknown method called \"stuff\"'\n\n#e->dothis('here',12,'there','nowhere')\n// outputs 'tried to handle unknown method called \"dothis\" with args: \"here,12,there,nowhere\"'\n","language":"Lasso"},{"code":":- object(foo).\n\n\t:- public(try/0).\n\ttry :-\n\t\tcatch(bar::message, Error, handler(Error)).\n\n\thandler(error(existence_error(predicate_declaration,message/0),_)) :-\n\t\t% handle the unknown message\n\t\t...\n\n:- end_object.\n","language":"Logtalk"},{"code":":- object(foo,\n\timplements(forwarding)).\n\n\tforward(Message) :-\n\t\t% handle the unknown message\n\t\t...\n\n:- end_object.\n","language":"Logtalk"},{"code":"local object={print=print}\nsetmetatable(object,{__index=function(t,k)return function() print(\"You called the method\",k)end end})\nobject.print(\"Hi\") -->Hi\nobject.hello() -->You called the method hello\n","language":"Lua"},{"code":"module checkit {\n\n Class Alfa {\n k=1000\n module a (x, y) {\n Print x, y\n }\n module NoParam {\n Print \"ok\"\n }\n Function Sqr(x) {\n =Sqrt(x)\n }\n Function NoParam {\n =.k\n }\n Function Sqr$(x) {\n =Str$(Sqrt(x),1033) ' using locale 1033, no leading space for positive\n }\n }\n \\\\ modules, functions numeric and string, and variables can use same name\n \\\\ here we have module invoke, function invoke, and function invoke$\n Module invoke (&a, method$) {\n param=(,)\n Read ? param\n Function Check(&a, method$) {\n group b type \"module \"+method$+\" {}\"\n =valid(@a as b)\n }\n if check(&a, method$) then {\n for a {\n \\\\ we call this.methodname\n call \".\"+method$, !param\n }\n } else Flush : Error \"unknown method \"+method$ ' flush empty the stack\n }\n Function invoke (&a, method$) {\n \\\\ functions have own stack of values\n Function Check(&a, method$) {\n group b type \"Function \"+filter$(method$, \"()\")+\" {}\"\n =valid(@a as b)\n }\n if check(&a, method$) then {\n for a {\n =Function(\".\"+method$, ![])\n }\n } else Error \"unknown Function \"+method$\n }\n \\\\ invoke string functions\n Function invoke$ (&a, method$) {\n \\\\ functions have own stack of values\n Function Check(&a, method$) {\n group b type \"Function \"+filter$(method$, \"()\")+\" {}\"\n =valid(@a as b)\n }\n if check(&a, method$) then {\n for a {\n \\\\ [] is a function which return current stack as a stack object, and pass to current stack a new stack object.\n =Function$(\".\"+method$, ![])\n }\n } else Error \"unknown Function \"+method$\n }\n\n Module obj.alfa {\n Flush 'empty stack\n Print \"this is a fake module, is not part of obj\"\n }\n Function obj.alfa {\n Print \"this is a fake function, is not part of obj\"\n }\n Obj=Alfa()\n \\\\ normal invoke, interpreter not know that this is an object method\n \\\\ this method has a weak reference to obj, so anytime we use This. or just dot, this weak reference make the real name to execute\n Obj.a 10,20\n \\\\ call the fake method (can't access object methods and properties), has empty weak reference to object\n obj.alfa 10, 20\n\n \\\\ check before call using custom invoke\n \\\\ to check if a method (module) exist, we have to compare this object with other temporary object\n \\\\ we make one with the method name and empty definition, and then check if obj has anything this temp object has\n \\\\ arguments passed in a tuple (optional), so we didn't leave stack with unused items, if we have an unknown method.\n invoke &obj, \"a\", (10, 20)\n invoke &obj, \"NoParam\"\n \\\\ now with an unknown method, using alfa\n Try ok {\n invoke &obj, \"Alfa\", (10, 20)\n }\n If Error Then Print Error$\n \\\\ we can use invoke for functions\n Print Invoke(&obj, \"Sqr()\", 4), Invoke(&obj, \"NoParam()\")\n Print Invoke$(&obj, \"Sqr$()\",2)\n \\ without custom invoke\n Print obj.Sqr(4), obj.Noparam(), obj.Sqr$(2)\n \\\\ so now we try to call Alfa() and Alfa$() (unknown functions)\n Try ok {\n Print Invoke(&obj, \"Alfa()\")\n }\n If Error Then Print Error$\n Try ok {\n Print Invoke$(&obj, \"Alfa$()\")\n }\n If Error Then Print Error$\n\n\n \\\\ so now lets copy obj to obj2\n \\\\ fake method didn't passed to new object\n obj2=obj\n Try ok {\n invoke &obj2, \"alfa\", (10, 20)\n }\n If Error Then Print Error$\n\n p->obj2\n \\\\ if p is a pointer to named group we can pass it as is\n invoke &p, \"a\", (10, 20)\n \\\\ normal called\n p=>a 10,20\n\n For p {\n invoke &this, \"a\", (10, 20)\n Try ok {\n invoke &this, \"alfa\", (10, 20)\n }\n If Error Then Print Error$\n }\n\n p->(obj2) ' p point to a copy of obj2 (an unnamed group)\n For p {\n invoke &this, \"a\", (10, 20)\n \\\\ normal called\n p=>a 10, 20\n Try ok {\n invoke &this, \"alfa\", (10, 20)\n }\n If Error Then Print Error$\n\n }\n\n}\ncheckit\n","language":"M2000-Interpreter"},{"code":"obj[foo] = \"This is foo.\";\nobj[bar] = \"This is bar.\";\nobj[f_Symbol] := \"What is \" <> SymbolName[f] <> \"?\";\nPrint[obj@foo];\nPrint[obj@bar];\nPrint[obj@baz];\n","language":"Mathematica"},{"code":"{.experimental:\"dotOperators\".}\nfrom strutils import join\n\ntype Foo = object\n\nproc qux(f:Foo) = echo \"called qux\"\n\n#for nicer output\nfunc quoteStrings[T](x:T):string = (when T is string: \"\\\"\" & x & \"\\\"\" else: $x)\n\n#dot operator catches all unmatched calls on Foo\ntemplate `.()`(f:Foo,field:untyped,args:varargs[string,quoteStrings]):untyped =\n echo \"tried to call method '\" & astToStr(`field`) & (if `args`.len > 0: \"' with args: \" & args.join(\", \") else: \"'\")\n\nlet f = Foo()\nf.bar()\n#f.bar #error: undeclared field\nf.baz(\"hi\",5)\nf.qux()\nf.qux(\"nope\")\n","language":"Nim"},{"code":"unit MyObjDef;\n{$mode objfpc}{$h+}\ninterface\n\nuses\n SysUtils, Variants;\n\n function MyObjCreate: Variant;\n\nimplementation\n\nvar\n MyObjType: TInvokeableVariantType;\n\ntype\n TMyObjType = class(TInvokeableVariantType)\n procedure Clear(var V: TVarData); override;\n procedure Copy(var aDst: TVarData; const aSrc: TVarData; const Indir: Boolean); override;\n function GetProperty(var aDst: TVarData; const aData: TVarData; const aName: string): Boolean; override;\n end;\n\nfunction MyObjCreate: Variant;\nbegin\n Result := Unassigned;\n TVarData(Result).VType := MyObjType.VarType;\nend;\n\nprocedure TMyObjType.Clear(var V: TVarData);\nbegin\n V.VType := varEmpty;\nend;\n\nprocedure TMyObjType.Copy(var aDst: TVarData; const aSrc: TVarData; const Indir: Boolean);\nbegin\n VarClear(Variant(aDst));\n aDst := aSrc;\nend;\n\nfunction TMyObjType.GetProperty(var aDst: TVarData; const aData: TVarData; const aName: string): Boolean;\nbegin\n Result := True;\n case LowerCase(aName) of\n 'bark': Variant(aDst) := 'WOF WOF!';\n 'moo': Variant(aDst) := 'Mooo!';\n else\n Variant(aDst) := Format('Sorry, what is \"%s\"?', [aName]);\n end;\nend;\n\ninitialization\n MyObjType := TMyObjType.Create;\nfinalization\n MyObjType.Free;\nend.\n","language":"Object-Pascal"},{"code":"program Test;\n{$mode objfpc}{$h+}\nuses\n MyObjDef;\n\nvar\n MyObj: Variant;\n\nbegin\n MyObj := MyObjCreate;\n WriteLn(MyObj.Bark);\n WriteLn(MyObj.Moo);\n WriteLn(MyObj.Meow);\nend.\n","language":"Object-Pascal"},{"code":"#include <Foundation/Foundation.h>\n\n// The methods need to be declared somewhere\n@interface Dummy : NSObject\n- (void)grill;\n- (void)ding:(NSString *)s;\n@end\n\n@interface Example : NSObject\n- (void)foo;\n- (void)bar;\n@end\n\n@implementation Example\n- (void)foo {\n NSLog(@\"this is foo\");\n}\n\n- (void)bar {\n NSLog(@\"this is bar\");\n}\n\n- (void)forwardInvocation:(NSInvocation *)inv {\n NSLog(@\"tried to handle unknown method %@\", NSStringFromSelector([inv selector]));\n NSUInteger n = [[inv methodSignature] numberOfArguments];\n for (NSUInteger i = 0; i < n-2; i++) { // First two arguments are the object and selector.\n id __unsafe_unretained arg; // We assume that all arguments are objects.\n // getArguments: is type-agnostic and does not perform memory management,\n // therefore we must pass it a pointer to an unretained type\n [inv getArgument:&arg atIndex:i+2];\n NSLog(@\"argument #%lu: %@\", i, arg);\n }\n}\n\n// forwardInvocation: does not work without methodSignatureForSelector:\n// The runtime uses the signature returned here to construct the invocation.\n- (NSMethodSignature *)methodSignatureForSelector:(SEL)aSelector {\n int numArgs = [[NSStringFromSelector(aSelector) componentsSeparatedByString:@\":\"] count] - 1;\n // we assume that all arguments are objects\n // The type encoding is \"v@:@@@...\", where \"v\" is the return type, void\n // \"@\" is the receiver, object type; \":\" is the selector of the current method;\n // and each \"@\" after corresponds to an object argument\n return [NSMethodSignature signatureWithObjCTypes:\n [[@\"v@:\" stringByPaddingToLength:numArgs+3 withString:@\"@\" startingAtIndex:0] UTF8String]];\n}\n@end\n\nint main()\n{\n @autoreleasepool {\n\n id example = [[Example alloc] init];\n\n [example foo]; // prints \"this is foo\"\n [example bar]; // prints \"this is bar\"\n [example grill]; // prints \"tried to handle unknown method grill\"\n [example ding:@\"dong\"]; // prints \"tried to handle unknown method ding:\"\n // prints \"argument #0: dong\"\n\n }\n return 0;\n}\n","language":"Objective-C"},{"code":"1 first\n[1:interpreter] ExRuntime : 1 does not understand method <#first>\n","language":"Oforth"},{"code":"1 \"first\" asMethod perform\n[1:interpreter] ExRuntime : 1 does not understand method <#first>\n","language":"Oforth"},{"code":"1 \"unknow_method\" asMethod perform\n[1:interpreter] ExRuntime : null does not understand method <#perform>\n","language":"Oforth"},{"code":"Object Class new: MyClass\nMyClass method: doesNotUnderstand(m)\n \"Well, sorry, I don't understand \" print m println ;\n\nMyClass new first\nWell, sorry, I don't understand #first\n","language":"Oforth"},{"code":"u = .unknown~new\nu~foo(1, 2, 3)\n\n::class unknown\n::method unknown\n use arg name, args\n say \"Unknown method\" name \"invoked with arguments:\" args~tostring('l',', ')\n","language":"OoRexx"},{"code":"declare\n class Example\n meth init skip end\n\n meth foo {System.showInfo foo} end\n\n meth bar {System.showInfo bar} end\n\n meth otherwise(Msg)\n {System.showInfo \"Unknown method \"#{Label Msg}}\n if {Width Msg} > 0 then\n {System.printInfo \"Arguments: \"}\n {System.show {Record.toListInd Msg}}\n end\n end\n end\n\n Object = {New Example init}\n in\n {Object foo}\n {Object bar}\n {Object grill}\n {Object ding(dong)}\n","language":"Oz"},{"code":"package Example;\nsub new {\n bless {}\n}\nsub foo {\n print \"this is foo\\n\";\n}\nsub bar {\n print \"this is bar\\n\";\n}\nsub AUTOLOAD {\n my $name = $Example::AUTOLOAD;\n my ($self, @args) = @_;\n print \"tried to handle unknown method $name\\n\";\n if (@args) {\n print \"it had arguments: @args\\n\";\n }\n}\nsub DESTROY {} # dummy method to prevent AUTOLOAD from\n # being triggered when an Example is\n # destroyed\n\npackage main;\nmy $example = Example->new;\n\n$example->foo; # prints \"this is foo\"\n$example->bar; # prints \"this is bar\"\n$example->grill; # prints \"tried to handle unknown method Example::grill\"\n$example->ding(\"dong\"); # prints \"tried to handle unknown method Example::ding\"\n # and \"it had arguments: dong\"\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">enum</span> <span style=\"color: #000000;\">METHODS</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">invoke</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">args</span><span style=\"color: #0000FF;\">={})</span>\n <span style=\"color: #000080;font-style:italic;\">--(this works on any class, for any function, with any number or type of parameters)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">mdict</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">METHODS</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">node</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">getd_index</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">mdict</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">node</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">call_func</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">getd_by_index</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">node</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">mdict</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">args</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #008000;\">\"no such method\"</span> <span style=\"color: #000080;font-style:italic;\">-- or throw(), fatal(), etc</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #000080;font-style:italic;\">--class X: Xmethods emulates a vtable</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">Xmethods</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">new_dict</span><span style=\"color: #0000FF;\">()</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">exists</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #008000;\">\"exists\"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #7060A8;\">setd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"exists\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">routine_id</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"exists\"</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">Xmethods</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000080;font-style:italic;\">--class X: create new instances</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">newX</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">Xmethods</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">x</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">newX</span><span style=\"color: #0000FF;\">()</span>\n\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">invoke</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"exists\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">invoke</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"non_existent_method\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"<?php\nclass Example {\n function foo() {\n echo \"this is foo\\n\";\n }\n function bar() {\n echo \"this is bar\\n\";\n }\n function __call($name, $args) {\n echo \"tried to handle unknown method $name\\n\";\n if ($args)\n echo \"it had arguments: \", implode(', ', $args), \"\\n\";\n }\n}\n\n$example = new Example();\n\n$example->foo(); // prints \"this is foo\"\n$example->bar(); // prints \"this is bar\"\n$example->grill(); // prints \"tried to handle unknown method grill\"\n$example->ding(\"dong\"); // prints \"tried to handle unknown method ding\"\n // prints \"it had arguments: dong\n?>\n","language":"PHP"},{"code":"(redef send (Msg Obj . @)\n (or\n (pass try Msg Obj)\n (pass 'no-applicable-method> Obj Msg) ) )\n\n(de no-applicable-method> (This Msg)\n (pack \"No method for \" Msg \" on \" This) )\n\n(class +A)\n\n(dm do-something> ()\n (pack \"Do something to \" This) )\n","language":"PicoLisp"},{"code":": (object 'A '(+A))\n-> A\n: (object 'B '(+B))\n-> B\n: (list (send 'do-something> 'A) (send 'do-something> 'B))\n-> (\"Do something to A\" \"No method for do-something> on B\")\n","language":"PicoLisp"},{"code":"class CatchAll\n{\n mixed `->(string name)\n {\n return lambda(int arg){ write(\"you are calling %s(%d);\\n\", name, arg); };\n }\n}\n\n> CatchAll()->hello(5);\nyou are calling hello(5);\n> CatchAll()->something(99);\nyou are calling something(99);\n","language":"Pike"},{"code":"class Example(object):\n def foo(self):\n print(\"this is foo\")\n def bar(self):\n print(\"this is bar\")\n def __getattr__(self, name):\n def method(*args):\n print(\"tried to handle unknown method \" + name)\n if args:\n print(\"it had arguments: \" + str(args))\n return method\n\nexample = Example()\n\nexample.foo() # prints “this is foo”\nexample.bar() # prints “this is bar”\nexample.grill() # prints “tried to handle unknown method grill”\nexample.ding(\"dong\") # prints “tried to handle unknown method ding”\n # prints “it had arguments: ('dong',)”\n","language":"Python"},{"code":"#lang racket\n\n(require racket/class)\n\n(define-syntax-rule (send~ obj method x ...)\n ;; note: this is a naive macro, a real one should avoid evaluating `obj' and\n ;; the `xs' more than once\n (with-handlers ([(λ(e) (and (exn:fail:object? e)\n ;; only do this if there *is* an `unknown-method'\n (memq 'unknown-method (interface->method-names\n (object-interface o)))))\n (λ(e) (send obj unknown-method 'method x ...))])\n (send obj method x ...)))\n\n(define foo%\n (class object%\n (define/public (foo x)\n (printf \"foo: ~s\\n\" x))\n (define/public (unknown-method name . xs)\n (printf \"Unknown method ~s: ~s\\n\" name xs))\n (super-new)))\n\n(define o (new foo%))\n(send~ o foo 1) ; => foo: 1\n(send~ o whatever 1) ; Unknown method whatever: (1)\n","language":"Racket"},{"code":"#lang swindle\n\n(defgeneric (foo x))\n(defmethod (no-applicable-method [m (singleton foo)] xs)\n (echo \"No method in\" m \"for\" :w xs))\n(defmethod (foo [x <integer>]) (echo \"It's an integer\"))\n\n(foo 1)\n;; => It's an integer\n\n(foo \"one\")\n;; => No method in #<generic:foo> for \"one\"\n","language":"Racket"},{"code":"class Farragut {\n method FALLBACK ($name, *@rest) {\n say \"{self.WHAT.raku}: $name.tc() the @rest[], full speed ahead!\";\n }\n}\n\nclass Sparrow is Farragut { }\n\nFarragut.damn: 'torpedoes';\nSparrow.hoist: <Jolly Roger mateys>;\n","language":"Raku"},{"code":"class L-Value {\n our $.value = 10;\n method FALLBACK($name, |c) is rw { $.value }\n}\n\nmy $l = L-Value.new;\nsay $l.any-odd-name; # 10\n$l.some-other-name = 42;\nsay $l.i-dont-know; # 42\n","language":"Raku"},{"code":"load \"stdlibcore.ring\"\n\nnew test {\n anyMethodThatDoesNotExist()\t# Define and call the new method\n anyMethodThatDoesNotExist()\t# Call the new method\n}\n\nclass test\n func braceerror\n if substr(cCatchError,\"Error (R3)\")\n\t ? \"You are calling a method that doesn't exist!\"\n\t aError = Split(cCatchError,\" \")\n\t cMethodName = aError[len(aError)]\n\t ? \"The Method Name: \" + cMethodName\n\t AddMethod(self,cMethodName,func {\n\t\t ? \"Hello from the new method!\"\n\t })\n\t ? \"We defined the new method!\"\n\t call cMethodName()\n ok\n","language":"Ring"},{"code":"class Example\n def foo\n puts \"this is foo\"\n end\n def bar\n puts \"this is bar\"\n end\n def method_missing(name, *args, &block)\n puts \"tried to handle unknown method %s\" % name # name is a symbol\n unless args.empty?\n puts \"it had arguments: %p\" % [args]\n end\n end\nend\n\nexample = Example.new\n\nexample.foo # prints “this is foo”\nexample.bar # prints “this is bar”\nexample.grill # prints “tried to handle unknown method grill”\nexample.ding(\"dong\") # prints “tried to handle unknown method ding”\n # prints “it had arguments: [\"dong\"]”\n","language":"Ruby"},{"code":"class DynamicTest extends Dynamic\n{\n def foo()=println(\"this is foo\")\n def bar()=println(\"this is bar\")\n def applyDynamic(name: String)(args: Any*)={\n println(\"tried to handle unknown method \"+name)\n if(!args.isEmpty)\n println(\" it had arguments: \"+args.mkString(\",\"))\n }\n}\n\nobject DynamicTest {\n def main(args: Array[String]): Unit = {\n val d=new DynamicTest()\n d.foo()\n d.bar()\n d.grill()\n d.ding(\"dong\")\n }\n}\n","language":"Scala"},{"code":"class Example {\n method foo {\n say \"this is foo\"\n }\n method bar {\n say \"this is bar\"\n }\n method AUTOLOAD(_, name, *args) {\n say (\"tried to handle unknown method %s\" % name);\n if (args.len > 0) {\n say (\"it had arguments: %s\" % args.join(', '));\n }\n }\n}\n\nvar example = Example.new;\n\nexample.foo; # prints “this is foo”\nexample.bar; # prints “this is bar”\nexample.grill; # prints “tried to handle unknown method grill”\nexample.ding(\"dong\"); # prints “tried to handle unknown method ding”\n # prints “it had arguments: dong”\n","language":"Sidef"},{"code":"define: #shell &builder: [lobby newSubSpace].\n\n_@shell didNotUnderstand: message at: position\n\"Form a command string and execute it.\"\n[\n position > 0\n ifTrue: [resend]\n ifFalse:\n [([| :command |\n\tmessage selector isUnarySelector ifTrue:\n\t [command ; message selector.\n\t message optionals pairsDo:\n\t [| :key :value |\n\t command ; ' -' ; (key as: String) allButFirst allButLast ; ' ' ; (value as: String)]].\n\tmessage selector isKeywordSelector ifTrue:\n\t [| keywords args |\n\t keywords: ((message selector as: String) splitWith: $:).\n\t command ; keywords first.\n\t keywords size = 1 ifTrue: \"Read a string or array of arguments.\"\n\t [args: message arguments second.\n\t (args is: String) ifTrue: [command ; ' ' ; args]\n\t\t\t\tifFalse: [args do: [| :arg | command ; ' ' ; arg]]]]] writingAs: String)\n\t ifNil: [resend] ifNotNilDo: [| :cmd | [Platform run: cmd]]]\n].\n","language":"Slate"},{"code":"slate[1]> shell ls: '*.image'.\nkernel.new.little.64.1244260494374694.image slate2.image\nnet.image slate.image\nTrue\nslate[2]>\n","language":"Slate"},{"code":"Object subclass: CatchThemAll [\n foo [ 'foo received' displayNl ]\n\n bar [ 'bar received' displayNl ]\n\n doesNotUnderstand: aMessage [\n ('message \"' , (aMessage selector asString) , '\"') displayNl.\n (aMessage arguments) do: [ :a |\n 'argument: ' display. a printNl.\n ]\n ]\n]\n\n|a| a := CatchThemAll new.\na foo.\na bar.\na weCanDoIt.\na theyCanToo: 'eat' and: 'walk'.\n","language":"Smalltalk"},{"code":"[\n bla := someObject fooBar.\n foo := bla.\n] on: MessageNotUnderstood do:[:ex |\n ex return: 'fortyTwo'\n]\n","language":"Smalltalk"},{"code":"[\n bla := someObject fooBar.\n foo := bla.\n] on: MessageNotUnderstood do:[:ex |\n ((ex message selector == #fooBar) and: [ ex message receiver == someObject])\n ifTrue:[\n ex return: 'fortyTwo'\n ] ifFalse:[\n ex reject\n ]\n]\n","language":"Smalltalk"},{"code":"anObject perform:#fooBar ifNotUnderstood:[ ...some alternative code and return value... ].\n","language":"Smalltalk"},{"code":"Ingorabilis {\n\n\ttell {\n\t\t\"I told you so\".postln;\n\t}\n\n\tfind {\n\t\t\"I found nothing\".postln\n\t}\n\n\tdoesNotUnderstand { |selector ... args|\n\t\t\"Method selector '%' not understood by %\\n\".postf(selector, this.class);\n\t\t\"Giving you some good arguments in the following\".postln;\n\t\targs.do { |x| x.postln };\n\t\t\"And now I delegate the method to my respected superclass\".postln;\n\t\tsuper.doesNotUnderstand(selector, args)\n\t}\n\n}\n","language":"SuperCollider"},{"code":"i = Ingorabilis.new;\ni.tell; // prints \"I told you so\"\ni.find; // prints \"\"I found nothing\"\ni.think(1, 3, 4, 7);\n","language":"SuperCollider"},{"code":"Method selector 'think' not understood by Ingorabilis\nGiving you some good arguments in the following\n1\n3\n4\n7\nAnd now I delegate the method to my respected superclass\nERROR: Message 'think' not understood.\nRECEIVER:\nInstance of Ingorabilis { (0x1817b1398, gc=D4, fmt=00, flg=00, set=00)\n instance variables [0]\n}\n<...>\n","language":"SuperCollider"},{"code":"i = Ingorabilis.new\ntry { i.think } { \"We are not delegating to super, because I don't want it\".postln };\n","language":"SuperCollider"},{"code":"package require TclOO\n# First create a simple, conventional class and object\noo::class create Example {\n method foo {} {\n puts \"this is foo\"\n }\n method bar {} {\n puts \"this is bar\"\n }\n}\nExample create example\n\n# Modify the object to have a custom ‘unknown method’ interceptor\noo::objdefine example {\n method unknown {name args} {\n puts \"tried to handle unknown method \\\"$name\\\"\"\n if {[llength $args]} {\n puts \"it had arguments: $args\"\n }\n }\n}\n\n# Show off what we can now do...\nexample foo; # prints “this is foo”\nexample bar; # prints “this is bar”\nexample grill; # prints “tried to handle unknown method \"grill\"”\nexample ding dong; # prints “tried to handle unknown method \"ding\"”\n # prints “it had arguments: dong”\n","language":"Tcl"},{"code":"function handle_error {\n status=$?\n\n # 127 is: command not found\n if [[ $status -ne 127 ]]; then\n return\n fi\n\n lastcmd=$(history | tail -1 | sed 's/^ *[0-9]* *//')\n\n read cmd args <<< \"$lastcmd\"\n\n echo \"you tried to call $cmd\"\n}\n\n# Trap errors.\ntrap 'handle_error' ERR\n","language":"UNIX-Shell"},{"code":"import \"io\" for Stdin, Stdout\n\nclass Test {\n construct new() {}\n\n foo() { System.print(\"Foo called.\") }\n\n bar() { System.print(\"Bar called.\") }\n\n missingMethod(m) {\n System.print(m)\n System.write(\"Try and continue anyway y/n ? \")\n Stdout.flush()\n var reply = Stdin.readLine()\n if (reply != \"y\" && reply != \"Y\") {\n Fiber.abort(\"Decided to abort due to missing method.\")\n }\n }\n}\n\nvar test = Test.new()\nvar f = Fiber.new {\n test.foo()\n test.bar()\n test.baz()\n}\nf.try()\nvar err = f.error\nif (err) {\n if (err.startsWith(\"Test does not implement\")) {\n test.missingMethod(err)\n } else {\n Fiber.abort(err) // rethrow other errors\n }\n}\nSystem.print(\"OK, continuing.\")\n","language":"Wren"},{"code":"class C{ fcn __notFound(name){println(name,\" not in \",self); bar}\n fcn bar{vm.arglist.println(\"***\")}\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Respond_to_an_unknown_method_call\\nnote: Object oriented\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nDemonstrate how to make the object respond (sensibly/usefully) to an invocation of a method on it that it does not support through its class definitions. \\n\\nNote that this is not the same as just invoking a defined method whose name is given dynamically; the method named at the point of invocation must not be defined.\\n\\nThis task is intended only for object systems that use a dynamic dispatch mechanism without static checking.\\n\\n\\n;Related task:\\n* [[Send an unknown method call]].\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"class example\\n{\\n foo()\\n {\\n Msgbox Called example.foo()\\n }\\n\\n __Call(method, params*)\\n {\\n funcRef := Func(funcName := this.__class \\\".\\\" method)\\n if !IsObject(funcRef)\\n {\\n str := \\\"Called undefined method \\\" funcName \\\"() with these parameters:\\\"\\n for k,v in params\\n str .= \\\"`n\\\" v\\n Msgbox %str%\\n }\\n else\\n {\\n return funcRef.(this, params*)\\n }\\n }\\n}\\n\\nex := new example\\nex.foo()\\nex.bar(1,2)\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"example = object.new\\n\\nexample.no_method = { meth_name, *args |\\n p \\\"#{meth_name} was called with these arguments: #{args}\\\"\\n}\\n\\nexample.this_does_not_exist \\\"at all\\\" #Prints \\\"this_does_not_exist was called with these arguments: [at all]\\\"\\n\",\n \"language\": \"Brat\"\n },\n {\n \"code\": \"class animal {\\npublic:\\n virtual void bark() // concrete virtual, not pure\\n {\\n throw \\\"implement me: do not know how to bark\\\";\\n }\\n};\\n\\nclass elephant : public animal // does not implement bark()\\n{\\n};\\n\\nint main()\\n{\\n elephant e;\\n e.bark(); // throws exception\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Dynamic;\\n\\nclass Example : DynamicObject\\n{\\n public override bool TryInvokeMember(InvokeMemberBinder binder, object[] args, out object result)\\n {\\n result = null;\\n\\n Console.WriteLine(\\\"This is {0}.\\\", binder.Name);\\n return true;\\n }\\n}\\n\\nclass Program\\n{\\n static void Main(string[] args)\\n {\\n dynamic ex = new Example();\\n\\n ex.Foo();\\n ex.Bar();\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defgeneric do-something (thing)\\n (:documentation \\\"Do something to thing.\\\"))\\n\\n(defmethod no-applicable-method ((method (eql #'do-something)) &rest args)\\n (format nil \\\"No method for ~w on ~w.\\\" method args))\\n\\n(defmethod do-something ((thing (eql 3)))\\n (format nil \\\"Do something to ~w.\\\" thing))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(list (do-something 3) (do-something 4))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(\\\"Do something to 3.\\\"\\n \\\"No method for #<STANDARD-GENERIC-FUNCTION DO-SOMETHING 214FC042> on (4).\\\")\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio;\\n\\nstruct Catcher {\\n void foo() { writeln(\\\"This is foo\\\"); }\\n\\n void bar() { writeln(\\\"This is bar\\\"); }\\n\\n void opDispatch(string name, ArgsTypes...)(ArgsTypes args) {\\n writef(\\\"Tried to handle unknown method '%s'\\\", name);\\n if (ArgsTypes.length) {\\n write(\\\", with arguments: \\\");\\n foreach (arg; args)\\n write(arg, \\\" \\\");\\n }\\n writeln();\\n }\\n}\\n\\nvoid main() {\\n Catcher ca;\\n ca.foo();\\n ca.bar();\\n ca.grill();\\n ca.ding(\\\"dong\\\", 11);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"def example {\\n to foo() { println(\\\"this is foo\\\") }\\n to bar() { println(\\\"this is bar\\\") }\\n match [verb, args] {\\n println(`got unrecognized message $verb`)\\n if (args.size() > 0) {\\n println(`it had arguments: $args`)\\n }\\n }\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"import extensions;\\n\\nclass Example\\n{\\n generic()\\n {\\n // __received is an built-in variable containing the incoming message name\\n console.printLine(__received,\\\" was invoked\\\")\\n }\\n\\n generic(x)\\n {\\n console.printLine(__received,\\\"(\\\",x,\\\") was invoked\\\")\\n }\\n\\n generic(x,y)\\n {\\n console.printLine(__received,\\\"(\\\",x,\\\",\\\",y,\\\") was invoked\\\")\\n }\\n}\\n\\npublic program()\\n{\\n var o := new Example();\\n\\n o.foo();\\n o.bar(1);\\n o.someMethod(1,2)\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"class CatchThemAll {\\n def foo {\\n \\\"foo received\\\" println\\n }\\n\\n def bar {\\n \\\"bar received\\\" println\\n }\\n\\n def unknown_message: msg with_params: params {\\n \\\"message: \\\" ++ msg print\\n \\\"arguments: \\\" ++ (params join: \\\", \\\") println\\n }\\n}\\n\\na = CatchThemAll new\\na foo\\na bar\\na we_can_do_it\\na they_can_too: \\\"eat\\\" and: \\\"walk\\\"\\n\",\n \"language\": \"Fancy\"\n },\n {\n \"code\": \"class A\\n{\\n public Void doit (Int n)\\n {\\n echo (\\\"known function called on $n\\\")\\n }\\n\\n // override the 'trap' method, which catches dynamic invocations of methods\\n override Obj? trap(Str name, Obj?[]? args := null)\\n {\\n try\\n {\\n return super.trap(name, args)\\n }\\n catch (UnknownSlotErr err)\\n {\\n echo (\\\"In trap, you called: \\\" + name + \\\" with args \\\" + args.join(\\\",\\\"))\\n return null\\n }\\n }\\n}\\n\\nclass Main\\n{\\n public static Void main ()\\n {\\n a := A()\\n // note the dynamic dispatch\\n a->doit (1)\\n a->methodName (1, 2, 3)\\n }\\n}\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \"include FMS-SI.f\\ninclude FMS-SILib.f\\n\\nvar x \\\\ instantiate a class var object named x\\nx add: \\\\ => \\\"aborted: message not understood\\\"\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"Type Method\\n Func As Function() As String\\nEnd Type\\n\\nFunction DefaultMethod() As String\\n Return \\\"no such method\\\"\\nEnd Function\\n\\nType Objeto\\n Methods As Method Ptr\\nEnd Type\\n\\nSub Invoke(obj As Objeto, methodName As String)\\n If methodName = \\\"exists\\\" Then\\n Print obj.Methods->Func()\\n Else\\n Print DefaultMethod()\\n End If\\nEnd Sub\\n\\nFunction exists() As String\\n Return \\\"exists\\\"\\nEnd Function\\n\\nFunction CreateObject() As Objeto\\n Dim As Objeto obj\\n Dim As Method met\\n met.Func = @exists\\n obj.Methods = @met\\n Return obj\\nEnd Function\\n\\nDim As Objeto o = CreateObject()\\nInvoke(o, \\\"exists\\\")\\nInvoke(o, \\\"non_existent_method\\\")\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"reflect\\\"\\n)\\n\\ntype example struct{}\\n\\nfunc (example) Foo() int {\\n return 42\\n}\\n\\n// a method to call another method by name\\nfunc (e example) CallMethod(n string) int {\\n if m := reflect.ValueOf(e).MethodByName(n); m.IsValid() {\\n // it's known. call it.\\n return int(m.Call(nil)[0].Int())\\n }\\n // otherwise it's unknown. handle as needed.\\n fmt.Println(\\\"Unknown method:\\\", n)\\n return 0\\n}\\n\\nfunc main() {\\n var e example\\n fmt.Println(e.CallMethod(\\\"Foo\\\"))\\n fmt.Println(e.CallMethod(\\\"Bar\\\"))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"class MyObject {\\n def foo() {\\n println 'Invoked foo'\\n }\\n def methodMissing(String name, args) {\\n println \\\"Invoked missing method $name$args\\\"\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def o = new MyObject()\\no.foo()\\no.bar()\\no.bar(1, 2, 'Test')\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"procedure DynMethod(obj,meth,arglist[])\\n local m\\n\\n if not (type(obj) ? ( tab(find(\\\"__\\\")), =\\\"__state\\\", pos(0))) then\\n runerr(205,obj) # invalid value - not an object\\n\\n if meth == (\\\"initially\\\"|\\\"UndefinedMethod\\\") then fail # avoid protected\\n\\n m := obj.__m # get methods list\\n if fieldnames(m) == meth then # method exists?\\n return m[meth]!push(copy(arglist),obj) # ... call it\\n else\\n if fieldnames(m) == \\\"UndefinedMethod\\\" then # handler exists?\\n return obj.UndefinedMethod!arglist # ... call it\\n else runerr(207,obj) # error invalid method (i.e. field)\\nend\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"procedure main()\\n x := foo()\\n y := foo2()\\n\\n x.a() # example of normal method call\\n DynMethod(x,\\\"a\\\") # using DynMethod\\n DynMethod(x,\\\"simplydoesntexist\\\") # results in error\\n DynMethod(y,\\\"simplydoesntexist\\\") # catches error\\n DynMethod(y,\\\"simplydoesntexist\\\",1,2,3,4,5) # with parameters\\nend\\n\\nclass foo(A) # sample class and methods\\n method a(p1)\\n l1 := p1\\n return\\n end\\n method b(p2)\\n l2 := p2\\n return\\n end\\n initially\\n i1 := 0\\n return\\nend\\n\\nclass foo2 : foo (A)\\n method UndefinedMethod(x[]) # Undefined Method handler\\n write(&errout,\\\"You called an undefinded method of this object.\\\")\\n return\\n end\\nend\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"Example := Object clone do(\\n foo := method(writeln(\\\"this is foo\\\"))\\n bar := method(writeln(\\\"this is bar\\\"))\\n forward := method(\\n writeln(\\\"tried to handle unknown method \\\",call message name)\\n if( call hasArgs,\\n writeln(\\\"it had arguments: \\\",call evalArgs)\\n )\\n )\\n)\\n\\nexample := Example clone\\n\\nexample foo // prints \\\"this is foo\\\"\\nexample bar // prints \\\"this is bar\\\"\\nexample grill // prints \\\"tried to handle unknown method grill\\\"\\nexample ding(\\\"dong\\\") // prints \\\"tried to handle unknown method ding\\\"\\n // prints \\\"it had arguments: list(\\\"dong\\\")\\\"\\n\",\n \"language\": \"Io\"\n },\n {\n \"code\": \"example=:3 :0\\n doSomething_z_=: assert&0 bind 'doSomething was not implemented'\\n doSomething__y ''\\n)\\n\\ndoSomething_adhoc1_=: smoutput bind 'hello world'\\ndSomethingElse_adhoc2_=: smoutput bind 'hello world'\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" example <'adhoc1'\\nhello world\\n example<'adhoc2'\\n|doSomething was not implemented: assert\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"obj = new Proxy({},\\n { get : function(target, prop)\\n {\\n if(target[prop] === undefined)\\n return function() {\\n console.log('an otherwise undefined function!!');\\n };\\n else\\n return target[prop];\\n }\\n });\\nobj.f() ///'an otherwise undefined function!!'\\nobj.l = function() {console.log(45);};\\nobj.l(); ///45\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"var example = new Object;\\nexample.foo = function () {\\n alert(\\\"this is foo\\\");\\n}\\nexample.bar = function () {\\n alert(\\\"this is bar\\\");\\n}\\nexample.__noSuchMethod__ = function (id, args) {\\n alert(\\\"tried to handle unknown method \\\" + id);\\n if (args.length != 0)\\n alert(\\\"it had arguments: \\\" + args);\\n}\\n\\nexample.foo(); // alerts \\\"this is foo\\\"\\nexample.bar(); // alerts \\\"this is bar\\\"\\nexample.grill(); // alerts \\\"tried to handle unknown method grill\\\"\\nexample.ding(\\\"dong\\\"); // alerts \\\"tried to handle unknown method ding\\\"\\n // alerts \\\"it had arguments: dong\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"function add(a, b)\\n try\\n a + b\\n catch\\n println(\\\"caught exception\\\")\\n a * b\\n end\\nend\\n\\n\\nprintln(add(2, 6))\\nprintln(add(1//2, 1//2))\\nprintln(add(\\\"Hello \\\", \\\"world\\\"))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// Kotlin JS version 1.2.0 (Firefox 43)\\n\\nclass C {\\n // this method prevents a TypeError being thrown if an unknown method is called\\n fun __noSuchMethod__(id: String, args: Array<Any>) {\\n println(\\\"Class C does not have a method called $id\\\")\\n if (args.size > 0) println(\\\"which takes arguments: ${args.asList()}\\\")\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val c: dynamic = C() // 'dynamic' turns off compile time checks\\n c.foo() // the compiler now allows this call even though foo() is undefined\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"define exampletype => type {\\n\\tpublic foo() => {\\n\\t\\treturn 'this is foo\\\\r'\\n\\t}\\n\\tpublic bar() => {\\n\\t\\treturn 'this is bar\\\\r'\\n\\t}\\n\\tpublic _unknownTag(...) => {\\n\\t\\tlocal(n = method_name->asString)\\n\\t\\treturn 'tried to handle unknown method called \\\"'+#n+'\\\"'+\\n\\t\\t\\t(#rest->size ? ' with args: \\\"'+#rest->join(',')+'\\\"')+'\\\\r'\\n\\t}\\n}\\n\\nlocal(e = exampletype)\\n\\n#e->foo()\\n// outputs 'this is foo'\\n\\n#e->bar()\\n// outputs 'this is bar'\\n\\n#e->stuff()\\n// outputs 'tried to handle unknown method called \\\"stuff\\\"'\\n\\n#e->dothis('here',12,'there','nowhere')\\n// outputs 'tried to handle unknown method called \\\"dothis\\\" with args: \\\"here,12,there,nowhere\\\"'\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \":- object(foo).\\n\\n\\t:- public(try/0).\\n\\ttry :-\\n\\t\\tcatch(bar::message, Error, handler(Error)).\\n\\n\\thandler(error(existence_error(predicate_declaration,message/0),_)) :-\\n\\t\\t% handle the unknown message\\n\\t\\t...\\n\\n:- end_object.\\n\",\n \"language\": \"Logtalk\"\n },\n {\n \"code\": \":- object(foo,\\n\\timplements(forwarding)).\\n\\n\\tforward(Message) :-\\n\\t\\t% handle the unknown message\\n\\t\\t...\\n\\n:- end_object.\\n\",\n \"language\": \"Logtalk\"\n },\n {\n \"code\": \"local object={print=print}\\nsetmetatable(object,{__index=function(t,k)return function() print(\\\"You called the method\\\",k)end end})\\nobject.print(\\\"Hi\\\") -->Hi\\nobject.hello() -->You called the method hello\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"module checkit {\\n\\n Class Alfa {\\n k=1000\\n module a (x, y) {\\n Print x, y\\n }\\n module NoParam {\\n Print \\\"ok\\\"\\n }\\n Function Sqr(x) {\\n =Sqrt(x)\\n }\\n Function NoParam {\\n =.k\\n }\\n Function Sqr$(x) {\\n =Str$(Sqrt(x),1033) ' using locale 1033, no leading space for positive\\n }\\n }\\n \\\\\\\\ modules, functions numeric and string, and variables can use same name\\n \\\\\\\\ here we have module invoke, function invoke, and function invoke$\\n Module invoke (&a, method$) {\\n param=(,)\\n Read ? param\\n Function Check(&a, method$) {\\n group b type \\\"module \\\"+method$+\\\" {}\\\"\\n =valid(@a as b)\\n }\\n if check(&a, method$) then {\\n for a {\\n \\\\\\\\ we call this.methodname\\n call \\\".\\\"+method$, !param\\n }\\n } else Flush : Error \\\"unknown method \\\"+method$ ' flush empty the stack\\n }\\n Function invoke (&a, method$) {\\n \\\\\\\\ functions have own stack of values\\n Function Check(&a, method$) {\\n group b type \\\"Function \\\"+filter$(method$, \\\"()\\\")+\\\" {}\\\"\\n =valid(@a as b)\\n }\\n if check(&a, method$) then {\\n for a {\\n =Function(\\\".\\\"+method$, ![])\\n }\\n } else Error \\\"unknown Function \\\"+method$\\n }\\n \\\\\\\\ invoke string functions\\n Function invoke$ (&a, method$) {\\n \\\\\\\\ functions have own stack of values\\n Function Check(&a, method$) {\\n group b type \\\"Function \\\"+filter$(method$, \\\"()\\\")+\\\" {}\\\"\\n =valid(@a as b)\\n }\\n if check(&a, method$) then {\\n for a {\\n \\\\\\\\ [] is a function which return current stack as a stack object, and pass to current stack a new stack object.\\n =Function$(\\\".\\\"+method$, ![])\\n }\\n } else Error \\\"unknown Function \\\"+method$\\n }\\n\\n Module obj.alfa {\\n Flush 'empty stack\\n Print \\\"this is a fake module, is not part of obj\\\"\\n }\\n Function obj.alfa {\\n Print \\\"this is a fake function, is not part of obj\\\"\\n }\\n Obj=Alfa()\\n \\\\\\\\ normal invoke, interpreter not know that this is an object method\\n \\\\\\\\ this method has a weak reference to obj, so anytime we use This. or just dot, this weak reference make the real name to execute\\n Obj.a 10,20\\n \\\\\\\\ call the fake method (can't access object methods and properties), has empty weak reference to object\\n obj.alfa 10, 20\\n\\n \\\\\\\\ check before call using custom invoke\\n \\\\\\\\ to check if a method (module) exist, we have to compare this object with other temporary object\\n \\\\\\\\ we make one with the method name and empty definition, and then check if obj has anything this temp object has\\n \\\\\\\\ arguments passed in a tuple (optional), so we didn't leave stack with unused items, if we have an unknown method.\\n invoke &obj, \\\"a\\\", (10, 20)\\n invoke &obj, \\\"NoParam\\\"\\n \\\\\\\\ now with an unknown method, using alfa\\n Try ok {\\n invoke &obj, \\\"Alfa\\\", (10, 20)\\n }\\n If Error Then Print Error$\\n \\\\\\\\ we can use invoke for functions\\n Print Invoke(&obj, \\\"Sqr()\\\", 4), Invoke(&obj, \\\"NoParam()\\\")\\n Print Invoke$(&obj, \\\"Sqr$()\\\",2)\\n \\\\ without custom invoke\\n Print obj.Sqr(4), obj.Noparam(), obj.Sqr$(2)\\n \\\\\\\\ so now we try to call Alfa() and Alfa$() (unknown functions)\\n Try ok {\\n Print Invoke(&obj, \\\"Alfa()\\\")\\n }\\n If Error Then Print Error$\\n Try ok {\\n Print Invoke$(&obj, \\\"Alfa$()\\\")\\n }\\n If Error Then Print Error$\\n\\n\\n \\\\\\\\ so now lets copy obj to obj2\\n \\\\\\\\ fake method didn't passed to new object\\n obj2=obj\\n Try ok {\\n invoke &obj2, \\\"alfa\\\", (10, 20)\\n }\\n If Error Then Print Error$\\n\\n p->obj2\\n \\\\\\\\ if p is a pointer to named group we can pass it as is\\n invoke &p, \\\"a\\\", (10, 20)\\n \\\\\\\\ normal called\\n p=>a 10,20\\n\\n For p {\\n invoke &this, \\\"a\\\", (10, 20)\\n Try ok {\\n invoke &this, \\\"alfa\\\", (10, 20)\\n }\\n If Error Then Print Error$\\n }\\n\\n p->(obj2) ' p point to a copy of obj2 (an unnamed group)\\n For p {\\n invoke &this, \\\"a\\\", (10, 20)\\n \\\\\\\\ normal called\\n p=>a 10, 20\\n Try ok {\\n invoke &this, \\\"alfa\\\", (10, 20)\\n }\\n If Error Then Print Error$\\n\\n }\\n\\n}\\ncheckit\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"obj[foo] = \\\"This is foo.\\\";\\nobj[bar] = \\\"This is bar.\\\";\\nobj[f_Symbol] := \\\"What is \\\" <> SymbolName[f] <> \\\"?\\\";\\nPrint[obj@foo];\\nPrint[obj@bar];\\nPrint[obj@baz];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"{.experimental:\\\"dotOperators\\\".}\\nfrom strutils import join\\n\\ntype Foo = object\\n\\nproc qux(f:Foo) = echo \\\"called qux\\\"\\n\\n#for nicer output\\nfunc quoteStrings[T](x:T):string = (when T is string: \\\"\\\\\\\"\\\" & x & \\\"\\\\\\\"\\\" else: $x)\\n\\n#dot operator catches all unmatched calls on Foo\\ntemplate `.()`(f:Foo,field:untyped,args:varargs[string,quoteStrings]):untyped =\\n echo \\\"tried to call method '\\\" & astToStr(`field`) & (if `args`.len > 0: \\\"' with args: \\\" & args.join(\\\", \\\") else: \\\"'\\\")\\n\\nlet f = Foo()\\nf.bar()\\n#f.bar #error: undeclared field\\nf.baz(\\\"hi\\\",5)\\nf.qux()\\nf.qux(\\\"nope\\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"unit MyObjDef;\\n{$mode objfpc}{$h+}\\ninterface\\n\\nuses\\n SysUtils, Variants;\\n\\n function MyObjCreate: Variant;\\n\\nimplementation\\n\\nvar\\n MyObjType: TInvokeableVariantType;\\n\\ntype\\n TMyObjType = class(TInvokeableVariantType)\\n procedure Clear(var V: TVarData); override;\\n procedure Copy(var aDst: TVarData; const aSrc: TVarData; const Indir: Boolean); override;\\n function GetProperty(var aDst: TVarData; const aData: TVarData; const aName: string): Boolean; override;\\n end;\\n\\nfunction MyObjCreate: Variant;\\nbegin\\n Result := Unassigned;\\n TVarData(Result).VType := MyObjType.VarType;\\nend;\\n\\nprocedure TMyObjType.Clear(var V: TVarData);\\nbegin\\n V.VType := varEmpty;\\nend;\\n\\nprocedure TMyObjType.Copy(var aDst: TVarData; const aSrc: TVarData; const Indir: Boolean);\\nbegin\\n VarClear(Variant(aDst));\\n aDst := aSrc;\\nend;\\n\\nfunction TMyObjType.GetProperty(var aDst: TVarData; const aData: TVarData; const aName: string): Boolean;\\nbegin\\n Result := True;\\n case LowerCase(aName) of\\n 'bark': Variant(aDst) := 'WOF WOF!';\\n 'moo': Variant(aDst) := 'Mooo!';\\n else\\n Variant(aDst) := Format('Sorry, what is \\\"%s\\\"?', [aName]);\\n end;\\nend;\\n\\ninitialization\\n MyObjType := TMyObjType.Create;\\nfinalization\\n MyObjType.Free;\\nend.\\n\",\n \"language\": \"Object-Pascal\"\n },\n {\n \"code\": \"program Test;\\n{$mode objfpc}{$h+}\\nuses\\n MyObjDef;\\n\\nvar\\n MyObj: Variant;\\n\\nbegin\\n MyObj := MyObjCreate;\\n WriteLn(MyObj.Bark);\\n WriteLn(MyObj.Moo);\\n WriteLn(MyObj.Meow);\\nend.\\n\",\n \"language\": \"Object-Pascal\"\n },\n {\n \"code\": \"#include <Foundation/Foundation.h>\\n\\n// The methods need to be declared somewhere\\n@interface Dummy : NSObject\\n- (void)grill;\\n- (void)ding:(NSString *)s;\\n@end\\n\\n@interface Example : NSObject\\n- (void)foo;\\n- (void)bar;\\n@end\\n\\n@implementation Example\\n- (void)foo {\\n NSLog(@\\\"this is foo\\\");\\n}\\n\\n- (void)bar {\\n NSLog(@\\\"this is bar\\\");\\n}\\n\\n- (void)forwardInvocation:(NSInvocation *)inv {\\n NSLog(@\\\"tried to handle unknown method %@\\\", NSStringFromSelector([inv selector]));\\n NSUInteger n = [[inv methodSignature] numberOfArguments];\\n for (NSUInteger i = 0; i < n-2; i++) { // First two arguments are the object and selector.\\n id __unsafe_unretained arg; // We assume that all arguments are objects.\\n // getArguments: is type-agnostic and does not perform memory management,\\n // therefore we must pass it a pointer to an unretained type\\n [inv getArgument:&arg atIndex:i+2];\\n NSLog(@\\\"argument #%lu: %@\\\", i, arg);\\n }\\n}\\n\\n// forwardInvocation: does not work without methodSignatureForSelector:\\n// The runtime uses the signature returned here to construct the invocation.\\n- (NSMethodSignature *)methodSignatureForSelector:(SEL)aSelector {\\n int numArgs = [[NSStringFromSelector(aSelector) componentsSeparatedByString:@\\\":\\\"] count] - 1;\\n // we assume that all arguments are objects\\n // The type encoding is \\\"v@:@@@...\\\", where \\\"v\\\" is the return type, void\\n // \\\"@\\\" is the receiver, object type; \\\":\\\" is the selector of the current method;\\n // and each \\\"@\\\" after corresponds to an object argument\\n return [NSMethodSignature signatureWithObjCTypes:\\n [[@\\\"v@:\\\" stringByPaddingToLength:numArgs+3 withString:@\\\"@\\\" startingAtIndex:0] UTF8String]];\\n}\\n@end\\n\\nint main()\\n{\\n @autoreleasepool {\\n\\n id example = [[Example alloc] init];\\n\\n [example foo]; // prints \\\"this is foo\\\"\\n [example bar]; // prints \\\"this is bar\\\"\\n [example grill]; // prints \\\"tried to handle unknown method grill\\\"\\n [example ding:@\\\"dong\\\"]; // prints \\\"tried to handle unknown method ding:\\\"\\n // prints \\\"argument #0: dong\\\"\\n\\n }\\n return 0;\\n}\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"1 first\\n[1:interpreter] ExRuntime : 1 does not understand method <#first>\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"1 \\\"first\\\" asMethod perform\\n[1:interpreter] ExRuntime : 1 does not understand method <#first>\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"1 \\\"unknow_method\\\" asMethod perform\\n[1:interpreter] ExRuntime : null does not understand method <#perform>\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"Object Class new: MyClass\\nMyClass method: doesNotUnderstand(m)\\n \\\"Well, sorry, I don't understand \\\" print m println ;\\n\\nMyClass new first\\nWell, sorry, I don't understand #first\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"u = .unknown~new\\nu~foo(1, 2, 3)\\n\\n::class unknown\\n::method unknown\\n use arg name, args\\n say \\\"Unknown method\\\" name \\\"invoked with arguments:\\\" args~tostring('l',', ')\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"declare\\n class Example\\n meth init skip end\\n\\n meth foo {System.showInfo foo} end\\n\\n meth bar {System.showInfo bar} end\\n\\n meth otherwise(Msg)\\n {System.showInfo \\\"Unknown method \\\"#{Label Msg}}\\n if {Width Msg} > 0 then\\n {System.printInfo \\\"Arguments: \\\"}\\n {System.show {Record.toListInd Msg}}\\n end\\n end\\n end\\n\\n Object = {New Example init}\\n in\\n {Object foo}\\n {Object bar}\\n {Object grill}\\n {Object ding(dong)}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"package Example;\\nsub new {\\n bless {}\\n}\\nsub foo {\\n print \\\"this is foo\\\\n\\\";\\n}\\nsub bar {\\n print \\\"this is bar\\\\n\\\";\\n}\\nsub AUTOLOAD {\\n my $name = $Example::AUTOLOAD;\\n my ($self, @args) = @_;\\n print \\\"tried to handle unknown method $name\\\\n\\\";\\n if (@args) {\\n print \\\"it had arguments: @args\\\\n\\\";\\n }\\n}\\nsub DESTROY {} # dummy method to prevent AUTOLOAD from\\n # being triggered when an Example is\\n # destroyed\\n\\npackage main;\\nmy $example = Example->new;\\n\\n$example->foo; # prints \\\"this is foo\\\"\\n$example->bar; # prints \\\"this is bar\\\"\\n$example->grill; # prints \\\"tried to handle unknown method Example::grill\\\"\\n$example->ding(\\\"dong\\\"); # prints \\\"tried to handle unknown method Example::ding\\\"\\n # and \\\"it had arguments: dong\\\"\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">enum</span> <span style=\\\"color: #000000;\\\">METHODS</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">invoke</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">args</span><span style=\\\"color: #0000FF;\\\">={})</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--(this works on any class, for any function, with any number or type of parameters)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">mdict</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">METHODS</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">node</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">getd_index</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">mdict</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">node</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">call_func</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">getd_by_index</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">node</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">mdict</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">args</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008000;\\\">\\\"no such method\\\"</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- or throw(), fatal(), etc</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">--class X: Xmethods emulates a vtable</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">Xmethods</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">new_dict</span><span style=\\\"color: #0000FF;\\\">()</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">exists</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008000;\\\">\\\"exists\\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #7060A8;\\\">setd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"exists\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">routine_id</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"exists\\\"</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">Xmethods</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">--class X: create new instances</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">newX</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">Xmethods</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">newX</span><span style=\\\"color: #0000FF;\\\">()</span>\\n\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">invoke</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"exists\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">invoke</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"non_existent_method\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\nclass Example {\\n function foo() {\\n echo \\\"this is foo\\\\n\\\";\\n }\\n function bar() {\\n echo \\\"this is bar\\\\n\\\";\\n }\\n function __call($name, $args) {\\n echo \\\"tried to handle unknown method $name\\\\n\\\";\\n if ($args)\\n echo \\\"it had arguments: \\\", implode(', ', $args), \\\"\\\\n\\\";\\n }\\n}\\n\\n$example = new Example();\\n\\n$example->foo(); // prints \\\"this is foo\\\"\\n$example->bar(); // prints \\\"this is bar\\\"\\n$example->grill(); // prints \\\"tried to handle unknown method grill\\\"\\n$example->ding(\\\"dong\\\"); // prints \\\"tried to handle unknown method ding\\\"\\n // prints \\\"it had arguments: dong\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(redef send (Msg Obj . @)\\n (or\\n (pass try Msg Obj)\\n (pass 'no-applicable-method> Obj Msg) ) )\\n\\n(de no-applicable-method> (This Msg)\\n (pack \\\"No method for \\\" Msg \\\" on \\\" This) )\\n\\n(class +A)\\n\\n(dm do-something> ()\\n (pack \\\"Do something to \\\" This) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \": (object 'A '(+A))\\n-> A\\n: (object 'B '(+B))\\n-> B\\n: (list (send 'do-something> 'A) (send 'do-something> 'B))\\n-> (\\\"Do something to A\\\" \\\"No method for do-something> on B\\\")\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"class CatchAll\\n{\\n mixed `->(string name)\\n {\\n return lambda(int arg){ write(\\\"you are calling %s(%d);\\\\n\\\", name, arg); };\\n }\\n}\\n\\n> CatchAll()->hello(5);\\nyou are calling hello(5);\\n> CatchAll()->something(99);\\nyou are calling something(99);\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"class Example(object):\\n def foo(self):\\n print(\\\"this is foo\\\")\\n def bar(self):\\n print(\\\"this is bar\\\")\\n def __getattr__(self, name):\\n def method(*args):\\n print(\\\"tried to handle unknown method \\\" + name)\\n if args:\\n print(\\\"it had arguments: \\\" + str(args))\\n return method\\n\\nexample = Example()\\n\\nexample.foo() # prints “this is foo”\\nexample.bar() # prints “this is bar”\\nexample.grill() # prints “tried to handle unknown method grill”\\nexample.ding(\\\"dong\\\") # prints “tried to handle unknown method ding”\\n # prints “it had arguments: ('dong',)”\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require racket/class)\\n\\n(define-syntax-rule (send~ obj method x ...)\\n ;; note: this is a naive macro, a real one should avoid evaluating `obj' and\\n ;; the `xs' more than once\\n (with-handlers ([(λ(e) (and (exn:fail:object? e)\\n ;; only do this if there *is* an `unknown-method'\\n (memq 'unknown-method (interface->method-names\\n (object-interface o)))))\\n (λ(e) (send obj unknown-method 'method x ...))])\\n (send obj method x ...)))\\n\\n(define foo%\\n (class object%\\n (define/public (foo x)\\n (printf \\\"foo: ~s\\\\n\\\" x))\\n (define/public (unknown-method name . xs)\\n (printf \\\"Unknown method ~s: ~s\\\\n\\\" name xs))\\n (super-new)))\\n\\n(define o (new foo%))\\n(send~ o foo 1) ; => foo: 1\\n(send~ o whatever 1) ; Unknown method whatever: (1)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#lang swindle\\n\\n(defgeneric (foo x))\\n(defmethod (no-applicable-method [m (singleton foo)] xs)\\n (echo \\\"No method in\\\" m \\\"for\\\" :w xs))\\n(defmethod (foo [x <integer>]) (echo \\\"It's an integer\\\"))\\n\\n(foo 1)\\n;; => It's an integer\\n\\n(foo \\\"one\\\")\\n;; => No method in #<generic:foo> for \\\"one\\\"\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"class Farragut {\\n method FALLBACK ($name, *@rest) {\\n say \\\"{self.WHAT.raku}: $name.tc() the @rest[], full speed ahead!\\\";\\n }\\n}\\n\\nclass Sparrow is Farragut { }\\n\\nFarragut.damn: 'torpedoes';\\nSparrow.hoist: <Jolly Roger mateys>;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"class L-Value {\\n our $.value = 10;\\n method FALLBACK($name, |c) is rw { $.value }\\n}\\n\\nmy $l = L-Value.new;\\nsay $l.any-odd-name; # 10\\n$l.some-other-name = 42;\\nsay $l.i-dont-know; # 42\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"load \\\"stdlibcore.ring\\\"\\n\\nnew test {\\n anyMethodThatDoesNotExist()\\t# Define and call the new method\\n anyMethodThatDoesNotExist()\\t# Call the new method\\n}\\n\\nclass test\\n func braceerror\\n if substr(cCatchError,\\\"Error (R3)\\\")\\n\\t ? \\\"You are calling a method that doesn't exist!\\\"\\n\\t aError = Split(cCatchError,\\\" \\\")\\n\\t cMethodName = aError[len(aError)]\\n\\t ? \\\"The Method Name: \\\" + cMethodName\\n\\t AddMethod(self,cMethodName,func {\\n\\t\\t ? \\\"Hello from the new method!\\\"\\n\\t })\\n\\t ? \\\"We defined the new method!\\\"\\n\\t call cMethodName()\\n ok\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"class Example\\n def foo\\n puts \\\"this is foo\\\"\\n end\\n def bar\\n puts \\\"this is bar\\\"\\n end\\n def method_missing(name, *args, &block)\\n puts \\\"tried to handle unknown method %s\\\" % name # name is a symbol\\n unless args.empty?\\n puts \\\"it had arguments: %p\\\" % [args]\\n end\\n end\\nend\\n\\nexample = Example.new\\n\\nexample.foo # prints “this is foo”\\nexample.bar # prints “this is bar”\\nexample.grill # prints “tried to handle unknown method grill”\\nexample.ding(\\\"dong\\\") # prints “tried to handle unknown method ding”\\n # prints “it had arguments: [\\\"dong\\\"]”\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"class DynamicTest extends Dynamic\\n{\\n def foo()=println(\\\"this is foo\\\")\\n def bar()=println(\\\"this is bar\\\")\\n def applyDynamic(name: String)(args: Any*)={\\n println(\\\"tried to handle unknown method \\\"+name)\\n if(!args.isEmpty)\\n println(\\\" it had arguments: \\\"+args.mkString(\\\",\\\"))\\n }\\n}\\n\\nobject DynamicTest {\\n def main(args: Array[String]): Unit = {\\n val d=new DynamicTest()\\n d.foo()\\n d.bar()\\n d.grill()\\n d.ding(\\\"dong\\\")\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"class Example {\\n method foo {\\n say \\\"this is foo\\\"\\n }\\n method bar {\\n say \\\"this is bar\\\"\\n }\\n method AUTOLOAD(_, name, *args) {\\n say (\\\"tried to handle unknown method %s\\\" % name);\\n if (args.len > 0) {\\n say (\\\"it had arguments: %s\\\" % args.join(', '));\\n }\\n }\\n}\\n\\nvar example = Example.new;\\n\\nexample.foo; # prints “this is foo”\\nexample.bar; # prints “this is bar”\\nexample.grill; # prints “tried to handle unknown method grill”\\nexample.ding(\\\"dong\\\"); # prints “tried to handle unknown method ding”\\n # prints “it had arguments: dong”\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"define: #shell &builder: [lobby newSubSpace].\\n\\n_@shell didNotUnderstand: message at: position\\n\\\"Form a command string and execute it.\\\"\\n[\\n position > 0\\n ifTrue: [resend]\\n ifFalse:\\n [([| :command |\\n\\tmessage selector isUnarySelector ifTrue:\\n\\t [command ; message selector.\\n\\t message optionals pairsDo:\\n\\t [| :key :value |\\n\\t command ; ' -' ; (key as: String) allButFirst allButLast ; ' ' ; (value as: String)]].\\n\\tmessage selector isKeywordSelector ifTrue:\\n\\t [| keywords args |\\n\\t keywords: ((message selector as: String) splitWith: $:).\\n\\t command ; keywords first.\\n\\t keywords size = 1 ifTrue: \\\"Read a string or array of arguments.\\\"\\n\\t [args: message arguments second.\\n\\t (args is: String) ifTrue: [command ; ' ' ; args]\\n\\t\\t\\t\\tifFalse: [args do: [| :arg | command ; ' ' ; arg]]]]] writingAs: String)\\n\\t ifNil: [resend] ifNotNilDo: [| :cmd | [Platform run: cmd]]]\\n].\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"slate[1]> shell ls: '*.image'.\\nkernel.new.little.64.1244260494374694.image slate2.image\\nnet.image slate.image\\nTrue\\nslate[2]>\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"Object subclass: CatchThemAll [\\n foo [ 'foo received' displayNl ]\\n\\n bar [ 'bar received' displayNl ]\\n\\n doesNotUnderstand: aMessage [\\n ('message \\\"' , (aMessage selector asString) , '\\\"') displayNl.\\n (aMessage arguments) do: [ :a |\\n 'argument: ' display. a printNl.\\n ]\\n ]\\n]\\n\\n|a| a := CatchThemAll new.\\na foo.\\na bar.\\na weCanDoIt.\\na theyCanToo: 'eat' and: 'walk'.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"[\\n bla := someObject fooBar.\\n foo := bla.\\n] on: MessageNotUnderstood do:[:ex |\\n ex return: 'fortyTwo'\\n]\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"[\\n bla := someObject fooBar.\\n foo := bla.\\n] on: MessageNotUnderstood do:[:ex |\\n ((ex message selector == #fooBar) and: [ ex message receiver == someObject])\\n ifTrue:[\\n ex return: 'fortyTwo'\\n ] ifFalse:[\\n ex reject\\n ]\\n]\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"anObject perform:#fooBar ifNotUnderstood:[ ...some alternative code and return value... ].\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"Ingorabilis {\\n\\n\\ttell {\\n\\t\\t\\\"I told you so\\\".postln;\\n\\t}\\n\\n\\tfind {\\n\\t\\t\\\"I found nothing\\\".postln\\n\\t}\\n\\n\\tdoesNotUnderstand { |selector ... args|\\n\\t\\t\\\"Method selector '%' not understood by %\\\\n\\\".postf(selector, this.class);\\n\\t\\t\\\"Giving you some good arguments in the following\\\".postln;\\n\\t\\targs.do { |x| x.postln };\\n\\t\\t\\\"And now I delegate the method to my respected superclass\\\".postln;\\n\\t\\tsuper.doesNotUnderstand(selector, args)\\n\\t}\\n\\n}\\n\",\n \"language\": \"SuperCollider\"\n },\n {\n \"code\": \"i = Ingorabilis.new;\\ni.tell; // prints \\\"I told you so\\\"\\ni.find; // prints \\\"\\\"I found nothing\\\"\\ni.think(1, 3, 4, 7);\\n\",\n \"language\": \"SuperCollider\"\n },\n {\n \"code\": \"Method selector 'think' not understood by Ingorabilis\\nGiving you some good arguments in the following\\n1\\n3\\n4\\n7\\nAnd now I delegate the method to my respected superclass\\nERROR: Message 'think' not understood.\\nRECEIVER:\\nInstance of Ingorabilis { (0x1817b1398, gc=D4, fmt=00, flg=00, set=00)\\n instance variables [0]\\n}\\n<...>\\n\",\n \"language\": \"SuperCollider\"\n },\n {\n \"code\": \"i = Ingorabilis.new\\ntry { i.think } { \\\"We are not delegating to super, because I don't want it\\\".postln };\\n\",\n \"language\": \"SuperCollider\"\n },\n {\n \"code\": \"package require TclOO\\n# First create a simple, conventional class and object\\noo::class create Example {\\n method foo {} {\\n puts \\\"this is foo\\\"\\n }\\n method bar {} {\\n puts \\\"this is bar\\\"\\n }\\n}\\nExample create example\\n\\n# Modify the object to have a custom ‘unknown method’ interceptor\\noo::objdefine example {\\n method unknown {name args} {\\n puts \\\"tried to handle unknown method \\\\\\\"$name\\\\\\\"\\\"\\n if {[llength $args]} {\\n puts \\\"it had arguments: $args\\\"\\n }\\n }\\n}\\n\\n# Show off what we can now do...\\nexample foo; # prints “this is foo”\\nexample bar; # prints “this is bar”\\nexample grill; # prints “tried to handle unknown method \\\"grill\\\"”\\nexample ding dong; # prints “tried to handle unknown method \\\"ding\\\"”\\n # prints “it had arguments: dong”\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"function handle_error {\\n status=$?\\n\\n # 127 is: command not found\\n if [[ $status -ne 127 ]]; then\\n return\\n fi\\n\\n lastcmd=$(history | tail -1 | sed 's/^ *[0-9]* *//')\\n\\n read cmd args <<< \\\"$lastcmd\\\"\\n\\n echo \\\"you tried to call $cmd\\\"\\n}\\n\\n# Trap errors.\\ntrap 'handle_error' ERR\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"import \\\"io\\\" for Stdin, Stdout\\n\\nclass Test {\\n construct new() {}\\n\\n foo() { System.print(\\\"Foo called.\\\") }\\n\\n bar() { System.print(\\\"Bar called.\\\") }\\n\\n missingMethod(m) {\\n System.print(m)\\n System.write(\\\"Try and continue anyway y/n ? \\\")\\n Stdout.flush()\\n var reply = Stdin.readLine()\\n if (reply != \\\"y\\\" && reply != \\\"Y\\\") {\\n Fiber.abort(\\\"Decided to abort due to missing method.\\\")\\n }\\n }\\n}\\n\\nvar test = Test.new()\\nvar f = Fiber.new {\\n test.foo()\\n test.bar()\\n test.baz()\\n}\\nf.try()\\nvar err = f.error\\nif (err) {\\n if (err.startsWith(\\\"Test does not implement\\\")) {\\n test.missingMethod(err)\\n } else {\\n Fiber.abort(err) // rethrow other errors\\n }\\n}\\nSystem.print(\\\"OK, continuing.\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"class C{ fcn __notFound(name){println(name,\\\" not in \\\",self); bar}\\n fcn bar{vm.arglist.println(\\\"***\\\")}\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Respond-to-an-unknown-method-call"}}},{"rowIdx":1582,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Date and time\n- Networking and Web Interaction\n- Text processing\nfrom: http://rosettacode.org/wiki/Retrieve_and_search_chat_history\nnote: Programming environment operations\n","language":"00-META"},{"code":";Task:\n\n'''Summary:''' Find and print the mentions of a given string in the recent chat logs from a chatroom. Only use your programming language's standard library.\n\n'''Details:''' \n\nThe Tcl Chatroom is an online chatroom. Its conversations are logged. It's useful to know if someone has mentioned you or your project in the chatroom recently. You can find this out by searching the chat logs. The logs are publicly available at http://tclers.tk/conferences/tcl/. One log file corresponds to the messages from one day in [[wp:Time in Germany|Germany's current time zone]]. Each chat log file has the name <tt>YYYY-MM-DD.tcl</tt> where <tt>YYYY</tt> is the year, <tt>MM</tt> is the month and <tt>DD</tt> the day. The logs store one message per line. The messages themselves are human-readable and their internal structure doesn't matter.\n\nRetrieve the chat logs from the last 10 days via [[HTTP]]. Find the lines that include a particular [[substring]] and print them in the following format:\n\n<pre><log file URL>\n------\n<matching line 1>\n<matching line 2>\n...\n<matching line N>\n------\n\n</pre>\n\nThe substring will be given to your program as a command line argument.\n\nYou need to account for the possible time zone difference between the client running your program and the chat log writer on the server to not miss any mentions. (For example, if you generated the log file URLs naively based on the local date, you could miss mentions if it was already April 5th for the logger but only April 4th for the client.) What this means in practice is that you should either generate the URLs in the time zone <tt>Europe/Berlin</tt> or, if your language can not do that, add an extra day (today + 1) to the range of dates you check, but then make sure to not print parts of a \"not found\" page by accident if a log file doesn't exist yet.\n\nThe code should be contained in a single-file script, with no \"project\" or \"dependency\" file (e.g., no <tt>requirements.txt</tt> for Python). It should only use a given programming language's standard library to accomplish this task and not rely on the user having installed any third-party packages.\n\nIf your language does not have an HTTP client in the standard library, you can speak raw HTTP 1.0 to the server. If it can't parse command line arguments in a standalone script, read the string to look for from the standard input.\n\n","language":"00-TASK"},{"code":"#include<curl/curl.h>\n#include<string.h>\n#include<stdio.h>\n\n#define MAX_LEN 1000\n\nvoid searchChatLogs(char* searchString){\n\tchar* baseURL = \"http://tclers.tk/conferences/tcl/\";\n\ttime_t t;\n\tstruct tm* currentDate;\n\tchar dateString[30],dateStringFile[30],lineData[MAX_LEN],targetURL[100];\n\tint i,flag;\n\tFILE *fp;\n\t\n\tCURL *curl;\n\tCURLcode res;\n\t\n\ttime(&t);\n\tcurrentDate = localtime(&t);\n\t\n\tstrftime(dateString, 30, \"%Y-%m-%d\", currentDate);\n\tprintf(\"Today is : %s\",dateString);\n\t\n\tif((curl = curl_easy_init())!=NULL){\n\t\tfor(i=0;i<=10;i++){\n\t\t\t\n\t\tflag = 0;\n\t\tsprintf(targetURL,\"%s%s.tcl\",baseURL,dateString);\n\t\t\n\t\tstrcpy(dateStringFile,dateString);\n\t\t\n\t\tprintf(\"\\nRetrieving chat logs from %s\\n\",targetURL);\n\t\t\n\t\tif((fp = fopen(\"nul\",\"w\"))==0){\n\t\t\tprintf(\"Cant's read from %s\",targetURL);\n\t\t}\n\t\telse{\n\t\t\tcurl_easy_setopt(curl, CURLOPT_URL, targetURL);\n\t\tcurl_easy_setopt(curl, CURLOPT_WRITEDATA, fp);\n\t\t\n\t\tres = curl_easy_perform(curl);\n\t\t\n\t\tif(res == CURLE_OK){\n\t\t\twhile(fgets(lineData,MAX_LEN,fp)!=NULL){\n\t\t\t\tif(strstr(lineData,searchString)!=NULL){\n\t\t\t\t\tflag = 1;\n\t\t\t\t\tfputs(lineData,stdout);\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(flag==0)\n\t\t\t\tprintf(\"\\nNo matching lines found.\");\n\t\t}\n\t\tfflush(fp);\n\t\tfclose(fp);\n\t\t}\n\t\t\n\t\tcurrentDate->tm_mday--;\n\t\tmktime(currentDate);\n\t\tstrftime(dateString, 30, \"%Y-%m-%d\", currentDate);\t\n\t\t\t\n\t}\n\tcurl_easy_cleanup(curl);\n\t\n\t}\n}\n\nint main(int argC,char* argV[])\n{\n\tif(argC!=2)\n\t\tprintf(\"Usage : %s <followed by search string, enclosed by \\\" if it contains spaces>\",argV[0]);\n\telse\n\t\tsearchChatLogs(argV[1]);\n\treturn 0;\n}\n","language":"C"},{"code":"#! /usr/bin/env elixir\ndefmodule Mentions do\n def get(url) do\n {:ok, {{_, 200, _}, _, body}} =\n url\n |> String.to_charlist()\n |> :httpc.request()\n data = List.to_string(body)\n if Regex.match?(~r|<!Doctype HTML.*<Title>URL Not Found</Title>|s, data) do\n {:error, \"log file not found\"}\n else\n {:ok, data}\n end\n end\n\n def perg(haystack, needle) do\n haystack\n |> String.split(\"\\n\")\n |> Enum.filter(fn x -> String.contains?(x, needle) end)\n end\n\n def generate_url(n) do\n date_str =\n DateTime.utc_now()\n |> DateTime.to_unix()\n |> (fn x -> x + 60*60*24*n end).()\n |> DateTime.from_unix!()\n |> (fn %{year: y, month: m, day: d} ->\n :io_lib.format(\"~B-~2..0B-~2..0B\", [y, m, d])\n end).()\n \"http://tclers.tk/conferences/tcl/#{date_str}.tcl\"\n end\nend\n\n[needle] = System.argv()\n:application.start(:inets)\nback = 10\n# Elixir does not come standard with time zone definitions, so we add an extra\n# day to account for the possible difference between the local and the server\n# time.\nfor i <- -back..1 do\n url = Mentions.generate_url(i)\n with {:ok, haystack} <- Mentions.get(url),\n # If the result is a non-empty list...\n [h | t] <- Mentions.perg(haystack, needle) do\n IO.puts(\"#{url}\\n------\\n#{Enum.join([h | t], \"\\n\")}\\n------\\n\")\n end\nend\n","language":"Elixir"},{"code":"#!/usr/bin/env fsharpi\nlet server_tz =\n try\n // CLR on Windows\n System.TimeZoneInfo.FindSystemTimeZoneById(\"W. Europe Standard Time\")\n with\n // Mono\n :? System.TimeZoneNotFoundException ->\n System.TimeZoneInfo.FindSystemTimeZoneById(\"Europe/Berlin\")\n\nlet get url =\n let req = System.Net.WebRequest.Create(System.Uri(url))\n use resp = req.GetResponse()\n use stream = resp.GetResponseStream()\n use reader = new System.IO.StreamReader(stream)\n reader.ReadToEnd()\n\nlet grep needle (haystack : string) =\n haystack.Split('\\n')\n |> Array.toList\n |> List.filter (fun x -> x.Contains(needle))\n\nlet genUrl n =\n let day = System.DateTime.UtcNow.AddDays(float n)\n let server_dt = System.TimeZoneInfo.ConvertTimeFromUtc(day, server_tz)\n let timestamp = server_dt.ToString(\"yyyy-MM-dd\")\n sprintf \"http://tclers.tk/conferences/tcl/%s.tcl\" timestamp\n\nlet _ =\n match fsi.CommandLineArgs with\n | [|_; needle|] ->\n let back = 10\n for i in -back .. 0 do\n let url = genUrl i\n let found = url |> get |> grep needle |> String.concat \"\\n\"\n if found <> \"\" then printfn \"%s\\n------\\n%s\\n------\\n\" url found\n else ()\n | x ->\n printfn \"Usage: %s literal\" (Array.get x 0)\n System.Environment.Exit(1)\n","language":"F-Sharp"},{"code":"#include \"curl.bi\"\n#include \"vbcompat.bi\"\n#define NULL 0\n\nDim Shared As CURL Ptr curl = NULL\n\nFunction WriteMemoryCallback(Byval contents As Any Ptr, Byval size As Uinteger, Byval nmemb As Uinteger, Byval userp As String Ptr) As Uinteger\n Dim As Uinteger realsize = size * nmemb\n *userp &= *Cptr(ZString Ptr, contents)\n Return realsize\nEnd Function\n\nFunction download(url As String) As String\n If curl = NULL Then\n curl_global_init(CURL_GLOBAL_DEFAULT)\n curl = curl_easy_init()\n End If\n Dim As String readBuffer = \"\"\n curl_easy_setopt(curl, CURLOPT_URL, url)\n curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, @WriteMemoryCallback)\n curl_easy_setopt(curl, CURLOPT_WRITEDATA, @readBuffer)\n Dim As CURLcode res = curl_easy_perform(curl)\n If res <> 0 Then\n Print \"libcurl error \"; res; \" (\"; *curl_easy_strerror(res); \")\"\n Return \"\"\n End If\n Return readBuffer\nEnd Function\n\nFunction grep(needle As String, haystack As String) As String\n Dim As Integer i, j\n Dim As String res = \"\"\n j = 1\n For i = 1 To Len(haystack)\n If Mid(haystack, i, 1) = Chr(10) Then\n Dim As String linea = Mid(haystack, j, i - j)\n If Instr(linea, needle) Then\n res &= linea & Chr(10)\n End If\n j = i + 1\n End If\n Next i\n If Len(res) = 0 Then res = \"no occurrences\"\n Return res\nEnd Function\n\nDim As String needle = \"github\"\nDim As Integer days = 10\nDim As Integer i\nFor i = -days To 0\n Dim As String dateStr = Format(Dateadd(\"d\", i, Cdbl(Date)), \"yyyy-mm-dd\")\n Dim As String url = \"http://tclers.tk/conferences/tcl/\" & dateStr & \".tcl\"\n Dim As String contents = download(url)\n If Len(contents) = 0 Then Exit For\n Print url\n Print grep(needle, contents)\nNext i\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n\t\"fmt\"\n\t\"io/ioutil\"\n\t\"log\"\n\t\"net/http\"\n\t\"os\"\n\t\"strings\"\n\t\"time\"\n)\n\nfunc get(url string) (res string, err error) {\n\tresp, err := http.Get(url)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\tbuf, err := ioutil.ReadAll(resp.Body)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\treturn string(buf), nil\n}\n\nfunc grep(needle string, haystack string) (res []string) {\n\tfor _, line := range strings.Split(haystack, \"\\n\") {\n\t\tif strings.Contains(line, needle) {\n\t\t\tres = append(res, line)\n\t\t}\n\t}\n\treturn res\n}\n\nfunc genUrl(i int, loc *time.Location) string {\n\tdate := time.Now().In(loc).AddDate(0, 0, i)\n\treturn date.Format(\"http://tclers.tk/conferences/tcl/2006-01-02.tcl\")\n}\n\nfunc main() {\n\tneedle := os.Args[1]\n\tback := -10\n\tserverLoc, err := time.LoadLocation(\"Europe/Berlin\")\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tfor i := back; i <= 0; i++ {\n\t\turl := genUrl(i, serverLoc)\n\t\tcontents, err := get(url)\n\t\tif err != nil {\n\t\t\tlog.Fatal(err)\n\t\t}\n\t\tfound := grep(needle, contents)\n\t\tif len(found) > 0 {\n\t\t\tfmt.Printf(\"%v\\n------\\n\", url)\n\t\t\tfor _, line := range found {\n\t\t\t\tfmt.Printf(\"%v\\n\", line)\n\t\t\t}\n\t\t\tfmt.Printf(\"------\\n\\n\")\n\t\t}\n\t}\n}\n","language":"Go"},{"code":"import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.net.HttpURLConnection;\nimport java.net.URI;\nimport java.net.URISyntaxException;\nimport java.net.URL;\nimport java.time.LocalDate;\nimport java.time.ZoneId;\nimport java.time.ZonedDateTime;\n\npublic final class RetrieveAndSearchChatHistory {\n\n\tpublic static void main(String[] aArgs) throws URISyntaxException, IOException {\t\t\n\t\tString subjectOfSearch = aArgs[0]; // The string 'available' was used to produce the displayed output.\n\n\t\tZonedDateTime now = ZonedDateTime.now(ZoneId.of(\"Europe/Berlin\"));\n\t\tLocalDate tomorrow = now.toLocalDate().plusDays(1);\n\t\tLocalDate testDate = tomorrow.minusDays(10);\n\n\t\twhile ( ! testDate.equals(tomorrow ) ) {\n\t URL address = new URI(\"http://tclers.tk/conferences/tcl/\" + testDate + \".tcl\").toURL();\t\n\t HttpURLConnection connection = (HttpURLConnection) address.openConnection();\n\t BufferedReader reader = new BufferedReader( new InputStreamReader(connection.getInputStream()) );\n\t\n\t System.out.println(\"Searching chat logs for \" + testDate);\t\n\t String line = \"\";\n\t while ( ( line = reader.readLine() ).contains(subjectOfSearch) ) {\n\t \tSystem.out.println(line);\n\t }\n\t\n\t reader.close();\n\t connection.disconnect();\n\t testDate = testDate.plusDays(1);\n\t\t}\n\t}\n\n}\n","language":"Java"},{"code":"using Dates, TimeZones, HTTP, Printf\n\nfunction geturlbyday(n)\n d = DateTime(now(tz\"Europe/Berlin\")) + Day(n) # n should be <= 0\n uri = @sprintf(\"http://tclers.tk/conferences/tcl/%04d-%02d-%02d.tcl\",\n year(d), month(d), day(d))\n return uri, String(HTTP.request(\"GET\", uri).body)\nend\n\nfunction searchlogs(text = ARGS[1], daysback = 9)\n for n in -daysback:0\n fname, searchtext = geturlbyday(n)\n println(\"$fname\\n------\")\n for line in split(searchtext, \"\\n\")\n if findfirst(text, line) != nothing\n println(line)\n end\n end\n println(\"------\\n\")\n end\nend\n\nif length(ARGS) != 1\n println(\"Usage: type search phrase in quotes as an argument.\")\nelse\n searchlogs()\nend\n","language":"Julia"},{"code":"matchFrom[url_String, str_String] := Select[StringSplit[Import[url, \"String\"], \"\\n\"], StringMatchQ[str]]\ngetLogLinks[n_] :=\n Select[Import[\"http://tclers.tk/conferences/tcl/\", \"Hyperlinks\"],\n First[\n StringCases[#1, \"tcl/\" ~~ date__ ~~ \".tcl\" :> DateDifference[DateObject[URLDecode[date], TimeZone -> \"Europe/Berlin\"], Now]]] <=\n Quantity[n, \"Days\"] & ]\nsearchLogs[str_String] := Block[{data},\n Map[\n (data = matchFrom[#, str];\n If[Length[data] > 0,\n Print /@ Join[{#, \"-----\"}, data, {\"----\\n\"}]]) &,\n getLogLinks[10]]]\nsearchLogs[\"*lazy*\"];\n","language":"Mathematica"},{"code":"import httpclient, os, re, strformat, strutils, sugar, times\n\nconst Template = \"'http://tclers.tk/conferences/tcl/'yyyy-MM-dd'.tcl'\"\n\nproc get(url: string): string =\n var client = newHttpClient()\n result = client.getContent(url)\n if result.match(re\"<!Doctype HTML[\\s\\S]*<Title>URL Not Found</Title>\"):\n result = \"\"\n client.close()\n\nlet today = now()\nconst Back = 10\nif paramCount() != 1:\n quit \"Wrong number of parameters\", QuitFailure\nlet needle = paramStr(1)\nfor i in -Back..1:\n let day = today + initTimeInterval(days = i)\n let url = day.format(Template)\n let haystack = url.get()\n if haystack.len != 0:\n let mentions = collect(newSeq):\n for line in haystack.splitLines(keepEol = true):\n if needle in line:\n line\n if mentions.len > 0:\n echo &\"{url}\\n------\\n{mentions.join()}------\\n\"\n","language":"Nim"},{"code":"# 20210316 Perl programming solution\n\nuse strict;\nuse warnings;\nuse Time::Piece;\nuse IO::Socket::INET;\nuse HTTP::Tiny;\nuse feature 'say';\n\nmy $needle = shift @ARGV // '';\nmy @haystack = ();\nmy $page = '';\n\n# 10 days before today\nmy $begin = Time::Piece->new - 10 * Time::Piece::ONE_DAY;\nsay \" Executed at: \", Time::Piece->new;\nsay \"Begin searching from: $begin\";\n\nfor (my $date = $begin ; Time::Piece->new > $date ; $date += Time::Piece::ONE_DAY) {\n $page .= HTTP::Tiny->new()->get( 'http://tclers.tk/conferences/tcl/'.$date->strftime('%Y-%m-%d').'.tcl')->{content};\n}\n\n# process pages\nmy @lines = split /\\n/, $page;\nfor (@lines) { push @haystack, $_ if substr($_, 0, 13) =~ m/^m \\d\\d\\d\\d-\\d\\d-\\d\\dT/ }\n\n# print the first and last line of the haystack\nsay \"First and last lines of the haystack:\";\nsay $haystack[0] and say $haystack[-1];\n\nsay \"Needle: \", $needle;\nsay '-' x 79;\n\n# find and print needle lines\nfor (@haystack) { say $_ if (index($_, $needle) != -1) }\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">builtins</span><span style=\"color: #0000FF;\">\\</span><span style=\"color: #000000;\">libcurl</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">curl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">NULL</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">download</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">url</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">NULL</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">curl_global_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">curl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">curl_easy_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">curl_easy_setopt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">CURLOPT_URL</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">url</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">curl_easy_perform_ex</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #004080;\">integer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"libcurl error %d (%s)\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">curl_easy_strerror</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #008000;\">\"\"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">grep</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">needle</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">haystack</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">lines</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">haystack</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lines</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">match</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">needle</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">lines</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">lines</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">={}</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"no occurences\"</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">builtins</span><span style=\"color: #0000FF;\">\\</span><span style=\"color: #004080;\">timedate</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">gen_url</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">timezone</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">timedate</span> <span style=\"color: #000000;\">td</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">set_timezone</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">date</span><span style=\"color: #0000FF;\">(),</span><span style=\"color: #000000;\">timezone</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">td</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">adjust_timedate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">td</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">timedelta</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">days</span><span style=\"color: #0000FF;\">:=</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">format_timedate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">td</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"'http://tclers.tk/conferences/tcl/'YYYY-MM-DD'.tcl'\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">cl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">command_line</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">needle</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"github\"</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">days</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">10</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cl</span><span style=\"color: #0000FF;\">)>=</span><span style=\"color: #000000;\">3</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">needle</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">cl</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cl</span><span style=\"color: #0000FF;\">)>=</span><span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">days</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #7060A8;\">to_integer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cl</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">days</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cl</span><span style=\"color: #0000FF;\">)>=</span><span style=\"color: #000000;\">5</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=-</span><span style=\"color: #000000;\">days</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">url</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">gen_url</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"CEST\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">contents</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">download</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">url</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">contents</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">\"\"</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">url</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">grep</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">needle</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">contents</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"#! /usr/bin/env python3\nimport datetime\nimport re\nimport urllib.request\nimport sys\n\ndef get(url):\n with urllib.request.urlopen(url) as response:\n html = response.read().decode('utf-8')\n if re.match(r'<!Doctype HTML[\\s\\S]*<Title>URL Not Found</Title>', html):\n return None\n return html\n\ndef main():\n template = 'http://tclers.tk/conferences/tcl/%Y-%m-%d.tcl'\n today = datetime.datetime.utcnow()\n back = 10\n needle = sys.argv[1]\n # Since Python does not come standard with time zone definitions, add an\n # extra day to account for the possible difference between the local and the\n # server time.\n for i in range(-back, 2):\n day = today + datetime.timedelta(days=i)\n url = day.strftime(template)\n haystack = get(url)\n if haystack:\n mentions = [x for x in haystack.split('\\n') if needle in x]\n if mentions:\n print('{}\\n------\\n{}\\n------\\n'\n .format(url, '\\n'.join(mentions)))\n\nmain()\n","language":"Python"},{"code":"#lang racket\n(require net/url)\n(require racket/date)\n\n;; generate archive url from specified number of days in the past\n(define (generate-url days-ago)\n (putenv \"TZ\" \"Europe/Berlin\") ; this works for Linux\n (let* [(today (current-date))\n (past (seconds->date (- (date->seconds today) (* days-ago 60 60 24))))\n (date-str (string-append\n (~r (date-year past) #:min-width 4 #:pad-string \"0\") ; 4 digit year\n \"-\"\n (~r (date-month past) #:min-width 2 #:pad-string \"0\") ; 2 digit month\n \"-\"\n (~r (date-day past) #:min-width 2 #:pad-string \"0\"))) ; 2 digit day\n (url (string-append \"http://tclers.tk/conferences/tcl/\" date-str \".tcl\"))]\n url))\n\n;; retrieve content of url as a list of strings\n(define (get-content-of-url url-string)\n (let [(st (open-output-string))]\n (copy-port (get-pure-port (string->url url-string)\n #:redirections 100)\n st)\n (string-split (get-output-string st) \"\\n\"))) ; divide on line breaks\n\n;; from a list of strings, return a list of those containing the search string\n(define (get-matches lines search-string)\n (define (internal-get-matches lines search-string results)\n (cond\n ((empty? lines) results)\n (else (internal-get-matches (cdr lines)\n search-string\n (if (string-contains? (car lines) search-string)\n (append results (list (car lines)))\n results)))))\n (internal-get-matches lines search-string (list)))\n\n;; display last 10 days worth of archives that contain matches to the search string\n(define (display-matches-for-last-10-days search-string)\n ;; get archives from 9 days ago until today\n (for/list ([i (range 9 -1 -1)])\n (let* ([url (generate-url i)]\n [matches (get-matches (get-content-of-url url) search-string)])\n (cond [(not (empty? matches))\n (begin\n (display url)(newline)\n (display \"------\\n\")\n (for/list ([line matches]) (display line)(newline))\n (display \"------\\n\"))]))))\n\n\n;; use the first command line argument as the search string\n;; display usage info if no search string is provided\n(cond ((= 0 (vector-length (current-command-line-arguments))) (display \"USAGE: chat_history <search term>\\n\"))\n (else (display-matches-for-last-10-days (vector-ref (current-command-line-arguments) 0))))\n","language":"Racket"},{"code":"my $needle = @*ARGS.shift // '';\nmy @haystack;\n\n# 10 days before today, Zulu time\nmy $begin = DateTime.new(time).utc.earlier(:10days);\nsay \" Executed at: \", DateTime.new(time).utc;\nsay \"Begin searching from: $begin\";\n\n# Today - 10 days through today\nfor $begin.Date .. DateTime.now.utc.Date -> $date {\n\n # connect to server, use a raw socket\n my $http = IO::Socket::INET.new(:host('tclers.tk'), :port(80));\n\n # request file\n $http.print: \"GET /conferences/tcl/{$date}.tcl HTTP/1.0\\n\\n\";\n\n # retrieve file\n my @page = $http.lines;\n\n # remove header\n @page.splice(0, 8);\n\n # concatenate multi-line entries to a single line\n while @page {\n if @page[0].substr(0, 13) ~~ m/^'m '\\d\\d\\d\\d'-'\\d\\d'-'\\d\\d'T'/ {\n @haystack.push: @page.shift;\n }\n else {\n @haystack.tail ~= '' ~ @page.shift;\n }\n }\n\n # close socket\n $http.close;\n}\n\n# ignore times before 10 days ago\n@haystack.shift while @haystack[0].substr(2, 22) lt $begin.Str;\n\n# print the first and last line of the haystack\nsay \"First and last lines of the haystack:\";\n.say for |@haystack[0, *-1];\nsay \"Needle: \", $needle;\nsay '-' x 79;\n\n# find and print needle lines\n.say if .contains( $needle ) for @haystack;\n","language":"Raku"},{"code":"#! /usr/bin/env ruby\nrequire 'net/http'\nrequire 'time'\n\ndef gen_url(i)\n day = Time.now + i*60*60*24\n # Set the time zone in which to format the time, per\n # https://coderwall.com/p/c7l82a/create-a-time-in-a-specific-timezone-in-ruby\n old_tz = ENV['TZ']\n ENV['TZ'] = 'Europe/Berlin'\n url = day.strftime('http://tclers.tk/conferences/tcl/%Y-%m-%d.tcl')\n ENV['TZ'] = old_tz\n url\nend\n\ndef main\n back = 10\n needle = ARGV[0]\n (-back..0).each do |i|\n url = gen_url(i)\n haystack = Net::HTTP.get(URI(url)).split(\"\\n\")\n mentions = haystack.select { |x| x.include? needle }\n if !mentions.empty?\n puts \"#{url}\\n------\\n#{mentions.join(\"\\n\")}\\n------\\n\"\n end\n end\nend\n\nmain\n","language":"Ruby"},{"code":"import java.net.Socket\nimport java.net.URL\nimport java.time\nimport java.time.format\nimport java.time.ZoneId\nimport java.util.Scanner\nimport scala.collection.JavaConverters._\n\ndef get(rawUrl: String): List[String] = {\n val url = new URL(rawUrl)\n val port = if (url.getPort > -1) url.getPort else 80\n val sock = new Socket(url.getHost, port)\n sock.getOutputStream.write(\n s\"GET /${url.getPath()} HTTP/1.0\\n\\n\".getBytes(\"UTF-8\")\n )\n new Scanner(sock.getInputStream).useDelimiter(\"\\n\").asScala.toList\n}\n\ndef genUrl(n: Long) = {\n val date = java.time.ZonedDateTime\n .now(ZoneId.of(\"Europe/Berlin\"))\n .plusDays(n)\n .format(java.time.format.DateTimeFormatter.ISO_LOCAL_DATE)\n s\"http://tclers.tk/conferences/tcl/$date.tcl\"\n}\n\nval back = 10\nval literal = args(0)\nfor (i <- -back to 0) {\n val url = genUrl(i)\n print(get(url).filter(_.contains(literal)) match {\n case List() => \"\"\n case x => s\"$url\\n------\\n${x.mkString(\"\\n\")}\\n------\\n\\n\"\n })\n}\n","language":"Scala"},{"code":"CommandLineHandler subclass: #ChatHistorySearchCommandLineHandler\n\tinstanceVariableNames: ''\n\tclassVariableNames: ''\n\tpoolDictionaries: ''\n\tcategory: 'RosettaCode'!\n\n!ChatHistorySearchCommandLineHandler methodsFor: 'activation' stamp: 'EduardoPadoan 1/27/2019 15:18'!\nactivate\n\tself searchHistoryFor: self arguments first.\n\tself quit! !\n\n\n!ChatHistorySearchCommandLineHandler methodsFor: 'commands' stamp: 'EduardoPadoan 1/27/2019 17:01'!\nsearchHistoryFor: aString\n\t| today startDate |\n\t\n\t\"XXX Doesn't account for DST\"\n\ttoday := DateAndTime now offset: 1 hours.\n\tstartDate := today - 10 days.\n\n\tstartDate to: today by: 1 days do: [ :targetDate |\n\t\t| url response |\n\n\t\turl := String streamContents: [ :aStream |\n\t\t\taStream nextPutAll: 'http://tclers.tk/conferences/tcl/'.\n\t\t\ttargetDate printYMDOn: aStream.\n\t\t\taStream nextPutAll: '.tcl'.\n\t\t].\n\n\t\tresponse := ZnEasy get: url.\n\n\t\tresponse contents asString linesDo: [ :line |\n\t\t\t(line asLowercase includesSubstring: aString asLowercase) ifTrue: [\n\t\t\t\tself stdout print: line; lf.\n\t\t\t]\n\t\t]\n\t]! !\n\n\"-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- \"!\n\nChatHistorySearchCommandLineHandler class\n\tinstanceVariableNames: ''!\n\n!ChatHistorySearchCommandLineHandler class methodsFor: 'accessing' stamp: 'EduardoPadoan 1/27/2019 14:53'!\ndescription\n\t^ 'Look for a pattern in the TCL chat history'! !\n\n!ChatHistorySearchCommandLineHandler class methodsFor: 'accessing' stamp: 'EduardoPadoan 1/27/2019 14:50'!\ncommandName\n\t^ 'searchHistory'! !\n","language":"Smalltalk"},{"code":"#! /usr/bin/env tclsh\npackage require http\n\nproc get url {\n set r [::http::geturl $url]\n set content [::http::data $r]\n ::http::cleanup $r\n return $content\n}\n\nproc grep {needle haystack} {\n lsearch -all \\\n -inline \\\n -glob \\\n [split $haystack \\n] \\\n *[string map {* \\\\* ? \\\\? \\\\ \\\\\\\\ [ \\\\[ ] \\\\]} $needle]*\n}\n\nproc main argv {\n lassign $argv needle\n set urlTemplate http://tclers.tk/conferences/tcl/%Y-%m-%d.tcl\n set back 10\n set now [clock seconds]\n for {set i -$back} {$i <= 0} {incr i} {\n set date [clock add $now $i days]\n set url [clock format $date \\\n -format $urlTemplate \\\n -timezone :Europe/Berlin]\n set found [grep $needle [get $url]]\n if {$found ne {}} {\n puts $url\\n------\\n[join $found \\n]\\n------\\n\n }\n }\n}\n\nmain $argv\n","language":"Tcl"},{"code":"#! /usr/bin/env jimsh\nproc get url {\n if {![regexp {http://([a-z.]+)(:[0-9]+)?(/.*)} $url _ host port path]} {\n error \"can't parse URL \\\"$url\\\"\"\n }\n if {$port eq {}} { set port 80 }\n set ch [socket stream $host:$port]\n puts -nonewline $ch \"GET /$path HTTP/1.0\\n\\n\"\n set content [read $ch]\n if {[regexp {^HTTP[^<]+<!Doctype HTML.*<Title>URL Not Found</Title>} \\\n $content]} {\n error {log file not found}\n }\n close $ch\n return $content\n}\n\nproc grep {needle haystack} {\n lsearch -all \\\n -inline \\\n -glob \\\n [split $haystack \\n] \\\n *[string map {* \\\\* ? \\\\? \\\\ \\\\\\\\ [ \\\\[ ] \\\\]} $needle]*\n}\n\nproc main argv {\n lassign $argv needle\n set urlTemplate http://tclers.tk/conferences/tcl/%Y-%m-%d.tcl\n set back 10\n set now [clock seconds]\n # Jim Tcl doesn't support time zones, so we add an extra day to account for\n # the possible difference between the local and the server time.\n for {set i -$back} {$i <= 1} {incr i} {\n set date [expr {$now + $i*60*60*24}]\n set url [clock format $date -format $urlTemplate]\n catch {\n set found [grep $needle [get $url]]\n if {$found ne {}} {\n puts $url\\n------\\n[join $found \\n]\\n------\\n\n }\n }\n }\n}\n\nmain $argv\n","language":"Tcl"},{"code":"/* Retrieve_and_search_chat_history.wren */\n\nimport \"./date\" for Date\n\nvar CURLOPT_URL = 10002\nvar CURLOPT_FOLLOWLOCATION = 52\nvar CURLOPT_WRITEFUNCTION = 20011\nvar CURLOPT_WRITEDATA = 10001\n\nclass C {\n foreign static searchStr\n foreign static utcNow // format will be yyyy-mm-dd hh:MM:ss\n}\n\nforeign class Buffer {\n construct new() {} // C will allocate buffer of a suitable size\n\n foreign value // returns buffer contents as a string\n}\n\nforeign class Curl {\n construct easyInit() {}\n\n foreign easySetOpt(opt, param)\n\n foreign easyPerform()\n\n foreign easyCleanup()\n}\n\nvar curl = Curl.easyInit()\n\nvar getContent = Fn.new { |url|\n var buffer = Buffer.new()\n curl.easySetOpt(CURLOPT_URL, url)\n curl.easySetOpt(CURLOPT_FOLLOWLOCATION, 1)\n curl.easySetOpt(CURLOPT_WRITEFUNCTION, 0) // write function to be supplied by C\n curl.easySetOpt(CURLOPT_WRITEDATA, buffer)\n curl.easyPerform()\n return buffer.value\n}\n\nvar baseUrl = \"http://tclers.tk/conferences/tcl/\"\nvar searchStr = C.searchStr\nvar now = C.utcNow\nvar d = Date.parse(now)\nd = d.adjustTime(\"CET\") // adjust to German time\nvar fmt = \"mmmm| |d| |yyyy| |H|:|MM|am| |zz|\"\nSystem.print(\"It's %(d.format(fmt)) just now in Germany.\")\nSystem.print(\"Searching for '%(searchStr)' in the TCL Chatroom logs for the last 10 days:\\n\")\nfor (i in 0..9) {\n var date = d.toString.split(\" \")[0]\n var url = baseUrl + date + \".tcl\"\n var underline = \"-\" * url.count\n var content = getContent.call(url)\n var lines = content.split(\"\\n\")\n System.print(\"%(url)\")\n System.print(underline)\n for (line in lines) {\n if (line.indexOf(searchStr) >= 0) System.print(line)\n }\n System.print(underline + \"\\n\")\n d = d.addDays(-1)\n}\n\ncurl.easyCleanup()\n","language":"Wren"},{"code":"/* gcc Retrieve_and_search_chat_history.c -o Retrieve_and_search_chat_history -lcurl -lwren -lm */\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <curl/curl.h>\n#include <time.h>\n#include \"wren.h\"\n\nconst char *searchStr;\n\nstruct MemoryStruct {\n char *memory;\n size_t size;\n};\n\n/* C <=> Wren interface functions */\n\nstatic size_t WriteMemoryCallback(void *contents, size_t size, size_t nmemb, void *userp) {\n size_t realsize = size * nmemb;\n struct MemoryStruct *mem = (struct MemoryStruct *)userp;\n\n char *ptr = realloc(mem->memory, mem->size + realsize + 1);\n if(!ptr) {\n /* out of memory! */\n printf(\"not enough memory (realloc returned NULL)\\n\");\n return 0;\n }\n\n mem->memory = ptr;\n memcpy(&(mem->memory[mem->size]), contents, realsize);\n mem->size += realsize;\n mem->memory[mem->size] = 0;\n return realsize;\n}\n\nvoid C_searchStr(WrenVM* vm) {\n wrenSetSlotString(vm, 0, searchStr);\n}\n\nvoid C_utcNow(WrenVM* vm) {\n time_t now = time(NULL);\n struct tm *ptm = gmtime(&now);\n char dateTimeStr[20];\n strftime(dateTimeStr, 20, \"%Y-%m-%d %H:%M:%S\", ptm);\n wrenSetSlotString(vm, 0, dateTimeStr);\n}\n\nvoid C_bufferAllocate(WrenVM* vm) {\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenSetSlotNewForeign(vm, 0, 0, sizeof(struct MemoryStruct));\n ms->memory = malloc(1);\n ms->size = 0;\n}\n\nvoid C_bufferFinalize(void* data) {\n struct MemoryStruct *ms = (struct MemoryStruct *)data;\n free(ms->memory);\n}\n\nvoid C_curlAllocate(WrenVM* vm) {\n CURL** pcurl = (CURL**)wrenSetSlotNewForeign(vm, 0, 0, sizeof(CURL*));\n *pcurl = curl_easy_init();\n}\n\nvoid C_value(WrenVM* vm) {\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 0);\n wrenSetSlotString(vm, 0, ms->memory);\n}\n\nvoid C_easyPerform(WrenVM* vm) {\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\n curl_easy_perform(curl);\n}\n\nvoid C_easyCleanup(WrenVM* vm) {\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\n curl_easy_cleanup(curl);\n}\n\nvoid C_easySetOpt(WrenVM* vm) {\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\n CURLoption opt = (CURLoption)wrenGetSlotDouble(vm, 1);\n if (opt < 10000) {\n long lparam = (long)wrenGetSlotDouble(vm, 2);\n curl_easy_setopt(curl, opt, lparam);\n } else if (opt < 20000) {\n if (opt == CURLOPT_WRITEDATA) {\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 2);\n curl_easy_setopt(curl, opt, (void *)ms);\n } else if (opt == CURLOPT_URL) {\n const char *url = wrenGetSlotString(vm, 2);\n curl_easy_setopt(curl, opt, url);\n }\n } else if (opt < 30000) {\n if (opt == CURLOPT_WRITEFUNCTION) {\n curl_easy_setopt(curl, opt, &WriteMemoryCallback);\n }\n }\n}\n\nWrenForeignClassMethods bindForeignClass(WrenVM* vm, const char* module, const char* className) {\n WrenForeignClassMethods methods;\n methods.allocate = NULL;\n methods.finalize = NULL;\n if (strcmp(module, \"main\") == 0) {\n if (strcmp(className, \"Buffer\") == 0) {\n methods.allocate = C_bufferAllocate;\n methods.finalize = C_bufferFinalize;\n } else if (strcmp(className, \"Curl\") == 0) {\n methods.allocate = C_curlAllocate;\n }\n }\n return methods;\n}\n\nWrenForeignMethodFn bindForeignMethod(\n WrenVM* vm,\n const char* module,\n const char* className,\n bool isStatic,\n const char* signature) {\n if (strcmp(module, \"main\") == 0) {\n if (strcmp(className, \"Buffer\") == 0) {\n if (!isStatic && strcmp(signature, \"value\") == 0) return C_value;\n } else if (strcmp(className, \"C\") == 0) {\n if (isStatic && strcmp(signature, \"searchStr\") == 0) return C_searchStr;\n if (isStatic && strcmp(signature, \"utcNow\") == 0) return C_utcNow;\n } else if (strcmp(className, \"Curl\") == 0) {\n if (!isStatic && strcmp(signature, \"easySetOpt(_,_)\") == 0) return C_easySetOpt;\n if (!isStatic && strcmp(signature, \"easyPerform()\") == 0) return C_easyPerform;\n if (!isStatic && strcmp(signature, \"easyCleanup()\") == 0) return C_easyCleanup;\n }\n }\n return NULL;\n}\n\nstatic void writeFn(WrenVM* vm, const char* text) {\n printf(\"%s\", text);\n}\n\nvoid errorFn(WrenVM* vm, WrenErrorType errorType, const char* module, const int line, const char* msg) {\n switch (errorType) {\n case WREN_ERROR_COMPILE:\n printf(\"[%s line %d] [Error] %s\\n\", module, line, msg);\n break;\n case WREN_ERROR_STACK_TRACE:\n printf(\"[%s line %d] in %s\\n\", module, line, msg);\n break;\n case WREN_ERROR_RUNTIME:\n printf(\"[Runtime Error] %s\\n\", msg);\n break;\n }\n}\n\nchar *readFile(const char *fileName) {\n FILE *f = fopen(fileName, \"r\");\n fseek(f, 0, SEEK_END);\n long fsize = ftell(f);\n rewind(f);\n char *script = malloc(fsize + 1);\n fread(script, 1, fsize, f);\n fclose(f);\n script[fsize] = 0;\n return script;\n}\n\nstatic void loadModuleComplete(WrenVM* vm, const char* module, WrenLoadModuleResult result) {\n if( result.source) free((void*)result.source);\n}\n\nWrenLoadModuleResult loadModule(WrenVM* vm, const char* name) {\n WrenLoadModuleResult result = {0};\n if (strcmp(name, \"random\") != 0 && strcmp(name, \"meta\") != 0) {\n result.onComplete = loadModuleComplete;\n char fullName[strlen(name) + 6];\n strcpy(fullName, name);\n strcat(fullName, \".wren\");\n result.source = readFile(fullName);\n }\n return result;\n}\n\nint main(int argc, char **argv) {\n if (argc != 2) {\n printf(\"Please pass the string to be searched for.\\n\");\n return 0;\n }\n searchStr = argv[1];\n WrenConfiguration config;\n wrenInitConfiguration(&config);\n config.writeFn = &writeFn;\n config.errorFn = &errorFn;\n config.bindForeignClassFn = &bindForeignClass;\n config.bindForeignMethodFn = &bindForeignMethod;\n config.loadModuleFn = &loadModule;\n WrenVM* vm = wrenNewVM(&config);\n const char* module = \"main\";\n const char* fileName = \"Retrieve_and_search_chat_history.wren\";\n char *script = readFile(fileName);\n WrenInterpretResult result = wrenInterpret(vm, module, script);\n switch (result) {\n case WREN_RESULT_COMPILE_ERROR:\n printf(\"Compile Error!\\n\");\n break;\n case WREN_RESULT_RUNTIME_ERROR:\n printf(\"Runtime Error!\\n\");\n break;\n case WREN_RESULT_SUCCESS:\n break;\n }\n wrenFreeVM(vm);\n free(script);\n return 0;\n}\n","language":"Wren"},{"code":"#<<<#\nhttp://tclers.tk/conferences/tcl/:\n2017-04-03.tcl 30610 bytes Apr 03, 2017 21:55:37\n2017-04-04.tcl 67996 bytes Apr 04, 2017 21:57:01\n...\n\nContents (eg 2017-01-19.tcl):\nm 2017-01-19T23:01:02Z ijchain {*** Johannes13__ leaves}\nm 2017-01-19T23:15:37Z ijchain {*** fahadash leaves}\nm 2017-01-19T23:27:00Z ijchain {*** Buster leaves}\n...\n#<<<#\n\nvar [const] CURL=Import.lib(\"zklCurl\")();\t// libCurl instance\n\ntemplate:=\"http://tclers.tk/conferences/tcl/%4d-%02d-%02d.tcl\";\nymd :=Time.Clock.UTC[0,3];\t// now, (y,m,d)\nback :=10;\t\t\t// days in the past\nneedle :=vm.nthArg(0);\t\t// search string\nforeach d in ([-back+1..0]){\t// we want day -9,-8,-7..0 (today)\n date :=Time.Date.subYMD(ymd, 0,0,-d); // date minus days\n url :=template.fmt(date.xplode());\n haystack:=CURL.get(url);\t// (request bytes, header length)\n haystack=haystack[0].del(0,haystack[1]);\t// remove HTML header\n mentions:=haystack.filter(\"find\",needle);\t// search lines\n if(mentions) println(\"%s\\n------\\n%s------\\n\".fmt(url,mentions.text));\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Date and time\\n- Networking and Web Interaction\\n- Text processing\\nfrom: http://rosettacode.org/wiki/Retrieve_and_search_chat_history\\nnote: Programming environment operations\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\n\\n'''Summary:''' Find and print the mentions of a given string in the recent chat logs from a chatroom. Only use your programming language's standard library.\\n\\n'''Details:''' \\n\\nThe Tcl Chatroom is an online chatroom. Its conversations are logged. It's useful to know if someone has mentioned you or your project in the chatroom recently. You can find this out by searching the chat logs. The logs are publicly available at http://tclers.tk/conferences/tcl/. One log file corresponds to the messages from one day in [[wp:Time in Germany|Germany's current time zone]]. Each chat log file has the name <tt>YYYY-MM-DD.tcl</tt> where <tt>YYYY</tt> is the year, <tt>MM</tt> is the month and <tt>DD</tt> the day. The logs store one message per line. The messages themselves are human-readable and their internal structure doesn't matter.\\n\\nRetrieve the chat logs from the last 10 days via [[HTTP]]. Find the lines that include a particular [[substring]] and print them in the following format:\\n\\n<pre><log file URL>\\n------\\n<matching line 1>\\n<matching line 2>\\n...\\n<matching line N>\\n------\\n\\n</pre>\\n\\nThe substring will be given to your program as a command line argument.\\n\\nYou need to account for the possible time zone difference between the client running your program and the chat log writer on the server to not miss any mentions. (For example, if you generated the log file URLs naively based on the local date, you could miss mentions if it was already April 5th for the logger but only April 4th for the client.) What this means in practice is that you should either generate the URLs in the time zone <tt>Europe/Berlin</tt> or, if your language can not do that, add an extra day (today + 1) to the range of dates you check, but then make sure to not print parts of a \\\"not found\\\" page by accident if a log file doesn't exist yet.\\n\\nThe code should be contained in a single-file script, with no \\\"project\\\" or \\\"dependency\\\" file (e.g., no <tt>requirements.txt</tt> for Python). It should only use a given programming language's standard library to accomplish this task and not rely on the user having installed any third-party packages.\\n\\nIf your language does not have an HTTP client in the standard library, you can speak raw HTTP 1.0 to the server. If it can't parse command line arguments in a standalone script, read the string to look for from the standard input.\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"#include<curl/curl.h>\\n#include<string.h>\\n#include<stdio.h>\\n\\n#define MAX_LEN 1000\\n\\nvoid searchChatLogs(char* searchString){\\n\\tchar* baseURL = \\\"http://tclers.tk/conferences/tcl/\\\";\\n\\ttime_t t;\\n\\tstruct tm* currentDate;\\n\\tchar dateString[30],dateStringFile[30],lineData[MAX_LEN],targetURL[100];\\n\\tint i,flag;\\n\\tFILE *fp;\\n\\t\\n\\tCURL *curl;\\n\\tCURLcode res;\\n\\t\\n\\ttime(&t);\\n\\tcurrentDate = localtime(&t);\\n\\t\\n\\tstrftime(dateString, 30, \\\"%Y-%m-%d\\\", currentDate);\\n\\tprintf(\\\"Today is : %s\\\",dateString);\\n\\t\\n\\tif((curl = curl_easy_init())!=NULL){\\n\\t\\tfor(i=0;i<=10;i++){\\n\\t\\t\\t\\n\\t\\tflag = 0;\\n\\t\\tsprintf(targetURL,\\\"%s%s.tcl\\\",baseURL,dateString);\\n\\t\\t\\n\\t\\tstrcpy(dateStringFile,dateString);\\n\\t\\t\\n\\t\\tprintf(\\\"\\\\nRetrieving chat logs from %s\\\\n\\\",targetURL);\\n\\t\\t\\n\\t\\tif((fp = fopen(\\\"nul\\\",\\\"w\\\"))==0){\\n\\t\\t\\tprintf(\\\"Cant's read from %s\\\",targetURL);\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tcurl_easy_setopt(curl, CURLOPT_URL, targetURL);\\n\\t\\tcurl_easy_setopt(curl, CURLOPT_WRITEDATA, fp);\\n\\t\\t\\n\\t\\tres = curl_easy_perform(curl);\\n\\t\\t\\n\\t\\tif(res == CURLE_OK){\\n\\t\\t\\twhile(fgets(lineData,MAX_LEN,fp)!=NULL){\\n\\t\\t\\t\\tif(strstr(lineData,searchString)!=NULL){\\n\\t\\t\\t\\t\\tflag = 1;\\n\\t\\t\\t\\t\\tfputs(lineData,stdout);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(flag==0)\\n\\t\\t\\t\\tprintf(\\\"\\\\nNo matching lines found.\\\");\\n\\t\\t}\\n\\t\\tfflush(fp);\\n\\t\\tfclose(fp);\\n\\t\\t}\\n\\t\\t\\n\\t\\tcurrentDate->tm_mday--;\\n\\t\\tmktime(currentDate);\\n\\t\\tstrftime(dateString, 30, \\\"%Y-%m-%d\\\", currentDate);\\t\\n\\t\\t\\t\\n\\t}\\n\\tcurl_easy_cleanup(curl);\\n\\t\\n\\t}\\n}\\n\\nint main(int argC,char* argV[])\\n{\\n\\tif(argC!=2)\\n\\t\\tprintf(\\\"Usage : %s <followed by search string, enclosed by \\\\\\\" if it contains spaces>\\\",argV[0]);\\n\\telse\\n\\t\\tsearchChatLogs(argV[1]);\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#! /usr/bin/env elixir\\ndefmodule Mentions do\\n def get(url) do\\n {:ok, {{_, 200, _}, _, body}} =\\n url\\n |> String.to_charlist()\\n |> :httpc.request()\\n data = List.to_string(body)\\n if Regex.match?(~r|<!Doctype HTML.*<Title>URL Not Found</Title>|s, data) do\\n {:error, \\\"log file not found\\\"}\\n else\\n {:ok, data}\\n end\\n end\\n\\n def perg(haystack, needle) do\\n haystack\\n |> String.split(\\\"\\\\n\\\")\\n |> Enum.filter(fn x -> String.contains?(x, needle) end)\\n end\\n\\n def generate_url(n) do\\n date_str =\\n DateTime.utc_now()\\n |> DateTime.to_unix()\\n |> (fn x -> x + 60*60*24*n end).()\\n |> DateTime.from_unix!()\\n |> (fn %{year: y, month: m, day: d} ->\\n :io_lib.format(\\\"~B-~2..0B-~2..0B\\\", [y, m, d])\\n end).()\\n \\\"http://tclers.tk/conferences/tcl/#{date_str}.tcl\\\"\\n end\\nend\\n\\n[needle] = System.argv()\\n:application.start(:inets)\\nback = 10\\n# Elixir does not come standard with time zone definitions, so we add an extra\\n# day to account for the possible difference between the local and the server\\n# time.\\nfor i <- -back..1 do\\n url = Mentions.generate_url(i)\\n with {:ok, haystack} <- Mentions.get(url),\\n # If the result is a non-empty list...\\n [h | t] <- Mentions.perg(haystack, needle) do\\n IO.puts(\\\"#{url}\\\\n------\\\\n#{Enum.join([h | t], \\\"\\\\n\\\")}\\\\n------\\\\n\\\")\\n end\\nend\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"#!/usr/bin/env fsharpi\\nlet server_tz =\\n try\\n // CLR on Windows\\n System.TimeZoneInfo.FindSystemTimeZoneById(\\\"W. Europe Standard Time\\\")\\n with\\n // Mono\\n :? System.TimeZoneNotFoundException ->\\n System.TimeZoneInfo.FindSystemTimeZoneById(\\\"Europe/Berlin\\\")\\n\\nlet get url =\\n let req = System.Net.WebRequest.Create(System.Uri(url))\\n use resp = req.GetResponse()\\n use stream = resp.GetResponseStream()\\n use reader = new System.IO.StreamReader(stream)\\n reader.ReadToEnd()\\n\\nlet grep needle (haystack : string) =\\n haystack.Split('\\\\n')\\n |> Array.toList\\n |> List.filter (fun x -> x.Contains(needle))\\n\\nlet genUrl n =\\n let day = System.DateTime.UtcNow.AddDays(float n)\\n let server_dt = System.TimeZoneInfo.ConvertTimeFromUtc(day, server_tz)\\n let timestamp = server_dt.ToString(\\\"yyyy-MM-dd\\\")\\n sprintf \\\"http://tclers.tk/conferences/tcl/%s.tcl\\\" timestamp\\n\\nlet _ =\\n match fsi.CommandLineArgs with\\n | [|_; needle|] ->\\n let back = 10\\n for i in -back .. 0 do\\n let url = genUrl i\\n let found = url |> get |> grep needle |> String.concat \\\"\\\\n\\\"\\n if found <> \\\"\\\" then printfn \\\"%s\\\\n------\\\\n%s\\\\n------\\\\n\\\" url found\\n else ()\\n | x ->\\n printfn \\\"Usage: %s literal\\\" (Array.get x 0)\\n System.Environment.Exit(1)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"#include \\\"curl.bi\\\"\\n#include \\\"vbcompat.bi\\\"\\n#define NULL 0\\n\\nDim Shared As CURL Ptr curl = NULL\\n\\nFunction WriteMemoryCallback(Byval contents As Any Ptr, Byval size As Uinteger, Byval nmemb As Uinteger, Byval userp As String Ptr) As Uinteger\\n Dim As Uinteger realsize = size * nmemb\\n *userp &= *Cptr(ZString Ptr, contents)\\n Return realsize\\nEnd Function\\n\\nFunction download(url As String) As String\\n If curl = NULL Then\\n curl_global_init(CURL_GLOBAL_DEFAULT)\\n curl = curl_easy_init()\\n End If\\n Dim As String readBuffer = \\\"\\\"\\n curl_easy_setopt(curl, CURLOPT_URL, url)\\n curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, @WriteMemoryCallback)\\n curl_easy_setopt(curl, CURLOPT_WRITEDATA, @readBuffer)\\n Dim As CURLcode res = curl_easy_perform(curl)\\n If res <> 0 Then\\n Print \\\"libcurl error \\\"; res; \\\" (\\\"; *curl_easy_strerror(res); \\\")\\\"\\n Return \\\"\\\"\\n End If\\n Return readBuffer\\nEnd Function\\n\\nFunction grep(needle As String, haystack As String) As String\\n Dim As Integer i, j\\n Dim As String res = \\\"\\\"\\n j = 1\\n For i = 1 To Len(haystack)\\n If Mid(haystack, i, 1) = Chr(10) Then\\n Dim As String linea = Mid(haystack, j, i - j)\\n If Instr(linea, needle) Then\\n res &= linea & Chr(10)\\n End If\\n j = i + 1\\n End If\\n Next i\\n If Len(res) = 0 Then res = \\\"no occurrences\\\"\\n Return res\\nEnd Function\\n\\nDim As String needle = \\\"github\\\"\\nDim As Integer days = 10\\nDim As Integer i\\nFor i = -days To 0\\n Dim As String dateStr = Format(Dateadd(\\\"d\\\", i, Cdbl(Date)), \\\"yyyy-mm-dd\\\")\\n Dim As String url = \\\"http://tclers.tk/conferences/tcl/\\\" & dateStr & \\\".tcl\\\"\\n Dim As String contents = download(url)\\n If Len(contents) = 0 Then Exit For\\n Print url\\n Print grep(needle, contents)\\nNext i\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"fmt\\\"\\n\\t\\\"io/ioutil\\\"\\n\\t\\\"log\\\"\\n\\t\\\"net/http\\\"\\n\\t\\\"os\\\"\\n\\t\\\"strings\\\"\\n\\t\\\"time\\\"\\n)\\n\\nfunc get(url string) (res string, err error) {\\n\\tresp, err := http.Get(url)\\n\\tif err != nil {\\n\\t\\treturn \\\"\\\", err\\n\\t}\\n\\tbuf, err := ioutil.ReadAll(resp.Body)\\n\\tif err != nil {\\n\\t\\treturn \\\"\\\", err\\n\\t}\\n\\treturn string(buf), nil\\n}\\n\\nfunc grep(needle string, haystack string) (res []string) {\\n\\tfor _, line := range strings.Split(haystack, \\\"\\\\n\\\") {\\n\\t\\tif strings.Contains(line, needle) {\\n\\t\\t\\tres = append(res, line)\\n\\t\\t}\\n\\t}\\n\\treturn res\\n}\\n\\nfunc genUrl(i int, loc *time.Location) string {\\n\\tdate := time.Now().In(loc).AddDate(0, 0, i)\\n\\treturn date.Format(\\\"http://tclers.tk/conferences/tcl/2006-01-02.tcl\\\")\\n}\\n\\nfunc main() {\\n\\tneedle := os.Args[1]\\n\\tback := -10\\n\\tserverLoc, err := time.LoadLocation(\\\"Europe/Berlin\\\")\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\tfor i := back; i <= 0; i++ {\\n\\t\\turl := genUrl(i, serverLoc)\\n\\t\\tcontents, err := get(url)\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Fatal(err)\\n\\t\\t}\\n\\t\\tfound := grep(needle, contents)\\n\\t\\tif len(found) > 0 {\\n\\t\\t\\tfmt.Printf(\\\"%v\\\\n------\\\\n\\\", url)\\n\\t\\t\\tfor _, line := range found {\\n\\t\\t\\t\\tfmt.Printf(\\\"%v\\\\n\\\", line)\\n\\t\\t\\t}\\n\\t\\t\\tfmt.Printf(\\\"------\\\\n\\\\n\\\")\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import java.io.BufferedReader;\\nimport java.io.IOException;\\nimport java.io.InputStreamReader;\\nimport java.net.HttpURLConnection;\\nimport java.net.URI;\\nimport java.net.URISyntaxException;\\nimport java.net.URL;\\nimport java.time.LocalDate;\\nimport java.time.ZoneId;\\nimport java.time.ZonedDateTime;\\n\\npublic final class RetrieveAndSearchChatHistory {\\n\\n\\tpublic static void main(String[] aArgs) throws URISyntaxException, IOException {\\t\\t\\n\\t\\tString subjectOfSearch = aArgs[0]; // The string 'available' was used to produce the displayed output.\\n\\n\\t\\tZonedDateTime now = ZonedDateTime.now(ZoneId.of(\\\"Europe/Berlin\\\"));\\n\\t\\tLocalDate tomorrow = now.toLocalDate().plusDays(1);\\n\\t\\tLocalDate testDate = tomorrow.minusDays(10);\\n\\n\\t\\twhile ( ! testDate.equals(tomorrow ) ) {\\n\\t URL address = new URI(\\\"http://tclers.tk/conferences/tcl/\\\" + testDate + \\\".tcl\\\").toURL();\\t\\n\\t HttpURLConnection connection = (HttpURLConnection) address.openConnection();\\n\\t BufferedReader reader = new BufferedReader( new InputStreamReader(connection.getInputStream()) );\\n\\t\\n\\t System.out.println(\\\"Searching chat logs for \\\" + testDate);\\t\\n\\t String line = \\\"\\\";\\n\\t while ( ( line = reader.readLine() ).contains(subjectOfSearch) ) {\\n\\t \\tSystem.out.println(line);\\n\\t }\\n\\t\\n\\t reader.close();\\n\\t connection.disconnect();\\n\\t testDate = testDate.plusDays(1);\\n\\t\\t}\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"using Dates, TimeZones, HTTP, Printf\\n\\nfunction geturlbyday(n)\\n d = DateTime(now(tz\\\"Europe/Berlin\\\")) + Day(n) # n should be <= 0\\n uri = @sprintf(\\\"http://tclers.tk/conferences/tcl/%04d-%02d-%02d.tcl\\\",\\n year(d), month(d), day(d))\\n return uri, String(HTTP.request(\\\"GET\\\", uri).body)\\nend\\n\\nfunction searchlogs(text = ARGS[1], daysback = 9)\\n for n in -daysback:0\\n fname, searchtext = geturlbyday(n)\\n println(\\\"$fname\\\\n------\\\")\\n for line in split(searchtext, \\\"\\\\n\\\")\\n if findfirst(text, line) != nothing\\n println(line)\\n end\\n end\\n println(\\\"------\\\\n\\\")\\n end\\nend\\n\\nif length(ARGS) != 1\\n println(\\\"Usage: type search phrase in quotes as an argument.\\\")\\nelse\\n searchlogs()\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"matchFrom[url_String, str_String] := Select[StringSplit[Import[url, \\\"String\\\"], \\\"\\\\n\\\"], StringMatchQ[str]]\\ngetLogLinks[n_] :=\\n Select[Import[\\\"http://tclers.tk/conferences/tcl/\\\", \\\"Hyperlinks\\\"],\\n First[\\n StringCases[#1, \\\"tcl/\\\" ~~ date__ ~~ \\\".tcl\\\" :> DateDifference[DateObject[URLDecode[date], TimeZone -> \\\"Europe/Berlin\\\"], Now]]] <=\\n Quantity[n, \\\"Days\\\"] & ]\\nsearchLogs[str_String] := Block[{data},\\n Map[\\n (data = matchFrom[#, str];\\n If[Length[data] > 0,\\n Print /@ Join[{#, \\\"-----\\\"}, data, {\\\"----\\\\n\\\"}]]) &,\\n getLogLinks[10]]]\\nsearchLogs[\\\"*lazy*\\\"];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import httpclient, os, re, strformat, strutils, sugar, times\\n\\nconst Template = \\\"'http://tclers.tk/conferences/tcl/'yyyy-MM-dd'.tcl'\\\"\\n\\nproc get(url: string): string =\\n var client = newHttpClient()\\n result = client.getContent(url)\\n if result.match(re\\\"<!Doctype HTML[\\\\s\\\\S]*<Title>URL Not Found</Title>\\\"):\\n result = \\\"\\\"\\n client.close()\\n\\nlet today = now()\\nconst Back = 10\\nif paramCount() != 1:\\n quit \\\"Wrong number of parameters\\\", QuitFailure\\nlet needle = paramStr(1)\\nfor i in -Back..1:\\n let day = today + initTimeInterval(days = i)\\n let url = day.format(Template)\\n let haystack = url.get()\\n if haystack.len != 0:\\n let mentions = collect(newSeq):\\n for line in haystack.splitLines(keepEol = true):\\n if needle in line:\\n line\\n if mentions.len > 0:\\n echo &\\\"{url}\\\\n------\\\\n{mentions.join()}------\\\\n\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"# 20210316 Perl programming solution\\n\\nuse strict;\\nuse warnings;\\nuse Time::Piece;\\nuse IO::Socket::INET;\\nuse HTTP::Tiny;\\nuse feature 'say';\\n\\nmy $needle = shift @ARGV // '';\\nmy @haystack = ();\\nmy $page = '';\\n\\n# 10 days before today\\nmy $begin = Time::Piece->new - 10 * Time::Piece::ONE_DAY;\\nsay \\\" Executed at: \\\", Time::Piece->new;\\nsay \\\"Begin searching from: $begin\\\";\\n\\nfor (my $date = $begin ; Time::Piece->new > $date ; $date += Time::Piece::ONE_DAY) {\\n $page .= HTTP::Tiny->new()->get( 'http://tclers.tk/conferences/tcl/'.$date->strftime('%Y-%m-%d').'.tcl')->{content};\\n}\\n\\n# process pages\\nmy @lines = split /\\\\n/, $page;\\nfor (@lines) { push @haystack, $_ if substr($_, 0, 13) =~ m/^m \\\\d\\\\d\\\\d\\\\d-\\\\d\\\\d-\\\\d\\\\dT/ }\\n\\n# print the first and last line of the haystack\\nsay \\\"First and last lines of the haystack:\\\";\\nsay $haystack[0] and say $haystack[-1];\\n\\nsay \\\"Needle: \\\", $needle;\\nsay '-' x 79;\\n\\n# find and print needle lines\\nfor (@haystack) { say $_ if (index($_, $needle) != -1) }\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">builtins</span><span style=\\\"color: #0000FF;\\\">\\\\</span><span style=\\\"color: #000000;\\\">libcurl</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">curl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">NULL</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">download</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">url</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">NULL</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">curl_global_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">curl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">curl_easy_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">curl_easy_setopt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">CURLOPT_URL</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">url</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">curl_easy_perform_ex</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #004080;\\\">integer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"libcurl error %d (%s)\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">curl_easy_strerror</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">grep</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">needle</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">haystack</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">lines</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">haystack</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lines</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">match</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">needle</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">lines</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">lines</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">={}</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"no occurences\\\"</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">builtins</span><span style=\\\"color: #0000FF;\\\">\\\\</span><span style=\\\"color: #004080;\\\">timedate</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">gen_url</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">timezone</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">timedate</span> <span style=\\\"color: #000000;\\\">td</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">set_timezone</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">date</span><span style=\\\"color: #0000FF;\\\">(),</span><span style=\\\"color: #000000;\\\">timezone</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">td</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">adjust_timedate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">td</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">timedelta</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">days</span><span style=\\\"color: #0000FF;\\\">:=</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">format_timedate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">td</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"'http://tclers.tk/conferences/tcl/'YYYY-MM-DD'.tcl'\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">cl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">command_line</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">needle</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"github\\\"</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">days</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">10</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cl</span><span style=\\\"color: #0000FF;\\\">)>=</span><span style=\\\"color: #000000;\\\">3</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">needle</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">cl</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cl</span><span style=\\\"color: #0000FF;\\\">)>=</span><span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">days</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #7060A8;\\\">to_integer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cl</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">days</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cl</span><span style=\\\"color: #0000FF;\\\">)>=</span><span style=\\\"color: #000000;\\\">5</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=-</span><span style=\\\"color: #000000;\\\">days</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">url</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">gen_url</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"CEST\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">contents</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">download</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">url</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">contents</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">url</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">grep</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">needle</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">contents</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"#! /usr/bin/env python3\\nimport datetime\\nimport re\\nimport urllib.request\\nimport sys\\n\\ndef get(url):\\n with urllib.request.urlopen(url) as response:\\n html = response.read().decode('utf-8')\\n if re.match(r'<!Doctype HTML[\\\\s\\\\S]*<Title>URL Not Found</Title>', html):\\n return None\\n return html\\n\\ndef main():\\n template = 'http://tclers.tk/conferences/tcl/%Y-%m-%d.tcl'\\n today = datetime.datetime.utcnow()\\n back = 10\\n needle = sys.argv[1]\\n # Since Python does not come standard with time zone definitions, add an\\n # extra day to account for the possible difference between the local and the\\n # server time.\\n for i in range(-back, 2):\\n day = today + datetime.timedelta(days=i)\\n url = day.strftime(template)\\n haystack = get(url)\\n if haystack:\\n mentions = [x for x in haystack.split('\\\\n') if needle in x]\\n if mentions:\\n print('{}\\\\n------\\\\n{}\\\\n------\\\\n'\\n .format(url, '\\\\n'.join(mentions)))\\n\\nmain()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n(require net/url)\\n(require racket/date)\\n\\n;; generate archive url from specified number of days in the past\\n(define (generate-url days-ago)\\n (putenv \\\"TZ\\\" \\\"Europe/Berlin\\\") ; this works for Linux\\n (let* [(today (current-date))\\n (past (seconds->date (- (date->seconds today) (* days-ago 60 60 24))))\\n (date-str (string-append\\n (~r (date-year past) #:min-width 4 #:pad-string \\\"0\\\") ; 4 digit year\\n \\\"-\\\"\\n (~r (date-month past) #:min-width 2 #:pad-string \\\"0\\\") ; 2 digit month\\n \\\"-\\\"\\n (~r (date-day past) #:min-width 2 #:pad-string \\\"0\\\"))) ; 2 digit day\\n (url (string-append \\\"http://tclers.tk/conferences/tcl/\\\" date-str \\\".tcl\\\"))]\\n url))\\n\\n;; retrieve content of url as a list of strings\\n(define (get-content-of-url url-string)\\n (let [(st (open-output-string))]\\n (copy-port (get-pure-port (string->url url-string)\\n #:redirections 100)\\n st)\\n (string-split (get-output-string st) \\\"\\\\n\\\"))) ; divide on line breaks\\n\\n;; from a list of strings, return a list of those containing the search string\\n(define (get-matches lines search-string)\\n (define (internal-get-matches lines search-string results)\\n (cond\\n ((empty? lines) results)\\n (else (internal-get-matches (cdr lines)\\n search-string\\n (if (string-contains? (car lines) search-string)\\n (append results (list (car lines)))\\n results)))))\\n (internal-get-matches lines search-string (list)))\\n\\n;; display last 10 days worth of archives that contain matches to the search string\\n(define (display-matches-for-last-10-days search-string)\\n ;; get archives from 9 days ago until today\\n (for/list ([i (range 9 -1 -1)])\\n (let* ([url (generate-url i)]\\n [matches (get-matches (get-content-of-url url) search-string)])\\n (cond [(not (empty? matches))\\n (begin\\n (display url)(newline)\\n (display \\\"------\\\\n\\\")\\n (for/list ([line matches]) (display line)(newline))\\n (display \\\"------\\\\n\\\"))]))))\\n\\n\\n;; use the first command line argument as the search string\\n;; display usage info if no search string is provided\\n(cond ((= 0 (vector-length (current-command-line-arguments))) (display \\\"USAGE: chat_history <search term>\\\\n\\\"))\\n (else (display-matches-for-last-10-days (vector-ref (current-command-line-arguments) 0))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my $needle = @*ARGS.shift // '';\\nmy @haystack;\\n\\n# 10 days before today, Zulu time\\nmy $begin = DateTime.new(time).utc.earlier(:10days);\\nsay \\\" Executed at: \\\", DateTime.new(time).utc;\\nsay \\\"Begin searching from: $begin\\\";\\n\\n# Today - 10 days through today\\nfor $begin.Date .. DateTime.now.utc.Date -> $date {\\n\\n # connect to server, use a raw socket\\n my $http = IO::Socket::INET.new(:host('tclers.tk'), :port(80));\\n\\n # request file\\n $http.print: \\\"GET /conferences/tcl/{$date}.tcl HTTP/1.0\\\\n\\\\n\\\";\\n\\n # retrieve file\\n my @page = $http.lines;\\n\\n # remove header\\n @page.splice(0, 8);\\n\\n # concatenate multi-line entries to a single line\\n while @page {\\n if @page[0].substr(0, 13) ~~ m/^'m '\\\\d\\\\d\\\\d\\\\d'-'\\\\d\\\\d'-'\\\\d\\\\d'T'/ {\\n @haystack.push: @page.shift;\\n }\\n else {\\n @haystack.tail ~= '' ~ @page.shift;\\n }\\n }\\n\\n # close socket\\n $http.close;\\n}\\n\\n# ignore times before 10 days ago\\n@haystack.shift while @haystack[0].substr(2, 22) lt $begin.Str;\\n\\n# print the first and last line of the haystack\\nsay \\\"First and last lines of the haystack:\\\";\\n.say for |@haystack[0, *-1];\\nsay \\\"Needle: \\\", $needle;\\nsay '-' x 79;\\n\\n# find and print needle lines\\n.say if .contains( $needle ) for @haystack;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"#! /usr/bin/env ruby\\nrequire 'net/http'\\nrequire 'time'\\n\\ndef gen_url(i)\\n day = Time.now + i*60*60*24\\n # Set the time zone in which to format the time, per\\n # https://coderwall.com/p/c7l82a/create-a-time-in-a-specific-timezone-in-ruby\\n old_tz = ENV['TZ']\\n ENV['TZ'] = 'Europe/Berlin'\\n url = day.strftime('http://tclers.tk/conferences/tcl/%Y-%m-%d.tcl')\\n ENV['TZ'] = old_tz\\n url\\nend\\n\\ndef main\\n back = 10\\n needle = ARGV[0]\\n (-back..0).each do |i|\\n url = gen_url(i)\\n haystack = Net::HTTP.get(URI(url)).split(\\\"\\\\n\\\")\\n mentions = haystack.select { |x| x.include? needle }\\n if !mentions.empty?\\n puts \\\"#{url}\\\\n------\\\\n#{mentions.join(\\\"\\\\n\\\")}\\\\n------\\\\n\\\"\\n end\\n end\\nend\\n\\nmain\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"import java.net.Socket\\nimport java.net.URL\\nimport java.time\\nimport java.time.format\\nimport java.time.ZoneId\\nimport java.util.Scanner\\nimport scala.collection.JavaConverters._\\n\\ndef get(rawUrl: String): List[String] = {\\n val url = new URL(rawUrl)\\n val port = if (url.getPort > -1) url.getPort else 80\\n val sock = new Socket(url.getHost, port)\\n sock.getOutputStream.write(\\n s\\\"GET /${url.getPath()} HTTP/1.0\\\\n\\\\n\\\".getBytes(\\\"UTF-8\\\")\\n )\\n new Scanner(sock.getInputStream).useDelimiter(\\\"\\\\n\\\").asScala.toList\\n}\\n\\ndef genUrl(n: Long) = {\\n val date = java.time.ZonedDateTime\\n .now(ZoneId.of(\\\"Europe/Berlin\\\"))\\n .plusDays(n)\\n .format(java.time.format.DateTimeFormatter.ISO_LOCAL_DATE)\\n s\\\"http://tclers.tk/conferences/tcl/$date.tcl\\\"\\n}\\n\\nval back = 10\\nval literal = args(0)\\nfor (i <- -back to 0) {\\n val url = genUrl(i)\\n print(get(url).filter(_.contains(literal)) match {\\n case List() => \\\"\\\"\\n case x => s\\\"$url\\\\n------\\\\n${x.mkString(\\\"\\\\n\\\")}\\\\n------\\\\n\\\\n\\\"\\n })\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"CommandLineHandler subclass: #ChatHistorySearchCommandLineHandler\\n\\tinstanceVariableNames: ''\\n\\tclassVariableNames: ''\\n\\tpoolDictionaries: ''\\n\\tcategory: 'RosettaCode'!\\n\\n!ChatHistorySearchCommandLineHandler methodsFor: 'activation' stamp: 'EduardoPadoan 1/27/2019 15:18'!\\nactivate\\n\\tself searchHistoryFor: self arguments first.\\n\\tself quit! !\\n\\n\\n!ChatHistorySearchCommandLineHandler methodsFor: 'commands' stamp: 'EduardoPadoan 1/27/2019 17:01'!\\nsearchHistoryFor: aString\\n\\t| today startDate |\\n\\t\\n\\t\\\"XXX Doesn't account for DST\\\"\\n\\ttoday := DateAndTime now offset: 1 hours.\\n\\tstartDate := today - 10 days.\\n\\n\\tstartDate to: today by: 1 days do: [ :targetDate |\\n\\t\\t| url response |\\n\\n\\t\\turl := String streamContents: [ :aStream |\\n\\t\\t\\taStream nextPutAll: 'http://tclers.tk/conferences/tcl/'.\\n\\t\\t\\ttargetDate printYMDOn: aStream.\\n\\t\\t\\taStream nextPutAll: '.tcl'.\\n\\t\\t].\\n\\n\\t\\tresponse := ZnEasy get: url.\\n\\n\\t\\tresponse contents asString linesDo: [ :line |\\n\\t\\t\\t(line asLowercase includesSubstring: aString asLowercase) ifTrue: [\\n\\t\\t\\t\\tself stdout print: line; lf.\\n\\t\\t\\t]\\n\\t\\t]\\n\\t]! !\\n\\n\\\"-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- \\\"!\\n\\nChatHistorySearchCommandLineHandler class\\n\\tinstanceVariableNames: ''!\\n\\n!ChatHistorySearchCommandLineHandler class methodsFor: 'accessing' stamp: 'EduardoPadoan 1/27/2019 14:53'!\\ndescription\\n\\t^ 'Look for a pattern in the TCL chat history'! !\\n\\n!ChatHistorySearchCommandLineHandler class methodsFor: 'accessing' stamp: 'EduardoPadoan 1/27/2019 14:50'!\\ncommandName\\n\\t^ 'searchHistory'! !\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"#! /usr/bin/env tclsh\\npackage require http\\n\\nproc get url {\\n set r [::http::geturl $url]\\n set content [::http::data $r]\\n ::http::cleanup $r\\n return $content\\n}\\n\\nproc grep {needle haystack} {\\n lsearch -all \\\\\\n -inline \\\\\\n -glob \\\\\\n [split $haystack \\\\n] \\\\\\n *[string map {* \\\\\\\\* ? \\\\\\\\? \\\\\\\\ \\\\\\\\\\\\\\\\ [ \\\\\\\\[ ] \\\\\\\\]} $needle]*\\n}\\n\\nproc main argv {\\n lassign $argv needle\\n set urlTemplate http://tclers.tk/conferences/tcl/%Y-%m-%d.tcl\\n set back 10\\n set now [clock seconds]\\n for {set i -$back} {$i <= 0} {incr i} {\\n set date [clock add $now $i days]\\n set url [clock format $date \\\\\\n -format $urlTemplate \\\\\\n -timezone :Europe/Berlin]\\n set found [grep $needle [get $url]]\\n if {$found ne {}} {\\n puts $url\\\\n------\\\\n[join $found \\\\n]\\\\n------\\\\n\\n }\\n }\\n}\\n\\nmain $argv\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#! /usr/bin/env jimsh\\nproc get url {\\n if {![regexp {http://([a-z.]+)(:[0-9]+)?(/.*)} $url _ host port path]} {\\n error \\\"can't parse URL \\\\\\\"$url\\\\\\\"\\\"\\n }\\n if {$port eq {}} { set port 80 }\\n set ch [socket stream $host:$port]\\n puts -nonewline $ch \\\"GET /$path HTTP/1.0\\\\n\\\\n\\\"\\n set content [read $ch]\\n if {[regexp {^HTTP[^<]+<!Doctype HTML.*<Title>URL Not Found</Title>} \\\\\\n $content]} {\\n error {log file not found}\\n }\\n close $ch\\n return $content\\n}\\n\\nproc grep {needle haystack} {\\n lsearch -all \\\\\\n -inline \\\\\\n -glob \\\\\\n [split $haystack \\\\n] \\\\\\n *[string map {* \\\\\\\\* ? \\\\\\\\? \\\\\\\\ \\\\\\\\\\\\\\\\ [ \\\\\\\\[ ] \\\\\\\\]} $needle]*\\n}\\n\\nproc main argv {\\n lassign $argv needle\\n set urlTemplate http://tclers.tk/conferences/tcl/%Y-%m-%d.tcl\\n set back 10\\n set now [clock seconds]\\n # Jim Tcl doesn't support time zones, so we add an extra day to account for\\n # the possible difference between the local and the server time.\\n for {set i -$back} {$i <= 1} {incr i} {\\n set date [expr {$now + $i*60*60*24}]\\n set url [clock format $date -format $urlTemplate]\\n catch {\\n set found [grep $needle [get $url]]\\n if {$found ne {}} {\\n puts $url\\\\n------\\\\n[join $found \\\\n]\\\\n------\\\\n\\n }\\n }\\n }\\n}\\n\\nmain $argv\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"/* Retrieve_and_search_chat_history.wren */\\n\\nimport \\\"./date\\\" for Date\\n\\nvar CURLOPT_URL = 10002\\nvar CURLOPT_FOLLOWLOCATION = 52\\nvar CURLOPT_WRITEFUNCTION = 20011\\nvar CURLOPT_WRITEDATA = 10001\\n\\nclass C {\\n foreign static searchStr\\n foreign static utcNow // format will be yyyy-mm-dd hh:MM:ss\\n}\\n\\nforeign class Buffer {\\n construct new() {} // C will allocate buffer of a suitable size\\n\\n foreign value // returns buffer contents as a string\\n}\\n\\nforeign class Curl {\\n construct easyInit() {}\\n\\n foreign easySetOpt(opt, param)\\n\\n foreign easyPerform()\\n\\n foreign easyCleanup()\\n}\\n\\nvar curl = Curl.easyInit()\\n\\nvar getContent = Fn.new { |url|\\n var buffer = Buffer.new()\\n curl.easySetOpt(CURLOPT_URL, url)\\n curl.easySetOpt(CURLOPT_FOLLOWLOCATION, 1)\\n curl.easySetOpt(CURLOPT_WRITEFUNCTION, 0) // write function to be supplied by C\\n curl.easySetOpt(CURLOPT_WRITEDATA, buffer)\\n curl.easyPerform()\\n return buffer.value\\n}\\n\\nvar baseUrl = \\\"http://tclers.tk/conferences/tcl/\\\"\\nvar searchStr = C.searchStr\\nvar now = C.utcNow\\nvar d = Date.parse(now)\\nd = d.adjustTime(\\\"CET\\\") // adjust to German time\\nvar fmt = \\\"mmmm| |d| |yyyy| |H|:|MM|am| |zz|\\\"\\nSystem.print(\\\"It's %(d.format(fmt)) just now in Germany.\\\")\\nSystem.print(\\\"Searching for '%(searchStr)' in the TCL Chatroom logs for the last 10 days:\\\\n\\\")\\nfor (i in 0..9) {\\n var date = d.toString.split(\\\" \\\")[0]\\n var url = baseUrl + date + \\\".tcl\\\"\\n var underline = \\\"-\\\" * url.count\\n var content = getContent.call(url)\\n var lines = content.split(\\\"\\\\n\\\")\\n System.print(\\\"%(url)\\\")\\n System.print(underline)\\n for (line in lines) {\\n if (line.indexOf(searchStr) >= 0) System.print(line)\\n }\\n System.print(underline + \\\"\\\\n\\\")\\n d = d.addDays(-1)\\n}\\n\\ncurl.easyCleanup()\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"/* gcc Retrieve_and_search_chat_history.c -o Retrieve_and_search_chat_history -lcurl -lwren -lm */\\n\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <curl/curl.h>\\n#include <time.h>\\n#include \\\"wren.h\\\"\\n\\nconst char *searchStr;\\n\\nstruct MemoryStruct {\\n char *memory;\\n size_t size;\\n};\\n\\n/* C <=> Wren interface functions */\\n\\nstatic size_t WriteMemoryCallback(void *contents, size_t size, size_t nmemb, void *userp) {\\n size_t realsize = size * nmemb;\\n struct MemoryStruct *mem = (struct MemoryStruct *)userp;\\n\\n char *ptr = realloc(mem->memory, mem->size + realsize + 1);\\n if(!ptr) {\\n /* out of memory! */\\n printf(\\\"not enough memory (realloc returned NULL)\\\\n\\\");\\n return 0;\\n }\\n\\n mem->memory = ptr;\\n memcpy(&(mem->memory[mem->size]), contents, realsize);\\n mem->size += realsize;\\n mem->memory[mem->size] = 0;\\n return realsize;\\n}\\n\\nvoid C_searchStr(WrenVM* vm) {\\n wrenSetSlotString(vm, 0, searchStr);\\n}\\n\\nvoid C_utcNow(WrenVM* vm) {\\n time_t now = time(NULL);\\n struct tm *ptm = gmtime(&now);\\n char dateTimeStr[20];\\n strftime(dateTimeStr, 20, \\\"%Y-%m-%d %H:%M:%S\\\", ptm);\\n wrenSetSlotString(vm, 0, dateTimeStr);\\n}\\n\\nvoid C_bufferAllocate(WrenVM* vm) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenSetSlotNewForeign(vm, 0, 0, sizeof(struct MemoryStruct));\\n ms->memory = malloc(1);\\n ms->size = 0;\\n}\\n\\nvoid C_bufferFinalize(void* data) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)data;\\n free(ms->memory);\\n}\\n\\nvoid C_curlAllocate(WrenVM* vm) {\\n CURL** pcurl = (CURL**)wrenSetSlotNewForeign(vm, 0, 0, sizeof(CURL*));\\n *pcurl = curl_easy_init();\\n}\\n\\nvoid C_value(WrenVM* vm) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 0);\\n wrenSetSlotString(vm, 0, ms->memory);\\n}\\n\\nvoid C_easyPerform(WrenVM* vm) {\\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\\n curl_easy_perform(curl);\\n}\\n\\nvoid C_easyCleanup(WrenVM* vm) {\\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\\n curl_easy_cleanup(curl);\\n}\\n\\nvoid C_easySetOpt(WrenVM* vm) {\\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\\n CURLoption opt = (CURLoption)wrenGetSlotDouble(vm, 1);\\n if (opt < 10000) {\\n long lparam = (long)wrenGetSlotDouble(vm, 2);\\n curl_easy_setopt(curl, opt, lparam);\\n } else if (opt < 20000) {\\n if (opt == CURLOPT_WRITEDATA) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 2);\\n curl_easy_setopt(curl, opt, (void *)ms);\\n } else if (opt == CURLOPT_URL) {\\n const char *url = wrenGetSlotString(vm, 2);\\n curl_easy_setopt(curl, opt, url);\\n }\\n } else if (opt < 30000) {\\n if (opt == CURLOPT_WRITEFUNCTION) {\\n curl_easy_setopt(curl, opt, &WriteMemoryCallback);\\n }\\n }\\n}\\n\\nWrenForeignClassMethods bindForeignClass(WrenVM* vm, const char* module, const char* className) {\\n WrenForeignClassMethods methods;\\n methods.allocate = NULL;\\n methods.finalize = NULL;\\n if (strcmp(module, \\\"main\\\") == 0) {\\n if (strcmp(className, \\\"Buffer\\\") == 0) {\\n methods.allocate = C_bufferAllocate;\\n methods.finalize = C_bufferFinalize;\\n } else if (strcmp(className, \\\"Curl\\\") == 0) {\\n methods.allocate = C_curlAllocate;\\n }\\n }\\n return methods;\\n}\\n\\nWrenForeignMethodFn bindForeignMethod(\\n WrenVM* vm,\\n const char* module,\\n const char* className,\\n bool isStatic,\\n const char* signature) {\\n if (strcmp(module, \\\"main\\\") == 0) {\\n if (strcmp(className, \\\"Buffer\\\") == 0) {\\n if (!isStatic && strcmp(signature, \\\"value\\\") == 0) return C_value;\\n } else if (strcmp(className, \\\"C\\\") == 0) {\\n if (isStatic && strcmp(signature, \\\"searchStr\\\") == 0) return C_searchStr;\\n if (isStatic && strcmp(signature, \\\"utcNow\\\") == 0) return C_utcNow;\\n } else if (strcmp(className, \\\"Curl\\\") == 0) {\\n if (!isStatic && strcmp(signature, \\\"easySetOpt(_,_)\\\") == 0) return C_easySetOpt;\\n if (!isStatic && strcmp(signature, \\\"easyPerform()\\\") == 0) return C_easyPerform;\\n if (!isStatic && strcmp(signature, \\\"easyCleanup()\\\") == 0) return C_easyCleanup;\\n }\\n }\\n return NULL;\\n}\\n\\nstatic void writeFn(WrenVM* vm, const char* text) {\\n printf(\\\"%s\\\", text);\\n}\\n\\nvoid errorFn(WrenVM* vm, WrenErrorType errorType, const char* module, const int line, const char* msg) {\\n switch (errorType) {\\n case WREN_ERROR_COMPILE:\\n printf(\\\"[%s line %d] [Error] %s\\\\n\\\", module, line, msg);\\n break;\\n case WREN_ERROR_STACK_TRACE:\\n printf(\\\"[%s line %d] in %s\\\\n\\\", module, line, msg);\\n break;\\n case WREN_ERROR_RUNTIME:\\n printf(\\\"[Runtime Error] %s\\\\n\\\", msg);\\n break;\\n }\\n}\\n\\nchar *readFile(const char *fileName) {\\n FILE *f = fopen(fileName, \\\"r\\\");\\n fseek(f, 0, SEEK_END);\\n long fsize = ftell(f);\\n rewind(f);\\n char *script = malloc(fsize + 1);\\n fread(script, 1, fsize, f);\\n fclose(f);\\n script[fsize] = 0;\\n return script;\\n}\\n\\nstatic void loadModuleComplete(WrenVM* vm, const char* module, WrenLoadModuleResult result) {\\n if( result.source) free((void*)result.source);\\n}\\n\\nWrenLoadModuleResult loadModule(WrenVM* vm, const char* name) {\\n WrenLoadModuleResult result = {0};\\n if (strcmp(name, \\\"random\\\") != 0 && strcmp(name, \\\"meta\\\") != 0) {\\n result.onComplete = loadModuleComplete;\\n char fullName[strlen(name) + 6];\\n strcpy(fullName, name);\\n strcat(fullName, \\\".wren\\\");\\n result.source = readFile(fullName);\\n }\\n return result;\\n}\\n\\nint main(int argc, char **argv) {\\n if (argc != 2) {\\n printf(\\\"Please pass the string to be searched for.\\\\n\\\");\\n return 0;\\n }\\n searchStr = argv[1];\\n WrenConfiguration config;\\n wrenInitConfiguration(&config);\\n config.writeFn = &writeFn;\\n config.errorFn = &errorFn;\\n config.bindForeignClassFn = &bindForeignClass;\\n config.bindForeignMethodFn = &bindForeignMethod;\\n config.loadModuleFn = &loadModule;\\n WrenVM* vm = wrenNewVM(&config);\\n const char* module = \\\"main\\\";\\n const char* fileName = \\\"Retrieve_and_search_chat_history.wren\\\";\\n char *script = readFile(fileName);\\n WrenInterpretResult result = wrenInterpret(vm, module, script);\\n switch (result) {\\n case WREN_RESULT_COMPILE_ERROR:\\n printf(\\\"Compile Error!\\\\n\\\");\\n break;\\n case WREN_RESULT_RUNTIME_ERROR:\\n printf(\\\"Runtime Error!\\\\n\\\");\\n break;\\n case WREN_RESULT_SUCCESS:\\n break;\\n }\\n wrenFreeVM(vm);\\n free(script);\\n return 0;\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"#<<<#\\nhttp://tclers.tk/conferences/tcl/:\\n2017-04-03.tcl 30610 bytes Apr 03, 2017 21:55:37\\n2017-04-04.tcl 67996 bytes Apr 04, 2017 21:57:01\\n...\\n\\nContents (eg 2017-01-19.tcl):\\nm 2017-01-19T23:01:02Z ijchain {*** Johannes13__ leaves}\\nm 2017-01-19T23:15:37Z ijchain {*** fahadash leaves}\\nm 2017-01-19T23:27:00Z ijchain {*** Buster leaves}\\n...\\n#<<<#\\n\\nvar [const] CURL=Import.lib(\\\"zklCurl\\\")();\\t// libCurl instance\\n\\ntemplate:=\\\"http://tclers.tk/conferences/tcl/%4d-%02d-%02d.tcl\\\";\\nymd :=Time.Clock.UTC[0,3];\\t// now, (y,m,d)\\nback :=10;\\t\\t\\t// days in the past\\nneedle :=vm.nthArg(0);\\t\\t// search string\\nforeach d in ([-back+1..0]){\\t// we want day -9,-8,-7..0 (today)\\n date :=Time.Date.subYMD(ymd, 0,0,-d); // date minus days\\n url :=template.fmt(date.xplode());\\n haystack:=CURL.get(url);\\t// (request bytes, header length)\\n haystack=haystack[0].del(0,haystack[1]);\\t// remove HTML header\\n mentions:=haystack.filter(\\\"find\\\",needle);\\t// search lines\\n if(mentions) println(\\\"%s\\\\n------\\\\n%s------\\\\n\\\".fmt(url,mentions.text));\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Retrieve-and-search-chat-history"}}},{"rowIdx":1583,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Reverse_a_string\nnote: String manipulation\n","language":"00-META"},{"code":";Task:\nTake a string and reverse it.\n\nFor example, \"asdf\" becomes \"fdsa\".\n\n\n;Extra credit:\nPreserve Unicode combining characters. \n\nFor example, \"as⃝df̅\" becomes \"f̅ds⃝a\", not \"̅fd⃝sa\".\n\n\n{{Template:Strings}}\n<br><br>\n\n","language":"00-TASK"},{"code":"}:r: Start reader loop.\n !~>& Push a character to the \"stack\".\n <:a:=- Stop reading on newline.\n^:r:\n@> Rotate the newline to the end and enqueue a sentinel 0.\n{~ Dequeue and rotate the first character into place.\n}:p:\n ${~ Print the current character until it's 0.\n^:p:\n#:r: Read again.\n","language":"0815"},{"code":"echo -e \"foo\\nbar\" | 0815 rev.0\noof\nrab\n","language":"0815"},{"code":"reversed(string)\n","language":"11l"},{"code":"* Reverse a string 21/05/2016\nREVERSE CSECT\n USING REVERSE,R13 base register\n B 72(R15) skip savearea\n DC 17F'0' savearea\n STM R14,R12,12(R13) prolog\n ST R13,4(R15) \"\n ST R15,8(R13) \"\n LR R13,R15 \"\n MVC TMP(L'C),C tmp=c\n LA R8,C @c[1]\n LA R9,TMP+L'C-1 @tmp[n-1]\n LA R6,1 i=1\n LA R7,L'C n=length(c)\nLOOPI CR R6,R7 do i=1 to n\n BH ELOOPI leave i\n MVC 0(1,R8),0(R9) substr(c,i,1)=substr(tmp,n-i+1,1)\n LA R8,1(R8) @c=@c+1\n BCTR R9,0 @tmp=@tmp-1\n LA R6,1(R6) i=i+1\n B LOOPI next i\nELOOPI XPRNT C,L'C print c\n L R13,4(0,R13) epilog\n LM R14,R12,12(R13) \"\n XR R15,R15 \"\n BR R14 exit\nC DC CL12'edoC attesoR'\nTMP DS CL12\n REGEQU\n END REVERSE\n","language":"360-Assembly"},{"code":"* Reverse a string 25/04/2020\nREVERSEI CSECT\n USING REVERSEI,R13 base register\n B 72(R15) skip savearea\n DC 17F'0' savearea\n STM R14,R12,12(R13) prolog\n ST R13,4(R15) \"\n ST R15,8(R13) \"\n LR R13,R15 \"\n MVCIN BB,AA+L'AA-1\n XPRNT BB,L'BB print bb\n L R13,4(0,R13) epilog\n LM R14,R12,12(R13) \"\n XR R15,R15 \"\n BR R14 exit\nAA DC CL12'edoC attesoR' a\nBB DS CL(L'AA) b\n REGEQU\n END REVERSEI\n","language":"360-Assembly"},{"code":"\t\torg\t100h\n\t\tjmp\ttest\n\n\t\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t\t;; Reverse a string under HL in place\n\t\t;; strrev0: reverse a zero-terminated string\n\t\t;; strrev: reverse a string terminated by the value in A\n\t\t;; arrayrev: reverse bytes starting at DE and ending at HL\n\t\t;; Destroys a, b, d, e, h, l registers.\n\nstrrev0:\txra\ta\t; Zero A\nstrrev:\t\tmov\td,h\t; Copy string begin to DE\n\t\tmov\te,l\n\t\tdcx\th\t\nstrrev_end:\tinx\th\t; Find string end in HL\n\t\tcmp\tm\n\t\tjnz\tstrrev_end\n\t\tdcx\th\t; Point HL to last character\narrayrev:\tmov\ta,h\t; If HL<DE, we're done\n\t\tcmp\td\t\t\n\t\trc\n\t\tmov\ta,l\n\t\tcmp\te\n\t\trc\n\t\tldax\td\t; Get low character in string\n\t\tmov\tb,m\t; Get high character in string\n\t\tmov\tm,a\t; Swap them\n\t\tmov\ta,b\n\t\tstax\td\n\t\tinx\td\t; Move the low pointer up,\n\t\tdcx\th\t; and the high pointer down\n\t\tjmp\tarrayrev\n\n\t\t\n\t\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t\t;; Test code (CP/M): ask the user for a string, and reverse it\n\t\t\nprompt:\t\tdb\t\" :gnirts a retne esaelP$\"\nbufdef:\t\tdb\t127, 0\nbuf:\t\tds\t128\t\t; one extra byte that will remain 0\n\nnewline:\tlxi\td,newline_str\n\t\tmvi\tc,9\n\t\tjmp\t5\nnewline_str:\tdb\t13, 10, \"$\"\n\ntest:\t\t;; Reverse and output the prompt\n\t\tmvi\ta,'$'\t\t; CP/M string is $-terminated\n\t\tlxi\th,prompt\t; Reverse the string\n\t\tcall\tstrrev\n\t\tlxi\td,prompt\t; Output the string\n\t\tmvi\tc,9\n\t\tcall\t5\n\t\t\n\t\t;; Get input and reverse it\n\t\tlxi\td,bufdef\t\n\t\tmvi\tc,10\n\t\tcall\t5\n\t\tcall\tnewline\n\t\tlxi\th,buf\n\t\tcall\tstrrev0\t\t; 0-terminated due to buffer definition\n\t\t\n\t\t;; Output reversed input\n\t\tlxi\th,buf\nloop:\t\tmov\te,m\t\t\n\t\txra\ta\n\t\tora\te\n\t\trz\t\t\t; Stop when done\n\t\tmvi\tc,2\n\t\tpush\th\n\t\tcall\t5\n\t\tpop\th\n\t\tinx\th\n\t\tjmp\tloop\n","language":"8080-Assembly"},{"code":"\"abc\" s:rev\n","language":"8th"},{"code":"(reverse \"hello\")\n","language":"ACL2"},{"code":"PROC Reverse(CHAR ARRAY src,dst)\n BYTE i,j\n\n i=1 j=src(0) dst(0)=j\n WHILE j>0\n DO\n dst(j)=src(i)\n i==+1 j==-1\n OD\nRETURN\n\nPROC Test(CHAR ARRAY src)\n CHAR ARRAY dst(40)\n\n Reverse(src,dst)\n PrintF(\"'%S' -> '%S'%E\",src,dst)\nRETURN\n\nPROC Main()\n Test(\"Hello World!\")\n Test(\"123456789\")\n Test(\"!noitcA iratA\")\nRETURN\n","language":"Action-"},{"code":"function reverseString(string:String):String\n{\n\tvar reversed:String = new String();\n\tfor(var i:int = string.length -1; i >= 0; i--)\n\t\treversed += string.charAt(i);\n\treturn reversed;\n}\n\nfunction reverseStringCQAlternative(string:String):String\n{\n\treturn string.split('').reverse().join('');\n}\n","language":"ActionScript"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\n\nprocedure Reverse_String is\n function Reverse_It (Item : String) return String is\n Result : String (Item'Range);\n begin\n for I in Item'range loop\n Result (Result'Last - I + Item'First) := Item (I);\n end loop;\n return Result;\n end Reverse_It;\nbegin\n Put_Line (Reverse_It (Get_Line));\nend Reverse_String;\n","language":"Ada"},{"code":"module ReverseString where\n\nopen import Data.String using (String ; fromList ; toList)\nopen import Data.List using (reverse)\n\nreverse-string : String → String\nreverse-string s = fromList (reverse (toList s))\n","language":"Agda"},{"code":"o_(b_reverse(\"Hello, World!\"), \"\\n\");\n","language":"Aime"},{"code":"PROC reverse = (REF STRING s)VOID:\n FOR i TO UPB s OVER 2 DO\n CHAR c = s[i];\n s[i] := s[UPB s - i + 1];\n s[UPB s - i + 1] := c\n OD;\n\nmain:\n(\n STRING text := \"Was it a cat I saw\";\n reverse(text);\n print((text, new line))\n)\n","language":"ALGOL-68"},{"code":"#include <hopper.h>\n\nmain:\n s=\"mañana será otro día\"\n reverse(s),strtoutf8, println\n{0}return\n","language":"Amazing-Hopper"},{"code":"String str = 'Hello World!';\nstr = str.reverse();\nsystem.debug(str);\n","language":"Apex"},{"code":" ⌽'asdf'\nfdsa\n","language":"APL"},{"code":"reverseString(\"Hello World!\")\n\non reverseString(str)\n reverse of characters of str as string\nend reverseString\n","language":"AppleScript"},{"code":"reverseString(\"Hello World!\")\n\non reverseString(str)\n set astid to AppleScript's text item delimiters\n set AppleScript's text item delimiters to \"\"\n set reversedString to reverse of characters of str as text\n set AppleScript's text item delimiters to astid\n return reversedString\nend reverseString\n","language":"AppleScript"},{"code":"-- Using either a generic foldr(f, a, xs)\n\n-- reverse1 :: [a] -> [a]\non reverse1(xs)\n script rev\n on |λ|(a, x)\n a & x\n end |λ|\n end script\n\n if class of xs is text then\n foldr(rev, {}, xs) as text\n else\n foldr(rev, {}, xs)\n end if\nend reverse1\n\n-- or the built-in reverse method for lists\n\n-- reverse2 :: [a] -> [a]\non reverse2(xs)\n if class of xs is text then\n (reverse of characters of xs) as text\n else\n reverse of xs\n end if\nend reverse2\n\n\n-- TESTING reverse1 and reverse2 with same string and list ---------------------------------------------------------------------------\non run\n script test\n on |λ|(f)\n map(f, [\"Hello there !\", {1, 2, 3, 4, 5}])\n end |λ|\n end script\n\n map(test, [reverse1, reverse2])\nend run\n\n\n-- GENERIC FUNCTIONS ---------------------------------------------------------------------------\n\n-- foldr :: (a -> b -> a) -> a -> [b] -> a\non foldr(f, startValue, xs)\n tell mReturn(f)\n set v to startValue\n set lng to length of xs\n repeat with i from lng to 1 by -1\n set v to |λ|(v, item i of xs, i, xs)\n end repeat\n return v\n end tell\nend foldr\n\n-- map :: (a -> b) -> [a] -> [b]\non map(f, xs)\n tell mReturn(f)\n set lng to length of xs\n set lst to {}\n repeat with i from 1 to lng\n set end of lst to |λ|(item i of xs, i, xs)\n end repeat\n return lst\n end tell\nend map\n\n-- Lift 2nd class handler function into 1st class script wrapper\n-- mReturn :: Handler -> Script\non mReturn(f)\n if class of f is script then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n","language":"AppleScript"},{"code":"{{\"! ereht olleH\", {5, 4, 3, 2, 1}},\n {\"! ereht olleH\", {5, 4, 3, 2, 1}}}\n","language":"AppleScript"},{"code":"10 A$ = \"THE FIVE BOXING WIZARDS JUMP QUICKLY\"\n20 GOSUB 100REVERSE\n30 PRINT R$\n40 END\n\n100 REMREVERSE A$\n110 R$ = \"\"\n120 FOR I = 1 TO LEN(A$)\n130 R$ = MID$(A$, I, 1) + R$\n140 NEXT I\n150 RETURN\n","language":"Applesoft-BASIC"},{"code":"str: \"Hello World\"\n\nprint reverse str\n","language":"Arturo"},{"code":"MsgBox % reverse(\"asdf\")\n\nreverse(string)\n{\n Loop, Parse, string\n reversed := A_LoopField . reversed\n Return reversed\n}\n","language":"AutoHotkey"},{"code":"Reverse(String){ ; credit to Rseding91\n If (A_IsUnicode){\n SLen := StrLen(String) * 2\n VarSetCapacity(RString,SLen)\n\n Loop,Parse,String\n NumPut(Asc(A_LoopField),RString,SLen-(A_Index * 2),\"UShort\")\n } Else {\n SLen := StrLen(String)\n VarSetCapacity(RString,SLen)\n\n Loop,Parse,String\n NumPut(Asc(A_LoopField),RString,SLen-A_Index,\"UChar\")\n }\n\n VarSetCapacity(RString,-1)\n\n Return RString\n}\n","language":"AutoHotkey"},{"code":"#AutoIt Version: 3.2.10.0\n$mystring=\"asdf\"\n$reverse_string = \"\"\n$string_length = StringLen($mystring)\n\nFor $i = 1 to $string_length\n $last_n_chrs = StringRight($mystring, $i)\n $nth_chr = StringTrimRight($last_n_chrs, $i-1)\n $reverse_string= $reverse_string & $nth_chr\nNext\n\nMsgBox(0, \"Reversed string is:\", $reverse_string)\n","language":"AutoIt"},{"code":"\"asfd\" reversed\n","language":"Avail"},{"code":"function reverse(s)\n{\n p = \"\"\n for(i=length(s); i > 0; i--) { p = p substr(s, i, 1) }\n return p\n}\n\nBEGIN {\n print reverse(\"edoCattesoR\")\n}\n","language":"AWK"},{"code":"function reverse(s ,l)\n{\n l = length(s)\n return l < 2 ? s:( substr(s,l,1) reverse(substr(s,1,l-1)) )\n}\n\nBEGIN {\n print reverse(\"edoCattesoR\")\n}\n","language":"AWK"},{"code":"# Usage: awk -f reverse.awk -v s=Rosetta\n\nfunction rev(s, i,len,a,r) {\n len = split(s, a, \"\")\n #for (i in a) r = a[i] r\t# may not work - order is not guaranteed !\n for (i=1; i<=len; i++) r = a[i] r\n return r\n}\nBEGIN {\n if(!s) s = \"Hello, world!\"\n print s, \"<-->\", rev(s)\n}\n","language":"AWK"},{"code":"strrev: { str2ar ar2ls reverse ls2lf ar2str }\n","language":"Babel"},{"code":"OPTION UTF8 TRUE\ns$ = \"asdf\"\nPRINT REVERSE$(s$)\n","language":"BaCon"},{"code":"s = \"asdf\"\nprint \"'\"; s; \"' reversed is '\"; reverse(s); \"'\"\nend\n\nfunction reverse(a)\n\tb = \"\"\n\tfor i = 1 to length(a)\n\t\tb = mid(a, i, 1) + b\n\tnext i\n\treturn b\nend function\n","language":"BASIC256"},{"code":"@echo off\nsetlocal enabledelayedexpansion\ncall :reverse %1 res\necho %res%\ngoto :eof\n\n:reverse\nset str=%~1\nset cnt=0\n:loop\nif \"%str%\" equ \"\" (\n\tgoto :eof\n\t)\nset chr=!str:~0,1!\nset str=%str:~1%\nset %2=%chr%!%2!\ngoto loop\n","language":"Batch-File"},{"code":" PRINT FNreverse(\"The five boxing wizards jump quickly\")\n END\n\n DEF FNreverse(A$)\n LOCAL B$, C%\n FOR C% = LEN(A$) TO 1 STEP -1\n B$ += MID$(A$,C%,1)\n NEXT\n = B$\n","language":"BBC-BASIC"},{"code":"using System;\n\nnamespace System\n{\n\textension String\n\t{\n\t\tpublic void Reverse()\n\t\t{\n\t\t\tint i = 0;\n\t\t\tint j = mLength - 1;\n\t\t\twhile (i < j)\n\t\t\t{\n\t\t\t\tSwap!(Ptr[i++], Ptr[j--]);\n\t\t\t}\n\t\t}\n\t}\n}\n\nnamespace StringReverse\n{\n\tclass Program\n\t{\n\t\tstatic void Main()\n\t\t{\n\t\t\tString s = scope .(\"abcdef\");\n\t\t\ts.Reverse();\n\t\t\tConsole.WriteLine(s);\n\t\t}\n\t}\n}\n","language":"Beef"},{"code":"55+~>:48>*#8\\#4`#:!#<#~_$>:#,_@\n","language":"Befunge"},{"code":" ⌽\"racecar\"\n\"racecar\"\n","language":"BQN"},{"code":" ( reverse\n = L x\n . :?L\n & @( !arg\n : ?\n ( %?x\n & utf$!x\n & !x !L:?L\n & ~`\n )\n ?\n )\n | str$!L\n )\n& out$reverse$Ελληνικά\n","language":"Bracmat"},{"code":"[-]>,[>,]<[.<]\n","language":"Brainf---"},{"code":",----- ----- [+++++ +++++ > , ----- -----]\tIf a newline is hit counter will be zero and input loop ends\n<[.<]\trun all chars backwards and print them\n\njust because it looks good we print CRLF\n+++++ +++++ +++ . --- .\n","language":"Brainf---"},{"code":"p \"olleh\".reverse #Prints \"hello\"\n","language":"Brat"},{"code":"\"Hello, world!\"<-\n","language":"Burlesque"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <locale.h>\n#include <wchar.h>\n\nconst char *sa = \"abcdef\";\nconst char *su = \"as⃝df̅\"; /* Should be in your native locale encoding. Mine is UTF-8 */\n\nint is_comb(wchar_t c)\n{\n\tif (c >= 0x300 && c <= 0x36f) return 1;\n\tif (c >= 0x1dc0 && c <= 0x1dff) return 1;\n\tif (c >= 0x20d0 && c <= 0x20ff) return 1;\n\tif (c >= 0xfe20 && c <= 0xfe2f) return 1;\n\treturn 0;\n}\n\nwchar_t* mb_to_wchar(const char *s)\n{\n\twchar_t *u;\n\tsize_t len = mbstowcs(0, s, 0) + 1;\n\tif (!len) return 0;\n\n\tu = malloc(sizeof(wchar_t) * len);\n\tmbstowcs(u, s, len);\n\treturn u;\n}\n\nwchar_t* ws_reverse(const wchar_t* u)\n{\n\tsize_t len, i, j;\n\twchar_t *out;\n\tfor (len = 0; u[len]; len++);\n\tout = malloc(sizeof(wchar_t) * (len + 1));\n\tout[len] = 0;\n\tj = 0;\n\twhile (len) {\n\t\tfor (i = len - 1; i && is_comb(u[i]); i--);\n\t\twcsncpy(out + j, u + i, len - i);\n\t\tj += len - i;\n\t\tlen = i;\n\t}\n\treturn out;\n}\n\nchar *mb_reverse(const char *in)\n{\n\tsize_t len;\n\tchar *out;\n\twchar_t *u = mb_to_wchar(in);\n\twchar_t *r = ws_reverse(u);\n\tlen = wcstombs(0, r, 0) + 1;\n\tout = malloc(len);\n\twcstombs(out, r, len);\n\tfree(u);\n\tfree(r);\n\treturn out;\n}\n\nint main(void)\n{\n\tsetlocale(LC_CTYPE, \"\");\n\n\tprintf(\"%s => %s\\n\", sa, mb_reverse(sa));\n\tprintf(\"%s => %s\\n\", su, mb_reverse(su));\n\treturn 0;\n}\n","language":"C"},{"code":"#include <glib.h>\ngchar *srev (const gchar *s) {\n if (g_utf8_validate(s,-1,NULL)) {\n return g_utf8_strreverse (s,-1);\n} }\n// main\nint main (void) {\n const gchar *t=\"asdf\";\n const gchar *u=\"as⃝df̅\";\n printf (\"%s\\n\",srev(t));\n printf (\"%s\\n\",srev(u));\n return 0;\n}\n","language":"C"},{"code":"#include <string>\n#include <iostream>\n#include <algorithm>\n\nint main() {\n std::string s;\n std::getline(std::cin, s);\n std::reverse(s.begin(), s.end()); // modifies s\n std::cout << s << '\\n';\n}\n","language":"C++"},{"code":"static string ReverseString(string input)\n{\n char[] inputChars = input.ToCharArray();\n Array.Reverse(inputChars);\n return new string(inputChars);\n}\n","language":"C-sharp"},{"code":"using System.Linq;\n\n// ...\n\nreturn new string(input.Reverse().ToArray());\n\n// ...\n","language":"C-sharp"},{"code":"public string ReverseElements(string s)\n{\n // In .NET, a text element is series of code units that is displayed as one character, and so reversing the text\n // elements of the string correctly handles combining character sequences and surrogate pairs.\n var elements = System.Globalization.StringInfo.GetTextElementEnumerator(s);\n return string.Concat(AsEnumerable(elements).OfType<string>().Reverse());\n}\n\n// Wraps an IEnumerator, allowing it to be used as an IEnumerable.\npublic IEnumerable AsEnumerable(IEnumerator enumerator)\n{\n while (enumerator.MoveNext())\n yield return enumerator.Current;\n}\n","language":"C-sharp"},{"code":"shared void run() {\n\n while(true) {\n process.write(\"> \");\n String? text = process.readLine();\n if (is String text) {\n print(text.reversed);\n }\n else {\n break;\n }\n }\n}\n","language":"Ceylon"},{"code":"FUNCTION Reverse(sIn)\n LOCAL sOut := \"\", i\n FOR i := Len(sIn) TO 1 STEP -1\n sOut += Substr(sIn, i, 1)\n NEXT\nRETURN sOut\n","language":"Clipper"},{"code":"(defn reverse-string [s]\n \"Returns a string with all characters in reverse\"\n (apply str (reduce conj '() s)))\n","language":"Clojure"},{"code":"(defn str-reverse [s] (apply str (reverse s)))\n","language":"Clojure"},{"code":"(apply str (interpose \" \" (reverse (.split \"the quick brown fox\" \" \"))))\n","language":"Clojure"},{"code":"(defn combining? [c]\n (let [type (Character/getType c)]\n ;; currently hardcoded to the types taken from the sample string\n (or (= type 6) (= type 7))))\n\n(defn group\n \"Group normal characters with their combining characters\"\n [chars]\n (cond (empty? chars) chars\n\t(empty? (next chars)) (list chars)\n\t:else\n\t(let [dres (group (next chars))]\n\t (cond (combining? (second chars)) (cons (cons (first chars)\n\t\t\t\t\t\t\t(first dres))\n\t\t\t\t\t\t (rest dres))\n\t\t:else (cons (list (first chars)) dres)))))\n\n(defn str-reverse\n \"Unicode-safe string reverse\"\n [s]\n (apply str (apply concat (reverse (group s)))))\n","language":"Clojure"},{"code":"reverse = proc (s: string) returns (string)\n rslt: array[char] := array[char]$predict(1,string$size(s))\n for c: char in string$chars(s) do\n array[char]$addl(rslt,c)\n end\n return(string$ac2s(rslt))\nend reverse\n\nstart_up = proc ()\n po: stream := stream$primary_output()\n stream$putl(po, reverse(\"!dlrow ,olleH\"))\nend start_up\n","language":"CLU"},{"code":"FUNCTION REVERSE('QWERTY')\n","language":"COBOL"},{"code":"\"qwerty\".split(\"\").reverse().join \"\"\n","language":"CoffeeScript"},{"code":"<cfset myString = \"asdf\" />\n<cfset myString = reverse( myString ) />\n","language":"ColdFusion"},{"code":"100 INPUT \"STRING\";S$\n110 FOR I=1 TO INT(LEN(S$)/2)\n120 : J=LEN(S$)+1-I\n130 : T$=MID$(S$,I,1)\n140 : MID$(S$,I,1) = MID$(S$,J,1)\n150 : MID$(S$,J,1) = T$\n160 NEXT I\n170 PRINT S$\n","language":"Commodore-BASIC"},{"code":"(reverse my-string)\n","language":"Common-Lisp"},{"code":"MODULE BbtReverseString;\nIMPORT StdLog;\n\nPROCEDURE ReverseStr(str: ARRAY OF CHAR): POINTER TO ARRAY OF CHAR;\nVAR\n\ttop,middle,i: INTEGER;\n\tc: CHAR;\n\trStr: POINTER TO ARRAY OF CHAR;\nBEGIN\n\tNEW(rStr,LEN(str$) + 1);\n\ttop := LEN(str$) - 1; middle := (top - 1) DIV 2;\n\tFOR i := 0 TO middle DO\n\t\trStr[i] := str[top - i];\n\t\trStr[top - i] := str[i];\n\tEND;\n\tIF ODD(LEN(str$)) THEN rStr[middle + 1] := str[middle + 1] END;\n\tRETURN rStr;\nEND ReverseStr;\n\nPROCEDURE Do*;\nVAR\n\tx: CHAR;\nBEGIN\n\tStdLog.String(\"'asdf' reversed:> \");StdLog.String(ReverseStr(\"asdf\"));StdLog.Ln\nEND Do;\nEND BbtReverseString.\n","language":"Component-Pascal"},{"code":"include \"cowgol.coh\";\ninclude \"strings.coh\";\n\n# Reverse a string in place\nsub StrRev(s: [uint8]): (r: [uint8]) is\n r := s;\n var e := s;\n while [e] != 0 loop\n e := @next e;\n end loop;\n e := @prev e;\n while e > s loop\n var c := [s];\n [s] := [e];\n [e] := c;\n s := @next s;\n e := @prev e;\n end loop;\nend sub;\n\n# Test\nvar buf: uint8[32];\nvar str: [uint8] := \"\\nesreveR\";\nCopyString(str, &buf[0]);\nprint(StrRev(&buf[0]));\n","language":"Cowgol"},{"code":"# version 0.21.1\n\nstrings = [\"asdf\", \"as⃝df̅\"]\nstrings.each do |s|\n puts \"#{s} -> #{s.reverse}\"\nend\n","language":"Crystal"},{"code":"void main() {\n\timport std.range, std.conv;\n\n\tstring s1 = \"hello\"; // UTF-8\n\tassert(s1.retro.text == \"olleh\");\n\n\twstring s2 = \"hello\"w; // UTF-16\n\tassert(s2.retro.wtext == \"olleh\"w);\n\n\tdstring s3 = \"hello\"d; // UTF-32\n\tassert(s3.retro.dtext == \"olleh\"d);\n\n\t// without using std.range:\n\tdstring s4 = \"hello\"d;\n\tassert(s4.dup.reverse == \"olleh\"d); // simple but inefficient (copies first, then reverses)\n}\n","language":"D"},{"code":"String reverse(String s) => new String.fromCharCodes(s.runes.toList().reversed);\n","language":"Dart"},{"code":"import 'package:unittest/unittest.dart';\n\nString reverse(String s) => new String.fromCharCodes(s.runes.toList().reversed);\n\nmain() {\n group(\"Reverse a string -\", () {\n test(\"Strings with ASCII characters are reversed correctly.\", () {\n expect(reverse(\"hello, world\"), equals(\"dlrow ,olleh\"));\n });\n test(\"Strings with non-ASCII BMP characters are reversed correctly.\", () {\n expect(reverse(\"\\u4F60\\u4EEC\\u597D\"), equals(\"\\u597D\\u4EEC\\u4F60\"));\n });\n test(\"Strings with non-BMP characters are reversed correctly.\", () {\n expect(reverse(\"hello, \\u{1F310}\"), equals(\"\\u{1F310} ,olleh\"));\n });\n });\n}\n","language":"Dart"},{"code":"K=\nSTR_OUT=\nFOR J=%TRIM(STR_IN) STEP -1 UNTIL 1\nDO BEGIN\n INCR K\n STR_OUT(K:1)=STR_IN(J:1)\n END\n","language":"DBL"},{"code":"22405534230753963835153736737 [ 256 ~ d SS 0<F LS SR 1+ ] d sF x 1 - [ 1 - d 0<F 256 * LR + ] d sF x P\n","language":"Dc"},{"code":"function ReverseString(const InString: string): string;\nvar\n i: integer;\nbegin\n for i := Length(InString) downto 1 do\n Result := Result + InString[i];\nend;\n","language":"Delphi"},{"code":"StrUtils.ReverseString\n","language":"Delphi"},{"code":"function Reverse(const s: string): string;\nvar\n i, aLength, ahalfLength: Integer;\n c: Char;\nbegin\n Result := s;\n aLength := Length(s);\n ahalfLength := aLength div 2;\n if aLength > 1 then\n for i := 1 to ahalfLength do\n begin\n c := result[i];\n result[i] := result[aLength - i + 1];\n result[aLength - i + 1] := c;\n end;\nend;\n","language":"Delphi"},{"code":"/* Reverse string in place */\nproc nonrec reverse(*char s) void:\n *char e;\n char t;\n e := s;\n while e* /= '\\e' do\n e := e + 1\n od;\n while\n e := e - 1;\n s < e\n do\n t := e*;\n e* := s*;\n s* := t;\n s := s + 1\n od\ncorp\n\nproc nonrec main() void:\n *char testString = \"!dlrow ,olleH\";\n reverse(testString);\n writeln(testString)\ncorp\n","language":"Draco"},{"code":"\"asdf\" rev\n","language":"Dt"},{"code":"let str = \"asdf\"\n\nfunc String.Reverse() {\n var cs = []\n let len = this.Length()\n for n in 1..len {\n cs.Add(this[len - n])\n }\n String(values: cs)\n}\n\nstr.Reverse()\n","language":"Dyalect"},{"code":"pragma.enable(\"accumulator\")\ndef reverse(string) {\n return accum \"\" for i in (0..!(string.size())).descending() { _ + string[i] }\n}\n","language":"E"},{"code":"func$ reverse s$ .\n a$[] = strchars s$\n for i = 1 to len a$[] div 2\n swap a$[i] a$[len a$[] - i + 1]\n .\n return strjoin a$[]\n.\nprint reverse \"hello\"\n","language":"EasyLang"},{"code":"(define (string-reverse string)\n (list->string (reverse (string->list string))))\n\n(string-reverse \"ghij\")\n → jihg\n(string-reverse \"un roc lamina l animal cornu\")\n → unroc lamina l animal cor nu\n","language":"EchoLisp"},{"code":"function reverse( str string ) returns( string )\n\tresult string;\n\tfor ( i int from StrLib.characterLen( str ) to 1 decrement by 1 )\n\t\tresult ::= str[i:i];\n\tend\n\treturn( result );\nend\n","language":"EGL"},{"code":"class\n APPLICATION\ncreate\n make\nfeature\n make\n -- Demonstrate string reversal.\n do\n my_string := \"Hello World!\"\n my_string.mirror\n print (my_string)\n end\n my_string: STRING\n -- Used for reversal\nend\n","language":"Eiffel"},{"code":"reverse_string str = rev len str\n where len = length str\n rev 0 str = \"\"\n rev n str = toString (str : nn) +> rev nn str\n where nn = n - 1\n\nreverse_string \"Hello\"\n","language":"Ela"},{"code":"open string\nfromList <| reverse <| toList \"Hello\" ::: String\n","language":"Ela"},{"code":"import system'routines;\nimport extensions;\nimport extensions'text;\n\nextension extension\n{\n reversedLiteral()\n = self.toArray().sequenceReverse().summarize(new StringWriter());\n}\n\npublic program()\n{\n console.printLine(\"Hello World\".reversedLiteral())\n}\n","language":"Elena"},{"code":"IO.puts (String.reverse \"asdf\")\nIO.puts (String.reverse \"as⃝df̅\")\n","language":"Elixir"},{"code":"module Main exposing (main)\n\nimport Html exposing (Html, text, div, p)\nimport Html.Attributes exposing (style)\n\n\nchange myText =\n text (\"reverse \" ++ myText\n ++ \" = \" ++ String.reverse myText)\n\n\nmain =\n div [style \"margin\" \"5%\", style \"font-size\" \"1.5em\"]\n [change \"as⃝da\"\n , p [] [change \"a⃝su-as⃝u\"]\n , p [] [change \"Hello!\"]\n ]\n","language":"Elm"},{"code":"(reverse \"Hello World\")\n","language":"Emacs-Lisp"},{"code":"1> lists:reverse(\"reverse!\").\n\"!esrever\"\n","language":"Erlang"},{"code":"reverse(Bin) ->\n Size = size(Bin)*8,\n <<T:Size/integer-little>> = Bin,\n <<T:Size/integer-big>>.\n","language":"Erlang"},{"code":"PROGRAM REVERSE_STRING\n\nPROCEDURE REVERSE(A$->R$)\n LOCAL I%\n R$=\"\"\n FOR I=1 TO LEN(A$) DO\n R$=MID$(A$,I,1)+R$\n END FOR\nEND PROCEDURE\n\nBEGIN\n A$=\"THE FIVE BOXING WIZARDS JUMP QUICKLY\"\n REVERSE(A$->R$)\n PRINT(R$)\nEND PROGRAM\n","language":"ERRE"},{"code":">function strrev (s) := chartostr(fliplr(strtochar(s)))\n>strrev(\"This is a test!\")\n !tset a si sihT\n","language":"Euler"},{"code":"include std/sequence.e\nprintf(1, \"%s\\n\", {reverse(\"abcdef\") })\n","language":"Euphoria"},{"code":"## இந்த நிரல் தரப்படும் சரம் ஒன்றைத் தலைகீழாகத் திருப்பி அச்சிடும்\n## உதாரணமாக \"abc\" என்ற சரம் தரப்பட்டால் அதனைத் திருப்பி \"cba\" என அச்சிடும்\n## \"எழில்\" மொழியின்மூலம் இரண்டு வகைகளில் இதனைச் செய்யலாம். இரண்டு உதாரணங்களும் இங்கே தரப்பட்டுள்ளன\n\nநிரல்பாகம் திருப்புக (சரம்1)\n\n ## முதல் வகை\n\n சரம்2 = \"\"\n\n @( சரம்1 இல் இ) ஒவ்வொன்றாக\n சரம்2 = இ + சரம்2\n முடி\n\n பின்கொடு சரம்2\n\nமுடி\n\nநிரல்பாகம் மீண்டும்திருப்புக (சரம்1)\n\n ## இரண்டாம் வகை\n\n சரநீளம் = len(சரம்1)\n\n சரம்2 = \"\"\n\n @(எண் = 0, எண் < சரநீளம், எண் = எண் + 1) ஆக\n\n சரம்2 = எடு(சரம்1, எண்) + சரம்2\n\n முடி\n\n பின்கொடு சரம்2\n\nமுடி\n\n\nஅ = உள்ளீடு(\"ஓர் எழுத்துச் சரத்தைத் தாருங்கள் \")\n\nபதிப்பி \"நீங்கள் தந்த எழுத்துச் சரம்\" அ\n\nபதிப்பி \"அதனை முதல் வகையில் திருப்பியுள்ளோம்: \" திருப்புக(அ)\n\nபதிப்பி \"வேறொரு வகையில் திருப்பியுள்ளோம்: \" மீண்டும்திருப்புக(அ)\n","language":"Ezhil"},{"code":"// Reverse a string. Nigel Galloway: August 14th., 2019\nlet strRev α=let N=System.Globalization.StringInfo.GetTextElementEnumerator(α)\n List.unfold(fun n->if n then Some(N.GetTextElement(),N.MoveNext()) else None)(N.MoveNext())|>List.rev|>String.concat \"\"\n","language":"F-Sharp"},{"code":"printfn \"%s\" (strRev \"as⃝df̅\")\nprintfn \"%s\" (strRev \"Nigel\")\n","language":"F-Sharp"},{"code":"\"hello\" reverse\n","language":"Factor"},{"code":"\"as⃝df̅\" string-reverse \"f̅ds⃝a\" = .\n","language":"Factor"},{"code":"1_\n[^$1_=~][]#%\n[$1_=~][,]#\n","language":"FALSE"},{"code":"1_\n[^$1_=~][\n $$767>\\879\\>&\n 1ø$7615>\\7620\\>&|\n 1ø$8399>\\8428\\>&|\n [\\]?\n]#%\n[$1_=~][,]#\n","language":"FALSE"},{"code":"\"hello world!\" reverse\n","language":"Fancy"},{"code":"Function StrRev1(ByVal $p1)\n\tdim $b = \"\"\n\tREPEAT len(p1)\n\t\tb = b & RIGHT(p1,1)\n\t\tp1 = LEFT(p1,LEN(p1)-1)\n\tEND REPEAT\n\treturn b\nEnd Function\n","language":"FBSL"},{"code":"Function StrRev2(ByVal $p1)\n\tdim $b = \"\", %i\n\tfor i = len(p1) DOWNTO 1\n\t\tb = b & MID(p1,i,1)\n\tnext\n\treturn b\nEnd Function\n","language":"FBSL"},{"code":"Function StrRev3( $s )\n\tFOR DIM x = 1 TO LEN(s) \\ 2\n\t\tPEEK(@s + LEN - x, $1)\n\t\tPOKE(@s + LEN - x, s{x})(@s + x - 1, PEEK)\n\tNEXT\n\tRETURN s\nend function\n","language":"FBSL"},{"code":"DynC StringRev($theString) As String\n void rev(char *str)\n {\n\t\tint len = strlen(str);\n\t\tchar *HEAD = str;\n\t\tchar *TAIL = str + len - 1;\n\t\tchar temp;\n\t\tint i;\n\t\tfor ( i = 0; i <= len / 2; i++, HEAD++, TAIL--) {\n\t\t\ttemp = *HEAD;\n\t\t\t*HEAD = *TAIL;\n\t\t\t*TAIL = temp;\n\t\t}\n }\n char *main(char* theString)\n {\n rev(theString);\n return theString;\n }\nEnd DynC\n","language":"FBSL"},{"code":"DYNASM RevStr(BYVAL s AS STRING) AS STRING\n // get length of string\n // divide by two\n // setup pointers to head and tail\n // iterate from 1 to (length \\ 2)\n // swap head with tail\n // increment head pointer\n // decrement tail pointer\n\n ENTER 0, 0 // = PUSH EBP: MOV EBP, ESP\n PUSH EBX // by Windows convention EBX, EDI, ESI must be saved before modification\n\n MOV EAX, s // get string pointer\n MOV ECX, EAX // duplicate it\n\n .WHILE BYTE PTR [ECX] <> 0\n\n\tINC ECX // propagate to tail\n\n .WEND\n\n MOV EDX, ECX // duplicate tail pointer\n DEC EDX // set it to last byte before trailing zero\n\n SUB ECX, EAX // get length in ECX in 1 CPU cycle\n SHR ECX, 1 // get length \\ 2 in 1 CPU cycle; that's the beauty of power-of-two division\n\n .WHILE ECX > 0\n\n MOV BL, [EDX] // no need to XOR; just overwrite BL and BH contents\n MOV BH, [EAX] // DynAsm deduces data size from destination register sizes\n\n MOV [EDX], BH // ditto, source register sizes\n MOV [EAX], BL\n\n INC EAX // propagate pointers\n DEC EDX\n\n DEC ECX // decrement counter\n\n .WEND\n\n // point to start of string again\n MOV EAX, s // MOV = 1 CPU cycle, PUSH + POP = 2 CPU cycles\n\n POP EBX // by Windows convention ESI, EDI, EBX must be restored if modified\n LEAVE // = POP EBP\n RET\nEND DYNASM\n","language":"FBSL"},{"code":"#define MAXSTRINGLEN ( 1024 )\n\n/* chop string to list of single character strings */\nstatic fe_Object* chop(fe_Context *ctx, fe_Object *args) {\n char buf[MAXSTRINGLEN];\n int len = fe_tostring(ctx, fe_nextarg(ctx, &args), buf, sizeof(buf));\n int gc = fe_savegc(ctx);\n args = fe_bool(ctx, 0);\n while (len > 0) {\n buf[len--] = '\\0';\n args = fe_cons(ctx, fe_string(ctx, buf + len), args);\n fe_restoregc(ctx, gc);\n fe_pushgc(ctx, args);\n }\n return args;\n}\n\n/* pack list of strings to single string */\nstatic fe_Object* pack(fe_Context *ctx, fe_Object *args) {\n char buf[MAXSTRINGLEN], *ptr = buf;\n for (args = fe_nextarg(ctx, &args); !fe_isnil(ctx, args);) {\n ptr += fe_tostring(ctx, fe_nextarg(ctx, &args), ptr, buf + sizeof(buf) - ptr);\n }\n return fe_string(ctx, buf);\n}\n","language":"Fe"},{"code":"; reverse list\n(= reverse (fn (lst)\n (let res nil)\n (while lst\n (= res (cons (car lst) res))\n (= lst (cdr lst)))\n res))\n\n; chop string to list, reverse list and pack it back to string\n(print (pack (reverse (chop \"Hello world!\"))))\n","language":"Fe"},{"code":"!dlrow olleH\n","language":"Fe"},{"code":"(let [example :asdf]\n (string.reverse example) ; fdsa\n (example:reverse) ; fdsa\nnil)\n","language":"Fennel"},{"code":": exchange ( a1 a2 -- )\n 2dup c@ swap c@ rot c! swap c! ;\n: reverse ( c-addr u -- )\n 1- bounds begin 2dup > while\n 2dup exchange\n -1 /string\n repeat 2drop ;\n\ns\" testing\" 2dup reverse type \\ gnitset\n","language":"Forth"},{"code":"\\ reverse a string using the data stack for temporary storage\n\n: mystring ( -- caddr len) S\" ABCDEFGHIJKLMNOPQRSTUVWXYZ987654321\" ;\n\n: pushstr ( caddr len -- c..c[n]) bounds do I c@ loop ;\n: popstr ( c.. c[n] caddr len -- ) bounds do I c! loop ;\n: reverse ( caddr len -- ) 2dup 2>r pushstr 2r> popstr ;\n","language":"Forth"},{"code":": xreverse {: c-addr u -- c-addr2 u :}\n u allocate throw u + c-addr swap over u + >r begin ( from to r:end)\n\tover r@ u< while\n\t over r@ over - x-size dup >r - 2dup r@ cmove\n\t swap r> + swap repeat\n r> drop nip u ;\n\n\\ example use\ns\" ώщыē\" xreverse type \\ outputs \"ēыщώ\"\n","language":"Forth"},{"code":"PROGRAM Example\n\n CHARACTER(80) :: str = \"This is a string\"\n CHARACTER :: temp\n INTEGER :: i, length\n\n WRITE (*,*) str\n length = LEN_TRIM(str) ! Ignores trailing blanks. Use LEN(str) to reverse those as well\n DO i = 1, length/2\n temp = str(i:i)\n str(i:i) = str(length+1-i:length+1-i)\n str(length+1-i:length+1-i) = temp\n END DO\n WRITE(*,*) str\n\nEND PROGRAM Example\n","language":"Fortran"},{"code":"program reverse_string\n\n implicit none\n character (*), parameter :: string = 'no devil lived on'\n\n write (*, '(a)') string\n write (*, '(a)') reverse (string)\n\ncontains\n\n recursive function reverse (string) result (res)\n\n implicit none\n character (*), intent (in) :: string\n character (len (string)) :: res\n\n if (len (string) == 0) then\n res = ''\n else\n res = string (len (string) :) // reverse (string (: len (string) - 1))\n end if\n\n end function reverse\n\nend program reverse_string\n","language":"Fortran"},{"code":" program reverse_string\n implicit none\n character (80) :: cadena\n integer :: k, n\n !\n cadena = \"abcdefgh\"\n n = len_trim (cadena)\n !\n write (*,*) cadena\n forall (k=1:n) cadena (k:k) = cadena (n-k+1:n-k+1)\n write (*,*) cadena\n !\nend program reverse_string\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nFunction ReverseString(s As Const String) As String\n If s = \"\" Then Return s\n Dim length As Integer = Len(s)\n Dim r As String = Space(length)\n For i As Integer = 0 To length - 1\n r[i] = s[length - 1 - i]\n Next\n Return r\nEnd Function\n\nDim s As String = \"asdf\"\nPrint \"'\"; s; \"' reversed is '\"; ReverseString(s); \"'\"\n","language":"FreeBASIC"},{"code":"println[reverse[\"abcdef\"]]\n","language":"Frink"},{"code":"fun main(s: []i32) = s[::-1]\n","language":"Futhark"},{"code":"void local fn DoIt\n CFStringRef s1 = @\"asdf\", s2 = @\"\"\n long index\n for index = len(s1) - 1 to 0 step -1\n s2 = fn StringByAppendingString( s2, mid(s1,index,1) )\n next\n print s1,s2\nend fn\n\nwindow 1\n\nfn DoIt\n\nHandleEvents\n","language":"FutureBasic"},{"code":"Public Sub Main()\nDim sString As String = \"asdf\"\nDim sOutput As String\nDim siCount As Short\n\nFor siCount = Len(sString) DownTo 1\n sOutput &= Mid(sString, siCount, 1)\nNext\n\nPrint sOutput\n\nEnd\n","language":"Gambas"},{"code":"Reversed(\"abcdef\");\n# \"fedcba\"\n","language":"GAP"},{"code":"\\L<U>=@reverse{$1}\n","language":"Gema"},{"code":"\\L<U1><U>=@{$2}$1\n","language":"Gema"},{"code":"[indent=4]\n/*\n Reverse a string, in Genie\n valac reverse.gs\n*/\n\ninit\n utf8:string = \"asdf\"\n combining:string = \"asdf̅\"\n\n print utf8\n print utf8.reverse()\n\n print combining\n print combining.reverse()\n","language":"Genie"},{"code":"PRINT @reverse$(\"asdf\")\n'\nFUNCTION reverse$(string$)\n LOCAL result$,i%\n result$=\"\"\n FOR i%=1 TO LEN(string$)\n result$=MID$(string$,i%,1)+result$\n NEXT i%\n RETURN result$\nENDFUNC\n","language":"GFA-Basic"},{"code":"package main\n\nimport (\n \"fmt\"\n \"unicode\"\n \"unicode/utf8\"\n)\n\n// no encoding\nfunc reverseBytes(s string) string {\n r := make([]byte, len(s))\n for i := 0; i < len(s); i++ {\n r[i] = s[len(s)-1-i]\n }\n return string(r)\n}\n\n// reverseCodePoints interprets its argument as UTF-8 and ignores bytes\n// that do not form valid UTF-8. return value is UTF-8.\nfunc reverseCodePoints(s string) string {\n r := make([]rune, len(s))\n start := len(s)\n for _, c := range s {\n // quietly skip invalid UTF-8\n if c != utf8.RuneError {\n start--\n r[start] = c\n }\n }\n return string(r[start:])\n}\n\n// reversePreservingCombiningCharacters interprets its argument as UTF-8\n// and ignores bytes that do not form valid UTF-8. return value is UTF-8.\nfunc reversePreservingCombiningCharacters(s string) string {\n if s == \"\" {\n return \"\"\n }\n p := []rune(s)\n r := make([]rune, len(p))\n start := len(r)\n for i := 0; i < len(p); {\n // quietly skip invalid UTF-8\n if p[i] == utf8.RuneError {\n i++\n continue\n }\n j := i + 1\n for j < len(p) && (unicode.Is(unicode.Mn, p[j]) ||\n unicode.Is(unicode.Me, p[j]) || unicode.Is(unicode.Mc, p[j])) {\n j++\n }\n for k := j - 1; k >= i; k-- {\n start--\n r[start] = p[k]\n }\n i = j\n }\n return (string(r[start:]))\n}\n\nfunc main() {\n test(\"asdf\")\n test(\"as⃝df̅\")\n}\n\nfunc test(s string) {\n fmt.Println(\"\\noriginal: \", []byte(s), s)\n r := reverseBytes(s)\n fmt.Println(\"reversed bytes:\", []byte(r), r)\n fmt.Println(\"original code points:\", []rune(s), s)\n r = reverseCodePoints(s)\n fmt.Println(\"reversed code points:\", []rune(r), r)\n r = reversePreservingCombiningCharacters(s)\n fmt.Println(\"combining characters:\", []rune(r), r)\n}\n","language":"Go"},{"code":"println \"Able was I, 'ere I saw Elba.\".reverse()\n","language":"Groovy"},{"code":"def string = \"as⃝df̅\"\n\nList combiningBlocks = [\n Character.UnicodeBlock.COMBINING_DIACRITICAL_MARKS,\n Character.UnicodeBlock.COMBINING_DIACRITICAL_MARKS_SUPPLEMENT,\n Character.UnicodeBlock.COMBINING_HALF_MARKS,\n Character.UnicodeBlock.COMBINING_MARKS_FOR_SYMBOLS\n]\nList chars = string as List\nchars[1..-1].eachWithIndex { ch, i ->\n if (Character.UnicodeBlock.of((char)ch) in combiningBlocks) {\n chars[i..(i+1)] = chars[(i+1)..i]\n }\n}\nprintln chars.reverse().join()\n","language":"Groovy"},{"code":"FUNCTION Reverse( sIn )\n\n LOCAL cOut := \"\", i\n\n FOR i := Len( sIn ) TO 1 STEP -1\n cOut += Substr( sIn, i, 1 )\n NEXT\n\n RETURN cOut\n","language":"Harbour"},{"code":"reverse = foldl (flip (:)) []\n","language":"Haskell"},{"code":"accumulatingReverse :: [a] -> [a]\naccumulatingReverse lst =\n let rev xs a = foldl (flip (:)) a xs\n in rev lst []\n","language":"Haskell"},{"code":"import Data.Char (isMark)\nimport Data.List (groupBy)\nmyReverse = concat . reverse . groupBy (const isMark)\n","language":"Haskell"},{"code":"CHARACTER string = \"Hello World\", tmp\n\nL = LEN( string )\nDO i = 1, L/2\n tmp = string(i)\n string(i) = string(L-i+1)\n string(L-i+1) = tmp\nENDDO\n\nWRITE(Messagebox, Name) string\n","language":"HicEst"},{"code":"procedure main(arglist)\ns := \\arglist[1] | \"asdf\"\nwrite(s,\" <-> \", reverse(s)) # reverse is built-in\nend\n","language":"Icon"},{"code":"\"asdf\" reverse\n","language":"Io"},{"code":"(reverse \"hello\")\n","language":"Io"},{"code":"100 INPUT PROMPT \"String: \":TX$\n120 LET REV$=\"\"\n130 FOR I=LEN(TX$) TO 1 STEP-1\n140 LET REV$=REV$&TX$(I)\n150 NEXT\n160 PRINT REV$\n","language":"IS-BASIC"},{"code":" |.'asdf'\nfdsa\n","language":"J"},{"code":" ranges=.16b02ff 16b036f, 16b1dbf 16b1dff, 16b20cf 16b20ff, 16bfe1f 16bfe2f\n iscombining=. 2 | ranges&I.\n","language":"J"},{"code":" split=. (<;.1~ -.@iscombining) :. ;\n","language":"J"},{"code":" |.&.split&.(3 u: 7&u:) 'as⃝df̅'\nf̅ds⃝a\n","language":"J"},{"code":"String reversed = new StringBuilder(\"as⃝df̅\").reverse().toString(); // fd⃝sa\nString reversed = new StringBuffer(\"as⃝df̅\").reverse().toString(); // fd⃝sa\n","language":"Java"},{"code":"String string = \"as⃝df̅\";\nStringBuilder reversed = new StringBuilder();\nfor (int index = string.length() - 1; index >= 0; index--)\n reversed.append(string.charAt(index));\nreversed; // fd⃝sa\n","language":"Java"},{"code":"import java.text.BreakIterator;\n\npublic class Reverse {\n /* works with Java 20+ only\n * cf. https://bugs.openjdk.org/browse/JDK-8291660\n */\n public static StringBuilder graphemeReverse(String text) {\n BreakIterator boundary = BreakIterator.getCharacterInstance();\n boundary.setText(text);\n StringBuilder reversed = new StringBuilder();\n int end = boundary.last();\n int start = boundary.previous();\n while (start != BreakIterator.DONE) {\n reversed.append(text.substring(start, end));\n end = start;\n start = boundary.previous();\n }\n return reversed;\n }\n public static void main(String[] args) throws Exception {\n String a = \"as⃝df̅\";\n System.out.println(graphemeReverse(a)); // f̅ds⃝a\n }\n}\n","language":"Java"},{"code":"example = 'Tux 🐧 penguin';\n\n// array expansion operator\n[...example].reverse().join('') // 'niugnep 🐧 xuT'\n// split regexp separator with Unicode mode\nexample.split(/(?:)/u).reverse().join('') // 'niugnep 🐧 xuT'\n\n// do not use\nexample.split('').reverse().join(''); // 'niugnep \\udc27\\ud83d xuT'\n","language":"JavaScript"},{"code":"a = \"\\u{1F466}\\u{1F3FB}\\u{1f44b}\"; // '👦🏻👋'\n\n// wrong behavior - ASCII sequences\na.split('').reverse().join(''); // '\\udc4b🁦\\ud83d'\n\n// wrong behavior - Unicode code points\n[...a].reverse().join(''); // '👋🏻👦'\na.split(/(?:)/u).reverse().join(''); // '👋🏻👦'\n\n// correct behavior - Unicode graphemes\n[...new Intl.Segmenter().segment(a)].map(x => x.segment).reverse().join('') // 👋👦🏻\n","language":"JavaScript"},{"code":"//using chained methods\nfunction reverseStr(s) {\n return s.split('').reverse().join('');\n}\n\n//fast method using for loop\nfunction reverseStr(s) {\n for (var i = s.length - 1, o = ''; i >= 0; o += s[i--]) { }\n return o;\n}\n\n//fast method using while loop (faster with long strings in some browsers when compared with for loop)\nfunction reverseStr(s) {\n var i = s.length, o = '';\n while (i--) o += s[i];\n return o;\n}\n","language":"JavaScript"},{"code":"(() => {\n\n // .reduceRight() can be useful when reversals\n // are composed with some other process\n\n let reverse1 = s => Array.from(s)\n .reduceRight((a, x) => a + (x !== ' ' ? x : ' <- '), ''),\n\n // but ( join . reverse . split ) is faster for\n // simple string reversals in isolation\n\n reverse2 = s => s.split('').reverse().join('');\n\n\n return [reverse1, reverse2]\n .map(f => f(\"Some string to be reversed\"));\n\n})();\n","language":"JavaScript"},{"code":"[\"desrever <- eb <- ot <- gnirts <- emoS\", \"desrever eb ot gnirts emoS\"]\n","language":"JavaScript"},{"code":"DEFINE reverse == \"\" [swons] fold.\n\n\"asdf\" reverse putchars.\n","language":"Joy"},{"code":"def reverse_string: explode | reverse | implode;\n","language":"Jq"},{"code":"var str = \"Never odd or even\";\nputs(str);\nputs(str.split('').reverse().join(''));\n","language":"Jsish"},{"code":"julia> reverse(\"hey\")\n\"yeh\"\n","language":"Julia"},{"code":"julia> join(reverse(collect(graphemes(\"as⃝df̅\"))))\n\"f̅ds⃝a\"\n","language":"Julia"},{"code":" |\"asdf\"\n\"fdsa\"\n\n | 23 4 5 1\n1 5 4 23\n","language":"K"},{"code":"fun main(args: Array<String>) {\n println(\"asdf\".reversed())\n}\n","language":"Kotlin"},{"code":"(include \"string\" \"algorithm\")\n(main\n (decl std::string s)\n (std::getline std::cin s)\n (std::reverse (s.begin) (s.end))\n (prn s))\n","language":"L++"},{"code":"{S.reverse hello brave new world}\n-> world new brave hello\n","language":"Lambdatalk"},{"code":"# Inv operator\nfn.println(parser.op(-asdf))\n# Ouput: fdsa\n\n# Inv operator function\nfn.println(fn.inv(asdf))\n# Ouput: fdsa\n","language":"Lang"},{"code":": flip \"\" split reverse \"\" join ;\n\"qwer asdf\" flip .\n","language":"Lang5"},{"code":"writeln reverse \"don't you know\"\n","language":"Langur"},{"code":"local(input) = 'asdf'\n#input->reverse\n","language":"Lasso"},{"code":"local(input = 'asdf', output = array)\nwith i in #input->values\ndo #output->insertFirst(#i)\n#output->join\n","language":"Lasso"},{"code":" .ORIG 0x3000\n\n LEA R1,STRING\n LEA R2,GNIRTS\n LD R3,MINUS1\n NOT R5,R1\n ADD R5,R5,1\n\nSCAN LDR R4,R1,0\n BRZ COPY\n ADD R1,R1,1\n BRNZP SCAN\n\nCOPY ADD R1,R1,R3\n ADD R4,R1,R5\n BRN COPIED\n LDR R4,R1,0\n STR R4,R2,0\n ADD R2,R2,1\n BRNZP COPY\n\nCOPIED AND R4,R4,0\n STR R4,R2,0\n\n LEA R0,GNIRTS\n PUTS\n\n HALT\n\nMINUS1 .FILL 0xFFFF\n\nSTRING .STRINGZ \"If thou beest he -- but O how fall'n! how chang'd\"\nGNIRTS .BLKW 128\n\n .END\n","language":"LC3-Assembly"},{"code":"> (lists:reverse \"asdf\")\n\"fdsa\"\n","language":"LFE"},{"code":"> (set encoded (binary (\"åäö ð\" utf8)))\n#B(195 165 195 164 195 182 32 195 176)\n","language":"LFE"},{"code":"> (io:format \"~tp~n\" (list encoded))\n<<\"åäö ð\"/utf8>>\n","language":"LFE"},{"code":"> (lists:reverse (unicode:characters_to_list encoded))\n\"ð öäå\"\n","language":"LFE"},{"code":"input$ =\"abcdefgABCDEFG012345\"\nprint input$\nprint ReversedStr$( input$)\n\nend\n\nfunction ReversedStr$(in$)\n for i =len(in$) to 1 step -1\n ReversedStr$ =ReversedStr$ +mid$( in$, i, 1)\n next i\nend function\n","language":"Liberty-BASIC"},{"code":"on reverse (str)\n res = \"\"\n repeat with i = str.length down to 1\n put str.char[i] after res\n end repeat\n return res\nend\n","language":"Lingo"},{"code":"on reverseBytes (str)\n ba = byteArray(str)\n res = byteArray()\n repeat with i = ba.length down to 1\n res[res.length+1] = ba[i]\n end repeat\n return res\nend\n","language":"Lingo"},{"code":"function reverseString S\n repeat with i = length(S) down to 1\n put char i of S after R\n end repeat\n return R\nend reverseString\n","language":"LiveCode"},{"code":"; This is not strictly LLVM, as it uses the C library function \"printf\".\n; LLVM does not provide a way to print values, so the alternative would be\n; to just load the string into memory, and that would be boring.\n\n; Additional comments have been inserted, as well as changes made from the output produced by clang such as putting more meaningful labels for the jumps\n\n$\"main.printf\" = comdat any\n\n@main.str = private unnamed_addr constant [12 x i8] c\"Hello world\\00\", align 1\n@\"main.printf\" = linkonce_odr unnamed_addr constant [4 x i8] c\"%s\\0A\\00\", comdat, align 1\n\ndefine void @reverse(i64, i8*) {\n %3 = alloca i8*, align 8 ; allocate str (local)\n %4 = alloca i64, align 8 ; allocate len (local)\n %5 = alloca i64, align 8 ; allocate i\n %6 = alloca i64, align 8 ; allocate j\n %7 = alloca i8, align 1 ; allocate t\n store i8* %1, i8** %3, align 8 ; set str (local) to the parameter str\n store i64 %0, i64* %4, align 8 ; set len (local) to the paremeter len\n store i64 0, i64* %5, align 8 ; i = 0\n %8 = load i64, i64* %4, align 8 ; load len\n %9 = sub i64 %8, 1 ; decrement len\n store i64 %9, i64* %6, align 8 ; j =\n br label %loop\n\nloop:\n %10 = load i64, i64* %5, align 8 ; load i\n %11 = load i64, i64* %6, align 8 ; load j\n %12 = icmp ult i64 %10, %11 ; i < j\n br i1 %12, label %loop_body, label %exit\n\nloop_body:\n %13 = load i8*, i8** %3, align 8 ; load str\n %14 = load i64, i64* %5, align 8 ; load i\n %15 = getelementptr inbounds i8, i8* %13, i64 %14 ; address of str[i]\n %16 = load i8, i8* %15, align 1 ; load str[i]\n store i8 %16, i8* %7, align 1 ; t = str[i]\n %17 = load i64, i64* %6, align 8 ; load j\n %18 = getelementptr inbounds i8, i8* %13, i64 %17 ; address of str[j]\n %19 = load i8, i8* %18, align 1 ; load str[j]\n %20 = getelementptr inbounds i8, i8* %13, i64 %14 ; address of str[i]\n store i8 %19, i8* %20, align 1 ; str[i] = str[j]\n %21 = load i8, i8* %7, align 1 ; load t\n %22 = getelementptr inbounds i8, i8* %13, i64 %17 ; address of str[j]\n store i8 %21, i8* %22, align 1 ; str[j] = t\n\n;-- loop increment\n %23 = load i64, i64* %5, align 8 ; load i\n %24 = add i64 %23, 1 ; increment i\n store i64 %24, i64* %5, align 8 ; store i\n %25 = load i64, i64* %6, align 8 ; load j\n %26 = add i64 %25, -1 ; decrement j\n store i64 %26, i64* %6, align 8 ; store j\n br label %loop\n\nexit:\n ret void\n}\n\ndefine i32 @main() {\n;-- char str[]\n %1 = alloca [12 x i8], align 1\n;-- memcpy(str, \"Hello world\")\n %2 = bitcast [12 x i8]* %1 to i8*\n call void @llvm.memcpy.p0i8.p0i8.i64(i8* %2, i8* getelementptr inbounds ([12 x i8], [12 x i8]* @main.str, i32 0, i32 0), i64 12, i32 1, i1 false)\n;-- printf(\"%s\\n\", str)\n %3 = getelementptr inbounds [12 x i8], [12 x i8]* %1, i32 0, i32 0\n %4 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @\"main.printf\", i32 0, i32 0), i8* %3)\n;-- %7 = strlen(str)\n %5 = getelementptr inbounds [12 x i8], [12 x i8]* %1, i32 0, i32 0\n %6 = call i64 @strlen(i8* %5)\n;-- reverse(%6, str)\n call void @reverse(i64 %6, i8* %5)\n;-- printf(\"%s\\n\", str)\n %7 = getelementptr inbounds [12 x i8], [12 x i8]* %1, i32 0, i32 0\n %8 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @\"main.printf\", i32 0, i32 0), i8* %7)\n;-- end of main\n ret i32 0\n}\n\n;--- The declaration for the external C printf function.\ndeclare i32 @printf(i8*, ...)\n\n; Function Attrs: argmemonly nounwind\ndeclare void @llvm.memcpy.p0i8.p0i8.i64(i8* nocapture writeonly, i8* nocapture readonly, i64, i32, i1)\n\ndeclare i64 @strlen(i8*)\n","language":"LLVM"},{"code":"print reverse \"cat ; tac\n","language":"Logo"},{"code":"example = 'asdf'\nstring.reverse(example) -- fdsa\nexample:reverse() -- fdsa\n","language":"Lua"},{"code":"Module ReverseString {\n a$=\"as⃝df̅\"\n Print Len(a$), len.disp(a$)\n Let i=1, j=Len(a$)\n z$=String$(\" \",j)\n j++\n do {\n k$=mid$(a$, i, 1)\n if i<len(a$) then {\n while len.disp(k$+mid$(a$, i+1,1)) =len.disp(k$) {\n k$+=mid$(a$, i+1,1)\n i++\n if i>len(a$) then exit\n j--\n }\n j--\n insert j, len(k$) Z$=K$\n } else j-- :Insert j,1 z$=k$\n if i>=len(a$) then exit\n i++\n } Always\n Print len(z$), len.disp(z$)\n Print z$=\"f̅ds⃝a\"\n Print z$\n}\nReverseString\n","language":"M2000-Interpreter"},{"code":"a$=\"as⃝df̅\"\nb$=strrev$(a$)\nclipboard b$\nPrint b$=\"̅fd⃝sa\"\n","language":"M2000-Interpreter"},{"code":"define(`invert',`ifelse(len(`$1'),0,,`invert(substr(`$1',1))'`'substr(`$1',0,1))')\n","language":"M4"},{"code":" .TITLE REVERS\n .MCALL .GTLIN,.PRINT,.EXIT\nREVERS::.GTLIN #1$ ; READ STRING\n MOV #1$,R0\n JSR PC,REV ; REVERSE IT\n .PRINT #1$ ; PRINT RESULT\n .EXIT\n1$: .BLKB 200\n\n ; REVERSE STRING AT R0\nREV: MOV R0,R1\n1$: TSTB (R1)+ ; FIND END OF STRING\n BNE 1$\n DEC R1 ; MOVE BACK TO LAST CHAR\n2$: MOVB -(R1),R2 ; SWAP CHARS\n MOVB (R0),(R1)\n MOVB R2,(R0)+\n CMP R0,R1 ; STOP WHEN POINTERS MEET\n BLT 2$\n RTS PC\n\n .END REVERS\n","language":"MACRO-11"},{"code":"> StringTools:-Reverse( \"foo\" );\n \"oof\"\n","language":"Maple"},{"code":"StringReverse[\"asdf\"]\n","language":"Mathematica"},{"code":">> fliplr(['She told me that she spoke English and I said great. '...\n'Grabbed her hand out the club and I said let''s skate.'])\n\nans =\n\n.etaks s'tel dias I dna bulc eht tuo dnah reh debbarG .taerg dias I dna hsilgnE ekops ehs taht em dlot ehS\n","language":"MATLAB"},{"code":"sreverse(\"abcdef\"); /* \"fedcba\" */\n\nsreverse(\"rats live on no evil star\"); /* not a bug :o) */\n","language":"Maxima"},{"code":"fn reverseString s =\n(\n local reversed = \"\"\n for i in s.count to 1 by -1 do reversed += s[i]\n reversed\n)\n","language":"MAXScript"},{"code":"(\"\" split reverse \"\" join) :reverse-str\n","language":"Min"},{"code":"str = \"This is a string\"\nprint \"Forward: \" + str\nnewStr = \"\"\nfor i in range(str.len-1, 0)\n newStr = newStr + str[i]\nend for\nprint \"Reversed: \" + newStr\n","language":"MiniScript"},{"code":"# First, it gets the length of the original string\n# Then, it allocates memory from the copy\n# Then it copies the pointer to the original string, and adds the strlen\n# subtract 1, then that new pointer is at the last char.\n# while(strlen)\n# copy char\n# decrement strlen\n# decrement source pointer\n# increment target pointer\n\n.text\n\nstrcpy:\n addi $sp, $sp, -4\n sw $s0, 0($sp)\n add $s0, $zero, $zero\n\nL1:\n add $t1, $s0, $a1\n lb $t2, 0($t1)\n add $t3, $s0, $a0\n sb $t2, 0($t3)\n beq $t2, $zero, L2\n addi $s0, $s0, 1\n j L1\n\nL2:\n lw $s0, 0($sp)\n addi $sp, $sp, 4\n jr $ra\n\n.data\n\tex_msg_og: .asciiz \"Original string:\\n\"\n\tex_msg_cpy: .asciiz \"\\nCopied string:\\n\"\n\tstring: .asciiz \"Nice string you got there!\\n\"\n","language":"MIPS-Assembly"},{"code":"def reverse(s:string)\n StringBuilder.new(s).reverse\nend\n\nputs reverse('reversed')\n","language":"Mirah"},{"code":"main :: [sys_message]\nmain = [Stdout (reverse \"esreveR\"),\n Stdout \"\\n\"]\n","language":"Miranda"},{"code":"MODULE ReverseStr;\nFROM FormatString IMPORT FormatString;\nFROM Terminal IMPORT Write,WriteString,WriteLn,ReadChar;\n\nPROCEDURE WriteInt(n : INTEGER);\nVAR buf : ARRAY[0..15] OF CHAR;\nBEGIN\n FormatString(\"%i\", buf, n);\n WriteString(buf)\nEND WriteInt;\n\nPROCEDURE ReverseStr(in : ARRAY OF CHAR; VAR out : ARRAY OF CHAR);\nVAR ip,op : INTEGER;\nBEGIN\n ip := 0;\n op := 0;\n WHILE in[ip] # 0C DO\n INC(ip)\n END;\n DEC(ip);\n WHILE ip>=0 DO\n out[op] := in[ip];\n INC(op);\n DEC(ip)\n END\nEND ReverseStr;\n\nTYPE A = ARRAY[0..63] OF CHAR;\nVAR is,os : A;\nBEGIN\n is := \"Hello World\";\n ReverseStr(is, os);\n\n WriteString(is);\n WriteLn;\n WriteString(os);\n WriteLn;\n\n ReadChar\nEND ReverseStr.\n","language":"Modula-2"},{"code":"MODULE Reverse EXPORTS Main;\n\nIMPORT IO, Text;\n\nPROCEDURE String(item: TEXT): TEXT =\n VAR result: TEXT := \"\";\n BEGIN\n FOR i := Text.Length(item) - 1 TO 0 BY - 1 DO\n result := Text.Cat(result, Text.FromChar(Text.GetChar(item, i)));\n END;\n RETURN result;\n END String;\n\nBEGIN\n IO.Put(String(\"Foobarbaz\") & \"\\n\");\nEND Reverse.\n","language":"Modula-3"},{"code":"REVERSE\n ;Take in a string and reverse it using the built in function $REVERSE\n NEW S\n READ:30 \"Enter a string: \",S\n WRITE !,$REVERSE(S)\n QUIT\n","language":"MUMPS"},{"code":"def reverse(string)\n l = \"\"\n\n for char in list(str(string)).reverse()\n l += char\n end\n\n return l\nend\n","language":"Nanoquery"},{"code":"/* Reverse a string, in Neko */\n\nvar reverse = function(s) {\n var len = $ssize(s)\n if len < 2 return s\n\n var reverse = $smake(len)\n var pos = 0\n while len > 0 $sset(reverse, pos ++= 1, $sget(s, len -= 1))\n return reverse\n}\n\nvar str = \"never odd or even\"\n$print(str, \"\\n\")\n$print(reverse(str), \"\\n\\n\")\n\nstr = \"abcdefghijklmnopqrstuvwxyz\"\n$print(str, \"\\n\")\n$print(reverse(str), \"\\n\\n\")\n\n$print(\"single test\\n\")\nstr = \"a\"\n$print(str, \"\\n\")\n$print(reverse(str), \"\\n\\n\")\n\n\n$print(\"empty test\\n\")\nstr = \"\"\n$print(str, \"\\n\")\n$print(reverse(str), \"\\n\")\n","language":"Neko"},{"code":"using System;\nusing System.Globalization;\nusing System.Windows.Forms;\nusing System.Console;\nusing Nemerle.Utility.NString;\n\nmodule StrReverse\n{\n UReverse(text : string) : string\n {\n mutable output = [];\n def elements = StringInfo.GetTextElementEnumerator(text);\n while (elements.MoveNext())\n output ::= elements.GetTextElement().ToString();\n Concat(\"\", output.Reverse());\n }\n\n Main() : void\n {\n def test = \"as⃝df̅\";\n MessageBox.Show($\"$test --> $(UReverse(test))\"); //for whatever reason my console didn't display Unicode properly, but a MessageBox worked\n }\n}\n","language":"Nemerle"},{"code":"Reverse(text : string) : string\n{\n mutable output = [];\n foreach (c in text.ToCharArray())\n output ::= c.ToString();\n Concat(\"\", output)\n}\n","language":"Nemerle"},{"code":"/* NetRexx */\n\noptions replace format comments java crossref savelog symbols nobinary\n\nreverseThis = 'asdf'\nsihTesrever = reverseThis.reverse\n\nsay reverseThis\nsay sihTesrever\n\nreturn\n","language":"NetRexx"},{"code":"(reverse \"!dlroW olleH\")\n","language":"NewLISP"},{"code":"reverse 'asdf'\n=fdsa\n","language":"Nial"},{"code":"import unicode\n\ndoAssert \"foobar\".reversed == \"raboof\"\ndoAssert \"先秦兩漢\".reversed == \"漢兩秦先\"\n","language":"Nim"},{"code":"10 STRING$=\"THIS TEXT IS REVERSED.\"\n20 REVERSED$=\"\"\n30 FOR I=1 TO LEN(STRING$)\n40 REVERSED$=MID$(STRING$,I,1)+REVERSED$\n50 NEXT\n60 PRINT REVERSED$\n","language":"NS-HUBASIC"},{"code":"MODULE reverse;\n\n IMPORT Out, Strings;\n\n VAR s: ARRAY 12 + 1 OF CHAR;\n\n PROCEDURE Swap(VAR c, d: CHAR);\n VAR oldC: CHAR;\n BEGIN\n oldC := c; c := d; d := oldC\n END Swap;\n\n\n PROCEDURE Reverse(VAR s: ARRAY OF CHAR);\n VAR len, i: INTEGER;\n BEGIN\n len := Strings.Length(s);\n FOR i := 0 TO len DIV 2 DO\n Swap(s[i], s[len - 1 - i])\n END\n END Reverse;\n\nBEGIN\n s := \"hello, world\";\n Reverse(s);\n Out.String(s);\n Out.Ln\nEND reverse.\n","language":"Oberon"},{"code":"result := \"asdf\"->Reverse();\n","language":"Objeck"},{"code":"#import <Foundation/Foundation.h>\n\n@interface NSString (Extended)\n-(NSString *)reverseString;\n@end\n\n@implementation NSString (Extended)\n-(NSString *) reverseString\n{\n NSUInteger len = [self length];\n NSMutableString *rtr=[NSMutableString stringWithCapacity:len];\n // unichar buf[1];\n\n while (len > (NSUInteger)0) {\n unichar uch = [self characterAtIndex:--len];\n [rtr appendString:[NSString stringWithCharacters:&uch length:1]];\n }\n return rtr;\n}\n@end\n","language":"Objective-C"},{"code":"int main()\n{\n @autoreleasepool {\n\n NSString *test = [@\"!A string to be reverted!\" reverseString];\n\n NSLog(@\"%@\", test);\n\n }\n return 0;\n}\n","language":"Objective-C"},{"code":"#import <Foundation/Foundation.h>\n\n@interface NSString (Extended)\n-(NSString *)reverseString;\n@end\n\n@implementation NSString (Extended)\n-(NSString *)reverseString\n{\n\tNSInteger l = [self length] - 1;\n\tNSMutableString *ostr = [NSMutableString stringWithCapacity:[self length]];\n\twhile (l >= 0)\n\t{\n\t\tNSRange range = [self rangeOfComposedCharacterSequenceAtIndex:l];\n\t\t[ostr appendString:[self substringWithRange:range]];\n\t\tl -= range.length;\n\t}\n\treturn ostr;\n}\n@end\n","language":"Objective-C"},{"code":"int main()\n{\n @autoreleasepool {\n\n NSString *test = [@\"as⃝df̅\" reverseString];\n\n NSLog(@\"%@\", test);\n\n }\n return 0;\n}\n","language":"Objective-C"},{"code":"let string_rev s =\n let len = String.length s in\n String.init len (fun i -> s.[len - 1 - i])\n\nlet () =\n print_endline (string_rev \"Hello world!\")\n","language":"OCaml"},{"code":"let rev_bytes bs =\n let last = Bytes.length bs - 1 in\n for i = 0 to last / 2 do\n let j = last - i in\n let c = Bytes.get bs i in\n Bytes.set bs i (Bytes.get bs j);\n Bytes.set bs j c;\n done\n\nlet () =\n let s = Bytes.of_string \"Hello World\" in\n rev_bytes s;\n print_bytes s;\n print_newline ();\n;;\n","language":"OCaml"},{"code":"let rec revs_aux strin list index =\n if List.length list = String.length strin\n then String.concat \"\" list\n else revs_aux strin ((String.sub strin index 1)::list) (index+1)\n\nlet revs s = revs_aux s [] 0\n\nlet () =\n print_endline (revs \"Hello World!\")\n","language":"OCaml"},{"code":"s = \"a string\";\nrev = s(length(s):-1:1)\n","language":"Octave"},{"code":"reverse\n","language":"Oforth"},{"code":"(define (rev s)\n (runes->string (reverse (string->runes s))))\n\n; testing:\n(print (rev \"Hello, λ!\"))\n; ==> !λ ,olleH\n","language":"Ol"},{"code":"main: func {\n \"asdf\" reverse() println() // prints \"fdsa\"\n}\n","language":"OOC"},{"code":"FUNCTION reverseString RETURNS CHARACTER (\n INPUT i_c AS CHARACTER\n):\n\n DEFINE VARIABLE cresult AS CHARACTER NO-UNDO.\n DEFINE VARIABLE ii AS INTEGER NO-UNDO.\n\n DO ii = LENGTH( i_c ) TO 1 BY -1:\n cresult = cresult + SUBSTRING( i_c, ii, 1 ).\n END.\n RETURN cresult.\n\nEND FUNCTION.\n\nMESSAGE reverseString( \"asdf\" ) VIEW-AS ALERT-BOX.\n","language":"OpenEdge-Progress"},{"code":"'8 BIT CHARACTERS\n\nstring s=\"qwertyuiop\"\nsys a,b,i,j,le=len s\n'\nfor i=1 to le\n j=le-i+1\n if j<=i then exit for\n a=asc s,i\n b=asc s,j\n mid s,j,chr a\n mid s,i,chr b\nnext\n'\n\nprint s\n\n'16 BIT CHARACTERS\n\nwstring s=\"qwertyuiop\"\nsys a,b,i,j,le=len s\n'\nfor i=1 to le\n j=le-i+1\n if j<=i then exit for\n a=unic s,i\n b=unic s,j\n mid s,j,wchr a\n mid s,i,wchr b\nnext\n'\nprint s\n","language":"OxygenBasic"},{"code":"string s=\"qwertyuiop\"\nsys p=strptr s, le=len s\nmov esi,p\nmov edi,esi\nadd edi,le\ndec edi\n(\n cmp esi,edi\n jge exit\n mov al,[esi]\n mov ah,[edi]\n mov [esi],ah\n mov [edi],al\n inc esi\n dec edi\n repeat\n)\n\nprint s\n","language":"OxygenBasic"},{"code":"{System.showInfo {Reverse \"!dlroW olleH\"}}\n","language":"Oz"},{"code":"local\n fun {DoReverse Xs Ys}\n case Xs of nil then Ys\n [] X|Xr then {DoReverse Xr X|Ys}\n end\n end\nin\n fun {Reverse Xs} {DoReverse Xs nil} end\nend\n","language":"Oz"},{"code":"reverse(s)=concat(Vecrev(s))\n","language":"PARI-GP"},{"code":"\\\\ Return reversed string str.\n\\\\ 3/3/2016 aev\nsreverse(str)={return(Strchr(Vecrev(Vecsmall(str))))}\n\n{\n\\\\ TEST1\nprint(\" *** Testing sreverse from Version #2:\");\nprint(sreverse(\"ABCDEF\"));\nmy(s,sr,n=10000000);\ns=\"ABCDEFGHIJKL\";\nfor(i=1,n, sr=sreverse(s));\n}\n","language":"PARI-GP"},{"code":"\\\\ Version #1 upgraded to complete function. Practically the same.\nreverse(str)={return(concat(Vecrev(str)))}\n\n{\n\\\\ TEST2\nprint(\" *** Testing reverse from Version #1:\");\nprint(reverse(\"ABCDEF\"));\nmy(s,sr,n=10000000);\ns=\"ABCDEFGHIJKL\";\nfor(i=1,n, sr=reverse(s));\n}\n","language":"PARI-GP"},{"code":"{ the result array must be at least as large as the original array }\nprocedure reverse(s: array[min .. max: integer] of char, var result: array[min1 .. max1: integer] of char);\n var\n i, len: integer;\n begin\n len := max-min+1;\n for i := 0 to len-1 do\n result[min1 + len-1 - i] := s[min + i]\n end;\n","language":"Pascal"},{"code":"{Copy and paste it in your program}\nfunction revstr(my_s:string):string;\n var out_s:string;\n ls,i:integer;\n begin\n ls:=length(my_s);\n for i:=1 to ls do\n out_s:=out_s+my_s[ls-i+1];\n revstr:=out_s;\n end;\n","language":"Pascal"},{"code":"function reverse(s:string):string;\nvar i:integer;\nvar tmp:char;\nbegin\n for i:=1 to length(s) div 2 do\n begin\n tmp:=s[i];\n s[i]:=s[length(s)+1-i];\n s[length(s)+1-i]:=tmp;\n reverse:=s;\n end;\nend;\n","language":"Pascal"},{"code":"procedure revString(var s:string);\nvar\n i,j:integer;\n tmp:char;\nbegin\n i := 1;\n j := length(s);\n while i<j do\n begin\n tmp:=s[i];\n s[i]:=s[j];\n s[j]:=tmp;\n inc(i);\n dec(j)\n end;\nend;\n","language":"Pascal"},{"code":"<# 显示 指定 变量 反转顺序 字串>集装箱|猫坐在垫子</#>\n","language":"Peloton"},{"code":"<# 보이십 할당하 변물건 열거꾸 문자그>컨테이너|고양이가 매트 위에 앉아</#>\n","language":"Peloton"},{"code":"<@ SAYLETVARREVLIT>集装箱|猫坐在垫子</@>\n","language":"Peloton"},{"code":"use utf8;\nbinmode STDOUT, \":utf8\";\n\n# to reverse characters (code points):\nprint scalar reverse('visor'), \"\\n\";\n\n# to reverse graphemes:\nprint join(\"\", reverse \"José\" =~ /\\X/g), \"\\n\";\n\n$string = 'ℵΑΩ 駱駝道 🤔 🇸🇧 🇺🇸 🇬🇧 👨👩👧👦🆗🗺';\nprint join(\"\", reverse $string =~ /\\X/g), \"\\n\";\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">reverse</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"asdf\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">unicode_reverse</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">utf8</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">utf32</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">utf8_to_utf32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">utf8</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- The assumption is made that <char><comb1><comb2>\n -- and <char><comb2><comb1> etc would work the same.\n -- The following loop converts <char><comb1><comb2>\n -- to <comb1><comb2><char>, as a pre-reverse() step.</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">utf32</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">utf32</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">0x300</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">0x36f</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">0x1dc0</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">0x1dff</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">0x20d0</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">0x20ff</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">0xfe20</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">0xfe2f</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">utf32</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">utf32</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">utf32</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ch</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">utf32</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">reverse</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">utf32</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">utf8</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">utf32_to_utf8</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">utf32</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">utf8</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">r4</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"as\\u203Ddf\\u0305\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">rt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r4</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\" reversed is \"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">unicode_reverse</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r4</span><span style=\"color: #0000FF;\">)&</span><span style=\"color: #008000;\">\"\\n\"</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rt</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"// Will split every Unicode character to array, reverse array and will convert it to string.\njoin('', array_reverse(preg_split('\"\"u', $string, -1, PREG_SPLIT_NO_EMPTY)));\n","language":"PHP"},{"code":"implode('', array_reverse(mb_str_split($string)));\n","language":"PHP"},{"code":"$a = mb_convert_encoding('👦🏻👋', 'UTF-8', 'HTML-ENTITIES'); // 👦🏻👋\n\nfunction str_to_array($string)\n{\n $length = grapheme_strlen($string);\n $ret = [];\n\n for ($i = 0; $i < $length; $i += 1) {\n\n $ret[] = grapheme_substr($string, $i, 1);\n }\n\n return $ret;\n}\n\nfunction utf8_strrev($string)\n{\n return implode(array_reverse(str_to_array($string)));\n}\n\nprint_r(utf8_strrev($a)); // 👋👦🏻\n","language":"PHP"},{"code":"strrev($string);\n","language":"PHP"},{"code":"(pack (flip (chop \"äöüÄÖÜß\")))\n","language":"PicoLisp"},{"code":"reverse(\"foo\");\n","language":"Pike"},{"code":"#charset utf8\nvoid main()\n{\n string s = \"ßÜÖÄüöää ἀρχῇ\";\n write(\"%s\\n\", string_to_utf8( reverse(s) ));\n}\n","language":"Pike"},{"code":"s = reverse(s);\n","language":"PL-I"},{"code":"To run:\nStart up.\nPut \"asdf\" into a string.\nReverse the string.\nShut down.\n","language":"Plain-English"},{"code":"\\def\\gobtoA#1\\revA{}\\def\\gobtoB#1\\revB{}\n\\def\\reverse#1{\\reversei{}#1\\revA\\revB\\revB\\revB\\revB\\revB\\revB\\revB\\revB\\revA}\n\\def\\reversei#1#2#3#4#5#6#7#8#9{\\gobtoB#9\\revend\\revB\\reversei{#9#8#7#6#5#4#3#2#1}}\n\\def\\revend\\revB\\reversei#1#2\\revA{\\gobtoA#1}\n\\reverse{Rosetta}\n\\bye\n","language":"PlainTeX"},{"code":"define reverse_string(s);\n lvars i, l = length(s);\n for i from l by -1 to 1 do\n s(i);\n endfor;\n consstring(l);\nenddefine;\n","language":"Pop11"},{"code":"/reverse{\n/str exch def\n/temp str 0 get def\n/i 0 def\nstr length 2 idiv{\n/temp str i get def\nstr i str str length i sub 1 sub get put\nstr str length i sub 1 sub temp put\n/i i 1 add def\n}repeat\nstr pstack\n}def\n","language":"PostScript"},{"code":"[1 2 3] reverse % input\n[3 2 1]\n\n(Hello World) reverse % input\n(dlroW olleH)\n","language":"PostScript"},{"code":"#DIM ALL\n#COMPILER PBCC 6\n\nFUNCTION PBMAIN () AS LONG\nCON.PRINT STRREVERSE$(\"PowerBASIC\")\nEND FUNCTION\n","language":"PowerBASIC"},{"code":"$s = \"asdf\"\n","language":"PowerShell"},{"code":"[string]::Join('', $s[$s.Length..0])\n","language":"PowerShell"},{"code":"-join ($s[$s.Length..0])\n","language":"PowerShell"},{"code":"[array]::Reverse($s)\n","language":"PowerShell"},{"code":"$s -replace\n ('(.)' * $s.Length),\n [string]::Join('', ($s.Length..1 | ForEach-Object { \"`$$_\" }))\n","language":"PowerShell"},{"code":"$s -replace\n ('(.)' * $s.Length),\n -join ($s.Length..1 | ForEach-Object { \"`$$_\" } )\n","language":"PowerShell"},{"code":"[Regex]::Matches($s,'.','RightToLeft').Value -join ''\n","language":"PowerShell"},{"code":"$a = 'abc 🐧 def'\n$enum = $a.EnumerateRunes() | % { \"$_\" }\n-join $enum[$enum.length..0] # fed 🐧 cba\n","language":"PowerShell"},{"code":"$a = \"aeiou`u{0308}yz\"\n$enum = [System.Globalization.StringInfo]::GetTextElementEnumerator($a)\n$arr = @()\nwhile($enum.MoveNext()) { $arr += $enum.GetTextElement() }\n[array]::reverse($arr)\n$arr -join '' # zyüoiea\n","language":"PowerShell"},{"code":"reverse(\"abcd\", L), string_to_list(S,L).\n","language":"Prolog"},{"code":"accRev([H|T], A, R) :- accRev(T, [H|A], R).\naccRev([], A, A).\n\nrev(L,R) :- accRev(L,[],R).\n","language":"Prolog"},{"code":"Debug ReverseString(\"!dekrow tI\")\n","language":"PureBasic"},{"code":"input()[::-1]\n","language":"Python"},{"code":"string[::-1]\n","language":"Python"},{"code":"''.join(reversed(string))\n","language":"Python"},{"code":"import unicodedata\n\ndef ureverse(ustring):\n 'Reverse a string including unicode combining characters'\n groupedchars = []\n uchar = list(ustring)\n while uchar:\n if unicodedata.combining(uchar[0]) != 0:\n groupedchars[-1] += uchar.pop(0)\n else:\n groupedchars.append(uchar.pop(0))\n # Grouped reversal\n groupedchars = groupedchars[::-1]\n\n return ''.join(groupedchars)\n\ndef say_string(s):\n return ' '.join([s, '=', ' | '.join(unicodedata.name(ch, '') for ch in s)])\n\ndef say_rev(s):\n print(f\"Input: {say_string(s)}\")\n print(f\"Character reversed: {say_string(s[::-1])}\")\n print(f\"Unicode reversed: {say_string(ureverse(s))}\")\n print(f\"Unicode reverse²: {say_string(ureverse(ureverse(s)))}\")\n\nif __name__ == '__main__':\n ucode = ''.join(chr(int(n[2:], 16)) for n in\n 'U+0041 U+030A U+0073 U+0074 U+0072 U+006F U+0308 U+006D'.split())\n say_rev(ucode)\n","language":"Python"},{"code":"ucode = ''.join(chr(int(n[2:], 16)) for n in\n 'U+006B U+0301 U+0075 U+032D U+006F U+0304 U+0301 U+006E'.split())\nsay_rev(ucode)\n","language":"Python"},{"code":"ucode = ''.join(chr(int(n, 16))\n for n in ['61', '73', '20dd', '64', '66', '305'])\nsay_rev(ucode)\n","language":"Python"},{"code":"(REVERSE \"ABCD\")\n","language":"Qi"},{"code":" [ dup nest? if\n [ [] swap witheach\n [ nested\n swap join ] ] ] is reverse ( x --> x )\n","language":"Quackery"},{"code":"function reverse$(a$)\n b$ = \"\"\n for i = 1 to len(a$)\n b$ = mid$(a$, i, 1) + b$\n next i\n reverse$ = b$\nend function\n","language":"QuickBASIC"},{"code":"revstring <- function(stringtorev) {\n return(\n paste(\n strsplit(stringtorev,\"\")[[1]][nchar(stringtorev):1]\n ,collapse=\"\")\n )\n}\n","language":"R"},{"code":" revstring <- function(s) paste(rev(strsplit(s,\"\")[[1]]),collapse=\"\")\n","language":"R"},{"code":"revstring(\"asdf\")\nrevstring(\"m\\u00f8\\u00f8se\")\nEncoding(\"m\\u00f8\\u00f8se\") # just to check if on your system it's something\n # different!\n","language":"R"},{"code":"#lang racket\n\n(define (string-reverse s)\n (list->string (reverse (string->list s))))\n\n(string-reverse \"aoeu\")\n","language":"Racket"},{"code":"say \"hello world\".flip;\nsay \"as⃝df̅\".flip;\nsay 'ℵΑΩ 駱駝道 🤔 🇸🇧 🇺🇸 🇬🇧 👨👩👧👦🆗🗺'.flip;\n","language":"Raku"},{"code":"print reverse$(\"This is a test\")\n","language":"RapidQ"},{"code":"import String;\nreverse(\"string\")\n","language":"Rascal"},{"code":"\"asdf\" reverse\n","language":"Raven"},{"code":"print reverse \"asdf\"\n","language":"REBOL"},{"code":"x: \"asdf\"\nprint reverse x\nprint x ; Now reversed.\n","language":"REBOL"},{"code":">> reverse \"asdf\"\n== \"fdsa\"\n","language":"Red"},{"code":"$ENTRY Go {\n = <Prout <Reverse 'asdf'>>;\n};\n\nReverse {\n (e.X) = e.X;\n (e.X) s.C e.Y = <Reverse (s.C e.X) e.Y>;\n e.X = <Reverse () e.X>;\n};\n","language":"Refal"},{"code":"let rev_string = (s) => {\n let len = Js.String2.length(s)\n let arr = []\n for i in 0 to (len-1) {\n let c = Js.String2.get(s, len - 1 - i)\n let _ = Js.Array2.push(arr, c)\n }\n Js.String2.concatMany(\"\", arr)\n}\n\nJs.log(rev_string(\"abcdefg\"))\n","language":"ReScript"},{"code":"'asdf s:reverse s:put\n","language":"Retro"},{"code":"/*REXX program to reverse a string (and show before and after strings).*/\n\nstring1 = 'A man, a plan, a canal, Panama!'\nstring2 = reverse(string1)\n\nsay ' original string: ' string1\nsay ' reversed string: ' string2\n /*stick a fork in it, we're done.*/\n","language":"REXX"},{"code":"/*REXX program to reverse a string (and show before and after strings).*/\n\nstring1 = 'A man, a plan, a canal, Panama!'\nstring2 =\n do j=1 for length(string1)\n string2 = substr(string1,j,1)string2\n end /*j*/\nsay ' original string: ' string1\nsay ' reversed string: ' string2\n /*stick a fork in it, we're done.*/\n","language":"REXX"},{"code":" string2 = substr(string1,j,1) || string2\n /*───── or ─────*/\n string2= substr(string1,j,1)string2\n","language":"REXX"},{"code":"/*REXX program to reverse a string (and show before and after strings).*/\n\nstring1 = 'A man, a plan, a canal, Panama!'\nstring2 =\n do j=length(string1) to 1 by -1\n string2 = string2 || substr(string1,j,1)\n end /*j*/\nsay ' original string: ' string1\nsay ' reversed string: ' string2\n /*stick a fork in it, we're done.*/\n","language":"REXX"},{"code":"cStr = \"asdf\" cStr2 = \"\"\nfor x = len(cStr) to 1 step -1 cStr2 += cStr[x] next\nSee cStr2 # fdsa\n","language":"Ring"},{"code":">> x = \"rosettacode\"\nrosettacode\n\n// script\nrx = \"\";\nfor (i in strlen(x):1:-1)\n{\n rx = rx + substr(x, i);\n}\n\n>> rx\nedocattesor\n","language":"RLaB"},{"code":". \"local1 = Main string\"\n. \"local2 = Temporary string storage\"\n. \"local3 = String length\"\nset \"$local1\" to \"\"\nset \"$local2 \" to \"\"\nset \"local3\" to 0\n\ninput string \"String to reverse:\"\nset \"$local1\" to \"&INPUT&\"\nset \"$local2\" to \"$local1\"\nset \"local3\" to \"$local2.length\"\nloop start\nset \"$local1.(('local3' - 1) - 'loopcount')\" to \"$local2.('loopcount')\"\nloop for \"('local3' - 1)\"\n* \"Reversed string: &$local1& (Length: &$local1.length&)\"\nend\n","language":"Robotic"},{"code":"str = \"asdf\"\nreversed = str.reverse\n\"résumé niño\".reverse #=> \"oñin émusér\"\n","language":"Ruby"},{"code":"graphemes = 'as⃝df̅'.scan(/\\X/)\nreversed = graphemes.reverse\ngraphemes.join #=> \"f̅ds⃝a\"\n","language":"Ruby"},{"code":"string$ = \"123456789abcdefghijk\"\nfor i = len(string$) to 1 step -1\n print mid$(string$,i,1);\nnext i\n","language":"Run-BASIC"},{"code":"let mut buffer = b\"abcdef\".to_vec();\nbuffer.reverse();\nassert_eq!(buffer, b\"fedcba\");\n","language":"Rust"},{"code":"let output: String = \"一二三四五六七八九十\".chars().rev().collect();\nassert_eq!(output, \"十九八七六五四三二一\");\n","language":"Rust"},{"code":"let output: String = \"as⃝df̅\".chars().rev().collect();\nassert_ne!(output, \"f̅ds⃝a\"); // should be this\nassert_eq!(output, \"̅fd⃝sa\");\n","language":"Rust"},{"code":"use unicode_segmentation::UnicodeSegmentation;\n\nlet output: String = \"as⃝df̅\".graphemes(true).rev().collect();\nassert_eq!(output, \"f̅ds⃝a\");\n","language":"Rust"},{"code":"variable sa = \"Hello, World\", aa = Char_Type[strlen(sa)+1];\ninit_char_array(aa, sa);\narray_reverse(aa);\n% print(aa);\n\n% Unfortunately, strjoin() only joins strings, so we map char()\n% [sadly named: actually converts char into single-length string]\n% onto the array:\n\nprint( strjoin(array_map(String_Type, &char, aa), \"\") );\n","language":"S-lang"},{"code":"define init_unicode_array(a, buf)\n{\n variable len = strbytelen(buf), ch, p0 = 0, p1 = 0;\n while (p1 < len) {\n (p1, ch) = strskipchar(buf, p1, 1);\n if (ch < 0) print(\"oops.\");\n a[p0] = ch;\n p0++;\n }\n}\n\nvariable su = \"Σὲ γνωρίζω ἀπὸ τὴν κόψη\";\nvariable au = Int_Type[strlen(su)+1];\ninit_unicode_array(au, su);\narray_reverse(au);\n% print(au);\nprint(strjoin(array_map(String_Type, &char, au), \"\") );\n","language":"S-lang"},{"code":"data _null_;\nlength a b $11;\na=\"I am Legend\";\nb=reverse(a);\nput a;\nput b;\nrun;\n","language":"SAS"},{"code":"class MAIN is\n main is\n s ::= \"asdf\";\n reversed ::= s.reverse;\n -- current implementation does not handle multibyte encodings correctly\n end;\nend;\n","language":"Sather"},{"code":"\"asdf\".reverse\n","language":"Scala"},{"code":"\"asdf\".foldRight(\"\")((a,b) => b+a)\n","language":"Scala"},{"code":"def reverse(s: String) = {\n import java.text.{Normalizer,BreakIterator}\n val norm = Normalizer.normalize(s, Normalizer.Form.NFKC) // waffle -> waffle (optional)\n val it = BreakIterator.getCharacterInstance\n it setText norm\n def break(it: BreakIterator, prev: Int, result: List[String] = Nil): List[String] = it.next match {\n case BreakIterator.DONE => result\n case cur => break(it, cur, norm.substring(prev, cur) :: result)\n }\n break(it, it.first).mkString\n}\n","language":"Scala"},{"code":"def reverseString(s: String) = {\n import java.lang.Character._\n\n val combiningTypes = List(NON_SPACING_MARK, ENCLOSING_MARK, COMBINING_SPACING_MARK)\n def isCombiningCharacter(c: Char) = combiningTypes contains c.getType\n def isCombiningSurrogate(high: Char, low: Char) = combiningTypes contains getType(toCodePoint(high, low))\n def isCombining(l: List[Char]) = l match {\n case List(a, b) => isCombiningSurrogate(a, b)\n case List(a) => isCombiningCharacter(a)\n case Nil => true\n case _ => throw new IllegalArgumentException(\"isCombining expects a list of up to two characters\")\n }\n\n def cleanSurrogate(l: List[Char]) = l match {\n case List(a, b) if a.isHighSurrogate && b.isLowSurrogate => l\n case List(a, b) if a.isLowSurrogate => Nil\n case List(a, b) => List(a)\n case _ => throw new IllegalArgumentException(\"cleanSurrogate expects lists of two characters, exactly\")\n }\n\n def splitString(string: String) = (string+\" \").iterator sliding 2 map (_.toList) map cleanSurrogate toList\n\n def recurse(fwd: List[List[Char]], rev: List[Char]): String = fwd match {\n case Nil => rev.mkString\n case c :: rest =>\n val (combining, remaining) = rest span isCombining\n recurse(remaining, c ::: combining.foldLeft(List[Char]())(_ ::: _) ::: rev)\n }\n recurse(splitString(s), Nil)\n}\n","language":"Scala"},{"code":"(define (string-reverse s)\n (list->string (reverse (string->list s))))\n","language":"Scheme"},{"code":"#!/bin/sed -f\n\n/../! b\n\n# Reverse a line. Begin embedding the line between two newlines\ns/^.*$/\\\n&\\\n/\n\n# Move first character at the end. The regexp matches until\n# there are zero or one characters between the markers\ntx\n:x\ns/\\(\\n.\\)\\(.*\\)\\(.\\n\\)/\\3\\2\\1/\ntx\n\n# Remove the newline markers\ns/\\n//g\n","language":"Sed"},{"code":"$ include \"seed7_05.s7i\";\n\nconst func string: reverso(in string: stri) is func\n result\n var string: result is \"\";\n local\n var integer: index is 0;\n begin\n for index range length(stri) downto 1 do\n result &:= stri[index];\n end for;\n end func;\n\nconst proc: main is func\n begin\n writeln(reverso(\"Was it a cat I saw\"));\n end func;\n","language":"Seed7"},{"code":"$ include \"seed7_05.s7i\";\n\nconst proc: main is func\n begin\n writeln(reverse(\"Was it a cat I saw?\"));\n end func;\n","language":"Seed7"},{"code":"'asdf' copyMutable reverse\n","language":"Self"},{"code":"put \"asdf\" reversed -- reverse on the fly\n\nset imp to \"rumpelstiltskin\"\nreverse imp -- reverse in place\nput imp\n","language":"SenseTalk"},{"code":"import <Utilities/Sequence.sl>;\n\nmain(args(2)) := Sequence::reverse(args[1]);\n","language":"SequenceL"},{"code":"reverse<T> : T(1) -> T(1);\t\nreverse(list(1))[i] :=\n\tlet\n\t\trange := - ((1 ... size(list)) - (size(list) + 1));\n\tin\n\t\tlist[i] foreach i within range;\n","language":"SequenceL"},{"code":"\"asdf\".reverse; # fdsa\n\"résumé niño\".reverse; # oñin émusér\n","language":"Sidef"},{"code":"BEGIN\n TEXT PROCEDURE REV(S); TEXT S;\n BEGIN\n TEXT T;\n INTEGER L,R;\n T :- COPY(S);\n L := 1; R := T.LENGTH;\n WHILE L < R DO\n BEGIN\n CHARACTER CL,CR;\n T.SETPOS(L); CL := T.GETCHAR;\n T.SETPOS(R); CR := T.GETCHAR;\n T.SETPOS(L); T.PUTCHAR(CR);\n T.SETPOS(R); T.PUTCHAR(CL);\n L := L+1;\n R := R-1;\n END;\n REV :- T;\n END REV;\n\n TEXT INP;\n INP :- \"asdf\";\n\n OUTTEXT(INP); OUTIMAGE;\n OUTTEXT(REV(INP)); OUTIMAGE;\nEND\n","language":"Simula"},{"code":"10 INPUT S$\n20 LET T$=\"\"\n30 FOR I=LEN S$ TO 1 STEP -1\n40 LET T$=T$+S$(I)\n50 NEXT I\n60 PRINT T$\n","language":"Sinclair-ZX81-BASIC"},{"code":"'asdf' reverse\n","language":"Slate"},{"code":"'asdf' reversed\n","language":"Slate"},{"code":"'asdf' reverse\n","language":"Smalltalk"},{"code":"'asdf' reversed\n","language":"Smalltalk"},{"code":"\toutput = reverse(reverse(\"reverse\"))\nend\n","language":"SNOBOL4"},{"code":"val str_reverse = implode o rev o explode;\nval string = \"asdf\";\nval reversed = str_reverse string;\n","language":"Standard-ML"},{"code":". scalar s=\"ARS LONGA VITA BREVIS\"\n. di strreverse(s)\nSIVERB ATIV AGNOL SRA\n. scalar s=\"Ἐν ἀρχῇ ἐποίησεν ὁ θεὸς τὸν οὐρανὸν καὶ τὴν γῆν\"\n. di ustrreverse(s)\nνῆγ νὴτ ὶακ νὸναρὐο νὸτ ςὸεθ ὁ νεσηίοπἐ ῇχρἀ νἘ\n","language":"Stata"},{"code":"$ \\$\n","language":"Stringle"},{"code":"func reverseString(s: String) -> String {\n return String(s.characters.reverse())\n}\nprint(reverseString(\"asdf\"))\nprint(reverseString(\"as⃝df̅\"))\n","language":"Swift"},{"code":"func reverseString(s: String) -> String {\n return String(reverse(s))\n}\nprintln(reverseString(\"asdf\"))\nprintln(reverseString(\"as⃝df̅\"))\n","language":"Swift"},{"code":"| reverse string\n\nc : 'abcdefghijklmnopqrstuvwxyz'\nd : ' '\n\n c []\n i\n #c j\n - j\n if i < j\n c.i d 1\n c.j c.i 1\n d c.j\n - j\n + i\n goif\n endif\n c []\n","language":"Symsyn"},{"code":"c : 'abcdefghijklmnopqrstuvwxyz'\n\n c []\n $s\n #c j\n if j > 0\n - j\n + c.j $s 1\n goif\n endif\n $s []\n","language":"Symsyn"},{"code":"templates reverse\n '$:[ $... ] -> $(last..first:-1)...;' !\nend reverse\n\n'asdf' -> reverse -> !OUT::write\n\n'\n' -> !OUT::write\n\n'as⃝df̅' -> reverse -> !OUT::write\n","language":"Tailspin"},{"code":"package require Tcl 8.5\nstring reverse asdf\n","language":"Tcl"},{"code":":Str1\n:For(I,1,length(Ans)-1\n:sub(Ans,2I,1)+Ans\n:End\n:sub(Ans,1,I→Str1\n","language":"TI-83-BASIC"},{"code":"prog: parse(str);\nstr: smark any(!<<>>) scopy str/done = { 1 2 };\ndone: ;\n","language":"TMG"},{"code":"when flag clicked\nask \"Say something...\" and wait\nset i to (length of answer)\nset inv to \"\"\nrepeat until i = 0\n\tset inv to (join (inv) (letter (i) of answer))\n\tchange i by -1\nend\nsay inv\n","language":"Tosh"},{"code":"#lang transd\n\nMainModule : {\n _start: (lambda (with s \"as⃝df̅\"\n (textout (reverse s))\n\n // reversing user input\n (textout \"\\nPlease, enter a string: \")\n (textout \"Input: \" (reverse (read s)))\n ))\n}\n","language":"Transd"},{"code":"FUNCTION reverse$(a$)\n LET b$ = \"\"\n FOR i = 1 TO LEN(a$)\n LET b$ = (a$)[i:i+1-1] & b$\n NEXT i\n LET reverse$ = b$\nEND FUNCTION\n\nLET s$ = \"asdf\"\nPRINT \"'\"; s$; \"' reversed is '\"; reverse$(s$); \"'\"\nEND\n","language":"True-BASIC"},{"code":"function reverse (s : string) : string\n var rs := \"\"\n for i : 0 .. length (s) - 1\n rs := rs + s (length (s) - i)\n end for\n result rs\nend reverse\n\nput reverse (\"iterative example\")\nput reverse (reverse (\"iterative example\"))\n","language":"Turing"},{"code":"function reverse (s : string) : string\n if s = \"\" then\n result s\n else\n result reverse (s (2 .. *)) + s (1)\n end if\nend reverse\n\nput reverse (\"recursive example\")\nput reverse (reverse (\"recursive example\"))\n","language":"Turing"},{"code":"$$ MODE TUSCRIPT\nSET input=\"was it really a big fat cat i saw\"\nSET reversetext=TURN (input)\nPRINT \"before: \",input\nPRINT \"after: \",reversetext\n","language":"TUSCRIPT"},{"code":"#!/bin/bash\nstr=abcde\n\nfor((i=${#str}-1;i>=0;i--)); do rev=\"$rev${str:$i:1}\"; done\n\necho $rev\n","language":"UNIX-Shell"},{"code":"str='i43go1342iu 23iu4o 23iu14i324y 2i13'\nrev <<< \"$str\"\n#rev is not built-in function, though is in /usr/bin/rev\n","language":"UNIX-Shell"},{"code":"``@c`d``s`|k`@c\n","language":"Unlambda"},{"code":"#import std\n\n#cast %s\n\nexample = ~&x 'asdf'\n\nverbose_example = reverse 'asdf'\n","language":"Ursala"},{"code":"const list =\n('\nHello world!\n你好世界！\nSalamu, Dunia!\nこんにちは世界！\n¡Hola Mundo!\nChào thế giới!\nHallo Welt!\n')\n\nfn main() {\n for line in list.split('\\n') {if line !='' {println(reverse_string(line))}}\n}\n\nfn reverse_string(word string) string {\n return word.runes().reverse().string()\n}\n","language":"V-(Vlang)"},{"code":"int main (string[] args) {\n\tif (args.length < 2) {\n\t\tstdout.printf (\"Please, input a string.\\n\");\n\t\treturn 0;\n\t}\n\tvar str = new StringBuilder ();\n\tfor (var i = 1; i < args.length; i++) {\n\t\tstr.append (args[i] + \" \");\n\t}\n\tstdout.printf (\"%s\\n\", str.str.strip ().reverse ());\n\treturn 0;\n}\n","language":"Vala"},{"code":"Public Function Reverse(aString as String) as String\n' returns the reversed string\ndim L as integer 'length of string\ndim newString as string\n\nnewString = \"\"\nL = len(aString)\nfor i = L to 1 step -1\n newString = newString & mid$(aString, i, 1)\nnext\nReverse = newString\nEnd Function\n","language":"VBA"},{"code":"Public Function RReverse(aString As String) As String\n'returns the reversed string\n'do it recursively: cut the string in two, reverse these fragments and put them back together in reverse order\nDim L As Integer 'length of string\nDim M As Integer 'cut point\n\nL = Len(aString)\nIf L <= 1 Then 'no need to reverse\n RReverse = aString\nElse\n M = Int(L / 2)\n RReverse = RReverse(Right$(aString, L - M)) & RReverse(Left$(aString, M))\nEnd If\nEnd Function\n","language":"VBA"},{"code":"WScript.Echo StrReverse(\"asdf\")\n","language":"VBScript"},{"code":"Reg_Empty(10)\nfor (BOL; !At_EOL; Char) {\n Reg_Copy_Block(10, CP, CP+1, INSERT)\n}\n","language":"Vedit-macro-language"},{"code":"BOL\nwhile (!At_EOL) {\n Block_Copy(EOL_pos-1, EOL_pos, DELETE)\n}\n","language":"Vedit-macro-language"},{"code":"Debug.Print VBA.StrReverse(\"Visual Basic\")\n","language":"Visual-Basic"},{"code":"#Const REDIRECTOUT = True\n\nModule Program\n Const OUTPATH = \"out.txt\"\n\n ReadOnly TestCases As String() = {\"asdf\", \"as⃝df̅\", \"Les Misérables\"}\n\n ' SIMPLE VERSION\n Function Reverse(s As String) As String\n Dim t = s.ToCharArray()\n Array.Reverse(t)\n Return New String(t)\n End Function\n\n ' EXTRA CREDIT VERSION\n Function ReverseElements(s As String) As String\n ' In .NET, a text element is series of code units that is displayed as one character, and so reversing the text\n ' elements of the string correctly handles combining character sequences and surrogate pairs.\n Dim elements = Globalization.StringInfo.GetTextElementEnumerator(s)\n Return String.Concat(AsEnumerable(elements).OfType(Of String).Reverse())\n End Function\n\n ' Wraps an IEnumerator, allowing it to be used as an IEnumerable.\n Iterator Function AsEnumerable(enumerator As IEnumerator) As IEnumerable\n Do While enumerator.MoveNext()\n Yield enumerator.Current\n Loop\n End Function\n\n Sub Main()\n Const INDENT = \" \"\n\n#If REDIRECTOUT Then\n Const OUTPATH = \"out.txt\"\n Using s = IO.File.Open(OUTPATH, IO.FileMode.Create),\n sw As New IO.StreamWriter(s)\n Console.SetOut(sw)\n#Else\n Try\n Console.OutputEncoding = Text.Encoding.ASCII\n Console.OutputEncoding = Text.Encoding.UTF8\n Console.OutputEncoding = Text.Encoding.Unicode\n Catch ex As Exception\n Console.WriteLine(\"Failed to set console encoding to Unicode.\" & vbLf)\n End Try\n#End If\n For Each c In TestCases\n Console.WriteLine(c)\n Console.WriteLine(INDENT & \"SIMPLE: \" & Reverse(c))\n Console.WriteLine(INDENT & \"ELEMENTS: \" & ReverseElements(c))\n Console.WriteLine()\n Next\n#If REDIRECTOUT Then\n End Using\n#End If\n End Sub\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"(rev \"asdf\")\n","language":"Wart"},{"code":"; the @rev operator reverses strings and arrays\n@rev \"abc\" ; returns \"cba\"\n; or the same thing using a pointer expression\n!~r \"abc\"\n","language":"Wortel"},{"code":"import \"./str\" for Str\nimport \"./upc\" for Graphemes\n\nfor (word in [\"asdf\", \"josé\", \"møøse\", \"was it a car or a cat I saw\", \"😀🚂🦊\"]) {\n System.print(Str.reverse(word))\n}\n\nfor (word in [\"as⃝df̅\", \"ℵΑΩ 駱駝道 🤔 🇸🇧 🇺🇸 🇬🇧 👨👩👧👦🆗🗺\"]) {\n System.print(Graphemes.new(word).toList[-1..0].join())\n}\n","language":"Wren"},{"code":"PROGRAM\t\"progname\"\nVERSION\t\"0.0000\"\n\nDECLARE FUNCTION Entry ()\nDECLARE FUNCTION reverse$ (a$)\n\nFUNCTION Entry ()\n s$ = \"asdf\"\n PRINT \"'\"; s$; \"' reversed is '\"; reverse$(s$); \"'\"\nEND FUNCTION\n\nFUNCTION reverse$ (a$)\n b$ = \"\"\n FOR i = 1 TO LEN(a$)\n b$ = MID$(a$, i, 1) + b$\n NEXT i\n RETURN b$\nEND FUNCTION\nEND PROGRAM\n","language":"XBasic"},{"code":"log(string.reverse(\"Hello\"))\n","language":"XBS"},{"code":"log(\"Hello\"->split(\"\")->reverse()->join(\"\"));\n","language":"XBS"},{"code":"func ReverseString(String){\n\tset Final = \"\";\n\tfor(i=?String-1;0;-1){\n\t\tFinal+=String[i];\n\t}\n\tsend Final;\n}\nlog(ReverseString(\"Hello\"));\n","language":"XBS"},{"code":"include c:\\cxpl\\codes; \\intrinsic 'code' declarations\nstring 0; \\use zero-terminated strings, instead of MSb terminated\n\nfunc StrLen(Str); \\Return the number of characters in an ASCIIZ string\nchar Str;\nint I;\nfor I:= 0 to -1>>1-1 do\n if Str(I) = 0 then return I;\n\nfunc RevStr(S); \\Reverse the order of the bytes in a string\nchar S;\nint L, I, T;\n[L:= StrLen(S);\nfor I:= 0 to L/2-1 do\n [T:= S(I); S(I):= S(L-I-1); S(L-I-1):= T];\nreturn S;\n];\n\n[Text(0, RevStr(\"a\")); CrLf(0);\n Text(0, RevStr(\"ab\")); CrLf(0);\n Text(0, RevStr(\"abc\")); CrLf(0);\n Text(0, RevStr(\"Able was I ere I saw Elba.\")); CrLf(0);\n]\n","language":"XPL0"},{"code":"s$ = \"asdf\"\nprint \"'\", s$, \"' reversed is '\", reverse$(s$), \"'\"\nend\n\nsub reverse$(a$)\n\tb$ = \"\"\n\tfor i = 1 to len(a$)\n\t\tb$ = mid$(a$, i, 1) + b$\n\tnext i\n\treturn b$\nend sub\n","language":"Yabasic"},{"code":"strchar(strchar(\"asdf\")(:-1)(::-1))\n","language":"Yorick"},{"code":"PrintChar equ $BB5A ;Amstrad CPC bios call\nTerminator equ 0 ;null terminator for strings\n\n\norg $8000\nld hl, StringA\ncall ReverseString\n\nld hl, StringA\ncall PrintString\n\nret ;return to basic\n\nStringA:\nbyte \"12345678\",0\n\n;;;; SUBROUTINES\nGetStringLength:\n;HL = STRING. RETURNS LENGTH IN B. LENGTH IS ONE-INDEXED AND DOES NOT INCLUDE TERMINATOR.\n\t\tld b,0 ;clear B\nloop_getStringLength:\n\t\tld a,(hl) ;read the next char\n\t\tcp Terminator ;is it the terminator?\n\t\tret z ;if so, exit\n\t\tinc hl ;point HL to next character\n\t\tinc b ;increase tally\n\t\tjr loop_getStringLength ;repeat\n\nReverseString:\n\t;reverse the order of letters in a text string.\n\t;e.g. \"ABCD\" -> \"DCBA\"\n\t;the terminator stays put.\n\t;INPUT: HL = SOURCE ADDRESS OF STRING\n\tpush de\n\t\tpush hl\n\t\t\tpush hl\n\t\t call GetStringLength\n\t\t\tpop hl\n\t\tpop de\t\t ;LD DE,HL\n\t\tLD a,b ;LOAD B INTO A\n\t\tLD (SMC_ReverseString+1),a ;STORE IT LATER IN THE CODE SO WE CAN RETRIEVE IT.\n\t\t\n; TO RECAP, BOTH HL AND DE POINT TO THE BEGINNING OF THE STRING WE WANT TO REVERSE. B EQUALS THE LENGTH OF THE STRING.\n; B HAS BEEN BACKED UP WITHOUT USING THE STACK BY STORING IT AS THE OPERAND OF A LATER INSTRUCTION THAT LOADS B WITH A NUMERIC VALUE.\n; PUSH BC WOULD NOT HAVE WORKED SINCE THE PROGRAM NEEDS TO PUSH EACH LETTER OF THE STRING DURING THE LOOP.\n\nLOOP_REVERSESTRING_PUSH:\n;start at the beginning of the string and push each letter in it, except the terminator.\n\t\tld a,(de)\n\t\tpush af\n\t\tinc de\n\t\tdjnz LOOP_REVERSESTRING_PUSH\n\t\t\nSMC_ReverseString:\n\t\tld b,$42\t;LETS US PRESERVE B WITHOUT PUSHING IT. THE $42 IS OVERWRITTEN WITH THE STRING'S LENGTH.\n\t\t\nLOOP_REVERSESTRING_POP:\n;Starting at the beginning of the string, pop A off the stack and store it into the string. This puts the letters back in the reverse\n; order.\n\t\tpop af\n\t\tld (hl),a\n\t\tinc hl\n\t\tdjnz LOOP_REVERSESTRING_POP\n\tpop de\n\tret\n","language":"Z80-Assembly"},{"code":"var s = \"socat\".*;\nstd.mem.reverse(u8, &s);\n","language":"Zig"},{"code":"var s = \"socat\".*;\nstd.mem.reverse(u8, s[0..]);\n","language":"Zig"},{"code":"program: reverse_string\n input: xyzzy\n output: yzzyx\n","language":"Zoea"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Reverse_a_string\\nnote: String manipulation\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nTake a string and reverse it.\\n\\nFor example, \\\"asdf\\\" becomes \\\"fdsa\\\".\\n\\n\\n;Extra credit:\\nPreserve Unicode combining characters. \\n\\nFor example, \\\"as⃝df̅\\\" becomes \\\"f̅ds⃝a\\\", not \\\"̅fd⃝sa\\\".\\n\\n\\n{{Template:Strings}}\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"}:r: Start reader loop.\\n !~>& Push a character to the \\\"stack\\\".\\n <:a:=- Stop reading on newline.\\n^:r:\\n@> Rotate the newline to the end and enqueue a sentinel 0.\\n{~ Dequeue and rotate the first character into place.\\n}:p:\\n ${~ Print the current character until it's 0.\\n^:p:\\n#:r: Read again.\\n\",\n \"language\": \"0815\"\n },\n {\n \"code\": \"echo -e \\\"foo\\\\nbar\\\" | 0815 rev.0\\noof\\nrab\\n\",\n \"language\": \"0815\"\n },\n {\n \"code\": \"reversed(string)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Reverse a string 21/05/2016\\nREVERSE CSECT\\n USING REVERSE,R13 base register\\n B 72(R15) skip savearea\\n DC 17F'0' savearea\\n STM R14,R12,12(R13) prolog\\n ST R13,4(R15) \\\"\\n ST R15,8(R13) \\\"\\n LR R13,R15 \\\"\\n MVC TMP(L'C),C tmp=c\\n LA R8,C @c[1]\\n LA R9,TMP+L'C-1 @tmp[n-1]\\n LA R6,1 i=1\\n LA R7,L'C n=length(c)\\nLOOPI CR R6,R7 do i=1 to n\\n BH ELOOPI leave i\\n MVC 0(1,R8),0(R9) substr(c,i,1)=substr(tmp,n-i+1,1)\\n LA R8,1(R8) @c=@c+1\\n BCTR R9,0 @tmp=@tmp-1\\n LA R6,1(R6) i=i+1\\n B LOOPI next i\\nELOOPI XPRNT C,L'C print c\\n L R13,4(0,R13) epilog\\n LM R14,R12,12(R13) \\\"\\n XR R15,R15 \\\"\\n BR R14 exit\\nC DC CL12'edoC attesoR'\\nTMP DS CL12\\n REGEQU\\n END REVERSE\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"* Reverse a string 25/04/2020\\nREVERSEI CSECT\\n USING REVERSEI,R13 base register\\n B 72(R15) skip savearea\\n DC 17F'0' savearea\\n STM R14,R12,12(R13) prolog\\n ST R13,4(R15) \\\"\\n ST R15,8(R13) \\\"\\n LR R13,R15 \\\"\\n MVCIN BB,AA+L'AA-1\\n XPRNT BB,L'BB print bb\\n L R13,4(0,R13) epilog\\n LM R14,R12,12(R13) \\\"\\n XR R15,R15 \\\"\\n BR R14 exit\\nAA DC CL12'edoC attesoR' a\\nBB DS CL(L'AA) b\\n REGEQU\\n END REVERSEI\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"\\t\\torg\\t100h\\n\\t\\tjmp\\ttest\\n\\n\\t\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t\\t;; Reverse a string under HL in place\\n\\t\\t;; strrev0: reverse a zero-terminated string\\n\\t\\t;; strrev: reverse a string terminated by the value in A\\n\\t\\t;; arrayrev: reverse bytes starting at DE and ending at HL\\n\\t\\t;; Destroys a, b, d, e, h, l registers.\\n\\nstrrev0:\\txra\\ta\\t; Zero A\\nstrrev:\\t\\tmov\\td,h\\t; Copy string begin to DE\\n\\t\\tmov\\te,l\\n\\t\\tdcx\\th\\t\\nstrrev_end:\\tinx\\th\\t; Find string end in HL\\n\\t\\tcmp\\tm\\n\\t\\tjnz\\tstrrev_end\\n\\t\\tdcx\\th\\t; Point HL to last character\\narrayrev:\\tmov\\ta,h\\t; If HL<DE, we're done\\n\\t\\tcmp\\td\\t\\t\\n\\t\\trc\\n\\t\\tmov\\ta,l\\n\\t\\tcmp\\te\\n\\t\\trc\\n\\t\\tldax\\td\\t; Get low character in string\\n\\t\\tmov\\tb,m\\t; Get high character in string\\n\\t\\tmov\\tm,a\\t; Swap them\\n\\t\\tmov\\ta,b\\n\\t\\tstax\\td\\n\\t\\tinx\\td\\t; Move the low pointer up,\\n\\t\\tdcx\\th\\t; and the high pointer down\\n\\t\\tjmp\\tarrayrev\\n\\n\\t\\t\\n\\t\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t\\t;; Test code (CP/M): ask the user for a string, and reverse it\\n\\t\\t\\nprompt:\\t\\tdb\\t\\\" :gnirts a retne esaelP$\\\"\\nbufdef:\\t\\tdb\\t127, 0\\nbuf:\\t\\tds\\t128\\t\\t; one extra byte that will remain 0\\n\\nnewline:\\tlxi\\td,newline_str\\n\\t\\tmvi\\tc,9\\n\\t\\tjmp\\t5\\nnewline_str:\\tdb\\t13, 10, \\\"$\\\"\\n\\ntest:\\t\\t;; Reverse and output the prompt\\n\\t\\tmvi\\ta,'$'\\t\\t; CP/M string is $-terminated\\n\\t\\tlxi\\th,prompt\\t; Reverse the string\\n\\t\\tcall\\tstrrev\\n\\t\\tlxi\\td,prompt\\t; Output the string\\n\\t\\tmvi\\tc,9\\n\\t\\tcall\\t5\\n\\t\\t\\n\\t\\t;; Get input and reverse it\\n\\t\\tlxi\\td,bufdef\\t\\n\\t\\tmvi\\tc,10\\n\\t\\tcall\\t5\\n\\t\\tcall\\tnewline\\n\\t\\tlxi\\th,buf\\n\\t\\tcall\\tstrrev0\\t\\t; 0-terminated due to buffer definition\\n\\t\\t\\n\\t\\t;; Output reversed input\\n\\t\\tlxi\\th,buf\\nloop:\\t\\tmov\\te,m\\t\\t\\n\\t\\txra\\ta\\n\\t\\tora\\te\\n\\t\\trz\\t\\t\\t; Stop when done\\n\\t\\tmvi\\tc,2\\n\\t\\tpush\\th\\n\\t\\tcall\\t5\\n\\t\\tpop\\th\\n\\t\\tinx\\th\\n\\t\\tjmp\\tloop\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \"\\\"abc\\\" s:rev\\n\",\n \"language\": \"8th\"\n },\n {\n \"code\": \"(reverse \\\"hello\\\")\\n\",\n \"language\": \"ACL2\"\n },\n {\n \"code\": \"PROC Reverse(CHAR ARRAY src,dst)\\n BYTE i,j\\n\\n i=1 j=src(0) dst(0)=j\\n WHILE j>0\\n DO\\n dst(j)=src(i)\\n i==+1 j==-1\\n OD\\nRETURN\\n\\nPROC Test(CHAR ARRAY src)\\n CHAR ARRAY dst(40)\\n\\n Reverse(src,dst)\\n PrintF(\\\"'%S' -> '%S'%E\\\",src,dst)\\nRETURN\\n\\nPROC Main()\\n Test(\\\"Hello World!\\\")\\n Test(\\\"123456789\\\")\\n Test(\\\"!noitcA iratA\\\")\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"function reverseString(string:String):String\\n{\\n\\tvar reversed:String = new String();\\n\\tfor(var i:int = string.length -1; i >= 0; i--)\\n\\t\\treversed += string.charAt(i);\\n\\treturn reversed;\\n}\\n\\nfunction reverseStringCQAlternative(string:String):String\\n{\\n\\treturn string.split('').reverse().join('');\\n}\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\n\\nprocedure Reverse_String is\\n function Reverse_It (Item : String) return String is\\n Result : String (Item'Range);\\n begin\\n for I in Item'range loop\\n Result (Result'Last - I + Item'First) := Item (I);\\n end loop;\\n return Result;\\n end Reverse_It;\\nbegin\\n Put_Line (Reverse_It (Get_Line));\\nend Reverse_String;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"module ReverseString where\\n\\nopen import Data.String using (String ; fromList ; toList)\\nopen import Data.List using (reverse)\\n\\nreverse-string : String → String\\nreverse-string s = fromList (reverse (toList s))\\n\",\n \"language\": \"Agda\"\n },\n {\n \"code\": \"o_(b_reverse(\\\"Hello, World!\\\"), \\\"\\\\n\\\");\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"PROC reverse = (REF STRING s)VOID:\\n FOR i TO UPB s OVER 2 DO\\n CHAR c = s[i];\\n s[i] := s[UPB s - i + 1];\\n s[UPB s - i + 1] := c\\n OD;\\n\\nmain:\\n(\\n STRING text := \\\"Was it a cat I saw\\\";\\n reverse(text);\\n print((text, new line))\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <hopper.h>\\n\\nmain:\\n s=\\\"mañana será otro día\\\"\\n reverse(s),strtoutf8, println\\n{0}return\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"String str = 'Hello World!';\\nstr = str.reverse();\\nsystem.debug(str);\\n\",\n \"language\": \"Apex\"\n },\n {\n \"code\": \" ⌽'asdf'\\nfdsa\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"reverseString(\\\"Hello World!\\\")\\n\\non reverseString(str)\\n reverse of characters of str as string\\nend reverseString\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"reverseString(\\\"Hello World!\\\")\\n\\non reverseString(str)\\n set astid to AppleScript's text item delimiters\\n set AppleScript's text item delimiters to \\\"\\\"\\n set reversedString to reverse of characters of str as text\\n set AppleScript's text item delimiters to astid\\n return reversedString\\nend reverseString\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"-- Using either a generic foldr(f, a, xs)\\n\\n-- reverse1 :: [a] -> [a]\\non reverse1(xs)\\n script rev\\n on |λ|(a, x)\\n a & x\\n end |λ|\\n end script\\n\\n if class of xs is text then\\n foldr(rev, {}, xs) as text\\n else\\n foldr(rev, {}, xs)\\n end if\\nend reverse1\\n\\n-- or the built-in reverse method for lists\\n\\n-- reverse2 :: [a] -> [a]\\non reverse2(xs)\\n if class of xs is text then\\n (reverse of characters of xs) as text\\n else\\n reverse of xs\\n end if\\nend reverse2\\n\\n\\n-- TESTING reverse1 and reverse2 with same string and list ---------------------------------------------------------------------------\\non run\\n script test\\n on |λ|(f)\\n map(f, [\\\"Hello there !\\\", {1, 2, 3, 4, 5}])\\n end |λ|\\n end script\\n\\n map(test, [reverse1, reverse2])\\nend run\\n\\n\\n-- GENERIC FUNCTIONS ---------------------------------------------------------------------------\\n\\n-- foldr :: (a -> b -> a) -> a -> [b] -> a\\non foldr(f, startValue, xs)\\n tell mReturn(f)\\n set v to startValue\\n set lng to length of xs\\n repeat with i from lng to 1 by -1\\n set v to |λ|(v, item i of xs, i, xs)\\n end repeat\\n return v\\n end tell\\nend foldr\\n\\n-- map :: (a -> b) -> [a] -> [b]\\non map(f, xs)\\n tell mReturn(f)\\n set lng to length of xs\\n set lst to {}\\n repeat with i from 1 to lng\\n set end of lst to |λ|(item i of xs, i, xs)\\n end repeat\\n return lst\\n end tell\\nend map\\n\\n-- Lift 2nd class handler function into 1st class script wrapper\\n-- mReturn :: Handler -> Script\\non mReturn(f)\\n if class of f is script then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{{\\\"! ereht olleH\\\", {5, 4, 3, 2, 1}},\\n {\\\"! ereht olleH\\\", {5, 4, 3, 2, 1}}}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"10 A$ = \\\"THE FIVE BOXING WIZARDS JUMP QUICKLY\\\"\\n20 GOSUB 100REVERSE\\n30 PRINT R$\\n40 END\\n\\n100 REMREVERSE A$\\n110 R$ = \\\"\\\"\\n120 FOR I = 1 TO LEN(A$)\\n130 R$ = MID$(A$, I, 1) + R$\\n140 NEXT I\\n150 RETURN\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"str: \\\"Hello World\\\"\\n\\nprint reverse str\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"MsgBox % reverse(\\\"asdf\\\")\\n\\nreverse(string)\\n{\\n Loop, Parse, string\\n reversed := A_LoopField . reversed\\n Return reversed\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"Reverse(String){ ; credit to Rseding91\\n If (A_IsUnicode){\\n SLen := StrLen(String) * 2\\n VarSetCapacity(RString,SLen)\\n\\n Loop,Parse,String\\n NumPut(Asc(A_LoopField),RString,SLen-(A_Index * 2),\\\"UShort\\\")\\n } Else {\\n SLen := StrLen(String)\\n VarSetCapacity(RString,SLen)\\n\\n Loop,Parse,String\\n NumPut(Asc(A_LoopField),RString,SLen-A_Index,\\\"UChar\\\")\\n }\\n\\n VarSetCapacity(RString,-1)\\n\\n Return RString\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#AutoIt Version: 3.2.10.0\\n$mystring=\\\"asdf\\\"\\n$reverse_string = \\\"\\\"\\n$string_length = StringLen($mystring)\\n\\nFor $i = 1 to $string_length\\n $last_n_chrs = StringRight($mystring, $i)\\n $nth_chr = StringTrimRight($last_n_chrs, $i-1)\\n $reverse_string= $reverse_string & $nth_chr\\nNext\\n\\nMsgBox(0, \\\"Reversed string is:\\\", $reverse_string)\\n\",\n \"language\": \"AutoIt\"\n },\n {\n \"code\": \"\\\"asfd\\\" reversed\\n\",\n \"language\": \"Avail\"\n },\n {\n \"code\": \"function reverse(s)\\n{\\n p = \\\"\\\"\\n for(i=length(s); i > 0; i--) { p = p substr(s, i, 1) }\\n return p\\n}\\n\\nBEGIN {\\n print reverse(\\\"edoCattesoR\\\")\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"function reverse(s ,l)\\n{\\n l = length(s)\\n return l < 2 ? s:( substr(s,l,1) reverse(substr(s,1,l-1)) )\\n}\\n\\nBEGIN {\\n print reverse(\\\"edoCattesoR\\\")\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"# Usage: awk -f reverse.awk -v s=Rosetta\\n\\nfunction rev(s, i,len,a,r) {\\n len = split(s, a, \\\"\\\")\\n #for (i in a) r = a[i] r\\t# may not work - order is not guaranteed !\\n for (i=1; i<=len; i++) r = a[i] r\\n return r\\n}\\nBEGIN {\\n if(!s) s = \\\"Hello, world!\\\"\\n print s, \\\"<-->\\\", rev(s)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"strrev: { str2ar ar2ls reverse ls2lf ar2str }\\n\",\n \"language\": \"Babel\"\n },\n {\n \"code\": \"OPTION UTF8 TRUE\\ns$ = \\\"asdf\\\"\\nPRINT REVERSE$(s$)\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"s = \\\"asdf\\\"\\nprint \\\"'\\\"; s; \\\"' reversed is '\\\"; reverse(s); \\\"'\\\"\\nend\\n\\nfunction reverse(a)\\n\\tb = \\\"\\\"\\n\\tfor i = 1 to length(a)\\n\\t\\tb = mid(a, i, 1) + b\\n\\tnext i\\n\\treturn b\\nend function\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off\\nsetlocal enabledelayedexpansion\\ncall :reverse %1 res\\necho %res%\\ngoto :eof\\n\\n:reverse\\nset str=%~1\\nset cnt=0\\n:loop\\nif \\\"%str%\\\" equ \\\"\\\" (\\n\\tgoto :eof\\n\\t)\\nset chr=!str:~0,1!\\nset str=%str:~1%\\nset %2=%chr%!%2!\\ngoto loop\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" PRINT FNreverse(\\\"The five boxing wizards jump quickly\\\")\\n END\\n\\n DEF FNreverse(A$)\\n LOCAL B$, C%\\n FOR C% = LEN(A$) TO 1 STEP -1\\n B$ += MID$(A$,C%,1)\\n NEXT\\n = B$\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"using System;\\n\\nnamespace System\\n{\\n\\textension String\\n\\t{\\n\\t\\tpublic void Reverse()\\n\\t\\t{\\n\\t\\t\\tint i = 0;\\n\\t\\t\\tint j = mLength - 1;\\n\\t\\t\\twhile (i < j)\\n\\t\\t\\t{\\n\\t\\t\\t\\tSwap!(Ptr[i++], Ptr[j--]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nnamespace StringReverse\\n{\\n\\tclass Program\\n\\t{\\n\\t\\tstatic void Main()\\n\\t\\t{\\n\\t\\t\\tString s = scope .(\\\"abcdef\\\");\\n\\t\\t\\ts.Reverse();\\n\\t\\t\\tConsole.WriteLine(s);\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"Beef\"\n },\n {\n \"code\": \"55+~>:48>*#8\\\\#4`#:!#<#~_$>:#,_@\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \" ⌽\\\"racecar\\\"\\n\\\"racecar\\\"\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \" ( reverse\\n = L x\\n . :?L\\n & @( !arg\\n : ?\\n ( %?x\\n & utf$!x\\n & !x !L:?L\\n & ~`\\n )\\n ?\\n )\\n | str$!L\\n )\\n& out$reverse$Ελληνικά\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"[-]>,[>,]<[.<]\\n\",\n \"language\": \"Brainf---\"\n },\n {\n \"code\": \",----- ----- [+++++ +++++ > , ----- -----]\\tIf a newline is hit counter will be zero and input loop ends\\n<[.<]\\trun all chars backwards and print them\\n\\njust because it looks good we print CRLF\\n+++++ +++++ +++ . --- .\\n\",\n \"language\": \"Brainf---\"\n },\n {\n \"code\": \"p \\\"olleh\\\".reverse #Prints \\\"hello\\\"\\n\",\n \"language\": \"Brat\"\n },\n {\n \"code\": \"\\\"Hello, world!\\\"<-\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <locale.h>\\n#include <wchar.h>\\n\\nconst char *sa = \\\"abcdef\\\";\\nconst char *su = \\\"as⃝df̅\\\"; /* Should be in your native locale encoding. Mine is UTF-8 */\\n\\nint is_comb(wchar_t c)\\n{\\n\\tif (c >= 0x300 && c <= 0x36f) return 1;\\n\\tif (c >= 0x1dc0 && c <= 0x1dff) return 1;\\n\\tif (c >= 0x20d0 && c <= 0x20ff) return 1;\\n\\tif (c >= 0xfe20 && c <= 0xfe2f) return 1;\\n\\treturn 0;\\n}\\n\\nwchar_t* mb_to_wchar(const char *s)\\n{\\n\\twchar_t *u;\\n\\tsize_t len = mbstowcs(0, s, 0) + 1;\\n\\tif (!len) return 0;\\n\\n\\tu = malloc(sizeof(wchar_t) * len);\\n\\tmbstowcs(u, s, len);\\n\\treturn u;\\n}\\n\\nwchar_t* ws_reverse(const wchar_t* u)\\n{\\n\\tsize_t len, i, j;\\n\\twchar_t *out;\\n\\tfor (len = 0; u[len]; len++);\\n\\tout = malloc(sizeof(wchar_t) * (len + 1));\\n\\tout[len] = 0;\\n\\tj = 0;\\n\\twhile (len) {\\n\\t\\tfor (i = len - 1; i && is_comb(u[i]); i--);\\n\\t\\twcsncpy(out + j, u + i, len - i);\\n\\t\\tj += len - i;\\n\\t\\tlen = i;\\n\\t}\\n\\treturn out;\\n}\\n\\nchar *mb_reverse(const char *in)\\n{\\n\\tsize_t len;\\n\\tchar *out;\\n\\twchar_t *u = mb_to_wchar(in);\\n\\twchar_t *r = ws_reverse(u);\\n\\tlen = wcstombs(0, r, 0) + 1;\\n\\tout = malloc(len);\\n\\twcstombs(out, r, len);\\n\\tfree(u);\\n\\tfree(r);\\n\\treturn out;\\n}\\n\\nint main(void)\\n{\\n\\tsetlocale(LC_CTYPE, \\\"\\\");\\n\\n\\tprintf(\\\"%s => %s\\\\n\\\", sa, mb_reverse(sa));\\n\\tprintf(\\\"%s => %s\\\\n\\\", su, mb_reverse(su));\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <glib.h>\\ngchar *srev (const gchar *s) {\\n if (g_utf8_validate(s,-1,NULL)) {\\n return g_utf8_strreverse (s,-1);\\n} }\\n// main\\nint main (void) {\\n const gchar *t=\\\"asdf\\\";\\n const gchar *u=\\\"as⃝df̅\\\";\\n printf (\\\"%s\\\\n\\\",srev(t));\\n printf (\\\"%s\\\\n\\\",srev(u));\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <string>\\n#include <iostream>\\n#include <algorithm>\\n\\nint main() {\\n std::string s;\\n std::getline(std::cin, s);\\n std::reverse(s.begin(), s.end()); // modifies s\\n std::cout << s << '\\\\n';\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"static string ReverseString(string input)\\n{\\n char[] inputChars = input.ToCharArray();\\n Array.Reverse(inputChars);\\n return new string(inputChars);\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System.Linq;\\n\\n// ...\\n\\nreturn new string(input.Reverse().ToArray());\\n\\n// ...\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"public string ReverseElements(string s)\\n{\\n // In .NET, a text element is series of code units that is displayed as one character, and so reversing the text\\n // elements of the string correctly handles combining character sequences and surrogate pairs.\\n var elements = System.Globalization.StringInfo.GetTextElementEnumerator(s);\\n return string.Concat(AsEnumerable(elements).OfType<string>().Reverse());\\n}\\n\\n// Wraps an IEnumerator, allowing it to be used as an IEnumerable.\\npublic IEnumerable AsEnumerable(IEnumerator enumerator)\\n{\\n while (enumerator.MoveNext())\\n yield return enumerator.Current;\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"shared void run() {\\n\\n while(true) {\\n process.write(\\\"> \\\");\\n String? text = process.readLine();\\n if (is String text) {\\n print(text.reversed);\\n }\\n else {\\n break;\\n }\\n }\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"FUNCTION Reverse(sIn)\\n LOCAL sOut := \\\"\\\", i\\n FOR i := Len(sIn) TO 1 STEP -1\\n sOut += Substr(sIn, i, 1)\\n NEXT\\nRETURN sOut\\n\",\n \"language\": \"Clipper\"\n },\n {\n \"code\": \"(defn reverse-string [s]\\n \\\"Returns a string with all characters in reverse\\\"\\n (apply str (reduce conj '() s)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defn str-reverse [s] (apply str (reverse s)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(apply str (interpose \\\" \\\" (reverse (.split \\\"the quick brown fox\\\" \\\" \\\"))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defn combining? [c]\\n (let [type (Character/getType c)]\\n ;; currently hardcoded to the types taken from the sample string\\n (or (= type 6) (= type 7))))\\n\\n(defn group\\n \\\"Group normal characters with their combining characters\\\"\\n [chars]\\n (cond (empty? chars) chars\\n\\t(empty? (next chars)) (list chars)\\n\\t:else\\n\\t(let [dres (group (next chars))]\\n\\t (cond (combining? (second chars)) (cons (cons (first chars)\\n\\t\\t\\t\\t\\t\\t\\t(first dres))\\n\\t\\t\\t\\t\\t\\t (rest dres))\\n\\t\\t:else (cons (list (first chars)) dres)))))\\n\\n(defn str-reverse\\n \\\"Unicode-safe string reverse\\\"\\n [s]\\n (apply str (apply concat (reverse (group s)))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"reverse = proc (s: string) returns (string)\\n rslt: array[char] := array[char]$predict(1,string$size(s))\\n for c: char in string$chars(s) do\\n array[char]$addl(rslt,c)\\n end\\n return(string$ac2s(rslt))\\nend reverse\\n\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n stream$putl(po, reverse(\\\"!dlrow ,olleH\\\"))\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \"FUNCTION REVERSE('QWERTY')\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"\\\"qwerty\\\".split(\\\"\\\").reverse().join \\\"\\\"\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"<cfset myString = \\\"asdf\\\" />\\n<cfset myString = reverse( myString ) />\\n\",\n \"language\": \"ColdFusion\"\n },\n {\n \"code\": \"100 INPUT \\\"STRING\\\";S$\\n110 FOR I=1 TO INT(LEN(S$)/2)\\n120 : J=LEN(S$)+1-I\\n130 : T$=MID$(S$,I,1)\\n140 : MID$(S$,I,1) = MID$(S$,J,1)\\n150 : MID$(S$,J,1) = T$\\n160 NEXT I\\n170 PRINT S$\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"(reverse my-string)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"MODULE BbtReverseString;\\nIMPORT StdLog;\\n\\nPROCEDURE ReverseStr(str: ARRAY OF CHAR): POINTER TO ARRAY OF CHAR;\\nVAR\\n\\ttop,middle,i: INTEGER;\\n\\tc: CHAR;\\n\\trStr: POINTER TO ARRAY OF CHAR;\\nBEGIN\\n\\tNEW(rStr,LEN(str$) + 1);\\n\\ttop := LEN(str$) - 1; middle := (top - 1) DIV 2;\\n\\tFOR i := 0 TO middle DO\\n\\t\\trStr[i] := str[top - i];\\n\\t\\trStr[top - i] := str[i];\\n\\tEND;\\n\\tIF ODD(LEN(str$)) THEN rStr[middle + 1] := str[middle + 1] END;\\n\\tRETURN rStr;\\nEND ReverseStr;\\n\\nPROCEDURE Do*;\\nVAR\\n\\tx: CHAR;\\nBEGIN\\n\\tStdLog.String(\\\"'asdf' reversed:> \\\");StdLog.String(ReverseStr(\\\"asdf\\\"));StdLog.Ln\\nEND Do;\\nEND BbtReverseString.\\n\",\n \"language\": \"Component-Pascal\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\ninclude \\\"strings.coh\\\";\\n\\n# Reverse a string in place\\nsub StrRev(s: [uint8]): (r: [uint8]) is\\n r := s;\\n var e := s;\\n while [e] != 0 loop\\n e := @next e;\\n end loop;\\n e := @prev e;\\n while e > s loop\\n var c := [s];\\n [s] := [e];\\n [e] := c;\\n s := @next s;\\n e := @prev e;\\n end loop;\\nend sub;\\n\\n# Test\\nvar buf: uint8[32];\\nvar str: [uint8] := \\\"\\\\nesreveR\\\";\\nCopyString(str, &buf[0]);\\nprint(StrRev(&buf[0]));\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"# version 0.21.1\\n\\nstrings = [\\\"asdf\\\", \\\"as⃝df̅\\\"]\\nstrings.each do |s|\\n puts \\\"#{s} -> #{s.reverse}\\\"\\nend\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"void main() {\\n\\timport std.range, std.conv;\\n\\n\\tstring s1 = \\\"hello\\\"; // UTF-8\\n\\tassert(s1.retro.text == \\\"olleh\\\");\\n\\n\\twstring s2 = \\\"hello\\\"w; // UTF-16\\n\\tassert(s2.retro.wtext == \\\"olleh\\\"w);\\n\\n\\tdstring s3 = \\\"hello\\\"d; // UTF-32\\n\\tassert(s3.retro.dtext == \\\"olleh\\\"d);\\n\\n\\t// without using std.range:\\n\\tdstring s4 = \\\"hello\\\"d;\\n\\tassert(s4.dup.reverse == \\\"olleh\\\"d); // simple but inefficient (copies first, then reverses)\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"String reverse(String s) => new String.fromCharCodes(s.runes.toList().reversed);\\n\",\n \"language\": \"Dart\"\n },\n {\n \"code\": \"import 'package:unittest/unittest.dart';\\n\\nString reverse(String s) => new String.fromCharCodes(s.runes.toList().reversed);\\n\\nmain() {\\n group(\\\"Reverse a string -\\\", () {\\n test(\\\"Strings with ASCII characters are reversed correctly.\\\", () {\\n expect(reverse(\\\"hello, world\\\"), equals(\\\"dlrow ,olleh\\\"));\\n });\\n test(\\\"Strings with non-ASCII BMP characters are reversed correctly.\\\", () {\\n expect(reverse(\\\"\\\\u4F60\\\\u4EEC\\\\u597D\\\"), equals(\\\"\\\\u597D\\\\u4EEC\\\\u4F60\\\"));\\n });\\n test(\\\"Strings with non-BMP characters are reversed correctly.\\\", () {\\n expect(reverse(\\\"hello, \\\\u{1F310}\\\"), equals(\\\"\\\\u{1F310} ,olleh\\\"));\\n });\\n });\\n}\\n\",\n \"language\": \"Dart\"\n },\n {\n \"code\": \"K=\\nSTR_OUT=\\nFOR J=%TRIM(STR_IN) STEP -1 UNTIL 1\\nDO BEGIN\\n INCR K\\n STR_OUT(K:1)=STR_IN(J:1)\\n END\\n\",\n \"language\": \"DBL\"\n },\n {\n \"code\": \"22405534230753963835153736737 [ 256 ~ d SS 0<F LS SR 1+ ] d sF x 1 - [ 1 - d 0<F 256 * LR + ] d sF x P\\n\",\n \"language\": \"Dc\"\n },\n {\n \"code\": \"function ReverseString(const InString: string): string;\\nvar\\n i: integer;\\nbegin\\n for i := Length(InString) downto 1 do\\n Result := Result + InString[i];\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"StrUtils.ReverseString\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"function Reverse(const s: string): string;\\nvar\\n i, aLength, ahalfLength: Integer;\\n c: Char;\\nbegin\\n Result := s;\\n aLength := Length(s);\\n ahalfLength := aLength div 2;\\n if aLength > 1 then\\n for i := 1 to ahalfLength do\\n begin\\n c := result[i];\\n result[i] := result[aLength - i + 1];\\n result[aLength - i + 1] := c;\\n end;\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"/* Reverse string in place */\\nproc nonrec reverse(*char s) void:\\n *char e;\\n char t;\\n e := s;\\n while e* /= '\\\\e' do\\n e := e + 1\\n od;\\n while\\n e := e - 1;\\n s < e\\n do\\n t := e*;\\n e* := s*;\\n s* := t;\\n s := s + 1\\n od\\ncorp\\n\\nproc nonrec main() void:\\n *char testString = \\\"!dlrow ,olleH\\\";\\n reverse(testString);\\n writeln(testString)\\ncorp\\n\",\n \"language\": \"Draco\"\n },\n {\n \"code\": \"\\\"asdf\\\" rev\\n\",\n \"language\": \"Dt\"\n },\n {\n \"code\": \"let str = \\\"asdf\\\"\\n\\nfunc String.Reverse() {\\n var cs = []\\n let len = this.Length()\\n for n in 1..len {\\n cs.Add(this[len - n])\\n }\\n String(values: cs)\\n}\\n\\nstr.Reverse()\\n\",\n \"language\": \"Dyalect\"\n },\n {\n \"code\": \"pragma.enable(\\\"accumulator\\\")\\ndef reverse(string) {\\n return accum \\\"\\\" for i in (0..!(string.size())).descending() { _ + string[i] }\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"func$ reverse s$ .\\n a$[] = strchars s$\\n for i = 1 to len a$[] div 2\\n swap a$[i] a$[len a$[] - i + 1]\\n .\\n return strjoin a$[]\\n.\\nprint reverse \\\"hello\\\"\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"(define (string-reverse string)\\n (list->string (reverse (string->list string))))\\n\\n(string-reverse \\\"ghij\\\")\\n → jihg\\n(string-reverse \\\"un roc lamina l animal cornu\\\")\\n → unroc lamina l animal cor nu\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"function reverse( str string ) returns( string )\\n\\tresult string;\\n\\tfor ( i int from StrLib.characterLen( str ) to 1 decrement by 1 )\\n\\t\\tresult ::= str[i:i];\\n\\tend\\n\\treturn( result );\\nend\\n\",\n \"language\": \"EGL\"\n },\n {\n \"code\": \"class\\n APPLICATION\\ncreate\\n make\\nfeature\\n make\\n -- Demonstrate string reversal.\\n do\\n my_string := \\\"Hello World!\\\"\\n my_string.mirror\\n print (my_string)\\n end\\n my_string: STRING\\n -- Used for reversal\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"reverse_string str = rev len str\\n where len = length str\\n rev 0 str = \\\"\\\"\\n rev n str = toString (str : nn) +> rev nn str\\n where nn = n - 1\\n\\nreverse_string \\\"Hello\\\"\\n\",\n \"language\": \"Ela\"\n },\n {\n \"code\": \"open string\\nfromList <| reverse <| toList \\\"Hello\\\" ::: String\\n\",\n \"language\": \"Ela\"\n },\n {\n \"code\": \"import system'routines;\\nimport extensions;\\nimport extensions'text;\\n\\nextension extension\\n{\\n reversedLiteral()\\n = self.toArray().sequenceReverse().summarize(new StringWriter());\\n}\\n\\npublic program()\\n{\\n console.printLine(\\\"Hello World\\\".reversedLiteral())\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"IO.puts (String.reverse \\\"asdf\\\")\\nIO.puts (String.reverse \\\"as⃝df̅\\\")\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"module Main exposing (main)\\n\\nimport Html exposing (Html, text, div, p)\\nimport Html.Attributes exposing (style)\\n\\n\\nchange myText =\\n text (\\\"reverse \\\" ++ myText\\n ++ \\\" = \\\" ++ String.reverse myText)\\n\\n\\nmain =\\n div [style \\\"margin\\\" \\\"5%\\\", style \\\"font-size\\\" \\\"1.5em\\\"]\\n [change \\\"as⃝da\\\"\\n , p [] [change \\\"a⃝su-as⃝u\\\"]\\n , p [] [change \\\"Hello!\\\"]\\n ]\\n\",\n \"language\": \"Elm\"\n },\n {\n \"code\": \"(reverse \\\"Hello World\\\")\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"1> lists:reverse(\\\"reverse!\\\").\\n\\\"!esrever\\\"\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"reverse(Bin) ->\\n Size = size(Bin)*8,\\n <<T:Size/integer-little>> = Bin,\\n <<T:Size/integer-big>>.\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"PROGRAM REVERSE_STRING\\n\\nPROCEDURE REVERSE(A$->R$)\\n LOCAL I%\\n R$=\\\"\\\"\\n FOR I=1 TO LEN(A$) DO\\n R$=MID$(A$,I,1)+R$\\n END FOR\\nEND PROCEDURE\\n\\nBEGIN\\n A$=\\\"THE FIVE BOXING WIZARDS JUMP QUICKLY\\\"\\n REVERSE(A$->R$)\\n PRINT(R$)\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \">function strrev (s) := chartostr(fliplr(strtochar(s)))\\n>strrev(\\\"This is a test!\\\")\\n !tset a si sihT\\n\",\n \"language\": \"Euler\"\n },\n {\n \"code\": \"include std/sequence.e\\nprintf(1, \\\"%s\\\\n\\\", {reverse(\\\"abcdef\\\") })\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"## இந்த நிரல் தரப்படும் சரம் ஒன்றைத் தலைகீழாகத் திருப்பி அச்சிடும்\\n## உதாரணமாக \\\"abc\\\" என்ற சரம் தரப்பட்டால் அதனைத் திருப்பி \\\"cba\\\" என அச்சிடும்\\n## \\\"எழில்\\\" மொழியின்மூலம் இரண்டு வகைகளில் இதனைச் செய்யலாம். இரண்டு உதாரணங்களும் இங்கே தரப்பட்டுள்ளன\\n\\nநிரல்பாகம் திருப்புக (சரம்1)\\n\\n ## முதல் வகை\\n\\n சரம்2 = \\\"\\\"\\n\\n @( சரம்1 இல் இ) ஒவ்வொன்றாக\\n சரம்2 = இ + சரம்2\\n முடி\\n\\n பின்கொடு சரம்2\\n\\nமுடி\\n\\nநிரல்பாகம் மீண்டும்திருப்புக (சரம்1)\\n\\n ## இரண்டாம் வகை\\n\\n சரநீளம் = len(சரம்1)\\n\\n சரம்2 = \\\"\\\"\\n\\n @(எண் = 0, எண் < சரநீளம், எண் = எண் + 1) ஆக\\n\\n சரம்2 = எடு(சரம்1, எண்) + சரம்2\\n\\n முடி\\n\\n பின்கொடு சரம்2\\n\\nமுடி\\n\\n\\nஅ = உள்ளீடு(\\\"ஓர் எழுத்துச் சரத்தைத் தாருங்கள் \\\")\\n\\nபதிப்பி \\\"நீங்கள் தந்த எழுத்துச் சரம்\\\" அ\\n\\nபதிப்பி \\\"அதனை முதல் வகையில் திருப்பியுள்ளோம்: \\\" திருப்புக(அ)\\n\\nபதிப்பி \\\"வேறொரு வகையில் திருப்பியுள்ளோம்: \\\" மீண்டும்திருப்புக(அ)\\n\",\n \"language\": \"Ezhil\"\n },\n {\n \"code\": \"// Reverse a string. Nigel Galloway: August 14th., 2019\\nlet strRev α=let N=System.Globalization.StringInfo.GetTextElementEnumerator(α)\\n List.unfold(fun n->if n then Some(N.GetTextElement(),N.MoveNext()) else None)(N.MoveNext())|>List.rev|>String.concat \\\"\\\"\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"printfn \\\"%s\\\" (strRev \\\"as⃝df̅\\\")\\nprintfn \\\"%s\\\" (strRev \\\"Nigel\\\")\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"\\\"hello\\\" reverse\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"\\\"as⃝df̅\\\" string-reverse \\\"f̅ds⃝a\\\" = .\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"1_\\n[^$1_=~][]#%\\n[$1_=~][,]#\\n\",\n \"language\": \"FALSE\"\n },\n {\n \"code\": \"1_\\n[^$1_=~][\\n $$767>\\\\879\\\\>&\\n 1ø$7615>\\\\7620\\\\>&|\\n 1ø$8399>\\\\8428\\\\>&|\\n [\\\\]?\\n]#%\\n[$1_=~][,]#\\n\",\n \"language\": \"FALSE\"\n },\n {\n \"code\": \"\\\"hello world!\\\" reverse\\n\",\n \"language\": \"Fancy\"\n },\n {\n \"code\": \"Function StrRev1(ByVal $p1)\\n\\tdim $b = \\\"\\\"\\n\\tREPEAT len(p1)\\n\\t\\tb = b & RIGHT(p1,1)\\n\\t\\tp1 = LEFT(p1,LEN(p1)-1)\\n\\tEND REPEAT\\n\\treturn b\\nEnd Function\\n\",\n \"language\": \"FBSL\"\n },\n {\n \"code\": \"Function StrRev2(ByVal $p1)\\n\\tdim $b = \\\"\\\", %i\\n\\tfor i = len(p1) DOWNTO 1\\n\\t\\tb = b & MID(p1,i,1)\\n\\tnext\\n\\treturn b\\nEnd Function\\n\",\n \"language\": \"FBSL\"\n },\n {\n \"code\": \"Function StrRev3( $s )\\n\\tFOR DIM x = 1 TO LEN(s) \\\\ 2\\n\\t\\tPEEK(@s + LEN - x, $1)\\n\\t\\tPOKE(@s + LEN - x, s{x})(@s + x - 1, PEEK)\\n\\tNEXT\\n\\tRETURN s\\nend function\\n\",\n \"language\": \"FBSL\"\n },\n {\n \"code\": \"DynC StringRev($theString) As String\\n void rev(char *str)\\n {\\n\\t\\tint len = strlen(str);\\n\\t\\tchar *HEAD = str;\\n\\t\\tchar *TAIL = str + len - 1;\\n\\t\\tchar temp;\\n\\t\\tint i;\\n\\t\\tfor ( i = 0; i <= len / 2; i++, HEAD++, TAIL--) {\\n\\t\\t\\ttemp = *HEAD;\\n\\t\\t\\t*HEAD = *TAIL;\\n\\t\\t\\t*TAIL = temp;\\n\\t\\t}\\n }\\n char *main(char* theString)\\n {\\n rev(theString);\\n return theString;\\n }\\nEnd DynC\\n\",\n \"language\": \"FBSL\"\n },\n {\n \"code\": \"DYNASM RevStr(BYVAL s AS STRING) AS STRING\\n // get length of string\\n // divide by two\\n // setup pointers to head and tail\\n // iterate from 1 to (length \\\\ 2)\\n // swap head with tail\\n // increment head pointer\\n // decrement tail pointer\\n\\n ENTER 0, 0 // = PUSH EBP: MOV EBP, ESP\\n PUSH EBX // by Windows convention EBX, EDI, ESI must be saved before modification\\n\\n MOV EAX, s // get string pointer\\n MOV ECX, EAX // duplicate it\\n\\n .WHILE BYTE PTR [ECX] <> 0\\n\\n\\tINC ECX // propagate to tail\\n\\n .WEND\\n\\n MOV EDX, ECX // duplicate tail pointer\\n DEC EDX // set it to last byte before trailing zero\\n\\n SUB ECX, EAX // get length in ECX in 1 CPU cycle\\n SHR ECX, 1 // get length \\\\ 2 in 1 CPU cycle; that's the beauty of power-of-two division\\n\\n .WHILE ECX > 0\\n\\n MOV BL, [EDX] // no need to XOR; just overwrite BL and BH contents\\n MOV BH, [EAX] // DynAsm deduces data size from destination register sizes\\n\\n MOV [EDX], BH // ditto, source register sizes\\n MOV [EAX], BL\\n\\n INC EAX // propagate pointers\\n DEC EDX\\n\\n DEC ECX // decrement counter\\n\\n .WEND\\n\\n // point to start of string again\\n MOV EAX, s // MOV = 1 CPU cycle, PUSH + POP = 2 CPU cycles\\n\\n POP EBX // by Windows convention ESI, EDI, EBX must be restored if modified\\n LEAVE // = POP EBP\\n RET\\nEND DYNASM\\n\",\n \"language\": \"FBSL\"\n },\n {\n \"code\": \"#define MAXSTRINGLEN ( 1024 )\\n\\n/* chop string to list of single character strings */\\nstatic fe_Object* chop(fe_Context *ctx, fe_Object *args) {\\n char buf[MAXSTRINGLEN];\\n int len = fe_tostring(ctx, fe_nextarg(ctx, &args), buf, sizeof(buf));\\n int gc = fe_savegc(ctx);\\n args = fe_bool(ctx, 0);\\n while (len > 0) {\\n buf[len--] = '\\\\0';\\n args = fe_cons(ctx, fe_string(ctx, buf + len), args);\\n fe_restoregc(ctx, gc);\\n fe_pushgc(ctx, args);\\n }\\n return args;\\n}\\n\\n/* pack list of strings to single string */\\nstatic fe_Object* pack(fe_Context *ctx, fe_Object *args) {\\n char buf[MAXSTRINGLEN], *ptr = buf;\\n for (args = fe_nextarg(ctx, &args); !fe_isnil(ctx, args);) {\\n ptr += fe_tostring(ctx, fe_nextarg(ctx, &args), ptr, buf + sizeof(buf) - ptr);\\n }\\n return fe_string(ctx, buf);\\n}\\n\",\n \"language\": \"Fe\"\n },\n {\n \"code\": \"; reverse list\\n(= reverse (fn (lst)\\n (let res nil)\\n (while lst\\n (= res (cons (car lst) res))\\n (= lst (cdr lst)))\\n res))\\n\\n; chop string to list, reverse list and pack it back to string\\n(print (pack (reverse (chop \\\"Hello world!\\\"))))\\n\",\n \"language\": \"Fe\"\n },\n {\n \"code\": \"!dlrow olleH\\n\",\n \"language\": \"Fe\"\n },\n {\n \"code\": \"(let [example :asdf]\\n (string.reverse example) ; fdsa\\n (example:reverse) ; fdsa\\nnil)\\n\",\n \"language\": \"Fennel\"\n },\n {\n \"code\": \": exchange ( a1 a2 -- )\\n 2dup c@ swap c@ rot c! swap c! ;\\n: reverse ( c-addr u -- )\\n 1- bounds begin 2dup > while\\n 2dup exchange\\n -1 /string\\n repeat 2drop ;\\n\\ns\\\" testing\\\" 2dup reverse type \\\\ gnitset\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"\\\\ reverse a string using the data stack for temporary storage\\n\\n: mystring ( -- caddr len) S\\\" ABCDEFGHIJKLMNOPQRSTUVWXYZ987654321\\\" ;\\n\\n: pushstr ( caddr len -- c..c[n]) bounds do I c@ loop ;\\n: popstr ( c.. c[n] caddr len -- ) bounds do I c! loop ;\\n: reverse ( caddr len -- ) 2dup 2>r pushstr 2r> popstr ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": xreverse {: c-addr u -- c-addr2 u :}\\n u allocate throw u + c-addr swap over u + >r begin ( from to r:end)\\n\\tover r@ u< while\\n\\t over r@ over - x-size dup >r - 2dup r@ cmove\\n\\t swap r> + swap repeat\\n r> drop nip u ;\\n\\n\\\\ example use\\ns\\\" ώщыē\\\" xreverse type \\\\ outputs \\\"ēыщώ\\\"\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"PROGRAM Example\\n\\n CHARACTER(80) :: str = \\\"This is a string\\\"\\n CHARACTER :: temp\\n INTEGER :: i, length\\n\\n WRITE (*,*) str\\n length = LEN_TRIM(str) ! Ignores trailing blanks. Use LEN(str) to reverse those as well\\n DO i = 1, length/2\\n temp = str(i:i)\\n str(i:i) = str(length+1-i:length+1-i)\\n str(length+1-i:length+1-i) = temp\\n END DO\\n WRITE(*,*) str\\n\\nEND PROGRAM Example\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"program reverse_string\\n\\n implicit none\\n character (*), parameter :: string = 'no devil lived on'\\n\\n write (*, '(a)') string\\n write (*, '(a)') reverse (string)\\n\\ncontains\\n\\n recursive function reverse (string) result (res)\\n\\n implicit none\\n character (*), intent (in) :: string\\n character (len (string)) :: res\\n\\n if (len (string) == 0) then\\n res = ''\\n else\\n res = string (len (string) :) // reverse (string (: len (string) - 1))\\n end if\\n\\n end function reverse\\n\\nend program reverse_string\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" program reverse_string\\n implicit none\\n character (80) :: cadena\\n integer :: k, n\\n !\\n cadena = \\\"abcdefgh\\\"\\n n = len_trim (cadena)\\n !\\n write (*,*) cadena\\n forall (k=1:n) cadena (k:k) = cadena (n-k+1:n-k+1)\\n write (*,*) cadena\\n !\\nend program reverse_string\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nFunction ReverseString(s As Const String) As String\\n If s = \\\"\\\" Then Return s\\n Dim length As Integer = Len(s)\\n Dim r As String = Space(length)\\n For i As Integer = 0 To length - 1\\n r[i] = s[length - 1 - i]\\n Next\\n Return r\\nEnd Function\\n\\nDim s As String = \\\"asdf\\\"\\nPrint \\\"'\\\"; s; \\\"' reversed is '\\\"; ReverseString(s); \\\"'\\\"\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"println[reverse[\\\"abcdef\\\"]]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"fun main(s: []i32) = s[::-1]\\n\",\n \"language\": \"Futhark\"\n },\n {\n \"code\": \"void local fn DoIt\\n CFStringRef s1 = @\\\"asdf\\\", s2 = @\\\"\\\"\\n long index\\n for index = len(s1) - 1 to 0 step -1\\n s2 = fn StringByAppendingString( s2, mid(s1,index,1) )\\n next\\n print s1,s2\\nend fn\\n\\nwindow 1\\n\\nfn DoIt\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"Public Sub Main()\\nDim sString As String = \\\"asdf\\\"\\nDim sOutput As String\\nDim siCount As Short\\n\\nFor siCount = Len(sString) DownTo 1\\n sOutput &= Mid(sString, siCount, 1)\\nNext\\n\\nPrint sOutput\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"Reversed(\\\"abcdef\\\");\\n# \\\"fedcba\\\"\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"\\\\L<U>=@reverse{$1}\\n\",\n \"language\": \"Gema\"\n },\n {\n \"code\": \"\\\\L<U1><U>=@{$2}$1\\n\",\n \"language\": \"Gema\"\n },\n {\n \"code\": \"[indent=4]\\n/*\\n Reverse a string, in Genie\\n valac reverse.gs\\n*/\\n\\ninit\\n utf8:string = \\\"asdf\\\"\\n combining:string = \\\"asdf̅\\\"\\n\\n print utf8\\n print utf8.reverse()\\n\\n print combining\\n print combining.reverse()\\n\",\n \"language\": \"Genie\"\n },\n {\n \"code\": \"PRINT @reverse$(\\\"asdf\\\")\\n'\\nFUNCTION reverse$(string$)\\n LOCAL result$,i%\\n result$=\\\"\\\"\\n FOR i%=1 TO LEN(string$)\\n result$=MID$(string$,i%,1)+result$\\n NEXT i%\\n RETURN result$\\nENDFUNC\\n\",\n \"language\": \"GFA-Basic\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"unicode\\\"\\n \\\"unicode/utf8\\\"\\n)\\n\\n// no encoding\\nfunc reverseBytes(s string) string {\\n r := make([]byte, len(s))\\n for i := 0; i < len(s); i++ {\\n r[i] = s[len(s)-1-i]\\n }\\n return string(r)\\n}\\n\\n// reverseCodePoints interprets its argument as UTF-8 and ignores bytes\\n// that do not form valid UTF-8. return value is UTF-8.\\nfunc reverseCodePoints(s string) string {\\n r := make([]rune, len(s))\\n start := len(s)\\n for _, c := range s {\\n // quietly skip invalid UTF-8\\n if c != utf8.RuneError {\\n start--\\n r[start] = c\\n }\\n }\\n return string(r[start:])\\n}\\n\\n// reversePreservingCombiningCharacters interprets its argument as UTF-8\\n// and ignores bytes that do not form valid UTF-8. return value is UTF-8.\\nfunc reversePreservingCombiningCharacters(s string) string {\\n if s == \\\"\\\" {\\n return \\\"\\\"\\n }\\n p := []rune(s)\\n r := make([]rune, len(p))\\n start := len(r)\\n for i := 0; i < len(p); {\\n // quietly skip invalid UTF-8\\n if p[i] == utf8.RuneError {\\n i++\\n continue\\n }\\n j := i + 1\\n for j < len(p) && (unicode.Is(unicode.Mn, p[j]) ||\\n unicode.Is(unicode.Me, p[j]) || unicode.Is(unicode.Mc, p[j])) {\\n j++\\n }\\n for k := j - 1; k >= i; k-- {\\n start--\\n r[start] = p[k]\\n }\\n i = j\\n }\\n return (string(r[start:]))\\n}\\n\\nfunc main() {\\n test(\\\"asdf\\\")\\n test(\\\"as⃝df̅\\\")\\n}\\n\\nfunc test(s string) {\\n fmt.Println(\\\"\\\\noriginal: \\\", []byte(s), s)\\n r := reverseBytes(s)\\n fmt.Println(\\\"reversed bytes:\\\", []byte(r), r)\\n fmt.Println(\\\"original code points:\\\", []rune(s), s)\\n r = reverseCodePoints(s)\\n fmt.Println(\\\"reversed code points:\\\", []rune(r), r)\\n r = reversePreservingCombiningCharacters(s)\\n fmt.Println(\\\"combining characters:\\\", []rune(r), r)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"println \\\"Able was I, 'ere I saw Elba.\\\".reverse()\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def string = \\\"as⃝df̅\\\"\\n\\nList combiningBlocks = [\\n Character.UnicodeBlock.COMBINING_DIACRITICAL_MARKS,\\n Character.UnicodeBlock.COMBINING_DIACRITICAL_MARKS_SUPPLEMENT,\\n Character.UnicodeBlock.COMBINING_HALF_MARKS,\\n Character.UnicodeBlock.COMBINING_MARKS_FOR_SYMBOLS\\n]\\nList chars = string as List\\nchars[1..-1].eachWithIndex { ch, i ->\\n if (Character.UnicodeBlock.of((char)ch) in combiningBlocks) {\\n chars[i..(i+1)] = chars[(i+1)..i]\\n }\\n}\\nprintln chars.reverse().join()\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"FUNCTION Reverse( sIn )\\n\\n LOCAL cOut := \\\"\\\", i\\n\\n FOR i := Len( sIn ) TO 1 STEP -1\\n cOut += Substr( sIn, i, 1 )\\n NEXT\\n\\n RETURN cOut\\n\",\n \"language\": \"Harbour\"\n },\n {\n \"code\": \"reverse = foldl (flip (:)) []\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"accumulatingReverse :: [a] -> [a]\\naccumulatingReverse lst =\\n let rev xs a = foldl (flip (:)) a xs\\n in rev lst []\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Char (isMark)\\nimport Data.List (groupBy)\\nmyReverse = concat . reverse . groupBy (const isMark)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"CHARACTER string = \\\"Hello World\\\", tmp\\n\\nL = LEN( string )\\nDO i = 1, L/2\\n tmp = string(i)\\n string(i) = string(L-i+1)\\n string(L-i+1) = tmp\\nENDDO\\n\\nWRITE(Messagebox, Name) string\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"procedure main(arglist)\\ns := \\\\arglist[1] | \\\"asdf\\\"\\nwrite(s,\\\" <-> \\\", reverse(s)) # reverse is built-in\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"\\\"asdf\\\" reverse\\n\",\n \"language\": \"Io\"\n },\n {\n \"code\": \"(reverse \\\"hello\\\")\\n\",\n \"language\": \"Io\"\n },\n {\n \"code\": \"100 INPUT PROMPT \\\"String: \\\":TX$\\n120 LET REV$=\\\"\\\"\\n130 FOR I=LEN(TX$) TO 1 STEP-1\\n140 LET REV$=REV$&TX$(I)\\n150 NEXT\\n160 PRINT REV$\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \" |.'asdf'\\nfdsa\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" ranges=.16b02ff 16b036f, 16b1dbf 16b1dff, 16b20cf 16b20ff, 16bfe1f 16bfe2f\\n iscombining=. 2 | ranges&I.\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" split=. (<;.1~ -.@iscombining) :. ;\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" |.&.split&.(3 u: 7&u:) 'as⃝df̅'\\nf̅ds⃝a\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"String reversed = new StringBuilder(\\\"as⃝df̅\\\").reverse().toString(); // fd⃝sa\\nString reversed = new StringBuffer(\\\"as⃝df̅\\\").reverse().toString(); // fd⃝sa\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"String string = \\\"as⃝df̅\\\";\\nStringBuilder reversed = new StringBuilder();\\nfor (int index = string.length() - 1; index >= 0; index--)\\n reversed.append(string.charAt(index));\\nreversed; // fd⃝sa\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.text.BreakIterator;\\n\\npublic class Reverse {\\n /* works with Java 20+ only\\n * cf. https://bugs.openjdk.org/browse/JDK-8291660\\n */\\n public static StringBuilder graphemeReverse(String text) {\\n BreakIterator boundary = BreakIterator.getCharacterInstance();\\n boundary.setText(text);\\n StringBuilder reversed = new StringBuilder();\\n int end = boundary.last();\\n int start = boundary.previous();\\n while (start != BreakIterator.DONE) {\\n reversed.append(text.substring(start, end));\\n end = start;\\n start = boundary.previous();\\n }\\n return reversed;\\n }\\n public static void main(String[] args) throws Exception {\\n String a = \\\"as⃝df̅\\\";\\n System.out.println(graphemeReverse(a)); // f̅ds⃝a\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"example = 'Tux 🐧 penguin';\\n\\n// array expansion operator\\n[...example].reverse().join('') // 'niugnep 🐧 xuT'\\n// split regexp separator with Unicode mode\\nexample.split(/(?:)/u).reverse().join('') // 'niugnep 🐧 xuT'\\n\\n// do not use\\nexample.split('').reverse().join(''); // 'niugnep \\\\udc27\\\\ud83d xuT'\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"a = \\\"\\\\u{1F466}\\\\u{1F3FB}\\\\u{1f44b}\\\"; // '👦🏻👋'\\n\\n// wrong behavior - ASCII sequences\\na.split('').reverse().join(''); // '\\\\udc4b🁦\\\\ud83d'\\n\\n// wrong behavior - Unicode code points\\n[...a].reverse().join(''); // '👋🏻👦'\\na.split(/(?:)/u).reverse().join(''); // '👋🏻👦'\\n\\n// correct behavior - Unicode graphemes\\n[...new Intl.Segmenter().segment(a)].map(x => x.segment).reverse().join('') // 👋👦🏻\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"//using chained methods\\nfunction reverseStr(s) {\\n return s.split('').reverse().join('');\\n}\\n\\n//fast method using for loop\\nfunction reverseStr(s) {\\n for (var i = s.length - 1, o = ''; i >= 0; o += s[i--]) { }\\n return o;\\n}\\n\\n//fast method using while loop (faster with long strings in some browsers when compared with for loop)\\nfunction reverseStr(s) {\\n var i = s.length, o = '';\\n while (i--) o += s[i];\\n return o;\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n\\n // .reduceRight() can be useful when reversals\\n // are composed with some other process\\n\\n let reverse1 = s => Array.from(s)\\n .reduceRight((a, x) => a + (x !== ' ' ? x : ' <- '), ''),\\n\\n // but ( join . reverse . split ) is faster for\\n // simple string reversals in isolation\\n\\n reverse2 = s => s.split('').reverse().join('');\\n\\n\\n return [reverse1, reverse2]\\n .map(f => f(\\\"Some string to be reversed\\\"));\\n\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"[\\\"desrever <- eb <- ot <- gnirts <- emoS\\\", \\\"desrever eb ot gnirts emoS\\\"]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"DEFINE reverse == \\\"\\\" [swons] fold.\\n\\n\\\"asdf\\\" reverse putchars.\\n\",\n \"language\": \"Joy\"\n },\n {\n \"code\": \"def reverse_string: explode | reverse | implode;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"var str = \\\"Never odd or even\\\";\\nputs(str);\\nputs(str.split('').reverse().join(''));\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"julia> reverse(\\\"hey\\\")\\n\\\"yeh\\\"\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"julia> join(reverse(collect(graphemes(\\\"as⃝df̅\\\"))))\\n\\\"f̅ds⃝a\\\"\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \" |\\\"asdf\\\"\\n\\\"fdsa\\\"\\n\\n | 23 4 5 1\\n1 5 4 23\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"fun main(args: Array<String>) {\\n println(\\\"asdf\\\".reversed())\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"(include \\\"string\\\" \\\"algorithm\\\")\\n(main\\n (decl std::string s)\\n (std::getline std::cin s)\\n (std::reverse (s.begin) (s.end))\\n (prn s))\\n\",\n \"language\": \"L++\"\n },\n {\n \"code\": \"{S.reverse hello brave new world}\\n-> world new brave hello\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"# Inv operator\\nfn.println(parser.op(-asdf))\\n# Ouput: fdsa\\n\\n# Inv operator function\\nfn.println(fn.inv(asdf))\\n# Ouput: fdsa\\n\",\n \"language\": \"Lang\"\n },\n {\n \"code\": \": flip \\\"\\\" split reverse \\\"\\\" join ;\\n\\\"qwer asdf\\\" flip .\\n\",\n \"language\": \"Lang5\"\n },\n {\n \"code\": \"writeln reverse \\\"don't you know\\\"\\n\",\n \"language\": \"Langur\"\n },\n {\n \"code\": \"local(input) = 'asdf'\\n#input->reverse\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"local(input = 'asdf', output = array)\\nwith i in #input->values\\ndo #output->insertFirst(#i)\\n#output->join\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \" .ORIG 0x3000\\n\\n LEA R1,STRING\\n LEA R2,GNIRTS\\n LD R3,MINUS1\\n NOT R5,R1\\n ADD R5,R5,1\\n\\nSCAN LDR R4,R1,0\\n BRZ COPY\\n ADD R1,R1,1\\n BRNZP SCAN\\n\\nCOPY ADD R1,R1,R3\\n ADD R4,R1,R5\\n BRN COPIED\\n LDR R4,R1,0\\n STR R4,R2,0\\n ADD R2,R2,1\\n BRNZP COPY\\n\\nCOPIED AND R4,R4,0\\n STR R4,R2,0\\n\\n LEA R0,GNIRTS\\n PUTS\\n\\n HALT\\n\\nMINUS1 .FILL 0xFFFF\\n\\nSTRING .STRINGZ \\\"If thou beest he -- but O how fall'n! how chang'd\\\"\\nGNIRTS .BLKW 128\\n\\n .END\\n\",\n \"language\": \"LC3-Assembly\"\n },\n {\n \"code\": \"> (lists:reverse \\\"asdf\\\")\\n\\\"fdsa\\\"\\n\",\n \"language\": \"LFE\"\n },\n {\n \"code\": \"> (set encoded (binary (\\\"åäö ð\\\" utf8)))\\n#B(195 165 195 164 195 182 32 195 176)\\n\",\n \"language\": \"LFE\"\n },\n {\n \"code\": \"> (io:format \\\"~tp~n\\\" (list encoded))\\n<<\\\"åäö ð\\\"/utf8>>\\n\",\n \"language\": \"LFE\"\n },\n {\n \"code\": \"> (lists:reverse (unicode:characters_to_list encoded))\\n\\\"ð öäå\\\"\\n\",\n \"language\": \"LFE\"\n },\n {\n \"code\": \"input$ =\\\"abcdefgABCDEFG012345\\\"\\nprint input$\\nprint ReversedStr$( input$)\\n\\nend\\n\\nfunction ReversedStr$(in$)\\n for i =len(in$) to 1 step -1\\n ReversedStr$ =ReversedStr$ +mid$( in$, i, 1)\\n next i\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"on reverse (str)\\n res = \\\"\\\"\\n repeat with i = str.length down to 1\\n put str.char[i] after res\\n end repeat\\n return res\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"on reverseBytes (str)\\n ba = byteArray(str)\\n res = byteArray()\\n repeat with i = ba.length down to 1\\n res[res.length+1] = ba[i]\\n end repeat\\n return res\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"function reverseString S\\n repeat with i = length(S) down to 1\\n put char i of S after R\\n end repeat\\n return R\\nend reverseString\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"; This is not strictly LLVM, as it uses the C library function \\\"printf\\\".\\n; LLVM does not provide a way to print values, so the alternative would be\\n; to just load the string into memory, and that would be boring.\\n\\n; Additional comments have been inserted, as well as changes made from the output produced by clang such as putting more meaningful labels for the jumps\\n\\n$\\\"main.printf\\\" = comdat any\\n\\n@main.str = private unnamed_addr constant [12 x i8] c\\\"Hello world\\\\00\\\", align 1\\n@\\\"main.printf\\\" = linkonce_odr unnamed_addr constant [4 x i8] c\\\"%s\\\\0A\\\\00\\\", comdat, align 1\\n\\ndefine void @reverse(i64, i8*) {\\n %3 = alloca i8*, align 8 ; allocate str (local)\\n %4 = alloca i64, align 8 ; allocate len (local)\\n %5 = alloca i64, align 8 ; allocate i\\n %6 = alloca i64, align 8 ; allocate j\\n %7 = alloca i8, align 1 ; allocate t\\n store i8* %1, i8** %3, align 8 ; set str (local) to the parameter str\\n store i64 %0, i64* %4, align 8 ; set len (local) to the paremeter len\\n store i64 0, i64* %5, align 8 ; i = 0\\n %8 = load i64, i64* %4, align 8 ; load len\\n %9 = sub i64 %8, 1 ; decrement len\\n store i64 %9, i64* %6, align 8 ; j =\\n br label %loop\\n\\nloop:\\n %10 = load i64, i64* %5, align 8 ; load i\\n %11 = load i64, i64* %6, align 8 ; load j\\n %12 = icmp ult i64 %10, %11 ; i < j\\n br i1 %12, label %loop_body, label %exit\\n\\nloop_body:\\n %13 = load i8*, i8** %3, align 8 ; load str\\n %14 = load i64, i64* %5, align 8 ; load i\\n %15 = getelementptr inbounds i8, i8* %13, i64 %14 ; address of str[i]\\n %16 = load i8, i8* %15, align 1 ; load str[i]\\n store i8 %16, i8* %7, align 1 ; t = str[i]\\n %17 = load i64, i64* %6, align 8 ; load j\\n %18 = getelementptr inbounds i8, i8* %13, i64 %17 ; address of str[j]\\n %19 = load i8, i8* %18, align 1 ; load str[j]\\n %20 = getelementptr inbounds i8, i8* %13, i64 %14 ; address of str[i]\\n store i8 %19, i8* %20, align 1 ; str[i] = str[j]\\n %21 = load i8, i8* %7, align 1 ; load t\\n %22 = getelementptr inbounds i8, i8* %13, i64 %17 ; address of str[j]\\n store i8 %21, i8* %22, align 1 ; str[j] = t\\n\\n;-- loop increment\\n %23 = load i64, i64* %5, align 8 ; load i\\n %24 = add i64 %23, 1 ; increment i\\n store i64 %24, i64* %5, align 8 ; store i\\n %25 = load i64, i64* %6, align 8 ; load j\\n %26 = add i64 %25, -1 ; decrement j\\n store i64 %26, i64* %6, align 8 ; store j\\n br label %loop\\n\\nexit:\\n ret void\\n}\\n\\ndefine i32 @main() {\\n;-- char str[]\\n %1 = alloca [12 x i8], align 1\\n;-- memcpy(str, \\\"Hello world\\\")\\n %2 = bitcast [12 x i8]* %1 to i8*\\n call void @llvm.memcpy.p0i8.p0i8.i64(i8* %2, i8* getelementptr inbounds ([12 x i8], [12 x i8]* @main.str, i32 0, i32 0), i64 12, i32 1, i1 false)\\n;-- printf(\\\"%s\\\\n\\\", str)\\n %3 = getelementptr inbounds [12 x i8], [12 x i8]* %1, i32 0, i32 0\\n %4 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @\\\"main.printf\\\", i32 0, i32 0), i8* %3)\\n;-- %7 = strlen(str)\\n %5 = getelementptr inbounds [12 x i8], [12 x i8]* %1, i32 0, i32 0\\n %6 = call i64 @strlen(i8* %5)\\n;-- reverse(%6, str)\\n call void @reverse(i64 %6, i8* %5)\\n;-- printf(\\\"%s\\\\n\\\", str)\\n %7 = getelementptr inbounds [12 x i8], [12 x i8]* %1, i32 0, i32 0\\n %8 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @\\\"main.printf\\\", i32 0, i32 0), i8* %7)\\n;-- end of main\\n ret i32 0\\n}\\n\\n;--- The declaration for the external C printf function.\\ndeclare i32 @printf(i8*, ...)\\n\\n; Function Attrs: argmemonly nounwind\\ndeclare void @llvm.memcpy.p0i8.p0i8.i64(i8* nocapture writeonly, i8* nocapture readonly, i64, i32, i1)\\n\\ndeclare i64 @strlen(i8*)\\n\",\n \"language\": \"LLVM\"\n },\n {\n \"code\": \"print reverse \\\"cat ; tac\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"example = 'asdf'\\nstring.reverse(example) -- fdsa\\nexample:reverse() -- fdsa\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module ReverseString {\\n a$=\\\"as⃝df̅\\\"\\n Print Len(a$), len.disp(a$)\\n Let i=1, j=Len(a$)\\n z$=String$(\\\" \\\",j)\\n j++\\n do {\\n k$=mid$(a$, i, 1)\\n if i<len(a$) then {\\n while len.disp(k$+mid$(a$, i+1,1)) =len.disp(k$) {\\n k$+=mid$(a$, i+1,1)\\n i++\\n if i>len(a$) then exit\\n j--\\n }\\n j--\\n insert j, len(k$) Z$=K$\\n } else j-- :Insert j,1 z$=k$\\n if i>=len(a$) then exit\\n i++\\n } Always\\n Print len(z$), len.disp(z$)\\n Print z$=\\\"f̅ds⃝a\\\"\\n Print z$\\n}\\nReverseString\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"a$=\\\"as⃝df̅\\\"\\nb$=strrev$(a$)\\nclipboard b$\\nPrint b$=\\\"̅fd⃝sa\\\"\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"define(`invert',`ifelse(len(`$1'),0,,`invert(substr(`$1',1))'`'substr(`$1',0,1))')\\n\",\n \"language\": \"M4\"\n },\n {\n \"code\": \" .TITLE REVERS\\n .MCALL .GTLIN,.PRINT,.EXIT\\nREVERS::.GTLIN #1$ ; READ STRING\\n MOV #1$,R0\\n JSR PC,REV ; REVERSE IT\\n .PRINT #1$ ; PRINT RESULT\\n .EXIT\\n1$: .BLKB 200\\n\\n ; REVERSE STRING AT R0\\nREV: MOV R0,R1\\n1$: TSTB (R1)+ ; FIND END OF STRING\\n BNE 1$\\n DEC R1 ; MOVE BACK TO LAST CHAR\\n2$: MOVB -(R1),R2 ; SWAP CHARS\\n MOVB (R0),(R1)\\n MOVB R2,(R0)+\\n CMP R0,R1 ; STOP WHEN POINTERS MEET\\n BLT 2$\\n RTS PC\\n\\n .END REVERS\\n\",\n \"language\": \"MACRO-11\"\n },\n {\n \"code\": \"> StringTools:-Reverse( \\\"foo\\\" );\\n \\\"oof\\\"\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"StringReverse[\\\"asdf\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \">> fliplr(['She told me that she spoke English and I said great. '...\\n'Grabbed her hand out the club and I said let''s skate.'])\\n\\nans =\\n\\n.etaks s'tel dias I dna bulc eht tuo dnah reh debbarG .taerg dias I dna hsilgnE ekops ehs taht em dlot ehS\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"sreverse(\\\"abcdef\\\"); /* \\\"fedcba\\\" */\\n\\nsreverse(\\\"rats live on no evil star\\\"); /* not a bug :o) */\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"fn reverseString s =\\n(\\n local reversed = \\\"\\\"\\n for i in s.count to 1 by -1 do reversed += s[i]\\n reversed\\n)\\n\",\n \"language\": \"MAXScript\"\n },\n {\n \"code\": \"(\\\"\\\" split reverse \\\"\\\" join) :reverse-str\\n\",\n \"language\": \"Min\"\n },\n {\n \"code\": \"str = \\\"This is a string\\\"\\nprint \\\"Forward: \\\" + str\\nnewStr = \\\"\\\"\\nfor i in range(str.len-1, 0)\\n newStr = newStr + str[i]\\nend for\\nprint \\\"Reversed: \\\" + newStr\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"# First, it gets the length of the original string\\n# Then, it allocates memory from the copy\\n# Then it copies the pointer to the original string, and adds the strlen\\n# subtract 1, then that new pointer is at the last char.\\n# while(strlen)\\n# copy char\\n# decrement strlen\\n# decrement source pointer\\n# increment target pointer\\n\\n.text\\n\\nstrcpy:\\n addi $sp, $sp, -4\\n sw $s0, 0($sp)\\n add $s0, $zero, $zero\\n\\nL1:\\n add $t1, $s0, $a1\\n lb $t2, 0($t1)\\n add $t3, $s0, $a0\\n sb $t2, 0($t3)\\n beq $t2, $zero, L2\\n addi $s0, $s0, 1\\n j L1\\n\\nL2:\\n lw $s0, 0($sp)\\n addi $sp, $sp, 4\\n jr $ra\\n\\n.data\\n\\tex_msg_og: .asciiz \\\"Original string:\\\\n\\\"\\n\\tex_msg_cpy: .asciiz \\\"\\\\nCopied string:\\\\n\\\"\\n\\tstring: .asciiz \\\"Nice string you got there!\\\\n\\\"\\n\",\n \"language\": \"MIPS-Assembly\"\n },\n {\n \"code\": \"def reverse(s:string)\\n StringBuilder.new(s).reverse\\nend\\n\\nputs reverse('reversed')\\n\",\n \"language\": \"Mirah\"\n },\n {\n \"code\": \"main :: [sys_message]\\nmain = [Stdout (reverse \\\"esreveR\\\"),\\n Stdout \\\"\\\\n\\\"]\\n\",\n \"language\": \"Miranda\"\n },\n {\n \"code\": \"MODULE ReverseStr;\\nFROM FormatString IMPORT FormatString;\\nFROM Terminal IMPORT Write,WriteString,WriteLn,ReadChar;\\n\\nPROCEDURE WriteInt(n : INTEGER);\\nVAR buf : ARRAY[0..15] OF CHAR;\\nBEGIN\\n FormatString(\\\"%i\\\", buf, n);\\n WriteString(buf)\\nEND WriteInt;\\n\\nPROCEDURE ReverseStr(in : ARRAY OF CHAR; VAR out : ARRAY OF CHAR);\\nVAR ip,op : INTEGER;\\nBEGIN\\n ip := 0;\\n op := 0;\\n WHILE in[ip] # 0C DO\\n INC(ip)\\n END;\\n DEC(ip);\\n WHILE ip>=0 DO\\n out[op] := in[ip];\\n INC(op);\\n DEC(ip)\\n END\\nEND ReverseStr;\\n\\nTYPE A = ARRAY[0..63] OF CHAR;\\nVAR is,os : A;\\nBEGIN\\n is := \\\"Hello World\\\";\\n ReverseStr(is, os);\\n\\n WriteString(is);\\n WriteLn;\\n WriteString(os);\\n WriteLn;\\n\\n ReadChar\\nEND ReverseStr.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"MODULE Reverse EXPORTS Main;\\n\\nIMPORT IO, Text;\\n\\nPROCEDURE String(item: TEXT): TEXT =\\n VAR result: TEXT := \\\"\\\";\\n BEGIN\\n FOR i := Text.Length(item) - 1 TO 0 BY - 1 DO\\n result := Text.Cat(result, Text.FromChar(Text.GetChar(item, i)));\\n END;\\n RETURN result;\\n END String;\\n\\nBEGIN\\n IO.Put(String(\\\"Foobarbaz\\\") & \\\"\\\\n\\\");\\nEND Reverse.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"REVERSE\\n ;Take in a string and reverse it using the built in function $REVERSE\\n NEW S\\n READ:30 \\\"Enter a string: \\\",S\\n WRITE !,$REVERSE(S)\\n QUIT\\n\",\n \"language\": \"MUMPS\"\n },\n {\n \"code\": \"def reverse(string)\\n l = \\\"\\\"\\n\\n for char in list(str(string)).reverse()\\n l += char\\n end\\n\\n return l\\nend\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"/* Reverse a string, in Neko */\\n\\nvar reverse = function(s) {\\n var len = $ssize(s)\\n if len < 2 return s\\n\\n var reverse = $smake(len)\\n var pos = 0\\n while len > 0 $sset(reverse, pos ++= 1, $sget(s, len -= 1))\\n return reverse\\n}\\n\\nvar str = \\\"never odd or even\\\"\\n$print(str, \\\"\\\\n\\\")\\n$print(reverse(str), \\\"\\\\n\\\\n\\\")\\n\\nstr = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n$print(str, \\\"\\\\n\\\")\\n$print(reverse(str), \\\"\\\\n\\\\n\\\")\\n\\n$print(\\\"single test\\\\n\\\")\\nstr = \\\"a\\\"\\n$print(str, \\\"\\\\n\\\")\\n$print(reverse(str), \\\"\\\\n\\\\n\\\")\\n\\n\\n$print(\\\"empty test\\\\n\\\")\\nstr = \\\"\\\"\\n$print(str, \\\"\\\\n\\\")\\n$print(reverse(str), \\\"\\\\n\\\")\\n\",\n \"language\": \"Neko\"\n },\n {\n \"code\": \"using System;\\nusing System.Globalization;\\nusing System.Windows.Forms;\\nusing System.Console;\\nusing Nemerle.Utility.NString;\\n\\nmodule StrReverse\\n{\\n UReverse(text : string) : string\\n {\\n mutable output = [];\\n def elements = StringInfo.GetTextElementEnumerator(text);\\n while (elements.MoveNext())\\n output ::= elements.GetTextElement().ToString();\\n Concat(\\\"\\\", output.Reverse());\\n }\\n\\n Main() : void\\n {\\n def test = \\\"as⃝df̅\\\";\\n MessageBox.Show($\\\"$test --> $(UReverse(test))\\\"); //for whatever reason my console didn't display Unicode properly, but a MessageBox worked\\n }\\n}\\n\",\n \"language\": \"Nemerle\"\n },\n {\n \"code\": \"Reverse(text : string) : string\\n{\\n mutable output = [];\\n foreach (c in text.ToCharArray())\\n output ::= c.ToString();\\n Concat(\\\"\\\", output)\\n}\\n\",\n \"language\": \"Nemerle\"\n },\n {\n \"code\": \"/* NetRexx */\\n\\noptions replace format comments java crossref savelog symbols nobinary\\n\\nreverseThis = 'asdf'\\nsihTesrever = reverseThis.reverse\\n\\nsay reverseThis\\nsay sihTesrever\\n\\nreturn\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"(reverse \\\"!dlroW olleH\\\")\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"reverse 'asdf'\\n=fdsa\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \"import unicode\\n\\ndoAssert \\\"foobar\\\".reversed == \\\"raboof\\\"\\ndoAssert \\\"先秦兩漢\\\".reversed == \\\"漢兩秦先\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"10 STRING$=\\\"THIS TEXT IS REVERSED.\\\"\\n20 REVERSED$=\\\"\\\"\\n30 FOR I=1 TO LEN(STRING$)\\n40 REVERSED$=MID$(STRING$,I,1)+REVERSED$\\n50 NEXT\\n60 PRINT REVERSED$\\n\",\n \"language\": \"NS-HUBASIC\"\n },\n {\n \"code\": \"MODULE reverse;\\n\\n IMPORT Out, Strings;\\n\\n VAR s: ARRAY 12 + 1 OF CHAR;\\n\\n PROCEDURE Swap(VAR c, d: CHAR);\\n VAR oldC: CHAR;\\n BEGIN\\n oldC := c; c := d; d := oldC\\n END Swap;\\n\\n\\n PROCEDURE Reverse(VAR s: ARRAY OF CHAR);\\n VAR len, i: INTEGER;\\n BEGIN\\n len := Strings.Length(s);\\n FOR i := 0 TO len DIV 2 DO\\n Swap(s[i], s[len - 1 - i])\\n END\\n END Reverse;\\n\\nBEGIN\\n s := \\\"hello, world\\\";\\n Reverse(s);\\n Out.String(s);\\n Out.Ln\\nEND reverse.\\n\",\n \"language\": \"Oberon\"\n },\n {\n \"code\": \"result := \\\"asdf\\\"->Reverse();\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"#import <Foundation/Foundation.h>\\n\\n@interface NSString (Extended)\\n-(NSString *)reverseString;\\n@end\\n\\n@implementation NSString (Extended)\\n-(NSString *) reverseString\\n{\\n NSUInteger len = [self length];\\n NSMutableString *rtr=[NSMutableString stringWithCapacity:len];\\n // unichar buf[1];\\n\\n while (len > (NSUInteger)0) {\\n unichar uch = [self characterAtIndex:--len];\\n [rtr appendString:[NSString stringWithCharacters:&uch length:1]];\\n }\\n return rtr;\\n}\\n@end\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"int main()\\n{\\n @autoreleasepool {\\n\\n NSString *test = [@\\\"!A string to be reverted!\\\" reverseString];\\n\\n NSLog(@\\\"%@\\\", test);\\n\\n }\\n return 0;\\n}\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"#import <Foundation/Foundation.h>\\n\\n@interface NSString (Extended)\\n-(NSString *)reverseString;\\n@end\\n\\n@implementation NSString (Extended)\\n-(NSString *)reverseString\\n{\\n\\tNSInteger l = [self length] - 1;\\n\\tNSMutableString *ostr = [NSMutableString stringWithCapacity:[self length]];\\n\\twhile (l >= 0)\\n\\t{\\n\\t\\tNSRange range = [self rangeOfComposedCharacterSequenceAtIndex:l];\\n\\t\\t[ostr appendString:[self substringWithRange:range]];\\n\\t\\tl -= range.length;\\n\\t}\\n\\treturn ostr;\\n}\\n@end\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"int main()\\n{\\n @autoreleasepool {\\n\\n NSString *test = [@\\\"as⃝df̅\\\" reverseString];\\n\\n NSLog(@\\\"%@\\\", test);\\n\\n }\\n return 0;\\n}\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"let string_rev s =\\n let len = String.length s in\\n String.init len (fun i -> s.[len - 1 - i])\\n\\nlet () =\\n print_endline (string_rev \\\"Hello world!\\\")\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let rev_bytes bs =\\n let last = Bytes.length bs - 1 in\\n for i = 0 to last / 2 do\\n let j = last - i in\\n let c = Bytes.get bs i in\\n Bytes.set bs i (Bytes.get bs j);\\n Bytes.set bs j c;\\n done\\n\\nlet () =\\n let s = Bytes.of_string \\\"Hello World\\\" in\\n rev_bytes s;\\n print_bytes s;\\n print_newline ();\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let rec revs_aux strin list index =\\n if List.length list = String.length strin\\n then String.concat \\\"\\\" list\\n else revs_aux strin ((String.sub strin index 1)::list) (index+1)\\n\\nlet revs s = revs_aux s [] 0\\n\\nlet () =\\n print_endline (revs \\\"Hello World!\\\")\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"s = \\\"a string\\\";\\nrev = s(length(s):-1:1)\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"reverse\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"(define (rev s)\\n (runes->string (reverse (string->runes s))))\\n\\n; testing:\\n(print (rev \\\"Hello, λ!\\\"))\\n; ==> !λ ,olleH\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"main: func {\\n \\\"asdf\\\" reverse() println() // prints \\\"fdsa\\\"\\n}\\n\",\n \"language\": \"OOC\"\n },\n {\n \"code\": \"FUNCTION reverseString RETURNS CHARACTER (\\n INPUT i_c AS CHARACTER\\n):\\n\\n DEFINE VARIABLE cresult AS CHARACTER NO-UNDO.\\n DEFINE VARIABLE ii AS INTEGER NO-UNDO.\\n\\n DO ii = LENGTH( i_c ) TO 1 BY -1:\\n cresult = cresult + SUBSTRING( i_c, ii, 1 ).\\n END.\\n RETURN cresult.\\n\\nEND FUNCTION.\\n\\nMESSAGE reverseString( \\\"asdf\\\" ) VIEW-AS ALERT-BOX.\\n\",\n \"language\": \"OpenEdge-Progress\"\n },\n {\n \"code\": \"'8 BIT CHARACTERS\\n\\nstring s=\\\"qwertyuiop\\\"\\nsys a,b,i,j,le=len s\\n'\\nfor i=1 to le\\n j=le-i+1\\n if j<=i then exit for\\n a=asc s,i\\n b=asc s,j\\n mid s,j,chr a\\n mid s,i,chr b\\nnext\\n'\\n\\nprint s\\n\\n'16 BIT CHARACTERS\\n\\nwstring s=\\\"qwertyuiop\\\"\\nsys a,b,i,j,le=len s\\n'\\nfor i=1 to le\\n j=le-i+1\\n if j<=i then exit for\\n a=unic s,i\\n b=unic s,j\\n mid s,j,wchr a\\n mid s,i,wchr b\\nnext\\n'\\nprint s\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"string s=\\\"qwertyuiop\\\"\\nsys p=strptr s, le=len s\\nmov esi,p\\nmov edi,esi\\nadd edi,le\\ndec edi\\n(\\n cmp esi,edi\\n jge exit\\n mov al,[esi]\\n mov ah,[edi]\\n mov [esi],ah\\n mov [edi],al\\n inc esi\\n dec edi\\n repeat\\n)\\n\\nprint s\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"{System.showInfo {Reverse \\\"!dlroW olleH\\\"}}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"local\\n fun {DoReverse Xs Ys}\\n case Xs of nil then Ys\\n [] X|Xr then {DoReverse Xr X|Ys}\\n end\\n end\\nin\\n fun {Reverse Xs} {DoReverse Xs nil} end\\nend\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"reverse(s)=concat(Vecrev(s))\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"\\\\\\\\ Return reversed string str.\\n\\\\\\\\ 3/3/2016 aev\\nsreverse(str)={return(Strchr(Vecrev(Vecsmall(str))))}\\n\\n{\\n\\\\\\\\ TEST1\\nprint(\\\" *** Testing sreverse from Version #2:\\\");\\nprint(sreverse(\\\"ABCDEF\\\"));\\nmy(s,sr,n=10000000);\\ns=\\\"ABCDEFGHIJKL\\\";\\nfor(i=1,n, sr=sreverse(s));\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"\\\\\\\\ Version #1 upgraded to complete function. Practically the same.\\nreverse(str)={return(concat(Vecrev(str)))}\\n\\n{\\n\\\\\\\\ TEST2\\nprint(\\\" *** Testing reverse from Version #1:\\\");\\nprint(reverse(\\\"ABCDEF\\\"));\\nmy(s,sr,n=10000000);\\ns=\\\"ABCDEFGHIJKL\\\";\\nfor(i=1,n, sr=reverse(s));\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"{ the result array must be at least as large as the original array }\\nprocedure reverse(s: array[min .. max: integer] of char, var result: array[min1 .. max1: integer] of char);\\n var\\n i, len: integer;\\n begin\\n len := max-min+1;\\n for i := 0 to len-1 do\\n result[min1 + len-1 - i] := s[min + i]\\n end;\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"{Copy and paste it in your program}\\nfunction revstr(my_s:string):string;\\n var out_s:string;\\n ls,i:integer;\\n begin\\n ls:=length(my_s);\\n for i:=1 to ls do\\n out_s:=out_s+my_s[ls-i+1];\\n revstr:=out_s;\\n end;\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"function reverse(s:string):string;\\nvar i:integer;\\nvar tmp:char;\\nbegin\\n for i:=1 to length(s) div 2 do\\n begin\\n tmp:=s[i];\\n s[i]:=s[length(s)+1-i];\\n s[length(s)+1-i]:=tmp;\\n reverse:=s;\\n end;\\nend;\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"procedure revString(var s:string);\\nvar\\n i,j:integer;\\n tmp:char;\\nbegin\\n i := 1;\\n j := length(s);\\n while i<j do\\n begin\\n tmp:=s[i];\\n s[i]:=s[j];\\n s[j]:=tmp;\\n inc(i);\\n dec(j)\\n end;\\nend;\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"<# 显示 指定 变量 反转顺序 字串>集装箱|猫坐在垫子</#>\\n\",\n \"language\": \"Peloton\"\n },\n {\n \"code\": \"<# 보이십 할당하 변물건 열거꾸 문자그>컨테이너|고양이가 매트 위에 앉아</#>\\n\",\n \"language\": \"Peloton\"\n },\n {\n \"code\": \"<@ SAYLETVARREVLIT>集装箱|猫坐在垫子</@>\\n\",\n \"language\": \"Peloton\"\n },\n {\n \"code\": \"use utf8;\\nbinmode STDOUT, \\\":utf8\\\";\\n\\n# to reverse characters (code points):\\nprint scalar reverse('visor'), \\\"\\\\n\\\";\\n\\n# to reverse graphemes:\\nprint join(\\\"\\\", reverse \\\"José\\\" =~ /\\\\X/g), \\\"\\\\n\\\";\\n\\n$string = 'ℵΑΩ 駱駝道 🤔 🇸🇧 🇺🇸 🇬🇧 👨👩👧👦🆗🗺';\\nprint join(\\\"\\\", reverse $string =~ /\\\\X/g), \\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">reverse</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"asdf\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">unicode_reverse</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">utf8</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">utf32</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">utf8_to_utf32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">utf8</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- The assumption is made that <char><comb1><comb2>\\n -- and <char><comb2><comb1> etc would work the same.\\n -- The following loop converts <char><comb1><comb2>\\n -- to <comb1><comb2><char>, as a pre-reverse() step.</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">utf32</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">utf32</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">0x300</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">0x36f</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">0x1dc0</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">0x1dff</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">0x20d0</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">0x20ff</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">0xfe20</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">0xfe2f</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">utf32</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">utf32</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">utf32</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ch</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">utf32</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">reverse</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">utf32</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">utf8</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">utf32_to_utf8</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">utf32</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">utf8</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">r4</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"as\\\\u203Ddf\\\\u0305\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">rt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r4</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\" reversed is \\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">unicode_reverse</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r4</span><span style=\\\"color: #0000FF;\\\">)&</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rt</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"// Will split every Unicode character to array, reverse array and will convert it to string.\\njoin('', array_reverse(preg_split('\\\"\\\"u', $string, -1, PREG_SPLIT_NO_EMPTY)));\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"implode('', array_reverse(mb_str_split($string)));\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"$a = mb_convert_encoding('👦🏻👋', 'UTF-8', 'HTML-ENTITIES'); // 👦🏻👋\\n\\nfunction str_to_array($string)\\n{\\n $length = grapheme_strlen($string);\\n $ret = [];\\n\\n for ($i = 0; $i < $length; $i += 1) {\\n\\n $ret[] = grapheme_substr($string, $i, 1);\\n }\\n\\n return $ret;\\n}\\n\\nfunction utf8_strrev($string)\\n{\\n return implode(array_reverse(str_to_array($string)));\\n}\\n\\nprint_r(utf8_strrev($a)); // 👋👦🏻\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"strrev($string);\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(pack (flip (chop \\\"äöüÄÖÜß\\\")))\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"reverse(\\\"foo\\\");\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"#charset utf8\\nvoid main()\\n{\\n string s = \\\"ßÜÖÄüöää ἀρχῇ\\\";\\n write(\\\"%s\\\\n\\\", string_to_utf8( reverse(s) ));\\n}\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"s = reverse(s);\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"To run:\\nStart up.\\nPut \\\"asdf\\\" into a string.\\nReverse the string.\\nShut down.\\n\",\n \"language\": \"Plain-English\"\n },\n {\n \"code\": \"\\\\def\\\\gobtoA#1\\\\revA{}\\\\def\\\\gobtoB#1\\\\revB{}\\n\\\\def\\\\reverse#1{\\\\reversei{}#1\\\\revA\\\\revB\\\\revB\\\\revB\\\\revB\\\\revB\\\\revB\\\\revB\\\\revB\\\\revA}\\n\\\\def\\\\reversei#1#2#3#4#5#6#7#8#9{\\\\gobtoB#9\\\\revend\\\\revB\\\\reversei{#9#8#7#6#5#4#3#2#1}}\\n\\\\def\\\\revend\\\\revB\\\\reversei#1#2\\\\revA{\\\\gobtoA#1}\\n\\\\reverse{Rosetta}\\n\\\\bye\\n\",\n \"language\": \"PlainTeX\"\n },\n {\n \"code\": \"define reverse_string(s);\\n lvars i, l = length(s);\\n for i from l by -1 to 1 do\\n s(i);\\n endfor;\\n consstring(l);\\nenddefine;\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \"/reverse{\\n/str exch def\\n/temp str 0 get def\\n/i 0 def\\nstr length 2 idiv{\\n/temp str i get def\\nstr i str str length i sub 1 sub get put\\nstr str length i sub 1 sub temp put\\n/i i 1 add def\\n}repeat\\nstr pstack\\n}def\\n\",\n \"language\": \"PostScript\"\n },\n {\n \"code\": \"[1 2 3] reverse % input\\n[3 2 1]\\n\\n(Hello World) reverse % input\\n(dlroW olleH)\\n\",\n \"language\": \"PostScript\"\n },\n {\n \"code\": \"#DIM ALL\\n#COMPILER PBCC 6\\n\\nFUNCTION PBMAIN () AS LONG\\nCON.PRINT STRREVERSE$(\\\"PowerBASIC\\\")\\nEND FUNCTION\\n\",\n \"language\": \"PowerBASIC\"\n },\n {\n \"code\": \"$s = \\\"asdf\\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"[string]::Join('', $s[$s.Length..0])\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"-join ($s[$s.Length..0])\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"[array]::Reverse($s)\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$s -replace\\n ('(.)' * $s.Length),\\n [string]::Join('', ($s.Length..1 | ForEach-Object { \\\"`$$_\\\" }))\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$s -replace\\n ('(.)' * $s.Length),\\n -join ($s.Length..1 | ForEach-Object { \\\"`$$_\\\" } )\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"[Regex]::Matches($s,'.','RightToLeft').Value -join ''\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$a = 'abc 🐧 def'\\n$enum = $a.EnumerateRunes() | % { \\\"$_\\\" }\\n-join $enum[$enum.length..0] # fed 🐧 cba\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$a = \\\"aeiou`u{0308}yz\\\"\\n$enum = [System.Globalization.StringInfo]::GetTextElementEnumerator($a)\\n$arr = @()\\nwhile($enum.MoveNext()) { $arr += $enum.GetTextElement() }\\n[array]::reverse($arr)\\n$arr -join '' # zyüoiea\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"reverse(\\\"abcd\\\", L), string_to_list(S,L).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"accRev([H|T], A, R) :- accRev(T, [H|A], R).\\naccRev([], A, A).\\n\\nrev(L,R) :- accRev(L,[],R).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Debug ReverseString(\\\"!dekrow tI\\\")\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"input()[::-1]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"string[::-1]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"''.join(reversed(string))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import unicodedata\\n\\ndef ureverse(ustring):\\n 'Reverse a string including unicode combining characters'\\n groupedchars = []\\n uchar = list(ustring)\\n while uchar:\\n if unicodedata.combining(uchar[0]) != 0:\\n groupedchars[-1] += uchar.pop(0)\\n else:\\n groupedchars.append(uchar.pop(0))\\n # Grouped reversal\\n groupedchars = groupedchars[::-1]\\n\\n return ''.join(groupedchars)\\n\\ndef say_string(s):\\n return ' '.join([s, '=', ' | '.join(unicodedata.name(ch, '') for ch in s)])\\n\\ndef say_rev(s):\\n print(f\\\"Input: {say_string(s)}\\\")\\n print(f\\\"Character reversed: {say_string(s[::-1])}\\\")\\n print(f\\\"Unicode reversed: {say_string(ureverse(s))}\\\")\\n print(f\\\"Unicode reverse²: {say_string(ureverse(ureverse(s)))}\\\")\\n\\nif __name__ == '__main__':\\n ucode = ''.join(chr(int(n[2:], 16)) for n in\\n 'U+0041 U+030A U+0073 U+0074 U+0072 U+006F U+0308 U+006D'.split())\\n say_rev(ucode)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"ucode = ''.join(chr(int(n[2:], 16)) for n in\\n 'U+006B U+0301 U+0075 U+032D U+006F U+0304 U+0301 U+006E'.split())\\nsay_rev(ucode)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"ucode = ''.join(chr(int(n, 16))\\n for n in ['61', '73', '20dd', '64', '66', '305'])\\nsay_rev(ucode)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"(REVERSE \\\"ABCD\\\")\\n\",\n \"language\": \"Qi\"\n },\n {\n \"code\": \" [ dup nest? if\\n [ [] swap witheach\\n [ nested\\n swap join ] ] ] is reverse ( x --> x )\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"function reverse$(a$)\\n b$ = \\\"\\\"\\n for i = 1 to len(a$)\\n b$ = mid$(a$, i, 1) + b$\\n next i\\n reverse$ = b$\\nend function\\n\",\n \"language\": \"QuickBASIC\"\n },\n {\n \"code\": \"revstring <- function(stringtorev) {\\n return(\\n paste(\\n strsplit(stringtorev,\\\"\\\")[[1]][nchar(stringtorev):1]\\n ,collapse=\\\"\\\")\\n )\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \" revstring <- function(s) paste(rev(strsplit(s,\\\"\\\")[[1]]),collapse=\\\"\\\")\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"revstring(\\\"asdf\\\")\\nrevstring(\\\"m\\\\u00f8\\\\u00f8se\\\")\\nEncoding(\\\"m\\\\u00f8\\\\u00f8se\\\") # just to check if on your system it's something\\n # different!\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (string-reverse s)\\n (list->string (reverse (string->list s))))\\n\\n(string-reverse \\\"aoeu\\\")\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"say \\\"hello world\\\".flip;\\nsay \\\"as⃝df̅\\\".flip;\\nsay 'ℵΑΩ 駱駝道 🤔 🇸🇧 🇺🇸 🇬🇧 👨👩👧👦🆗🗺'.flip;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"print reverse$(\\\"This is a test\\\")\\n\",\n \"language\": \"RapidQ\"\n },\n {\n \"code\": \"import String;\\nreverse(\\\"string\\\")\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"\\\"asdf\\\" reverse\\n\",\n \"language\": \"Raven\"\n },\n {\n \"code\": \"print reverse \\\"asdf\\\"\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \"x: \\\"asdf\\\"\\nprint reverse x\\nprint x ; Now reversed.\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \">> reverse \\\"asdf\\\"\\n== \\\"fdsa\\\"\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"$ENTRY Go {\\n = <Prout <Reverse 'asdf'>>;\\n};\\n\\nReverse {\\n (e.X) = e.X;\\n (e.X) s.C e.Y = <Reverse (s.C e.X) e.Y>;\\n e.X = <Reverse () e.X>;\\n};\\n\",\n \"language\": \"Refal\"\n },\n {\n \"code\": \"let rev_string = (s) => {\\n let len = Js.String2.length(s)\\n let arr = []\\n for i in 0 to (len-1) {\\n let c = Js.String2.get(s, len - 1 - i)\\n let _ = Js.Array2.push(arr, c)\\n }\\n Js.String2.concatMany(\\\"\\\", arr)\\n}\\n\\nJs.log(rev_string(\\\"abcdefg\\\"))\\n\",\n \"language\": \"ReScript\"\n },\n {\n \"code\": \"'asdf s:reverse s:put\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"/*REXX program to reverse a string (and show before and after strings).*/\\n\\nstring1 = 'A man, a plan, a canal, Panama!'\\nstring2 = reverse(string1)\\n\\nsay ' original string: ' string1\\nsay ' reversed string: ' string2\\n /*stick a fork in it, we're done.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program to reverse a string (and show before and after strings).*/\\n\\nstring1 = 'A man, a plan, a canal, Panama!'\\nstring2 =\\n do j=1 for length(string1)\\n string2 = substr(string1,j,1)string2\\n end /*j*/\\nsay ' original string: ' string1\\nsay ' reversed string: ' string2\\n /*stick a fork in it, we're done.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \" string2 = substr(string1,j,1) || string2\\n /*───── or ─────*/\\n string2= substr(string1,j,1)string2\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program to reverse a string (and show before and after strings).*/\\n\\nstring1 = 'A man, a plan, a canal, Panama!'\\nstring2 =\\n do j=length(string1) to 1 by -1\\n string2 = string2 || substr(string1,j,1)\\n end /*j*/\\nsay ' original string: ' string1\\nsay ' reversed string: ' string2\\n /*stick a fork in it, we're done.*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"cStr = \\\"asdf\\\" cStr2 = \\\"\\\"\\nfor x = len(cStr) to 1 step -1 cStr2 += cStr[x] next\\nSee cStr2 # fdsa\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \">> x = \\\"rosettacode\\\"\\nrosettacode\\n\\n// script\\nrx = \\\"\\\";\\nfor (i in strlen(x):1:-1)\\n{\\n rx = rx + substr(x, i);\\n}\\n\\n>> rx\\nedocattesor\\n\",\n \"language\": \"RLaB\"\n },\n {\n \"code\": \". \\\"local1 = Main string\\\"\\n. \\\"local2 = Temporary string storage\\\"\\n. \\\"local3 = String length\\\"\\nset \\\"$local1\\\" to \\\"\\\"\\nset \\\"$local2 \\\" to \\\"\\\"\\nset \\\"local3\\\" to 0\\n\\ninput string \\\"String to reverse:\\\"\\nset \\\"$local1\\\" to \\\"&INPUT&\\\"\\nset \\\"$local2\\\" to \\\"$local1\\\"\\nset \\\"local3\\\" to \\\"$local2.length\\\"\\nloop start\\nset \\\"$local1.(('local3' - 1) - 'loopcount')\\\" to \\\"$local2.('loopcount')\\\"\\nloop for \\\"('local3' - 1)\\\"\\n* \\\"Reversed string: &$local1& (Length: &$local1.length&)\\\"\\nend\\n\",\n \"language\": \"Robotic\"\n },\n {\n \"code\": \"str = \\\"asdf\\\"\\nreversed = str.reverse\\n\\\"résumé niño\\\".reverse #=> \\\"oñin émusér\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"graphemes = 'as⃝df̅'.scan(/\\\\X/)\\nreversed = graphemes.reverse\\ngraphemes.join #=> \\\"f̅ds⃝a\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"string$ = \\\"123456789abcdefghijk\\\"\\nfor i = len(string$) to 1 step -1\\n print mid$(string$,i,1);\\nnext i\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"let mut buffer = b\\\"abcdef\\\".to_vec();\\nbuffer.reverse();\\nassert_eq!(buffer, b\\\"fedcba\\\");\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"let output: String = \\\"一二三四五六七八九十\\\".chars().rev().collect();\\nassert_eq!(output, \\\"十九八七六五四三二一\\\");\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"let output: String = \\\"as⃝df̅\\\".chars().rev().collect();\\nassert_ne!(output, \\\"f̅ds⃝a\\\"); // should be this\\nassert_eq!(output, \\\"̅fd⃝sa\\\");\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"use unicode_segmentation::UnicodeSegmentation;\\n\\nlet output: String = \\\"as⃝df̅\\\".graphemes(true).rev().collect();\\nassert_eq!(output, \\\"f̅ds⃝a\\\");\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"variable sa = \\\"Hello, World\\\", aa = Char_Type[strlen(sa)+1];\\ninit_char_array(aa, sa);\\narray_reverse(aa);\\n% print(aa);\\n\\n% Unfortunately, strjoin() only joins strings, so we map char()\\n% [sadly named: actually converts char into single-length string]\\n% onto the array:\\n\\nprint( strjoin(array_map(String_Type, &char, aa), \\\"\\\") );\\n\",\n \"language\": \"S-lang\"\n },\n {\n \"code\": \"define init_unicode_array(a, buf)\\n{\\n variable len = strbytelen(buf), ch, p0 = 0, p1 = 0;\\n while (p1 < len) {\\n (p1, ch) = strskipchar(buf, p1, 1);\\n if (ch < 0) print(\\\"oops.\\\");\\n a[p0] = ch;\\n p0++;\\n }\\n}\\n\\nvariable su = \\\"Σὲ γνωρίζω ἀπὸ τὴν κόψη\\\";\\nvariable au = Int_Type[strlen(su)+1];\\ninit_unicode_array(au, su);\\narray_reverse(au);\\n% print(au);\\nprint(strjoin(array_map(String_Type, &char, au), \\\"\\\") );\\n\",\n \"language\": \"S-lang\"\n },\n {\n \"code\": \"data _null_;\\nlength a b $11;\\na=\\\"I am Legend\\\";\\nb=reverse(a);\\nput a;\\nput b;\\nrun;\\n\",\n \"language\": \"SAS\"\n },\n {\n \"code\": \"class MAIN is\\n main is\\n s ::= \\\"asdf\\\";\\n reversed ::= s.reverse;\\n -- current implementation does not handle multibyte encodings correctly\\n end;\\nend;\\n\",\n \"language\": \"Sather\"\n },\n {\n \"code\": \"\\\"asdf\\\".reverse\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"\\\"asdf\\\".foldRight(\\\"\\\")((a,b) => b+a)\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"def reverse(s: String) = {\\n import java.text.{Normalizer,BreakIterator}\\n val norm = Normalizer.normalize(s, Normalizer.Form.NFKC) // waffle -> waffle (optional)\\n val it = BreakIterator.getCharacterInstance\\n it setText norm\\n def break(it: BreakIterator, prev: Int, result: List[String] = Nil): List[String] = it.next match {\\n case BreakIterator.DONE => result\\n case cur => break(it, cur, norm.substring(prev, cur) :: result)\\n }\\n break(it, it.first).mkString\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"def reverseString(s: String) = {\\n import java.lang.Character._\\n\\n val combiningTypes = List(NON_SPACING_MARK, ENCLOSING_MARK, COMBINING_SPACING_MARK)\\n def isCombiningCharacter(c: Char) = combiningTypes contains c.getType\\n def isCombiningSurrogate(high: Char, low: Char) = combiningTypes contains getType(toCodePoint(high, low))\\n def isCombining(l: List[Char]) = l match {\\n case List(a, b) => isCombiningSurrogate(a, b)\\n case List(a) => isCombiningCharacter(a)\\n case Nil => true\\n case _ => throw new IllegalArgumentException(\\\"isCombining expects a list of up to two characters\\\")\\n }\\n\\n def cleanSurrogate(l: List[Char]) = l match {\\n case List(a, b) if a.isHighSurrogate && b.isLowSurrogate => l\\n case List(a, b) if a.isLowSurrogate => Nil\\n case List(a, b) => List(a)\\n case _ => throw new IllegalArgumentException(\\\"cleanSurrogate expects lists of two characters, exactly\\\")\\n }\\n\\n def splitString(string: String) = (string+\\\" \\\").iterator sliding 2 map (_.toList) map cleanSurrogate toList\\n\\n def recurse(fwd: List[List[Char]], rev: List[Char]): String = fwd match {\\n case Nil => rev.mkString\\n case c :: rest =>\\n val (combining, remaining) = rest span isCombining\\n recurse(remaining, c ::: combining.foldLeft(List[Char]())(_ ::: _) ::: rev)\\n }\\n recurse(splitString(s), Nil)\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (string-reverse s)\\n (list->string (reverse (string->list s))))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"#!/bin/sed -f\\n\\n/../! b\\n\\n# Reverse a line. Begin embedding the line between two newlines\\ns/^.*$/\\\\\\n&\\\\\\n/\\n\\n# Move first character at the end. The regexp matches until\\n# there are zero or one characters between the markers\\ntx\\n:x\\ns/\\\\(\\\\n.\\\\)\\\\(.*\\\\)\\\\(.\\\\n\\\\)/\\\\3\\\\2\\\\1/\\ntx\\n\\n# Remove the newline markers\\ns/\\\\n//g\\n\",\n \"language\": \"Sed\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst func string: reverso(in string: stri) is func\\n result\\n var string: result is \\\"\\\";\\n local\\n var integer: index is 0;\\n begin\\n for index range length(stri) downto 1 do\\n result &:= stri[index];\\n end for;\\n end func;\\n\\nconst proc: main is func\\n begin\\n writeln(reverso(\\\"Was it a cat I saw\\\"));\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst proc: main is func\\n begin\\n writeln(reverse(\\\"Was it a cat I saw?\\\"));\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"'asdf' copyMutable reverse\\n\",\n \"language\": \"Self\"\n },\n {\n \"code\": \"put \\\"asdf\\\" reversed -- reverse on the fly\\n\\nset imp to \\\"rumpelstiltskin\\\"\\nreverse imp -- reverse in place\\nput imp\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"import <Utilities/Sequence.sl>;\\n\\nmain(args(2)) := Sequence::reverse(args[1]);\\n\",\n \"language\": \"SequenceL\"\n },\n {\n \"code\": \"reverse<T> : T(1) -> T(1);\\t\\nreverse(list(1))[i] :=\\n\\tlet\\n\\t\\trange := - ((1 ... size(list)) - (size(list) + 1));\\n\\tin\\n\\t\\tlist[i] foreach i within range;\\n\",\n \"language\": \"SequenceL\"\n },\n {\n \"code\": \"\\\"asdf\\\".reverse; # fdsa\\n\\\"résumé niño\\\".reverse; # oñin émusér\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"BEGIN\\n TEXT PROCEDURE REV(S); TEXT S;\\n BEGIN\\n TEXT T;\\n INTEGER L,R;\\n T :- COPY(S);\\n L := 1; R := T.LENGTH;\\n WHILE L < R DO\\n BEGIN\\n CHARACTER CL,CR;\\n T.SETPOS(L); CL := T.GETCHAR;\\n T.SETPOS(R); CR := T.GETCHAR;\\n T.SETPOS(L); T.PUTCHAR(CR);\\n T.SETPOS(R); T.PUTCHAR(CL);\\n L := L+1;\\n R := R-1;\\n END;\\n REV :- T;\\n END REV;\\n\\n TEXT INP;\\n INP :- \\\"asdf\\\";\\n\\n OUTTEXT(INP); OUTIMAGE;\\n OUTTEXT(REV(INP)); OUTIMAGE;\\nEND\\n\",\n \"language\": \"Simula\"\n },\n {\n \"code\": \"10 INPUT S$\\n20 LET T$=\\\"\\\"\\n30 FOR I=LEN S$ TO 1 STEP -1\\n40 LET T$=T$+S$(I)\\n50 NEXT I\\n60 PRINT T$\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"'asdf' reverse\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"'asdf' reversed\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"'asdf' reverse\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"'asdf' reversed\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"\\toutput = reverse(reverse(\\\"reverse\\\"))\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"val str_reverse = implode o rev o explode;\\nval string = \\\"asdf\\\";\\nval reversed = str_reverse string;\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \". scalar s=\\\"ARS LONGA VITA BREVIS\\\"\\n. di strreverse(s)\\nSIVERB ATIV AGNOL SRA\\n. scalar s=\\\"Ἐν ἀρχῇ ἐποίησεν ὁ θεὸς τὸν οὐρανὸν καὶ τὴν γῆν\\\"\\n. di ustrreverse(s)\\nνῆγ νὴτ ὶακ νὸναρὐο νὸτ ςὸεθ ὁ νεσηίοπἐ ῇχρἀ νἘ\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"$ \\\\$\\n\",\n \"language\": \"Stringle\"\n },\n {\n \"code\": \"func reverseString(s: String) -> String {\\n return String(s.characters.reverse())\\n}\\nprint(reverseString(\\\"asdf\\\"))\\nprint(reverseString(\\\"as⃝df̅\\\"))\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"func reverseString(s: String) -> String {\\n return String(reverse(s))\\n}\\nprintln(reverseString(\\\"asdf\\\"))\\nprintln(reverseString(\\\"as⃝df̅\\\"))\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"| reverse string\\n\\nc : 'abcdefghijklmnopqrstuvwxyz'\\nd : ' '\\n\\n c []\\n i\\n #c j\\n - j\\n if i < j\\n c.i d 1\\n c.j c.i 1\\n d c.j\\n - j\\n + i\\n goif\\n endif\\n c []\\n\",\n \"language\": \"Symsyn\"\n },\n {\n \"code\": \"c : 'abcdefghijklmnopqrstuvwxyz'\\n\\n c []\\n $s\\n #c j\\n if j > 0\\n - j\\n + c.j $s 1\\n goif\\n endif\\n $s []\\n\",\n \"language\": \"Symsyn\"\n },\n {\n \"code\": \"templates reverse\\n '$:[ $... ] -> $(last..first:-1)...;' !\\nend reverse\\n\\n'asdf' -> reverse -> !OUT::write\\n\\n'\\n' -> !OUT::write\\n\\n'as⃝df̅' -> reverse -> !OUT::write\\n\",\n \"language\": \"Tailspin\"\n },\n {\n \"code\": \"package require Tcl 8.5\\nstring reverse asdf\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \":Str1\\n:For(I,1,length(Ans)-1\\n:sub(Ans,2I,1)+Ans\\n:End\\n:sub(Ans,1,I→Str1\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"prog: parse(str);\\nstr: smark any(!<<>>) scopy str/done = { 1 2 };\\ndone: ;\\n\",\n \"language\": \"TMG\"\n },\n {\n \"code\": \"when flag clicked\\nask \\\"Say something...\\\" and wait\\nset i to (length of answer)\\nset inv to \\\"\\\"\\nrepeat until i = 0\\n\\tset inv to (join (inv) (letter (i) of answer))\\n\\tchange i by -1\\nend\\nsay inv\\n\",\n \"language\": \"Tosh\"\n },\n {\n \"code\": \"#lang transd\\n\\nMainModule : {\\n _start: (lambda (with s \\\"as⃝df̅\\\"\\n (textout (reverse s))\\n\\n // reversing user input\\n (textout \\\"\\\\nPlease, enter a string: \\\")\\n (textout \\\"Input: \\\" (reverse (read s)))\\n ))\\n}\\n\",\n \"language\": \"Transd\"\n },\n {\n \"code\": \"FUNCTION reverse$(a$)\\n LET b$ = \\\"\\\"\\n FOR i = 1 TO LEN(a$)\\n LET b$ = (a$)[i:i+1-1] & b$\\n NEXT i\\n LET reverse$ = b$\\nEND FUNCTION\\n\\nLET s$ = \\\"asdf\\\"\\nPRINT \\\"'\\\"; s$; \\\"' reversed is '\\\"; reverse$(s$); \\\"'\\\"\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"function reverse (s : string) : string\\n var rs := \\\"\\\"\\n for i : 0 .. length (s) - 1\\n rs := rs + s (length (s) - i)\\n end for\\n result rs\\nend reverse\\n\\nput reverse (\\\"iterative example\\\")\\nput reverse (reverse (\\\"iterative example\\\"))\\n\",\n \"language\": \"Turing\"\n },\n {\n \"code\": \"function reverse (s : string) : string\\n if s = \\\"\\\" then\\n result s\\n else\\n result reverse (s (2 .. *)) + s (1)\\n end if\\nend reverse\\n\\nput reverse (\\\"recursive example\\\")\\nput reverse (reverse (\\\"recursive example\\\"))\\n\",\n \"language\": \"Turing\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nSET input=\\\"was it really a big fat cat i saw\\\"\\nSET reversetext=TURN (input)\\nPRINT \\\"before: \\\",input\\nPRINT \\\"after: \\\",reversetext\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"#!/bin/bash\\nstr=abcde\\n\\nfor((i=${#str}-1;i>=0;i--)); do rev=\\\"$rev${str:$i:1}\\\"; done\\n\\necho $rev\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"str='i43go1342iu 23iu4o 23iu14i324y 2i13'\\nrev <<< \\\"$str\\\"\\n#rev is not built-in function, though is in /usr/bin/rev\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"``@c`d``s`|k`@c\\n\",\n \"language\": \"Unlambda\"\n },\n {\n \"code\": \"#import std\\n\\n#cast %s\\n\\nexample = ~&x 'asdf'\\n\\nverbose_example = reverse 'asdf'\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"const list =\\n('\\nHello world!\\n你好世界！\\nSalamu, Dunia!\\nこんにちは世界！\\n¡Hola Mundo!\\nChào thế giới!\\nHallo Welt!\\n')\\n\\nfn main() {\\n for line in list.split('\\\\n') {if line !='' {println(reverse_string(line))}}\\n}\\n\\nfn reverse_string(word string) string {\\n return word.runes().reverse().string()\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"int main (string[] args) {\\n\\tif (args.length < 2) {\\n\\t\\tstdout.printf (\\\"Please, input a string.\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\tvar str = new StringBuilder ();\\n\\tfor (var i = 1; i < args.length; i++) {\\n\\t\\tstr.append (args[i] + \\\" \\\");\\n\\t}\\n\\tstdout.printf (\\\"%s\\\\n\\\", str.str.strip ().reverse ());\\n\\treturn 0;\\n}\\n\",\n \"language\": \"Vala\"\n },\n {\n \"code\": \"Public Function Reverse(aString as String) as String\\n' returns the reversed string\\ndim L as integer 'length of string\\ndim newString as string\\n\\nnewString = \\\"\\\"\\nL = len(aString)\\nfor i = L to 1 step -1\\n newString = newString & mid$(aString, i, 1)\\nnext\\nReverse = newString\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Public Function RReverse(aString As String) As String\\n'returns the reversed string\\n'do it recursively: cut the string in two, reverse these fragments and put them back together in reverse order\\nDim L As Integer 'length of string\\nDim M As Integer 'cut point\\n\\nL = Len(aString)\\nIf L <= 1 Then 'no need to reverse\\n RReverse = aString\\nElse\\n M = Int(L / 2)\\n RReverse = RReverse(Right$(aString, L - M)) & RReverse(Left$(aString, M))\\nEnd If\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"WScript.Echo StrReverse(\\\"asdf\\\")\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"Reg_Empty(10)\\nfor (BOL; !At_EOL; Char) {\\n Reg_Copy_Block(10, CP, CP+1, INSERT)\\n}\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"BOL\\nwhile (!At_EOL) {\\n Block_Copy(EOL_pos-1, EOL_pos, DELETE)\\n}\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"Debug.Print VBA.StrReverse(\\\"Visual Basic\\\")\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"#Const REDIRECTOUT = True\\n\\nModule Program\\n Const OUTPATH = \\\"out.txt\\\"\\n\\n ReadOnly TestCases As String() = {\\\"asdf\\\", \\\"as⃝df̅\\\", \\\"Les Misérables\\\"}\\n\\n ' SIMPLE VERSION\\n Function Reverse(s As String) As String\\n Dim t = s.ToCharArray()\\n Array.Reverse(t)\\n Return New String(t)\\n End Function\\n\\n ' EXTRA CREDIT VERSION\\n Function ReverseElements(s As String) As String\\n ' In .NET, a text element is series of code units that is displayed as one character, and so reversing the text\\n ' elements of the string correctly handles combining character sequences and surrogate pairs.\\n Dim elements = Globalization.StringInfo.GetTextElementEnumerator(s)\\n Return String.Concat(AsEnumerable(elements).OfType(Of String).Reverse())\\n End Function\\n\\n ' Wraps an IEnumerator, allowing it to be used as an IEnumerable.\\n Iterator Function AsEnumerable(enumerator As IEnumerator) As IEnumerable\\n Do While enumerator.MoveNext()\\n Yield enumerator.Current\\n Loop\\n End Function\\n\\n Sub Main()\\n Const INDENT = \\\" \\\"\\n\\n#If REDIRECTOUT Then\\n Const OUTPATH = \\\"out.txt\\\"\\n Using s = IO.File.Open(OUTPATH, IO.FileMode.Create),\\n sw As New IO.StreamWriter(s)\\n Console.SetOut(sw)\\n#Else\\n Try\\n Console.OutputEncoding = Text.Encoding.ASCII\\n Console.OutputEncoding = Text.Encoding.UTF8\\n Console.OutputEncoding = Text.Encoding.Unicode\\n Catch ex As Exception\\n Console.WriteLine(\\\"Failed to set console encoding to Unicode.\\\" & vbLf)\\n End Try\\n#End If\\n For Each c In TestCases\\n Console.WriteLine(c)\\n Console.WriteLine(INDENT & \\\"SIMPLE: \\\" & Reverse(c))\\n Console.WriteLine(INDENT & \\\"ELEMENTS: \\\" & ReverseElements(c))\\n Console.WriteLine()\\n Next\\n#If REDIRECTOUT Then\\n End Using\\n#End If\\n End Sub\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"(rev \\\"asdf\\\")\\n\",\n \"language\": \"Wart\"\n },\n {\n \"code\": \"; the @rev operator reverses strings and arrays\\n@rev \\\"abc\\\" ; returns \\\"cba\\\"\\n; or the same thing using a pointer expression\\n!~r \\\"abc\\\"\\n\",\n \"language\": \"Wortel\"\n },\n {\n \"code\": \"import \\\"./str\\\" for Str\\nimport \\\"./upc\\\" for Graphemes\\n\\nfor (word in [\\\"asdf\\\", \\\"josé\\\", \\\"møøse\\\", \\\"was it a car or a cat I saw\\\", \\\"😀🚂🦊\\\"]) {\\n System.print(Str.reverse(word))\\n}\\n\\nfor (word in [\\\"as⃝df̅\\\", \\\"ℵΑΩ 駱駝道 🤔 🇸🇧 🇺🇸 🇬🇧 👨👩👧👦🆗🗺\\\"]) {\\n System.print(Graphemes.new(word).toList[-1..0].join())\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"PROGRAM\\t\\\"progname\\\"\\nVERSION\\t\\\"0.0000\\\"\\n\\nDECLARE FUNCTION Entry ()\\nDECLARE FUNCTION reverse$ (a$)\\n\\nFUNCTION Entry ()\\n s$ = \\\"asdf\\\"\\n PRINT \\\"'\\\"; s$; \\\"' reversed is '\\\"; reverse$(s$); \\\"'\\\"\\nEND FUNCTION\\n\\nFUNCTION reverse$ (a$)\\n b$ = \\\"\\\"\\n FOR i = 1 TO LEN(a$)\\n b$ = MID$(a$, i, 1) + b$\\n NEXT i\\n RETURN b$\\nEND FUNCTION\\nEND PROGRAM\\n\",\n \"language\": \"XBasic\"\n },\n {\n \"code\": \"log(string.reverse(\\\"Hello\\\"))\\n\",\n \"language\": \"XBS\"\n },\n {\n \"code\": \"log(\\\"Hello\\\"->split(\\\"\\\")->reverse()->join(\\\"\\\"));\\n\",\n \"language\": \"XBS\"\n },\n {\n \"code\": \"func ReverseString(String){\\n\\tset Final = \\\"\\\";\\n\\tfor(i=?String-1;0;-1){\\n\\t\\tFinal+=String[i];\\n\\t}\\n\\tsend Final;\\n}\\nlog(ReverseString(\\\"Hello\\\"));\\n\",\n \"language\": \"XBS\"\n },\n {\n \"code\": \"include c:\\\\cxpl\\\\codes; \\\\intrinsic 'code' declarations\\nstring 0; \\\\use zero-terminated strings, instead of MSb terminated\\n\\nfunc StrLen(Str); \\\\Return the number of characters in an ASCIIZ string\\nchar Str;\\nint I;\\nfor I:= 0 to -1>>1-1 do\\n if Str(I) = 0 then return I;\\n\\nfunc RevStr(S); \\\\Reverse the order of the bytes in a string\\nchar S;\\nint L, I, T;\\n[L:= StrLen(S);\\nfor I:= 0 to L/2-1 do\\n [T:= S(I); S(I):= S(L-I-1); S(L-I-1):= T];\\nreturn S;\\n];\\n\\n[Text(0, RevStr(\\\"a\\\")); CrLf(0);\\n Text(0, RevStr(\\\"ab\\\")); CrLf(0);\\n Text(0, RevStr(\\\"abc\\\")); CrLf(0);\\n Text(0, RevStr(\\\"Able was I ere I saw Elba.\\\")); CrLf(0);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"s$ = \\\"asdf\\\"\\nprint \\\"'\\\", s$, \\\"' reversed is '\\\", reverse$(s$), \\\"'\\\"\\nend\\n\\nsub reverse$(a$)\\n\\tb$ = \\\"\\\"\\n\\tfor i = 1 to len(a$)\\n\\t\\tb$ = mid$(a$, i, 1) + b$\\n\\tnext i\\n\\treturn b$\\nend sub\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"strchar(strchar(\\\"asdf\\\")(:-1)(::-1))\\n\",\n \"language\": \"Yorick\"\n },\n {\n \"code\": \"PrintChar equ $BB5A ;Amstrad CPC bios call\\nTerminator equ 0 ;null terminator for strings\\n\\n\\norg $8000\\nld hl, StringA\\ncall ReverseString\\n\\nld hl, StringA\\ncall PrintString\\n\\nret ;return to basic\\n\\nStringA:\\nbyte \\\"12345678\\\",0\\n\\n;;;; SUBROUTINES\\nGetStringLength:\\n;HL = STRING. RETURNS LENGTH IN B. LENGTH IS ONE-INDEXED AND DOES NOT INCLUDE TERMINATOR.\\n\\t\\tld b,0 ;clear B\\nloop_getStringLength:\\n\\t\\tld a,(hl) ;read the next char\\n\\t\\tcp Terminator ;is it the terminator?\\n\\t\\tret z ;if so, exit\\n\\t\\tinc hl ;point HL to next character\\n\\t\\tinc b ;increase tally\\n\\t\\tjr loop_getStringLength ;repeat\\n\\nReverseString:\\n\\t;reverse the order of letters in a text string.\\n\\t;e.g. \\\"ABCD\\\" -> \\\"DCBA\\\"\\n\\t;the terminator stays put.\\n\\t;INPUT: HL = SOURCE ADDRESS OF STRING\\n\\tpush de\\n\\t\\tpush hl\\n\\t\\t\\tpush hl\\n\\t\\t call GetStringLength\\n\\t\\t\\tpop hl\\n\\t\\tpop de\\t\\t ;LD DE,HL\\n\\t\\tLD a,b ;LOAD B INTO A\\n\\t\\tLD (SMC_ReverseString+1),a ;STORE IT LATER IN THE CODE SO WE CAN RETRIEVE IT.\\n\\t\\t\\n; TO RECAP, BOTH HL AND DE POINT TO THE BEGINNING OF THE STRING WE WANT TO REVERSE. B EQUALS THE LENGTH OF THE STRING.\\n; B HAS BEEN BACKED UP WITHOUT USING THE STACK BY STORING IT AS THE OPERAND OF A LATER INSTRUCTION THAT LOADS B WITH A NUMERIC VALUE.\\n; PUSH BC WOULD NOT HAVE WORKED SINCE THE PROGRAM NEEDS TO PUSH EACH LETTER OF THE STRING DURING THE LOOP.\\n\\nLOOP_REVERSESTRING_PUSH:\\n;start at the beginning of the string and push each letter in it, except the terminator.\\n\\t\\tld a,(de)\\n\\t\\tpush af\\n\\t\\tinc de\\n\\t\\tdjnz LOOP_REVERSESTRING_PUSH\\n\\t\\t\\nSMC_ReverseString:\\n\\t\\tld b,$42\\t;LETS US PRESERVE B WITHOUT PUSHING IT. THE $42 IS OVERWRITTEN WITH THE STRING'S LENGTH.\\n\\t\\t\\nLOOP_REVERSESTRING_POP:\\n;Starting at the beginning of the string, pop A off the stack and store it into the string. This puts the letters back in the reverse\\n; order.\\n\\t\\tpop af\\n\\t\\tld (hl),a\\n\\t\\tinc hl\\n\\t\\tdjnz LOOP_REVERSESTRING_POP\\n\\tpop de\\n\\tret\\n\",\n \"language\": \"Z80-Assembly\"\n },\n {\n \"code\": \"var s = \\\"socat\\\".*;\\nstd.mem.reverse(u8, &s);\\n\",\n \"language\": \"Zig\"\n },\n {\n \"code\": \"var s = \\\"socat\\\".*;\\nstd.mem.reverse(u8, s[0..]);\\n\",\n \"language\": \"Zig\"\n },\n {\n \"code\": \"program: reverse_string\\n input: xyzzy\\n output: yzzyx\\n\",\n \"language\": \"Zoea\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Reverse-a-string"}}},{"rowIdx":1584,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Reverse_words_in_a_string\n","language":"00-META"},{"code":";Task:\nReverse the order of all tokens in each of a number of strings and display the result; the order of characters within a token should not be modified.\n\n\n;Example:\n<big><big><code>Hey you, Bub! </code></big></big> would be shown reversed as: <big><big><code> Bub! you, Hey </code></big></big>\n\n\nTokens are any non-space characters separated by spaces (formally, white-space); the visible punctuation form part of the word within which it is located and should not be modified. \n\nYou may assume that there are no significant non-visible characters in the input. Multiple or superfluous spaces may be compressed into a single space.\n\nSome strings have no tokens, so an empty string (or one just containing spaces) would be the result.\n\n'''Display''' the strings in order (1<sup>st</sup>, 2<sup>nd</sup>, 3<sup>rd</sup>, ···), and one string per line. \n\n(You can consider the ten strings as ten lines, and the tokens as words.)\n\n\n;Input data\n<pre>\n (ten lines within the box)\n line\n ╔════════════════════════════════════════╗\n 1 ║ ---------- Ice and Fire ------------ ║\n 2 ║ ║ ◄─── a blank line here.\n 3 ║ fire, in end will world the say Some ║\n 4 ║ ice. in say Some ║\n 5 ║ desire of tasted I've what From ║\n 6 ║ fire. favor who those with hold I ║\n 7 ║ ║ ◄─── a blank line here.\n 8 ║ ... elided paragraph last ... ║\n 9 ║ ║ ◄─── a blank line here.\n 10 ║ Frost Robert ----------------------- ║\n ╚════════════════════════════════════════╝\n</pre>\n\n;Cf.\n* [[Phrase reversals]]\n<br><br>\n\n","language":"00-TASK"},{"code":"V text =\n‘---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------’\n\nL(line) text.split(\"\\n\")\n print(reversed(line.split(‘ ’)).join(‘ ’))\n","language":"11l"},{"code":"PROC Reverse(CHAR ARRAY src,dst)\n BYTE i,j,k,beg,end\n\n i=1 j=src(0)\n WHILE j>0\n DO\n WHILE j>0 AND src(j)=$20\n DO j==-1 OD\n IF j=0 THEN\n EXIT\n ELSE\n end=j\n FI\n\n WHILE j>0 AND src(j)#$20\n DO j==-1 OD\n beg=j+1\n\n IF i>1 THEN\n dst(i)=$20 i==+1\n FI\n\n FOR k=beg TO end\n DO\n dst(i)=src(k) i==+1\n OD\n OD\n dst(0)=i-1\nRETURN\n\nPROC Test(CHAR ARRAY src)\n CHAR ARRAY dst(40)\n\n Reverse(src,dst)\n PrintE(dst)\nRETURN\n\nPROC Main()\n Test(\"---------- Ice and Fire ------------\")\n Test(\"\")\n Test(\"fire, in end will world the say Some\")\n Test(\"ice. in say Some\")\n Test(\"desire of tasted I've what From\")\n Test(\"fire. favor who those with hold I\")\n Test(\"\")\n Test(\"... elided paragraph last ...\")\n Test(\"\")\n Test(\"Frost Robert -----------------------\")\nRETURN\n","language":"Action-"},{"code":"package Simple_Parse is\n -- a very simplistic parser, useful to split a string into words\n\n function Next_Word(S: String; Point: in out Positive)\n\t\t return String;\n -- a \"word\" is a sequence of non-space characters\n -- if S(Point .. S'Last) holds at least one word W\n -- then Next_Word increments Point by len(W) and returns W.\n -- else Next_Word sets Point to S'Last+1 and returns \"\"\n\nend Simple_Parse;\n","language":"Ada"},{"code":"package body Simple_Parse is\n\n function Next_Word(S: String; Point: in out Positive) return String is\n Start: Positive := Point;\n Stop: Natural;\n begin\n while Start <= S'Last and then S(Start) = ' ' loop\n\t Start := Start + 1;\n end loop; -- now S(Start) is the first non-space,\n\t\t-- or Start = S'Last+1 if S is empty or space-only\n Stop := Start-1; -- now S(Start .. Stop) = \"\"\n while Stop < S'Last and then S(Stop+1) /= ' ' loop\n\t Stop := Stop + 1;\n end loop; -- now S(Stop+1) is the first sopace after Start\n\t\t-- or Stop = S'Last if there is no such space\n Point := Stop+1;\n return S(Start .. Stop);\n end Next_Word;\n\nend Simple_Parse;\n","language":"Ada"},{"code":"with Ada.Text_IO, Simple_Parse;\n\nprocedure Reverse_Words is\n\n function Reverse_Words(S: String) return String is\n Cursor: Positive := S'First;\n Word: String := Simple_Parse.Next_Word(S, Cursor);\n begin\n if Word = \"\" then\n return \"\";\n else\n return Reverse_Words(S(Cursor .. S'Last)) & \" \" & Word;\n end if;\n end Reverse_Words;\n\n use Ada.Text_IO;\nbegin\n while not End_Of_File loop\n Put_Line(Reverse_Words(Get_Line)); -- poem is read from standard input\n end loop;\nend Reverse_Words;\n","language":"Ada"},{"code":"integer j;\nlist l, x;\ntext s, t;\n\nl = list(\"---------- Ice and Fire ------------\",\n \"\",\n \"fire, in end will world the say Some\",\n \"ice. in say Some\",\n \"desire of tasted I've what From\",\n \"fire. favor who those with hold I\",\n \"\",\n \"... elided paragraph last ...\",\n \"\",\n \"Frost Robert -----------------------\");\n\nfor (, t in l) {\n file().b_affix(t).list(x, 0);\n for (j, s in x.reverse) {\n o_space(sign(j));\n o_text(s);\n }\n o_newline();\n}\n","language":"Aime"},{"code":"# returns original phrase with the order of the words reversed #\n# a word is a sequence of non-blank characters #\nPROC reverse word order = ( STRING original phrase )STRING:\n BEGIN\n STRING words reversed := \"\";\n STRING separator := \"\";\n INT start pos := LWB original phrase;\n WHILE\n # skip leading spaces #\n WHILE IF start pos <= UPB original phrase\n THEN original phrase[ start pos ] = \" \"\n ELSE FALSE\n FI\n DO start pos +:= 1\n OD;\n start pos <= UPB original phrase\n DO\n # have another word, find it #\n INT end pos := start pos;\n WHILE IF end pos <= UPB original phrase\n THEN original phrase[ end pos ] /= \" \"\n ELSE FALSE\n FI\n DO end pos +:= 1\n OD;\n ( original phrase[ start pos : end pos - 1 ] + separator ) +=: words reversed;\n separator := \" \";\n start pos := end pos + 1\n OD;\n words reversed\n END # reverse word order # ;\n\n# reverse the words in the lines as per the task #\nprint( ( reverse word order ( \"--------- Ice and Fire ------------ \" ), newline ) );\nprint( ( reverse word order ( \" \" ), newline ) );\nprint( ( reverse word order ( \"fire, in end will world the say Some\" ), newline ) );\nprint( ( reverse word order ( \"ice. in say Some \" ), newline ) );\nprint( ( reverse word order ( \"desire of tasted I've what From \" ), newline ) );\nprint( ( reverse word order ( \"fire. favor who those with hold I \" ), newline ) );\nprint( ( reverse word order ( \" \" ), newline ) );\nprint( ( reverse word order ( \"... elided paragraph last ... \" ), newline ) );\nprint( ( reverse word order ( \" \" ), newline ) );\nprint( ( reverse word order ( \"Frost Robert -----------------------\" ), newline ) )\n","language":"ALGOL-68"},{"code":"on run\n\n unlines(map(reverseWords, |lines|(\"---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\")))\n\nend run\n\n\n-- GENERIC FUNCTIONS ---------------------------------------------------------\n\n-- reverseWords :: String -> String\non reverseWords(str)\n unwords(|reverse|(|words|(str)))\nend reverseWords\n\n-- |reverse| :: [a] -> [a]\non |reverse|(xs)\n if class of xs is text then\n (reverse of characters of xs) as text\n else\n reverse of xs\n end if\nend |reverse|\n\n-- |lines| :: Text -> [Text]\non |lines|(str)\n splitOn(linefeed, str)\nend |lines|\n\n-- |words| :: Text -> [Text]\non |words|(str)\n splitOn(space, str)\nend |words|\n\n-- ulines :: [Text] -> Text\non unlines(lstLines)\n intercalate(linefeed, lstLines)\nend unlines\n\n-- unwords :: [Text] -> Text\non unwords(lstWords)\n intercalate(space, lstWords)\nend unwords\n\n-- splitOn :: Text -> Text -> [Text]\non splitOn(strDelim, strMain)\n set {dlm, my text item delimiters} to {my text item delimiters, strDelim}\n set lstParts to text items of strMain\n set my text item delimiters to dlm\n lstParts\nend splitOn\n\n-- interCalate :: Text -> [Text] -> Text\non intercalate(strText, lstText)\n set {dlm, my text item delimiters} to {my text item delimiters, strText}\n set strJoined to lstText as text\n set my text item delimiters to dlm\n strJoined\nend intercalate\n\n-- map :: (a -> b) -> [a] -> [b]\non map(f, xs)\n tell mReturn(f)\n set lng to length of xs\n set lst to {}\n repeat with i from 1 to lng\n set end of lst to lambda(item i of xs, i, xs)\n end repeat\n return lst\n end tell\nend map\n\n-- Lift 2nd class handler function into 1st class script wrapper\n-- mReturn :: Handler -> Script\non mReturn(f)\n if class of f is script then\n f\n else\n script\n property lambda : f\n end script\n end if\nend mReturn\n","language":"AppleScript"},{"code":"100 DATA\"---------- ICE AND FIRE ------------\"\n110 DATA\" \"\n120 DATA\"FIRE, IN END WILL WORLD THE SAY SOME\"\n130 DATA\"ICE. IN SAY SOME \"\n140 DATA\"DESIRE OF TASTED I'VE WHAT FROM \"\n150 DATA\"FIRE. FAVOR WHO THOSE WITH HOLD I \"\n160 DATA\" \"\n170 DATA\"... ELIDED PARAGRAPH LAST ... \"\n180 DATA\" \"\n190 DATA\"FROST ROBERT -----------------------\"\n\n200 FOR L = 1 TO 10\n210 READ T$\n220 I = LEN(T$)\n240 IF I THEN GOSUB 300 : PRINT W$; : IF I THEN PRINT \" \"; : GOTO 240\n250 PRINT\n260 NEXT L\n270 END\n\n300 W$ = \"\"\n310 FOR I = I TO 1 STEP -1\n320 IF MID$(T$, I, 1) = \" \" THEN NEXT I : RETURN\n330 FOR I = I TO 1 STEP -1\n340 C$ = MID$(T$, I, 1)\n350 IF C$ <> \" \" THEN W$ = C$ + W$ : NEXT I\n360 RETURN\n","language":"Applesoft-BASIC"},{"code":"text: {\n---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------}\n\nreversed: map split.lines text =>\n [join.with:\" \" reverse split.words &]\n\nprint join.with:\"\\n\" reversed\n","language":"Arturo"},{"code":"Data := \"\n(Join`r`n\n---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\n)\"\n\nLoop, Parse, Data, `n, `r\n{\n\tLoop, Parse, A_LoopField, % A_Space\n\t\tLine := A_LoopField \" \" Line\n\tOutput .= Line \"`n\", Line := \"\"\n}\nMsgBox, % RTrim(Output, \"`n\")\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f REVERSE_WORDS_IN_A_STRING.AWK\nBEGIN {\n text[++i] = \"---------- Ice and Fire ------------\"\n text[++i] = \"\"\n text[++i] = \"fire, in end will world the say Some\"\n text[++i] = \"ice. in say Some\"\n text[++i] = \"desire of tasted I've what From\"\n text[++i] = \"fire. favor who those with hold I\"\n text[++i] = \"\"\n text[++i] = \"... elided paragraph last ...\"\n text[++i] = \"\"\n text[++i] = \"Frost Robert -----------------------\"\n leng = i\n for (i=1; i<=leng; i++) {\n n = split(text[i],arr,\" \")\n for (j=n; j>0; j--) {\n printf(\"%s \",arr[j])\n }\n printf(\"\\n\")\n }\n exit(0)\n}\n","language":"AWK"},{"code":"PRINT REV$(\"---------- Ice and Fire ------------\")\nPRINT\nPRINT REV$(\"fire, in end will world the say Some\")\nPRINT REV$(\"ice. in say Some \")\nPRINT REV$(\"desire of tasted I've what From \")\nPRINT REV$(\"fire. favor who those with hold I \")\nPRINT\nPRINT REV$(\"... elided paragraph last ... \")\nPRINT\nPRINT REV$(\"Frost Robert -----------------------\")\n","language":"BaCon"},{"code":"source = freefile\nopen (source, \"m:\\text.txt\")\ntextEnt$ = \"\"\ndim textSal$(size(source)*8)\nlinea = 0\n\nwhile not eof(source)\n\ttextEnt$ = readline(source)\n\tlinea += 1\n\ttextSal$[linea] = textEnt$\nend while\n\nfor n = size(source) to 1 step -1\n\tprint textSal$[n];\nnext n\nclose source\n","language":"BASIC256"},{"code":"@echo off\n\n::The Main Thing...\ncls\necho.\ncall :reverse \"---------- Ice and Fire ------------\"\ncall :reverse\ncall :reverse \"fire, in end will world the say Some\"\ncall :reverse \"ice. in say Some\"\ncall :reverse \"desire of tasted I've what From\"\ncall :reverse \"fire. favor who those with hold I\"\ncall :reverse\ncall :reverse \"... elided paragraph last ...\"\ncall :reverse\ncall :reverse \"Frost Robert -----------------------\"\necho.\npause>nul\nexit\n::/The Main Thing...\n\n::The Function...\n:reverse\nset reversed=&set word=&set str=%1\n:process\nfor /f \"tokens=1,*\" %%A in (%str%) do (\n\tset str=%%B\n\tset word=%%A\n)\nset reversed=%word% %reversed%\nset str=\"%str%\"\nif not %str%==\"\" goto process\n\necho.%reversed%\ngoto :EOF\n::/The Function...\n","language":"Batch-File"},{"code":" PRINT FNreverse(\"---------- Ice and Fire ------------\")\\\n \\ 'FNreverse(\"\")\\\n \\ 'FNreverse(\"fire, in end will world the say Some\")\\\n \\ 'FNreverse(\"ice. in say Some\")\\\n \\ 'FNreverse(\"desire of tasted I've what From\")\\\n \\ 'FNreverse(\"fire. favor who those with hold I\")\\\n \\ 'FNreverse(\"\")\\\n \\ 'FNreverse(\"... elided paragraph last ...\")\\\n \\ 'FNreverse(\"\")\\\n \\ 'FNreverse(\"Frost Robert -----------------------\")\n END\n\n DEF FNreverse(s$)\n LOCAL sp%\n sp%=INSTR(s$,\" \")\n IF sp% THEN =FNreverse(MID$(s$,sp%+1))+\" \"+LEFT$(s$,sp%-1) ELSE =s$\n","language":"BBC-BASIC"},{"code":"Split ← +`∘<⟜»⊸×⊸-⟜¬∘>⟜' '⊸⊔\nJoin ← (⊣∾' '∾⊢)´⍟(1<≡)\n\ntext ← ⍉≍⟨\n\"---------- Ice and Fire ------------\"\n\"\"\n\"fire, in end will world the say Some\"\n\"ice. in say Some \"\n\"desire of tasted I've what From \"\n\"fire. favor who those with hold I \"\n\"\"\n\"... elided paragraph last ...\"\n\"\"\n\"Frost Robert -----------------------\"⟩\n\nJoin∘⌽∘Split¨ text\n","language":"BQN"},{"code":"{(⍒+`∨⟜»' '=𝕩)⊏𝕩}¨ text\n","language":"BQN"},{"code":"(\"---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\"\n : ?text\n& ( reverse\n = token tokens reversed\n . :?tokens\n & whl\n ' ( @( !arg\n : ?token (\" \"|\\t|\\r) ?arg\n )\n & !tokens !token:?tokens\n )\n & !tokens !arg:?tokens\n & :?reversed\n & whl\n ' ( !tokens:%?token %?tokens\n & \" \" !token !reversed:?reversed\n )\n & !tokens !reversed:?reversed\n & str$!reversed\n )\n& :?output\n& whl\n ' ( @(!text:?line \\n ?text)\n & !output reverse$!line \\n:?output\n )\n& !output reverse$!text:?output\n& out$str$!output\n);\n","language":"Bracmat"},{"code":"blsq ) \"It is not raining\"wd<-wd\n\"raining not is It\"\nblsq ) \"ice. in say some\"wd<-wd\n\"some say in ice.\"\n","language":"Burlesque"},{"code":"#include <stdio.h>\n#include <ctype.h>\n\nvoid rev_print(char *s, int n)\n{\n for (; *s && isspace(*s); s++);\n if (*s) {\n char *e;\n for (e = s; *e && !isspace(*e); e++);\n rev_print(e, 0);\n printf(\"%.*s%s\", (int)(e - s), s, \" \" + n);\n }\n if (n) putchar('\\n');\n}\n\nint main(void)\n{\n char *s[] = {\n \"---------- Ice and Fire ------------\",\n \" \",\n \"fire, in end will world the say Some\",\n \"ice. in say Some \",\n \"desire of tasted I've what From \",\n \"fire. favor who those with hold I \",\n \" \",\n \"... elided paragraph last ... \",\n \" \",\n \"Frost Robert -----------------------\",\n 0\n };\n int i;\n for (i = 0; s[i]; i++) rev_print(s[i], 1);\n\n return 0;\n}\n","language":"C"},{"code":"#include <algorithm>\n#include <functional>\n#include <string>\n#include <iostream>\n#include <vector>\n\n//code for a C++11 compliant compiler\ntemplate <class BidirectionalIterator, class T>\nvoid block_reverse_cpp11(BidirectionalIterator first, BidirectionalIterator last, T const& separator) {\n std::reverse(first, last);\n auto block_last = first;\n do {\n using std::placeholders::_1;\n auto block_first = std::find_if_not(block_last, last,\n std::bind(std::equal_to<T>(),_1, separator));\n block_last = std::find(block_first, last, separator);\n std::reverse(block_first, block_last);\n } while(block_last != last);\n}\n\n//code for a C++03 compliant compiler\ntemplate <class BidirectionalIterator, class T>\nvoid block_reverse_cpp03(BidirectionalIterator first, BidirectionalIterator last, T const& separator) {\n std::reverse(first, last);\n BidirectionalIterator block_last = first;\n do {\n BidirectionalIterator block_first = std::find_if(block_last, last,\n std::bind2nd(std::not_equal_to<T>(), separator));\n block_last = std::find(block_first, last, separator);\n std::reverse(block_first, block_last);\n } while(block_last != last);\n}\n\nint main() {\n std::string str1[] =\n {\n \"---------- Ice and Fire ------------\",\n \"\",\n \"fire, in end will world the say Some\",\n \"ice. in say Some\",\n \"desire of tasted I've what From\",\n \"fire. favor who those with hold I\",\n \"\",\n \"... elided paragraph last ...\",\n \"\",\n \"Frost Robert -----------------------\"\n };\n\n std::for_each(begin(str1), end(str1), [](std::string& s){\n block_reverse_cpp11(begin(s), end(s), ' ');\n std::cout << s << std::endl;\n });\n\n std::for_each(begin(str1), end(str1), [](std::string& s){\n block_reverse_cpp03(begin(s), end(s), ' ');\n std::cout << s << std::endl;\n });\n\n return 0;\n}\n","language":"C++"},{"code":"#include <string>\n#include <iostream>\nusing namespace std;\n\nstring invertString( string s )\n{\n string st, tmp;\n for( string::iterator it = s.begin(); it != s.end(); it++ )\n {\n if( *it != 32 ) tmp += *it;\n else\n {\n st = \" \" + tmp + st;\n tmp.clear();\n }\n }\n return tmp + st;\n}\n\nint main( int argc, char* argv[] )\n{\n string str[] =\n {\n \"---------- Ice and Fire ------------\",\n \"\",\n \"fire, in end will world the say Some\",\n \"ice. in say Some\",\n \"desire of tasted I've what From\",\n \"fire. favor who those with hold I\",\n \"\",\n \"... elided paragraph last ...\",\n \"\",\n \"Frost Robert -----------------------\"\n };\n for( int i = 0; i < 10; i++ )\n cout << invertString( str[i] ) << \"\\n\";\n\n cout << \"\\n\";\n return system( \"pause\" );\n}\n","language":"C++"},{"code":"using System;\n\npublic class ReverseWordsInString\n{\n public static void Main(string[] args)\n {\n string text = @\"\n ---------- Ice and Fire ------------\n\n fire, in end will world the say Some\n ice. in say Some\n desire of tasted I've what From\n fire. favor who those with hold I\n\n ... elided paragraph last ...\n\n Frost Robert -----------------------\n \";\n\n foreach (string line in text.Split(Environment.NewLine)) {\n //Splits on any whitespace, not just spaces\n string[] words = line.Split(default(char[]), StringSplitOptions.RemoveEmptyEntries);\n Array.Reverse(words);\n WriteLine(string.Join(\" \", words));\n }\n }\n}\n","language":"C-sharp"},{"code":"(def poem\n \"---------- Ice and Fire ------------\n\n fire, in end will world the say Some\n ice. in say Some\n desire of tasted I've what From\n fire. favor who those with hold I\n\n ... elided paragraph last ...\n\n Frost Robert -----------------------\")\n\n(dorun\n (map println (map #(apply str (interpose \" \" (reverse (re-seq #\"[^\\s]+\" %)))) (clojure.string/split poem #\"\\n\"))))\n","language":"Clojure"},{"code":" program-id. rev-word.\n data division.\n working-storage section.\n 1 text-block.\n 2 pic x(36) value \"---------- Ice and Fire ------------\".\n 2 pic x(36) value \" \".\n 2 pic x(36) value \"fire, in end will world the say Some\".\n 2 pic x(36) value \"ice. in say Some \".\n 2 pic x(36) value \"desire of tasted I've what From \".\n 2 pic x(36) value \"fire. favor who those with hold I \".\n 2 pic x(36) value \" \".\n 2 pic x(36) value \"... elided paragraph last ... \".\n 2 pic x(36) value \" \".\n 2 pic x(36) value \"Frost Robert -----------------------\".\n 1 redefines text-block.\n 2 occurs 10.\n 3 text-line pic x(36).\n 1 text-word.\n 2 wk-len binary pic 9(4).\n 2 wk-word pic x(36).\n 1 word-stack.\n 2 occurs 10.\n 3 word-entry.\n 4 word-len binary pic 9(4).\n 4 word pic x(36).\n 1 binary.\n 2 i pic 9(4).\n 2 pos pic 9(4).\n 2 word-stack-ptr pic 9(4).\n\n procedure division.\n perform varying i from 1 by 1\n until i > 10\n perform push-words\n perform pop-words\n end-perform\n stop run\n .\n\n push-words.\n move 1 to pos\n move 0 to word-stack-ptr\n perform until pos > 36\n unstring text-line (i) delimited by all space\n into wk-word count in wk-len\n pointer pos\n end-unstring\n add 1 to word-stack-ptr\n move text-word to word-entry (word-stack-ptr)\n end-perform\n .\n\n pop-words.\n perform varying word-stack-ptr from word-stack-ptr\n by -1\n until word-stack-ptr < 1\n move word-entry (word-stack-ptr) to text-word\n display wk-word (1:wk-len) space with no advancing\n end-perform\n display space\n .\n end program rev-word.\n","language":"COBOL"},{"code":"strReversed = '---------- Ice and Fire ------------\\n\\n\nfire, in end will world the say Some\\n\nice. in say Some\\n\ndesire of tasted I\\'ve what From\\n\nfire. favor who those with hold I\\n\\n\n... elided paragraph last ...\\n\\n\nFrost Robert -----------------------'\n\nreverseString = (s) ->\n s.split('\\n').map((l) -> l.split(/\\s/).reverse().join ' ').join '\\n'\n\nconsole.log reverseString(strReversed)\n","language":"CoffeeScript"},{"code":"(defun split-and-reverse (str)\n (labels\n ((iter (s lst)\n (let ((s2 (string-trim '(#\\space) s)))\n (if s2\n (let ((word-end (position #\\space s2)))\n (if (and word-end (< (1+ word-end) (length s2)))\n (iter (subseq s2 (1+ word-end))\n (cons (subseq s2 0 word-end) lst))\n (cons s2 lst)))\n lst))))\n (iter str NIL)))\n\n(defparameter *poem*\n \"---------- Ice and Fire ------------\n\n fire, in end will world the say Some\n ice. in say Some\n desire of tasted I've what From\n fire. favor who those with hold I\n\n ... elided paragraph last ...\n\n Frost Robert -----------------------\")\n\n(with-input-from-string (s *poem*)\n (loop for line = (read-line s NIL)\n while line\n do (format t \"~{~a~#[~:; ~]~}~%\" (split-and-reverse line))))\n","language":"Common-Lisp"},{"code":"void main() {\n import std.stdio, std.string, std.range, std.algorithm;\n\n immutable text =\n\"---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\";\n\n writefln(\"%(%-(%s %)\\n%)\",\n text.splitLines.map!(r => r.split.retro));\n}\n","language":"D"},{"code":"program RosettaCode_ReverseWordsInAString;\n\n{$APPTYPE CONSOLE}\n\nuses Classes, Types, StrUtils;\n\nconst\n TXT =\n '---------- Ice and Fire -----------'+sLineBreak+\n sLineBreak+\n 'fire, in end will world the say Some'+sLineBreak+\n 'ice. in say Some'+sLineBreak+\n 'desire of tasted I''ve what From'+sLineBreak+\n 'fire. favor who those with hold I'+sLineBreak+\n sLineBreak+\n '... elided paragraph last ...'+sLineBreak+\n sLineBreak+\n 'Frost Robert -----------------------'+sLineBreak;\n\nvar\n i, w: Integer;\n d: TStringDynArray;\nbegin\n with TStringList.Create do\n try\n Text := TXT;\n for i := 0 to Count - 1 do\n begin\n d := SplitString(Strings[i], #32);\n Strings[i] := '';\n for w := Length(d) - 1 downto 0 do\n Strings[i] := Strings[i] + #32 + d[w];\n end;\n Writeln(Text);\n finally\n Free\n end;\n ReadLn;\nend.\n","language":"Delphi"},{"code":"repeat\n s$ = input\n until error = 1\n s$[] = strsplit s$ \" \"\n for i = len s$[] downto 1\n write s$[i] & \" \"\n .\n print \"\"\n.\ninput_data\n--------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\n","language":"EasyLang"},{"code":"(define S #<<\n---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\n>>#)\n\t\t\t\n(for-each writeln\n (for/list ((line (string-split S \"\\n\")))\n (string-join (reverse (string-split line \" \")) \" \")))\n","language":"EchoLisp"},{"code":"import extensions;\nimport system'routines;\n\npublic program()\n{\n var text := new string[]{\"---------- Ice and Fire ------------\",\n \"\",\n \"fire, in end will world the say Some\",\n \"ice. in say Some\",\n \"desire of tasted I've what From\",\n \"fire. favor who those with hold I\",\n \"\",\n \"... elided paragraph last ...\",\n \"\",\n \"Frost Robert -----------------------\"};\n\n text.forEach::(line)\n {\n line.splitBy(\" \").sequenceReverse().forEach::(word)\n {\n console.print(word,\" \")\n };\n console.writeLine()\n }\n}\n","language":"Elena"},{"code":"defmodule RC do\n def reverse_words(txt) do\n txt |> String.split(\"\\n\") # split lines\n |> Enum.map(&( # in each line\n &1 |> String.split # split words\n |> Enum.reverse # reverse words\n |> Enum.join(\" \"))) # rejoin words\n |> Enum.join(\"\\n\") # rejoin lines\n end\nend\n","language":"Elixir"},{"code":"txt = \"\"\"\n---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\n\"\"\"\n\nIO.puts RC.reverse_words(txt)\n","language":"Elixir"},{"code":"reversedPoem =\n String.trim \"\"\"\n ---------- Ice and Fire ------------\n\n fire, in end will world the say Some\n ice. in say Some\n desire of tasted I've what From\n fire. favor who those with hold I\n\n ... elided paragraph last ...\n\n Frost Robert -----------------------\n \"\"\"\n\nreverseWords string =\n string |> String.words |> List.reverse |> String.join \" \"\n\nreverseLinesWords string =\n string |> String.lines |> List.map reverseWords |> String.join \"\\n\"\n\npoem =\n reverseLinesWords reversedPoem\n","language":"Elm"},{"code":"(defun reverse-words (line)\n (insert\n (format \"%s\\n\"\n (mapconcat 'identity (reverse (split-string line)) \" \"))))\n\n(defun reverse-lines (lines)\n (mapcar 'reverse-words lines))\n\n(reverse-lines\n '(\"---------- Ice and Fire ------------\"\n \"\"\n \"fire, in end will world the say Some\"\n \"ice. in say Some\"\n \"desire of tasted I've what From\"\n \"fire. favor who those with hold I\"\n \"\"\n \"... elided paragraph last ...\"\n \"\"\n \"Frost Robert ----------------------- \"))\n","language":"Emacs-Lisp"},{"code":"//Reverse words in a string. Nigel Galloway: July 14th., 2021\n[\" ---------- Ice and Fire ------------ \";\n \" \";\n \" fire, in end will world the say Some \";\n \" ice. in say Some \";\n \" desire of tasted I've what From \";\n \" fire. favour who those with hold I \";\n \" \";\n \" ... elided paragraph last ... \";\n \" \";\n \" Frost Robert ----------------------- \"]|>List.map(fun n->n.Split \" \"|>Array.filter((<>)\"\")|>Array.rev|>String.concat \" \")|>List.iter(printfn \"%s\")\n","language":"F-Sharp"},{"code":"USING: io sequences splitting ;\nIN: rosetta-code.reverse-words\n\n\"---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\"\n\n\"\\n\" split [ \" \" split reverse \" \" join ] map [ print ] each\n","language":"Factor"},{"code":": not-empty? dup 0 > ;\n: (reverse) parse-name not-empty? IF recurse THEN type space ;\n: reverse (reverse) cr ;\n\nreverse ---------- Ice and Fire ------------\nreverse\nreverse fire, in end will world the say Some\nreverse ice. in say Some\nreverse desire of tasted I've what From\nreverse fire. favor who those with hold I\nreverse\nreverse ... elided paragraph last ...\nreverse\nreverse Frost Robert -----------------------\n","language":"Forth"},{"code":" character*40 words\n character*40 reversed\n logical inblank\n ierr=0\n read (5,fmt=\"(a)\",iostat=ierr)words\n do while (ierr.eq.0)\n inblank=.true.\n ipos=1\n do i=40,1,-1\n if(words(i:i).ne.' '.and.inblank) then\n last=i\n inblank=.false.\n end if\n if(.not.inblank.and.words(i:i).eq.' ') then\n reversed(ipos:ipos+last-i)=words(i+1:last)\n ipos=ipos+last-i+1\n inblank=.true.\n end if\n if(.not.inblank.and.i.eq.1) then\n reversed(ipos:ipos+last-1)=words(1:last)\n ipos=ipos+last\n end if\n end do\n print *,words,'=> ',reversed(1:ipos-1)\n read (5,fmt=\"(a)\",iostat=ierr)words\n end do\n end\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nSub split (s As String, sepList As String, result() As String, removeEmpty As Boolean = False)\n If s = \"\" OrElse sepList = \"\" Then\n Redim result(0)\n result(0) = s\n Return\n End If\n Dim As Integer i, j, count = 0, empty = 0, length\n Dim As Integer position(Len(s) + 1)\n position(0) = 0\n\n For i = 0 To len(s) - 1\n For j = 0 to Len(sepList) - 1\n If s[i] = sepList[j] Then\n count += 1\n position(count) = i + 1\n End If\n Next j\n Next i\n\n Redim result(count)\n If count = 0 Then\n result(0) = s\n Return\n End If\n\n position(count + 1) = len(s) + 1\n\n For i = 1 To count + 1\n length = position(i) - position(i - 1) - 1\n result(i - 1 - empty) = Mid(s, position(i - 1) + 1, length)\n If removeEmpty Andalso CBool(length = 0) Then empty += 1\n Next\n\n If empty > 0 Then Redim Preserve result(count - empty)\nEnd Sub\n\nDim s As String = \"Hey you, Bub!\"\nDim a() As String\nsplit(s, \" \", a(), true)\nDim reversed As String = \"\"\nFor i As Integer = UBound(a) To LBound(a) Step -1\n reversed += a(i)\n If i > LBound(a) Then reversed += \" \"\nNext\n\nPrint \"Original String = \"; s\nPrint \"Reversed String = \"; reversed\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"lines=split[\"\\n\",\n\"\"\"---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n .. elided paragraph last ...\n\nFrost Robert -----------------------\"\"\"]\n\nfor line = lines\n println[join[\" \", reverse[split[%r/\\s+/, line]]]]\n","language":"Frink"},{"code":"include \"NSLog.incl\"\n\nCFStringRef frostStr\nCFArrayRef frostArr, tempArr\nCFMutableStringRef mutStr\nNSInteger i, count\n\nfrostStr = @\"---------- Ice and Fire ------------\\n¬\n\\n¬\nfire, in end will world the say Some\\n¬\nice. in say Some\\n¬\ndesire of tasted I've what From\\n¬\nfire. favor who those with hold I\\n¬\n\\n¬\n… elided paragraph last …\\n¬\n\\n¬\nFrost Robert -----------------------\\n\"\n\nfrostArr = fn StringComponentsSeparatedByString( frostStr, @\"\\n\" )\ncount = fn ArrayCount( frostArr )\nmutStr = fn MutableStringWithCapacity( 0 )\n\nfor i = 0 to count - 1\ntempArr = fn StringComponentsSeparatedByString( frostArr[i], @\" \" )\ntempArr = fn EnumeratorAllObjects( fn ArrayReverseObjectEnumerator( tempArr ) )\nMutableStringAppendString( mutStr, fn ArrayComponentsJoinedByString( tempArr, @\" \" ) )\nMutableStringAppendString( mutStr, @\"\\n\" )\nnext\n\nNSLog( @\"%@\", mutStr )\n\nHandleEvents\n","language":"FutureBasic"},{"code":"Public Sub Main()\nDim sString As New String[10] 'Array for the input text\nDim sLine As New String[] 'Array of each word in a line\nDim siCount0, siCount1 As Short 'Counters\nDim sOutput, sReverse, sTemp As String 'Strings\n\nsString[0] = \"---------- Ice And Fire ------------\" 'Input text\nsString[1] = \" \"\nsString[2] = \"fire, in end will world the say Some\"\nsString[3] = \"ice. in say Some \"\nsString[4] = \"desire of tasted I've what From \"\nsString[5] = \"fire. favor who those with hold I \"\nsString[6] = \" \"\nsString[7] = \"... elided paragraph last ... \"\nsString[8] = \" \"\nsString[9] = \"Frost Robert -----------------------\"\n\nFor siCount0 = 0 To 9 'To work through each line of input text\n If Trim(sString[siCount0]) = \"\" Then sString[siCount0] = \" \" 'If the line is all spaces then make it 1 space\n\n For Each sTemp In Split(Trim(sString[siCount0]), \" \") 'Split the trimmed line by spaces\n sLine.Add(sTemp) 'Add each word to the sLine array\n Next\n\n For siCount1 = sLine.max DownTo 0 'Loop from the last in the sLine array to 0\n sReverse &= sLine[siCount1] & \" \" 'Fill sReverse with words reversed, adding a space\n Next\n\n sOutput &= Trim(sReverse) & gb.NewLine 'Add the reversed words to sOutput and add a newline\n sReverse = \"\" 'Clear sReverse\n sLine.Clear 'Clear sLine array\nNext\n\nPrint sOutput 'Print the output\n\nEnd\n","language":"Gambas"},{"code":"\\L<G> <U>=@{$2} $1\n","language":"Gema"},{"code":"package main\n\nimport (\n \"fmt\"\n \"strings\"\n)\n\n// a number of strings\nvar n = []string{\n \"---------- Ice and Fire ------------\",\n \" \",\n \"fire, in end will world the say Some\",\n \"ice. in say Some \",\n \"desire of tasted I've what From \",\n \"fire. favor who those with hold I \",\n \" \",\n \"... elided paragraph last ... \",\n \" \",\n \"Frost Robert -----------------------\",\n}\n\nfunc main() {\n for i, s := range n {\n t := strings.Fields(s) // tokenize\n // reverse\n last := len(t) - 1\n for j, k := range t[:len(t)/2] {\n t[j], t[last-j] = t[last-j], k\n }\n n[i] = strings.Join(t, \" \")\n }\n // display result\n for _, t := range n {\n fmt.Println(t)\n }\n}\n","language":"Go"},{"code":"def text = new StringBuilder()\n .append('---------- Ice and Fire ------------\\n')\n .append(' \\n')\n .append('fire, in end will world the say Some\\n')\n .append('ice. in say Some \\n')\n .append('desire of tasted I\\'ve what From \\n')\n .append('fire. favor who those with hold I \\n')\n .append(' \\n')\n .append('... elided paragraph last ... \\n')\n .append(' \\n')\n .append('Frost Robert -----------------------\\n').toString()\n\ntext.eachLine { line ->\n println \"$line --> ${line.split(' ').reverse().join(' ')}\"\n}\n","language":"Groovy"},{"code":"revstr :: String -> String\nrevstr = unwords . reverse . words -- point-free style\n--equivalent:\n--revstr s = unwords (reverse (words s))\n\nrevtext :: String -> String\nrevtext = unlines . map revstr . lines -- applies revstr to each line independently\n\ntest = revtext \"---------- Ice and Fire ------------\\n\\\n \\\\n\\\n \\fire, in end will world the say Some\\n\\\n \\ice. in say Some\\n\\\n \\desire of tasted I've what From\\n\\\n \\fire. favor who those with hold I\\n\\\n \\\\n\\\n \\... elided paragraph last ...\\n\\\n \\\\n\\\n \\Frost Robert -----------------------\\n\" --multiline string notation requires \\ at end and start of lines, and \\n to be manually input\n","language":"Haskell"},{"code":"procedure main()\n every write(rWords(&input))\nend\n\nprocedure rWords(f)\n every !f ? {\n every (s := \"\") := genWords() || s\n suspend s\n }\nend\n\nprocedure genWords()\n while w := 1(tab(upto(\" \\t\")),tab(many(\" \\t\"))) || \" \" do suspend w\nend\n","language":"Icon"},{"code":"(var poem\n \"---------- Ice and Fire ------------\n\n fire, in end will world the say Some\n ice. in say Some\n desire of tasted I've what From\n fire. favor who those with hold I\n\n ... elided paragraph last ...\n\n Frost Robert -----------------------\")\n\n(function split-join by then x\n (-> x (split by) then (join by)))\n\n(split-join \"\\n\" (map @(split-join \" \" reverse)) poem)\n","language":"Insitux"},{"code":" ([:;@|.[:<;.1 ' ',]);._2]0 :0\n---------- Ice and Fire ------------\n\n fire, in end will world the say Some\n ice. in say Some\n desire of tasted I've what From\n fire. favor who those with hold I\n\n ... elided paragraph last ...\n\n Frost Robert -----------------------\n)\n ------------ Fire and Ice ----------\n\n Some say the world will end in fire,\n Some say in ice.\n From what I've tasted of desire\n I hold with those who favor fire.\n\n ... last paragraph elided ...\n\n ----------------------- Robert Frost\n","language":"J"},{"code":"echo ;:inv@|.@cut;._2 {{)n\n---------- Ice and Fire ------------\n\n fire, in end will world the say Some\n ice. in say Some\n desire of tasted I've what From\n fire. favor who those with hold I\n\n ... elided paragraph last ...\n\n Frost Robert -----------------------\n}}\n","language":"J"},{"code":"public class ReverseWords {\n\n static final String[] lines = {\n \" ----------- Ice and Fire ----------- \",\n \" \",\n \" fire, in end will world the say Some \",\n \" ice. in say Some \",\n \" desire of tasted I've what From \",\n \" fire. favor who those with hold I \",\n \" \",\n \" ... elided paragraph last ... \",\n \" Frost Robert ----------------------- \"};\n\n public static void main(String[] args) {\n for (String line : lines) {\n String[] words = line.split(\"\\\\s\");\n for (int i = words.length - 1; i >= 0; i--)\n System.out.printf(\"%s \", words[i]);\n System.out.println();\n }\n }\n}\n","language":"Java"},{"code":"package string;\n\nimport static java.util.Arrays.stream;\n\npublic interface ReverseWords {\n public static final String[] LINES = {\n \" ----------- Ice and Fire ----------- \",\n \" \",\n \" fire, in end will world the say Some \",\n \" ice. in say Some \",\n \" desire of tasted I've what From \",\n \" fire. favor who those with hold I \",\n \" \",\n \" ... elided paragraph last ... \",\n \" Frost Robert ----------------------- \"\n };\n\n public static String[] reverseWords(String[] lines) {\n return stream(lines)\n .parallel()\n .map(l -> l.split(\"\\\\s\"))\n .map(ws -> stream(ws)\n .parallel()\n .map(w -> \" \" + w)\n .reduce(\n \"\",\n (w1, w2) -> w2 + w1\n )\n )\n .toArray(String[]::new)\n ;\n }\n\n public static void main(String... arguments) {\n stream(reverseWords(LINES))\n .forEach(System.out::println)\n ;\n }\n}\n","language":"Java"},{"code":"var strReversed =\n\"---------- Ice and Fire ------------\\n\\\n\\n\\\nfire, in end will world the say Some\\n\\\nice. in say Some\\n\\\ndesire of tasted I've what From\\n\\\nfire. favor who those with hold I\\n\\\n\\n\\\n... elided paragraph last ...\\n\\\n\\n\\\nFrost Robert -----------------------\";\n\nfunction reverseString(s) {\n return s.split('\\n').map(\n function (line) {\n return line.split(/\\s/).reverse().join(' ');\n }\n ).join('\\n');\n}\n\nconsole.log(\n reverseString(strReversed)\n);\n","language":"JavaScript"},{"code":"split(\"[ \\t\\n\\r]+\") | reverse | join(\" \")\n","language":"Jq"},{"code":"$ jq -R -r -M -f reverse_words.jq IceAndFire.txt\n------------ Fire and Ice ----------\n\nSome say the world will end in fire,\nSome say in ice.\nFrom what I've tasted of desire\nI hold with those who favor fire.\n\n... last paragraph elided ...\n\n----------------------- Robert Frost\n","language":"Jq"},{"code":"var strReversed =\n\"---------- Ice and Fire ------------\\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\\n... elided paragraph last ...\\n\nFrost Robert -----------------------\";\n\nfunction reverseString(s) {\n return s.split('\\n').map(\n function (line) {\n return line.split().reverse().join(' ');\n }\n ).join('\\n');\n}\n\n;reverseString('Hey you, Bub!');\n;strReversed;\n;reverseString(strReversed);\n\n/*\n=!EXPECTSTART!=\nreverseString('Hey you, Bub!') ==> Bub! you, Hey\nstrReversed ==> ---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\nreverseString(strReversed) ==> ------------ Fire and Ice ----------\n\nSome say the world will end in fire,\nSome say in ice.\nFrom what I've tasted of desire\nI hold with those who favor fire.\n\n... last paragraph elided ...\n\n----------------------- Robert Frost\n=!EXPECTEND!=\n*/\n","language":"Jsish"},{"code":"revstring (str) = join(reverse(split(str, \" \")), \" \")\n","language":"Julia"},{"code":"fun reversedWords(s: String) = s.split(\" \").filter { it.isNotEmpty() }.reversed().joinToString(\" \")\n\nfun main() {\n val s = \"Hey you, Bub!\"\n println(reversedWords(s))\n println()\n val sl = listOf(\n \" ---------- Ice and Fire ------------ \",\n \" \",\n \" fire, in end will world the say Some \",\n \" ice. in say Some \",\n \" desire of tasted I've what From \",\n \" fire. favor who those with hold I \",\n \" \",\n \" ... elided paragraph last ... \",\n \" \",\n \" Frost Robert ----------------------- \",\n )\n sl.forEach { println(reversedWords(it)) }\n}\n","language":"Kotlin"},{"code":"#!/bin/ksh\n\n# Reverse words in a string\n\n#\t# Variables:\n#\ntypeset -a wArr\ninteger i\n\n\n ######\n# main #\n ######\n\nwhile read -A wArr; do\n\tfor ((i=${#wArr[@]}-1; i>=0; i--)); do\n\t\tprintf \"%s \" \"${wArr[i]}\"\n\tdone\n\techo\ndone << EOF\n---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\nFrost Robert -----------------------\nEOF\n","language":"Ksh"},{"code":"1) We write a function\n\n{def line_reverse\n {def line_reverse.r\n {lambda {:i :txt :length}\n {if {> :i :length}\n then\n else {br}{A2S {A.reverse! {A.get :i :txt}}}\n {line_reverse.r {+ :i 1} :txt :length}}}}\n {lambda {:txt}\n {let { {:a {line_split {:txt}}} }\n {line_reverse.r 0 :a {- {A.length :a} 1}}}} }\n-> line_reverse\n\nwhere A2S translates an array into a sentence\n\n{def A2S\n {lambda {:a}\n {if {A.empty? :a}\n then\n else {A.first :a} {A2S {A.rest :a}}}}}\n-> A2S\n\nand line_split is a javascript primitive directly written in the wiki page,\nadded to the dictionary and returning an array of lines\n\nLAMBDATALK.DICT['line_split'] = function () {\n var args = arguments[0].split(\"\\n\");\n var str = \"{A.new \";\n for (var i=0; i< args.length; i++)\n str += \"{A.new \" + args[i] + \"} \";\n str += \"}\";\n return LAMBDATALK.eval_forms( str )\n};\n\n2) input (from a simple text source without any presetting)\n\n{def rosetta\n---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I''ve what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\n}\n-> rosetta\n\n3) calling the function:\n\n{line_reverse rosetta}\n->\n\n3) output\n\n------------ Fire and Ice ----------\n\nSome say the world will end in fire,\nSome say in ice.\nFrom what I''ve tasted of desire\nI hold with those who favor fire.\n\n... last paragraph elided ...\n\n----------------------- Robert Frost\n","language":"Lambdatalk"},{"code":"for i = 1 to 10\n read string$\n print reverse$(string$)\nnext\nend\n\nfunction reverse$(string$)\n token$=\"*\"\n while token$<>\"\"\n i=i+1\n token$ = word$(string$, i)\n output$=token$+\" \"+output$\n wend\n reverse$ = trim$(output$)\nend function\n\ndata \"---------- Ice and Fire ------------\"\ndata \"\"\ndata \"fire, in end will world the say Some\"\ndata \"ice. in say Some\"\ndata \"desire of tasted I've what From\"\ndata \"fire. favor who those with hold I\"\ndata \"\"\ndata \"... elided paragraph last ...\"\ndata \"\"\ndata \"Frost Robert -----------------------\"\n","language":"Liberty-BASIC"},{"code":"repeat for each line txtln in fld \"Fieldtxt\"\n repeat with i = the number of words of txtln down to 1\n put word i of txtln & space after txtrev\n end repeat\n put cr after txtrev -- preserve line\nend repeat\nput txtrev\n","language":"LiveCode"},{"code":"poem =\n \"\"\"\n ---------- Ice and Fire ------------\n\n fire, in end will world the say Some\n ice. in say Some\n desire of tasted I've what From\n fire. favor who those with hold I\n\n ... elided paragraph last ...\n\n Frost Robert -----------------------\n \"\"\"\n\nreverse-words = (.split ' ') >> (.reverse!) >> (.join ' ')\nreverse-string = (.split '\\n') >> (.map reverse-words) >> (.join '\\n')\nreverse-string poem\n","language":"LiveScript"},{"code":"do.until [\n make \"line readlist\n print reverse :line\n] [word? :line]\nbye\n","language":"Logo"},{"code":"local lines = {}\nfor line in (s .. \"\\n\"):gmatch(\"(.-)\\n\") do\n\tlocal this = {}\n\tfor word in line:gmatch(\"%S+\") do\n\t\ttable.insert(this, 1, word)\n\tend\n\tlines[#lines + 1] = table.concat(this, \" \")\nend\nprint(table.concat(lines, \"\\n\"))\n","language":"Lua"},{"code":"function table.reverse(a)\n local res = {}\n for i = #a, 1, -1 do\n res[#res+1] = a[i]\n end\n return res\nend\n\nfunction splittokens(s)\n local res = {}\n for w in s:gmatch(\"%S+\") do\n res[#res+1] = w\n end\n return res\nend\n\nfor line, nl in s:gmatch(\"([^\\n]-)(\\n)\") do\n print(table.concat(table.reverse(splittokens(line)), ' '))\nend\n","language":"Lua"},{"code":"while (true) do\n\tinput := readline(\"input.txt\"):\n\tif input = 0 then break: fi:\n\tinput := StringTools:-Trim(input): # remove leading/trailing space\n\tinput := StringTools:-Join(ListTools:-Reverse(StringTools:-Split(input, \" \")),\" \"):\n\tprintf(\"%s\\n\", input):\nod:\n","language":"Maple"},{"code":"poem = \"---------- Ice and Fire ------------\n\n fire, in end will world the say Some\n ice. in say Some\n desire of tasted I've what From\n fire. favor who those with hold I\n\n ... elided paragraph last ...\n\n Frost Robert -----------------------\";\nlines = StringSplit[poem, \"\\n\"];\nwordArray = StringSplit[#] & @ lines ;\nreversedWordArray = Reverse[#] & /@ wordArray ;\nlinesWithReversedWords =\n StringJoin[Riffle[#, \" \"]] & /@ reversedWordArray;\nfinaloutput = StringJoin[Riffle[#, \"\\n\"]] & @ linesWithReversedWords\n","language":"Mathematica"},{"code":"function testReverseWords\n testStr = {'---------- Ice and Fire ------------' ; ...\n '' ; ...\n 'fire, in end will world the say Some' ; ...\n 'ice. in say Some' ; ...\n 'desire of tasted I''ve what From' ; ...\n 'fire. favor who those with hold I' ; ...\n '' ; ...\n '... elided paragraph last ...' ; ...\n '' ; ...\n 'Frost Robert -----------------------' };\n for k = 1:length(testStr)\n fprintf('%s\\n', reverseWords(testStr{k}))\n end\nend\n\nfunction strOut = reverseWords(strIn)\n strOut = strtrim(strIn);\n if ~isempty(strOut)\n % Could use strsplit() instead of textscan() in R2013a or later\n words = textscan(strOut, '%s');\n words = words{1};\n strOut = strtrim(sprintf('%s ', words{end:-1:1}));\n end\nend\n","language":"MATLAB"},{"code":"-- MAXScript : Reverse words in a string : N.H. 2019\n--\n(\ntext = stringstream \"---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\n\"\nclearListener()\nseek text 0\nwhile eof text == false do\n(\nnextLine = (readLine text)\nif nextLine == \"\" then\n(\nprint \"\"\ncontinue\t\n) -- end of if\nrevLine = \"\"\neachWord = filterString nextLine \" \"\nfor k = eachWord.count to 1 by -1 do\n(\nrevLine = revLine + eachWord[k]\n-- Only add space between words not at the end of line\nif k != 1 then revLine = revLine + \" \"\n) -- end of for k\nprint revLine\n) -- end of while eof\n)\n","language":"MAXScript"},{"code":"lines = [\"==========================================\",\n \"| ---------- Ice and Fire ------------ |\",\n \"| |\",\n \"| fire, in end will world the say Some |\",\n \"| ice. in say Some |\",\n \"| desire of tasted I've what From |\",\n \"| fire. favor who those with hold I |\",\n \"| |\",\n \"| ... elided paragraph last ... |\",\n \"| |\",\n \"| Frost Robert ----------------------- |\",\n \"==========================================\"]\n\nfor line in lines\n oldLine = line.split\n newLine = []\n while oldLine\n// the line below line retains the outer box format\n newLine.push oldLine.pop\n// alternate format, replace above line with below two lines below to strip all superfluous spaces\n//\tword = oldLine.pop\n//\tif word != \"\" then newLine.push word\n end while\n print newLine.join\nend for\n","language":"MiniScript"},{"code":"MODULE ReverseWords;\n\nFROM STextIO IMPORT\n WriteString, WriteLn;\nFROM Strings IMPORT\n Assign, Concat, Append;\n\nCONST\n NL = CHR(10);\n Sp = ' ';\n Txt = \"---------- Ice and Fire -----------\" + NL +\n NL +\n \"fire, in end will world the say Some\" + NL +\n \"ice. in say Some\" + NL +\n \"desire of tasted I've what From\" + NL +\n \"fire. favor who those with hold I\" + NL +\n NL +\n \"... elided paragraph last ...\" + NL +\n NL +\n \"Frost Robert -----------------------\" + NL;\n\nTYPE\n String400 = ARRAY [0 .. 399] OF CHAR;\n\nPROCEDURE AddWord(Source: ARRAY OF CHAR; VAR INOUT Destination: ARRAY OF CHAR);\nVAR\n R: String400;\nBEGIN\n Concat(Source, Sp, R);\n Append(Destination, R);\n Assign(R, Destination);\nEND AddWord;\n\nVAR\n I: CARDINAL;\n SingleWord, CurrentLine: String400;\n C: CHAR;\n\nBEGIN\n SingleWord := \"\";\n CurrentLine := \"\";\n FOR I := 0 TO HIGH(Txt) DO\n C := Txt[I];\n CASE C OF\n Sp:\n AddWord(SingleWord, CurrentLine);\n SingleWord := \"\"; |\n NL:\n AddWord(SingleWord, CurrentLine);\n WriteString(CurrentLine);\n WriteLn;\n SingleWord := \"\";\n CurrentLine := \"\"; |\n ELSE\n Append(C, SingleWord);\n END;\n END;\nEND ReverseWords.\n","language":"Modula-2"},{"code":"def reverse_words(string)\n tokens = split(string, \" \")\n if len(tokens) = 0\n return \"\"\n end\n\n ret_str = \"\"\n for i in range(len(tokens) - 1, 0)\n ret_str += tokens[i] + \" \"\n end\n return ret_str.substring(0, len(ret_str) - 1)\nend\n\ndata = \"---------- Ice and Fire ------------\\n\" +\\\n \" \\n\" +\\\n \"fire, in end will world the say Some\\n\" +\\\n \"ice. in say Some \\n\" +\\\n \"desire of tasted I've what From \\n\" +\\\n \"fire. favor who those with hold I \\n\" +\\\n \" \\n\" +\\\n \"... elided paragraph last ... \\n\" +\\\n \"Frost Robert -----------------------\\n\"\n\nfor line in split(data, \"\\n\")\n println reverse_words(line)\nend\n","language":"Nanoquery"},{"code":"# Define a function to convert a list of strings to a single string.\njoin is rest link (' ' eachboth link)\n\niterate (write join reverse (' ' string_split)) \\\n \\\n \\\n '------------ Eldorado ----------' \\\n '' \\\n '... here omitted lines ...' \\\n '' \\\n 'Mountains the \"Over' \\\n 'Moon, the Of' \\\n 'Shadow, the of Valley the Down' \\\n 'ride,\" boldly Ride,' \\\n 'replied,--- shade The' \\\n 'Eldorado!\" for seek you \"If' \\\n '' \\\n 'Poe Edgar -----------------------'\n","language":"Nial"},{"code":"import strutils\n\nlet text = \"\"\"---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\"\"\"\n\nproc reversed*[T](a: openArray[T], first, last: int): seq[T] =\n result = newSeq[T](last - first + 1)\n var x = first\n var y = last\n while x <= last:\n result[x] = a[y]\n dec(y)\n inc(x)\n\nproc reversed*[T](a: openArray[T]): seq[T] =\n reversed(a, 0, a.high)\n\nfor line in text.splitLines():\n echo line.split(' ').reversed().join(\" \")\n","language":"Nim"},{"code":"use Collection;\n\nclass Reverselines {\n function : Main(args : String[]) ~ Nil {\n lines := List->New();\n lines->AddBack(\"---------- Ice and Fire ------------\");\n lines->AddBack(\"\");\n lines->AddBack(\"fire, in end will world the say Some\");\n lines->AddBack(\"ice. in say Some\");\n lines->AddBack(\"desire of tasted I've what From\");\n lines->AddBack(\"fire. favor who those with hold I\");\n lines->AddBack(\"\");\n lines->AddBack(\"... elided paragraph last ...\");\n lines->AddBack(\"\");\n lines->AddBack(\"Frost Robert -----------------------\");\n\n lines->Rewind();\n each(i : lines) {\n words := lines->Get()->As(String)->Split(\" \");\n if(words <> Nil) {\n for(j := words->Size() - 1; j > -1; j-=1;) {\n IO.Console->Print(words[j])->Print(\" \");\n };\n };\n IO.Console->PrintLine();\n lines->Next();\n };\n }\n}\n","language":"Objeck"},{"code":"#load \"str.cma\"\nlet input = [\"---------- Ice and Fire ------------\";\n \"\";\n \"fire, in end will world the say Some\";\n \"ice. in say Some\";\n \"desire of tasted I've what From\";\n \"fire. favor who those with hold I\";\n \"\";\n \"... elided paragraph last ...\";\n \"\";\n \"Frost Robert -----------------------\"];;\n\nlet splitted = List.map (Str.split (Str.regexp \" \")) input in\nlet reversed = List.map List.rev splitted in\nlet final = List.map (String.concat \" \") reversed in\nList.iter print_endline final;;\n","language":"OCaml"},{"code":": revWords(s)\n s words reverse unwords ;\n\n: reverseWords\n \"---------- Ice and Fire ------------\" revWords println\n \" \" revWords println\n \"fire, in end will world the say Some\" revWords println\n \"ice. in say Some \" revWords println\n \"desire of tasted I've what From \" revWords println\n \"fire. favor who those with hold I \" revWords println\n \" \" revWords println\n \"... elided paragraph last ... \" revWords println\n \" \" revWords println\n \"Frost Robert -----------------------\" revWords println ;\n","language":"Oforth"},{"code":"program Reverse_words(Output);\n{$H+}\n\nconst\n nl = chr(10); // Linefeed\n sp = chr(32); // Space\n TXT =\n '---------- Ice and Fire -----------'+nl+\n nl+\n 'fire, in end will world the say Some'+nl+\n 'ice. in say Some'+nl+\n 'desire of tasted I''ve what From'+nl+\n 'fire. favor who those with hold I'+nl+\n nl+\n '... elided paragraph last ...'+nl+\n nl+\n 'Frost Robert -----------------------'+nl;\n\nvar\n I : integer;\n ew, lw : ansistring;\n c : char;\n\nfunction addW : ansistring;\nvar r : ansistring = '';\nbegin\n r := ew + sp + lw;\n ew := '';\n addW := r\nend;\n\nbegin\n ew := '';\n lw := '';\n\n for I := 1 to strlen(TXT) do\n begin\n c := TXT[I];\n case c of\n sp : lw := addW;\n nl : begin writeln(addW); lw := '' end;\n else ew := ew + c\n end;\n end;\n readln;\nend.\n","language":"Pascal"},{"code":"program reverse_words;\n{$mode objfpc}{$h+}\nuses\n SysUtils;\n\nfunction Reverse(a: TStringArray): TStringArray;\nvar\n I, J: SizeInt;\n t: Pointer;\nbegin\n I := 0;\n J := High(a);\n while I < J do begin\n t := Pointer(a[I]);\n Pointer(a[I]) := Pointer(a[J]);\n Pointer(a[J]) := t;\n Inc(I);\n Dec(J);\n end;\n Result := a;\nend;\n\nconst\n Input =\n '---------- Ice and Fire -----------' + LineEnding +\n '' + LineEnding +\n 'fire, in end will world the say Some' + LineEnding +\n 'ice. in say Some' + LineEnding +\n 'desire of tasted I''ve what From' + LineEnding +\n 'fire. favor who those with hold I' + LineEnding +\n '' + LineEnding +\n '... elided paragraph last ...' + LineEnding +\n '' + LineEnding +\n 'Frost Robert -----------------------' + LineEnding;\nvar\n Line: string;\n\nbegin\n for Line in Input.Split([LineEnding], TStringSplitOptions.ExcludeLastEmpty) do\n WriteLn(string.Join(' ', Reverse(Line.Split([' ']))));\nend.\n","language":"Pascal"},{"code":"print join(\" \", reverse split), \"\\n\" for <DATA>;\n__DATA__\n---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">\"\"\"\n ---------- Ice and Fire ------------\n\n fire, in end will world the say Some\n ice. in say Some\n desire of tasted I've what From\n fire. favor who those with hold I\n\n ... elided paragraph last ...\n\n Frost Robert -----------------------\n \"\"\"</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">lines</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">'\\n'</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lines</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">lines</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">reverse</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lines</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lines</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">))</span>\n<!--\n","language":"Phix"},{"code":"include ..\\Utilitys.pmt\n\n\"---------- Ice and Fire ------------\"\n\"\"\n\"fire, in end will world the say Some\"\n\"ice. in say Some\"\n\"desire of tasted I've what From\"\n\"fire. favor who those with hold I\"\n\"\"\n\"... elided paragraph last ...\"\n\"\"\n\"Frost Robert -----------------------\"\n\nstklen tolist\nlen for var i\n i get split reverse i set\nendfor\nlen for\n get len dup if\n for get print \" \" print endfor\n else drop endif\n drop nl\nendfor\n","language":"Phixmonti"},{"code":"<?php\n\n function strInv ($string) {\n\n \t$str_inv = '' ;\n\n\t for ($i=0,$s=count($string);$i<$s;$i++){\n\t \t$str_inv .= implode(' ',array_reverse(explode(' ',$string[$i])));\n\t \t$str_inv .= '<br>';\n\t }\n\n \treturn $str_inv;\n\n }\n\n $string[] = \"---------- Ice and Fire ------------\";\n $string[] = \"\";\n $string[] = \"fire, in end will world the say Some\";\n $string[] = \"ice. in say Some\";\n $string[] = \"desire of tasted I've what From\";\n $string[] = \"fire. favor who those with hold I\";\n $string[] = \"\";\n $string[] = \"... elided paragraph last ...\";\n $string[] = \"\";\n $string[] = \"Frost Robert ----------------------- \";\n\n\necho strInv($string);\n","language":"PHP"},{"code":"------------ Fire and Ice ----------\n\nSome say the world will end in fire,\nSome say in ice.\nFrom what I've tasted of desire\nI hold with those who favor fire.\n\n... last paragraph elided ...\n\n----------------------- Robert Frost\n","language":"PHP"},{"code":"(in \"FireIce.txt\"\n (until (eof)\n (prinl (glue \" \" (flip (split (line) \" \"))))))\n","language":"PicoLisp"},{"code":"string story = #\"---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\";\n\nforeach(story/\"\\n\", string line)\n write(\"%s\\n\", reverse(line/\" \")*\" \");\n","language":"Pike"},{"code":"rev: procedure options (main); /* 5 May 2014 */\n declare (s, reverse) character (50) varying;\n declare (i, j) fixed binary;\n declare in file;\n\n open file (in) title ('/REV-WRD.DAT,type(text),recsize(5> Nil) {\n for(j := words->Size() - 1; j > -1; j-=1;) {\n IO.Console->Print(words[j])->Print(\" \");\n };\n };\n IO.Console->PrintLine();\n lines->Next();\n };\n }\n}0)');\n\n do j = 1 to 10;\n get file (in) edit (s) (L);\n put skip list (trim(s));\n\n reverse = '';\n\n do while (length(s) > 0);\n s = trim(s);\n i = index(s, ' ');\n if i = 0 then\n if s ^= '' then i = length(s)+1;\n if i > 0 then reverse = substr(s, 1, i-1) || ' ' || reverse;\n if length(s) = i then s = ''; else s = substr(s, i);\n end;\n put edit ('---> ', reverse) (col(40), 2 A);\n end;\nend rev;\n","language":"PL-I"},{"code":"Function Reverse-Words($lines) {\n $lines | foreach {\n $array = $PSItem.Split(' ')\n $array[($array.Count-1)..0] -join ' '\n }\n}\n\n$lines =\n\"---------- Ice and Fire ------------\",\n\"\",\n\"fire, in end will world the say Some\",\n\"ice. in say Some\",\n\"desire of tasted I've what From\",\n\"fire. favor who those with hold I\",\n\"\",\n\"... elided paragraph last ...\",\n\"\",\n\"Frost Robert -----------------------\"\n\nReverse-Words($lines)\n","language":"PowerShell"},{"code":"a$ = \"---------- Ice and Fire ------------\" +#CRLF$+\n \" \" +#CRLF$+\n \"fire, in end will world the say Some\" +#CRLF$+\n \"ice. in say Some \" +#CRLF$+\n \"desire of tasted I've what From \" +#CRLF$+\n \"fire. favor who those with hold I \" +#CRLF$+\n \" \" +#CRLF$+\n \"... elided paragraph last ... \" +#CRLF$+\n \" \" +#CRLF$+\n \"Frost Robert -----------------------\" +#CRLF$\na$ = \"Hey you, Bub! \" +#CRLF$+#CRLF$+ a$\n\nOpenConsole()\nFor p1=1 To CountString(a$,#CRLF$)\n b$=StringField(a$,p1,#CRLF$) : c$=\"\"\n For p2=1 To CountString(b$,Chr(32))+1\n c$=StringField(b$,p2,Chr(32))+Space(1)+c$\n Next\n PrintN(LSet(b$,36,Chr(32))+\" ---> \"+Trim(c$))\nNext\nInput()\n","language":"PureBasic"},{"code":" text = '''\\\n---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------'''\n\nfor line in text.split('\\n'): print(' '.join(line.split()[::-1]))\n","language":"Python"},{"code":"------------ Fire and Ice ----------\n\nSome say the world will end in fire,\nSome say in ice.\nFrom what I've tasted of desire\nI hold with those who favor fire.\n\n... last paragraph elided ...\n\n----------------------- Robert Frost\n","language":"Python"},{"code":" ' [ $ \" ---------- Ice and Fire ------------ \"\n $ \"\"\n $ \" fire, in end will world the say Some \"\n $ \" ice. in say Some \"\n $ \" desire of tasted I've what From \"\n $ \" fire. favor who those with hold I \"\n $ \"\"\n $ \" ... elided paragraph last ... \"\n $ \"\"\n $ \" Frost Robert ----------------------- \" ]\n\n witheach\n [ do nest$ reverse\n witheach\n [ echo$ sp ]\n cr ]\n","language":"Quackery"},{"code":"whack <- function(s) {\n paste( rev( unlist(strsplit(s, \" \"))), collapse=' ' ) }\n\npoem <- unlist( strsplit(\n'------------ Eldorado ----------\n\n... here omitted lines ...\n\nMountains the \"Over\nMoon, the Of\nShadow, the of Valley the Down\nride,\" boldly Ride,\nreplied,--- shade The\nEldorado!\" for seek you \"If\n\nPoe Edgar -----------------------', \"\\n\"))\n\nfor (line in poem) cat( whack(line), \"\\n\" )\n","language":"R"},{"code":"> `{` <- function(s) rev(unlist(strsplit(s, \" \")))\n> {\"one two three four five\"}\n[1] \"five\" \"four\" \"three\" \"two\" \"one\"\n","language":"R"},{"code":"#lang racket/base\n\n(require racket/string)\n\n(define (split-reverse str)\n (string-join\n (reverse\n (string-split str))))\n\n(define poem\n \"---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\")\n\n\n(let ([poem-port (open-input-string poem)])\n (let loop ([l (read-line poem-port)])\n (unless (eof-object? l)\n (begin (displayln (split-reverse l))\n (loop (read-line poem-port))))))\n","language":"Racket"},{"code":"#lang sweet-exp racket/base\nrequire racket/string\n\ndefine split-reverse(str)\n string-join $ reverse $ string-split str\n\ndefine poem\n \"---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\"\n\nlet\n \\\\\n poem-port $ open-input-string poem\n let loop\n \\\\\n l $ read-line poem-port\n unless eof-object?(l)\n begin\n displayln split-reverse(l)\n loop read-line(poem-port)\n","language":"Racket"},{"code":"say ~.words.reverse for lines\n","language":"Raku"},{"code":"Red []\nforeach line\nsplit\n{---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------} newline [\n print reverse split line \" \"\n]\n","language":"Red"},{"code":"/*REXX program reverses the order of tokens in a string (but not the letters).*/\n@.=; @.1 = \"---------- Ice and Fire ------------\"\n @.2 = ' '\n @.3 = \"fire, in end will world the say Some\"\n @.4 = \"ice. in say Some\"\n @.5 = \"desire of tasted I've what From\"\n @.6 = \"fire. favor who those with hold I\"\n @.7 = ' '\n @.8 = \"... elided paragraph last ...\"\n @.9 = ' '\n @.10 = \"Frost Robert -----------------------\"\n\n do j=1 while @.j\\=='' /*process each of the 10 lines of poem.*/\n $= /*nullify the $ string (the new line)*/\n do k=1 for words(@.j) /*process each word in a @.j string.*/\n $=word(@.j,k) $ /*prepend a word to the new line ($). */\n end /*k*/ /* [↑] we could do this another way. */\n\n say $ /*display the newly constructed line. */\n end /*j*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"/*REXX program reverses the order of tokens in a string (but not the letters).*/\n@.=; @.1 = \"---------- Ice and Fire ------------\"\n @.2 = ' '\n @.3 = \"fire, in end will world the say Some\"\n @.4 = \"ice. in say Some\"\n @.5 = \"desire of tasted I've what From\"\n @.6 = \"fire. favor who those with hold I\"\n @.7 = ' '\n @.8 = \"... elided paragraph last ...\"\n @.9 = ' '\n @.10 = \"Frost Robert -----------------------\"\n\n do j=1 while @.j\\=='' /*process each of the 10 lines of poem.*/\n $= /*nullify the $ string (the new line)*/\n do k=words(@.j) to 1 by -1 /*process each word in a @.j string.*/\n $=$ word(@.j,k) /*append a word to the new line ($). */\n end /*k*/ /* [↑] process last word to first word*/\n\n say $ /*display the newly constructed line. */\n end /*j*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"aList = str2list(\"\n---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\n\")\naList = str2list(cStr)\nfor x in aList\n x2 = substr(x,\" \",nl) alist2 = str2list(x2) aList2 = reverse(aList2)\n for y in aList2 see y + \" \" next see nl\nnext\n","language":"Ring"},{"code":"------------ Fire and Ice ----------\n\nSome say the world will end in fire,\nSome say in ice.\nFrom what I've tasted of desire\nI hold with those who favor fire.\n\n... last paragraph elided ...\n----------------------- Robert Frost\n","language":"Ring"},{"code":"puts <<EOS\n---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\nEOS\n .each_line.map {|line| line.split.reverse.join(' ')}\n","language":"Ruby"},{"code":"for i = 1 to 10\n read string$\n j = 1\n r$ = \"\"\n while word$(string$,j) <> \"\"\n r$ = word$(string$,j) + \" \" + r$\n j = j + 1\n WEND\n print r$\nnext\nend\n\ndata \"---------- Ice and Fire ------------\"\ndata \"\"\ndata \"fire, in end will world the say Some\"\ndata \"ice. in say Some\"\ndata \"desire of tasted I've what From\"\ndata \"fire. favor who those with hold I\"\ndata \"\"\ndata \"... elided paragraph last ...\"\ndata \"\"\ndata \"Frost Robert -----------------------\"\n","language":"Run-BASIC"},{"code":"const TEXT: &'static str =\n\"---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\";\n\nfn main() {\n println!(\"{}\",\n TEXT.lines() // Returns iterator over lines\n .map(|line| // Applies closure to each item in iterator (for each line)\n line.split_whitespace() // Returns iterator of words\n .rev() // Reverses iterator of words\n .collect::<Vec<_>>() // Collects words into Vec<&str>\n .join(\" \")) // Convert vector of words back into line\n .collect::<Vec<_>>() // Collect lines into Vec<String>\n .join(\"\\n\")); // Concatenate lines into String\n}\n","language":"Rust"},{"code":"variable ln, in =\n [\"---------- Ice and Fire ------------\",\n \"fire, in end will world the say Some\",\n \"ice. in say Some\",\n \"desire of tasted I've what From\",\n \"fire. favor who those with hold I\",\n \"\",\n \"... elided paragraph last ...\",\n \"\",\n \"Frost Robert -----------------------\"];\n\nforeach ln (in) {\n ln = strtok(ln, \" \\t\");\n array_reverse(ln);\n () = printf(\"%s\\n\", strjoin(ln, \" \"));\n}\n","language":"S-lang"},{"code":"object ReverseWords extends App {\n\n \"\"\"| ---------- Ice and Fire ------------\n |\n | fire, in end will world the say Some\n | ice. in say Some\n | desire of tasted I've what From\n | fire. favor who those with hold I\n |\n | ... elided paragraph last ...\n |\n | Frost Robert ----------------------- \"\"\"\n .stripMargin.lines.toList.map{_.split(\" \")}.map{_.reverse}\n .map(_.mkString(\" \"))\n .foreach{println}\n\n}\n","language":"Scala"},{"code":"(for-each\n (lambda (s) (print (string-join (reverse (string-split s #/ +/)))))\n (string-split\n \"---------- Ice and Fire ------------\n\n fire, in end will world the say Some\n ice. in say Some\n desire of tasted I've what From\n fire. favor who those with hold I\n\n ... elided paragraph last ...\n\n Frost Robert -----------------------\"\n #/[ \\r]*\\n[ \\r]*/))\n","language":"Scheme"},{"code":"#!/usr/bin/sed -f\n\nG\n:loop\ns/^[[:space:]]*\\([^[:space:]][^[:space:]]*\\)\\(.*\\n\\)/\\2 \\1/\nt loop\ns/^[[:space:]]*//\n","language":"Sed"},{"code":"$ include \"seed7_05.s7i\";\n\nconst array string: lines is [] (\n \"---------- Ice and Fire ------------\",\n \"\",\n \"fire, in end will world the say Some\",\n \"ice. in say Some\",\n \"desire of tasted I've what From\",\n \"fire. favor who those with hold I\",\n \"\",\n \"... elided paragraph last ...\",\n \"\",\n \"Frost Robert -----------------------\");\n\nconst proc: main is func\n local\n var string: line is \"\";\n var array string: words is 0 times \"\";\n var integer: index is 0;\n begin\n for line range lines do\n words := split(line, ' ');\n for index range length(words) downto 1 do\n write(words[index] <& \" \");\n end for;\n writeln;\n end for;\n end func;\n","language":"Seed7"},{"code":"set poem to {{\n---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\n}}\n\nrepeat with each line in poem\n\tput (each word of it) reversed joined by space\nend repeat\n","language":"SenseTalk"},{"code":"DATA.each{|line| line.words.reverse.join(\" \").say};\n\n__DATA__\n---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\n","language":"Sidef"},{"code":"poem := '---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I''ve what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------'.\n\n(poem lines collect: [ :line | ((line splitOn: ' ') reverse) joinUsing: ' ' ]) joinUsing: (String cr).\n","language":"Smalltalk"},{"code":"let lines = split(\"---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\", \"\\n\");\n\nforeach(lines, function(idx, line) {\n\tlet words = split(line, \" \");\n\tlet reverseWords = map(words, function(idx) { return words[sizeof words - idx - 1]; });\n\tforeach(reverseWords, function(idx, word) {\n\t\tprintf(\"%s \", word);\n\t});\n\n\tprint();\n});\n","language":"Sparkling"},{"code":"val lines = [\n \" ---------- Ice and Fire ------------ \",\n \" \",\n \" fire, in end will world the say Some \",\n \" ice. in say Some \",\n \" desire of tasted I've what From \",\n \" fire. favor who those with hold I \",\n \" \",\n \" ... elided paragraph last ... \",\n \" \",\n \" Frost Robert ----------------------- \"\n]\n\nval revWords = String.concatWith \" \" o rev o String.tokens Char.isSpace\n\nval () = app (fn line => print (revWords line ^ \"\\n\")) lines\n","language":"Standard-ML"},{"code":"import Foundation\n\n// convenience extension for better clarity\nextension String {\n var lines: [String] {\n get {\n return self.componentsSeparatedByCharactersInSet(NSCharacterSet.newlineCharacterSet())\n }\n }\n var words: [String] {\n get {\n return self.componentsSeparatedByCharactersInSet(NSCharacterSet.whitespaceCharacterSet())\n }\n }\n}\n\nlet input = \"---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\n\"\n\nlet output = input.lines.map { $0.words.reverse().joinWithSeparator(\" \") }.joinWithSeparator(\"\\n\")\n\nprint(output)\n","language":"Swift"},{"code":"def input: ['---------- Ice and Fire ------------',\n '',\n 'fire, in end will world the say Some',\n 'ice. in say Some',\n 'desire of tasted I''ve what From',\n 'fire. favor who those with hold I',\n '',\n '... elided paragraph last ...',\n '',\n 'Frost Robert -----------------------']\n;\n\ncomposer words\n [ <word>* ]\n rule word: <~WS> <WS>?\nend words\n\n$input... -> '$ -> words -> $(last..first:-1)...;\n' -> !OUT::write\n","language":"Tailspin"},{"code":"set lines {\n \"---------- Ice and Fire ------------\"\n \"\"\n \"fire, in end will world the say Some\"\n \"ice. in say Some\"\n \"desire of tasted I've what From\"\n \"fire. favor who those with hold I\"\n \"\"\n \"... elided paragraph last ...\"\n \"\"\n \"Frost Robert -----------------------\"\n}\nforeach line $lines {\n puts [join [lreverse [regexp -all -inline {\\S+} $line]]]\n # This would also work for data this simple:\n ### puts [lreverse $line]\n}\n","language":"Tcl"},{"code":"puts [join [lmap line $lines {lreverse $line}] \"\\n\"]\n","language":"Tcl"},{"code":"txr reverse.txr verse.txt\n","language":"TXR"},{"code":"@(collect)\n@ (some)\n@(coll)@{words /[^ ]+/}@(end)\n@ (or)\n@(bind words nil)\n@ (end)\n@(end)\n@(set words @(mapcar (fun nreverse) words))\n@(output)\n@ (repeat)\n@(rep)@words @(last)@words@(end)\n@ (end)\n@(end)\n","language":"TXR"},{"code":"@(end)\n[EOF]\n","language":"TXR"},{"code":"@(end)[EOF]\n","language":"TXR"},{"code":"while read -a words; do\n for ((i=${#words[@]}-1; i>=0; i--)); do\n printf \"%s \" \"${words[i]}\"\n done\n echo\ndone << END\n---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\nEND\n","language":"UNIX-Shell"},{"code":"read -a\n","language":"UNIX-Shell"},{"code":"read -A\n","language":"UNIX-Shell"},{"code":"fn main() {\n mut n := [\n \"---------- Ice and Fire ------------\",\n \" \",\n \"fire, in end will world the say Some\",\n \"ice. in say Some \",\n \"desire of tasted I've what From \",\n \"fire. favor who those with hold I \",\n \" \",\n \"... elided paragraph last ... \",\n \" \",\n \"Frost Robert -----------------------\",\n ]\n for i, s in n {\n mut t := s.fields() // tokenize\n // reverse\n last := t.len - 1\n for j, k in t[..t.len/2] {\n t[j], t[last-j] = t[last-j], k\n }\n n[i] = t.join(\" \")\n }\n // display result\n for t in n {\n println(t)\n }\n}\n","language":"V-(Vlang)"},{"code":"mut n := [\n \"---------- Ice and Fire ------------\",\n \" \",\n \"fire, in end will world the say Some\",\n \"ice. in say Some \",\n \"desire of tasted I've what From \",\n \"fire. favor who those with hold I \",\n \" \",\n \"... elided paragraph last ... \",\n \" \",\n \"Frost Robert -----------------------\",\n]\n\nprintln(\n n.map(\n it.fields().reverse().join(' ').trim_space()\n ).join('\\n')\n)\n","language":"V-(Vlang)"},{"code":"Option Explicit\n\nSub Main()\nDim Lines(9) As String, i&\n 'Input\n Lines(0) = \"------------- Ice And Fire -------------\"\n Lines(1) = \"\"\n Lines(2) = \"fire, in end will world the say Some\"\n Lines(3) = \"ice. in say Some\"\n Lines(4) = \"desire of tasted I've what From\"\n Lines(5) = \"fire. favor who those with hold I\"\n Lines(6) = \"\"\n Lines(7) = \"... elided paragraph last ...\"\n Lines(8) = \"\"\n Lines(9) = \"Frost Robert -----------------------\"\n 'Output\n For i = 0 To 9\n Debug.Print ReverseLine(Lines(i), \" \")\n Next\nEnd Sub\n\nPrivate Function ReverseLine(Line As String, Optional Separat As String) As String\nDim T, R, i&, j&, deb&, fin&\n If Len(Line) = 0 Then\n ReverseLine = vbNullString\n Else\n If Separat = \"\" Then Separat = \" \"\n T = Split(Line, Separat)\n ReDim R(UBound(T)): j = LBound(T)\n deb = UBound(T): fin = deb / 2\n For i = deb To fin Step -1\n R(j) = T(i)\n R(i) = T(j)\n j = j + 1\n Next i\n ReverseLine = Join(R, Separat)\n End If\nEnd Function\n","language":"VBA"},{"code":"Option Explicit\n\nDim objFSO, objInFile, objOutFile\nDim srcDir, line\n\nSet objFSO = CreateObject(\"Scripting.FileSystemObject\")\n\nsrcDir = objFSO.GetParentFolderName(WScript.ScriptFullName) & \"\\\"\n\nSet objInFile = objFSO.OpenTextFile(srcDir & \"In.txt\",1,False,0)\n\nSet objOutFile = objFSO.OpenTextFile(srcDir & \"Out.txt\",2,True,0)\n\nDo Until objInFile.AtEndOfStream\n\tline = objInFile.ReadLine\n\tIf line = \"\" Then\n\t\tobjOutFile.WriteLine \"\"\n\tElse\n\t\tobjOutFile.WriteLine Reverse_String(line)\n\tEnd If\nLoop\n\nFunction Reverse_String(s)\n\tDim arr, i\n\tarr = Split(s,\" \")\n\tFor i = UBound(arr) To LBound(arr) Step -1\n\t\tIf arr(i) <> \"\" Then\n\t\t\tIf i = UBound(arr) Then\n\t\t\t\tReverse_String = Reverse_String & arr(i)\n\t\t\tElse\n\t\t\t\tReverse_String = Reverse_String & \" \" & arr(i)\n\t\t\tEnd If\n\t\tEnd If\n\tNext\nEnd Function\n\nobjInFile.Close\nobjOutFile.Close\nSet objFSO = Nothing\n","language":"VBScript"},{"code":"var lines = [\n \"---------- Ice and Fire ------------\",\n \" \",\n \"fire, in end will world the say Some\",\n \"ice. in say Some \",\n \"desire of tasted I've what From \",\n \"fire. favor who those with hold I \",\n \" \",\n \"... elided paragraph last ... \",\n \" \",\n \"Frost Robert -----------------------\"\n]\n\nfor (line in lines) {\n var tokens = line.trim().split(\" \")\n tokens = tokens[-1..0]\n System.print(tokens.join(\" \"))\n}\n","language":"Wren"},{"code":"func revWords(x:string=\"\"){\n\t(x==\"\")&=>send x+\"<br>\";\n\tset sp = x::split(\" \");\n\tsend sp::reverse()::join(\" \");\n}\n\nset lines:array=[\n\t\"---------- Ice and Fire ------------\",\n\t\"\",\n\t\"fire, in end will world the say Some\",\n\t\"ice. in say Some\",\n\t\"desire of tasted I've what From\",\n\t\"fire. favor who those with hold I\",\n\t\"\",\n\t\"... elided paragraph last ...\",\n\t\"\",\n\t\"Frost Robert -----------------------\",\n];\n\nforeach(v of lines){\n\tlog(revWords(v));\n}\n","language":"XBS"},{"code":"string 0;\ndef LF=$0A, CR=$0D;\n\nproc Reverse(Str, Len); \\Reverse order of chars in string\nchar Str; int Len;\nint I, J, T;\n[I:= 0;\nJ:= Len-1;\nwhile I < J do\n [T:= Str(I); Str(I):= Str(J); Str(J):= T;\n I:= I+1; J:= J-1;\n ];\n];\n\nchar Str;\nint I, LineBase, WordBase;\n[Str:=\n\"---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\";\nI:= 0;\nrepeat LineBase:= I;\n loop [WordBase:= I;\n repeat I:= I+1 until Str(I) <= $20;\n Reverse(@Str(WordBase), I-WordBase);\n if Str(I)=CR or Str(I)=LF or Str(I)=0 then quit;\n I:= I+1; \\skip space\n ];\n Reverse(@Str(LineBase), I-LineBase);\n while Str(I)=CR or Str(I)=LF do I:= I+1;\nuntil Str(I) = 0;\nText(0, Str);\nCrLf(0);\n]\n","language":"XPL0"},{"code":"data \" ---------- Ice and Fire ------------ \"\ndata \" \"\ndata \" fire, in end will world the say Some \"\ndata \" ice. in say Some \"\ndata \" desire of tasted I've what From \"\ndata \" fire. favor who those with hold I \"\ndata \" \"\ndata \" ... elided paragraph last ... \"\ndata \" \"\ndata \" Frost Robert ----------------------- \"\ndata \"\"\n\ndim w$(1)\n\ndo\n read l$\n if l$ <> \"\" then\n n = token(l$, w$(), \" \")\n for i = n to 1 step -1\n print w$(i), \" \";\n next\n print\n else\n break\n end if\nloop\n","language":"Yabasic"},{"code":"text:=Data(0,String,\n#<<<\n\"---------- Ice and Fire ------------\n\nfire, in end will world the say Some\nice. in say Some\ndesire of tasted I've what From\nfire. favor who those with hold I\n\n... elided paragraph last ...\n\nFrost Robert -----------------------\");\n#<<<\n\ntext.pump(11,Data,fcn(s){ // process stripped lines\n s.split(\" \").reverse().concat(\" \") + \"\\n\" })\n .text.print();\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Reverse_words_in_a_string\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nReverse the order of all tokens in each of a number of strings and display the result; the order of characters within a token should not be modified.\\n\\n\\n;Example:\\n<big><big><code>Hey you, Bub! </code></big></big> would be shown reversed as: <big><big><code> Bub! you, Hey </code></big></big>\\n\\n\\nTokens are any non-space characters separated by spaces (formally, white-space); the visible punctuation form part of the word within which it is located and should not be modified. \\n\\nYou may assume that there are no significant non-visible characters in the input. Multiple or superfluous spaces may be compressed into a single space.\\n\\nSome strings have no tokens, so an empty string (or one just containing spaces) would be the result.\\n\\n'''Display''' the strings in order (1<sup>st</sup>, 2<sup>nd</sup>, 3<sup>rd</sup>, ···), and one string per line. \\n\\n(You can consider the ten strings as ten lines, and the tokens as words.)\\n\\n\\n;Input data\\n<pre>\\n (ten lines within the box)\\n line\\n ╔════════════════════════════════════════╗\\n 1 ║ ---------- Ice and Fire ------------ ║\\n 2 ║ ║ ◄─── a blank line here.\\n 3 ║ fire, in end will world the say Some ║\\n 4 ║ ice. in say Some ║\\n 5 ║ desire of tasted I've what From ║\\n 6 ║ fire. favor who those with hold I ║\\n 7 ║ ║ ◄─── a blank line here.\\n 8 ║ ... elided paragraph last ... ║\\n 9 ║ ║ ◄─── a blank line here.\\n 10 ║ Frost Robert ----------------------- ║\\n ╚════════════════════════════════════════╝\\n</pre>\\n\\n;Cf.\\n* [[Phrase reversals]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V text =\\n‘---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------’\\n\\nL(line) text.split(\\\"\\\\n\\\")\\n print(reversed(line.split(‘ ’)).join(‘ ’))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"PROC Reverse(CHAR ARRAY src,dst)\\n BYTE i,j,k,beg,end\\n\\n i=1 j=src(0)\\n WHILE j>0\\n DO\\n WHILE j>0 AND src(j)=$20\\n DO j==-1 OD\\n IF j=0 THEN\\n EXIT\\n ELSE\\n end=j\\n FI\\n\\n WHILE j>0 AND src(j)#$20\\n DO j==-1 OD\\n beg=j+1\\n\\n IF i>1 THEN\\n dst(i)=$20 i==+1\\n FI\\n\\n FOR k=beg TO end\\n DO\\n dst(i)=src(k) i==+1\\n OD\\n OD\\n dst(0)=i-1\\nRETURN\\n\\nPROC Test(CHAR ARRAY src)\\n CHAR ARRAY dst(40)\\n\\n Reverse(src,dst)\\n PrintE(dst)\\nRETURN\\n\\nPROC Main()\\n Test(\\\"---------- Ice and Fire ------------\\\")\\n Test(\\\"\\\")\\n Test(\\\"fire, in end will world the say Some\\\")\\n Test(\\\"ice. in say Some\\\")\\n Test(\\\"desire of tasted I've what From\\\")\\n Test(\\\"fire. favor who those with hold I\\\")\\n Test(\\\"\\\")\\n Test(\\\"... elided paragraph last ...\\\")\\n Test(\\\"\\\")\\n Test(\\\"Frost Robert -----------------------\\\")\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"package Simple_Parse is\\n -- a very simplistic parser, useful to split a string into words\\n\\n function Next_Word(S: String; Point: in out Positive)\\n\\t\\t return String;\\n -- a \\\"word\\\" is a sequence of non-space characters\\n -- if S(Point .. S'Last) holds at least one word W\\n -- then Next_Word increments Point by len(W) and returns W.\\n -- else Next_Word sets Point to S'Last+1 and returns \\\"\\\"\\n\\nend Simple_Parse;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package body Simple_Parse is\\n\\n function Next_Word(S: String; Point: in out Positive) return String is\\n Start: Positive := Point;\\n Stop: Natural;\\n begin\\n while Start <= S'Last and then S(Start) = ' ' loop\\n\\t Start := Start + 1;\\n end loop; -- now S(Start) is the first non-space,\\n\\t\\t-- or Start = S'Last+1 if S is empty or space-only\\n Stop := Start-1; -- now S(Start .. Stop) = \\\"\\\"\\n while Stop < S'Last and then S(Stop+1) /= ' ' loop\\n\\t Stop := Stop + 1;\\n end loop; -- now S(Stop+1) is the first sopace after Start\\n\\t\\t-- or Stop = S'Last if there is no such space\\n Point := Stop+1;\\n return S(Start .. Stop);\\n end Next_Word;\\n\\nend Simple_Parse;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO, Simple_Parse;\\n\\nprocedure Reverse_Words is\\n\\n function Reverse_Words(S: String) return String is\\n Cursor: Positive := S'First;\\n Word: String := Simple_Parse.Next_Word(S, Cursor);\\n begin\\n if Word = \\\"\\\" then\\n return \\\"\\\";\\n else\\n return Reverse_Words(S(Cursor .. S'Last)) & \\\" \\\" & Word;\\n end if;\\n end Reverse_Words;\\n\\n use Ada.Text_IO;\\nbegin\\n while not End_Of_File loop\\n Put_Line(Reverse_Words(Get_Line)); -- poem is read from standard input\\n end loop;\\nend Reverse_Words;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"integer j;\\nlist l, x;\\ntext s, t;\\n\\nl = list(\\\"---------- Ice and Fire ------------\\\",\\n \\\"\\\",\\n \\\"fire, in end will world the say Some\\\",\\n \\\"ice. in say Some\\\",\\n \\\"desire of tasted I've what From\\\",\\n \\\"fire. favor who those with hold I\\\",\\n \\\"\\\",\\n \\\"... elided paragraph last ...\\\",\\n \\\"\\\",\\n \\\"Frost Robert -----------------------\\\");\\n\\nfor (, t in l) {\\n file().b_affix(t).list(x, 0);\\n for (j, s in x.reverse) {\\n o_space(sign(j));\\n o_text(s);\\n }\\n o_newline();\\n}\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"# returns original phrase with the order of the words reversed #\\n# a word is a sequence of non-blank characters #\\nPROC reverse word order = ( STRING original phrase )STRING:\\n BEGIN\\n STRING words reversed := \\\"\\\";\\n STRING separator := \\\"\\\";\\n INT start pos := LWB original phrase;\\n WHILE\\n # skip leading spaces #\\n WHILE IF start pos <= UPB original phrase\\n THEN original phrase[ start pos ] = \\\" \\\"\\n ELSE FALSE\\n FI\\n DO start pos +:= 1\\n OD;\\n start pos <= UPB original phrase\\n DO\\n # have another word, find it #\\n INT end pos := start pos;\\n WHILE IF end pos <= UPB original phrase\\n THEN original phrase[ end pos ] /= \\\" \\\"\\n ELSE FALSE\\n FI\\n DO end pos +:= 1\\n OD;\\n ( original phrase[ start pos : end pos - 1 ] + separator ) +=: words reversed;\\n separator := \\\" \\\";\\n start pos := end pos + 1\\n OD;\\n words reversed\\n END # reverse word order # ;\\n\\n# reverse the words in the lines as per the task #\\nprint( ( reverse word order ( \\\"--------- Ice and Fire ------------ \\\" ), newline ) );\\nprint( ( reverse word order ( \\\" \\\" ), newline ) );\\nprint( ( reverse word order ( \\\"fire, in end will world the say Some\\\" ), newline ) );\\nprint( ( reverse word order ( \\\"ice. in say Some \\\" ), newline ) );\\nprint( ( reverse word order ( \\\"desire of tasted I've what From \\\" ), newline ) );\\nprint( ( reverse word order ( \\\"fire. favor who those with hold I \\\" ), newline ) );\\nprint( ( reverse word order ( \\\" \\\" ), newline ) );\\nprint( ( reverse word order ( \\\"... elided paragraph last ... \\\" ), newline ) );\\nprint( ( reverse word order ( \\\" \\\" ), newline ) );\\nprint( ( reverse word order ( \\\"Frost Robert -----------------------\\\" ), newline ) )\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"on run\\n\\n unlines(map(reverseWords, |lines|(\\\"---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\\")))\\n\\nend run\\n\\n\\n-- GENERIC FUNCTIONS ---------------------------------------------------------\\n\\n-- reverseWords :: String -> String\\non reverseWords(str)\\n unwords(|reverse|(|words|(str)))\\nend reverseWords\\n\\n-- |reverse| :: [a] -> [a]\\non |reverse|(xs)\\n if class of xs is text then\\n (reverse of characters of xs) as text\\n else\\n reverse of xs\\n end if\\nend |reverse|\\n\\n-- |lines| :: Text -> [Text]\\non |lines|(str)\\n splitOn(linefeed, str)\\nend |lines|\\n\\n-- |words| :: Text -> [Text]\\non |words|(str)\\n splitOn(space, str)\\nend |words|\\n\\n-- ulines :: [Text] -> Text\\non unlines(lstLines)\\n intercalate(linefeed, lstLines)\\nend unlines\\n\\n-- unwords :: [Text] -> Text\\non unwords(lstWords)\\n intercalate(space, lstWords)\\nend unwords\\n\\n-- splitOn :: Text -> Text -> [Text]\\non splitOn(strDelim, strMain)\\n set {dlm, my text item delimiters} to {my text item delimiters, strDelim}\\n set lstParts to text items of strMain\\n set my text item delimiters to dlm\\n lstParts\\nend splitOn\\n\\n-- interCalate :: Text -> [Text] -> Text\\non intercalate(strText, lstText)\\n set {dlm, my text item delimiters} to {my text item delimiters, strText}\\n set strJoined to lstText as text\\n set my text item delimiters to dlm\\n strJoined\\nend intercalate\\n\\n-- map :: (a -> b) -> [a] -> [b]\\non map(f, xs)\\n tell mReturn(f)\\n set lng to length of xs\\n set lst to {}\\n repeat with i from 1 to lng\\n set end of lst to lambda(item i of xs, i, xs)\\n end repeat\\n return lst\\n end tell\\nend map\\n\\n-- Lift 2nd class handler function into 1st class script wrapper\\n-- mReturn :: Handler -> Script\\non mReturn(f)\\n if class of f is script then\\n f\\n else\\n script\\n property lambda : f\\n end script\\n end if\\nend mReturn\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"100 DATA\\\"---------- ICE AND FIRE ------------\\\"\\n110 DATA\\\" \\\"\\n120 DATA\\\"FIRE, IN END WILL WORLD THE SAY SOME\\\"\\n130 DATA\\\"ICE. IN SAY SOME \\\"\\n140 DATA\\\"DESIRE OF TASTED I'VE WHAT FROM \\\"\\n150 DATA\\\"FIRE. FAVOR WHO THOSE WITH HOLD I \\\"\\n160 DATA\\\" \\\"\\n170 DATA\\\"... ELIDED PARAGRAPH LAST ... \\\"\\n180 DATA\\\" \\\"\\n190 DATA\\\"FROST ROBERT -----------------------\\\"\\n\\n200 FOR L = 1 TO 10\\n210 READ T$\\n220 I = LEN(T$)\\n240 IF I THEN GOSUB 300 : PRINT W$; : IF I THEN PRINT \\\" \\\"; : GOTO 240\\n250 PRINT\\n260 NEXT L\\n270 END\\n\\n300 W$ = \\\"\\\"\\n310 FOR I = I TO 1 STEP -1\\n320 IF MID$(T$, I, 1) = \\\" \\\" THEN NEXT I : RETURN\\n330 FOR I = I TO 1 STEP -1\\n340 C$ = MID$(T$, I, 1)\\n350 IF C$ <> \\\" \\\" THEN W$ = C$ + W$ : NEXT I\\n360 RETURN\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"text: {\\n---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------}\\n\\nreversed: map split.lines text =>\\n [join.with:\\\" \\\" reverse split.words &]\\n\\nprint join.with:\\\"\\\\n\\\" reversed\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"Data := \\\"\\n(Join`r`n\\n---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\n)\\\"\\n\\nLoop, Parse, Data, `n, `r\\n{\\n\\tLoop, Parse, A_LoopField, % A_Space\\n\\t\\tLine := A_LoopField \\\" \\\" Line\\n\\tOutput .= Line \\\"`n\\\", Line := \\\"\\\"\\n}\\nMsgBox, % RTrim(Output, \\\"`n\\\")\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f REVERSE_WORDS_IN_A_STRING.AWK\\nBEGIN {\\n text[++i] = \\\"---------- Ice and Fire ------------\\\"\\n text[++i] = \\\"\\\"\\n text[++i] = \\\"fire, in end will world the say Some\\\"\\n text[++i] = \\\"ice. in say Some\\\"\\n text[++i] = \\\"desire of tasted I've what From\\\"\\n text[++i] = \\\"fire. favor who those with hold I\\\"\\n text[++i] = \\\"\\\"\\n text[++i] = \\\"... elided paragraph last ...\\\"\\n text[++i] = \\\"\\\"\\n text[++i] = \\\"Frost Robert -----------------------\\\"\\n leng = i\\n for (i=1; i<=leng; i++) {\\n n = split(text[i],arr,\\\" \\\")\\n for (j=n; j>0; j--) {\\n printf(\\\"%s \\\",arr[j])\\n }\\n printf(\\\"\\\\n\\\")\\n }\\n exit(0)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"PRINT REV$(\\\"---------- Ice and Fire ------------\\\")\\nPRINT\\nPRINT REV$(\\\"fire, in end will world the say Some\\\")\\nPRINT REV$(\\\"ice. in say Some \\\")\\nPRINT REV$(\\\"desire of tasted I've what From \\\")\\nPRINT REV$(\\\"fire. favor who those with hold I \\\")\\nPRINT\\nPRINT REV$(\\\"... elided paragraph last ... \\\")\\nPRINT\\nPRINT REV$(\\\"Frost Robert -----------------------\\\")\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"source = freefile\\nopen (source, \\\"m:\\\\text.txt\\\")\\ntextEnt$ = \\\"\\\"\\ndim textSal$(size(source)*8)\\nlinea = 0\\n\\nwhile not eof(source)\\n\\ttextEnt$ = readline(source)\\n\\tlinea += 1\\n\\ttextSal$[linea] = textEnt$\\nend while\\n\\nfor n = size(source) to 1 step -1\\n\\tprint textSal$[n];\\nnext n\\nclose source\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off\\n\\n::The Main Thing...\\ncls\\necho.\\ncall :reverse \\\"---------- Ice and Fire ------------\\\"\\ncall :reverse\\ncall :reverse \\\"fire, in end will world the say Some\\\"\\ncall :reverse \\\"ice. in say Some\\\"\\ncall :reverse \\\"desire of tasted I've what From\\\"\\ncall :reverse \\\"fire. favor who those with hold I\\\"\\ncall :reverse\\ncall :reverse \\\"... elided paragraph last ...\\\"\\ncall :reverse\\ncall :reverse \\\"Frost Robert -----------------------\\\"\\necho.\\npause>nul\\nexit\\n::/The Main Thing...\\n\\n::The Function...\\n:reverse\\nset reversed=&set word=&set str=%1\\n:process\\nfor /f \\\"tokens=1,*\\\" %%A in (%str%) do (\\n\\tset str=%%B\\n\\tset word=%%A\\n)\\nset reversed=%word% %reversed%\\nset str=\\\"%str%\\\"\\nif not %str%==\\\"\\\" goto process\\n\\necho.%reversed%\\ngoto :EOF\\n::/The Function...\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" PRINT FNreverse(\\\"---------- Ice and Fire ------------\\\")\\\\\\n \\\\ 'FNreverse(\\\"\\\")\\\\\\n \\\\ 'FNreverse(\\\"fire, in end will world the say Some\\\")\\\\\\n \\\\ 'FNreverse(\\\"ice. in say Some\\\")\\\\\\n \\\\ 'FNreverse(\\\"desire of tasted I've what From\\\")\\\\\\n \\\\ 'FNreverse(\\\"fire. favor who those with hold I\\\")\\\\\\n \\\\ 'FNreverse(\\\"\\\")\\\\\\n \\\\ 'FNreverse(\\\"... elided paragraph last ...\\\")\\\\\\n \\\\ 'FNreverse(\\\"\\\")\\\\\\n \\\\ 'FNreverse(\\\"Frost Robert -----------------------\\\")\\n END\\n\\n DEF FNreverse(s$)\\n LOCAL sp%\\n sp%=INSTR(s$,\\\" \\\")\\n IF sp% THEN =FNreverse(MID$(s$,sp%+1))+\\\" \\\"+LEFT$(s$,sp%-1) ELSE =s$\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"Split ← +`∘<⟜»⊸×⊸-⟜¬∘>⟜' '⊸⊔\\nJoin ← (⊣∾' '∾⊢)´⍟(1<≡)\\n\\ntext ← ⍉≍⟨\\n\\\"---------- Ice and Fire ------------\\\"\\n\\\"\\\"\\n\\\"fire, in end will world the say Some\\\"\\n\\\"ice. in say Some \\\"\\n\\\"desire of tasted I've what From \\\"\\n\\\"fire. favor who those with hold I \\\"\\n\\\"\\\"\\n\\\"... elided paragraph last ...\\\"\\n\\\"\\\"\\n\\\"Frost Robert -----------------------\\\"⟩\\n\\nJoin∘⌽∘Split¨ text\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"{(⍒+`∨⟜»' '=𝕩)⊏𝕩}¨ text\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"(\\\"---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\\"\\n : ?text\\n& ( reverse\\n = token tokens reversed\\n . :?tokens\\n & whl\\n ' ( @( !arg\\n : ?token (\\\" \\\"|\\\\t|\\\\r) ?arg\\n )\\n & !tokens !token:?tokens\\n )\\n & !tokens !arg:?tokens\\n & :?reversed\\n & whl\\n ' ( !tokens:%?token %?tokens\\n & \\\" \\\" !token !reversed:?reversed\\n )\\n & !tokens !reversed:?reversed\\n & str$!reversed\\n )\\n& :?output\\n& whl\\n ' ( @(!text:?line \\\\n ?text)\\n & !output reverse$!line \\\\n:?output\\n )\\n& !output reverse$!text:?output\\n& out$str$!output\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"blsq ) \\\"It is not raining\\\"wd<-wd\\n\\\"raining not is It\\\"\\nblsq ) \\\"ice. in say some\\\"wd<-wd\\n\\\"some say in ice.\\\"\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <ctype.h>\\n\\nvoid rev_print(char *s, int n)\\n{\\n for (; *s && isspace(*s); s++);\\n if (*s) {\\n char *e;\\n for (e = s; *e && !isspace(*e); e++);\\n rev_print(e, 0);\\n printf(\\\"%.*s%s\\\", (int)(e - s), s, \\\" \\\" + n);\\n }\\n if (n) putchar('\\\\n');\\n}\\n\\nint main(void)\\n{\\n char *s[] = {\\n \\\"---------- Ice and Fire ------------\\\",\\n \\\" \\\",\\n \\\"fire, in end will world the say Some\\\",\\n \\\"ice. in say Some \\\",\\n \\\"desire of tasted I've what From \\\",\\n \\\"fire. favor who those with hold I \\\",\\n \\\" \\\",\\n \\\"... elided paragraph last ... \\\",\\n \\\" \\\",\\n \\\"Frost Robert -----------------------\\\",\\n 0\\n };\\n int i;\\n for (i = 0; s[i]; i++) rev_print(s[i], 1);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <functional>\\n#include <string>\\n#include <iostream>\\n#include <vector>\\n\\n//code for a C++11 compliant compiler\\ntemplate <class BidirectionalIterator, class T>\\nvoid block_reverse_cpp11(BidirectionalIterator first, BidirectionalIterator last, T const& separator) {\\n std::reverse(first, last);\\n auto block_last = first;\\n do {\\n using std::placeholders::_1;\\n auto block_first = std::find_if_not(block_last, last,\\n std::bind(std::equal_to<T>(),_1, separator));\\n block_last = std::find(block_first, last, separator);\\n std::reverse(block_first, block_last);\\n } while(block_last != last);\\n}\\n\\n//code for a C++03 compliant compiler\\ntemplate <class BidirectionalIterator, class T>\\nvoid block_reverse_cpp03(BidirectionalIterator first, BidirectionalIterator last, T const& separator) {\\n std::reverse(first, last);\\n BidirectionalIterator block_last = first;\\n do {\\n BidirectionalIterator block_first = std::find_if(block_last, last,\\n std::bind2nd(std::not_equal_to<T>(), separator));\\n block_last = std::find(block_first, last, separator);\\n std::reverse(block_first, block_last);\\n } while(block_last != last);\\n}\\n\\nint main() {\\n std::string str1[] =\\n {\\n \\\"---------- Ice and Fire ------------\\\",\\n \\\"\\\",\\n \\\"fire, in end will world the say Some\\\",\\n \\\"ice. in say Some\\\",\\n \\\"desire of tasted I've what From\\\",\\n \\\"fire. favor who those with hold I\\\",\\n \\\"\\\",\\n \\\"... elided paragraph last ...\\\",\\n \\\"\\\",\\n \\\"Frost Robert -----------------------\\\"\\n };\\n\\n std::for_each(begin(str1), end(str1), [](std::string& s){\\n block_reverse_cpp11(begin(s), end(s), ' ');\\n std::cout << s << std::endl;\\n });\\n\\n std::for_each(begin(str1), end(str1), [](std::string& s){\\n block_reverse_cpp03(begin(s), end(s), ' ');\\n std::cout << s << std::endl;\\n });\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <string>\\n#include <iostream>\\nusing namespace std;\\n\\nstring invertString( string s )\\n{\\n string st, tmp;\\n for( string::iterator it = s.begin(); it != s.end(); it++ )\\n {\\n if( *it != 32 ) tmp += *it;\\n else\\n {\\n st = \\\" \\\" + tmp + st;\\n tmp.clear();\\n }\\n }\\n return tmp + st;\\n}\\n\\nint main( int argc, char* argv[] )\\n{\\n string str[] =\\n {\\n \\\"---------- Ice and Fire ------------\\\",\\n \\\"\\\",\\n \\\"fire, in end will world the say Some\\\",\\n \\\"ice. in say Some\\\",\\n \\\"desire of tasted I've what From\\\",\\n \\\"fire. favor who those with hold I\\\",\\n \\\"\\\",\\n \\\"... elided paragraph last ...\\\",\\n \\\"\\\",\\n \\\"Frost Robert -----------------------\\\"\\n };\\n for( int i = 0; i < 10; i++ )\\n cout << invertString( str[i] ) << \\\"\\\\n\\\";\\n\\n cout << \\\"\\\\n\\\";\\n return system( \\\"pause\\\" );\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\npublic class ReverseWordsInString\\n{\\n public static void Main(string[] args)\\n {\\n string text = @\\\"\\n ---------- Ice and Fire ------------\\n\\n fire, in end will world the say Some\\n ice. in say Some\\n desire of tasted I've what From\\n fire. favor who those with hold I\\n\\n ... elided paragraph last ...\\n\\n Frost Robert -----------------------\\n \\\";\\n\\n foreach (string line in text.Split(Environment.NewLine)) {\\n //Splits on any whitespace, not just spaces\\n string[] words = line.Split(default(char[]), StringSplitOptions.RemoveEmptyEntries);\\n Array.Reverse(words);\\n WriteLine(string.Join(\\\" \\\", words));\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(def poem\\n \\\"---------- Ice and Fire ------------\\n\\n fire, in end will world the say Some\\n ice. in say Some\\n desire of tasted I've what From\\n fire. favor who those with hold I\\n\\n ... elided paragraph last ...\\n\\n Frost Robert -----------------------\\\")\\n\\n(dorun\\n (map println (map #(apply str (interpose \\\" \\\" (reverse (re-seq #\\\"[^\\\\s]+\\\" %)))) (clojure.string/split poem #\\\"\\\\n\\\"))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \" program-id. rev-word.\\n data division.\\n working-storage section.\\n 1 text-block.\\n 2 pic x(36) value \\\"---------- Ice and Fire ------------\\\".\\n 2 pic x(36) value \\\" \\\".\\n 2 pic x(36) value \\\"fire, in end will world the say Some\\\".\\n 2 pic x(36) value \\\"ice. in say Some \\\".\\n 2 pic x(36) value \\\"desire of tasted I've what From \\\".\\n 2 pic x(36) value \\\"fire. favor who those with hold I \\\".\\n 2 pic x(36) value \\\" \\\".\\n 2 pic x(36) value \\\"... elided paragraph last ... \\\".\\n 2 pic x(36) value \\\" \\\".\\n 2 pic x(36) value \\\"Frost Robert -----------------------\\\".\\n 1 redefines text-block.\\n 2 occurs 10.\\n 3 text-line pic x(36).\\n 1 text-word.\\n 2 wk-len binary pic 9(4).\\n 2 wk-word pic x(36).\\n 1 word-stack.\\n 2 occurs 10.\\n 3 word-entry.\\n 4 word-len binary pic 9(4).\\n 4 word pic x(36).\\n 1 binary.\\n 2 i pic 9(4).\\n 2 pos pic 9(4).\\n 2 word-stack-ptr pic 9(4).\\n\\n procedure division.\\n perform varying i from 1 by 1\\n until i > 10\\n perform push-words\\n perform pop-words\\n end-perform\\n stop run\\n .\\n\\n push-words.\\n move 1 to pos\\n move 0 to word-stack-ptr\\n perform until pos > 36\\n unstring text-line (i) delimited by all space\\n into wk-word count in wk-len\\n pointer pos\\n end-unstring\\n add 1 to word-stack-ptr\\n move text-word to word-entry (word-stack-ptr)\\n end-perform\\n .\\n\\n pop-words.\\n perform varying word-stack-ptr from word-stack-ptr\\n by -1\\n until word-stack-ptr < 1\\n move word-entry (word-stack-ptr) to text-word\\n display wk-word (1:wk-len) space with no advancing\\n end-perform\\n display space\\n .\\n end program rev-word.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"strReversed = '---------- Ice and Fire ------------\\\\n\\\\n\\nfire, in end will world the say Some\\\\n\\nice. in say Some\\\\n\\ndesire of tasted I\\\\'ve what From\\\\n\\nfire. favor who those with hold I\\\\n\\\\n\\n... elided paragraph last ...\\\\n\\\\n\\nFrost Robert -----------------------'\\n\\nreverseString = (s) ->\\n s.split('\\\\n').map((l) -> l.split(/\\\\s/).reverse().join ' ').join '\\\\n'\\n\\nconsole.log reverseString(strReversed)\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(defun split-and-reverse (str)\\n (labels\\n ((iter (s lst)\\n (let ((s2 (string-trim '(#\\\\space) s)))\\n (if s2\\n (let ((word-end (position #\\\\space s2)))\\n (if (and word-end (< (1+ word-end) (length s2)))\\n (iter (subseq s2 (1+ word-end))\\n (cons (subseq s2 0 word-end) lst))\\n (cons s2 lst)))\\n lst))))\\n (iter str NIL)))\\n\\n(defparameter *poem*\\n \\\"---------- Ice and Fire ------------\\n\\n fire, in end will world the say Some\\n ice. in say Some\\n desire of tasted I've what From\\n fire. favor who those with hold I\\n\\n ... elided paragraph last ...\\n\\n Frost Robert -----------------------\\\")\\n\\n(with-input-from-string (s *poem*)\\n (loop for line = (read-line s NIL)\\n while line\\n do (format t \\\"~{~a~#[~:; ~]~}~%\\\" (split-and-reverse line))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.string, std.range, std.algorithm;\\n\\n immutable text =\\n\\\"---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\\";\\n\\n writefln(\\\"%(%-(%s %)\\\\n%)\\\",\\n text.splitLines.map!(r => r.split.retro));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program RosettaCode_ReverseWordsInAString;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses Classes, Types, StrUtils;\\n\\nconst\\n TXT =\\n '---------- Ice and Fire -----------'+sLineBreak+\\n sLineBreak+\\n 'fire, in end will world the say Some'+sLineBreak+\\n 'ice. in say Some'+sLineBreak+\\n 'desire of tasted I''ve what From'+sLineBreak+\\n 'fire. favor who those with hold I'+sLineBreak+\\n sLineBreak+\\n '... elided paragraph last ...'+sLineBreak+\\n sLineBreak+\\n 'Frost Robert -----------------------'+sLineBreak;\\n\\nvar\\n i, w: Integer;\\n d: TStringDynArray;\\nbegin\\n with TStringList.Create do\\n try\\n Text := TXT;\\n for i := 0 to Count - 1 do\\n begin\\n d := SplitString(Strings[i], #32);\\n Strings[i] := '';\\n for w := Length(d) - 1 downto 0 do\\n Strings[i] := Strings[i] + #32 + d[w];\\n end;\\n Writeln(Text);\\n finally\\n Free\\n end;\\n ReadLn;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"repeat\\n s$ = input\\n until error = 1\\n s$[] = strsplit s$ \\\" \\\"\\n for i = len s$[] downto 1\\n write s$[i] & \\\" \\\"\\n .\\n print \\\"\\\"\\n.\\ninput_data\\n--------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"(define S #<<\\n---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\n>>#)\\n\\t\\t\\t\\n(for-each writeln\\n (for/list ((line (string-split S \\\"\\\\n\\\")))\\n (string-join (reverse (string-split line \\\" \\\")) \\\" \\\")))\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"import extensions;\\nimport system'routines;\\n\\npublic program()\\n{\\n var text := new string[]{\\\"---------- Ice and Fire ------------\\\",\\n \\\"\\\",\\n \\\"fire, in end will world the say Some\\\",\\n \\\"ice. in say Some\\\",\\n \\\"desire of tasted I've what From\\\",\\n \\\"fire. favor who those with hold I\\\",\\n \\\"\\\",\\n \\\"... elided paragraph last ...\\\",\\n \\\"\\\",\\n \\\"Frost Robert -----------------------\\\"};\\n\\n text.forEach::(line)\\n {\\n line.splitBy(\\\" \\\").sequenceReverse().forEach::(word)\\n {\\n console.print(word,\\\" \\\")\\n };\\n console.writeLine()\\n }\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"defmodule RC do\\n def reverse_words(txt) do\\n txt |> String.split(\\\"\\\\n\\\") # split lines\\n |> Enum.map(&( # in each line\\n &1 |> String.split # split words\\n |> Enum.reverse # reverse words\\n |> Enum.join(\\\" \\\"))) # rejoin words\\n |> Enum.join(\\\"\\\\n\\\") # rejoin lines\\n end\\nend\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"txt = \\\"\\\"\\\"\\n---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\n\\\"\\\"\\\"\\n\\nIO.puts RC.reverse_words(txt)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"reversedPoem =\\n String.trim \\\"\\\"\\\"\\n ---------- Ice and Fire ------------\\n\\n fire, in end will world the say Some\\n ice. in say Some\\n desire of tasted I've what From\\n fire. favor who those with hold I\\n\\n ... elided paragraph last ...\\n\\n Frost Robert -----------------------\\n \\\"\\\"\\\"\\n\\nreverseWords string =\\n string |> String.words |> List.reverse |> String.join \\\" \\\"\\n\\nreverseLinesWords string =\\n string |> String.lines |> List.map reverseWords |> String.join \\\"\\\\n\\\"\\n\\npoem =\\n reverseLinesWords reversedPoem\\n\",\n \"language\": \"Elm\"\n },\n {\n \"code\": \"(defun reverse-words (line)\\n (insert\\n (format \\\"%s\\\\n\\\"\\n (mapconcat 'identity (reverse (split-string line)) \\\" \\\"))))\\n\\n(defun reverse-lines (lines)\\n (mapcar 'reverse-words lines))\\n\\n(reverse-lines\\n '(\\\"---------- Ice and Fire ------------\\\"\\n \\\"\\\"\\n \\\"fire, in end will world the say Some\\\"\\n \\\"ice. in say Some\\\"\\n \\\"desire of tasted I've what From\\\"\\n \\\"fire. favor who those with hold I\\\"\\n \\\"\\\"\\n \\\"... elided paragraph last ...\\\"\\n \\\"\\\"\\n \\\"Frost Robert ----------------------- \\\"))\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"//Reverse words in a string. Nigel Galloway: July 14th., 2021\\n[\\\" ---------- Ice and Fire ------------ \\\";\\n \\\" \\\";\\n \\\" fire, in end will world the say Some \\\";\\n \\\" ice. in say Some \\\";\\n \\\" desire of tasted I've what From \\\";\\n \\\" fire. favour who those with hold I \\\";\\n \\\" \\\";\\n \\\" ... elided paragraph last ... \\\";\\n \\\" \\\";\\n \\\" Frost Robert ----------------------- \\\"]|>List.map(fun n->n.Split \\\" \\\"|>Array.filter((<>)\\\"\\\")|>Array.rev|>String.concat \\\" \\\")|>List.iter(printfn \\\"%s\\\")\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: io sequences splitting ;\\nIN: rosetta-code.reverse-words\\n\\n\\\"---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\\"\\n\\n\\\"\\\\n\\\" split [ \\\" \\\" split reverse \\\" \\\" join ] map [ print ] each\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": not-empty? dup 0 > ;\\n: (reverse) parse-name not-empty? IF recurse THEN type space ;\\n: reverse (reverse) cr ;\\n\\nreverse ---------- Ice and Fire ------------\\nreverse\\nreverse fire, in end will world the say Some\\nreverse ice. in say Some\\nreverse desire of tasted I've what From\\nreverse fire. favor who those with hold I\\nreverse\\nreverse ... elided paragraph last ...\\nreverse\\nreverse Frost Robert -----------------------\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" character*40 words\\n character*40 reversed\\n logical inblank\\n ierr=0\\n read (5,fmt=\\\"(a)\\\",iostat=ierr)words\\n do while (ierr.eq.0)\\n inblank=.true.\\n ipos=1\\n do i=40,1,-1\\n if(words(i:i).ne.' '.and.inblank) then\\n last=i\\n inblank=.false.\\n end if\\n if(.not.inblank.and.words(i:i).eq.' ') then\\n reversed(ipos:ipos+last-i)=words(i+1:last)\\n ipos=ipos+last-i+1\\n inblank=.true.\\n end if\\n if(.not.inblank.and.i.eq.1) then\\n reversed(ipos:ipos+last-1)=words(1:last)\\n ipos=ipos+last\\n end if\\n end do\\n print *,words,'=> ',reversed(1:ipos-1)\\n read (5,fmt=\\\"(a)\\\",iostat=ierr)words\\n end do\\n end\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nSub split (s As String, sepList As String, result() As String, removeEmpty As Boolean = False)\\n If s = \\\"\\\" OrElse sepList = \\\"\\\" Then\\n Redim result(0)\\n result(0) = s\\n Return\\n End If\\n Dim As Integer i, j, count = 0, empty = 0, length\\n Dim As Integer position(Len(s) + 1)\\n position(0) = 0\\n\\n For i = 0 To len(s) - 1\\n For j = 0 to Len(sepList) - 1\\n If s[i] = sepList[j] Then\\n count += 1\\n position(count) = i + 1\\n End If\\n Next j\\n Next i\\n\\n Redim result(count)\\n If count = 0 Then\\n result(0) = s\\n Return\\n End If\\n\\n position(count + 1) = len(s) + 1\\n\\n For i = 1 To count + 1\\n length = position(i) - position(i - 1) - 1\\n result(i - 1 - empty) = Mid(s, position(i - 1) + 1, length)\\n If removeEmpty Andalso CBool(length = 0) Then empty += 1\\n Next\\n\\n If empty > 0 Then Redim Preserve result(count - empty)\\nEnd Sub\\n\\nDim s As String = \\\"Hey you, Bub!\\\"\\nDim a() As String\\nsplit(s, \\\" \\\", a(), true)\\nDim reversed As String = \\\"\\\"\\nFor i As Integer = UBound(a) To LBound(a) Step -1\\n reversed += a(i)\\n If i > LBound(a) Then reversed += \\\" \\\"\\nNext\\n\\nPrint \\\"Original String = \\\"; s\\nPrint \\\"Reversed String = \\\"; reversed\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"lines=split[\\\"\\\\n\\\",\\n\\\"\\\"\\\"---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n .. elided paragraph last ...\\n\\nFrost Robert -----------------------\\\"\\\"\\\"]\\n\\nfor line = lines\\n println[join[\\\" \\\", reverse[split[%r/\\\\s+/, line]]]]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"include \\\"NSLog.incl\\\"\\n\\nCFStringRef frostStr\\nCFArrayRef frostArr, tempArr\\nCFMutableStringRef mutStr\\nNSInteger i, count\\n\\nfrostStr = @\\\"---------- Ice and Fire ------------\\\\n¬\\n\\\\n¬\\nfire, in end will world the say Some\\\\n¬\\nice. in say Some\\\\n¬\\ndesire of tasted I've what From\\\\n¬\\nfire. favor who those with hold I\\\\n¬\\n\\\\n¬\\n… elided paragraph last …\\\\n¬\\n\\\\n¬\\nFrost Robert -----------------------\\\\n\\\"\\n\\nfrostArr = fn StringComponentsSeparatedByString( frostStr, @\\\"\\\\n\\\" )\\ncount = fn ArrayCount( frostArr )\\nmutStr = fn MutableStringWithCapacity( 0 )\\n\\nfor i = 0 to count - 1\\ntempArr = fn StringComponentsSeparatedByString( frostArr[i], @\\\" \\\" )\\ntempArr = fn EnumeratorAllObjects( fn ArrayReverseObjectEnumerator( tempArr ) )\\nMutableStringAppendString( mutStr, fn ArrayComponentsJoinedByString( tempArr, @\\\" \\\" ) )\\nMutableStringAppendString( mutStr, @\\\"\\\\n\\\" )\\nnext\\n\\nNSLog( @\\\"%@\\\", mutStr )\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"Public Sub Main()\\nDim sString As New String[10] 'Array for the input text\\nDim sLine As New String[] 'Array of each word in a line\\nDim siCount0, siCount1 As Short 'Counters\\nDim sOutput, sReverse, sTemp As String 'Strings\\n\\nsString[0] = \\\"---------- Ice And Fire ------------\\\" 'Input text\\nsString[1] = \\\" \\\"\\nsString[2] = \\\"fire, in end will world the say Some\\\"\\nsString[3] = \\\"ice. in say Some \\\"\\nsString[4] = \\\"desire of tasted I've what From \\\"\\nsString[5] = \\\"fire. favor who those with hold I \\\"\\nsString[6] = \\\" \\\"\\nsString[7] = \\\"... elided paragraph last ... \\\"\\nsString[8] = \\\" \\\"\\nsString[9] = \\\"Frost Robert -----------------------\\\"\\n\\nFor siCount0 = 0 To 9 'To work through each line of input text\\n If Trim(sString[siCount0]) = \\\"\\\" Then sString[siCount0] = \\\" \\\" 'If the line is all spaces then make it 1 space\\n\\n For Each sTemp In Split(Trim(sString[siCount0]), \\\" \\\") 'Split the trimmed line by spaces\\n sLine.Add(sTemp) 'Add each word to the sLine array\\n Next\\n\\n For siCount1 = sLine.max DownTo 0 'Loop from the last in the sLine array to 0\\n sReverse &= sLine[siCount1] & \\\" \\\" 'Fill sReverse with words reversed, adding a space\\n Next\\n\\n sOutput &= Trim(sReverse) & gb.NewLine 'Add the reversed words to sOutput and add a newline\\n sReverse = \\\"\\\" 'Clear sReverse\\n sLine.Clear 'Clear sLine array\\nNext\\n\\nPrint sOutput 'Print the output\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"\\\\L<G> <U>=@{$2} $1\\n\",\n \"language\": \"Gema\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"strings\\\"\\n)\\n\\n// a number of strings\\nvar n = []string{\\n \\\"---------- Ice and Fire ------------\\\",\\n \\\" \\\",\\n \\\"fire, in end will world the say Some\\\",\\n \\\"ice. in say Some \\\",\\n \\\"desire of tasted I've what From \\\",\\n \\\"fire. favor who those with hold I \\\",\\n \\\" \\\",\\n \\\"... elided paragraph last ... \\\",\\n \\\" \\\",\\n \\\"Frost Robert -----------------------\\\",\\n}\\n\\nfunc main() {\\n for i, s := range n {\\n t := strings.Fields(s) // tokenize\\n // reverse\\n last := len(t) - 1\\n for j, k := range t[:len(t)/2] {\\n t[j], t[last-j] = t[last-j], k\\n }\\n n[i] = strings.Join(t, \\\" \\\")\\n }\\n // display result\\n for _, t := range n {\\n fmt.Println(t)\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def text = new StringBuilder()\\n .append('---------- Ice and Fire ------------\\\\n')\\n .append(' \\\\n')\\n .append('fire, in end will world the say Some\\\\n')\\n .append('ice. in say Some \\\\n')\\n .append('desire of tasted I\\\\'ve what From \\\\n')\\n .append('fire. favor who those with hold I \\\\n')\\n .append(' \\\\n')\\n .append('... elided paragraph last ... \\\\n')\\n .append(' \\\\n')\\n .append('Frost Robert -----------------------\\\\n').toString()\\n\\ntext.eachLine { line ->\\n println \\\"$line --> ${line.split(' ').reverse().join(' ')}\\\"\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"revstr :: String -> String\\nrevstr = unwords . reverse . words -- point-free style\\n--equivalent:\\n--revstr s = unwords (reverse (words s))\\n\\nrevtext :: String -> String\\nrevtext = unlines . map revstr . lines -- applies revstr to each line independently\\n\\ntest = revtext \\\"---------- Ice and Fire ------------\\\\n\\\\\\n \\\\\\\\n\\\\\\n \\\\fire, in end will world the say Some\\\\n\\\\\\n \\\\ice. in say Some\\\\n\\\\\\n \\\\desire of tasted I've what From\\\\n\\\\\\n \\\\fire. favor who those with hold I\\\\n\\\\\\n \\\\\\\\n\\\\\\n \\\\... elided paragraph last ...\\\\n\\\\\\n \\\\\\\\n\\\\\\n \\\\Frost Robert -----------------------\\\\n\\\" --multiline string notation requires \\\\ at end and start of lines, and \\\\n to be manually input\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\n every write(rWords(&input))\\nend\\n\\nprocedure rWords(f)\\n every !f ? {\\n every (s := \\\"\\\") := genWords() || s\\n suspend s\\n }\\nend\\n\\nprocedure genWords()\\n while w := 1(tab(upto(\\\" \\\\t\\\")),tab(many(\\\" \\\\t\\\"))) || \\\" \\\" do suspend w\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"(var poem\\n \\\"---------- Ice and Fire ------------\\n\\n fire, in end will world the say Some\\n ice. in say Some\\n desire of tasted I've what From\\n fire. favor who those with hold I\\n\\n ... elided paragraph last ...\\n\\n Frost Robert -----------------------\\\")\\n\\n(function split-join by then x\\n (-> x (split by) then (join by)))\\n\\n(split-join \\\"\\\\n\\\" (map @(split-join \\\" \\\" reverse)) poem)\\n\",\n \"language\": \"Insitux\"\n },\n {\n \"code\": \" ([:;@|.[:<;.1 ' ',]);._2]0 :0\\n---------- Ice and Fire ------------\\n\\n fire, in end will world the say Some\\n ice. in say Some\\n desire of tasted I've what From\\n fire. favor who those with hold I\\n\\n ... elided paragraph last ...\\n\\n Frost Robert -----------------------\\n)\\n ------------ Fire and Ice ----------\\n\\n Some say the world will end in fire,\\n Some say in ice.\\n From what I've tasted of desire\\n I hold with those who favor fire.\\n\\n ... last paragraph elided ...\\n\\n ----------------------- Robert Frost\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"echo ;:inv@|.@cut;._2 {{)n\\n---------- Ice and Fire ------------\\n\\n fire, in end will world the say Some\\n ice. in say Some\\n desire of tasted I've what From\\n fire. favor who those with hold I\\n\\n ... elided paragraph last ...\\n\\n Frost Robert -----------------------\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class ReverseWords {\\n\\n static final String[] lines = {\\n \\\" ----------- Ice and Fire ----------- \\\",\\n \\\" \\\",\\n \\\" fire, in end will world the say Some \\\",\\n \\\" ice. in say Some \\\",\\n \\\" desire of tasted I've what From \\\",\\n \\\" fire. favor who those with hold I \\\",\\n \\\" \\\",\\n \\\" ... elided paragraph last ... \\\",\\n \\\" Frost Robert ----------------------- \\\"};\\n\\n public static void main(String[] args) {\\n for (String line : lines) {\\n String[] words = line.split(\\\"\\\\\\\\s\\\");\\n for (int i = words.length - 1; i >= 0; i--)\\n System.out.printf(\\\"%s \\\", words[i]);\\n System.out.println();\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"package string;\\n\\nimport static java.util.Arrays.stream;\\n\\npublic interface ReverseWords {\\n public static final String[] LINES = {\\n \\\" ----------- Ice and Fire ----------- \\\",\\n \\\" \\\",\\n \\\" fire, in end will world the say Some \\\",\\n \\\" ice. in say Some \\\",\\n \\\" desire of tasted I've what From \\\",\\n \\\" fire. favor who those with hold I \\\",\\n \\\" \\\",\\n \\\" ... elided paragraph last ... \\\",\\n \\\" Frost Robert ----------------------- \\\"\\n };\\n\\n public static String[] reverseWords(String[] lines) {\\n return stream(lines)\\n .parallel()\\n .map(l -> l.split(\\\"\\\\\\\\s\\\"))\\n .map(ws -> stream(ws)\\n .parallel()\\n .map(w -> \\\" \\\" + w)\\n .reduce(\\n \\\"\\\",\\n (w1, w2) -> w2 + w1\\n )\\n )\\n .toArray(String[]::new)\\n ;\\n }\\n\\n public static void main(String... arguments) {\\n stream(reverseWords(LINES))\\n .forEach(System.out::println)\\n ;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var strReversed =\\n\\\"---------- Ice and Fire ------------\\\\n\\\\\\n\\\\n\\\\\\nfire, in end will world the say Some\\\\n\\\\\\nice. in say Some\\\\n\\\\\\ndesire of tasted I've what From\\\\n\\\\\\nfire. favor who those with hold I\\\\n\\\\\\n\\\\n\\\\\\n... elided paragraph last ...\\\\n\\\\\\n\\\\n\\\\\\nFrost Robert -----------------------\\\";\\n\\nfunction reverseString(s) {\\n return s.split('\\\\n').map(\\n function (line) {\\n return line.split(/\\\\s/).reverse().join(' ');\\n }\\n ).join('\\\\n');\\n}\\n\\nconsole.log(\\n reverseString(strReversed)\\n);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"split(\\\"[ \\\\t\\\\n\\\\r]+\\\") | reverse | join(\\\" \\\")\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ jq -R -r -M -f reverse_words.jq IceAndFire.txt\\n------------ Fire and Ice ----------\\n\\nSome say the world will end in fire,\\nSome say in ice.\\nFrom what I've tasted of desire\\nI hold with those who favor fire.\\n\\n... last paragraph elided ...\\n\\n----------------------- Robert Frost\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"var strReversed =\\n\\\"---------- Ice and Fire ------------\\\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\\\n... elided paragraph last ...\\\\n\\nFrost Robert -----------------------\\\";\\n\\nfunction reverseString(s) {\\n return s.split('\\\\n').map(\\n function (line) {\\n return line.split().reverse().join(' ');\\n }\\n ).join('\\\\n');\\n}\\n\\n;reverseString('Hey you, Bub!');\\n;strReversed;\\n;reverseString(strReversed);\\n\\n/*\\n=!EXPECTSTART!=\\nreverseString('Hey you, Bub!') ==> Bub! you, Hey\\nstrReversed ==> ---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\nreverseString(strReversed) ==> ------------ Fire and Ice ----------\\n\\nSome say the world will end in fire,\\nSome say in ice.\\nFrom what I've tasted of desire\\nI hold with those who favor fire.\\n\\n... last paragraph elided ...\\n\\n----------------------- Robert Frost\\n=!EXPECTEND!=\\n*/\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"revstring (str) = join(reverse(split(str, \\\" \\\")), \\\" \\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"fun reversedWords(s: String) = s.split(\\\" \\\").filter { it.isNotEmpty() }.reversed().joinToString(\\\" \\\")\\n\\nfun main() {\\n val s = \\\"Hey you, Bub!\\\"\\n println(reversedWords(s))\\n println()\\n val sl = listOf(\\n \\\" ---------- Ice and Fire ------------ \\\",\\n \\\" \\\",\\n \\\" fire, in end will world the say Some \\\",\\n \\\" ice. in say Some \\\",\\n \\\" desire of tasted I've what From \\\",\\n \\\" fire. favor who those with hold I \\\",\\n \\\" \\\",\\n \\\" ... elided paragraph last ... \\\",\\n \\\" \\\",\\n \\\" Frost Robert ----------------------- \\\",\\n )\\n sl.forEach { println(reversedWords(it)) }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"#!/bin/ksh\\n\\n# Reverse words in a string\\n\\n#\\t# Variables:\\n#\\ntypeset -a wArr\\ninteger i\\n\\n\\n ######\\n# main #\\n ######\\n\\nwhile read -A wArr; do\\n\\tfor ((i=${#wArr[@]}-1; i>=0; i--)); do\\n\\t\\tprintf \\\"%s \\\" \\\"${wArr[i]}\\\"\\n\\tdone\\n\\techo\\ndone << EOF\\n---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\nFrost Robert -----------------------\\nEOF\\n\",\n \"language\": \"Ksh\"\n },\n {\n \"code\": \"1) We write a function\\n\\n{def line_reverse\\n {def line_reverse.r\\n {lambda {:i :txt :length}\\n {if {> :i :length}\\n then\\n else {br}{A2S {A.reverse! {A.get :i :txt}}}\\n {line_reverse.r {+ :i 1} :txt :length}}}}\\n {lambda {:txt}\\n {let { {:a {line_split {:txt}}} }\\n {line_reverse.r 0 :a {- {A.length :a} 1}}}} }\\n-> line_reverse\\n\\nwhere A2S translates an array into a sentence\\n\\n{def A2S\\n {lambda {:a}\\n {if {A.empty? :a}\\n then\\n else {A.first :a} {A2S {A.rest :a}}}}}\\n-> A2S\\n\\nand line_split is a javascript primitive directly written in the wiki page,\\nadded to the dictionary and returning an array of lines\\n\\nLAMBDATALK.DICT['line_split'] = function () {\\n var args = arguments[0].split(\\\"\\\\n\\\");\\n var str = \\\"{A.new \\\";\\n for (var i=0; i< args.length; i++)\\n str += \\\"{A.new \\\" + args[i] + \\\"} \\\";\\n str += \\\"}\\\";\\n return LAMBDATALK.eval_forms( str )\\n};\\n\\n2) input (from a simple text source without any presetting)\\n\\n{def rosetta\\n---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I''ve what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\n}\\n-> rosetta\\n\\n3) calling the function:\\n\\n{line_reverse rosetta}\\n->\\n\\n3) output\\n\\n------------ Fire and Ice ----------\\n\\nSome say the world will end in fire,\\nSome say in ice.\\nFrom what I''ve tasted of desire\\nI hold with those who favor fire.\\n\\n... last paragraph elided ...\\n\\n----------------------- Robert Frost\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"for i = 1 to 10\\n read string$\\n print reverse$(string$)\\nnext\\nend\\n\\nfunction reverse$(string$)\\n token$=\\\"*\\\"\\n while token$<>\\\"\\\"\\n i=i+1\\n token$ = word$(string$, i)\\n output$=token$+\\\" \\\"+output$\\n wend\\n reverse$ = trim$(output$)\\nend function\\n\\ndata \\\"---------- Ice and Fire ------------\\\"\\ndata \\\"\\\"\\ndata \\\"fire, in end will world the say Some\\\"\\ndata \\\"ice. in say Some\\\"\\ndata \\\"desire of tasted I've what From\\\"\\ndata \\\"fire. favor who those with hold I\\\"\\ndata \\\"\\\"\\ndata \\\"... elided paragraph last ...\\\"\\ndata \\\"\\\"\\ndata \\\"Frost Robert -----------------------\\\"\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"repeat for each line txtln in fld \\\"Fieldtxt\\\"\\n repeat with i = the number of words of txtln down to 1\\n put word i of txtln & space after txtrev\\n end repeat\\n put cr after txtrev -- preserve line\\nend repeat\\nput txtrev\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"poem =\\n \\\"\\\"\\\"\\n ---------- Ice and Fire ------------\\n\\n fire, in end will world the say Some\\n ice. in say Some\\n desire of tasted I've what From\\n fire. favor who those with hold I\\n\\n ... elided paragraph last ...\\n\\n Frost Robert -----------------------\\n \\\"\\\"\\\"\\n\\nreverse-words = (.split ' ') >> (.reverse!) >> (.join ' ')\\nreverse-string = (.split '\\\\n') >> (.map reverse-words) >> (.join '\\\\n')\\nreverse-string poem\\n\",\n \"language\": \"LiveScript\"\n },\n {\n \"code\": \"do.until [\\n make \\\"line readlist\\n print reverse :line\\n] [word? :line]\\nbye\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"local lines = {}\\nfor line in (s .. \\\"\\\\n\\\"):gmatch(\\\"(.-)\\\\n\\\") do\\n\\tlocal this = {}\\n\\tfor word in line:gmatch(\\\"%S+\\\") do\\n\\t\\ttable.insert(this, 1, word)\\n\\tend\\n\\tlines[#lines + 1] = table.concat(this, \\\" \\\")\\nend\\nprint(table.concat(lines, \\\"\\\\n\\\"))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"function table.reverse(a)\\n local res = {}\\n for i = #a, 1, -1 do\\n res[#res+1] = a[i]\\n end\\n return res\\nend\\n\\nfunction splittokens(s)\\n local res = {}\\n for w in s:gmatch(\\\"%S+\\\") do\\n res[#res+1] = w\\n end\\n return res\\nend\\n\\nfor line, nl in s:gmatch(\\\"([^\\\\n]-)(\\\\n)\\\") do\\n print(table.concat(table.reverse(splittokens(line)), ' '))\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"while (true) do\\n\\tinput := readline(\\\"input.txt\\\"):\\n\\tif input = 0 then break: fi:\\n\\tinput := StringTools:-Trim(input): # remove leading/trailing space\\n\\tinput := StringTools:-Join(ListTools:-Reverse(StringTools:-Split(input, \\\" \\\")),\\\" \\\"):\\n\\tprintf(\\\"%s\\\\n\\\", input):\\nod:\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"poem = \\\"---------- Ice and Fire ------------\\n\\n fire, in end will world the say Some\\n ice. in say Some\\n desire of tasted I've what From\\n fire. favor who those with hold I\\n\\n ... elided paragraph last ...\\n\\n Frost Robert -----------------------\\\";\\nlines = StringSplit[poem, \\\"\\\\n\\\"];\\nwordArray = StringSplit[#] & @ lines ;\\nreversedWordArray = Reverse[#] & /@ wordArray ;\\nlinesWithReversedWords =\\n StringJoin[Riffle[#, \\\" \\\"]] & /@ reversedWordArray;\\nfinaloutput = StringJoin[Riffle[#, \\\"\\\\n\\\"]] & @ linesWithReversedWords\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function testReverseWords\\n testStr = {'---------- Ice and Fire ------------' ; ...\\n '' ; ...\\n 'fire, in end will world the say Some' ; ...\\n 'ice. in say Some' ; ...\\n 'desire of tasted I''ve what From' ; ...\\n 'fire. favor who those with hold I' ; ...\\n '' ; ...\\n '... elided paragraph last ...' ; ...\\n '' ; ...\\n 'Frost Robert -----------------------' };\\n for k = 1:length(testStr)\\n fprintf('%s\\\\n', reverseWords(testStr{k}))\\n end\\nend\\n\\nfunction strOut = reverseWords(strIn)\\n strOut = strtrim(strIn);\\n if ~isempty(strOut)\\n % Could use strsplit() instead of textscan() in R2013a or later\\n words = textscan(strOut, '%s');\\n words = words{1};\\n strOut = strtrim(sprintf('%s ', words{end:-1:1}));\\n end\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"-- MAXScript : Reverse words in a string : N.H. 2019\\n--\\n(\\ntext = stringstream \\\"---------- Ice and Fire ------------\\\\n\\\\nfire, in end will world the say Some\\\\nice. in say Some\\\\ndesire of tasted I've what From\\\\nfire. favor who those with hold I\\\\n\\\\n... elided paragraph last ...\\\\n\\\\nFrost Robert -----------------------\\\\n\\\"\\nclearListener()\\nseek text 0\\nwhile eof text == false do\\n(\\nnextLine = (readLine text)\\nif nextLine == \\\"\\\" then\\n(\\nprint \\\"\\\"\\ncontinue\\t\\n) -- end of if\\nrevLine = \\\"\\\"\\neachWord = filterString nextLine \\\" \\\"\\nfor k = eachWord.count to 1 by -1 do\\n(\\nrevLine = revLine + eachWord[k]\\n-- Only add space between words not at the end of line\\nif k != 1 then revLine = revLine + \\\" \\\"\\n) -- end of for k\\nprint revLine\\n) -- end of while eof\\n)\\n\",\n \"language\": \"MAXScript\"\n },\n {\n \"code\": \"lines = [\\\"==========================================\\\",\\n \\\"| ---------- Ice and Fire ------------ |\\\",\\n \\\"| |\\\",\\n \\\"| fire, in end will world the say Some |\\\",\\n \\\"| ice. in say Some |\\\",\\n \\\"| desire of tasted I've what From |\\\",\\n \\\"| fire. favor who those with hold I |\\\",\\n \\\"| |\\\",\\n \\\"| ... elided paragraph last ... |\\\",\\n \\\"| |\\\",\\n \\\"| Frost Robert ----------------------- |\\\",\\n \\\"==========================================\\\"]\\n\\nfor line in lines\\n oldLine = line.split\\n newLine = []\\n while oldLine\\n// the line below line retains the outer box format\\n newLine.push oldLine.pop\\n// alternate format, replace above line with below two lines below to strip all superfluous spaces\\n//\\tword = oldLine.pop\\n//\\tif word != \\\"\\\" then newLine.push word\\n end while\\n print newLine.join\\nend for\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"MODULE ReverseWords;\\n\\nFROM STextIO IMPORT\\n WriteString, WriteLn;\\nFROM Strings IMPORT\\n Assign, Concat, Append;\\n\\nCONST\\n NL = CHR(10);\\n Sp = ' ';\\n Txt = \\\"---------- Ice and Fire -----------\\\" + NL +\\n NL +\\n \\\"fire, in end will world the say Some\\\" + NL +\\n \\\"ice. in say Some\\\" + NL +\\n \\\"desire of tasted I've what From\\\" + NL +\\n \\\"fire. favor who those with hold I\\\" + NL +\\n NL +\\n \\\"... elided paragraph last ...\\\" + NL +\\n NL +\\n \\\"Frost Robert -----------------------\\\" + NL;\\n\\nTYPE\\n String400 = ARRAY [0 .. 399] OF CHAR;\\n\\nPROCEDURE AddWord(Source: ARRAY OF CHAR; VAR INOUT Destination: ARRAY OF CHAR);\\nVAR\\n R: String400;\\nBEGIN\\n Concat(Source, Sp, R);\\n Append(Destination, R);\\n Assign(R, Destination);\\nEND AddWord;\\n\\nVAR\\n I: CARDINAL;\\n SingleWord, CurrentLine: String400;\\n C: CHAR;\\n\\nBEGIN\\n SingleWord := \\\"\\\";\\n CurrentLine := \\\"\\\";\\n FOR I := 0 TO HIGH(Txt) DO\\n C := Txt[I];\\n CASE C OF\\n Sp:\\n AddWord(SingleWord, CurrentLine);\\n SingleWord := \\\"\\\"; |\\n NL:\\n AddWord(SingleWord, CurrentLine);\\n WriteString(CurrentLine);\\n WriteLn;\\n SingleWord := \\\"\\\";\\n CurrentLine := \\\"\\\"; |\\n ELSE\\n Append(C, SingleWord);\\n END;\\n END;\\nEND ReverseWords.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"def reverse_words(string)\\n tokens = split(string, \\\" \\\")\\n if len(tokens) = 0\\n return \\\"\\\"\\n end\\n\\n ret_str = \\\"\\\"\\n for i in range(len(tokens) - 1, 0)\\n ret_str += tokens[i] + \\\" \\\"\\n end\\n return ret_str.substring(0, len(ret_str) - 1)\\nend\\n\\ndata = \\\"---------- Ice and Fire ------------\\\\n\\\" +\\\\\\n \\\" \\\\n\\\" +\\\\\\n \\\"fire, in end will world the say Some\\\\n\\\" +\\\\\\n \\\"ice. in say Some \\\\n\\\" +\\\\\\n \\\"desire of tasted I've what From \\\\n\\\" +\\\\\\n \\\"fire. favor who those with hold I \\\\n\\\" +\\\\\\n \\\" \\\\n\\\" +\\\\\\n \\\"... elided paragraph last ... \\\\n\\\" +\\\\\\n \\\"Frost Robert -----------------------\\\\n\\\"\\n\\nfor line in split(data, \\\"\\\\n\\\")\\n println reverse_words(line)\\nend\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"# Define a function to convert a list of strings to a single string.\\njoin is rest link (' ' eachboth link)\\n\\niterate (write join reverse (' ' string_split)) \\\\\\n \\\\\\n \\\\\\n '------------ Eldorado ----------' \\\\\\n '' \\\\\\n '... here omitted lines ...' \\\\\\n '' \\\\\\n 'Mountains the \\\"Over' \\\\\\n 'Moon, the Of' \\\\\\n 'Shadow, the of Valley the Down' \\\\\\n 'ride,\\\" boldly Ride,' \\\\\\n 'replied,--- shade The' \\\\\\n 'Eldorado!\\\" for seek you \\\"If' \\\\\\n '' \\\\\\n 'Poe Edgar -----------------------'\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \"import strutils\\n\\nlet text = \\\"\\\"\\\"---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\\"\\\"\\\"\\n\\nproc reversed*[T](a: openArray[T], first, last: int): seq[T] =\\n result = newSeq[T](last - first + 1)\\n var x = first\\n var y = last\\n while x <= last:\\n result[x] = a[y]\\n dec(y)\\n inc(x)\\n\\nproc reversed*[T](a: openArray[T]): seq[T] =\\n reversed(a, 0, a.high)\\n\\nfor line in text.splitLines():\\n echo line.split(' ').reversed().join(\\\" \\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use Collection;\\n\\nclass Reverselines {\\n function : Main(args : String[]) ~ Nil {\\n lines := List->New();\\n lines->AddBack(\\\"---------- Ice and Fire ------------\\\");\\n lines->AddBack(\\\"\\\");\\n lines->AddBack(\\\"fire, in end will world the say Some\\\");\\n lines->AddBack(\\\"ice. in say Some\\\");\\n lines->AddBack(\\\"desire of tasted I've what From\\\");\\n lines->AddBack(\\\"fire. favor who those with hold I\\\");\\n lines->AddBack(\\\"\\\");\\n lines->AddBack(\\\"... elided paragraph last ...\\\");\\n lines->AddBack(\\\"\\\");\\n lines->AddBack(\\\"Frost Robert -----------------------\\\");\\n\\n lines->Rewind();\\n each(i : lines) {\\n words := lines->Get()->As(String)->Split(\\\" \\\");\\n if(words <> Nil) {\\n for(j := words->Size() - 1; j > -1; j-=1;) {\\n IO.Console->Print(words[j])->Print(\\\" \\\");\\n };\\n };\\n IO.Console->PrintLine();\\n lines->Next();\\n };\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"#load \\\"str.cma\\\"\\nlet input = [\\\"---------- Ice and Fire ------------\\\";\\n \\\"\\\";\\n \\\"fire, in end will world the say Some\\\";\\n \\\"ice. in say Some\\\";\\n \\\"desire of tasted I've what From\\\";\\n \\\"fire. favor who those with hold I\\\";\\n \\\"\\\";\\n \\\"... elided paragraph last ...\\\";\\n \\\"\\\";\\n \\\"Frost Robert -----------------------\\\"];;\\n\\nlet splitted = List.map (Str.split (Str.regexp \\\" \\\")) input in\\nlet reversed = List.map List.rev splitted in\\nlet final = List.map (String.concat \\\" \\\") reversed in\\nList.iter print_endline final;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \": revWords(s)\\n s words reverse unwords ;\\n\\n: reverseWords\\n \\\"---------- Ice and Fire ------------\\\" revWords println\\n \\\" \\\" revWords println\\n \\\"fire, in end will world the say Some\\\" revWords println\\n \\\"ice. in say Some \\\" revWords println\\n \\\"desire of tasted I've what From \\\" revWords println\\n \\\"fire. favor who those with hold I \\\" revWords println\\n \\\" \\\" revWords println\\n \\\"... elided paragraph last ... \\\" revWords println\\n \\\" \\\" revWords println\\n \\\"Frost Robert -----------------------\\\" revWords println ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"program Reverse_words(Output);\\n{$H+}\\n\\nconst\\n nl = chr(10); // Linefeed\\n sp = chr(32); // Space\\n TXT =\\n '---------- Ice and Fire -----------'+nl+\\n nl+\\n 'fire, in end will world the say Some'+nl+\\n 'ice. in say Some'+nl+\\n 'desire of tasted I''ve what From'+nl+\\n 'fire. favor who those with hold I'+nl+\\n nl+\\n '... elided paragraph last ...'+nl+\\n nl+\\n 'Frost Robert -----------------------'+nl;\\n\\nvar\\n I : integer;\\n ew, lw : ansistring;\\n c : char;\\n\\nfunction addW : ansistring;\\nvar r : ansistring = '';\\nbegin\\n r := ew + sp + lw;\\n ew := '';\\n addW := r\\nend;\\n\\nbegin\\n ew := '';\\n lw := '';\\n\\n for I := 1 to strlen(TXT) do\\n begin\\n c := TXT[I];\\n case c of\\n sp : lw := addW;\\n nl : begin writeln(addW); lw := '' end;\\n else ew := ew + c\\n end;\\n end;\\n readln;\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"program reverse_words;\\n{$mode objfpc}{$h+}\\nuses\\n SysUtils;\\n\\nfunction Reverse(a: TStringArray): TStringArray;\\nvar\\n I, J: SizeInt;\\n t: Pointer;\\nbegin\\n I := 0;\\n J := High(a);\\n while I < J do begin\\n t := Pointer(a[I]);\\n Pointer(a[I]) := Pointer(a[J]);\\n Pointer(a[J]) := t;\\n Inc(I);\\n Dec(J);\\n end;\\n Result := a;\\nend;\\n\\nconst\\n Input =\\n '---------- Ice and Fire -----------' + LineEnding +\\n '' + LineEnding +\\n 'fire, in end will world the say Some' + LineEnding +\\n 'ice. in say Some' + LineEnding +\\n 'desire of tasted I''ve what From' + LineEnding +\\n 'fire. favor who those with hold I' + LineEnding +\\n '' + LineEnding +\\n '... elided paragraph last ...' + LineEnding +\\n '' + LineEnding +\\n 'Frost Robert -----------------------' + LineEnding;\\nvar\\n Line: string;\\n\\nbegin\\n for Line in Input.Split([LineEnding], TStringSplitOptions.ExcludeLastEmpty) do\\n WriteLn(string.Join(' ', Reverse(Line.Split([' ']))));\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"print join(\\\" \\\", reverse split), \\\"\\\\n\\\" for <DATA>;\\n__DATA__\\n---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n ---------- Ice and Fire ------------\\n\\n fire, in end will world the say Some\\n ice. in say Some\\n desire of tasted I've what From\\n fire. favor who those with hold I\\n\\n ... elided paragraph last ...\\n\\n Frost Robert -----------------------\\n \\\"\\\"\\\"</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">lines</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">'\\\\n'</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lines</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">lines</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">reverse</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lines</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lines</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\n\\\"---------- Ice and Fire ------------\\\"\\n\\\"\\\"\\n\\\"fire, in end will world the say Some\\\"\\n\\\"ice. in say Some\\\"\\n\\\"desire of tasted I've what From\\\"\\n\\\"fire. favor who those with hold I\\\"\\n\\\"\\\"\\n\\\"... elided paragraph last ...\\\"\\n\\\"\\\"\\n\\\"Frost Robert -----------------------\\\"\\n\\nstklen tolist\\nlen for var i\\n i get split reverse i set\\nendfor\\nlen for\\n get len dup if\\n for get print \\\" \\\" print endfor\\n else drop endif\\n drop nl\\nendfor\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"<?php\\n\\n function strInv ($string) {\\n\\n \\t$str_inv = '' ;\\n\\n\\t for ($i=0,$s=count($string);$i<$s;$i++){\\n\\t \\t$str_inv .= implode(' ',array_reverse(explode(' ',$string[$i])));\\n\\t \\t$str_inv .= '<br>';\\n\\t }\\n\\n \\treturn $str_inv;\\n\\n }\\n\\n $string[] = \\\"---------- Ice and Fire ------------\\\";\\n $string[] = \\\"\\\";\\n $string[] = \\\"fire, in end will world the say Some\\\";\\n $string[] = \\\"ice. in say Some\\\";\\n $string[] = \\\"desire of tasted I've what From\\\";\\n $string[] = \\\"fire. favor who those with hold I\\\";\\n $string[] = \\\"\\\";\\n $string[] = \\\"... elided paragraph last ...\\\";\\n $string[] = \\\"\\\";\\n $string[] = \\\"Frost Robert ----------------------- \\\";\\n\\n\\necho strInv($string);\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"------------ Fire and Ice ----------\\n\\nSome say the world will end in fire,\\nSome say in ice.\\nFrom what I've tasted of desire\\nI hold with those who favor fire.\\n\\n... last paragraph elided ...\\n\\n----------------------- Robert Frost\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(in \\\"FireIce.txt\\\"\\n (until (eof)\\n (prinl (glue \\\" \\\" (flip (split (line) \\\" \\\"))))))\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"string story = #\\\"---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\\";\\n\\nforeach(story/\\\"\\\\n\\\", string line)\\n write(\\\"%s\\\\n\\\", reverse(line/\\\" \\\")*\\\" \\\");\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"rev: procedure options (main); /* 5 May 2014 */\\n declare (s, reverse) character (50) varying;\\n declare (i, j) fixed binary;\\n declare in file;\\n\\n open file (in) title ('/REV-WRD.DAT,type(text),recsize(5> Nil) {\\n for(j := words->Size() - 1; j > -1; j-=1;) {\\n IO.Console->Print(words[j])->Print(\\\" \\\");\\n };\\n };\\n IO.Console->PrintLine();\\n lines->Next();\\n };\\n }\\n}0)');\\n\\n do j = 1 to 10;\\n get file (in) edit (s) (L);\\n put skip list (trim(s));\\n\\n reverse = '';\\n\\n do while (length(s) > 0);\\n s = trim(s);\\n i = index(s, ' ');\\n if i = 0 then\\n if s ^= '' then i = length(s)+1;\\n if i > 0 then reverse = substr(s, 1, i-1) || ' ' || reverse;\\n if length(s) = i then s = ''; else s = substr(s, i);\\n end;\\n put edit ('---> ', reverse) (col(40), 2 A);\\n end;\\nend rev;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"Function Reverse-Words($lines) {\\n $lines | foreach {\\n $array = $PSItem.Split(' ')\\n $array[($array.Count-1)..0] -join ' '\\n }\\n}\\n\\n$lines =\\n\\\"---------- Ice and Fire ------------\\\",\\n\\\"\\\",\\n\\\"fire, in end will world the say Some\\\",\\n\\\"ice. in say Some\\\",\\n\\\"desire of tasted I've what From\\\",\\n\\\"fire. favor who those with hold I\\\",\\n\\\"\\\",\\n\\\"... elided paragraph last ...\\\",\\n\\\"\\\",\\n\\\"Frost Robert -----------------------\\\"\\n\\nReverse-Words($lines)\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"a$ = \\\"---------- Ice and Fire ------------\\\" +#CRLF$+\\n \\\" \\\" +#CRLF$+\\n \\\"fire, in end will world the say Some\\\" +#CRLF$+\\n \\\"ice. in say Some \\\" +#CRLF$+\\n \\\"desire of tasted I've what From \\\" +#CRLF$+\\n \\\"fire. favor who those with hold I \\\" +#CRLF$+\\n \\\" \\\" +#CRLF$+\\n \\\"... elided paragraph last ... \\\" +#CRLF$+\\n \\\" \\\" +#CRLF$+\\n \\\"Frost Robert -----------------------\\\" +#CRLF$\\na$ = \\\"Hey you, Bub! \\\" +#CRLF$+#CRLF$+ a$\\n\\nOpenConsole()\\nFor p1=1 To CountString(a$,#CRLF$)\\n b$=StringField(a$,p1,#CRLF$) : c$=\\\"\\\"\\n For p2=1 To CountString(b$,Chr(32))+1\\n c$=StringField(b$,p2,Chr(32))+Space(1)+c$\\n Next\\n PrintN(LSet(b$,36,Chr(32))+\\\" ---> \\\"+Trim(c$))\\nNext\\nInput()\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \" text = '''\\\\\\n---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------'''\\n\\nfor line in text.split('\\\\n'): print(' '.join(line.split()[::-1]))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"------------ Fire and Ice ----------\\n\\nSome say the world will end in fire,\\nSome say in ice.\\nFrom what I've tasted of desire\\nI hold with those who favor fire.\\n\\n... last paragraph elided ...\\n\\n----------------------- Robert Frost\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" ' [ $ \\\" ---------- Ice and Fire ------------ \\\"\\n $ \\\"\\\"\\n $ \\\" fire, in end will world the say Some \\\"\\n $ \\\" ice. in say Some \\\"\\n $ \\\" desire of tasted I've what From \\\"\\n $ \\\" fire. favor who those with hold I \\\"\\n $ \\\"\\\"\\n $ \\\" ... elided paragraph last ... \\\"\\n $ \\\"\\\"\\n $ \\\" Frost Robert ----------------------- \\\" ]\\n\\n witheach\\n [ do nest$ reverse\\n witheach\\n [ echo$ sp ]\\n cr ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"whack <- function(s) {\\n paste( rev( unlist(strsplit(s, \\\" \\\"))), collapse=' ' ) }\\n\\npoem <- unlist( strsplit(\\n'------------ Eldorado ----------\\n\\n... here omitted lines ...\\n\\nMountains the \\\"Over\\nMoon, the Of\\nShadow, the of Valley the Down\\nride,\\\" boldly Ride,\\nreplied,--- shade The\\nEldorado!\\\" for seek you \\\"If\\n\\nPoe Edgar -----------------------', \\\"\\\\n\\\"))\\n\\nfor (line in poem) cat( whack(line), \\\"\\\\n\\\" )\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"> `{` <- function(s) rev(unlist(strsplit(s, \\\" \\\")))\\n> {\\\"one two three four five\\\"}\\n[1] \\\"five\\\" \\\"four\\\" \\\"three\\\" \\\"two\\\" \\\"one\\\"\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket/base\\n\\n(require racket/string)\\n\\n(define (split-reverse str)\\n (string-join\\n (reverse\\n (string-split str))))\\n\\n(define poem\\n \\\"---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\\")\\n\\n\\n(let ([poem-port (open-input-string poem)])\\n (let loop ([l (read-line poem-port)])\\n (unless (eof-object? l)\\n (begin (displayln (split-reverse l))\\n (loop (read-line poem-port))))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#lang sweet-exp racket/base\\nrequire racket/string\\n\\ndefine split-reverse(str)\\n string-join $ reverse $ string-split str\\n\\ndefine poem\\n \\\"---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\\"\\n\\nlet\\n \\\\\\\\\\n poem-port $ open-input-string poem\\n let loop\\n \\\\\\\\\\n l $ read-line poem-port\\n unless eof-object?(l)\\n begin\\n displayln split-reverse(l)\\n loop read-line(poem-port)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"say ~.words.reverse for lines\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"Red []\\nforeach line\\nsplit\\n{---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------} newline [\\n print reverse split line \\\" \\\"\\n]\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"/*REXX program reverses the order of tokens in a string (but not the letters).*/\\n@.=; @.1 = \\\"---------- Ice and Fire ------------\\\"\\n @.2 = ' '\\n @.3 = \\\"fire, in end will world the say Some\\\"\\n @.4 = \\\"ice. in say Some\\\"\\n @.5 = \\\"desire of tasted I've what From\\\"\\n @.6 = \\\"fire. favor who those with hold I\\\"\\n @.7 = ' '\\n @.8 = \\\"... elided paragraph last ...\\\"\\n @.9 = ' '\\n @.10 = \\\"Frost Robert -----------------------\\\"\\n\\n do j=1 while @.j\\\\=='' /*process each of the 10 lines of poem.*/\\n $= /*nullify the $ string (the new line)*/\\n do k=1 for words(@.j) /*process each word in a @.j string.*/\\n $=word(@.j,k) $ /*prepend a word to the new line ($). */\\n end /*k*/ /* [↑] we could do this another way. */\\n\\n say $ /*display the newly constructed line. */\\n end /*j*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program reverses the order of tokens in a string (but not the letters).*/\\n@.=; @.1 = \\\"---------- Ice and Fire ------------\\\"\\n @.2 = ' '\\n @.3 = \\\"fire, in end will world the say Some\\\"\\n @.4 = \\\"ice. in say Some\\\"\\n @.5 = \\\"desire of tasted I've what From\\\"\\n @.6 = \\\"fire. favor who those with hold I\\\"\\n @.7 = ' '\\n @.8 = \\\"... elided paragraph last ...\\\"\\n @.9 = ' '\\n @.10 = \\\"Frost Robert -----------------------\\\"\\n\\n do j=1 while @.j\\\\=='' /*process each of the 10 lines of poem.*/\\n $= /*nullify the $ string (the new line)*/\\n do k=words(@.j) to 1 by -1 /*process each word in a @.j string.*/\\n $=$ word(@.j,k) /*append a word to the new line ($). */\\n end /*k*/ /* [↑] process last word to first word*/\\n\\n say $ /*display the newly constructed line. */\\n end /*j*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"aList = str2list(\\\"\\n---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\n\\\")\\naList = str2list(cStr)\\nfor x in aList\\n x2 = substr(x,\\\" \\\",nl) alist2 = str2list(x2) aList2 = reverse(aList2)\\n for y in aList2 see y + \\\" \\\" next see nl\\nnext\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"------------ Fire and Ice ----------\\n\\nSome say the world will end in fire,\\nSome say in ice.\\nFrom what I've tasted of desire\\nI hold with those who favor fire.\\n\\n... last paragraph elided ...\\n----------------------- Robert Frost\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"puts <<EOS\\n---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\nEOS\\n .each_line.map {|line| line.split.reverse.join(' ')}\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"for i = 1 to 10\\n read string$\\n j = 1\\n r$ = \\\"\\\"\\n while word$(string$,j) <> \\\"\\\"\\n r$ = word$(string$,j) + \\\" \\\" + r$\\n j = j + 1\\n WEND\\n print r$\\nnext\\nend\\n\\ndata \\\"---------- Ice and Fire ------------\\\"\\ndata \\\"\\\"\\ndata \\\"fire, in end will world the say Some\\\"\\ndata \\\"ice. in say Some\\\"\\ndata \\\"desire of tasted I've what From\\\"\\ndata \\\"fire. favor who those with hold I\\\"\\ndata \\\"\\\"\\ndata \\\"... elided paragraph last ...\\\"\\ndata \\\"\\\"\\ndata \\\"Frost Robert -----------------------\\\"\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"const TEXT: &'static str =\\n\\\"---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\\";\\n\\nfn main() {\\n println!(\\\"{}\\\",\\n TEXT.lines() // Returns iterator over lines\\n .map(|line| // Applies closure to each item in iterator (for each line)\\n line.split_whitespace() // Returns iterator of words\\n .rev() // Reverses iterator of words\\n .collect::<Vec<_>>() // Collects words into Vec<&str>\\n .join(\\\" \\\")) // Convert vector of words back into line\\n .collect::<Vec<_>>() // Collect lines into Vec<String>\\n .join(\\\"\\\\n\\\")); // Concatenate lines into String\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"variable ln, in =\\n [\\\"---------- Ice and Fire ------------\\\",\\n \\\"fire, in end will world the say Some\\\",\\n \\\"ice. in say Some\\\",\\n \\\"desire of tasted I've what From\\\",\\n \\\"fire. favor who those with hold I\\\",\\n \\\"\\\",\\n \\\"... elided paragraph last ...\\\",\\n \\\"\\\",\\n \\\"Frost Robert -----------------------\\\"];\\n\\nforeach ln (in) {\\n ln = strtok(ln, \\\" \\\\t\\\");\\n array_reverse(ln);\\n () = printf(\\\"%s\\\\n\\\", strjoin(ln, \\\" \\\"));\\n}\\n\",\n \"language\": \"S-lang\"\n },\n {\n \"code\": \"object ReverseWords extends App {\\n\\n \\\"\\\"\\\"| ---------- Ice and Fire ------------\\n |\\n | fire, in end will world the say Some\\n | ice. in say Some\\n | desire of tasted I've what From\\n | fire. favor who those with hold I\\n |\\n | ... elided paragraph last ...\\n |\\n | Frost Robert ----------------------- \\\"\\\"\\\"\\n .stripMargin.lines.toList.map{_.split(\\\" \\\")}.map{_.reverse}\\n .map(_.mkString(\\\" \\\"))\\n .foreach{println}\\n\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(for-each\\n (lambda (s) (print (string-join (reverse (string-split s #/ +/)))))\\n (string-split\\n \\\"---------- Ice and Fire ------------\\n\\n fire, in end will world the say Some\\n ice. in say Some\\n desire of tasted I've what From\\n fire. favor who those with hold I\\n\\n ... elided paragraph last ...\\n\\n Frost Robert -----------------------\\\"\\n #/[ \\\\r]*\\\\n[ \\\\r]*/))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"#!/usr/bin/sed -f\\n\\nG\\n:loop\\ns/^[[:space:]]*\\\\([^[:space:]][^[:space:]]*\\\\)\\\\(.*\\\\n\\\\)/\\\\2 \\\\1/\\nt loop\\ns/^[[:space:]]*//\\n\",\n \"language\": \"Sed\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst array string: lines is [] (\\n \\\"---------- Ice and Fire ------------\\\",\\n \\\"\\\",\\n \\\"fire, in end will world the say Some\\\",\\n \\\"ice. in say Some\\\",\\n \\\"desire of tasted I've what From\\\",\\n \\\"fire. favor who those with hold I\\\",\\n \\\"\\\",\\n \\\"... elided paragraph last ...\\\",\\n \\\"\\\",\\n \\\"Frost Robert -----------------------\\\");\\n\\nconst proc: main is func\\n local\\n var string: line is \\\"\\\";\\n var array string: words is 0 times \\\"\\\";\\n var integer: index is 0;\\n begin\\n for line range lines do\\n words := split(line, ' ');\\n for index range length(words) downto 1 do\\n write(words[index] <& \\\" \\\");\\n end for;\\n writeln;\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"set poem to {{\\n---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\n}}\\n\\nrepeat with each line in poem\\n\\tput (each word of it) reversed joined by space\\nend repeat\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"DATA.each{|line| line.words.reverse.join(\\\" \\\").say};\\n\\n__DATA__\\n---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"poem := '---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I''ve what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------'.\\n\\n(poem lines collect: [ :line | ((line splitOn: ' ') reverse) joinUsing: ' ' ]) joinUsing: (String cr).\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"let lines = split(\\\"---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\\", \\\"\\\\n\\\");\\n\\nforeach(lines, function(idx, line) {\\n\\tlet words = split(line, \\\" \\\");\\n\\tlet reverseWords = map(words, function(idx) { return words[sizeof words - idx - 1]; });\\n\\tforeach(reverseWords, function(idx, word) {\\n\\t\\tprintf(\\\"%s \\\", word);\\n\\t});\\n\\n\\tprint();\\n});\\n\",\n \"language\": \"Sparkling\"\n },\n {\n \"code\": \"val lines = [\\n \\\" ---------- Ice and Fire ------------ \\\",\\n \\\" \\\",\\n \\\" fire, in end will world the say Some \\\",\\n \\\" ice. in say Some \\\",\\n \\\" desire of tasted I've what From \\\",\\n \\\" fire. favor who those with hold I \\\",\\n \\\" \\\",\\n \\\" ... elided paragraph last ... \\\",\\n \\\" \\\",\\n \\\" Frost Robert ----------------------- \\\"\\n]\\n\\nval revWords = String.concatWith \\\" \\\" o rev o String.tokens Char.isSpace\\n\\nval () = app (fn line => print (revWords line ^ \\\"\\\\n\\\")) lines\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"import Foundation\\n\\n// convenience extension for better clarity\\nextension String {\\n var lines: [String] {\\n get {\\n return self.componentsSeparatedByCharactersInSet(NSCharacterSet.newlineCharacterSet())\\n }\\n }\\n var words: [String] {\\n get {\\n return self.componentsSeparatedByCharactersInSet(NSCharacterSet.whitespaceCharacterSet())\\n }\\n }\\n}\\n\\nlet input = \\\"---------- Ice and Fire ------------\\\\n\\\\nfire, in end will world the say Some\\\\nice. in say Some\\\\ndesire of tasted I've what From\\\\nfire. favor who those with hold I\\\\n\\\\n... elided paragraph last ...\\\\n\\\\nFrost Robert -----------------------\\\\n\\\"\\n\\nlet output = input.lines.map { $0.words.reverse().joinWithSeparator(\\\" \\\") }.joinWithSeparator(\\\"\\\\n\\\")\\n\\nprint(output)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"def input: ['---------- Ice and Fire ------------',\\n '',\\n 'fire, in end will world the say Some',\\n 'ice. in say Some',\\n 'desire of tasted I''ve what From',\\n 'fire. favor who those with hold I',\\n '',\\n '... elided paragraph last ...',\\n '',\\n 'Frost Robert -----------------------']\\n;\\n\\ncomposer words\\n [ <word>* ]\\n rule word: <~WS> <WS>?\\nend words\\n\\n$input... -> '$ -> words -> $(last..first:-1)...;\\n' -> !OUT::write\\n\",\n \"language\": \"Tailspin\"\n },\n {\n \"code\": \"set lines {\\n \\\"---------- Ice and Fire ------------\\\"\\n \\\"\\\"\\n \\\"fire, in end will world the say Some\\\"\\n \\\"ice. in say Some\\\"\\n \\\"desire of tasted I've what From\\\"\\n \\\"fire. favor who those with hold I\\\"\\n \\\"\\\"\\n \\\"... elided paragraph last ...\\\"\\n \\\"\\\"\\n \\\"Frost Robert -----------------------\\\"\\n}\\nforeach line $lines {\\n puts [join [lreverse [regexp -all -inline {\\\\S+} $line]]]\\n # This would also work for data this simple:\\n ### puts [lreverse $line]\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"puts [join [lmap line $lines {lreverse $line}] \\\"\\\\n\\\"]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"txr reverse.txr verse.txt\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"@(collect)\\n@ (some)\\n@(coll)@{words /[^ ]+/}@(end)\\n@ (or)\\n@(bind words nil)\\n@ (end)\\n@(end)\\n@(set words @(mapcar (fun nreverse) words))\\n@(output)\\n@ (repeat)\\n@(rep)@words @(last)@words@(end)\\n@ (end)\\n@(end)\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"@(end)\\n[EOF]\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"@(end)[EOF]\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"while read -a words; do\\n for ((i=${#words[@]}-1; i>=0; i--)); do\\n printf \\\"%s \\\" \\\"${words[i]}\\\"\\n done\\n echo\\ndone << END\\n---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\nEND\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"read -a\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"read -A\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"fn main() {\\n mut n := [\\n \\\"---------- Ice and Fire ------------\\\",\\n \\\" \\\",\\n \\\"fire, in end will world the say Some\\\",\\n \\\"ice. in say Some \\\",\\n \\\"desire of tasted I've what From \\\",\\n \\\"fire. favor who those with hold I \\\",\\n \\\" \\\",\\n \\\"... elided paragraph last ... \\\",\\n \\\" \\\",\\n \\\"Frost Robert -----------------------\\\",\\n ]\\n for i, s in n {\\n mut t := s.fields() // tokenize\\n // reverse\\n last := t.len - 1\\n for j, k in t[..t.len/2] {\\n t[j], t[last-j] = t[last-j], k\\n }\\n n[i] = t.join(\\\" \\\")\\n }\\n // display result\\n for t in n {\\n println(t)\\n }\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"mut n := [\\n \\\"---------- Ice and Fire ------------\\\",\\n \\\" \\\",\\n \\\"fire, in end will world the say Some\\\",\\n \\\"ice. in say Some \\\",\\n \\\"desire of tasted I've what From \\\",\\n \\\"fire. favor who those with hold I \\\",\\n \\\" \\\",\\n \\\"... elided paragraph last ... \\\",\\n \\\" \\\",\\n \\\"Frost Robert -----------------------\\\",\\n]\\n\\nprintln(\\n n.map(\\n it.fields().reverse().join(' ').trim_space()\\n ).join('\\\\n')\\n)\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Option Explicit\\n\\nSub Main()\\nDim Lines(9) As String, i&\\n 'Input\\n Lines(0) = \\\"------------- Ice And Fire -------------\\\"\\n Lines(1) = \\\"\\\"\\n Lines(2) = \\\"fire, in end will world the say Some\\\"\\n Lines(3) = \\\"ice. in say Some\\\"\\n Lines(4) = \\\"desire of tasted I've what From\\\"\\n Lines(5) = \\\"fire. favor who those with hold I\\\"\\n Lines(6) = \\\"\\\"\\n Lines(7) = \\\"... elided paragraph last ...\\\"\\n Lines(8) = \\\"\\\"\\n Lines(9) = \\\"Frost Robert -----------------------\\\"\\n 'Output\\n For i = 0 To 9\\n Debug.Print ReverseLine(Lines(i), \\\" \\\")\\n Next\\nEnd Sub\\n\\nPrivate Function ReverseLine(Line As String, Optional Separat As String) As String\\nDim T, R, i&, j&, deb&, fin&\\n If Len(Line) = 0 Then\\n ReverseLine = vbNullString\\n Else\\n If Separat = \\\"\\\" Then Separat = \\\" \\\"\\n T = Split(Line, Separat)\\n ReDim R(UBound(T)): j = LBound(T)\\n deb = UBound(T): fin = deb / 2\\n For i = deb To fin Step -1\\n R(j) = T(i)\\n R(i) = T(j)\\n j = j + 1\\n Next i\\n ReverseLine = Join(R, Separat)\\n End If\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Option Explicit\\n\\nDim objFSO, objInFile, objOutFile\\nDim srcDir, line\\n\\nSet objFSO = CreateObject(\\\"Scripting.FileSystemObject\\\")\\n\\nsrcDir = objFSO.GetParentFolderName(WScript.ScriptFullName) & \\\"\\\\\\\"\\n\\nSet objInFile = objFSO.OpenTextFile(srcDir & \\\"In.txt\\\",1,False,0)\\n\\nSet objOutFile = objFSO.OpenTextFile(srcDir & \\\"Out.txt\\\",2,True,0)\\n\\nDo Until objInFile.AtEndOfStream\\n\\tline = objInFile.ReadLine\\n\\tIf line = \\\"\\\" Then\\n\\t\\tobjOutFile.WriteLine \\\"\\\"\\n\\tElse\\n\\t\\tobjOutFile.WriteLine Reverse_String(line)\\n\\tEnd If\\nLoop\\n\\nFunction Reverse_String(s)\\n\\tDim arr, i\\n\\tarr = Split(s,\\\" \\\")\\n\\tFor i = UBound(arr) To LBound(arr) Step -1\\n\\t\\tIf arr(i) <> \\\"\\\" Then\\n\\t\\t\\tIf i = UBound(arr) Then\\n\\t\\t\\t\\tReverse_String = Reverse_String & arr(i)\\n\\t\\t\\tElse\\n\\t\\t\\t\\tReverse_String = Reverse_String & \\\" \\\" & arr(i)\\n\\t\\t\\tEnd If\\n\\t\\tEnd If\\n\\tNext\\nEnd Function\\n\\nobjInFile.Close\\nobjOutFile.Close\\nSet objFSO = Nothing\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"var lines = [\\n \\\"---------- Ice and Fire ------------\\\",\\n \\\" \\\",\\n \\\"fire, in end will world the say Some\\\",\\n \\\"ice. in say Some \\\",\\n \\\"desire of tasted I've what From \\\",\\n \\\"fire. favor who those with hold I \\\",\\n \\\" \\\",\\n \\\"... elided paragraph last ... \\\",\\n \\\" \\\",\\n \\\"Frost Robert -----------------------\\\"\\n]\\n\\nfor (line in lines) {\\n var tokens = line.trim().split(\\\" \\\")\\n tokens = tokens[-1..0]\\n System.print(tokens.join(\\\" \\\"))\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func revWords(x:string=\\\"\\\"){\\n\\t(x==\\\"\\\")&=>send x+\\\"<br>\\\";\\n\\tset sp = x::split(\\\" \\\");\\n\\tsend sp::reverse()::join(\\\" \\\");\\n}\\n\\nset lines:array=[\\n\\t\\\"---------- Ice and Fire ------------\\\",\\n\\t\\\"\\\",\\n\\t\\\"fire, in end will world the say Some\\\",\\n\\t\\\"ice. in say Some\\\",\\n\\t\\\"desire of tasted I've what From\\\",\\n\\t\\\"fire. favor who those with hold I\\\",\\n\\t\\\"\\\",\\n\\t\\\"... elided paragraph last ...\\\",\\n\\t\\\"\\\",\\n\\t\\\"Frost Robert -----------------------\\\",\\n];\\n\\nforeach(v of lines){\\n\\tlog(revWords(v));\\n}\\n\",\n \"language\": \"XBS\"\n },\n {\n \"code\": \"string 0;\\ndef LF=$0A, CR=$0D;\\n\\nproc Reverse(Str, Len); \\\\Reverse order of chars in string\\nchar Str; int Len;\\nint I, J, T;\\n[I:= 0;\\nJ:= Len-1;\\nwhile I < J do\\n [T:= Str(I); Str(I):= Str(J); Str(J):= T;\\n I:= I+1; J:= J-1;\\n ];\\n];\\n\\nchar Str;\\nint I, LineBase, WordBase;\\n[Str:=\\n\\\"---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\\";\\nI:= 0;\\nrepeat LineBase:= I;\\n loop [WordBase:= I;\\n repeat I:= I+1 until Str(I) <= $20;\\n Reverse(@Str(WordBase), I-WordBase);\\n if Str(I)=CR or Str(I)=LF or Str(I)=0 then quit;\\n I:= I+1; \\\\skip space\\n ];\\n Reverse(@Str(LineBase), I-LineBase);\\n while Str(I)=CR or Str(I)=LF do I:= I+1;\\nuntil Str(I) = 0;\\nText(0, Str);\\nCrLf(0);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"data \\\" ---------- Ice and Fire ------------ \\\"\\ndata \\\" \\\"\\ndata \\\" fire, in end will world the say Some \\\"\\ndata \\\" ice. in say Some \\\"\\ndata \\\" desire of tasted I've what From \\\"\\ndata \\\" fire. favor who those with hold I \\\"\\ndata \\\" \\\"\\ndata \\\" ... elided paragraph last ... \\\"\\ndata \\\" \\\"\\ndata \\\" Frost Robert ----------------------- \\\"\\ndata \\\"\\\"\\n\\ndim w$(1)\\n\\ndo\\n read l$\\n if l$ <> \\\"\\\" then\\n n = token(l$, w$(), \\\" \\\")\\n for i = n to 1 step -1\\n print w$(i), \\\" \\\";\\n next\\n print\\n else\\n break\\n end if\\nloop\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"text:=Data(0,String,\\n#<<<\\n\\\"---------- Ice and Fire ------------\\n\\nfire, in end will world the say Some\\nice. in say Some\\ndesire of tasted I've what From\\nfire. favor who those with hold I\\n\\n... elided paragraph last ...\\n\\nFrost Robert -----------------------\\\");\\n#<<<\\n\\ntext.pump(11,Data,fcn(s){ // process stripped lines\\n s.split(\\\" \\\").reverse().concat(\\\" \\\") + \\\"\\\\n\\\" })\\n .text.print();\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Reverse-words-in-a-string"}}},{"rowIdx":1585,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Rhonda_numbers\n","language":"00-META"},{"code":"A positive integer '''''n''''' is said to be a Rhonda number to base '''''b''''' if the product of the base '''''b''''' digits of '''''n''''' is equal to '''''b''''' times the sum of '''''n''''''s prime factors.\n\n\n''These numbers were named by Kevin Brown after an acquaintance of his whose residence number was 25662, a member of the base 10 numbers with this property.''\n\n\n'''25662''' is a Rhonda number to base-'''10'''. The prime factorization is '''2 × 3 × 7 × 13 × 47'''; the product of its base-'''10''' digits is equal to the base times the sum of its prime factors:\n\n<span style=font-size:150%;font-weight:bold;padding-left:3em;>2 × 5 × 6 × 6 × 2 = 720 = 10 × (2 + 3 + 7 + 13 + 47)</span>\n\nRhonda numbers only exist in bases that are not a prime.\n\n''Rhonda numbers to base 10 '''always''' contain at least 1 digit 5 and '''always''' contain at least 1 even digit.''\n\n\n;Task\n\n* For the non-prime bases '''''b''''' from '''2''' through '''16''' , find and display here, on this page, at least the first '''10''' '''Rhonda numbers''' to base '''''b'''''. Display the found numbers at least in base '''10'''.\n\n\n;Stretch\n\n* Extend out to base '''36'''.\n\n\n;See also\n\n;* [https://mathworld.wolfram.com/RhondaNumber.html Wolfram Mathworld - Rhonda numbers]\n;* [https://www.numbersaplenty.com/set/Rhonda_number Numbers Aplenty - Rhonda numbers]\n;* [[oeis:A100968|OEIS:A100968 - Integers n that are Rhonda numbers to base 4]]\n;* [[oeis:A100969|OEIS:A100969 - Integers n that are Rhonda numbers to base 6]]\n;* [[oeis:A100970|OEIS:A100970 - Integers n that are Rhonda numbers to base 8]]\n;* [[oeis:A100973|OEIS:A100973 - Integers n that are Rhonda numbers to base 9]]\n;* [[oeis:A099542|OEIS:A099542 - Rhonda numbers to base 10]]\n;* [[oeis:A100971|OEIS:A100971 - Integers n that are Rhonda numbers to base 12]]\n;* [[oeis:A100972|OEIS:A100972 - Integers n that are Rhonda numbers to base 14]]\n;* [[oeis:A100974|OEIS:A100974 - Integers n that are Rhonda numbers to base 15]]\n;* [[oeis:A100975|OEIS:A100975 - Integers n that are Rhonda numbers to base 16]]\n\n;* [[oeis:A255735|OEIS:A255735 - Integers n that are Rhonda numbers to base 18]]\n;* [[oeis:A255732|OEIS:A255732 - Rhonda numbers in vigesimal number system]] (base 20)\n;* [[oeis:A255736|OEIS:A255736 - Integers that are Rhonda numbers to base 30]]\n\n;* [[Smith numbers|Related Task: Smith numbers]]\n<br>\n\n\n\n","language":"00-TASK"},{"code":"BEGIN # find some Rhonda numbers: numbers n in base b such that the product #\n # of the digits of n is b * the sum of the prime factors of n #\n\n # returns the sum of the prime factors of n #\n PROC factor sum = ( INT n )INT:\n BEGIN\n INT result := 0;\n INT v := ABS n;\n WHILE v > 1 AND v MOD 2 = 0 DO\n result +:= 2;\n v OVERAB 2\n OD;\n FOR f FROM 3 BY 2 WHILE v > 1 DO\n WHILE v > 1 AND v MOD f = 0 DO\n result +:= f;\n v OVERAB f\n OD\n OD;\n result\n END # factor sum # ;\n # returns the digit product of n in the specified base #\n PROC digit product = ( INT n, base )INT:\n IF n = 0 THEN 0\n ELSE\n INT result := 1;\n INT v := ABS n;\n WHILE v > 0 DO\n result *:= v MOD base;\n v OVERAB base\n OD;\n result\n FI # digit product # ;\n # returns TRUE if n is a Rhonda number in the specified base, #\n # FALSE otherwise #\n PROC is rhonda = ( INT n, base )BOOL: base * factor sum( n ) = digit product( n, base );\n\n # returns TRUE if n is prime, FALSE otherwise #\n PROC is prime = ( INT n )BOOL:\n IF n < 3 THEN n = 2\n ELIF n MOD 3 = 0 THEN n = 3\n ELIF NOT ODD n THEN FALSE\n ELSE\n INT f := 5;\n INT f2 := 25;\n INT to next := 24;\n BOOL is a prime := TRUE;\n WHILE f2 <= n AND is a prime DO\n is a prime := n MOD f /= 0;\n f +:= 2;\n f2 +:= to next;\n to next +:= 8\n OD;\n is a prime\n FI # is prime # ;\n # returns a string representation of n in the specified base #\n PROC to base string = ( INT n, base )STRING:\n IF n = 0 THEN \"0\"\n ELSE\n INT under 10 = ABS \"0\";\n INT over 9 = ABS \"a\" - 10;\n STRING result := \"\";\n INT v := ABS n;\n WHILE v > 0 DO\n INT d = v MOD base;\n REPR ( d + IF d < 10 THEN under 10 ELSE over 9 FI ) +=: result;\n v OVERAB base\n OD;\n result\n FI # to base string # ;\n # find the first few Rhonda numbers in non-prime bases 2 .. max base #\n INT max rhonda = 10;\n INT max base = 16;\n FOR base FROM 2 TO max base DO\n IF NOT is prime( base ) THEN\n print( ( \"The first \", whole( max rhonda, 0 )\n , \" Rhonda numbers in base \", whole( base, 0 )\n , \":\", newline\n )\n );\n INT r count := 0;\n [ 1 : max rhonda ]INT rhonda;\n FOR n WHILE r count < max rhonda DO\n IF is rhonda( n, base ) THEN\n rhonda[ r count +:= 1 ] := n\n FI\n OD;\n print( ( \" in base 10:\" ) );\n FOR i TO max rhonda DO print( ( \" \", whole( rhonda[ i ], 0 ) ) ) OD;\n print( ( newline ) );\n IF base /= 10 THEN\n print( ( \" in base \", whole( base, -2 ), \":\" ) );\n FOR i TO max rhonda DO print( ( \" \", to base string( rhonda[ i ], base ) ) ) OD;\n print( ( newline ) )\n FI\n FI\n OD\nEND\n","language":"ALGOL-68"},{"code":"digs: (@`0`..`9`) ++ @`A`..`Z`\ntoBase: function [n,base][\n join map digits.base:base n 'x -> digs\\[x]\n]\n\nrhonda?: function [n,base][\n (base * sum factors.prime n) = product digits.base:base n\n]\n\nnonPrime: select 2..16 'x -> not? prime? x\n\nloop nonPrime 'npbase [\n print \"The first 10 Rhonda numbers, base-\" ++ (to :string npbase) ++ \":\"\n rhondas: select.first:10 1..∞ 'z -> rhonda? z npbase\n print [\"In base 10 ->\" join.with:\", \" to [:string] rhondas]\n print [\"In base\" npbase \"->\" join.with:\", \" to [:string] map rhondas 'w -> toBase w npbase]\n print \"\"\n]\n","language":"Arturo"},{"code":"#include <algorithm>\n#include <cassert>\n#include <iomanip>\n#include <iostream>\n\nint digit_product(int base, int n) {\n int product = 1;\n for (; n != 0; n /= base)\n product *= n % base;\n return product;\n}\n\nint prime_factor_sum(int n) {\n int sum = 0;\n for (; (n & 1) == 0; n >>= 1)\n sum += 2;\n for (int p = 3; p * p <= n; p += 2)\n for (; n % p == 0; n /= p)\n sum += p;\n if (n > 1)\n sum += n;\n return sum;\n}\n\nbool is_prime(int n) {\n if (n < 2)\n return false;\n if (n % 2 == 0)\n return n == 2;\n if (n % 3 == 0)\n return n == 3;\n for (int p = 5; p * p <= n; p += 4) {\n if (n % p == 0)\n return false;\n p += 2;\n if (n % p == 0)\n return false;\n }\n return true;\n}\n\nbool is_rhonda(int base, int n) {\n return digit_product(base, n) == base * prime_factor_sum(n);\n}\n\nstd::string to_string(int base, int n) {\n assert(base <= 36);\n static constexpr char digits[] = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n std::string str;\n for (; n != 0; n /= base)\n str += digits[n % base];\n std::reverse(str.begin(), str.end());\n return str;\n}\n\nint main() {\n const int limit = 15;\n for (int base = 2; base <= 36; ++base) {\n if (is_prime(base))\n continue;\n std::cout << \"First \" << limit << \" Rhonda numbers to base \" << base\n << \":\\n\";\n int numbers[limit];\n for (int n = 1, count = 0; count < limit; ++n) {\n if (is_rhonda(base, n))\n numbers[count++] = n;\n }\n std::cout << \"In base 10:\";\n for (int i = 0; i < limit; ++i)\n std::cout << ' ' << numbers[i];\n std::cout << \"\\nIn base \" << base << ':';\n for (int i = 0; i < limit; ++i)\n std::cout << ' ' << to_string(base, numbers[i]);\n std::cout << \"\\n\\n\";\n }\n}\n","language":"C++"},{"code":"USING: formatting grouping io kernel lists lists.lazy math\nmath.parser math.primes math.primes.factors prettyprint ranges\nsequences sequences.extras ;\n\n: rhonda? ( n base -- ? )\n [ [ >base 1 group ] keep '[ _ base> ] map-product ]\n [ swap factors sum * ] 2bi = ;\n\n: rhonda ( base -- list ) 1 lfrom swap '[ _ rhonda? ] lfilter ;\n\n: list. ( list base -- ) '[ _ >base write bl ] leach nl ;\n\n:: rhonda. ( base -- )\n 15 base rhonda ltake :> r\n base \"First 15 Rhonda numbers to base %d:\\n\" printf\n \"In base 10: \" write r 10 list.\n base \"In base %d: \" printf r base list. ;\n\n2 36 [a..b] [ prime? not ] filter [ rhonda. nl ] each\n","language":"Factor"},{"code":"'#include \"isprime.bas\"\n\nFunction FactorSum(n As Uinteger) As Uinteger\n Dim As Uinteger result = 0\n Dim As Uinteger v = Abs(n)\n While v > 1 And v Mod 2 = 0\n result += 2\n v \\= 2\n Wend\n For f As Uinteger = 3 To v Step 2\n While v > 1 And v Mod f = 0\n result += f\n v \\= f\n Wend\n Next f\n Return result\nEnd Function\n\nFunction DigitProduct(n As Uinteger, base_ As Uinteger) As Uinteger\n If n = 0 Then Return 0\n Dim As Uinteger result = 1\n Dim As Uinteger v = Abs(n)\n While v > 0\n result *= v Mod base_\n v \\= base_\n Wend\n Return result\nEnd Function\n\nFunction isRhonda(n As Uinteger, base_ As Uinteger) As Uinteger\n Return base_ * FactorSum(n) = DigitProduct(n, base_)\nEnd Function\n\nFunction ToBaseString(n As Uinteger, base_ As Uinteger) As String\n If n = 0 Then Return \"0\"\n Dim As Uinteger under10 = Asc(\"0\")\n Dim As Uinteger over9 = Asc(\"a\") - 10\n Dim As String result = \"\"\n Dim As Uinteger v = Abs(n)\n While v > 0\n Dim As Uinteger d = v Mod base_\n result = Chr(d + Iif(d < 10, under10, over9)) + result\n v \\= base_\n Wend\n Return result\nEnd Function\n\nDim As Uinteger maxRhonda = 10, maxBase = 16\nFor base_ As Uinteger = 2 To maxBase\n If Not isPrime(base_) Then\n Print \"The first \"; maxRhonda; \" Rhonda numbers in base \"; base_; \":\"\n Dim As Uinteger rCount = 0\n Dim As Uinteger rhonda(1 To maxRhonda)\n Dim As Uinteger n = 1\n While rCount < maxRhonda\n If isRhonda(n, base_) Then\n rCount += 1\n rhonda(rCount) = n\n End If\n n += 1\n Wend\n Print \" in base 10: \";\n For i As Uinteger = 1 To maxRhonda\n Print \" \"; rhonda(i);\n Next i\n Print\n If base_ <> 10 Then\n Print Using \" in base ##: \"; base_;\n For i As Uinteger = 1 To maxRhonda\n Print \" \"; ToBaseString(rhonda(i), base_);\n Next i\n Print\n End If\n End If\nNext base_\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"rcu\"\n \"strconv\"\n)\n\nfunc contains(a []int, n int) bool {\n for _, e := range a {\n if e == n {\n return true\n }\n }\n return false\n}\n\nfunc main() {\n for b := 2; b <= 36; b++ {\n if rcu.IsPrime(b) {\n continue\n }\n count := 0\n var rhonda []int\n for n := 1; count < 15; n++ {\n digits := rcu.Digits(n, b)\n if !contains(digits, 0) {\n var anyEven = false\n for _, d := range digits {\n if d%2 == 0 {\n anyEven = true\n break\n }\n }\n if b != 10 || (contains(digits, 5) && anyEven) {\n calc1 := 1\n for _, d := range digits {\n calc1 *= d\n }\n calc2 := b * rcu.SumInts(rcu.PrimeFactors(n))\n if calc1 == calc2 {\n rhonda = append(rhonda, n)\n count++\n }\n }\n }\n }\n if len(rhonda) > 0 {\n fmt.Printf(\"\\nFirst 15 Rhonda numbers in base %d:\\n\", b)\n rhonda2 := make([]string, len(rhonda))\n counts2 := make([]int, len(rhonda))\n for i, r := range rhonda {\n rhonda2[i] = fmt.Sprintf(\"%d\", r)\n counts2[i] = len(rhonda2[i])\n }\n rhonda3 := make([]string, len(rhonda))\n counts3 := make([]int, len(rhonda))\n for i, r := range rhonda {\n rhonda3[i] = strconv.FormatInt(int64(r), b)\n counts3[i] = len(rhonda3[i])\n }\n maxLen2 := rcu.MaxInts(counts2)\n maxLen3 := rcu.MaxInts(counts3)\n maxLen := maxLen2\n if maxLen3 > maxLen {\n maxLen = maxLen3\n }\n maxLen++\n fmt.Printf(\"In base 10: %*s\\n\", maxLen, rhonda2)\n fmt.Printf(\"In base %-2d: %*s\\n\", b, maxLen, rhonda3)\n }\n }\n}\n","language":"Go"},{"code":"::\n:: A library for producing Rhonda numbers and testing if numbers are Rhonda.\n::\n:: A number is Rhonda if the product of its digits of in base b equals\n:: the product of the base b and the sum of its prime factors.\n:: see also: https://mathworld.wolfram.com/RhondaNumber.html\n::\n=<\n::\n|%\n:: +check: test whether the number n is Rhonda to base b\n::\n++ check\n |= [b=@ud n=@ud]\n ^- ?\n ~_ leaf+\"base b must be >= 2\"\n ?> (gte b 2)\n ~_ leaf+\"candidate number n must be >= 2\"\n ?> (gte n 2)\n ::\n .= (roll (base-digits b n) mul)\n %+ mul\n b\n (roll (prime-factors n) add)\n:: +series: produce the first n numbers which are Rhonda in base b\n::\n:: produce ~ if base b has no Rhonda numbers\n::\n++ series\n |= [b=@ud n=@ud]\n ^- (list @ud)\n ~_ leaf+\"base b must be >= 2\"\n ?> (gte b 2)\n ::\n ?: =((prime-factors b) ~[b])\n ~\n =/ candidate=@ud 2\n =+ rhondas=*(list @ud)\n |-\n ?: =(n 0)\n (flop rhondas)\n =/ is-rhonda=? (check b candidate)\n %= $\n rhondas ?:(is-rhonda [candidate rhondas] rhondas)\n n ?:(is-rhonda (dec n) n)\n candidate +(candidate)\n ==\n--\n::\n|%\n:: +base-digits: produce a list of the digits of n represented in base b\n::\n:: This arm has two behaviors which may be at first surprising, but do not\n:: matter for the purposes of the ++check and ++series arms, and allow for\n:: some simplifications to its implementation.\n:: - crashes on n=0\n:: - orders the list of digits with least significant digits first\n::\n:: ex: (base-digits 4 10.206) produces ~[2 3 1 3 3 1 2]\n::\n++ base-digits\n |= [b=@ud n=@ud]\n ^- (list @ud)\n ?> (gte b 2)\n ?< =(n 0)\n ::\n |-\n ?: =(n 0)\n ~\n :- (mod n b)\n $(n (div n b))\n:: +prime-factors: produce a list of the prime factors of n\n::\n:: by trial division\n:: n must be >= 2\n:: if n is prime, produce ~[n]\n:: ex: (prime-factors 10.206) produces ~[7 3 3 3 3 3 3 2]\n::\n++ prime-factors\n |= [n=@ud]\n ^- (list @ud)\n ?> (gte n 2)\n ::\n =+ factors=*(list @ud)\n =/ wheel new-wheel\n :: test candidates as produced by the wheel, not exceeding sqrt(n)\n ::\n |-\n =^ candidate wheel (next:wheel)\n ?. (lte (mul candidate candidate) n)\n ?:((gth n 1) [n factors] factors)\n |-\n ?: =((mod n candidate) 0)\n :: repeat the prime factor as many times as possible\n ::\n $(factors [candidate factors], n (div n candidate))\n ^$\n:: +new-wheel: a door for generating numbers that may be prime\n::\n:: This uses wheel factorization with a basis of {2, 3, 5} to limit the\n:: number of composites produced. It produces numbers in increasing order\n:: starting from 2.\n::\n++ new-wheel\n =/ fixed=(list @ud) ~[2 3 5 7]\n =/ skips=(list @ud) ~[4 2 4 2 4 6 2 6]\n =/ lent-fixed=@ud (lent fixed)\n =/ lent-skips=@ud (lent skips)\n ::\n |_ [current=@ud fixed-i=@ud skips-i=@ud]\n :: +next: produce the next number and the new wheel state\n ::\n ++ next\n |.\n :: Exhaust the numbers in fixed. Then calculate successive values by\n :: cycling through skips and increasing from the previous number by\n :: the current skip-value.\n ::\n =/ fixed-done=? =(fixed-i lent-fixed)\n =/ next-fixed-i ?:(fixed-done fixed-i +(fixed-i))\n =/ next-skips-i ?:(fixed-done (mod +(skips-i) lent-skips) skips-i)\n =/ next\n ?. fixed-done\n (snag fixed-i fixed)\n (add current (snag skips-i skips))\n :- next\n +.$(current next, fixed-i next-fixed-i, skips-i next-skips-i)\n --\n--\n","language":"Hoon"},{"code":"/+ *rhonda\n:- %say\n|= [* [base=@ud many=@ud ~] ~]\n:- %noun\n(series base many)\n","language":"Hoon"},{"code":"|%\n++ check\n |= [n=@ud base=@ud]\n :: if base is prime, automatic no\n ::\n ?: =((~(gut by (prime-map +(base))) base 0) 0)\n %.n\n :: if not multiply the digits and compare to base x sum of factors\n ::\n ?: =((roll (digits [base n]) mul) (mul base (roll (factor n) add)))\n %.y\n %.n\n++ series\n |= [base=@ud many=@ud]\n =/ rhondas *(list @ud)\n ?: =((~(gut by (prime-map +(base))) base 0) 0)\n rhondas\n =/ itr 1\n |-\n ?: =((lent rhondas) many)\n (flop rhondas)\n ?: =((check itr base) %.n)\n $(itr +(itr))\n $(rhondas [itr rhondas], itr +(itr))\n:: digits: gives the list of digits of a number in a base\n::\n:: We strip digits least to most significant.\n:: The least significant digit (lsd) of n in base b is just n mod b.\n:: Subtract the lsd, divide by b, and repeat.\n:: To know when to stop, we need to know how many digits there are.\n++ digits\n |= [base=@ud num=@ud]\n ^- (list @ud)\n |-\n =/ modulus=@ud (mod num base)\n ?: =((num-digits base num) 1)\n ~[modulus]\n [modulus $(num (div (sub num modulus) base))]\n:: num-digits: gives the number of digits of a number in a base\n::\n:: Simple idea: k is the number of digits of n in base b if and\n:: only if k is the smallest number such that b^k > n.\n++ num-digits\n |= [base=@ud num=@ud]\n ^- @ud\n =/ digits=@ud 1\n |-\n ?: (gth (pow base digits) num)\n digits\n $(digits +(digits))\n:: factor: produce a list of prime factors\n::\n:: The idea is to identify \"small factors\" of n, i.e. prime factors less than\n:: the square root. We then divide n by these factors to reduce the\n:: magnitude of n. It's easy to argue that after this is done, we obtain 1\n:: or the largest prime factor.\n::\n++ factor\n |= n=@ud\n ^- (list @ud)\n ?: ?|(=(n 0) =(n 1))\n ~[n]\n =/ factorization *(list @ud)\n :: produce primes less than or equal to root n\n ::\n =/ root (sqrt n)\n =/ primes (prime-map +(root))\n :: itr = iterate; we want to iterate through the primes less than root n\n ::\n =/ itr 2\n |-\n ?: =(itr +(root))\n :: if n is now 1 we're done\n ::\n ?: =(n 1)\n factorization\n :: otherwise it's now the original n's largest primes factor\n ::\n [n factorization]\n :: if itr not prime move on\n ::\n ?: =((~(gut by primes) itr 0) 1)\n $(itr +(itr))\n :: if it is prime, divide out by the highest power that divides num\n ::\n ?: =((mod n itr) 0)\n $(n (div n itr), factorization [itr factorization])\n :: once done, move to next prime\n ::\n $(itr +(itr))\n:: sqrt: gives the integer square root of a number\n::\n:: It's based on an algorithm that predates the Greeks:\n:: To find the square root of A, think of A as an area.\n:: Guess the side of the square x. Compute the other side y = A/x.\n:: If x is an over/underestimate then y is an under/overestimate.\n:: So (x+y)/2 is the average of an over and underestimate, thus better than x.\n:: Repeatedly doing x --> (x + A/x)/2 converges to sqrt(A).\n::\n:: This algorithm is the same but with integer valued operations.\n:: The algorithm either converges to the integer square root and repeats,\n:: or gets trapped in a two-cycle of adjacent integers.\n:: In the latter case, the smaller number is the answer.\n::\n++ sqrt\n |= n=@ud\n =/ guess=@ud 1\n |-\n =/ new-guess (div (add guess (div n guess)) 2)\n :: sequence stabilizes\n ::\n ?: =(guess new-guess)\n guess\n :: sequence is trapped in 2-cycle\n ::\n ?: =(guess +(new-guess))\n new-guess\n ?: =(new-guess +(guess))\n guess\n $(guess new-guess)\n:: prime-map: (effectively) produces primes less than a given input\n::\n:: This is the sieve of Eratosthenes to produce primes less than n.\n:: I used a map because it had much faster performance than a list.\n:: Any key in the map is a non-prime. The value 1 indicates \"false.\"\n:: I.e. it's not a prime.\n++ prime-map\n |= n=@ud\n ^- (map @ud @ud)\n =/ prime-map `(map @ud @ud)`(my ~[[0 1] [1 1]])\n :: start sieving with 2\n ::\n =/ sieve 2\n |-\n :: if sieve is too large to be a factor we're done\n ::\n ?: (gte (mul sieve sieve) n)\n prime-map\n :: if not too large but not prime, move on\n ::\n ?: =((~(gut by prime-map) sieve 0) 1)\n $(sieve +(sieve))\n :: sequence: explanation\n ::\n :: If s is the sieve number, we start sieving multiples\n :: of s at s^2 in sequence: s^2, s^2 + s, s^2 + 2s, ...\n :: We start at s^2 because any number smaller than s^2\n :: has prime factors less than s and would have been\n :: eliminated earlier in the sieving process.\n ::\n =/ sequence (mul sieve sieve)\n |-\n :: done sieving with s once sequence is past n\n ::\n ?: (gte sequence n)\n ^$(sieve +(sieve))\n :: if sequence position is known not prime we move on\n ::\n ?: =((~(gut by prime-map) sequence 0) 1)\n $(sequence (add sequence sieve))\n :: otherwise we mark position of sequence as not prime and move on\n ::\n $(prime-map (~(put by prime-map) sequence 1), sequence (add sequence sieve))\n--\n","language":"Hoon"},{"code":"tobase=: (a.{~;48 97(+ i.)each 10 26) {~ #.inv\nisrhonda=: (*/@:(#.inv) = (* +/@q:))\"0\n\ntask=: {{\n for_base.(#~ 0=1&p:) }.1+i.36 do.\n k=.i.0\n block=. 1+i.1e4\n while. 15>#k do.\n k=. k, block#~ base isrhonda block\n block=. block+1e4\n end.\n echo ''\n echo 'First 15 Rhondas in',b=.' base ',':',~\":base\n echo 'In base 10: ',\":15{.k\n echo 'In',;:inv b;base tobase each 15{.k\n end.\n}}\n\n task''\n","language":"J"},{"code":"public class RhondaNumbers {\n public static void main(String[] args) {\n final int limit = 15;\n for (int base = 2; base <= 36; ++base) {\n if (isPrime(base))\n continue;\n System.out.printf(\"First %d Rhonda numbers to base %d:\\n\", limit, base);\n int numbers[] = new int[limit];\n for (int n = 1, count = 0; count < limit; ++n) {\n if (isRhonda(base, n))\n numbers[count++] = n;\n }\n System.out.printf(\"In base 10:\");\n for (int i = 0; i < limit; ++i)\n System.out.printf(\" %d\", numbers[i]);\n System.out.printf(\"\\nIn base %d:\", base);\n for (int i = 0; i < limit; ++i)\n System.out.printf(\" %s\", Integer.toString(numbers[i], base));\n System.out.printf(\"\\n\\n\");\n }\n }\n\n private static int digitProduct(int base, int n) {\n int product = 1;\n for (; n != 0; n /= base)\n product *= n % base;\n return product;\n }\n\n private static int primeFactorSum(int n) {\n int sum = 0;\n for (; (n & 1) == 0; n >>= 1)\n sum += 2;\n for (int p = 3; p * p <= n; p += 2)\n for (; n % p == 0; n /= p)\n sum += p;\n if (n > 1)\n sum += n;\n return sum;\n }\n\n private static boolean isPrime(int n) {\n if (n < 2)\n return false;\n if (n % 2 == 0)\n return n == 2;\n if (n % 3 == 0)\n return n == 3;\n for (int p = 5; p * p <= n; p += 4) {\n if (n % p == 0)\n return false;\n p += 2;\n if (n % p == 0)\n return false;\n }\n return true;\n }\n\n private static boolean isRhonda(int base, int n) {\n return digitProduct(base, n) == base * primeFactorSum(n);\n }\n}\n","language":"Java"},{"code":"def prod(s): reduce s as $_ (1; . * $_);\n\ndef sigma(s): reduce s as $_ (0; . + $_);\n\n# If s is a stream of JSON entities that does not include null, butlast(s) emits all but the last.\ndef butlast(s):\n label $out\n | foreach (s,null) as $x ({};\n if $x == null then break $out else .emit = .prev | .prev = $x end)\n | select(.emit).emit;\n\ndef multiple(s):\n first(foreach s as $x (0; .+1; select(. > 1))) // false;\n\n# Output: a stream of the prime factors of the input\n# e.g.\n# 2 | factors #=> 2\n# 24 | factors #=> 2 2 2 3\ndef factors:\n . as $in\n | [2, $in, false]\n | recurse(\n . as [$p, $q, $valid, $s]\n | if $q == 1 then empty\n elif $q % $p == 0 then [$p, $q/$p, true]\n elif $p == 2 then [3, $q, false, $s]\n else ($s // ($q | sqrt)) as $s\n | if $p + 2 <= $s then [$p + 2, $q, false, $s]\n else [$q, 1, true]\n end\n end )\n | if .[2] then .[0] else empty end ;\n","language":"Jq"},{"code":"def lpad($len): tostring | ($len - length) as $l | (\" \" * $l)[:$l] + .;\n\ndef is_prime:\n multiple(factors) | not;\n\ndef tobase($b):\n def digit: \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"[.:.+1];\n def mod: . % $b;\n def div: ((. - mod) / $b);\n def digits: recurse( select(. > 0) | div) | mod ;\n # For jq it would be wise to protect against `infinite` as input, but using `isinfinite` confuses gojq\n select( (tostring|test(\"^[0-9]+$\")) and 2 <= $b and $b <= 36)\n | if . == 0 then \"0\"\n else [digits | digit] | reverse[1:] | add\n end;\n\n# emit the decimal values of the \"digits\"\ndef digits($b):\n def mod: . % $b;\n def div: ((. - mod) / $b);\n butlast(recurse( select(. > 0) | div) | mod) ;\n","language":"Jq"},{"code":"# Emit a stream of Rhonda numbers in the given base\ndef rhondas($b):\n range(1; infinite) as $n\n | ($n | [digits($b)]) as $digits\n | select($digits|index(0)|not)\n | select(($b != 10) or (($digits|index(5)) and ($digits | any(. % 2 == 0))))\n | select(prod($digits[]) == ($b * sigma($n | factors)))\n | $n ;\n","language":"Jq"},{"code":"def task($count):\n range (2; 37) as $b\n | select( $b | is_prime | not)\n | [ limit($count; rhondas($b)) ]\n | select(length > 0)\n |\"First \\($count) Rhonda numbers in base \\($b):\",\n ( (map(tostring)) as $rhonda2\n | (map(tobase($b))) as $rhonda3\n | (($rhonda2|map(length)) | max) as $maxLen2\n | (($rhonda3|map(length)) | max) as $maxLen3\n | ( ([$maxLen2, $maxLen3]|max) + 1) as $maxLen\n | \"In base 10: \\($rhonda2 | map(lpad($maxLen)) | join(\" \") )\",\n \"In base \\($b|lpad(2)): \\($rhonda3 | map(lpad($maxLen)) | join(\" \") )\",\n \"\") ;\n\ntask(10)\n","language":"Jq"},{"code":"using Primes\n\nisRhonda(n, b) = prod(digits(n, base=b)) == b * sum([prod(pair) for pair in factor(n).pe])\n\nfunction displayrhondas(low, high, nshow)\n for b in filter(!isprime, low:high)\n n, rhondas = 1, Int[]\n while length(rhondas) < nshow\n isRhonda(n, b) && push!(rhondas, n)\n n += 1\n end\n println(\"First $nshow Rhondas in base $b:\")\n println(\"In base 10: \", rhondas)\n println(\"In base $b: \", replace(string([string(i, base=b) for i in rhondas]), \"\\\"\" => \"\"), \"\\n\")\n end\nend\n\ndisplayrhondas(2, 16, 15)\n","language":"Julia"},{"code":"ClearAll[RhondaNumberQ]\nRhondaNumberQ[b_Integer][n_Integer] := Module[{l, r},\n l = Times @@ IntegerDigits[n, b];\n r = Total[Catenate[ConstantArray @@@ FactorInteger[n]]];\n l == b r\n]\nbases = Select[Range[2, 36], PrimeQ/*Not];\nDo[\n Print[\"base \", b, \":\", Take[Select[Range[700000], RhondaNumberQ[b]], UpTo[15]]];\n ,\n {b, bases}\n]\n","language":"Mathematica"},{"code":"import std/[sequtils, strformat, strutils]\n\ntype Base = 2..36\n\ntemplate isEven(n: int): bool = (n and 1) == 0\n\nfunc isPrime(n: Natural): bool =\n ## Return true if \"n\" is prime.\n if n < 2: return false\n if n.isEven: return n == 2\n if n mod 3 == 0: return n == 3\n var d = 5\n while d * d <= n:\n if n mod d == 0: return false\n inc d, 2\n return true\n\nfunc digitProduct(n: Positive; base: Base): int =\n ## Return the product of digits of \"n\" in given base.\n var n = n.Natural\n result = 1\n while n != 0:\n result *= n mod base\n n = n div base\n\nfunc primeFactorSum(n: Positive): int =\n ## Return the sum of prime factors of \"n\".\n var n = n.Natural\n while n.isEven:\n inc result, 2\n n = n shr 1\n var d = 3\n while d * d <= n:\n while n mod d == 0:\n inc result, d\n n = n div d\n inc d, 2\n if n > 1: inc result, n\n\nfunc isRhondaNumber(n: Positive; base: Base): bool =\n ## Return true if \"n\" is a Rhonda number to given base.\n n.digitProduct(base) == base * n.primeFactorSum\n\nconst Digits = toSeq('0'..'9') & toSeq('a'..'z')\n\nfunc toBase(n: Positive; base: Base): string =\n ## Return the string representation of \"n\" in given base.\n var n = n.Natural\n while true:\n result.add Digits[n mod base]\n n = n div base\n if n == 0: break\n # Reverse the digits.\n for i in 1..(result.len shr 1):\n swap result[i - 1], result[^i]\n\n\nconst N = 10\n\nfor base in 2..36:\n if base.isPrime: continue\n echo &\"First {N} Rhonda numbers to base {base}:\"\n var rhondaList: seq[Positive]\n var n = 1\n var count = 0\n while count < N:\n if n.isRhondaNumber(base):\n rhondaList.add n\n inc count\n inc n\n echo \"In base 10: \", rhondaList.join(\" \")\n echo &\"In base {base}: \", rhondaList.mapIt(it.toBase(base)).join(\" \")\n echo()\n","language":"Nim"},{"code":"isRhonda(n, b) =\n{\n local(mydigits, product, mysum, factors, pairProduct);\n\n mydigits = digits(n, b);\n product = vecprod(mydigits);\n factors = factor(n);\n mysum= 0;\n for(i = 1, matsize(factors)[1],\n pairProduct = factors[i, 1] * factors[i, 2];\n mysum += pairProduct;\n );\n product == b * mysum;\n}\n\ndisplayrhondas(low, high, nshow) =\n{\n local(b, n, rhondas, count, basebRhondas);\n for(b = low, high,\n if(isprime(b), next);\n n = 1; rhondas = [];\n count = 0;\n while(count < nshow,\n if(isRhonda(n, b),\n rhondas = concat(rhondas, n);\n count++;\n );\n n++;\n );\n print(\"First \" nshow \" Rhondas in base \" b \":\");\n print(\"In base 10: \" rhondas);\n basebRhondas = vector(#rhondas, i, (digits(rhondas[i], b)));\n print(\"In base \" b \": \" basebRhondas);\n print(\"\\n\");\n );\n}\n\ndisplayrhondas(2, 16, 15);\n","language":"PARI-GP"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\nuse ntheory qw<is_prime factor vecsum vecprod todigitstring todigits>;\n\nsub rhonda {\n my($b, $cnt) = @_;\n my(@r,$n);\n while (++$n) {\n push @r, $n if ($b * vecsum factor($n)) == vecprod todigits($n,$b);\n return @r if $cnt == @r;\n }\n}\n\nfor my $b (grep { ! is_prime $_ } 2..36) {\n my @Rb = map { todigitstring($_,$b) } my @R = rhonda($b, 15);\n say <<~EOT;\n First 15 Rhonda numbers to base $b:\n In base $b: @Rb\n In base 10: @R\n EOT\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">fmt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n First 15 Rhonda numbers in base %d:\n In base 10: %s\n In base %-2d: %s\n\n \"\"\"</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">digit</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #008000;\">'9'</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">'0'</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">'a'</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">base</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">36</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">is_prime</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">base</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">rhondab</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span> <span style=\"color: #000080;font-style:italic;\">-- (base)</span>\n <span style=\"color: #000000;\">rhondad</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span> <span style=\"color: #000080;font-style:italic;\">-- (decimal)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rhondab</span><span style=\"color: #0000FF;\">)<</span><span style=\"color: #000000;\">15</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">digits</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%a\"</span><span style=\"color: #0000FF;\">,{{</span><span style=\"color: #000000;\">base</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">}})</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">'0'</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">digits</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">base</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">10</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">'5'</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">digits</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">apply</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">digits</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">even</span><span style=\"color: #0000FF;\">))!=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">))</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">pd</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">product</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">apply</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">digits</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">digit</span><span style=\"color: #0000FF;\">)),</span>\n <span style=\"color: #000000;\">bs</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">base</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">prime_factors</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">pd</span><span style=\"color: #0000FF;\">==</span><span style=\"color: #000000;\">bs</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">decdig</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">max</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">decdig</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">digits</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">rhondab</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rhondab</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">pad_head</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">digits</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">rhondad</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rhondad</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">pad_head</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">decdig</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">fmt</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">base</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rhondad</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">base</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rhondab</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"use Prime::Factor;\n\nmy @factor-sum;\n\n@factor-sum[1000000] = 42; # Sink a large index to make access thread safe\n\nsub rhonda ($base) {\n (1..∞).hyper.map: { $_ if $base * (@factor-sum[$_] //= .&prime-factors.sum) == [×] .polymod($base xx *) }\n}\n\nfor (flat 2..16, 17..36).grep: { !.&is-prime } -> $b {\n put \"\\nFirst 15 Rhonda numbers to base $b:\";\n my @rhonda = rhonda($b)[^15];\n my $ch = @rhonda[*-1].chars max @rhonda[*-1].base($b).chars;\n put \"In base 10: \" ~ @rhonda».fmt(\"%{$ch}s\").join: ', ';\n put $b.fmt(\"In base %2d: \") ~ @rhonda».base($b)».fmt(\"%{$ch}s\").join: ', ';\n}\n","language":"Raku"},{"code":"// [dependencies]\n// radix_fmt = \"1.0\"\n\nfn digit_product(base: u32, mut n: u32) -> u32 {\n let mut product = 1;\n while n != 0 {\n product *= n % base;\n n /= base;\n }\n product\n}\n\nfn prime_factor_sum(mut n: u32) -> u32 {\n let mut sum = 0;\n while (n & 1) == 0 {\n sum += 2;\n n >>= 1;\n }\n let mut p = 3;\n while p * p <= n {\n while n % p == 0 {\n sum += p;\n n /= p;\n }\n p += 2;\n }\n if n > 1 {\n sum += n;\n }\n sum\n}\n\nfn is_prime(n: u32) -> bool {\n if n < 2 {\n return false;\n }\n if n % 2 == 0 {\n return n == 2;\n }\n if n % 3 == 0 {\n return n == 3;\n }\n let mut p = 5;\n while p * p <= n {\n if n % p == 0 {\n return false;\n }\n p += 2;\n if n % p == 0 {\n return false;\n }\n p += 4;\n }\n true\n}\n\nfn is_rhonda(base: u32, n: u32) -> bool {\n digit_product(base, n) == base * prime_factor_sum(n)\n}\n\nfn main() {\n let limit = 15;\n for base in 2..=36 {\n if is_prime(base) {\n continue;\n }\n println!(\"First {} Rhonda numbers to base {}:\", limit, base);\n let numbers: Vec<u32> = (1..).filter(|x| is_rhonda(base, *x)).take(limit).collect();\n print!(\"In base 10:\");\n for n in &numbers {\n print!(\" {}\", n);\n }\n print!(\"\\nIn base {}:\", base);\n for n in &numbers {\n print!(\" {}\", radix_fmt::radix(*n, base as u8));\n }\n print!(\"\\n\\n\");\n }\n}\n","language":"Rust"},{"code":"func is_rhonda_number(n, base = 10) {\n base.is_composite || return false\n n > 0 || return false\n n.digits(base).prod == base*n.factor.sum\n}\n\nfor b in (2..16 -> grep { .is_composite }) {\n say (\"First 10 Rhonda numbers to base #{b}: \",\n 10.by { is_rhonda_number(_, b) })\n}\n","language":"Sidef"},{"code":"func digitProduct(base: Int, num: Int) -> Int {\n var product = 1\n var n = num\n while n != 0 {\n product *= n % base\n n /= base\n }\n return product\n}\n\nfunc primeFactorSum(_ num: Int) -> Int {\n var sum = 0\n var n = num\n while (n & 1) == 0 {\n sum += 2\n n >>= 1\n }\n var p = 3\n while p * p <= n {\n while n % p == 0 {\n sum += p\n n /= p\n }\n p += 2\n }\n if n > 1 {\n sum += n\n }\n return sum\n}\n\nfunc isPrime(_ n: Int) -> Bool {\n if n < 2 {\n return false\n }\n if n % 2 == 0 {\n return n == 2\n }\n if n % 3 == 0 {\n return n == 3\n }\n var p = 5\n while p * p <= n {\n if n % p == 0 {\n return false\n }\n p += 2\n if n % p == 0 {\n return false\n }\n p += 4\n }\n return true\n}\n\nfunc isRhonda(base: Int, num: Int) -> Bool {\n return digitProduct(base: base, num: num) == base * primeFactorSum(num)\n}\n\nlet limit = 15\nfor base in 2...36 {\n if isPrime(base) {\n continue\n }\n print(\"First \\(limit) Rhonda numbers to base \\(base):\")\n let numbers = Array((1...).lazy.filter{ isRhonda(base: base, num: $0) }.prefix(limit))\n print(\"In base 10:\", terminator: \"\")\n for n in numbers {\n print(\" \\(n)\", terminator: \"\")\n }\n print(\"\\nIn base \\(base):\", terminator: \"\")\n for n in numbers {\n print(\" \\(String(n, radix: base))\", terminator: \"\")\n }\n print(\"\\n\")\n}\n","language":"Swift"},{"code":"import \"./math\" for Math, Int, Nums\nimport \"./fmt\" for Fmt, Conv\n\nfor (b in 2..36) {\n if (Int.isPrime(b)) continue\n var count = 0\n var rhonda = []\n var n = 1\n while (count < 15) {\n var digits = Int.digits(n, b)\n if (!digits.contains(0)) {\n if (b != 10 || (digits.contains(5) && digits.any { |d| d % 2 == 0 })) {\n var calc1 = Nums.prod(digits)\n var calc2 = b * Nums.sum(Int.primeFactors(n))\n if (calc1 == calc2) {\n rhonda.add(n)\n count = count + 1\n }\n }\n }\n n = n + 1\n }\n if (rhonda.count > 0) {\n System.print(\"\\nFirst 15 Rhonda numbers in base %(b):\")\n var rhonda2 = rhonda.map { |r| r.toString }.toList\n var rhonda3 = rhonda.map { |r| Conv.Itoa(r, b) }.toList\n var maxLen2 = Nums.max(rhonda2.map { |r| r.count })\n var maxLen3 = Nums.max(rhonda3.map { |r| r.count })\n var maxLen = Math.max(maxLen2, maxLen3) + 1\n Fmt.print(\"In base 10: $*s\", maxLen, rhonda2)\n Fmt.print(\"In base $-2d: $*s\", b, maxLen, rhonda3)\n }\n}\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Rhonda_numbers\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"A positive integer '''''n''''' is said to be a Rhonda number to base '''''b''''' if the product of the base '''''b''''' digits of '''''n''''' is equal to '''''b''''' times the sum of '''''n''''''s prime factors.\\n\\n\\n''These numbers were named by Kevin Brown after an acquaintance of his whose residence number was 25662, a member of the base 10 numbers with this property.''\\n\\n\\n'''25662''' is a Rhonda number to base-'''10'''. The prime factorization is '''2 × 3 × 7 × 13 × 47'''; the product of its base-'''10''' digits is equal to the base times the sum of its prime factors:\\n\\n<span style=font-size:150%;font-weight:bold;padding-left:3em;>2 × 5 × 6 × 6 × 2 = 720 = 10 × (2 + 3 + 7 + 13 + 47)</span>\\n\\nRhonda numbers only exist in bases that are not a prime.\\n\\n''Rhonda numbers to base 10 '''always''' contain at least 1 digit 5 and '''always''' contain at least 1 even digit.''\\n\\n\\n;Task\\n\\n* For the non-prime bases '''''b''''' from '''2''' through '''16''' , find and display here, on this page, at least the first '''10''' '''Rhonda numbers''' to base '''''b'''''. Display the found numbers at least in base '''10'''.\\n\\n\\n;Stretch\\n\\n* Extend out to base '''36'''.\\n\\n\\n;See also\\n\\n;* [https://mathworld.wolfram.com/RhondaNumber.html Wolfram Mathworld - Rhonda numbers]\\n;* [https://www.numbersaplenty.com/set/Rhonda_number Numbers Aplenty - Rhonda numbers]\\n;* [[oeis:A100968|OEIS:A100968 - Integers n that are Rhonda numbers to base 4]]\\n;* [[oeis:A100969|OEIS:A100969 - Integers n that are Rhonda numbers to base 6]]\\n;* [[oeis:A100970|OEIS:A100970 - Integers n that are Rhonda numbers to base 8]]\\n;* [[oeis:A100973|OEIS:A100973 - Integers n that are Rhonda numbers to base 9]]\\n;* [[oeis:A099542|OEIS:A099542 - Rhonda numbers to base 10]]\\n;* [[oeis:A100971|OEIS:A100971 - Integers n that are Rhonda numbers to base 12]]\\n;* [[oeis:A100972|OEIS:A100972 - Integers n that are Rhonda numbers to base 14]]\\n;* [[oeis:A100974|OEIS:A100974 - Integers n that are Rhonda numbers to base 15]]\\n;* [[oeis:A100975|OEIS:A100975 - Integers n that are Rhonda numbers to base 16]]\\n\\n;* [[oeis:A255735|OEIS:A255735 - Integers n that are Rhonda numbers to base 18]]\\n;* [[oeis:A255732|OEIS:A255732 - Rhonda numbers in vigesimal number system]] (base 20)\\n;* [[oeis:A255736|OEIS:A255736 - Integers that are Rhonda numbers to base 30]]\\n\\n;* [[Smith numbers|Related Task: Smith numbers]]\\n<br>\\n\\n\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"BEGIN # find some Rhonda numbers: numbers n in base b such that the product #\\n # of the digits of n is b * the sum of the prime factors of n #\\n\\n # returns the sum of the prime factors of n #\\n PROC factor sum = ( INT n )INT:\\n BEGIN\\n INT result := 0;\\n INT v := ABS n;\\n WHILE v > 1 AND v MOD 2 = 0 DO\\n result +:= 2;\\n v OVERAB 2\\n OD;\\n FOR f FROM 3 BY 2 WHILE v > 1 DO\\n WHILE v > 1 AND v MOD f = 0 DO\\n result +:= f;\\n v OVERAB f\\n OD\\n OD;\\n result\\n END # factor sum # ;\\n # returns the digit product of n in the specified base #\\n PROC digit product = ( INT n, base )INT:\\n IF n = 0 THEN 0\\n ELSE\\n INT result := 1;\\n INT v := ABS n;\\n WHILE v > 0 DO\\n result *:= v MOD base;\\n v OVERAB base\\n OD;\\n result\\n FI # digit product # ;\\n # returns TRUE if n is a Rhonda number in the specified base, #\\n # FALSE otherwise #\\n PROC is rhonda = ( INT n, base )BOOL: base * factor sum( n ) = digit product( n, base );\\n\\n # returns TRUE if n is prime, FALSE otherwise #\\n PROC is prime = ( INT n )BOOL:\\n IF n < 3 THEN n = 2\\n ELIF n MOD 3 = 0 THEN n = 3\\n ELIF NOT ODD n THEN FALSE\\n ELSE\\n INT f := 5;\\n INT f2 := 25;\\n INT to next := 24;\\n BOOL is a prime := TRUE;\\n WHILE f2 <= n AND is a prime DO\\n is a prime := n MOD f /= 0;\\n f +:= 2;\\n f2 +:= to next;\\n to next +:= 8\\n OD;\\n is a prime\\n FI # is prime # ;\\n # returns a string representation of n in the specified base #\\n PROC to base string = ( INT n, base )STRING:\\n IF n = 0 THEN \\\"0\\\"\\n ELSE\\n INT under 10 = ABS \\\"0\\\";\\n INT over 9 = ABS \\\"a\\\" - 10;\\n STRING result := \\\"\\\";\\n INT v := ABS n;\\n WHILE v > 0 DO\\n INT d = v MOD base;\\n REPR ( d + IF d < 10 THEN under 10 ELSE over 9 FI ) +=: result;\\n v OVERAB base\\n OD;\\n result\\n FI # to base string # ;\\n # find the first few Rhonda numbers in non-prime bases 2 .. max base #\\n INT max rhonda = 10;\\n INT max base = 16;\\n FOR base FROM 2 TO max base DO\\n IF NOT is prime( base ) THEN\\n print( ( \\\"The first \\\", whole( max rhonda, 0 )\\n , \\\" Rhonda numbers in base \\\", whole( base, 0 )\\n , \\\":\\\", newline\\n )\\n );\\n INT r count := 0;\\n [ 1 : max rhonda ]INT rhonda;\\n FOR n WHILE r count < max rhonda DO\\n IF is rhonda( n, base ) THEN\\n rhonda[ r count +:= 1 ] := n\\n FI\\n OD;\\n print( ( \\\" in base 10:\\\" ) );\\n FOR i TO max rhonda DO print( ( \\\" \\\", whole( rhonda[ i ], 0 ) ) ) OD;\\n print( ( newline ) );\\n IF base /= 10 THEN\\n print( ( \\\" in base \\\", whole( base, -2 ), \\\":\\\" ) );\\n FOR i TO max rhonda DO print( ( \\\" \\\", to base string( rhonda[ i ], base ) ) ) OD;\\n print( ( newline ) )\\n FI\\n FI\\n OD\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"digs: (@`0`..`9`) ++ @`A`..`Z`\\ntoBase: function [n,base][\\n join map digits.base:base n 'x -> digs\\\\[x]\\n]\\n\\nrhonda?: function [n,base][\\n (base * sum factors.prime n) = product digits.base:base n\\n]\\n\\nnonPrime: select 2..16 'x -> not? prime? x\\n\\nloop nonPrime 'npbase [\\n print \\\"The first 10 Rhonda numbers, base-\\\" ++ (to :string npbase) ++ \\\":\\\"\\n rhondas: select.first:10 1..∞ 'z -> rhonda? z npbase\\n print [\\\"In base 10 ->\\\" join.with:\\\", \\\" to [:string] rhondas]\\n print [\\\"In base\\\" npbase \\\"->\\\" join.with:\\\", \\\" to [:string] map rhondas 'w -> toBase w npbase]\\n print \\\"\\\"\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <cassert>\\n#include <iomanip>\\n#include <iostream>\\n\\nint digit_product(int base, int n) {\\n int product = 1;\\n for (; n != 0; n /= base)\\n product *= n % base;\\n return product;\\n}\\n\\nint prime_factor_sum(int n) {\\n int sum = 0;\\n for (; (n & 1) == 0; n >>= 1)\\n sum += 2;\\n for (int p = 3; p * p <= n; p += 2)\\n for (; n % p == 0; n /= p)\\n sum += p;\\n if (n > 1)\\n sum += n;\\n return sum;\\n}\\n\\nbool is_prime(int n) {\\n if (n < 2)\\n return false;\\n if (n % 2 == 0)\\n return n == 2;\\n if (n % 3 == 0)\\n return n == 3;\\n for (int p = 5; p * p <= n; p += 4) {\\n if (n % p == 0)\\n return false;\\n p += 2;\\n if (n % p == 0)\\n return false;\\n }\\n return true;\\n}\\n\\nbool is_rhonda(int base, int n) {\\n return digit_product(base, n) == base * prime_factor_sum(n);\\n}\\n\\nstd::string to_string(int base, int n) {\\n assert(base <= 36);\\n static constexpr char digits[] = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\n std::string str;\\n for (; n != 0; n /= base)\\n str += digits[n % base];\\n std::reverse(str.begin(), str.end());\\n return str;\\n}\\n\\nint main() {\\n const int limit = 15;\\n for (int base = 2; base <= 36; ++base) {\\n if (is_prime(base))\\n continue;\\n std::cout << \\\"First \\\" << limit << \\\" Rhonda numbers to base \\\" << base\\n << \\\":\\\\n\\\";\\n int numbers[limit];\\n for (int n = 1, count = 0; count < limit; ++n) {\\n if (is_rhonda(base, n))\\n numbers[count++] = n;\\n }\\n std::cout << \\\"In base 10:\\\";\\n for (int i = 0; i < limit; ++i)\\n std::cout << ' ' << numbers[i];\\n std::cout << \\\"\\\\nIn base \\\" << base << ':';\\n for (int i = 0; i < limit; ++i)\\n std::cout << ' ' << to_string(base, numbers[i]);\\n std::cout << \\\"\\\\n\\\\n\\\";\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"USING: formatting grouping io kernel lists lists.lazy math\\nmath.parser math.primes math.primes.factors prettyprint ranges\\nsequences sequences.extras ;\\n\\n: rhonda? ( n base -- ? )\\n [ [ >base 1 group ] keep '[ _ base> ] map-product ]\\n [ swap factors sum * ] 2bi = ;\\n\\n: rhonda ( base -- list ) 1 lfrom swap '[ _ rhonda? ] lfilter ;\\n\\n: list. ( list base -- ) '[ _ >base write bl ] leach nl ;\\n\\n:: rhonda. ( base -- )\\n 15 base rhonda ltake :> r\\n base \\\"First 15 Rhonda numbers to base %d:\\\\n\\\" printf\\n \\\"In base 10: \\\" write r 10 list.\\n base \\\"In base %d: \\\" printf r base list. ;\\n\\n2 36 [a..b] [ prime? not ] filter [ rhonda. nl ] each\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"'#include \\\"isprime.bas\\\"\\n\\nFunction FactorSum(n As Uinteger) As Uinteger\\n Dim As Uinteger result = 0\\n Dim As Uinteger v = Abs(n)\\n While v > 1 And v Mod 2 = 0\\n result += 2\\n v \\\\= 2\\n Wend\\n For f As Uinteger = 3 To v Step 2\\n While v > 1 And v Mod f = 0\\n result += f\\n v \\\\= f\\n Wend\\n Next f\\n Return result\\nEnd Function\\n\\nFunction DigitProduct(n As Uinteger, base_ As Uinteger) As Uinteger\\n If n = 0 Then Return 0\\n Dim As Uinteger result = 1\\n Dim As Uinteger v = Abs(n)\\n While v > 0\\n result *= v Mod base_\\n v \\\\= base_\\n Wend\\n Return result\\nEnd Function\\n\\nFunction isRhonda(n As Uinteger, base_ As Uinteger) As Uinteger\\n Return base_ * FactorSum(n) = DigitProduct(n, base_)\\nEnd Function\\n\\nFunction ToBaseString(n As Uinteger, base_ As Uinteger) As String\\n If n = 0 Then Return \\\"0\\\"\\n Dim As Uinteger under10 = Asc(\\\"0\\\")\\n Dim As Uinteger over9 = Asc(\\\"a\\\") - 10\\n Dim As String result = \\\"\\\"\\n Dim As Uinteger v = Abs(n)\\n While v > 0\\n Dim As Uinteger d = v Mod base_\\n result = Chr(d + Iif(d < 10, under10, over9)) + result\\n v \\\\= base_\\n Wend\\n Return result\\nEnd Function\\n\\nDim As Uinteger maxRhonda = 10, maxBase = 16\\nFor base_ As Uinteger = 2 To maxBase\\n If Not isPrime(base_) Then\\n Print \\\"The first \\\"; maxRhonda; \\\" Rhonda numbers in base \\\"; base_; \\\":\\\"\\n Dim As Uinteger rCount = 0\\n Dim As Uinteger rhonda(1 To maxRhonda)\\n Dim As Uinteger n = 1\\n While rCount < maxRhonda\\n If isRhonda(n, base_) Then\\n rCount += 1\\n rhonda(rCount) = n\\n End If\\n n += 1\\n Wend\\n Print \\\" in base 10: \\\";\\n For i As Uinteger = 1 To maxRhonda\\n Print \\\" \\\"; rhonda(i);\\n Next i\\n Print\\n If base_ <> 10 Then\\n Print Using \\\" in base ##: \\\"; base_;\\n For i As Uinteger = 1 To maxRhonda\\n Print \\\" \\\"; ToBaseString(rhonda(i), base_);\\n Next i\\n Print\\n End If\\n End If\\nNext base_\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"rcu\\\"\\n \\\"strconv\\\"\\n)\\n\\nfunc contains(a []int, n int) bool {\\n for _, e := range a {\\n if e == n {\\n return true\\n }\\n }\\n return false\\n}\\n\\nfunc main() {\\n for b := 2; b <= 36; b++ {\\n if rcu.IsPrime(b) {\\n continue\\n }\\n count := 0\\n var rhonda []int\\n for n := 1; count < 15; n++ {\\n digits := rcu.Digits(n, b)\\n if !contains(digits, 0) {\\n var anyEven = false\\n for _, d := range digits {\\n if d%2 == 0 {\\n anyEven = true\\n break\\n }\\n }\\n if b != 10 || (contains(digits, 5) && anyEven) {\\n calc1 := 1\\n for _, d := range digits {\\n calc1 *= d\\n }\\n calc2 := b * rcu.SumInts(rcu.PrimeFactors(n))\\n if calc1 == calc2 {\\n rhonda = append(rhonda, n)\\n count++\\n }\\n }\\n }\\n }\\n if len(rhonda) > 0 {\\n fmt.Printf(\\\"\\\\nFirst 15 Rhonda numbers in base %d:\\\\n\\\", b)\\n rhonda2 := make([]string, len(rhonda))\\n counts2 := make([]int, len(rhonda))\\n for i, r := range rhonda {\\n rhonda2[i] = fmt.Sprintf(\\\"%d\\\", r)\\n counts2[i] = len(rhonda2[i])\\n }\\n rhonda3 := make([]string, len(rhonda))\\n counts3 := make([]int, len(rhonda))\\n for i, r := range rhonda {\\n rhonda3[i] = strconv.FormatInt(int64(r), b)\\n counts3[i] = len(rhonda3[i])\\n }\\n maxLen2 := rcu.MaxInts(counts2)\\n maxLen3 := rcu.MaxInts(counts3)\\n maxLen := maxLen2\\n if maxLen3 > maxLen {\\n maxLen = maxLen3\\n }\\n maxLen++\\n fmt.Printf(\\\"In base 10: %*s\\\\n\\\", maxLen, rhonda2)\\n fmt.Printf(\\\"In base %-2d: %*s\\\\n\\\", b, maxLen, rhonda3)\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"::\\n:: A library for producing Rhonda numbers and testing if numbers are Rhonda.\\n::\\n:: A number is Rhonda if the product of its digits of in base b equals\\n:: the product of the base b and the sum of its prime factors.\\n:: see also: https://mathworld.wolfram.com/RhondaNumber.html\\n::\\n=<\\n::\\n|%\\n:: +check: test whether the number n is Rhonda to base b\\n::\\n++ check\\n |= [b=@ud n=@ud]\\n ^- ?\\n ~_ leaf+\\\"base b must be >= 2\\\"\\n ?> (gte b 2)\\n ~_ leaf+\\\"candidate number n must be >= 2\\\"\\n ?> (gte n 2)\\n ::\\n .= (roll (base-digits b n) mul)\\n %+ mul\\n b\\n (roll (prime-factors n) add)\\n:: +series: produce the first n numbers which are Rhonda in base b\\n::\\n:: produce ~ if base b has no Rhonda numbers\\n::\\n++ series\\n |= [b=@ud n=@ud]\\n ^- (list @ud)\\n ~_ leaf+\\\"base b must be >= 2\\\"\\n ?> (gte b 2)\\n ::\\n ?: =((prime-factors b) ~[b])\\n ~\\n =/ candidate=@ud 2\\n =+ rhondas=*(list @ud)\\n |-\\n ?: =(n 0)\\n (flop rhondas)\\n =/ is-rhonda=? (check b candidate)\\n %= $\\n rhondas ?:(is-rhonda [candidate rhondas] rhondas)\\n n ?:(is-rhonda (dec n) n)\\n candidate +(candidate)\\n ==\\n--\\n::\\n|%\\n:: +base-digits: produce a list of the digits of n represented in base b\\n::\\n:: This arm has two behaviors which may be at first surprising, but do not\\n:: matter for the purposes of the ++check and ++series arms, and allow for\\n:: some simplifications to its implementation.\\n:: - crashes on n=0\\n:: - orders the list of digits with least significant digits first\\n::\\n:: ex: (base-digits 4 10.206) produces ~[2 3 1 3 3 1 2]\\n::\\n++ base-digits\\n |= [b=@ud n=@ud]\\n ^- (list @ud)\\n ?> (gte b 2)\\n ?< =(n 0)\\n ::\\n |-\\n ?: =(n 0)\\n ~\\n :- (mod n b)\\n $(n (div n b))\\n:: +prime-factors: produce a list of the prime factors of n\\n::\\n:: by trial division\\n:: n must be >= 2\\n:: if n is prime, produce ~[n]\\n:: ex: (prime-factors 10.206) produces ~[7 3 3 3 3 3 3 2]\\n::\\n++ prime-factors\\n |= [n=@ud]\\n ^- (list @ud)\\n ?> (gte n 2)\\n ::\\n =+ factors=*(list @ud)\\n =/ wheel new-wheel\\n :: test candidates as produced by the wheel, not exceeding sqrt(n)\\n ::\\n |-\\n =^ candidate wheel (next:wheel)\\n ?. (lte (mul candidate candidate) n)\\n ?:((gth n 1) [n factors] factors)\\n |-\\n ?: =((mod n candidate) 0)\\n :: repeat the prime factor as many times as possible\\n ::\\n $(factors [candidate factors], n (div n candidate))\\n ^$\\n:: +new-wheel: a door for generating numbers that may be prime\\n::\\n:: This uses wheel factorization with a basis of {2, 3, 5} to limit the\\n:: number of composites produced. It produces numbers in increasing order\\n:: starting from 2.\\n::\\n++ new-wheel\\n =/ fixed=(list @ud) ~[2 3 5 7]\\n =/ skips=(list @ud) ~[4 2 4 2 4 6 2 6]\\n =/ lent-fixed=@ud (lent fixed)\\n =/ lent-skips=@ud (lent skips)\\n ::\\n |_ [current=@ud fixed-i=@ud skips-i=@ud]\\n :: +next: produce the next number and the new wheel state\\n ::\\n ++ next\\n |.\\n :: Exhaust the numbers in fixed. Then calculate successive values by\\n :: cycling through skips and increasing from the previous number by\\n :: the current skip-value.\\n ::\\n =/ fixed-done=? =(fixed-i lent-fixed)\\n =/ next-fixed-i ?:(fixed-done fixed-i +(fixed-i))\\n =/ next-skips-i ?:(fixed-done (mod +(skips-i) lent-skips) skips-i)\\n =/ next\\n ?. fixed-done\\n (snag fixed-i fixed)\\n (add current (snag skips-i skips))\\n :- next\\n +.$(current next, fixed-i next-fixed-i, skips-i next-skips-i)\\n --\\n--\\n\",\n \"language\": \"Hoon\"\n },\n {\n \"code\": \"/+ *rhonda\\n:- %say\\n|= [* [base=@ud many=@ud ~] ~]\\n:- %noun\\n(series base many)\\n\",\n \"language\": \"Hoon\"\n },\n {\n \"code\": \"|%\\n++ check\\n |= [n=@ud base=@ud]\\n :: if base is prime, automatic no\\n ::\\n ?: =((~(gut by (prime-map +(base))) base 0) 0)\\n %.n\\n :: if not multiply the digits and compare to base x sum of factors\\n ::\\n ?: =((roll (digits [base n]) mul) (mul base (roll (factor n) add)))\\n %.y\\n %.n\\n++ series\\n |= [base=@ud many=@ud]\\n =/ rhondas *(list @ud)\\n ?: =((~(gut by (prime-map +(base))) base 0) 0)\\n rhondas\\n =/ itr 1\\n |-\\n ?: =((lent rhondas) many)\\n (flop rhondas)\\n ?: =((check itr base) %.n)\\n $(itr +(itr))\\n $(rhondas [itr rhondas], itr +(itr))\\n:: digits: gives the list of digits of a number in a base\\n::\\n:: We strip digits least to most significant.\\n:: The least significant digit (lsd) of n in base b is just n mod b.\\n:: Subtract the lsd, divide by b, and repeat.\\n:: To know when to stop, we need to know how many digits there are.\\n++ digits\\n |= [base=@ud num=@ud]\\n ^- (list @ud)\\n |-\\n =/ modulus=@ud (mod num base)\\n ?: =((num-digits base num) 1)\\n ~[modulus]\\n [modulus $(num (div (sub num modulus) base))]\\n:: num-digits: gives the number of digits of a number in a base\\n::\\n:: Simple idea: k is the number of digits of n in base b if and\\n:: only if k is the smallest number such that b^k > n.\\n++ num-digits\\n |= [base=@ud num=@ud]\\n ^- @ud\\n =/ digits=@ud 1\\n |-\\n ?: (gth (pow base digits) num)\\n digits\\n $(digits +(digits))\\n:: factor: produce a list of prime factors\\n::\\n:: The idea is to identify \\\"small factors\\\" of n, i.e. prime factors less than\\n:: the square root. We then divide n by these factors to reduce the\\n:: magnitude of n. It's easy to argue that after this is done, we obtain 1\\n:: or the largest prime factor.\\n::\\n++ factor\\n |= n=@ud\\n ^- (list @ud)\\n ?: ?|(=(n 0) =(n 1))\\n ~[n]\\n =/ factorization *(list @ud)\\n :: produce primes less than or equal to root n\\n ::\\n =/ root (sqrt n)\\n =/ primes (prime-map +(root))\\n :: itr = iterate; we want to iterate through the primes less than root n\\n ::\\n =/ itr 2\\n |-\\n ?: =(itr +(root))\\n :: if n is now 1 we're done\\n ::\\n ?: =(n 1)\\n factorization\\n :: otherwise it's now the original n's largest primes factor\\n ::\\n [n factorization]\\n :: if itr not prime move on\\n ::\\n ?: =((~(gut by primes) itr 0) 1)\\n $(itr +(itr))\\n :: if it is prime, divide out by the highest power that divides num\\n ::\\n ?: =((mod n itr) 0)\\n $(n (div n itr), factorization [itr factorization])\\n :: once done, move to next prime\\n ::\\n $(itr +(itr))\\n:: sqrt: gives the integer square root of a number\\n::\\n:: It's based on an algorithm that predates the Greeks:\\n:: To find the square root of A, think of A as an area.\\n:: Guess the side of the square x. Compute the other side y = A/x.\\n:: If x is an over/underestimate then y is an under/overestimate.\\n:: So (x+y)/2 is the average of an over and underestimate, thus better than x.\\n:: Repeatedly doing x --> (x + A/x)/2 converges to sqrt(A).\\n::\\n:: This algorithm is the same but with integer valued operations.\\n:: The algorithm either converges to the integer square root and repeats,\\n:: or gets trapped in a two-cycle of adjacent integers.\\n:: In the latter case, the smaller number is the answer.\\n::\\n++ sqrt\\n |= n=@ud\\n =/ guess=@ud 1\\n |-\\n =/ new-guess (div (add guess (div n guess)) 2)\\n :: sequence stabilizes\\n ::\\n ?: =(guess new-guess)\\n guess\\n :: sequence is trapped in 2-cycle\\n ::\\n ?: =(guess +(new-guess))\\n new-guess\\n ?: =(new-guess +(guess))\\n guess\\n $(guess new-guess)\\n:: prime-map: (effectively) produces primes less than a given input\\n::\\n:: This is the sieve of Eratosthenes to produce primes less than n.\\n:: I used a map because it had much faster performance than a list.\\n:: Any key in the map is a non-prime. The value 1 indicates \\\"false.\\\"\\n:: I.e. it's not a prime.\\n++ prime-map\\n |= n=@ud\\n ^- (map @ud @ud)\\n =/ prime-map `(map @ud @ud)`(my ~[[0 1] [1 1]])\\n :: start sieving with 2\\n ::\\n =/ sieve 2\\n |-\\n :: if sieve is too large to be a factor we're done\\n ::\\n ?: (gte (mul sieve sieve) n)\\n prime-map\\n :: if not too large but not prime, move on\\n ::\\n ?: =((~(gut by prime-map) sieve 0) 1)\\n $(sieve +(sieve))\\n :: sequence: explanation\\n ::\\n :: If s is the sieve number, we start sieving multiples\\n :: of s at s^2 in sequence: s^2, s^2 + s, s^2 + 2s, ...\\n :: We start at s^2 because any number smaller than s^2\\n :: has prime factors less than s and would have been\\n :: eliminated earlier in the sieving process.\\n ::\\n =/ sequence (mul sieve sieve)\\n |-\\n :: done sieving with s once sequence is past n\\n ::\\n ?: (gte sequence n)\\n ^$(sieve +(sieve))\\n :: if sequence position is known not prime we move on\\n ::\\n ?: =((~(gut by prime-map) sequence 0) 1)\\n $(sequence (add sequence sieve))\\n :: otherwise we mark position of sequence as not prime and move on\\n ::\\n $(prime-map (~(put by prime-map) sequence 1), sequence (add sequence sieve))\\n--\\n\",\n \"language\": \"Hoon\"\n },\n {\n \"code\": \"tobase=: (a.{~;48 97(+ i.)each 10 26) {~ #.inv\\nisrhonda=: (*/@:(#.inv) = (* +/@q:))\\\"0\\n\\ntask=: {{\\n for_base.(#~ 0=1&p:) }.1+i.36 do.\\n k=.i.0\\n block=. 1+i.1e4\\n while. 15>#k do.\\n k=. k, block#~ base isrhonda block\\n block=. block+1e4\\n end.\\n echo ''\\n echo 'First 15 Rhondas in',b=.' base ',':',~\\\":base\\n echo 'In base 10: ',\\\":15{.k\\n echo 'In',;:inv b;base tobase each 15{.k\\n end.\\n}}\\n\\n task''\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class RhondaNumbers {\\n public static void main(String[] args) {\\n final int limit = 15;\\n for (int base = 2; base <= 36; ++base) {\\n if (isPrime(base))\\n continue;\\n System.out.printf(\\\"First %d Rhonda numbers to base %d:\\\\n\\\", limit, base);\\n int numbers[] = new int[limit];\\n for (int n = 1, count = 0; count < limit; ++n) {\\n if (isRhonda(base, n))\\n numbers[count++] = n;\\n }\\n System.out.printf(\\\"In base 10:\\\");\\n for (int i = 0; i < limit; ++i)\\n System.out.printf(\\\" %d\\\", numbers[i]);\\n System.out.printf(\\\"\\\\nIn base %d:\\\", base);\\n for (int i = 0; i < limit; ++i)\\n System.out.printf(\\\" %s\\\", Integer.toString(numbers[i], base));\\n System.out.printf(\\\"\\\\n\\\\n\\\");\\n }\\n }\\n\\n private static int digitProduct(int base, int n) {\\n int product = 1;\\n for (; n != 0; n /= base)\\n product *= n % base;\\n return product;\\n }\\n\\n private static int primeFactorSum(int n) {\\n int sum = 0;\\n for (; (n & 1) == 0; n >>= 1)\\n sum += 2;\\n for (int p = 3; p * p <= n; p += 2)\\n for (; n % p == 0; n /= p)\\n sum += p;\\n if (n > 1)\\n sum += n;\\n return sum;\\n }\\n\\n private static boolean isPrime(int n) {\\n if (n < 2)\\n return false;\\n if (n % 2 == 0)\\n return n == 2;\\n if (n % 3 == 0)\\n return n == 3;\\n for (int p = 5; p * p <= n; p += 4) {\\n if (n % p == 0)\\n return false;\\n p += 2;\\n if (n % p == 0)\\n return false;\\n }\\n return true;\\n }\\n\\n private static boolean isRhonda(int base, int n) {\\n return digitProduct(base, n) == base * primeFactorSum(n);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"def prod(s): reduce s as $_ (1; . * $_);\\n\\ndef sigma(s): reduce s as $_ (0; . + $_);\\n\\n# If s is a stream of JSON entities that does not include null, butlast(s) emits all but the last.\\ndef butlast(s):\\n label $out\\n | foreach (s,null) as $x ({};\\n if $x == null then break $out else .emit = .prev | .prev = $x end)\\n | select(.emit).emit;\\n\\ndef multiple(s):\\n first(foreach s as $x (0; .+1; select(. > 1))) // false;\\n\\n# Output: a stream of the prime factors of the input\\n# e.g.\\n# 2 | factors #=> 2\\n# 24 | factors #=> 2 2 2 3\\ndef factors:\\n . as $in\\n | [2, $in, false]\\n | recurse(\\n . as [$p, $q, $valid, $s]\\n | if $q == 1 then empty\\n elif $q % $p == 0 then [$p, $q/$p, true]\\n elif $p == 2 then [3, $q, false, $s]\\n else ($s // ($q | sqrt)) as $s\\n | if $p + 2 <= $s then [$p + 2, $q, false, $s]\\n else [$q, 1, true]\\n end\\n end )\\n | if .[2] then .[0] else empty end ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def lpad($len): tostring | ($len - length) as $l | (\\\" \\\" * $l)[:$l] + .;\\n\\ndef is_prime:\\n multiple(factors) | not;\\n\\ndef tobase($b):\\n def digit: \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"[.:.+1];\\n def mod: . % $b;\\n def div: ((. - mod) / $b);\\n def digits: recurse( select(. > 0) | div) | mod ;\\n # For jq it would be wise to protect against `infinite` as input, but using `isinfinite` confuses gojq\\n select( (tostring|test(\\\"^[0-9]+$\\\")) and 2 <= $b and $b <= 36)\\n | if . == 0 then \\\"0\\\"\\n else [digits | digit] | reverse[1:] | add\\n end;\\n\\n# emit the decimal values of the \\\"digits\\\"\\ndef digits($b):\\n def mod: . % $b;\\n def div: ((. - mod) / $b);\\n butlast(recurse( select(. > 0) | div) | mod) ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Emit a stream of Rhonda numbers in the given base\\ndef rhondas($b):\\n range(1; infinite) as $n\\n | ($n | [digits($b)]) as $digits\\n | select($digits|index(0)|not)\\n | select(($b != 10) or (($digits|index(5)) and ($digits | any(. % 2 == 0))))\\n | select(prod($digits[]) == ($b * sigma($n | factors)))\\n | $n ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def task($count):\\n range (2; 37) as $b\\n | select( $b | is_prime | not)\\n | [ limit($count; rhondas($b)) ]\\n | select(length > 0)\\n |\\\"First \\\\($count) Rhonda numbers in base \\\\($b):\\\",\\n ( (map(tostring)) as $rhonda2\\n | (map(tobase($b))) as $rhonda3\\n | (($rhonda2|map(length)) | max) as $maxLen2\\n | (($rhonda3|map(length)) | max) as $maxLen3\\n | ( ([$maxLen2, $maxLen3]|max) + 1) as $maxLen\\n | \\\"In base 10: \\\\($rhonda2 | map(lpad($maxLen)) | join(\\\" \\\") )\\\",\\n \\\"In base \\\\($b|lpad(2)): \\\\($rhonda3 | map(lpad($maxLen)) | join(\\\" \\\") )\\\",\\n \\\"\\\") ;\\n\\ntask(10)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Primes\\n\\nisRhonda(n, b) = prod(digits(n, base=b)) == b * sum([prod(pair) for pair in factor(n).pe])\\n\\nfunction displayrhondas(low, high, nshow)\\n for b in filter(!isprime, low:high)\\n n, rhondas = 1, Int[]\\n while length(rhondas) < nshow\\n isRhonda(n, b) && push!(rhondas, n)\\n n += 1\\n end\\n println(\\\"First $nshow Rhondas in base $b:\\\")\\n println(\\\"In base 10: \\\", rhondas)\\n println(\\\"In base $b: \\\", replace(string([string(i, base=b) for i in rhondas]), \\\"\\\\\\\"\\\" => \\\"\\\"), \\\"\\\\n\\\")\\n end\\nend\\n\\ndisplayrhondas(2, 16, 15)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"ClearAll[RhondaNumberQ]\\nRhondaNumberQ[b_Integer][n_Integer] := Module[{l, r},\\n l = Times @@ IntegerDigits[n, b];\\n r = Total[Catenate[ConstantArray @@@ FactorInteger[n]]];\\n l == b r\\n]\\nbases = Select[Range[2, 36], PrimeQ/*Not];\\nDo[\\n Print[\\\"base \\\", b, \\\":\\\", Take[Select[Range[700000], RhondaNumberQ[b]], UpTo[15]]];\\n ,\\n {b, bases}\\n]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import std/[sequtils, strformat, strutils]\\n\\ntype Base = 2..36\\n\\ntemplate isEven(n: int): bool = (n and 1) == 0\\n\\nfunc isPrime(n: Natural): bool =\\n ## Return true if \\\"n\\\" is prime.\\n if n < 2: return false\\n if n.isEven: return n == 2\\n if n mod 3 == 0: return n == 3\\n var d = 5\\n while d * d <= n:\\n if n mod d == 0: return false\\n inc d, 2\\n return true\\n\\nfunc digitProduct(n: Positive; base: Base): int =\\n ## Return the product of digits of \\\"n\\\" in given base.\\n var n = n.Natural\\n result = 1\\n while n != 0:\\n result *= n mod base\\n n = n div base\\n\\nfunc primeFactorSum(n: Positive): int =\\n ## Return the sum of prime factors of \\\"n\\\".\\n var n = n.Natural\\n while n.isEven:\\n inc result, 2\\n n = n shr 1\\n var d = 3\\n while d * d <= n:\\n while n mod d == 0:\\n inc result, d\\n n = n div d\\n inc d, 2\\n if n > 1: inc result, n\\n\\nfunc isRhondaNumber(n: Positive; base: Base): bool =\\n ## Return true if \\\"n\\\" is a Rhonda number to given base.\\n n.digitProduct(base) == base * n.primeFactorSum\\n\\nconst Digits = toSeq('0'..'9') & toSeq('a'..'z')\\n\\nfunc toBase(n: Positive; base: Base): string =\\n ## Return the string representation of \\\"n\\\" in given base.\\n var n = n.Natural\\n while true:\\n result.add Digits[n mod base]\\n n = n div base\\n if n == 0: break\\n # Reverse the digits.\\n for i in 1..(result.len shr 1):\\n swap result[i - 1], result[^i]\\n\\n\\nconst N = 10\\n\\nfor base in 2..36:\\n if base.isPrime: continue\\n echo &\\\"First {N} Rhonda numbers to base {base}:\\\"\\n var rhondaList: seq[Positive]\\n var n = 1\\n var count = 0\\n while count < N:\\n if n.isRhondaNumber(base):\\n rhondaList.add n\\n inc count\\n inc n\\n echo \\\"In base 10: \\\", rhondaList.join(\\\" \\\")\\n echo &\\\"In base {base}: \\\", rhondaList.mapIt(it.toBase(base)).join(\\\" \\\")\\n echo()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"isRhonda(n, b) =\\n{\\n local(mydigits, product, mysum, factors, pairProduct);\\n\\n mydigits = digits(n, b);\\n product = vecprod(mydigits);\\n factors = factor(n);\\n mysum= 0;\\n for(i = 1, matsize(factors)[1],\\n pairProduct = factors[i, 1] * factors[i, 2];\\n mysum += pairProduct;\\n );\\n product == b * mysum;\\n}\\n\\ndisplayrhondas(low, high, nshow) =\\n{\\n local(b, n, rhondas, count, basebRhondas);\\n for(b = low, high,\\n if(isprime(b), next);\\n n = 1; rhondas = [];\\n count = 0;\\n while(count < nshow,\\n if(isRhonda(n, b),\\n rhondas = concat(rhondas, n);\\n count++;\\n );\\n n++;\\n );\\n print(\\\"First \\\" nshow \\\" Rhondas in base \\\" b \\\":\\\");\\n print(\\\"In base 10: \\\" rhondas);\\n basebRhondas = vector(#rhondas, i, (digits(rhondas[i], b)));\\n print(\\\"In base \\\" b \\\": \\\" basebRhondas);\\n print(\\\"\\\\n\\\");\\n );\\n}\\n\\ndisplayrhondas(2, 16, 15);\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\nuse ntheory qw<is_prime factor vecsum vecprod todigitstring todigits>;\\n\\nsub rhonda {\\n my($b, $cnt) = @_;\\n my(@r,$n);\\n while (++$n) {\\n push @r, $n if ($b * vecsum factor($n)) == vecprod todigits($n,$b);\\n return @r if $cnt == @r;\\n }\\n}\\n\\nfor my $b (grep { ! is_prime $_ } 2..36) {\\n my @Rb = map { todigitstring($_,$b) } my @R = rhonda($b, 15);\\n say <<~EOT;\\n First 15 Rhonda numbers to base $b:\\n In base $b: @Rb\\n In base 10: @R\\n EOT\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">fmt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n First 15 Rhonda numbers in base %d:\\n In base 10: %s\\n In base %-2d: %s\\n\\n \\\"\\\"\\\"</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">digit</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #008000;\\\">'9'</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">'0'</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">'a'</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">base</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">36</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">is_prime</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">base</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">rhondab</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (base)</span>\\n <span style=\\\"color: #000000;\\\">rhondad</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (decimal)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rhondab</span><span style=\\\"color: #0000FF;\\\">)<</span><span style=\\\"color: #000000;\\\">15</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">digits</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%a\\\"</span><span style=\\\"color: #0000FF;\\\">,{{</span><span style=\\\"color: #000000;\\\">base</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">}})</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">'0'</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">digits</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">base</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">10</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">'5'</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">digits</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">apply</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">digits</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">even</span><span style=\\\"color: #0000FF;\\\">))!=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">))</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">pd</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">product</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">apply</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">digits</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">digit</span><span style=\\\"color: #0000FF;\\\">)),</span>\\n <span style=\\\"color: #000000;\\\">bs</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">base</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">prime_factors</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">pd</span><span style=\\\"color: #0000FF;\\\">==</span><span style=\\\"color: #000000;\\\">bs</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">decdig</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">max</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">decdig</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">digits</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">rhondab</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rhondab</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">pad_head</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">digits</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">rhondad</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rhondad</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">pad_head</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">decdig</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">base</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rhondad</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">base</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rhondab</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"use Prime::Factor;\\n\\nmy @factor-sum;\\n\\n@factor-sum[1000000] = 42; # Sink a large index to make access thread safe\\n\\nsub rhonda ($base) {\\n (1..∞).hyper.map: { $_ if $base * (@factor-sum[$_] //= .&prime-factors.sum) == [×] .polymod($base xx *) }\\n}\\n\\nfor (flat 2..16, 17..36).grep: { !.&is-prime } -> $b {\\n put \\\"\\\\nFirst 15 Rhonda numbers to base $b:\\\";\\n my @rhonda = rhonda($b)[^15];\\n my $ch = @rhonda[*-1].chars max @rhonda[*-1].base($b).chars;\\n put \\\"In base 10: \\\" ~ @rhonda».fmt(\\\"%{$ch}s\\\").join: ', ';\\n put $b.fmt(\\\"In base %2d: \\\") ~ @rhonda».base($b)».fmt(\\\"%{$ch}s\\\").join: ', ';\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"// [dependencies]\\n// radix_fmt = \\\"1.0\\\"\\n\\nfn digit_product(base: u32, mut n: u32) -> u32 {\\n let mut product = 1;\\n while n != 0 {\\n product *= n % base;\\n n /= base;\\n }\\n product\\n}\\n\\nfn prime_factor_sum(mut n: u32) -> u32 {\\n let mut sum = 0;\\n while (n & 1) == 0 {\\n sum += 2;\\n n >>= 1;\\n }\\n let mut p = 3;\\n while p * p <= n {\\n while n % p == 0 {\\n sum += p;\\n n /= p;\\n }\\n p += 2;\\n }\\n if n > 1 {\\n sum += n;\\n }\\n sum\\n}\\n\\nfn is_prime(n: u32) -> bool {\\n if n < 2 {\\n return false;\\n }\\n if n % 2 == 0 {\\n return n == 2;\\n }\\n if n % 3 == 0 {\\n return n == 3;\\n }\\n let mut p = 5;\\n while p * p <= n {\\n if n % p == 0 {\\n return false;\\n }\\n p += 2;\\n if n % p == 0 {\\n return false;\\n }\\n p += 4;\\n }\\n true\\n}\\n\\nfn is_rhonda(base: u32, n: u32) -> bool {\\n digit_product(base, n) == base * prime_factor_sum(n)\\n}\\n\\nfn main() {\\n let limit = 15;\\n for base in 2..=36 {\\n if is_prime(base) {\\n continue;\\n }\\n println!(\\\"First {} Rhonda numbers to base {}:\\\", limit, base);\\n let numbers: Vec<u32> = (1..).filter(|x| is_rhonda(base, *x)).take(limit).collect();\\n print!(\\\"In base 10:\\\");\\n for n in &numbers {\\n print!(\\\" {}\\\", n);\\n }\\n print!(\\\"\\\\nIn base {}:\\\", base);\\n for n in &numbers {\\n print!(\\\" {}\\\", radix_fmt::radix(*n, base as u8));\\n }\\n print!(\\\"\\\\n\\\\n\\\");\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"func is_rhonda_number(n, base = 10) {\\n base.is_composite || return false\\n n > 0 || return false\\n n.digits(base).prod == base*n.factor.sum\\n}\\n\\nfor b in (2..16 -> grep { .is_composite }) {\\n say (\\\"First 10 Rhonda numbers to base #{b}: \\\",\\n 10.by { is_rhonda_number(_, b) })\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"func digitProduct(base: Int, num: Int) -> Int {\\n var product = 1\\n var n = num\\n while n != 0 {\\n product *= n % base\\n n /= base\\n }\\n return product\\n}\\n\\nfunc primeFactorSum(_ num: Int) -> Int {\\n var sum = 0\\n var n = num\\n while (n & 1) == 0 {\\n sum += 2\\n n >>= 1\\n }\\n var p = 3\\n while p * p <= n {\\n while n % p == 0 {\\n sum += p\\n n /= p\\n }\\n p += 2\\n }\\n if n > 1 {\\n sum += n\\n }\\n return sum\\n}\\n\\nfunc isPrime(_ n: Int) -> Bool {\\n if n < 2 {\\n return false\\n }\\n if n % 2 == 0 {\\n return n == 2\\n }\\n if n % 3 == 0 {\\n return n == 3\\n }\\n var p = 5\\n while p * p <= n {\\n if n % p == 0 {\\n return false\\n }\\n p += 2\\n if n % p == 0 {\\n return false\\n }\\n p += 4\\n }\\n return true\\n}\\n\\nfunc isRhonda(base: Int, num: Int) -> Bool {\\n return digitProduct(base: base, num: num) == base * primeFactorSum(num)\\n}\\n\\nlet limit = 15\\nfor base in 2...36 {\\n if isPrime(base) {\\n continue\\n }\\n print(\\\"First \\\\(limit) Rhonda numbers to base \\\\(base):\\\")\\n let numbers = Array((1...).lazy.filter{ isRhonda(base: base, num: $0) }.prefix(limit))\\n print(\\\"In base 10:\\\", terminator: \\\"\\\")\\n for n in numbers {\\n print(\\\" \\\\(n)\\\", terminator: \\\"\\\")\\n }\\n print(\\\"\\\\nIn base \\\\(base):\\\", terminator: \\\"\\\")\\n for n in numbers {\\n print(\\\" \\\\(String(n, radix: base))\\\", terminator: \\\"\\\")\\n }\\n print(\\\"\\\\n\\\")\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"import \\\"./math\\\" for Math, Int, Nums\\nimport \\\"./fmt\\\" for Fmt, Conv\\n\\nfor (b in 2..36) {\\n if (Int.isPrime(b)) continue\\n var count = 0\\n var rhonda = []\\n var n = 1\\n while (count < 15) {\\n var digits = Int.digits(n, b)\\n if (!digits.contains(0)) {\\n if (b != 10 || (digits.contains(5) && digits.any { |d| d % 2 == 0 })) {\\n var calc1 = Nums.prod(digits)\\n var calc2 = b * Nums.sum(Int.primeFactors(n))\\n if (calc1 == calc2) {\\n rhonda.add(n)\\n count = count + 1\\n }\\n }\\n }\\n n = n + 1\\n }\\n if (rhonda.count > 0) {\\n System.print(\\\"\\\\nFirst 15 Rhonda numbers in base %(b):\\\")\\n var rhonda2 = rhonda.map { |r| r.toString }.toList\\n var rhonda3 = rhonda.map { |r| Conv.Itoa(r, b) }.toList\\n var maxLen2 = Nums.max(rhonda2.map { |r| r.count })\\n var maxLen3 = Nums.max(rhonda3.map { |r| r.count })\\n var maxLen = Math.max(maxLen2, maxLen3) + 1\\n Fmt.print(\\\"In base 10: $*s\\\", maxLen, rhonda2)\\n Fmt.print(\\\"In base $-2d: $*s\\\", b, maxLen, rhonda3)\\n }\\n}\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Rhonda-numbers"}}},{"rowIdx":1586,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Rock-paper-scissors\nnote: Games\n","language":"00-META"},{"code":";Task:\nImplement the classic children's game [[wp:Rock-paper-scissors|Rock-paper-scissors]], as well as a simple predictive '''AI''' (<u>a</u>rtificial <u>i</u>ntelligence) player.\n\nRock Paper Scissors is a two player game. \n\nEach player chooses one of rock, paper or scissors, without knowing the other player's choice. \n\nThe winner is decided by a set of rules:\n\n:::* Rock beats scissors\n:::* Scissors beat paper\n:::* Paper beats rock\n\n<br>\nIf both players choose the same thing, there is no winner for that round.\n\nFor this task, the computer will be one of the players. \n\nThe operator will select Rock, Paper or Scissors and the computer will keep a record of the choice frequency, and use that information to make a [[Probabilistic choice|weighted random choice]] in an attempt to defeat its opponent.\n\n\n;Extra credit:\nSupport additional choices [[wp:Rock-paper-scissors#Additional_weapons|additional weapons]].\n<br><br>\n\n","language":"00-TASK"},{"code":"V rules = [‘rock’ = ‘paper’, ‘scissors’ = ‘rock’, ‘paper’ = ‘scissors’]\nV previous = [‘rock’, ‘paper’, ‘scissors’]\n\nL\n V human = input(\"\\nchoose your weapon: \")\n V computer = rules[random:choice(previous)]\n\n I human C (‘quit’, ‘exit’)\n L.break\n\n E I human C rules\n previous.append(human)\n print(‘the computer played ’computer, end' ‘; ’)\n\n I rules[computer] == human\n print(‘yay you win!’)\n E I rules[human] == computer\n print(‘the computer beat you... :(’)\n E\n print(‘it's a tie!’)\n\n E\n print(‘that's not a valid choice’)\n","language":"11l"},{"code":"with Ada.Text_IO; with Ada.Numerics.Float_Random;\n\nprocedure Rock_Paper_Scissors is\n\n package Rand renames Ada.Numerics.Float_Random;\n Gen: Rand.Generator;\n\n type Choice is (Rock, Paper, Scissors);\n\n Cnt: array (Choice) of Natural := (1, 1, 1);\n -- for the initialization: pretend that each of Rock, Paper,\n -- and Scissors, has been played once by the human\n -- else the first computer choice would be deterministic\n\n function Computer_Choice return Choice is\n Random_Number: Natural :=\n Integer(Rand.Random(Gen)\n * (Float(Cnt(Rock)) + Float(Cnt(Paper)) + Float(Cnt(Scissors))));\n begin\n if Random_Number < Cnt(Rock) then\n -- guess the human will choose Rock\n return Paper;\n elsif Random_Number - Cnt(Rock) < Cnt(Paper) then\n -- guess the human will choose Paper\n return Scissors;\n else -- guess the human will choose Scissors\n return Rock;\n end if;\n end Computer_Choice;\n\n Finish_The_Game: exception;\n\n function Human_Choice return Choice is\n Done: Boolean := False;\n T: constant String\n := \"enter \"\"r\"\" for Rock, \"\"p\"\" for Paper, or \"\"s\"\" for Scissors\"\"!\";\n U: constant String\n := \"or enter \"\"q\"\" to Quit the game\";\n Result: Choice;\n begin\n Ada.Text_IO.Put_Line(T);\n Ada.Text_IO.Put_Line(U);\n while not Done loop\n Done := True;\n declare\n S: String := Ada.Text_IO.Get_Line;\n begin\n if S=\"r\" or S=\"R\" then\n Result := Rock;\n elsif S=\"p\" or S = \"P\" then\n Result := Paper;\n elsif S=\"s\" or S=\"S\" then\n Result := Scissors;\n elsif S=\"q\" or S=\"Q\" then\n raise Finish_The_Game;\n else\n Done := False;\n end if;\n end;\n end loop;\n return Result;\n end Human_Choice;\n\n type Result is (Human_Wins, Draw, Computer_Wins);\n\n function \"<\" (X, Y: Choice) return Boolean is\n -- X < Y if X looses against Y\n begin\n case X is\n when Rock => return (Y = Paper);\n when Paper => return (Y = Scissors);\n when Scissors => return (Y = Rock);\n end case;\n end \"<\";\n\n Score: array(Result) of Natural := (0, 0, 0);\n\n C,H: Choice;\n\n Res: Result;\n\nbegin\n -- play the game\n loop\n C := Computer_Choice; -- the computer makes its choice first\n H := Human_Choice; -- now ask the player for his/her choice\n Cnt(H) := Cnt(H) + 1; -- update the counts for the AI\n if C < H then\n Res := Human_Wins;\n elsif H < C then\n Res := Computer_Wins;\n else\n Res := Draw;\n end if;\n Ada.Text_IO.Put_Line(\"COMPUTER'S CHOICE: \" & Choice'Image(C)\n & \" RESULT: \" & Result'Image(Res));\n Ada.Text_IO.New_Line;\n Score(Res) := Score(Res) + 1;\n end loop;\n\nexception\n when Finish_The_Game =>\n Ada.Text_IO.New_Line;\n for R in Score'Range loop\n Ada.Text_IO.Put_Line(Result'Image(R) & Natural'Image(Score(R)));\n end loop;\nend Rock_Paper_Scissors;\n","language":"Ada"},{"code":"text\ncomputer_play(record plays, record beats)\n{\n integer a, c, total;\n text s;\n\n total = plays[\"rock\"] + plays[\"paper\"] + plays[\"scissors\"];\n a = drand(total - 1);\n for (s, c in plays) {\n if (a < c) {\n break;\n }\n a -= c;\n }\n\n beats[s];\n}\n\ninteger\nmain(void)\n{\n integer computer, human;\n record beats, plays;\n file f;\n text s;\n\n computer = human = 0;\n\n f.stdin;\n\n beats[\"rock\"] = \"paper\";\n beats[\"paper\"] = \"scissors\";\n beats[\"scissors\"] = \"rock\";\n\n plays[\"rock\"] = 1;\n plays[\"paper\"] = 1;\n plays[\"scissors\"] = 1;\n\n while (1) {\n o_text(\"Your choice [rock/paper/scissors]:\\n\");\n if (f.line(s) == -1) {\n break;\n }\n\n if (!plays.key(s)) {\n o_text(\"Invalid choice, try again\\n\");\n } else {\n text c;\n\n c = computer_play(plays, beats);\n\n o_form(\"Human: ~, Computer: ~\\n\", s, c);\n\n if (s == c) {\n o_text(\"Draw\\n\");\n } elif (c == beats[s]) {\n computer += 1;\n o_text(\"Computer wins\\n\");\n } else {\n human += 1;\n o_text(\"Human wins\\n\");\n }\n\n plays.up(s);\n\n o_form(\"Score: Human: ~, Computer: ~\\n\", human, computer);\n }\n }\n\n return 0;\n}\n","language":"Aime"},{"code":"BEGIN\n # rock/paper/scissors game #\n # counts of the number of times the player has chosen each move #\n # we initialise each to 1 so that the total isn't zero when we are #\n # choosing the computer's first move (as in the Ada version) #\n INT r count := 1;\n INT p count := 1;\n INT s count := 1;\n # counts of how many games the player and computer have won #\n INT player count := 0;\n INT computer count := 0;\n print( ( \"rock/paper/scissors\", newline, newline ) );\n WHILE\n CHAR player move;\n # get the players move - r => rock, p => paper, s => scissors #\n # q => quit #\n WHILE\n print( ( \"Please enter your move (r/p/s) or q to quit: \" ) );\n read( ( player move, newline ) );\n ( player move /= \"r\"\n AND player move /= \"p\"\n AND player move /= \"s\"\n AND player move /= \"q\"\n )\n DO\n print( ( \"Unrecognised move\", newline ) )\n OD;\n # continue playing until the player chooses quit #\n player move /= \"q\"\n DO\n # decide the computer's move based on the player's history #\n CHAR computer move;\n INT move count = r count + p count + s count;\n # predict player will play rock if the random number #\n # is in the range 0 .. rock / total #\n # predict player will play paper if the random number #\n # is in the range rock / total .. ( rock + paper ) / total #\n # predict player will play scissors otherwise #\n REAL r limit = r count / move count;\n REAL p limit = r limit + ( p count / move count );\n REAL random move = next random;\n IF random move < r limit THEN\n # we predict the player will choose rock - we choose paper #\n computer move := \"p\"\n ELIF random move < p limit THEN\n # we predict the player will choose paper - we choose scissors #\n computer move := \"s\"\n ELSE\n # we predict the player will choose scissors - we choose rock #\n computer move := \"r\"\n FI;\n print( ( \"You chose: \" + player move, newline ) );\n print( ( \"I chose: \" + computer move, newline ) );\n IF player move = computer move THEN\n # both players chose the same - draw #\n print( ( \"We draw\", newline ) )\n ELSE\n # players chose different moves - there is a winner #\n IF ( player move = \"r\" AND computer move = \"s\" )\n OR ( player move = \"p\" AND computer move = \"r\" )\n OR ( player move = \"s\" AND computer move = \"p\" )\n THEN\n player count +:= 1;\n print( ( \"You win\", newline ) )\n ELSE\n computer count +:= 1;\n print( ( \"I win\", newline ) )\n FI;\n print( ( \"You won: \"\n , whole( player count , 0 )\n , \", I won: \"\n , whole( computer count, 0 )\n , newline\n )\n )\n FI;\n IF player move = \"r\" THEN\n # player chose rock #\n r count +:= 1\n ELIF player move = \"p\" THEN\n # player chose paper #\n p count +:= 1\n ELSE\n # player chose scissors #\n s count +:= 1\n FI\n OD;\n print( ( \"Thanks for a most enjoyable game\", newline ) )\nEND\n","language":"ALGOL-68"},{"code":"DllCall(\"AllocConsole\")\nWrite(\"Welcome to Rock-Paper-Scissors`nMake a choice: \")\n\ncR := cP := cS := 0 ; user choice count\nuserChoice := Read()\nWrite(\"My choice: \" . cpuChoice := MakeChoice(1, 1, 1))\n\nLoop\n{\n\tWrite(DecideWinner(userChoice, cpuChoice) . \"`nMake A Choice: \")\n\tcR += SubStr(userChoice, 1, 1) = \"r\", cP += InStr(userChoice, \"P\"), cS += InStr(userChoice, \"S\")\n\tuserChoice := Read()\n\tWrite(\"My Choice: \" . cpuChoice := MakeChoice(cR, cP, cS))\n}\n\nMakeChoice(cR, cP, cS){\n\t; parameters are number of times user has chosen each item\n\ttotal := cR + cP + cS\n\t\n\tRandom, rand, 0.0, 1.0\n\tif (rand >= 0 and rand <= cR / total)\n\t\treturn \"Paper\"\n\telse if (rand > cR / total and rand <= (cR + cP) / total)\n\t\treturn \"Scissors\"\n\telse\n\t\treturn \"Rock\"\n}\n\nDecideWinner(user, cpu){\n\tuser := SubStr(user, 1, 1), cpu := SubStr(cpu, 1, 1)\n\tif (user = cpu)\n\t\treturn \"`nTie!\"\n\telse if (user = \"r\" and cpu = \"s\") or (user = \"p\" and cpu = \"r\") or (user = \"s\" and cpu = \"p\")\n\t\treturn \"`nYou Win!\"\n\telse\n\t\treturn \"`nI Win!\"\n}\n\nRead(){\n\tFileReadLine, a, CONIN$, 1\n\treturn a\n}\nWrite(txt){\n\tFileAppend, % txt, CONOUT$\n}\n","language":"AutoHotkey"},{"code":"RPS()\n\nFunc RPS()\n\tLocal $ai_Played_games[4]\n\t$ai_Played_games[0] = 3\n\tFor $I = 1 To 3\n\t\t$ai_Played_games[$I] = 1\n\tNext\n\t$RPS = GUICreate(\"Rock Paper Scissors\", 338, 108, 292, 248)\n\t$Rock = GUICtrlCreateButton(\"Rock\", 8, 8, 113, 25, 131072)\n\t$Paper = GUICtrlCreateButton(\"Paper\", 8, 40, 113, 25, 131072)\n\t$Scissors = GUICtrlCreateButton(\"Scissors\", 8, 72, 113, 25, 131072)\n\t$Label1 = GUICtrlCreateLabel(\"W:\", 136, 8, 18, 17)\n\t$Wins = GUICtrlCreateLabel(\"0\", 160, 8, 36, 17)\n\t$Label3 = GUICtrlCreateLabel(\"L:\", 208, 8, 13, 17)\n\t$Looses = GUICtrlCreateLabel(\"0\", 224, 8, 36, 17)\n\t$Label5 = GUICtrlCreateLabel(\"D:\", 272, 8, 15, 17)\n\t$Deuce = GUICtrlCreateLabel(\"0\", 296, 8, 36, 17)\n\t$Displaybutton = GUICtrlCreateButton(\"\", 136, 48, 193, 49, 131072)\n\tGUICtrlSetState($ai_Played_games, 128)\n\tGUISetState(@SW_SHOW)\n\tWhile 1\n\t\t$nMsg = GUIGetMsg()\n\t\tSwitch $nMsg\n\t\t\tCase -3\n\t\t\t\tExit\n\t\t\tCase $Rock\n\t\t\t\t$Ret = _RPS_Eval(1, $ai_Played_games)\n\t\t\t\tGUICtrlSetData($Displaybutton, $Ret)\n\t\t\t\tIf $Ret = \"Deuce\" Then\n\t\t\t\t\tGUICtrlSetData($Deuce, Guictrlread($Deuce)+1)\n\t\t\t\tElseif $Ret = \"You Loose\" Then\n\t\t\t\t\tGUICtrlSetData($Looses, Guictrlread($Looses)+1)\n\t\t\t\tElseif $Ret = \"You Win\" Then\n\t\t\t\t\tGUICtrlSetData($Wins, Guictrlread($Wins)+1)\n\t\t\t\tEndIf\n\t\t\tCase $Paper\n\t\t\t\t$Ret = _RPS_Eval(2, $ai_Played_games)\n\t\t\t\tGUICtrlSetData($Displaybutton, $Ret)\n\t\t\t\tIf $Ret = \"Deuce\" Then\n\t\t\t\t\tGUICtrlSetData($Deuce, Guictrlread($Deuce)+1)\n\t\t\t\tElseif $Ret = \"You Loose\" Then\n\t\t\t\t\tGUICtrlSetData($Looses, Guictrlread($Looses)+1)\n\t\t\t\tElseif $Ret = \"You Win\" Then\n\t\t\t\t\tGUICtrlSetData($Wins, Guictrlread($Wins)+1)\n\t\t\t\tEndIf\n\t\t\tCase $Scissors\n\t\t\t\t$Ret = _RPS_Eval(3, $ai_Played_games)\n\t\t\t\tGUICtrlSetData($Displaybutton, $Ret)\n\t\t\t\tIf $Ret = \"Deuce\" Then\n\t\t\t\t\tGUICtrlSetData($Deuce, Guictrlread($Deuce)+1)\n\t\t\t\tElseif $Ret = \"You Loose\" Then\n\t\t\t\t\tGUICtrlSetData($Looses, Guictrlread($Looses)+1)\n\t\t\t\tElseif $Ret = \"You Win\" Then\n\t\t\t\t\tGUICtrlSetData($Wins, Guictrlread($Wins)+1)\n\t\t\t\tEndIf\n\t\tEndSwitch\n\tWEnd\n\nEndFunc ;==>RPS\n\nFunc _RPS_Eval($i_Player_Choose, $ai_Played_games)\n\tLocal $i_choice = 1\n\t$i_rnd = Random(1, 1000, 1)\n\t$i_choose_1 = ($ai_Played_games[1] / $ai_Played_games[0] * 1000)\n\t$i_choose_2 = ($ai_Played_games[2] / $ai_Played_games[0] * 1000)\n\t$i_choose_3 = ($ai_Played_games[3] / $ai_Played_games[0] * 1000)\n\tIf $i_rnd < $i_choose_1 Then\n\t\t$i_choice = 2\n\tElseIf $i_rnd < $i_choose_1 + $i_choose_2 And $i_rnd > $i_choose_1 Then\n\t\t$i_choice = 3\n\tElseIf $i_rnd < $i_choose_1 + $i_choose_2 + $i_choose_3 And $i_rnd > $i_choose_1 + $i_choose_2 Then\n\t\t$i_choice = 1\n\tEndIf\n\t$ai_Played_games[0] += 1\n\tIf $i_Player_Choose = 1 Then\n\t\t$ai_Played_games[1] += 1\n\t\tIf $i_choice = 1 Then Return \"Deuce\"\n\t\tIf $i_choice = 2 Then Return \"You Loose\"\n\t\tIf $i_choice = 3 Then Return \"You Win\"\n\tElseIf $i_Player_Choose = 2 Then\n\t\t$ai_Played_games[2] += 1\n\t\tIf $i_choice = 2 Then Return \"Deuce\"\n\t\tIf $i_choice = 3 Then Return \"You Loose\"\n\t\tIf $i_choice = 1 Then Return \"You Win\"\n\tElseIf $i_Player_Choose = 3 Then\n\t\t$ai_Played_games[3] += 1\n\t\tIf $i_choice = 3 Then Return \"Deuce\"\n\t\tIf $i_choice = 1 Then Return \"You Loose\"\n\t\tIf $i_choice = 2 Then Return \"You Win\"\n\tEndIf\nEndFunc ;==>_RPS_Eval\n","language":"AutoIt"},{"code":"DIM pPLchoice(1 TO 3) AS INTEGER, pCMchoice(1 TO 3) AS INTEGER\nDIM choices(1 TO 3) AS STRING\nDIM playerwins(1 TO 3) AS INTEGER\nDIM playerchoice AS INTEGER, compchoice AS INTEGER\nDIM playerwon AS INTEGER, compwon AS INTEGER, tie AS INTEGER\nDIM tmp AS INTEGER\n\n' Do it this way for QBasic; FreeBASIC supports direct array assignment.\nDATA \"rock\", \"paper\", \"scissors\"\nFOR tmp = 1 to 3\n READ choices(tmp)\nNEXT\nDATA 3, 1, 2\nFOR tmp = 1 to 3\n READ playerwins(tmp)\nNEXT\n\nRANDOMIZE TIMER\n\nDO\n ' Computer chooses first to ensure there's no \"cheating\".\n compchoice = INT(RND * (pPLchoice(1) + pPLchoice(2) + pPLchoice(3) + 3))\n SELECT CASE compchoice\n CASE 0 to (pPLchoice(1))\n ' Player past choice: rock; choose paper.\n compchoice = 2\n CASE (pPLchoice(1) + 1) TO (pPLchoice(1) + pPLchoice(2) + 1)\n ' Player past choice: paper; choose scissors.\n compchoice = 3\n CASE (pPLchoice(1) + pPLchoice(2) + 2) TO (pPLchoice(1) + pPLchoice(2) + pPLchoice(3) + 2)\n ' Player past choice: scissors; choose rock.\n compchoice = 1\n END SELECT\n\n PRINT \"Rock, paper, or scissors \";\n DO\n PRINT \"[1 = rock, 2 = paper, 3 = scissors, 0 to quit]\";\n INPUT playerchoice\n LOOP WHILE (playerchoice < 0) OR (playerchoice > 3)\n\n IF 0 = playerchoice THEN EXIT DO\n\n pCMchoice(compchoice) = pCMchoice(compchoice) + 1\n pPLchoice(playerchoice) = pPLchoice(playerchoice) + 1\n PRINT \"You chose \"; choices(playerchoice); \" and I chose \"; choices(compchoice); \". \";\n IF (playerchoice) = compchoice THEN\n PRINT \"Tie!\"\n tie = tie + 1\n ELSEIF (compchoice) = playerwins(playerchoice) THEN\n PRINT \"You won!\"\n playerwon = playerwon + 1\n ELSE\n PRINT \"I won!\"\n compwon = compwon + 1\n END IF\nLOOP\n\nPRINT \"Some useless statistics:\"\nPRINT \"You won \"; STR$(playerwon); \" times, and I won \"; STR$(compwon); \" times; \"; STR$(tie); \" ties.\"\nPRINT , choices(1), choices(2), choices(3)\nPRINT \"You chose:\", pPLchoice(1), pPLchoice(2), pPLchoice(3)\nPRINT \" I chose:\", pCMchoice(1), pCMchoice(2), pCMchoice(3)\n","language":"BASIC"},{"code":"@echo off\nsetlocal enabledelayedexpansion\n\nset choice1=rock\nset choice2=paper\nset choice3=scissors\nset freq1=0\nset freq2=0\nset freq3=0\nset games=0\nset won=0\nset lost=0\nset tie=0\n\n:start\ncls\necho Games - %games% : Won - %won% : Lost - %lost% : Ties - %tie%\nchoice /c RPS /n /m \"[R]ock, [P]aper or [S]cissors? \"\n\nset choice=%errorlevel%\nrem used [1,1000] as interval for random\nif %games% equ 0 (\n rem at the beginning, there's no bias for each choice\n set /a \"rocklimit=1000 / 3\"\n set /a \"scissorslimit=1000 * 2 / 3\"\n) else (\n set /a \"rocklimit=1000 * %freq3% / %games%\"\n set /a \"scissorslimit=1000 * (%freq1% + %freq3%) / %games%\"\n)\nset /a \"randchoice=%random% %% 1000 + 1\"\nset compchoice=2\nif %randchoice% geq %scissorslimit% set compchoice=3\nif %randchoice% leq %rocklimit% set compchoice=1\n\ncls\necho Player: !choice%choice%! ^|vs^| Computer: !choice%compchoice%!\ngoto %compchoice%\n\n:1\nif %choice%==1 goto tie\nif %choice%==2 goto win\nif %choice%==3 goto loss\n\n:2\nif %choice%==1 goto loss\nif %choice%==2 goto tie\nif %choice%==3 goto win\n\n:3\nif %choice%==1 goto win\nif %choice%==2 goto loss\nif %choice%==3 goto tie\n\n:win\nset /a \"won+=1\"\necho Player wins^!\ngoto end\n\n:loss\nset /a \"lost+=1\"\necho Computer Wins^!\ngoto end\n\n:tie\nset /a \"tie+=1\"\necho Tie^!\ngoto end\n\n:end\nset /a \"games+=1\"\nset /a \"freq%choice%+=1\"\npause\ngoto start\n","language":"Batch-File"},{"code":"PRINT\"Welcome to the game of rock-paper-scissors\"\nPRINT \"Each player guesses one of these three, and reveals it at the same time.\"\nPRINT \"Rock blunts scissors, which cut paper, which wraps stone.\"\nPRINT \"If both players choose the same, it is a draw!\"\nPRINT \"When you've had enough, choose Q.\"\nDIM rps%(2),g$(3)\ng$()=\"rock\",\"paper\",\"scissors\"\ntotal%=0\ndraw%=0\npwin%=0\ncwin%=0\nc%=RND(3)\nPRINT\"What is your move (press R, P, or S)?\"\nREPEAT\n REPEAT q$=GET$ UNTIL INSTR(\"RPSrpsQq\",q$)>0\n g%=(INSTR(\"RrPpSsQq\",q$)-1) DIV 2\n IF g%>2 THEN PROCsummarise:END\n total%+=1\n rps%(g%)+=1\n PRINT\"You chose \";g$(g%);\" and I chose \";g$(c%);\n CASE g%-c% OF\n WHEN 0:\n PRINT \". It's a draw\"\n draw%+=1\n WHEN 1,-2:\n PRINT \". You win!\"\n pwin%+=1\n WHEN -1,2:\n PRINT \". I win!\"\n cwin%+=1\n ENDCASE\n c%=FNmove(rps%(),total%)\nUNTIL FALSE\nEND\n:\nDEFPROCsummarise\nPRINT \"You won \";pwin%;\", and I won \";cwin%;\". There were \";draw%;\" draws\"\nPRINT \"Thanks for playing!\"\nENDPROC\n:\nDEFFNmove(p%(),t%)\nLOCAL r%\nr%=RND(total%)\nIF r%<=p%(0) THEN =1\nIF r%<=p%(0)+p%(1) THEN =2\n=0\n","language":"BBC-BASIC"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#define LEN 3\n\n/* pick a random index from 0 to n-1, according to probablities listed\n in p[] which is assumed to have a sum of 1. The values in the probablity\n list matters up to the point where the sum goes over 1 */\nint rand_idx(double *p, int n)\n{\n\tdouble s = rand() / (RAND_MAX + 1.0);\n\tint i;\n\tfor (i = 0; i < n - 1 && (s -= p[i]) >= 0; i++);\n\treturn i;\n}\n\nint main()\n{\n\tint user_action, my_action;\n\tint user_rec[] = {0, 0, 0};\n\tconst char *names[] = { \"Rock\", \"Paper\", \"Scissors\" };\n\tchar str[2];\n\tconst char *winner[] = { \"We tied.\", \"Meself winned.\", \"You win.\" };\n\tdouble p[LEN] = { 1./3, 1./3, 1./3 };\n\n\twhile (1) {\n\t\tmy_action = rand_idx(p,LEN);\n\n\t\tprintf(\"\\nYour choice [1-3]:\\n\"\n\t\t\t\" 1. Rock\\n 2. Paper\\n 3. Scissors\\n> \");\n\n\t\t/* scanf is a terrible way to do input. should use stty and keystrokes */\n\t\tif (!scanf(\"%d\", &user_action)) {\n\t\t\tscanf(\"%1s\", str);\n\t\t\tif (*str == 'q') {\n\t\t\t\tprintf(\"Your choices [rock : %d , paper : %d , scissors %d] \",user_rec[0],user_rec[1], user_rec[2]);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tuser_action --;\n\t\tif (user_action > 2 || user_action < 0) {\n\t\t\tprintf(\"invalid choice; again\\n\");\n\t\t\tcontinue;\n\t\t}\n\t\tprintf(\"You chose %s; I chose %s. %s\\n\",\n\t\t\tnames[user_action], names[my_action],\n\t\t\twinner[(my_action - user_action + 3) % 3]);\n\n\t\tuser_rec[user_action]++;\n\t}\n}\n","language":"C"},{"code":"#include <stdio.h> // Standard IO\n#include <stdlib.h> // other stuff\n#include <time.h>\n#include <string.h>\n\n//This should add weighted random function to \"The Elite Noob\"'s code, stolen from above code because it does calculation so well\n//closest I could make it to original but without pointless attempt to make code look smaller than above code by putting code on the same lines\n\nint rand_i(int n)\n{\n\tint rand_max = RAND_MAX - (RAND_MAX % n);\n\tint ret;\n\twhile ((ret = rand()) >= rand_max);\n\treturn ret/(rand_max / n);\n}\n\nint weighed_rand(int *tbl, int len)\n{\n\tint i, sum, r;\n\tfor (i = 0, sum = 0; i < len; sum += tbl[i++]);\n\tif (!sum) return rand_i(len);\n\n\tr = rand_i(sum) + 1;\n\tfor (i = 0; i < len && (r -= tbl[i]) > 0; i++);\n\treturn i;\n}\n\n\n\nint main(int argc, const char *argv[])\n{\n\tchar umove[10], cmove[10], line[255];\n\tint user, comp;\n\tint tbl[]={0,0,0};\n\tint tbllen=3;\n\tprintf(\"Hello, Welcome to rock-paper-scissors\\nBy The Elite Noob\\n\");\nmainloop:\n\twhile(1)\n\t{ // infinite loop :)\n\t\tprintf(\"\\n\\nPlease type in 1 for Rock, 2 For Paper, 3 for Scissors, 4 to quit\\n\");\n\t\tsrand(time(NULL));\n\t\tcomp = (weighed_rand(tbl, tbllen) + 1) % 3;\n\t\tfgets(line, sizeof(line), stdin);\t\n\t\twhile(sscanf(line, \"%d\", &user) != 1) //1 match of defined specifier on input line\n\t\t{\n \t\t\tprintf(\"You have not entered an integer.\\n\");\n\t\t\tfgets(line, sizeof(line), stdin);\n\t\t}\t\t\t\t\n\t\tif( (user > 4) || (user < 1) )\n\t\t{\n\t\t\tprintf(\"Please enter a valid number!\\n\");\n\t\t\tcontinue;\n\t\t}\n\t\tswitch (comp)\n\t\t{\n\t\t\tcase 1 :\n\t\t\t\tstrcpy(cmove, \"Rock\");\n\t\t\t\tbreak;\n\t\t\tcase 2 :\n\t\t\t\tstrcpy(cmove, \"Paper\");\n\t\t\t\tbreak;\n\t\t\tcase 3 :\n\t\t\t\tstrcpy(cmove, \"Scissors\");\n\t\t\t\tbreak;\n\t\t\tdefault :\n\t\t\t\tprintf(\"Computer Error, set comp=1\\n\");\n\t\t\t\tcomp=1;\n\t\t\t\tstrcpy(cmove, \"Rock\");\n\t\t\t\tbreak;\n\t\t}\n\t\tswitch (user)\n\t\t{\n\t\t\tcase 1 :\n\t\t\t\tstrcpy(umove, \"Rock\");\n\t\t\t\tbreak;\n\t\t\tcase 2 :\n\t\t\t\tstrcpy(umove, \"Paper\");\n\t\t\t\tbreak;\n\t\t\tcase 3 :\n\t\t\t\tstrcpy(umove, \"Scissors\");\n\t\t\t\tbreak;\n\t\t\tcase 4 :\n\t\t\t\tprintf(\"Goodbye! Thanks for playing!\\n\");\n\t\t\t\treturn 0;\n\t\t\tdefault :\n\t\t\t\tprintf(\"Error, user number not between 1-4 exiting...\");\n\t\t\t\tgoto mainloop;\n\t\t}\n\t\tif( (user+1)%3 == comp )\n\t\t{\n\t\t\tprintf(\"Comp Played: %s\\nYou Played: %s\\nSorry, You Lost!\\n\", cmove, umove);\n\t\t}\t\n\t\telse if(comp == user)\n\t\t{\n\t\t\tprintf(\"Comp Played: %s\\nYou Played: %s\\nYou Tied :p\\n\", cmove, umove);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tprintf(\"Comp Played: %s\\nYou Played: %s\\nYay, You Won!\\n\", cmove, umove);\n\t\t}\n\t\ttbl[user-1]++;\n\t}\n}\n","language":"C"},{"code":"#include <windows.h>\n#include <iostream>\n#include <string>\n\n//-------------------------------------------------------------------------------\nusing namespace std;\n\n//-------------------------------------------------------------------------------\nenum choices { ROCK, SPOCK, PAPER, LIZARD, SCISSORS, MX_C };\nenum indexes { PLAYER, COMPUTER, DRAW };\n\n//-------------------------------------------------------------------------------\nclass stats\n{\npublic:\n stats() : _draw( 0 )\n {\n ZeroMemory( _moves, sizeof( _moves ) );\n\tZeroMemory( _win, sizeof( _win ) );\n }\n void draw()\t\t { _draw++; }\n void win( int p )\t { _win[p]++; }\n void move( int p, int m ) { _moves[p][m]++; }\n int getMove( int p, int m ) { return _moves[p][m]; }\n string format( int a )\n {\n\tchar t[32];\n\twsprintf( t, \"%.3d\", a );\n\tstring d( t );\n\treturn d;\n }\n\n void print()\n {\n string d = format( _draw ),\n\t pw = format( _win[PLAYER] ),\t\tcw = format( _win[COMPUTER] ),\n\t pr = format( _moves[PLAYER][ROCK] ),\tcr = format( _moves[COMPUTER][ROCK] ),\n pp = format( _moves[PLAYER][PAPER] ),\tcp = format( _moves[COMPUTER][PAPER] ),\n\t ps = format( _moves[PLAYER][SCISSORS] ), cs = format( _moves[COMPUTER][SCISSORS] ),\n\t pl = format( _moves[PLAYER][LIZARD] ),\tcl = format( _moves[COMPUTER][LIZARD] ),\n\t pk = format( _moves[PLAYER][SPOCK] ),\tck = format( _moves[COMPUTER][SPOCK] );\n\n\tsystem( \"cls\" );\n\tcout << endl;\n\tcout << \"+----------+-------+--------+--------+---------+----------+--------+---------+\" << endl;\n\tcout << \"| | WON | DRAW | ROCK | PAPER | SCISSORS | LIZARD | SPOCK |\" << endl;\n\tcout << \"+----------+-------+--------+--------+---------+----------+--------+---------+\" << endl;\n\tcout << \"| PLAYER | \" << pw << \" | | \" << pr << \" | \" << pp << \" | \" << ps << \" | \" << pl << \" | \" << pk << \" |\" << endl;\n\tcout << \"+----------+-------+ \" << d << \" +--------+---------+----------+--------+---------+\" << endl;\n\tcout << \"| COMPUTER | \" << cw << \" | | \" << cr << \" | \" << cp << \" | \" << cs << \" | \" << cl << \" | \" << ck << \" |\" << endl;\n\tcout << \"+----------+-------+--------+--------+---------+----------+--------+---------+\" << endl;\n\tcout << endl << endl;\n\n\tsystem( \"pause\" );\n\n }\n\nprivate:\n int _moves[2][MX_C], _win[2], _draw;\n};\n//-------------------------------------------------------------------------------\nclass rps\n{\nprivate:\n int makeMove()\n {\n\tint total = 0, r, s;\n\tfor( int i = 0; i < MX_C; total += statistics.getMove( PLAYER, i++ ) );\n\tr = rand() % total;\n\n\tfor( int i = ROCK; i < SCISSORS; i++ )\n\t{\n\t s = statistics.getMove( PLAYER, i );\n\t if( r < s ) return ( i + 1 );\n\t r -= s;\n\t}\n\n\treturn ROCK;\n }\n\n void printMove( int p, int m )\n {\n\tif( p == COMPUTER ) cout << \"My move: \";\n\telse cout << \"Your move: \";\n\n\tswitch( m )\n\t{\n\t case ROCK: cout << \"ROCK\\n\"; break;\n\t case PAPER: cout << \"PAPER\\n\"; break;\n\t case SCISSORS: cout << \"SCISSORS\\n\"; break;\n\t case LIZARD: cout << \"LIZARD\\n\"; break;\n\t case SPOCK: cout << \"SPOCK\\n\";\n\t}\n }\n\npublic:\n rps()\n {\n\tchecker[ROCK][ROCK] = 2; checker[ROCK][PAPER] = 1; checker[ROCK][SCISSORS] = 0; checker[ROCK][LIZARD] = 0; checker[ROCK][SPOCK] = 1;\n\tchecker[PAPER][ROCK] = 0; checker[PAPER][PAPER] = 2; checker[PAPER][SCISSORS] = 1; checker[PAPER][LIZARD] = 1; checker[PAPER][SPOCK] = 0;\n\tchecker[SCISSORS][ROCK] = 1; checker[SCISSORS][PAPER] = 0; checker[SCISSORS][SCISSORS] = 2; checker[SCISSORS][LIZARD] = 0; checker[SCISSORS][SPOCK] = 1;\n\tchecker[LIZARD][ROCK] = 1; checker[LIZARD][PAPER] = 0; checker[LIZARD][SCISSORS] = 1; checker[LIZARD][LIZARD] = 2; checker[LIZARD][SPOCK] = 0;\n\tchecker[SPOCK][ROCK] = 0; checker[SPOCK][PAPER] = 1; checker[SPOCK][SCISSORS] = 0; checker[SPOCK][LIZARD] = 1; checker[SPOCK][SPOCK] = 2;\n }\n void play()\n {\n\tint p, r, m;\n\twhile( true )\n\t{\n\t cout << \"What is your move (1)ROCK (2)SPOCK (3)PAPER (4)LIZARD (5)SCISSORS (0)Quit ? \";\n\t cin >> p;\n\t if( !p || p < 0 ) break;\n\t if( p > 0 && p < 6 )\n\t {\n\t\tp--;\n\t\tcout << endl;\n\t\tprintMove( PLAYER, p );\n\t\tstatistics.move( PLAYER, p );\n\n\t\tm = makeMove();\n\t\tstatistics.move( COMPUTER, m );\n\t\tprintMove( COMPUTER, m );\n\n\t\tr = checker[p][m];\n\t\tswitch( r )\n\t\t{\n\t\t case DRAW:\n\t\t cout << endl << \"DRAW!\" << endl << endl;\n\t\t statistics.draw();\n\t\t break;\n\t\t case COMPUTER:\n\t\t\tcout << endl << \"I WIN!\" << endl << endl;\n\t\t\tstatistics.win( COMPUTER );\n\t\t break;\n\t\t case PLAYER:\n\t\t\tcout << endl << \"YOU WIN!\" << endl << endl;\n\t\t\tstatistics.win( PLAYER );\n\n\t\t}\n\t\tsystem( \"pause\" );\n\t }\n\t system( \"cls\" );\n\t}\n\tstatistics.print();\n }\n\nprivate:\n stats statistics;\n int checker[MX_C][MX_C];\n};\n//-------------------------------------------------------------------------------\nint main( int argc, char* argv[] )\n{\n srand( GetTickCount() );\n rps game;\n game.play();\n return 0;\n}\n//-------------------------------------------------------------------------------\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nnamespace RockPaperScissors\n{\n class Program\n {\n static void Main(string[] args)\n {\n // There is no limit on the amount of weapons supported by RPSGame. Matchups are calculated depending on the order.\n var rps = new RPSGame(\"scissors\", \"paper\", \"rock\", \"lizard\", \"spock\");\n\n int wins = 0, losses = 0, draws = 0;\n\n while (true)\n {\n Console.WriteLine(\"Make your move: \" + string.Join(\", \", rps.Weapons) + \", quit\");\n\n string weapon = Console.ReadLine().Trim().ToLower();\n\n if (weapon == \"quit\")\n break;\n\n if (!rps.Weapons.Contains(weapon))\n {\n Console.WriteLine(\"Invalid weapon!\");\n continue;\n }\n\n int result = rps.Next(weapon);\n\n Console.WriteLine(\"You chose {0} and your opponent chose {1}!\", weapon, rps.LastAIWeapon);\n\n switch (result)\n {\n case 1: Console.WriteLine(\"{0} pwns {1}. You're a winner!\", weapon, rps.LastAIWeapon);\n wins++;\n break;\n case 0: Console.WriteLine(\"Draw!\");\n draws++;\n break;\n case -1: Console.WriteLine(\"{0} pwns {1}. You're a loser!\", rps.LastAIWeapon, weapon);\n losses++;\n break;\n }\n\n Console.WriteLine();\n }\n\n Console.WriteLine(\"\\nPlayer Statistics\\nWins: {0}\\nLosses: {1}\\nDraws: {2}\", wins, losses, draws);\n }\n\n class RPSGame\n {\n public RPSGame(params string[] weapons)\n {\n Weapons = weapons;\n\n // Creates a new AI opponent, and gives it the list of weapons.\n _rpsAI = new RPSAI(weapons);\n }\n\n // Play next turn.\n public int Next(string weapon)\n {\n string aiWeapon = _rpsAI.NextMove(); // Gets the AI opponent's next move.\n LastAIWeapon = aiWeapon; // Saves the AI opponent's move in a property so the player can see it.\n\n _rpsAI.AddPlayerMove(weapon); // Let the AI know which weapon the player chose, for future predictions.\n return GetWinner(Weapons, weapon, aiWeapon); // Returns -1 if AI win, 0 if draw, and 1 if player win.\n }\n\n // Returns matchup winner.\n public static int GetWinner(string[] weapons, string weapon1, string weapon2)\n {\n if (weapon1 == weapon2)\n return 0; // If weapons are the same, return 0 for draw.\n\n if (GetVictories(weapons, weapon1).Contains(weapon2))\n return 1; // Returns 1 for weapon1 win.\n else if (GetVictories(weapons, weapon2).Contains(weapon1))\n return -1; // Returns -1 for weapon2 win.\n\n throw new Exception(\"No winner found.\");\n }\n\n /*\n * Return weapons that the provided weapon beats.\n * The are calculated in the following way:\n * If the index of the weapon is even, then all even indices less than it,\n * and all odd indices greater than it, are victories.\n * One exception is if it is an odd index, and also the last index in the set,\n * then the first index in the set is a victory.\n */\n public static IEnumerable<string> GetVictories(string[] weapons, string weapon)\n {\n // Gets index of weapon.\n int index = Array.IndexOf(weapons, weapon);\n\n // If weapon is odd and the final index in the set, then return the first item in the set as a victory.\n if (index % 2 != 0 && index == weapons.Length - 1)\n yield return weapons[0];\n\n for (int i = index - 2; i >= 0; i -= 2)\n yield return weapons[i];\n\n for (int i = index + 1; i < weapons.Length; i += 2)\n yield return weapons[i];\n }\n\n public string LastAIWeapon\n {\n private set;\n get;\n }\n\n public readonly string[] Weapons;\n private RPSAI _rpsAI;\n\n class RPSAI\n {\n public RPSAI(params string[] weapons)\n {\n _weapons = weapons;\n _weaponProbability = new Dictionary<string, int>();\n\n // The AI sets the probability for each weapon to be chosen as 1.\n foreach (string weapon in weapons)\n _weaponProbability.Add(weapon, 1);\n\n _random = new Random();\n }\n\n // Increases probability of selecting each weapon that beats the provided move.\n public void AddPlayerMove(string weapon)\n {\n int index = Array.IndexOf(_weapons, weapon);\n\n foreach (string winWeapon in _weapons.Except(GetVictories(_weapons, weapon)))\n if (winWeapon != weapon)\n _weaponProbability[winWeapon]++;\n }\n\n // Gets the AI's next move.\n public string NextMove()\n {\n double r = _random.NextDouble();\n\n double divisor = _weaponProbability.Values.Sum();\n\n var weightedWeaponRanges = new Dictionary<double, string>();\n\n double currentPos = 0.0;\n\n // Maps probabilities to ranges between 0.0 and 1.0. Returns weighted random weapon.\n foreach (var weapon in _weaponProbability)\n {\n double weightedRange = weapon.Value / divisor;\n if (r <= currentPos + (weapon.Value / divisor))\n return weapon.Key;\n currentPos += weightedRange;\n }\n\n throw new Exception(\"Error calculating move.\");\n }\n\n Random _random;\n private readonly string[] _weapons;\n private Dictionary<string, int> _weaponProbability;\n }\n }\n }\n}\n","language":"C-sharp"},{"code":"(ns rps.core\n (:require [clojure.data.generators :refer [weighted]])\n (:import jline.Terminal)\n (:gen-class))\n\n(def what-beats {:rock :paper, :paper :scissors, :scissors :rock})\n\n(defn battle [human comp]\n (let [h (name human)\n c (name comp)]\n (cond\n (= human comp) (println (format \"We both picked %s. DRAW!\" c))\n (= human (what-beats comp))\n (println (format \"Your %s defeats computer's %s. YOU WIN!\" h c))\n (= comp (what-beats human))\n (println (format \"Computer's %s defeats your %s. YOU LOSE!\" c h))\n :else (println (format \"Wat? %s and %s ?\" h c)))))\n\n(defn key->rps [k]\n (cond\n (or (= k 82) (= k 114)) :rock\n (or (= k 80) (= k 112)) :paper\n (or (= k 83) (= k 115)) :scissors\n :else nil))\n\n(defn play-game [freqs]\n (println \"\\n(R)ock, (P)aper, (S)cissors?\")\n (let [term (Terminal/getTerminal)\n rps (key->rps (.readCharacter term System/in))]\n (if-not (nil? rps)\n (do\n (battle rps (what-beats (weighted freqs)))\n (recur (assoc freqs rps (inc (rps freqs)))))\n (println \"Game Over Man! Game Over!\"))))\n\n(defn -main\n \"Rock, Paper, Scissors!\"\n [& args]\n (play-game {:rock 1, :paper 1, :scissors 1}))\n","language":"Clojure"},{"code":"# conventional weapons\nenum Choice\n Rock\n Paper\n Scissors\nend\n\nBEATS = {\n Choice::Rock => [Choice::Paper],\n Choice::Paper => [Choice::Scissors],\n Choice::Scissors => [Choice::Rock],\n}\n\n# uncomment to use additional weapons\n# enum Choice\n# Rock\n# Paper\n# Scissors\n# Lizard\n# Spock\n# end\n\n# BEATS = {\n# Choice::Rock => [Choice::Paper, Choice::Spock],\n# Choice::Paper => [Choice::Scissors, Choice::Lizard],\n# Choice::Scissors => [Choice::Rock, Choice::Spock],\n# Choice::Lizard => [Choice::Rock, Choice::Scissors],\n# Choice::Spock => [Choice::Paper, Choice::Lizard],\n# }\n\nclass RPSAI\n @stats = {} of Choice => Int32\n\n def initialize\n Choice.values.each do |c|\n @stats[c] = 1\n end\n end\n\n def choose\n v = rand(@stats.values.sum)\n @stats.each do |choice, rate|\n v -= rate\n return choice if v < 0\n end\n raise \"\"\n end\n\n def train(selected)\n BEATS[selected].each do |c|\n @stats[c] += 1\n end\n end\nend\n\nenum GameResult\n HumanWin\n ComputerWin\n Draw\n\n def to_s\n case self\n when .draw?\n \"Draw\"\n when .human_win?\n \"You win!\"\n when .computer_win?\n \"I win!\"\n end\n end\nend\n\nclass RPSGame\n @score = Hash(GameResult, Int32).new(0)\n @ai = RPSAI.new\n\n def check(player, computer)\n return GameResult::ComputerWin if BEATS[player].includes? computer\n return GameResult::HumanWin if BEATS[computer].includes? player\n return GameResult::Draw\n end\n\n def round\n puts \"\"\n print \"Your choice (#{Choice.values.join(\", \")}):\"\n s = gets.not_nil!.strip.downcase\n return false if \"quit\".starts_with? s\n player_turn = Choice.values.find { |choice| choice.to_s.downcase.starts_with? s }\n unless player_turn\n puts \"Invalid choice\"\n return true\n end\n ai_turn = @ai.choose\n result = check(player_turn, ai_turn)\n puts \"H: #{player_turn}, C: #{ai_turn} => #{result}\"\n @score[result] += 1\n puts \"score: human=%d, computer=%d, draw=%d\" % GameResult.values.map { |r| @score[r] }\n @ai.train player_turn\n true\n end\nend\n\ngame = RPSGame.new\nloop do\n break unless game.round\nend\n","language":"Crystal"},{"code":"import std.stdio, std.random, std.string, std.conv, std.array, std.typecons;\n\nenum Choice { rock, paper, scissors }\n\nbool beats(in Choice c1, in Choice c2) pure nothrow @safe @nogc {\n with (Choice) return (c1 == paper && c2 == rock) ||\n (c1 == scissors && c2 == paper) ||\n (c1 == rock && c2 == scissors);\n}\n\nChoice genMove(in int r, in int p, in int s) @safe /*@nogc*/ {\n immutable x = uniform!\"[]\"(1, r + p + s);\n if (x < s) return Choice.rock;\n if (x <= s + r) return Choice.paper;\n else return Choice.scissors;\n}\n\nNullable!To maybeTo(To, From)(From x) pure nothrow @safe {\n try {\n return typeof(return)(x.to!To);\n } catch (ConvException) {\n return typeof(return)();\n } catch (Exception e) {\n static immutable err = new Error(\"std.conv.to failure\");\n throw err;\n }\n}\n\nvoid main() /*@safe*/ {\n int r = 1, p = 1, s = 1;\n\n while (true) {\n write(\"rock, paper or scissors? \");\n immutable hs = readln.strip.toLower;\n if (hs.empty)\n break;\n\n immutable h = hs.maybeTo!Choice;\n if (h.isNull) {\n writeln(\"Wrong input: \", hs);\n continue;\n }\n\n immutable c = genMove(r, p, s);\n writeln(\"Player: \", h.get, \" Computer: \", c);\n\n if (beats(h, c)) writeln(\"Player wins\\n\");\n else if (beats(c, h)) writeln(\"Player loses\\n\");\n else writeln(\"Draw\\n\");\n\n final switch (h.get) {\n case Choice.rock: r++; break;\n case Choice.paper: p++; break;\n case Choice.scissors: s++; break;\n }\n }\n}\n","language":"D"},{"code":"defmodule Rock_paper_scissors do\n def play, do: loop([1,1,1])\n\n defp loop([r,p,s]=odds) do\n IO.gets(\"What is your move? (R,P,S,Q) \") |> String.upcase |> String.first\n |> case do\n \"Q\" -> IO.puts \"Good bye!\"\n human when human in [\"R\",\"P\",\"S\"] ->\n IO.puts \"Your move is #{play_to_string(human)}.\"\n computer = select_play(odds)\n IO.puts \"My move is #{play_to_string(computer)}\"\n case beats(human,computer) do\n true -> IO.puts \"You win!\"\n false -> IO.puts \"I win!\"\n _ -> IO.puts \"Draw\"\n end\n case human do\n \"R\" -> loop([r+1,p,s])\n \"P\" -> loop([r,p+1,s])\n \"S\" -> loop([r,p,s+1])\n end\n _ ->\n IO.puts \"Invalid play\"\n loop(odds)\n end\n end\n\n defp beats(\"R\",\"S\"), do: true\n defp beats(\"P\",\"R\"), do: true\n defp beats(\"S\",\"P\"), do: true\n defp beats(x,x), do: :draw\n defp beats(_,_), do: false\n\n defp play_to_string(\"R\"), do: \"Rock\"\n defp play_to_string(\"P\"), do: \"Paper\"\n defp play_to_string(\"S\"), do: \"Scissors\"\n\n defp select_play([r,p,s]) do\n n = :rand.uniform(r+p+s)\n cond do\n n <= r -> \"P\"\n n <= r+p -> \"S\"\n true -> \"R\"\n end\n end\nend\n\nRock_paper_scissors.play\n","language":"Elixir"},{"code":"-module(rps).\n-compile(export_all).\n\nplay() ->\n loop([1,1,1]).\n\nloop([R,P,S]=Odds) ->\n case io:fread(\"What is your move? (R,P,S,Q) \",\"~c\") of\n {ok,[\"Q\"]} -> io:fwrite(\"Good bye!~n\");\n {ok,[[Human]]} when Human == $R; Human == $P; Human == $S ->\n io:fwrite(\"Your move is ~s.~n\",\n [play_to_string(Human)]),\n Computer = select_play(Odds),\n io:fwrite(\"My move is ~s~n\",\n [play_to_string(Computer)]),\n case {beats(Human,Computer),beats(Computer,Human)} of\n {true,_} -> io:fwrite(\"You win!~n\");\n {_,true} -> io:fwrite(\"I win!~n\");\n _ -> io:fwrite(\"Draw~n\")\n end,\n case Human of\n $R -> loop([R+1,P,S]);\n $P -> loop([R,P+1,S]);\n $S -> loop([R,P,S+1])\n end;\n _ ->\n io:fwrite(\"Invalid play~n\"),\n loop(Odds)\n end.\n\nbeats($R,$S) -> true;\nbeats($P,$R) -> true;\nbeats($S,$P) -> true;\nbeats(_,_) -> false.\n\nplay_to_string($R) -> \"Rock\";\nplay_to_string($P) -> \"Paper\";\nplay_to_string($S) -> \"Scissors\".\n\nselect_play([R,P,S]) ->\n N = random:uniform(R+P+S),\n if\n N =< R -> $P;\n N =< R+P -> $S;\n true -> $R\n end.\n","language":"Erlang"},{"code":"function weighted_rand(sequence table)\n integer sum,r\n sum = 0\n for i = 1 to length(table) do\n sum += table[i]\n end for\n\n r = rand(sum)\n for i = 1 to length(table)-1 do\n r -= table[i]\n if r <= 0 then\n return i\n end if\n end for\n return length(table)\nend function\n\nconstant names = { \"Rock\", \"Paper\", \"Scissors\" }\nconstant winner = { \"We tied.\", \"Meself winned.\", \"You win.\" }\ninteger user_action, my_action, key, win\nsequence user_rec, score\nuser_rec = {1,1,1}\nscore = {0,0}\n\nwhile 1 do\n my_action = remainder(weighted_rand(user_rec)+1,3)+1\n puts(1,\"Your choice [1-3]:\\n\")\n puts(1,\" 1. Rock\\n 2. Paper\\n 3. Scissors\\n> \")\n key = -1\n while (key < '1' or key > '3') and key != 'q' do\n key = get_key()\n end while\n puts(1,key)\n puts(1,'\\n')\n if key = 'q' then\n exit\n end if\n user_action = key-'0'\n win = remainder(my_action-user_action+3,3)\n printf(1,\"You chose %s; I chose %s. %s\\n\",\n { names[user_action],\n names[my_action],\n winner[win+1] })\n\n if win then\n score[win] += 1\n end if\n printf(1,\"\\nScore %d:%d\\n\",score)\n user_rec[user_action] += 1\nend while\n","language":"Euphoria"},{"code":"open System\n\nlet random = Random ()\nlet rand = random.NextDouble () //Gets a random number in the range (0.0, 1.0)\n\n/// Union of possible choices for a round of rock-paper-scissors\ntype Choice =\n| Rock\n| Paper\n| Scissors\n\n/// Gets the string representation of a Choice\nlet getString = function\n | Rock -> \"Rock\"\n | Paper -> \"Paper\"\n | Scissors -> \"Scissors\"\n\n/// Defines rules for winning and losing\nlet beats (a : Choice, b : Choice) =\n match a, b with\n | Rock, Scissors -> true // Rock beats Scissors\n | Paper, Rock -> true // Paper beats Rock\n | Scissors, Paper -> true // Scissors beat Paper\n | _, _ -> false\n\n/// Generates the next move for the computer based on probability derived from previous player moves.\nlet genMove r p s =\n let tot = r + p + s\n let n = rand\n if n <= s / tot then Rock\n elif n <= (s + r) / tot then Paper\n else Scissors\n\n/// Gets the move chosen by the player\nlet rec getMove () =\n printf \"[R]ock, [P]aper, or [S]cissors?: \"\n let choice = Console.ReadLine ()\n match choice with\n | \"r\" | \"R\" -> Rock\n | \"p\" | \"P\" -> Paper\n | \"s\" | \"S\" -> Scissors\n | _ ->\n printf \"Invalid choice.\\n\\n\"\n getMove ()\n\n/// Place where all the game logic takes place.\nlet rec game (r : float, p : float, s : float) =\n let comp = genMove r p s\n let player = getMove ()\n Console.WriteLine (\"Player: {0} vs Computer: {1}\", getString player, getString comp)\n Console.WriteLine (\n if beats(player, comp) then \"Player Wins!\\n\"\n elif beats(comp, player) then \"Computer Wins!\\n\"\n else \"Draw!\\n\"\n )\n let nextR = if player = Rock then r + 1.0 else r\n let nextP = if player = Paper then p + 1.0 else p\n let nextS = if player = Scissors then s + 1.0 else s\n game (nextR, nextP, nextS)\n\ngame(1.0, 1.0, 1.0)\n","language":"F-Sharp"},{"code":"USING: combinators formatting io kernel math math.ranges qw\nrandom sequences ;\nIN: rosetta-code.rock-paper-scissors\n\nCONSTANT: thing qw{ rock paper scissors }\nCONSTANT: msg { \"I win.\" \"Tie!\" \"You win.\" }\n\n: ai-choice ( r p s -- n )\n 3dup + + nip [1,b] random {\n { [ 3dup nip >= ] [ 3drop 1 ] }\n { [ 3dup [ + ] dip >= ] [ 3drop 2 ] }\n [ 3drop 0 ]\n } cond ;\n\n: player-choice ( -- n )\n \"r/p/s/q? \" write readln qw{ r p s q } index dup\n [ drop player-choice ] unless ;\n\n! return:\n! -1 for n1 loses to n2.\n! 0 for n1 ties n2.\n! 1 for n1 beats n2.\n: outcome ( n1 n2 -- n3 ) - dup abs 1 > [ neg ] when sgn ;\n\n: status. ( seq -- )\n \"My wins: %d Ties: %d Your wins: %d\\n\" vprintf ;\n\n: choices. ( n1 n2 -- )\n [ thing nth ] bi@ \"You chose: %s\\nI chose: %s\\n\" printf ;\n\n: tally ( seq n -- seq' ) over [ 1 + ] change-nth ;\n\n: game ( seq -- seq' )\n dup status. player-choice dup 3 = [ drop ] [\n [ 3 + tally ] keep over 3 tail* first3 ai-choice 2dup\n choices. outcome 1 + dup [ tally ] dip msg nth print nl\n game\n ] if ;\n\n! The game state is a sequence where the members are:\n! losses, ties, wins, #rock, #paper, #scissors\n: main ( -- ) { 0 0 0 1 1 1 } clone game drop ;\n\nMAIN: main\n","language":"Factor"},{"code":"include random.fs\n\n0 value aiwins\n0 value plwins\n\n10 constant inlim\n0 constant rock\n1 constant paper\n2 constant scissors\n\ncreate rpshistory 0 , 0 , 0 ,\ncreate inversemove 1 , 2 , 0 ,\n3 constant historylen\n\n: @a ( n array -- )\n swap cells + @ ;\n\n: sum-history ( -- n )\n 0 historylen 0 ?do\n\ti rpshistory @a 1+ + loop ;\n\n: probable-choice ( -- n ) \\ Simple linear search\n sum-history random\n historylen 0 ?do\n\ti rpshistory @a -\n\tdup 0< if drop i leave then\n loop inversemove @a ;\n\n: rps-print ( addr u -- )\n cr type ;\n\n: rpslog. ( -- )\n s\" ROCK PAPER SCISSORS AI/W PL/W\" rps-print cr\n 3 0 do i cells rpshistory + @ 9 u.r loop aiwins 7 u.r plwins 6 u.r cr ;\n\ncreate rpswords ' rock , ' paper , ' scissors , ' quit ,\n\n: update-history! ( n -- )\n cells rpshistory + 1 swap +! ;\n\n: thrown. ( n -- addr u )\n cells rpswords + @ name>string ;\n\n: throws. ( n n -- )\n thrown. s\" AI threw: \" 2swap s+ rps-print\n thrown. s\" You threw: \" 2swap s+ rps-print ;\n\n: print-throws ( n n -- )\n rpslog. throws. ;\n\n: tie. ( n n -- )\n s\" Tie. \" rps-print ;\n\n: plwin ( n n -- )\n 1 +to plwins s\" You win. \" rps-print ;\n\n: aiwin ( n n -- )\n 1 +to aiwins s\" AI wins. \" rps-print ;\n\ncreate rpsstates ' tie. , ' plwin , ' aiwin ,\n\n: determine-winner ( n n -- )\n >r abs r> abs - 3 + 3 mod\n cells rpsstates + @ execute ;\n\n: rps-validate ( name -- ) ( Rude way of checking for only valid commands )\n 4 0 do i cells rpswords + @ over = swap loop drop or or or ;\n\n: rps-prompt. ( -- )\n s\" Enter choice (rock, paper, scissors or quit): \" rps-print ;\n\n: player-choice ( -- n ) recursive\n pad inlim accept pad swap find-name\n dup rps-validate if execute\n else drop rps-prompt. player-choice then ;\n\n: update-log ( n n -- )\n update-history! update-history! ;\n\n: rps ( -- ) recursive\n rps-prompt. player-choice probable-choice\n 2dup update-log 2dup print-throws\n determine-winner rps ;\n","language":"Forth"},{"code":"! compilation\n! gfortran -std=f2008 -Wall -ffree-form -fall-intrinsics -fimplicit-none f.f08 -o f\n!\n! EXAMPLE\n!\n!$ ./f\n!rock, paper, scissors? papier\n!scoring computer choice (r) and your choice (p)\n!rock, paper, scissors? sizzerz\n!scoring computer choice (s) and your choice (s)\n!rock, paper, scissors? quit\n!scoring computer choice (r) and your choice (q)\n! Who's keeping score anyway???\n! 0.5 1.5\n! you won!\n!$\n\n\n\nprogram rpsgame\n\n integer, parameter :: COMPUTER=1, HAPLESSUSER=2\n integer, dimension(3) :: rps = (/1,1,1/)\n real, dimension(3) :: p\n character :: answer, cc ! computer choice\n integer :: exhaustion, i\n real, dimension(2) :: score = (/0, 0/)\n character(len=8), dimension(3) :: choices = (/'rock ','paper ','scissors'/)\n real :: harvest\n do exhaustion = 1, 30\n p = rps/real(sum(rps))\n p(2) = p(2) + p(1)\n p(3) = p(3) + p(2)\n call random_number(harvest)\n i = sum(merge(1,0,harvest.le.p)) ! In memory of Ken Iverson, logical is more useful as integer.\n cc = 'rsp'(i:i)\n write(6, \"(2(A,', '),A,'? ')\", advance='no')(trim(choices(i)),i=1,size(choices))\n read(5, *) answer\n write(6, \"('scoring computer choice (',A,') and your choice (',A,')')\")cc,answer\n if (answer.eq.cc) then\n score = score + 0.5\n else\n i = HAPLESSUSER\n if (answer.eq.'r') then\n if (cc.eq.'p') i = COMPUTER\n else if (answer.eq.'p') then\n if (cc.eq.'s') i = COMPUTER\n else if (answer.eq.'s') then\n if (cc.eq.'r') i = COMPUTER\n else\n exit\n endif\n score(i) = score(i) + 1\n end if\n i = scan('rps',answer)\n rps(i) = rps(i) + 1\n end do\n if (25 .lt. exhaustion) write(6, *) \"I'm bored out of my skull\"\n write(6, *)\"Who's keeping score anyway???\"\n write(6, '(2f5.1)') score\n if (score(COMPUTER) .lt. score(HAPLESSUSER)) print*,'you won!'\nend program rpsgame\n","language":"Fortran"},{"code":"$ yes r | ./f # rock\nrock, paper, scissors? scoring computer choice (r) and your choice (r)\nrock, paper, scissors? scoring computer choice (s) and your choice (r)\nrock, paper, scissors? scoring computer choice (r) and your choice (r)\n...\nrock, paper, scissors? scoring computer choice (p) and your choice (r)\n I'm bored out of my skull\n Who's keeping score anyway???\n 25.5 4.5\nyes: standard output: Broken pipe\nyes: write error\n$ yes p 2>/dev/null | ./f # paper\nrock, paper, scissors? scoring computer choice (r) and your choice (p)\nrock, paper, scissors? scoring computer choice (s) and your choice (p)\nrock, paper, scissors? scoring computer choice (r) and your choice (p)\nrock, paper, scissors? scoring computer choice (s) and your choice (p)\n...\nrock, paper, scissors? scoring computer choice (s) and your choice (p)\n I'm bored out of my skull\n Who's keeping score anyway???\n 25.5 4.5\n$ yes scissors 2>/dev/null | ./f # scissors\nrock, paper, scissors? scoring computer choice (r) and your choice (s)\nrock, paper, scissors? scoring computer choice (r) and your choice (s)\n...\nrock, paper, scissors? scoring computer choice (r) and your choice (s)\n I'm bored out of my skull\n Who's keeping score anyway???\n 26.5 3.5\n$\n","language":"Fortran"},{"code":"Dim Shared As Byte ganador = 1, accion = 2, perdedor = 3, wp, wc\nDim Shared As String word(10, 3)\nFor n As Byte = 0 To 9\n Read word(n, ganador), word(n, accion), word(n, perdedor)\nNext n\n\nSub SimonSay(n As Byte)\n Print Using \"\\ \\ \\ \\ \"; word(n, ganador); word(n, accion); word(n, perdedor)\nEnd Sub\n\nSub Puntuacion()\n Print !\"\\nPlayer = \"; wp; !\"\\tComputer = \"; wc; !\"\\n\"\nEnd Sub\n\nDim As Byte n\nDim As String*1 k\nDim As String eleccionCPU, eleccionJUG\nRandomize Timer\nDo\n Cls\n eleccionCPU = word(Rnd *10, ganador)\n\n Print !\"'Rock, Paper, Scissors, Lizard, Spock!' rules are:\\n\"\n For n = 0 To 9\n SimonSay(n)\n Next n\n\n Print !\"\\nType your choice letter:\"\n Input !\"(R)ock, (P)aper, (S)cissors, (L)izard, Spoc(K), (Q)uit \", k\n\n k = Ucase(k)\n Select Case k\n Case \"Q\"\n Exit Do\n Case \"R\"\n eleccionJUG = \"Rock\"\n Case \"P\"\n eleccionJUG = \"Paper\"\n Case \"S\"\n eleccionJUG = \"Scissors\"\n Case \"L\"\n eleccionJUG = \"Lizard\"\n Case \"K\"\n eleccionJUG = \"Spock\"\n End Select\n\n Print !\"\\nPlayer chose \"; eleccionJUG; \" and Computer chose \"; eleccionCPU\n For n = 0 To 9\n If word(n, ganador) = eleccionJUG And word(n, perdedor) = eleccionCPU Then\n SimonSay(n)\n Print !\"\\nWinner was Player\"\n wp += 1\n Exit For\n Elseif word(n, ganador) = eleccionCPU And word(n, perdedor) = eleccionJUG Then\n SimonSay(n)\n Print !\"\\nWinner was Computer\"\n wc += 1\n Exit For\n End If\n Next n\n If n = 10 Then Print !\"\\nOuch!\"\n\n Puntuacion()\n Print \"Press <SPACE> to continue\"\n Sleep\nLoop Until(k = \"Q\")\n\nCls\nPuntuacion()\nIf wp > wc Then\n Print \"Player win\"\nElseif wc > wp Then\n Print \"Computer win\"\nElse\n Print \"Tie\"\nEnd If\nSleep\nEnd\n\nData \"Scissors\",\"cuts\",\"Paper\"\nData \"Paper\",\"covers\",\"Rock\"\nData \"Rock\",\"crushes\",\"Lizard\"\nData \"Lizard\",\"poisons\",\"Spock\"\nData \"Spock\",\"smashes\",\"Scissors\"\nData \"Scissors\",\"decapites\",\"Lizard\"\nData \"Lizard\",\"eats\",\"Paper\"\nData \"Paper\",\"disproves\",\"Spock\"\nData \"Spock\",\"vaporizes\",\"Rock\"\nData \"Rock\",\"blunts\",\"Scissors\"\n","language":"FreeBASIC"},{"code":"if var.end=0 then\nvar.end=0\nvar.computerchoice=random(3) // 1 is rock, 2 is paper, and 3 is scissors.\ndebug=\"Press the R key for rock, the P key for paper, or the S key for scissors:\"\nendif\nif pressed(Key.R)and var.end=0 then\n var.end=1\n if var.computerchoice=1 then\n debug=\"You chose rock, which the computer also chose, so it's a tie!\"\n else\n if var.computerchoice=2 then\n debug=\"The computer chose paper, covering your choice of rock, so you lose!\"\n else\n debug=\"You chose rock, smashing the computer's choice of scissors, so you win!\"\n endif\n endif\nendif\nif pressed(Key.P)and var.end=0 then\n var.end=1\n if var.computerchoice=1 then\n debug=\"You chose paper, covering the computer's choice of rock, so you win!\"\n else\n if var.computerchoice=2 then\n debug=\"You chose paper, which the computer also chose, so it's a tie!\"\n else\n debug=\"The computer chose scissors, cutting your choice of paper, so you lose!\"\n endif\n endif\nendif\nif pressed(Key.S)and var.end=0 then\n var.end=1\n if var.computerchoice=1 then\n debug=\"The computer chose rock, smashing your choice of scissors, so you lose!\"\n else\n if var.computerchoice=2 then\n debug=\"You chose scissors, cutting the computer's choice of paper, so you win!\"\n else\n debug=\"You chose scissors, which the computer also chose, so it's a tie!\"\n endif\n endif\nendif\n","language":"GlovePIE"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/rand\"\n \"strings\"\n \"time\"\n)\n\nconst rps = \"rps\"\n\nvar msg = []string{\n \"Rock breaks scissors\",\n \"Paper covers rock\",\n \"Scissors cut paper\",\n}\n\nfunc main() {\n rand.Seed(time.Now().UnixNano())\n fmt.Println(\"Rock Paper Scissors\")\n fmt.Println(\"Enter r, p, or s as your play. Anything else ends the game.\")\n fmt.Println(\"Running score shown as <your wins>:<my wins>\")\n var pi string // player input\n var aScore, pScore int\n sl := 3 // for output alignment\n pcf := make([]int, 3) // pcf = player choice frequency\n var plays int\n aChoice := rand.Intn(3) // ai choice for first play is completely random\n for {\n // get player choice\n fmt.Print(\"Play: \")\n _, err := fmt.Scanln(&pi) // lazy\n if err != nil || len(pi) != 1 {\n break\n }\n pChoice := strings.Index(rps, pi)\n if pChoice < 0 {\n break\n }\n pcf[pChoice]++\n plays++\n\n // show result of play\n fmt.Printf(\"My play:%s%c. \", strings.Repeat(\" \", sl-2), rps[aChoice])\n switch (aChoice - pChoice + 3) % 3 {\n case 0:\n fmt.Println(\"Tie.\")\n case 1:\n fmt.Printf(\"%s. My point.\\n\", msg[aChoice])\n aScore++\n case 2:\n fmt.Printf(\"%s. Your point.\\n\", msg[pChoice])\n pScore++\n }\n\n // show score\n sl, _ = fmt.Printf(\"%d:%d \", pScore, aScore)\n\n // compute ai choice for next play\n switch rn := rand.Intn(plays); {\n case rn < pcf[0]:\n aChoice = 1\n case rn < pcf[0]+pcf[1]:\n aChoice = 2\n default:\n aChoice = 0\n }\n }\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"flag\"\n \"fmt\"\n \"log\"\n \"math/rand\"\n \"regexp\"\n \"strings\"\n \"time\"\n\n \"github.com/BurntSushi/toml\"\n)\n\nvar help = `rps plays rock-paper-scissors with optional addition weapons.\n\nUsage: rps [-h] [game]\n -h display help.\n game is a game description file in TOML (https://github.com/mojombo/toml).\n\nThe traditional game can be described as\n\ntitle = \"Rock Paper Scissors\"\nwin = [\n \"rock breaks scissors\",\n \"paper covers rock\",\n \"scissors cut paper\",\n]\n\nThe title is optional, it just prints out at the beginning of a game.\n\nThe \"win\" list is statments where the first word wins over the last word.\n\nIt's case sensitive so make things easy by using consistent case.\nDon't use punctuation, at least not next to a first or last word.\n\nAdditionally, you can have a \"lose\" key where the first word loses to the\nthe last, for example\n\nlose = [\"rock falls into well\"]\n\nTo organize things with additional weapons, you can just use the winning\nweapon with a list of clauses, for example\n\nlizard = [\"poisons Spock\", \"eats paper\"]\n\nThe progam ignores anything in parentheses when identifying first or last\nwords. Examples (from RPS-101) with weapons gun, fire, and sword,\n\nwin = [\n \"gun fire(s)\"\n \"(flaming) sword has fire\"\n]\n\nFinally, TOML is a hash, so don't duplicate keys. That means no multiple\nwin or lose keys. You must combine all the win statements and all the lose\nstatements.`\n\nvar rps = `\ntitle = \"Rock Paper Scissors\"\nwin = [\n \"rock breaks scissors\",\n \"paper covers rock\",\n \"scissors cut paper\",\n]`\n\nfunc main() {\n h := flag.Bool(\"h\", false, \"show help\")\n flag.Parse()\n if *h {\n fmt.Println(help)\n return\n }\n m := map[string]interface{}{}\n var err error\n switch flag.NArg() {\n case 0:\n _, err = toml.Decode(rps, &m)\n case 1:\n _, err = toml.DecodeFile(flag.Arg(0), &m)\n default:\n flag.Usage()\n return\n }\n if err != nil {\n log.Fatal(err)\n }\n play(parse(m))\n}\n\ntype decision map[string]map[string]string\n\ntype fIndex map[string]int\n\nfunc parse(m map[string]interface{}) (title string, f fIndex, d decision) {\n d = decision{}\n for k, v := range m {\n switch t := v.(type) {\n case []interface{}:\n d.parseList(k, t)\n case string:\n if k == \"title\" {\n title = t\n } else {\n log.Println(\"Unknown key:\", k)\n }\n }\n }\n i := 0\n f = fIndex{}\n for w, wl := range d {\n if _, ok := f[w]; !ok {\n f[w] = i\n i++\n }\n for l := range wl {\n if _, ok := f[l]; !ok {\n f[l] = i\n i++\n }\n }\n }\n for fm := range f {\n if _, ok := d[fm]; !ok {\n log.Println(\"note,\", fm, \"always loses!\")\n }\n }\n balanced := len(f)&1 == 1\n for _, l := range d {\n if !balanced {\n break\n }\n balanced = len(l)*2+1 == len(f)\n }\n if !balanced {\n log.Print(\"note, game is unbalanced\")\n }\n return title, f, d\n}\n\nvar r = regexp.MustCompile(`[(].*[)]`)\n\nfunc (d decision) parseList(kw string, l []interface{}) {\n var ww string\n for _, e := range l {\n st, ok := e.(string)\n if !ok {\n log.Fatal(\"invalid\", e)\n }\n w := strings.Fields(r.ReplaceAllLiteralString(st, \"\"))\n if len(w) == 0 {\n log.Fatalln(\"invalid:\", kw, st)\n }\n lw := w[len(w)-1]\n switch kw {\n case \"win\":\n ww = w[0]\n case \"lose\":\n ww, lw = lw, w[0]\n default:\n ww = kw\n for i := 0; ; i++ {\n if i == len(w) {\n st = ww + \" \" + st\n break\n }\n if w[i] == ww {\n break\n }\n }\n }\n if lw == ww {\n log.Fatalln(\"invalid:\", st)\n }\n if cs, ok := d[lw][ww]; ok {\n log.Fatalln(\"conflict:\", cs, \"and\", st)\n }\n d1, ok := d[ww]\n if !ok {\n d1 = map[string]string{}\n }\n d1[lw] = st\n d[ww] = d1\n }\n}\n\nfunc play(title string, fx fIndex, d decision) {\n rand.Seed(time.Now().Unix())\n if len(fx) == 0 {\n return\n }\n form := make([]string, len(fx))\n for w, i := range fx {\n form[i] = w\n }\n fmt.Println()\n fmt.Println(title)\n fmt.Print(\"Choices are \", form[0])\n for _, w := range form[1:] {\n fmt.Printf(\", %s\", w)\n }\n fmt.Println(\".\")\n fmt.Println(\"Enter one of these choices as your play. \" +\n \"Anything else ends the game.\")\n fmt.Println(\"Running score shown as <your wins>:<my wins>\")\n var pw string\n var aScore, pScore int\n sl := 3\n wcf := make([]int, len(form))\n wct := 0\n ax := rand.Intn(len(form))\n aw := form[ax]\n for {\n fmt.Print(\"Play: \")\n _, err := fmt.Scanln(&pw)\n if err != nil {\n break\n }\n px, ok := fx[pw]\n if !ok {\n fmt.Println(pw, \"invalid.\")\n break\n }\n for f, l := range d {\n if _, ok := l[pw]; ok {\n wcf[fx[f]]++\n wct++\n }\n }\n\n fmt.Printf(\"My play:%s%s.\\n\", strings.Repeat(\" \", sl-2), aw)\n ast := d[aw][pw]\n pst := d[pw][aw]\n switch {\n case ax == px:\n fmt.Println(\"Tie.\")\n case ast > \"\" && pst > \"\":\n log.Fatalln(\"conflict: \", ast, \"and\", pst)\n case ast > \"\":\n fmt.Printf(\"%s. My point.\\n\", ast)\n aScore++\n default:\n fmt.Printf(\"%s. Your point.\\n\", pst)\n pScore++\n }\n sl, _ = fmt.Printf(\"%d:%d \", pScore, aScore)\n ax = 0\n for rn := rand.Intn(wct); ; ax++ {\n if f := wcf[ax]; rn < f {\n break\n } else {\n rn -= f\n }\n }\n aw = form[ax]\n }\n}\n","language":"Go"},{"code":"import System.Random (randomRIO)\n\ndata Choice\n = Rock\n | Paper\n | Scissors\n deriving (Show, Eq)\n\nbeats :: Choice -> Choice -> Bool\nbeats Paper Rock = True\nbeats Scissors Paper = True\nbeats Rock Scissors = True\nbeats _ _ = False\n\ngenrps :: (Int, Int, Int) -> IO Choice\ngenrps (r, p, s) = rps <$> rand\n where\n rps x\n | x <= s = Rock\n | x <= s + r = Paper\n | otherwise = Scissors\n rand = randomRIO (1, r + p + s) :: IO Int\n\ngetrps :: IO Choice\ngetrps = rps <$> getLine\n where\n rps \"scissors\" = Scissors\n rps \"rock\" = Rock\n rps \"paper\" = Paper\n rps _ = error \"invalid input\"\n\ngame :: (Int, Int, Int) -> IO a\ngame (r, p, s) = do\n putStrLn \"rock, paper or scissors?\"\n h <- getrps\n c <- genrps (r, p, s)\n putStrLn (\"Player: \" ++ show h ++ \" Computer: \" ++ show c)\n putStrLn\n (if beats h c\n then \"player wins\\n\"\n else if beats c h\n then \"player loses\\n\"\n else \"draw\\n\")\n let rr =\n if h == Rock\n then r + 1\n else r\n pp =\n if h == Paper\n then p + 1\n else p\n ss =\n if h == Scissors\n then s + 1\n else s\n game (rr, pp, ss)\n\nmain :: IO a\nmain = game (1, 1, 1)\n","language":"Haskell"},{"code":"link printf\n\nprocedure main()\n\nprintf(\"Welcome to Rock, Paper, Scissors.\\n_\n Rock beats scissors, Scissors beat paper, and Paper beats rock.\\n\\n\")\n\nhistoryP := [\"rock\",\"paper\",\"scissors\"] # seed player history\nwinP := winC := draws := 0 # totals\n\nbeats := [\"rock\",\"scissors\",\"paper\",\"rock\"] # what beats what 1 apart\n\nrepeat {\n printf(\"Enter your choice or rock(r), paper(p), scissors(s) or quit(q):\")\n turnP := case map(read()) of {\n \"q\"|\"quit\": break\n \"r\"|\"rock\": \"rock\"\n \"p\"|\"paper\": \"paper\"\n \"s\"|\"scissors\": \"scissors\"\n default: printf(\" - invalid choice.\\n\") & next\n }\n\n turnC := beats[(?historyP == beats[i := 2 to *beats],i-1)] # choose move\n\n put(historyP,turnP) # record history\n printf(\"You chose %s, computer chose %s\",turnP,turnC)\n\n (beats[p := 1 to *beats] == turnP) &\n (beats[c := 1 to *beats] == turnC) & (abs(p-c) <= 1) # rank play\n\n if p = c then\n printf(\" - draw (#%d)\\n\",draws +:= 1 )\n else if p > c then\n printf(\" - player win(#%d)\\n\",winP +:= 1)\n else\n printf(\" - computer win(#%d)\\n\",winC +:= 1)\n }\n\nprintf(\"\\nResults:\\n %d rounds\\n %d Draws\\n %d Computer wins\\n %d Player wins\\n\",\n winP+winC+draws,draws,winC,winP)\nend\n","language":"Icon"},{"code":"100 PROGRAM \"Rock.bas\"\n110 RANDOMIZE\n120 STRING CH$(1 TO 3)*8,K$*1\n130 NUMERIC PLWINS(1 TO 3),SCORE(1 TO 3),PLSTAT(1 TO 3),CMSTAT(1 TO 3),PLCHOICE,CMCHOICE\n140 CALL INIC\n150 DO\n160 CALL GUESS\n170 PRINT :PRINT \"Rock, paper, or scissors (1 = rock, 2 = paper, 3 = scissors, ESC = quit)\"\n180 DO\n190 LET K$=INKEY$\n200 LOOP UNTIL K$>=\"1\" AND K$<=\"3\" OR K$=CHR$(27)\n210 IF K$=CHR$(27) THEN EXIT DO\n220 LET PLCHOICE=VAL(K$)\n230 LET CMSTAT(CMCHOICE)=CMSTAT(CMCHOICE)+1:LET PLSTAT(PLCHOICE)=PLSTAT(PLCHOICE)+1\n240 PRINT \"You chose \";CH$(PLCHOICE);\" and I chose \";CH$(CMCHOICE);\".\"\n250 SET #102:INK 3\n260 IF PLCHOICE=CMCHOICE THEN\n270 PRINT \"Tie!\"\n280 LET SCORE(3)=SCORE(3)+1\n290 ELSE IF CMCHOICE=PLWINS(PLCHOICE) THEN\n300 PRINT \"You won!\"\n310 LET SCORE(1)=SCORE(1)+1\n320 ELSE\n330 PRINT \"I won!\"\n340 LET SCORE(2)=SCORE(2)+1\n350 END IF\n360 SET #102:INK 1\n370 LOOP\n380 PRINT :PRINT \"Some useless statistics:\"\n390 PRINT \"You won\";SCORE(1);\"times, and I won\";SCORE(2);\"times;\";SCORE(3);\"ties.\"\n400 PRINT :PRINT ,,CH$(1),CH$(2),CH$(3)\n410 PRINT \"You chose:\",PLSTAT(1),PLSTAT(2),PLSTAT(3)\n420 PRINT \" I chose:\",CMSTAT(1),CMSTAT(2),CMSTAT(3)\n430 END\n440 DEF INIC\n450 LET CH$(1)=\"rock\":LET CH$(2)=\"paper\":LET CH$(3)=\"scissors\"\n460 LET PLWINS(1)=3:LET PLWINS(2)=1:LET PLWINS(3)=2\n470 FOR I=1 TO 3\n480 LET PLSTAT(I),CMSTAT(I),SCORE(I)=0\n490 NEXT\n500 TEXT 80\n510 END DEF\n520 DEF GUESS\n530 LET CMCHOICE=INT(RND*(PLSTAT(1)+PLSTAT(2)+PLSTAT(3)+3))\n540 SELECT CASE CMCHOICE\n550 CASE 0 TO PLSTAT(1)\n560 LET CMCHOICE=2\n570 CASE PLSTAT(1)+1 TO PLSTAT(1)+PLSTAT(2)+1\n580 LET CMCHOICE=3\n590 CASE ELSE\n600 LET CMCHOICE=1\n610 END SELECT\n620 END DEF\n","language":"IS-BASIC"},{"code":"require'general/misc/prompt strings' NB. was 'misc strings' in older versions of J\ngame=:3 :0\n outcomes=. rps=. 0 0 0\n choice=. 1+?3\n while.#response=. prompt' Choose Rock, Paper or Scissors: ' do.\n playerchoice=. 1+'rps' i. tolower {.deb response\n if.4 = playerchoice do.\n smoutput 'Unknown response.'\n smoutput 'Enter an empty line to quit'\n continue.\n end.\n smoutput ' I choose ',choice {::;:'. Rock Paper Scissors'\n smoutput (wintype=. 3 | choice-playerchoice) {:: 'Draw';'I win';'You win'\n outcomes=. outcomes+0 1 2 = wintype\n rps=. rps+1 2 3=playerchoice\n choice=. 1+3|(?0) I.~ (}:%{:)+/\\ 0, rps\n end.\n ('Draws:','My wins:',:'Your wins: '),.\":,.outcomes\n)\n","language":"J"},{"code":" game''\n Choose Rock, Paper or Scissors: rock\n I choose Scissors\nYou win\n Choose Rock, Paper or Scissors: rock\n I choose Paper\nI win\n Choose Rock, Paper or Scissors: rock\n I choose Paper\nI win\n Choose Rock, Paper or Scissors: rock\n I choose Paper\nI win\n Choose Rock, Paper or Scissors: rock\n I choose Paper\nI win\n Choose Rock, Paper or Scissors:\nDraws: 0\nMy wins: 4\nYour wins: 1\n","language":"J"},{"code":"import java.util.Arrays;\nimport java.util.EnumMap;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Scanner;\nimport java.util.Random;\n\npublic class RPS {\n\tpublic enum Item{\n\t\tROCK, PAPER, SCISSORS, /*LIZARD, SPOCK*/;\n\t\tpublic List<Item> losesToList;\n\t\tpublic boolean losesTo(Item other) {\n\t\t\treturn losesToList.contains(other);\n\t\t}\n\t\tstatic {\n\t\t\tSCISSORS.losesToList = Arrays.asList(ROCK/*, SPOCK*/);\n\t\t\tROCK.losesToList = Arrays.asList(PAPER/*, SPOCK*/);\n\t\t\tPAPER.losesToList = Arrays.asList(SCISSORS/*, LIZARD*/);\n\t\t\t/*\n\t\t\tSPOCK.losesToList = Arrays.asList(PAPER, LIZARD);\n\t\t\tLIZARD.losesToList = Arrays.asList(SCISSORS, ROCK);\n\t\t\t*/\n }\n\t}\n\t//EnumMap uses a simple array under the hood\n\tpublic final Map<Item, Integer> counts = new EnumMap<Item, Integer>(Item.class){{\n\t\tfor(Item item:Item.values())\n\t\t\tput(item, 1);\n\t}};\n\n\tprivate int totalThrows = Item.values().length;\n\n\tpublic static void main(String[] args){\n\t\tRPS rps = new RPS();\n\t\trps.run();\n\t}\n\n\tpublic void run() {\n\t\tScanner in = new Scanner(System.in);\n\t\tSystem.out.print(\"Make your choice: \");\n\t\twhile(in.hasNextLine()){\n\t\t\tItem aiChoice = getAIChoice();\n\t\t\tString input = in.nextLine();\n\t\t\tItem choice;\n\t\t\ttry{\n\t\t\t\tchoice = Item.valueOf(input.toUpperCase());\n\t\t\t}catch (IllegalArgumentException ex){\n\t\t\t\tSystem.out.println(\"Invalid choice\");\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tcounts.put(choice, counts.get(choice) + 1);\n\t\t\ttotalThrows++;\n\t\t\tSystem.out.println(\"Computer chose: \" + aiChoice);\n\t\t\tif(aiChoice == choice){\n\t\t\t\tSystem.out.println(\"Tie!\");\n\t\t\t}else if(aiChoice.losesTo(choice)){\n\t\t\t\tSystem.out.println(\"You chose...wisely. You win!\");\n\t\t\t}else{\n\t\t\t\tSystem.out.println(\"You chose...poorly. You lose!\");\n\t\t\t}\n\t\t\tSystem.out.print(\"Make your choice: \");\n\t\t}\n\t}\n\n\tprivate static final Random rng = new Random();\n\tprivate Item getAIChoice() {\n\t\tint rand = rng.nextInt(totalThrows);\n\t\tfor(Map.Entry<Item, Integer> entry:counts.entrySet()){\n\t\t\tItem item = entry.getKey();\n\t\t\tint count = entry.getValue();\n\t\t\tif(rand < count){\n\t\t\t\tList<Item> losesTo = item.losesToList;\n\t\t\t\treturn losesTo.get(rng.nextInt(losesTo.size()));\n\t\t\t}\n\t\t\trand -= count;\n\t\t}\n\t\treturn null;\n\t}\n}\n","language":"Java"},{"code":"const logic = {\n rock: { w: 'scissor', l: 'paper'},\n paper: {w:'rock', l:'scissor'},\n scissor: {w:'paper', l:'rock'},\n}\n\nclass Player {\n constructor(name){\n this.name = name;\n }\n setChoice(choice){\n this.choice = choice;\n }\n challengeOther(PlayerTwo){\n return logic[this.choice].w === PlayerTwo.choice;\n }\n}\n\nconst p1 = new Player('Chris');\nconst p2 = new Player('John');\n\np1.setChoice('rock');\np2.setChoice('scissor');\n\np1.challengeOther(p2); //true (Win)\n","language":"JavaScript"},{"code":"# To quit, enter a blank line or type \"q\" or \"quit\"\ndef choices: [\"r\", \"p\", \"s\", \"q\"];\n\n# The main source of entropy for this pseudo pseudo random number generator is the player :-)\n# PRN in range(0;3)\ndef rand: now * 100 | floor | tostring[-2:] | tonumber % 3;\n\ndef tallies:\n {pWins: 0, # player wins\n cWins: 0, # computer wins\n draws: 0, # neither wins\n games: 0, # games played\n pFreqs: [0, 0, 0] # player frequencies for each choice (rps)\n};\n\n# Update the tallies and populate .emit\ndef update($pChoice; $cChoice):\n if $pChoice == \"r\" and $cChoice == \"s\"\n then .emit += \"Rock breaks scissors - You win!\"\n | .pWins += 1\n elif $pChoice == \"p\" and $cChoice == \"r\"\n then .emit += \"Paper covers rock - You win!\"\n | .pWins += 1\n elif $pChoice == \"s\" and $cChoice == \"p\"\n then .emit += \"Scissors cut paper - You win!\"\n | .pWins += 1\n elif $pChoice == \"s\" and $cChoice == \"r\"\n then .emit += \"Rock breaks scissors - Computer wins!\"\n | .cWins += 1\n elif $pChoice == \"r\" and $cChoice == \"p\"\n then .emit += \"Paper covers rock - Computer wins!\"\n | .cWins += 1\n elif $pChoice == \"p\" and $cChoice == \"s\"\n then .emit += \"Scissors cut paper - Computer wins!\"\n | .cWins += 1\n else .emit += \"It's a draw!\"\n | .draws += 1\n end\n | .pFreqs[choices|index($pChoice)] += 1\n | .games += 1 ;\n\ndef printScore:\n \"Wins: You \\(.pWins), Computer \\(.cWins), Neither \\(.draws)\\n\";\n\n\ndef getComputerChoice:\n # make a completely random choice until 3 games have been played\n if .games < 3 then choices[rand]\n else .games as $games\n | (.pFreqs | map(3 * . / $games)) as $pFreqs\n | rand as $num\n | if $num < $pFreqs[0] then \"p\"\n elif $num < $pFreqs[0] + $pFreqs[1] then \"s\"\n else \"r\"\n end\n end ;\n\n# Get player's choice (empty line or q or quit to quit).\n# Return false if the choice is not recognized.\ndef pChoice:\n (first(inputs) // null) as $in\n | if $in == null or $in == \"q\" or $in == \"quit\" then null\n else ($in|ascii_downcase) as $in\n | if any(choices[]; . == $in) then $in\n else false\n end\n end;\n\n# Solicit input\ndef prompt:\n if .games == 0\n then \"Enter: (r)ock, (p)aper, (s)cissors or (q)uit\"\n else printScore + \"---\\n\\nYour choice r/p/s/q : \"\n end;\n\ndef play:\n label $out\n | foreach range(1; infinite) as $i (tallies ;\n # if .prompt then it is time to get input:\n if .prompt\n then pChoice as $pChoice\n | if $pChoice == null\n then .prompt = false\n\t| .emit = \"OK, quitting\", break $out\n elif $pChoice == false\n\tthen .emit = \"Valid responses are one of r p s q\\nPlease try again.\"\n else getComputerChoice as $cChoice\n\t| .prompt = false\n | .emit = \"Computer's choice : \\($cChoice)\\n\"\n | update($pChoice; $cChoice)\n end\n else .prompt = prompt\n | .emit = null\n end )\n\n | select(.emit).emit,\n select(.prompt).prompt ;\n\nplay\n","language":"Jq"},{"code":"function rps()\n\tprint(\"Welcome to Rock, paper, scissors! Go ahead and type your pick.\\n\n\t\tr(ock), p(aper), or s(cissors)\\n\n\t\tEnter 'q' to quit.\\n>\")\n\tcomp_score = 0\n\tuser_score = 0\n\toptions = [\"r\",\"p\",\"s\"]\n\tnew_pick() = options[rand(1:3)]\n\ti_win(m,y) = ((m == \"r\" && y == \"s\")|(m == \"s\" && y == \"p\")|(m == \"p\" && y == \"r\"))\n\twhile true\n\t\tinput = string(readline(STDIN)[1])\n\t\tinput == \"q\" && break\n\t\t!ismatch(r\"^[rps]\",input) && begin print(\"Invalid guess: Please enter 'r', 'p', or 's'\\n\"); continue end\n\t\tanswer = new_pick()\n\t\tif input == answer\n\t\t\tprint(\"\\nTie!\\nScore still: \\nyou $user_score\\nme $comp_score\\n>\")\n\t\t\tcontinue\n\t\telse\n\t\t\ti_win(answer,input) ? (comp_score += 1) : (user_score += 1)\n\t\t\tprint(i_win(answer,input) ? \"\\nSorry you lose!\\n\" : \"\\nYou win!\",\"Score: \\nyou $user_score\\nme $comp_score\\n>\")\n\t\tend\n\tend\nend\n","language":"Julia"},{"code":"// version 1.2.10\n\nimport java.util.Random\n\nconst val choices = \"rpsq\"\nval rand = Random()\n\nvar pWins = 0 // player wins\nvar cWins = 0 // computer wins\nvar draws = 0 // neither wins\nvar games = 0 // games played\nval pFreqs = arrayOf(0, 0, 0) // player frequencies for each choice (rps)\n\nfun printScore() = println(\"Wins: You $pWins, Computer $cWins, Neither $draws\\n\")\n\nfun getComputerChoice(): Char {\n // make a completely random choice until 3 games have been played\n if (games < 3) return choices[rand.nextInt(3)]\n val num = rand.nextInt(games)\n return when {\n num < pFreqs[0] -> 'p'\n num < pFreqs[0] + pFreqs[1] -> 's'\n else -> 'r'\n }\n}\n\nfun main(args: Array<String>) {\n println(\"Enter: (r)ock, (p)aper, (s)cissors or (q)uit\\n\")\n while (true) {\n printScore()\n var pChoice: Char\n while (true) {\n print(\"Your choice r/p/s/q : \")\n val input = readLine()!!.toLowerCase()\n if (input.length == 1) {\n pChoice = input[0]\n if (pChoice in choices) break\n }\n println(\"Invalid choice, try again\")\n }\n if (pChoice == 'q') {\n println(\"OK, quitting\")\n return\n }\n val cChoice = getComputerChoice()\n println(\"Computer's choice : $cChoice\")\n if (pChoice == 'r' && cChoice == 's') {\n println(\"Rock breaks scissors - You win!\")\n pWins++\n }\n else if (pChoice == 'p' && cChoice == 'r') {\n println(\"Paper covers rock - You win!\")\n pWins++\n }\n else if (pChoice == 's' && cChoice == 'p') {\n println(\"Scissors cut paper - You win!\")\n pWins++\n }\n else if (pChoice == 's' && cChoice == 'r') {\n println(\"Rock breaks scissors - Computer wins!\")\n cWins++\n }\n else if (pChoice == 'r' && cChoice == 'p') {\n println(\"Paper covers rock - Computer wins!\")\n cWins++\n }\n else if (pChoice == 'p' && cChoice == 's') {\n println(\"Scissors cut paper - Computer wins!\")\n cWins++\n }\n else {\n println(\"It's a draw!\")\n draws++\n }\n pFreqs[choices.indexOf(pChoice)]++\n games++\n println()\n }\n}\n","language":"Kotlin"},{"code":"session_start('user')\nsession_addvar('user', 'historic_choices')\nsession_addvar('user', 'win_record')\nsession_addvar('user', 'plays')\nvar(historic_choices)->isNotA(::map) ? var(historic_choices = map('rock'=0, 'paper'=0, 'scissors'=0))\nvar(plays)->isNotA(::integer) ? var(plays = 0)\nvar(win_record)->isNotA(::array) ? var(win_record = array)\n\ndefine br => '<br>'\ndefine winner(c::string,p::string) => {\n\tif(#c == $superior->find(#p)) => {\n\t\t$win_record->insert('lasso')\n\t\treturn 'Lasso'\n\telse(#p == $superior->find(#c))\n\t\t$win_record->insert('user')\n\t\treturn 'User'\n\telse\n\t\t$win_record->insert('tie')\n\t\treturn 'Nobody'\n\t\t}\n\t}\n\n\tvar(\n\t\tchoice \t\t\t\t= web_request->param('choice')->asString,\n\tlookup \t\t\t\t= array('rock', 'paper', 'scissors'),\n\tcomputer_choice \t= $lookup->get(math_random(3,1)),\n\tsuperior\t\t\t= map('rock'='paper', 'paper'='scissors', 'scissors'='rock'),\n\tcontrols\t\t\t= '<a href=?choice=rock>Rock</a> <a href=?choice=paper>Paper</a> <a href=?choice=scissors>Scissors</a> <a href=?choice=quit>Quit</a><br/>'\n)\nif($choice == 'quit') => {^\n\t'See ya. <a href=?>Start over</a>'\n\tsession_end('user')\n\t$historic_choices = map('rock'=0, 'paper'=0, 'scissors'=0)\n\t$plays = 0\n\t$win_record = array\n\t\nelse(array('rock','paper','scissors') >> $choice)\n\t\t$controls\n\n\t\tif($plays != 0) => {\n\t\t\tlocal('possibilities') = array\n\t\t\twith i in $lookup do => {\n\t\t\t\tloop($historic_choices->find(#i)) => { #possibilities->insert(#i) }\n\t\t\t}\n\t\t\t\n\t\t\t$computer_choice = $superior->find(#possibilities->get(math_random($plays,1)))\n\t\t}\n\n\t\t'User chose ' + $choice + br\n\t'Lasso chose ' + $computer_choice + br\n\twinner($computer_choice->asString, $choice) + ' wins!'\n\n\t\t$historic_choices->find($choice) = $historic_choices->find($choice)+1\n\t\t$plays += 1\n\n\telse($choice->size == 0)\n\t\t$controls\n\n\telse\n\t\t'Invalid Choice.'+ br + $controls\n^}\nif($win_record->size) => {^\n\tbr\n\tbr\n\t'Win record: '+br\n\t'Lasso: '+($win_record->find('lasso')->size)+br\n\t'User: '+($win_record->find('user')->size)+br\n\t'Tie: '+($win_record->find('tie')->size)+br\n^}\n","language":"Lasso"},{"code":"dim rps( 2), g$( 3)\n\ng$( 0) =\"rock\": g$( 1) =\"paper\": g$( 2) =\"scissors\"\nglobal total\n\ntotal =0: draw =0: pwin =0: cwin =0\n\nrps( 0) =1: rps( 1) =1: rps( 2) =1 ' at first computer will play all three with equal probability\n\nc =int( 3 *rnd( 1)) ' first time, computer response is random\n\n' In the following code we set three integer %ages for the <human>'s biassed throws.\n ' set up the <human> player's key frequencies as %ages.\n ' Done like this it's easy to mimic the <human> input of q$\n ' It allows only integer %age frequency- not an important thing.\nrockP =45 ' <<<<<<<<< Set here the <human>'s %age of 'rock' choices.\nfor i =1 to rockP: qF$ =qF$ +\"R\": next i\n\npaprP =24 ' <<<<<<<<< Set here the %age of 'paper' choices.\nfor i =1 to paprP: qF$ =qF$ +\"P\": next i\n\nscisP =100 -rockP -paprP ' <<<<<<<<< %age 'scissors' calculated to make 100%\nfor i =1 to scisP: qF$ =qF$ +\"S\": next i\n'print qF$\n\ndo\n 'do: input q$:loop until instr( \"RPSrpsQq\", q$) ' for actual human input... possibly biassed. <<<<<<<<<<<<< REM one or the other line...\n q$ =mid$( qF$, int( 100 *rnd( 1)), 1) ' simulated <human> input with controlled bias. <<<<<<<<<<<<<\n\n if total >10000 then q$ =\"Q\"\n\n g =int( ( instr( \"RrPpSsQq\", q$) -1) / 2)\n if g >2 then [endGame]\n\n total =total +1\n rps( g) =rps( g) +1 ' accumulate plays the <human> has chosen. ( & hence their (biassed?) frequencies.)\n 'print \" You chose \"; g$( g); \" and I chose \"; g$( c); \". \"\n\n select case g -c\n case 0\n draw =draw +1 ':print \"It's a draw\"\n case 1, -2\n pwin =pwin +1 ':print \"You win!\"\n case -1, 2\n cwin =cwin +1 ':print \"I win!\"\n end select\n\n r =int( total *rnd( 1)) ' Now select computer's choice for next confrontation.\n select case ' Using the accumulating data about <human>'s frequencies so far.\n case r <=rps( 0)\n c =1\n case r <=( rps( 0) +rps( 1))\n c =2\n case else\n c =0\n end select\n\n scan\nloop until 0\n\n[endGame]\n print\n print \" You won \"; pwin; \", and I won \"; cwin; \". There were \"; draw; \" draws.\"\n if cwin >pwin then print \" I AM THE CHAMPION!!\" else print \" You won this time.\"\n print\n print \" At first I assumed you'd throw each equally often.\"\n print \" This means I'd win 1 time in 3; draw 1 in 3; lose 1 in 3.\"\n print \" However if I detect a bias in your throws,....\"\n print \" ....this allows me to anticipate your most likely throw & on average beat it.\"\n print\n print \" In fact, keyboard layout & human frailty mean even if you TRY to be even & random...\"\n print \" ... you may be typing replies with large bias. In 100 tries I gave 48 'P's, 29 'R' & 23 'S'!\"\n print\n print \" This time I played..\"\n print \" Rock \"; using( \"##.##\", rps( 2)* 100 /total); \"% Paper \"; using( \"##.##\", rps( 0) *100 /total); \"% Scissors \"; using( \"##.##\", rps( 1) *100 /total); \"%.\"\n print\n print \" ( PS. I have since learned your actual bias had been..\"\n print \" Rock \"; using( \"##.##\", rockP); \"% Paper \"; using( \"##.##\", paprP ); \"% Scissors \"; using( \"##.##\", ( 100 -rockP -paprP)); \"%.)\"\n print\n print \" The advantage I can gain gets bigger the further the 'human' entries are biassed.\"\n print \" The results statistically smooth out better with large runs.\"\n print \" Try 10,000,000, & have a cuppa while you wait.\"\n print\n print \" Can you see what will happen if, say, the 'human' is set to give 'Rock' EVERY time?\"\n print \" Try different %ages by altering the marked code lines.\"\n print\n print \" Thanks for playing!\"\n end\n","language":"Liberty-BASIC"},{"code":"10 mode 1:defint a-z:randomize time\n20 rps$=\"rps\"\n30 msg$(1)=\"Rock breaks scissors\"\n40 msg$(2)=\"Paper covers rock\"\n50 msg$(3)=\"Scissors cut paper\"\n60 print \"Rock Paper Scissors\":print\n70 print \"Enter r, p, or s as your play.\"\n80 print \"Running score shown as <your wins>:<my wins>\"\n90 achoice=rnd*2.99+.5 ' get integer between 1 and 3 from real between .5 and <3.5\n100 ' get key\n110 pin$=inkey$\n120 if pin$=\"\" then 110\n130 pchoice=instr(rps$,pin$)\n140 if pchoice=0 then print \"Sorry?\":goto 110\n150 pcf(pchoice)=pcf(pchoice)+1\n160 plays=plays+1\n170 print \"My play: \"mid$(rps$,achoice,1)\n180 sw=(achoice-pchoice+3) mod 3\n190 if sw=0 then print \"Tie.\" else if sw=1 then print msg$(achoice);\". My point.\":ascore=ascore+1 else print msg$(pchoice);\". Your point.\":pscore=pscore+1\n200 print pscore\":\"ascore\n210 rn=rnd*plays\n220 if rn<pcf(1) then achoice=2 else if rn<pcf(1)+pcf(2) then achoice=3 else achoice=1\n230 goto 110\n","language":"Locomotive-Basic"},{"code":"function cpuMove()\n local totalChance = record.R + record.P + record.S\n if totalChance == 0 then -- First game, unweighted random\n local choice = math.random(1, 3)\n if choice == 1 then return \"R\" end\n if choice == 2 then return \"P\" end\n if choice == 3 then return \"S\" end\n end\n local choice = math.random(1, totalChance) -- Weighted random bit\n if choice <= record.R then return \"P\" end\n if choice <= record.R + record.P then return \"S\" end\n return \"R\"\nend\n\nfunction playerMove() -- Get user input for choice of 'weapon'\n local choice\n repeat\n os.execute(\"cls\") -- Windows specific command, change per OS\n print(\"\\nRock, Paper, Scissors\")\n print(\"=====================\\n\")\n print(\"Scores -\\tPlayer:\", score.player)\n print(\"\\t\\tCPU:\", score.cpu .. \"\\n\\t\\tDraws:\", score.draws)\n io.write(\"\\nChoose [R]ock [P]aper or [S]cissors: \")\n choice = io.read():upper():sub(1, 1)\n until choice == \"R\" or choice == \"P\" or choice == \"S\"\n return choice\nend\n\n-- Decide who won, increment scores\nfunction checkWinner (c, p)\n io.write(\"I chose \")\n if c == \"R\" then print(\"rock...\") end\n if c == \"P\" then print(\"paper...\") end\n if c == \"S\" then print(\"scissors...\") end\n if c == p then\n print(\"\\nDraw!\")\n score.draws = score.draws + 1\n elseif (c == \"R\" and p == \"P\") or\n (c == \"P\" and p == \"S\") or\n (c == \"S\" and p == \"R\") then\n print(\"\\nYou win!\")\n score.player = score.player + 1\n else\n print(\"\\nYou lose!\")\n score.cpu = score.cpu + 1\n end\nend\n\n-- Main procedure\nmath.randomseed(os.time())\nscore = {player = 0, cpu = 0, draws = 0}\nrecord = {R = 0, P = 0, S = 0}\nlocal playerChoice, cpuChoice\nrepeat\n cpuChoice = cpuMove()\n playerChoice = playerMove()\n record[playerChoice] = record[playerChoice] + 1\n checkWinner(cpuChoice, playerChoice)\n io.write(\"\\nPress ENTER to continue or enter 'Q' to quit . . . \")\nuntil io.read():upper():sub(1, 1) == \"Q\"\n","language":"Lua"},{"code":"DynamicModule[{record, play, text = \"\\nRock-paper-scissors\\n\",\n choices = {\"Rock\", \"Paper\", \"Scissors\"}},\n Evaluate[record /@ choices] = {1, 1, 1};\n play[x_] :=\n Module[{y = RandomChoice[record /@ choices -> RotateLeft@choices]},\n record[x]++;\n text = \"Your Choice:\" <> x <> \"\\nComputer's Choice:\" <> y <> \"\\n\" <>\n Switch[{x, y}, Alternatives @@ Partition[choices, 2, 1, 1],\n \"You lost.\",\n Alternatives @@ Reverse /@ Partition[choices, 2, 1, 1],\n \"You win.\", _, \"Draw.\"]];\n Column@{Dynamic[text], ButtonBar[# :> play[#] & /@ choices]}]\n","language":"Mathematica"},{"code":":- module rps.\n:- interface.\n:- import_module io.\n:- pred main(io::di, io::uo) is det.\n:- implementation.\n:- use_module random, exception.\n:- import_module list, string.\n\n:- type play\n ---> rock\n ; paper\n ; scissors.\n\n:- pred beats(play, play).\n:- mode beats(in, in) is semidet.\nbeats(rock, scissors).\nbeats(paper, rock).\nbeats(scissors, paper).\n\n:- pred random(play::out, random.supply::mdi, random.supply::muo) is det.\nrandom(Play, !RS) :-\n random.random(1, 3, N, !RS),\n ( if N = 1 then\n Play = rock\n else if N = 2 then\n Play = paper\n else\n Play = scissors\n ).\n\nmain(!IO) :-\n seed(Seed, !IO),\n random.init(Seed, RS),\n play(RS, !IO).\n\n:- pred play(random.supply::mdi, io::di, io::uo) is det.\nplay(!.RS, !IO) :-\n io.write_string(\"Your choice? \", !IO),\n io.read(Res, !IO),\n (\n Res = ok(Play),\n random(Counter, !RS),\n io.format(\"The computer chose %s\\n\", [s(string(Counter))], !IO),\n ( if beats(Counter, Play) then\n io.write_string(\"Computer wins.\\n\", !IO)\n else if beats(Play, Counter) then\n io.write_string(\"You win!\\n\", !IO)\n else\n io.write_string(\"It is a draw\\n\", !IO)\n ),\n play(!.RS, !IO)\n ;\n Res = eof\n ;\n Res = error(_, _),\n exception.throw(Res)\n ).\n\n:- pragma foreign_decl(\"C\", \"#include <time.h>\").\n:- pred seed(int::out, io::di, io::uo) is det.\n:- pragma foreign_proc(\"C\",\n seed(Seed::out, _IO0::di, _IO::uo),\n [promise_pure, will_not_call_mercury],\n\"\n Seed = time(NULL);\n\").\n","language":"Mercury"},{"code":"import random, strutils, tables\n\ntype\n Choice {.pure.} = enum Rock, Paper, Scissors\n History = tuple[total: int; counts: CountTable[Choice]]\n\nconst Successor: array[Choice, Choice] = [Paper, Scissors, Rock]\n\nfunc `>`(a, b: Choice): bool =\n ## By construction, only the successor is greater than the choice.\n a == Successor[b]\n\nproc choose(history: History): Choice =\n ## Make a weighted random choice using the player counts\n ## then select the choice likely to beat it.\n var value = rand(1..history.total)\n for choice, count in history.counts.pairs:\n if value <= count:\n return Successor[choice]\n dec value, count\n\n\nrandomize()\n\n# Initialize history with one for each choice in order to avoid special case.\nvar history: History = (3, [Rock, Paper, Scissors].toCountTable)\n\necho \"To quit game, type 'q' when asked for your choice.\"\n\nvar myChoice, yourChoice: Choice\nvar myWins, yourWins = 0\n\nwhile true:\n\n # Get player choice.\n try:\n stdout.write \"Rock(1), paper(2), scissors(3). Your choice? \"\n let answer = stdin.readLine().strip()\n if answer == \"q\":\n quit \"Quitting game.\", QuitSuccess\n if answer notin [\"1\", \"2\", \"3\"]:\n echo \"Invalid choice.\"\n continue\n yourChoice = Choice(ord(answer[0]) - ord('1'))\n except EOFError:\n quit \"Quitting game.\", QuitFailure\n\n # Make my choice.\n myChoice = history.choose()\n echo \"I choosed \", myChoice, '.'\n history.counts.inc yourChoice\n inc history.total\n\n # Display result of round.\n if myChoice == yourChoice:\n echo \"It’s a tie.\"\n elif myChoice > yourChoice:\n echo \"I win.\"\n inc myWins\n else:\n echo \"You win.\"\n inc yourWins\n echo \"Total wins. You: \", yourWins, \" Me: \", myWins\n","language":"Nim"},{"code":"10 COMPUTER=RND(3)+1\n20 COMPUTER$=\"ROCK\"\n30 IF COMPUTER=2 THEN COMPUTER$=\"PAPER\"\n40 IF COMPUTER=3 THEN COMPUTER$=\"SCISSORS\"\n50 INPUT \"ROCK, PAPER OR SCISSORS? \",HUMAN$\n60 IF HUMAN$=\"ROCK\" THEN GOTO 100\n70 IF HUMAN$=\"PAPER\" THEN GOTO 100\n80 IF HUMAN$=\"SCISSORS\" THEN GOTO 100\n90 PRINT \"INVALID GUESS. TRY AGAIN.\": GOTO 50\n100 PRINT \"YOU CHOSE \"HUMAN$\" AND THE COMPUTER CHOSE \"COMPUTER$\".\"\n110 IF HUMAN$=COMPUTER$ THEN PRINT \"THOSE ARE THE SAME CHOICES\";\", SO YOU TIED.\"\n120 IF HUMAN$=\"ROCK\" AND COMPUTER=2 THEN PRINT \"PAPER COVERS ROCK, SO YOU LOSE.\"\n130 IF HUMAN$=\"ROCK\" AND COMPUTER=3 THEN PRINT \"ROCK BLUNTS SCISSORS\";\", SO YOU WIN.\"\n140 IF HUMAN$=\"PAPER\" AND COMPUTER=1 THEN PRINT \"PAPER COVERS ROCK, SO YOU WIN.\"\n150 IF HUMAN$=\"PAPER\" AND COMPUTER=3 THEN PRINT \"SCISSORS CUT PAPER\";\", SO YOU LOSE.\"\n160 IF HUMAN$=\"SCISSORS\" AND COMPUTER=1 THEN PRINT \"ROCK BLUNTS SCISSORS\";\", SO YOU LOSE.\"\n170 IF HUMAN$=\"SCISSORS\" AND COMPUTER=2 THEN PRINT \"SCISSORS CUT PAPER, SO YOU WIN.\"10 COMPUTER=RND(3)+1\n","language":"NS-HUBASIC"},{"code":"let pf = Printf.printf ;;\n\nlet looses a b = match a, b with\n `R, `P -> true\n | `P, `S -> true\n | `S, `R -> true\n | _, _ -> false ;;\n\nlet rec get_move () =\n pf \"[R]ock, [P]aper, [S]cisors [Q]uit? \" ;\n match String.uppercase (read_line ()) with\n \"P\" -> `P\n | \"S\" -> `S\n | \"R\" -> `R\n | \"Q\" -> exit 0\n | _ -> get_move () ;;\n\nlet str_of_move = function\n `P -> \"paper\"\n | `R -> \"rock\"\n | `S -> \"scisors\" ;;\n\nlet comp_move r p s =\n let tot = r +. p +. s in\n let n = Random.float 1.0 in\n if n < r /. tot then\n `R\n else\n if n < (r +. p) /. tot then\n `P\n else\n `S ;;\n\nlet rec make_moves r p s =\n let cm = comp_move r p s in (* Computer move is based on game history. *)\n let hm = get_move () in (* Human move is requested. *)\n pf \"Me: %s. You: %s. \" (str_of_move cm) (str_of_move hm);\n let outcome =\n if looses hm cm then\n \"I win. You loose.\\n\"\n else if cm = hm then\n \"We draw.\\n\"\n else\n \"You win. I loose.\\n\"\n in pf \"%s\" outcome;\n match hm with (* Play on with adapted strategy. *)\n `S -> make_moves (r +. 1.) p s\n | `R -> make_moves r (p +. 1.) s\n | `P -> make_moves r p (s +. 1.) ;;\n\n(* Main loop. *)\nmake_moves 1. 1. 1. ;;\n","language":"OCaml"},{"code":"contest(rounds)={\n my(v=[1,1,1],wins,losses); \\\\ Laplace rule\n for(i=1,rounds,\n my(computer,player,t);\n t=random(v[1]+v[2]+v[3]);\n if(t<v[1], computer = \"R\",\n if(t<v[1]+v[2], computer = \"P\", computer = \"S\")\n );\n print(\"Rock, paper, or scissors?\");\n t = Str(input());\n if(#t,\n player=Vec(t)[1];\n if(player <> \"R\" && player <> \"P\", player = \"S\")\n ,\n player = \"S\"\n );\n if (player == \"R\", v[2]++);\n if (player == \"P\", v[3]++);\n if (player == \"S\", v[1]++);\n print1(player\" vs. \"computer\": \");\n if (computer <> player,\n if((computer == \"R\" && player = \"P\") || (computer == \"P\" && player = \"S\") || (computer == \"S\" && player == \"R\"),\n print(\"You win\");\n losses++\n ,\n print(\"I win\");\n wins++\n )\n ,\n print(\"Tie\");\n )\n );\n [wins,losses]\n};\ncontest(10)\n","language":"PARI-GP"},{"code":"use 5.012;\nuse warnings;\nuse utf8;\nuse open qw(:encoding(utf-8) :std);\nuse Getopt::Long;\n\npackage Game {\n use List::Util qw(shuffle first);\n\n my $turns = 0;\n my %human_choice = ( rock => 0, paper => 0, scissors => 0, );\n my %comp_choice = ( rock => 0, paper => 0, scissors => 0, );\n my %what_beats =\n ( rock => 'paper', paper => 'scissors', scissors => 'rock', );\n my $comp_wins = 0;\n my $human_wins = 0;\n my $draws = 0;\n\n sub save_human_choice {\n my $ch = lc pop;\n if ( exists $human_choice{ $ch } ) {\n ++$human_choice{ $ch };\n }\n else {\n die __PACKAGE__ . \":: wrong choice: '$ch'\";\n }\n }\n\n sub get_comp_choice {\n my @keys = shuffle keys %human_choice;\n my $ch;\n my ( $prob, $rand ) = ( 0, rand );\n $ch = ( first { $rand <= ( $prob += ( $human_choice{ $_ } / $turns ) ) } @keys )\n if $turns > 0;\n $ch //= $keys[0];\n $ch = $what_beats{ $ch };\n ++$comp_choice{ $ch };\n return $ch;\n }\n\n sub make_turn {\n my ( $comp_ch, $human_ch ) = ( pop(), pop() );\n ++$turns;\n if ( $what_beats{ $human_ch } eq $comp_ch ) {\n ++$comp_wins;\n return 'I win!';\n }\n elsif ( $what_beats{ $comp_ch } eq $human_ch ) {\n ++$human_wins;\n return 'You win!';\n }\n else {\n ++$draws;\n return 'Draw!';\n }\n }\n\n sub get_final_report {\n my $report =\n \"You chose:\\n\"\n . \" rock = $human_choice{rock} times,\\n\"\n . \" paper = $human_choice{paper} times,\\n\"\n . \" scissors = $human_choice{scissors} times,\\n\"\n . \"I chose:\\n\"\n . \" rock = $comp_choice{rock} times,\\n\"\n . \" paper = $comp_choice{paper} times,\\n\"\n . \" scissors = $comp_choice{scissors} times,\\n\"\n . \"Turns: $turns\\n\"\n . \"I won: $comp_wins, you won: $human_wins, draws: $draws\\n\";\n return $report;\n }\n}\n\nsub main {\n GetOptions( 'quiet' => \\my $quiet );\n greet() if !$quiet;\n while (1) {\n print_next_line() if !$quiet;\n my $input = get_input();\n last unless $input;\n if ( $input eq 'error' ) {\n print \"I don't understand!\\n\" if !$quiet;\n redo;\n }\n my $comp_choice = Game::get_comp_choice();\n Game::save_human_choice($input);\n my $result = Game::make_turn( $input, $comp_choice );\n describe_turn_result( $input, $comp_choice, $result )\n if !$quiet;\n }\n print Game::get_final_report();\n}\n\nsub greet {\n print \"Welcome to the Rock-Paper-Scissors game!\\n\"\n . \"Choose 'rock', 'paper' or 'scissors'\\n\"\n . \"Enter empty line or 'quit' to quit\\n\";\n}\n\nsub print_next_line {\n print 'Your choice: ';\n}\n\nsub get_input {\n my $input = <>;\n print \"\\n\" and return if !$input; # EOF\n chomp $input;\n return if !$input or $input =~ m/\\A \\s* q/xi;\n return\n ( $input =~ m/\\A \\s* r/xi ) ? 'rock'\n : ( $input =~ m/\\A \\s* p/xi ) ? 'paper'\n : ( $input =~ m/\\A \\s* s/xi ) ? 'scissors'\n : 'error';\n}\n\nsub describe_turn_result {\n my ( $human_ch, $comp_ch, $result ) = @_;\n print \"You chose \\u$human_ch, I chose \\u$comp_ch. $result\\n\";\n}\n\nmain();\n","language":"Perl"},{"code":"perl -e '@c=qw(r p s); for(1..10000){ print $c[ rand() < 0.75 ? 0 : int rand(2) + 1 ], \"\\n\" }' | perl rps.pl --quiet\n","language":"Perl"},{"code":"--standard game\nconstant rule3 = {\"rock blunts scissors\",\n \"paper wraps rock\",\n \"scissors cut paper\"}\n--extended version\nconstant rule5 = {\"rock blunts scissors\",\n \"rock crushes lizard\",\n \"paper wraps rock\",\n \"paper disproves spock\",\n \"scissors cut paper\",\n \"scissors decapitate lizard\",\n \"lizard eats paper\",\n \"lizard poisons spock\",\n \"spock smashes scissors\",\n \"spock vaporizes rock\"}\n\nconstant rules = iff(rand(2)=1?rule3:rule5)\n\nsequence what = {}\nsequence beats = {}\nstring wkeys = \"\"\nstring question = \"What is your move \"\ninteger choices, hsum\nsequence history, cplays, pplays\n\nobject x, verb, y\n\n for i=1 to length(rules) do\n {x} = split(rules[i])\n if not find(x,what) then\n what = append(what,x)\n if find(x[1],wkeys) then\n wkeys = append(wkeys,x[$])\n question &= x[1..-2]&\"(\"&x[$]&\"), \"\n else\n wkeys = append(wkeys,x[1])\n question &= \"(\"&x[1]&\")\"&x[2..$]&\", \"\n end if\n end if\n end for\n choices = length(wkeys)\n history = repeat(1,choices)\n hsum = 3\n cplays = repeat(0,choices)\n pplays = repeat(0,choices)\n beats = repeat(repeat(0,choices),choices)\n question[-2] = '?'\n for i=1 to length(rules) do\n {x,verb,y} = split(rules[i])\n beats[find(x,what)][find(y,what)] = verb\n end for\n\ninteger cmove, pmove, draws = 0, pwins = 0, cwins = 0\n while 1 do\n cmove = rand(hsum)\n for i=1 to choices do\n cmove -= history[i]\n if cmove<=0 then\n -- predicted user choice of i, find whatever beats it\n for j=1 to choices do\n if string(beats[j][i]) then\n cmove = j\n exit\n end if\n end for\n exit\n end if\n end for\n puts(1,question)\n while 1 do\n pmove = lower(wait_key())\n if pmove='q' then exit end if\n pmove = find(pmove,wkeys)\n if pmove!=0 then exit end if\n end while\n if pmove='q' then exit end if\n\n printf(1,\"you: %s, me: %s, \",{what[pmove],what[cmove]})\n cplays[cmove] += 1\n pplays[pmove] += 1\n if cmove=pmove then\n printf(1,\"a draw.\\n\")\n draws += 1\n else\n if string(beats[cmove][pmove]) then\n printf(1,\"%s %s %s. I win.\\n\",{what[cmove],beats[cmove][pmove],what[pmove]})\n cwins += 1\n elsif string(beats[pmove][cmove]) then\n printf(1,\"%s %s %s. You win.\\n\",{what[pmove],beats[pmove][cmove],what[cmove]})\n pwins += 1\n else\n ?9/0 -- sanity check\n end if\n end if\n history[pmove] += 1\n hsum += 1\n end while\n printf(1,\"\\n\\nYour wins:%d, My wins:%d, Draws:%d\\n\",{pwins,cwins,draws})\n printf(1,\"\\n\\nYour wins:%d, My wins:%d, Draws:%d\\n\",{pwins,cwins,draws})\n printf(1,\" \") for i=1 to choices do printf(1,\"%9s\",what[i]) end for\n printf(1,\"\\nyou: \") for i=1 to choices do printf(1,\"%9d\",pplays[i]) end for\n printf(1,\"\\n me: \") for i=1 to choices do printf(1,\"%9d\",cplays[i]) end for\n","language":"Phix"},{"code":"include ..\\Utilitys.pmt\n\n 0 var wh\n 0 var wc\n\n( \"Scissors cuts Paper\"\n \"Paper covers Rock\"\n \"Rock crushes Lizard\"\n \"Lizard poisons Spock\"\n \"Spock smashes Scissors\"\n \"Scissors decapites Lizard\"\n \"Lizard eats Paper\"\n \"Paper disproves Spock\"\n \"Spock vaporizes Rock\"\n \"Rock blunts Scissors\" )\n\n \"'Rock, Paper, Scissors, Lizard, Spock!' rules are: \" ? nl\n len for\n get ?\n endfor\n nl\n\n ( ( \"S\" \"Scissors\" ) ( \"P\" \"Paper\" ) ( \"R\" \"Rock\" ) ( \"L\" \"Lizard\" ) ( \"K\" \"Spock\" ) )\n\n true while\n \"Choose (S)cissors, (P)paper, (R)ock, (L)izard, Spoc(K) or (Q)uit: \" input nl upper\n dup \"Q\" == if\n nl drop false\n else\n getd if\n dup \"You choose \" print ? var he\n rand 5 * int 1 + 2 2 tolist sget\n dup \"I choose \" print ? var ce\n he ce == if\n \"Draw\" ?\n else\n swap len for\n get dup\n split 2 del\n he ce 2 tolist\n over over == rot rot reverse == or if exitfor else drop endif\n endfor\n dup ?\n he find 1 == if wh 1 + var wh \"You win!\" else wc 1 + var wc \"I win!\" endif ? drop\n swap\n endif\n else\n print \" is a invalid input!\" ?\n endif\n true\n endif\n endwhile\n drop drop\n \"Your punctuation: \" print wh ?\n \"Mi punctuation: \" print wc ?\n wh wc > if \"You win!\" else wh wc < if \"I win!\" else \"Draw!\" endif endif ?\n","language":"Phixmonti"},{"code":"<?php\necho \"<h1>\" . \"Choose: ROCK - PAPER - SCISSORS\" . \"</h1>\";\necho \"<h2>\";\necho \"\";\n\n$player = strtoupper( $_GET[\"moves\"] );\n$wins = [\n 'ROCK' => 'SCISSORS',\n 'PAPER' => 'ROCK',\n 'SCISSORS' => 'PAPER'\n ];\n$a_i = array_rand($wins);\necho \"<br>\";\necho \"Player chooses \" . \"<i style=\\\"color:blue\\\">\" . $player . \"</i>\";\necho \"<br>\";\necho \"<br>\" . \"A.I chooses \" . \"<i style=\\\"color:red\\\">\" . $a_i . \"</i>\";\n\n$results = \"\";\nif ($player == $a_i){\n$results = \"Draw\";\n} else if($wins[$a_i] == $player ){\n $results = \"A.I wins\";\n} else {\n $results = \"Player wins\";\n}\n\necho \"<br>\" . $results;\n?>\n","language":"PHP"},{"code":"go ?=>\n println(\"\\nEnd terms with '.'.\\n'quit.' ends the session.\\n\"),\n Prev = findall(P,beats(P,_)),\n ChoiceMap = new_map([P=0 : P in Prev]),\n ResultMap = new_map([computer_wins=0,user_wins=0,draw=0]),\n play(Prev,ChoiceMap,ResultMap),\n nl,\n println(\"Summary:\"),\n println(choiceMap=ChoiceMap),\n println(resultMap=ResultMap),\n nl.\n\ngo => true.\n\n%\n% Play an interactive game.\n%\nplay(Prev,ChoiceMap,ResultMap) =>\n print(\"Your choice? \"),\n P = read_term(),\n if P == quit then\n nl,\n print_result(ResultMap)\n else\n C = choice(ChoiceMap),\n printf(\"The computer chose %w%n\", C),\n result(C,P,Prev,Next,Result),\n ChoiceMap.put(P,ChoiceMap.get(P)+1),\n ResultMap.put(Result,ResultMap.get(Result,0)+1),\n play(Next,ChoiceMap,ResultMap)\n end.\n\n%\n% Do a weighted random choice based on the user's previous choices.\n%\nweighted_choice(Map) = Choice =>\n Map2 = [(V+1)=K : K=V in Map].sort, % ensure that all choices can be made\n % Prepare the probability matrix M\n Total = sum([P : P=_ in Map2]),\n Len = Map2.len,\n M = new_array(Len,2),\n T = new_list(Len),\n foreach({I,P=C} in zip(1..Len,Map2))\n if I == 1 then\n M[I,1] := 1,\n M[I,2] := P\n else\n M[I,1] := M[I-1,2]+1,\n M[I,2] := M[I,1]+P-1\n end,\n T[I] := C\n end,\n M[Len,2] := Total,\n\n % Pick a random number in 1..Total\n R = random(1,Total),\n Choice = _,\n % Check were R match\n foreach(I in 1..Len, var(Choice))\n if M[I,1] <= R, M[I,2] >= R then\n Choice := T[I]\n end\n end.\n\n%\n% Check probably best counter choice.\n%\nchoice(Map) = Choice =>\n % what is the Player's probably choice\n PlayersProbablyMove = weighted_choice(Map),\n % select the choice that beats it\n beats(Choice,PlayersProbablyMove).\n\n\nprint_result(ResultMap) =>\n foreach(C in ResultMap.keys)\n println(C=ResultMap.get(C))\n end,\n nl.\n\n% This part is from the Prolog version.\nresult(C,P,R,[C|R],Result) :-\n beats(C,P),\n Result = computer_wins,\n printf(\"Computer wins.\\n\").\nresult(C,P,R,[B|R],Result) :-\n beats(P,C),\n beats(B,P),\n Result=user_wins,\n printf(\"You win!%n\").\nresult(C,C,R,[B|R],Result) :-\n beats(B,C),\n Result=draw,\n printf(\"It is a draw\\n\").\n\nbeats(paper, rock).\nbeats(rock, scissors).\nbeats(scissors, paper).\n","language":"Picat"},{"code":"(use (C Mine Your)\n (let (Rock 0 Paper 0 Scissors 0)\n (loop\n (setq Mine\n (let N (if (gt0 (+ Rock Paper Scissors)) (rand 1 @) 0)\n (seek\n '((L) (le0 (dec 'N (caar L))))\n '(Rock Paper Scissors .) ) ) )\n (prin \"Enter R, P or S to play, or Q to quit: \")\n (loop\n (and (= \"Q\" (prinl (setq C (uppc (key))))) (bye))\n (T (setq Your (find '((S) (pre? C S)) '(Rock Paper Scissors))))\n (prinl \"Bad input - try again\") )\n (prinl\n \"I say \" (cadr Mine) \", You say \" Your \": \"\n (cond\n ((== Your (cadr Mine)) \"Draw\")\n ((== Your (car Mine)) \"I win\")\n (T \"You win\") ) )\n (inc Your) ) ) )\n","language":"PicoLisp"},{"code":"rock: procedure options (main); /* 30 October 2013 */\n declare move character (1), cm fixed binary;\n\n put ('The Rock-Paper-Scissors game');\n put skip list (\"please type 'r' for rock, 'p' for paper, 's' for scissors.\");\n put skip list (\"Anything else finishes:\");\n do forever;\n get edit (move) (a(1));\n move = lowercase(move);\n if index('rpsq', move) = 0 then iterate;\n if move = 'q' then stop;\n cm = random()*3; /* computer moves: 0 = rock, 1 = paper, 2 = scissors */\n select (cm);\n when (0) select (move);\n when ('r') put list ('rock and rock: A draw');\n when ('p') put list ('paper beats rock: You win');\n when ('s') put list ('rock breaks scissors: I win');\n end;\n when (1) select (move);\n when ('r') put list ('paper beats rock: I win');\n when ('p') put list ('paper and paper: A draw');\n when ('s') put list ('scissors cut paper: You win');\n end;\n when (2) select (move);\n when ('r') put list ('rock breaks scissors: You win');\n when ('p') put list ('scissors cuts paper: I win');\n when ('s') put list ('Scissors and Scissors: A draw');\n end;\n end;\n end;\nend rock;\n","language":"PL-I"},{"code":"play :-\n findall(P,beats(P,_),Prev),\n play(Prev).\n\nplay(Prev) :-\n write('your choice? '),\n read(P),\n random_member(C, Prev),\n format('The computer chose ~p~n', C),\n result(C,P,Prev,Next),\n !,\n play(Next).\n\nresult(C,P,R,[C|R]) :-\n beats(C,P),\n format('Computer wins.~n').\nresult(C,P,R,[B|R]) :-\n beats(P,C),\n beats(B,P),\n format('You win!~n').\nresult(C,C,R,[B|R]) :-\n beats(B,C),\n format('It is a draw~n').\n\nbeats(paper, rock).\nbeats(rock, scissors).\nbeats(scissors, paper).\n","language":"Prolog"},{"code":"Enumeration\n ;choices are in listed according to their cycle, weaker followed by stronger\n #rock\n #paper\n #scissors\n #numChoices ;this comes after all possible choices\nEndEnumeration\n\n;give names to each of the choices\nDim choices.s(#numChoices - 1)\nchoices(#rock) = \"rock\"\nchoices(#paper) = \"paper\"\nchoices(#scissors) = \"scissors\"\n\nDefine gameCount\nDim playerChoiceHistory(#numChoices - 1)\n\nProcedure weightedRandomChoice()\n Shared gameCount, playerChoiceHistory()\n Protected x = Random(gameCount - 1), t, c\n\n For i = 0 To #numChoices - 1\n t + playerChoiceHistory(i)\n If t >= x\n c = i\n Break\n EndIf\n Next\n\n ProcedureReturn (c + 1) % #numChoices\nEndProcedure\n\nIf OpenConsole()\n PrintN(\"Welcome to the game of rock-paper-scissors\")\n PrintN(\"Each player guesses one of these three, and reveals it at the same time.\")\n PrintN(\"Rock blunts scissors, which cut paper, which wraps stone.\")\n PrintN(\"If both players choose the same, it is a draw!\")\n PrintN(\"When you've had enough, choose Q.\")\n\n Define computerChoice, playerChoice, response.s\n Define playerWins, computerWins, draw, quit\n\n computerChoice = Random(#numChoices - 1)\n Repeat\n Print(#CRLF$ + \"What is your move (press R, P, or S)?\")\n Repeat\n response = LCase(Input())\n Until FindString(\"rpsq\", response) > 0\n\n If response = \"q\":\n quit = 1\n Else\n gameCount + 1\n playerChoice = FindString(\"rps\", response) - 1\n\n result = (playerChoice - computerChoice + #numChoices) % #numChoices\n Print(\"You chose \" + choices(playerChoice) + \" and I chose \" + choices(computerChoice))\n Select result\n Case 0\n PrintN(\". It's a draw.\")\n draw + 1\n Case 1\n PrintN(\". You win!\")\n playerWins + 1\n Case 2\n PrintN(\". I win!\")\n computerWins + 1\n EndSelect\n playerChoiceHistory(playerChoice) + 1\n computerChoice = weightedRandomChoice()\n EndIf\n Until quit\n\n Print(#CRLF$ + \"You chose: \")\n For i = 0 To #numChoices - 1\n Print(choices(i) + \" \" + StrF(playerChoiceHistory(i) * 100 / gameCount, 1) + \"%; \")\n Next\n PrintN(\"\")\n PrintN(\"You won \" + Str(playerWins) + \", and I won \" + Str(computerWins) + \". There were \" + Str(draw) + \" draws.\")\n PrintN(\"Thanks for playing!\")\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\"): Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"from random import choice\n\nrules = {'rock': 'paper', 'scissors': 'rock', 'paper': 'scissors'}\nprevious = ['rock', 'paper', 'scissors']\n\nwhile True:\n human = input('\\nchoose your weapon: ')\n computer = rules[choice(previous)] # choose the weapon which beats a randomly chosen weapon from \"previous\"\n\n if human in ('quit', 'exit'): break\n\n elif human in rules:\n previous.append(human)\n print('the computer played', computer, end='; ')\n\n if rules[computer] == human: # if what beats the computer's choice is the human's choice...\n print('yay you win!')\n elif rules[human] == computer: # if what beats the human's choice is the computer's choice...\n print('the computer beat you... :(')\n else: print(\"it's a tie!\")\n\n else: print(\"that's not a valid choice\")\n","language":"Python"},{"code":"from random import randint\n\nhands = ['rock', 'scissors', 'paper']; judge = ['its a tie!', 'the computer beat you... :(', 'yay you win!']\nwhile True:\n try:\n YOU = hands.index(input('Choose your weapon: ')) # YOU = hands.index(raw_input('Choose your weapon: ')) If you use Python2.7\n except ValueError:\n break\n NPC = randint(0, 2)\n print('The computer played ' + hands[NPC] + '; ' + judge[YOU-NPC])\n","language":"Python"},{"code":" [ 0 ] is rock ( --> n )\n [ 1 ] is paper ( --> n )\n [ 2 ] is scissor ( --> n )\n\n [ $ \"Choose rock, paper or scissors: \"\n input cr\n trim reverse trim reverse\n $ \"\" swap witheach [ lower join ]\n dup $ \"rock\" = iff\n [ drop rock ] done\n dup $ \"paper\" = iff\n [ drop paper ] done\n $ \"scissors\" = iff\n scissor done\n again ] is player ( --> n )\n\n [ stack 1 ] is rocks ( --> s )\n [ stack 1 ] is papers ( --> s )\n [ stack 1 ] is scissors ( --> s )\n\n [ 1 swap\n [ table rocks papers scissors ]\n do tally ] is notechoice ( n --> )\n\n [ 0 ' [ rocks papers scissors ]\n witheach [ share + ]\n random\n dup rocks share < iff\n [ drop paper ] done\n rocks share -\n papers share < iff\n scissor done\n rock ] is computer ( --> n )\n\n [ say \"Computer chose \"\n [ table rock paper scissors ]\n echo say \".\" cr ] is echomove ( n --> )\n\n [ [ table\n [ table 0 1 2 ]\n [ table 2 0 1 ]\n [ table 1 2 0 ] ] do ] is result ( n n --> n )\n\n [ [ table\n $ \"It's a draw.\"\n $ \"Computer wins.\"\n $ \"Player wins.\" ]\n do echo$ cr cr ] is announce ( n --> )\n\n [ stack 0 ] is draws ( --> s )\n [ stack 0 ] is cwins ( --> s )\n [ stack 0 ] is pwins ( --> s )\n\n [ [ table draws cwins pwins ]\n 1 swap tally ] is keepscore ( n --> )\n\n [ say \"Computer: \" cwins share echo\n say \" Player: \" pwins share echo\n say \" Draws: \" draws share echo\n cr cr ] is scoreboard ( --> )\n\n [ ' [ rocks papers scissors ]\n witheach [ 1 swap replace ]\n ' [ draws cwins pwins ]\n witheach [ 0 swap replace ] ] is initialise ( --> )\n\n [ 0\n [ drop\n $ \"How many games? \" input\n trim reverse trim reverse\n $->n until ]\n cr ] is games ( --> n )\n\n [ initialise\n games times\n [ computer\n player dup notechoice\n over echomove\n result dup announce\n keepscore\n scoreboard ] ] is play ( --> )\n","language":"Quackery"},{"code":"play <- function()\n{\n bias <- c(r = 1, p = 1, s = 1)\n repeat\n {\n playerChoice <- readline(prompt = \"Rock (r), Paper (p), Scissors (s), or Quit (q)? \")\n if(playerChoice == \"q\") break\n rps <- c(Rock = \"r\", Paper = \"p\", Scissors = \"s\")\n if(!playerChoice %in% rps) next\n compChoice <- sample(rps, 1, prob = bias / sum(bias))\n cat(\"I choose\", names(compChoice), \"\\n\",\n c(\"We draw!\", \"I win!\", \"I lose!\")[1 + (which(compChoice == rps) - which(playerChoice == rps)) %% 3], \"\\n\")\n bias <- bias + (playerChoice == c(\"s\", \"r\", \"p\"))\n }\n}\nplay()\n","language":"R"},{"code":"#lang racket\n(require math)\n\n(define history (make-hash '((paper . 1) (scissors . 1) (rock . 1))))\n(define total 3)\n\n(define (update-history! human-choice)\n (set! total (+ total 1))\n (hash-update! history human-choice add1 0))\n\n(define (pick-one)\n (sample\n (discrete-dist '(paper scissors rock)\n (map (λ (x) (hash-ref history x))\n '(scissors paper rock)))))\n\n(define (find-winner computer human)\n (define order '(scissors paper rock scissors))\n (cond\n [(eq? computer human) 'none]\n [(eq? (second (member computer order)) human) 'computer]\n [ 'human]))\n\n(define (game-loop)\n (define computer-choice (pick-one))\n (define human-choice (read))\n (define winner (find-winner computer-choice human-choice))\n (update-history! human-choice)\n (displayln (~a \"Computer picked \" computer-choice \", \"\n \"human picked \" human-choice \", \"\n winner \" wins.\"))\n (game-loop))\n\n(game-loop)\n","language":"Racket"},{"code":"my %vs = (\n options => [<Rock Paper Scissors>],\n ro => {\n ro => [ 2, '' ],\n pa => [ 1, 'Paper covers Rock: ' ],\n sc => [ 0, 'Rock smashes Scissors: ' ]\n },\n pa => {\n ro => [ 0, 'Paper covers Rock: ' ],\n pa => [ 2, '' ],\n sc => [ 1, 'Scissors cut Paper: ' ]\n },\n sc => {\n ro => [ 1, 'Rock smashes Scissors: '],\n pa => [ 0, 'Scissors cut Paper: ' ],\n sc => [ 2, '' ]\n }\n);\n\nmy %choices = %vs<options>.map({; $_.substr(0,2).lc => $_ });\nmy $keys = %choices.keys.join('|');\nmy $prompt = %vs<options>.map({$_.subst(/(\\w\\w)/, -> $/ {\"[$0]\"})}).join(' ')~\"? \";\nmy %weight = %choices.keys »=>» 1;\n\nmy @stats = 0,0,0;\nmy $round;\n\nwhile my $player = (prompt \"Round {++$round}: \" ~ $prompt).lc {\n $player.=substr(0,2);\n say 'Invalid choice, try again.' and $round-- and next\n unless $player.chars == 2 and $player ~~ /<$keys>/;\n my $computer = (flat %weight.keys.map( { $_ xx %weight{$_} } )).pick;\n %weight{$_.key}++ for %vs{$player}.grep( { $_.value[0] == 1 } );\n my $result = %vs{$player}{$computer}[0];\n @stats[$result]++;\n say \"You chose %choices{$player}, Computer chose %choices{$computer}.\";\n print %vs{$player}{$computer}[1];\n print ( 'You win!', 'You Lose!','Tie.' )[$result];\n say \" - (W:{@stats[0]} L:{@stats[1]} T:{@stats[2]})\\n\",\n};\n","language":"Raku"},{"code":"my %vs = (\n options => [<Rock Paper Scissors Lizard Spock>],\n ro => {\n ro => [ 2, '' ],\n pa => [ 1, 'Paper covers Rock: ' ],\n sc => [ 0, 'Rock smashes Scissors: ' ],\n li => [ 0, 'Rock crushes Lizard: ' ],\n sp => [ 1, 'Spock vaporizes Rock: ' ]\n },\n pa => {\n ro => [ 0, 'Paper covers Rock: ' ],\n pa => [ 2, '' ],\n sc => [ 1, 'Scissors cut Paper: ' ],\n li => [ 1, 'Lizard eats Paper: ' ],\n sp => [ 0, 'Paper disproves Spock: ' ]\n },\n sc => {\n ro => [ 1, 'Rock smashes Scissors: ' ],\n pa => [ 0, 'Scissors cut Paper: ' ],\n sc => [ 2, '' ],\n li => [ 0, 'Scissors decapitate Lizard: '],\n sp => [ 1, 'Spock smashes Scissors: ' ]\n },\n li => {\n ro => [ 1, 'Rock crushes Lizard: ' ],\n pa => [ 0, 'Lizard eats Paper: ' ],\n sc => [ 1, 'Scissors decapitate Lizard: '],\n li => [ 2, '' ],\n sp => [ 0, 'Lizard poisons Spock: ' ]\n },\n sp => {\n ro => [ 0, 'Spock vaporizes Rock: ' ],\n pa => [ 1, 'Paper disproves Spock: ' ],\n sc => [ 0, 'Spock smashes Scissors: ' ],\n li => [ 1, 'Lizard poisons Spock: ' ],\n sp => [ 2, '' ]\n }\n);\n","language":"Raku"},{"code":"import Prelude;\n\nrel[str, str] whatbeats = {<\"Rock\", \"Scissors\">, <\"Scissors\", \"Paper\">, <\"Paper\", \"Rock\">};\n\nlist[str] ComputerChoices = [\"Rock\", \"Paper\", \"Scissors\"];\n\nstr CheckWinner(a, b){\n\tif(b == getOneFrom(whatbeats[a]))\n\t\treturn a;\n\telseif(a == getOneFrom(whatbeats[b]))\n\t\treturn b;\n\telse return \"Nobody\";\n}\n\npublic str RPS(human){\n\tcomputer = getOneFrom(ComputerChoices);\n\tx = if(human == \"Rock\") \"Paper\"; elseif(human == \"Paper\") \"Scissors\"; else \"Rock\";\n\tComputerChoices += x;\n\treturn \"Computer played <computer>. <CheckWinner(human, computer)> wins!\";\n}\n","language":"Rascal"},{"code":"rascal>RPS(\"Rock\")\nstr: \"Computer played Rock. Nobody wins!\"\n\nrascal>RPS(\"Rock\")\nstr: \"Computer played Rock. Nobody wins!\"\n\nrascal>RPS(\"Rock\")\nstr: \"Computer played Scissors. Rock wins!\"\n\nrascal>RPS(\"Rock\")\nstr: \"Computer played Paper. Paper wins!\"\n\nrascal>RPS(\"Rock\")\nstr: \"Computer played Paper. Paper wins!\"\n\nrascal>RPS(\"Rock\")\nstr: \"Computer played Paper. Paper wins!\"\n\nrascal>RPS(\"Rock\")\nstr: \"Computer played Paper. Paper wins!\"\n\nrascal>RPS(\"Rock\")\nstr: \"Computer played Rock. Nobody wins!\"\n\nrascal>RPS(\"Rock\")\nstr: \"Computer played Paper. Paper wins!\"\n\nrascal>RPS(\"Rock\")\nstr: \"Computer played Paper. Paper wins!\"\n","language":"Rascal"},{"code":"Red [Purpose: \"Implement a rock-paper-scissors game with weighted probability\"]\n\nprior: rejoin choices: [\"r\" \"p\" \"s\"]\n\nwhile [\n\tfind choices pchoice: ask \"choose rock: r, paper: p, or scissors: s^/\"\n] [\t\n\tprint [\"AI Draws:\" cchoice: random/only prior]\n\tcwin: select \"rpsr\" pchoice\n\tclose: select \"rspr\" pchoice\n\t\n\tprint case [\n\t\tpchoice = cchoice [\"tie\"]\n\t\tcchoice = cwin [\"you lose\"]\n\t\t'else [\"you win\"]\n\t]\n\t\n\tappend prior cwin\t\t;adds what would have beaten player\n\tremove find prior close\t\t;removes what would have lost to player\n]\n","language":"Red"},{"code":"/*REXX program plays rock─paper─scissors with a human; tracks what human tends to use. */\n!= '────────'; err=! \"***error***\"; @.=0 /*some constants for this program. */\nprompt= ! 'Please enter one of: Rock Paper Scissors (or Quit)'\n$.p= 'paper' ; $.s= \"scissors\"; $.r= 'rock' /*list of the choices in this program. */\nt.p= $.r ; t.s= $.p ; t.r= $.s /*thingys that beats stuff. */\nw.p= $.s ; w.s= $.r ; w.r= $.p /*stuff \" \" thingys. */\nb.p= 'covers'; b.s= \"cuts\" ; b.r= 'breaks' /*verbs: how the choice wins. */\n\n do forever; say; say prompt; say /*prompt the CBLF; then get a response.*/\n c= word($.p $.s $.r, random(1, 3) ) /*choose the computer's first pick. */\n m= max(@.r, @.p, @.s); c= w.r /*prepare to examine the choice history*/\n if @.p==m then c= w.p /*emulate JC's: The Amazing Karnac. */\n if @.s==m then c= w.s /* \" \" \" \" \" */\n c1= left(c, 1) /*C1 is used for faster comparing. */\n parse pull u; a= strip(u) /*get the CBLF's choice/pick (answer). */\n upper a c1 ; a1= left(a, 1) /*uppercase choices, get 1st character.*/\n ok= 0 /*indicate answer isn't OK (so far). */\n select /*process/verify the CBLF's choice. */\n when words(u)==0 then say err 'nothing entered'\n when words(u)>1 then say err 'too many choices: ' u\n when abbrev('QUIT', a) then do; say ! \"quitting.\"; exit; end\n when abbrev('ROCK', a) |,\n abbrev('PAPER', a) |,\n abbrev('SCISSORS',a) then ok=1 /*Yes? This is a valid answer by CBLF.*/\n otherwise say err 'you entered a bad choice: ' u\n end /*select*/\n\n if \\ok then iterate /*answer ¬OK? Then get another choice.*/\n @.a1= @.a1 + 1 /*keep a history of the CBLF's choices.*/\n say ! 'computer chose: ' c\n if a1== c1 then do; say ! 'draw.'; iterate; end\n if $.a1==t.c1 then say ! 'the computer wins. ' ! $.c1 b.c1 $.a1\n else say ! 'you win! ' ! $.a1 b.a1 $.c1\n end /*forever*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"/*REXX pgm plays rock─paper─scissors─lizard─Spock with human; tracks human usage trend. */\n!= '────────'; err=! \"***error***\"; @.=0 /*some constants for this REXX program.*/\nprompt=! 'Please enter one of: Rock Paper SCissors Lizard SPock (Vulcan) (or Quit)'\n$.p='paper' ; $.s=\"scissors\" ; $.r='rock' ; $.L=\"lizard\" ; $.v='Spock' /*names of the thingys*/\nt.p= $.r $.v ; t.s= $.p $.L ; t.r= $.s $.L ; t.L= $.p $.v ; t.v= $.r $.s /*thingys beats stuff.*/\nw.p= $.L $.s ; w.s= $.v $.r ; w.r= $.v $.p ; w.L= $.r $.s ; w.v= $.L $.p /*stuff beats thingys.*/\nb.p='covers disproves'; b.s=\"cuts decapitates\"; b.r='breaks crushes'; b.L=\"eats poisons\"; b.v='vaporizes smashes' /*how the choice wins.*/\nwhom.1= ! 'the computer wins. ' !; whom.2= ! \"you win! \" !; win= words(t. p)\n\n do forever; say; say prompt; say /*prompt CBLF; then get a response. */\n c= word($.p $.s $.r $.L $.v, random(1, 5) ) /*the computer's first choice/pick. */\n m= max(@.r, @.p, @.s, @.L, @.v) /*used in examining CBLF's history. */\n if @.p==m then c= word(w.p, random(1, 2) ) /*emulate JC's The Amazing Karnac. */\n if @.s==m then c= word(w.s, random(1, 2) ) /* \" \" \" \" \" */\n if @.r==m then c= word(w.r, random(1, 2) ) /* \" \" \" \" \" */\n if @.L==m then c= word(w.L, random(1, 2) ) /* \" \" \" \" \" */\n if @.v==m then c= word(w.v, random(1, 2) ) /* \" \" \" \" \" */\n c1= left(c, 1) /*C1 is used for faster comparing. */\n parse pull u; a= strip(u) /*obtain the CBLF's choice/pick. */\n upper a c1 ; a1= left(a, 1) /*uppercase the choices, get 1st char. */\n ok=0 /*indicate answer isn't OK (so far). */\n select /* [↓] process the CBLF's choice/pick.*/\n when words(u)==0 then say err 'nothing entered.'\n when words(u)>1 then say err 'too many choices: ' u\n when abbrev('QUIT', a) then do; say ! 'quitting.'; exit; end\n when abbrev('LIZARD', a) |,\n abbrev('ROCK', a) |,\n abbrev('PAPER', a) |,\n abbrev('VULCAN', a) |,\n abbrev('SPOCK', a,2) |,\n abbrev('SCISSORS',a,2) then ok=1 /*it's a valid choice for the human. */\n otherwise say err 'you entered a bad choice: ' u\n end /*select*/\n\n if \\ok then iterate /*answer ¬OK? Then get another choice.*/\n @.a1= @.a1 + 1 /*keep a history of the CBLF's choices.*/\n say ! 'computer chose: ' c\n if a1==c1 then say ! 'draw.' /*Oh rats! The contest ended up a draw*/\n else do who=1 for 2 /*either the computer or the CBLF won. */\n if who==2 then parse value a1 c1 with c1 a1\n do j=1 for win /*see who won. */\n if $.a1 \\== word(t.c1, j) then iterate /*not this 'un. */\n say whom.who $.c1 word(b.c1, j) $.a1 /*notify winner.*/\n leave /*leave J loop.*/\n end /*j*/\n end /*who*/\n end /*forever*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"# Project : Rock-paper-scissors\n\nload \"stdlib.ring\"\nload \"guilib.ring\"\n\nwidth \t\t= 200\nheight \t\t= 200\n\nmyChose \t= 1\ncompChose \t= 1\nnextPlayer \t= 1\nmyScore \t= 0\ncompScore \t= 0\nC_FONTSIZE \t= 15\n\nC_ROCK \t\t= \"images/rock.jpg\"\nC_PAPER \t= \"images/paper.jpg\"\nC_SCISSORS \t= \"images/scissors.jpg\"\n\nChoseList \t= [C_ROCK,C_PAPER,C_SCISSORS]\n\nButton \t\t= list(len(ChoseList))\n\napp = new QApp\n{\n\n\tStyleFusion()\n\n\twin = new QWidget() {\n\n\t\tsetWindowTitle('Stone Paper Scissors Game')\n\t\tsetWinIcon(self,C_ROCK)\n\t\tsetStyleSheet(\"background-color:cyan;\")\n\t\tsetWindowFlags(Qt_Window | Qt_WindowTitleHint | Qt_WindowCloseButtonHint | Qt_CustomizeWindowHint)\n\t\treSize(900,600)\n\t\twinheight \t= height()\n\t\tfontSize\t= 8 + (winheight / 100)\n\n\t\tfor Col = 1 to len(ChoseList)\n\t\t\tButton[Col] = new QPushButton(win) {\n\t\t\t\tx = 150+(Col-1)*height\n\t\t\t\tsetgeometry(x,35,width,height)\n\t\t\t\tsetStyleSheet(\"background-color:white;\")\n\t\t\t\tseticon(new qicon(new qpixmap(ChoseList[Col])))\n\t\t\t\tsetIconSize(new qSize(200,200))\n\t\t\t\tsetclickevent(\"ButtonPress(\" + string(Col) + \")\")\n\t\t\t\tsetSizePolicy(1,1)\n\t\t\t}\t\t\t\t\n\t\tnext\n\n\t\tlabelMyChose = new QLabel(win) {\n\t\t\tsetgeometry(200,250,150,30)\n\t\t\tsetFont(new qFont(\"Verdana\",C_FONTSIZE,50,0))\n\t\t\tsettext(\"My Chose:\")\n\t\t}\n\n\t\tlabelCompChose = new QLabel(win) {\n\t\t\tsetgeometry(580,250,150,30)\n\t\t\tsetFont(new qFont(\"Verdana\",C_FONTSIZE,50,0))\n\t\t\tsettext(\"Comp Chose:\")\n\t\t}\n\n\t\tlabelScoreEnd = new QLabel(win) {\n\t\t\tsetgeometry(0,510,win.width(),30)\n\t\t\tsetAlignment(Qt_AlignHCenter | Qt_AlignVCenter)\n\t\t\tsetFont(new qFont(\"Verdana\",C_FONTSIZE,50,0))\n\t\t\tsettext(\"\")\n\t\t}\n\n\t\tbtnMyChose = new QPushButton(win) {\n\t\t\tsetgeometry(150,300,width,height)\n\t\t\tsetStyleSheet(\"background-color:white;\")\n\t\t}\n\n\t\tbtnCompChose = new QPushButton(win) {\n\t\t\tsetgeometry(550,300,width,height)\n\t\t\tsetStyleSheet(\"background-color:white;\")\n\t\t}\n\n\t\tbtnNewGame = new QPushButton(win) {\n\t\t\tsetgeometry(170,550,150,40)\n\t\t\tsetFont(new qFont(\"Verdana\",C_FONTSIZE,50,0))\n\t\t\tsetclickevent(\"NewGame()\")\n\t\t\tsettext(\"New Game\")\n\t\t}\n\n\t\tbtnExit = new QPushButton(win) {\n\t\t\tsetgeometry(580,550,150,40)\n\t\t\tsetFont(new qFont(\"Verdana\",C_FONTSIZE,50,0))\n\t\t\tsetclickevent(\"Close()\")\n\t\t\tsettext(\"Exit\")\n\t\t}\n\n\t\tlabelMyScore = new QLabel(win) {\n\t\t\tsetgeometry(170,0,100,30)\n\t\t\tsetFont(new qFont(\"Verdana\",C_FONTSIZE,50,0))\n\t\t\tsettext(\"My Score: \")\n\t\t}\n\n\t\tlabelMyScoreSum = new QLabel(win) {\n\t\t\tsetgeometry(300,0,100,30)\n\t\t\tsetFont(new qFont(\"Verdana\",C_FONTSIZE,50,0))\n\t\t\tsettext(\"\")\n\t\t}\n\n\t\tlabelCompScore = new QLabel(win) {\n\t\t\tsetgeometry(580,0,130,30)\n\t\t\tsetFont(new qFont(\"Verdana\",C_FONTSIZE,50,0))\n\t\t\tsettext(\"Comp Score: \")\n\t\t}\n\n\t\tlabelCompScoreSum = new QLabel(win) {\n\t\t\tsetgeometry(730,0,100,30)\n\t\t\tsetFont(new qFont(\"Verdana\",C_FONTSIZE,50,0))\n\t\t\tsettext(\"\")\n\t\t}\n\n\t\tshow()\n\n\t}\n\n\texec()\n\n}\n\nfunc ButtonPress Col\n\n\tif nextPlayer = 1\n\t\tmyChose = Col\n\t\tbtnMyChose {\n\t\t\tseticon(new qicon(new qpixmap(ChoseList[Col])))\n\t\t\tsetIconSize(new qSize(width,height))\n\t\t}\n\t\tnextPlayer = 2\n\t\tcompChose()\n\tok\n\nfunc compChose\n\n\trndChose = random(len(ChoseList)-1) + 1\n\tcompChose = rndChose\n\tbtnCompChose {\n\t\tseticon(new qicon(new qpixmap(ChoseList[compChose])))\n\t\tsetIconSize(new qSize(width,height))\n\t}\n\tnextPlayer = 1\n\tResult()\n\n\nfunc Result\n\n\tif (myChose = compChose)\n\t\tlabelScoreEnd.settext(\"Draw!\")\n\tok\n\tif (myChose = 1) and (compChose = 2)\n\t\tlabelScoreEnd.settext(\"Computer Win!\")\n\t\tcompScore = compScore + 1\n\t\tlabelCompScoreSum.settext(string(compScore))\n\tok\n\tif (myChose = 1) and (compChose = 3)\n\t\tlabelScoreEnd.settext(\"I Win!\")\n\t\tmyScore = myScore + 1\n\t\tlabelMyScoreSum.settext(string(myScore))\n\tok\n\tif (myChose = 2) and (compChose = 3)\n\t\tlabelScoreEnd.settext(\"Computer Win!\")\n\t\tcompScore = compScore + 1\n\t\tlabelCompScoreSum.settext(string(compScore))\n\tok\t\n\tif (myChose = 2) and (compChose = 1)\n\t\tlabelScoreEnd.settext(\"I Win!\")\n\t\tmyScore = myScore + 1\n\t\tlabelMyScoreSum.settext(string(myScore))\n\tok\n\tif (myChose = 3) and (compChose = 1)\n\t\tlabelScoreEnd.settext(\"Computer Win!\")\n\t\tcompScore = compScore + 1\n\t\tlabelCompScoreSum.settext(string(compScore))\n\tok\n\tif (myChose = 3) and (compChose = 2)\n\t\tlabelScoreEnd.settext(\"I Win!\")\n\t\tmyScore = myScore + 1\n\t\tlabelMyScoreSum.settext(string(myScore))\n\tok\n\nfunc NewGame\n\n\tnextPlayer \t= 1\n\tmyScore \t= 0\n\tcompScore \t= 0\n\n\tbtnMyChose {\n\t\tseticon(new qicon(new qpixmap(\"\")))\n\t\tsetIconSize(new qSize(200,200))\n\t}\n\n\tbtnCompChose {\n\t\tseticon(new qicon(new qpixmap(\"\")))\n\t\tsetIconSize(new qSize(200,200))\n\t}\n\n\tlabelScoreEnd.settext(\"\")\n\tlabelMyScoreSum.settext(\"0\")\n\tlabelCompScoreSum.settext(\"0\")\n\n\nfunc Close\n\n\twin.close()\n\tapp.quit()\t\n","language":"Ring"},{"code":"class RockPaperScissorsGame\n CHOICES = %w[rock paper scissors quit]\n BEATS = {\n 'rock' => 'paper',\n 'paper' => 'scissors',\n 'scissors' => 'rock',\n }\n\n def initialize()\n @plays = {\n 'rock' => 1,\n 'paper' => 1,\n 'scissors' => 1,\n }\n @score = [0, 0, 0] # [0]:Human wins, [1]:Computer wins, [2]:draw\n\n play\n end\n\n def humanPlay\n loop do\n print \"\\nYour choice: #{CHOICES}? \"\n answer = STDIN.gets.strip.downcase\n next if answer.empty?\n idx = CHOICES.find_index {|choice| choice.match(/^#{answer}/)}\n return CHOICES[idx] if idx\n puts \"invalid answer, try again\"\n end\n end\n\n def computerPlay\n total = @plays.values.reduce(:+)\n r = rand(total) + 1\n sum = 0\n CHOICES.each do |choice|\n sum += @plays[choice]\n return BEATS[choice] if r <= sum\n end\n end\n\n def play\n loop do\n h = humanPlay\n break if h == \"quit\"\n c = computerPlay\n print \"H: #{h}, C: #{c} => \"\n\n # only update the human player's history after the computer has chosen\n @plays[h] += 1\n\n if h == c\n puts \"draw\"\n @score[2] += 1\n elsif h == BEATS[c]\n puts \"Human wins\"\n @score[0] += 1\n else\n puts \"Computer wins\"\n @score[1] += 1\n end\n puts \"score: human=%d, computer=%d, draw=%d\" % [*@score]\n end\n @plays.each_key{|k| @plays[k] -= 1}\n puts \"\\nhumans chose #{@plays}\"\n end\nend\n\nRockPaperScissorsGame.new\n","language":"Ruby"},{"code":"pri$ = \"RSPR\"\nrps$ = \"Rock,Paper,Sissors\"\n[loop]\nbutton #r, \"Rock\", [r]\nbutton #p, \"Paper\", [p]\nbutton #s, \"Scissors\",[s]\nbutton #q, \"Quit\", [q]\nwait\n[r] y = 1 :goto [me]\n[p] y = 2 :goto [me]\n[s] y = 3\n[me]\ncls\ny$ = word$(rps$,y,\",\")\nm = int((rnd(0) * 2) + 1)\nm$ = word$(rps$,m,\",\")\nprint chr$(10);\"You Chose:\";y$;\" I chose:\";m$\nyp = instr(pri$,left$(y$,1))\nmp = instr(pri$,left$(m$,1))\nif yp = 1 and mp = 3 then mp = 0\nif mp = 1 and yp = 3 then yp = 0\nif yp < mp then print \"You win\"\nif yp = mp then print \"Tie\"\nif yp > mp then print \"I win\"\ngoto [loop]\nwait\n\n[q] cls\nprint \"Good Bye! I enjoyed the game\"\nend\n","language":"Run-BASIC"},{"code":"extern crate rand;\n#[macro_use]\nextern crate rand_derive;\n\nuse std::io;\nuse rand::Rng;\nuse Choice::*;\n\n#[derive(PartialEq, Clone, Copy, Rand, Debug)]\nenum Choice {\n Rock,\n Paper,\n Scissors,\n}\n\nfn beats(c1: Choice, c2: Choice) -> bool {\n (c1 == Rock && c2 == Scissors) || (c1 == Scissors && c2 == Paper) || (c1 == Paper && c2 == Rock)\n}\n\nfn ai_move<R: Rng>(rng: &mut R, v: [usize; 3]) -> Choice {\n // weighted random choice, a dynamic version of `rand::distributions::WeightedChoice`\n let rand = rng.gen_range(0, v[0] + v[1] + v[2]);\n if rand < v[0] {\n Paper\n } else if rand < v[0] + v[1] {\n Scissors\n } else {\n Rock\n }\n}\n\nfn main() {\n let mut rng = rand::thread_rng();\n\n println!(\"Rock, paper, scissors!\");\n let mut ai_choice: Choice = rng.gen();\n let mut ucf = [0, 0, 0]; // user choice frequency\n let mut score = [0, 0];\n\n loop {\n println!(\"Please input your move: 'r', 'p' or 's'. Type 'q' to quit\");\n\n let mut input = String::new();\n io::stdin()\n .read_line(&mut input)\n .expect(\"failed to read line\");\n let u_choice = match input.to_lowercase().trim() {\n s if s.starts_with('r') => {\n ucf[0] += 1;\n Rock\n }\n s if s.starts_with('p') => {\n ucf[1] += 1;\n Paper\n }\n s if s.starts_with('s') => {\n ucf[2] += 1;\n Scissors\n }\n s if s.starts_with('q') => break,\n _ => {\n println!(\"Please enter a correct choice!\");\n continue;\n }\n };\n println!(\"You chose {:?}, I chose {:?}.\", u_choice, ai_choice);\n if beats(u_choice, ai_choice) {\n score[0] += 1;\n println!(\"You win!\");\n } else if u_choice == ai_choice {\n println!(\"It's a tie!\");\n } else {\n score[1] += 1;\n println!(\"I win!\");\n }\n println!(\"-Score: You {}, Me {}\", score[0], score[1]);\n\n // only after the 1st iteration the AI knows the stats and can make\n // its weighted random move\n ai_choice = ai_move(&mut rng, ucf);\n }\n println!(\"Thank you for the game!\");\n}\n","language":"Rust"},{"code":"object RockPaperScissors extends App {\n import scala.collection.mutable.LinkedHashMap\n def play(beats: LinkedHashMap[Symbol,Set[Symbol]], played: scala.collection.Map[Symbol,Int]) {\n val h = readLine(s\"\"\"Your move (${beats.keys mkString \", \"}): \"\"\") match {\n case null => println; return\n case \"\" => return\n case s => Symbol(s)\n }\n beats get h match {\n case Some(losers) =>\n def weighted(todo: Iterator[(Symbol,Int)], rand: Int, accum: Int = 0): Symbol = todo.next match {\n case (s, i) if rand <= (accum + i) => s\n case (_, i) => weighted(todo, rand, accum + i)\n }\n val c = weighted(played.toIterator, 1 + scala.util.Random.nextInt(played.values.sum)) match {\n // choose an opponent that would beat the player's anticipated move\n case h => beats.find{case (s, l) => l contains h}.getOrElse(beats.head)._1\n }\n print(s\" My move: $c\\n \")\n c match {\n case c if losers contains c => println(\"You won\")\n case c if beats(c) contains h => println(\"You lost\")\n case _ => println(\"We drew\") // or underspecified\n }\n case x => println(\" Unknown weapon, try again.\")\n }\n play(beats, played get h match {\n case None => played\n case Some(count) => played.updated(h, count + 1)\n })\n }\n\n def play(beats: LinkedHashMap[Symbol,Set[Symbol]]): Unit =\n play(beats, beats.mapValues(_ => 1)) // init with uniform probabilities\n\n play(LinkedHashMap(\n 'rock -> Set('lizard, 'scissors),\n 'paper -> Set('rock, 'spock),\n 'scissors -> Set('paper, 'lizard),\n 'lizard -> Set('spock, 'paper),\n 'spock -> Set('scissors, 'rock)\n ))\n}\n","language":"Scala"},{"code":"object RockPaperScissors extends App {\n def beats = Map(\n 'rock -> Set('lizard, 'scissors),\n 'paper -> Set('rock, 'spock),\n 'scissors -> Set('paper, 'lizard),\n 'lizard -> Set('spock, 'paper),\n 'spock -> Set('scissors, 'rock)\n )\n // init with uniform probabilities\n def initPlayed = beats.mapValues(_ => 1)\n def input = Symbol(readLine(s\"\"\"Your move (${beats.keys mkString \", \"}): \"\"\"))\n def random(max: Int) = scala.util.Random.nextInt(max)\n def display(text: String) = print(text)\n\n def weighted(todo: Iterator[(Symbol,Int)], rand: Int, accum: Int = 0): Symbol = todo.next match {\n case (s, i) if rand <= (accum + i) => s\n case (_, i) => weighted(todo, rand, accum + i)\n }\n\n def calcMyMove(random: Int => Int, played: Map[Symbol,Int]) = {\n weighted(played.toIterator, 1 + random(played.values.sum)) match {\n // choose an opponent that would beat the player's anticipated move\n case h => beats.find{case (s, l) => l contains h}.getOrElse(beats.head)._1\n }\n }\n\n case class Result(text: String, won: Int, lost: Int, drew: Int) {\n override def toString = s\"$text. Won: $won, Lost: $lost, Drew: $drew\"\n }\n\n def getResult(userWeapon: Symbol, myMove: Symbol, result: Result) = {\n if (beats(userWeapon) contains myMove)\n result.copy(text = \"You won\", won = result.won + 1)\n else if (beats(myMove) contains userWeapon)\n result.copy(text = \"You lost\", lost = result.lost + 1)\n else result.copy(text = \"We drew\", drew = result.drew + 1)\n }\n\n def play(input: => Symbol, display: String => Unit, random: Int => Int)\n (played: Map[Symbol,Int], result: Result): Result = {\n val userWeapon = input\n if (userWeapon != Symbol(\"\")) {\n val newResult = if (beats contains userWeapon) {\n val myMove = calcMyMove(random, played)\n display(s\" My move: $myMove\\n \")\n getResult(userWeapon, myMove, result)\n } else {\n result.copy(text = \" Unknown weapon, try again\")\n }\n display(newResult + \"\\n\")\n play(input, display, random)(played get userWeapon match {\n case None => played\n case Some(count) => played.updated(userWeapon, count + 1)\n }, newResult)\n } else result\n }\n\n override def main(args: Array[String]): Unit =\n play(input, display, random)(initPlayed, Result(\"Start\", 0, 0, 0))\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n$ include \"keybd.s7i\";\n\nconst array string: rockPaperScissors is [] (\"Rock\", \"Paper\", \"Scissors\");\n\nconst proc: main is func\n local\n var char: command is ' ';\n var integer: user is 0;\n var integer: comp is 0;\n begin\n writeln(\"Hello, Welcome to rock-paper-scissors\");\n repeat\n write(\"Please type in 1 for Rock, 2 for Paper, 3 for Scissors, q to quit \");\n flush(OUT);\n repeat\n command := lower(getc(KEYBOARD));\n until command in {'1', '2', '3', 'q'};\n writeln(command);\n if command <> 'q' then\n user := integer parse str(command);\n comp := rand(1, 3);\n writeln(\"You Played: \" <& rockPaperScissors[user]);\n writeln(\"Computer Played: \" <& rockPaperScissors[comp]);\n if comp = user then\n writeln(\"You Tied\");\n elsif succ(comp) = user or user + 2 = comp then\n writeln(\"Yay, You Won!\");\n else\n writeln(\"Sorry, You Lost!\");\n end if;\n end if;\n until command = 'q';\n writeln(\"Goodbye! Thanks for playing!\");\n end func;\n","language":"Seed7"},{"code":"const rps = %w(r p s)\n\nconst msg = [\n \"Rock breaks scissors\",\n \"Paper covers rock\",\n \"Scissors cut paper\",\n]\n\nsay <<\"EOT\"\n\\n>> Rock Paper Scissors <<\\n\n** Enter 'r', 'p', or 's' as your play.\n** Enter 'q' to exit the game.\n** Running score shown as <your wins>:<my wins>\nEOT\n\nvar plays = 0\nvar aScore = 0\nvar pScore = 0\nvar pcf = [0,0,0] # pcf = player choice frequency\nvar aChoice = pick(0..2) # ai choice for first play is completely random\n\nloop {\n var pi = Sys.scanln(\"Play: \")\n pi == 'q' && break\n\n var pChoice = rps.index(pi)\n\n if (pChoice == -1) {\n STDERR.print(\"Invalid input!\\n\")\n next\n }\n\n ++pcf[pChoice]\n ++plays\n\n # show result of play\n \">> My play: %-8s\".printf(rps[aChoice])\n\n given ((aChoice - pChoice + 3) % 3) {\n when (0) { say \"Tie.\" }\n when (1) { \"%-*s %s\".printlnf(30, msg[aChoice], 'My point'); aScore++ }\n when (2) { \"%-*s %s\".printlnf(30, msg[pChoice], 'Your point'); pScore++ }\n }\n\n # show score\n \"%-6s\".printf(\"%d:%d\" % (pScore, aScore))\n\n # compute ai choice for next play\n given (plays.rand.int) { |rn|\n case (rn < pcf[0]) { aChoice = 1 }\n case (pcf[0]+pcf[1] > rn) { aChoice = 2 }\n default { aChoice = 0 }\n }\n}\n","language":"Sidef"},{"code":"enum Choice: CaseIterable {\n case rock\n case paper\n case scissors\n case lizard\n case spock\n}\n\nextension Choice {\n var weaknesses: Set<Choice> {\n switch self {\n case .rock:\n return [.paper, .spock]\n case .paper:\n return [.scissors, .lizard]\n case .scissors:\n return [.rock, .spock]\n case .lizard:\n return [.rock, .scissors]\n case .spock:\n return [.paper, .lizard]\n }\n }\n}\n\nstruct Game {\n private(set) var history: [(Choice, Choice)] = []\n private(set) var p1Score: Int = 0\n private(set) var p2Score: Int = 0\n\n mutating func play(_ p1Choice: Choice, against p2Choice: Choice) {\n history.append((p1Choice, p2Choice))\n if p2Choice.weaknesses.contains(p1Choice) {\n p1Score += 1\n } else if p1Choice.weaknesses.contains(p2Choice) {\n p2Score += 1\n }\n }\n}\n\nfunc aiChoice(for game: Game) -> Choice {\n if let weightedWeekness = game.history.flatMap({ $0.0.weaknesses }).randomElement() {\n return weightedWeekness\n } else {\n // If history is empty, return random Choice\n return Choice.allCases.randomElement()!\n }\n}\n\nvar game = Game()\nprint(\"Type your choice to play a round, or 'q' to quit\")\nloop: while true {\n let choice: Choice\n switch readLine().map({ $0.lowercased() }) {\n case \"r\", \"rock\":\n choice = .rock\n case \"p\", \"paper\":\n choice = .paper\n case \"scissors\":\n choice = .scissors\n case \"l\", \"lizard\":\n choice = .lizard\n case \"spock\":\n choice = .spock\n case \"q\", \"quit\", \"exit\":\n break loop\n case \"s\":\n print(\"Do you mean Spock, or scissors?\")\n continue\n default:\n print(\"Unknown choice. Type 'q' to quit\")\n continue\n }\n let p2Choice = aiChoice(for: game)\n print(\"You played \\(choice) against \\(p2Choice)\")\n game.play(choice, against: p2Choice)\n print(\"Current score: \\(game.p1Score) : \\(game.p2Score)\")\n}\n","language":"Swift"},{"code":"package require Tcl 8.5\n\n### Choices are represented by integers, which are indices into this list:\n### Rock, Paper, Scissors\n### Normally, idiomatic Tcl code uses names for these sorts of things, but it\n### turns out that using integers simplifies the move-comparison logic.\n\n# How to ask for a move from the human player\nproc getHumanMove {} {\n while 1 {\n\tputs -nonewline \"Your move? \\[R\\]ock, \\[P\\]aper, \\[S\\]cissors: \"\n\tflush stdout\n\tgets stdin line\n\tif {[eof stdin]} {\n\t puts \"\\nBye!\"\n\t exit\n\t}\n\tset len [string length $line]\n\tforeach play {0 1 2} name {\"rock\" \"paper\" \"scissors\"} {\n\t # Do a prefix comparison\n\t if {$len && [string equal -nocase -length $len $line $name]} {\n\t\treturn $play\n\t }\n\t}\n\tputs \"Sorry, I don't understand that. Try again please.\"\n }\n}\n\n# How to ask for a move from the machine player\nproc getMachineMove {} {\n global states\n set choice [expr {int(rand() * [::tcl::mathop::+ {*}$states 3])}]\n foreach play {1 2 0} count $states {\n\tif {[incr sum [expr {$count+1}]] > $choice} {\n\t puts \"I play \\\"[lindex {Rock Paper Scissors} $play]\\\"\"\n\t return $play\n\t}\n }\n}\n\n# Initialize some state variables\nset states {0 0 0}\nset humanWins 0\nset machineWins 0\n\n# The main game loop\nwhile 1 {\n # Get the moves for this round\n set machineMove [getMachineMove]\n set humanMove [getHumanMove]\n # Report on what happened\n if {$humanMove == $machineMove} {\n\tputs \"A draw!\"\n } elseif {($humanMove+1)%3 == $machineMove} {\n\tputs \"I win!\"\n\tincr machineWins\n } else {\n\tputs \"You win!\"\n\tincr humanWins\n }\n puts \"Cumulative scores: $humanWins to you, $machineWins to me\"\n # Update the state of how the human has played in the past\n lset states $humanMove [expr {[lindex $states $humanMove] + 1}]\n}\n","language":"Tcl"},{"code":"PROGRAM:RPS\n:{0,0,0}→L1\n:{0,0,0}→L2\n:Lbl ST\n:Disp \"R/P/S\"\n:Disp \"1/2/3\"\n:Lbl EC\n:Input A\n:If A>3 or A<1\n:Then\n:Goto NO\n:End\n:randInt(1,3+L1(1)+L1(2)+L1(3)→C\n:If C≤1+L1(1)\n:Then\n:2→B\n:Goto NS\n:End\n:If C>2+L1(2)\n:Then\n:1→B\n:Else\n:3→B\n:End\n:Lbl NS\n:L1(A)+1→L1(A)\n:If A=B\n:Then\n:Disp \"TIE GAME\"\n:L2(3)+1→L2(3)\n:Goto TG\n:End\n:If (A=1 and B=2) or (A=2 and B=3) or (A=3 and B=1)\n:Then\n:Disp \"I WIN\"\n:L2(1)+1→L2(1)\n:Else\n:Disp \"YOU WIN\"\n:L2(2)+1→L2(2)\n:End\n:Lbl TG\n:Disp \"PLAY AGAIN?\"\n:Input Str1\n:If Str1=\"YES\"\n:Then\n:ClrHome\n:Goto ST\n:Else\n:Goto EN\n:End\n:Lbl NO\n:ClrHome\n:Pause \"PICK 1,2, or 3\"\n:ClrHome\n:Goto EC\n:Lbl EN\n:ClrHome\n:Disp \"I WON:\"\n:Disp L2(1)\n:Disp \"YOU WON:\"\n:Disp L2(2)\n:Disp \"WE TIED:\"\n:Disp L2(3)\n:Disp \"BYE\"\n","language":"TI-83-BASIC"},{"code":"while(isobject(RockPaperScissors))\n\tRockPaperScissors.delete();\n\nnew scriptObject(RockPaperScissors);\n\nfunction RockPaperScissors::startGame(%this)\n{\n\t%this.idle = true;\n\techo(\"Starting rock paper scissors, please type choose(\\\"choice\\\"); to proceed!\");\n}\n\nfunction RockPaperScissors::endGame(%this)\n{\n\t%this.idle = true;\n}\n\nfunction RockPaperScissors::main(%this)\n{\n\t%this.idle = 0;\n\t\n\tif(getRandom(1,2) == 1)\n\t{\n\t\t%result = %this.getChoiceByUserFrequency();\n\t}\n\telse\n\t{\n\t\t%c[0] = \"rock\";\n\t\t%c[1] = \"paper\";\n\t\t%c[2] = \"scissors\";\n\t\t\n\t\t%result = %c[getRandom(0,2)];\n\t}\n\t\n\t%userChoice = %this.current;\n\t\n\t%winner = thisVSthat(%userChoice,%result);\n\t\n\tif(%winner == 0)\n\t{\n\t\techo(\"You both chose \"@%userChoice@\", tie!\");\n\t}\n\telse\n\tif(%winner == 1)\n\t{\n\t\techo(\"You chose \"@%userChoice@\" computer chose \"@%result@\", you win!\");\n\t}\n\telse\n\tif(%winner == 2)\n\t{\n\t\techo(\"You chose \"@%userChoice@\" computer chose \"@%result@\", you lose!\");\n\t}\n\t\n\t%this.idle = true;\n}\n\nfunction RockPaperScissors::getChoiceByUserFrequency(%this)\n{\n\t%weakness[\"rock\"] = \"paper\";\n\t%weakness[\"paper\"] = \"Scissors\";\n\t%weakness[\"scissors\"] = \"rock\";\n\t\n\t%a[0] = %this.choice[\"rock\"];\n\t%a[1] = %this.choice[\"paper\"];\n\t%a[2] = %this.choice[\"Scissors\"];\n\t\n\t%b[0] = \"rock\";\n\t%b[1] = \"paper\";\n\t%b[2] = \"scissors\";\n\t\n\tfor(%i=0;%i<3;%i++)\n\t{\n\t\t%curr = %a[%i];\n\t\t\n\t\tif(%temp $= \"\")\n\t\t{\n\t\t\t%temp = %curr;\n\t\t\t%tempi = %i;\n\t\t}\n\t\telse\n\t\tif(%curr > %temp)\n\t\t{\n\t\t\t%temp = %curr;\n\t\t\t%tempi = %i;\n\t\t}\n\t}\n\t\n\treturn %weakness[%b[%tempi]];\n}\n\nfunction choose(%this)\n{\n\t%rps = rockPaperScissors;\n\t\n\tif(!%rps.idle)\n\t{\n\t\treturn 0;\n\t}\n\telse\n\tif(%this !$= \"rock\" && %this !$= \"paper\" && %this !$= \"scissors\")\n\t{\n\t\treturn 0;\n\t}\n\n\t%rps.choice[%this]++;\n\t%rps.current = %this;\n\t%rps.main();\n\t\n\treturn %this;\n}\n\nfunction thisVSthat(%this,%that)\n{\n\tif(%this !$= \"rock\" && %this !$= \"paper\" && %this !$= \"scissors\")\n\t{\n\t\treturn 0;\n\t}\n\telse\n\tif(%that !$= \"rock\" && %that !$= \"paper\" && %that !$= \"scissors\")\n\t{\n\t\treturn 0;\n\t}\n\t\n\t%weakness[\"rock\"] = \"paper\";\n\t%weakness[\"paper\"] = \"Scissors\";\n\t%weakness[\"scissors\"] = \"rock\";\n\t\n\tif(%weakness[%this] $= %that)\n\t{\n\t\t%result = 2;\n\t}\n\telse\n\tif(%weakness[%that] $= %this)\n\t{\n\t\t%result = 1;\n\t}\n\telse\n\t\t%result = 0;\n\t\t\n\treturn %result;\n}\n","language":"TorqueScript"},{"code":"RockPaperScissors.startGame();\n","language":"TorqueScript"},{"code":"choose(\"Rock\");\n","language":"TorqueScript"},{"code":"#!/bin/bash\nchoices=(rock paper scissors)\n\n# comparison function, works like Perl\n# winner x y = 2 if y beats x, 1 if x beats 1, 0 if it's a tie\nwinner() {\n local left=\"$1\" right=\"$2\"\n echo $(( (3 + left - right) % 3 ))\n}\n\n\nhuman_counts=(1 1 1)\nhuman_count=3\ncomputer_counts=(0 0 0)\ngames=0 human=0 computer=0\n\nPS3=\"What do you throw? \"\nwhile true; do\n select choice in rock paper scissors quit; do\n if [ -z \"$choice\" ]; then choice=\"$REPLY\"; fi\n if [ \"$choice\" = \"quit\" ]; then\n break 2\n fi\n for (( h=0; h<${#choices[@]}; ++h )); do\n if [ \"${choices[h]}\" = \"$choice\" ]; then\n break\n fi\n done\n if (( h < 3 )); then\n break\n fi\n echo \"Unrecognized choice. Try again!\"\n done\n\n let n=RANDOM%human_count\n for (( c=0; c<${#human_counts[@]}; ++c )); do\n let n-=${human_counts[c]}\n if (( n < 0 )); then\n break\n fi\n done\n let computer_counts[c]+=1\n echo\n echo \"You chose ${choices[h]^^}\"\n echo \"I chose ${choices[c]^^}\"\n w=\"$(winner \"$c\" \"$h\")\"\n case \"$w\" in\n 2) echo \"YOU WIN!\"; let human+=1;;\n 0) echo \"TIE!\";;\n 1) echo \"I WIN!\"; let computer+=1;;\n *) echo \"winner returned weird result '$w'\";;\n esac\n echo\n let games+=1\n (( human_counts[(h+1)%3]+=1, human_count+=1 ))\ndone\n\necho\necho \"We played $games games. You won $human, and I won $computer.\"\nfor (( i=0; i<3; ++i )); do\n echo \"You picked ${choices[i]} $(( human_counts[ (i+1)%3 ] - 1 )) times.\"\n echo \"I picked ${choices[i]} $(( computer_counts[i] )) times.\"\ndone\n","language":"UNIX-Shell"},{"code":"import rand\nimport os\n\nconst (\n\trps = 'rps'\n\tmsg = [\n 'Rock breaks scissors',s\n 'Paper covers rock',\n 'Scissors cut paper'\n\t]\n)\n\nfn main() {\n println(\"Rock Paper Scissors\")\n println(\"Enter r, p, or s as your play. Anything else ends the game.\")\n println(\"Running score shown as <your wins>:<my wins>\")\n mut pi :='' // player input\n mut a_score, mut p_score := 0, 0\n mut pcf := []int{len: 2, init: 0} // pcf = player choice frequency\n mut a_choice := rand.intn(3) or {0} // ai choice for first play is completely random\t\n for _ in 0..6 {\n\t\t// get player choice\n\t\tpi = os.input('Play: ').str()\n\t\tif typeof(pi).name != 'string' || pi.len != 1 {break}\n p_choice := rps.index_any(pi)\n if p_choice < 0 {break}\n pcf << p_choice\n // show result of play\n println('My play: ' + rps[a_choice].ascii_str())\n match (a_choice - p_choice + 3) % 3 {\n 0 {println(\"Tie.\")}\n 1 {println('My point.\\n' + msg[a_choice]) a_score++}\n 2 {println('Your point.\\n' + msg[p_choice]) p_score++}\n else {break}\n }\n // show score\n println('$p_score : $a_score')\n // compute ai choice for next play\n\t\trn := rand.intn(3) or {0}\n\t\tmatch true {\n\t\t\t\trn < pcf[0] {a_choice = 2}\n\t\t\t\trn < pcf[0] + pcf[1] {a_choice = 0}\n\t\t\t\telse {a_choice = rand.intn(3) or {0}}\n\t\t}\n }\t\n}\n","language":"V-(Vlang)"},{"code":"let entered=0\nlet keycode=0\nlet rcounter=1\nprint 1 \"Enter R for rock, P for paper, or S for scissors. (not case sensitive)\"\nwhile entered=0\ninput human$\nif human=$=\"r\"\nlet human$=\"rock\"\nlet entered=1\nelseif human=$=\"R\"\nlet human$=\"rock\"\nlet entered=1\nelseif human=$=\"p\"\nlet human$=\"paper\"\nlet entered=1\nelseif human=$=\"P\"\nlet human$=\"paper\"\nlet entered=1\nelseif human=$=\"s\"\nlet human$=\"scissors\"\nlet entered=1\nelseif human=$=\"S\"\nlet human$=\"scissors\"\nlet entered=1\nelseif entered=0\nprint 1 \"That choice is invalid.\"\nendif\nwend\nprint 1 \"Press any key so the computer can make its choice.\"\nwhile keycode=0\nlet rcounter=rcounter+1\nlet keycode=key()\nif rcounter=4\nlet rcounter=1\nendif\nwend\nif rcounter=1\nlet cpu$=\"rock\"\nelseif rcounter=2\nlet cpu$=\"paper\"\nelseif rcounter=3\nlet cpu$=\"scissors\"\nendif\nprint 1 \"You chose\"+human$+\".\"\nprint 1 \"The computer chose\"+cpu$+\".\"\nif human$=cpu$\nprint 1 \"You tied.\"\nendif\nif human$=\"rock\"\nif cpu$=\"paper\"\nprint 1 \"Paper covers rock, so you lose.\"\nendif\nif cpu$=\"scissors\"\nprint 1 \"Rock blunts scissors, so you win.\"\nendif\nendif\nif human$=\"paper\"\nif cpu$=\"rock\"\nprint 1 \"Paper covers rock, so you win.\"\nendif\nif cpu$=\"scissors\"\nprint 1 \"Scissors cut paper, so you lose.\"\nendif\nendif\nif human$=\"scissors\"\nif cpu$=\"rock\"\nprint 1 \"Rock blunts scissors, so you lose.\"\nendif\nif cpu$=\"paper\"\nprint 1 \"Scissors cut paper, so you win.\"\nendif\nendif\nend\n","language":"Wee-Basic"},{"code":"import \"random\" for Random\nimport \"./str\" for Str\nimport \"./ioutil\" for Input\n\nvar choices = \"rpsq\"\nvar rand = Random.new()\n\nvar pWins = 0 // player wins\nvar cWins = 0 // computer wins\nvar draws = 0 // neither wins\nvar games = 0 // games played\nvar pFreqs = [0, 0, 0] // player frequencies for each choice (rps)\n\nvar printScore = Fn.new {\n System.print(\"Wins: You %(pWins), Computer %(cWins), Neither %(draws)\\n\")\n}\n\nvar getComputerChoice = Fn.new {\n // make a completely random choice until 3 games have been played\n if (games < 3) return choices[rand.int(3)]\n var num = rand.int(games)\n return (num < pFreqs[0]) ? \"p\" :\n (num < pFreqs[0] + pFreqs[1]) ? \"s\" : \"r\"\n}\n\nSystem.print(\"Enter: (r)ock, (p)aper, (s)cissors or (q)uit\\n\")\nwhile (true) {\n printScore.call()\n var pChoice = Str.lower(Input.option(\"Your choice r/p/s/q : \", \"rpsqRPSQ\"))\n if (pChoice == \"q\") {\n System.print(\"OK, quitting\")\n return\n }\n var cChoice = getComputerChoice.call()\n System.print(\"Computer's choice : %(cChoice)\")\n if (pChoice == \"r\" && cChoice == \"s\") {\n System.print(\"Rock breaks scissors - You win!\")\n pWins = pWins + 1\n } else if (pChoice == \"p\" && cChoice == \"r\") {\n System.print(\"Paper covers rock - You win!\")\n pWins = pWins + 1\n } else if (pChoice == \"s\" && cChoice == \"p\") {\n System.print(\"Scissors cut paper - You win!\")\n pWins = pWins + 1\n } else if (pChoice == \"s\" && cChoice == \"r\") {\n System.print(\"Rock breaks scissors - Computer wins!\")\n cWins = cWins + 1\n } else if (pChoice == \"r\" && cChoice == \"p\") {\n System.print(\"Paper covers rock - Computer wins!\")\n cWins = cWins + 1\n } else if (pChoice == \"p\" && cChoice == \"s\") {\n System.print(\"Scissors cut paper - Computer wins!\")\n cWins = cWins + 1\n } else {\n System.print(\"It's a draw!\")\n draws = draws + 1\n }\n var pf = pFreqs[choices.indexOf(pChoice)]\n pFreqs[choices.indexOf(pChoice)] = pf + 1\n games = games + 1\n System.print()\n}\n","language":"Wren"},{"code":"REM Yabasic 2.763 version\n\nWINNER = 1 : ACTION = 2 : LOSSER = 3\ndim word$(10, 3)\n\nfor n = 0 to 9\n read word$(n, WINNER), word$(n, ACTION), word$(n, LOSSER)\nnext n\n\nrepeat\n clear screen\n computerChoice$ = word$(ran(10), WINNER)\n print \"'Rock, Paper, Scissors, Lizard, Spock!' rules are:\\n\"\n for n = 0 to 9\n SimonSay(n)\n next n\n print \"\\nType your choice letter:\"\n print \"(R)ock, (P)aper, (S)cissors, (L)izard, Spoc(K), (Q)uit\\n\"\n k$ = upper$(inkey$)\n if k$ = \"Q\" break\n switch k$\n case \"R\": humanChoice$ = \"Rock\" : break\n case \"P\": humanChoice$ = \"Paper\" : break\n case \"S\": humanChoice$ = \"Scissors\" : break\n case \"L\": humanChoice$ = \"Lizard\" : break\n case \"K\": humanChoice$ = \"Spock\" : break\n end switch\n print \"Player chose \", humanChoice$, \" and Computer chose \", computerChoice$\n for n = 0 to 9\n if word$(n, WINNER) = humanChoice$ and word$(n, LOSSER) = computerChoice$ then\n SimonSay(n)\n print \"Winner was Player\"\n wp = wp + 1\n break\n elseif word$(n, WINNER) = computerChoice$ and word$(n, LOSSER) = humanChoice$ then\n SimonSay(n)\n print \"Winner was Computer\"\n wc = wc + 1\n break\n end if\n next n\n if n = 10 then\n print \"Ouch!\"\n end if\n punctuation()\n print \"\\nPress any key to continue\"\n inkey$\nuntil(k$ = \"Q\")\n\npunctuation()\nif wp > wc then\n print \"Player win\"\nelseif wc > wp then\n print \"Computer win\"\nelse\n print \"Tie\"\nend if\n\nend\n\nsub SimonSay(n)\n print word$(n, WINNER), \" \", word$(n, ACTION), \" \", word$(n, LOSSER)\nend sub\n\nsub punctuation()\n print \"\\nPlayer = \", wp, \"\\tComputer = \", wc, \"\\n\"\nend sub\n\ndata \"Scissors\",\"cuts\",\"Paper\"\ndata \"Paper\",\"covers\",\"Rock\"\ndata \"Rock\",\"crushes\",\"Lizard\"\ndata \"Lizard\",\"poisons\",\"Spock\"\ndata \"Spock\",\"smashes\",\"Scissors\"\ndata \"Scissors\",\"decapites\",\"Lizard\"\ndata \"Lizard\",\"eats\",\"Paper\"\ndata \"Paper\",\"disproves\",\"Spock\"\ndata \"Spock\",\"vaporizes\",\"Rock\"\ndata \"Rock\",\"blunts\",\"Scissors\"\n","language":"Yabasic"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Rock-paper-scissors\\nnote: Games\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nImplement the classic children's game [[wp:Rock-paper-scissors|Rock-paper-scissors]], as well as a simple predictive '''AI''' (<u>a</u>rtificial <u>i</u>ntelligence) player.\\n\\nRock Paper Scissors is a two player game. \\n\\nEach player chooses one of rock, paper or scissors, without knowing the other player's choice. \\n\\nThe winner is decided by a set of rules:\\n\\n:::* Rock beats scissors\\n:::* Scissors beat paper\\n:::* Paper beats rock\\n\\n<br>\\nIf both players choose the same thing, there is no winner for that round.\\n\\nFor this task, the computer will be one of the players. \\n\\nThe operator will select Rock, Paper or Scissors and the computer will keep a record of the choice frequency, and use that information to make a [[Probabilistic choice|weighted random choice]] in an attempt to defeat its opponent.\\n\\n\\n;Extra credit:\\nSupport additional choices [[wp:Rock-paper-scissors#Additional_weapons|additional weapons]].\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V rules = [‘rock’ = ‘paper’, ‘scissors’ = ‘rock’, ‘paper’ = ‘scissors’]\\nV previous = [‘rock’, ‘paper’, ‘scissors’]\\n\\nL\\n V human = input(\\\"\\\\nchoose your weapon: \\\")\\n V computer = rules[random:choice(previous)]\\n\\n I human C (‘quit’, ‘exit’)\\n L.break\\n\\n E I human C rules\\n previous.append(human)\\n print(‘the computer played ’computer, end' ‘; ’)\\n\\n I rules[computer] == human\\n print(‘yay you win!’)\\n E I rules[human] == computer\\n print(‘the computer beat you... :(’)\\n E\\n print(‘it's a tie!’)\\n\\n E\\n print(‘that's not a valid choice’)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Text_IO; with Ada.Numerics.Float_Random;\\n\\nprocedure Rock_Paper_Scissors is\\n\\n package Rand renames Ada.Numerics.Float_Random;\\n Gen: Rand.Generator;\\n\\n type Choice is (Rock, Paper, Scissors);\\n\\n Cnt: array (Choice) of Natural := (1, 1, 1);\\n -- for the initialization: pretend that each of Rock, Paper,\\n -- and Scissors, has been played once by the human\\n -- else the first computer choice would be deterministic\\n\\n function Computer_Choice return Choice is\\n Random_Number: Natural :=\\n Integer(Rand.Random(Gen)\\n * (Float(Cnt(Rock)) + Float(Cnt(Paper)) + Float(Cnt(Scissors))));\\n begin\\n if Random_Number < Cnt(Rock) then\\n -- guess the human will choose Rock\\n return Paper;\\n elsif Random_Number - Cnt(Rock) < Cnt(Paper) then\\n -- guess the human will choose Paper\\n return Scissors;\\n else -- guess the human will choose Scissors\\n return Rock;\\n end if;\\n end Computer_Choice;\\n\\n Finish_The_Game: exception;\\n\\n function Human_Choice return Choice is\\n Done: Boolean := False;\\n T: constant String\\n := \\\"enter \\\"\\\"r\\\"\\\" for Rock, \\\"\\\"p\\\"\\\" for Paper, or \\\"\\\"s\\\"\\\" for Scissors\\\"\\\"!\\\";\\n U: constant String\\n := \\\"or enter \\\"\\\"q\\\"\\\" to Quit the game\\\";\\n Result: Choice;\\n begin\\n Ada.Text_IO.Put_Line(T);\\n Ada.Text_IO.Put_Line(U);\\n while not Done loop\\n Done := True;\\n declare\\n S: String := Ada.Text_IO.Get_Line;\\n begin\\n if S=\\\"r\\\" or S=\\\"R\\\" then\\n Result := Rock;\\n elsif S=\\\"p\\\" or S = \\\"P\\\" then\\n Result := Paper;\\n elsif S=\\\"s\\\" or S=\\\"S\\\" then\\n Result := Scissors;\\n elsif S=\\\"q\\\" or S=\\\"Q\\\" then\\n raise Finish_The_Game;\\n else\\n Done := False;\\n end if;\\n end;\\n end loop;\\n return Result;\\n end Human_Choice;\\n\\n type Result is (Human_Wins, Draw, Computer_Wins);\\n\\n function \\\"<\\\" (X, Y: Choice) return Boolean is\\n -- X < Y if X looses against Y\\n begin\\n case X is\\n when Rock => return (Y = Paper);\\n when Paper => return (Y = Scissors);\\n when Scissors => return (Y = Rock);\\n end case;\\n end \\\"<\\\";\\n\\n Score: array(Result) of Natural := (0, 0, 0);\\n\\n C,H: Choice;\\n\\n Res: Result;\\n\\nbegin\\n -- play the game\\n loop\\n C := Computer_Choice; -- the computer makes its choice first\\n H := Human_Choice; -- now ask the player for his/her choice\\n Cnt(H) := Cnt(H) + 1; -- update the counts for the AI\\n if C < H then\\n Res := Human_Wins;\\n elsif H < C then\\n Res := Computer_Wins;\\n else\\n Res := Draw;\\n end if;\\n Ada.Text_IO.Put_Line(\\\"COMPUTER'S CHOICE: \\\" & Choice'Image(C)\\n & \\\" RESULT: \\\" & Result'Image(Res));\\n Ada.Text_IO.New_Line;\\n Score(Res) := Score(Res) + 1;\\n end loop;\\n\\nexception\\n when Finish_The_Game =>\\n Ada.Text_IO.New_Line;\\n for R in Score'Range loop\\n Ada.Text_IO.Put_Line(Result'Image(R) & Natural'Image(Score(R)));\\n end loop;\\nend Rock_Paper_Scissors;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"text\\ncomputer_play(record plays, record beats)\\n{\\n integer a, c, total;\\n text s;\\n\\n total = plays[\\\"rock\\\"] + plays[\\\"paper\\\"] + plays[\\\"scissors\\\"];\\n a = drand(total - 1);\\n for (s, c in plays) {\\n if (a < c) {\\n break;\\n }\\n a -= c;\\n }\\n\\n beats[s];\\n}\\n\\ninteger\\nmain(void)\\n{\\n integer computer, human;\\n record beats, plays;\\n file f;\\n text s;\\n\\n computer = human = 0;\\n\\n f.stdin;\\n\\n beats[\\\"rock\\\"] = \\\"paper\\\";\\n beats[\\\"paper\\\"] = \\\"scissors\\\";\\n beats[\\\"scissors\\\"] = \\\"rock\\\";\\n\\n plays[\\\"rock\\\"] = 1;\\n plays[\\\"paper\\\"] = 1;\\n plays[\\\"scissors\\\"] = 1;\\n\\n while (1) {\\n o_text(\\\"Your choice [rock/paper/scissors]:\\\\n\\\");\\n if (f.line(s) == -1) {\\n break;\\n }\\n\\n if (!plays.key(s)) {\\n o_text(\\\"Invalid choice, try again\\\\n\\\");\\n } else {\\n text c;\\n\\n c = computer_play(plays, beats);\\n\\n o_form(\\\"Human: ~, Computer: ~\\\\n\\\", s, c);\\n\\n if (s == c) {\\n o_text(\\\"Draw\\\\n\\\");\\n } elif (c == beats[s]) {\\n computer += 1;\\n o_text(\\\"Computer wins\\\\n\\\");\\n } else {\\n human += 1;\\n o_text(\\\"Human wins\\\\n\\\");\\n }\\n\\n plays.up(s);\\n\\n o_form(\\\"Score: Human: ~, Computer: ~\\\\n\\\", human, computer);\\n }\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"BEGIN\\n # rock/paper/scissors game #\\n # counts of the number of times the player has chosen each move #\\n # we initialise each to 1 so that the total isn't zero when we are #\\n # choosing the computer's first move (as in the Ada version) #\\n INT r count := 1;\\n INT p count := 1;\\n INT s count := 1;\\n # counts of how many games the player and computer have won #\\n INT player count := 0;\\n INT computer count := 0;\\n print( ( \\\"rock/paper/scissors\\\", newline, newline ) );\\n WHILE\\n CHAR player move;\\n # get the players move - r => rock, p => paper, s => scissors #\\n # q => quit #\\n WHILE\\n print( ( \\\"Please enter your move (r/p/s) or q to quit: \\\" ) );\\n read( ( player move, newline ) );\\n ( player move /= \\\"r\\\"\\n AND player move /= \\\"p\\\"\\n AND player move /= \\\"s\\\"\\n AND player move /= \\\"q\\\"\\n )\\n DO\\n print( ( \\\"Unrecognised move\\\", newline ) )\\n OD;\\n # continue playing until the player chooses quit #\\n player move /= \\\"q\\\"\\n DO\\n # decide the computer's move based on the player's history #\\n CHAR computer move;\\n INT move count = r count + p count + s count;\\n # predict player will play rock if the random number #\\n # is in the range 0 .. rock / total #\\n # predict player will play paper if the random number #\\n # is in the range rock / total .. ( rock + paper ) / total #\\n # predict player will play scissors otherwise #\\n REAL r limit = r count / move count;\\n REAL p limit = r limit + ( p count / move count );\\n REAL random move = next random;\\n IF random move < r limit THEN\\n # we predict the player will choose rock - we choose paper #\\n computer move := \\\"p\\\"\\n ELIF random move < p limit THEN\\n # we predict the player will choose paper - we choose scissors #\\n computer move := \\\"s\\\"\\n ELSE\\n # we predict the player will choose scissors - we choose rock #\\n computer move := \\\"r\\\"\\n FI;\\n print( ( \\\"You chose: \\\" + player move, newline ) );\\n print( ( \\\"I chose: \\\" + computer move, newline ) );\\n IF player move = computer move THEN\\n # both players chose the same - draw #\\n print( ( \\\"We draw\\\", newline ) )\\n ELSE\\n # players chose different moves - there is a winner #\\n IF ( player move = \\\"r\\\" AND computer move = \\\"s\\\" )\\n OR ( player move = \\\"p\\\" AND computer move = \\\"r\\\" )\\n OR ( player move = \\\"s\\\" AND computer move = \\\"p\\\" )\\n THEN\\n player count +:= 1;\\n print( ( \\\"You win\\\", newline ) )\\n ELSE\\n computer count +:= 1;\\n print( ( \\\"I win\\\", newline ) )\\n FI;\\n print( ( \\\"You won: \\\"\\n , whole( player count , 0 )\\n , \\\", I won: \\\"\\n , whole( computer count, 0 )\\n , newline\\n )\\n )\\n FI;\\n IF player move = \\\"r\\\" THEN\\n # player chose rock #\\n r count +:= 1\\n ELIF player move = \\\"p\\\" THEN\\n # player chose paper #\\n p count +:= 1\\n ELSE\\n # player chose scissors #\\n s count +:= 1\\n FI\\n OD;\\n print( ( \\\"Thanks for a most enjoyable game\\\", newline ) )\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"DllCall(\\\"AllocConsole\\\")\\nWrite(\\\"Welcome to Rock-Paper-Scissors`nMake a choice: \\\")\\n\\ncR := cP := cS := 0 ; user choice count\\nuserChoice := Read()\\nWrite(\\\"My choice: \\\" . cpuChoice := MakeChoice(1, 1, 1))\\n\\nLoop\\n{\\n\\tWrite(DecideWinner(userChoice, cpuChoice) . \\\"`nMake A Choice: \\\")\\n\\tcR += SubStr(userChoice, 1, 1) = \\\"r\\\", cP += InStr(userChoice, \\\"P\\\"), cS += InStr(userChoice, \\\"S\\\")\\n\\tuserChoice := Read()\\n\\tWrite(\\\"My Choice: \\\" . cpuChoice := MakeChoice(cR, cP, cS))\\n}\\n\\nMakeChoice(cR, cP, cS){\\n\\t; parameters are number of times user has chosen each item\\n\\ttotal := cR + cP + cS\\n\\t\\n\\tRandom, rand, 0.0, 1.0\\n\\tif (rand >= 0 and rand <= cR / total)\\n\\t\\treturn \\\"Paper\\\"\\n\\telse if (rand > cR / total and rand <= (cR + cP) / total)\\n\\t\\treturn \\\"Scissors\\\"\\n\\telse\\n\\t\\treturn \\\"Rock\\\"\\n}\\n\\nDecideWinner(user, cpu){\\n\\tuser := SubStr(user, 1, 1), cpu := SubStr(cpu, 1, 1)\\n\\tif (user = cpu)\\n\\t\\treturn \\\"`nTie!\\\"\\n\\telse if (user = \\\"r\\\" and cpu = \\\"s\\\") or (user = \\\"p\\\" and cpu = \\\"r\\\") or (user = \\\"s\\\" and cpu = \\\"p\\\")\\n\\t\\treturn \\\"`nYou Win!\\\"\\n\\telse\\n\\t\\treturn \\\"`nI Win!\\\"\\n}\\n\\nRead(){\\n\\tFileReadLine, a, CONIN$, 1\\n\\treturn a\\n}\\nWrite(txt){\\n\\tFileAppend, % txt, CONOUT$\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"RPS()\\n\\nFunc RPS()\\n\\tLocal $ai_Played_games[4]\\n\\t$ai_Played_games[0] = 3\\n\\tFor $I = 1 To 3\\n\\t\\t$ai_Played_games[$I] = 1\\n\\tNext\\n\\t$RPS = GUICreate(\\\"Rock Paper Scissors\\\", 338, 108, 292, 248)\\n\\t$Rock = GUICtrlCreateButton(\\\"Rock\\\", 8, 8, 113, 25, 131072)\\n\\t$Paper = GUICtrlCreateButton(\\\"Paper\\\", 8, 40, 113, 25, 131072)\\n\\t$Scissors = GUICtrlCreateButton(\\\"Scissors\\\", 8, 72, 113, 25, 131072)\\n\\t$Label1 = GUICtrlCreateLabel(\\\"W:\\\", 136, 8, 18, 17)\\n\\t$Wins = GUICtrlCreateLabel(\\\"0\\\", 160, 8, 36, 17)\\n\\t$Label3 = GUICtrlCreateLabel(\\\"L:\\\", 208, 8, 13, 17)\\n\\t$Looses = GUICtrlCreateLabel(\\\"0\\\", 224, 8, 36, 17)\\n\\t$Label5 = GUICtrlCreateLabel(\\\"D:\\\", 272, 8, 15, 17)\\n\\t$Deuce = GUICtrlCreateLabel(\\\"0\\\", 296, 8, 36, 17)\\n\\t$Displaybutton = GUICtrlCreateButton(\\\"\\\", 136, 48, 193, 49, 131072)\\n\\tGUICtrlSetState($ai_Played_games, 128)\\n\\tGUISetState(@SW_SHOW)\\n\\tWhile 1\\n\\t\\t$nMsg = GUIGetMsg()\\n\\t\\tSwitch $nMsg\\n\\t\\t\\tCase -3\\n\\t\\t\\t\\tExit\\n\\t\\t\\tCase $Rock\\n\\t\\t\\t\\t$Ret = _RPS_Eval(1, $ai_Played_games)\\n\\t\\t\\t\\tGUICtrlSetData($Displaybutton, $Ret)\\n\\t\\t\\t\\tIf $Ret = \\\"Deuce\\\" Then\\n\\t\\t\\t\\t\\tGUICtrlSetData($Deuce, Guictrlread($Deuce)+1)\\n\\t\\t\\t\\tElseif $Ret = \\\"You Loose\\\" Then\\n\\t\\t\\t\\t\\tGUICtrlSetData($Looses, Guictrlread($Looses)+1)\\n\\t\\t\\t\\tElseif $Ret = \\\"You Win\\\" Then\\n\\t\\t\\t\\t\\tGUICtrlSetData($Wins, Guictrlread($Wins)+1)\\n\\t\\t\\t\\tEndIf\\n\\t\\t\\tCase $Paper\\n\\t\\t\\t\\t$Ret = _RPS_Eval(2, $ai_Played_games)\\n\\t\\t\\t\\tGUICtrlSetData($Displaybutton, $Ret)\\n\\t\\t\\t\\tIf $Ret = \\\"Deuce\\\" Then\\n\\t\\t\\t\\t\\tGUICtrlSetData($Deuce, Guictrlread($Deuce)+1)\\n\\t\\t\\t\\tElseif $Ret = \\\"You Loose\\\" Then\\n\\t\\t\\t\\t\\tGUICtrlSetData($Looses, Guictrlread($Looses)+1)\\n\\t\\t\\t\\tElseif $Ret = \\\"You Win\\\" Then\\n\\t\\t\\t\\t\\tGUICtrlSetData($Wins, Guictrlread($Wins)+1)\\n\\t\\t\\t\\tEndIf\\n\\t\\t\\tCase $Scissors\\n\\t\\t\\t\\t$Ret = _RPS_Eval(3, $ai_Played_games)\\n\\t\\t\\t\\tGUICtrlSetData($Displaybutton, $Ret)\\n\\t\\t\\t\\tIf $Ret = \\\"Deuce\\\" Then\\n\\t\\t\\t\\t\\tGUICtrlSetData($Deuce, Guictrlread($Deuce)+1)\\n\\t\\t\\t\\tElseif $Ret = \\\"You Loose\\\" Then\\n\\t\\t\\t\\t\\tGUICtrlSetData($Looses, Guictrlread($Looses)+1)\\n\\t\\t\\t\\tElseif $Ret = \\\"You Win\\\" Then\\n\\t\\t\\t\\t\\tGUICtrlSetData($Wins, Guictrlread($Wins)+1)\\n\\t\\t\\t\\tEndIf\\n\\t\\tEndSwitch\\n\\tWEnd\\n\\nEndFunc ;==>RPS\\n\\nFunc _RPS_Eval($i_Player_Choose, $ai_Played_games)\\n\\tLocal $i_choice = 1\\n\\t$i_rnd = Random(1, 1000, 1)\\n\\t$i_choose_1 = ($ai_Played_games[1] / $ai_Played_games[0] * 1000)\\n\\t$i_choose_2 = ($ai_Played_games[2] / $ai_Played_games[0] * 1000)\\n\\t$i_choose_3 = ($ai_Played_games[3] / $ai_Played_games[0] * 1000)\\n\\tIf $i_rnd < $i_choose_1 Then\\n\\t\\t$i_choice = 2\\n\\tElseIf $i_rnd < $i_choose_1 + $i_choose_2 And $i_rnd > $i_choose_1 Then\\n\\t\\t$i_choice = 3\\n\\tElseIf $i_rnd < $i_choose_1 + $i_choose_2 + $i_choose_3 And $i_rnd > $i_choose_1 + $i_choose_2 Then\\n\\t\\t$i_choice = 1\\n\\tEndIf\\n\\t$ai_Played_games[0] += 1\\n\\tIf $i_Player_Choose = 1 Then\\n\\t\\t$ai_Played_games[1] += 1\\n\\t\\tIf $i_choice = 1 Then Return \\\"Deuce\\\"\\n\\t\\tIf $i_choice = 2 Then Return \\\"You Loose\\\"\\n\\t\\tIf $i_choice = 3 Then Return \\\"You Win\\\"\\n\\tElseIf $i_Player_Choose = 2 Then\\n\\t\\t$ai_Played_games[2] += 1\\n\\t\\tIf $i_choice = 2 Then Return \\\"Deuce\\\"\\n\\t\\tIf $i_choice = 3 Then Return \\\"You Loose\\\"\\n\\t\\tIf $i_choice = 1 Then Return \\\"You Win\\\"\\n\\tElseIf $i_Player_Choose = 3 Then\\n\\t\\t$ai_Played_games[3] += 1\\n\\t\\tIf $i_choice = 3 Then Return \\\"Deuce\\\"\\n\\t\\tIf $i_choice = 1 Then Return \\\"You Loose\\\"\\n\\t\\tIf $i_choice = 2 Then Return \\\"You Win\\\"\\n\\tEndIf\\nEndFunc ;==>_RPS_Eval\\n\",\n \"language\": \"AutoIt\"\n },\n {\n \"code\": \"DIM pPLchoice(1 TO 3) AS INTEGER, pCMchoice(1 TO 3) AS INTEGER\\nDIM choices(1 TO 3) AS STRING\\nDIM playerwins(1 TO 3) AS INTEGER\\nDIM playerchoice AS INTEGER, compchoice AS INTEGER\\nDIM playerwon AS INTEGER, compwon AS INTEGER, tie AS INTEGER\\nDIM tmp AS INTEGER\\n\\n' Do it this way for QBasic; FreeBASIC supports direct array assignment.\\nDATA \\\"rock\\\", \\\"paper\\\", \\\"scissors\\\"\\nFOR tmp = 1 to 3\\n READ choices(tmp)\\nNEXT\\nDATA 3, 1, 2\\nFOR tmp = 1 to 3\\n READ playerwins(tmp)\\nNEXT\\n\\nRANDOMIZE TIMER\\n\\nDO\\n ' Computer chooses first to ensure there's no \\\"cheating\\\".\\n compchoice = INT(RND * (pPLchoice(1) + pPLchoice(2) + pPLchoice(3) + 3))\\n SELECT CASE compchoice\\n CASE 0 to (pPLchoice(1))\\n ' Player past choice: rock; choose paper.\\n compchoice = 2\\n CASE (pPLchoice(1) + 1) TO (pPLchoice(1) + pPLchoice(2) + 1)\\n ' Player past choice: paper; choose scissors.\\n compchoice = 3\\n CASE (pPLchoice(1) + pPLchoice(2) + 2) TO (pPLchoice(1) + pPLchoice(2) + pPLchoice(3) + 2)\\n ' Player past choice: scissors; choose rock.\\n compchoice = 1\\n END SELECT\\n\\n PRINT \\\"Rock, paper, or scissors \\\";\\n DO\\n PRINT \\\"[1 = rock, 2 = paper, 3 = scissors, 0 to quit]\\\";\\n INPUT playerchoice\\n LOOP WHILE (playerchoice < 0) OR (playerchoice > 3)\\n\\n IF 0 = playerchoice THEN EXIT DO\\n\\n pCMchoice(compchoice) = pCMchoice(compchoice) + 1\\n pPLchoice(playerchoice) = pPLchoice(playerchoice) + 1\\n PRINT \\\"You chose \\\"; choices(playerchoice); \\\" and I chose \\\"; choices(compchoice); \\\". \\\";\\n IF (playerchoice) = compchoice THEN\\n PRINT \\\"Tie!\\\"\\n tie = tie + 1\\n ELSEIF (compchoice) = playerwins(playerchoice) THEN\\n PRINT \\\"You won!\\\"\\n playerwon = playerwon + 1\\n ELSE\\n PRINT \\\"I won!\\\"\\n compwon = compwon + 1\\n END IF\\nLOOP\\n\\nPRINT \\\"Some useless statistics:\\\"\\nPRINT \\\"You won \\\"; STR$(playerwon); \\\" times, and I won \\\"; STR$(compwon); \\\" times; \\\"; STR$(tie); \\\" ties.\\\"\\nPRINT , choices(1), choices(2), choices(3)\\nPRINT \\\"You chose:\\\", pPLchoice(1), pPLchoice(2), pPLchoice(3)\\nPRINT \\\" I chose:\\\", pCMchoice(1), pCMchoice(2), pCMchoice(3)\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"@echo off\\nsetlocal enabledelayedexpansion\\n\\nset choice1=rock\\nset choice2=paper\\nset choice3=scissors\\nset freq1=0\\nset freq2=0\\nset freq3=0\\nset games=0\\nset won=0\\nset lost=0\\nset tie=0\\n\\n:start\\ncls\\necho Games - %games% : Won - %won% : Lost - %lost% : Ties - %tie%\\nchoice /c RPS /n /m \\\"[R]ock, [P]aper or [S]cissors? \\\"\\n\\nset choice=%errorlevel%\\nrem used [1,1000] as interval for random\\nif %games% equ 0 (\\n rem at the beginning, there's no bias for each choice\\n set /a \\\"rocklimit=1000 / 3\\\"\\n set /a \\\"scissorslimit=1000 * 2 / 3\\\"\\n) else (\\n set /a \\\"rocklimit=1000 * %freq3% / %games%\\\"\\n set /a \\\"scissorslimit=1000 * (%freq1% + %freq3%) / %games%\\\"\\n)\\nset /a \\\"randchoice=%random% %% 1000 + 1\\\"\\nset compchoice=2\\nif %randchoice% geq %scissorslimit% set compchoice=3\\nif %randchoice% leq %rocklimit% set compchoice=1\\n\\ncls\\necho Player: !choice%choice%! ^|vs^| Computer: !choice%compchoice%!\\ngoto %compchoice%\\n\\n:1\\nif %choice%==1 goto tie\\nif %choice%==2 goto win\\nif %choice%==3 goto loss\\n\\n:2\\nif %choice%==1 goto loss\\nif %choice%==2 goto tie\\nif %choice%==3 goto win\\n\\n:3\\nif %choice%==1 goto win\\nif %choice%==2 goto loss\\nif %choice%==3 goto tie\\n\\n:win\\nset /a \\\"won+=1\\\"\\necho Player wins^!\\ngoto end\\n\\n:loss\\nset /a \\\"lost+=1\\\"\\necho Computer Wins^!\\ngoto end\\n\\n:tie\\nset /a \\\"tie+=1\\\"\\necho Tie^!\\ngoto end\\n\\n:end\\nset /a \\\"games+=1\\\"\\nset /a \\\"freq%choice%+=1\\\"\\npause\\ngoto start\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \"PRINT\\\"Welcome to the game of rock-paper-scissors\\\"\\nPRINT \\\"Each player guesses one of these three, and reveals it at the same time.\\\"\\nPRINT \\\"Rock blunts scissors, which cut paper, which wraps stone.\\\"\\nPRINT \\\"If both players choose the same, it is a draw!\\\"\\nPRINT \\\"When you've had enough, choose Q.\\\"\\nDIM rps%(2),g$(3)\\ng$()=\\\"rock\\\",\\\"paper\\\",\\\"scissors\\\"\\ntotal%=0\\ndraw%=0\\npwin%=0\\ncwin%=0\\nc%=RND(3)\\nPRINT\\\"What is your move (press R, P, or S)?\\\"\\nREPEAT\\n REPEAT q$=GET$ UNTIL INSTR(\\\"RPSrpsQq\\\",q$)>0\\n g%=(INSTR(\\\"RrPpSsQq\\\",q$)-1) DIV 2\\n IF g%>2 THEN PROCsummarise:END\\n total%+=1\\n rps%(g%)+=1\\n PRINT\\\"You chose \\\";g$(g%);\\\" and I chose \\\";g$(c%);\\n CASE g%-c% OF\\n WHEN 0:\\n PRINT \\\". It's a draw\\\"\\n draw%+=1\\n WHEN 1,-2:\\n PRINT \\\". You win!\\\"\\n pwin%+=1\\n WHEN -1,2:\\n PRINT \\\". I win!\\\"\\n cwin%+=1\\n ENDCASE\\n c%=FNmove(rps%(),total%)\\nUNTIL FALSE\\nEND\\n:\\nDEFPROCsummarise\\nPRINT \\\"You won \\\";pwin%;\\\", and I won \\\";cwin%;\\\". There were \\\";draw%;\\\" draws\\\"\\nPRINT \\\"Thanks for playing!\\\"\\nENDPROC\\n:\\nDEFFNmove(p%(),t%)\\nLOCAL r%\\nr%=RND(total%)\\nIF r%<=p%(0) THEN =1\\nIF r%<=p%(0)+p%(1) THEN =2\\n=0\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#define LEN 3\\n\\n/* pick a random index from 0 to n-1, according to probablities listed\\n in p[] which is assumed to have a sum of 1. The values in the probablity\\n list matters up to the point where the sum goes over 1 */\\nint rand_idx(double *p, int n)\\n{\\n\\tdouble s = rand() / (RAND_MAX + 1.0);\\n\\tint i;\\n\\tfor (i = 0; i < n - 1 && (s -= p[i]) >= 0; i++);\\n\\treturn i;\\n}\\n\\nint main()\\n{\\n\\tint user_action, my_action;\\n\\tint user_rec[] = {0, 0, 0};\\n\\tconst char *names[] = { \\\"Rock\\\", \\\"Paper\\\", \\\"Scissors\\\" };\\n\\tchar str[2];\\n\\tconst char *winner[] = { \\\"We tied.\\\", \\\"Meself winned.\\\", \\\"You win.\\\" };\\n\\tdouble p[LEN] = { 1./3, 1./3, 1./3 };\\n\\n\\twhile (1) {\\n\\t\\tmy_action = rand_idx(p,LEN);\\n\\n\\t\\tprintf(\\\"\\\\nYour choice [1-3]:\\\\n\\\"\\n\\t\\t\\t\\\" 1. Rock\\\\n 2. Paper\\\\n 3. Scissors\\\\n> \\\");\\n\\n\\t\\t/* scanf is a terrible way to do input. should use stty and keystrokes */\\n\\t\\tif (!scanf(\\\"%d\\\", &user_action)) {\\n\\t\\t\\tscanf(\\\"%1s\\\", str);\\n\\t\\t\\tif (*str == 'q') {\\n\\t\\t\\t\\tprintf(\\\"Your choices [rock : %d , paper : %d , scissors %d] \\\",user_rec[0],user_rec[1], user_rec[2]);\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tuser_action --;\\n\\t\\tif (user_action > 2 || user_action < 0) {\\n\\t\\t\\tprintf(\\\"invalid choice; again\\\\n\\\");\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tprintf(\\\"You chose %s; I chose %s. %s\\\\n\\\",\\n\\t\\t\\tnames[user_action], names[my_action],\\n\\t\\t\\twinner[(my_action - user_action + 3) % 3]);\\n\\n\\t\\tuser_rec[user_action]++;\\n\\t}\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h> // Standard IO\\n#include <stdlib.h> // other stuff\\n#include <time.h>\\n#include <string.h>\\n\\n//This should add weighted random function to \\\"The Elite Noob\\\"'s code, stolen from above code because it does calculation so well\\n//closest I could make it to original but without pointless attempt to make code look smaller than above code by putting code on the same lines\\n\\nint rand_i(int n)\\n{\\n\\tint rand_max = RAND_MAX - (RAND_MAX % n);\\n\\tint ret;\\n\\twhile ((ret = rand()) >= rand_max);\\n\\treturn ret/(rand_max / n);\\n}\\n\\nint weighed_rand(int *tbl, int len)\\n{\\n\\tint i, sum, r;\\n\\tfor (i = 0, sum = 0; i < len; sum += tbl[i++]);\\n\\tif (!sum) return rand_i(len);\\n\\n\\tr = rand_i(sum) + 1;\\n\\tfor (i = 0; i < len && (r -= tbl[i]) > 0; i++);\\n\\treturn i;\\n}\\n\\n\\n\\nint main(int argc, const char *argv[])\\n{\\n\\tchar umove[10], cmove[10], line[255];\\n\\tint user, comp;\\n\\tint tbl[]={0,0,0};\\n\\tint tbllen=3;\\n\\tprintf(\\\"Hello, Welcome to rock-paper-scissors\\\\nBy The Elite Noob\\\\n\\\");\\nmainloop:\\n\\twhile(1)\\n\\t{ // infinite loop :)\\n\\t\\tprintf(\\\"\\\\n\\\\nPlease type in 1 for Rock, 2 For Paper, 3 for Scissors, 4 to quit\\\\n\\\");\\n\\t\\tsrand(time(NULL));\\n\\t\\tcomp = (weighed_rand(tbl, tbllen) + 1) % 3;\\n\\t\\tfgets(line, sizeof(line), stdin);\\t\\n\\t\\twhile(sscanf(line, \\\"%d\\\", &user) != 1) //1 match of defined specifier on input line\\n\\t\\t{\\n \\t\\t\\tprintf(\\\"You have not entered an integer.\\\\n\\\");\\n\\t\\t\\tfgets(line, sizeof(line), stdin);\\n\\t\\t}\\t\\t\\t\\t\\n\\t\\tif( (user > 4) || (user < 1) )\\n\\t\\t{\\n\\t\\t\\tprintf(\\\"Please enter a valid number!\\\\n\\\");\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tswitch (comp)\\n\\t\\t{\\n\\t\\t\\tcase 1 :\\n\\t\\t\\t\\tstrcpy(cmove, \\\"Rock\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 2 :\\n\\t\\t\\t\\tstrcpy(cmove, \\\"Paper\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 3 :\\n\\t\\t\\t\\tstrcpy(cmove, \\\"Scissors\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tdefault :\\n\\t\\t\\t\\tprintf(\\\"Computer Error, set comp=1\\\\n\\\");\\n\\t\\t\\t\\tcomp=1;\\n\\t\\t\\t\\tstrcpy(cmove, \\\"Rock\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tswitch (user)\\n\\t\\t{\\n\\t\\t\\tcase 1 :\\n\\t\\t\\t\\tstrcpy(umove, \\\"Rock\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 2 :\\n\\t\\t\\t\\tstrcpy(umove, \\\"Paper\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 3 :\\n\\t\\t\\t\\tstrcpy(umove, \\\"Scissors\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 4 :\\n\\t\\t\\t\\tprintf(\\\"Goodbye! Thanks for playing!\\\\n\\\");\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\tdefault :\\n\\t\\t\\t\\tprintf(\\\"Error, user number not between 1-4 exiting...\\\");\\n\\t\\t\\t\\tgoto mainloop;\\n\\t\\t}\\n\\t\\tif( (user+1)%3 == comp )\\n\\t\\t{\\n\\t\\t\\tprintf(\\\"Comp Played: %s\\\\nYou Played: %s\\\\nSorry, You Lost!\\\\n\\\", cmove, umove);\\n\\t\\t}\\t\\n\\t\\telse if(comp == user)\\n\\t\\t{\\n\\t\\t\\tprintf(\\\"Comp Played: %s\\\\nYou Played: %s\\\\nYou Tied :p\\\\n\\\", cmove, umove);\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tprintf(\\\"Comp Played: %s\\\\nYou Played: %s\\\\nYay, You Won!\\\\n\\\", cmove, umove);\\n\\t\\t}\\n\\t\\ttbl[user-1]++;\\n\\t}\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <windows.h>\\n#include <iostream>\\n#include <string>\\n\\n//-------------------------------------------------------------------------------\\nusing namespace std;\\n\\n//-------------------------------------------------------------------------------\\nenum choices { ROCK, SPOCK, PAPER, LIZARD, SCISSORS, MX_C };\\nenum indexes { PLAYER, COMPUTER, DRAW };\\n\\n//-------------------------------------------------------------------------------\\nclass stats\\n{\\npublic:\\n stats() : _draw( 0 )\\n {\\n ZeroMemory( _moves, sizeof( _moves ) );\\n\\tZeroMemory( _win, sizeof( _win ) );\\n }\\n void draw()\\t\\t { _draw++; }\\n void win( int p )\\t { _win[p]++; }\\n void move( int p, int m ) { _moves[p][m]++; }\\n int getMove( int p, int m ) { return _moves[p][m]; }\\n string format( int a )\\n {\\n\\tchar t[32];\\n\\twsprintf( t, \\\"%.3d\\\", a );\\n\\tstring d( t );\\n\\treturn d;\\n }\\n\\n void print()\\n {\\n string d = format( _draw ),\\n\\t pw = format( _win[PLAYER] ),\\t\\tcw = format( _win[COMPUTER] ),\\n\\t pr = format( _moves[PLAYER][ROCK] ),\\tcr = format( _moves[COMPUTER][ROCK] ),\\n pp = format( _moves[PLAYER][PAPER] ),\\tcp = format( _moves[COMPUTER][PAPER] ),\\n\\t ps = format( _moves[PLAYER][SCISSORS] ), cs = format( _moves[COMPUTER][SCISSORS] ),\\n\\t pl = format( _moves[PLAYER][LIZARD] ),\\tcl = format( _moves[COMPUTER][LIZARD] ),\\n\\t pk = format( _moves[PLAYER][SPOCK] ),\\tck = format( _moves[COMPUTER][SPOCK] );\\n\\n\\tsystem( \\\"cls\\\" );\\n\\tcout << endl;\\n\\tcout << \\\"+----------+-------+--------+--------+---------+----------+--------+---------+\\\" << endl;\\n\\tcout << \\\"| | WON | DRAW | ROCK | PAPER | SCISSORS | LIZARD | SPOCK |\\\" << endl;\\n\\tcout << \\\"+----------+-------+--------+--------+---------+----------+--------+---------+\\\" << endl;\\n\\tcout << \\\"| PLAYER | \\\" << pw << \\\" | | \\\" << pr << \\\" | \\\" << pp << \\\" | \\\" << ps << \\\" | \\\" << pl << \\\" | \\\" << pk << \\\" |\\\" << endl;\\n\\tcout << \\\"+----------+-------+ \\\" << d << \\\" +--------+---------+----------+--------+---------+\\\" << endl;\\n\\tcout << \\\"| COMPUTER | \\\" << cw << \\\" | | \\\" << cr << \\\" | \\\" << cp << \\\" | \\\" << cs << \\\" | \\\" << cl << \\\" | \\\" << ck << \\\" |\\\" << endl;\\n\\tcout << \\\"+----------+-------+--------+--------+---------+----------+--------+---------+\\\" << endl;\\n\\tcout << endl << endl;\\n\\n\\tsystem( \\\"pause\\\" );\\n\\n }\\n\\nprivate:\\n int _moves[2][MX_C], _win[2], _draw;\\n};\\n//-------------------------------------------------------------------------------\\nclass rps\\n{\\nprivate:\\n int makeMove()\\n {\\n\\tint total = 0, r, s;\\n\\tfor( int i = 0; i < MX_C; total += statistics.getMove( PLAYER, i++ ) );\\n\\tr = rand() % total;\\n\\n\\tfor( int i = ROCK; i < SCISSORS; i++ )\\n\\t{\\n\\t s = statistics.getMove( PLAYER, i );\\n\\t if( r < s ) return ( i + 1 );\\n\\t r -= s;\\n\\t}\\n\\n\\treturn ROCK;\\n }\\n\\n void printMove( int p, int m )\\n {\\n\\tif( p == COMPUTER ) cout << \\\"My move: \\\";\\n\\telse cout << \\\"Your move: \\\";\\n\\n\\tswitch( m )\\n\\t{\\n\\t case ROCK: cout << \\\"ROCK\\\\n\\\"; break;\\n\\t case PAPER: cout << \\\"PAPER\\\\n\\\"; break;\\n\\t case SCISSORS: cout << \\\"SCISSORS\\\\n\\\"; break;\\n\\t case LIZARD: cout << \\\"LIZARD\\\\n\\\"; break;\\n\\t case SPOCK: cout << \\\"SPOCK\\\\n\\\";\\n\\t}\\n }\\n\\npublic:\\n rps()\\n {\\n\\tchecker[ROCK][ROCK] = 2; checker[ROCK][PAPER] = 1; checker[ROCK][SCISSORS] = 0; checker[ROCK][LIZARD] = 0; checker[ROCK][SPOCK] = 1;\\n\\tchecker[PAPER][ROCK] = 0; checker[PAPER][PAPER] = 2; checker[PAPER][SCISSORS] = 1; checker[PAPER][LIZARD] = 1; checker[PAPER][SPOCK] = 0;\\n\\tchecker[SCISSORS][ROCK] = 1; checker[SCISSORS][PAPER] = 0; checker[SCISSORS][SCISSORS] = 2; checker[SCISSORS][LIZARD] = 0; checker[SCISSORS][SPOCK] = 1;\\n\\tchecker[LIZARD][ROCK] = 1; checker[LIZARD][PAPER] = 0; checker[LIZARD][SCISSORS] = 1; checker[LIZARD][LIZARD] = 2; checker[LIZARD][SPOCK] = 0;\\n\\tchecker[SPOCK][ROCK] = 0; checker[SPOCK][PAPER] = 1; checker[SPOCK][SCISSORS] = 0; checker[SPOCK][LIZARD] = 1; checker[SPOCK][SPOCK] = 2;\\n }\\n void play()\\n {\\n\\tint p, r, m;\\n\\twhile( true )\\n\\t{\\n\\t cout << \\\"What is your move (1)ROCK (2)SPOCK (3)PAPER (4)LIZARD (5)SCISSORS (0)Quit ? \\\";\\n\\t cin >> p;\\n\\t if( !p || p < 0 ) break;\\n\\t if( p > 0 && p < 6 )\\n\\t {\\n\\t\\tp--;\\n\\t\\tcout << endl;\\n\\t\\tprintMove( PLAYER, p );\\n\\t\\tstatistics.move( PLAYER, p );\\n\\n\\t\\tm = makeMove();\\n\\t\\tstatistics.move( COMPUTER, m );\\n\\t\\tprintMove( COMPUTER, m );\\n\\n\\t\\tr = checker[p][m];\\n\\t\\tswitch( r )\\n\\t\\t{\\n\\t\\t case DRAW:\\n\\t\\t cout << endl << \\\"DRAW!\\\" << endl << endl;\\n\\t\\t statistics.draw();\\n\\t\\t break;\\n\\t\\t case COMPUTER:\\n\\t\\t\\tcout << endl << \\\"I WIN!\\\" << endl << endl;\\n\\t\\t\\tstatistics.win( COMPUTER );\\n\\t\\t break;\\n\\t\\t case PLAYER:\\n\\t\\t\\tcout << endl << \\\"YOU WIN!\\\" << endl << endl;\\n\\t\\t\\tstatistics.win( PLAYER );\\n\\n\\t\\t}\\n\\t\\tsystem( \\\"pause\\\" );\\n\\t }\\n\\t system( \\\"cls\\\" );\\n\\t}\\n\\tstatistics.print();\\n }\\n\\nprivate:\\n stats statistics;\\n int checker[MX_C][MX_C];\\n};\\n//-------------------------------------------------------------------------------\\nint main( int argc, char* argv[] )\\n{\\n srand( GetTickCount() );\\n rps game;\\n game.play();\\n return 0;\\n}\\n//-------------------------------------------------------------------------------\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\nnamespace RockPaperScissors\\n{\\n class Program\\n {\\n static void Main(string[] args)\\n {\\n // There is no limit on the amount of weapons supported by RPSGame. Matchups are calculated depending on the order.\\n var rps = new RPSGame(\\\"scissors\\\", \\\"paper\\\", \\\"rock\\\", \\\"lizard\\\", \\\"spock\\\");\\n\\n int wins = 0, losses = 0, draws = 0;\\n\\n while (true)\\n {\\n Console.WriteLine(\\\"Make your move: \\\" + string.Join(\\\", \\\", rps.Weapons) + \\\", quit\\\");\\n\\n string weapon = Console.ReadLine().Trim().ToLower();\\n\\n if (weapon == \\\"quit\\\")\\n break;\\n\\n if (!rps.Weapons.Contains(weapon))\\n {\\n Console.WriteLine(\\\"Invalid weapon!\\\");\\n continue;\\n }\\n\\n int result = rps.Next(weapon);\\n\\n Console.WriteLine(\\\"You chose {0} and your opponent chose {1}!\\\", weapon, rps.LastAIWeapon);\\n\\n switch (result)\\n {\\n case 1: Console.WriteLine(\\\"{0} pwns {1}. You're a winner!\\\", weapon, rps.LastAIWeapon);\\n wins++;\\n break;\\n case 0: Console.WriteLine(\\\"Draw!\\\");\\n draws++;\\n break;\\n case -1: Console.WriteLine(\\\"{0} pwns {1}. You're a loser!\\\", rps.LastAIWeapon, weapon);\\n losses++;\\n break;\\n }\\n\\n Console.WriteLine();\\n }\\n\\n Console.WriteLine(\\\"\\\\nPlayer Statistics\\\\nWins: {0}\\\\nLosses: {1}\\\\nDraws: {2}\\\", wins, losses, draws);\\n }\\n\\n class RPSGame\\n {\\n public RPSGame(params string[] weapons)\\n {\\n Weapons = weapons;\\n\\n // Creates a new AI opponent, and gives it the list of weapons.\\n _rpsAI = new RPSAI(weapons);\\n }\\n\\n // Play next turn.\\n public int Next(string weapon)\\n {\\n string aiWeapon = _rpsAI.NextMove(); // Gets the AI opponent's next move.\\n LastAIWeapon = aiWeapon; // Saves the AI opponent's move in a property so the player can see it.\\n\\n _rpsAI.AddPlayerMove(weapon); // Let the AI know which weapon the player chose, for future predictions.\\n return GetWinner(Weapons, weapon, aiWeapon); // Returns -1 if AI win, 0 if draw, and 1 if player win.\\n }\\n\\n // Returns matchup winner.\\n public static int GetWinner(string[] weapons, string weapon1, string weapon2)\\n {\\n if (weapon1 == weapon2)\\n return 0; // If weapons are the same, return 0 for draw.\\n\\n if (GetVictories(weapons, weapon1).Contains(weapon2))\\n return 1; // Returns 1 for weapon1 win.\\n else if (GetVictories(weapons, weapon2).Contains(weapon1))\\n return -1; // Returns -1 for weapon2 win.\\n\\n throw new Exception(\\\"No winner found.\\\");\\n }\\n\\n /*\\n * Return weapons that the provided weapon beats.\\n * The are calculated in the following way:\\n * If the index of the weapon is even, then all even indices less than it,\\n * and all odd indices greater than it, are victories.\\n * One exception is if it is an odd index, and also the last index in the set,\\n * then the first index in the set is a victory.\\n */\\n public static IEnumerable<string> GetVictories(string[] weapons, string weapon)\\n {\\n // Gets index of weapon.\\n int index = Array.IndexOf(weapons, weapon);\\n\\n // If weapon is odd and the final index in the set, then return the first item in the set as a victory.\\n if (index % 2 != 0 && index == weapons.Length - 1)\\n yield return weapons[0];\\n\\n for (int i = index - 2; i >= 0; i -= 2)\\n yield return weapons[i];\\n\\n for (int i = index + 1; i < weapons.Length; i += 2)\\n yield return weapons[i];\\n }\\n\\n public string LastAIWeapon\\n {\\n private set;\\n get;\\n }\\n\\n public readonly string[] Weapons;\\n private RPSAI _rpsAI;\\n\\n class RPSAI\\n {\\n public RPSAI(params string[] weapons)\\n {\\n _weapons = weapons;\\n _weaponProbability = new Dictionary<string, int>();\\n\\n // The AI sets the probability for each weapon to be chosen as 1.\\n foreach (string weapon in weapons)\\n _weaponProbability.Add(weapon, 1);\\n\\n _random = new Random();\\n }\\n\\n // Increases probability of selecting each weapon that beats the provided move.\\n public void AddPlayerMove(string weapon)\\n {\\n int index = Array.IndexOf(_weapons, weapon);\\n\\n foreach (string winWeapon in _weapons.Except(GetVictories(_weapons, weapon)))\\n if (winWeapon != weapon)\\n _weaponProbability[winWeapon]++;\\n }\\n\\n // Gets the AI's next move.\\n public string NextMove()\\n {\\n double r = _random.NextDouble();\\n\\n double divisor = _weaponProbability.Values.Sum();\\n\\n var weightedWeaponRanges = new Dictionary<double, string>();\\n\\n double currentPos = 0.0;\\n\\n // Maps probabilities to ranges between 0.0 and 1.0. Returns weighted random weapon.\\n foreach (var weapon in _weaponProbability)\\n {\\n double weightedRange = weapon.Value / divisor;\\n if (r <= currentPos + (weapon.Value / divisor))\\n return weapon.Key;\\n currentPos += weightedRange;\\n }\\n\\n throw new Exception(\\\"Error calculating move.\\\");\\n }\\n\\n Random _random;\\n private readonly string[] _weapons;\\n private Dictionary<string, int> _weaponProbability;\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(ns rps.core\\n (:require [clojure.data.generators :refer [weighted]])\\n (:import jline.Terminal)\\n (:gen-class))\\n\\n(def what-beats {:rock :paper, :paper :scissors, :scissors :rock})\\n\\n(defn battle [human comp]\\n (let [h (name human)\\n c (name comp)]\\n (cond\\n (= human comp) (println (format \\\"We both picked %s. DRAW!\\\" c))\\n (= human (what-beats comp))\\n (println (format \\\"Your %s defeats computer's %s. YOU WIN!\\\" h c))\\n (= comp (what-beats human))\\n (println (format \\\"Computer's %s defeats your %s. YOU LOSE!\\\" c h))\\n :else (println (format \\\"Wat? %s and %s ?\\\" h c)))))\\n\\n(defn key->rps [k]\\n (cond\\n (or (= k 82) (= k 114)) :rock\\n (or (= k 80) (= k 112)) :paper\\n (or (= k 83) (= k 115)) :scissors\\n :else nil))\\n\\n(defn play-game [freqs]\\n (println \\\"\\\\n(R)ock, (P)aper, (S)cissors?\\\")\\n (let [term (Terminal/getTerminal)\\n rps (key->rps (.readCharacter term System/in))]\\n (if-not (nil? rps)\\n (do\\n (battle rps (what-beats (weighted freqs)))\\n (recur (assoc freqs rps (inc (rps freqs)))))\\n (println \\\"Game Over Man! Game Over!\\\"))))\\n\\n(defn -main\\n \\\"Rock, Paper, Scissors!\\\"\\n [& args]\\n (play-game {:rock 1, :paper 1, :scissors 1}))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"# conventional weapons\\nenum Choice\\n Rock\\n Paper\\n Scissors\\nend\\n\\nBEATS = {\\n Choice::Rock => [Choice::Paper],\\n Choice::Paper => [Choice::Scissors],\\n Choice::Scissors => [Choice::Rock],\\n}\\n\\n# uncomment to use additional weapons\\n# enum Choice\\n# Rock\\n# Paper\\n# Scissors\\n# Lizard\\n# Spock\\n# end\\n\\n# BEATS = {\\n# Choice::Rock => [Choice::Paper, Choice::Spock],\\n# Choice::Paper => [Choice::Scissors, Choice::Lizard],\\n# Choice::Scissors => [Choice::Rock, Choice::Spock],\\n# Choice::Lizard => [Choice::Rock, Choice::Scissors],\\n# Choice::Spock => [Choice::Paper, Choice::Lizard],\\n# }\\n\\nclass RPSAI\\n @stats = {} of Choice => Int32\\n\\n def initialize\\n Choice.values.each do |c|\\n @stats[c] = 1\\n end\\n end\\n\\n def choose\\n v = rand(@stats.values.sum)\\n @stats.each do |choice, rate|\\n v -= rate\\n return choice if v < 0\\n end\\n raise \\\"\\\"\\n end\\n\\n def train(selected)\\n BEATS[selected].each do |c|\\n @stats[c] += 1\\n end\\n end\\nend\\n\\nenum GameResult\\n HumanWin\\n ComputerWin\\n Draw\\n\\n def to_s\\n case self\\n when .draw?\\n \\\"Draw\\\"\\n when .human_win?\\n \\\"You win!\\\"\\n when .computer_win?\\n \\\"I win!\\\"\\n end\\n end\\nend\\n\\nclass RPSGame\\n @score = Hash(GameResult, Int32).new(0)\\n @ai = RPSAI.new\\n\\n def check(player, computer)\\n return GameResult::ComputerWin if BEATS[player].includes? computer\\n return GameResult::HumanWin if BEATS[computer].includes? player\\n return GameResult::Draw\\n end\\n\\n def round\\n puts \\\"\\\"\\n print \\\"Your choice (#{Choice.values.join(\\\", \\\")}):\\\"\\n s = gets.not_nil!.strip.downcase\\n return false if \\\"quit\\\".starts_with? s\\n player_turn = Choice.values.find { |choice| choice.to_s.downcase.starts_with? s }\\n unless player_turn\\n puts \\\"Invalid choice\\\"\\n return true\\n end\\n ai_turn = @ai.choose\\n result = check(player_turn, ai_turn)\\n puts \\\"H: #{player_turn}, C: #{ai_turn} => #{result}\\\"\\n @score[result] += 1\\n puts \\\"score: human=%d, computer=%d, draw=%d\\\" % GameResult.values.map { |r| @score[r] }\\n @ai.train player_turn\\n true\\n end\\nend\\n\\ngame = RPSGame.new\\nloop do\\n break unless game.round\\nend\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio, std.random, std.string, std.conv, std.array, std.typecons;\\n\\nenum Choice { rock, paper, scissors }\\n\\nbool beats(in Choice c1, in Choice c2) pure nothrow @safe @nogc {\\n with (Choice) return (c1 == paper && c2 == rock) ||\\n (c1 == scissors && c2 == paper) ||\\n (c1 == rock && c2 == scissors);\\n}\\n\\nChoice genMove(in int r, in int p, in int s) @safe /*@nogc*/ {\\n immutable x = uniform!\\\"[]\\\"(1, r + p + s);\\n if (x < s) return Choice.rock;\\n if (x <= s + r) return Choice.paper;\\n else return Choice.scissors;\\n}\\n\\nNullable!To maybeTo(To, From)(From x) pure nothrow @safe {\\n try {\\n return typeof(return)(x.to!To);\\n } catch (ConvException) {\\n return typeof(return)();\\n } catch (Exception e) {\\n static immutable err = new Error(\\\"std.conv.to failure\\\");\\n throw err;\\n }\\n}\\n\\nvoid main() /*@safe*/ {\\n int r = 1, p = 1, s = 1;\\n\\n while (true) {\\n write(\\\"rock, paper or scissors? \\\");\\n immutable hs = readln.strip.toLower;\\n if (hs.empty)\\n break;\\n\\n immutable h = hs.maybeTo!Choice;\\n if (h.isNull) {\\n writeln(\\\"Wrong input: \\\", hs);\\n continue;\\n }\\n\\n immutable c = genMove(r, p, s);\\n writeln(\\\"Player: \\\", h.get, \\\" Computer: \\\", c);\\n\\n if (beats(h, c)) writeln(\\\"Player wins\\\\n\\\");\\n else if (beats(c, h)) writeln(\\\"Player loses\\\\n\\\");\\n else writeln(\\\"Draw\\\\n\\\");\\n\\n final switch (h.get) {\\n case Choice.rock: r++; break;\\n case Choice.paper: p++; break;\\n case Choice.scissors: s++; break;\\n }\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"defmodule Rock_paper_scissors do\\n def play, do: loop([1,1,1])\\n\\n defp loop([r,p,s]=odds) do\\n IO.gets(\\\"What is your move? (R,P,S,Q) \\\") |> String.upcase |> String.first\\n |> case do\\n \\\"Q\\\" -> IO.puts \\\"Good bye!\\\"\\n human when human in [\\\"R\\\",\\\"P\\\",\\\"S\\\"] ->\\n IO.puts \\\"Your move is #{play_to_string(human)}.\\\"\\n computer = select_play(odds)\\n IO.puts \\\"My move is #{play_to_string(computer)}\\\"\\n case beats(human,computer) do\\n true -> IO.puts \\\"You win!\\\"\\n false -> IO.puts \\\"I win!\\\"\\n _ -> IO.puts \\\"Draw\\\"\\n end\\n case human do\\n \\\"R\\\" -> loop([r+1,p,s])\\n \\\"P\\\" -> loop([r,p+1,s])\\n \\\"S\\\" -> loop([r,p,s+1])\\n end\\n _ ->\\n IO.puts \\\"Invalid play\\\"\\n loop(odds)\\n end\\n end\\n\\n defp beats(\\\"R\\\",\\\"S\\\"), do: true\\n defp beats(\\\"P\\\",\\\"R\\\"), do: true\\n defp beats(\\\"S\\\",\\\"P\\\"), do: true\\n defp beats(x,x), do: :draw\\n defp beats(_,_), do: false\\n\\n defp play_to_string(\\\"R\\\"), do: \\\"Rock\\\"\\n defp play_to_string(\\\"P\\\"), do: \\\"Paper\\\"\\n defp play_to_string(\\\"S\\\"), do: \\\"Scissors\\\"\\n\\n defp select_play([r,p,s]) do\\n n = :rand.uniform(r+p+s)\\n cond do\\n n <= r -> \\\"P\\\"\\n n <= r+p -> \\\"S\\\"\\n true -> \\\"R\\\"\\n end\\n end\\nend\\n\\nRock_paper_scissors.play\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-module(rps).\\n-compile(export_all).\\n\\nplay() ->\\n loop([1,1,1]).\\n\\nloop([R,P,S]=Odds) ->\\n case io:fread(\\\"What is your move? (R,P,S,Q) \\\",\\\"~c\\\") of\\n {ok,[\\\"Q\\\"]} -> io:fwrite(\\\"Good bye!~n\\\");\\n {ok,[[Human]]} when Human == $R; Human == $P; Human == $S ->\\n io:fwrite(\\\"Your move is ~s.~n\\\",\\n [play_to_string(Human)]),\\n Computer = select_play(Odds),\\n io:fwrite(\\\"My move is ~s~n\\\",\\n [play_to_string(Computer)]),\\n case {beats(Human,Computer),beats(Computer,Human)} of\\n {true,_} -> io:fwrite(\\\"You win!~n\\\");\\n {_,true} -> io:fwrite(\\\"I win!~n\\\");\\n _ -> io:fwrite(\\\"Draw~n\\\")\\n end,\\n case Human of\\n $R -> loop([R+1,P,S]);\\n $P -> loop([R,P+1,S]);\\n $S -> loop([R,P,S+1])\\n end;\\n _ ->\\n io:fwrite(\\\"Invalid play~n\\\"),\\n loop(Odds)\\n end.\\n\\nbeats($R,$S) -> true;\\nbeats($P,$R) -> true;\\nbeats($S,$P) -> true;\\nbeats(_,_) -> false.\\n\\nplay_to_string($R) -> \\\"Rock\\\";\\nplay_to_string($P) -> \\\"Paper\\\";\\nplay_to_string($S) -> \\\"Scissors\\\".\\n\\nselect_play([R,P,S]) ->\\n N = random:uniform(R+P+S),\\n if\\n N =< R -> $P;\\n N =< R+P -> $S;\\n true -> $R\\n end.\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"function weighted_rand(sequence table)\\n integer sum,r\\n sum = 0\\n for i = 1 to length(table) do\\n sum += table[i]\\n end for\\n\\n r = rand(sum)\\n for i = 1 to length(table)-1 do\\n r -= table[i]\\n if r <= 0 then\\n return i\\n end if\\n end for\\n return length(table)\\nend function\\n\\nconstant names = { \\\"Rock\\\", \\\"Paper\\\", \\\"Scissors\\\" }\\nconstant winner = { \\\"We tied.\\\", \\\"Meself winned.\\\", \\\"You win.\\\" }\\ninteger user_action, my_action, key, win\\nsequence user_rec, score\\nuser_rec = {1,1,1}\\nscore = {0,0}\\n\\nwhile 1 do\\n my_action = remainder(weighted_rand(user_rec)+1,3)+1\\n puts(1,\\\"Your choice [1-3]:\\\\n\\\")\\n puts(1,\\\" 1. Rock\\\\n 2. Paper\\\\n 3. Scissors\\\\n> \\\")\\n key = -1\\n while (key < '1' or key > '3') and key != 'q' do\\n key = get_key()\\n end while\\n puts(1,key)\\n puts(1,'\\\\n')\\n if key = 'q' then\\n exit\\n end if\\n user_action = key-'0'\\n win = remainder(my_action-user_action+3,3)\\n printf(1,\\\"You chose %s; I chose %s. %s\\\\n\\\",\\n { names[user_action],\\n names[my_action],\\n winner[win+1] })\\n\\n if win then\\n score[win] += 1\\n end if\\n printf(1,\\\"\\\\nScore %d:%d\\\\n\\\",score)\\n user_rec[user_action] += 1\\nend while\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"open System\\n\\nlet random = Random ()\\nlet rand = random.NextDouble () //Gets a random number in the range (0.0, 1.0)\\n\\n/// Union of possible choices for a round of rock-paper-scissors\\ntype Choice =\\n| Rock\\n| Paper\\n| Scissors\\n\\n/// Gets the string representation of a Choice\\nlet getString = function\\n | Rock -> \\\"Rock\\\"\\n | Paper -> \\\"Paper\\\"\\n | Scissors -> \\\"Scissors\\\"\\n\\n/// Defines rules for winning and losing\\nlet beats (a : Choice, b : Choice) =\\n match a, b with\\n | Rock, Scissors -> true // Rock beats Scissors\\n | Paper, Rock -> true // Paper beats Rock\\n | Scissors, Paper -> true // Scissors beat Paper\\n | _, _ -> false\\n\\n/// Generates the next move for the computer based on probability derived from previous player moves.\\nlet genMove r p s =\\n let tot = r + p + s\\n let n = rand\\n if n <= s / tot then Rock\\n elif n <= (s + r) / tot then Paper\\n else Scissors\\n\\n/// Gets the move chosen by the player\\nlet rec getMove () =\\n printf \\\"[R]ock, [P]aper, or [S]cissors?: \\\"\\n let choice = Console.ReadLine ()\\n match choice with\\n | \\\"r\\\" | \\\"R\\\" -> Rock\\n | \\\"p\\\" | \\\"P\\\" -> Paper\\n | \\\"s\\\" | \\\"S\\\" -> Scissors\\n | _ ->\\n printf \\\"Invalid choice.\\\\n\\\\n\\\"\\n getMove ()\\n\\n/// Place where all the game logic takes place.\\nlet rec game (r : float, p : float, s : float) =\\n let comp = genMove r p s\\n let player = getMove ()\\n Console.WriteLine (\\\"Player: {0} vs Computer: {1}\\\", getString player, getString comp)\\n Console.WriteLine (\\n if beats(player, comp) then \\\"Player Wins!\\\\n\\\"\\n elif beats(comp, player) then \\\"Computer Wins!\\\\n\\\"\\n else \\\"Draw!\\\\n\\\"\\n )\\n let nextR = if player = Rock then r + 1.0 else r\\n let nextP = if player = Paper then p + 1.0 else p\\n let nextS = if player = Scissors then s + 1.0 else s\\n game (nextR, nextP, nextS)\\n\\ngame(1.0, 1.0, 1.0)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: combinators formatting io kernel math math.ranges qw\\nrandom sequences ;\\nIN: rosetta-code.rock-paper-scissors\\n\\nCONSTANT: thing qw{ rock paper scissors }\\nCONSTANT: msg { \\\"I win.\\\" \\\"Tie!\\\" \\\"You win.\\\" }\\n\\n: ai-choice ( r p s -- n )\\n 3dup + + nip [1,b] random {\\n { [ 3dup nip >= ] [ 3drop 1 ] }\\n { [ 3dup [ + ] dip >= ] [ 3drop 2 ] }\\n [ 3drop 0 ]\\n } cond ;\\n\\n: player-choice ( -- n )\\n \\\"r/p/s/q? \\\" write readln qw{ r p s q } index dup\\n [ drop player-choice ] unless ;\\n\\n! return:\\n! -1 for n1 loses to n2.\\n! 0 for n1 ties n2.\\n! 1 for n1 beats n2.\\n: outcome ( n1 n2 -- n3 ) - dup abs 1 > [ neg ] when sgn ;\\n\\n: status. ( seq -- )\\n \\\"My wins: %d Ties: %d Your wins: %d\\\\n\\\" vprintf ;\\n\\n: choices. ( n1 n2 -- )\\n [ thing nth ] bi@ \\\"You chose: %s\\\\nI chose: %s\\\\n\\\" printf ;\\n\\n: tally ( seq n -- seq' ) over [ 1 + ] change-nth ;\\n\\n: game ( seq -- seq' )\\n dup status. player-choice dup 3 = [ drop ] [\\n [ 3 + tally ] keep over 3 tail* first3 ai-choice 2dup\\n choices. outcome 1 + dup [ tally ] dip msg nth print nl\\n game\\n ] if ;\\n\\n! The game state is a sequence where the members are:\\n! losses, ties, wins, #rock, #paper, #scissors\\n: main ( -- ) { 0 0 0 1 1 1 } clone game drop ;\\n\\nMAIN: main\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"include random.fs\\n\\n0 value aiwins\\n0 value plwins\\n\\n10 constant inlim\\n0 constant rock\\n1 constant paper\\n2 constant scissors\\n\\ncreate rpshistory 0 , 0 , 0 ,\\ncreate inversemove 1 , 2 , 0 ,\\n3 constant historylen\\n\\n: @a ( n array -- )\\n swap cells + @ ;\\n\\n: sum-history ( -- n )\\n 0 historylen 0 ?do\\n\\ti rpshistory @a 1+ + loop ;\\n\\n: probable-choice ( -- n ) \\\\ Simple linear search\\n sum-history random\\n historylen 0 ?do\\n\\ti rpshistory @a -\\n\\tdup 0< if drop i leave then\\n loop inversemove @a ;\\n\\n: rps-print ( addr u -- )\\n cr type ;\\n\\n: rpslog. ( -- )\\n s\\\" ROCK PAPER SCISSORS AI/W PL/W\\\" rps-print cr\\n 3 0 do i cells rpshistory + @ 9 u.r loop aiwins 7 u.r plwins 6 u.r cr ;\\n\\ncreate rpswords ' rock , ' paper , ' scissors , ' quit ,\\n\\n: update-history! ( n -- )\\n cells rpshistory + 1 swap +! ;\\n\\n: thrown. ( n -- addr u )\\n cells rpswords + @ name>string ;\\n\\n: throws. ( n n -- )\\n thrown. s\\\" AI threw: \\\" 2swap s+ rps-print\\n thrown. s\\\" You threw: \\\" 2swap s+ rps-print ;\\n\\n: print-throws ( n n -- )\\n rpslog. throws. ;\\n\\n: tie. ( n n -- )\\n s\\\" Tie. \\\" rps-print ;\\n\\n: plwin ( n n -- )\\n 1 +to plwins s\\\" You win. \\\" rps-print ;\\n\\n: aiwin ( n n -- )\\n 1 +to aiwins s\\\" AI wins. \\\" rps-print ;\\n\\ncreate rpsstates ' tie. , ' plwin , ' aiwin ,\\n\\n: determine-winner ( n n -- )\\n >r abs r> abs - 3 + 3 mod\\n cells rpsstates + @ execute ;\\n\\n: rps-validate ( name -- ) ( Rude way of checking for only valid commands )\\n 4 0 do i cells rpswords + @ over = swap loop drop or or or ;\\n\\n: rps-prompt. ( -- )\\n s\\\" Enter choice (rock, paper, scissors or quit): \\\" rps-print ;\\n\\n: player-choice ( -- n ) recursive\\n pad inlim accept pad swap find-name\\n dup rps-validate if execute\\n else drop rps-prompt. player-choice then ;\\n\\n: update-log ( n n -- )\\n update-history! update-history! ;\\n\\n: rps ( -- ) recursive\\n rps-prompt. player-choice probable-choice\\n 2dup update-log 2dup print-throws\\n determine-winner rps ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"! compilation\\n! gfortran -std=f2008 -Wall -ffree-form -fall-intrinsics -fimplicit-none f.f08 -o f\\n!\\n! EXAMPLE\\n!\\n!$ ./f\\n!rock, paper, scissors? papier\\n!scoring computer choice (r) and your choice (p)\\n!rock, paper, scissors? sizzerz\\n!scoring computer choice (s) and your choice (s)\\n!rock, paper, scissors? quit\\n!scoring computer choice (r) and your choice (q)\\n! Who's keeping score anyway???\\n! 0.5 1.5\\n! you won!\\n!$\\n\\n\\n\\nprogram rpsgame\\n\\n integer, parameter :: COMPUTER=1, HAPLESSUSER=2\\n integer, dimension(3) :: rps = (/1,1,1/)\\n real, dimension(3) :: p\\n character :: answer, cc ! computer choice\\n integer :: exhaustion, i\\n real, dimension(2) :: score = (/0, 0/)\\n character(len=8), dimension(3) :: choices = (/'rock ','paper ','scissors'/)\\n real :: harvest\\n do exhaustion = 1, 30\\n p = rps/real(sum(rps))\\n p(2) = p(2) + p(1)\\n p(3) = p(3) + p(2)\\n call random_number(harvest)\\n i = sum(merge(1,0,harvest.le.p)) ! In memory of Ken Iverson, logical is more useful as integer.\\n cc = 'rsp'(i:i)\\n write(6, \\\"(2(A,', '),A,'? ')\\\", advance='no')(trim(choices(i)),i=1,size(choices))\\n read(5, *) answer\\n write(6, \\\"('scoring computer choice (',A,') and your choice (',A,')')\\\")cc,answer\\n if (answer.eq.cc) then\\n score = score + 0.5\\n else\\n i = HAPLESSUSER\\n if (answer.eq.'r') then\\n if (cc.eq.'p') i = COMPUTER\\n else if (answer.eq.'p') then\\n if (cc.eq.'s') i = COMPUTER\\n else if (answer.eq.'s') then\\n if (cc.eq.'r') i = COMPUTER\\n else\\n exit\\n endif\\n score(i) = score(i) + 1\\n end if\\n i = scan('rps',answer)\\n rps(i) = rps(i) + 1\\n end do\\n if (25 .lt. exhaustion) write(6, *) \\\"I'm bored out of my skull\\\"\\n write(6, *)\\\"Who's keeping score anyway???\\\"\\n write(6, '(2f5.1)') score\\n if (score(COMPUTER) .lt. score(HAPLESSUSER)) print*,'you won!'\\nend program rpsgame\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"$ yes r | ./f # rock\\nrock, paper, scissors? scoring computer choice (r) and your choice (r)\\nrock, paper, scissors? scoring computer choice (s) and your choice (r)\\nrock, paper, scissors? scoring computer choice (r) and your choice (r)\\n...\\nrock, paper, scissors? scoring computer choice (p) and your choice (r)\\n I'm bored out of my skull\\n Who's keeping score anyway???\\n 25.5 4.5\\nyes: standard output: Broken pipe\\nyes: write error\\n$ yes p 2>/dev/null | ./f # paper\\nrock, paper, scissors? scoring computer choice (r) and your choice (p)\\nrock, paper, scissors? scoring computer choice (s) and your choice (p)\\nrock, paper, scissors? scoring computer choice (r) and your choice (p)\\nrock, paper, scissors? scoring computer choice (s) and your choice (p)\\n...\\nrock, paper, scissors? scoring computer choice (s) and your choice (p)\\n I'm bored out of my skull\\n Who's keeping score anyway???\\n 25.5 4.5\\n$ yes scissors 2>/dev/null | ./f # scissors\\nrock, paper, scissors? scoring computer choice (r) and your choice (s)\\nrock, paper, scissors? scoring computer choice (r) and your choice (s)\\n...\\nrock, paper, scissors? scoring computer choice (r) and your choice (s)\\n I'm bored out of my skull\\n Who's keeping score anyway???\\n 26.5 3.5\\n$\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Dim Shared As Byte ganador = 1, accion = 2, perdedor = 3, wp, wc\\nDim Shared As String word(10, 3)\\nFor n As Byte = 0 To 9\\n Read word(n, ganador), word(n, accion), word(n, perdedor)\\nNext n\\n\\nSub SimonSay(n As Byte)\\n Print Using \\\"\\\\ \\\\ \\\\ \\\\ \\\"; word(n, ganador); word(n, accion); word(n, perdedor)\\nEnd Sub\\n\\nSub Puntuacion()\\n Print !\\\"\\\\nPlayer = \\\"; wp; !\\\"\\\\tComputer = \\\"; wc; !\\\"\\\\n\\\"\\nEnd Sub\\n\\nDim As Byte n\\nDim As String*1 k\\nDim As String eleccionCPU, eleccionJUG\\nRandomize Timer\\nDo\\n Cls\\n eleccionCPU = word(Rnd *10, ganador)\\n\\n Print !\\\"'Rock, Paper, Scissors, Lizard, Spock!' rules are:\\\\n\\\"\\n For n = 0 To 9\\n SimonSay(n)\\n Next n\\n\\n Print !\\\"\\\\nType your choice letter:\\\"\\n Input !\\\"(R)ock, (P)aper, (S)cissors, (L)izard, Spoc(K), (Q)uit \\\", k\\n\\n k = Ucase(k)\\n Select Case k\\n Case \\\"Q\\\"\\n Exit Do\\n Case \\\"R\\\"\\n eleccionJUG = \\\"Rock\\\"\\n Case \\\"P\\\"\\n eleccionJUG = \\\"Paper\\\"\\n Case \\\"S\\\"\\n eleccionJUG = \\\"Scissors\\\"\\n Case \\\"L\\\"\\n eleccionJUG = \\\"Lizard\\\"\\n Case \\\"K\\\"\\n eleccionJUG = \\\"Spock\\\"\\n End Select\\n\\n Print !\\\"\\\\nPlayer chose \\\"; eleccionJUG; \\\" and Computer chose \\\"; eleccionCPU\\n For n = 0 To 9\\n If word(n, ganador) = eleccionJUG And word(n, perdedor) = eleccionCPU Then\\n SimonSay(n)\\n Print !\\\"\\\\nWinner was Player\\\"\\n wp += 1\\n Exit For\\n Elseif word(n, ganador) = eleccionCPU And word(n, perdedor) = eleccionJUG Then\\n SimonSay(n)\\n Print !\\\"\\\\nWinner was Computer\\\"\\n wc += 1\\n Exit For\\n End If\\n Next n\\n If n = 10 Then Print !\\\"\\\\nOuch!\\\"\\n\\n Puntuacion()\\n Print \\\"Press <SPACE> to continue\\\"\\n Sleep\\nLoop Until(k = \\\"Q\\\")\\n\\nCls\\nPuntuacion()\\nIf wp > wc Then\\n Print \\\"Player win\\\"\\nElseif wc > wp Then\\n Print \\\"Computer win\\\"\\nElse\\n Print \\\"Tie\\\"\\nEnd If\\nSleep\\nEnd\\n\\nData \\\"Scissors\\\",\\\"cuts\\\",\\\"Paper\\\"\\nData \\\"Paper\\\",\\\"covers\\\",\\\"Rock\\\"\\nData \\\"Rock\\\",\\\"crushes\\\",\\\"Lizard\\\"\\nData \\\"Lizard\\\",\\\"poisons\\\",\\\"Spock\\\"\\nData \\\"Spock\\\",\\\"smashes\\\",\\\"Scissors\\\"\\nData \\\"Scissors\\\",\\\"decapites\\\",\\\"Lizard\\\"\\nData \\\"Lizard\\\",\\\"eats\\\",\\\"Paper\\\"\\nData \\\"Paper\\\",\\\"disproves\\\",\\\"Spock\\\"\\nData \\\"Spock\\\",\\\"vaporizes\\\",\\\"Rock\\\"\\nData \\\"Rock\\\",\\\"blunts\\\",\\\"Scissors\\\"\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"if var.end=0 then\\nvar.end=0\\nvar.computerchoice=random(3) // 1 is rock, 2 is paper, and 3 is scissors.\\ndebug=\\\"Press the R key for rock, the P key for paper, or the S key for scissors:\\\"\\nendif\\nif pressed(Key.R)and var.end=0 then\\n var.end=1\\n if var.computerchoice=1 then\\n debug=\\\"You chose rock, which the computer also chose, so it's a tie!\\\"\\n else\\n if var.computerchoice=2 then\\n debug=\\\"The computer chose paper, covering your choice of rock, so you lose!\\\"\\n else\\n debug=\\\"You chose rock, smashing the computer's choice of scissors, so you win!\\\"\\n endif\\n endif\\nendif\\nif pressed(Key.P)and var.end=0 then\\n var.end=1\\n if var.computerchoice=1 then\\n debug=\\\"You chose paper, covering the computer's choice of rock, so you win!\\\"\\n else\\n if var.computerchoice=2 then\\n debug=\\\"You chose paper, which the computer also chose, so it's a tie!\\\"\\n else\\n debug=\\\"The computer chose scissors, cutting your choice of paper, so you lose!\\\"\\n endif\\n endif\\nendif\\nif pressed(Key.S)and var.end=0 then\\n var.end=1\\n if var.computerchoice=1 then\\n debug=\\\"The computer chose rock, smashing your choice of scissors, so you lose!\\\"\\n else\\n if var.computerchoice=2 then\\n debug=\\\"You chose scissors, cutting the computer's choice of paper, so you win!\\\"\\n else\\n debug=\\\"You chose scissors, which the computer also chose, so it's a tie!\\\"\\n endif\\n endif\\nendif\\n\",\n \"language\": \"GlovePIE\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/rand\\\"\\n \\\"strings\\\"\\n \\\"time\\\"\\n)\\n\\nconst rps = \\\"rps\\\"\\n\\nvar msg = []string{\\n \\\"Rock breaks scissors\\\",\\n \\\"Paper covers rock\\\",\\n \\\"Scissors cut paper\\\",\\n}\\n\\nfunc main() {\\n rand.Seed(time.Now().UnixNano())\\n fmt.Println(\\\"Rock Paper Scissors\\\")\\n fmt.Println(\\\"Enter r, p, or s as your play. Anything else ends the game.\\\")\\n fmt.Println(\\\"Running score shown as <your wins>:<my wins>\\\")\\n var pi string // player input\\n var aScore, pScore int\\n sl := 3 // for output alignment\\n pcf := make([]int, 3) // pcf = player choice frequency\\n var plays int\\n aChoice := rand.Intn(3) // ai choice for first play is completely random\\n for {\\n // get player choice\\n fmt.Print(\\\"Play: \\\")\\n _, err := fmt.Scanln(&pi) // lazy\\n if err != nil || len(pi) != 1 {\\n break\\n }\\n pChoice := strings.Index(rps, pi)\\n if pChoice < 0 {\\n break\\n }\\n pcf[pChoice]++\\n plays++\\n\\n // show result of play\\n fmt.Printf(\\\"My play:%s%c. \\\", strings.Repeat(\\\" \\\", sl-2), rps[aChoice])\\n switch (aChoice - pChoice + 3) % 3 {\\n case 0:\\n fmt.Println(\\\"Tie.\\\")\\n case 1:\\n fmt.Printf(\\\"%s. My point.\\\\n\\\", msg[aChoice])\\n aScore++\\n case 2:\\n fmt.Printf(\\\"%s. Your point.\\\\n\\\", msg[pChoice])\\n pScore++\\n }\\n\\n // show score\\n sl, _ = fmt.Printf(\\\"%d:%d \\\", pScore, aScore)\\n\\n // compute ai choice for next play\\n switch rn := rand.Intn(plays); {\\n case rn < pcf[0]:\\n aChoice = 1\\n case rn < pcf[0]+pcf[1]:\\n aChoice = 2\\n default:\\n aChoice = 0\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"flag\\\"\\n \\\"fmt\\\"\\n \\\"log\\\"\\n \\\"math/rand\\\"\\n \\\"regexp\\\"\\n \\\"strings\\\"\\n \\\"time\\\"\\n\\n \\\"github.com/BurntSushi/toml\\\"\\n)\\n\\nvar help = `rps plays rock-paper-scissors with optional addition weapons.\\n\\nUsage: rps [-h] [game]\\n -h display help.\\n game is a game description file in TOML (https://github.com/mojombo/toml).\\n\\nThe traditional game can be described as\\n\\ntitle = \\\"Rock Paper Scissors\\\"\\nwin = [\\n \\\"rock breaks scissors\\\",\\n \\\"paper covers rock\\\",\\n \\\"scissors cut paper\\\",\\n]\\n\\nThe title is optional, it just prints out at the beginning of a game.\\n\\nThe \\\"win\\\" list is statments where the first word wins over the last word.\\n\\nIt's case sensitive so make things easy by using consistent case.\\nDon't use punctuation, at least not next to a first or last word.\\n\\nAdditionally, you can have a \\\"lose\\\" key where the first word loses to the\\nthe last, for example\\n\\nlose = [\\\"rock falls into well\\\"]\\n\\nTo organize things with additional weapons, you can just use the winning\\nweapon with a list of clauses, for example\\n\\nlizard = [\\\"poisons Spock\\\", \\\"eats paper\\\"]\\n\\nThe progam ignores anything in parentheses when identifying first or last\\nwords. Examples (from RPS-101) with weapons gun, fire, and sword,\\n\\nwin = [\\n \\\"gun fire(s)\\\"\\n \\\"(flaming) sword has fire\\\"\\n]\\n\\nFinally, TOML is a hash, so don't duplicate keys. That means no multiple\\nwin or lose keys. You must combine all the win statements and all the lose\\nstatements.`\\n\\nvar rps = `\\ntitle = \\\"Rock Paper Scissors\\\"\\nwin = [\\n \\\"rock breaks scissors\\\",\\n \\\"paper covers rock\\\",\\n \\\"scissors cut paper\\\",\\n]`\\n\\nfunc main() {\\n h := flag.Bool(\\\"h\\\", false, \\\"show help\\\")\\n flag.Parse()\\n if *h {\\n fmt.Println(help)\\n return\\n }\\n m := map[string]interface{}{}\\n var err error\\n switch flag.NArg() {\\n case 0:\\n _, err = toml.Decode(rps, &m)\\n case 1:\\n _, err = toml.DecodeFile(flag.Arg(0), &m)\\n default:\\n flag.Usage()\\n return\\n }\\n if err != nil {\\n log.Fatal(err)\\n }\\n play(parse(m))\\n}\\n\\ntype decision map[string]map[string]string\\n\\ntype fIndex map[string]int\\n\\nfunc parse(m map[string]interface{}) (title string, f fIndex, d decision) {\\n d = decision{}\\n for k, v := range m {\\n switch t := v.(type) {\\n case []interface{}:\\n d.parseList(k, t)\\n case string:\\n if k == \\\"title\\\" {\\n title = t\\n } else {\\n log.Println(\\\"Unknown key:\\\", k)\\n }\\n }\\n }\\n i := 0\\n f = fIndex{}\\n for w, wl := range d {\\n if _, ok := f[w]; !ok {\\n f[w] = i\\n i++\\n }\\n for l := range wl {\\n if _, ok := f[l]; !ok {\\n f[l] = i\\n i++\\n }\\n }\\n }\\n for fm := range f {\\n if _, ok := d[fm]; !ok {\\n log.Println(\\\"note,\\\", fm, \\\"always loses!\\\")\\n }\\n }\\n balanced := len(f)&1 == 1\\n for _, l := range d {\\n if !balanced {\\n break\\n }\\n balanced = len(l)*2+1 == len(f)\\n }\\n if !balanced {\\n log.Print(\\\"note, game is unbalanced\\\")\\n }\\n return title, f, d\\n}\\n\\nvar r = regexp.MustCompile(`[(].*[)]`)\\n\\nfunc (d decision) parseList(kw string, l []interface{}) {\\n var ww string\\n for _, e := range l {\\n st, ok := e.(string)\\n if !ok {\\n log.Fatal(\\\"invalid\\\", e)\\n }\\n w := strings.Fields(r.ReplaceAllLiteralString(st, \\\"\\\"))\\n if len(w) == 0 {\\n log.Fatalln(\\\"invalid:\\\", kw, st)\\n }\\n lw := w[len(w)-1]\\n switch kw {\\n case \\\"win\\\":\\n ww = w[0]\\n case \\\"lose\\\":\\n ww, lw = lw, w[0]\\n default:\\n ww = kw\\n for i := 0; ; i++ {\\n if i == len(w) {\\n st = ww + \\\" \\\" + st\\n break\\n }\\n if w[i] == ww {\\n break\\n }\\n }\\n }\\n if lw == ww {\\n log.Fatalln(\\\"invalid:\\\", st)\\n }\\n if cs, ok := d[lw][ww]; ok {\\n log.Fatalln(\\\"conflict:\\\", cs, \\\"and\\\", st)\\n }\\n d1, ok := d[ww]\\n if !ok {\\n d1 = map[string]string{}\\n }\\n d1[lw] = st\\n d[ww] = d1\\n }\\n}\\n\\nfunc play(title string, fx fIndex, d decision) {\\n rand.Seed(time.Now().Unix())\\n if len(fx) == 0 {\\n return\\n }\\n form := make([]string, len(fx))\\n for w, i := range fx {\\n form[i] = w\\n }\\n fmt.Println()\\n fmt.Println(title)\\n fmt.Print(\\\"Choices are \\\", form[0])\\n for _, w := range form[1:] {\\n fmt.Printf(\\\", %s\\\", w)\\n }\\n fmt.Println(\\\".\\\")\\n fmt.Println(\\\"Enter one of these choices as your play. \\\" +\\n \\\"Anything else ends the game.\\\")\\n fmt.Println(\\\"Running score shown as <your wins>:<my wins>\\\")\\n var pw string\\n var aScore, pScore int\\n sl := 3\\n wcf := make([]int, len(form))\\n wct := 0\\n ax := rand.Intn(len(form))\\n aw := form[ax]\\n for {\\n fmt.Print(\\\"Play: \\\")\\n _, err := fmt.Scanln(&pw)\\n if err != nil {\\n break\\n }\\n px, ok := fx[pw]\\n if !ok {\\n fmt.Println(pw, \\\"invalid.\\\")\\n break\\n }\\n for f, l := range d {\\n if _, ok := l[pw]; ok {\\n wcf[fx[f]]++\\n wct++\\n }\\n }\\n\\n fmt.Printf(\\\"My play:%s%s.\\\\n\\\", strings.Repeat(\\\" \\\", sl-2), aw)\\n ast := d[aw][pw]\\n pst := d[pw][aw]\\n switch {\\n case ax == px:\\n fmt.Println(\\\"Tie.\\\")\\n case ast > \\\"\\\" && pst > \\\"\\\":\\n log.Fatalln(\\\"conflict: \\\", ast, \\\"and\\\", pst)\\n case ast > \\\"\\\":\\n fmt.Printf(\\\"%s. My point.\\\\n\\\", ast)\\n aScore++\\n default:\\n fmt.Printf(\\\"%s. Your point.\\\\n\\\", pst)\\n pScore++\\n }\\n sl, _ = fmt.Printf(\\\"%d:%d \\\", pScore, aScore)\\n ax = 0\\n for rn := rand.Intn(wct); ; ax++ {\\n if f := wcf[ax]; rn < f {\\n break\\n } else {\\n rn -= f\\n }\\n }\\n aw = form[ax]\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import System.Random (randomRIO)\\n\\ndata Choice\\n = Rock\\n | Paper\\n | Scissors\\n deriving (Show, Eq)\\n\\nbeats :: Choice -> Choice -> Bool\\nbeats Paper Rock = True\\nbeats Scissors Paper = True\\nbeats Rock Scissors = True\\nbeats _ _ = False\\n\\ngenrps :: (Int, Int, Int) -> IO Choice\\ngenrps (r, p, s) = rps <$> rand\\n where\\n rps x\\n | x <= s = Rock\\n | x <= s + r = Paper\\n | otherwise = Scissors\\n rand = randomRIO (1, r + p + s) :: IO Int\\n\\ngetrps :: IO Choice\\ngetrps = rps <$> getLine\\n where\\n rps \\\"scissors\\\" = Scissors\\n rps \\\"rock\\\" = Rock\\n rps \\\"paper\\\" = Paper\\n rps _ = error \\\"invalid input\\\"\\n\\ngame :: (Int, Int, Int) -> IO a\\ngame (r, p, s) = do\\n putStrLn \\\"rock, paper or scissors?\\\"\\n h <- getrps\\n c <- genrps (r, p, s)\\n putStrLn (\\\"Player: \\\" ++ show h ++ \\\" Computer: \\\" ++ show c)\\n putStrLn\\n (if beats h c\\n then \\\"player wins\\\\n\\\"\\n else if beats c h\\n then \\\"player loses\\\\n\\\"\\n else \\\"draw\\\\n\\\")\\n let rr =\\n if h == Rock\\n then r + 1\\n else r\\n pp =\\n if h == Paper\\n then p + 1\\n else p\\n ss =\\n if h == Scissors\\n then s + 1\\n else s\\n game (rr, pp, ss)\\n\\nmain :: IO a\\nmain = game (1, 1, 1)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"link printf\\n\\nprocedure main()\\n\\nprintf(\\\"Welcome to Rock, Paper, Scissors.\\\\n_\\n Rock beats scissors, Scissors beat paper, and Paper beats rock.\\\\n\\\\n\\\")\\n\\nhistoryP := [\\\"rock\\\",\\\"paper\\\",\\\"scissors\\\"] # seed player history\\nwinP := winC := draws := 0 # totals\\n\\nbeats := [\\\"rock\\\",\\\"scissors\\\",\\\"paper\\\",\\\"rock\\\"] # what beats what 1 apart\\n\\nrepeat {\\n printf(\\\"Enter your choice or rock(r), paper(p), scissors(s) or quit(q):\\\")\\n turnP := case map(read()) of {\\n \\\"q\\\"|\\\"quit\\\": break\\n \\\"r\\\"|\\\"rock\\\": \\\"rock\\\"\\n \\\"p\\\"|\\\"paper\\\": \\\"paper\\\"\\n \\\"s\\\"|\\\"scissors\\\": \\\"scissors\\\"\\n default: printf(\\\" - invalid choice.\\\\n\\\") & next\\n }\\n\\n turnC := beats[(?historyP == beats[i := 2 to *beats],i-1)] # choose move\\n\\n put(historyP,turnP) # record history\\n printf(\\\"You chose %s, computer chose %s\\\",turnP,turnC)\\n\\n (beats[p := 1 to *beats] == turnP) &\\n (beats[c := 1 to *beats] == turnC) & (abs(p-c) <= 1) # rank play\\n\\n if p = c then\\n printf(\\\" - draw (#%d)\\\\n\\\",draws +:= 1 )\\n else if p > c then\\n printf(\\\" - player win(#%d)\\\\n\\\",winP +:= 1)\\n else\\n printf(\\\" - computer win(#%d)\\\\n\\\",winC +:= 1)\\n }\\n\\nprintf(\\\"\\\\nResults:\\\\n %d rounds\\\\n %d Draws\\\\n %d Computer wins\\\\n %d Player wins\\\\n\\\",\\n winP+winC+draws,draws,winC,winP)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"100 PROGRAM \\\"Rock.bas\\\"\\n110 RANDOMIZE\\n120 STRING CH$(1 TO 3)*8,K$*1\\n130 NUMERIC PLWINS(1 TO 3),SCORE(1 TO 3),PLSTAT(1 TO 3),CMSTAT(1 TO 3),PLCHOICE,CMCHOICE\\n140 CALL INIC\\n150 DO\\n160 CALL GUESS\\n170 PRINT :PRINT \\\"Rock, paper, or scissors (1 = rock, 2 = paper, 3 = scissors, ESC = quit)\\\"\\n180 DO\\n190 LET K$=INKEY$\\n200 LOOP UNTIL K$>=\\\"1\\\" AND K$<=\\\"3\\\" OR K$=CHR$(27)\\n210 IF K$=CHR$(27) THEN EXIT DO\\n220 LET PLCHOICE=VAL(K$)\\n230 LET CMSTAT(CMCHOICE)=CMSTAT(CMCHOICE)+1:LET PLSTAT(PLCHOICE)=PLSTAT(PLCHOICE)+1\\n240 PRINT \\\"You chose \\\";CH$(PLCHOICE);\\\" and I chose \\\";CH$(CMCHOICE);\\\".\\\"\\n250 SET #102:INK 3\\n260 IF PLCHOICE=CMCHOICE THEN\\n270 PRINT \\\"Tie!\\\"\\n280 LET SCORE(3)=SCORE(3)+1\\n290 ELSE IF CMCHOICE=PLWINS(PLCHOICE) THEN\\n300 PRINT \\\"You won!\\\"\\n310 LET SCORE(1)=SCORE(1)+1\\n320 ELSE\\n330 PRINT \\\"I won!\\\"\\n340 LET SCORE(2)=SCORE(2)+1\\n350 END IF\\n360 SET #102:INK 1\\n370 LOOP\\n380 PRINT :PRINT \\\"Some useless statistics:\\\"\\n390 PRINT \\\"You won\\\";SCORE(1);\\\"times, and I won\\\";SCORE(2);\\\"times;\\\";SCORE(3);\\\"ties.\\\"\\n400 PRINT :PRINT ,,CH$(1),CH$(2),CH$(3)\\n410 PRINT \\\"You chose:\\\",PLSTAT(1),PLSTAT(2),PLSTAT(3)\\n420 PRINT \\\" I chose:\\\",CMSTAT(1),CMSTAT(2),CMSTAT(3)\\n430 END\\n440 DEF INIC\\n450 LET CH$(1)=\\\"rock\\\":LET CH$(2)=\\\"paper\\\":LET CH$(3)=\\\"scissors\\\"\\n460 LET PLWINS(1)=3:LET PLWINS(2)=1:LET PLWINS(3)=2\\n470 FOR I=1 TO 3\\n480 LET PLSTAT(I),CMSTAT(I),SCORE(I)=0\\n490 NEXT\\n500 TEXT 80\\n510 END DEF\\n520 DEF GUESS\\n530 LET CMCHOICE=INT(RND*(PLSTAT(1)+PLSTAT(2)+PLSTAT(3)+3))\\n540 SELECT CASE CMCHOICE\\n550 CASE 0 TO PLSTAT(1)\\n560 LET CMCHOICE=2\\n570 CASE PLSTAT(1)+1 TO PLSTAT(1)+PLSTAT(2)+1\\n580 LET CMCHOICE=3\\n590 CASE ELSE\\n600 LET CMCHOICE=1\\n610 END SELECT\\n620 END DEF\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \"require'general/misc/prompt strings' NB. was 'misc strings' in older versions of J\\ngame=:3 :0\\n outcomes=. rps=. 0 0 0\\n choice=. 1+?3\\n while.#response=. prompt' Choose Rock, Paper or Scissors: ' do.\\n playerchoice=. 1+'rps' i. tolower {.deb response\\n if.4 = playerchoice do.\\n smoutput 'Unknown response.'\\n smoutput 'Enter an empty line to quit'\\n continue.\\n end.\\n smoutput ' I choose ',choice {::;:'. Rock Paper Scissors'\\n smoutput (wintype=. 3 | choice-playerchoice) {:: 'Draw';'I win';'You win'\\n outcomes=. outcomes+0 1 2 = wintype\\n rps=. rps+1 2 3=playerchoice\\n choice=. 1+3|(?0) I.~ (}:%{:)+/\\\\ 0, rps\\n end.\\n ('Draws:','My wins:',:'Your wins: '),.\\\":,.outcomes\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" game''\\n Choose Rock, Paper or Scissors: rock\\n I choose Scissors\\nYou win\\n Choose Rock, Paper or Scissors: rock\\n I choose Paper\\nI win\\n Choose Rock, Paper or Scissors: rock\\n I choose Paper\\nI win\\n Choose Rock, Paper or Scissors: rock\\n I choose Paper\\nI win\\n Choose Rock, Paper or Scissors: rock\\n I choose Paper\\nI win\\n Choose Rock, Paper or Scissors:\\nDraws: 0\\nMy wins: 4\\nYour wins: 1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.Arrays;\\nimport java.util.EnumMap;\\nimport java.util.List;\\nimport java.util.Map;\\nimport java.util.Scanner;\\nimport java.util.Random;\\n\\npublic class RPS {\\n\\tpublic enum Item{\\n\\t\\tROCK, PAPER, SCISSORS, /*LIZARD, SPOCK*/;\\n\\t\\tpublic List<Item> losesToList;\\n\\t\\tpublic boolean losesTo(Item other) {\\n\\t\\t\\treturn losesToList.contains(other);\\n\\t\\t}\\n\\t\\tstatic {\\n\\t\\t\\tSCISSORS.losesToList = Arrays.asList(ROCK/*, SPOCK*/);\\n\\t\\t\\tROCK.losesToList = Arrays.asList(PAPER/*, SPOCK*/);\\n\\t\\t\\tPAPER.losesToList = Arrays.asList(SCISSORS/*, LIZARD*/);\\n\\t\\t\\t/*\\n\\t\\t\\tSPOCK.losesToList = Arrays.asList(PAPER, LIZARD);\\n\\t\\t\\tLIZARD.losesToList = Arrays.asList(SCISSORS, ROCK);\\n\\t\\t\\t*/\\n }\\n\\t}\\n\\t//EnumMap uses a simple array under the hood\\n\\tpublic final Map<Item, Integer> counts = new EnumMap<Item, Integer>(Item.class){{\\n\\t\\tfor(Item item:Item.values())\\n\\t\\t\\tput(item, 1);\\n\\t}};\\n\\n\\tprivate int totalThrows = Item.values().length;\\n\\n\\tpublic static void main(String[] args){\\n\\t\\tRPS rps = new RPS();\\n\\t\\trps.run();\\n\\t}\\n\\n\\tpublic void run() {\\n\\t\\tScanner in = new Scanner(System.in);\\n\\t\\tSystem.out.print(\\\"Make your choice: \\\");\\n\\t\\twhile(in.hasNextLine()){\\n\\t\\t\\tItem aiChoice = getAIChoice();\\n\\t\\t\\tString input = in.nextLine();\\n\\t\\t\\tItem choice;\\n\\t\\t\\ttry{\\n\\t\\t\\t\\tchoice = Item.valueOf(input.toUpperCase());\\n\\t\\t\\t}catch (IllegalArgumentException ex){\\n\\t\\t\\t\\tSystem.out.println(\\\"Invalid choice\\\");\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tcounts.put(choice, counts.get(choice) + 1);\\n\\t\\t\\ttotalThrows++;\\n\\t\\t\\tSystem.out.println(\\\"Computer chose: \\\" + aiChoice);\\n\\t\\t\\tif(aiChoice == choice){\\n\\t\\t\\t\\tSystem.out.println(\\\"Tie!\\\");\\n\\t\\t\\t}else if(aiChoice.losesTo(choice)){\\n\\t\\t\\t\\tSystem.out.println(\\\"You chose...wisely. You win!\\\");\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tSystem.out.println(\\\"You chose...poorly. You lose!\\\");\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.print(\\\"Make your choice: \\\");\\n\\t\\t}\\n\\t}\\n\\n\\tprivate static final Random rng = new Random();\\n\\tprivate Item getAIChoice() {\\n\\t\\tint rand = rng.nextInt(totalThrows);\\n\\t\\tfor(Map.Entry<Item, Integer> entry:counts.entrySet()){\\n\\t\\t\\tItem item = entry.getKey();\\n\\t\\t\\tint count = entry.getValue();\\n\\t\\t\\tif(rand < count){\\n\\t\\t\\t\\tList<Item> losesTo = item.losesToList;\\n\\t\\t\\t\\treturn losesTo.get(rng.nextInt(losesTo.size()));\\n\\t\\t\\t}\\n\\t\\t\\trand -= count;\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"const logic = {\\n rock: { w: 'scissor', l: 'paper'},\\n paper: {w:'rock', l:'scissor'},\\n scissor: {w:'paper', l:'rock'},\\n}\\n\\nclass Player {\\n constructor(name){\\n this.name = name;\\n }\\n setChoice(choice){\\n this.choice = choice;\\n }\\n challengeOther(PlayerTwo){\\n return logic[this.choice].w === PlayerTwo.choice;\\n }\\n}\\n\\nconst p1 = new Player('Chris');\\nconst p2 = new Player('John');\\n\\np1.setChoice('rock');\\np2.setChoice('scissor');\\n\\np1.challengeOther(p2); //true (Win)\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# To quit, enter a blank line or type \\\"q\\\" or \\\"quit\\\"\\ndef choices: [\\\"r\\\", \\\"p\\\", \\\"s\\\", \\\"q\\\"];\\n\\n# The main source of entropy for this pseudo pseudo random number generator is the player :-)\\n# PRN in range(0;3)\\ndef rand: now * 100 | floor | tostring[-2:] | tonumber % 3;\\n\\ndef tallies:\\n {pWins: 0, # player wins\\n cWins: 0, # computer wins\\n draws: 0, # neither wins\\n games: 0, # games played\\n pFreqs: [0, 0, 0] # player frequencies for each choice (rps)\\n};\\n\\n# Update the tallies and populate .emit\\ndef update($pChoice; $cChoice):\\n if $pChoice == \\\"r\\\" and $cChoice == \\\"s\\\"\\n then .emit += \\\"Rock breaks scissors - You win!\\\"\\n | .pWins += 1\\n elif $pChoice == \\\"p\\\" and $cChoice == \\\"r\\\"\\n then .emit += \\\"Paper covers rock - You win!\\\"\\n | .pWins += 1\\n elif $pChoice == \\\"s\\\" and $cChoice == \\\"p\\\"\\n then .emit += \\\"Scissors cut paper - You win!\\\"\\n | .pWins += 1\\n elif $pChoice == \\\"s\\\" and $cChoice == \\\"r\\\"\\n then .emit += \\\"Rock breaks scissors - Computer wins!\\\"\\n | .cWins += 1\\n elif $pChoice == \\\"r\\\" and $cChoice == \\\"p\\\"\\n then .emit += \\\"Paper covers rock - Computer wins!\\\"\\n | .cWins += 1\\n elif $pChoice == \\\"p\\\" and $cChoice == \\\"s\\\"\\n then .emit += \\\"Scissors cut paper - Computer wins!\\\"\\n | .cWins += 1\\n else .emit += \\\"It's a draw!\\\"\\n | .draws += 1\\n end\\n | .pFreqs[choices|index($pChoice)] += 1\\n | .games += 1 ;\\n\\ndef printScore:\\n \\\"Wins: You \\\\(.pWins), Computer \\\\(.cWins), Neither \\\\(.draws)\\\\n\\\";\\n\\n\\ndef getComputerChoice:\\n # make a completely random choice until 3 games have been played\\n if .games < 3 then choices[rand]\\n else .games as $games\\n | (.pFreqs | map(3 * . / $games)) as $pFreqs\\n | rand as $num\\n | if $num < $pFreqs[0] then \\\"p\\\"\\n elif $num < $pFreqs[0] + $pFreqs[1] then \\\"s\\\"\\n else \\\"r\\\"\\n end\\n end ;\\n\\n# Get player's choice (empty line or q or quit to quit).\\n# Return false if the choice is not recognized.\\ndef pChoice:\\n (first(inputs) // null) as $in\\n | if $in == null or $in == \\\"q\\\" or $in == \\\"quit\\\" then null\\n else ($in|ascii_downcase) as $in\\n | if any(choices[]; . == $in) then $in\\n else false\\n end\\n end;\\n\\n# Solicit input\\ndef prompt:\\n if .games == 0\\n then \\\"Enter: (r)ock, (p)aper, (s)cissors or (q)uit\\\"\\n else printScore + \\\"---\\\\n\\\\nYour choice r/p/s/q : \\\"\\n end;\\n\\ndef play:\\n label $out\\n | foreach range(1; infinite) as $i (tallies ;\\n # if .prompt then it is time to get input:\\n if .prompt\\n then pChoice as $pChoice\\n | if $pChoice == null\\n then .prompt = false\\n\\t| .emit = \\\"OK, quitting\\\", break $out\\n elif $pChoice == false\\n\\tthen .emit = \\\"Valid responses are one of r p s q\\\\nPlease try again.\\\"\\n else getComputerChoice as $cChoice\\n\\t| .prompt = false\\n | .emit = \\\"Computer's choice : \\\\($cChoice)\\\\n\\\"\\n | update($pChoice; $cChoice)\\n end\\n else .prompt = prompt\\n | .emit = null\\n end )\\n\\n | select(.emit).emit,\\n select(.prompt).prompt ;\\n\\nplay\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function rps()\\n\\tprint(\\\"Welcome to Rock, paper, scissors! Go ahead and type your pick.\\\\n\\n\\t\\tr(ock), p(aper), or s(cissors)\\\\n\\n\\t\\tEnter 'q' to quit.\\\\n>\\\")\\n\\tcomp_score = 0\\n\\tuser_score = 0\\n\\toptions = [\\\"r\\\",\\\"p\\\",\\\"s\\\"]\\n\\tnew_pick() = options[rand(1:3)]\\n\\ti_win(m,y) = ((m == \\\"r\\\" && y == \\\"s\\\")|(m == \\\"s\\\" && y == \\\"p\\\")|(m == \\\"p\\\" && y == \\\"r\\\"))\\n\\twhile true\\n\\t\\tinput = string(readline(STDIN)[1])\\n\\t\\tinput == \\\"q\\\" && break\\n\\t\\t!ismatch(r\\\"^[rps]\\\",input) && begin print(\\\"Invalid guess: Please enter 'r', 'p', or 's'\\\\n\\\"); continue end\\n\\t\\tanswer = new_pick()\\n\\t\\tif input == answer\\n\\t\\t\\tprint(\\\"\\\\nTie!\\\\nScore still: \\\\nyou $user_score\\\\nme $comp_score\\\\n>\\\")\\n\\t\\t\\tcontinue\\n\\t\\telse\\n\\t\\t\\ti_win(answer,input) ? (comp_score += 1) : (user_score += 1)\\n\\t\\t\\tprint(i_win(answer,input) ? \\\"\\\\nSorry you lose!\\\\n\\\" : \\\"\\\\nYou win!\\\",\\\"Score: \\\\nyou $user_score\\\\nme $comp_score\\\\n>\\\")\\n\\t\\tend\\n\\tend\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.2.10\\n\\nimport java.util.Random\\n\\nconst val choices = \\\"rpsq\\\"\\nval rand = Random()\\n\\nvar pWins = 0 // player wins\\nvar cWins = 0 // computer wins\\nvar draws = 0 // neither wins\\nvar games = 0 // games played\\nval pFreqs = arrayOf(0, 0, 0) // player frequencies for each choice (rps)\\n\\nfun printScore() = println(\\\"Wins: You $pWins, Computer $cWins, Neither $draws\\\\n\\\")\\n\\nfun getComputerChoice(): Char {\\n // make a completely random choice until 3 games have been played\\n if (games < 3) return choices[rand.nextInt(3)]\\n val num = rand.nextInt(games)\\n return when {\\n num < pFreqs[0] -> 'p'\\n num < pFreqs[0] + pFreqs[1] -> 's'\\n else -> 'r'\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n println(\\\"Enter: (r)ock, (p)aper, (s)cissors or (q)uit\\\\n\\\")\\n while (true) {\\n printScore()\\n var pChoice: Char\\n while (true) {\\n print(\\\"Your choice r/p/s/q : \\\")\\n val input = readLine()!!.toLowerCase()\\n if (input.length == 1) {\\n pChoice = input[0]\\n if (pChoice in choices) break\\n }\\n println(\\\"Invalid choice, try again\\\")\\n }\\n if (pChoice == 'q') {\\n println(\\\"OK, quitting\\\")\\n return\\n }\\n val cChoice = getComputerChoice()\\n println(\\\"Computer's choice : $cChoice\\\")\\n if (pChoice == 'r' && cChoice == 's') {\\n println(\\\"Rock breaks scissors - You win!\\\")\\n pWins++\\n }\\n else if (pChoice == 'p' && cChoice == 'r') {\\n println(\\\"Paper covers rock - You win!\\\")\\n pWins++\\n }\\n else if (pChoice == 's' && cChoice == 'p') {\\n println(\\\"Scissors cut paper - You win!\\\")\\n pWins++\\n }\\n else if (pChoice == 's' && cChoice == 'r') {\\n println(\\\"Rock breaks scissors - Computer wins!\\\")\\n cWins++\\n }\\n else if (pChoice == 'r' && cChoice == 'p') {\\n println(\\\"Paper covers rock - Computer wins!\\\")\\n cWins++\\n }\\n else if (pChoice == 'p' && cChoice == 's') {\\n println(\\\"Scissors cut paper - Computer wins!\\\")\\n cWins++\\n }\\n else {\\n println(\\\"It's a draw!\\\")\\n draws++\\n }\\n pFreqs[choices.indexOf(pChoice)]++\\n games++\\n println()\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"session_start('user')\\nsession_addvar('user', 'historic_choices')\\nsession_addvar('user', 'win_record')\\nsession_addvar('user', 'plays')\\nvar(historic_choices)->isNotA(::map) ? var(historic_choices = map('rock'=0, 'paper'=0, 'scissors'=0))\\nvar(plays)->isNotA(::integer) ? var(plays = 0)\\nvar(win_record)->isNotA(::array) ? var(win_record = array)\\n\\ndefine br => '<br>'\\ndefine winner(c::string,p::string) => {\\n\\tif(#c == $superior->find(#p)) => {\\n\\t\\t$win_record->insert('lasso')\\n\\t\\treturn 'Lasso'\\n\\telse(#p == $superior->find(#c))\\n\\t\\t$win_record->insert('user')\\n\\t\\treturn 'User'\\n\\telse\\n\\t\\t$win_record->insert('tie')\\n\\t\\treturn 'Nobody'\\n\\t\\t}\\n\\t}\\n\\n\\tvar(\\n\\t\\tchoice \\t\\t\\t\\t= web_request->param('choice')->asString,\\n\\tlookup \\t\\t\\t\\t= array('rock', 'paper', 'scissors'),\\n\\tcomputer_choice \\t= $lookup->get(math_random(3,1)),\\n\\tsuperior\\t\\t\\t= map('rock'='paper', 'paper'='scissors', 'scissors'='rock'),\\n\\tcontrols\\t\\t\\t= '<a href=?choice=rock>Rock</a> <a href=?choice=paper>Paper</a> <a href=?choice=scissors>Scissors</a> <a href=?choice=quit>Quit</a><br/>'\\n)\\nif($choice == 'quit') => {^\\n\\t'See ya. <a href=?>Start over</a>'\\n\\tsession_end('user')\\n\\t$historic_choices = map('rock'=0, 'paper'=0, 'scissors'=0)\\n\\t$plays = 0\\n\\t$win_record = array\\n\\t\\nelse(array('rock','paper','scissors') >> $choice)\\n\\t\\t$controls\\n\\n\\t\\tif($plays != 0) => {\\n\\t\\t\\tlocal('possibilities') = array\\n\\t\\t\\twith i in $lookup do => {\\n\\t\\t\\t\\tloop($historic_choices->find(#i)) => { #possibilities->insert(#i) }\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t$computer_choice = $superior->find(#possibilities->get(math_random($plays,1)))\\n\\t\\t}\\n\\n\\t\\t'User chose ' + $choice + br\\n\\t'Lasso chose ' + $computer_choice + br\\n\\twinner($computer_choice->asString, $choice) + ' wins!'\\n\\n\\t\\t$historic_choices->find($choice) = $historic_choices->find($choice)+1\\n\\t\\t$plays += 1\\n\\n\\telse($choice->size == 0)\\n\\t\\t$controls\\n\\n\\telse\\n\\t\\t'Invalid Choice.'+ br + $controls\\n^}\\nif($win_record->size) => {^\\n\\tbr\\n\\tbr\\n\\t'Win record: '+br\\n\\t'Lasso: '+($win_record->find('lasso')->size)+br\\n\\t'User: '+($win_record->find('user')->size)+br\\n\\t'Tie: '+($win_record->find('tie')->size)+br\\n^}\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"dim rps( 2), g$( 3)\\n\\ng$( 0) =\\\"rock\\\": g$( 1) =\\\"paper\\\": g$( 2) =\\\"scissors\\\"\\nglobal total\\n\\ntotal =0: draw =0: pwin =0: cwin =0\\n\\nrps( 0) =1: rps( 1) =1: rps( 2) =1 ' at first computer will play all three with equal probability\\n\\nc =int( 3 *rnd( 1)) ' first time, computer response is random\\n\\n' In the following code we set three integer %ages for the <human>'s biassed throws.\\n ' set up the <human> player's key frequencies as %ages.\\n ' Done like this it's easy to mimic the <human> input of q$\\n ' It allows only integer %age frequency- not an important thing.\\nrockP =45 ' <<<<<<<<< Set here the <human>'s %age of 'rock' choices.\\nfor i =1 to rockP: qF$ =qF$ +\\\"R\\\": next i\\n\\npaprP =24 ' <<<<<<<<< Set here the %age of 'paper' choices.\\nfor i =1 to paprP: qF$ =qF$ +\\\"P\\\": next i\\n\\nscisP =100 -rockP -paprP ' <<<<<<<<< %age 'scissors' calculated to make 100%\\nfor i =1 to scisP: qF$ =qF$ +\\\"S\\\": next i\\n'print qF$\\n\\ndo\\n 'do: input q$:loop until instr( \\\"RPSrpsQq\\\", q$) ' for actual human input... possibly biassed. <<<<<<<<<<<<< REM one or the other line...\\n q$ =mid$( qF$, int( 100 *rnd( 1)), 1) ' simulated <human> input with controlled bias. <<<<<<<<<<<<<\\n\\n if total >10000 then q$ =\\\"Q\\\"\\n\\n g =int( ( instr( \\\"RrPpSsQq\\\", q$) -1) / 2)\\n if g >2 then [endGame]\\n\\n total =total +1\\n rps( g) =rps( g) +1 ' accumulate plays the <human> has chosen. ( & hence their (biassed?) frequencies.)\\n 'print \\\" You chose \\\"; g$( g); \\\" and I chose \\\"; g$( c); \\\". \\\"\\n\\n select case g -c\\n case 0\\n draw =draw +1 ':print \\\"It's a draw\\\"\\n case 1, -2\\n pwin =pwin +1 ':print \\\"You win!\\\"\\n case -1, 2\\n cwin =cwin +1 ':print \\\"I win!\\\"\\n end select\\n\\n r =int( total *rnd( 1)) ' Now select computer's choice for next confrontation.\\n select case ' Using the accumulating data about <human>'s frequencies so far.\\n case r <=rps( 0)\\n c =1\\n case r <=( rps( 0) +rps( 1))\\n c =2\\n case else\\n c =0\\n end select\\n\\n scan\\nloop until 0\\n\\n[endGame]\\n print\\n print \\\" You won \\\"; pwin; \\\", and I won \\\"; cwin; \\\". There were \\\"; draw; \\\" draws.\\\"\\n if cwin >pwin then print \\\" I AM THE CHAMPION!!\\\" else print \\\" You won this time.\\\"\\n print\\n print \\\" At first I assumed you'd throw each equally often.\\\"\\n print \\\" This means I'd win 1 time in 3; draw 1 in 3; lose 1 in 3.\\\"\\n print \\\" However if I detect a bias in your throws,....\\\"\\n print \\\" ....this allows me to anticipate your most likely throw & on average beat it.\\\"\\n print\\n print \\\" In fact, keyboard layout & human frailty mean even if you TRY to be even & random...\\\"\\n print \\\" ... you may be typing replies with large bias. In 100 tries I gave 48 'P's, 29 'R' & 23 'S'!\\\"\\n print\\n print \\\" This time I played..\\\"\\n print \\\" Rock \\\"; using( \\\"##.##\\\", rps( 2)* 100 /total); \\\"% Paper \\\"; using( \\\"##.##\\\", rps( 0) *100 /total); \\\"% Scissors \\\"; using( \\\"##.##\\\", rps( 1) *100 /total); \\\"%.\\\"\\n print\\n print \\\" ( PS. I have since learned your actual bias had been..\\\"\\n print \\\" Rock \\\"; using( \\\"##.##\\\", rockP); \\\"% Paper \\\"; using( \\\"##.##\\\", paprP ); \\\"% Scissors \\\"; using( \\\"##.##\\\", ( 100 -rockP -paprP)); \\\"%.)\\\"\\n print\\n print \\\" The advantage I can gain gets bigger the further the 'human' entries are biassed.\\\"\\n print \\\" The results statistically smooth out better with large runs.\\\"\\n print \\\" Try 10,000,000, & have a cuppa while you wait.\\\"\\n print\\n print \\\" Can you see what will happen if, say, the 'human' is set to give 'Rock' EVERY time?\\\"\\n print \\\" Try different %ages by altering the marked code lines.\\\"\\n print\\n print \\\" Thanks for playing!\\\"\\n end\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"10 mode 1:defint a-z:randomize time\\n20 rps$=\\\"rps\\\"\\n30 msg$(1)=\\\"Rock breaks scissors\\\"\\n40 msg$(2)=\\\"Paper covers rock\\\"\\n50 msg$(3)=\\\"Scissors cut paper\\\"\\n60 print \\\"Rock Paper Scissors\\\":print\\n70 print \\\"Enter r, p, or s as your play.\\\"\\n80 print \\\"Running score shown as <your wins>:<my wins>\\\"\\n90 achoice=rnd*2.99+.5 ' get integer between 1 and 3 from real between .5 and <3.5\\n100 ' get key\\n110 pin$=inkey$\\n120 if pin$=\\\"\\\" then 110\\n130 pchoice=instr(rps$,pin$)\\n140 if pchoice=0 then print \\\"Sorry?\\\":goto 110\\n150 pcf(pchoice)=pcf(pchoice)+1\\n160 plays=plays+1\\n170 print \\\"My play: \\\"mid$(rps$,achoice,1)\\n180 sw=(achoice-pchoice+3) mod 3\\n190 if sw=0 then print \\\"Tie.\\\" else if sw=1 then print msg$(achoice);\\\". My point.\\\":ascore=ascore+1 else print msg$(pchoice);\\\". Your point.\\\":pscore=pscore+1\\n200 print pscore\\\":\\\"ascore\\n210 rn=rnd*plays\\n220 if rn<pcf(1) then achoice=2 else if rn<pcf(1)+pcf(2) then achoice=3 else achoice=1\\n230 goto 110\\n\",\n \"language\": \"Locomotive-Basic\"\n },\n {\n \"code\": \"function cpuMove()\\n local totalChance = record.R + record.P + record.S\\n if totalChance == 0 then -- First game, unweighted random\\n local choice = math.random(1, 3)\\n if choice == 1 then return \\\"R\\\" end\\n if choice == 2 then return \\\"P\\\" end\\n if choice == 3 then return \\\"S\\\" end\\n end\\n local choice = math.random(1, totalChance) -- Weighted random bit\\n if choice <= record.R then return \\\"P\\\" end\\n if choice <= record.R + record.P then return \\\"S\\\" end\\n return \\\"R\\\"\\nend\\n\\nfunction playerMove() -- Get user input for choice of 'weapon'\\n local choice\\n repeat\\n os.execute(\\\"cls\\\") -- Windows specific command, change per OS\\n print(\\\"\\\\nRock, Paper, Scissors\\\")\\n print(\\\"=====================\\\\n\\\")\\n print(\\\"Scores -\\\\tPlayer:\\\", score.player)\\n print(\\\"\\\\t\\\\tCPU:\\\", score.cpu .. \\\"\\\\n\\\\t\\\\tDraws:\\\", score.draws)\\n io.write(\\\"\\\\nChoose [R]ock [P]aper or [S]cissors: \\\")\\n choice = io.read():upper():sub(1, 1)\\n until choice == \\\"R\\\" or choice == \\\"P\\\" or choice == \\\"S\\\"\\n return choice\\nend\\n\\n-- Decide who won, increment scores\\nfunction checkWinner (c, p)\\n io.write(\\\"I chose \\\")\\n if c == \\\"R\\\" then print(\\\"rock...\\\") end\\n if c == \\\"P\\\" then print(\\\"paper...\\\") end\\n if c == \\\"S\\\" then print(\\\"scissors...\\\") end\\n if c == p then\\n print(\\\"\\\\nDraw!\\\")\\n score.draws = score.draws + 1\\n elseif (c == \\\"R\\\" and p == \\\"P\\\") or\\n (c == \\\"P\\\" and p == \\\"S\\\") or\\n (c == \\\"S\\\" and p == \\\"R\\\") then\\n print(\\\"\\\\nYou win!\\\")\\n score.player = score.player + 1\\n else\\n print(\\\"\\\\nYou lose!\\\")\\n score.cpu = score.cpu + 1\\n end\\nend\\n\\n-- Main procedure\\nmath.randomseed(os.time())\\nscore = {player = 0, cpu = 0, draws = 0}\\nrecord = {R = 0, P = 0, S = 0}\\nlocal playerChoice, cpuChoice\\nrepeat\\n cpuChoice = cpuMove()\\n playerChoice = playerMove()\\n record[playerChoice] = record[playerChoice] + 1\\n checkWinner(cpuChoice, playerChoice)\\n io.write(\\\"\\\\nPress ENTER to continue or enter 'Q' to quit . . . \\\")\\nuntil io.read():upper():sub(1, 1) == \\\"Q\\\"\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"DynamicModule[{record, play, text = \\\"\\\\nRock-paper-scissors\\\\n\\\",\\n choices = {\\\"Rock\\\", \\\"Paper\\\", \\\"Scissors\\\"}},\\n Evaluate[record /@ choices] = {1, 1, 1};\\n play[x_] :=\\n Module[{y = RandomChoice[record /@ choices -> RotateLeft@choices]},\\n record[x]++;\\n text = \\\"Your Choice:\\\" <> x <> \\\"\\\\nComputer's Choice:\\\" <> y <> \\\"\\\\n\\\" <>\\n Switch[{x, y}, Alternatives @@ Partition[choices, 2, 1, 1],\\n \\\"You lost.\\\",\\n Alternatives @@ Reverse /@ Partition[choices, 2, 1, 1],\\n \\\"You win.\\\", _, \\\"Draw.\\\"]];\\n Column@{Dynamic[text], ButtonBar[# :> play[#] & /@ choices]}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \":- module rps.\\n:- interface.\\n:- import_module io.\\n:- pred main(io::di, io::uo) is det.\\n:- implementation.\\n:- use_module random, exception.\\n:- import_module list, string.\\n\\n:- type play\\n ---> rock\\n ; paper\\n ; scissors.\\n\\n:- pred beats(play, play).\\n:- mode beats(in, in) is semidet.\\nbeats(rock, scissors).\\nbeats(paper, rock).\\nbeats(scissors, paper).\\n\\n:- pred random(play::out, random.supply::mdi, random.supply::muo) is det.\\nrandom(Play, !RS) :-\\n random.random(1, 3, N, !RS),\\n ( if N = 1 then\\n Play = rock\\n else if N = 2 then\\n Play = paper\\n else\\n Play = scissors\\n ).\\n\\nmain(!IO) :-\\n seed(Seed, !IO),\\n random.init(Seed, RS),\\n play(RS, !IO).\\n\\n:- pred play(random.supply::mdi, io::di, io::uo) is det.\\nplay(!.RS, !IO) :-\\n io.write_string(\\\"Your choice? \\\", !IO),\\n io.read(Res, !IO),\\n (\\n Res = ok(Play),\\n random(Counter, !RS),\\n io.format(\\\"The computer chose %s\\\\n\\\", [s(string(Counter))], !IO),\\n ( if beats(Counter, Play) then\\n io.write_string(\\\"Computer wins.\\\\n\\\", !IO)\\n else if beats(Play, Counter) then\\n io.write_string(\\\"You win!\\\\n\\\", !IO)\\n else\\n io.write_string(\\\"It is a draw\\\\n\\\", !IO)\\n ),\\n play(!.RS, !IO)\\n ;\\n Res = eof\\n ;\\n Res = error(_, _),\\n exception.throw(Res)\\n ).\\n\\n:- pragma foreign_decl(\\\"C\\\", \\\"#include <time.h>\\\").\\n:- pred seed(int::out, io::di, io::uo) is det.\\n:- pragma foreign_proc(\\\"C\\\",\\n seed(Seed::out, _IO0::di, _IO::uo),\\n [promise_pure, will_not_call_mercury],\\n\\\"\\n Seed = time(NULL);\\n\\\").\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"import random, strutils, tables\\n\\ntype\\n Choice {.pure.} = enum Rock, Paper, Scissors\\n History = tuple[total: int; counts: CountTable[Choice]]\\n\\nconst Successor: array[Choice, Choice] = [Paper, Scissors, Rock]\\n\\nfunc `>`(a, b: Choice): bool =\\n ## By construction, only the successor is greater than the choice.\\n a == Successor[b]\\n\\nproc choose(history: History): Choice =\\n ## Make a weighted random choice using the player counts\\n ## then select the choice likely to beat it.\\n var value = rand(1..history.total)\\n for choice, count in history.counts.pairs:\\n if value <= count:\\n return Successor[choice]\\n dec value, count\\n\\n\\nrandomize()\\n\\n# Initialize history with one for each choice in order to avoid special case.\\nvar history: History = (3, [Rock, Paper, Scissors].toCountTable)\\n\\necho \\\"To quit game, type 'q' when asked for your choice.\\\"\\n\\nvar myChoice, yourChoice: Choice\\nvar myWins, yourWins = 0\\n\\nwhile true:\\n\\n # Get player choice.\\n try:\\n stdout.write \\\"Rock(1), paper(2), scissors(3). Your choice? \\\"\\n let answer = stdin.readLine().strip()\\n if answer == \\\"q\\\":\\n quit \\\"Quitting game.\\\", QuitSuccess\\n if answer notin [\\\"1\\\", \\\"2\\\", \\\"3\\\"]:\\n echo \\\"Invalid choice.\\\"\\n continue\\n yourChoice = Choice(ord(answer[0]) - ord('1'))\\n except EOFError:\\n quit \\\"Quitting game.\\\", QuitFailure\\n\\n # Make my choice.\\n myChoice = history.choose()\\n echo \\\"I choosed \\\", myChoice, '.'\\n history.counts.inc yourChoice\\n inc history.total\\n\\n # Display result of round.\\n if myChoice == yourChoice:\\n echo \\\"It’s a tie.\\\"\\n elif myChoice > yourChoice:\\n echo \\\"I win.\\\"\\n inc myWins\\n else:\\n echo \\\"You win.\\\"\\n inc yourWins\\n echo \\\"Total wins. You: \\\", yourWins, \\\" Me: \\\", myWins\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"10 COMPUTER=RND(3)+1\\n20 COMPUTER$=\\\"ROCK\\\"\\n30 IF COMPUTER=2 THEN COMPUTER$=\\\"PAPER\\\"\\n40 IF COMPUTER=3 THEN COMPUTER$=\\\"SCISSORS\\\"\\n50 INPUT \\\"ROCK, PAPER OR SCISSORS? \\\",HUMAN$\\n60 IF HUMAN$=\\\"ROCK\\\" THEN GOTO 100\\n70 IF HUMAN$=\\\"PAPER\\\" THEN GOTO 100\\n80 IF HUMAN$=\\\"SCISSORS\\\" THEN GOTO 100\\n90 PRINT \\\"INVALID GUESS. TRY AGAIN.\\\": GOTO 50\\n100 PRINT \\\"YOU CHOSE \\\"HUMAN$\\\" AND THE COMPUTER CHOSE \\\"COMPUTER$\\\".\\\"\\n110 IF HUMAN$=COMPUTER$ THEN PRINT \\\"THOSE ARE THE SAME CHOICES\\\";\\\", SO YOU TIED.\\\"\\n120 IF HUMAN$=\\\"ROCK\\\" AND COMPUTER=2 THEN PRINT \\\"PAPER COVERS ROCK, SO YOU LOSE.\\\"\\n130 IF HUMAN$=\\\"ROCK\\\" AND COMPUTER=3 THEN PRINT \\\"ROCK BLUNTS SCISSORS\\\";\\\", SO YOU WIN.\\\"\\n140 IF HUMAN$=\\\"PAPER\\\" AND COMPUTER=1 THEN PRINT \\\"PAPER COVERS ROCK, SO YOU WIN.\\\"\\n150 IF HUMAN$=\\\"PAPER\\\" AND COMPUTER=3 THEN PRINT \\\"SCISSORS CUT PAPER\\\";\\\", SO YOU LOSE.\\\"\\n160 IF HUMAN$=\\\"SCISSORS\\\" AND COMPUTER=1 THEN PRINT \\\"ROCK BLUNTS SCISSORS\\\";\\\", SO YOU LOSE.\\\"\\n170 IF HUMAN$=\\\"SCISSORS\\\" AND COMPUTER=2 THEN PRINT \\\"SCISSORS CUT PAPER, SO YOU WIN.\\\"10 COMPUTER=RND(3)+1\\n\",\n \"language\": \"NS-HUBASIC\"\n },\n {\n \"code\": \"let pf = Printf.printf ;;\\n\\nlet looses a b = match a, b with\\n `R, `P -> true\\n | `P, `S -> true\\n | `S, `R -> true\\n | _, _ -> false ;;\\n\\nlet rec get_move () =\\n pf \\\"[R]ock, [P]aper, [S]cisors [Q]uit? \\\" ;\\n match String.uppercase (read_line ()) with\\n \\\"P\\\" -> `P\\n | \\\"S\\\" -> `S\\n | \\\"R\\\" -> `R\\n | \\\"Q\\\" -> exit 0\\n | _ -> get_move () ;;\\n\\nlet str_of_move = function\\n `P -> \\\"paper\\\"\\n | `R -> \\\"rock\\\"\\n | `S -> \\\"scisors\\\" ;;\\n\\nlet comp_move r p s =\\n let tot = r +. p +. s in\\n let n = Random.float 1.0 in\\n if n < r /. tot then\\n `R\\n else\\n if n < (r +. p) /. tot then\\n `P\\n else\\n `S ;;\\n\\nlet rec make_moves r p s =\\n let cm = comp_move r p s in (* Computer move is based on game history. *)\\n let hm = get_move () in (* Human move is requested. *)\\n pf \\\"Me: %s. You: %s. \\\" (str_of_move cm) (str_of_move hm);\\n let outcome =\\n if looses hm cm then\\n \\\"I win. You loose.\\\\n\\\"\\n else if cm = hm then\\n \\\"We draw.\\\\n\\\"\\n else\\n \\\"You win. I loose.\\\\n\\\"\\n in pf \\\"%s\\\" outcome;\\n match hm with (* Play on with adapted strategy. *)\\n `S -> make_moves (r +. 1.) p s\\n | `R -> make_moves r (p +. 1.) s\\n | `P -> make_moves r p (s +. 1.) ;;\\n\\n(* Main loop. *)\\nmake_moves 1. 1. 1. ;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"contest(rounds)={\\n my(v=[1,1,1],wins,losses); \\\\\\\\ Laplace rule\\n for(i=1,rounds,\\n my(computer,player,t);\\n t=random(v[1]+v[2]+v[3]);\\n if(t<v[1], computer = \\\"R\\\",\\n if(t<v[1]+v[2], computer = \\\"P\\\", computer = \\\"S\\\")\\n );\\n print(\\\"Rock, paper, or scissors?\\\");\\n t = Str(input());\\n if(#t,\\n player=Vec(t)[1];\\n if(player <> \\\"R\\\" && player <> \\\"P\\\", player = \\\"S\\\")\\n ,\\n player = \\\"S\\\"\\n );\\n if (player == \\\"R\\\", v[2]++);\\n if (player == \\\"P\\\", v[3]++);\\n if (player == \\\"S\\\", v[1]++);\\n print1(player\\\" vs. \\\"computer\\\": \\\");\\n if (computer <> player,\\n if((computer == \\\"R\\\" && player = \\\"P\\\") || (computer == \\\"P\\\" && player = \\\"S\\\") || (computer == \\\"S\\\" && player == \\\"R\\\"),\\n print(\\\"You win\\\");\\n losses++\\n ,\\n print(\\\"I win\\\");\\n wins++\\n )\\n ,\\n print(\\\"Tie\\\");\\n )\\n );\\n [wins,losses]\\n};\\ncontest(10)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use 5.012;\\nuse warnings;\\nuse utf8;\\nuse open qw(:encoding(utf-8) :std);\\nuse Getopt::Long;\\n\\npackage Game {\\n use List::Util qw(shuffle first);\\n\\n my $turns = 0;\\n my %human_choice = ( rock => 0, paper => 0, scissors => 0, );\\n my %comp_choice = ( rock => 0, paper => 0, scissors => 0, );\\n my %what_beats =\\n ( rock => 'paper', paper => 'scissors', scissors => 'rock', );\\n my $comp_wins = 0;\\n my $human_wins = 0;\\n my $draws = 0;\\n\\n sub save_human_choice {\\n my $ch = lc pop;\\n if ( exists $human_choice{ $ch } ) {\\n ++$human_choice{ $ch };\\n }\\n else {\\n die __PACKAGE__ . \\\":: wrong choice: '$ch'\\\";\\n }\\n }\\n\\n sub get_comp_choice {\\n my @keys = shuffle keys %human_choice;\\n my $ch;\\n my ( $prob, $rand ) = ( 0, rand );\\n $ch = ( first { $rand <= ( $prob += ( $human_choice{ $_ } / $turns ) ) } @keys )\\n if $turns > 0;\\n $ch //= $keys[0];\\n $ch = $what_beats{ $ch };\\n ++$comp_choice{ $ch };\\n return $ch;\\n }\\n\\n sub make_turn {\\n my ( $comp_ch, $human_ch ) = ( pop(), pop() );\\n ++$turns;\\n if ( $what_beats{ $human_ch } eq $comp_ch ) {\\n ++$comp_wins;\\n return 'I win!';\\n }\\n elsif ( $what_beats{ $comp_ch } eq $human_ch ) {\\n ++$human_wins;\\n return 'You win!';\\n }\\n else {\\n ++$draws;\\n return 'Draw!';\\n }\\n }\\n\\n sub get_final_report {\\n my $report =\\n \\\"You chose:\\\\n\\\"\\n . \\\" rock = $human_choice{rock} times,\\\\n\\\"\\n . \\\" paper = $human_choice{paper} times,\\\\n\\\"\\n . \\\" scissors = $human_choice{scissors} times,\\\\n\\\"\\n . \\\"I chose:\\\\n\\\"\\n . \\\" rock = $comp_choice{rock} times,\\\\n\\\"\\n . \\\" paper = $comp_choice{paper} times,\\\\n\\\"\\n . \\\" scissors = $comp_choice{scissors} times,\\\\n\\\"\\n . \\\"Turns: $turns\\\\n\\\"\\n . \\\"I won: $comp_wins, you won: $human_wins, draws: $draws\\\\n\\\";\\n return $report;\\n }\\n}\\n\\nsub main {\\n GetOptions( 'quiet' => \\\\my $quiet );\\n greet() if !$quiet;\\n while (1) {\\n print_next_line() if !$quiet;\\n my $input = get_input();\\n last unless $input;\\n if ( $input eq 'error' ) {\\n print \\\"I don't understand!\\\\n\\\" if !$quiet;\\n redo;\\n }\\n my $comp_choice = Game::get_comp_choice();\\n Game::save_human_choice($input);\\n my $result = Game::make_turn( $input, $comp_choice );\\n describe_turn_result( $input, $comp_choice, $result )\\n if !$quiet;\\n }\\n print Game::get_final_report();\\n}\\n\\nsub greet {\\n print \\\"Welcome to the Rock-Paper-Scissors game!\\\\n\\\"\\n . \\\"Choose 'rock', 'paper' or 'scissors'\\\\n\\\"\\n . \\\"Enter empty line or 'quit' to quit\\\\n\\\";\\n}\\n\\nsub print_next_line {\\n print 'Your choice: ';\\n}\\n\\nsub get_input {\\n my $input = <>;\\n print \\\"\\\\n\\\" and return if !$input; # EOF\\n chomp $input;\\n return if !$input or $input =~ m/\\\\A \\\\s* q/xi;\\n return\\n ( $input =~ m/\\\\A \\\\s* r/xi ) ? 'rock'\\n : ( $input =~ m/\\\\A \\\\s* p/xi ) ? 'paper'\\n : ( $input =~ m/\\\\A \\\\s* s/xi ) ? 'scissors'\\n : 'error';\\n}\\n\\nsub describe_turn_result {\\n my ( $human_ch, $comp_ch, $result ) = @_;\\n print \\\"You chose \\\\u$human_ch, I chose \\\\u$comp_ch. $result\\\\n\\\";\\n}\\n\\nmain();\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"perl -e '@c=qw(r p s); for(1..10000){ print $c[ rand() < 0.75 ? 0 : int rand(2) + 1 ], \\\"\\\\n\\\" }' | perl rps.pl --quiet\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"--standard game\\nconstant rule3 = {\\\"rock blunts scissors\\\",\\n \\\"paper wraps rock\\\",\\n \\\"scissors cut paper\\\"}\\n--extended version\\nconstant rule5 = {\\\"rock blunts scissors\\\",\\n \\\"rock crushes lizard\\\",\\n \\\"paper wraps rock\\\",\\n \\\"paper disproves spock\\\",\\n \\\"scissors cut paper\\\",\\n \\\"scissors decapitate lizard\\\",\\n \\\"lizard eats paper\\\",\\n \\\"lizard poisons spock\\\",\\n \\\"spock smashes scissors\\\",\\n \\\"spock vaporizes rock\\\"}\\n\\nconstant rules = iff(rand(2)=1?rule3:rule5)\\n\\nsequence what = {}\\nsequence beats = {}\\nstring wkeys = \\\"\\\"\\nstring question = \\\"What is your move \\\"\\ninteger choices, hsum\\nsequence history, cplays, pplays\\n\\nobject x, verb, y\\n\\n for i=1 to length(rules) do\\n {x} = split(rules[i])\\n if not find(x,what) then\\n what = append(what,x)\\n if find(x[1],wkeys) then\\n wkeys = append(wkeys,x[$])\\n question &= x[1..-2]&\\\"(\\\"&x[$]&\\\"), \\\"\\n else\\n wkeys = append(wkeys,x[1])\\n question &= \\\"(\\\"&x[1]&\\\")\\\"&x[2..$]&\\\", \\\"\\n end if\\n end if\\n end for\\n choices = length(wkeys)\\n history = repeat(1,choices)\\n hsum = 3\\n cplays = repeat(0,choices)\\n pplays = repeat(0,choices)\\n beats = repeat(repeat(0,choices),choices)\\n question[-2] = '?'\\n for i=1 to length(rules) do\\n {x,verb,y} = split(rules[i])\\n beats[find(x,what)][find(y,what)] = verb\\n end for\\n\\ninteger cmove, pmove, draws = 0, pwins = 0, cwins = 0\\n while 1 do\\n cmove = rand(hsum)\\n for i=1 to choices do\\n cmove -= history[i]\\n if cmove<=0 then\\n -- predicted user choice of i, find whatever beats it\\n for j=1 to choices do\\n if string(beats[j][i]) then\\n cmove = j\\n exit\\n end if\\n end for\\n exit\\n end if\\n end for\\n puts(1,question)\\n while 1 do\\n pmove = lower(wait_key())\\n if pmove='q' then exit end if\\n pmove = find(pmove,wkeys)\\n if pmove!=0 then exit end if\\n end while\\n if pmove='q' then exit end if\\n\\n printf(1,\\\"you: %s, me: %s, \\\",{what[pmove],what[cmove]})\\n cplays[cmove] += 1\\n pplays[pmove] += 1\\n if cmove=pmove then\\n printf(1,\\\"a draw.\\\\n\\\")\\n draws += 1\\n else\\n if string(beats[cmove][pmove]) then\\n printf(1,\\\"%s %s %s. I win.\\\\n\\\",{what[cmove],beats[cmove][pmove],what[pmove]})\\n cwins += 1\\n elsif string(beats[pmove][cmove]) then\\n printf(1,\\\"%s %s %s. You win.\\\\n\\\",{what[pmove],beats[pmove][cmove],what[cmove]})\\n pwins += 1\\n else\\n ?9/0 -- sanity check\\n end if\\n end if\\n history[pmove] += 1\\n hsum += 1\\n end while\\n printf(1,\\\"\\\\n\\\\nYour wins:%d, My wins:%d, Draws:%d\\\\n\\\",{pwins,cwins,draws})\\n printf(1,\\\"\\\\n\\\\nYour wins:%d, My wins:%d, Draws:%d\\\\n\\\",{pwins,cwins,draws})\\n printf(1,\\\" \\\") for i=1 to choices do printf(1,\\\"%9s\\\",what[i]) end for\\n printf(1,\\\"\\\\nyou: \\\") for i=1 to choices do printf(1,\\\"%9d\\\",pplays[i]) end for\\n printf(1,\\\"\\\\n me: \\\") for i=1 to choices do printf(1,\\\"%9d\\\",cplays[i]) end for\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\n 0 var wh\\n 0 var wc\\n\\n( \\\"Scissors cuts Paper\\\"\\n \\\"Paper covers Rock\\\"\\n \\\"Rock crushes Lizard\\\"\\n \\\"Lizard poisons Spock\\\"\\n \\\"Spock smashes Scissors\\\"\\n \\\"Scissors decapites Lizard\\\"\\n \\\"Lizard eats Paper\\\"\\n \\\"Paper disproves Spock\\\"\\n \\\"Spock vaporizes Rock\\\"\\n \\\"Rock blunts Scissors\\\" )\\n\\n \\\"'Rock, Paper, Scissors, Lizard, Spock!' rules are: \\\" ? nl\\n len for\\n get ?\\n endfor\\n nl\\n\\n ( ( \\\"S\\\" \\\"Scissors\\\" ) ( \\\"P\\\" \\\"Paper\\\" ) ( \\\"R\\\" \\\"Rock\\\" ) ( \\\"L\\\" \\\"Lizard\\\" ) ( \\\"K\\\" \\\"Spock\\\" ) )\\n\\n true while\\n \\\"Choose (S)cissors, (P)paper, (R)ock, (L)izard, Spoc(K) or (Q)uit: \\\" input nl upper\\n dup \\\"Q\\\" == if\\n nl drop false\\n else\\n getd if\\n dup \\\"You choose \\\" print ? var he\\n rand 5 * int 1 + 2 2 tolist sget\\n dup \\\"I choose \\\" print ? var ce\\n he ce == if\\n \\\"Draw\\\" ?\\n else\\n swap len for\\n get dup\\n split 2 del\\n he ce 2 tolist\\n over over == rot rot reverse == or if exitfor else drop endif\\n endfor\\n dup ?\\n he find 1 == if wh 1 + var wh \\\"You win!\\\" else wc 1 + var wc \\\"I win!\\\" endif ? drop\\n swap\\n endif\\n else\\n print \\\" is a invalid input!\\\" ?\\n endif\\n true\\n endif\\n endwhile\\n drop drop\\n \\\"Your punctuation: \\\" print wh ?\\n \\\"Mi punctuation: \\\" print wc ?\\n wh wc > if \\\"You win!\\\" else wh wc < if \\\"I win!\\\" else \\\"Draw!\\\" endif endif ?\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"<?php\\necho \\\"<h1>\\\" . \\\"Choose: ROCK - PAPER - SCISSORS\\\" . \\\"</h1>\\\";\\necho \\\"<h2>\\\";\\necho \\\"\\\";\\n\\n$player = strtoupper( $_GET[\\\"moves\\\"] );\\n$wins = [\\n 'ROCK' => 'SCISSORS',\\n 'PAPER' => 'ROCK',\\n 'SCISSORS' => 'PAPER'\\n ];\\n$a_i = array_rand($wins);\\necho \\\"<br>\\\";\\necho \\\"Player chooses \\\" . \\\"<i style=\\\\\\\"color:blue\\\\\\\">\\\" . $player . \\\"</i>\\\";\\necho \\\"<br>\\\";\\necho \\\"<br>\\\" . \\\"A.I chooses \\\" . \\\"<i style=\\\\\\\"color:red\\\\\\\">\\\" . $a_i . \\\"</i>\\\";\\n\\n$results = \\\"\\\";\\nif ($player == $a_i){\\n$results = \\\"Draw\\\";\\n} else if($wins[$a_i] == $player ){\\n $results = \\\"A.I wins\\\";\\n} else {\\n $results = \\\"Player wins\\\";\\n}\\n\\necho \\\"<br>\\\" . $results;\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"go ?=>\\n println(\\\"\\\\nEnd terms with '.'.\\\\n'quit.' ends the session.\\\\n\\\"),\\n Prev = findall(P,beats(P,_)),\\n ChoiceMap = new_map([P=0 : P in Prev]),\\n ResultMap = new_map([computer_wins=0,user_wins=0,draw=0]),\\n play(Prev,ChoiceMap,ResultMap),\\n nl,\\n println(\\\"Summary:\\\"),\\n println(choiceMap=ChoiceMap),\\n println(resultMap=ResultMap),\\n nl.\\n\\ngo => true.\\n\\n%\\n% Play an interactive game.\\n%\\nplay(Prev,ChoiceMap,ResultMap) =>\\n print(\\\"Your choice? \\\"),\\n P = read_term(),\\n if P == quit then\\n nl,\\n print_result(ResultMap)\\n else\\n C = choice(ChoiceMap),\\n printf(\\\"The computer chose %w%n\\\", C),\\n result(C,P,Prev,Next,Result),\\n ChoiceMap.put(P,ChoiceMap.get(P)+1),\\n ResultMap.put(Result,ResultMap.get(Result,0)+1),\\n play(Next,ChoiceMap,ResultMap)\\n end.\\n\\n%\\n% Do a weighted random choice based on the user's previous choices.\\n%\\nweighted_choice(Map) = Choice =>\\n Map2 = [(V+1)=K : K=V in Map].sort, % ensure that all choices can be made\\n % Prepare the probability matrix M\\n Total = sum([P : P=_ in Map2]),\\n Len = Map2.len,\\n M = new_array(Len,2),\\n T = new_list(Len),\\n foreach({I,P=C} in zip(1..Len,Map2))\\n if I == 1 then\\n M[I,1] := 1,\\n M[I,2] := P\\n else\\n M[I,1] := M[I-1,2]+1,\\n M[I,2] := M[I,1]+P-1\\n end,\\n T[I] := C\\n end,\\n M[Len,2] := Total,\\n\\n % Pick a random number in 1..Total\\n R = random(1,Total),\\n Choice = _,\\n % Check were R match\\n foreach(I in 1..Len, var(Choice))\\n if M[I,1] <= R, M[I,2] >= R then\\n Choice := T[I]\\n end\\n end.\\n\\n%\\n% Check probably best counter choice.\\n%\\nchoice(Map) = Choice =>\\n % what is the Player's probably choice\\n PlayersProbablyMove = weighted_choice(Map),\\n % select the choice that beats it\\n beats(Choice,PlayersProbablyMove).\\n\\n\\nprint_result(ResultMap) =>\\n foreach(C in ResultMap.keys)\\n println(C=ResultMap.get(C))\\n end,\\n nl.\\n\\n% This part is from the Prolog version.\\nresult(C,P,R,[C|R],Result) :-\\n beats(C,P),\\n Result = computer_wins,\\n printf(\\\"Computer wins.\\\\n\\\").\\nresult(C,P,R,[B|R],Result) :-\\n beats(P,C),\\n beats(B,P),\\n Result=user_wins,\\n printf(\\\"You win!%n\\\").\\nresult(C,C,R,[B|R],Result) :-\\n beats(B,C),\\n Result=draw,\\n printf(\\\"It is a draw\\\\n\\\").\\n\\nbeats(paper, rock).\\nbeats(rock, scissors).\\nbeats(scissors, paper).\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(use (C Mine Your)\\n (let (Rock 0 Paper 0 Scissors 0)\\n (loop\\n (setq Mine\\n (let N (if (gt0 (+ Rock Paper Scissors)) (rand 1 @) 0)\\n (seek\\n '((L) (le0 (dec 'N (caar L))))\\n '(Rock Paper Scissors .) ) ) )\\n (prin \\\"Enter R, P or S to play, or Q to quit: \\\")\\n (loop\\n (and (= \\\"Q\\\" (prinl (setq C (uppc (key))))) (bye))\\n (T (setq Your (find '((S) (pre? C S)) '(Rock Paper Scissors))))\\n (prinl \\\"Bad input - try again\\\") )\\n (prinl\\n \\\"I say \\\" (cadr Mine) \\\", You say \\\" Your \\\": \\\"\\n (cond\\n ((== Your (cadr Mine)) \\\"Draw\\\")\\n ((== Your (car Mine)) \\\"I win\\\")\\n (T \\\"You win\\\") ) )\\n (inc Your) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"rock: procedure options (main); /* 30 October 2013 */\\n declare move character (1), cm fixed binary;\\n\\n put ('The Rock-Paper-Scissors game');\\n put skip list (\\\"please type 'r' for rock, 'p' for paper, 's' for scissors.\\\");\\n put skip list (\\\"Anything else finishes:\\\");\\n do forever;\\n get edit (move) (a(1));\\n move = lowercase(move);\\n if index('rpsq', move) = 0 then iterate;\\n if move = 'q' then stop;\\n cm = random()*3; /* computer moves: 0 = rock, 1 = paper, 2 = scissors */\\n select (cm);\\n when (0) select (move);\\n when ('r') put list ('rock and rock: A draw');\\n when ('p') put list ('paper beats rock: You win');\\n when ('s') put list ('rock breaks scissors: I win');\\n end;\\n when (1) select (move);\\n when ('r') put list ('paper beats rock: I win');\\n when ('p') put list ('paper and paper: A draw');\\n when ('s') put list ('scissors cut paper: You win');\\n end;\\n when (2) select (move);\\n when ('r') put list ('rock breaks scissors: You win');\\n when ('p') put list ('scissors cuts paper: I win');\\n when ('s') put list ('Scissors and Scissors: A draw');\\n end;\\n end;\\n end;\\nend rock;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"play :-\\n findall(P,beats(P,_),Prev),\\n play(Prev).\\n\\nplay(Prev) :-\\n write('your choice? '),\\n read(P),\\n random_member(C, Prev),\\n format('The computer chose ~p~n', C),\\n result(C,P,Prev,Next),\\n !,\\n play(Next).\\n\\nresult(C,P,R,[C|R]) :-\\n beats(C,P),\\n format('Computer wins.~n').\\nresult(C,P,R,[B|R]) :-\\n beats(P,C),\\n beats(B,P),\\n format('You win!~n').\\nresult(C,C,R,[B|R]) :-\\n beats(B,C),\\n format('It is a draw~n').\\n\\nbeats(paper, rock).\\nbeats(rock, scissors).\\nbeats(scissors, paper).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Enumeration\\n ;choices are in listed according to their cycle, weaker followed by stronger\\n #rock\\n #paper\\n #scissors\\n #numChoices ;this comes after all possible choices\\nEndEnumeration\\n\\n;give names to each of the choices\\nDim choices.s(#numChoices - 1)\\nchoices(#rock) = \\\"rock\\\"\\nchoices(#paper) = \\\"paper\\\"\\nchoices(#scissors) = \\\"scissors\\\"\\n\\nDefine gameCount\\nDim playerChoiceHistory(#numChoices - 1)\\n\\nProcedure weightedRandomChoice()\\n Shared gameCount, playerChoiceHistory()\\n Protected x = Random(gameCount - 1), t, c\\n\\n For i = 0 To #numChoices - 1\\n t + playerChoiceHistory(i)\\n If t >= x\\n c = i\\n Break\\n EndIf\\n Next\\n\\n ProcedureReturn (c + 1) % #numChoices\\nEndProcedure\\n\\nIf OpenConsole()\\n PrintN(\\\"Welcome to the game of rock-paper-scissors\\\")\\n PrintN(\\\"Each player guesses one of these three, and reveals it at the same time.\\\")\\n PrintN(\\\"Rock blunts scissors, which cut paper, which wraps stone.\\\")\\n PrintN(\\\"If both players choose the same, it is a draw!\\\")\\n PrintN(\\\"When you've had enough, choose Q.\\\")\\n\\n Define computerChoice, playerChoice, response.s\\n Define playerWins, computerWins, draw, quit\\n\\n computerChoice = Random(#numChoices - 1)\\n Repeat\\n Print(#CRLF$ + \\\"What is your move (press R, P, or S)?\\\")\\n Repeat\\n response = LCase(Input())\\n Until FindString(\\\"rpsq\\\", response) > 0\\n\\n If response = \\\"q\\\":\\n quit = 1\\n Else\\n gameCount + 1\\n playerChoice = FindString(\\\"rps\\\", response) - 1\\n\\n result = (playerChoice - computerChoice + #numChoices) % #numChoices\\n Print(\\\"You chose \\\" + choices(playerChoice) + \\\" and I chose \\\" + choices(computerChoice))\\n Select result\\n Case 0\\n PrintN(\\\". It's a draw.\\\")\\n draw + 1\\n Case 1\\n PrintN(\\\". You win!\\\")\\n playerWins + 1\\n Case 2\\n PrintN(\\\". I win!\\\")\\n computerWins + 1\\n EndSelect\\n playerChoiceHistory(playerChoice) + 1\\n computerChoice = weightedRandomChoice()\\n EndIf\\n Until quit\\n\\n Print(#CRLF$ + \\\"You chose: \\\")\\n For i = 0 To #numChoices - 1\\n Print(choices(i) + \\\" \\\" + StrF(playerChoiceHistory(i) * 100 / gameCount, 1) + \\\"%; \\\")\\n Next\\n PrintN(\\\"\\\")\\n PrintN(\\\"You won \\\" + Str(playerWins) + \\\", and I won \\\" + Str(computerWins) + \\\". There were \\\" + Str(draw) + \\\" draws.\\\")\\n PrintN(\\\"Thanks for playing!\\\")\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\"): Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"from random import choice\\n\\nrules = {'rock': 'paper', 'scissors': 'rock', 'paper': 'scissors'}\\nprevious = ['rock', 'paper', 'scissors']\\n\\nwhile True:\\n human = input('\\\\nchoose your weapon: ')\\n computer = rules[choice(previous)] # choose the weapon which beats a randomly chosen weapon from \\\"previous\\\"\\n\\n if human in ('quit', 'exit'): break\\n\\n elif human in rules:\\n previous.append(human)\\n print('the computer played', computer, end='; ')\\n\\n if rules[computer] == human: # if what beats the computer's choice is the human's choice...\\n print('yay you win!')\\n elif rules[human] == computer: # if what beats the human's choice is the computer's choice...\\n print('the computer beat you... :(')\\n else: print(\\\"it's a tie!\\\")\\n\\n else: print(\\\"that's not a valid choice\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from random import randint\\n\\nhands = ['rock', 'scissors', 'paper']; judge = ['its a tie!', 'the computer beat you... :(', 'yay you win!']\\nwhile True:\\n try:\\n YOU = hands.index(input('Choose your weapon: ')) # YOU = hands.index(raw_input('Choose your weapon: ')) If you use Python2.7\\n except ValueError:\\n break\\n NPC = randint(0, 2)\\n print('The computer played ' + hands[NPC] + '; ' + judge[YOU-NPC])\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ 0 ] is rock ( --> n )\\n [ 1 ] is paper ( --> n )\\n [ 2 ] is scissor ( --> n )\\n\\n [ $ \\\"Choose rock, paper or scissors: \\\"\\n input cr\\n trim reverse trim reverse\\n $ \\\"\\\" swap witheach [ lower join ]\\n dup $ \\\"rock\\\" = iff\\n [ drop rock ] done\\n dup $ \\\"paper\\\" = iff\\n [ drop paper ] done\\n $ \\\"scissors\\\" = iff\\n scissor done\\n again ] is player ( --> n )\\n\\n [ stack 1 ] is rocks ( --> s )\\n [ stack 1 ] is papers ( --> s )\\n [ stack 1 ] is scissors ( --> s )\\n\\n [ 1 swap\\n [ table rocks papers scissors ]\\n do tally ] is notechoice ( n --> )\\n\\n [ 0 ' [ rocks papers scissors ]\\n witheach [ share + ]\\n random\\n dup rocks share < iff\\n [ drop paper ] done\\n rocks share -\\n papers share < iff\\n scissor done\\n rock ] is computer ( --> n )\\n\\n [ say \\\"Computer chose \\\"\\n [ table rock paper scissors ]\\n echo say \\\".\\\" cr ] is echomove ( n --> )\\n\\n [ [ table\\n [ table 0 1 2 ]\\n [ table 2 0 1 ]\\n [ table 1 2 0 ] ] do ] is result ( n n --> n )\\n\\n [ [ table\\n $ \\\"It's a draw.\\\"\\n $ \\\"Computer wins.\\\"\\n $ \\\"Player wins.\\\" ]\\n do echo$ cr cr ] is announce ( n --> )\\n\\n [ stack 0 ] is draws ( --> s )\\n [ stack 0 ] is cwins ( --> s )\\n [ stack 0 ] is pwins ( --> s )\\n\\n [ [ table draws cwins pwins ]\\n 1 swap tally ] is keepscore ( n --> )\\n\\n [ say \\\"Computer: \\\" cwins share echo\\n say \\\" Player: \\\" pwins share echo\\n say \\\" Draws: \\\" draws share echo\\n cr cr ] is scoreboard ( --> )\\n\\n [ ' [ rocks papers scissors ]\\n witheach [ 1 swap replace ]\\n ' [ draws cwins pwins ]\\n witheach [ 0 swap replace ] ] is initialise ( --> )\\n\\n [ 0\\n [ drop\\n $ \\\"How many games? \\\" input\\n trim reverse trim reverse\\n $->n until ]\\n cr ] is games ( --> n )\\n\\n [ initialise\\n games times\\n [ computer\\n player dup notechoice\\n over echomove\\n result dup announce\\n keepscore\\n scoreboard ] ] is play ( --> )\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"play <- function()\\n{\\n bias <- c(r = 1, p = 1, s = 1)\\n repeat\\n {\\n playerChoice <- readline(prompt = \\\"Rock (r), Paper (p), Scissors (s), or Quit (q)? \\\")\\n if(playerChoice == \\\"q\\\") break\\n rps <- c(Rock = \\\"r\\\", Paper = \\\"p\\\", Scissors = \\\"s\\\")\\n if(!playerChoice %in% rps) next\\n compChoice <- sample(rps, 1, prob = bias / sum(bias))\\n cat(\\\"I choose\\\", names(compChoice), \\\"\\\\n\\\",\\n c(\\\"We draw!\\\", \\\"I win!\\\", \\\"I lose!\\\")[1 + (which(compChoice == rps) - which(playerChoice == rps)) %% 3], \\\"\\\\n\\\")\\n bias <- bias + (playerChoice == c(\\\"s\\\", \\\"r\\\", \\\"p\\\"))\\n }\\n}\\nplay()\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(require math)\\n\\n(define history (make-hash '((paper . 1) (scissors . 1) (rock . 1))))\\n(define total 3)\\n\\n(define (update-history! human-choice)\\n (set! total (+ total 1))\\n (hash-update! history human-choice add1 0))\\n\\n(define (pick-one)\\n (sample\\n (discrete-dist '(paper scissors rock)\\n (map (λ (x) (hash-ref history x))\\n '(scissors paper rock)))))\\n\\n(define (find-winner computer human)\\n (define order '(scissors paper rock scissors))\\n (cond\\n [(eq? computer human) 'none]\\n [(eq? (second (member computer order)) human) 'computer]\\n [ 'human]))\\n\\n(define (game-loop)\\n (define computer-choice (pick-one))\\n (define human-choice (read))\\n (define winner (find-winner computer-choice human-choice))\\n (update-history! human-choice)\\n (displayln (~a \\\"Computer picked \\\" computer-choice \\\", \\\"\\n \\\"human picked \\\" human-choice \\\", \\\"\\n winner \\\" wins.\\\"))\\n (game-loop))\\n\\n(game-loop)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my %vs = (\\n options => [<Rock Paper Scissors>],\\n ro => {\\n ro => [ 2, '' ],\\n pa => [ 1, 'Paper covers Rock: ' ],\\n sc => [ 0, 'Rock smashes Scissors: ' ]\\n },\\n pa => {\\n ro => [ 0, 'Paper covers Rock: ' ],\\n pa => [ 2, '' ],\\n sc => [ 1, 'Scissors cut Paper: ' ]\\n },\\n sc => {\\n ro => [ 1, 'Rock smashes Scissors: '],\\n pa => [ 0, 'Scissors cut Paper: ' ],\\n sc => [ 2, '' ]\\n }\\n);\\n\\nmy %choices = %vs<options>.map({; $_.substr(0,2).lc => $_ });\\nmy $keys = %choices.keys.join('|');\\nmy $prompt = %vs<options>.map({$_.subst(/(\\\\w\\\\w)/, -> $/ {\\\"[$0]\\\"})}).join(' ')~\\\"? \\\";\\nmy %weight = %choices.keys »=>» 1;\\n\\nmy @stats = 0,0,0;\\nmy $round;\\n\\nwhile my $player = (prompt \\\"Round {++$round}: \\\" ~ $prompt).lc {\\n $player.=substr(0,2);\\n say 'Invalid choice, try again.' and $round-- and next\\n unless $player.chars == 2 and $player ~~ /<$keys>/;\\n my $computer = (flat %weight.keys.map( { $_ xx %weight{$_} } )).pick;\\n %weight{$_.key}++ for %vs{$player}.grep( { $_.value[0] == 1 } );\\n my $result = %vs{$player}{$computer}[0];\\n @stats[$result]++;\\n say \\\"You chose %choices{$player}, Computer chose %choices{$computer}.\\\";\\n print %vs{$player}{$computer}[1];\\n print ( 'You win!', 'You Lose!','Tie.' )[$result];\\n say \\\" - (W:{@stats[0]} L:{@stats[1]} T:{@stats[2]})\\\\n\\\",\\n};\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"my %vs = (\\n options => [<Rock Paper Scissors Lizard Spock>],\\n ro => {\\n ro => [ 2, '' ],\\n pa => [ 1, 'Paper covers Rock: ' ],\\n sc => [ 0, 'Rock smashes Scissors: ' ],\\n li => [ 0, 'Rock crushes Lizard: ' ],\\n sp => [ 1, 'Spock vaporizes Rock: ' ]\\n },\\n pa => {\\n ro => [ 0, 'Paper covers Rock: ' ],\\n pa => [ 2, '' ],\\n sc => [ 1, 'Scissors cut Paper: ' ],\\n li => [ 1, 'Lizard eats Paper: ' ],\\n sp => [ 0, 'Paper disproves Spock: ' ]\\n },\\n sc => {\\n ro => [ 1, 'Rock smashes Scissors: ' ],\\n pa => [ 0, 'Scissors cut Paper: ' ],\\n sc => [ 2, '' ],\\n li => [ 0, 'Scissors decapitate Lizard: '],\\n sp => [ 1, 'Spock smashes Scissors: ' ]\\n },\\n li => {\\n ro => [ 1, 'Rock crushes Lizard: ' ],\\n pa => [ 0, 'Lizard eats Paper: ' ],\\n sc => [ 1, 'Scissors decapitate Lizard: '],\\n li => [ 2, '' ],\\n sp => [ 0, 'Lizard poisons Spock: ' ]\\n },\\n sp => {\\n ro => [ 0, 'Spock vaporizes Rock: ' ],\\n pa => [ 1, 'Paper disproves Spock: ' ],\\n sc => [ 0, 'Spock smashes Scissors: ' ],\\n li => [ 1, 'Lizard poisons Spock: ' ],\\n sp => [ 2, '' ]\\n }\\n);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"import Prelude;\\n\\nrel[str, str] whatbeats = {<\\\"Rock\\\", \\\"Scissors\\\">, <\\\"Scissors\\\", \\\"Paper\\\">, <\\\"Paper\\\", \\\"Rock\\\">};\\n\\nlist[str] ComputerChoices = [\\\"Rock\\\", \\\"Paper\\\", \\\"Scissors\\\"];\\n\\nstr CheckWinner(a, b){\\n\\tif(b == getOneFrom(whatbeats[a]))\\n\\t\\treturn a;\\n\\telseif(a == getOneFrom(whatbeats[b]))\\n\\t\\treturn b;\\n\\telse return \\\"Nobody\\\";\\n}\\n\\npublic str RPS(human){\\n\\tcomputer = getOneFrom(ComputerChoices);\\n\\tx = if(human == \\\"Rock\\\") \\\"Paper\\\"; elseif(human == \\\"Paper\\\") \\\"Scissors\\\"; else \\\"Rock\\\";\\n\\tComputerChoices += x;\\n\\treturn \\\"Computer played <computer>. <CheckWinner(human, computer)> wins!\\\";\\n}\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"rascal>RPS(\\\"Rock\\\")\\nstr: \\\"Computer played Rock. Nobody wins!\\\"\\n\\nrascal>RPS(\\\"Rock\\\")\\nstr: \\\"Computer played Rock. Nobody wins!\\\"\\n\\nrascal>RPS(\\\"Rock\\\")\\nstr: \\\"Computer played Scissors. Rock wins!\\\"\\n\\nrascal>RPS(\\\"Rock\\\")\\nstr: \\\"Computer played Paper. Paper wins!\\\"\\n\\nrascal>RPS(\\\"Rock\\\")\\nstr: \\\"Computer played Paper. Paper wins!\\\"\\n\\nrascal>RPS(\\\"Rock\\\")\\nstr: \\\"Computer played Paper. Paper wins!\\\"\\n\\nrascal>RPS(\\\"Rock\\\")\\nstr: \\\"Computer played Paper. Paper wins!\\\"\\n\\nrascal>RPS(\\\"Rock\\\")\\nstr: \\\"Computer played Rock. Nobody wins!\\\"\\n\\nrascal>RPS(\\\"Rock\\\")\\nstr: \\\"Computer played Paper. Paper wins!\\\"\\n\\nrascal>RPS(\\\"Rock\\\")\\nstr: \\\"Computer played Paper. Paper wins!\\\"\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"Red [Purpose: \\\"Implement a rock-paper-scissors game with weighted probability\\\"]\\n\\nprior: rejoin choices: [\\\"r\\\" \\\"p\\\" \\\"s\\\"]\\n\\nwhile [\\n\\tfind choices pchoice: ask \\\"choose rock: r, paper: p, or scissors: s^/\\\"\\n] [\\t\\n\\tprint [\\\"AI Draws:\\\" cchoice: random/only prior]\\n\\tcwin: select \\\"rpsr\\\" pchoice\\n\\tclose: select \\\"rspr\\\" pchoice\\n\\t\\n\\tprint case [\\n\\t\\tpchoice = cchoice [\\\"tie\\\"]\\n\\t\\tcchoice = cwin [\\\"you lose\\\"]\\n\\t\\t'else [\\\"you win\\\"]\\n\\t]\\n\\t\\n\\tappend prior cwin\\t\\t;adds what would have beaten player\\n\\tremove find prior close\\t\\t;removes what would have lost to player\\n]\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"/*REXX program plays rock─paper─scissors with a human; tracks what human tends to use. */\\n!= '────────'; err=! \\\"***error***\\\"; @.=0 /*some constants for this program. */\\nprompt= ! 'Please enter one of: Rock Paper Scissors (or Quit)'\\n$.p= 'paper' ; $.s= \\\"scissors\\\"; $.r= 'rock' /*list of the choices in this program. */\\nt.p= $.r ; t.s= $.p ; t.r= $.s /*thingys that beats stuff. */\\nw.p= $.s ; w.s= $.r ; w.r= $.p /*stuff \\\" \\\" thingys. */\\nb.p= 'covers'; b.s= \\\"cuts\\\" ; b.r= 'breaks' /*verbs: how the choice wins. */\\n\\n do forever; say; say prompt; say /*prompt the CBLF; then get a response.*/\\n c= word($.p $.s $.r, random(1, 3) ) /*choose the computer's first pick. */\\n m= max(@.r, @.p, @.s); c= w.r /*prepare to examine the choice history*/\\n if @.p==m then c= w.p /*emulate JC's: The Amazing Karnac. */\\n if @.s==m then c= w.s /* \\\" \\\" \\\" \\\" \\\" */\\n c1= left(c, 1) /*C1 is used for faster comparing. */\\n parse pull u; a= strip(u) /*get the CBLF's choice/pick (answer). */\\n upper a c1 ; a1= left(a, 1) /*uppercase choices, get 1st character.*/\\n ok= 0 /*indicate answer isn't OK (so far). */\\n select /*process/verify the CBLF's choice. */\\n when words(u)==0 then say err 'nothing entered'\\n when words(u)>1 then say err 'too many choices: ' u\\n when abbrev('QUIT', a) then do; say ! \\\"quitting.\\\"; exit; end\\n when abbrev('ROCK', a) |,\\n abbrev('PAPER', a) |,\\n abbrev('SCISSORS',a) then ok=1 /*Yes? This is a valid answer by CBLF.*/\\n otherwise say err 'you entered a bad choice: ' u\\n end /*select*/\\n\\n if \\\\ok then iterate /*answer ¬OK? Then get another choice.*/\\n @.a1= @.a1 + 1 /*keep a history of the CBLF's choices.*/\\n say ! 'computer chose: ' c\\n if a1== c1 then do; say ! 'draw.'; iterate; end\\n if $.a1==t.c1 then say ! 'the computer wins. ' ! $.c1 b.c1 $.a1\\n else say ! 'you win! ' ! $.a1 b.a1 $.c1\\n end /*forever*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX pgm plays rock─paper─scissors─lizard─Spock with human; tracks human usage trend. */\\n!= '────────'; err=! \\\"***error***\\\"; @.=0 /*some constants for this REXX program.*/\\nprompt=! 'Please enter one of: Rock Paper SCissors Lizard SPock (Vulcan) (or Quit)'\\n$.p='paper' ; $.s=\\\"scissors\\\" ; $.r='rock' ; $.L=\\\"lizard\\\" ; $.v='Spock' /*names of the thingys*/\\nt.p= $.r $.v ; t.s= $.p $.L ; t.r= $.s $.L ; t.L= $.p $.v ; t.v= $.r $.s /*thingys beats stuff.*/\\nw.p= $.L $.s ; w.s= $.v $.r ; w.r= $.v $.p ; w.L= $.r $.s ; w.v= $.L $.p /*stuff beats thingys.*/\\nb.p='covers disproves'; b.s=\\\"cuts decapitates\\\"; b.r='breaks crushes'; b.L=\\\"eats poisons\\\"; b.v='vaporizes smashes' /*how the choice wins.*/\\nwhom.1= ! 'the computer wins. ' !; whom.2= ! \\\"you win! \\\" !; win= words(t. p)\\n\\n do forever; say; say prompt; say /*prompt CBLF; then get a response. */\\n c= word($.p $.s $.r $.L $.v, random(1, 5) ) /*the computer's first choice/pick. */\\n m= max(@.r, @.p, @.s, @.L, @.v) /*used in examining CBLF's history. */\\n if @.p==m then c= word(w.p, random(1, 2) ) /*emulate JC's The Amazing Karnac. */\\n if @.s==m then c= word(w.s, random(1, 2) ) /* \\\" \\\" \\\" \\\" \\\" */\\n if @.r==m then c= word(w.r, random(1, 2) ) /* \\\" \\\" \\\" \\\" \\\" */\\n if @.L==m then c= word(w.L, random(1, 2) ) /* \\\" \\\" \\\" \\\" \\\" */\\n if @.v==m then c= word(w.v, random(1, 2) ) /* \\\" \\\" \\\" \\\" \\\" */\\n c1= left(c, 1) /*C1 is used for faster comparing. */\\n parse pull u; a= strip(u) /*obtain the CBLF's choice/pick. */\\n upper a c1 ; a1= left(a, 1) /*uppercase the choices, get 1st char. */\\n ok=0 /*indicate answer isn't OK (so far). */\\n select /* [↓] process the CBLF's choice/pick.*/\\n when words(u)==0 then say err 'nothing entered.'\\n when words(u)>1 then say err 'too many choices: ' u\\n when abbrev('QUIT', a) then do; say ! 'quitting.'; exit; end\\n when abbrev('LIZARD', a) |,\\n abbrev('ROCK', a) |,\\n abbrev('PAPER', a) |,\\n abbrev('VULCAN', a) |,\\n abbrev('SPOCK', a,2) |,\\n abbrev('SCISSORS',a,2) then ok=1 /*it's a valid choice for the human. */\\n otherwise say err 'you entered a bad choice: ' u\\n end /*select*/\\n\\n if \\\\ok then iterate /*answer ¬OK? Then get another choice.*/\\n @.a1= @.a1 + 1 /*keep a history of the CBLF's choices.*/\\n say ! 'computer chose: ' c\\n if a1==c1 then say ! 'draw.' /*Oh rats! The contest ended up a draw*/\\n else do who=1 for 2 /*either the computer or the CBLF won. */\\n if who==2 then parse value a1 c1 with c1 a1\\n do j=1 for win /*see who won. */\\n if $.a1 \\\\== word(t.c1, j) then iterate /*not this 'un. */\\n say whom.who $.c1 word(b.c1, j) $.a1 /*notify winner.*/\\n leave /*leave J loop.*/\\n end /*j*/\\n end /*who*/\\n end /*forever*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Rock-paper-scissors\\n\\nload \\\"stdlib.ring\\\"\\nload \\\"guilib.ring\\\"\\n\\nwidth \\t\\t= 200\\nheight \\t\\t= 200\\n\\nmyChose \\t= 1\\ncompChose \\t= 1\\nnextPlayer \\t= 1\\nmyScore \\t= 0\\ncompScore \\t= 0\\nC_FONTSIZE \\t= 15\\n\\nC_ROCK \\t\\t= \\\"images/rock.jpg\\\"\\nC_PAPER \\t= \\\"images/paper.jpg\\\"\\nC_SCISSORS \\t= \\\"images/scissors.jpg\\\"\\n\\nChoseList \\t= [C_ROCK,C_PAPER,C_SCISSORS]\\n\\nButton \\t\\t= list(len(ChoseList))\\n\\napp = new QApp\\n{\\n\\n\\tStyleFusion()\\n\\n\\twin = new QWidget() {\\n\\n\\t\\tsetWindowTitle('Stone Paper Scissors Game')\\n\\t\\tsetWinIcon(self,C_ROCK)\\n\\t\\tsetStyleSheet(\\\"background-color:cyan;\\\")\\n\\t\\tsetWindowFlags(Qt_Window | Qt_WindowTitleHint | Qt_WindowCloseButtonHint | Qt_CustomizeWindowHint)\\n\\t\\treSize(900,600)\\n\\t\\twinheight \\t= height()\\n\\t\\tfontSize\\t= 8 + (winheight / 100)\\n\\n\\t\\tfor Col = 1 to len(ChoseList)\\n\\t\\t\\tButton[Col] = new QPushButton(win) {\\n\\t\\t\\t\\tx = 150+(Col-1)*height\\n\\t\\t\\t\\tsetgeometry(x,35,width,height)\\n\\t\\t\\t\\tsetStyleSheet(\\\"background-color:white;\\\")\\n\\t\\t\\t\\tseticon(new qicon(new qpixmap(ChoseList[Col])))\\n\\t\\t\\t\\tsetIconSize(new qSize(200,200))\\n\\t\\t\\t\\tsetclickevent(\\\"ButtonPress(\\\" + string(Col) + \\\")\\\")\\n\\t\\t\\t\\tsetSizePolicy(1,1)\\n\\t\\t\\t}\\t\\t\\t\\t\\n\\t\\tnext\\n\\n\\t\\tlabelMyChose = new QLabel(win) {\\n\\t\\t\\tsetgeometry(200,250,150,30)\\n\\t\\t\\tsetFont(new qFont(\\\"Verdana\\\",C_FONTSIZE,50,0))\\n\\t\\t\\tsettext(\\\"My Chose:\\\")\\n\\t\\t}\\n\\n\\t\\tlabelCompChose = new QLabel(win) {\\n\\t\\t\\tsetgeometry(580,250,150,30)\\n\\t\\t\\tsetFont(new qFont(\\\"Verdana\\\",C_FONTSIZE,50,0))\\n\\t\\t\\tsettext(\\\"Comp Chose:\\\")\\n\\t\\t}\\n\\n\\t\\tlabelScoreEnd = new QLabel(win) {\\n\\t\\t\\tsetgeometry(0,510,win.width(),30)\\n\\t\\t\\tsetAlignment(Qt_AlignHCenter | Qt_AlignVCenter)\\n\\t\\t\\tsetFont(new qFont(\\\"Verdana\\\",C_FONTSIZE,50,0))\\n\\t\\t\\tsettext(\\\"\\\")\\n\\t\\t}\\n\\n\\t\\tbtnMyChose = new QPushButton(win) {\\n\\t\\t\\tsetgeometry(150,300,width,height)\\n\\t\\t\\tsetStyleSheet(\\\"background-color:white;\\\")\\n\\t\\t}\\n\\n\\t\\tbtnCompChose = new QPushButton(win) {\\n\\t\\t\\tsetgeometry(550,300,width,height)\\n\\t\\t\\tsetStyleSheet(\\\"background-color:white;\\\")\\n\\t\\t}\\n\\n\\t\\tbtnNewGame = new QPushButton(win) {\\n\\t\\t\\tsetgeometry(170,550,150,40)\\n\\t\\t\\tsetFont(new qFont(\\\"Verdana\\\",C_FONTSIZE,50,0))\\n\\t\\t\\tsetclickevent(\\\"NewGame()\\\")\\n\\t\\t\\tsettext(\\\"New Game\\\")\\n\\t\\t}\\n\\n\\t\\tbtnExit = new QPushButton(win) {\\n\\t\\t\\tsetgeometry(580,550,150,40)\\n\\t\\t\\tsetFont(new qFont(\\\"Verdana\\\",C_FONTSIZE,50,0))\\n\\t\\t\\tsetclickevent(\\\"Close()\\\")\\n\\t\\t\\tsettext(\\\"Exit\\\")\\n\\t\\t}\\n\\n\\t\\tlabelMyScore = new QLabel(win) {\\n\\t\\t\\tsetgeometry(170,0,100,30)\\n\\t\\t\\tsetFont(new qFont(\\\"Verdana\\\",C_FONTSIZE,50,0))\\n\\t\\t\\tsettext(\\\"My Score: \\\")\\n\\t\\t}\\n\\n\\t\\tlabelMyScoreSum = new QLabel(win) {\\n\\t\\t\\tsetgeometry(300,0,100,30)\\n\\t\\t\\tsetFont(new qFont(\\\"Verdana\\\",C_FONTSIZE,50,0))\\n\\t\\t\\tsettext(\\\"\\\")\\n\\t\\t}\\n\\n\\t\\tlabelCompScore = new QLabel(win) {\\n\\t\\t\\tsetgeometry(580,0,130,30)\\n\\t\\t\\tsetFont(new qFont(\\\"Verdana\\\",C_FONTSIZE,50,0))\\n\\t\\t\\tsettext(\\\"Comp Score: \\\")\\n\\t\\t}\\n\\n\\t\\tlabelCompScoreSum = new QLabel(win) {\\n\\t\\t\\tsetgeometry(730,0,100,30)\\n\\t\\t\\tsetFont(new qFont(\\\"Verdana\\\",C_FONTSIZE,50,0))\\n\\t\\t\\tsettext(\\\"\\\")\\n\\t\\t}\\n\\n\\t\\tshow()\\n\\n\\t}\\n\\n\\texec()\\n\\n}\\n\\nfunc ButtonPress Col\\n\\n\\tif nextPlayer = 1\\n\\t\\tmyChose = Col\\n\\t\\tbtnMyChose {\\n\\t\\t\\tseticon(new qicon(new qpixmap(ChoseList[Col])))\\n\\t\\t\\tsetIconSize(new qSize(width,height))\\n\\t\\t}\\n\\t\\tnextPlayer = 2\\n\\t\\tcompChose()\\n\\tok\\n\\nfunc compChose\\n\\n\\trndChose = random(len(ChoseList)-1) + 1\\n\\tcompChose = rndChose\\n\\tbtnCompChose {\\n\\t\\tseticon(new qicon(new qpixmap(ChoseList[compChose])))\\n\\t\\tsetIconSize(new qSize(width,height))\\n\\t}\\n\\tnextPlayer = 1\\n\\tResult()\\n\\n\\nfunc Result\\n\\n\\tif (myChose = compChose)\\n\\t\\tlabelScoreEnd.settext(\\\"Draw!\\\")\\n\\tok\\n\\tif (myChose = 1) and (compChose = 2)\\n\\t\\tlabelScoreEnd.settext(\\\"Computer Win!\\\")\\n\\t\\tcompScore = compScore + 1\\n\\t\\tlabelCompScoreSum.settext(string(compScore))\\n\\tok\\n\\tif (myChose = 1) and (compChose = 3)\\n\\t\\tlabelScoreEnd.settext(\\\"I Win!\\\")\\n\\t\\tmyScore = myScore + 1\\n\\t\\tlabelMyScoreSum.settext(string(myScore))\\n\\tok\\n\\tif (myChose = 2) and (compChose = 3)\\n\\t\\tlabelScoreEnd.settext(\\\"Computer Win!\\\")\\n\\t\\tcompScore = compScore + 1\\n\\t\\tlabelCompScoreSum.settext(string(compScore))\\n\\tok\\t\\n\\tif (myChose = 2) and (compChose = 1)\\n\\t\\tlabelScoreEnd.settext(\\\"I Win!\\\")\\n\\t\\tmyScore = myScore + 1\\n\\t\\tlabelMyScoreSum.settext(string(myScore))\\n\\tok\\n\\tif (myChose = 3) and (compChose = 1)\\n\\t\\tlabelScoreEnd.settext(\\\"Computer Win!\\\")\\n\\t\\tcompScore = compScore + 1\\n\\t\\tlabelCompScoreSum.settext(string(compScore))\\n\\tok\\n\\tif (myChose = 3) and (compChose = 2)\\n\\t\\tlabelScoreEnd.settext(\\\"I Win!\\\")\\n\\t\\tmyScore = myScore + 1\\n\\t\\tlabelMyScoreSum.settext(string(myScore))\\n\\tok\\n\\nfunc NewGame\\n\\n\\tnextPlayer \\t= 1\\n\\tmyScore \\t= 0\\n\\tcompScore \\t= 0\\n\\n\\tbtnMyChose {\\n\\t\\tseticon(new qicon(new qpixmap(\\\"\\\")))\\n\\t\\tsetIconSize(new qSize(200,200))\\n\\t}\\n\\n\\tbtnCompChose {\\n\\t\\tseticon(new qicon(new qpixmap(\\\"\\\")))\\n\\t\\tsetIconSize(new qSize(200,200))\\n\\t}\\n\\n\\tlabelScoreEnd.settext(\\\"\\\")\\n\\tlabelMyScoreSum.settext(\\\"0\\\")\\n\\tlabelCompScoreSum.settext(\\\"0\\\")\\n\\n\\nfunc Close\\n\\n\\twin.close()\\n\\tapp.quit()\\t\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"class RockPaperScissorsGame\\n CHOICES = %w[rock paper scissors quit]\\n BEATS = {\\n 'rock' => 'paper',\\n 'paper' => 'scissors',\\n 'scissors' => 'rock',\\n }\\n\\n def initialize()\\n @plays = {\\n 'rock' => 1,\\n 'paper' => 1,\\n 'scissors' => 1,\\n }\\n @score = [0, 0, 0] # [0]:Human wins, [1]:Computer wins, [2]:draw\\n\\n play\\n end\\n\\n def humanPlay\\n loop do\\n print \\\"\\\\nYour choice: #{CHOICES}? \\\"\\n answer = STDIN.gets.strip.downcase\\n next if answer.empty?\\n idx = CHOICES.find_index {|choice| choice.match(/^#{answer}/)}\\n return CHOICES[idx] if idx\\n puts \\\"invalid answer, try again\\\"\\n end\\n end\\n\\n def computerPlay\\n total = @plays.values.reduce(:+)\\n r = rand(total) + 1\\n sum = 0\\n CHOICES.each do |choice|\\n sum += @plays[choice]\\n return BEATS[choice] if r <= sum\\n end\\n end\\n\\n def play\\n loop do\\n h = humanPlay\\n break if h == \\\"quit\\\"\\n c = computerPlay\\n print \\\"H: #{h}, C: #{c} => \\\"\\n\\n # only update the human player's history after the computer has chosen\\n @plays[h] += 1\\n\\n if h == c\\n puts \\\"draw\\\"\\n @score[2] += 1\\n elsif h == BEATS[c]\\n puts \\\"Human wins\\\"\\n @score[0] += 1\\n else\\n puts \\\"Computer wins\\\"\\n @score[1] += 1\\n end\\n puts \\\"score: human=%d, computer=%d, draw=%d\\\" % [*@score]\\n end\\n @plays.each_key{|k| @plays[k] -= 1}\\n puts \\\"\\\\nhumans chose #{@plays}\\\"\\n end\\nend\\n\\nRockPaperScissorsGame.new\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"pri$ = \\\"RSPR\\\"\\nrps$ = \\\"Rock,Paper,Sissors\\\"\\n[loop]\\nbutton #r, \\\"Rock\\\", [r]\\nbutton #p, \\\"Paper\\\", [p]\\nbutton #s, \\\"Scissors\\\",[s]\\nbutton #q, \\\"Quit\\\", [q]\\nwait\\n[r] y = 1 :goto [me]\\n[p] y = 2 :goto [me]\\n[s] y = 3\\n[me]\\ncls\\ny$ = word$(rps$,y,\\\",\\\")\\nm = int((rnd(0) * 2) + 1)\\nm$ = word$(rps$,m,\\\",\\\")\\nprint chr$(10);\\\"You Chose:\\\";y$;\\\" I chose:\\\";m$\\nyp = instr(pri$,left$(y$,1))\\nmp = instr(pri$,left$(m$,1))\\nif yp = 1 and mp = 3 then mp = 0\\nif mp = 1 and yp = 3 then yp = 0\\nif yp < mp then print \\\"You win\\\"\\nif yp = mp then print \\\"Tie\\\"\\nif yp > mp then print \\\"I win\\\"\\ngoto [loop]\\nwait\\n\\n[q] cls\\nprint \\\"Good Bye! I enjoyed the game\\\"\\nend\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"extern crate rand;\\n#[macro_use]\\nextern crate rand_derive;\\n\\nuse std::io;\\nuse rand::Rng;\\nuse Choice::*;\\n\\n#[derive(PartialEq, Clone, Copy, Rand, Debug)]\\nenum Choice {\\n Rock,\\n Paper,\\n Scissors,\\n}\\n\\nfn beats(c1: Choice, c2: Choice) -> bool {\\n (c1 == Rock && c2 == Scissors) || (c1 == Scissors && c2 == Paper) || (c1 == Paper && c2 == Rock)\\n}\\n\\nfn ai_move<R: Rng>(rng: &mut R, v: [usize; 3]) -> Choice {\\n // weighted random choice, a dynamic version of `rand::distributions::WeightedChoice`\\n let rand = rng.gen_range(0, v[0] + v[1] + v[2]);\\n if rand < v[0] {\\n Paper\\n } else if rand < v[0] + v[1] {\\n Scissors\\n } else {\\n Rock\\n }\\n}\\n\\nfn main() {\\n let mut rng = rand::thread_rng();\\n\\n println!(\\\"Rock, paper, scissors!\\\");\\n let mut ai_choice: Choice = rng.gen();\\n let mut ucf = [0, 0, 0]; // user choice frequency\\n let mut score = [0, 0];\\n\\n loop {\\n println!(\\\"Please input your move: 'r', 'p' or 's'. Type 'q' to quit\\\");\\n\\n let mut input = String::new();\\n io::stdin()\\n .read_line(&mut input)\\n .expect(\\\"failed to read line\\\");\\n let u_choice = match input.to_lowercase().trim() {\\n s if s.starts_with('r') => {\\n ucf[0] += 1;\\n Rock\\n }\\n s if s.starts_with('p') => {\\n ucf[1] += 1;\\n Paper\\n }\\n s if s.starts_with('s') => {\\n ucf[2] += 1;\\n Scissors\\n }\\n s if s.starts_with('q') => break,\\n _ => {\\n println!(\\\"Please enter a correct choice!\\\");\\n continue;\\n }\\n };\\n println!(\\\"You chose {:?}, I chose {:?}.\\\", u_choice, ai_choice);\\n if beats(u_choice, ai_choice) {\\n score[0] += 1;\\n println!(\\\"You win!\\\");\\n } else if u_choice == ai_choice {\\n println!(\\\"It's a tie!\\\");\\n } else {\\n score[1] += 1;\\n println!(\\\"I win!\\\");\\n }\\n println!(\\\"-Score: You {}, Me {}\\\", score[0], score[1]);\\n\\n // only after the 1st iteration the AI knows the stats and can make\\n // its weighted random move\\n ai_choice = ai_move(&mut rng, ucf);\\n }\\n println!(\\\"Thank you for the game!\\\");\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object RockPaperScissors extends App {\\n import scala.collection.mutable.LinkedHashMap\\n def play(beats: LinkedHashMap[Symbol,Set[Symbol]], played: scala.collection.Map[Symbol,Int]) {\\n val h = readLine(s\\\"\\\"\\\"Your move (${beats.keys mkString \\\", \\\"}): \\\"\\\"\\\") match {\\n case null => println; return\\n case \\\"\\\" => return\\n case s => Symbol(s)\\n }\\n beats get h match {\\n case Some(losers) =>\\n def weighted(todo: Iterator[(Symbol,Int)], rand: Int, accum: Int = 0): Symbol = todo.next match {\\n case (s, i) if rand <= (accum + i) => s\\n case (_, i) => weighted(todo, rand, accum + i)\\n }\\n val c = weighted(played.toIterator, 1 + scala.util.Random.nextInt(played.values.sum)) match {\\n // choose an opponent that would beat the player's anticipated move\\n case h => beats.find{case (s, l) => l contains h}.getOrElse(beats.head)._1\\n }\\n print(s\\\" My move: $c\\\\n \\\")\\n c match {\\n case c if losers contains c => println(\\\"You won\\\")\\n case c if beats(c) contains h => println(\\\"You lost\\\")\\n case _ => println(\\\"We drew\\\") // or underspecified\\n }\\n case x => println(\\\" Unknown weapon, try again.\\\")\\n }\\n play(beats, played get h match {\\n case None => played\\n case Some(count) => played.updated(h, count + 1)\\n })\\n }\\n\\n def play(beats: LinkedHashMap[Symbol,Set[Symbol]]): Unit =\\n play(beats, beats.mapValues(_ => 1)) // init with uniform probabilities\\n\\n play(LinkedHashMap(\\n 'rock -> Set('lizard, 'scissors),\\n 'paper -> Set('rock, 'spock),\\n 'scissors -> Set('paper, 'lizard),\\n 'lizard -> Set('spock, 'paper),\\n 'spock -> Set('scissors, 'rock)\\n ))\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"object RockPaperScissors extends App {\\n def beats = Map(\\n 'rock -> Set('lizard, 'scissors),\\n 'paper -> Set('rock, 'spock),\\n 'scissors -> Set('paper, 'lizard),\\n 'lizard -> Set('spock, 'paper),\\n 'spock -> Set('scissors, 'rock)\\n )\\n // init with uniform probabilities\\n def initPlayed = beats.mapValues(_ => 1)\\n def input = Symbol(readLine(s\\\"\\\"\\\"Your move (${beats.keys mkString \\\", \\\"}): \\\"\\\"\\\"))\\n def random(max: Int) = scala.util.Random.nextInt(max)\\n def display(text: String) = print(text)\\n\\n def weighted(todo: Iterator[(Symbol,Int)], rand: Int, accum: Int = 0): Symbol = todo.next match {\\n case (s, i) if rand <= (accum + i) => s\\n case (_, i) => weighted(todo, rand, accum + i)\\n }\\n\\n def calcMyMove(random: Int => Int, played: Map[Symbol,Int]) = {\\n weighted(played.toIterator, 1 + random(played.values.sum)) match {\\n // choose an opponent that would beat the player's anticipated move\\n case h => beats.find{case (s, l) => l contains h}.getOrElse(beats.head)._1\\n }\\n }\\n\\n case class Result(text: String, won: Int, lost: Int, drew: Int) {\\n override def toString = s\\\"$text. Won: $won, Lost: $lost, Drew: $drew\\\"\\n }\\n\\n def getResult(userWeapon: Symbol, myMove: Symbol, result: Result) = {\\n if (beats(userWeapon) contains myMove)\\n result.copy(text = \\\"You won\\\", won = result.won + 1)\\n else if (beats(myMove) contains userWeapon)\\n result.copy(text = \\\"You lost\\\", lost = result.lost + 1)\\n else result.copy(text = \\\"We drew\\\", drew = result.drew + 1)\\n }\\n\\n def play(input: => Symbol, display: String => Unit, random: Int => Int)\\n (played: Map[Symbol,Int], result: Result): Result = {\\n val userWeapon = input\\n if (userWeapon != Symbol(\\\"\\\")) {\\n val newResult = if (beats contains userWeapon) {\\n val myMove = calcMyMove(random, played)\\n display(s\\\" My move: $myMove\\\\n \\\")\\n getResult(userWeapon, myMove, result)\\n } else {\\n result.copy(text = \\\" Unknown weapon, try again\\\")\\n }\\n display(newResult + \\\"\\\\n\\\")\\n play(input, display, random)(played get userWeapon match {\\n case None => played\\n case Some(count) => played.updated(userWeapon, count + 1)\\n }, newResult)\\n } else result\\n }\\n\\n override def main(args: Array[String]): Unit =\\n play(input, display, random)(initPlayed, Result(\\\"Start\\\", 0, 0, 0))\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n$ include \\\"keybd.s7i\\\";\\n\\nconst array string: rockPaperScissors is [] (\\\"Rock\\\", \\\"Paper\\\", \\\"Scissors\\\");\\n\\nconst proc: main is func\\n local\\n var char: command is ' ';\\n var integer: user is 0;\\n var integer: comp is 0;\\n begin\\n writeln(\\\"Hello, Welcome to rock-paper-scissors\\\");\\n repeat\\n write(\\\"Please type in 1 for Rock, 2 for Paper, 3 for Scissors, q to quit \\\");\\n flush(OUT);\\n repeat\\n command := lower(getc(KEYBOARD));\\n until command in {'1', '2', '3', 'q'};\\n writeln(command);\\n if command <> 'q' then\\n user := integer parse str(command);\\n comp := rand(1, 3);\\n writeln(\\\"You Played: \\\" <& rockPaperScissors[user]);\\n writeln(\\\"Computer Played: \\\" <& rockPaperScissors[comp]);\\n if comp = user then\\n writeln(\\\"You Tied\\\");\\n elsif succ(comp) = user or user + 2 = comp then\\n writeln(\\\"Yay, You Won!\\\");\\n else\\n writeln(\\\"Sorry, You Lost!\\\");\\n end if;\\n end if;\\n until command = 'q';\\n writeln(\\\"Goodbye! Thanks for playing!\\\");\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"const rps = %w(r p s)\\n\\nconst msg = [\\n \\\"Rock breaks scissors\\\",\\n \\\"Paper covers rock\\\",\\n \\\"Scissors cut paper\\\",\\n]\\n\\nsay <<\\\"EOT\\\"\\n\\\\n>> Rock Paper Scissors <<\\\\n\\n** Enter 'r', 'p', or 's' as your play.\\n** Enter 'q' to exit the game.\\n** Running score shown as <your wins>:<my wins>\\nEOT\\n\\nvar plays = 0\\nvar aScore = 0\\nvar pScore = 0\\nvar pcf = [0,0,0] # pcf = player choice frequency\\nvar aChoice = pick(0..2) # ai choice for first play is completely random\\n\\nloop {\\n var pi = Sys.scanln(\\\"Play: \\\")\\n pi == 'q' && break\\n\\n var pChoice = rps.index(pi)\\n\\n if (pChoice == -1) {\\n STDERR.print(\\\"Invalid input!\\\\n\\\")\\n next\\n }\\n\\n ++pcf[pChoice]\\n ++plays\\n\\n # show result of play\\n \\\">> My play: %-8s\\\".printf(rps[aChoice])\\n\\n given ((aChoice - pChoice + 3) % 3) {\\n when (0) { say \\\"Tie.\\\" }\\n when (1) { \\\"%-*s %s\\\".printlnf(30, msg[aChoice], 'My point'); aScore++ }\\n when (2) { \\\"%-*s %s\\\".printlnf(30, msg[pChoice], 'Your point'); pScore++ }\\n }\\n\\n # show score\\n \\\"%-6s\\\".printf(\\\"%d:%d\\\" % (pScore, aScore))\\n\\n # compute ai choice for next play\\n given (plays.rand.int) { |rn|\\n case (rn < pcf[0]) { aChoice = 1 }\\n case (pcf[0]+pcf[1] > rn) { aChoice = 2 }\\n default { aChoice = 0 }\\n }\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"enum Choice: CaseIterable {\\n case rock\\n case paper\\n case scissors\\n case lizard\\n case spock\\n}\\n\\nextension Choice {\\n var weaknesses: Set<Choice> {\\n switch self {\\n case .rock:\\n return [.paper, .spock]\\n case .paper:\\n return [.scissors, .lizard]\\n case .scissors:\\n return [.rock, .spock]\\n case .lizard:\\n return [.rock, .scissors]\\n case .spock:\\n return [.paper, .lizard]\\n }\\n }\\n}\\n\\nstruct Game {\\n private(set) var history: [(Choice, Choice)] = []\\n private(set) var p1Score: Int = 0\\n private(set) var p2Score: Int = 0\\n\\n mutating func play(_ p1Choice: Choice, against p2Choice: Choice) {\\n history.append((p1Choice, p2Choice))\\n if p2Choice.weaknesses.contains(p1Choice) {\\n p1Score += 1\\n } else if p1Choice.weaknesses.contains(p2Choice) {\\n p2Score += 1\\n }\\n }\\n}\\n\\nfunc aiChoice(for game: Game) -> Choice {\\n if let weightedWeekness = game.history.flatMap({ $0.0.weaknesses }).randomElement() {\\n return weightedWeekness\\n } else {\\n // If history is empty, return random Choice\\n return Choice.allCases.randomElement()!\\n }\\n}\\n\\nvar game = Game()\\nprint(\\\"Type your choice to play a round, or 'q' to quit\\\")\\nloop: while true {\\n let choice: Choice\\n switch readLine().map({ $0.lowercased() }) {\\n case \\\"r\\\", \\\"rock\\\":\\n choice = .rock\\n case \\\"p\\\", \\\"paper\\\":\\n choice = .paper\\n case \\\"scissors\\\":\\n choice = .scissors\\n case \\\"l\\\", \\\"lizard\\\":\\n choice = .lizard\\n case \\\"spock\\\":\\n choice = .spock\\n case \\\"q\\\", \\\"quit\\\", \\\"exit\\\":\\n break loop\\n case \\\"s\\\":\\n print(\\\"Do you mean Spock, or scissors?\\\")\\n continue\\n default:\\n print(\\\"Unknown choice. Type 'q' to quit\\\")\\n continue\\n }\\n let p2Choice = aiChoice(for: game)\\n print(\\\"You played \\\\(choice) against \\\\(p2Choice)\\\")\\n game.play(choice, against: p2Choice)\\n print(\\\"Current score: \\\\(game.p1Score) : \\\\(game.p2Score)\\\")\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"package require Tcl 8.5\\n\\n### Choices are represented by integers, which are indices into this list:\\n### Rock, Paper, Scissors\\n### Normally, idiomatic Tcl code uses names for these sorts of things, but it\\n### turns out that using integers simplifies the move-comparison logic.\\n\\n# How to ask for a move from the human player\\nproc getHumanMove {} {\\n while 1 {\\n\\tputs -nonewline \\\"Your move? \\\\[R\\\\]ock, \\\\[P\\\\]aper, \\\\[S\\\\]cissors: \\\"\\n\\tflush stdout\\n\\tgets stdin line\\n\\tif {[eof stdin]} {\\n\\t puts \\\"\\\\nBye!\\\"\\n\\t exit\\n\\t}\\n\\tset len [string length $line]\\n\\tforeach play {0 1 2} name {\\\"rock\\\" \\\"paper\\\" \\\"scissors\\\"} {\\n\\t # Do a prefix comparison\\n\\t if {$len && [string equal -nocase -length $len $line $name]} {\\n\\t\\treturn $play\\n\\t }\\n\\t}\\n\\tputs \\\"Sorry, I don't understand that. Try again please.\\\"\\n }\\n}\\n\\n# How to ask for a move from the machine player\\nproc getMachineMove {} {\\n global states\\n set choice [expr {int(rand() * [::tcl::mathop::+ {*}$states 3])}]\\n foreach play {1 2 0} count $states {\\n\\tif {[incr sum [expr {$count+1}]] > $choice} {\\n\\t puts \\\"I play \\\\\\\"[lindex {Rock Paper Scissors} $play]\\\\\\\"\\\"\\n\\t return $play\\n\\t}\\n }\\n}\\n\\n# Initialize some state variables\\nset states {0 0 0}\\nset humanWins 0\\nset machineWins 0\\n\\n# The main game loop\\nwhile 1 {\\n # Get the moves for this round\\n set machineMove [getMachineMove]\\n set humanMove [getHumanMove]\\n # Report on what happened\\n if {$humanMove == $machineMove} {\\n\\tputs \\\"A draw!\\\"\\n } elseif {($humanMove+1)%3 == $machineMove} {\\n\\tputs \\\"I win!\\\"\\n\\tincr machineWins\\n } else {\\n\\tputs \\\"You win!\\\"\\n\\tincr humanWins\\n }\\n puts \\\"Cumulative scores: $humanWins to you, $machineWins to me\\\"\\n # Update the state of how the human has played in the past\\n lset states $humanMove [expr {[lindex $states $humanMove] + 1}]\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"PROGRAM:RPS\\n:{0,0,0}→L1\\n:{0,0,0}→L2\\n:Lbl ST\\n:Disp \\\"R/P/S\\\"\\n:Disp \\\"1/2/3\\\"\\n:Lbl EC\\n:Input A\\n:If A>3 or A<1\\n:Then\\n:Goto NO\\n:End\\n:randInt(1,3+L1(1)+L1(2)+L1(3)→C\\n:If C≤1+L1(1)\\n:Then\\n:2→B\\n:Goto NS\\n:End\\n:If C>2+L1(2)\\n:Then\\n:1→B\\n:Else\\n:3→B\\n:End\\n:Lbl NS\\n:L1(A)+1→L1(A)\\n:If A=B\\n:Then\\n:Disp \\\"TIE GAME\\\"\\n:L2(3)+1→L2(3)\\n:Goto TG\\n:End\\n:If (A=1 and B=2) or (A=2 and B=3) or (A=3 and B=1)\\n:Then\\n:Disp \\\"I WIN\\\"\\n:L2(1)+1→L2(1)\\n:Else\\n:Disp \\\"YOU WIN\\\"\\n:L2(2)+1→L2(2)\\n:End\\n:Lbl TG\\n:Disp \\\"PLAY AGAIN?\\\"\\n:Input Str1\\n:If Str1=\\\"YES\\\"\\n:Then\\n:ClrHome\\n:Goto ST\\n:Else\\n:Goto EN\\n:End\\n:Lbl NO\\n:ClrHome\\n:Pause \\\"PICK 1,2, or 3\\\"\\n:ClrHome\\n:Goto EC\\n:Lbl EN\\n:ClrHome\\n:Disp \\\"I WON:\\\"\\n:Disp L2(1)\\n:Disp \\\"YOU WON:\\\"\\n:Disp L2(2)\\n:Disp \\\"WE TIED:\\\"\\n:Disp L2(3)\\n:Disp \\\"BYE\\\"\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"while(isobject(RockPaperScissors))\\n\\tRockPaperScissors.delete();\\n\\nnew scriptObject(RockPaperScissors);\\n\\nfunction RockPaperScissors::startGame(%this)\\n{\\n\\t%this.idle = true;\\n\\techo(\\\"Starting rock paper scissors, please type choose(\\\\\\\"choice\\\\\\\"); to proceed!\\\");\\n}\\n\\nfunction RockPaperScissors::endGame(%this)\\n{\\n\\t%this.idle = true;\\n}\\n\\nfunction RockPaperScissors::main(%this)\\n{\\n\\t%this.idle = 0;\\n\\t\\n\\tif(getRandom(1,2) == 1)\\n\\t{\\n\\t\\t%result = %this.getChoiceByUserFrequency();\\n\\t}\\n\\telse\\n\\t{\\n\\t\\t%c[0] = \\\"rock\\\";\\n\\t\\t%c[1] = \\\"paper\\\";\\n\\t\\t%c[2] = \\\"scissors\\\";\\n\\t\\t\\n\\t\\t%result = %c[getRandom(0,2)];\\n\\t}\\n\\t\\n\\t%userChoice = %this.current;\\n\\t\\n\\t%winner = thisVSthat(%userChoice,%result);\\n\\t\\n\\tif(%winner == 0)\\n\\t{\\n\\t\\techo(\\\"You both chose \\\"@%userChoice@\\\", tie!\\\");\\n\\t}\\n\\telse\\n\\tif(%winner == 1)\\n\\t{\\n\\t\\techo(\\\"You chose \\\"@%userChoice@\\\" computer chose \\\"@%result@\\\", you win!\\\");\\n\\t}\\n\\telse\\n\\tif(%winner == 2)\\n\\t{\\n\\t\\techo(\\\"You chose \\\"@%userChoice@\\\" computer chose \\\"@%result@\\\", you lose!\\\");\\n\\t}\\n\\t\\n\\t%this.idle = true;\\n}\\n\\nfunction RockPaperScissors::getChoiceByUserFrequency(%this)\\n{\\n\\t%weakness[\\\"rock\\\"] = \\\"paper\\\";\\n\\t%weakness[\\\"paper\\\"] = \\\"Scissors\\\";\\n\\t%weakness[\\\"scissors\\\"] = \\\"rock\\\";\\n\\t\\n\\t%a[0] = %this.choice[\\\"rock\\\"];\\n\\t%a[1] = %this.choice[\\\"paper\\\"];\\n\\t%a[2] = %this.choice[\\\"Scissors\\\"];\\n\\t\\n\\t%b[0] = \\\"rock\\\";\\n\\t%b[1] = \\\"paper\\\";\\n\\t%b[2] = \\\"scissors\\\";\\n\\t\\n\\tfor(%i=0;%i<3;%i++)\\n\\t{\\n\\t\\t%curr = %a[%i];\\n\\t\\t\\n\\t\\tif(%temp $= \\\"\\\")\\n\\t\\t{\\n\\t\\t\\t%temp = %curr;\\n\\t\\t\\t%tempi = %i;\\n\\t\\t}\\n\\t\\telse\\n\\t\\tif(%curr > %temp)\\n\\t\\t{\\n\\t\\t\\t%temp = %curr;\\n\\t\\t\\t%tempi = %i;\\n\\t\\t}\\n\\t}\\n\\t\\n\\treturn %weakness[%b[%tempi]];\\n}\\n\\nfunction choose(%this)\\n{\\n\\t%rps = rockPaperScissors;\\n\\t\\n\\tif(!%rps.idle)\\n\\t{\\n\\t\\treturn 0;\\n\\t}\\n\\telse\\n\\tif(%this !$= \\\"rock\\\" && %this !$= \\\"paper\\\" && %this !$= \\\"scissors\\\")\\n\\t{\\n\\t\\treturn 0;\\n\\t}\\n\\n\\t%rps.choice[%this]++;\\n\\t%rps.current = %this;\\n\\t%rps.main();\\n\\t\\n\\treturn %this;\\n}\\n\\nfunction thisVSthat(%this,%that)\\n{\\n\\tif(%this !$= \\\"rock\\\" && %this !$= \\\"paper\\\" && %this !$= \\\"scissors\\\")\\n\\t{\\n\\t\\treturn 0;\\n\\t}\\n\\telse\\n\\tif(%that !$= \\\"rock\\\" && %that !$= \\\"paper\\\" && %that !$= \\\"scissors\\\")\\n\\t{\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\t%weakness[\\\"rock\\\"] = \\\"paper\\\";\\n\\t%weakness[\\\"paper\\\"] = \\\"Scissors\\\";\\n\\t%weakness[\\\"scissors\\\"] = \\\"rock\\\";\\n\\t\\n\\tif(%weakness[%this] $= %that)\\n\\t{\\n\\t\\t%result = 2;\\n\\t}\\n\\telse\\n\\tif(%weakness[%that] $= %this)\\n\\t{\\n\\t\\t%result = 1;\\n\\t}\\n\\telse\\n\\t\\t%result = 0;\\n\\t\\t\\n\\treturn %result;\\n}\\n\",\n \"language\": \"TorqueScript\"\n },\n {\n \"code\": \"RockPaperScissors.startGame();\\n\",\n \"language\": \"TorqueScript\"\n },\n {\n \"code\": \"choose(\\\"Rock\\\");\\n\",\n \"language\": \"TorqueScript\"\n },\n {\n \"code\": \"#!/bin/bash\\nchoices=(rock paper scissors)\\n\\n# comparison function, works like Perl\\n# winner x y = 2 if y beats x, 1 if x beats 1, 0 if it's a tie\\nwinner() {\\n local left=\\\"$1\\\" right=\\\"$2\\\"\\n echo $(( (3 + left - right) % 3 ))\\n}\\n\\n\\nhuman_counts=(1 1 1)\\nhuman_count=3\\ncomputer_counts=(0 0 0)\\ngames=0 human=0 computer=0\\n\\nPS3=\\\"What do you throw? \\\"\\nwhile true; do\\n select choice in rock paper scissors quit; do\\n if [ -z \\\"$choice\\\" ]; then choice=\\\"$REPLY\\\"; fi\\n if [ \\\"$choice\\\" = \\\"quit\\\" ]; then\\n break 2\\n fi\\n for (( h=0; h<${#choices[@]}; ++h )); do\\n if [ \\\"${choices[h]}\\\" = \\\"$choice\\\" ]; then\\n break\\n fi\\n done\\n if (( h < 3 )); then\\n break\\n fi\\n echo \\\"Unrecognized choice. Try again!\\\"\\n done\\n\\n let n=RANDOM%human_count\\n for (( c=0; c<${#human_counts[@]}; ++c )); do\\n let n-=${human_counts[c]}\\n if (( n < 0 )); then\\n break\\n fi\\n done\\n let computer_counts[c]+=1\\n echo\\n echo \\\"You chose ${choices[h]^^}\\\"\\n echo \\\"I chose ${choices[c]^^}\\\"\\n w=\\\"$(winner \\\"$c\\\" \\\"$h\\\")\\\"\\n case \\\"$w\\\" in\\n 2) echo \\\"YOU WIN!\\\"; let human+=1;;\\n 0) echo \\\"TIE!\\\";;\\n 1) echo \\\"I WIN!\\\"; let computer+=1;;\\n *) echo \\\"winner returned weird result '$w'\\\";;\\n esac\\n echo\\n let games+=1\\n (( human_counts[(h+1)%3]+=1, human_count+=1 ))\\ndone\\n\\necho\\necho \\\"We played $games games. You won $human, and I won $computer.\\\"\\nfor (( i=0; i<3; ++i )); do\\n echo \\\"You picked ${choices[i]} $(( human_counts[ (i+1)%3 ] - 1 )) times.\\\"\\n echo \\\"I picked ${choices[i]} $(( computer_counts[i] )) times.\\\"\\ndone\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"import rand\\nimport os\\n\\nconst (\\n\\trps = 'rps'\\n\\tmsg = [\\n 'Rock breaks scissors',s\\n 'Paper covers rock',\\n 'Scissors cut paper'\\n\\t]\\n)\\n\\nfn main() {\\n println(\\\"Rock Paper Scissors\\\")\\n println(\\\"Enter r, p, or s as your play. Anything else ends the game.\\\")\\n println(\\\"Running score shown as <your wins>:<my wins>\\\")\\n mut pi :='' // player input\\n mut a_score, mut p_score := 0, 0\\n mut pcf := []int{len: 2, init: 0} // pcf = player choice frequency\\n mut a_choice := rand.intn(3) or {0} // ai choice for first play is completely random\\t\\n for _ in 0..6 {\\n\\t\\t// get player choice\\n\\t\\tpi = os.input('Play: ').str()\\n\\t\\tif typeof(pi).name != 'string' || pi.len != 1 {break}\\n p_choice := rps.index_any(pi)\\n if p_choice < 0 {break}\\n pcf << p_choice\\n // show result of play\\n println('My play: ' + rps[a_choice].ascii_str())\\n match (a_choice - p_choice + 3) % 3 {\\n 0 {println(\\\"Tie.\\\")}\\n 1 {println('My point.\\\\n' + msg[a_choice]) a_score++}\\n 2 {println('Your point.\\\\n' + msg[p_choice]) p_score++}\\n else {break}\\n }\\n // show score\\n println('$p_score : $a_score')\\n // compute ai choice for next play\\n\\t\\trn := rand.intn(3) or {0}\\n\\t\\tmatch true {\\n\\t\\t\\t\\trn < pcf[0] {a_choice = 2}\\n\\t\\t\\t\\trn < pcf[0] + pcf[1] {a_choice = 0}\\n\\t\\t\\t\\telse {a_choice = rand.intn(3) or {0}}\\n\\t\\t}\\n }\\t\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"let entered=0\\nlet keycode=0\\nlet rcounter=1\\nprint 1 \\\"Enter R for rock, P for paper, or S for scissors. (not case sensitive)\\\"\\nwhile entered=0\\ninput human$\\nif human=$=\\\"r\\\"\\nlet human$=\\\"rock\\\"\\nlet entered=1\\nelseif human=$=\\\"R\\\"\\nlet human$=\\\"rock\\\"\\nlet entered=1\\nelseif human=$=\\\"p\\\"\\nlet human$=\\\"paper\\\"\\nlet entered=1\\nelseif human=$=\\\"P\\\"\\nlet human$=\\\"paper\\\"\\nlet entered=1\\nelseif human=$=\\\"s\\\"\\nlet human$=\\\"scissors\\\"\\nlet entered=1\\nelseif human=$=\\\"S\\\"\\nlet human$=\\\"scissors\\\"\\nlet entered=1\\nelseif entered=0\\nprint 1 \\\"That choice is invalid.\\\"\\nendif\\nwend\\nprint 1 \\\"Press any key so the computer can make its choice.\\\"\\nwhile keycode=0\\nlet rcounter=rcounter+1\\nlet keycode=key()\\nif rcounter=4\\nlet rcounter=1\\nendif\\nwend\\nif rcounter=1\\nlet cpu$=\\\"rock\\\"\\nelseif rcounter=2\\nlet cpu$=\\\"paper\\\"\\nelseif rcounter=3\\nlet cpu$=\\\"scissors\\\"\\nendif\\nprint 1 \\\"You chose\\\"+human$+\\\".\\\"\\nprint 1 \\\"The computer chose\\\"+cpu$+\\\".\\\"\\nif human$=cpu$\\nprint 1 \\\"You tied.\\\"\\nendif\\nif human$=\\\"rock\\\"\\nif cpu$=\\\"paper\\\"\\nprint 1 \\\"Paper covers rock, so you lose.\\\"\\nendif\\nif cpu$=\\\"scissors\\\"\\nprint 1 \\\"Rock blunts scissors, so you win.\\\"\\nendif\\nendif\\nif human$=\\\"paper\\\"\\nif cpu$=\\\"rock\\\"\\nprint 1 \\\"Paper covers rock, so you win.\\\"\\nendif\\nif cpu$=\\\"scissors\\\"\\nprint 1 \\\"Scissors cut paper, so you lose.\\\"\\nendif\\nendif\\nif human$=\\\"scissors\\\"\\nif cpu$=\\\"rock\\\"\\nprint 1 \\\"Rock blunts scissors, so you lose.\\\"\\nendif\\nif cpu$=\\\"paper\\\"\\nprint 1 \\\"Scissors cut paper, so you win.\\\"\\nendif\\nendif\\nend\\n\",\n \"language\": \"Wee-Basic\"\n },\n {\n \"code\": \"import \\\"random\\\" for Random\\nimport \\\"./str\\\" for Str\\nimport \\\"./ioutil\\\" for Input\\n\\nvar choices = \\\"rpsq\\\"\\nvar rand = Random.new()\\n\\nvar pWins = 0 // player wins\\nvar cWins = 0 // computer wins\\nvar draws = 0 // neither wins\\nvar games = 0 // games played\\nvar pFreqs = [0, 0, 0] // player frequencies for each choice (rps)\\n\\nvar printScore = Fn.new {\\n System.print(\\\"Wins: You %(pWins), Computer %(cWins), Neither %(draws)\\\\n\\\")\\n}\\n\\nvar getComputerChoice = Fn.new {\\n // make a completely random choice until 3 games have been played\\n if (games < 3) return choices[rand.int(3)]\\n var num = rand.int(games)\\n return (num < pFreqs[0]) ? \\\"p\\\" :\\n (num < pFreqs[0] + pFreqs[1]) ? \\\"s\\\" : \\\"r\\\"\\n}\\n\\nSystem.print(\\\"Enter: (r)ock, (p)aper, (s)cissors or (q)uit\\\\n\\\")\\nwhile (true) {\\n printScore.call()\\n var pChoice = Str.lower(Input.option(\\\"Your choice r/p/s/q : \\\", \\\"rpsqRPSQ\\\"))\\n if (pChoice == \\\"q\\\") {\\n System.print(\\\"OK, quitting\\\")\\n return\\n }\\n var cChoice = getComputerChoice.call()\\n System.print(\\\"Computer's choice : %(cChoice)\\\")\\n if (pChoice == \\\"r\\\" && cChoice == \\\"s\\\") {\\n System.print(\\\"Rock breaks scissors - You win!\\\")\\n pWins = pWins + 1\\n } else if (pChoice == \\\"p\\\" && cChoice == \\\"r\\\") {\\n System.print(\\\"Paper covers rock - You win!\\\")\\n pWins = pWins + 1\\n } else if (pChoice == \\\"s\\\" && cChoice == \\\"p\\\") {\\n System.print(\\\"Scissors cut paper - You win!\\\")\\n pWins = pWins + 1\\n } else if (pChoice == \\\"s\\\" && cChoice == \\\"r\\\") {\\n System.print(\\\"Rock breaks scissors - Computer wins!\\\")\\n cWins = cWins + 1\\n } else if (pChoice == \\\"r\\\" && cChoice == \\\"p\\\") {\\n System.print(\\\"Paper covers rock - Computer wins!\\\")\\n cWins = cWins + 1\\n } else if (pChoice == \\\"p\\\" && cChoice == \\\"s\\\") {\\n System.print(\\\"Scissors cut paper - Computer wins!\\\")\\n cWins = cWins + 1\\n } else {\\n System.print(\\\"It's a draw!\\\")\\n draws = draws + 1\\n }\\n var pf = pFreqs[choices.indexOf(pChoice)]\\n pFreqs[choices.indexOf(pChoice)] = pf + 1\\n games = games + 1\\n System.print()\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"REM Yabasic 2.763 version\\n\\nWINNER = 1 : ACTION = 2 : LOSSER = 3\\ndim word$(10, 3)\\n\\nfor n = 0 to 9\\n read word$(n, WINNER), word$(n, ACTION), word$(n, LOSSER)\\nnext n\\n\\nrepeat\\n clear screen\\n computerChoice$ = word$(ran(10), WINNER)\\n print \\\"'Rock, Paper, Scissors, Lizard, Spock!' rules are:\\\\n\\\"\\n for n = 0 to 9\\n SimonSay(n)\\n next n\\n print \\\"\\\\nType your choice letter:\\\"\\n print \\\"(R)ock, (P)aper, (S)cissors, (L)izard, Spoc(K), (Q)uit\\\\n\\\"\\n k$ = upper$(inkey$)\\n if k$ = \\\"Q\\\" break\\n switch k$\\n case \\\"R\\\": humanChoice$ = \\\"Rock\\\" : break\\n case \\\"P\\\": humanChoice$ = \\\"Paper\\\" : break\\n case \\\"S\\\": humanChoice$ = \\\"Scissors\\\" : break\\n case \\\"L\\\": humanChoice$ = \\\"Lizard\\\" : break\\n case \\\"K\\\": humanChoice$ = \\\"Spock\\\" : break\\n end switch\\n print \\\"Player chose \\\", humanChoice$, \\\" and Computer chose \\\", computerChoice$\\n for n = 0 to 9\\n if word$(n, WINNER) = humanChoice$ and word$(n, LOSSER) = computerChoice$ then\\n SimonSay(n)\\n print \\\"Winner was Player\\\"\\n wp = wp + 1\\n break\\n elseif word$(n, WINNER) = computerChoice$ and word$(n, LOSSER) = humanChoice$ then\\n SimonSay(n)\\n print \\\"Winner was Computer\\\"\\n wc = wc + 1\\n break\\n end if\\n next n\\n if n = 10 then\\n print \\\"Ouch!\\\"\\n end if\\n punctuation()\\n print \\\"\\\\nPress any key to continue\\\"\\n inkey$\\nuntil(k$ = \\\"Q\\\")\\n\\npunctuation()\\nif wp > wc then\\n print \\\"Player win\\\"\\nelseif wc > wp then\\n print \\\"Computer win\\\"\\nelse\\n print \\\"Tie\\\"\\nend if\\n\\nend\\n\\nsub SimonSay(n)\\n print word$(n, WINNER), \\\" \\\", word$(n, ACTION), \\\" \\\", word$(n, LOSSER)\\nend sub\\n\\nsub punctuation()\\n print \\\"\\\\nPlayer = \\\", wp, \\\"\\\\tComputer = \\\", wc, \\\"\\\\n\\\"\\nend sub\\n\\ndata \\\"Scissors\\\",\\\"cuts\\\",\\\"Paper\\\"\\ndata \\\"Paper\\\",\\\"covers\\\",\\\"Rock\\\"\\ndata \\\"Rock\\\",\\\"crushes\\\",\\\"Lizard\\\"\\ndata \\\"Lizard\\\",\\\"poisons\\\",\\\"Spock\\\"\\ndata \\\"Spock\\\",\\\"smashes\\\",\\\"Scissors\\\"\\ndata \\\"Scissors\\\",\\\"decapites\\\",\\\"Lizard\\\"\\ndata \\\"Lizard\\\",\\\"eats\\\",\\\"Paper\\\"\\ndata \\\"Paper\\\",\\\"disproves\\\",\\\"Spock\\\"\\ndata \\\"Spock\\\",\\\"vaporizes\\\",\\\"Rock\\\"\\ndata \\\"Rock\\\",\\\"blunts\\\",\\\"Scissors\\\"\\n\",\n \"language\": \"Yabasic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Rock-paper-scissors"}}},{"rowIdx":1587,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Roman_numerals/Decode\n","language":"00-META"},{"code":";Task:\nCreate a function that takes a Roman numeral as its argument and returns its value as a numeric decimal integer. \n\nYou don't need to validate the form of the Roman numeral.\n\nModern Roman numerals are written by expressing each decimal digit of the number to be encoded separately, \n<br>starting with the leftmost decimal digit and skipping any '''0'''s (zeroes). \n\n'''1990''' is rendered as '''MCMXC''' (1000 = M, 900 = CM, 90 = XC) and \n<br>'''2008''' is rendered as '''MMVIII''' (2000 = MM, 8 = VIII).\n \nThe Roman numeral for '''1666''', '''MDCLXVI''', uses each letter in descending order.\n<br><br>\n\n","language":"00-TASK"},{"code":"V roman_values = [(‘I’, 1), (‘IV’, 4), (‘V’, 5), (‘IX’, 9), (‘X’, 10),\n (‘XL’, 40), (‘L’, 50), (‘XC’, 90), (‘C’, 100),\n (‘CD’, 400), (‘D’, 500), (‘CM’, 900), (‘M’, 1000)]\n\nF roman_value(=roman)\n V total = 0\n L(symbol, value) reversed(:roman_values)\n L roman.starts_with(symbol)\n total += value\n roman = roman[symbol.len..]\n R total\n\nL(value) [‘MCMXC’, ‘MMVIII’, ‘MDCLXVI’]\n print(value‘ = ’roman_value(value))\n","language":"11l"},{"code":"* Roman numerals Decode - 17/04/2019\nROMADEC CSECT\n USING ROMADEC,R13 base register\n B 72(R15) skip savearea\n DC 17F'0' savearea\n SAVE (14,12) save previous context\n ST R13,4(R15) link backward\n ST R15,8(R13) link forward\n LR R13,R15 set addressability\n LA R6,1 i=1\n DO WHILE=(C,R6,LE,=A(NV)) do i=1 to hbound(vals)\n LR R1,R6 i\n SLA R1,3 ~\n LA R4,VALS-L'VALS(R1) @vals(i)\n MVC X,0(R4) x=vals(i)\n SR R9,R9 prev=0\n ST R9,Y y=0\n LA R7,L'X j=1\n DO WHILE=(C,R7,GE,=A(1)) do j=length(x) to 1 by -1\n LA R4,X-1 @x\n AR R4,R7 +j\n MVC C,0(R4) c=substr(x,j,1)\n IF CLI,C,NE,C' ' THEN if c^=' ' then\n SR R1,R1 r1=0\n LA R2,1 k=1\n DO WHILE=(C,R2,LE,=A(L'ROMAN)) do k=1 to length(roman)\n LA R3,ROMAN-1 @roman\n AR R3,R2 +k\n IF CLC,0(L'C,R3),EQ,C THEN if substr(roman,k,1)=c\n LR R1,R2 index=k\n B REINDEX leave k\n ENDIF , endif\n LA R2,1(R2) k=k+1\n ENDDO , enddo k\nREINDEX EQU * r1=index(roman,c)\n SLA R1,2 ~\n L R8,DECIM-4(R1) n=decim(index(roman,c))\n IF CR,R8,LT,R9 THEN if n<prev then\n LCR R8,R8 n=-n\n ENDIF , endif\n L R2,Y y\n AR R2,R8 +n\n ST R2,Y y=y+n\n LR R9,R8 prev=n\n ENDIF , endif\n BCTR R7,0 j--\n ENDDO , enddo j\n MVC PG(8),X x\n L R1,Y y\n XDECO R1,XDEC edit y\n MVC PG+12(4),XDEC+8 output y\n XPRNT PG,L'PG print buffer\n LA R6,1(R6) i++\n ENDDO , enddo i\n L R13,4(0,R13) restore previous savearea pointer\n RETURN (14,12),RC=0 restore registers from calling sav\nNV EQU (X-VALS)/L'VALS\nROMAN DC CL7'MDCLXVI'\nDECIM DC F'1000',F'500',F'100',F'50',F'10',F'5',F'1'\nVALS DC CL8'XIV',CL8'CMI',CL8'MIC',CL8'MCMXC',CL8'MDCLXVI'\n DC CL8'MMVIII',CL8'MMXIX',CL8'MMMCMXCV'\nX DS CL(L'VALS)\nY DS F\nC DS CL1\nPG DC CL80'........ -> ....'\nXDEC DS CL12\n REGEQU\n END ROMADEC\n","language":"360-Assembly"},{"code":"\t\torg\t100h\n\t\tjmp\ttest\n\t\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t\t;; Takes a zero-terminated Roman numeral string in BC\n\t\t;; and returns 16-bit integer in HL.\n\t\t;; All registers destroyed.\nroman:\t\tdcx\tb\nromanfindend:\tinx\tb\t; load next character\n\t\tldax\tb\t\n\t\tinr\te\n\t\tana\ta\t; are we there yet\n\t\tjnz\tromanfindend\n\t\tlxi\th,0\t; zero HL to hold the total\n\t\tpush\th\t; stack holds the previous roman numeral\nromanloop:\tdcx\tb\t; get next roman numeral\n\t\tldax\tb\t; (work backwards)\n\t\tcall\tromandgt\n\t\tjc\tromandone\t; carry set = not Roman anymore\n\t\txthl\t\t; load previous roman numeral\n\t\tcall\tcmpdehl\t; DE < HL?\n\t\tmov\th,d\t; in any case, DE is now the previous\n\t\tmov\tl,e\t; Roman numeral\n\t\txthl\t\t; bring back the total\n\t\tjnc\tromanadd\n\t\tmov\ta,d\t; DE (current) < HL (previous)\n\t\tcma\t\t; so this Roman digit must be subtracted\n\t\tmov\td,a\t; from the total.\n\t\tmov\ta,e\t; so we negate it before adding it\n\t\tcma\t\t; two's complement: -de = (~de)+1\n\t\tmov\te,a\n\t\tinx\td\nromanadd:\tdad\td\t; add to running total\n\t\tjmp\tromanloop\nromandone:\tpop\td\t; remove temporary variable from stack\n\t\tret\n\t\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t\t;; 16-bit compare DE with HL, set flags\n\t\t;; accordingly. A destroyed.\ncmpdehl:\tmov\ta,d\n\t\tcmp\th\n\t\trnz\n\t\tmov\ta,e\n\t\tcmp\tl\n\t\tret\n\t\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t\t;; Takes a single Roman 'digit' in A,\n\t\t;; and returns its value in DE (0 if invalid)\n\t\t;; All other registers preserved.\nromandgt:\tpush\th\t; preserve hl for the caller\n\t\tlxi\th,romantab\n\t\tmvi\te,7\t; e=counter\nromandgtl:\tcmp\tm\t; check table entry\n\t\tjz\tromanfound\n\t\tinx\th\t; move to next table entry\n\t\tinx\th\n\t\tinx\th\n\t\tdcr\te\t; decrease counter\n\t\tjnz\tromandgtl\n\t\tpop\th\t; we didn't find it\n\t\tstc\t\t; set carry\n\t\tret\t\t; return with DE=0\nromanfound:\tinx\th\t; we did find it\n\t\tmov\te,m\t; load it into DE\n\t\tinx\th\n\t\tmov\td,m\n\t\tpop\th\n\t\tana\ta\t; clear carry\n\t\tret\nromantab:\tdb\t'I',1,0\t; 16-bit little endian values\n\t\tdb\t'V',5,0\n\t\tdb\t'X',10,0\n\t\tdb\t'L',50,0\n\t\tdb\t'C',100,0\n\t\tdb\t'D',0f4h,1\n\t\tdb\t'M',0e8h,3\n\t\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t\t;; The following is testing and I/O code.\ntest:\t\tmvi\tc,10\t; read string from console\n\t\tlxi\td,bufdef\n\t\tcall\t5\n\t\tmvi\tc,9\t; print newline\n\t\tlxi\td,nl\n\t\tcall\t5\n\t\tlxi\tb,buf\t; run `roman' on the input string\n\t\tcall\troman\t; the result is now in hl\n\t\tlxi\td,-10000\t\n\t\tcall\tnumout\t; print 10000s digit\n\t\tlxi\td,-1000\t\t\n\t\tcall\tnumout\t; print 1000s digit\n\t\tlxi\td,-100\n\t\tcall \tnumout\t; print 100s digit\n\t\tlxi\td,-10\n\t\tcall \tnumout\t; print 10s digit\n\t\tlxi\td,-1\t; ...print 1s digit\nnumout:\t\tmvi\ta,-1\t\n\t\tpush\th\t\nnumloop:\tinr\ta\n\t\tpop\tb\n\t\tpush\th\n\t\tdad\td\n\t\tjc\tnumloop\n\t\tadi\t'0'\n\t\tmvi\tc,2\n\t\tmov\te,a\n\t\tcall\t5\n\t\tpop\th\n\t\tret\nnl:\t\tdb\t13,10,'$'\nbufdef:\t\tdb\t16,0\nbuf:\t\tds\t17\n","language":"8080-Assembly"},{"code":"CARD FUNC DecodeRomanDigit(CHAR c)\n IF c='I THEN RETURN (1)\n ELSEIF c='V THEN RETURN (5)\n ELSEIF c='X THEN RETURN (10)\n ELSEIF c='L THEN RETURN (50)\n ELSEIF c='C THEN RETURN (100)\n ELSEIF c='D THEN RETURN (500)\n ELSEIF c='M THEN RETURN (1000)\n FI\nRETURN (0)\n\nCARD FUNC DecodeRomanNumber(CHAR ARRAY s)\n CARD res,curr,prev\n BYTE i\n\n res=0 prev=0 i=s(0)\n WHILE i>0\n DO\n curr=DecodeRomanDigit(s(i))\n IF curr<prev THEN\n res==-curr\n ELSE\n res==+curr\n FI\n prev=curr\n i==-1\n OD\nRETURN (res)\n\nPROC Test(CHAR ARRAY s)\n CARD n\n\n n=DecodeRomanNumber(s)\n PrintF(\"%S=%U%E\",s,n)\nRETURN\n\nPROC Main()\n Test(\"MCMXC\")\n Test(\"MMVIII\")\n Test(\"MDCLXVI\")\n Test(\"MMMDCCCLXXXVIII\")\n Test(\"MMMCMXCIX\")\nRETURN\n","language":"Action-"},{"code":"Pragma Ada_2012;\nPragma Assertion_Policy( Check );\n\nWith\nUnchecked_Conversion,\nAda.Text_IO;\n\nProcedure Test_Roman_Numerals is\n\n -- We create an enumeration of valid characters, note that they are\n -- character-literals, this is so that we can use literal-strings,\n -- and that their size is that of Integer.\n Type Roman_Digits is ('I', 'V', 'X', 'L', 'C', 'D', 'M' )\n with Size => Integer'Size;\n\n -- We use a representation-clause ensure the proper integral-value\n -- of each individual character.\n For Roman_Digits use\n (\n 'I' => 1,\n 'V' => 5,\n 'X' => 10,\n 'L' => 50,\n 'C' => 100,\n 'D' => 500,\n 'M' => 1000\n );\n\n -- To convert a Roman_Digit to an integer, we now only need to\n -- read its value as an integer.\n Function Convert is new Unchecked_Conversion\n (\tSource => Roman_Digits,\tTarget => Integer );\n\n -- Romena_Numeral is a string of Roman_Digit.\n Type Roman_Numeral is array (Positive range <>) of Roman_Digits;\n\n -- The Numeral_List type is used herein only for testing\n -- and verification-data.\n Type Numeral_List is array (Positive range <>) of\n not null access Roman_Numeral;\n\n -- The Test_Cases subtype ensures that Test_Data and Validation_Data\n -- both contain the same number of elements, and that the indecies\n -- are the same; essentially the same as:\n --\n -- pragma Assert( Test_Data'Length = Validation_Data'Length\n --\t\t AND Test_Data'First = Validation_Data'First);\n\n subtype Test_Cases is Positive range 1..14;\n\n Test_Data : constant Numeral_List(Test_Cases):=\n (\n New Roman_Numeral'(\"III\"),\t-- 3\n New Roman_Numeral'(\"XXX\"),\t-- 30\n New Roman_Numeral'(\"CCC\"),\t-- 300\n New Roman_Numeral'(\"MMM\"),\t-- 3000\n\n New Roman_Numeral'(\"VII\"),\t-- 7\n New Roman_Numeral'(\"LXVI\"),\t-- 66\n New Roman_Numeral'(\"CL\"),\t-- 150\n New Roman_Numeral'(\"MCC\"),\t-- 1200\n\n New Roman_Numeral'(\"IV\"),\t-- 4\n New Roman_Numeral'(\"IX\"),\t-- 9\n New Roman_Numeral'(\"XC\"),\t-- 90\n\n New Roman_Numeral'(\"ICM\"),\t-- 901\n New Roman_Numeral'(\"CIM\"),\t-- 899\n\n New Roman_Numeral'(\"MDCLXVI\")\t-- 1666\n );\n\n Validation_Data : constant array(Test_Cases) of Natural:=\n (\t3, 30, 300, 3000,\n\t7, 66, 150, 1200,\n\t4, 9, 90,\n\t901, 899,\n\t1666\n );\n\n\n -- In Roman numerals, the subtractive form [IV = 4] was used\n -- very infrequently, the most common form was the addidive\n -- form [IV = 6]. (Consider military logistics and squads.)\n\n -- SUM returns the Number, read in the additive form.\n Function Sum( Number : Roman_Numeral ) return Natural is\n begin\n\tReturn Result : Natural:= 0 do\n\t For Item of Number loop\n\t\t Result:= Result + Convert( Item );\n\t end loop;\n\tEnd Return;\n end Sum;\n\n -- EVAL returns Number read in the subtractive form.\n Function Eval( Number : Roman_Numeral ) return Natural is\n\tCurrent : Roman_Digits:= 'I';\n begin\n\tReturn Result : Natural:= 0 do\n\t For Item of Number loop\n\t\tif Current < Item then\n\t\t Result:= Convert(Item) - Result;\n\t\t Current:= Item;\n\t\telse\n\t\t Result:= Result + Convert(Item);\n\t\tend if;\n\t end loop;\n\tEnd Return;\n end Eval;\n\n -- Display the given Roman_Numeral via Text_IO.\n Procedure Put( S: Roman_Numeral ) is\n begin\n\tFor Ch of S loop\n\t declare\n\t\t-- The 'Image attribute returns the character inside\n\t\t-- single-quotes; so we select the character itself.\n\t\tC : Character renames Roman_Digits'Image(Ch)(2);\n\t begin\n\t\tAda.Text_IO.Put( C );\n\t end;\n\tend loop;\n end;\n\n -- This displays pass/fail dependant on the parameter.\n Function PF ( Value : Boolean ) Return String is\n begin\n\tReturn Result : String(1..4):= ( if Value then\"pass\"else\"fail\" );\n End PF;\n\nBegin\n Ada.Text_IO.Put_Line(\"Starting Test:\");\n\n for Index in Test_Data'Range loop\n\tdeclare\n\t Item : Roman_Numeral renames Test_Data(Index).all;\n\t Value : constant Natural := Eval(Item);\n\tbegin\n\t Put( Item );\n\n\t Ada.Text_IO.Put( ASCII.HT & \"= \");\n\t Ada.Text_IO.Put( Value'Img );\n\t Ada.Text_IO.Put_Line( ASCII.HT & '[' &\n\t\t\t PF( Value = Validation_Data(Index) )& ']');\n\tend;\n end loop;\n\n\n Ada.Text_IO.Put_Line(\"Testing complete.\");\nEnd Test_Roman_Numerals;\n","language":"Ada"},{"code":" PROC roman to int = (STRING roman) INT:\n BEGIN\n PROC roman digit value = (CHAR roman digit) INT:\n (roman digit = \"M\" | 1000 |:\n roman digit = \"D\" | 500 |:\n roman digit = \"C\" | 100 |:\n roman digit = \"L\" | 50 |:\n roman digit = \"X\" | 10 |:\n roman digit = \"V\" | 5 |:\n roman digit = \"I\" | 1);\n\n INT result := 0, previous value := 0, run := 0;\n\n FOR i FROM LWB roman TO UPB roman\n DO\n INT value = roman digit value(roman[i]);\n IF previous value = value THEN\n run +:= value\n ELSE\n IF previous value < value THEN\n result -:= run\n ELSE\n result +:= run\n FI;\n run := previous value := value\n FI\n OD;\n\n result +:= run\n END;\n\n MODE TEST = STRUCT (STRING input, INT expected output);\n\n [] TEST roman test = (\n (\"MMXI\", 2011), (\"MIM\", 1999),\n (\"MCMLVI\", 1956), (\"MDCLXVI\", 1666),\n (\"XXCIII\", 83), (\"LXXIIX\", 78),\n (\"IIIIX\", 6)\n );\n\n print((\"Test input Value Got\", newline, \"--------------------------\", newline));\n FOR i FROM LWB roman test TO UPB roman test\n DO\n INT output = roman to int(input OF roman test[i]);\n printf(($g, n (12 - UPB input OF roman test[i]) x$, input OF roman test[i]));\n printf(($g(5), 1x, g(5), 1x$, expected output OF roman test[i], output));\n printf(($b(\"ok\", \"not ok\"), 1l$, output = expected output OF roman test[i]))\n OD\n","language":"ALGOL-68"},{"code":"begin\n % decodes a roman numeral into an integer %\n % there must be at least one blank after the numeral %\n % This takes a lenient view on roman numbers so e.g. IIXX is 18 - see %\n % the Discussion %\n integer procedure romanToDecimal ( string(32) value roman ) ;\n begin\n integer decimal, rPos, currDigit, nextDigit, seqValue;\n string(1) rDigit;\n\n % the roman number is a sequence of sequences of roman digits %\n % if the previous sequence is of higher value digits than the next, %\n % the higher value is added to the overall value %\n % if the previous seequence is of lower value, it is subtracted %\n % e.g. MCMLXII %\n % the sequences are M, C, M, X, II %\n % M is added, C subtracted, M added, X added and II added %\n\n % get the value of a sequence of roman digits %\n integer procedure getSequence ;\n if rDigit = \" \" then begin\n % end of the number %\n 0\n end\n else begin\n % have another sequence %\n integer sValue;\n sValue := 0;\n while roman( rPos // 1 ) = rDigit do begin\n sValue := sValue + currDigit;\n rPos := rPos + 1;\n end while_have_same_digit ;\n % remember the next digit %\n rDigit := roman( rPos // 1 );\n % result is the sequence value %\n sValue\n end getSequence ;\n\n % convert a roman digit into its decimal equivalent %\n % an invalid digit will terminate the program, \" \" is 0 %\n integer procedure getValue( string(1) value romanDigit ) ;\n if romanDigit = \"m\" or romanDigit = \"M\" then 1000\n else if romanDigit = \"d\" or romanDigit = \"D\" then 500\n else if romanDigit = \"c\" or romanDigit = \"C\" then 100\n else if romanDigit = \"l\" or romanDigit = \"L\" then 50\n else if romanDigit = \"x\" or romanDigit = \"X\" then 10\n else if romanDigit = \"v\" or romanDigit = \"V\" then 5\n else if romanDigit = \"i\" or romanDigit = \"I\" then 1\n else if romanDigit = \" \" then 0\n else begin\n write( s_w := 0, \"Invalid roman digit: \"\"\", romanDigit, \"\"\"\" );\n assert false;\n 0\n end getValue ;\n\n % get the first sequence %\n decimal := 0;\n rPos := 0;\n rDigit := roman( rPos // 1 );\n currDigit := getValue( rDigit );\n seqValue := getSequence;\n\n % handle the sequences %\n while rDigit not = \" \" do begin\n % have another sequence %\n nextDigit := getValue( rDigit );\n if currDigit < nextDigit\n then % prev digit is lower % decimal := decimal - seqValue\n else % prev digit is higher % decimal := decimal + seqValue\n ;\n currDigit := nextDigit;\n seqValue := getSequence;\n end while_have_a_roman_digit ;\n\n % add the final sequence %\n decimal + seqValue\n end roman ;\n\n % test the romanToDecimal routine %\n\n procedure testRoman ( string(32) value romanNumber ) ;\n write( i_w := 5, romanNumber, romanToDecimal( romanNumber ) );\n\n testRoman( \"I\" ); testRoman( \"II\" );\n testRoman( \"III\" ); testRoman( \"IV\" );\n testRoman( \"V\" ); testRoman( \"VI\" );\n testRoman( \"VII\" ); testRoman( \"VIII\" );\n testRoman( \"IX\" ); testRoman( \"IIXX\" );\n testRoman( \"XIX\" ); testRoman( \"XX\" );\n write( \"...\" );\n testRoman( \"MCMXC\" );\n testRoman( \"MMVIII\" );\n testRoman( \"MDCLXVI\" );\n\nend.\n","language":"ALGOL-W"},{"code":"/* Parse Roman Numerals\n\n Nigel Galloway March 16th., 2012\n*/\ngrammar ParseRN ;\n\noptions {\n\tlanguage = Java;\n}\n@members {\nint rnValue;\nint ONE;\n}\n\nparseRN:\t({rnValue = 0;} rn NEWLINE {System.out.println($rn.text + \" = \" + rnValue);})*\n\t;\n\t\nrn\t:\t(Thousand {rnValue += 1000;})* hundreds? tens? units?;\n\nhundreds:\t{ONE = 0;} (h9 | h5) {if (ONE > 3) System.out.println (\"Too many hundreds\");};\nh9\t:\tHundred {ONE += 1;} (FiveHund {rnValue += 400;}| Thousand {rnValue += 900;}|{rnValue += 100;} (Hundred {rnValue += 100; ONE += 1;})*);\nh5\t:\tFiveHund {rnValue += 500;} (Hundred {rnValue += 100; ONE += 1;})*;\n\ntens\t:\t{ONE = 0;} (t9 | t5) {if (ONE > 3) System.out.println (\"Too many tens\");};\nt9\t:\tTen {ONE += 1;} (Fifty {rnValue += 40;}| Hundred {rnValue += 90;}|{rnValue += 10;} (Ten {rnValue += 10; ONE += 1;})*);\nt5\t:\tFifty {rnValue += 50;} (Ten {rnValue += 10; ONE += 1;})*;\n\t\nunits\t:\t{ONE = 0;} (u9 | u5) {if (ONE > 3) System.out.println (\"Too many ones\");};\nu9\t:\tOne {ONE += 1;} (Five {rnValue += 4;}| Ten {rnValue += 9;}|{rnValue += 1;} (One {rnValue += 1; ONE += 1;})*);\nu5\t:\tFive {rnValue += 5;} (One {rnValue += 1; ONE += 1;})*;\n\t\nOne\t:\t'I';\nFive\t:\t'V';\nTen\t:\t'X';\nFifty\t:\t'L';\nHundred:\t'C';\nFiveHund:\t'D';\nThousand:\t'M' ;\nNEWLINE:\t'\\r'? '\\n' ;\n","language":"ANTLR"},{"code":"fromRoman←{\n rmn←(⎕A,⎕A,'*')[(⎕A,⎕UCS 96+⍳26)⍳⍵] ⍝ make input uppercase\n dgt←↑'IVXLCDM' (1 5 10 50 100 500 1000) ⍝ values of roman digits\n ~rmn∧.∊⊂dgt[1;]:⎕SIGNAL 11 ⍝ domain error if non-roman input\n map←dgt[2;dgt[1;]⍳rmn] ⍝ map digits to values\n +/map×1-2×(2</map),0 ⍝ subtractive principle\n}\n","language":"APL"},{"code":"------------- INTEGER VALUE OF A ROMAN STRING ------------\n\n-- romanValue :: String -> Int\non romanValue(s)\n script roman\n property mapping : [[\"M\", 1000], [\"CM\", 900], [\"D\", 500], [\"CD\", 400], ¬\n [\"C\", 100], [\"XC\", 90], [\"L\", 50], [\"XL\", 40], [\"X\", 10], [\"IX\", 9], ¬\n [\"V\", 5], [\"IV\", 4], [\"I\", 1]]\n\n -- Value of first Roman glyph + value of remaining glyphs\n -- toArabic :: [Char] -> Int\n on toArabic(xs)\n -- transcribe :: (String, Number) -> Maybe (Number, [String])\n script transcribe\n on |λ|(pair)\n set {r, v} to pair\n if isPrefixOf(characters of r, xs) then\n\n -- Value of this matching glyph, with any remaining glyphs\n {v, drop(length of r, xs)}\n else\n {}\n end if\n end |λ|\n end script\n\n if 0 < length of xs then\n set parsed to concatMap(transcribe, mapping)\n (item 1 of parsed) + toArabic(item 2 of parsed)\n else\n 0\n end if\n end toArabic\n end script\n\n toArabic(characters of s) of roman\nend romanValue\n\n--------------------------- TEST -------------------------\non run\n map(romanValue, {\"MCMXC\", \"MDCLXVI\", \"MMVIII\"})\n\n --> {1990, 1666, 2008}\nend run\n\n\n-------------------- GENERIC FUNCTIONS -------------------\n\n-- concatMap :: (a -> [b]) -> [a] -> [b]\non concatMap(f, xs)\n set lng to length of xs\n set acc to {}\n tell mReturn(f)\n repeat with i from 1 to lng\n set acc to acc & (|λ|(item i of xs, i, xs))\n end repeat\n end tell\n if {text, string} contains class of xs then\n acc as text\n else\n acc\n end if\nend concatMap\n\n\n-- drop :: Int -> [a] -> [a]\n-- drop :: Int -> String -> String\non drop(n, xs)\n set c to class of xs\n if script is not c then\n if string is not c then\n if n < length of xs then\n items (1 + n) thru -1 of xs\n else\n {}\n end if\n else\n if n < length of xs then\n text (1 + n) thru -1 of xs\n else\n \"\"\n end if\n end if\n else\n take(n, xs) -- consumed\n return xs\n end if\nend drop\n\n\n-- isPrefixOf :: [a] -> [a] -> Bool\n-- isPrefixOf :: String -> String -> Bool\non isPrefixOf(xs, ys)\n -- isPrefixOf takes two lists or strings and returns\n -- true if and only if the first is a prefix of the second.\n script go\n on |λ|(xs, ys)\n set intX to length of xs\n if intX < 1 then\n true\n else if intX > length of ys then\n false\n else if class of xs is string then\n (offset of xs in ys) = 1\n else\n set {xxt, yyt} to {uncons(xs), uncons(ys)}\n ((item 1 of xxt) = (item 1 of yyt)) and ¬\n |λ|(item 2 of xxt, item 2 of yyt)\n end if\n end |λ|\n end script\n go's |λ|(xs, ys)\nend isPrefixOf\n\n\n-- length :: [a] -> Int\non |length|(xs)\n set c to class of xs\n if list is c or string is c then\n length of xs\n else\n (2 ^ 29 - 1) -- (maxInt - simple proxy for non-finite)\n end if\nend |length|\n\n\n-- map :: (a -> b) -> [a] -> [b]\non map(f, xs)\n tell mReturn(f)\n set lng to length of xs\n set lst to {}\n repeat with i from 1 to lng\n set end of lst to |λ|(item i of xs, i, xs)\n end repeat\n return lst\n end tell\nend map\n\n\n-- Lift 2nd class handler function into 1st class script wrapper\n-- mReturn :: Handler -> Script\non mReturn(f)\n if class of f is script then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n\n\n-- uncons :: [a] -> Maybe (a, [a])\non uncons(xs)\n set lng to |length|(xs)\n if 0 = lng then\n missing value\n else\n if (2 ^ 29 - 1) as integer > lng then\n if class of xs is string then\n set cs to text items of xs\n {item 1 of cs, rest of cs}\n else\n {item 1 of xs, rest of xs}\n end if\n else\n set nxt to take(1, xs)\n if {} is nxt then\n missing value\n else\n {item 1 of nxt, xs}\n end if\n end if\n end if\nend uncons\n","language":"AppleScript"},{"code":"{1990, 1666, 2008}\n","language":"AppleScript"},{"code":"use framework \"Foundation\"\n\n----------- INTEGER VALUE OF ROMAN NUMBER STRING ---------\n\n-- fromRoman :: String -> Int\non fromRoman(s)\n script subtractIfLower\n on |λ|(l, rn)\n set {r, n} to rn\n if l ≥ r then -- Digit values that increase (L to R),\n {l, n + l} -- (added)\n else\n {l, n - l} -- Digit values that go down: subtracted.\n end if\n end |λ|\n end script\n\n item 2 of foldr(subtractIfLower, {0, 0}, ¬\n map(my charVal, characters of s))\nend fromRoman\n\n\n-- charVal :: Char -> Int\non charVal(C)\n set v to lookup(toUpper(C), ¬\n {I:1, |V|:5, X:10, |L|:50, C:100, D:500, M:1000})\n if missing value is v then\n 0\n else\n v\n end if\nend charVal\n\n\n--------------------------- TEST -------------------------\non run\n map(fromRoman, ¬\n {\"MDCLXVI\", \"MCMXC\", \"MMVIII\", \"MMXVI\", \"MMXXI\"})\n\n --> {1666, 1990, 2008, 2016, 2021}\nend run\n\n\n-------------------- GENERIC FUNCTIONS -------------------\n\n-- foldr :: (a -> b -> b) -> b -> [a] -> b\non foldr(f, startValue, xs)\n tell mReturn(f)\n set v to startValue\n set lng to length of xs\n repeat with I from lng to 1 by -1\n set v to |λ|(item I of xs, v)\n end repeat\n return v\n end tell\nend foldr\n\n\n-- lookup :: a -> Dict -> Maybe b\non lookup(k, dct)\n -- Just the value of k in the dictionary,\n -- or missing value if k is not found.\n set ca to current application\n set v to (ca's NSDictionary's dictionaryWithDictionary:dct)'s ¬\n objectForKey:k\n if missing value ≠ v then\n item 1 of ((ca's NSArray's arrayWithObject:v) as list)\n else\n missing value\n end if\nend lookup\n\n\n-- map :: (a -> b) -> [a] -> [b]\non map(f, xs)\n -- The list obtained by applying f\n -- to each element of xs.\n tell mReturn(f)\n set lng to length of xs\n set lst to {}\n repeat with I from 1 to lng\n set end of lst to |λ|(item I of xs, I, xs)\n end repeat\n return lst\n end tell\nend map\n\n\n-- Lift 2nd class handler function into 1st class\n-- script wrapper\n-- mReturn :: Handler -> Script\non mReturn(f)\n if class of f is script then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n\n\n-- toUpper :: String -> String\non toUpper(str)\n tell current application\n ((its (NSString's stringWithString:(str)))'s ¬\n uppercaseStringWithLocale:¬\n (its NSLocale's currentLocale())) as text\n end tell\nend toUpper\n","language":"AppleScript"},{"code":"{1666, 1990, 2008, 2016, 2021}\n","language":"AppleScript"},{"code":" 10 LET R$ = \"MCMXCIX\"\n 20 GOSUB 100 PRINT \"ROMAN NUMERALS DECODED\"\n 30 LET R$ = \"MMXII\"\n 40 GOSUB 100\n 50 LET R$ = \"MDCLXVI\"\n 60 GOSUB 100\n 70 LET R$ = \"MMMDCCCLXXXVIII\"\n 80 GOSUB 100\n 90 END\n 100 PRINT M$R$,\n 110 LET M$ = CHR$ (13)\n 120 GOSUB 150\"ROMAN NUMERALS DECODE given R$\"\n 130 PRINT N;\n 140 RETURN\n 150 IF NOT C THEN GOSUB 250INITIALIZE\n 160 LET J = 0\n 170 LET N = 0\n 180 FOR I = LEN (R$) TO 1 STEP - 1\n 190 LET P = J\n 200 FOR J = 1 TO C\n 210 IF MID$ (C$,J,1) < > MID$ (R$,I,1) THEN NEXT J\n 220 IF J < = C THEN N = N + R(J) * ((J > = P) * 2 - 1)\n 230 NEXT I\n 240 RETURN\n 250 READ C$\n 260 LET C = LEN (C$)\n 270 DIM R(C)\n 280 FOR I = 0 TO C\n 290 READ R(I)\n 300 NEXT I\n 310 RETURN\n 320 DATA \"IVXLCDM\",0,1,5,10,50,100,500,1000\n","language":"Applesoft-BASIC"},{"code":"syms: #[ M: 1000, D: 500, C: 100, L: 50, X: 10, V: 5, I: 1 ]\n\nfromRoman: function [roman][\n\tret: 0\n\tloop 0..(size roman)-2 'ch [\n\t\tfst: roman\\[ch]\n\t\tsnd: roman\\[ch+1]\n\t\tvalueA: syms\\[fst]\n\t\tvalueB: syms\\[snd]\n\n\t\tif? valueA < valueB -> ret: ret - valueA\n\t \telse\t\t\t\t-> ret: ret + valueA\n\t]\n\treturn ret + syms\\[last roman]\n]\n\nloop [\"MCMXC\" \"MMVIII\" \"MDCLXVI\"] 'r -> print [r \"->\" fromRoman r]\n","language":"Arturo"},{"code":"Roman_Decode(str){\n\tres := 0\n\tLoop Parse, str\n\t{\n\t\tn := {M: 1000, D:500, C:100, L:50, X:10, V:5, I:1}[A_LoopField]\n\t\tIf ( n > OldN ) && OldN\n\t\t\tres -= 2*OldN\n\t\tres += n, oldN := n\n\t}\n\treturn res\n}\n\ntest = MCMXC|MMVIII|MDCLXVI\nLoop Parse, test, |\n res .= A_LoopField \"`t= \" Roman_Decode(A_LoopField) \"`r`n\"\nclipboard := res\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f ROMAN_NUMERALS_DECODE.AWK\nBEGIN {\n leng = split(\"MCMXC MMVIII MDCLXVI\",arr,\" \")\n for (i=1; i<=leng; i++) {\n n = arr[i]\n printf(\"%s = %s\\n\",n,roman2arabic(n))\n }\n exit(0)\n}\nfunction roman2arabic(r, a,i,p,q,u,ua,una,unr) {\n r = toupper(r)\n unr = \"MDCLXVI\" # each Roman numeral in descending order\n una = \"1000 500 100 50 10 5 1\" # and its Arabic equivalent\n split(una,ua,\" \")\n i = split(r,u,\"\")\n a = ua[index(unr,u[i])]\n while (--i) {\n p = index(unr,u[i])\n q = index(unr,u[i+1])\n a += ua[p] * ((p>q) ? -1 : 1)\n }\n return( (a>0) ? a : \"\" )\n}\n","language":"AWK"},{"code":"function romToDec (roman$)\n num = 0\n prenum = 0\n for i = length(roman$) to 1 step -1\n x$ = mid(roman$, i, 1)\n n = 0\n if x$ = \"M\" then n = 1000\n if x$ = \"D\" then n = 500\n if x$ = \"C\" then n = 100\n if x$ = \"L\" then n = 50\n if x$ = \"X\" then n = 10\n if x$ = \"V\" then n = 5\n if x$ = \"I\" then n = 1\n\n if n < preNum then num -= n else num += n\n preNum = n\n next i\n\n return num\nend function\n\n#Testing\nprint \"MCMXCIX = \"; romToDec(\"MCMXCIX\") #1999\nprint \"MDCLXVI = \"; romToDec(\"MDCLXVI\") #1666\nprint \"XXV = \"; romToDec(\"XXV\") #25\nprint \"CMLIV = \"; romToDec(\"CMLIV\") #954\nprint \"MMXI = \"; romToDec(\"MMXI\") #2011\n","language":"BASIC256"},{"code":"@echo off\nsetlocal enabledelayedexpansion\n\n::Testing...\ncall :toArabic MCMXC\necho MCMXC = !arabic!\ncall :toArabic MMVIII\necho MMVIII = !arabic!\ncall :toArabic MDCLXVI\necho MDCLXVI = !arabic!\ncall :toArabic CDXLIV\necho CDXLIV = !arabic!\ncall :toArabic XCIX\necho XCIX = !arabic!\npause>nul\nexit/b 0\n\n::The \"function\"...\n:toArabic\nset roman=%1\nset arabic=\nset lastval=\n\t%== Alternative for counting the string length ==%\nset leng=-1\nfor /l %%. in (0,1,1000) do set/a leng+=1&if \"!roman:~%%.,1!\"==\"\" goto break\n:break\nset /a last=!leng!-1\nfor /l %%i in (!last!,-1,0) do (\n\tset n=0\n\tif /i \"!roman:~%%i,1!\"==\"M\" set n=1000\n\tif /i \"!roman:~%%i,1!\"==\"D\" set n=500\n\tif /i \"!roman:~%%i,1!\"==\"C\" set n=100\n\tif /i \"!roman:~%%i,1!\"==\"L\" set n=50\n\tif /i \"!roman:~%%i,1!\"==\"X\" set n=10\n\tif /i \"!roman:~%%i,1!\"==\"V\" set n=5\n\tif /i \"!roman:~%%i,1!\"==\"I\" set n=1\n\t\n\tif !n! lss !lastval! (\n\t\tset /a arabic-=n\n\t) else (\n\t\tset /a arabic+=n\n\t)\n\tset lastval=!n!\n)\ngoto :EOF\n","language":"Batch-File"},{"code":" PRINT \"MCMXCIX\", FNromandecode(\"MCMXCIX\")\n PRINT \"MMXII\", FNromandecode(\"MMXII\")\n PRINT \"MDCLXVI\", FNromandecode(\"MDCLXVI\")\n PRINT \"MMMDCCCLXXXVIII\", FNromandecode(\"MMMDCCCLXXXVIII\")\n END\n\n DEF FNromandecode(roman$)\n LOCAL i%, j%, p%, n%, r%()\n DIM r%(7) : r%() = 0,1,5,10,50,100,500,1000\n FOR i% = LEN(roman$) TO 1 STEP -1\n j% = INSTR(\"IVXLCDM\", MID$(roman$,i%,1))\n IF j%=0 ERROR 100, \"Invalid character\"\n IF j%>=p% n% += r%(j%) ELSE n% -= r%(j%)\n p% = j%\n NEXT\n = n%\n","language":"BBC-BASIC"},{"code":"get \"libhdr\"\n\nlet roman(s) = valof\n$( let digit(ch) = valof\n $( let ds = table 'm','d','c','l','x','v','i'\n let vs = table 1000,500,100,50,10,5,1\n for i=0 to 6\n if ds!i=(ch|32) then resultis vs!i\n resultis 0\n $)\n let acc = 0\n for i=1 to s%0\n $( let d = digit(s%i)\n if d=0 then resultis 0\n test i<s%0 & d<digit(s%(i+1))\n do acc := acc-d\n or acc := acc+d\n $)\n resultis acc\n$)\n\nlet show(s) be writef(\"%S: %N*N\", s, roman(s))\n\nlet start() be\n$( show(\"MCMXC\")\n show(\"MDCLXVI\")\n show(\"MMVII\")\n show(\"MMXXI\")\n$)\n","language":"BCPL"},{"code":"⟨ToArabic⇐A⟩ ← {\n c ← \"IVXLCDM\" # Characters\n v ← ⥊ (10⋆↕4) ×⌜ 1‿5 # Their values\n A ⇐ +´∘(⊢ׯ1⋆<⟜«) v ⊏˜ c ⊐ ⊢\n}\n","language":"BQN"},{"code":" ToArabic¨ \"MCMXC\"‿\"MDCLXVI\"‿\"MMVII\"‿\"MMXXI\"\n⟨ 1990 1666 2007 2021 ⟩\n","language":"BQN"},{"code":" ( unroman\n = nbr,lastVal,val\n . 0:?nbr:?lastVal\n & @( low$!arg\n : ?\n %@?L\n ( ?\n & (m.1000)\n (d.500)\n (c.100)\n (l.50)\n (x.10)\n (v.5)\n (i.1)\n : ? (!L.?val) ?\n & (!val:~>!lastVal|!val+-2*!lastVal)\n + !nbr\n : ?nbr\n & !val:?lastVal\n & ~\n )\n )\n | !nbr\n )\n& (M.1000)\n (MCXI.1111)\n (CMXI.911)\n (MCM.1900)\n (MCMXC.1990)\n (MMVIII.2008)\n (MMIX.2009)\n (MCDXLIV.1444)\n (MDCLXVI.1666)\n (MMXII.2012)\n : ?years\n& (test=.out$(!arg unroman$!arg))\n& ( !years\n : ? (?L.?D) (?&test$!L&~)\n | done\n );\n","language":"Bracmat"},{"code":"#include <stdio.h>\n\nint digits[26] = { 0, 0, 100, 500, 0, 0, 0, 0, 1, 1, 0, 50, 1000, 0, 0, 0, 0, 0, 0, 0, 5, 5, 0, 10, 0, 0 };\n\n/* assuming ASCII, do upper case and get index in alphabet. could also be\n inline int VALUE(char x) { return digits [ (~0x20 & x) - 'A' ]; }\n if you think macros are evil */\n#define VALUE(x) digits[(~0x20 & (x)) - 'A']\n\nint decode(const char * roman)\n{\n const char *bigger;\n int current;\n int arabic = 0;\n while (*roman != '\\0') {\n current = VALUE(*roman);\n /* if (!current) return -1;\n note: -1 can be used as error code; Romans didn't even have zero\n */\n bigger = roman;\n\n /* look for a larger digit, like IV or XM */\n while (VALUE(*bigger) <= current && *++bigger != '\\0');\n\n if (*bigger == '\\0')\n arabic += current;\n else {\n arabic += VALUE(*bigger);\n while (roman < bigger)\n arabic -= VALUE(* (roman++) );\n }\n\n roman ++;\n }\n return arabic;\n}\n\nint main()\n{\n const char * romans[] = { \"MCmxC\", \"MMVIII\", \"MDClXVI\", \"MCXLUJ\" };\n int i;\n\n for (i = 0; i < 4; i++)\n printf(\"%s\\t%d\\n\", romans[i], decode(romans[i]));\n\n return 0;\n}\n","language":"C"},{"code":"#include <exception>\n#include <string>\n#include <iostream>\nusing namespace std;\n\nnamespace Roman\n{\n\tint ToInt(char c)\n\t{\n\t\tswitch (c)\n\t\t{\n\t\t\tcase 'I': return 1;\n\t\t\tcase 'V': return 5;\n\t\t\tcase 'X': return 10;\n\t\t\tcase 'L': return 50;\n\t\t\tcase 'C': return 100;\n\t\t\tcase 'D': return 500;\n\t\t\tcase 'M': return 1000;\n\t\t}\n\t\tthrow exception(\"Invalid character\");\n\t}\n\n\tint ToInt(const string& s)\n\t{\n\t\tint retval = 0, pvs = 0;\n\t\tfor (auto pc = s.rbegin(); pc != s.rend(); ++pc)\n\t\t{\n\t\t\tconst int inc = ToInt(*pc);\n\t\t\tretval += inc < pvs ? -inc : inc;\n\t\t\tpvs = inc;\n\t\t}\n\t\treturn retval;\n\t}\n}\n\nint main(int argc, char* argv[])\n{\n\ttry\n\t{\n\t\tcout << \"MCMXC = \" << Roman::ToInt(\"MCMXC\") << \"\\n\";\n\t\tcout << \"MMVIII = \" << Roman::ToInt(\"MMVIII\") << \"\\n\";\n\t\tcout << \"MDCLXVI = \" << Roman::ToInt(\"MDCLXVI\") << \"\\n\";\n\t}\n\tcatch (exception& e)\n\t{\n\t\tcerr << e.what();\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\n\nnamespace Roman\n{\n internal class Program\n {\n private static void Main(string[] args)\n {\n // Decode and print the numerals.\n Console.WriteLine(\"{0}: {1}\", \"MCMXC\", Decode(\"MCMXC\"));\n Console.WriteLine(\"{0}: {1}\", \"MMVIII\", Decode(\"MMVIII\"));\n Console.WriteLine(\"{0}: {1}\", \"MDCLXVI\", Decode(\"MDCLXVI\"));\n }\n\n // Dictionary to hold our numerals and their values.\n private static readonly Dictionary<char, int> RomanDictionary = new Dictionary<char, int>\n {\n {'I', 1},\n {'V', 5},\n {'X', 10},\n {'L', 50},\n {'C', 100},\n {'D', 500},\n {'M', 1000}\n };\n\n private static int Decode(string roman)\n {\n /* Make the input string upper-case,\n * because the dictionary doesn't support lower-case characters. */\n roman = roman.ToUpper();\n\n /* total = the current total value that will be returned.\n * minus = value to subtract from next numeral. */\n int total = 0, minus = 0;\n\n for (int i = 0; i < roman.Length; i++) // Iterate through characters.\n {\n // Get the value for the current numeral. Takes subtraction into account.\n int thisNumeral = RomanDictionary[roman[i]] - minus;\n\n /* Checks if this is the last character in the string, or if the current numeral\n * is greater than or equal to the next numeral. If so, we will reset our minus\n * variable and add the current numeral to the total value. Otherwise, we will\n * subtract the current numeral from the next numeral, and continue. */\n if (i >= roman.Length - 1 ||\n thisNumeral + minus >= RomanDictionary[roman[i + 1]])\n {\n total += thisNumeral;\n minus = 0;\n }\n else\n {\n minus = thisNumeral;\n }\n }\n\n return total; // Return the total.\n }\n }\n}\n","language":"C-sharp"},{"code":"shared void run() {\n\t\n\tvalue numerals = map {\n\t\t'I' -> 1,\n\t\t'V' -> 5,\n\t\t'X' -> 10,\n\t\t'L' -> 50,\n\t\t'C' -> 100,\n\t\t'D' -> 500,\n\t\t'M' -> 1000\n\t};\n\t\n\tfunction toHindu(String roman) {\n\t\tvariable value total = 0;\n\t\tfor(i->c in roman.indexed) {\n\t\t\tassert(exists currentValue = numerals[c]);\n\t\t\t/* Look at the next letter to see if we're looking\n\t\t\t at a IV or CM or whatever. If so subtract the\n\t\t\t current number from the total. */\n\t\t\tif(exists next = roman[i + 1],\n\t\t\t\texists nextValue = numerals[next],\n\t\t\t\tcurrentValue < nextValue) {\n\t\t\t\ttotal -= currentValue;\n\t\t\t} else {\n\t\t\t\ttotal += currentValue;\n\t\t\t}\n\t\t}\n\t\treturn total;\n\t}\n\t\n\tassert(toHindu(\"I\") == 1);\n\tassert(toHindu(\"II\") == 2);\n\tassert(toHindu(\"IV\") == 4);\n\tassert(toHindu(\"MDCLXVI\") == 1666);\n\tassert(toHindu(\"MCMXC\") == 1990);\n\tassert(toHindu(\"MMVIII\") == 2008);\n}\n","language":"Ceylon"},{"code":"100 cls : rem 100 home for Applesoft BASIC\n110 roman$ = \"MCMXCIX\" : print roman$,\"=> \"; : gosub 170 : print decimal '1999\n120 roman$ = \"XXV\" : print roman$,\"=> \"; : gosub 170 : print decimal '25\n130 roman$ = \"CMLIV\" : print roman$,\"=> \"; : gosub 170 : print decimal '954\n140 roman$ = \"MMXI\" : print roman$,\"=> \"; : gosub 170 : print decimal '2011\n150 end\n160 rem Decode from roman\n170 decimal = 0\n180 predecimal = 0\n190 for i = len(roman$) to 1 step -1\n200 x$ = mid$(roman$,i,1)\n210 if x$ = \"M\" then n = 1000 : goto 280\n220 if x$ = \"D\" then n = 500 : goto 280\n230 if x$ = \"C\" then n = 100 : goto 280\n240 if x$ = \"L\" then n = 50 : goto 280\n250 if x$ = \"X\" then n = 10 : goto 280\n260 if x$ = \"V\" then n = 5 : goto 280\n270 if x$ = \"I\" then n = 1\n280 if n < predecimal then decimal = decimal-n\n285 if n >= predecimal then decimal = decimal+n\n290 predecimal = n\n300 next i\n310 return\n","language":"Chipmunk-Basic"},{"code":"100 cls\n110 roman$ = \"MCMXCIX\" : print roman$,\"=> \"; : gosub 170 : print decimal '1999\n120 roman$ = \"XXV\" : print roman$,\"=> \"; : gosub 170 : print decimal '25\n130 roman$ = \"CMLIV\" : print roman$,\"=> \"; : gosub 170 : print decimal '954\n140 roman$ = \"MMXI\" : print roman$,\"=> \"; : gosub 170 : print decimal '2011\n150 end\n160 rem Decode from roman\n170 decimal = 0\n180 predecimal = 0\n190 for i = len(roman$) to 1 step -1\n200 x$ = mid$(roman$,i,1)\n210 select case x$\n220 case \"M\" : n = 1000\n230 case \"D\" : n = 500\n240 case \"C\" : n = 100\n250 case \"L\" : n = 50\n260 case \"X\" : n = 10\n270 case \"V\" : n = 5\n280 case \"I\" : n = 1\n290 case else : print \"not a roman numeral\" : end\n300 end select\n310 if n < predecimal then decimal = decimal-n else decimal = decimal+n\n320 predecimal = n\n330 next i\n340 return\n","language":"Chipmunk-Basic"},{"code":";; Incorporated some improvements from the alternative implementation below\n(defn ro2ar [r]\n (->> (reverse (.toUpperCase r))\n (map {\\M 1000 \\D 500 \\C 100 \\L 50 \\X 10 \\V 5 \\I 1})\n (partition-by identity)\n (map (partial apply +))\n (reduce #(if (< %1 %2) (+ %1 %2) (- %1 %2)))))\n\n;; alternative\n(def numerals { \\I 1, \\V 5, \\X 10, \\L 50, \\C 100, \\D 500, \\M 1000})\n(defn from-roman [s]\n (->> s .toUpperCase\n (map numerals)\n (reduce (fn [[sum lastv] curr] [(+ sum curr (if (< lastv curr) (* -2 lastv) 0)) curr]) [0,0])\n first))\n","language":"Clojure"},{"code":"roman = cluster is decode\n rep = null\n\n digit_value = proc (c: char) returns (int) signals (invalid)\n if c < 'a' then c := char$i2c(char$c2i(c) + 32) end\n if c = 'm' then return(1000)\n elseif c = 'd' then return(500)\n elseif c = 'c' then return(100)\n elseif c = 'l' then return(50)\n elseif c = 'x' then return(10)\n elseif c = 'v' then return(5)\n elseif c = 'i' then return(1)\n else signal invalid\n end\n end digit_value\n\n decode = proc (s: string) returns (int) signals (invalid)\n acc: int := 0\n for i: int in int$from_to(1, string$size(s)) do\n d: int := digit_value(s[i])\n if i < string$size(s) cand d < digit_value(s[i+1]) then\n acc := acc - d\n else\n acc := acc + d\n end\n end resignal invalid\n return(acc)\n end decode\nend roman\n\nstart_up = proc ()\n po: stream := stream$primary_output()\n tests: array[string] := array[string]$\n [\"MCMXC\", \"mdclxvi\", \"MmViI\", \"mmXXi\", \"INVALID\"]\n\n for test: string in array[string]$elements(tests) do\n stream$puts(po, test || \": \")\n stream$putl(po, int$unparse(roman$decode(test))) except when invalid:\n stream$putl(po, \"not a valid Roman numeral!\")\n end\n end\nend start_up\n","language":"CLU"},{"code":" IDENTIFICATION DIVISION.\n PROGRAM-ID. UNROMAN.\n DATA DIVISION.\n WORKING-STORAGE SECTION.\n 01 filler.\n 03 i pic 9(02) comp.\n 03 j pic 9(02) comp.\n 03 k pic 9(02) comp.\n 03 l pic 9(02) comp.\n 01 inp-roman.\n 03 inp-rom-ch pic x(01) occurs 20 times.\n 01 inp-roman-digits.\n 03 inp-rom-digit pic 9(01) occurs 20 times.\n 01 ws-search-idx pic 9(02) comp.\n 01 ws-tbl-table-def.\n 03 filler pic x(05) value '1000M'.\n 03 filler pic x(05) value '0500D'.\n 03 filler pic x(05) value '0100C'.\n 03 filler pic x(05) value '0050L'.\n 03 filler pic x(05) value '0010X'.\n 03 filler pic x(05) value '0005V'.\n 03 filler pic x(05) value '0001I'.\n 01 filler redefines ws-tbl-table-def.\n 03 ws-tbl-roman occurs 07 times indexed by rx.\n 05 ws-tbl-rom-val pic 9(04).\n 05 ws-tbl-rom-ch pic x(01).\n 01 ws-number pic s9(05) value 0.\n 01 ws-number-pic pic zzzz9-.\n\n PROCEDURE DIVISION.\n accept inp-roman\n perform\n until inp-roman = ' '\n move zeroes to inp-roman-digits\n perform\n varying i from 1 by +1 until inp-rom-ch (i) = ' '\n set rx to 1\n search ws-tbl-roman\n at end\n move 0 to inp-rom-digit (i)\n when ws-tbl-rom-ch (rx) = inp-rom-ch (i)\n set inp-rom-digit (i) to rx\n end-search\n end-perform\n compute l = i - 1\n move 0 to ws-number\n perform\n varying i from 1 by +1\n until i > l or inp-rom-digit (i) = 0\n compute j = inp-rom-digit (i)\n compute k = inp-rom-digit (i + 1)\n if ws-tbl-rom-val (k)\n > ws-tbl-rom-val (j)\n compute ws-number\n = ws-number\n - ws-tbl-rom-val (j)\n else\n compute ws-number\n = ws-number\n + ws-tbl-rom-val (j)\n end-if\n end-perform\n move ws-number to ws-number-pic\n display '----------'\n display 'roman=' inp-roman\n display 'arabic=' ws-number-pic\n if i < l or ws-number = 0\n display 'invalid/incomplete roman numeral at pos 'i\n ' found ' inp-rom-ch (i)\n end-if\n accept inp-roman\n end-perform\n stop run\n .\n END PROGRAM UNROMAN.\n","language":"COBOL"},{"code":"roman_to_demical = (s) ->\n # s is well-formed Roman Numeral >= I\n numbers =\n M: 1000\n D: 500\n C: 100\n L: 50\n X: 10\n V: 5\n I: 1\n\n result = 0\n for c in s\n num = numbers[c]\n result += num\n if old_num < num\n # If old_num exists and is less than num, then\n # we need to subtract it twice, once because we\n # have already added it on the last pass, and twice\n # to conform to the Roman convention that XC = 90,\n # not 110.\n result -= 2 * old_num\n old_num = num\n result\n\ntests =\n IV: 4\n XLII: 42\n MCMXC: 1990\n MMVIII: 2008\n MDCLXVI: 1666\n\nfor roman, expected of tests\n dec = roman_to_demical(roman)\n console.log \"error\" if dec != expected\n console.log \"#{roman} = #{dec}\"\n","language":"CoffeeScript"},{"code":"(defun mapcn (chars nums string)\n (loop as char across string as i = (position char chars) collect (and i (nth i nums))))\n\n(defun parse-roman (R)\n (loop with nums = (mapcn \"IVXLCDM\" '(1 5 10 50 100 500 1000) R)\n as (A B) on nums if A sum (if (and B (< A B)) (- A) A)))\n","language":"Common-Lisp"},{"code":"(dolist (r '(\"MCMXC\" \"MDCLXVI\" \"MMVIII\"))\n (format t \"~a:~10t~d~%\" r (parse-roman r)))\n","language":"Common-Lisp"},{"code":"include \"cowgol.coh\";\ninclude \"argv.coh\";\n\n# Decode the Roman numeral in the given string.\n# Returns 0 if the string does not contain a valid Roman numeral.\nsub romanToDecimal(str: [uint8]): (rslt: uint16) is\n # Look up a Roman digit\n sub digit(char: uint8): (val: uint16) is\n # Definition of Roman numerals\n record RomanDigit is\n char: uint8;\n value: uint16;\n end record;\n\n var digits: RomanDigit[] := {\n {'I',1}, {'V',5}, {'X',10}, {'L',50},\n {'C',100}, {'D',500}, {'M',1000}\n };\n\n char := char & ~32; # make uppercase\n\n # Look up given digit\n var i: @indexof digits := 0;\n while i < @sizeof digits loop\n val := digits[i].value;\n if digits[i].char == char then\n return;\n end if;\n i := i + 1;\n end loop;\n val := 0;\n end sub;\n\n rslt := 0;\n while [str] != 0 loop\n var cur := digit([str]); # get value of current digit\n if cur == 0 then rslt := 0; return; end if; # stop when invalid\n str := @next str;\n if digit([str]) > cur then\n # a digit followed by a larger digit should be subtracted from\n # the total\n rslt := rslt - cur;\n else\n rslt := rslt + cur;\n end if;\n end loop;\nend sub;\n\n# Read a Roman numeral from the command line and print its output\nArgvInit();\nvar argmt := ArgvNext();\nif argmt == (0 as [uint8]) then\n # No argument\n print(\"No argument\\n\");\n ExitWithError();\nend if;\n\nprint_i16(romanToDecimal(argmt));\nprint_nl();\n","language":"Cowgol"},{"code":"import std.regex, std.algorithm;\n\nint toArabic(in string s) /*pure nothrow*/ {\n static immutable weights = [1000, 900, 500, 400, 100,\n 90, 50, 40, 10, 9, 5, 4, 1];\n static immutable symbols = [\"M\",\"CM\",\"D\",\"CD\",\"C\",\"XC\",\n \"L\",\"XL\",\"X\",\"IX\",\"V\",\"IV\",\"I\"];\n\n int arabic;\n foreach (m; s.matchAll(\"CM|CD|XC|XL|IX|IV|[MDCLXVI]\".regex))\n arabic += weights[symbols.countUntil(m.hit)];\n return arabic;\n}\n\nvoid main() {\n assert(\"MCMXC\".toArabic == 1990);\n assert(\"MMVIII\".toArabic == 2008);\n assert(\"MDCLXVI\".toArabic == 1666);\n}\n","language":"D"},{"code":"import std.regex, std.algorithm;\n\nimmutable uint[string] w2s;\n\npure nothrow static this() {\n w2s = [\"IX\": 9, \"C\": 100, \"D\": 500, \"CM\": 900, \"I\": 1,\n \"XC\": 90, \"M\": 1000, \"L\": 50, \"CD\": 400, \"XL\": 40,\n \"V\": 5, \"X\": 10, \"IV\": 4];\n}\n\nuint toArabic(in string s) /*pure nothrow*/ @safe /*@nogc*/ {\n return s\n .matchAll(\"CM|CD|XC|XL|IX|IV|[MDCLXVI]\".regex)\n .map!(m => w2s[m.hit])\n .sum;\n}\n\nvoid main() {\n assert(\"MCMXC\".toArabic == 1990);\n assert(\"MMVIII\".toArabic == 2008);\n assert(\"MDCLXVI\".toArabic == 1666);\n}\n","language":"D"},{"code":"program RomanNumeralsDecode;\n\n{$APPTYPE CONSOLE}\n\nfunction RomanToInteger(const aRoman: string): Integer;\n function DecodeRomanDigit(aChar: Char): Integer;\n begin\n case aChar of\n 'M', 'm': Result := 1000;\n 'D', 'd': Result := 500;\n 'C', 'c': Result := 100;\n 'L', 'l': Result := 50;\n 'X', 'x': Result := 10;\n 'V', 'v': Result := 5;\n 'I', 'i': Result := 1\n else\n Result := 0;\n end;\n end;\n\nvar\n i: Integer;\n lCurrVal: Integer;\n lLastVal: Integer;\nbegin\n Result := 0;\n\n lLastVal := 0;\n for i := Length(aRoman) downto 1 do\n begin\n lCurrVal := DecodeRomanDigit(aRoman[i]);\n if lCurrVal < lLastVal then\n Result := Result - lCurrVal\n else\n Result := Result + lCurrVal;\n lLastVal := lCurrVal;\n end;\nend;\n\nbegin\n Writeln(RomanToInteger('MCMXC')); // 1990\n Writeln(RomanToInteger('MMVIII')); // 2008\n Writeln(RomanToInteger('MDCLXVI')); // 1666\nend.\n","language":"Delphi"},{"code":"func rom2dec rom$ .\n symbols$[] = [ \"M\" \"D\" \"C\" \"L\" \"X\" \"V\" \"I\" ]\n values[] = [ 1000 500 100 50 10 5 1 ]\n val = 0\n for dig$ in strchars rom$\n for i = 1 to len symbols$[]\n if symbols$[i] = dig$\n v = values[i]\n .\n .\n val += v\n if oldv < v\n val -= 2 * oldv\n .\n oldv = v\n .\n return val\n.\nprint rom2dec \"MCMXC\"\nprint rom2dec \"MMVIII\"\nprint rom2dec \"MDCLXVI\"\n","language":"EasyLang"},{"code":"MapChar(STRING1 c) := CASE(c,'M'=>1000,'D'=>500,'C'=>100,'L'=>50,'X'=>10,'V'=>5,'I'=>1,0);\n\nRomanDecode(STRING s) := FUNCTION\n dsS := DATASET([{s}],{STRING Inp});\n R := { INTEGER2 i; };\n\n R Trans1(dsS le,INTEGER pos) := TRANSFORM\n SELF.i := MapChar(le.Inp[pos]) * IF ( MapChar(le.Inp[pos]) < MapChar(le.Inp[pos+1]), -1, 1 );\n END;\n\n RETURN SUM(NORMALIZE(dsS,LENGTH(TRIM(s)),Trans1(LEFT,COUNTER)),i);\nEND;\n\nRomanDecode('MCMLIV'); //1954\nRomanDecode('MCMXC'); //1990\nRomanDecode('MMVIII'); //2008\nRomanDecode('MDCLXVI'); //1666\nRomanDecode('MDLXVI'); //1566\n","language":"ECL"},{"code":"IMPORT STD;\nRomanDecode(STRING s) := FUNCTION\n SetWeights := [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1];\n SetSymbols := ['M', 'CM', 'D', 'CD', 'C', 'XC', 'L', 'XL', 'X', 'IX', 'V', 'IV', 'I'];\n ProcessRec := RECORD\n UNSIGNED val;\n STRING Roman;\n END;\n dsSymbols := DATASET(13,TRANSFORM(ProcessRec,SELF.Roman := s, SELF := []));\n\t\n RECORDOF(dsSymbols) XF(dsSymbols L, dsSymbols R, INTEGER C) := TRANSFORM\n ThisRoman := IF(C=1,R.Roman,L.Roman);\n IsDone := ThisRoman = '';\n Repeatable := C IN [1,5,9,13];\n SymSize := IF(C % 2 = 0, 2, 1);\n IsNext := STD.Str.StartsWith(ThisRoman,SetSymbols[C]);\n SymLen := IF(IsNext,\n IF(NOT Repeatable,\n SymSize,\n MAP(NOT IsDone AND ThisRoman[1] = ThisRoman[2] AND ThisRoman[1] = ThisRoman[3] => 3,\n NOT IsDone AND ThisRoman[1] = ThisRoman[2] => 2,\n NOT IsDone => 1,\n 0)),\n 0);\n\n SymbolWeight(STRING s) := IF(NOT Repeatable,\n SetWeights[C],\n CHOOSE(LENGTH(s),SetWeights[C],SetWeights[C]*2,SetWeights[C]*3,0));\n\n SELF.Roman := IF(IsDone,ThisRoman,ThisRoman[SymLen+1..]);\n SELF.val := IF(IsDone,L.val,L.Val + IF(IsNext,SymbolWeight(ThisRoman[1..SymLen]),0));\n END;\n i := ITERATE(dsSymbols,XF(LEFT,RIGHT,COUNTER));\n RETURN i[13].val;\nEND;\n\nRomanDecode('MCMLIV'); //1954\nRomanDecode('MCMXC'); //1990\nRomanDecode('MMVIII'); //2008\nRomanDecode('MDCLXVI'); //1666\nRomanDecode('MDLXVI'); //1566\n","language":"ECL"},{"code":"class\n\tAPPLICATION\n\ncreate\n\tmake\n\nfeature {NONE} -- Initialization\n\n\tmake\n\t\tlocal\n\t\t\tnumbers: ARRAY [STRING]\n\t\tdo\n\t\t\tnumbers := <<\"MCMXC\", \"MMVIII\", \"MDCLXVI\",\n\t\t\t -- 1990 2008 1666\n\t\t\t \"MMMCLIX\", \"MCMLXXVII\", \"MMX\">>\n\t\t\t -- 3159 1977 2010\n\t\t\tacross numbers as n loop\n\t\t\t\tprint (n.item +\n \" in Roman numerals is \" +\n\t\t\t\t roman_to_decimal (n.item).out +\n \" in decimal Arabic numerals.\")\n\t\t\t\tprint (\"%N\")\n\t\t\tend\n\t\tend\n\nfeature -- Roman numerals\n\n\troman_to_decimal (a_str: STRING): INTEGER\n\t\t-- Decimal representation of Roman numeral `a_str'\n\t\trequire\n\t\t\tis_roman (a_str)\n\t\tlocal\n\t\t\tl_pos: INTEGER\n\t\t\tcur: INTEGER -- Value of the digit read in the current iteration\n\t\t\tprev: INTEGER -- Value of the digit read in the previous iteration\n\t\tdo\n\t\t\tfrom\n\t\t\t\tl_pos := 0\n\t\t\t\tResult := 0\n\t\t\t\tprev := 1 + max_digit_value\n\t\t\tuntil\n\t\t\t\tl_pos = a_str.count\n\t\t\tloop\n\t\t\t\tl_pos := l_pos + 1\n\t\t\t\tcur := roman_digit_to_decimal (a_str.at (l_pos))\n\t\t\t\tif cur <= prev then\n\t\t\t\t\t-- Add nonincreasing digit\n\t\t\t\t\tResult := Result + cur\n\t\t\t\telse\n\t\t\t\t\t-- Subtract previous digit from increasing digit\n\t\t\t\t\tResult := Result - prev + (cur - prev)\n\t\t\t\tend\n\t\t\t\tprev := cur\n\t\t\tend\n\t\tensure\n\t\t\tResult >= 0\n\t\tend\n\n\tis_roman (a_string: STRING): BOOLEAN\n\t\t-- Is `a_string' a valid sequence of Roman digits?\n\t\tdo\n\t\t\tResult := across a_string as c all is_roman_digit (c.item) end\n\t\tend\n\nfeature {NONE} -- Implementation\n\n\tmax_digit_value: INTEGER = 1000\n\n\tis_roman_digit (a_char: CHARACTER): BOOLEAN\n\t\t-- Is `a_char' a valid Roman digit?\n\t\tlocal\n\t\t\tl_char: CHARACTER\n\t\tdo\n\t\t\tl_char := a_char.as_upper\n\t\t\tinspect l_char\n\t\t\t\twhen 'I', 'V', 'X', 'L', 'C', 'D', 'M' then\n\t\t\t\t\tResult := True\n\t\t\t\telse\n\t\t\t\t\tResult := False\n\t\t\tend\n\t\tend\n\n\troman_digit_to_decimal (a_char: CHARACTER): INTEGER\n\t\t-- Decimal representation of Roman digit `a_char'\n\t\trequire\n\t\t\tis_roman_digit (a_char)\n\t\tlocal\n\t\t\tl_char: CHARACTER\n\t\tdo\n\t\t\tl_char := a_char.as_upper\n\t\t\tinspect l_char\n\t\t\t\twhen 'I' then\n\t\t\t\t\tResult := 1\n\t\t\t\twhen 'V' then\n\t\t\t\t\tResult := 5\n\t\t\t\twhen 'X' then\n\t\t\t\t\tResult := 10\n\t\t\t\twhen 'L' then\n\t\t\t\t\tResult := 50\n\t\t\t\twhen 'C' then\n\t\t\t\t\tResult := 100\n\t\t\t\twhen 'D' then\n\t\t\t\t\tResult := 500\n\t\t\t\twhen 'M' then\n\t\t\t\t\tResult := 1000\n\t\t\tend\n\t\tensure\n\t\t\tResult > 0\n\t\tend\n\nend\n","language":"Eiffel"},{"code":"import extensions;\nimport system'collections;\nimport system'routines;\nimport system'culture;\n\nstatic RomanDictionary = Dictionary.new()\n .setAt(\"I\".toChar(), 1)\n .setAt(\"V\".toChar(), 5)\n .setAt(\"X\".toChar(), 10)\n .setAt(\"L\".toChar(), 50)\n .setAt(\"C\".toChar(), 100)\n .setAt(\"D\".toChar(), 500)\n .setAt(\"M\".toChar(), 1000);\n\nextension op : String\n{\n toRomanInt()\n {\n var minus := 0;\n var s := self.toUpper();\n var total := 0;\n\n for(int i := 0; i < s.Length; i += 1)\n {\n var thisNumeral := RomanDictionary[s[i]] - minus;\n if (i >= s.Length - 1 || thisNumeral + minus >= RomanDictionary[s[i + 1]])\n {\n total += thisNumeral;\n minus := 0\n }\n else\n {\n minus := thisNumeral\n }\n };\n\n ^ total\n }\n}\n\npublic program()\n{\n console.printLine(\"MCMXC: \", \"MCMXC\".toRomanInt());\n console.printLine(\"MMVIII: \", \"MMVIII\".toRomanInt());\n console.printLine(\"MDCLXVI:\", \"MDCLXVI\".toRomanInt())\n}\n","language":"Elena"},{"code":"defmodule Roman_numeral do\n def decode([]), do: 0\n def decode([x]), do: to_value(x)\n def decode([h1, h2 | rest]) do\n case {to_value(h1), to_value(h2)} do\n {v1, v2} when v1 < v2 -> v2 - v1 + decode(rest)\n {v1, _} -> v1 + decode([h2 | rest])\n end\n end\n\n defp to_value(?M), do: 1000\n defp to_value(?D), do: 500\n defp to_value(?C), do: 100\n defp to_value(?L), do: 50\n defp to_value(?X), do: 10\n defp to_value(?V), do: 5\n defp to_value(?I), do: 1\nend\n\nEnum.each(['MCMXC', 'MMVIII', 'MDCLXVI', 'IIIID'], fn clist ->\n IO.puts \"#{clist}\\t: #{Roman_numeral.decode(clist)}\"\nend)\n","language":"Elixir"},{"code":"(defun ro2ar (RN)\n \"Translate a roman number RN into arabic number.\n Its argument RN is wether a symbol, wether a list.\n Returns the arabic number. (ro2ar 'C) gives 100,\n (ro2ar '(X X I V)) gives 24\"\n (cond\n ((eq RN 'M) 1000)\n ((eq RN 'D) 500)\n ((eq RN 'C) 100)\n ((eq RN 'L) 50)\n ((eq RN 'X) 10)\n ((eq RN 'V) 5)\n ((eq RN 'I) 1)\n ((null (cdr RN)) (ro2ar (car RN))) ;; stop recursion\n ((< (ro2ar (car RN)) (ro2ar (car (cdr RN)))) (- (ro2ar (cdr RN)) (ro2ar (car RN)))) ;; \"IV\" -> 5-1=4\n (t (+ (ro2ar (car RN)) (ro2ar (cdr RN)))))) ;; \"VI\" -> 5+1=6\n","language":"Emacs-Lisp"},{"code":"-module( roman_numerals ).\n\n-export( [decode_from_string/1]).\n\nto_value($M) -> 1000;\nto_value($D) -> 500;\nto_value($C) -> 100;\nto_value($L) -> 50;\nto_value($X) -> 10;\nto_value($V) -> 5;\nto_value($I) -> 1.\n\ndecode_from_string([]) -> 0;\ndecode_from_string([H1]) -> to_value(H1);\ndecode_from_string([H1, H2 |Rest]) ->\n case {to_value(H1), to_value(H2)} of\n {V1, V2} when V1 < V2 -> V2 - V1 + decode_from_string(Rest);\n {V1, V1} -> V1 + V1 + decode_from_string(Rest);\n {V1, _} -> V1 + decode_from_string([H2|Rest])\n end.\n","language":"Erlang"},{"code":"PROGRAM ROMAN2ARAB\n\nDIM R%[7]\n\nPROCEDURE TOARAB(ROMAN$->ANS%)\n LOCAL I%,J%,P%,N%\n FOR I%=LEN(ROMAN$) TO 1 STEP -1 DO\n J%=INSTR(\"IVXLCDM\",MID$(ROMAN$,I%,1))\n IF J%=0 THEN\n ANS%=-9999 ! illegal character\n EXIT PROCEDURE\n END IF\n IF J%>=P% THEN\n N%+=R%[J%]\n ELSE\n N%-=R%[J%]\n END IF\n P%=J%\n END FOR\n ANS%=N%\nEND PROCEDURE\n\nBEGIN\n R%[]=(0,1,5,10,50,100,500,1000)\n TOARAB(\"MCMXCIX\"->ANS%) PRINT(ANS%)\n TOARAB(\"MMXII\"->ANS%) PRINT(ANS%)\n TOARAB(\"MDCLXVI\"->ANS%) PRINT(ANS%)\n TOARAB(\"MMMDCCCLXXXVIII\"->ANS%) PRINT(ANS%)\nEND PROGRAM\n","language":"ERRE"},{"code":"constant symbols = \"MDCLXVI\", weights = {1000,500,100,50,10,5,1}\nfunction romanDec(sequence roman)\n integer n, lastval, arabic\n lastval = 0\n arabic = 0\n for i = length(roman) to 1 by -1 do\n n = find(roman[i],symbols)\n if n then\n n = weights[n]\n end if\n if n < lastval then\n arabic -= n\n else\n arabic += n\n end if\n lastval = n\n end for\n return arabic\nend function\n\n? romanDec(\"MCMXCIX\")\n? romanDec(\"MDCLXVI\")\n? romanDec(\"XXV\")\n? romanDec(\"CMLIV\")\n? romanDec(\"MMXI\")\n","language":"Euphoria"},{"code":"let decimal_of_roman roman =\n let rec convert arabic lastval = function\n | head::tail ->\n let n = match head with\n | 'M' | 'm' -> 1000\n | 'D' | 'd' -> 500\n | 'C' | 'c' -> 100\n | 'L' | 'l' -> 50\n | 'X' | 'x' -> 10\n | 'V' | 'v' -> 5\n | 'I' | 'i' -> 1\n | _ -> 0\n let op = if n > lastval then (-) else (+)\n convert (op arabic lastval) n tail\n | _ -> arabic + lastval\n convert 0 0 (Seq.toList roman)\n;;\n","language":"F-Sharp"},{"code":"let decimal_of_roman roman =\n let convert (arabic,lastval) c =\n let n = match c with\n | 'M' | 'm' -> 1000\n | 'D' | 'd' -> 500\n | 'C' | 'c' -> 100\n | 'L' | 'l' -> 50\n | 'X' | 'x' -> 10\n | 'V' | 'v' -> 5\n | 'I' | 'i' -> 1\n | _ -> 0\n let op = if n > lastval then (-) else (+)\n (op arabic lastval, n)\n let (arabic, lastval) = Seq.fold convert (0,0) roman\n arabic + lastval\n;;\n","language":"F-Sharp"},{"code":"let tests = [\"MCMXC\"; \"MMVIII\"; \"MDCLXVII\"; \"MMMCLIX\"; \"MCMLXXVII\"; \"MMX\"]\nfor test in tests do Printf.printf \"%s: %d\\n\" test (decimal_of_roman test)\n;;\n","language":"F-Sharp"},{"code":"USE: roman\n( scratchpad ) \"MMMCCCXXXIII\" roman> .\n3333\n","language":"Factor"},{"code":"CONSTANT: roman-digits\n { \"m\" \"cm\" \"d\" \"cd\" \"c\" \"xc\" \"l\" \"xl\" \"x\" \"ix\" \"v\" \"iv\" \"i\" }\n\nCONSTANT: roman-values\n { 1000 900 500 400 100 90 50 40 10 9 5 4 1 }\n\n: roman> ( str -- n )\n >lower [ roman-digit>= ] monotonic-split\n [ roman-value ] map-sum ;\n\n: roman-digit>= ( ch1 ch2 -- ? ) [ roman-digit-index ] bi@ >= ;\n\n: roman-digit-index ( ch -- n ) 1string roman-digits index ;\n\n: roman-value (seq -- n )\n [ [ roman-digit-value ] map ] [ all-eq? ] bi\n [ sum ] [ first2 swap - ] if ;\n\n: roman-digit-value ( ch -- n )\n roman-digit-index roman-values nth ;\n","language":"Factor"},{"code":"[ 32| {get value of Roman digit on stack}\n $'m= $[\\% 1000\\]? ~[\n $'d= $[\\% 500\\]? ~[\n $'c= $[\\% 100\\]? ~[\n $'l= $[\\% 50\\]? ~[\n $'x= $[\\% 10\\]? ~[\n $'v= $[\\% 5\\]? ~[\n $'i= $[\\% 1\\]? ~[\n % 0\n ]?]?]?]?]?]?]?\n]r:\n\n0 {accumulator}\n^r;! {read first Roman digit}\n[^r;!$][ {read another, and as long as it is valid...}\n \\$@@\\$@@ {copy previous and current}\n \\>[\\_\\]? {if previous smaller than current, negate previous}\n @@+\\ {add previous to accumulator}\n]#\n%+. {add final digit to accumulator and output}\n10, {and a newline}\n","language":"FALSE"},{"code":"create (arabic)\n 1000 128 * char M + ,\n 500 128 * char D + ,\n 100 128 * char C + ,\n 50 128 * char L + ,\n 10 128 * char X + ,\n 5 128 * char V + ,\n 1 128 * char I + ,\ndoes>\n 7 cells bounds do\n i @ over over 127 and = if nip 7 rshift leave else drop then\n 1 cells +loop dup\n;\n\n: >arabic\n 0 dup >r >r\n begin\n over over\n while\n c@ dup (arabic) rot <>\n while\n r> over r> over over > if 2* negate + else drop then + swap >r >r 1 /string\n repeat then drop 2drop r> r> drop\n;\n\ns\" MCMLXXXIV\" >arabic .\n","language":"Forth"},{"code":"\\ decode roman numerals using Forth methodology\n\\ create words to describe and solve the problem\n\\ ANS/ISO Forth\n\n\\ state holders\nVARIABLE OLDNDX\nVARIABLE CURNDX\nVARIABLE NEGFLAG\n\nDECIMAL\nCREATE VALUES ( -- addr) 0 , 1 , 5 , 10 , 50 , 100 , 500 , 1000 ,\n\n: NUMERALS ( -- addr len) S\" IVXLCDM\" ; \\ 1st char is a blank\n: [] ( n addr -- addr') SWAP CELLS + ; \\ array address calc.\n: INIT ( -- ) CURNDX OFF OLDNDX OFF NEGFLAG OFF ;\n: REMEMBER ( ndx -- ndx ) CURNDX @ OLDNDX ! DUP CURNDX ! ;\n: ]VALUE@ ( ndx -- n ) REMEMBER VALUES [] @ ;\nHEX\n: TOUPPER ( char -- char ) 05F AND ;\n\nDECIMAL\n: >INDEX ( char -- ndx) TOUPPER >R NUMERALS TUCK R> SCAN NIP -\n DUP 7 > ABORT\" Invalid Roman numeral\" ;\n\n: >VALUE ( char -- n ) >INDEX ]VALUE@ ;\n: ?ILLEGAL ( ndx -- ) CURNDX @ OLDNDX @ = NEGFLAG @ AND ABORT\" Illegal format\" ;\n\n: ?NEGATE ( n -- +n | -n) \\ conditional NEGATE\n CURNDX @ OLDNDX @ <\n IF NEGFLAG ON NEGATE\n ELSE ?ILLEGAL NEGFLAG OFF\n THEN ;\n\n: >ARABIC ( addr len -- n )\n INIT\n 0 -ROT \\ accumulator under the stack string args\n 1- BOUNDS \\ convert addr len to two addresses\n SWAP DO \\ index the string from back to front\n I C@ >VALUE ?NEGATE +\n -1 +LOOP ;\n","language":"Forth"},{"code":"program Roman_decode\n implicit none\n\n write(*,*) decode(\"MCMXC\"), decode(\"MMVIII\"), decode(\"MDCLXVI\")\n\ncontains\n\nfunction decode(roman) result(arabic)\n character(*), intent(in) :: roman\n integer :: i, n, lastval, arabic\n\n arabic = 0\n lastval = 0\n do i = len(roman), 1, -1\n select case(roman(i:i))\n case ('M','m')\n n = 1000\n case ('D','d')\n n = 500\n case ('C','c')\n n = 100\n case ('L','l')\n n = 50\n case ('X','x')\n n = 10\n case ('V','v')\n n = 5\n case ('I','i')\n n = 1\n case default\n n = 0\n end select\n if (n < lastval) then\n arabic = arabic - n\n else\n arabic = arabic + n\n end if\n lastval = n\n end do\nend function decode\nend program Roman_decode\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nFunction romanDecode(roman As Const String) As Integer\n If roman = \"\" Then Return 0 '' zero denotes invalid roman number\n Dim roman1(0 To 2) As String = {\"MMM\", \"MM\", \"M\"}\n Dim roman2(0 To 8) As String = {\"CM\", \"DCCC\", \"DCC\", \"DC\", \"D\", \"CD\", \"CCC\", \"CC\", \"C\"}\n Dim roman3(0 To 8) As String = {\"XC\", \"LXXX\", \"LXX\", \"LX\", \"L\", \"XL\", \"XXX\", \"XX\", \"X\"}\n Dim roman4(0 To 8) As String = {\"IX\", \"VIII\", \"VII\", \"VI\", \"V\", \"IV\", \"III\", \"II\", \"I\"}\n Dim As Integer i, value = 0, length = 0\n Dim r As String = UCase(roman)\n\n For i = 0 To 2\n If Left(r, Len(roman1(i))) = roman1(i) Then\n value += 1000 * (3 - i)\n length = Len(roman1(i))\n r = Mid(r, length + 1)\n length = 0\n Exit For\n End If\n Next\n\n For i = 0 To 8\n If Left(r, Len(roman2(i))) = roman2(i) Then\n value += 100 * (9 - i)\n length = Len(roman2(i))\n r = Mid(r, length + 1)\n length = 0\n Exit For\n End If\n Next\n\n For i = 0 To 8\n If Left(r, Len(roman3(i))) = roman3(i) Then\n value += 10 * (9 - i)\n length = Len(roman3(i))\n r = Mid(r, length + 1)\n length = 0\n Exit For\n End If\n Next\n\n For i = 0 To 8\n If Left(r, Len(roman4(i))) = roman4(i) Then\n value += 9 - i\n length = Len(roman4(i))\n Exit For\n End If\n Next\n\n ' Can't be a valid roman number if there are any characters left\n If Len(r) > length Then Return 0\n Return value\nEnd Function\n\nDim a(2) As String = {\"MCMXC\", \"MMVIII\" , \"MDCLXVI\"}\nFor i As Integer = 0 To 2\n Print a(i); Tab(8); \" =>\"; romanDecode(a(i))\nNext\n\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"window 1\n\nlocal fn RomantoDecimal( roman as CFStringRef ) as long\n long i, n, preNum = 0, num = 0\n\n for i = len(roman) - 1 to 0 step -1\n n = 0\n select ( fn StringCharacterAtIndex( roman, i ) )\n case _\"M\" : n = 1000\n case _\"D\" : n = 500\n case _\"C\" : n = 100\n case _\"L\" : n = 50\n case _\"X\" : n = 10\n case _\"V\" : n = 5\n case _\"I\" : n = 1\n end select\n if ( n < preNum ) then num = num - n else num = num + n\n preNum = n\n next\n\nend fn = num\n\nprint @\" MCMXC = \"; fn RomantoDecimal( @\"MCMXC\" )\nprint @\" MMVIII = \"; fn RomantoDecimal( @\"MMVIII\" )\nprint @\" MMXVI = \"; fn RomantoDecimal( @\"MMXVI\" )\nprint @\"MDCLXVI = \"; fn RomantoDecimal( @\"MDCLXVI\" )\nprint @\" MCMXIV = \"; fn RomantoDecimal( @\"MCMXIV\" )\nprint @\" DXIII = \"; fn RomantoDecimal( @\"DXIII\" )\nprint @\" M = \"; fn RomantoDecimal( @\"M\" )\nprint @\" DXIII = \"; fn RomantoDecimal( @\"DXIII\" )\nprint @\" XXXIII = \"; fn RomantoDecimal( @\"XXXIII\" )\n\nHandleEvents\n","language":"FutureBasic"},{"code":"'This code will create a GUI Form and Objects and carry out the Roman Numeral convertion as you type\n'The input is case insensitive\n'A basic check for invalid charaters is made\n\nhTextBox As TextBox 'To allow the creation of a TextBox\nhValueBox As ValueBox 'To allow the creation of a ValueBox\n\nPublic Sub Form_Open() 'Form opens..\n\nSetUpForm 'Go to the SetUpForm Routine\nhTextBox.text = \"MCMXC\" 'Put a Roman numeral in the TextBox\n\nEnd\n\nPublic Sub TextBoxInput_Change() 'Each time the TextBox text changes..\nDim cRomanN As Collection = [\"M\": 1000, \"D\": 500, \"C\": 100, \"L\": 50, \"X\": 10, \"V\": 5, \"I\": 1] 'Collection of nemerals e.g 'M' = 1000\nDim cMinus As Collection = [\"IV\": -2, \"IX\": -2, \"XL\": -20, \"XC\": - 20, \"CD\": -200, \"CM\": -200] 'Collection of the 'one less than' numbers e.g. 'IV' = 4\nDim sClean, sTemp As String 'Various string variables\nDim siCount As Short 'Counter\nDim iTotal As Integer 'Stores the total of the calculation\n\nhTextBox.Text = UCase(hTextBox.Text) 'Make any text in the TextBox upper case\n\nFor siCount = 1 To Len(hTextBox.Text) 'Loop through each character in the TextBox\n If InStr(\"MDCLXVI\", Mid(hTextBox.Text, siCount, 1)) Then 'If a Roman numeral exists then..\n sClean &= Mid(hTextBox.Text, siCount, 1) 'Put it in 'sClean' (Stops input of non Roman numerals)\n End If\nNext\n\nhTextBox.Text = sClean 'Put the now clean text in the TextBox\n\nFor siCount = 1 To Len(hTextBox.Text) 'Loop through each character in the TextBox\n iTotal += cRomanN[Mid(hTextBox.Text, siCount, 1)] 'Total up all the characters, note 'IX' will = 11 not 9\nNext\n\nFor Each sTemp In cMinus 'Loop through each item in the cMinus Collection\n If InStr(sClean, cMinus.Key) > 0 Then iTotal += Val(sTemp) 'If a 'Minus' value is in the string e.g. 'IX' which has been calculated at 11 subtract 2 = 9\nNext\n\nhValueBox.text = iTotal 'Display the total\n\nEnd\n\nPublic Sub SetUpForm() 'Create the Objects for the Form\nDim hLabel1, hLabel2 As Label 'For 2 Labels\n\nMe.height = 150 'Form Height\nMe.Width = 300 'Form Width\nMe.Padding = 20 'Form padding (border)\nMe.Text = \"Roman Numeral converter\" 'Text in Form header\nMe.Arrangement = Arrange.Vertical 'Form arrangement\n\nhLabel1 = New Label(Me) 'Create a Label\nhLabel1.Height = 21 'Label Height\nhLabel1.expand = True 'Expand the Label\nhLabel1.Text = \"Enter a Roman numeral\" 'Put text in the Label\n\nhTextBox = New TextBox(Me) As \"TextBoxInput\" 'Set up a TextBox with an Event Label\nhTextBox.Height = 21 'TextBox height\nhTextBox.expand = True 'Expand the TextBox\n\nhLabel2 = New Label(Me) 'Create a Label\nhLabel2.Height = 21 'Label Height\nhLabel2.expand = True 'Expand the Label\nhLabel2.Text = \"The decimal equivelent is: -\" 'Put text in the Label\n\nhValueBox = New ValueBox(Me) 'Create a ValueBox\nhValueBox.Height = 21 'ValuBox Height\nhValueBox.expand = True 'Expand the ValueBox\nhValueBox.ReadOnly = True 'Set ValueBox to Read Only\n\nEnd\n","language":"Gambas"},{"code":"package main\n\nimport (\n \"errors\"\n \"fmt\"\n)\n\nvar m = map[rune]int{\n 'I': 1,\n 'V': 5,\n 'X': 10,\n 'L': 50,\n 'C': 100,\n 'D': 500,\n 'M': 1000,\n}\n\nfunc parseRoman(s string) (r int, err error) {\n if s == \"\" {\n return 0, errors.New(\"Empty string\")\n }\n is := []rune(s) // easier to convert string up front\n var c0 rune // c0: roman character last read\n var cv0 int // cv0: value of cv\n\n // the key to the algorithm is to process digits from right to left\n for i := len(is) - 1; i >= 0; i-- {\n // read roman digit\n c := is[i]\n k := c == '\\u0305' // unicode overbar combining character\n if k {\n if i == 0 {\n return 0, errors.New(\n \"Overbar combining character invalid at position 0\")\n }\n i--\n c = is[i]\n }\n cv := m[c]\n if cv == 0 {\n if c == 0x0305 {\n return 0, fmt.Errorf(\n \"Overbar combining character invalid at position %d\", i)\n } else {\n return 0, fmt.Errorf(\n \"Character unrecognized as Roman digit: %c\", c)\n }\n }\n if k {\n c = -c // convention indicating overbar\n cv *= 1000\n }\n\n // handle cases of new, same, subtractive, changed, in that order.\n switch {\n default: // case 4: digit change\n fallthrough\n case c0 == 0: // case 1: no previous digit\n c0 = c\n cv0 = cv\n case c == c0: // case 2: same digit\n case cv*5 == cv0 || cv*10 == cv0: // case 3: subtractive\n // handle next digit as new.\n // a subtractive digit doesn't count as a previous digit.\n c0 = 0\n r -= cv // subtract...\n continue // ...instead of adding\n }\n r += cv // add, in all cases except subtractive\n }\n return r, nil\n}\n\nfunc main() {\n // parse three numbers mentioned in task description\n for _, r := range []string{\"MCMXC\", \"MMVIII\", \"MDCLXVI\"} {\n v, err := parseRoman(r)\n if err != nil {\n fmt.Println(err)\n } else {\n fmt.Println(r, \"==\", v)\n }\n }\n}\n","language":"Go"},{"code":"package main\n\nimport (\n\t\"fmt\"\n)\n\nvar m = map[rune]int{\n\t'I': 1,\n\t'V': 5,\n\t'X': 10,\n\t'L': 50,\n\t'C': 100,\n\t'D': 500,\n\t'M': 1000,\n}\n\n// function, per task description\nfunc from_roman(roman string) (arabic int) {\n\tlast_digit := 1000\n\tfor _, r := range roman {\n\t\tdigit := m[r]\n\t\tif last_digit < digit {\n\t\t\tarabic -= 2 * last_digit\n\t\t}\n\t\tlast_digit = digit\n\t\tarabic += digit\n\t}\n\n\treturn arabic\n}\n\nfunc main() {\n\t// parse three numbers mentioned in task description\n\tfor _, roman_digit := range []string{\"MCMXC\", \"MMVIII\", \"MDCLXVI\"} {\n\t\tfmt.Printf(\"%-10s == %d\\n\", roman_digit, from_roman(roman_digit))\n\t}\n}\n","language":"Go"},{"code":"#!/usr/bin/env golosh\n----\nThis module converts a Roman numeral into a decimal number.\n----\nmodule Romannumeralsdecode\n\naugment java.lang.Character {\n\n function decode = |this| -> match {\n when this == 'I' then 1\n when this == 'V' then 5\n when this == 'X' then 10\n when this == 'L' then 50\n when this == 'C' then 100\n when this == 'D' then 500\n when this == 'M' then 1000\n otherwise 0\n }\n}\n\naugment java.lang.String {\n\n function decode = |this| {\n var accumulator = 0\n foreach i in [0..this: length()] {\n let currentChar = this: charAt(i)\n let nextChar = match {\n when i + 1 < this: length() then this: charAt(i + 1)\n otherwise null\n }\n if (currentChar: decode() < (nextChar?: decode() orIfNull 0)) {\n # if this is something like IV or IX or whatever\n accumulator = accumulator - currentChar: decode()\n } else {\n accumulator = accumulator + currentChar: decode()\n }\n }\n return accumulator\n }\n}\n\nfunction main = |args| {\n println(\"MCMXC = \" + \"MCMXC\": decode())\n println(\"MMVIII = \" + \"MMVIII\": decode())\n println(\"MDCLXVI = \" + \"MDCLXVI\": decode())\n}\n","language":"Golo"},{"code":"enum RomanDigits {\n I(1), V(5), X(10), L(50), C(100), D(500), M(1000);\n\n private magnitude;\n private RomanDigits(magnitude) { this.magnitude = magnitude }\n\n String toString() { super.toString() + \"=${magnitude}\" }\n\n static BigInteger parse(String numeral) {\n assert numeral != null && !numeral.empty\n def digits = (numeral as List).collect {\n RomanDigits.valueOf(it)\n }\n def L = digits.size()\n (0..<L).inject(0g) { total, i ->\n def sign = (i == L - 1 || digits[i] >= digits[i+1]) ? 1 : -1\n total + sign * digits[i].magnitude\n }\n }\n}\n","language":"Groovy"},{"code":"println \"\"\"\nDigit Values = ${RomanDigits.values()}\nM => ${RomanDigits.parse('M')}\nMCXI => ${RomanDigits.parse('MCXI')}\nCMXI => ${RomanDigits.parse('CMXI')}\nMCM => ${RomanDigits.parse('MCM')}\nMCMXC => ${RomanDigits.parse('MCMXC')}\nMMVIII => ${RomanDigits.parse('MMVIII')}\nMMIX => ${RomanDigits.parse('MMIX')}\nMCDXLIV => ${RomanDigits.parse('MCDXLIV')}\nMDCLXVI => ${RomanDigits.parse('MDCLXVI')}\n\"\"\"\n","language":"Groovy"},{"code":"module Main where\n\n------------------------\n-- DECODER FUNCTION --\n------------------------\n\ndecodeDigit :: Char -> Int\ndecodeDigit 'I' = 1\ndecodeDigit 'V' = 5\ndecodeDigit 'X' = 10\ndecodeDigit 'L' = 50\ndecodeDigit 'C' = 100\ndecodeDigit 'D' = 500\ndecodeDigit 'M' = 1000\ndecodeDigit _ = error \"invalid digit\"\n\n-- We process a Roman numeral from right to left, digit by digit, adding the value.\n-- If a digit is lower than the previous then its value is negative.\n-- The first digit is always positive.\n\ndecode roman = decodeRoman startValue startValue rest\n where\n (first:rest) = reverse roman\n startValue = decodeDigit first\n\ndecodeRoman :: Int -> Int -> [Char] -> Int\ndecodeRoman lastSum _ [] = lastSum\ndecodeRoman lastSum lastValue (digit:rest) = decodeRoman updatedSum digitValue rest\n where\n digitValue = decodeDigit digit\n updatedSum = (if digitValue < lastValue then (-) else (+)) lastSum digitValue\n\n------------------\n-- TEST SUITE --\n------------------\n\nmain = do\n test \"MCMXC\" 1990\n test \"MMVIII\" 2008\n test \"MDCLXVI\" 1666\n\ntest roman expected = putStrLn (roman ++ \" = \" ++ (show (arabic)) ++ remark)\n where\n arabic = decode roman\n remark = \" (\" ++ (if arabic == expected then \"PASS\" else (\"FAIL, expected \" ++ (show expected))) ++ \")\"\n","language":"Haskell"},{"code":"module Main where\n\n------------------------\n-- DECODER FUNCTION --\n------------------------\n\ndecodeDigit :: Char -> Int\ndecodeDigit 'I' = 1\ndecodeDigit 'V' = 5\ndecodeDigit 'X' = 10\ndecodeDigit 'L' = 50\ndecodeDigit 'C' = 100\ndecodeDigit 'D' = 500\ndecodeDigit 'M' = 1000\ndecodeDigit _ = error \"invalid digit\"\n\n-- We process a Roman numeral from right to left, digit by digit, adding the value.\n-- If a digit is lower than the previous then its value is negative.\n-- The first digit is always positive.\n\ndecode roman = fst (foldl addValue (0, 0) (reverse roman))\n where\n addValue (lastSum, lastValue) digit = (updatedSum, value)\n where\n value = decodeDigit digit;\n updatedSum = (if value < lastValue then (-) else (+)) lastSum value\n\n------------------\n-- TEST SUITE --\n------------------\n\nmain = do\n test \"MCMXC\" 1990\n test \"MMVIII\" 2008\n test \"MDCLXVI\" 1666\n\ntest roman expected = putStrLn (roman ++ \" = \" ++ (show (arabic)) ++ remark)\n where\n arabic = decode roman\n remark = \" (\" ++ (if arabic == expected then \"PASS\" else (\"FAIL, expected \" ++ (show expected))) ++ \")\"\n","language":"Haskell"},{"code":"import Data.List (isPrefixOf)\n\nmapping = [(\"M\",1000),(\"CM\",900),(\"D\",500),(\"CD\",400),(\"C\",100),(\"XC\",90),\n (\"L\",50),(\"XL\",40),(\"X\",10),(\"IX\",9),(\"V\",5),(\"IV\",4),(\"I\",1)]\n\ntoArabic :: String -> Int\ntoArabic \"\" = 0\ntoArabic str = num + toArabic xs\n where (num, xs):_ = [ (num, drop (length n) str) | (n,num) <- mapping, isPrefixOf n str ]\n","language":"Haskell"},{"code":"import Data.Bifunctor (bimap)\nimport Data.List (isPrefixOf, mapAccumL)\n\nromanValue :: String -> Int\nromanValue =\n let tr s (k, v) =\n until\n (not . isPrefixOf k . fst)\n (bimap ((drop . length) k) (v +))\n (s, 0)\n in sum\n . snd\n . flip\n (mapAccumL tr)\n [ (\"M\", 1000),\n (\"CM\", 900),\n (\"D\", 500),\n (\"CD\", 400),\n (\"C\", 100),\n (\"XC\", 90),\n (\"L\", 50),\n (\"XL\", 40),\n (\"X\", 10),\n (\"IX\", 9),\n (\"V\", 5),\n (\"IV\", 4),\n (\"I\", 1)\n ]\n\nmain :: IO ()\nmain =\n mapM_\n (print . romanValue)\n [ \"MDCLXVI\",\n \"MCMXC\",\n \"MMVIII\",\n \"MMXVI\",\n \"MMXVII\"\n ]\n","language":"Haskell"},{"code":"import Data.List (mapAccumR)\nimport qualified Data.Map.Strict as M\nimport Data.Maybe (maybe)\n\nfromRoman :: String -> Maybe Int\nfromRoman cs =\n let go l r\n | l > r = (- r, l)\n | otherwise = (r, l)\n in traverse (`M.lookup` mapRoman) cs\n >>= ( Just . sum . ((:) <$> fst <*> snd)\n . mapAccumR go 0\n )\n\nmapRoman :: M.Map Char Int\nmapRoman =\n M.fromList $\n zip\n \"MDCLXVI \"\n [ 1000,\n 500,\n 100,\n 50,\n 10,\n 5,\n 1,\n 0\n ]\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain =\n putStrLn $\n fTable\n \"Decoding Roman numbers:\\n\"\n show\n (maybe \"Unrecognised character\" show)\n fromRoman\n [ \"MDCLXVI\",\n \"MCMXC\",\n \"MMVIII\",\n \"MMXVI\",\n \"MMXVIII\",\n \"MMXBIII\"\n ]\n\n------------------------ FORMATTING ----------------------\nfTable ::\n String ->\n (a -> String) ->\n (b -> String) ->\n (a -> b) ->\n [a] ->\n String\nfTable s xShow fxShow f xs =\n unlines $\n s :\n fmap\n ( ((<>) . rjust w ' ' . xShow)\n <*> ((\" -> \" <>) . fxShow . f)\n )\n xs\n where\n rjust n c = drop . length <*> (replicate n c <>)\n w = maximum (length . xShow <$> xs)\n","language":"Haskell"},{"code":"import qualified Data.Map.Strict as M\n\nfromRoman :: String -> Int\nfromRoman xs = partialSum + lastDigit\n where\n (partialSum, lastDigit) = foldl accumulate (0, 0) (evalRomanDigit <$> xs)\n accumulate (partial, lastDigit) newDigit\n | newDigit <= lastDigit = (partial + lastDigit, newDigit)\n | otherwise = (partial - lastDigit, newDigit)\n\nmapRoman :: M.Map Char Int\nmapRoman =\n M.fromList\n [ ('I', 1)\n , ('V', 5)\n , ('X', 10)\n , ('L', 50)\n , ('C', 100)\n , ('D', 500)\n , ('M', 1000)\n ]\n\nevalRomanDigit :: Char -> Int\nevalRomanDigit c =\n let mInt = M.lookup c mapRoman\n in case mInt of\n Just x -> x\n _ -> error $ c : \" is not a roman digit\"\n\nmain :: IO ()\nmain = print $ fromRoman <$> [\"MDCLXVI\", \"MCMXC\", \"MMVIII\", \"MMXVI\", \"MMXVII\"]\n","language":"Haskell"},{"code":"import qualified Data.Map.Strict as M\nimport Data.Maybe (maybe)\n\n------------------ ROMAN NUMERALS DECODED ----------------\n\nmapRoman :: M.Map Char Int\nmapRoman =\n M.fromList $\n zip \"IVXLCDM\" $\n scanl (*) 1 (cycle [5, 2])\n\nfromRoman :: String -> Maybe Int\nfromRoman cs =\n let op l r\n | l >= r = (+)\n | otherwise = (-)\n in snd\n . foldr\n (\\l (r, n) -> (l, op l r n l))\n (0, 0)\n <$> traverse (`M.lookup` mapRoman) cs\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain =\n putStrLn $\n fTable\n \"Roman numeral decoding as a right fold:\\n\"\n show\n (maybe \"(Unrecognised character seen)\" show)\n fromRoman\n [ \"MDCLXVI\",\n \"MCMXC\",\n \"MMVIII\",\n \"MMXVI\",\n \"MMXVII\",\n \"QQXVII\"\n ]\n\n------------------------ FORMATTING ----------------------\n\nfTable ::\n String ->\n (a -> String) ->\n (b -> String) ->\n (a -> b) ->\n [a] ->\n String\nfTable s xShow fxShow f xs =\n unlines $\n s :\n fmap\n ( ((<>) . rjust w ' ' . xShow)\n <*> ((\" -> \" <>) . fxShow . f)\n )\n xs\n where\n rjust n c = drop . length <*> (replicate n c <>)\n w = maximum (length . xShow <$> xs)\n","language":"Haskell"},{"code":"import qualified Data.Map.Strict as M (Map, fromList, lookup)\nimport Data.Maybe (isNothing, isJust, fromJust, catMaybes)\nimport Data.List (mapAccumL)\n\nmapRoman :: M.Map String Int\nmapRoman =\n M.fromList\n [ (\"M\", 1000)\n , (\"CM\", 900)\n , (\"D\", 500)\n , (\"CD\", 400)\n , (\"C\", 100)\n , (\"XC\", 90)\n , (\"L\", 50)\n , (\"XL\", 40)\n , (\"X\", 10)\n , (\"IX\", 9)\n , (\"V\", 5)\n , (\"IV\", 4)\n , (\"I\", 1)\n ]\n\nfromRoman :: String -> Int\nfromRoman s =\n let value k = M.lookup k mapRoman\n in sum . catMaybes . snd $\n mapAccumL\n (\\mi (l, r, i) ->\n let mValue = value [l, r] -- mapRoman lookup of [left, right] Chars\n (lastPair, pairValue)\n | isJust mValue = (Just i, mValue) -- Pair match: index updated\n | isNothing mi || i - fromJust mi > 1 = (mi, value [l])\n | otherwise = (mi, Nothing) -- Left Char was counted in pair\n in (lastPair, pairValue))\n Nothing -- Accumulator – maybe Index to last matched Char pair\n (zip3 s (tail s ++ \" \") [0 ..]) -- Indexed character pairs\n\nmain :: IO ()\nmain = print $ fromRoman <$> [\"MDCLXVI\", \"MCMXC\", \"MMVIII\", \"MMXVI\", \"MMXVII\"]\n","language":"Haskell"},{"code":"|%\n++ parse\n |= t=tape ^- @ud\n =. t (cass t)\n =| result=@ud\n |-\n ?~ t result\n ?~ t.t (add result (from-numeral i.t))\n =+ [a=(from-numeral i.t) b=(from-numeral i.t.t)]\n ?: (gte a b) $(result (add result a), t t.t)\n $(result (sub (add result b) a), t t.t.t)\n++ yield\n |= n=@ud ^- tape\n =| result=tape\n =/ values to-numeral\n |-\n ?~ values result\n ?: (gte n -.i.values)\n $(result (weld result +.i.values), n (sub n -.i.values))\n $(values t.values)\n++ from-numeral\n |= c=@t ^- @ud\n ?: =(c 'i') 1\n ?: =(c 'v') 5\n ?: =(c 'x') 10\n ?: =(c 'l') 50\n ?: =(c 'c') 100\n ?: =(c 'd') 500\n ?: =(c 'm') 1.000\n !!\n++ to-numeral\n ^- (list [@ud tape])\n :*\n [1.000 \"m\"]\n [900 \"cm\"]\n [500 \"d\"]\n [400 \"cd\"]\n [100 \"c\"]\n [90 \"xc\"]\n [50 \"l\"]\n [40 \"xl\"]\n [10 \"x\"]\n [9 \"ix\"]\n [5 \"v\"]\n [4 \"iv\"]\n [1 \"i\"]\n ~\n ==\n--\n","language":"Hoon"},{"code":"/+ *roman\n:- %say\n|= [* [x=$%([%from-roman tape] [%to-roman @ud]) ~] ~]\n:- %noun\n^- tape\n?- -.x\n %from-roman \"{<(parse +.x)>}\"\n %to-roman (yield +.x)\n==\n","language":"Hoon"},{"code":"link numbers\n\nprocedure main()\nevery R := \"MCMXC\"|\"MDCLXVI\"|\"MMVIII\" do\n write(R, \" = \",unroman(R))\nend\n","language":"Icon"},{"code":"procedure unroman(s)\t\t#: convert Roman numeral to integer\n local nbr,lastVal,val\n\n nbr := lastVal := 0\n s ? {\n while val := case map(move(1)) of {\n\t \"m\": 1000\n\t \"d\": 500\n\t \"c\": 100\n\t \"l\": 50\n\t \"x\": 10\n\t \"v\": 5\n\t \"i\": 1\n\t } do {\n\t nbr +:= if val <= lastVal then val else val - 2 * lastVal\n\t lastVal := val\n\t }\n }\n return nbr\nend\n","language":"Icon"},{"code":"(var numerals {\"M\" 1000 \"D\" 500 \"C\" 100 \"L\" 50 \"X\" 10 \"V\" 5 \"I\" 1})\n\n; Approach A\n(function ro->ar r\n (-> (reverse (upper-case r))\n (map numerals)\n (split-with val)\n (map (.. +0))\n (reduce @(((< % %1) + -)))))\n\n; Approach B\n(function ro->ar r\n (-> (upper-case r)\n (map numerals)\n @(reduce (fn [sum lastv] curr [(+ sum curr ((< lastv curr) (* -2 lastv) 0)) curr]) [0 0])\n 0))\n\n(map ro->ar [\"MDCLXVI\" \"MMMCMXCIX\" \"XLVIII\" \"MMVIII\"])\n","language":"Insitux"},{"code":"rom2d=: [: (+/ .* _1^ 0,~ 2</\\ ]) 1 5 10 50 100 500 1000 {~ 'IVXLCDM'&i.\n","language":"J"},{"code":" rom2d 'MCMXC'\n1990\n rom2d 'MDCLXVI'\n1666\n rom2d 'MMVIII'\n2008\n","language":"J"},{"code":"public class Roman {\n\tprivate static int decodeSingle(char letter) {\n\t\tswitch(letter) {\n\t\t\tcase 'M': return 1000;\n\t\t\tcase 'D': return 500;\n\t\t\tcase 'C': return 100;\n\t\t\tcase 'L': return 50;\n\t\t\tcase 'X': return 10;\n\t\t\tcase 'V': return 5;\n\t\t\tcase 'I': return 1;\n\t\t\tdefault: return 0;\n\t\t}\n\t}\n\tpublic static int decode(String roman) {\n\t\tint result = 0;\n\t\tString uRoman = roman.toUpperCase(); //case-insensitive\n\t\tfor(int i = 0;i < uRoman.length() - 1;i++) {//loop over all but the last character\n\t\t\t//if this character has a lower value than the next character\n\t\t\tif (decodeSingle(uRoman.charAt(i)) < decodeSingle(uRoman.charAt(i+1))) {\n\t\t\t\t//subtract it\n\t\t\t\tresult -= decodeSingle(uRoman.charAt(i));\n\t\t\t} else {\n\t\t\t\t//add it\n\t\t\t\tresult += decodeSingle(uRoman.charAt(i));\n\t\t\t}\n\t\t}\n\t\t//decode the last character, which is always added\n\t\tresult += decodeSingle(uRoman.charAt(uRoman.length()-1));\n\t\treturn result;\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(decode(\"MCMXC\")); //1990\n\t\tSystem.out.println(decode(\"MMVIII\")); //2008\n\t\tSystem.out.println(decode(\"MDCLXVI\")); //1666\n\t}\n}\n","language":"Java"},{"code":"import java.util.Set;\nimport java.util.EnumSet;\nimport java.util.Collections;\nimport java.util.stream.Collectors;\nimport java.util.stream.LongStream;\n\npublic interface RomanNumerals {\n public enum Numeral {\n M(1000), CM(900), D(500), CD(400), C(100), XC(90), L(50), XL(40), X(10), IX(9), V(5), IV(4), I(1);\n\n public final long weight;\n\n private static final Set<Numeral> SET = Collections.unmodifiableSet(EnumSet.allOf(Numeral.class));\n\n private Numeral(long weight) {\n this.weight = weight;\n }\n\n public static Numeral getLargest(long weight) {\n return SET.stream()\n .filter(numeral -> weight >= numeral.weight)\n .findFirst()\n .orElse(I)\n ;\n }\n };\n\n public static String encode(long n) {\n return LongStream.iterate(n, l -> l - Numeral.getLargest(l).weight)\n .limit(Numeral.values().length)\n .filter(l -> l > 0)\n .mapToObj(Numeral::getLargest)\n .map(String::valueOf)\n .collect(Collectors.joining())\n ;\n }\n\n public static long decode(String roman) {\n long result = new StringBuilder(roman.toUpperCase()).reverse().chars()\n .mapToObj(c -> Character.toString((char) c))\n .map(numeral -> Enum.valueOf(Numeral.class, numeral))\n .mapToLong(numeral -> numeral.weight)\n .reduce(0, (a, b) -> a + (a <= b ? b : -b))\n ;\n if (roman.charAt(0) == roman.charAt(1)) {\n result += 2 * Enum.valueOf(Numeral.class, roman.substring(0, 1)).weight;\n }\n return result;\n }\n\n public static void test(long n) {\n System.out.println(n + \" = \" + encode(n));\n System.out.println(encode(n) + \" = \" + decode(encode(n)));\n }\n\n public static void main(String[] args) {\n LongStream.of(1999, 25, 944).forEach(RomanNumerals::test);\n }\n}\n","language":"Java"},{"code":"var Roman = {\n Values: [['CM', 900], ['CD', 400], ['XC', 90], ['XL', 40], ['IV', 4],\n ['IX', 9], ['V', 5], ['X', 10], ['L', 50],\n ['C', 100], ['M', 1000], ['I', 1], ['D', 500]],\n UnmappedStr : 'Q',\n parse: function(str) {\n var result = 0\n for (var i=0; i<Roman.Values.length; ++i) {\n var pair = Roman.Values[i]\n var key = pair[0]\n var value = pair[1]\n var regex = RegExp(key)\n while (str.match(regex)) {\n result += value\n str = str.replace(regex, Roman.UnmappedStr)\n }\n }\n return result\n }\n}\n\nvar test_data = ['MCMXC', 'MDCLXVI', 'MMVIII']\nfor (var i=0; i<test_data.length; ++i) {\n var test_datum = test_data[i]\n print(test_datum + \": \" + Roman.parse(test_datum))\n}\n","language":"JavaScript"},{"code":"(function (lstTest) {\n\n var mapping = [[\"M\", 1000], [\"CM\", 900], [\"D\", 500], [\"CD\", 400], [\"C\", 100], [\n \"XC\", 90], [\"L\", 50], [\"XL\", 40], [\"X\", 10], [\"IX\", 9], [\"V\", 5], [\"IV\",\n 4], [\"I\", 1]];\n\n // s -> n\n function romanValue(s) {\n // recursion over list of characters\n // [c] -> n\n function toArabic(lst) {\n return lst.length ? function (xs) {\n var lstParse = chain(mapping, function (lstPair) {\n return isPrefixOf(\n lstPair[0], xs\n ) ? [lstPair[1], drop(lstPair[0].length, xs)] : []\n });\n return lstParse[0] + toArabic(lstParse[1]);\n }(lst) : 0\n }\n return toArabic(s.split(''));\n }\n\n // Monadic bind (chain) for lists\n function chain(xs, f) {\n return [].concat.apply([], xs.map(f));\n }\n\n // [a] -> [a] -> Bool\n function isPrefixOf(lstFirst, lstSecond) {\n return lstFirst.length ? (\n lstSecond.length ?\n lstFirst[0] === lstSecond[0] && isPrefixOf(\n lstFirst.slice(1), lstSecond.slice(1)\n ) : false\n ) : true;\n }\n\n // Int -> [a] -> [a]\n function drop(n, lst) {\n return n <= 0 ? lst : (\n lst.length ? drop(n - 1, lst.slice(1)) : []\n );\n }\n\n return lstTest.map(romanValue);\n\n})(['MCMXC', 'MDCLXVI', 'MMVIII']);\n","language":"JavaScript"},{"code":"[1990, 1666, 2008]\n","language":"JavaScript"},{"code":"(function (lstTest) {\n\n function romanValue(s) {\n return s.length ? function () {\n var parse = [].concat.apply([], glyphs.map(function (g) {\n return 0 === s.indexOf(g) ? [trans[g], s.substr(g.length)] : [];\n }));\n return parse[0] + romanValue(parse[1]);\n }() : 0;\n }\n\n var trans = {\n M: 1E3,\n CM: 900,\n D: 500,\n CD: 400,\n C: 100,\n XC: 90,\n L: 50,\n XL: 40,\n X: 10,\n IX: 9,\n V: 5,\n IV: 4,\n I: 1\n },\n glyphs = Object.keys(trans);\n\n return lstTest.map(romanValue);\n\n})([\"MCMXC\", \"MDCLXVI\", \"MMVIII\", \"MMMM\"]);\n","language":"JavaScript"},{"code":"[1990, 1666, 2008]\n","language":"JavaScript"},{"code":"(() => {\n // romanValue :: String -> Int\n const romanValue = s =>\n s.length ? (() => {\n const parse = [].concat(\n ...glyphs.map(g => 0 === s.indexOf(g) ? (\n [dctTrans[g], s.substr(g.length)]\n ) : [])\n );\n return parse[0] + romanValue(parse[1]);\n })() : 0;\n\n // dctTrans :: {romanKey: Integer}\n const dctTrans = {\n M: 1E3,\n CM: 900,\n D: 500,\n CD: 400,\n C: 100,\n XC: 90,\n L: 50,\n XL: 40,\n X: 10,\n IX: 9,\n V: 5,\n IV: 4,\n I: 1\n };\n\n // glyphs :: [romanKey]\n const glyphs = Object.keys(dctTrans);\n\n // TEST -------------------------------------------------------------------\n return [\"MCMXC\", \"MDCLXVI\", \"MMVIII\", \"MMMM\"].map(romanValue);\n})();\n","language":"JavaScript"},{"code":"[1990,1666,2008,4000]\n","language":"JavaScript"},{"code":"(() => {\n\n // -------------- ROMAN NUMERALS DECODED ---------------\n\n // Folding from right to left,\n // lower leftward characters are subtracted,\n // others are added.\n\n // fromRoman :: String -> Int\n const fromRoman = s =>\n foldr(l => ([r, n]) => [\n l,\n l >= r ? (\n n + l\n ) : n - l\n ])([0, 0])(\n [...s].map(charVal)\n )[1];\n\n // charVal :: Char -> Maybe Int\n const charVal = k => {\n const v = {\n I: 1,\n V: 5,\n X: 10,\n L: 50,\n C: 100,\n D: 500,\n M: 1000\n } [k];\n return v !== undefined ? v : 0;\n };\n\n // ----------------------- TEST ------------------------\n const main = () => [\n 'MDCLXVI', 'MCMXC', 'MMVIII', 'MMXVI', 'MMXVII'\n ]\n .map(fromRoman)\n .join('\\n');\n\n\n // ----------------- GENERIC FUNCTIONS -----------------\n\n // foldr :: (a -> b -> b) -> b -> [a] -> b\n const foldr = f =>\n // Note that that the Haskell signature of foldr\n // differs from that of foldl - the positions of\n // accumulator and current value are reversed.\n a => xs => [...xs].reduceRight(\n (a, x) => f(x)(a),\n a\n );\n\n // MAIN ---\n return main();\n})();\n","language":"JavaScript"},{"code":"(() => {\nfunction toNumeric(value) {\n return value\n .replace(/IV/, 'I'.repeat(4))\n .replace(/V/g, 'I'.repeat(5))\n .replace(/IX/, 'I'.repeat(9))\n .replace(/XC/, 'I'.repeat(90))\n .replace(/XL/, 'I'.repeat(40))\n .replace(/X/g, 'I'.repeat(10))\n .replace(/L/, 'I'.repeat(50))\n .replace(/CD/, 'I'.repeat(400))\n .replace(/CM/, 'I'.repeat(900))\n .replace(/C/g, 'I'.repeat(100))\n .replace(/D/g, 'I'.repeat(500))\n .replace(/M/g, 'I'.repeat(1000))\n .length;\n}\n\nconst numerics = [\"MMXVI\", \"MCMXC\", \"MMVIII\", \"MM\", \"MDCLXVI\"]\n .map(toNumeric);\n\nconsole.log(numerics);\n})();\n","language":"JavaScript"},{"code":"def fromRoman:\n def addRoman(n):\n if length == 0 then n\n elif startswith(\"M\") then .[1:] | addRoman(1000 + n)\n elif startswith(\"CM\") then .[2:] | addRoman(900 + n)\n elif startswith(\"D\") then .[1:] | addRoman(500 + n)\n elif startswith(\"CD\") then .[2:] | addRoman(400 + n)\n elif startswith(\"C\") then .[1:] | addRoman(100 + n)\n elif startswith(\"XC\") then .[2:] | addRoman(90 + n)\n elif startswith(\"L\") then .[1:] | addRoman(50 + n)\n elif startswith(\"XL\") then .[2:] | addRoman(40 + n)\n elif startswith(\"X\") then .[1:] | addRoman(10 + n)\n elif startswith(\"IX\") then .[2:] | addRoman(9 + n)\n elif startswith(\"V\") then .[1:] | addRoman(5 + n)\n elif startswith(\"IV\") then .[2:] | addRoman(4 + n)\n elif startswith(\"I\") then .[1:] | addRoman(1 + n)\n else\n error(\"invalid Roman numeral: \" + tostring)\n end;\n addRoman(0);\n","language":"Jq"},{"code":"[ \"MCMXC\", \"MMVIII\", \"MDCLXVI\" ] | map(\"\\(.) => \\(fromRoman)\") | .[]\n","language":"Jq"},{"code":"$ jq -n -f -r fromRoman.jq\nMCMXC => 1990\nMMVIII => 2008\nMDCLXVI => 1666\n","language":"Jq"},{"code":"function parseroman(rnum::AbstractString)\n romandigits = Dict('I' => 1, 'V' => 5, 'X' => 10, 'L' => 50,\n 'C' => 100, 'D' => 500, 'M' => 1000)\n mval = accm = 0\n for d in reverse(uppercase(rnum))\n val = try\n romandigits[d]\n catch\n throw(DomainError())\n end\n if val > mval maxval = val end\n if val < mval\n accm -= val\n else\n accm += val\n end\n end\n return accm\nend\n","language":"Julia"},{"code":"using Printf\n\ntest = [\"I\", \"III\", \"IX\", \"IVI\", \"IIM\",\n \"CMMDXL\", \"icv\", \"cDxLiV\", \"MCMLD\", \"ccccccd\",\n \"iiiiiv\", \"MMXV\", \"MCMLXXXIV\", \"ivxmm\", \"SPQR\"]\nfor rnum in test\n @printf(\"%15s → %s\\n\", rnum, try parseroman(rnum) catch \"not valid\" end)\nend\n","language":"Julia"},{"code":" romd: {v:1 5 10 50 100 500 1000@\"IVXLCDM\"?/:x; +/v*_-1^(>':v),0}\n","language":"K"},{"code":" romd'(\"MCMXC\";\"MMVIII\";\"MDCLXVI\")\n1990 2008 1666\n","language":"K"},{"code":"// version 1.0.6\n\nfun romanDecode(roman: String): Int {\n if (roman.isEmpty()) return 0\n var n = 0\n var last = 'O'\n for (c in roman) {\n when (c) {\n 'I' -> n += 1\n 'V' -> if (last == 'I') n += 3 else n += 5\n 'X' -> if (last == 'I') n += 8 else n += 10\n 'L' -> if (last == 'X') n += 30 else n += 50\n 'C' -> if (last == 'X') n += 80 else n += 100\n 'D' -> if (last == 'C') n += 300 else n += 500\n 'M' -> if (last == 'C') n += 800 else n += 1000\n }\n last = c\n }\n return n\n}\n\nfun main(args: Array<String>) {\n val romans = arrayOf(\"I\", \"III\", \"IV\", \"VIII\", \"XLIX\", \"CCII\", \"CDXXXIII\", \"MCMXC\", \"MMVIII\", \"MDCLXVI\")\n for (roman in romans) println(\"${roman.padEnd(10)} = ${romanDecode(roman)}\")\n}\n","language":"Kotlin"},{"code":"define br => '\\r'\n//decode roman\ndefine decodeRoman(roman::string)::integer => {\n\tlocal(ref = array('M'=1000, 'CM'=900, 'D'=500, 'CD'=400, 'C'=100, 'XC'=90, 'L'=50, 'XL'=40, 'X'=10, 'IX'=9, 'V'=5, 'IV'=4, 'I'=1))\n\tlocal(out = integer)\n\twhile(#roman->size) => {\n\t\t// need to use neset while instead of query expr to utilize loop_abort\n\t\twhile(loop_count <= #ref->size) => {\n\t\t\tif(#roman->beginswith(#ref->get(loop_count)->first)) => {\n\t\t\t\t#out += #ref->get(loop_count)->second\n\t\t\t\t#roman->remove(1,#ref->get(loop_count)->first->size)\n\t\t\t\tloop_abort\n\t\t\t}\n\t\t}\n\t}\n\treturn #out\n}\n\n'MCMXC as integer is '+decodeRoman('MCMXC')\nbr\n'MMVIII as integer is '+decodeRoman('MMVIII')\nbr\n'MDCLXVI as integer is '+decodeRoman('MDCLXVI')\n","language":"Lasso"},{"code":" print \"MCMXCIX = \"; romanDec( \"MCMXCIX\") '1999\n print \"MDCLXVI = \"; romanDec( \"MDCLXVI\") '1666\n print \"XXV = \"; romanDec( \"XXV\") '25\n print \"CMLIV = \"; romanDec( \"CMLIV\") '954\n print \"MMXI = \"; romanDec( \"MMXI\") '2011\n\n end\n\nfunction romanDec( roman$)\n arabic =0\n lastval =0\n\n for i = len( roman$) to 1 step -1\n select case upper$( mid$( roman$, i, 1))\n case \"M\"\n n = 1000\n case \"D\"\n n = 500\n case \"C\"\n n = 100\n case \"L\"\n n = 50\n case \"X\"\n n = 10\n case \"V\"\n n = 5\n case \"I\"\n n = 1\n case else\n n = 0\n end select\n\n if n <lastval then\n arabic =arabic -n\n else\n arabic =arabic +n\n end if\n\n lastval =n\n next\n\n romanDec =arabic\nend function\n","language":"Liberty-BASIC"},{"code":"require! 'prelude-ls': {fold, sum}\n\n# String → Number\ndecimal_of_roman = do\n # [Number, Number] → String → [Number, Number]\n _convert = ([acc, last_value], ch) ->\n current_value = { M:1000 D:500 C:100 L:50 X:10 V:5 I:1 }[ch] ? 0\n op = if last_value < current_value then (-) else (+)\n [op(acc, last_value), current_value]\n # fold the string and sum the resulting tuple (array)\n fold(_convert, [0, 0]) >> sum\n\n{[rom, decimal_of_roman rom] for rom in <[ MCMXC MMVII MDCLXVII MMMCLIX MCMLXXVII MMX ]>}\n","language":"LiveScript"},{"code":"; Roman numeral decoder\n\n; First, some useful substring utilities\nto starts_with? :string :prefix\n if empty? :prefix [output \"true]\n if empty? :string [output \"false]\n if not equal? first :string first :prefix [output \"false]\n output starts_with? butfirst :string butfirst :prefix\nend\n\nto remove_prefix :string :prefix\n if or empty? :prefix not starts_with? :string :prefix [output :string]\n output remove_prefix butfirst :string butfirst :prefix\nend\n\n; Our list of Roman numeral values\nmake \"values [[M 1000] [CM 900] [D 500] [CD 400] [C 100] [XC 90] [L 50]\n [XL 40] [X 10] [IX 9] [V 5] [IV 4] [I 1]]\n\n; Function to do the work\nto from_roman :str\n local \"n make \"n 0\n foreach :values [\n local \"s make \"s first ?\n local \"v make \"v last ?\n while [starts_with? :str :s] [\n make \"n sum n :v\n make \"str remove_prefix :str :s\n ]\n ]\n output :n\nend\n\nforeach [MCMXC MDCLXVI MMVIII] [print (sentence (word ? \"|: |) from_roman ?)]\nbye\n","language":"Logo"},{"code":"function ToNumeral( roman )\n local Num = { [\"M\"] = 1000, [\"D\"] = 500, [\"C\"] = 100, [\"L\"] = 50, [\"X\"] = 10, [\"V\"] = 5, [\"I\"] = 1 }\n local numeral = 0\n\n local i = 1\n local strlen = string.len(roman)\n while i < strlen do\n local z1, z2 = Num[ string.sub(roman,i,i) ], Num[ string.sub(roman,i+1,i+1) ]\n if z1 < z2 then\n numeral = numeral + ( z2 - z1 )\n i = i + 2\n else\n numeral = numeral + z1\n i = i + 1\n end\n end\n\n if i <= strlen then numeral = numeral + Num[ string.sub(roman,i,i) ] end\n\n return numeral\nend\n\nprint( ToNumeral( \"MCMXC\" ) )\nprint( ToNumeral( \"MMVIII\" ) )\nprint( ToNumeral( \"MDCLXVI\" ) )\n","language":"Lua"},{"code":"Module RomanNumbers {\n flush ' empty current stack\n gosub Initialize\n document Doc$\n while not empty\n read rom$\n print rom$;\"=\";RomanEval$(rom$)\n Doc$=rom$+\"=\"+RomanEval$(rom$)+{\n }\n end while\n Clipboard Doc$\n end\nInitialize:\n function RomanEval$(rom$) {\n Flush\n =\"invalid\"\n if filter$(rom$,\"MDCLXVI\")<>\"\" Then Exit\n \\\\ \"Y\" is in top of stack\n Push \"CM\", \"MD\", \"Q\"\n Push \"CD\", \"MD\",\"W\"\n Push \"XC\", \"DL\", \"E\"\n Push \"XL\", \"X\",\"R\"\n Push \"IX\",\"V\",\"T\"\n Push \"IV\",\"I\",\"Y\"\n \\\\ stack flush to doublerom\n doublerom=[]\n \\\\ \"M\" is in top of stack\n Data \"M\", 1000, \"Q\",900\n Data \"D\", 500,\"W\", 400\n Data \"C\",100,\"E\",90\n Data \"L\",50,\"R\", 40\n Data \"X\", 10, \"T\", 9\n Data \"V\", 5, \"Y\", 4, \"I\",1\n \\\\ stack flush to singlerom\n singlerom=[]\n acc=0\n value=0\n count=0\n stack doublerom {\n if empty then exit\n read rep$,exclude$,cc$\n i=instr(rom$,cc$)\n if i >0 then\n tmp$=mid$(rom$,i+2)\n L=Len(tmp$)\n if L>0 then if Len(filter$(tmp$, exclude$))<>L then rom$=\"A\": exit\n if Instr(rom$,mid$(rom$,i,1))<i then rom$=\"A\": exit\n insert i,2 rom$=rep$ ' replace at pos i with rep$ and place a space to i+1\n end if\n loop\n }\n rom$=filter$(rom$,\" \") ' remove spaces if exist\n\n stack singlerom {\n if empty then exit\n read cc$, value\n count=0\n while left$(rom$,1)=cc$\n insert 1, 1 rom$=\"\"\n count++\n acc+=value\n end while\n if count>3 then exit\n loop\n }\n if len(rom$)>0 or count>3 Else\n =Str$(acc,1033)\n end if\n }\n data \"MMMCMXCIX\", \"LXXIIX\", \"MMXVII\", \"LXXIX\", \"CXCIX\",\"MCMXCIX\",\"MMMDCCCLXXXVIII\"\n data \"CMXI\",\"M\",\"MCDXLIV\",\"CCCC\",\"IXV\", \"XLIXL\",\"LXXIIX\",\"IVM\"\n data \"XXXIX\", \"XXXX\", \"XIXX\",\"IVI\", \"XLIX\",\"XCIX\",\"XCIV\",\"XLVIII\"\n return\n}\nRomanNumbers\n","language":"M2000-Interpreter"},{"code":"f := n -> convert(n, arabic):\nseq(printf(\"%a\\n\", f(i)), i in [MCMXC, MMVIII, MDCLXVI]);\n","language":"Maple"},{"code":"FromRomanNumeral[\"MMCDV\"]\n","language":"Mathematica"},{"code":"function x = rom2dec(s)\n% ROM2DEC converts Roman numbers to decimal\n\n% store Roman digits values: I=1, V=5, X=10, L=50, C=100, D=500, M=1000\ndigitsValues = [0 0 100 500 0 0 0 0 1 0 0 50 1000 0 0 0 0 0 0 0 0 5 0 10 0 0];\n% convert Roman number to array of values\nvalues = digitsValues(s-'A'+1);\n% change sign if next value is bigger\nx = sum(values .* [sign(diff(-values)+eps),1]);\n\nend\n","language":"MATLAB"},{"code":"romanNumbers = {'MMMCMXCIX', 'XLVIII', 'MMVIII'};\nfor n = 1 : numel(romanNumbers)\n fprintf('%10s = %4d\\n',romanNumbers{n}, rom2dec(romanNumbers{n}));\nend\n","language":"MATLAB"},{"code":":- module test_roman.\n\n:- interface.\n\n:- import_module io.\n\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\n\n:- import_module char.\n:- import_module exception.\n:- import_module int.\n:- import_module list.\n:- import_module string.\n\n:- type conversion_error ---> not_a_roman_number.\n\n:- func build_int(list(char), int, int) = int.\n:- func from_roman(string) = int.\n:- pred roman_to_int(char::in, int::out) is semidet.\n\nfrom_roman(Roman) = Decimal :-\n List = reverse(to_char_list(Roman)),\n Decimal = build_int(List, 0, 0).\n\nbuild_int([], LastValue, Accumulator) = LastValue + Accumulator.\nbuild_int([Digit|Rest], LastValue, Accumulator) = Sum :-\n ( roman_to_int(Digit, Value) ->\n ( Value < LastValue ->\n Sum = build_int(Rest, Value, Accumulator - LastValue)\n ; Sum = build_int(Rest, Value, Accumulator + LastValue) )\n ; throw(not_a_roman_number) ).\n\nroman_to_int('I', 1).\nroman_to_int('V', 5).\nroman_to_int('X', 10).\nroman_to_int('L', 50).\nroman_to_int('C', 100).\nroman_to_int('D', 500).\nroman_to_int('M', 1000).\n\nmain(!IO) :-\n command_line_arguments(Args, !IO),\n foldl((pred(Arg::in, !.IO::di, !:IO::uo) is det :-\n format(\"%s => %d\\n\", [s(Arg), i(from_roman(Arg))], !IO)),\n Args, !IO).\n\n:- end_module test_roman.\n","language":"Mercury"},{"code":"main :: [sys_message]\nmain = [ Stdout (s ++ \": \" ++ show (fromroman s) ++ \"\\n\")\n | s <- [\"MCMXC\", \"MDCLXVI\", \"MMVII\", \"MMXXIII\"]\n ]\n\nfromroman :: [char]->num\nfromroman = f\n where f [] = 0\n f [x] = r x\n f (x:y:xs) = f (y:xs) - r x, if r x < r y\n = f (y:xs) + r x, otherwise\n r 'M' = 1000\n r 'D' = 500\n r 'C' = 100\n r 'L' = 50\n r 'X' = 10\n r 'V' = 5\n r 'I' = 1\n","language":"Miranda"},{"code":"MODULE RomanNumerals;\nFROM InOut IMPORT WriteString, WriteCard, WriteLn;\nFROM Strings IMPORT Length;\n\n(* Convert given Roman numeral to binary *)\nPROCEDURE DecodeRoman(s: ARRAY OF CHAR): CARDINAL;\n VAR i, d, len, acc: CARDINAL;\n\n PROCEDURE Digit(d: CHAR): CARDINAL;\n BEGIN\n CASE CHR( BITSET(ORD(d)) + BITSET{5} ) OF (* lowercase *)\n 'm': RETURN 1000;\n | 'd': RETURN 500;\n | 'c': RETURN 100;\n | 'l': RETURN 50;\n | 'x': RETURN 10;\n | 'v': RETURN 5;\n | 'i': RETURN 1;\n ELSE\n RETURN 0;\n END;\n END Digit;\nBEGIN\n len := Length(s);\n acc := 0;\n FOR i := 0 TO len-1 DO\n d := Digit(s[i]);\n IF d=0 THEN RETURN 0; END;\n\n IF (i # len-1) AND (d < Digit(s[i+1])) THEN\n acc := acc - d;\n ELSE\n acc := acc + d;\n END;\n END;\n RETURN acc;\nEND DecodeRoman;\n\nPROCEDURE Show(s: ARRAY OF CHAR);\nBEGIN\n WriteString(s);\n WriteString(\": \");\n WriteCard(DecodeRoman(s), 0);\n WriteLn();\nEND Show;\n\nBEGIN\n Show(\"MCMXC\");\n Show(\"MDCLXVI\");\n Show(\"mmvii\");\n Show(\"mmxxi\");\nEND RomanNumerals.\n","language":"Modula-2"},{"code":"def decodeSingle(letter)\n\tif letter = \"M\"\n\t\treturn 1000\n\telse if letter = \"D\"\n\t\treturn 500\n\telse if letter = \"C\"\n\t\treturn 100\n\telse if letter = \"L\"\n\t\treturn 50\n\telse if letter = \"X\"\n\t\treturn 10\n\telse if letter = \"V\"\n\t\treturn 5\n\telse if letter = \"I\"\n\t\treturn 1\n\telse\n\t\treturn 0\n\tend\nend\n\ndef decode(roman)\n\tresult = 0\n\tuRoman = roman.toUpperCase()\n\t\n\tfor (i = 0) (i < len(uRoman) - 1) (i += 1)\n\t\tif decodeSingle(uRoman[i]) < decodeSingle(uRoman[i + 1])\n\t\t\tresult -= decodeSingle(uRoman[i])\n\t\telse\n\t\t\tresult += decodeSingle(uRoman[i])\n\t\tend\n\tend\n\t\n\tresult += decodeSingle(uRoman[len(uRoman) - 1])\n\treturn result\nend\n\nprintln decode(\"MCMXC\")\nprintln decode(\"MMVIII\")\nprintln decode(\"MDCLXVI\")\n","language":"Nanoquery"},{"code":"/* NetRexx */\noptions replace format comments java crossref savelog symbols binary\n\n /* 1990 2008 1666 */\nyears = Rexx('MCMXC MMVIII MDCLXVI')\n\nloop y_ = 1 to years.words\n Say years.word(y_).right(10) || ':' decode(years.word(y_))\n end y_\n\nreturn\n\nmethod decode(arg) public static returns int signals IllegalArgumentException\n\n parse arg.upper roman .\n if roman.verify('MDCLXVI') \\= 0 then signal IllegalArgumentException\n\n -- always insert the value of the least significant numeral\n decnum = rchar(roman.substr(roman.length, 1))\n loop d_ = 1 to roman.length - 1\n if rchar(roman.substr(d_, 1)) < rchar(roman.substr(d_ + 1, 1)) then do\n -- Handle cases where numerals are not in descending order\n -- subtract the value of the numeral\n decnum = decnum - rchar(roman.substr(d_, 1))\n end\n else do\n -- Normal case\n -- add the value of the numeral\n decnum = decnum + rchar(roman.substr(d_, 1))\n end\n end d_\n\n return decnum\n\nmethod rchar(arg) public static returns int\n\n parse arg.upper ch +1 .\n select case ch\n when 'M' then digit = 1000\n when 'D' then digit = 500\n when 'C' then digit = 100\n when 'L' then digit = 50\n when 'X' then digit = 10\n when 'V' then digit = 5\n when 'I' then digit = 1\n otherwise digit = 0\n end\n\n return digit\n","language":"NetRexx"},{"code":"import tables\n\nlet rdecode = {'M': 1000, 'D': 500, 'C': 100, 'L': 50, 'X': 10, 'V': 5, 'I': 1}.toTable\n\nproc decode(roman: string): int =\n for i in 0 ..< roman.high:\n let (rd, rd1) = (rdecode[roman[i]], rdecode[roman[i+1]])\n result += (if rd < rd1: -rd else: rd)\n result += rdecode[roman[roman.high]]\n\nfor r in [\"MCMXC\", \"MMVIII\", \"MDCLXVI\"]:\n echo r, \" \", decode(r)\n","language":"Nim"},{"code":"let decimal_of_roman roman =\n let arabic = ref 0 in\n let lastval = ref 0 in\n for i = (String.length roman) - 1 downto 0 do\n let n =\n match roman.[i] with\n | 'M' | 'm' -> 1000\n | 'D' | 'd' -> 500\n | 'C' | 'c' -> 100\n | 'L' | 'l' -> 50\n | 'X' | 'x' -> 10\n | 'V' | 'v' -> 5\n | 'I' | 'i' -> 1\n | _ -> 0\n in\n if n < !lastval\n then arabic := !arabic - n\n else arabic := !arabic + n;\n lastval := n\n done;\n !arabic\n\nlet () =\n Printf.printf \" %d\\n\" (decimal_of_roman \"MCMXC\");\n Printf.printf \" %d\\n\" (decimal_of_roman \"MMVIII\");\n Printf.printf \" %d\\n\" (decimal_of_roman \"MDCLXVI\");\n;;\n","language":"OCaml"},{"code":"(* Scan the roman number from right to left. *)\n(* When processing a roman digit, if the previously processed roman digit was\n * greater than the current one, we must substract the latter from the current\n * total, otherwise add it.\n * Example:\n * - MCMLXX read from right to left is XXLMCM\n * the sum is 10 + 10 + 50 + 1000 - 100 + 1000 *)\nlet decimal_of_roman roman =\n (* Use 'String.uppercase' for OCaml 4.02 and previous. *)\n let rom = String.uppercase_ascii roman in\n (* A simple association list. IMHO a Hashtbl is a bit overkill here. *)\n let romans = List.combine ['I'; 'V'; 'X'; 'L'; 'C'; 'D'; 'M']\n [1; 5; 10; 50; 100; 500; 1000] in\n let compare x y =\n if x < y then -1 else 1\n in\n (* Scan the string from right to left using index i, and keeping track of\n * the previously processed roman digit in prevdig. *)\n let rec doloop i prevdig =\n if i < 0 then 0\n else\n try\n let currdig = List.assoc rom.[i] romans in\n (currdig * compare currdig prevdig) + doloop (i - 1) currdig\n with\n (* Ignore any incorrect roman digit and just process the next one. *)\n Not_found -> doloop (i - 1) 0\n in\n doloop (String.length rom - 1) 0\n\n\n(* Some simple tests. *)\nlet () =\n let testit roman decimal =\n let conv = decimal_of_roman roman in\n let status = if conv = decimal then \"PASS\" else \"FAIL\" in\n Printf.sprintf \"[%s] %s\\tgives %d.\\tExpected: %d.\\t\"\n status roman conv decimal\n in\n print_endline \">>> Usual roman numbers.\";\n print_endline (testit \"MCMXC\" 1990);\n print_endline (testit \"MMVIII\" 2008);\n print_endline (testit \"MDCLXVI\" 1666);\n print_newline ();\n\n print_endline \">>> Roman numbers with lower case letters are OK.\";\n print_endline (testit \"McmXC\" 1990);\n print_endline (testit \"MMviii\" 2008);\n print_endline (testit \"mdCLXVI\" 1666);\n print_newline ();\n\n print_endline \">>> Incorrect roman digits are ignored.\";\n print_endline (testit \"McmFFXC\" 1990);\n print_endline (testit \"MMviiiPPPPP\" 2008);\n print_endline (testit \"mdCLXVI_WHAT_NOW\" 1666);\n print_endline (testit \"2 * PI ^ 2\" 1); (* The I in PI... *)\n print_endline (testit \"E = MC^2\" 1100)\n","language":"OCaml"},{"code":"fromRoman(s)={\n my(v=Vecsmall(s),key=vector(88),cur,t=0,tmp);\n key[73]=1;key[86]=5;key[88]=10;key[76]=50;key[67]=100;key[68]=500;key[77]=1000;\n cur=key[v[1]];\n for(i=2,#v,\n tmp=key[v[i]];\n if(!cur, cur=tmp; next);\n if(tmp>cur,\n t+=tmp-cur;\n cur=0\n ,\n t+=cur;\n cur=tmp\n )\n );\n t+cur\n};\n","language":"PARI-GP"},{"code":"use 5.10.0;\n\n{\n my @trans = (\n [M => 1000], [CM => 900],\n [D => 500], [CD => 400],\n [C => 100], [XC => 90],\n [L => 50], [XL => 40],\n [X => 10], [IX => 9],\n [V => 5], [IV => 4],\n [I => 1],\n );\n\n sub from_roman {\n my $r = shift;\n my $n = 0;\n foreach my $pair (@trans) {\n my ($k, $v) = @$pair;\n $n += $v while $r =~ s/^$k//i;\n }\n return $n\n }\n}\n\nsay \"$_: \", from_roman($_) for qw(MCMXC MDCLXVI MMVIII);\n","language":"Perl"},{"code":"#!/usr/bin/perl\n\nuse strict;\nuse warnings;\n\nsub roman2decimal\n {\n (local $_, my $sum, my $zeros) = (shift, 0, '');\n $zeros .= 0 while\n $sum -= s/I(?=[VX])// - s/V// * 5 - s/I//g . $zeros,\n tr/MDCLX/CLXVI/;\n return $sum;\n }\n\nprint s/$/ \": \" . roman2decimal($_) /er while <DATA>;\n\n__DATA__\nMCMXC\nMMVIII\nMDCLXVI\n","language":"Perl"},{"code":"#!/usr/bin/perl\n\nuse strict;\nuse warnings;\n\nsub roman2decimal\n {\n my $sum = 0;\n $sum += $^R while $_[0] =~\n / M (?{1000})\n | D (?{ 500})\n | C (?{ 100}) (?= [MD] (?{-100}) )?\n | L (?{ 50})\n | X (?{ 10}) (?= [CL] (?{ -10}) )?\n | V (?{ 5})\n | I (?{ 1}) (?= [XV] (?{ -1}) )?\n /gx;\n return $sum;\n }\n\nprint s/$/ \": \" . roman2decimal($_) /er while <DATA>;\n\n__DATA__\nMCMXC\nMMVIII\nMDCLXVI\n","language":"Perl"},{"code":"with javascript_semantics\nfunction romanDec(string s)\n integer res = 0, prev = 0\n for i=length(s) to 1 by -1 do\n integer rdx = find(upper(s[i]),\"IVXLCDM\"),\n rn = power(10,floor((rdx-1)/2))\n if even(rdx) then rn *= 5 end if\n res += iff(rn<prev?-rn:rn)\n prev = rn\n end for\n return {s,res} -- (for output)\nend function\n\n?apply({\"MCMXC\",\"MMVIII\",\"MDCLXVI\"},romanDec)\n","language":"Phix"},{"code":"with javascript_semantics\nrequires(\"1.0.5\")\nfunction romanDec(string s)\n return {s,scanf(s,\"%R\")[1][1]}\nend function\n","language":"Phix"},{"code":"def romanDec /# s -- n #/\n 0 >ps 0 >ps\n ( ( \"M\" 1000 ) ( \"D\" 500 ) ( \"C\" 100 ) ( \"L\" 50 ) ( \"X\" 10 ) ( \"V\" 5 ) ( \"I\" 1 ) )\n\n swap upper reverse\n len while\n pop rot rot tochar getd\n if\n dup ps> < if 0 swap - endif\n dup ps> + >ps\n >ps\n swap\n else\n \"Error: \" print ? \"\"\n endif\n len\n endwhile\n drop drop\n ps> drop ps>\nenddef\n\n/# usage example: \"MMXX\" romanDec ? (show 2020) #/\n","language":"Phixmonti"},{"code":"\"MDCLXVI\" var romans\n( 1000 500 100 50 10 5 1 ) var decmls\n\ndef romanDec /# s -- n #/\n 0 var prev\n 0 var res\n upper\n ( len 1 -1 ) for\n get\n romans swap find nip\n dup if\n decmls swap get nip\n dup prev < if 0 swap - endif\n dup res + var res\n var prev\n else\n \"Error\" ? 0 var res exitfor\n endif\n endfor\n drop\n res\nenddef\n","language":"Phixmonti"},{"code":"<?php\n/**\n * @author Elad Yosifon\n */\n$roman_to_decimal = array(\n\t'I' => 1,\n\t'V' => 5,\n\t'X' => 10,\n\t'L' => 50,\n\t'C' => 100,\n\t'D' => 500,\n\t'M' => 1000,\n);\n\n/**\n * @param $number\n * @return int\n */\nfunction roman2decimal($number)\n{\n\tglobal $roman_to_decimal;\n\n\t// breaks the string into an array of chars\n\t$digits = str_split($number);\n\t$lastIndex = count($digits)-1;\n\t$sum = 0;\n\n\tforeach($digits as $index => $digit)\n\t{\n\t\tif(!isset($digits[$index]))\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tif(isset($roman_to_decimal[$digit]))\n\t\t{\n\t\t\tif($index < $lastIndex)\n\t\t\t{\n\t\t\t\t$left = $roman_to_decimal[$digits[$index]];\n\t\t\t\t$right = $roman_to_decimal[$digits[$index+1]];\n\t\t\t\tif($left < $right)\n\t\t\t\t{\n\t\t\t\t\t$sum += ($right - $left);\n\t\t\t\t\tunset($digits[$index+1],$left, $right);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tunset($left, $right);\n\t\t\t}\n\t\t}\n\t\t$sum += $roman_to_decimal[$digit];\n\t}\n\n\treturn $sum;\n}\n\n/*============= OUTPUT =============*/\nheader('Content-Type: text/plain');\n\n$tests = array(\n\t\"I\" => array(roman2decimal('I'), 1),\n\t\"II\" => array(roman2decimal('II'), 2),\n\t\"III\" => array(roman2decimal('III'), 3),\n\t\"IV\" => array(roman2decimal('IV'), 4),\n\t\"V\" => array(roman2decimal('V'), 5),\n\t\"VI\" => array(roman2decimal('VI'), 6),\n\t\"VII\" => array(roman2decimal('VII'), 7),\n\t\"IX\" => array(roman2decimal('IX'), 9),\n\t\"X\" => array(roman2decimal('X'), 10),\n\t\"XI\" => array(roman2decimal('XI'), 11),\n\t\"XIV\" => array(roman2decimal('XIV'), 14),\n\t\"XV\" => array(roman2decimal('XV'), 15),\n\t\"XVI\" => array(roman2decimal('XVI'), 16),\n\t\"XVIV\" => array(roman2decimal('XVIV'), 19),\n\t\"XIX\" => array(roman2decimal('XIX'), 19),\n\t\"MDCLXVI\" => array(roman2decimal('MDCLXVI'), 1666),\n\t\"MCMXC\" => array(roman2decimal('MCMXC'), 1990),\n\t\"MMVIII\" => array(roman2decimal('MMVIII'), 2008),\n\t\"MMMCLIX\" => array(roman2decimal('MMMCLIX'), 3159),\n\t\"MCMLXXVII\" => array(roman2decimal('MCMLXXVII'), 1977),\n);\n\n\nforeach($tests as $key => $value)\n{\n\techo \"($key == {$value[0]}) => \" . ($value[0] === $value[1] ? \"true\" : \"false, should be {$value[1]}.\") . \"\\n\";\n}\n","language":"PHP"},{"code":"go =>\n List = [\"IV\",\n \"XLII\",\n \"M\",\n \"MCXI\",\n \"CMXI\",\n \"MCM\",\n \"MCMXC\",\n \"MMVIII\",\n \"MMIX\",\n \"MCDXLIV\",\n \"MDCLXVI\",\n \"MMXII\"],\n foreach(R in List)\n printf(\"%-8s: %w\\n\", R, roman_decode(R))\n end,\n nl.\n\n\nroman_decode(Str) = Res =>\n if Str == \"\" then\n Res := \"\"\n else\n D = new_map(findall((R=D), roman(R,D))),\n Res = 0,\n Old = 0,\n foreach(S in Str)\n N = D.get(S),\n % Fix for the Roman convention that XC = 90, not 110.\n if Old > 0, N > Old then\n Res := Res - 2*Old\n end,\n Res := Res + N,\n Old := N\n end\n end.\n\nroman('I', 1).\nroman('V', 5).\nroman('X', 10).\nroman('L', 50).\nroman('C', 100).\nroman('D', 500).\nroman('M', 1000).\n","language":"Picat"},{"code":"(de roman2decimal (Rom)\n (let L (replace (chop Rom) 'M 1000 'D 500 'C 100 'L 50 'X 10 'V 5 'I 1)\n (sum '((A B) (if (>= A B) A (- A))) L (cdr L)) ) )\n","language":"PicoLisp"},{"code":"test_decode: procedure options (main); /* 28 January 2013 */\n declare roman character (20) varying;\n\n do roman = 'i', 'ii', 'iii', 'iv', 'v', 'vi', 'vii', 'viii', 'iix',\n 'ix', 'x', 'xi', 'xiv', 'MCMLXIV', 'MCMXC', 'MDCLXVI',\n 'MIM', 'MM', 'MMXIII';\n put skip list (roman, decode(roman));\n end;\n\ndecode: procedure (roman) returns (fixed(15));\n declare roman character (*) varying;\n declare (current, previous) character (1);\n declare n fixed (15);\n declare i fixed binary;\n\n previous = ''; n = 0;\n do i = length(roman) to 1 by -1;\n current = substr(roman, i, 1);\n if digit_value(current) < digit_value(previous) then\n n = n - digit_value(current);\n else if digit_value(current) > digit_value(previous) then\n do;\n n = n + digit_value(current);\n previous = current;\n end;\n else\n n = n + digit_value(current);\n end;\n return (n);\nend decode;\n\ndigit_value: procedure (roman_char) returns (fixed);\n declare roman_char character(1);\n select (roman_char);\n when ('M', 'm') return (1000);\n when ('D', 'd') return (500);\n when ('C', 'c') return (100);\n when ('L', 'l') return (50);\n when ('X', 'x') return (10);\n when ('V', 'v') return (5);\n when ('I', 'i') return (1);\n otherwise return (0);\n end;\nend digit_value;\n\nend test_decode;\n","language":"PL-I"},{"code":"100H:\n/* CP/M CALLS */\nBDOS: PROCEDURE (FN, ARG); DECLARE FN BYTE, ARG ADDRESS; GO TO 5; END BDOS;\nEXIT: PROCEDURE; CALL BDOS(0,0); END EXIT;\nPRINT: PROCEDURE (S); DECLARE S ADDRESS; CALL BDOS(9,S); END PRINT;\n\n/* CP/M COMMAND LINE ARGUMENT */\nDECLARE ARG$LPTR ADDRESS INITIAL (80H), ARG$LEN BASED ARG$LPTR BYTE;\nDECLARE ARG$PTR ADDRESS INITIAL (81H), ARG BASED ARG$PTR BYTE;\n\n/* CONVERT ROMAN NUMERAL TO BINARY */\nREAD$ROMAN: PROCEDURE (RP) ADDRESS;\n DECLARE DIGITS (7) BYTE INITIAL ('MDCLXVI');\n DECLARE VALUES (7) ADDRESS INITIAL (1000,500,100,50,10,5,1);\n DECLARE (RP, V, DVAL) ADDRESS, R BASED RP BYTE;\n V = 0;\n\n GET$DIGIT: PROCEDURE (D) ADDRESS;\n DECLARE (D, I) BYTE;\n DO I = 0 TO LAST(DIGITS);\n IF DIGITS(I) = D THEN RETURN VALUES(I);\n END;\n RETURN 0; /* NOT FOUND */\n END GET$DIGIT;\n\n DO WHILE R <> '$';\n DVAL = GET$DIGIT(R);\n IF DVAL = 0 THEN RETURN 0; /* ERROR */\n RP = RP + 1;\n IF GET$DIGIT(R) > DVAL THEN\n V = V - DVAL; /* SUBTRACTIVE PRINCIPLE */\n ELSE\n V = V + DVAL;\n END;\n RETURN V;\nEND READ$ROMAN;\n\n/* PRINT BINARY NUMBER AS DECIMAL */\nPRINT$NUMBER: PROCEDURE (N);\n DECLARE S (6) BYTE INITIAL ('.....$');\n DECLARE (N, P) ADDRESS, C BASED P BYTE;\n P = .S(5);\nDIGIT:\n P = P - 1;\n C = N MOD 10 + '0';\n N = N / 10;\n IF N > 0 THEN GO TO DIGIT;\n CALL PRINT(P);\nEND PRINT$NUMBER;\n\nIF ARG$LEN = 0 THEN DO;\n CALL PRINT(.'NO INPUT$');\n CALL EXIT;\nEND;\n\nARG(ARG$LEN) = '$'; /* TERMINATE ARGUMENT STRING */\nCALL PRINT(.ARG(1)); /* PRINT ROMAN NUMERAL */\nCALL PRINT(.': $');\nCALL PRINT$NUMBER(READ$ROMAN(.ARG(1))); /* CONVERT AND PRINT VALUE */\nCALL EXIT;\nEOF\n","language":"PL-M"},{"code":"/*****************************************************************\n * $Author: Atanas Kebedjiev $\n *****************************************************************\n * PL/SQL code can be run as anonymous block.\n * To test, execute the whole script or create the functions and then e.g. 'select rdecode('2012') from dual;\n * Please note that task definition does not describe fully some current rules, such as\n * * subtraction - IX XC CM are the valid subtraction combinations\n * * A subtraction character cannot be repeated: 8 is expressed as VIII and not as IIX\n * * V L and D cannot be used for subtraction\n * * Any numeral cannot be repeated more than 3 times: 1910 should be MCMX and not MDCCCCX\n * Code below does not validate the Roman numeral itself and will return a result even for a non-compliant number\n * E.g. both MCMXCIX and IMM will return 1999 but the first one is the correct notation\n */\n\nDECLARE\n\nFUNCTION rvalue(c IN CHAR) RETURN NUMBER IS\n i INTEGER;\nBEGIN\n i := 0;\n CASE (c)\n when 'M' THEN i := 1000;\n when 'D' THEN i := 500;\n when 'C' THEN i := 100;\n when 'L' THEN i := 50;\n when 'X' THEN i := 10;\n when 'V' THEN i := 5;\n when 'I' THEN i := 1;\n END CASE;\n RETURN i;\nEND;\n\n\nFUNCTION decode(rn IN VARCHAR2) RETURN NUMBER IS\n i INTEGER;\n l INTEGER;\n cr CHAR; -- current Roman numeral as substring from r\n cv INTEGER; -- value of current Roman numeral\n\n gr CHAR; -- next Roman numeral\n gv NUMBER; -- value of the next numeral;\n\n dv NUMBER; -- decimal value to return\nBEGIN\n l := length(rn);\n i := 1;\n dv := 0;\n while (i <= l)\n LOOP\n cr := substr(rn,i,1);\n cv := rvalue(cr);\n\n /* Look for a larger numeral in next position, like IV or CM\n The number to subtract should be at least 1/10th of the bigger number\n CM and XC are valid, but IC and XM are not */\n IF (i < l) THEN\n gr := substr(rn,i+1,1);\n gv := rvalue(gr);\n IF (cv < gv ) THEN\n dv := dv - cv;\n ELSE\n dv := dv + cv;\n END IF;\n ELSE\n dv := dv + cv;\n END IF; -- need to add the last value unconditionally\n\n i := i + 1;\n END LOOP;\n\nRETURN dv;\n\nEND;\n\nBEGIN\n\n DBMS_OUTPUT.PUT_LINE ('MMXII = ' || rdecode('MMXII')); -- 2012\n DBMS_OUTPUT.PUT_LINE ('MCMLI = ' || rdecode('MCMLI')); -- 1951\n DBMS_OUTPUT.PUT_LINE ('MCMLXXXVII = ' || rdecode('MCMLXXXVII')); -- 1987\n DBMS_OUTPUT.PUT_LINE ('MDCLXVI = ' || rdecode('MDCLXVI')); -- 1666\n DBMS_OUTPUT.PUT_LINE ('MCMXCIX = ' || rdecode('MCMXCIX')); -- 1999\n\nEND;\n","language":"PL-SQL"},{"code":"Filter FromRoman {\n\t$output = 0\n\t\n\tif ($_ -notmatch '^(M{1,3}|)(CM|CD|D?C{0,3}|)(XC|XL|L?X{0,3}|)(IX|IV|V?I{0,3}|)$') {\n\t\tthrow 'Incorrect format'\n\t}\n\t\n\t$current = 1000\n\t$subtractor = 'M'\n\t$whole = $False\n\t$roman = $_\n\t'C','D','X','L','I','V',' ' `\n\t| %{\n\t\tif ($whole = !$whole) {\n\t\t\t$current /= 10\n\t\t\t$subtractor = $_ + $subtractor[0]\n\t\t\t$_ = $subtractor[1]\n\t\t}\n\t\telse {\n\t\t\t$subtractor = $subtractor[0] + $_\n\t\t}\n\t\t\n\t\tif ($roman -match $subtractor) {\n\t\t\t$output += $current * (4,9)[$whole]\n\t\t\t$roman = $roman -replace $subtractor,''\n\t\t}\n\t\tif ($roman -match ($_ + '{1,3}')) {\n\t\t\t$output += $current * (5,10)[$whole] * $Matches[0].Length\n\t\t}\n\t}\n\t\n\t$output\n}\n","language":"PowerShell"},{"code":"'XIX','IV','','MMCDLXXIX','MMMI' | FromRoman\n","language":"PowerShell"},{"code":"decode_digit(i, 1).\ndecode_digit(v, 5).\ndecode_digit(x, 10).\ndecode_digit(l, 50).\ndecode_digit(c, 100).\ndecode_digit(d, 500).\ndecode_digit(m, 1000).\n\ndecode_string(Sum, _, [], Sum).\n\ndecode_string(LastSum, LastValue, [Digit|Rest], NextSum) :-\n decode_digit(Digit, Value),\n Value < LastValue,\n Sum is LastSum - Value,\n decode_string(Sum, Value, Rest, NextSum).\n\ndecode_string(LastSum, LastValue, [Digit|Rest], NextSum) :-\n decode_digit(Digit, Value),\n Value >= LastValue,\n Sum is LastSum + Value,\n decode_string(Sum, Value, Rest, NextSum).\n\ndecode_string(Atom, Value) :-\n atom_chars(Atom, String),\n reverse(String, [Last|Rest]),\n decode_digit(Last, Start),\n decode_string(Start, Start, Rest, Value).\n\ntest :-\n decode_string(mcmxc, 1990),\n decode_string(mmviii, 2008),\n decode_string(mdclxvi, 1666).\n","language":"Prolog"},{"code":"Procedure romanDec(roman.s)\n Protected i, n, lastval, arabic\n\n For i = Len(roman) To 1 Step -1\n Select UCase(Mid(roman, i, 1))\n Case \"M\"\n n = 1000\n Case \"D\"\n n = 500\n Case \"C\"\n n = 100\n Case \"L\"\n n = 50\n Case \"X\"\n n = 10\n Case \"V\"\n n = 5\n Case \"I\"\n n = 1\n Default\n n = 0\n EndSelect\n If (n < lastval)\n arabic - n\n Else\n arabic + n\n EndIf\n lastval = n\n Next\n\n ProcedureReturn arabic\nEndProcedure\n\nIf OpenConsole()\n PrintN(Str(romanDec(\"MCMXCIX\"))) ;1999\n PrintN(Str(romanDec(\"MDCLXVI\"))) ;1666\n PrintN(Str(romanDec(\"XXV\"))) ;25\n PrintN(Str(romanDec(\"CMLIV\"))) ;954\n PrintN(Str(romanDec(\"MMXI\"))) ;2011\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\"): Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"_rdecode = dict(zip('MDCLXVI', (1000, 500, 100, 50, 10, 5, 1)))\n\ndef decode( roman ):\n result = 0\n for r, r1 in zip(roman, roman[1:]):\n rd, rd1 = _rdecode[r], _rdecode[r1]\n result += -rd if rd < rd1 else rd\n return result + _rdecode[roman[-1]]\n\nif __name__ == '__main__':\n for r in 'MCMXC MMVIII MDCLXVI'.split():\n print( r, decode(r) )\n","language":"Python"},{"code":"roman_values = (('I',1), ('IV',4), ('V',5), ('IX',9),('X',10),('XL',40),('L',50),('XC',90),('C',100),\n ('CD', 400), ('D', 500), ('CM', 900), ('M',1000))\n\ndef roman_value(roman):\n total=0\n for symbol,value in reversed(roman_values):\n while roman.startswith(symbol):\n total += value\n roman = roman[len(symbol):]\n return total\n\nif __name__=='__main__':\n for value in \"MCMXC\", \"MMVIII\", \"MDCLXVI\":\n print('%s = %i' % (value, roman_value(value)))\n","language":"Python"},{"code":"numerals = { 'M' : 1000, 'D' : 500, 'C' : 100, 'L' : 50, 'X' : 10, 'V' : 5, 'I' : 1 }\ndef romannumeral2number(s):\n return reduce(lambda x, y: -x + y if x < y else x + y, map(lambda x: numerals.get(x, 0), s.upper()))\n","language":"Python"},{"code":"'''Roman numerals decoded'''\n\nfrom operator import mul\nfrom functools import reduce\nfrom collections import defaultdict\nfrom itertools import accumulate, chain, cycle\n\n\n# intFromRoman :: String -> Maybe Int\ndef intFromRoman(s):\n '''Just the integer represented by a Roman\n numeral string, or Nothing if any\n characters are unrecognised.\n '''\n dct = defaultdict(\n lambda: None,\n zip(\n 'IVXLCDM',\n accumulate(chain([1], cycle([5, 2])), mul)\n )\n )\n\n def go(mb, x):\n '''Just a letter value added to or\n subtracted from a total, or Nothing\n if no letter value is defined.\n '''\n if None in (mb, x):\n return None\n else:\n r, total = mb\n return x, total + (-x if x < r else x)\n\n return bindMay(reduce(\n go,\n [dct[k.upper()] for k in reversed(list(s))],\n (0, 0)\n ))(snd)\n\n\n# ------------------------- TEST -------------------------\ndef main():\n '''Testing a sample of dates.'''\n\n print(\n fTable(__doc__ + ':\\n')(str)(\n maybe('(Contains unknown character)')(str)\n )(\n intFromRoman\n )([\n \"MDCLXVI\", \"MCMXC\", \"MMVIII\",\n \"MMXVI\", \"MMXVIII\", \"MMZZIII\"\n ])\n )\n\n\n# ----------------------- GENERIC ------------------------\n\n# bindMay (>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b\ndef bindMay(m):\n '''Injection operator for the Maybe monad.\n If m is Nothing, it is passed straight through.\n If m is Just(x), the result is an application\n of the (a -> Maybe b) function (mf) to x.'''\n return lambda mf: (\n m if None is m else mf(m)\n )\n\n\n# maybe :: b -> (a -> b) -> Maybe a -> b\ndef maybe(v):\n '''Either the default value v, if m is Nothing,\n or the application of f to x,\n where m is Just(x).\n '''\n return lambda f: lambda m: v if None is m else (\n f(m)\n )\n\n\n# snd :: (a, b) -> b\ndef snd(ab):\n '''Second member of a pair.'''\n return ab[1]\n\n\n# ---------------------- FORMATTING ----------------------\n\n# fTable :: String -> (a -> String) ->\n# (b -> String) -> (a -> b) -> [a] -> String\ndef fTable(s):\n '''Heading -> x display function ->\n fx display function -> f -> xs -> tabular string.\n '''\n def go(xShow, fxShow, f, xs):\n ys = [xShow(x) for x in xs]\n w = max(map(len, ys))\n return s + '\\n' + '\\n'.join(map(\n lambda x, y: (\n f'{y.rjust(w, \" \")} -> {fxShow(f(x))}'\n ),\n xs, ys\n ))\n return lambda xShow: lambda fxShow: lambda f: (\n lambda xs: go(xShow, fxShow, f, xs)\n )\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"SCREEN _NEWIMAGE(400, 600, 32)\n\n\nCLS\n\n\nMain:\n'------------------------------------------------\n' CALLS THE romToDec FUNCTION WITH THE ROMAN\n' NUMERALS AND RETURNS ITS DECIMAL EQUIVELENT.\n'\n PRINT \"ROMAN NUMERAL TO DECIMAL CONVERSION\"\n PRINT: PRINT\n\n PRINT \"MDCCIV = \"; romToDec(\"MDCCIV\") '1704\n PRINT \"MCMXC = \"; romToDec(\"MCMXC\") '1990\n PRINT \"MMVIII = \"; romToDec(\"MMVIII\") '2008\n PRINT \"MDCLXVI = \"; romToDec(\"MDCLXVI\") '1666\n PRINT: PRINT\n PRINT \"Here are other solutions not from the TASK:\"\n PRINT \"MCMXCIX = \"; romToDec(\"MCMXCIX\") '1999\n PRINT \"XXV = \"; romToDec(\"XXV\") '25\n PRINT \"CMLIV = \"; romToDec(\"CMLIV\") '954\n PRINT \"MMXI = \"; romToDec(\"MMXI\") '2011\n PRINT \"MMIIIX = \"; romToDec(\"MMIIIX\") '2011\n PRINT: PRINT\n PRINT \"2011 can be written either as MMXI or MMIIIX\"\n PRINT \"With the IX = 9, MMIIIX is also 2011.\"\n PRINT \"2011 IS CORRECT (MM=2000 + II = 2 + IX = 9)\"\n\n END\n\n\n\nFUNCTION romToDec (roman AS STRING)\n'------------------------------------------------------\n' FUNCTION THAT CONVERTS ANY ROMAN NUMERAL TO A DECIMAL\n'\n prenum = 0: num = 0\n LN = LEN(roman)\n FOR i = LN TO 1 STEP -1\n x$ = MID$(roman, i, 1)\n n = 1000\n SELECT CASE x$\n CASE \"M\": n = n / 1\n CASE \"D\": n = n / 2\n CASE \"C\": n = n / 10\n CASE \"L\": n = n / 20\n CASE \"X\": n = n / 100\n CASE \"V\": n = n / 200\n CASE \"I\": n = n / n\n CASE ELSE: n = 0\n END SELECT\n IF n < prenum THEN num = num - n ELSE num = num + n\n prenum = n\n NEXT i\n\n romToDec = num\n\nEND FUNCTION\n","language":"QB64"},{"code":"FUNCTION romToDec (roman$)\n num = 0\n prenum = 0\n FOR i = LEN(roman$) TO 1 STEP -1\n x$ = MID$(roman$, i, 1)\n n = 0\n IF x$ = \"M\" THEN n = 1000\n IF x$ = \"D\" THEN n = 500\n IF x$ = \"C\" THEN n = 100\n IF x$ = \"L\" THEN n = 50\n IF x$ = \"X\" THEN n = 10\n IF x$ = \"V\" THEN n = 5\n IF x$ = \"I\" THEN n = 1\n\n IF n < preNum THEN num = num - n ELSE num = num + n\n preNum = n\n NEXT i\n\n romToDec = num\nEND FUNCTION\n\n!Testing\nPRINT \"MCMXCIX = \"; romToDec(\"MCMXCIX\") '1999\nPRINT \"MDCLXVI = \"; romToDec(\"MDCLXVI\") '1666\nPRINT \"XXV = \"; romToDec(\"XXV\") '25\nPRINT \"CMLIV = \"; romToDec(\"CMLIV\") '954\nPRINT \"MMXI = \"; romToDec(\"MMXI\") '2011\n","language":"QBasic"},{"code":" [ 2dup <\n if\n [ dip\n [ 2 * - ]\n dup ]\n nip dup\n rot + swap ] is roman ( t p n --> t p )\n\n [ 1 roman ] is I ( t p --> t p )\n [ 5 roman ] is V ( t p --> t p )\n [ 10 roman ] is X ( t p --> t p )\n [ 50 roman ] is L ( t p --> t p )\n [ 100 roman ] is C ( t p --> t p )\n [ 500 roman ] is D ( t p --> t p )\n [ 1000 roman ] is M ( t p --> t p )\n\n [ 0 1000 rot\n $ \"\" swap\n witheach\n [ space join\n join ]\n quackery\n drop ] is ->arabic ( $ --> n )\n\n $ \" MCMXC\" dup echo$ say \" = \" ->arabic echo cr\n $ \" MMVIII\" dup echo$ say \" = \" ->arabic echo cr\n $ \"MDCLXVI\" dup echo$ say \" = \" ->arabic echo cr\n cr\n $ \"I MIX VIVID MILD MIMIC\"\n dup echo$ say \" = \" ->arabic echo cr\n","language":"Quackery"},{"code":"romanToArabic <- function(roman) {\n romanLookup <- c(I=1L, V=5L, X=10L, L=50L, C=100L, D=500L, M=1000L)\n rSplit <- strsplit(toupper(roman), character(0)) # Split input vector into characters\n toArabic <- function(item) {\n digits <- romanLookup[item]\n if (length(digits) > 1L) {\n smaller <- (digits[-length(digits)] < digits[-1L])\n digits[smaller] <- - digits[smaller]\n }\n sum(digits)\n }\n vapply(rSplit, toArabic, integer(1))\n}\n","language":"R"},{"code":"romanToArabic(c(\"MCMXII\", \"LXXXVI\"))\n","language":"R"},{"code":"as.integer(as.roman(c(\"MCMXII\", \"LXXXVI\"))\n","language":"R"},{"code":"#lang racket\n(define (decode/roman number)\n (define letter-values\n (map cons '(#\\M #\\D #\\C #\\L #\\X #\\V #\\I) '(1000 500 100 50 10 5 1)))\n (define (get-value letter)\n (cdr (assq letter letter-values)))\n (define lst (map get-value (string->list number)))\n (+ (last lst)\n (for/fold ((sum 0))\n ((i (in-list lst)) (i+1 (in-list (cdr lst))))\n (+ sum\n (if (> i+1 i)\n (- i)\n i)))))\n\n(map decode/roman '(\"MCMXC\" \"MMVIII\" \"MDCLXVI\"))\n;-> '(1990 2008 1666)\n","language":"Racket"},{"code":"sub rom-to-num($r) {\n [+] gather $r.uc ~~ /\n ^\n [\n | M { take 1000 }\n | CM { take 900 }\n | D { take 500 }\n | CD { take 400 }\n | C { take 100 }\n | XC { take 90 }\n | L { take 50 }\n | XL { take 40 }\n | X { take 10 }\n | IX { take 9 }\n | V { take 5 }\n | IV { take 4 }\n | I { take 1 }\n ]+\n $\n /;\n}\n\nsay \"$_ => &rom-to-num($_)\" for <MCMXC MDCLXVI MMVIII>;\n","language":"Raku"},{"code":"sub rom-to-num($r) {\n [+] gather $r.uc ~~ /\n ^\n ( (C*)M { take 1000 - 100 * $0.chars } )*\n ( (C*)D { take 500 - 100 * $0.chars } )?\n ( (X*)C { take 100 - 10 * $0.chars } )*\n ( (X*)L { take 50 - 10 * $0.chars } )?\n ( (I*)X { take 10 - $0.chars } )*\n ( (I*)V { take 5 - $0.chars } )?\n ( I { take 1 } )*\n [ $ || { return NaN } ]\n /;\n}\n\nsay \"$_ => \", rom-to-num($_) for <MCMXC mdclxvi MMViii IIXX ILL>;\n","language":"Raku"},{"code":"Red [\n Purpose: \"Arabic <-> Roman numbers converter\"\n Author: \"Didier Cadieu\"\n Date: \"07-Oct-2016\"\n]\n\ntable-r2a: reverse [1000 \"M\" 900 \"CM\" 500 \"D\" 400 \"CD\" 100 \"C\" 90 \"XC\" 50 \"L\" 40 \"XL\" 10 \"X\" 9 \"IX\" 5 \"V\" 4 \"IV\" 1 \"I\"]\n\nroman-to-arabic: func [r [string!] /local a b e] [\n\ta: 0\n\tparse r [any [b: [\"I\" [\"V\" | \"X\" | none] | \"X\" [\"L\" | \"C\" | none] | \"C\" [\"D\" | \"M\" | none] | \"V\" | \"L\" | \"D\" | \"M\"] e: (a: a + select table-r2a copy/part b e)]]\n\ta\n]\n\n; Example usage:\nprint roman-to-arabic \"XXXIII\"\nprint roman-to-arabic \"MDCCCLXXXVIII\"\nprint roman-to-arabic \"MMXVI\"\n","language":"Red"},{"code":"$ENTRY Go {\n = <Prout <RomanDecode 'MCMXC'>>\n <Prout <RomanDecode 'MMVIII'>>\n <Prout <RomanDecode 'MDCLXVI'>>;\n};\n\nRomanDecode {\n = 0;\n e.D, <Upper e.D>: {\n 'M' e.R = <+ 1000 <RomanDecode e.R>>;\n 'CM' e.R = <+ 900 <RomanDecode e.R>>;\n 'D' e.R = <+ 500 <RomanDecode e.R>>;\n 'CD' e.R = <+ 400 <RomanDecode e.R>>;\n 'C' e.R = <+ 100 <RomanDecode e.R>>;\n 'XC' e.R = <+ 90 <RomanDecode e.R>>;\n 'L' e.R = <+ 50 <RomanDecode e.R>>;\n 'XL' e.R = <+ 40 <RomanDecode e.R>>;\n 'X' e.R = <+ 10 <RomanDecode e.R>>;\n 'IX' e.R = <+ 9 <RomanDecode e.R>>;\n 'V' e.R = <+ 5 <RomanDecode e.R>>;\n 'IV' e.R = <+ 4 <RomanDecode e.R>>;\n 'I' e.R = <+ 1 <RomanDecode e.R>>;\n };\n};\n","language":"Refal"},{"code":"/* Rexx */\n\nDo\n /* 1990 2008 1666 */\n years = 'MCMXC MMVIII MDCLXVI'\n\n Do y_ = 1 to words(years)\n Say right(word(years, y_), 10) || ':' decode(word(years, y_))\n End y_\n\n Return\nEnd\nExit\n\ndecode:\n Procedure\nDo\n Parse upper arg roman .\n\n If verify(roman, 'MDCLXVI') = 0 then Do\n\n /* always insert the value of the least significant numeral */\n decnum = rchar(substr(roman, length(roman), 1))\n Do d_ = 1 to length(roman) - 1\n If rchar(substr(roman, d_, 1)) < rchar(substr(roman, d_ + 1, 1)) then Do\n /* Handle cases where numerals are not in descending order */\n /* subtract the value of the numeral */\n decnum = decnum - rchar(substr(roman, d_, 1))\n End\n else Do\n /* Normal case */\n /* add the value of the numeral */\n decnum = decnum + rchar(substr(roman, d_, 1))\n End\n End d_\n End\n else Do\n decnum = roman 'contains invalid roman numerals'\n End\n\n Return decnum\nEnd\nExit\n\nrchar:\n Procedure\nDo\n Parse upper arg ch +1 .\n\n select\n when ch = 'M' then digit = 1000\n when ch = 'D' then digit = 500\n when ch = 'C' then digit = 100\n when ch = 'L' then digit = 50\n when ch = 'X' then digit = 10\n when ch = 'V' then digit = 5\n when ch = 'I' then digit = 1\n otherwise digit = 0\n end\n\n Return digit\nEnd\nExit\n","language":"REXX"},{"code":"/*REXX program converts Roman numeral number(s) ───► Arabic numerals (or numbers). */\nrYear = 'MCMXC' ; say right(rYear, 9)\":\" rom2dec(rYear)\nrYear = 'mmviii' ; say right(rYear, 9)\":\" rom2dec(rYear)\nrYear = 'MDCLXVI' ; say right(rYear, 9)\":\" rom2dec(rYear)\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nrom2dec: procedure; arg roman . /*obtain the Roman numeral number. */\nif verify(roman, 'MDCLXVI')\\==0 then return \"***error*** invalid Roman number:\" roman\n#=rChar(right(roman, 1)) /*start with the last Roman numeral. */\n do j=1 for length(roman) - 1\n x=rChar( substr(roman, j , 1) ) /*extract the current Roman numeral. */\n y=rChar( substr(roman, j+1, 1) ) /*extract the next Roman numeral. */\n if x<y then # = #-x /*Is x<y ? Then subtract it. */\n else # = #+x /*Is x≥y ? \" add \" */\n end /*j*/\nreturn #\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nrChar: procedure; arg _ /*convert Roman number to Arabic digits*/\n if _=='I' then return 1\n if _=='V' then return 5\n if _=='X' then return 10\n if _=='L' then return 50\n if _=='C' then return 100\n if _=='D' then return 500\n if _=='M' then return 1000\n return 0 /*indicate an invalid Roman numeral. */\n","language":"REXX"},{"code":"/*REXX program converts Roman numeral number(s) ───► Arabic numerals (or numbers). */\nnumeric digits 1000 /*so we can handle the big numbers. */\nparse arg z /*obtain optional arguments from the CL*/\nif z='' then z= \"MCMXC mmviii IIXX LU MDCLXVI MDWLXVI ((mmm)) [[[[[D]]]]]\" /*defaults.*/\n\n do j=1 for words(z); y=word(z, j) /*process each of the Roman numbers. */\n say right(y, 20)':' rom2dec(y) /*display original and decimal version.*/\n end /*j*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nrom2dec: procedure; h='0'x; #=0; $=1; arg n . /*\"ARG\" uppercases N. */\nn=translate(n, '()()', \"[]{}\"); _=verify(n, 'MDCLXVUIJ()') /*trans grouping symbols.*/\nif _\\==0 then return '***error*** invalid Roman numeral:' substr(n,_,1) /*tell error*/\n@.=1; @.m=1000; @.d=500; @.c=100; @.l=50; @.x=10; @.u=5; @.v=5 /*Roman numeral values. */\n /* [↓] convert number. */\n do k=length(n) to 1 by -1; _=substr(n, k, 1) /*examine a Roman numeral*/\n /* [↑] scale up or down.*/\n if _=='(' | _==\")\" then do; $=$*1000; if _=='(' then $=1 /* (≡scale ↑; )≡scale ↓ */\n iterate /*go & process next digit*/\n end\n _=@._*$ /*scale it if necessary. */\n if _>h then h=_ /*remember Roman numeral.*/\n if _<h then #=#-_ /*char>next? Then sub. */\n else #=#+_ /* else add. */\n end /*k*/\nreturn # /*return Arabic number. */\n","language":"REXX"},{"code":"symbols = \"MDCLXVI\"\nweights = [1000,500,100,50,10,5,1]\n\nsee \"MCMXCIX = \" + romanDec(\"MCMXCIX\") + nl\nsee \"MDCLXVI =\" + romanDec(\"MDCLXVI\") + nl\nsee \"XXV = \" + romanDec(\"XXV\") + nl\nsee \"CMLIV = \" + romanDec(\"CMLIV\") + nl\nsee \"MMXI = \" + romanDec(\"MMXI\") + nl\n\nfunc romanDec roman\n n = 0\n lastval = 0\n arabic = 0\n for i = len(roman) to 1 step -1\n n = substr(symbols,roman[i])\n if n > 0 n = weights[n] ok\n if n < lastval arabic = arabic - n\n else arabic = arabic + n ok\n lastval = n\n next\n return arabic\n","language":"Ring"},{"code":"def fromRoman(roman)\n r = roman.upcase\n n = 0\n until r.empty? do\n case\n when r.start_with?('M') then v = 1000; len = 1\n when r.start_with?('CM') then v = 900; len = 2\n when r.start_with?('D') then v = 500; len = 1\n when r.start_with?('CD') then v = 400; len = 2\n when r.start_with?('C') then v = 100; len = 1\n when r.start_with?('XC') then v = 90; len = 2\n when r.start_with?('L') then v = 50; len = 1\n when r.start_with?('XL') then v = 40; len = 2\n when r.start_with?('X') then v = 10; len = 1\n when r.start_with?('IX') then v = 9; len = 2\n when r.start_with?('V') then v = 5; len = 1\n when r.start_with?('IV') then v = 4; len = 2\n when r.start_with?('I') then v = 1; len = 1\n else\n raise ArgumentError.new(\"invalid roman numerals: \" + roman)\n end\n n += v\n r.slice!(0,len)\n end\n n\nend\n\n[ \"MCMXC\", \"MMVIII\", \"MDCLXVI\" ].each {|r| p r => fromRoman(r)}\n","language":"Ruby"},{"code":"SYMBOLS = [ ['M', 1000], ['CM', 900], ['D', 500], ['CD', 400], ['C', 100], ['XC', 90],\n ['L', 50], ['XL', 40], ['X', 10], ['IX', 9], ['V', 5], ['IV', 4], ['I', 1] ]\n\ndef parseRoman(roman)\n r = roman.upcase\n n = 0\n SYMBOLS.each { |sym, val| n += val while r.sub!(/^#{sym}/, \"\") }\n n\nend\n\n[ \"MCMXC\", \"MMVIII\", \"MDCLXVI\" ].each {|r| puts \"%8s :%5d\" % [r, parseRoman(r)]}\n","language":"Ruby"},{"code":"print \"MCMXCIX = \"; romToDec( \"MCMXCIX\") '1999\nprint \"MDCLXVI = \"; romToDec( \"MDCLXVI\") '1666\nprint \"XXV = \"; romToDec( \"XXV\") '25\nprint \"CMLIV = \"; romToDec( \"CMLIV\") '954\nprint \"MMXI = \"; romToDec( \"MMXI\") '2011\n\nfunction romToDec(roman$)\n for i = len(roman$) to 1 step -1\n x$ = mid$(roman$, i, 1)\n n = 0\n if x$ = \"M\" then n = 1000\n if x$ = \"D\" then n = 500\n if x$ = \"C\" then n = 100\n if x$ = \"L\" then n = 50\n if x$ = \"X\" then n = 10\n if x$ = \"V\" then n = 5\n if x$ = \"I\" then n = 1\n\n if n < preNum then num = num - n else num = num + n\n preNum = n\n next\n\n romToDec =num\nend function\n","language":"Run-BASIC"},{"code":"struct RomanNumeral {\n symbol: &'static str,\n value: u32\n}\n\nconst NUMERALS: [RomanNumeral; 13] = [\n RomanNumeral {symbol: \"M\", value: 1000},\n RomanNumeral {symbol: \"CM\", value: 900},\n RomanNumeral {symbol: \"D\", value: 500},\n RomanNumeral {symbol: \"CD\", value: 400},\n RomanNumeral {symbol: \"C\", value: 100},\n RomanNumeral {symbol: \"XC\", value: 90},\n RomanNumeral {symbol: \"L\", value: 50},\n RomanNumeral {symbol: \"XL\", value: 40},\n RomanNumeral {symbol: \"X\", value: 10},\n RomanNumeral {symbol: \"IX\", value: 9},\n RomanNumeral {symbol: \"V\", value: 5},\n RomanNumeral {symbol: \"IV\", value: 4},\n RomanNumeral {symbol: \"I\", value: 1}\n];\n\nfn to_hindu(roman: &str) -> u32 {\n match NUMERALS.iter().find(|num| roman.starts_with(num.symbol)) {\n Some(num) => num.value + to_hindu(&roman[num.symbol.len()..]),\n None => 0, // if string empty, add nothing\n }\n}\n\nfn main() {\n let roms = [\"MMXIV\", \"MCMXCIX\", \"XXV\", \"MDCLXVI\", \"MMMDCCCLXXXVIII\"];\n for &r in &roms {\n // 15 is minimum formatting width of the first argument, there for alignment\n println!(\"{:2$} = {}\", r, to_hindu(r), 15);\n }\n}\n","language":"Rust"},{"code":"def fromRoman( r:String ) : Int = {\n val arabicNumerals = List(\"CM\"->900,\"M\"->1000,\"CD\"->400,\"D\"->500,\"XC\"->90,\"C\"->100,\n \"XL\"->40,\"L\"->50,\"IX\"->9,\"X\"->10,\"IV\"->4,\"V\"->5,\"I\"->1)\t\n\n var s = r\n arabicNumerals.foldLeft(0){ (n,t) => {\n val l = s.length; s = s.replaceAll(t._1,\"\"); val c = (l - s.length)/t._1.length // Get the frequency\n n + (c*t._2) // Add the arabic numerals up\n } }\n}\n\n// Here is a another version that does a simple running sum:\ndef fromRoman2(s: String) : Int = {\n val numerals = Map('I' -> 1, 'V' -> 5, 'X' -> 10, 'L' -> 50, 'C' -> 100, 'D' -> 500, 'M' -> 1000)\n\n s.toUpperCase.map(numerals).foldLeft((0,0)) {\n case ((sum, last), curr) => (sum + curr + (if (last < curr) -2*last else 0), curr) }._1\n }\n}\n\n// A small test\ndef test( roman:String ) = println( roman + \" => \" + fromRoman( roman ) )\n\ntest(\"MCMXC\")\ntest(\"MMVIII\")\ntest(\"MDCLXVI\")\n","language":"Scala"},{"code":"(use gauche.collection) ;; for fold2\n\n(define (char-val char)\n (define i (string-scan \"IVXLCDM\" char))\n (* (expt 10 (div i 2)) (expt 5 (mod i 2))))\n\n(define (decode roman)\n (fold2\n (lambda (n sum prev-val)\n (values ((if (< n prev-val) - +) sum n) (max n prev-val)))\n 0 0\n (map char-val (reverse (string->list roman)))))\n","language":"Scheme"},{"code":"(for-each\n (^s (format #t \"~7d: ~d\\n\" s (decode s)))\n '(\"MCMLVI\" \"XXC\" \"MCMXC\" \"XXCIII\" \"IIIIX\" \"MIM\" \"LXXIIX\"))\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n\nconst func integer: ROMAN parse (in string: roman) is func\n result\n var integer: arabic is 0;\n local\n var integer: index is 0;\n var integer: number is 0;\n var integer: lastval is 0;\n begin\n for index range length(roman) downto 1 do\n case roman[index] of\n when {'M', 'm'}: number := 1000;\n when {'D', 'd'}: number := 500;\n when {'C', 'c'}: number := 100;\n when {'L', 'l'}: number := 50;\n when {'X', 'x'}: number := 10;\n when {'V', 'v'}: number := 5;\n when {'I', 'i'}: number := 1;\n otherwise: raise RANGE_ERROR;\n end case;\n if number < lastval then\n arabic -:= number;\n else\n arabic +:= number;\n end if;\n lastval := number;\n end for;\n end func;\n\nconst proc: main is func\n begin\n writeln(ROMAN parse \"MCMXC\");\n writeln(ROMAN parse \"MMVIII\");\n writeln(ROMAN parse \"MDCLXVI\");\n end func;\n","language":"Seed7"},{"code":"function RomanNumeralsDecode numerals\n\tput {\n\t\t\"M\": 1000,\n\t\t\"D\": 500,\n\t\t\"C\": 100,\n\t\t\"L\": 50,\n\t\t\"X\": 10,\n\t\t\"V\": 5,\n\t\t\"I\": 1\n\t} into values\n\t\n\tput 0 into total\n\trepeat with each character letter of numerals\n\t\tif values.(character the counter + 1 of numerals) is less than or equal to values.(letter)\n\t\t\tadd values.(letter) to total\n\t\telse\n\t\t\tsubtract values.(letter) from total\n\t\tend if\n\tend repeat\n\treturn total\nend RomanNumeralsDecode\n","language":"SenseTalk"},{"code":"repeat for each item in [\n\t\"MCMXC\",\n\t\"MMVIII\",\n\t\"MDCLXVI\",\n]\n\tput RomanNumeralsDecode(it)\nend repeat\n","language":"SenseTalk"},{"code":"func roman2arabic(roman) {\n \n var arabic = 0\n var last_digit = 1000\n \n static m = Hash(\n I => 1,\n V => 5,\n X => 10,\n L => 50,\n C => 100,\n D => 500,\n M => 1000,\n )\n \n roman.uc.chars.map{m{_} \\\\ 0}.each { |digit|\n if (last_digit < digit) {\n arabic -= (2 * last_digit)\n }\n arabic += (last_digit = digit)\n }\n \n return arabic\n}\n \n%w(MCMXC MMVIII MDCLXVI).each { |roman_digit|\n \"%-10s == %d\\n\".printf(roman_digit, roman2arabic(roman_digit))\n}\n","language":"Sidef"},{"code":"func roman2arabic(digit) {\n digit.uc.trans([\n :M: '1000+',\n :CM: '900+',\n :D: '500+',\n :CD: '400+',\n :C: '100+',\n :XC: '90+',\n :L: '50+',\n :XL: '40+',\n :X: '10+',\n :IX: '9+',\n :V: '5+',\n :IV: '4+',\n :I: '1+',\n ]).split('+').map{.to_i}.sum;\n}\n \n%w(MCMXC MMVIII MDCLXVI).each { |roman_num|\n say \"#{roman_num}\\t-> #{roman2arabic(roman_num)}\";\n}\n","language":"Sidef"},{"code":"BEGIN\n\n INTEGER PROCEDURE FROMROMAN(S); TEXT S;\n BEGIN\n PROCEDURE P(INTVAL, NUM); INTEGER INTVAL; TEXT NUM;\n BEGIN\n INTEGER NLEN;\n NLEN := NUM.LENGTH;\n WHILE INDEX + NLEN - 1 <= SLEN AND THEN\n S.SUB(INDEX, NLEN) = NUM DO\n BEGIN\n RESULT := RESULT + INTVAL;\n INDEX := INDEX + NLEN;\n END WHILE;\n END P;\n INTEGER RESULT, INDEX, SLEN;\n SLEN := S.LENGTH;\n INDEX := 1;\n P( 1000, \"M\" );\n P( 900, \"CM\" );\n P( 500, \"D\" );\n P( 400, \"CD\" );\n P( 100, \"C\" );\n P( 90, \"XC\" );\n P( 50, \"L\" );\n P( 40, \"XL\" );\n P( 10, \"X\" );\n P( 9, \"IX\" );\n P( 5, \"V\" );\n P( 4, \"IV\" );\n P( 1, \"I\" );\n FROMROMAN := RESULT;\n END FROMROMAN;\n\n TEXT T;\n FOR T :- \"MCMXC\", \"MMVIII\", \"MDCLXVI\" DO\n BEGIN\n OUTTEXT(\"ROMAN \"\"\");\n OUTTEXT(T);\n OUTTEXT(\"\"\" => \");\n OUTINT(FROMROMAN(T), 0);\n OUTIMAGE;\n END FOR;\n\nEND PROGRAM;\n","language":"Simula"},{"code":"* Roman to Arabic\n define('arabic(n)s,ch,val,sum,x') :(arabic_end)\narabic s = 'M1000 D500 C100 L50 X10 V5 I1 '\n n = reverse(n)\narab1 n len(1) . ch = :f(arab2)\n s ch break(' ') . val\n val = lt(val,x) (-1 * val)\n sum = sum + val; x = val :(arab1)\narab2 arabic = sum :(return)\narabic_end\n\n* Test and display\n tstr = 'MMX MCMXCIX MCDXCII MLXVI CDLXXVI \"\ntloop tstr break(' ') . r span(' ') = :f(out)\n astr = astr r '=' arabic(r) ' ' :(tloop)\nout output = astr\nend\n","language":"SNOBOL4"},{"code":"* Roman to Arabic\n\tdefine(\"arabic1(romans,arabic1)rdigit,adigit,b4\")\n\tromans1 = \" 0 IX9 IV4 III3 II2 I1 VIII8 VII7 VI6 V5\" :(arabic1_end)\narabic1 ident(romans) :s(return)\n\tromans (break(\"IV\") | rem) . b4 rem . rdigit = b4\n romans1 \" \" rdigit any(\"0123456789\") . adigit\n\tarabic1 = adigit arabic1\n romans = replace(romans,\"MDCLX\",\"CLXVI\") :(arabic1)\narabic1_end\n* Test and display\n tstr = \"MMX MCMXCIX MCDXCII MLXVI CDLXXVI \"\ntloop tstr break(' ') . r span(' ') = :f(out)\n astr = astr r '=' arabic1(r) ' ' :(tloop)\nout output = astr\nend\n","language":"SNOBOL4"},{"code":"* Roman to Arabic\n\tdefine(\"arabic1(romans,arabic1)rdigit,adigit,b4\")\n\tromans1 = \" 0 IX9 IV4 III3 II2 I1 VIII8 VII7 VI6 V5\" :(arabic1_end)\narabic1 ident(romans) :s(return)\n\tromans (break(\"IV\") | rem) . b4 rem . rdigit = replace(b4,\"MDCLX\",\"CLXVI\")\n romans1 \" \" rdigit any(\"0123456789\") . adigit\n\tarabic1 = adigit arabic1 :(arabic1)\narabic1_end\n* Test and display\n tstr = \" MMX MCMXCIX MCDXCII MLXVI CDLXXVI \"\n tstr span(' ') break(' ') $ r *?(astr = astr r '=' arabic1(r) ' ') fail\n output = astr\nend\n","language":"SNOBOL4"},{"code":"r2a(r)=\n n = [1,5,10,50,100,500,1000]\n a,m = 0\n > i, #.size(r)..1, -1\n v,c = n[#.pos(\"IVXLCDM\",#.mid(r,i))]\n ? v<m, v = -v\n ? c>m, m = c\n a += v\n <\n <= a\n.\n\nt = [\"MMXI\",\"MIM\",\"MCMLVI\",\"MDCLXVI\",\"XXCIII\",\"LXXIIX\",\"IIIIX\"]\n> i, 1..#.size(t,1)\n #.output(t[i],\" = \",r2a(t[i]))\n<\n","language":"SPL"},{"code":"extension Int {\n init(romanNumerals: String) {\n let values = [\n ( \"M\", 1000),\n (\"CM\", 900),\n ( \"D\", 500),\n (\"CD\", 400),\n ( \"C\", 100),\n (\"XC\", 90),\n ( \"L\", 50),\n (\"XL\", 40),\n ( \"X\", 10),\n (\"IX\", 9),\n ( \"V\", 5),\n (\"IV\", 4),\n ( \"I\", 1),\n ]\n\n self = 0\n var raw = romanNumerals\n for (digit, value) in values {\n while raw.hasPrefix(digit) {\n self += value\n raw.removeFirst(digit.count)\n }\n }\n }\n}\n","language":"Swift"},{"code":"Int(romanNumerals: \"MDCLXVI\") // 1666\n","language":"Swift"},{"code":"def digits: [(M:1000\"1\"), (CM:900\"1\"), (D:500\"1\"), (CD:400\"1\"), (C:100\"1\"), (XC:90\"1\"), (L:50\"1\"), (XL:40\"1\"), (X:10\"1\"), (IX:9\"1\"), (V:5\"1\"), (IV:4\"1\"), (I:1\"1\")];\ncomposer decodeRoman\n @: 1;\n [ <digit>* ] -> \\(@: 0\"1\"; $... -> @: $@ + $; $@ !\\)\n rule digit: <value>* (@: $@ + 1;)\n rule value: <='$digits($@)::key;'> -> $digits($@)::value\nend decodeRoman\n\n'MCMXC' -> decodeRoman -> !OUT::write\n'\n' -> !OUT::write\n'MMVIII' -> decodeRoman -> !OUT::write\n'\n' -> !OUT::write\n'MDCLXVI' -> decodeRoman -> !OUT::write\n","language":"Tailspin"},{"code":"proc fromRoman rnum {\n set map {M 1000+ CM 900+ D 500+ CD 400+ C 100+ XC 90+ L 50+ XL 40+ X 10+ IX 9+ V 5+ IV 4+ I 1+}\n expr [string map $map $rnum]0}\n}\n","language":"Tcl"},{"code":"foreach r {MCMXC MDCLXVI MMVIII} {\n puts \"$r\\t-> [fromRoman $r]\"\n}\n","language":"Tcl"},{"code":"Main:\n!------------------------------------------------\n! CALLS THE romToDec FUNCTION WITH THE ROMAN\n! NUMERALS AND RETURNS ITS DECIMAL EQUIVELENT.\n!\n\n PRINT \"MCMXC = \"; romToDec(\"MCMXC\") !1990\n PRINT \"MMVIII = \"; romToDec(\"MMVIII\") !2008\n PRINT \"MDCLXVI = \"; romToDec(\"MDCLXVI\") !1666\n PRINT:PRINT\n PRINT \"Here are other solutions not from the TASK:\"\n PRINT \"MCMXCIX = \"; romToDec(\"MCMXCIX\") !1999\n PRINT \"XXV = \"; romToDec(\"XXV\") !25\n PRINT \"CMLIV = \"; romToDec(\"CMLIV\") !954\n PRINT \"MMXI = \"; romToDec(\"MMXI\") !2011\n PRINT:PRINT\n PRINT \"Without error checking, this also is 2011, but is wrong\"\n PRINT \"MMIIIX = \"; romToDec(\"MMIIIX\") !INVAID, 2011\n\nSTOP\n\n\nFUNCTION romToDec(roman AS STRING) AS INTEGER\n!------------------------------------------------------\n! FUNCTION THAT CONVERTS ANY ROMAN NUMERAL TO A DECIMAL\n!\n prenum=0!num=0\n ln=LEN(roman)\n FOR i=ln TO 1 STEP -1\n x$=MID(roman,i,1)\n n=1000\n SELECT CASE x$\n CASE \"M\":n=n/1\n CASE \"D\":n=n/2\n CASE \"C\":n=n/10\n CASE \"L\":n=n/20\n CASE \"X\":n=n/100\n CASE \"V\":n=n/200\n CASE \"I\":n=n/n\n CASE ELSE:n=0\n END SELECT\n IF n < preNum THEN num=num-n ELSE num=num+n\n preNum=n\n next i\n\n romToDec=num\n\nEND FUNCTION\n","language":"TechBASIC"},{"code":"PROGRAM:ROM2DEC\n:Input Str1\n:Disp real(21,Str1)\n","language":"TI-83-BASIC"},{"code":"PROGRAM:ROM2DEC\n:Input \"ROMAN:\",Str1\n:{1000,500,100,50,10,5,1}➞L1\n:0➞P\n:0➞Y\n:For(I,length(Str1),1,-1)\n :inString(\"MDCLXVI\",sub(Str1,I,1))➞X\n :If X≤0:Then\n :Disp \"BAD NUMBER\"\n :Stop\n :End\n :L1(x)➞N\n :If N<P:Then\n :Y–N➞Y\n :Else\n :Y+N➞Y\n :End\n :N➞P\n:End\n:Disp Y\n","language":"TI-83-BASIC"},{"code":"loop: parse(roman)\\loop;\nroman: string(!<<MDCLXVI>>) [n=0] num\nletter: num/render letter;\nnum: <M> [n=+1750]\n | <D> [n=+764]\n | <C> ( <M> [n=+1604]\n | <D> [n=+620]\n | [n=+144] )\n | <L> [n=+62]\n | <X> ( <C> [n=+132]\n | <L> [n=+50]\n | [n=+12] )\n | <V> [n=+5]\n | <I> ( <X> [n=+11]\n | <V> [n=+4]\n | [n++] );\nrender: decimal(n) = { 1 * };\n\nn: 0;\n","language":"TMG"},{"code":"loop: [wsz = &a - &n]\n parse(line)\\loop\n parse(error)\\loop;\nline: roman *;\nroman: [n=0] [off=0]\n comb((<^>),(<&>),(<M>))\n comb((<M>),(<D>),(<C>))\n comb((<C>),(<L>),(<X>))\n comb((<X>),(<V>),(<I>))\n [n>0?] decimal(n) = { 1 * };\ncomb: proc(c1,c2,c3)\n [v1 = *(wsz*off++ + &a)]\n [v2 = *(wsz*off++ + &a)]\n [v3 = *(wsz*off + &a)]\n ( c3 ( c3 ( c3 [n=+(3*v3)]\n | [n=+(2*v3)] )\n | c1 [v1>0?] [n=+v1-v3]\n | c2 [v2>0?] [n=+v2-v3]\n | [n=+v3] )\n | c2 [v2>0?] [n=+v2]\n ( c3 ( c3 ( c3 [n=+(3*v3)]\n | [n=+(2*v3)] )\n | [n=+v3] )\n | () )\n | () );\nerror: smark ignore(<<>>) string(notnewline) scopy *\n = { <error: > 1 * };\n\nnotnewline: !<<\n>>;\n\nn: 0;\na: 0; 0; 1750; 764; 144; 62; 12; 5; 1;\noff:0;\nwsz:0;\nv1: 0; v2: 0; v3: 0;\n","language":"TMG"},{"code":"FUNCTION romtodec(roman$)\n LET num = 0\n LET prenum = 0\n FOR i = len(roman$) to 1 step -1\n LET x$ = (roman$)[i:i+1-1]\n LET n = 0\n IF x$ = \"M\" then LET n = 1000\n IF x$ = \"D\" then LET n = 500\n IF x$ = \"C\" then LET n = 100\n IF x$ = \"L\" then LET n = 50\n IF x$ = \"X\" then LET n = 10\n IF x$ = \"V\" then LET n = 5\n IF x$ = \"I\" then LET n = 1\n IF n < prenum then LET num = num-n else LET num = num+n\n LET prenum = n\n NEXT i\n\n LET romtodec = num\nEND FUNCTION\n\n!Testing\nPRINT \"MCMXCIX = \"; romToDec(\"MCMXCIX\") !1999\nPRINT \"MDCLXVI = \"; romToDec(\"MDCLXVI\") !1666\nPRINT \"XXV = \"; romToDec(\"XXV\") !25\nPRINT \"CMLIV = \"; romToDec(\"CMLIV\") !954\nPRINT \"MMXI = \"; romToDec(\"MMXI\") !2011\nEND\n","language":"True-BASIC"},{"code":"$$ MODE TUSCRIPT\nLOOP roman_number=\"MCMXC'MMVIII'MDCLXVI\"\narab_number=DECODE (roman_number,ROMAN)\nPRINT \"Roman number \",roman_number,\" equals \", arab_number\nENDLOOP\n","language":"TUSCRIPT"},{"code":"#!/bin/bash\n\nroman_to_dec() {\n local rnum=$1\n local n=0\n local prev=0\n\n for ((i=${#rnum}-1;i>=0;i--))\n do\n case \"${rnum:$i:1}\" in\n M) a=1000 ;;\n D) a=500 ;;\n C) a=100 ;;\n L) a=50 ;;\n X) a=10 ;;\n V) a=5 ;;\n I) a=1 ;;\n esac\n\n if [[ $a -lt $prev ]]\n then\n let n-=a\n else\n let n+=a\n fi\n\n prev=$a\n done\n\n echo \"$rnum = $n\"\n}\n\nroman_to_dec MCMXC\nroman_to_dec MMVIII\nroman_to_dec MDCLXVI\n","language":"UNIX-Shell"},{"code":"const romans = [\"I\", \"III\", \"IV\", \"VIII\", \"XLIX\", \"CCII\", \"CDXXXIII\", \"MCMXC\", \"MMVIII\", \"MDCLXVI\"]\n\nfn main() {\n for roman in romans {println(\"${roman:-10} = ${roman_decode(roman)}\")}\n}\n\nfn roman_decode(roman string) int {\n mut n := 0\n mut last := \"O\"\n\tif roman ==\"\" {return n}\n for c in roman {\n match c.ascii_str() {\n \"I\" {n++}\n \"V\" {if last == \"I\" {n += 3} else {n += 5}}\n \"X\" {if last == \"I\" {n += 8} else {n += 10}}\n \"L\" {if last == \"X\" {n += 30} else {n += 50}}\n \"C\" {if last == \"X\" {n += 80} else {n += 100}}\n \"D\" {if last == \"C\" {n += 300} else {n += 500}}\n \"M\" {if last == \"C\" {n += 800} else {n += 1000}}\n\t\t\telse {last = c.ascii_str()}\n }\n }\n return n\n}\n","language":"V-(Vlang)"},{"code":"Option Explicit\n\nSub Main_Romans_Decode()\nDim Arr(), i&\n\n Arr = Array(\"III\", \"XXX\", \"CCC\", \"MMM\", \"VII\", \"LXVI\", \"CL\", \"MCC\", \"IV\", \"IX\", \"XC\", \"ICM\", \"DCCCXCIX\", \"CMI\", \"CIM\", \"MDCLXVI\", \"MCMXC\", \"MMXVII\")\n For i = 0 To UBound(Arr)\n Debug.Print Arr(i) & \" >>> \" & lngConvert(CStr(Arr(i)))\n Next\nEnd Sub\n\nFunction Convert(Letter As String) As Long\nDim Romans(), DecInt(), Pos As Integer\n\n Romans = Array(\"M\", \"D\", \"C\", \"L\", \"X\", \"V\", \"I\")\n DecInt = Array(1000, 500, 100, 50, 10, 5, 1)\n Pos = -1\n On Error Resume Next\n Pos = Application.Match(Letter, Romans, 0) - 1\n On Error GoTo 0\n If Pos <> -1 Then Convert = DecInt(Pos)\nEnd Function\n\nFunction lngConvert(strRom As String) 'recursive function\nDim i As Long, iVal As Integer\n\n If Len(strRom) = 1 Then\n lngConvert = Convert(strRom)\n Else\n iVal = Convert(Mid(strRom, 1, 1))\n If iVal < Convert(Mid(strRom, 2, 1)) Then iVal = iVal * (-1)\n lngConvert = iVal + lngConvert(Mid(strRom, 2, Len(strRom) - 1))\n End If\nEnd Function\n","language":"VBA"},{"code":"' Roman numerals Encode - Visual Basic - 18/04/2019\n\nFunction toRoman(ByVal value)\n Dim arabic\n Dim roman\n Dim i, result\n arabic = Array(1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1)\n roman = Array(\"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\")\n For i = 0 To 12\n Do While value >= arabic(i)\n result = result + roman(i)\n value = value - arabic(i)\n Loop\n Next 'i\n toRoman = result\nEnd Function 'toRoman\n\n n=InputBox(\"Number, please\",\"Roman numerals/Encode\")\n code=MsgBox(n & vbCrlf & toRoman(n),vbOKOnly+vbExclamation,\"Roman numerals/Encode\")\n\tIf code=vbOK Then ok=1\n","language":"VBScript"},{"code":"// Main program for testing the function\n//\ndo {\n Get_Input(10, \"Enter a roman numeral: \", NOCR+STATLINE)\n Call(\"Roman_to_Arabic\")\n Reg_Type(10) Message(\"\t= \") Num_Type(#1)\n} while(#1)\nReturn\n\n// Convert Roman numeral into numeric value\n// in: @10 = Roman numeral\n// out: #1 = numeric value\n//\n:Roman_to_Arabic:\n Buf_Switch(Buf_Free)\n Ins_Text(\"M1000 D500 C100 L50 X10 V5 I1\") Ins_Newline\n Reg_Ins(10) Ins_Char(' ')\n #1 = #2 = 0\n\n Repeat(ALL) {\n #3 = #2 // #3 = previous character\n Goto_Line(2) // roman numeral to be converted\n if (At_EOL) {\n Break // all done\n }\n Reg_Copy_Block(11, CP, CP+1, DELETE) // next character in roman numeral\n if (Search(@11, BEGIN+ADVANCE+NOERR)) { // find character from the table\n #2 = Num_Eval(SUPPRESS) // corresponding numeric value\n if (#2 > #3) { // larger than previous digit?\n #1 -= #3 // substract previous digit\n } else {\n #1 += #3 // add previous digit\n }\n }\n }\n Reg_Empty(11)\n Buf_Quit(OK)\nReturn\n","language":"Vedit-macro-language"},{"code":"import \"./fmt\" for Fmt\n\nvar decode = Fn.new { |r|\n if (r == \"\") return 0\n var n = 0\n var last = \"0\"\n for (c in r) {\n var k\n if (c == \"I\") {\n k = 1\n } else if (c == \"V\") {\n k = (last == \"I\") ? 3 : 5\n } else if (c == \"X\") {\n k = (last == \"I\") ? 8 : 10\n } else if (c == \"L\") {\n k = (last == \"X\") ? 30 : 50\n } else if (c == \"C\") {\n k = (last == \"X\") ? 80 : 100\n } else if (c == \"D\") {\n k = (last == \"C\") ? 300 : 500\n } else if (c == \"M\") {\n k = (last == \"C\") ? 800 : 1000\n }\n n = n + k\n last = c\n }\n return n\n}\n\nvar romans = [\"I\", \"III\", \"IV\", \"VIII\", \"XLIX\", \"CCII\", \"CDXXXIII\", \"MCMXC\", \"MMVIII\", \"MDCLXVI\"]\nfor (r in romans) System.print(\"%(Fmt.s(-10, r)) = %(decode.call(r))\")\n","language":"Wren"},{"code":"PROGRAM \"romandec\"\nVERSION \"0.0000\"\n\nDECLARE FUNCTION Entry ()\nDECLARE FUNCTION romToDec (roman$)\n\nFUNCTION Entry ()\n PRINT \"MCMXCIX = \"; romToDec(\"MCMXCIX\")\n PRINT \"MDCLXVI = \"; romToDec(\"MDCLXVI\")\n PRINT \"XXV = \"; romToDec(\"XXV\")\n PRINT \"CMLIV = \"; romToDec(\"CMLIV\")\n PRINT \"MMXI = \"; romToDec(\"MMXI\")\nEND FUNCTION\n\nFUNCTION romToDec (roman$)\n num = 0\n prenum = 0\n FOR i = LEN(roman$) TO 1 STEP -1\n x$ = MID$(roman$, i, 1)\n\tSELECT CASE x$\n\t CASE \"M\" : n = 1000\n\t CASE \"D\" : n = 500\n\t CASE \"C\" : n = 100\n\t CASE \"L\" : n = 50\n\t CASE \"X\" : n = 10\n\t CASE \"V\" : n = 5\n\t CASE \"I\" : n = 1\n\tEND SELECT\n IF n < prenum THEN num = num-n ELSE num = num+n\n prenum = n\n NEXT i\n\n RETURN num\nEND FUNCTION\nEND PROGRAM\n","language":"XBasic"},{"code":"(defun decode (r)\n (define roman '((#\\m 1000) (#\\d 500) (#\\c 100) (#\\l 50) (#\\x 10) (#\\v 5) (#\\i 1)))\n (defun to-arabic (rn rs a)\n (cond\n ((null rn) a)\n ((eqv? (car rn) (caar rs)) (to-arabic (cdr rn) roman (if (and (not (eqv? (car rn) (cadr rn))) (< (cadar rs) (to-arabic (cdr rn) roman 0)))\n (- a (cadar rs))\n (+ a (cadar rs)) ) ) )\n (t (to-arabic rn (cdr rs) a)) ) )\n (to-arabic (string->list r) roman 0) )\n","language":"XLISP"},{"code":"[1] (mapcar decode '(\"mcmxc\" \"mmviii\" \"mdclxvi\"))\n\n(1990 2008 1666)\n","language":"XLISP"},{"code":"string 0; \\use zero-terminated strings\ncode CrLf=9, IntOut=11;\n\nfunc Roman(Str); \\Convert Roman numeral string to decimal value\nchar Str;\nint I, Val, Val0, Sum;\n[I:= 0; Sum:= 0; Val0:= 5000;\nloop [case Str(I) of\n ^M: Val:= 1000;\n ^D: Val:= 500;\n ^C: Val:= 100;\n ^L: Val:= 50;\n ^X: Val:= 10;\n ^V: Val:= 5;\n ^I: Val:= 1\n other return Sum; \\zero string terminator\n I:= I+1;\n Sum:= Sum + Val;\n if Val > Val0 then Sum:= Sum - 2*Val0;\n Val0:= Val;\n ];\n];\n\n[IntOut(0, Roman(\"MCMXC\")); CrLf(0);\n IntOut(0, Roman(\"MMVIII\")); CrLf(0);\n IntOut(0, Roman(\"MDCLXVI\")); CrLf(0);\n]\n","language":"XPL0"},{"code":"xquery version \"3.1\";\n\ndeclare function local:decode-roman-numeral($roman-numeral as xs:string) {\n $roman-numeral\n => upper-case()\n => for-each(\n function($roman-numeral-uppercase) {\n analyze-string($roman-numeral-uppercase, \".\")/fn:match\n ! map { \"M\": 1000, \"D\": 500, \"C\": 100, \"L\": 50, \"X\": 10, \"V\": 5, \"I\": 1 }(.)\n }\n )\n => fold-right([0,0],\n function($number as xs:integer, $accumulator as array(*)) {\n let $running-total := $accumulator?1\n let $previous-number := $accumulator?2\n return\n if ($number lt $previous-number) then\n [ $running-total - $number, $number ]\n else\n [ $running-total + $number, $number ]\n }\n )\n => array:get(1)\n};\n\nlet $roman-numerals :=\n map {\n \"MCMXCIX\": 1999,\n \"MDCLXVI\": 1666,\n \"XXV\": 25,\n \"XIX\": 19,\n \"XI\": 11,\n \"CMLIV\": 954,\n \"MMXI\": 2011,\n \"CD\": 400,\n \"MCMXC\": 1990,\n \"MMVIII\": 2008,\n \"MMIX\": 2009,\n \"MMMDCCCLXXXVIII\": 3888\n }\nreturn\n map:for-each(\n $roman-numerals,\n function($roman-numeral, $expected-value) {\n local:decode-roman-numeral($roman-numeral) eq $expected-value\n }\n )\n","language":"XQuery"},{"code":"romans$ = \"MDCLXVI\"\ndecmls$ = \"1000,500,100,50,10,5,1\"\n\nsub romanDec(s$)\n local i, n, prev, res, decmls$(1)\n\t\n n = token(decmls$, decmls$(), \",\")\n\t\n for i = len(s$) to 1 step -1\n n = val(decmls$(instr(romans$, mid$(s$, i, 1))))\n if n < prev n = 0 - n\n res = res + n\n prev = n\n next i\n return res\nend sub\n\n? romanDec(\"MCMXCIX\") // 1999\n? romanDec(\"MDCLXVI\") // 1666\n? romanDec(\"XXV\") // 25\n? romanDec(\"XIX\") // 19\n? romanDec(\"XI\") // 11\n? romanDec(\"CMLIV\") // 954\n? romanDec(\"MMXI\") // 2011\n? romanDec(\"CD\") // 400\n? romanDec(\"MCMXC\") // 1990\n? romanDec(\"MMVIII\") // 2008\n? romanDec(\"MMIX\") // 2009\n? romanDec(\"MDCLXVI\") // 1666\n? romanDec(\"MMMDCCCLXXXVIII\") // 3888\n","language":"Yabasic"},{"code":"var romans = L(\n L(\"M\", 1000), L(\"CM\", 900), L(\"D\", 500), L(\"CD\", 400), L(\"C\", 100),\n L(\"XC\", 90), L(\"L\", 50), L(\"XL\", 40), L(\"X\", 10), L(\"IX\", 9),\n L(\"V\", 5), L(\"IV\", 4), L(\"I\", 1));\nfcn toArabic(romanNumber){\t// romanNumber needs to be upper case\n if (not RegExp(\"^[CDILMVX]+$\").matches(romanNumber))\n throw(Exception.ValueError(\"Not a Roman number: %s\".fmt(romanNumber)));\n reg value = 0;\n foreach R,N in (romans){\n while (0 == romanNumber.find(R)){\n\t value += N;\n\t romanNumber = romanNumber[R.len(),*];\n }\n }\n return(value);\n}\n","language":"Zkl"},{"code":"program: roman_decimal\n input: 'XIII'\n output: 13\n","language":"Zoea"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Roman_numerals/Decode\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nCreate a function that takes a Roman numeral as its argument and returns its value as a numeric decimal integer. \\n\\nYou don't need to validate the form of the Roman numeral.\\n\\nModern Roman numerals are written by expressing each decimal digit of the number to be encoded separately, \\n<br>starting with the leftmost decimal digit and skipping any '''0'''s (zeroes). \\n\\n'''1990''' is rendered as '''MCMXC''' (1000 = M, 900 = CM, 90 = XC) and \\n<br>'''2008''' is rendered as '''MMVIII''' (2000 = MM, 8 = VIII).\\n \\nThe Roman numeral for '''1666''', '''MDCLXVI''', uses each letter in descending order.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V roman_values = [(‘I’, 1), (‘IV’, 4), (‘V’, 5), (‘IX’, 9), (‘X’, 10),\\n (‘XL’, 40), (‘L’, 50), (‘XC’, 90), (‘C’, 100),\\n (‘CD’, 400), (‘D’, 500), (‘CM’, 900), (‘M’, 1000)]\\n\\nF roman_value(=roman)\\n V total = 0\\n L(symbol, value) reversed(:roman_values)\\n L roman.starts_with(symbol)\\n total += value\\n roman = roman[symbol.len..]\\n R total\\n\\nL(value) [‘MCMXC’, ‘MMVIII’, ‘MDCLXVI’]\\n print(value‘ = ’roman_value(value))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Roman numerals Decode - 17/04/2019\\nROMADEC CSECT\\n USING ROMADEC,R13 base register\\n B 72(R15) skip savearea\\n DC 17F'0' savearea\\n SAVE (14,12) save previous context\\n ST R13,4(R15) link backward\\n ST R15,8(R13) link forward\\n LR R13,R15 set addressability\\n LA R6,1 i=1\\n DO WHILE=(C,R6,LE,=A(NV)) do i=1 to hbound(vals)\\n LR R1,R6 i\\n SLA R1,3 ~\\n LA R4,VALS-L'VALS(R1) @vals(i)\\n MVC X,0(R4) x=vals(i)\\n SR R9,R9 prev=0\\n ST R9,Y y=0\\n LA R7,L'X j=1\\n DO WHILE=(C,R7,GE,=A(1)) do j=length(x) to 1 by -1\\n LA R4,X-1 @x\\n AR R4,R7 +j\\n MVC C,0(R4) c=substr(x,j,1)\\n IF CLI,C,NE,C' ' THEN if c^=' ' then\\n SR R1,R1 r1=0\\n LA R2,1 k=1\\n DO WHILE=(C,R2,LE,=A(L'ROMAN)) do k=1 to length(roman)\\n LA R3,ROMAN-1 @roman\\n AR R3,R2 +k\\n IF CLC,0(L'C,R3),EQ,C THEN if substr(roman,k,1)=c\\n LR R1,R2 index=k\\n B REINDEX leave k\\n ENDIF , endif\\n LA R2,1(R2) k=k+1\\n ENDDO , enddo k\\nREINDEX EQU * r1=index(roman,c)\\n SLA R1,2 ~\\n L R8,DECIM-4(R1) n=decim(index(roman,c))\\n IF CR,R8,LT,R9 THEN if n<prev then\\n LCR R8,R8 n=-n\\n ENDIF , endif\\n L R2,Y y\\n AR R2,R8 +n\\n ST R2,Y y=y+n\\n LR R9,R8 prev=n\\n ENDIF , endif\\n BCTR R7,0 j--\\n ENDDO , enddo j\\n MVC PG(8),X x\\n L R1,Y y\\n XDECO R1,XDEC edit y\\n MVC PG+12(4),XDEC+8 output y\\n XPRNT PG,L'PG print buffer\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n L R13,4(0,R13) restore previous savearea pointer\\n RETURN (14,12),RC=0 restore registers from calling sav\\nNV EQU (X-VALS)/L'VALS\\nROMAN DC CL7'MDCLXVI'\\nDECIM DC F'1000',F'500',F'100',F'50',F'10',F'5',F'1'\\nVALS DC CL8'XIV',CL8'CMI',CL8'MIC',CL8'MCMXC',CL8'MDCLXVI'\\n DC CL8'MMVIII',CL8'MMXIX',CL8'MMMCMXCV'\\nX DS CL(L'VALS)\\nY DS F\\nC DS CL1\\nPG DC CL80'........ -> ....'\\nXDEC DS CL12\\n REGEQU\\n END ROMADEC\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"\\t\\torg\\t100h\\n\\t\\tjmp\\ttest\\n\\t\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t\\t;; Takes a zero-terminated Roman numeral string in BC\\n\\t\\t;; and returns 16-bit integer in HL.\\n\\t\\t;; All registers destroyed.\\nroman:\\t\\tdcx\\tb\\nromanfindend:\\tinx\\tb\\t; load next character\\n\\t\\tldax\\tb\\t\\n\\t\\tinr\\te\\n\\t\\tana\\ta\\t; are we there yet\\n\\t\\tjnz\\tromanfindend\\n\\t\\tlxi\\th,0\\t; zero HL to hold the total\\n\\t\\tpush\\th\\t; stack holds the previous roman numeral\\nromanloop:\\tdcx\\tb\\t; get next roman numeral\\n\\t\\tldax\\tb\\t; (work backwards)\\n\\t\\tcall\\tromandgt\\n\\t\\tjc\\tromandone\\t; carry set = not Roman anymore\\n\\t\\txthl\\t\\t; load previous roman numeral\\n\\t\\tcall\\tcmpdehl\\t; DE < HL?\\n\\t\\tmov\\th,d\\t; in any case, DE is now the previous\\n\\t\\tmov\\tl,e\\t; Roman numeral\\n\\t\\txthl\\t\\t; bring back the total\\n\\t\\tjnc\\tromanadd\\n\\t\\tmov\\ta,d\\t; DE (current) < HL (previous)\\n\\t\\tcma\\t\\t; so this Roman digit must be subtracted\\n\\t\\tmov\\td,a\\t; from the total.\\n\\t\\tmov\\ta,e\\t; so we negate it before adding it\\n\\t\\tcma\\t\\t; two's complement: -de = (~de)+1\\n\\t\\tmov\\te,a\\n\\t\\tinx\\td\\nromanadd:\\tdad\\td\\t; add to running total\\n\\t\\tjmp\\tromanloop\\nromandone:\\tpop\\td\\t; remove temporary variable from stack\\n\\t\\tret\\n\\t\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t\\t;; 16-bit compare DE with HL, set flags\\n\\t\\t;; accordingly. A destroyed.\\ncmpdehl:\\tmov\\ta,d\\n\\t\\tcmp\\th\\n\\t\\trnz\\n\\t\\tmov\\ta,e\\n\\t\\tcmp\\tl\\n\\t\\tret\\n\\t\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t\\t;; Takes a single Roman 'digit' in A,\\n\\t\\t;; and returns its value in DE (0 if invalid)\\n\\t\\t;; All other registers preserved.\\nromandgt:\\tpush\\th\\t; preserve hl for the caller\\n\\t\\tlxi\\th,romantab\\n\\t\\tmvi\\te,7\\t; e=counter\\nromandgtl:\\tcmp\\tm\\t; check table entry\\n\\t\\tjz\\tromanfound\\n\\t\\tinx\\th\\t; move to next table entry\\n\\t\\tinx\\th\\n\\t\\tinx\\th\\n\\t\\tdcr\\te\\t; decrease counter\\n\\t\\tjnz\\tromandgtl\\n\\t\\tpop\\th\\t; we didn't find it\\n\\t\\tstc\\t\\t; set carry\\n\\t\\tret\\t\\t; return with DE=0\\nromanfound:\\tinx\\th\\t; we did find it\\n\\t\\tmov\\te,m\\t; load it into DE\\n\\t\\tinx\\th\\n\\t\\tmov\\td,m\\n\\t\\tpop\\th\\n\\t\\tana\\ta\\t; clear carry\\n\\t\\tret\\nromantab:\\tdb\\t'I',1,0\\t; 16-bit little endian values\\n\\t\\tdb\\t'V',5,0\\n\\t\\tdb\\t'X',10,0\\n\\t\\tdb\\t'L',50,0\\n\\t\\tdb\\t'C',100,0\\n\\t\\tdb\\t'D',0f4h,1\\n\\t\\tdb\\t'M',0e8h,3\\n\\t\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t\\t;; The following is testing and I/O code.\\ntest:\\t\\tmvi\\tc,10\\t; read string from console\\n\\t\\tlxi\\td,bufdef\\n\\t\\tcall\\t5\\n\\t\\tmvi\\tc,9\\t; print newline\\n\\t\\tlxi\\td,nl\\n\\t\\tcall\\t5\\n\\t\\tlxi\\tb,buf\\t; run `roman' on the input string\\n\\t\\tcall\\troman\\t; the result is now in hl\\n\\t\\tlxi\\td,-10000\\t\\n\\t\\tcall\\tnumout\\t; print 10000s digit\\n\\t\\tlxi\\td,-1000\\t\\t\\n\\t\\tcall\\tnumout\\t; print 1000s digit\\n\\t\\tlxi\\td,-100\\n\\t\\tcall \\tnumout\\t; print 100s digit\\n\\t\\tlxi\\td,-10\\n\\t\\tcall \\tnumout\\t; print 10s digit\\n\\t\\tlxi\\td,-1\\t; ...print 1s digit\\nnumout:\\t\\tmvi\\ta,-1\\t\\n\\t\\tpush\\th\\t\\nnumloop:\\tinr\\ta\\n\\t\\tpop\\tb\\n\\t\\tpush\\th\\n\\t\\tdad\\td\\n\\t\\tjc\\tnumloop\\n\\t\\tadi\\t'0'\\n\\t\\tmvi\\tc,2\\n\\t\\tmov\\te,a\\n\\t\\tcall\\t5\\n\\t\\tpop\\th\\n\\t\\tret\\nnl:\\t\\tdb\\t13,10,'$'\\nbufdef:\\t\\tdb\\t16,0\\nbuf:\\t\\tds\\t17\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \"CARD FUNC DecodeRomanDigit(CHAR c)\\n IF c='I THEN RETURN (1)\\n ELSEIF c='V THEN RETURN (5)\\n ELSEIF c='X THEN RETURN (10)\\n ELSEIF c='L THEN RETURN (50)\\n ELSEIF c='C THEN RETURN (100)\\n ELSEIF c='D THEN RETURN (500)\\n ELSEIF c='M THEN RETURN (1000)\\n FI\\nRETURN (0)\\n\\nCARD FUNC DecodeRomanNumber(CHAR ARRAY s)\\n CARD res,curr,prev\\n BYTE i\\n\\n res=0 prev=0 i=s(0)\\n WHILE i>0\\n DO\\n curr=DecodeRomanDigit(s(i))\\n IF curr<prev THEN\\n res==-curr\\n ELSE\\n res==+curr\\n FI\\n prev=curr\\n i==-1\\n OD\\nRETURN (res)\\n\\nPROC Test(CHAR ARRAY s)\\n CARD n\\n\\n n=DecodeRomanNumber(s)\\n PrintF(\\\"%S=%U%E\\\",s,n)\\nRETURN\\n\\nPROC Main()\\n Test(\\\"MCMXC\\\")\\n Test(\\\"MMVIII\\\")\\n Test(\\\"MDCLXVI\\\")\\n Test(\\\"MMMDCCCLXXXVIII\\\")\\n Test(\\\"MMMCMXCIX\\\")\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"Pragma Ada_2012;\\nPragma Assertion_Policy( Check );\\n\\nWith\\nUnchecked_Conversion,\\nAda.Text_IO;\\n\\nProcedure Test_Roman_Numerals is\\n\\n -- We create an enumeration of valid characters, note that they are\\n -- character-literals, this is so that we can use literal-strings,\\n -- and that their size is that of Integer.\\n Type Roman_Digits is ('I', 'V', 'X', 'L', 'C', 'D', 'M' )\\n with Size => Integer'Size;\\n\\n -- We use a representation-clause ensure the proper integral-value\\n -- of each individual character.\\n For Roman_Digits use\\n (\\n 'I' => 1,\\n 'V' => 5,\\n 'X' => 10,\\n 'L' => 50,\\n 'C' => 100,\\n 'D' => 500,\\n 'M' => 1000\\n );\\n\\n -- To convert a Roman_Digit to an integer, we now only need to\\n -- read its value as an integer.\\n Function Convert is new Unchecked_Conversion\\n (\\tSource => Roman_Digits,\\tTarget => Integer );\\n\\n -- Romena_Numeral is a string of Roman_Digit.\\n Type Roman_Numeral is array (Positive range <>) of Roman_Digits;\\n\\n -- The Numeral_List type is used herein only for testing\\n -- and verification-data.\\n Type Numeral_List is array (Positive range <>) of\\n not null access Roman_Numeral;\\n\\n -- The Test_Cases subtype ensures that Test_Data and Validation_Data\\n -- both contain the same number of elements, and that the indecies\\n -- are the same; essentially the same as:\\n --\\n -- pragma Assert( Test_Data'Length = Validation_Data'Length\\n --\\t\\t AND Test_Data'First = Validation_Data'First);\\n\\n subtype Test_Cases is Positive range 1..14;\\n\\n Test_Data : constant Numeral_List(Test_Cases):=\\n (\\n New Roman_Numeral'(\\\"III\\\"),\\t-- 3\\n New Roman_Numeral'(\\\"XXX\\\"),\\t-- 30\\n New Roman_Numeral'(\\\"CCC\\\"),\\t-- 300\\n New Roman_Numeral'(\\\"MMM\\\"),\\t-- 3000\\n\\n New Roman_Numeral'(\\\"VII\\\"),\\t-- 7\\n New Roman_Numeral'(\\\"LXVI\\\"),\\t-- 66\\n New Roman_Numeral'(\\\"CL\\\"),\\t-- 150\\n New Roman_Numeral'(\\\"MCC\\\"),\\t-- 1200\\n\\n New Roman_Numeral'(\\\"IV\\\"),\\t-- 4\\n New Roman_Numeral'(\\\"IX\\\"),\\t-- 9\\n New Roman_Numeral'(\\\"XC\\\"),\\t-- 90\\n\\n New Roman_Numeral'(\\\"ICM\\\"),\\t-- 901\\n New Roman_Numeral'(\\\"CIM\\\"),\\t-- 899\\n\\n New Roman_Numeral'(\\\"MDCLXVI\\\")\\t-- 1666\\n );\\n\\n Validation_Data : constant array(Test_Cases) of Natural:=\\n (\\t3, 30, 300, 3000,\\n\\t7, 66, 150, 1200,\\n\\t4, 9, 90,\\n\\t901, 899,\\n\\t1666\\n );\\n\\n\\n -- In Roman numerals, the subtractive form [IV = 4] was used\\n -- very infrequently, the most common form was the addidive\\n -- form [IV = 6]. (Consider military logistics and squads.)\\n\\n -- SUM returns the Number, read in the additive form.\\n Function Sum( Number : Roman_Numeral ) return Natural is\\n begin\\n\\tReturn Result : Natural:= 0 do\\n\\t For Item of Number loop\\n\\t\\t Result:= Result + Convert( Item );\\n\\t end loop;\\n\\tEnd Return;\\n end Sum;\\n\\n -- EVAL returns Number read in the subtractive form.\\n Function Eval( Number : Roman_Numeral ) return Natural is\\n\\tCurrent : Roman_Digits:= 'I';\\n begin\\n\\tReturn Result : Natural:= 0 do\\n\\t For Item of Number loop\\n\\t\\tif Current < Item then\\n\\t\\t Result:= Convert(Item) - Result;\\n\\t\\t Current:= Item;\\n\\t\\telse\\n\\t\\t Result:= Result + Convert(Item);\\n\\t\\tend if;\\n\\t end loop;\\n\\tEnd Return;\\n end Eval;\\n\\n -- Display the given Roman_Numeral via Text_IO.\\n Procedure Put( S: Roman_Numeral ) is\\n begin\\n\\tFor Ch of S loop\\n\\t declare\\n\\t\\t-- The 'Image attribute returns the character inside\\n\\t\\t-- single-quotes; so we select the character itself.\\n\\t\\tC : Character renames Roman_Digits'Image(Ch)(2);\\n\\t begin\\n\\t\\tAda.Text_IO.Put( C );\\n\\t end;\\n\\tend loop;\\n end;\\n\\n -- This displays pass/fail dependant on the parameter.\\n Function PF ( Value : Boolean ) Return String is\\n begin\\n\\tReturn Result : String(1..4):= ( if Value then\\\"pass\\\"else\\\"fail\\\" );\\n End PF;\\n\\nBegin\\n Ada.Text_IO.Put_Line(\\\"Starting Test:\\\");\\n\\n for Index in Test_Data'Range loop\\n\\tdeclare\\n\\t Item : Roman_Numeral renames Test_Data(Index).all;\\n\\t Value : constant Natural := Eval(Item);\\n\\tbegin\\n\\t Put( Item );\\n\\n\\t Ada.Text_IO.Put( ASCII.HT & \\\"= \\\");\\n\\t Ada.Text_IO.Put( Value'Img );\\n\\t Ada.Text_IO.Put_Line( ASCII.HT & '[' &\\n\\t\\t\\t PF( Value = Validation_Data(Index) )& ']');\\n\\tend;\\n end loop;\\n\\n\\n Ada.Text_IO.Put_Line(\\\"Testing complete.\\\");\\nEnd Test_Roman_Numerals;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \" PROC roman to int = (STRING roman) INT:\\n BEGIN\\n PROC roman digit value = (CHAR roman digit) INT:\\n (roman digit = \\\"M\\\" | 1000 |:\\n roman digit = \\\"D\\\" | 500 |:\\n roman digit = \\\"C\\\" | 100 |:\\n roman digit = \\\"L\\\" | 50 |:\\n roman digit = \\\"X\\\" | 10 |:\\n roman digit = \\\"V\\\" | 5 |:\\n roman digit = \\\"I\\\" | 1);\\n\\n INT result := 0, previous value := 0, run := 0;\\n\\n FOR i FROM LWB roman TO UPB roman\\n DO\\n INT value = roman digit value(roman[i]);\\n IF previous value = value THEN\\n run +:= value\\n ELSE\\n IF previous value < value THEN\\n result -:= run\\n ELSE\\n result +:= run\\n FI;\\n run := previous value := value\\n FI\\n OD;\\n\\n result +:= run\\n END;\\n\\n MODE TEST = STRUCT (STRING input, INT expected output);\\n\\n [] TEST roman test = (\\n (\\\"MMXI\\\", 2011), (\\\"MIM\\\", 1999),\\n (\\\"MCMLVI\\\", 1956), (\\\"MDCLXVI\\\", 1666),\\n (\\\"XXCIII\\\", 83), (\\\"LXXIIX\\\", 78),\\n (\\\"IIIIX\\\", 6)\\n );\\n\\n print((\\\"Test input Value Got\\\", newline, \\\"--------------------------\\\", newline));\\n FOR i FROM LWB roman test TO UPB roman test\\n DO\\n INT output = roman to int(input OF roman test[i]);\\n printf(($g, n (12 - UPB input OF roman test[i]) x$, input OF roman test[i]));\\n printf(($g(5), 1x, g(5), 1x$, expected output OF roman test[i], output));\\n printf(($b(\\\"ok\\\", \\\"not ok\\\"), 1l$, output = expected output OF roman test[i]))\\n OD\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin\\n % decodes a roman numeral into an integer %\\n % there must be at least one blank after the numeral %\\n % This takes a lenient view on roman numbers so e.g. IIXX is 18 - see %\\n % the Discussion %\\n integer procedure romanToDecimal ( string(32) value roman ) ;\\n begin\\n integer decimal, rPos, currDigit, nextDigit, seqValue;\\n string(1) rDigit;\\n\\n % the roman number is a sequence of sequences of roman digits %\\n % if the previous sequence is of higher value digits than the next, %\\n % the higher value is added to the overall value %\\n % if the previous seequence is of lower value, it is subtracted %\\n % e.g. MCMLXII %\\n % the sequences are M, C, M, X, II %\\n % M is added, C subtracted, M added, X added and II added %\\n\\n % get the value of a sequence of roman digits %\\n integer procedure getSequence ;\\n if rDigit = \\\" \\\" then begin\\n % end of the number %\\n 0\\n end\\n else begin\\n % have another sequence %\\n integer sValue;\\n sValue := 0;\\n while roman( rPos // 1 ) = rDigit do begin\\n sValue := sValue + currDigit;\\n rPos := rPos + 1;\\n end while_have_same_digit ;\\n % remember the next digit %\\n rDigit := roman( rPos // 1 );\\n % result is the sequence value %\\n sValue\\n end getSequence ;\\n\\n % convert a roman digit into its decimal equivalent %\\n % an invalid digit will terminate the program, \\\" \\\" is 0 %\\n integer procedure getValue( string(1) value romanDigit ) ;\\n if romanDigit = \\\"m\\\" or romanDigit = \\\"M\\\" then 1000\\n else if romanDigit = \\\"d\\\" or romanDigit = \\\"D\\\" then 500\\n else if romanDigit = \\\"c\\\" or romanDigit = \\\"C\\\" then 100\\n else if romanDigit = \\\"l\\\" or romanDigit = \\\"L\\\" then 50\\n else if romanDigit = \\\"x\\\" or romanDigit = \\\"X\\\" then 10\\n else if romanDigit = \\\"v\\\" or romanDigit = \\\"V\\\" then 5\\n else if romanDigit = \\\"i\\\" or romanDigit = \\\"I\\\" then 1\\n else if romanDigit = \\\" \\\" then 0\\n else begin\\n write( s_w := 0, \\\"Invalid roman digit: \\\"\\\"\\\", romanDigit, \\\"\\\"\\\"\\\" );\\n assert false;\\n 0\\n end getValue ;\\n\\n % get the first sequence %\\n decimal := 0;\\n rPos := 0;\\n rDigit := roman( rPos // 1 );\\n currDigit := getValue( rDigit );\\n seqValue := getSequence;\\n\\n % handle the sequences %\\n while rDigit not = \\\" \\\" do begin\\n % have another sequence %\\n nextDigit := getValue( rDigit );\\n if currDigit < nextDigit\\n then % prev digit is lower % decimal := decimal - seqValue\\n else % prev digit is higher % decimal := decimal + seqValue\\n ;\\n currDigit := nextDigit;\\n seqValue := getSequence;\\n end while_have_a_roman_digit ;\\n\\n % add the final sequence %\\n decimal + seqValue\\n end roman ;\\n\\n % test the romanToDecimal routine %\\n\\n procedure testRoman ( string(32) value romanNumber ) ;\\n write( i_w := 5, romanNumber, romanToDecimal( romanNumber ) );\\n\\n testRoman( \\\"I\\\" ); testRoman( \\\"II\\\" );\\n testRoman( \\\"III\\\" ); testRoman( \\\"IV\\\" );\\n testRoman( \\\"V\\\" ); testRoman( \\\"VI\\\" );\\n testRoman( \\\"VII\\\" ); testRoman( \\\"VIII\\\" );\\n testRoman( \\\"IX\\\" ); testRoman( \\\"IIXX\\\" );\\n testRoman( \\\"XIX\\\" ); testRoman( \\\"XX\\\" );\\n write( \\\"...\\\" );\\n testRoman( \\\"MCMXC\\\" );\\n testRoman( \\\"MMVIII\\\" );\\n testRoman( \\\"MDCLXVI\\\" );\\n\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"/* Parse Roman Numerals\\n\\n Nigel Galloway March 16th., 2012\\n*/\\ngrammar ParseRN ;\\n\\noptions {\\n\\tlanguage = Java;\\n}\\n@members {\\nint rnValue;\\nint ONE;\\n}\\n\\nparseRN:\\t({rnValue = 0;} rn NEWLINE {System.out.println($rn.text + \\\" = \\\" + rnValue);})*\\n\\t;\\n\\t\\nrn\\t:\\t(Thousand {rnValue += 1000;})* hundreds? tens? units?;\\n\\nhundreds:\\t{ONE = 0;} (h9 | h5) {if (ONE > 3) System.out.println (\\\"Too many hundreds\\\");};\\nh9\\t:\\tHundred {ONE += 1;} (FiveHund {rnValue += 400;}| Thousand {rnValue += 900;}|{rnValue += 100;} (Hundred {rnValue += 100; ONE += 1;})*);\\nh5\\t:\\tFiveHund {rnValue += 500;} (Hundred {rnValue += 100; ONE += 1;})*;\\n\\ntens\\t:\\t{ONE = 0;} (t9 | t5) {if (ONE > 3) System.out.println (\\\"Too many tens\\\");};\\nt9\\t:\\tTen {ONE += 1;} (Fifty {rnValue += 40;}| Hundred {rnValue += 90;}|{rnValue += 10;} (Ten {rnValue += 10; ONE += 1;})*);\\nt5\\t:\\tFifty {rnValue += 50;} (Ten {rnValue += 10; ONE += 1;})*;\\n\\t\\nunits\\t:\\t{ONE = 0;} (u9 | u5) {if (ONE > 3) System.out.println (\\\"Too many ones\\\");};\\nu9\\t:\\tOne {ONE += 1;} (Five {rnValue += 4;}| Ten {rnValue += 9;}|{rnValue += 1;} (One {rnValue += 1; ONE += 1;})*);\\nu5\\t:\\tFive {rnValue += 5;} (One {rnValue += 1; ONE += 1;})*;\\n\\t\\nOne\\t:\\t'I';\\nFive\\t:\\t'V';\\nTen\\t:\\t'X';\\nFifty\\t:\\t'L';\\nHundred:\\t'C';\\nFiveHund:\\t'D';\\nThousand:\\t'M' ;\\nNEWLINE:\\t'\\\\r'? '\\\\n' ;\\n\",\n \"language\": \"ANTLR\"\n },\n {\n \"code\": \"fromRoman←{\\n rmn←(⎕A,⎕A,'*')[(⎕A,⎕UCS 96+⍳26)⍳⍵] ⍝ make input uppercase\\n dgt←↑'IVXLCDM' (1 5 10 50 100 500 1000) ⍝ values of roman digits\\n ~rmn∧.∊⊂dgt[1;]:⎕SIGNAL 11 ⍝ domain error if non-roman input\\n map←dgt[2;dgt[1;]⍳rmn] ⍝ map digits to values\\n +/map×1-2×(2</map),0 ⍝ subtractive principle\\n}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"------------- INTEGER VALUE OF A ROMAN STRING ------------\\n\\n-- romanValue :: String -> Int\\non romanValue(s)\\n script roman\\n property mapping : [[\\\"M\\\", 1000], [\\\"CM\\\", 900], [\\\"D\\\", 500], [\\\"CD\\\", 400], ¬\\n [\\\"C\\\", 100], [\\\"XC\\\", 90], [\\\"L\\\", 50], [\\\"XL\\\", 40], [\\\"X\\\", 10], [\\\"IX\\\", 9], ¬\\n [\\\"V\\\", 5], [\\\"IV\\\", 4], [\\\"I\\\", 1]]\\n\\n -- Value of first Roman glyph + value of remaining glyphs\\n -- toArabic :: [Char] -> Int\\n on toArabic(xs)\\n -- transcribe :: (String, Number) -> Maybe (Number, [String])\\n script transcribe\\n on |λ|(pair)\\n set {r, v} to pair\\n if isPrefixOf(characters of r, xs) then\\n\\n -- Value of this matching glyph, with any remaining glyphs\\n {v, drop(length of r, xs)}\\n else\\n {}\\n end if\\n end |λ|\\n end script\\n\\n if 0 < length of xs then\\n set parsed to concatMap(transcribe, mapping)\\n (item 1 of parsed) + toArabic(item 2 of parsed)\\n else\\n 0\\n end if\\n end toArabic\\n end script\\n\\n toArabic(characters of s) of roman\\nend romanValue\\n\\n--------------------------- TEST -------------------------\\non run\\n map(romanValue, {\\\"MCMXC\\\", \\\"MDCLXVI\\\", \\\"MMVIII\\\"})\\n\\n --> {1990, 1666, 2008}\\nend run\\n\\n\\n-------------------- GENERIC FUNCTIONS -------------------\\n\\n-- concatMap :: (a -> [b]) -> [a] -> [b]\\non concatMap(f, xs)\\n set lng to length of xs\\n set acc to {}\\n tell mReturn(f)\\n repeat with i from 1 to lng\\n set acc to acc & (|λ|(item i of xs, i, xs))\\n end repeat\\n end tell\\n if {text, string} contains class of xs then\\n acc as text\\n else\\n acc\\n end if\\nend concatMap\\n\\n\\n-- drop :: Int -> [a] -> [a]\\n-- drop :: Int -> String -> String\\non drop(n, xs)\\n set c to class of xs\\n if script is not c then\\n if string is not c then\\n if n < length of xs then\\n items (1 + n) thru -1 of xs\\n else\\n {}\\n end if\\n else\\n if n < length of xs then\\n text (1 + n) thru -1 of xs\\n else\\n \\\"\\\"\\n end if\\n end if\\n else\\n take(n, xs) -- consumed\\n return xs\\n end if\\nend drop\\n\\n\\n-- isPrefixOf :: [a] -> [a] -> Bool\\n-- isPrefixOf :: String -> String -> Bool\\non isPrefixOf(xs, ys)\\n -- isPrefixOf takes two lists or strings and returns\\n -- true if and only if the first is a prefix of the second.\\n script go\\n on |λ|(xs, ys)\\n set intX to length of xs\\n if intX < 1 then\\n true\\n else if intX > length of ys then\\n false\\n else if class of xs is string then\\n (offset of xs in ys) = 1\\n else\\n set {xxt, yyt} to {uncons(xs), uncons(ys)}\\n ((item 1 of xxt) = (item 1 of yyt)) and ¬\\n |λ|(item 2 of xxt, item 2 of yyt)\\n end if\\n end |λ|\\n end script\\n go's |λ|(xs, ys)\\nend isPrefixOf\\n\\n\\n-- length :: [a] -> Int\\non |length|(xs)\\n set c to class of xs\\n if list is c or string is c then\\n length of xs\\n else\\n (2 ^ 29 - 1) -- (maxInt - simple proxy for non-finite)\\n end if\\nend |length|\\n\\n\\n-- map :: (a -> b) -> [a] -> [b]\\non map(f, xs)\\n tell mReturn(f)\\n set lng to length of xs\\n set lst to {}\\n repeat with i from 1 to lng\\n set end of lst to |λ|(item i of xs, i, xs)\\n end repeat\\n return lst\\n end tell\\nend map\\n\\n\\n-- Lift 2nd class handler function into 1st class script wrapper\\n-- mReturn :: Handler -> Script\\non mReturn(f)\\n if class of f is script then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\\n\\n-- uncons :: [a] -> Maybe (a, [a])\\non uncons(xs)\\n set lng to |length|(xs)\\n if 0 = lng then\\n missing value\\n else\\n if (2 ^ 29 - 1) as integer > lng then\\n if class of xs is string then\\n set cs to text items of xs\\n {item 1 of cs, rest of cs}\\n else\\n {item 1 of xs, rest of xs}\\n end if\\n else\\n set nxt to take(1, xs)\\n if {} is nxt then\\n missing value\\n else\\n {item 1 of nxt, xs}\\n end if\\n end if\\n end if\\nend uncons\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{1990, 1666, 2008}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"use framework \\\"Foundation\\\"\\n\\n----------- INTEGER VALUE OF ROMAN NUMBER STRING ---------\\n\\n-- fromRoman :: String -> Int\\non fromRoman(s)\\n script subtractIfLower\\n on |λ|(l, rn)\\n set {r, n} to rn\\n if l ≥ r then -- Digit values that increase (L to R),\\n {l, n + l} -- (added)\\n else\\n {l, n - l} -- Digit values that go down: subtracted.\\n end if\\n end |λ|\\n end script\\n\\n item 2 of foldr(subtractIfLower, {0, 0}, ¬\\n map(my charVal, characters of s))\\nend fromRoman\\n\\n\\n-- charVal :: Char -> Int\\non charVal(C)\\n set v to lookup(toUpper(C), ¬\\n {I:1, |V|:5, X:10, |L|:50, C:100, D:500, M:1000})\\n if missing value is v then\\n 0\\n else\\n v\\n end if\\nend charVal\\n\\n\\n--------------------------- TEST -------------------------\\non run\\n map(fromRoman, ¬\\n {\\\"MDCLXVI\\\", \\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MMXVI\\\", \\\"MMXXI\\\"})\\n\\n --> {1666, 1990, 2008, 2016, 2021}\\nend run\\n\\n\\n-------------------- GENERIC FUNCTIONS -------------------\\n\\n-- foldr :: (a -> b -> b) -> b -> [a] -> b\\non foldr(f, startValue, xs)\\n tell mReturn(f)\\n set v to startValue\\n set lng to length of xs\\n repeat with I from lng to 1 by -1\\n set v to |λ|(item I of xs, v)\\n end repeat\\n return v\\n end tell\\nend foldr\\n\\n\\n-- lookup :: a -> Dict -> Maybe b\\non lookup(k, dct)\\n -- Just the value of k in the dictionary,\\n -- or missing value if k is not found.\\n set ca to current application\\n set v to (ca's NSDictionary's dictionaryWithDictionary:dct)'s ¬\\n objectForKey:k\\n if missing value ≠ v then\\n item 1 of ((ca's NSArray's arrayWithObject:v) as list)\\n else\\n missing value\\n end if\\nend lookup\\n\\n\\n-- map :: (a -> b) -> [a] -> [b]\\non map(f, xs)\\n -- The list obtained by applying f\\n -- to each element of xs.\\n tell mReturn(f)\\n set lng to length of xs\\n set lst to {}\\n repeat with I from 1 to lng\\n set end of lst to |λ|(item I of xs, I, xs)\\n end repeat\\n return lst\\n end tell\\nend map\\n\\n\\n-- Lift 2nd class handler function into 1st class\\n-- script wrapper\\n-- mReturn :: Handler -> Script\\non mReturn(f)\\n if class of f is script then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\\n\\n-- toUpper :: String -> String\\non toUpper(str)\\n tell current application\\n ((its (NSString's stringWithString:(str)))'s ¬\\n uppercaseStringWithLocale:¬\\n (its NSLocale's currentLocale())) as text\\n end tell\\nend toUpper\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{1666, 1990, 2008, 2016, 2021}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \" 10 LET R$ = \\\"MCMXCIX\\\"\\n 20 GOSUB 100 PRINT \\\"ROMAN NUMERALS DECODED\\\"\\n 30 LET R$ = \\\"MMXII\\\"\\n 40 GOSUB 100\\n 50 LET R$ = \\\"MDCLXVI\\\"\\n 60 GOSUB 100\\n 70 LET R$ = \\\"MMMDCCCLXXXVIII\\\"\\n 80 GOSUB 100\\n 90 END\\n 100 PRINT M$R$,\\n 110 LET M$ = CHR$ (13)\\n 120 GOSUB 150\\\"ROMAN NUMERALS DECODE given R$\\\"\\n 130 PRINT N;\\n 140 RETURN\\n 150 IF NOT C THEN GOSUB 250INITIALIZE\\n 160 LET J = 0\\n 170 LET N = 0\\n 180 FOR I = LEN (R$) TO 1 STEP - 1\\n 190 LET P = J\\n 200 FOR J = 1 TO C\\n 210 IF MID$ (C$,J,1) < > MID$ (R$,I,1) THEN NEXT J\\n 220 IF J < = C THEN N = N + R(J) * ((J > = P) * 2 - 1)\\n 230 NEXT I\\n 240 RETURN\\n 250 READ C$\\n 260 LET C = LEN (C$)\\n 270 DIM R(C)\\n 280 FOR I = 0 TO C\\n 290 READ R(I)\\n 300 NEXT I\\n 310 RETURN\\n 320 DATA \\\"IVXLCDM\\\",0,1,5,10,50,100,500,1000\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"syms: #[ M: 1000, D: 500, C: 100, L: 50, X: 10, V: 5, I: 1 ]\\n\\nfromRoman: function [roman][\\n\\tret: 0\\n\\tloop 0..(size roman)-2 'ch [\\n\\t\\tfst: roman\\\\[ch]\\n\\t\\tsnd: roman\\\\[ch+1]\\n\\t\\tvalueA: syms\\\\[fst]\\n\\t\\tvalueB: syms\\\\[snd]\\n\\n\\t\\tif? valueA < valueB -> ret: ret - valueA\\n\\t \\telse\\t\\t\\t\\t-> ret: ret + valueA\\n\\t]\\n\\treturn ret + syms\\\\[last roman]\\n]\\n\\nloop [\\\"MCMXC\\\" \\\"MMVIII\\\" \\\"MDCLXVI\\\"] 'r -> print [r \\\"->\\\" fromRoman r]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"Roman_Decode(str){\\n\\tres := 0\\n\\tLoop Parse, str\\n\\t{\\n\\t\\tn := {M: 1000, D:500, C:100, L:50, X:10, V:5, I:1}[A_LoopField]\\n\\t\\tIf ( n > OldN ) && OldN\\n\\t\\t\\tres -= 2*OldN\\n\\t\\tres += n, oldN := n\\n\\t}\\n\\treturn res\\n}\\n\\ntest = MCMXC|MMVIII|MDCLXVI\\nLoop Parse, test, |\\n res .= A_LoopField \\\"`t= \\\" Roman_Decode(A_LoopField) \\\"`r`n\\\"\\nclipboard := res\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f ROMAN_NUMERALS_DECODE.AWK\\nBEGIN {\\n leng = split(\\\"MCMXC MMVIII MDCLXVI\\\",arr,\\\" \\\")\\n for (i=1; i<=leng; i++) {\\n n = arr[i]\\n printf(\\\"%s = %s\\\\n\\\",n,roman2arabic(n))\\n }\\n exit(0)\\n}\\nfunction roman2arabic(r, a,i,p,q,u,ua,una,unr) {\\n r = toupper(r)\\n unr = \\\"MDCLXVI\\\" # each Roman numeral in descending order\\n una = \\\"1000 500 100 50 10 5 1\\\" # and its Arabic equivalent\\n split(una,ua,\\\" \\\")\\n i = split(r,u,\\\"\\\")\\n a = ua[index(unr,u[i])]\\n while (--i) {\\n p = index(unr,u[i])\\n q = index(unr,u[i+1])\\n a += ua[p] * ((p>q) ? -1 : 1)\\n }\\n return( (a>0) ? a : \\\"\\\" )\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"function romToDec (roman$)\\n num = 0\\n prenum = 0\\n for i = length(roman$) to 1 step -1\\n x$ = mid(roman$, i, 1)\\n n = 0\\n if x$ = \\\"M\\\" then n = 1000\\n if x$ = \\\"D\\\" then n = 500\\n if x$ = \\\"C\\\" then n = 100\\n if x$ = \\\"L\\\" then n = 50\\n if x$ = \\\"X\\\" then n = 10\\n if x$ = \\\"V\\\" then n = 5\\n if x$ = \\\"I\\\" then n = 1\\n\\n if n < preNum then num -= n else num += n\\n preNum = n\\n next i\\n\\n return num\\nend function\\n\\n#Testing\\nprint \\\"MCMXCIX = \\\"; romToDec(\\\"MCMXCIX\\\") #1999\\nprint \\\"MDCLXVI = \\\"; romToDec(\\\"MDCLXVI\\\") #1666\\nprint \\\"XXV = \\\"; romToDec(\\\"XXV\\\") #25\\nprint \\\"CMLIV = \\\"; romToDec(\\\"CMLIV\\\") #954\\nprint \\\"MMXI = \\\"; romToDec(\\\"MMXI\\\") #2011\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off\\nsetlocal enabledelayedexpansion\\n\\n::Testing...\\ncall :toArabic MCMXC\\necho MCMXC = !arabic!\\ncall :toArabic MMVIII\\necho MMVIII = !arabic!\\ncall :toArabic MDCLXVI\\necho MDCLXVI = !arabic!\\ncall :toArabic CDXLIV\\necho CDXLIV = !arabic!\\ncall :toArabic XCIX\\necho XCIX = !arabic!\\npause>nul\\nexit/b 0\\n\\n::The \\\"function\\\"...\\n:toArabic\\nset roman=%1\\nset arabic=\\nset lastval=\\n\\t%== Alternative for counting the string length ==%\\nset leng=-1\\nfor /l %%. in (0,1,1000) do set/a leng+=1&if \\\"!roman:~%%.,1!\\\"==\\\"\\\" goto break\\n:break\\nset /a last=!leng!-1\\nfor /l %%i in (!last!,-1,0) do (\\n\\tset n=0\\n\\tif /i \\\"!roman:~%%i,1!\\\"==\\\"M\\\" set n=1000\\n\\tif /i \\\"!roman:~%%i,1!\\\"==\\\"D\\\" set n=500\\n\\tif /i \\\"!roman:~%%i,1!\\\"==\\\"C\\\" set n=100\\n\\tif /i \\\"!roman:~%%i,1!\\\"==\\\"L\\\" set n=50\\n\\tif /i \\\"!roman:~%%i,1!\\\"==\\\"X\\\" set n=10\\n\\tif /i \\\"!roman:~%%i,1!\\\"==\\\"V\\\" set n=5\\n\\tif /i \\\"!roman:~%%i,1!\\\"==\\\"I\\\" set n=1\\n\\t\\n\\tif !n! lss !lastval! (\\n\\t\\tset /a arabic-=n\\n\\t) else (\\n\\t\\tset /a arabic+=n\\n\\t)\\n\\tset lastval=!n!\\n)\\ngoto :EOF\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" PRINT \\\"MCMXCIX\\\", FNromandecode(\\\"MCMXCIX\\\")\\n PRINT \\\"MMXII\\\", FNromandecode(\\\"MMXII\\\")\\n PRINT \\\"MDCLXVI\\\", FNromandecode(\\\"MDCLXVI\\\")\\n PRINT \\\"MMMDCCCLXXXVIII\\\", FNromandecode(\\\"MMMDCCCLXXXVIII\\\")\\n END\\n\\n DEF FNromandecode(roman$)\\n LOCAL i%, j%, p%, n%, r%()\\n DIM r%(7) : r%() = 0,1,5,10,50,100,500,1000\\n FOR i% = LEN(roman$) TO 1 STEP -1\\n j% = INSTR(\\\"IVXLCDM\\\", MID$(roman$,i%,1))\\n IF j%=0 ERROR 100, \\\"Invalid character\\\"\\n IF j%>=p% n% += r%(j%) ELSE n% -= r%(j%)\\n p% = j%\\n NEXT\\n = n%\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\nlet roman(s) = valof\\n$( let digit(ch) = valof\\n $( let ds = table 'm','d','c','l','x','v','i'\\n let vs = table 1000,500,100,50,10,5,1\\n for i=0 to 6\\n if ds!i=(ch|32) then resultis vs!i\\n resultis 0\\n $)\\n let acc = 0\\n for i=1 to s%0\\n $( let d = digit(s%i)\\n if d=0 then resultis 0\\n test i<s%0 & d<digit(s%(i+1))\\n do acc := acc-d\\n or acc := acc+d\\n $)\\n resultis acc\\n$)\\n\\nlet show(s) be writef(\\\"%S: %N*N\\\", s, roman(s))\\n\\nlet start() be\\n$( show(\\\"MCMXC\\\")\\n show(\\\"MDCLXVI\\\")\\n show(\\\"MMVII\\\")\\n show(\\\"MMXXI\\\")\\n$)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"⟨ToArabic⇐A⟩ ← {\\n c ← \\\"IVXLCDM\\\" # Characters\\n v ← ⥊ (10⋆↕4) ×⌜ 1‿5 # Their values\\n A ⇐ +´∘(⊢ׯ1⋆<⟜«) v ⊏˜ c ⊐ ⊢\\n}\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \" ToArabic¨ \\\"MCMXC\\\"‿\\\"MDCLXVI\\\"‿\\\"MMVII\\\"‿\\\"MMXXI\\\"\\n⟨ 1990 1666 2007 2021 ⟩\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \" ( unroman\\n = nbr,lastVal,val\\n . 0:?nbr:?lastVal\\n & @( low$!arg\\n : ?\\n %@?L\\n ( ?\\n & (m.1000)\\n (d.500)\\n (c.100)\\n (l.50)\\n (x.10)\\n (v.5)\\n (i.1)\\n : ? (!L.?val) ?\\n & (!val:~>!lastVal|!val+-2*!lastVal)\\n + !nbr\\n : ?nbr\\n & !val:?lastVal\\n & ~\\n )\\n )\\n | !nbr\\n )\\n& (M.1000)\\n (MCXI.1111)\\n (CMXI.911)\\n (MCM.1900)\\n (MCMXC.1990)\\n (MMVIII.2008)\\n (MMIX.2009)\\n (MCDXLIV.1444)\\n (MDCLXVI.1666)\\n (MMXII.2012)\\n : ?years\\n& (test=.out$(!arg unroman$!arg))\\n& ( !years\\n : ? (?L.?D) (?&test$!L&~)\\n | done\\n );\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nint digits[26] = { 0, 0, 100, 500, 0, 0, 0, 0, 1, 1, 0, 50, 1000, 0, 0, 0, 0, 0, 0, 0, 5, 5, 0, 10, 0, 0 };\\n\\n/* assuming ASCII, do upper case and get index in alphabet. could also be\\n inline int VALUE(char x) { return digits [ (~0x20 & x) - 'A' ]; }\\n if you think macros are evil */\\n#define VALUE(x) digits[(~0x20 & (x)) - 'A']\\n\\nint decode(const char * roman)\\n{\\n const char *bigger;\\n int current;\\n int arabic = 0;\\n while (*roman != '\\\\0') {\\n current = VALUE(*roman);\\n /* if (!current) return -1;\\n note: -1 can be used as error code; Romans didn't even have zero\\n */\\n bigger = roman;\\n\\n /* look for a larger digit, like IV or XM */\\n while (VALUE(*bigger) <= current && *++bigger != '\\\\0');\\n\\n if (*bigger == '\\\\0')\\n arabic += current;\\n else {\\n arabic += VALUE(*bigger);\\n while (roman < bigger)\\n arabic -= VALUE(* (roman++) );\\n }\\n\\n roman ++;\\n }\\n return arabic;\\n}\\n\\nint main()\\n{\\n const char * romans[] = { \\\"MCmxC\\\", \\\"MMVIII\\\", \\\"MDClXVI\\\", \\\"MCXLUJ\\\" };\\n int i;\\n\\n for (i = 0; i < 4; i++)\\n printf(\\\"%s\\\\t%d\\\\n\\\", romans[i], decode(romans[i]));\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <exception>\\n#include <string>\\n#include <iostream>\\nusing namespace std;\\n\\nnamespace Roman\\n{\\n\\tint ToInt(char c)\\n\\t{\\n\\t\\tswitch (c)\\n\\t\\t{\\n\\t\\t\\tcase 'I': return 1;\\n\\t\\t\\tcase 'V': return 5;\\n\\t\\t\\tcase 'X': return 10;\\n\\t\\t\\tcase 'L': return 50;\\n\\t\\t\\tcase 'C': return 100;\\n\\t\\t\\tcase 'D': return 500;\\n\\t\\t\\tcase 'M': return 1000;\\n\\t\\t}\\n\\t\\tthrow exception(\\\"Invalid character\\\");\\n\\t}\\n\\n\\tint ToInt(const string& s)\\n\\t{\\n\\t\\tint retval = 0, pvs = 0;\\n\\t\\tfor (auto pc = s.rbegin(); pc != s.rend(); ++pc)\\n\\t\\t{\\n\\t\\t\\tconst int inc = ToInt(*pc);\\n\\t\\t\\tretval += inc < pvs ? -inc : inc;\\n\\t\\t\\tpvs = inc;\\n\\t\\t}\\n\\t\\treturn retval;\\n\\t}\\n}\\n\\nint main(int argc, char* argv[])\\n{\\n\\ttry\\n\\t{\\n\\t\\tcout << \\\"MCMXC = \\\" << Roman::ToInt(\\\"MCMXC\\\") << \\\"\\\\n\\\";\\n\\t\\tcout << \\\"MMVIII = \\\" << Roman::ToInt(\\\"MMVIII\\\") << \\\"\\\\n\\\";\\n\\t\\tcout << \\\"MDCLXVI = \\\" << Roman::ToInt(\\\"MDCLXVI\\\") << \\\"\\\\n\\\";\\n\\t}\\n\\tcatch (exception& e)\\n\\t{\\n\\t\\tcerr << e.what();\\n\\t\\treturn -1;\\n\\t}\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\n\\nnamespace Roman\\n{\\n internal class Program\\n {\\n private static void Main(string[] args)\\n {\\n // Decode and print the numerals.\\n Console.WriteLine(\\\"{0}: {1}\\\", \\\"MCMXC\\\", Decode(\\\"MCMXC\\\"));\\n Console.WriteLine(\\\"{0}: {1}\\\", \\\"MMVIII\\\", Decode(\\\"MMVIII\\\"));\\n Console.WriteLine(\\\"{0}: {1}\\\", \\\"MDCLXVI\\\", Decode(\\\"MDCLXVI\\\"));\\n }\\n\\n // Dictionary to hold our numerals and their values.\\n private static readonly Dictionary<char, int> RomanDictionary = new Dictionary<char, int>\\n {\\n {'I', 1},\\n {'V', 5},\\n {'X', 10},\\n {'L', 50},\\n {'C', 100},\\n {'D', 500},\\n {'M', 1000}\\n };\\n\\n private static int Decode(string roman)\\n {\\n /* Make the input string upper-case,\\n * because the dictionary doesn't support lower-case characters. */\\n roman = roman.ToUpper();\\n\\n /* total = the current total value that will be returned.\\n * minus = value to subtract from next numeral. */\\n int total = 0, minus = 0;\\n\\n for (int i = 0; i < roman.Length; i++) // Iterate through characters.\\n {\\n // Get the value for the current numeral. Takes subtraction into account.\\n int thisNumeral = RomanDictionary[roman[i]] - minus;\\n\\n /* Checks if this is the last character in the string, or if the current numeral\\n * is greater than or equal to the next numeral. If so, we will reset our minus\\n * variable and add the current numeral to the total value. Otherwise, we will\\n * subtract the current numeral from the next numeral, and continue. */\\n if (i >= roman.Length - 1 ||\\n thisNumeral + minus >= RomanDictionary[roman[i + 1]])\\n {\\n total += thisNumeral;\\n minus = 0;\\n }\\n else\\n {\\n minus = thisNumeral;\\n }\\n }\\n\\n return total; // Return the total.\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"shared void run() {\\n\\t\\n\\tvalue numerals = map {\\n\\t\\t'I' -> 1,\\n\\t\\t'V' -> 5,\\n\\t\\t'X' -> 10,\\n\\t\\t'L' -> 50,\\n\\t\\t'C' -> 100,\\n\\t\\t'D' -> 500,\\n\\t\\t'M' -> 1000\\n\\t};\\n\\t\\n\\tfunction toHindu(String roman) {\\n\\t\\tvariable value total = 0;\\n\\t\\tfor(i->c in roman.indexed) {\\n\\t\\t\\tassert(exists currentValue = numerals[c]);\\n\\t\\t\\t/* Look at the next letter to see if we're looking\\n\\t\\t\\t at a IV or CM or whatever. If so subtract the\\n\\t\\t\\t current number from the total. */\\n\\t\\t\\tif(exists next = roman[i + 1],\\n\\t\\t\\t\\texists nextValue = numerals[next],\\n\\t\\t\\t\\tcurrentValue < nextValue) {\\n\\t\\t\\t\\ttotal -= currentValue;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\ttotal += currentValue;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn total;\\n\\t}\\n\\t\\n\\tassert(toHindu(\\\"I\\\") == 1);\\n\\tassert(toHindu(\\\"II\\\") == 2);\\n\\tassert(toHindu(\\\"IV\\\") == 4);\\n\\tassert(toHindu(\\\"MDCLXVI\\\") == 1666);\\n\\tassert(toHindu(\\\"MCMXC\\\") == 1990);\\n\\tassert(toHindu(\\\"MMVIII\\\") == 2008);\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"100 cls : rem 100 home for Applesoft BASIC\\n110 roman$ = \\\"MCMXCIX\\\" : print roman$,\\\"=> \\\"; : gosub 170 : print decimal '1999\\n120 roman$ = \\\"XXV\\\" : print roman$,\\\"=> \\\"; : gosub 170 : print decimal '25\\n130 roman$ = \\\"CMLIV\\\" : print roman$,\\\"=> \\\"; : gosub 170 : print decimal '954\\n140 roman$ = \\\"MMXI\\\" : print roman$,\\\"=> \\\"; : gosub 170 : print decimal '2011\\n150 end\\n160 rem Decode from roman\\n170 decimal = 0\\n180 predecimal = 0\\n190 for i = len(roman$) to 1 step -1\\n200 x$ = mid$(roman$,i,1)\\n210 if x$ = \\\"M\\\" then n = 1000 : goto 280\\n220 if x$ = \\\"D\\\" then n = 500 : goto 280\\n230 if x$ = \\\"C\\\" then n = 100 : goto 280\\n240 if x$ = \\\"L\\\" then n = 50 : goto 280\\n250 if x$ = \\\"X\\\" then n = 10 : goto 280\\n260 if x$ = \\\"V\\\" then n = 5 : goto 280\\n270 if x$ = \\\"I\\\" then n = 1\\n280 if n < predecimal then decimal = decimal-n\\n285 if n >= predecimal then decimal = decimal+n\\n290 predecimal = n\\n300 next i\\n310 return\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"100 cls\\n110 roman$ = \\\"MCMXCIX\\\" : print roman$,\\\"=> \\\"; : gosub 170 : print decimal '1999\\n120 roman$ = \\\"XXV\\\" : print roman$,\\\"=> \\\"; : gosub 170 : print decimal '25\\n130 roman$ = \\\"CMLIV\\\" : print roman$,\\\"=> \\\"; : gosub 170 : print decimal '954\\n140 roman$ = \\\"MMXI\\\" : print roman$,\\\"=> \\\"; : gosub 170 : print decimal '2011\\n150 end\\n160 rem Decode from roman\\n170 decimal = 0\\n180 predecimal = 0\\n190 for i = len(roman$) to 1 step -1\\n200 x$ = mid$(roman$,i,1)\\n210 select case x$\\n220 case \\\"M\\\" : n = 1000\\n230 case \\\"D\\\" : n = 500\\n240 case \\\"C\\\" : n = 100\\n250 case \\\"L\\\" : n = 50\\n260 case \\\"X\\\" : n = 10\\n270 case \\\"V\\\" : n = 5\\n280 case \\\"I\\\" : n = 1\\n290 case else : print \\\"not a roman numeral\\\" : end\\n300 end select\\n310 if n < predecimal then decimal = decimal-n else decimal = decimal+n\\n320 predecimal = n\\n330 next i\\n340 return\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \";; Incorporated some improvements from the alternative implementation below\\n(defn ro2ar [r]\\n (->> (reverse (.toUpperCase r))\\n (map {\\\\M 1000 \\\\D 500 \\\\C 100 \\\\L 50 \\\\X 10 \\\\V 5 \\\\I 1})\\n (partition-by identity)\\n (map (partial apply +))\\n (reduce #(if (< %1 %2) (+ %1 %2) (- %1 %2)))))\\n\\n;; alternative\\n(def numerals { \\\\I 1, \\\\V 5, \\\\X 10, \\\\L 50, \\\\C 100, \\\\D 500, \\\\M 1000})\\n(defn from-roman [s]\\n (->> s .toUpperCase\\n (map numerals)\\n (reduce (fn [[sum lastv] curr] [(+ sum curr (if (< lastv curr) (* -2 lastv) 0)) curr]) [0,0])\\n first))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"roman = cluster is decode\\n rep = null\\n\\n digit_value = proc (c: char) returns (int) signals (invalid)\\n if c < 'a' then c := char$i2c(char$c2i(c) + 32) end\\n if c = 'm' then return(1000)\\n elseif c = 'd' then return(500)\\n elseif c = 'c' then return(100)\\n elseif c = 'l' then return(50)\\n elseif c = 'x' then return(10)\\n elseif c = 'v' then return(5)\\n elseif c = 'i' then return(1)\\n else signal invalid\\n end\\n end digit_value\\n\\n decode = proc (s: string) returns (int) signals (invalid)\\n acc: int := 0\\n for i: int in int$from_to(1, string$size(s)) do\\n d: int := digit_value(s[i])\\n if i < string$size(s) cand d < digit_value(s[i+1]) then\\n acc := acc - d\\n else\\n acc := acc + d\\n end\\n end resignal invalid\\n return(acc)\\n end decode\\nend roman\\n\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n tests: array[string] := array[string]$\\n [\\\"MCMXC\\\", \\\"mdclxvi\\\", \\\"MmViI\\\", \\\"mmXXi\\\", \\\"INVALID\\\"]\\n\\n for test: string in array[string]$elements(tests) do\\n stream$puts(po, test || \\\": \\\")\\n stream$putl(po, int$unparse(roman$decode(test))) except when invalid:\\n stream$putl(po, \\\"not a valid Roman numeral!\\\")\\n end\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. UNROMAN.\\n DATA DIVISION.\\n WORKING-STORAGE SECTION.\\n 01 filler.\\n 03 i pic 9(02) comp.\\n 03 j pic 9(02) comp.\\n 03 k pic 9(02) comp.\\n 03 l pic 9(02) comp.\\n 01 inp-roman.\\n 03 inp-rom-ch pic x(01) occurs 20 times.\\n 01 inp-roman-digits.\\n 03 inp-rom-digit pic 9(01) occurs 20 times.\\n 01 ws-search-idx pic 9(02) comp.\\n 01 ws-tbl-table-def.\\n 03 filler pic x(05) value '1000M'.\\n 03 filler pic x(05) value '0500D'.\\n 03 filler pic x(05) value '0100C'.\\n 03 filler pic x(05) value '0050L'.\\n 03 filler pic x(05) value '0010X'.\\n 03 filler pic x(05) value '0005V'.\\n 03 filler pic x(05) value '0001I'.\\n 01 filler redefines ws-tbl-table-def.\\n 03 ws-tbl-roman occurs 07 times indexed by rx.\\n 05 ws-tbl-rom-val pic 9(04).\\n 05 ws-tbl-rom-ch pic x(01).\\n 01 ws-number pic s9(05) value 0.\\n 01 ws-number-pic pic zzzz9-.\\n\\n PROCEDURE DIVISION.\\n accept inp-roman\\n perform\\n until inp-roman = ' '\\n move zeroes to inp-roman-digits\\n perform\\n varying i from 1 by +1 until inp-rom-ch (i) = ' '\\n set rx to 1\\n search ws-tbl-roman\\n at end\\n move 0 to inp-rom-digit (i)\\n when ws-tbl-rom-ch (rx) = inp-rom-ch (i)\\n set inp-rom-digit (i) to rx\\n end-search\\n end-perform\\n compute l = i - 1\\n move 0 to ws-number\\n perform\\n varying i from 1 by +1\\n until i > l or inp-rom-digit (i) = 0\\n compute j = inp-rom-digit (i)\\n compute k = inp-rom-digit (i + 1)\\n if ws-tbl-rom-val (k)\\n > ws-tbl-rom-val (j)\\n compute ws-number\\n = ws-number\\n - ws-tbl-rom-val (j)\\n else\\n compute ws-number\\n = ws-number\\n + ws-tbl-rom-val (j)\\n end-if\\n end-perform\\n move ws-number to ws-number-pic\\n display '----------'\\n display 'roman=' inp-roman\\n display 'arabic=' ws-number-pic\\n if i < l or ws-number = 0\\n display 'invalid/incomplete roman numeral at pos 'i\\n ' found ' inp-rom-ch (i)\\n end-if\\n accept inp-roman\\n end-perform\\n stop run\\n .\\n END PROGRAM UNROMAN.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"roman_to_demical = (s) ->\\n # s is well-formed Roman Numeral >= I\\n numbers =\\n M: 1000\\n D: 500\\n C: 100\\n L: 50\\n X: 10\\n V: 5\\n I: 1\\n\\n result = 0\\n for c in s\\n num = numbers[c]\\n result += num\\n if old_num < num\\n # If old_num exists and is less than num, then\\n # we need to subtract it twice, once because we\\n # have already added it on the last pass, and twice\\n # to conform to the Roman convention that XC = 90,\\n # not 110.\\n result -= 2 * old_num\\n old_num = num\\n result\\n\\ntests =\\n IV: 4\\n XLII: 42\\n MCMXC: 1990\\n MMVIII: 2008\\n MDCLXVI: 1666\\n\\nfor roman, expected of tests\\n dec = roman_to_demical(roman)\\n console.log \\\"error\\\" if dec != expected\\n console.log \\\"#{roman} = #{dec}\\\"\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(defun mapcn (chars nums string)\\n (loop as char across string as i = (position char chars) collect (and i (nth i nums))))\\n\\n(defun parse-roman (R)\\n (loop with nums = (mapcn \\\"IVXLCDM\\\" '(1 5 10 50 100 500 1000) R)\\n as (A B) on nums if A sum (if (and B (< A B)) (- A) A)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(dolist (r '(\\\"MCMXC\\\" \\\"MDCLXVI\\\" \\\"MMVIII\\\"))\\n (format t \\\"~a:~10t~d~%\\\" r (parse-roman r)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\ninclude \\\"argv.coh\\\";\\n\\n# Decode the Roman numeral in the given string.\\n# Returns 0 if the string does not contain a valid Roman numeral.\\nsub romanToDecimal(str: [uint8]): (rslt: uint16) is\\n # Look up a Roman digit\\n sub digit(char: uint8): (val: uint16) is\\n # Definition of Roman numerals\\n record RomanDigit is\\n char: uint8;\\n value: uint16;\\n end record;\\n\\n var digits: RomanDigit[] := {\\n {'I',1}, {'V',5}, {'X',10}, {'L',50},\\n {'C',100}, {'D',500}, {'M',1000}\\n };\\n\\n char := char & ~32; # make uppercase\\n\\n # Look up given digit\\n var i: @indexof digits := 0;\\n while i < @sizeof digits loop\\n val := digits[i].value;\\n if digits[i].char == char then\\n return;\\n end if;\\n i := i + 1;\\n end loop;\\n val := 0;\\n end sub;\\n\\n rslt := 0;\\n while [str] != 0 loop\\n var cur := digit([str]); # get value of current digit\\n if cur == 0 then rslt := 0; return; end if; # stop when invalid\\n str := @next str;\\n if digit([str]) > cur then\\n # a digit followed by a larger digit should be subtracted from\\n # the total\\n rslt := rslt - cur;\\n else\\n rslt := rslt + cur;\\n end if;\\n end loop;\\nend sub;\\n\\n# Read a Roman numeral from the command line and print its output\\nArgvInit();\\nvar argmt := ArgvNext();\\nif argmt == (0 as [uint8]) then\\n # No argument\\n print(\\\"No argument\\\\n\\\");\\n ExitWithError();\\nend if;\\n\\nprint_i16(romanToDecimal(argmt));\\nprint_nl();\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"import std.regex, std.algorithm;\\n\\nint toArabic(in string s) /*pure nothrow*/ {\\n static immutable weights = [1000, 900, 500, 400, 100,\\n 90, 50, 40, 10, 9, 5, 4, 1];\\n static immutable symbols = [\\\"M\\\",\\\"CM\\\",\\\"D\\\",\\\"CD\\\",\\\"C\\\",\\\"XC\\\",\\n \\\"L\\\",\\\"XL\\\",\\\"X\\\",\\\"IX\\\",\\\"V\\\",\\\"IV\\\",\\\"I\\\"];\\n\\n int arabic;\\n foreach (m; s.matchAll(\\\"CM|CD|XC|XL|IX|IV|[MDCLXVI]\\\".regex))\\n arabic += weights[symbols.countUntil(m.hit)];\\n return arabic;\\n}\\n\\nvoid main() {\\n assert(\\\"MCMXC\\\".toArabic == 1990);\\n assert(\\\"MMVIII\\\".toArabic == 2008);\\n assert(\\\"MDCLXVI\\\".toArabic == 1666);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.regex, std.algorithm;\\n\\nimmutable uint[string] w2s;\\n\\npure nothrow static this() {\\n w2s = [\\\"IX\\\": 9, \\\"C\\\": 100, \\\"D\\\": 500, \\\"CM\\\": 900, \\\"I\\\": 1,\\n \\\"XC\\\": 90, \\\"M\\\": 1000, \\\"L\\\": 50, \\\"CD\\\": 400, \\\"XL\\\": 40,\\n \\\"V\\\": 5, \\\"X\\\": 10, \\\"IV\\\": 4];\\n}\\n\\nuint toArabic(in string s) /*pure nothrow*/ @safe /*@nogc*/ {\\n return s\\n .matchAll(\\\"CM|CD|XC|XL|IX|IV|[MDCLXVI]\\\".regex)\\n .map!(m => w2s[m.hit])\\n .sum;\\n}\\n\\nvoid main() {\\n assert(\\\"MCMXC\\\".toArabic == 1990);\\n assert(\\\"MMVIII\\\".toArabic == 2008);\\n assert(\\\"MDCLXVI\\\".toArabic == 1666);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program RomanNumeralsDecode;\\n\\n{$APPTYPE CONSOLE}\\n\\nfunction RomanToInteger(const aRoman: string): Integer;\\n function DecodeRomanDigit(aChar: Char): Integer;\\n begin\\n case aChar of\\n 'M', 'm': Result := 1000;\\n 'D', 'd': Result := 500;\\n 'C', 'c': Result := 100;\\n 'L', 'l': Result := 50;\\n 'X', 'x': Result := 10;\\n 'V', 'v': Result := 5;\\n 'I', 'i': Result := 1\\n else\\n Result := 0;\\n end;\\n end;\\n\\nvar\\n i: Integer;\\n lCurrVal: Integer;\\n lLastVal: Integer;\\nbegin\\n Result := 0;\\n\\n lLastVal := 0;\\n for i := Length(aRoman) downto 1 do\\n begin\\n lCurrVal := DecodeRomanDigit(aRoman[i]);\\n if lCurrVal < lLastVal then\\n Result := Result - lCurrVal\\n else\\n Result := Result + lCurrVal;\\n lLastVal := lCurrVal;\\n end;\\nend;\\n\\nbegin\\n Writeln(RomanToInteger('MCMXC')); // 1990\\n Writeln(RomanToInteger('MMVIII')); // 2008\\n Writeln(RomanToInteger('MDCLXVI')); // 1666\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"func rom2dec rom$ .\\n symbols$[] = [ \\\"M\\\" \\\"D\\\" \\\"C\\\" \\\"L\\\" \\\"X\\\" \\\"V\\\" \\\"I\\\" ]\\n values[] = [ 1000 500 100 50 10 5 1 ]\\n val = 0\\n for dig$ in strchars rom$\\n for i = 1 to len symbols$[]\\n if symbols$[i] = dig$\\n v = values[i]\\n .\\n .\\n val += v\\n if oldv < v\\n val -= 2 * oldv\\n .\\n oldv = v\\n .\\n return val\\n.\\nprint rom2dec \\\"MCMXC\\\"\\nprint rom2dec \\\"MMVIII\\\"\\nprint rom2dec \\\"MDCLXVI\\\"\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"MapChar(STRING1 c) := CASE(c,'M'=>1000,'D'=>500,'C'=>100,'L'=>50,'X'=>10,'V'=>5,'I'=>1,0);\\n\\nRomanDecode(STRING s) := FUNCTION\\n dsS := DATASET([{s}],{STRING Inp});\\n R := { INTEGER2 i; };\\n\\n R Trans1(dsS le,INTEGER pos) := TRANSFORM\\n SELF.i := MapChar(le.Inp[pos]) * IF ( MapChar(le.Inp[pos]) < MapChar(le.Inp[pos+1]), -1, 1 );\\n END;\\n\\n RETURN SUM(NORMALIZE(dsS,LENGTH(TRIM(s)),Trans1(LEFT,COUNTER)),i);\\nEND;\\n\\nRomanDecode('MCMLIV'); //1954\\nRomanDecode('MCMXC'); //1990\\nRomanDecode('MMVIII'); //2008\\nRomanDecode('MDCLXVI'); //1666\\nRomanDecode('MDLXVI'); //1566\\n\",\n \"language\": \"ECL\"\n },\n {\n \"code\": \"IMPORT STD;\\nRomanDecode(STRING s) := FUNCTION\\n SetWeights := [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1];\\n SetSymbols := ['M', 'CM', 'D', 'CD', 'C', 'XC', 'L', 'XL', 'X', 'IX', 'V', 'IV', 'I'];\\n ProcessRec := RECORD\\n UNSIGNED val;\\n STRING Roman;\\n END;\\n dsSymbols := DATASET(13,TRANSFORM(ProcessRec,SELF.Roman := s, SELF := []));\\n\\t\\n RECORDOF(dsSymbols) XF(dsSymbols L, dsSymbols R, INTEGER C) := TRANSFORM\\n ThisRoman := IF(C=1,R.Roman,L.Roman);\\n IsDone := ThisRoman = '';\\n Repeatable := C IN [1,5,9,13];\\n SymSize := IF(C % 2 = 0, 2, 1);\\n IsNext := STD.Str.StartsWith(ThisRoman,SetSymbols[C]);\\n SymLen := IF(IsNext,\\n IF(NOT Repeatable,\\n SymSize,\\n MAP(NOT IsDone AND ThisRoman[1] = ThisRoman[2] AND ThisRoman[1] = ThisRoman[3] => 3,\\n NOT IsDone AND ThisRoman[1] = ThisRoman[2] => 2,\\n NOT IsDone => 1,\\n 0)),\\n 0);\\n\\n SymbolWeight(STRING s) := IF(NOT Repeatable,\\n SetWeights[C],\\n CHOOSE(LENGTH(s),SetWeights[C],SetWeights[C]*2,SetWeights[C]*3,0));\\n\\n SELF.Roman := IF(IsDone,ThisRoman,ThisRoman[SymLen+1..]);\\n SELF.val := IF(IsDone,L.val,L.Val + IF(IsNext,SymbolWeight(ThisRoman[1..SymLen]),0));\\n END;\\n i := ITERATE(dsSymbols,XF(LEFT,RIGHT,COUNTER));\\n RETURN i[13].val;\\nEND;\\n\\nRomanDecode('MCMLIV'); //1954\\nRomanDecode('MCMXC'); //1990\\nRomanDecode('MMVIII'); //2008\\nRomanDecode('MDCLXVI'); //1666\\nRomanDecode('MDLXVI'); //1566\\n\",\n \"language\": \"ECL\"\n },\n {\n \"code\": \"class\\n\\tAPPLICATION\\n\\ncreate\\n\\tmake\\n\\nfeature {NONE} -- Initialization\\n\\n\\tmake\\n\\t\\tlocal\\n\\t\\t\\tnumbers: ARRAY [STRING]\\n\\t\\tdo\\n\\t\\t\\tnumbers := <<\\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MDCLXVI\\\",\\n\\t\\t\\t -- 1990 2008 1666\\n\\t\\t\\t \\\"MMMCLIX\\\", \\\"MCMLXXVII\\\", \\\"MMX\\\">>\\n\\t\\t\\t -- 3159 1977 2010\\n\\t\\t\\tacross numbers as n loop\\n\\t\\t\\t\\tprint (n.item +\\n \\\" in Roman numerals is \\\" +\\n\\t\\t\\t\\t roman_to_decimal (n.item).out +\\n \\\" in decimal Arabic numerals.\\\")\\n\\t\\t\\t\\tprint (\\\"%N\\\")\\n\\t\\t\\tend\\n\\t\\tend\\n\\nfeature -- Roman numerals\\n\\n\\troman_to_decimal (a_str: STRING): INTEGER\\n\\t\\t-- Decimal representation of Roman numeral `a_str'\\n\\t\\trequire\\n\\t\\t\\tis_roman (a_str)\\n\\t\\tlocal\\n\\t\\t\\tl_pos: INTEGER\\n\\t\\t\\tcur: INTEGER -- Value of the digit read in the current iteration\\n\\t\\t\\tprev: INTEGER -- Value of the digit read in the previous iteration\\n\\t\\tdo\\n\\t\\t\\tfrom\\n\\t\\t\\t\\tl_pos := 0\\n\\t\\t\\t\\tResult := 0\\n\\t\\t\\t\\tprev := 1 + max_digit_value\\n\\t\\t\\tuntil\\n\\t\\t\\t\\tl_pos = a_str.count\\n\\t\\t\\tloop\\n\\t\\t\\t\\tl_pos := l_pos + 1\\n\\t\\t\\t\\tcur := roman_digit_to_decimal (a_str.at (l_pos))\\n\\t\\t\\t\\tif cur <= prev then\\n\\t\\t\\t\\t\\t-- Add nonincreasing digit\\n\\t\\t\\t\\t\\tResult := Result + cur\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t-- Subtract previous digit from increasing digit\\n\\t\\t\\t\\t\\tResult := Result - prev + (cur - prev)\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tprev := cur\\n\\t\\t\\tend\\n\\t\\tensure\\n\\t\\t\\tResult >= 0\\n\\t\\tend\\n\\n\\tis_roman (a_string: STRING): BOOLEAN\\n\\t\\t-- Is `a_string' a valid sequence of Roman digits?\\n\\t\\tdo\\n\\t\\t\\tResult := across a_string as c all is_roman_digit (c.item) end\\n\\t\\tend\\n\\nfeature {NONE} -- Implementation\\n\\n\\tmax_digit_value: INTEGER = 1000\\n\\n\\tis_roman_digit (a_char: CHARACTER): BOOLEAN\\n\\t\\t-- Is `a_char' a valid Roman digit?\\n\\t\\tlocal\\n\\t\\t\\tl_char: CHARACTER\\n\\t\\tdo\\n\\t\\t\\tl_char := a_char.as_upper\\n\\t\\t\\tinspect l_char\\n\\t\\t\\t\\twhen 'I', 'V', 'X', 'L', 'C', 'D', 'M' then\\n\\t\\t\\t\\t\\tResult := True\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tResult := False\\n\\t\\t\\tend\\n\\t\\tend\\n\\n\\troman_digit_to_decimal (a_char: CHARACTER): INTEGER\\n\\t\\t-- Decimal representation of Roman digit `a_char'\\n\\t\\trequire\\n\\t\\t\\tis_roman_digit (a_char)\\n\\t\\tlocal\\n\\t\\t\\tl_char: CHARACTER\\n\\t\\tdo\\n\\t\\t\\tl_char := a_char.as_upper\\n\\t\\t\\tinspect l_char\\n\\t\\t\\t\\twhen 'I' then\\n\\t\\t\\t\\t\\tResult := 1\\n\\t\\t\\t\\twhen 'V' then\\n\\t\\t\\t\\t\\tResult := 5\\n\\t\\t\\t\\twhen 'X' then\\n\\t\\t\\t\\t\\tResult := 10\\n\\t\\t\\t\\twhen 'L' then\\n\\t\\t\\t\\t\\tResult := 50\\n\\t\\t\\t\\twhen 'C' then\\n\\t\\t\\t\\t\\tResult := 100\\n\\t\\t\\t\\twhen 'D' then\\n\\t\\t\\t\\t\\tResult := 500\\n\\t\\t\\t\\twhen 'M' then\\n\\t\\t\\t\\t\\tResult := 1000\\n\\t\\t\\tend\\n\\t\\tensure\\n\\t\\t\\tResult > 0\\n\\t\\tend\\n\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"import extensions;\\nimport system'collections;\\nimport system'routines;\\nimport system'culture;\\n\\nstatic RomanDictionary = Dictionary.new()\\n .setAt(\\\"I\\\".toChar(), 1)\\n .setAt(\\\"V\\\".toChar(), 5)\\n .setAt(\\\"X\\\".toChar(), 10)\\n .setAt(\\\"L\\\".toChar(), 50)\\n .setAt(\\\"C\\\".toChar(), 100)\\n .setAt(\\\"D\\\".toChar(), 500)\\n .setAt(\\\"M\\\".toChar(), 1000);\\n\\nextension op : String\\n{\\n toRomanInt()\\n {\\n var minus := 0;\\n var s := self.toUpper();\\n var total := 0;\\n\\n for(int i := 0; i < s.Length; i += 1)\\n {\\n var thisNumeral := RomanDictionary[s[i]] - minus;\\n if (i >= s.Length - 1 || thisNumeral + minus >= RomanDictionary[s[i + 1]])\\n {\\n total += thisNumeral;\\n minus := 0\\n }\\n else\\n {\\n minus := thisNumeral\\n }\\n };\\n\\n ^ total\\n }\\n}\\n\\npublic program()\\n{\\n console.printLine(\\\"MCMXC: \\\", \\\"MCMXC\\\".toRomanInt());\\n console.printLine(\\\"MMVIII: \\\", \\\"MMVIII\\\".toRomanInt());\\n console.printLine(\\\"MDCLXVI:\\\", \\\"MDCLXVI\\\".toRomanInt())\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"defmodule Roman_numeral do\\n def decode([]), do: 0\\n def decode([x]), do: to_value(x)\\n def decode([h1, h2 | rest]) do\\n case {to_value(h1), to_value(h2)} do\\n {v1, v2} when v1 < v2 -> v2 - v1 + decode(rest)\\n {v1, _} -> v1 + decode([h2 | rest])\\n end\\n end\\n\\n defp to_value(?M), do: 1000\\n defp to_value(?D), do: 500\\n defp to_value(?C), do: 100\\n defp to_value(?L), do: 50\\n defp to_value(?X), do: 10\\n defp to_value(?V), do: 5\\n defp to_value(?I), do: 1\\nend\\n\\nEnum.each(['MCMXC', 'MMVIII', 'MDCLXVI', 'IIIID'], fn clist ->\\n IO.puts \\\"#{clist}\\\\t: #{Roman_numeral.decode(clist)}\\\"\\nend)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"(defun ro2ar (RN)\\n \\\"Translate a roman number RN into arabic number.\\n Its argument RN is wether a symbol, wether a list.\\n Returns the arabic number. (ro2ar 'C) gives 100,\\n (ro2ar '(X X I V)) gives 24\\\"\\n (cond\\n ((eq RN 'M) 1000)\\n ((eq RN 'D) 500)\\n ((eq RN 'C) 100)\\n ((eq RN 'L) 50)\\n ((eq RN 'X) 10)\\n ((eq RN 'V) 5)\\n ((eq RN 'I) 1)\\n ((null (cdr RN)) (ro2ar (car RN))) ;; stop recursion\\n ((< (ro2ar (car RN)) (ro2ar (car (cdr RN)))) (- (ro2ar (cdr RN)) (ro2ar (car RN)))) ;; \\\"IV\\\" -> 5-1=4\\n (t (+ (ro2ar (car RN)) (ro2ar (cdr RN)))))) ;; \\\"VI\\\" -> 5+1=6\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"-module( roman_numerals ).\\n\\n-export( [decode_from_string/1]).\\n\\nto_value($M) -> 1000;\\nto_value($D) -> 500;\\nto_value($C) -> 100;\\nto_value($L) -> 50;\\nto_value($X) -> 10;\\nto_value($V) -> 5;\\nto_value($I) -> 1.\\n\\ndecode_from_string([]) -> 0;\\ndecode_from_string([H1]) -> to_value(H1);\\ndecode_from_string([H1, H2 |Rest]) ->\\n case {to_value(H1), to_value(H2)} of\\n {V1, V2} when V1 < V2 -> V2 - V1 + decode_from_string(Rest);\\n {V1, V1} -> V1 + V1 + decode_from_string(Rest);\\n {V1, _} -> V1 + decode_from_string([H2|Rest])\\n end.\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"PROGRAM ROMAN2ARAB\\n\\nDIM R%[7]\\n\\nPROCEDURE TOARAB(ROMAN$->ANS%)\\n LOCAL I%,J%,P%,N%\\n FOR I%=LEN(ROMAN$) TO 1 STEP -1 DO\\n J%=INSTR(\\\"IVXLCDM\\\",MID$(ROMAN$,I%,1))\\n IF J%=0 THEN\\n ANS%=-9999 ! illegal character\\n EXIT PROCEDURE\\n END IF\\n IF J%>=P% THEN\\n N%+=R%[J%]\\n ELSE\\n N%-=R%[J%]\\n END IF\\n P%=J%\\n END FOR\\n ANS%=N%\\nEND PROCEDURE\\n\\nBEGIN\\n R%[]=(0,1,5,10,50,100,500,1000)\\n TOARAB(\\\"MCMXCIX\\\"->ANS%) PRINT(ANS%)\\n TOARAB(\\\"MMXII\\\"->ANS%) PRINT(ANS%)\\n TOARAB(\\\"MDCLXVI\\\"->ANS%) PRINT(ANS%)\\n TOARAB(\\\"MMMDCCCLXXXVIII\\\"->ANS%) PRINT(ANS%)\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"constant symbols = \\\"MDCLXVI\\\", weights = {1000,500,100,50,10,5,1}\\nfunction romanDec(sequence roman)\\n integer n, lastval, arabic\\n lastval = 0\\n arabic = 0\\n for i = length(roman) to 1 by -1 do\\n n = find(roman[i],symbols)\\n if n then\\n n = weights[n]\\n end if\\n if n < lastval then\\n arabic -= n\\n else\\n arabic += n\\n end if\\n lastval = n\\n end for\\n return arabic\\nend function\\n\\n? romanDec(\\\"MCMXCIX\\\")\\n? romanDec(\\\"MDCLXVI\\\")\\n? romanDec(\\\"XXV\\\")\\n? romanDec(\\\"CMLIV\\\")\\n? romanDec(\\\"MMXI\\\")\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"let decimal_of_roman roman =\\n let rec convert arabic lastval = function\\n | head::tail ->\\n let n = match head with\\n | 'M' | 'm' -> 1000\\n | 'D' | 'd' -> 500\\n | 'C' | 'c' -> 100\\n | 'L' | 'l' -> 50\\n | 'X' | 'x' -> 10\\n | 'V' | 'v' -> 5\\n | 'I' | 'i' -> 1\\n | _ -> 0\\n let op = if n > lastval then (-) else (+)\\n convert (op arabic lastval) n tail\\n | _ -> arabic + lastval\\n convert 0 0 (Seq.toList roman)\\n;;\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"let decimal_of_roman roman =\\n let convert (arabic,lastval) c =\\n let n = match c with\\n | 'M' | 'm' -> 1000\\n | 'D' | 'd' -> 500\\n | 'C' | 'c' -> 100\\n | 'L' | 'l' -> 50\\n | 'X' | 'x' -> 10\\n | 'V' | 'v' -> 5\\n | 'I' | 'i' -> 1\\n | _ -> 0\\n let op = if n > lastval then (-) else (+)\\n (op arabic lastval, n)\\n let (arabic, lastval) = Seq.fold convert (0,0) roman\\n arabic + lastval\\n;;\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"let tests = [\\\"MCMXC\\\"; \\\"MMVIII\\\"; \\\"MDCLXVII\\\"; \\\"MMMCLIX\\\"; \\\"MCMLXXVII\\\"; \\\"MMX\\\"]\\nfor test in tests do Printf.printf \\\"%s: %d\\\\n\\\" test (decimal_of_roman test)\\n;;\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USE: roman\\n( scratchpad ) \\\"MMMCCCXXXIII\\\" roman> .\\n3333\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"CONSTANT: roman-digits\\n { \\\"m\\\" \\\"cm\\\" \\\"d\\\" \\\"cd\\\" \\\"c\\\" \\\"xc\\\" \\\"l\\\" \\\"xl\\\" \\\"x\\\" \\\"ix\\\" \\\"v\\\" \\\"iv\\\" \\\"i\\\" }\\n\\nCONSTANT: roman-values\\n { 1000 900 500 400 100 90 50 40 10 9 5 4 1 }\\n\\n: roman> ( str -- n )\\n >lower [ roman-digit>= ] monotonic-split\\n [ roman-value ] map-sum ;\\n\\n: roman-digit>= ( ch1 ch2 -- ? ) [ roman-digit-index ] bi@ >= ;\\n\\n: roman-digit-index ( ch -- n ) 1string roman-digits index ;\\n\\n: roman-value (seq -- n )\\n [ [ roman-digit-value ] map ] [ all-eq? ] bi\\n [ sum ] [ first2 swap - ] if ;\\n\\n: roman-digit-value ( ch -- n )\\n roman-digit-index roman-values nth ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"[ 32| {get value of Roman digit on stack}\\n $'m= $[\\\\% 1000\\\\]? ~[\\n $'d= $[\\\\% 500\\\\]? ~[\\n $'c= $[\\\\% 100\\\\]? ~[\\n $'l= $[\\\\% 50\\\\]? ~[\\n $'x= $[\\\\% 10\\\\]? ~[\\n $'v= $[\\\\% 5\\\\]? ~[\\n $'i= $[\\\\% 1\\\\]? ~[\\n % 0\\n ]?]?]?]?]?]?]?\\n]r:\\n\\n0 {accumulator}\\n^r;! {read first Roman digit}\\n[^r;!$][ {read another, and as long as it is valid...}\\n \\\\$@@\\\\$@@ {copy previous and current}\\n \\\\>[\\\\_\\\\]? {if previous smaller than current, negate previous}\\n @@+\\\\ {add previous to accumulator}\\n]#\\n%+. {add final digit to accumulator and output}\\n10, {and a newline}\\n\",\n \"language\": \"FALSE\"\n },\n {\n \"code\": \"create (arabic)\\n 1000 128 * char M + ,\\n 500 128 * char D + ,\\n 100 128 * char C + ,\\n 50 128 * char L + ,\\n 10 128 * char X + ,\\n 5 128 * char V + ,\\n 1 128 * char I + ,\\ndoes>\\n 7 cells bounds do\\n i @ over over 127 and = if nip 7 rshift leave else drop then\\n 1 cells +loop dup\\n;\\n\\n: >arabic\\n 0 dup >r >r\\n begin\\n over over\\n while\\n c@ dup (arabic) rot <>\\n while\\n r> over r> over over > if 2* negate + else drop then + swap >r >r 1 /string\\n repeat then drop 2drop r> r> drop\\n;\\n\\ns\\\" MCMLXXXIV\\\" >arabic .\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"\\\\ decode roman numerals using Forth methodology\\n\\\\ create words to describe and solve the problem\\n\\\\ ANS/ISO Forth\\n\\n\\\\ state holders\\nVARIABLE OLDNDX\\nVARIABLE CURNDX\\nVARIABLE NEGFLAG\\n\\nDECIMAL\\nCREATE VALUES ( -- addr) 0 , 1 , 5 , 10 , 50 , 100 , 500 , 1000 ,\\n\\n: NUMERALS ( -- addr len) S\\\" IVXLCDM\\\" ; \\\\ 1st char is a blank\\n: [] ( n addr -- addr') SWAP CELLS + ; \\\\ array address calc.\\n: INIT ( -- ) CURNDX OFF OLDNDX OFF NEGFLAG OFF ;\\n: REMEMBER ( ndx -- ndx ) CURNDX @ OLDNDX ! DUP CURNDX ! ;\\n: ]VALUE@ ( ndx -- n ) REMEMBER VALUES [] @ ;\\nHEX\\n: TOUPPER ( char -- char ) 05F AND ;\\n\\nDECIMAL\\n: >INDEX ( char -- ndx) TOUPPER >R NUMERALS TUCK R> SCAN NIP -\\n DUP 7 > ABORT\\\" Invalid Roman numeral\\\" ;\\n\\n: >VALUE ( char -- n ) >INDEX ]VALUE@ ;\\n: ?ILLEGAL ( ndx -- ) CURNDX @ OLDNDX @ = NEGFLAG @ AND ABORT\\\" Illegal format\\\" ;\\n\\n: ?NEGATE ( n -- +n | -n) \\\\ conditional NEGATE\\n CURNDX @ OLDNDX @ <\\n IF NEGFLAG ON NEGATE\\n ELSE ?ILLEGAL NEGFLAG OFF\\n THEN ;\\n\\n: >ARABIC ( addr len -- n )\\n INIT\\n 0 -ROT \\\\ accumulator under the stack string args\\n 1- BOUNDS \\\\ convert addr len to two addresses\\n SWAP DO \\\\ index the string from back to front\\n I C@ >VALUE ?NEGATE +\\n -1 +LOOP ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"program Roman_decode\\n implicit none\\n\\n write(*,*) decode(\\\"MCMXC\\\"), decode(\\\"MMVIII\\\"), decode(\\\"MDCLXVI\\\")\\n\\ncontains\\n\\nfunction decode(roman) result(arabic)\\n character(*), intent(in) :: roman\\n integer :: i, n, lastval, arabic\\n\\n arabic = 0\\n lastval = 0\\n do i = len(roman), 1, -1\\n select case(roman(i:i))\\n case ('M','m')\\n n = 1000\\n case ('D','d')\\n n = 500\\n case ('C','c')\\n n = 100\\n case ('L','l')\\n n = 50\\n case ('X','x')\\n n = 10\\n case ('V','v')\\n n = 5\\n case ('I','i')\\n n = 1\\n case default\\n n = 0\\n end select\\n if (n < lastval) then\\n arabic = arabic - n\\n else\\n arabic = arabic + n\\n end if\\n lastval = n\\n end do\\nend function decode\\nend program Roman_decode\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nFunction romanDecode(roman As Const String) As Integer\\n If roman = \\\"\\\" Then Return 0 '' zero denotes invalid roman number\\n Dim roman1(0 To 2) As String = {\\\"MMM\\\", \\\"MM\\\", \\\"M\\\"}\\n Dim roman2(0 To 8) As String = {\\\"CM\\\", \\\"DCCC\\\", \\\"DCC\\\", \\\"DC\\\", \\\"D\\\", \\\"CD\\\", \\\"CCC\\\", \\\"CC\\\", \\\"C\\\"}\\n Dim roman3(0 To 8) As String = {\\\"XC\\\", \\\"LXXX\\\", \\\"LXX\\\", \\\"LX\\\", \\\"L\\\", \\\"XL\\\", \\\"XXX\\\", \\\"XX\\\", \\\"X\\\"}\\n Dim roman4(0 To 8) As String = {\\\"IX\\\", \\\"VIII\\\", \\\"VII\\\", \\\"VI\\\", \\\"V\\\", \\\"IV\\\", \\\"III\\\", \\\"II\\\", \\\"I\\\"}\\n Dim As Integer i, value = 0, length = 0\\n Dim r As String = UCase(roman)\\n\\n For i = 0 To 2\\n If Left(r, Len(roman1(i))) = roman1(i) Then\\n value += 1000 * (3 - i)\\n length = Len(roman1(i))\\n r = Mid(r, length + 1)\\n length = 0\\n Exit For\\n End If\\n Next\\n\\n For i = 0 To 8\\n If Left(r, Len(roman2(i))) = roman2(i) Then\\n value += 100 * (9 - i)\\n length = Len(roman2(i))\\n r = Mid(r, length + 1)\\n length = 0\\n Exit For\\n End If\\n Next\\n\\n For i = 0 To 8\\n If Left(r, Len(roman3(i))) = roman3(i) Then\\n value += 10 * (9 - i)\\n length = Len(roman3(i))\\n r = Mid(r, length + 1)\\n length = 0\\n Exit For\\n End If\\n Next\\n\\n For i = 0 To 8\\n If Left(r, Len(roman4(i))) = roman4(i) Then\\n value += 9 - i\\n length = Len(roman4(i))\\n Exit For\\n End If\\n Next\\n\\n ' Can't be a valid roman number if there are any characters left\\n If Len(r) > length Then Return 0\\n Return value\\nEnd Function\\n\\nDim a(2) As String = {\\\"MCMXC\\\", \\\"MMVIII\\\" , \\\"MDCLXVI\\\"}\\nFor i As Integer = 0 To 2\\n Print a(i); Tab(8); \\\" =>\\\"; romanDecode(a(i))\\nNext\\n\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"window 1\\n\\nlocal fn RomantoDecimal( roman as CFStringRef ) as long\\n long i, n, preNum = 0, num = 0\\n\\n for i = len(roman) - 1 to 0 step -1\\n n = 0\\n select ( fn StringCharacterAtIndex( roman, i ) )\\n case _\\\"M\\\" : n = 1000\\n case _\\\"D\\\" : n = 500\\n case _\\\"C\\\" : n = 100\\n case _\\\"L\\\" : n = 50\\n case _\\\"X\\\" : n = 10\\n case _\\\"V\\\" : n = 5\\n case _\\\"I\\\" : n = 1\\n end select\\n if ( n < preNum ) then num = num - n else num = num + n\\n preNum = n\\n next\\n\\nend fn = num\\n\\nprint @\\\" MCMXC = \\\"; fn RomantoDecimal( @\\\"MCMXC\\\" )\\nprint @\\\" MMVIII = \\\"; fn RomantoDecimal( @\\\"MMVIII\\\" )\\nprint @\\\" MMXVI = \\\"; fn RomantoDecimal( @\\\"MMXVI\\\" )\\nprint @\\\"MDCLXVI = \\\"; fn RomantoDecimal( @\\\"MDCLXVI\\\" )\\nprint @\\\" MCMXIV = \\\"; fn RomantoDecimal( @\\\"MCMXIV\\\" )\\nprint @\\\" DXIII = \\\"; fn RomantoDecimal( @\\\"DXIII\\\" )\\nprint @\\\" M = \\\"; fn RomantoDecimal( @\\\"M\\\" )\\nprint @\\\" DXIII = \\\"; fn RomantoDecimal( @\\\"DXIII\\\" )\\nprint @\\\" XXXIII = \\\"; fn RomantoDecimal( @\\\"XXXIII\\\" )\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"'This code will create a GUI Form and Objects and carry out the Roman Numeral convertion as you type\\n'The input is case insensitive\\n'A basic check for invalid charaters is made\\n\\nhTextBox As TextBox 'To allow the creation of a TextBox\\nhValueBox As ValueBox 'To allow the creation of a ValueBox\\n\\nPublic Sub Form_Open() 'Form opens..\\n\\nSetUpForm 'Go to the SetUpForm Routine\\nhTextBox.text = \\\"MCMXC\\\" 'Put a Roman numeral in the TextBox\\n\\nEnd\\n\\nPublic Sub TextBoxInput_Change() 'Each time the TextBox text changes..\\nDim cRomanN As Collection = [\\\"M\\\": 1000, \\\"D\\\": 500, \\\"C\\\": 100, \\\"L\\\": 50, \\\"X\\\": 10, \\\"V\\\": 5, \\\"I\\\": 1] 'Collection of nemerals e.g 'M' = 1000\\nDim cMinus As Collection = [\\\"IV\\\": -2, \\\"IX\\\": -2, \\\"XL\\\": -20, \\\"XC\\\": - 20, \\\"CD\\\": -200, \\\"CM\\\": -200] 'Collection of the 'one less than' numbers e.g. 'IV' = 4\\nDim sClean, sTemp As String 'Various string variables\\nDim siCount As Short 'Counter\\nDim iTotal As Integer 'Stores the total of the calculation\\n\\nhTextBox.Text = UCase(hTextBox.Text) 'Make any text in the TextBox upper case\\n\\nFor siCount = 1 To Len(hTextBox.Text) 'Loop through each character in the TextBox\\n If InStr(\\\"MDCLXVI\\\", Mid(hTextBox.Text, siCount, 1)) Then 'If a Roman numeral exists then..\\n sClean &= Mid(hTextBox.Text, siCount, 1) 'Put it in 'sClean' (Stops input of non Roman numerals)\\n End If\\nNext\\n\\nhTextBox.Text = sClean 'Put the now clean text in the TextBox\\n\\nFor siCount = 1 To Len(hTextBox.Text) 'Loop through each character in the TextBox\\n iTotal += cRomanN[Mid(hTextBox.Text, siCount, 1)] 'Total up all the characters, note 'IX' will = 11 not 9\\nNext\\n\\nFor Each sTemp In cMinus 'Loop through each item in the cMinus Collection\\n If InStr(sClean, cMinus.Key) > 0 Then iTotal += Val(sTemp) 'If a 'Minus' value is in the string e.g. 'IX' which has been calculated at 11 subtract 2 = 9\\nNext\\n\\nhValueBox.text = iTotal 'Display the total\\n\\nEnd\\n\\nPublic Sub SetUpForm() 'Create the Objects for the Form\\nDim hLabel1, hLabel2 As Label 'For 2 Labels\\n\\nMe.height = 150 'Form Height\\nMe.Width = 300 'Form Width\\nMe.Padding = 20 'Form padding (border)\\nMe.Text = \\\"Roman Numeral converter\\\" 'Text in Form header\\nMe.Arrangement = Arrange.Vertical 'Form arrangement\\n\\nhLabel1 = New Label(Me) 'Create a Label\\nhLabel1.Height = 21 'Label Height\\nhLabel1.expand = True 'Expand the Label\\nhLabel1.Text = \\\"Enter a Roman numeral\\\" 'Put text in the Label\\n\\nhTextBox = New TextBox(Me) As \\\"TextBoxInput\\\" 'Set up a TextBox with an Event Label\\nhTextBox.Height = 21 'TextBox height\\nhTextBox.expand = True 'Expand the TextBox\\n\\nhLabel2 = New Label(Me) 'Create a Label\\nhLabel2.Height = 21 'Label Height\\nhLabel2.expand = True 'Expand the Label\\nhLabel2.Text = \\\"The decimal equivelent is: -\\\" 'Put text in the Label\\n\\nhValueBox = New ValueBox(Me) 'Create a ValueBox\\nhValueBox.Height = 21 'ValuBox Height\\nhValueBox.expand = True 'Expand the ValueBox\\nhValueBox.ReadOnly = True 'Set ValueBox to Read Only\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"errors\\\"\\n \\\"fmt\\\"\\n)\\n\\nvar m = map[rune]int{\\n 'I': 1,\\n 'V': 5,\\n 'X': 10,\\n 'L': 50,\\n 'C': 100,\\n 'D': 500,\\n 'M': 1000,\\n}\\n\\nfunc parseRoman(s string) (r int, err error) {\\n if s == \\\"\\\" {\\n return 0, errors.New(\\\"Empty string\\\")\\n }\\n is := []rune(s) // easier to convert string up front\\n var c0 rune // c0: roman character last read\\n var cv0 int // cv0: value of cv\\n\\n // the key to the algorithm is to process digits from right to left\\n for i := len(is) - 1; i >= 0; i-- {\\n // read roman digit\\n c := is[i]\\n k := c == '\\\\u0305' // unicode overbar combining character\\n if k {\\n if i == 0 {\\n return 0, errors.New(\\n \\\"Overbar combining character invalid at position 0\\\")\\n }\\n i--\\n c = is[i]\\n }\\n cv := m[c]\\n if cv == 0 {\\n if c == 0x0305 {\\n return 0, fmt.Errorf(\\n \\\"Overbar combining character invalid at position %d\\\", i)\\n } else {\\n return 0, fmt.Errorf(\\n \\\"Character unrecognized as Roman digit: %c\\\", c)\\n }\\n }\\n if k {\\n c = -c // convention indicating overbar\\n cv *= 1000\\n }\\n\\n // handle cases of new, same, subtractive, changed, in that order.\\n switch {\\n default: // case 4: digit change\\n fallthrough\\n case c0 == 0: // case 1: no previous digit\\n c0 = c\\n cv0 = cv\\n case c == c0: // case 2: same digit\\n case cv*5 == cv0 || cv*10 == cv0: // case 3: subtractive\\n // handle next digit as new.\\n // a subtractive digit doesn't count as a previous digit.\\n c0 = 0\\n r -= cv // subtract...\\n continue // ...instead of adding\\n }\\n r += cv // add, in all cases except subtractive\\n }\\n return r, nil\\n}\\n\\nfunc main() {\\n // parse three numbers mentioned in task description\\n for _, r := range []string{\\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MDCLXVI\\\"} {\\n v, err := parseRoman(r)\\n if err != nil {\\n fmt.Println(err)\\n } else {\\n fmt.Println(r, \\\"==\\\", v)\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"fmt\\\"\\n)\\n\\nvar m = map[rune]int{\\n\\t'I': 1,\\n\\t'V': 5,\\n\\t'X': 10,\\n\\t'L': 50,\\n\\t'C': 100,\\n\\t'D': 500,\\n\\t'M': 1000,\\n}\\n\\n// function, per task description\\nfunc from_roman(roman string) (arabic int) {\\n\\tlast_digit := 1000\\n\\tfor _, r := range roman {\\n\\t\\tdigit := m[r]\\n\\t\\tif last_digit < digit {\\n\\t\\t\\tarabic -= 2 * last_digit\\n\\t\\t}\\n\\t\\tlast_digit = digit\\n\\t\\tarabic += digit\\n\\t}\\n\\n\\treturn arabic\\n}\\n\\nfunc main() {\\n\\t// parse three numbers mentioned in task description\\n\\tfor _, roman_digit := range []string{\\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MDCLXVI\\\"} {\\n\\t\\tfmt.Printf(\\\"%-10s == %d\\\\n\\\", roman_digit, from_roman(roman_digit))\\n\\t}\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"#!/usr/bin/env golosh\\n----\\nThis module converts a Roman numeral into a decimal number.\\n----\\nmodule Romannumeralsdecode\\n\\naugment java.lang.Character {\\n\\n function decode = |this| -> match {\\n when this == 'I' then 1\\n when this == 'V' then 5\\n when this == 'X' then 10\\n when this == 'L' then 50\\n when this == 'C' then 100\\n when this == 'D' then 500\\n when this == 'M' then 1000\\n otherwise 0\\n }\\n}\\n\\naugment java.lang.String {\\n\\n function decode = |this| {\\n var accumulator = 0\\n foreach i in [0..this: length()] {\\n let currentChar = this: charAt(i)\\n let nextChar = match {\\n when i + 1 < this: length() then this: charAt(i + 1)\\n otherwise null\\n }\\n if (currentChar: decode() < (nextChar?: decode() orIfNull 0)) {\\n # if this is something like IV or IX or whatever\\n accumulator = accumulator - currentChar: decode()\\n } else {\\n accumulator = accumulator + currentChar: decode()\\n }\\n }\\n return accumulator\\n }\\n}\\n\\nfunction main = |args| {\\n println(\\\"MCMXC = \\\" + \\\"MCMXC\\\": decode())\\n println(\\\"MMVIII = \\\" + \\\"MMVIII\\\": decode())\\n println(\\\"MDCLXVI = \\\" + \\\"MDCLXVI\\\": decode())\\n}\\n\",\n \"language\": \"Golo\"\n },\n {\n \"code\": \"enum RomanDigits {\\n I(1), V(5), X(10), L(50), C(100), D(500), M(1000);\\n\\n private magnitude;\\n private RomanDigits(magnitude) { this.magnitude = magnitude }\\n\\n String toString() { super.toString() + \\\"=${magnitude}\\\" }\\n\\n static BigInteger parse(String numeral) {\\n assert numeral != null && !numeral.empty\\n def digits = (numeral as List).collect {\\n RomanDigits.valueOf(it)\\n }\\n def L = digits.size()\\n (0..<L).inject(0g) { total, i ->\\n def sign = (i == L - 1 || digits[i] >= digits[i+1]) ? 1 : -1\\n total + sign * digits[i].magnitude\\n }\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"println \\\"\\\"\\\"\\nDigit Values = ${RomanDigits.values()}\\nM => ${RomanDigits.parse('M')}\\nMCXI => ${RomanDigits.parse('MCXI')}\\nCMXI => ${RomanDigits.parse('CMXI')}\\nMCM => ${RomanDigits.parse('MCM')}\\nMCMXC => ${RomanDigits.parse('MCMXC')}\\nMMVIII => ${RomanDigits.parse('MMVIII')}\\nMMIX => ${RomanDigits.parse('MMIX')}\\nMCDXLIV => ${RomanDigits.parse('MCDXLIV')}\\nMDCLXVI => ${RomanDigits.parse('MDCLXVI')}\\n\\\"\\\"\\\"\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"module Main where\\n\\n------------------------\\n-- DECODER FUNCTION --\\n------------------------\\n\\ndecodeDigit :: Char -> Int\\ndecodeDigit 'I' = 1\\ndecodeDigit 'V' = 5\\ndecodeDigit 'X' = 10\\ndecodeDigit 'L' = 50\\ndecodeDigit 'C' = 100\\ndecodeDigit 'D' = 500\\ndecodeDigit 'M' = 1000\\ndecodeDigit _ = error \\\"invalid digit\\\"\\n\\n-- We process a Roman numeral from right to left, digit by digit, adding the value.\\n-- If a digit is lower than the previous then its value is negative.\\n-- The first digit is always positive.\\n\\ndecode roman = decodeRoman startValue startValue rest\\n where\\n (first:rest) = reverse roman\\n startValue = decodeDigit first\\n\\ndecodeRoman :: Int -> Int -> [Char] -> Int\\ndecodeRoman lastSum _ [] = lastSum\\ndecodeRoman lastSum lastValue (digit:rest) = decodeRoman updatedSum digitValue rest\\n where\\n digitValue = decodeDigit digit\\n updatedSum = (if digitValue < lastValue then (-) else (+)) lastSum digitValue\\n\\n------------------\\n-- TEST SUITE --\\n------------------\\n\\nmain = do\\n test \\\"MCMXC\\\" 1990\\n test \\\"MMVIII\\\" 2008\\n test \\\"MDCLXVI\\\" 1666\\n\\ntest roman expected = putStrLn (roman ++ \\\" = \\\" ++ (show (arabic)) ++ remark)\\n where\\n arabic = decode roman\\n remark = \\\" (\\\" ++ (if arabic == expected then \\\"PASS\\\" else (\\\"FAIL, expected \\\" ++ (show expected))) ++ \\\")\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"module Main where\\n\\n------------------------\\n-- DECODER FUNCTION --\\n------------------------\\n\\ndecodeDigit :: Char -> Int\\ndecodeDigit 'I' = 1\\ndecodeDigit 'V' = 5\\ndecodeDigit 'X' = 10\\ndecodeDigit 'L' = 50\\ndecodeDigit 'C' = 100\\ndecodeDigit 'D' = 500\\ndecodeDigit 'M' = 1000\\ndecodeDigit _ = error \\\"invalid digit\\\"\\n\\n-- We process a Roman numeral from right to left, digit by digit, adding the value.\\n-- If a digit is lower than the previous then its value is negative.\\n-- The first digit is always positive.\\n\\ndecode roman = fst (foldl addValue (0, 0) (reverse roman))\\n where\\n addValue (lastSum, lastValue) digit = (updatedSum, value)\\n where\\n value = decodeDigit digit;\\n updatedSum = (if value < lastValue then (-) else (+)) lastSum value\\n\\n------------------\\n-- TEST SUITE --\\n------------------\\n\\nmain = do\\n test \\\"MCMXC\\\" 1990\\n test \\\"MMVIII\\\" 2008\\n test \\\"MDCLXVI\\\" 1666\\n\\ntest roman expected = putStrLn (roman ++ \\\" = \\\" ++ (show (arabic)) ++ remark)\\n where\\n arabic = decode roman\\n remark = \\\" (\\\" ++ (if arabic == expected then \\\"PASS\\\" else (\\\"FAIL, expected \\\" ++ (show expected))) ++ \\\")\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.List (isPrefixOf)\\n\\nmapping = [(\\\"M\\\",1000),(\\\"CM\\\",900),(\\\"D\\\",500),(\\\"CD\\\",400),(\\\"C\\\",100),(\\\"XC\\\",90),\\n (\\\"L\\\",50),(\\\"XL\\\",40),(\\\"X\\\",10),(\\\"IX\\\",9),(\\\"V\\\",5),(\\\"IV\\\",4),(\\\"I\\\",1)]\\n\\ntoArabic :: String -> Int\\ntoArabic \\\"\\\" = 0\\ntoArabic str = num + toArabic xs\\n where (num, xs):_ = [ (num, drop (length n) str) | (n,num) <- mapping, isPrefixOf n str ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Bifunctor (bimap)\\nimport Data.List (isPrefixOf, mapAccumL)\\n\\nromanValue :: String -> Int\\nromanValue =\\n let tr s (k, v) =\\n until\\n (not . isPrefixOf k . fst)\\n (bimap ((drop . length) k) (v +))\\n (s, 0)\\n in sum\\n . snd\\n . flip\\n (mapAccumL tr)\\n [ (\\\"M\\\", 1000),\\n (\\\"CM\\\", 900),\\n (\\\"D\\\", 500),\\n (\\\"CD\\\", 400),\\n (\\\"C\\\", 100),\\n (\\\"XC\\\", 90),\\n (\\\"L\\\", 50),\\n (\\\"XL\\\", 40),\\n (\\\"X\\\", 10),\\n (\\\"IX\\\", 9),\\n (\\\"V\\\", 5),\\n (\\\"IV\\\", 4),\\n (\\\"I\\\", 1)\\n ]\\n\\nmain :: IO ()\\nmain =\\n mapM_\\n (print . romanValue)\\n [ \\\"MDCLXVI\\\",\\n \\\"MCMXC\\\",\\n \\\"MMVIII\\\",\\n \\\"MMXVI\\\",\\n \\\"MMXVII\\\"\\n ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.List (mapAccumR)\\nimport qualified Data.Map.Strict as M\\nimport Data.Maybe (maybe)\\n\\nfromRoman :: String -> Maybe Int\\nfromRoman cs =\\n let go l r\\n | l > r = (- r, l)\\n | otherwise = (r, l)\\n in traverse (`M.lookup` mapRoman) cs\\n >>= ( Just . sum . ((:) <$> fst <*> snd)\\n . mapAccumR go 0\\n )\\n\\nmapRoman :: M.Map Char Int\\nmapRoman =\\n M.fromList $\\n zip\\n \\\"MDCLXVI \\\"\\n [ 1000,\\n 500,\\n 100,\\n 50,\\n 10,\\n 5,\\n 1,\\n 0\\n ]\\n\\n--------------------------- TEST -------------------------\\nmain :: IO ()\\nmain =\\n putStrLn $\\n fTable\\n \\\"Decoding Roman numbers:\\\\n\\\"\\n show\\n (maybe \\\"Unrecognised character\\\" show)\\n fromRoman\\n [ \\\"MDCLXVI\\\",\\n \\\"MCMXC\\\",\\n \\\"MMVIII\\\",\\n \\\"MMXVI\\\",\\n \\\"MMXVIII\\\",\\n \\\"MMXBIII\\\"\\n ]\\n\\n------------------------ FORMATTING ----------------------\\nfTable ::\\n String ->\\n (a -> String) ->\\n (b -> String) ->\\n (a -> b) ->\\n [a] ->\\n String\\nfTable s xShow fxShow f xs =\\n unlines $\\n s :\\n fmap\\n ( ((<>) . rjust w ' ' . xShow)\\n <*> ((\\\" -> \\\" <>) . fxShow . f)\\n )\\n xs\\n where\\n rjust n c = drop . length <*> (replicate n c <>)\\n w = maximum (length . xShow <$> xs)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import qualified Data.Map.Strict as M\\n\\nfromRoman :: String -> Int\\nfromRoman xs = partialSum + lastDigit\\n where\\n (partialSum, lastDigit) = foldl accumulate (0, 0) (evalRomanDigit <$> xs)\\n accumulate (partial, lastDigit) newDigit\\n | newDigit <= lastDigit = (partial + lastDigit, newDigit)\\n | otherwise = (partial - lastDigit, newDigit)\\n\\nmapRoman :: M.Map Char Int\\nmapRoman =\\n M.fromList\\n [ ('I', 1)\\n , ('V', 5)\\n , ('X', 10)\\n , ('L', 50)\\n , ('C', 100)\\n , ('D', 500)\\n , ('M', 1000)\\n ]\\n\\nevalRomanDigit :: Char -> Int\\nevalRomanDigit c =\\n let mInt = M.lookup c mapRoman\\n in case mInt of\\n Just x -> x\\n _ -> error $ c : \\\" is not a roman digit\\\"\\n\\nmain :: IO ()\\nmain = print $ fromRoman <$> [\\\"MDCLXVI\\\", \\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MMXVI\\\", \\\"MMXVII\\\"]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import qualified Data.Map.Strict as M\\nimport Data.Maybe (maybe)\\n\\n------------------ ROMAN NUMERALS DECODED ----------------\\n\\nmapRoman :: M.Map Char Int\\nmapRoman =\\n M.fromList $\\n zip \\\"IVXLCDM\\\" $\\n scanl (*) 1 (cycle [5, 2])\\n\\nfromRoman :: String -> Maybe Int\\nfromRoman cs =\\n let op l r\\n | l >= r = (+)\\n | otherwise = (-)\\n in snd\\n . foldr\\n (\\\\l (r, n) -> (l, op l r n l))\\n (0, 0)\\n <$> traverse (`M.lookup` mapRoman) cs\\n\\n--------------------------- TEST -------------------------\\nmain :: IO ()\\nmain =\\n putStrLn $\\n fTable\\n \\\"Roman numeral decoding as a right fold:\\\\n\\\"\\n show\\n (maybe \\\"(Unrecognised character seen)\\\" show)\\n fromRoman\\n [ \\\"MDCLXVI\\\",\\n \\\"MCMXC\\\",\\n \\\"MMVIII\\\",\\n \\\"MMXVI\\\",\\n \\\"MMXVII\\\",\\n \\\"QQXVII\\\"\\n ]\\n\\n------------------------ FORMATTING ----------------------\\n\\nfTable ::\\n String ->\\n (a -> String) ->\\n (b -> String) ->\\n (a -> b) ->\\n [a] ->\\n String\\nfTable s xShow fxShow f xs =\\n unlines $\\n s :\\n fmap\\n ( ((<>) . rjust w ' ' . xShow)\\n <*> ((\\\" -> \\\" <>) . fxShow . f)\\n )\\n xs\\n where\\n rjust n c = drop . length <*> (replicate n c <>)\\n w = maximum (length . xShow <$> xs)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import qualified Data.Map.Strict as M (Map, fromList, lookup)\\nimport Data.Maybe (isNothing, isJust, fromJust, catMaybes)\\nimport Data.List (mapAccumL)\\n\\nmapRoman :: M.Map String Int\\nmapRoman =\\n M.fromList\\n [ (\\\"M\\\", 1000)\\n , (\\\"CM\\\", 900)\\n , (\\\"D\\\", 500)\\n , (\\\"CD\\\", 400)\\n , (\\\"C\\\", 100)\\n , (\\\"XC\\\", 90)\\n , (\\\"L\\\", 50)\\n , (\\\"XL\\\", 40)\\n , (\\\"X\\\", 10)\\n , (\\\"IX\\\", 9)\\n , (\\\"V\\\", 5)\\n , (\\\"IV\\\", 4)\\n , (\\\"I\\\", 1)\\n ]\\n\\nfromRoman :: String -> Int\\nfromRoman s =\\n let value k = M.lookup k mapRoman\\n in sum . catMaybes . snd $\\n mapAccumL\\n (\\\\mi (l, r, i) ->\\n let mValue = value [l, r] -- mapRoman lookup of [left, right] Chars\\n (lastPair, pairValue)\\n | isJust mValue = (Just i, mValue) -- Pair match: index updated\\n | isNothing mi || i - fromJust mi > 1 = (mi, value [l])\\n | otherwise = (mi, Nothing) -- Left Char was counted in pair\\n in (lastPair, pairValue))\\n Nothing -- Accumulator – maybe Index to last matched Char pair\\n (zip3 s (tail s ++ \\\" \\\") [0 ..]) -- Indexed character pairs\\n\\nmain :: IO ()\\nmain = print $ fromRoman <$> [\\\"MDCLXVI\\\", \\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MMXVI\\\", \\\"MMXVII\\\"]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"|%\\n++ parse\\n |= t=tape ^- @ud\\n =. t (cass t)\\n =| result=@ud\\n |-\\n ?~ t result\\n ?~ t.t (add result (from-numeral i.t))\\n =+ [a=(from-numeral i.t) b=(from-numeral i.t.t)]\\n ?: (gte a b) $(result (add result a), t t.t)\\n $(result (sub (add result b) a), t t.t.t)\\n++ yield\\n |= n=@ud ^- tape\\n =| result=tape\\n =/ values to-numeral\\n |-\\n ?~ values result\\n ?: (gte n -.i.values)\\n $(result (weld result +.i.values), n (sub n -.i.values))\\n $(values t.values)\\n++ from-numeral\\n |= c=@t ^- @ud\\n ?: =(c 'i') 1\\n ?: =(c 'v') 5\\n ?: =(c 'x') 10\\n ?: =(c 'l') 50\\n ?: =(c 'c') 100\\n ?: =(c 'd') 500\\n ?: =(c 'm') 1.000\\n !!\\n++ to-numeral\\n ^- (list [@ud tape])\\n :*\\n [1.000 \\\"m\\\"]\\n [900 \\\"cm\\\"]\\n [500 \\\"d\\\"]\\n [400 \\\"cd\\\"]\\n [100 \\\"c\\\"]\\n [90 \\\"xc\\\"]\\n [50 \\\"l\\\"]\\n [40 \\\"xl\\\"]\\n [10 \\\"x\\\"]\\n [9 \\\"ix\\\"]\\n [5 \\\"v\\\"]\\n [4 \\\"iv\\\"]\\n [1 \\\"i\\\"]\\n ~\\n ==\\n--\\n\",\n \"language\": \"Hoon\"\n },\n {\n \"code\": \"/+ *roman\\n:- %say\\n|= [* [x=$%([%from-roman tape] [%to-roman @ud]) ~] ~]\\n:- %noun\\n^- tape\\n?- -.x\\n %from-roman \\\"{<(parse +.x)>}\\\"\\n %to-roman (yield +.x)\\n==\\n\",\n \"language\": \"Hoon\"\n },\n {\n \"code\": \"link numbers\\n\\nprocedure main()\\nevery R := \\\"MCMXC\\\"|\\\"MDCLXVI\\\"|\\\"MMVIII\\\" do\\n write(R, \\\" = \\\",unroman(R))\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"procedure unroman(s)\\t\\t#: convert Roman numeral to integer\\n local nbr,lastVal,val\\n\\n nbr := lastVal := 0\\n s ? {\\n while val := case map(move(1)) of {\\n\\t \\\"m\\\": 1000\\n\\t \\\"d\\\": 500\\n\\t \\\"c\\\": 100\\n\\t \\\"l\\\": 50\\n\\t \\\"x\\\": 10\\n\\t \\\"v\\\": 5\\n\\t \\\"i\\\": 1\\n\\t } do {\\n\\t nbr +:= if val <= lastVal then val else val - 2 * lastVal\\n\\t lastVal := val\\n\\t }\\n }\\n return nbr\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"(var numerals {\\\"M\\\" 1000 \\\"D\\\" 500 \\\"C\\\" 100 \\\"L\\\" 50 \\\"X\\\" 10 \\\"V\\\" 5 \\\"I\\\" 1})\\n\\n; Approach A\\n(function ro->ar r\\n (-> (reverse (upper-case r))\\n (map numerals)\\n (split-with val)\\n (map (.. +0))\\n (reduce @(((< % %1) + -)))))\\n\\n; Approach B\\n(function ro->ar r\\n (-> (upper-case r)\\n (map numerals)\\n @(reduce (fn [sum lastv] curr [(+ sum curr ((< lastv curr) (* -2 lastv) 0)) curr]) [0 0])\\n 0))\\n\\n(map ro->ar [\\\"MDCLXVI\\\" \\\"MMMCMXCIX\\\" \\\"XLVIII\\\" \\\"MMVIII\\\"])\\n\",\n \"language\": \"Insitux\"\n },\n {\n \"code\": \"rom2d=: [: (+/ .* _1^ 0,~ 2</\\\\ ]) 1 5 10 50 100 500 1000 {~ 'IVXLCDM'&i.\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" rom2d 'MCMXC'\\n1990\\n rom2d 'MDCLXVI'\\n1666\\n rom2d 'MMVIII'\\n2008\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class Roman {\\n\\tprivate static int decodeSingle(char letter) {\\n\\t\\tswitch(letter) {\\n\\t\\t\\tcase 'M': return 1000;\\n\\t\\t\\tcase 'D': return 500;\\n\\t\\t\\tcase 'C': return 100;\\n\\t\\t\\tcase 'L': return 50;\\n\\t\\t\\tcase 'X': return 10;\\n\\t\\t\\tcase 'V': return 5;\\n\\t\\t\\tcase 'I': return 1;\\n\\t\\t\\tdefault: return 0;\\n\\t\\t}\\n\\t}\\n\\tpublic static int decode(String roman) {\\n\\t\\tint result = 0;\\n\\t\\tString uRoman = roman.toUpperCase(); //case-insensitive\\n\\t\\tfor(int i = 0;i < uRoman.length() - 1;i++) {//loop over all but the last character\\n\\t\\t\\t//if this character has a lower value than the next character\\n\\t\\t\\tif (decodeSingle(uRoman.charAt(i)) < decodeSingle(uRoman.charAt(i+1))) {\\n\\t\\t\\t\\t//subtract it\\n\\t\\t\\t\\tresult -= decodeSingle(uRoman.charAt(i));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t//add it\\n\\t\\t\\t\\tresult += decodeSingle(uRoman.charAt(i));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//decode the last character, which is always added\\n\\t\\tresult += decodeSingle(uRoman.charAt(uRoman.length()-1));\\n\\t\\treturn result;\\n\\t}\\n\\t\\n\\tpublic static void main(String[] args) {\\n\\t\\tSystem.out.println(decode(\\\"MCMXC\\\")); //1990\\n\\t\\tSystem.out.println(decode(\\\"MMVIII\\\")); //2008\\n\\t\\tSystem.out.println(decode(\\\"MDCLXVI\\\")); //1666\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.util.Set;\\nimport java.util.EnumSet;\\nimport java.util.Collections;\\nimport java.util.stream.Collectors;\\nimport java.util.stream.LongStream;\\n\\npublic interface RomanNumerals {\\n public enum Numeral {\\n M(1000), CM(900), D(500), CD(400), C(100), XC(90), L(50), XL(40), X(10), IX(9), V(5), IV(4), I(1);\\n\\n public final long weight;\\n\\n private static final Set<Numeral> SET = Collections.unmodifiableSet(EnumSet.allOf(Numeral.class));\\n\\n private Numeral(long weight) {\\n this.weight = weight;\\n }\\n\\n public static Numeral getLargest(long weight) {\\n return SET.stream()\\n .filter(numeral -> weight >= numeral.weight)\\n .findFirst()\\n .orElse(I)\\n ;\\n }\\n };\\n\\n public static String encode(long n) {\\n return LongStream.iterate(n, l -> l - Numeral.getLargest(l).weight)\\n .limit(Numeral.values().length)\\n .filter(l -> l > 0)\\n .mapToObj(Numeral::getLargest)\\n .map(String::valueOf)\\n .collect(Collectors.joining())\\n ;\\n }\\n\\n public static long decode(String roman) {\\n long result = new StringBuilder(roman.toUpperCase()).reverse().chars()\\n .mapToObj(c -> Character.toString((char) c))\\n .map(numeral -> Enum.valueOf(Numeral.class, numeral))\\n .mapToLong(numeral -> numeral.weight)\\n .reduce(0, (a, b) -> a + (a <= b ? b : -b))\\n ;\\n if (roman.charAt(0) == roman.charAt(1)) {\\n result += 2 * Enum.valueOf(Numeral.class, roman.substring(0, 1)).weight;\\n }\\n return result;\\n }\\n\\n public static void test(long n) {\\n System.out.println(n + \\\" = \\\" + encode(n));\\n System.out.println(encode(n) + \\\" = \\\" + decode(encode(n)));\\n }\\n\\n public static void main(String[] args) {\\n LongStream.of(1999, 25, 944).forEach(RomanNumerals::test);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var Roman = {\\n Values: [['CM', 900], ['CD', 400], ['XC', 90], ['XL', 40], ['IV', 4],\\n ['IX', 9], ['V', 5], ['X', 10], ['L', 50],\\n ['C', 100], ['M', 1000], ['I', 1], ['D', 500]],\\n UnmappedStr : 'Q',\\n parse: function(str) {\\n var result = 0\\n for (var i=0; i<Roman.Values.length; ++i) {\\n var pair = Roman.Values[i]\\n var key = pair[0]\\n var value = pair[1]\\n var regex = RegExp(key)\\n while (str.match(regex)) {\\n result += value\\n str = str.replace(regex, Roman.UnmappedStr)\\n }\\n }\\n return result\\n }\\n}\\n\\nvar test_data = ['MCMXC', 'MDCLXVI', 'MMVIII']\\nfor (var i=0; i<test_data.length; ++i) {\\n var test_datum = test_data[i]\\n print(test_datum + \\\": \\\" + Roman.parse(test_datum))\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(function (lstTest) {\\n\\n var mapping = [[\\\"M\\\", 1000], [\\\"CM\\\", 900], [\\\"D\\\", 500], [\\\"CD\\\", 400], [\\\"C\\\", 100], [\\n \\\"XC\\\", 90], [\\\"L\\\", 50], [\\\"XL\\\", 40], [\\\"X\\\", 10], [\\\"IX\\\", 9], [\\\"V\\\", 5], [\\\"IV\\\",\\n 4], [\\\"I\\\", 1]];\\n\\n // s -> n\\n function romanValue(s) {\\n // recursion over list of characters\\n // [c] -> n\\n function toArabic(lst) {\\n return lst.length ? function (xs) {\\n var lstParse = chain(mapping, function (lstPair) {\\n return isPrefixOf(\\n lstPair[0], xs\\n ) ? [lstPair[1], drop(lstPair[0].length, xs)] : []\\n });\\n return lstParse[0] + toArabic(lstParse[1]);\\n }(lst) : 0\\n }\\n return toArabic(s.split(''));\\n }\\n\\n // Monadic bind (chain) for lists\\n function chain(xs, f) {\\n return [].concat.apply([], xs.map(f));\\n }\\n\\n // [a] -> [a] -> Bool\\n function isPrefixOf(lstFirst, lstSecond) {\\n return lstFirst.length ? (\\n lstSecond.length ?\\n lstFirst[0] === lstSecond[0] && isPrefixOf(\\n lstFirst.slice(1), lstSecond.slice(1)\\n ) : false\\n ) : true;\\n }\\n\\n // Int -> [a] -> [a]\\n function drop(n, lst) {\\n return n <= 0 ? lst : (\\n lst.length ? drop(n - 1, lst.slice(1)) : []\\n );\\n }\\n\\n return lstTest.map(romanValue);\\n\\n})(['MCMXC', 'MDCLXVI', 'MMVIII']);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"[1990, 1666, 2008]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(function (lstTest) {\\n\\n function romanValue(s) {\\n return s.length ? function () {\\n var parse = [].concat.apply([], glyphs.map(function (g) {\\n return 0 === s.indexOf(g) ? [trans[g], s.substr(g.length)] : [];\\n }));\\n return parse[0] + romanValue(parse[1]);\\n }() : 0;\\n }\\n\\n var trans = {\\n M: 1E3,\\n CM: 900,\\n D: 500,\\n CD: 400,\\n C: 100,\\n XC: 90,\\n L: 50,\\n XL: 40,\\n X: 10,\\n IX: 9,\\n V: 5,\\n IV: 4,\\n I: 1\\n },\\n glyphs = Object.keys(trans);\\n\\n return lstTest.map(romanValue);\\n\\n})([\\\"MCMXC\\\", \\\"MDCLXVI\\\", \\\"MMVIII\\\", \\\"MMMM\\\"]);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"[1990, 1666, 2008]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n // romanValue :: String -> Int\\n const romanValue = s =>\\n s.length ? (() => {\\n const parse = [].concat(\\n ...glyphs.map(g => 0 === s.indexOf(g) ? (\\n [dctTrans[g], s.substr(g.length)]\\n ) : [])\\n );\\n return parse[0] + romanValue(parse[1]);\\n })() : 0;\\n\\n // dctTrans :: {romanKey: Integer}\\n const dctTrans = {\\n M: 1E3,\\n CM: 900,\\n D: 500,\\n CD: 400,\\n C: 100,\\n XC: 90,\\n L: 50,\\n XL: 40,\\n X: 10,\\n IX: 9,\\n V: 5,\\n IV: 4,\\n I: 1\\n };\\n\\n // glyphs :: [romanKey]\\n const glyphs = Object.keys(dctTrans);\\n\\n // TEST -------------------------------------------------------------------\\n return [\\\"MCMXC\\\", \\\"MDCLXVI\\\", \\\"MMVIII\\\", \\\"MMMM\\\"].map(romanValue);\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"[1990,1666,2008,4000]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n\\n // -------------- ROMAN NUMERALS DECODED ---------------\\n\\n // Folding from right to left,\\n // lower leftward characters are subtracted,\\n // others are added.\\n\\n // fromRoman :: String -> Int\\n const fromRoman = s =>\\n foldr(l => ([r, n]) => [\\n l,\\n l >= r ? (\\n n + l\\n ) : n - l\\n ])([0, 0])(\\n [...s].map(charVal)\\n )[1];\\n\\n // charVal :: Char -> Maybe Int\\n const charVal = k => {\\n const v = {\\n I: 1,\\n V: 5,\\n X: 10,\\n L: 50,\\n C: 100,\\n D: 500,\\n M: 1000\\n } [k];\\n return v !== undefined ? v : 0;\\n };\\n\\n // ----------------------- TEST ------------------------\\n const main = () => [\\n 'MDCLXVI', 'MCMXC', 'MMVIII', 'MMXVI', 'MMXVII'\\n ]\\n .map(fromRoman)\\n .join('\\\\n');\\n\\n\\n // ----------------- GENERIC FUNCTIONS -----------------\\n\\n // foldr :: (a -> b -> b) -> b -> [a] -> b\\n const foldr = f =>\\n // Note that that the Haskell signature of foldr\\n // differs from that of foldl - the positions of\\n // accumulator and current value are reversed.\\n a => xs => [...xs].reduceRight(\\n (a, x) => f(x)(a),\\n a\\n );\\n\\n // MAIN ---\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\nfunction toNumeric(value) {\\n return value\\n .replace(/IV/, 'I'.repeat(4))\\n .replace(/V/g, 'I'.repeat(5))\\n .replace(/IX/, 'I'.repeat(9))\\n .replace(/XC/, 'I'.repeat(90))\\n .replace(/XL/, 'I'.repeat(40))\\n .replace(/X/g, 'I'.repeat(10))\\n .replace(/L/, 'I'.repeat(50))\\n .replace(/CD/, 'I'.repeat(400))\\n .replace(/CM/, 'I'.repeat(900))\\n .replace(/C/g, 'I'.repeat(100))\\n .replace(/D/g, 'I'.repeat(500))\\n .replace(/M/g, 'I'.repeat(1000))\\n .length;\\n}\\n\\nconst numerics = [\\\"MMXVI\\\", \\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MM\\\", \\\"MDCLXVI\\\"]\\n .map(toNumeric);\\n\\nconsole.log(numerics);\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def fromRoman:\\n def addRoman(n):\\n if length == 0 then n\\n elif startswith(\\\"M\\\") then .[1:] | addRoman(1000 + n)\\n elif startswith(\\\"CM\\\") then .[2:] | addRoman(900 + n)\\n elif startswith(\\\"D\\\") then .[1:] | addRoman(500 + n)\\n elif startswith(\\\"CD\\\") then .[2:] | addRoman(400 + n)\\n elif startswith(\\\"C\\\") then .[1:] | addRoman(100 + n)\\n elif startswith(\\\"XC\\\") then .[2:] | addRoman(90 + n)\\n elif startswith(\\\"L\\\") then .[1:] | addRoman(50 + n)\\n elif startswith(\\\"XL\\\") then .[2:] | addRoman(40 + n)\\n elif startswith(\\\"X\\\") then .[1:] | addRoman(10 + n)\\n elif startswith(\\\"IX\\\") then .[2:] | addRoman(9 + n)\\n elif startswith(\\\"V\\\") then .[1:] | addRoman(5 + n)\\n elif startswith(\\\"IV\\\") then .[2:] | addRoman(4 + n)\\n elif startswith(\\\"I\\\") then .[1:] | addRoman(1 + n)\\n else\\n error(\\\"invalid Roman numeral: \\\" + tostring)\\n end;\\n addRoman(0);\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"[ \\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MDCLXVI\\\" ] | map(\\\"\\\\(.) => \\\\(fromRoman)\\\") | .[]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ jq -n -f -r fromRoman.jq\\nMCMXC => 1990\\nMMVIII => 2008\\nMDCLXVI => 1666\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function parseroman(rnum::AbstractString)\\n romandigits = Dict('I' => 1, 'V' => 5, 'X' => 10, 'L' => 50,\\n 'C' => 100, 'D' => 500, 'M' => 1000)\\n mval = accm = 0\\n for d in reverse(uppercase(rnum))\\n val = try\\n romandigits[d]\\n catch\\n throw(DomainError())\\n end\\n if val > mval maxval = val end\\n if val < mval\\n accm -= val\\n else\\n accm += val\\n end\\n end\\n return accm\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"using Printf\\n\\ntest = [\\\"I\\\", \\\"III\\\", \\\"IX\\\", \\\"IVI\\\", \\\"IIM\\\",\\n \\\"CMMDXL\\\", \\\"icv\\\", \\\"cDxLiV\\\", \\\"MCMLD\\\", \\\"ccccccd\\\",\\n \\\"iiiiiv\\\", \\\"MMXV\\\", \\\"MCMLXXXIV\\\", \\\"ivxmm\\\", \\\"SPQR\\\"]\\nfor rnum in test\\n @printf(\\\"%15s → %s\\\\n\\\", rnum, try parseroman(rnum) catch \\\"not valid\\\" end)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \" romd: {v:1 5 10 50 100 500 1000@\\\"IVXLCDM\\\"?/:x; +/v*_-1^(>':v),0}\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \" romd'(\\\"MCMXC\\\";\\\"MMVIII\\\";\\\"MDCLXVI\\\")\\n1990 2008 1666\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nfun romanDecode(roman: String): Int {\\n if (roman.isEmpty()) return 0\\n var n = 0\\n var last = 'O'\\n for (c in roman) {\\n when (c) {\\n 'I' -> n += 1\\n 'V' -> if (last == 'I') n += 3 else n += 5\\n 'X' -> if (last == 'I') n += 8 else n += 10\\n 'L' -> if (last == 'X') n += 30 else n += 50\\n 'C' -> if (last == 'X') n += 80 else n += 100\\n 'D' -> if (last == 'C') n += 300 else n += 500\\n 'M' -> if (last == 'C') n += 800 else n += 1000\\n }\\n last = c\\n }\\n return n\\n}\\n\\nfun main(args: Array<String>) {\\n val romans = arrayOf(\\\"I\\\", \\\"III\\\", \\\"IV\\\", \\\"VIII\\\", \\\"XLIX\\\", \\\"CCII\\\", \\\"CDXXXIII\\\", \\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MDCLXVI\\\")\\n for (roman in romans) println(\\\"${roman.padEnd(10)} = ${romanDecode(roman)}\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"define br => '\\\\r'\\n//decode roman\\ndefine decodeRoman(roman::string)::integer => {\\n\\tlocal(ref = array('M'=1000, 'CM'=900, 'D'=500, 'CD'=400, 'C'=100, 'XC'=90, 'L'=50, 'XL'=40, 'X'=10, 'IX'=9, 'V'=5, 'IV'=4, 'I'=1))\\n\\tlocal(out = integer)\\n\\twhile(#roman->size) => {\\n\\t\\t// need to use neset while instead of query expr to utilize loop_abort\\n\\t\\twhile(loop_count <= #ref->size) => {\\n\\t\\t\\tif(#roman->beginswith(#ref->get(loop_count)->first)) => {\\n\\t\\t\\t\\t#out += #ref->get(loop_count)->second\\n\\t\\t\\t\\t#roman->remove(1,#ref->get(loop_count)->first->size)\\n\\t\\t\\t\\tloop_abort\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn #out\\n}\\n\\n'MCMXC as integer is '+decodeRoman('MCMXC')\\nbr\\n'MMVIII as integer is '+decodeRoman('MMVIII')\\nbr\\n'MDCLXVI as integer is '+decodeRoman('MDCLXVI')\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \" print \\\"MCMXCIX = \\\"; romanDec( \\\"MCMXCIX\\\") '1999\\n print \\\"MDCLXVI = \\\"; romanDec( \\\"MDCLXVI\\\") '1666\\n print \\\"XXV = \\\"; romanDec( \\\"XXV\\\") '25\\n print \\\"CMLIV = \\\"; romanDec( \\\"CMLIV\\\") '954\\n print \\\"MMXI = \\\"; romanDec( \\\"MMXI\\\") '2011\\n\\n end\\n\\nfunction romanDec( roman$)\\n arabic =0\\n lastval =0\\n\\n for i = len( roman$) to 1 step -1\\n select case upper$( mid$( roman$, i, 1))\\n case \\\"M\\\"\\n n = 1000\\n case \\\"D\\\"\\n n = 500\\n case \\\"C\\\"\\n n = 100\\n case \\\"L\\\"\\n n = 50\\n case \\\"X\\\"\\n n = 10\\n case \\\"V\\\"\\n n = 5\\n case \\\"I\\\"\\n n = 1\\n case else\\n n = 0\\n end select\\n\\n if n <lastval then\\n arabic =arabic -n\\n else\\n arabic =arabic +n\\n end if\\n\\n lastval =n\\n next\\n\\n romanDec =arabic\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"require! 'prelude-ls': {fold, sum}\\n\\n# String → Number\\ndecimal_of_roman = do\\n # [Number, Number] → String → [Number, Number]\\n _convert = ([acc, last_value], ch) ->\\n current_value = { M:1000 D:500 C:100 L:50 X:10 V:5 I:1 }[ch] ? 0\\n op = if last_value < current_value then (-) else (+)\\n [op(acc, last_value), current_value]\\n # fold the string and sum the resulting tuple (array)\\n fold(_convert, [0, 0]) >> sum\\n\\n{[rom, decimal_of_roman rom] for rom in <[ MCMXC MMVII MDCLXVII MMMCLIX MCMLXXVII MMX ]>}\\n\",\n \"language\": \"LiveScript\"\n },\n {\n \"code\": \"; Roman numeral decoder\\n\\n; First, some useful substring utilities\\nto starts_with? :string :prefix\\n if empty? :prefix [output \\\"true]\\n if empty? :string [output \\\"false]\\n if not equal? first :string first :prefix [output \\\"false]\\n output starts_with? butfirst :string butfirst :prefix\\nend\\n\\nto remove_prefix :string :prefix\\n if or empty? :prefix not starts_with? :string :prefix [output :string]\\n output remove_prefix butfirst :string butfirst :prefix\\nend\\n\\n; Our list of Roman numeral values\\nmake \\\"values [[M 1000] [CM 900] [D 500] [CD 400] [C 100] [XC 90] [L 50]\\n [XL 40] [X 10] [IX 9] [V 5] [IV 4] [I 1]]\\n\\n; Function to do the work\\nto from_roman :str\\n local \\\"n make \\\"n 0\\n foreach :values [\\n local \\\"s make \\\"s first ?\\n local \\\"v make \\\"v last ?\\n while [starts_with? :str :s] [\\n make \\\"n sum n :v\\n make \\\"str remove_prefix :str :s\\n ]\\n ]\\n output :n\\nend\\n\\nforeach [MCMXC MDCLXVI MMVIII] [print (sentence (word ? \\\"|: |) from_roman ?)]\\nbye\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"function ToNumeral( roman )\\n local Num = { [\\\"M\\\"] = 1000, [\\\"D\\\"] = 500, [\\\"C\\\"] = 100, [\\\"L\\\"] = 50, [\\\"X\\\"] = 10, [\\\"V\\\"] = 5, [\\\"I\\\"] = 1 }\\n local numeral = 0\\n\\n local i = 1\\n local strlen = string.len(roman)\\n while i < strlen do\\n local z1, z2 = Num[ string.sub(roman,i,i) ], Num[ string.sub(roman,i+1,i+1) ]\\n if z1 < z2 then\\n numeral = numeral + ( z2 - z1 )\\n i = i + 2\\n else\\n numeral = numeral + z1\\n i = i + 1\\n end\\n end\\n\\n if i <= strlen then numeral = numeral + Num[ string.sub(roman,i,i) ] end\\n\\n return numeral\\nend\\n\\nprint( ToNumeral( \\\"MCMXC\\\" ) )\\nprint( ToNumeral( \\\"MMVIII\\\" ) )\\nprint( ToNumeral( \\\"MDCLXVI\\\" ) )\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module RomanNumbers {\\n flush ' empty current stack\\n gosub Initialize\\n document Doc$\\n while not empty\\n read rom$\\n print rom$;\\\"=\\\";RomanEval$(rom$)\\n Doc$=rom$+\\\"=\\\"+RomanEval$(rom$)+{\\n }\\n end while\\n Clipboard Doc$\\n end\\nInitialize:\\n function RomanEval$(rom$) {\\n Flush\\n =\\\"invalid\\\"\\n if filter$(rom$,\\\"MDCLXVI\\\")<>\\\"\\\" Then Exit\\n \\\\\\\\ \\\"Y\\\" is in top of stack\\n Push \\\"CM\\\", \\\"MD\\\", \\\"Q\\\"\\n Push \\\"CD\\\", \\\"MD\\\",\\\"W\\\"\\n Push \\\"XC\\\", \\\"DL\\\", \\\"E\\\"\\n Push \\\"XL\\\", \\\"X\\\",\\\"R\\\"\\n Push \\\"IX\\\",\\\"V\\\",\\\"T\\\"\\n Push \\\"IV\\\",\\\"I\\\",\\\"Y\\\"\\n \\\\\\\\ stack flush to doublerom\\n doublerom=[]\\n \\\\\\\\ \\\"M\\\" is in top of stack\\n Data \\\"M\\\", 1000, \\\"Q\\\",900\\n Data \\\"D\\\", 500,\\\"W\\\", 400\\n Data \\\"C\\\",100,\\\"E\\\",90\\n Data \\\"L\\\",50,\\\"R\\\", 40\\n Data \\\"X\\\", 10, \\\"T\\\", 9\\n Data \\\"V\\\", 5, \\\"Y\\\", 4, \\\"I\\\",1\\n \\\\\\\\ stack flush to singlerom\\n singlerom=[]\\n acc=0\\n value=0\\n count=0\\n stack doublerom {\\n if empty then exit\\n read rep$,exclude$,cc$\\n i=instr(rom$,cc$)\\n if i >0 then\\n tmp$=mid$(rom$,i+2)\\n L=Len(tmp$)\\n if L>0 then if Len(filter$(tmp$, exclude$))<>L then rom$=\\\"A\\\": exit\\n if Instr(rom$,mid$(rom$,i,1))<i then rom$=\\\"A\\\": exit\\n insert i,2 rom$=rep$ ' replace at pos i with rep$ and place a space to i+1\\n end if\\n loop\\n }\\n rom$=filter$(rom$,\\\" \\\") ' remove spaces if exist\\n\\n stack singlerom {\\n if empty then exit\\n read cc$, value\\n count=0\\n while left$(rom$,1)=cc$\\n insert 1, 1 rom$=\\\"\\\"\\n count++\\n acc+=value\\n end while\\n if count>3 then exit\\n loop\\n }\\n if len(rom$)>0 or count>3 Else\\n =Str$(acc,1033)\\n end if\\n }\\n data \\\"MMMCMXCIX\\\", \\\"LXXIIX\\\", \\\"MMXVII\\\", \\\"LXXIX\\\", \\\"CXCIX\\\",\\\"MCMXCIX\\\",\\\"MMMDCCCLXXXVIII\\\"\\n data \\\"CMXI\\\",\\\"M\\\",\\\"MCDXLIV\\\",\\\"CCCC\\\",\\\"IXV\\\", \\\"XLIXL\\\",\\\"LXXIIX\\\",\\\"IVM\\\"\\n data \\\"XXXIX\\\", \\\"XXXX\\\", \\\"XIXX\\\",\\\"IVI\\\", \\\"XLIX\\\",\\\"XCIX\\\",\\\"XCIV\\\",\\\"XLVIII\\\"\\n return\\n}\\nRomanNumbers\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"f := n -> convert(n, arabic):\\nseq(printf(\\\"%a\\\\n\\\", f(i)), i in [MCMXC, MMVIII, MDCLXVI]);\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"FromRomanNumeral[\\\"MMCDV\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function x = rom2dec(s)\\n% ROM2DEC converts Roman numbers to decimal\\n\\n% store Roman digits values: I=1, V=5, X=10, L=50, C=100, D=500, M=1000\\ndigitsValues = [0 0 100 500 0 0 0 0 1 0 0 50 1000 0 0 0 0 0 0 0 0 5 0 10 0 0];\\n% convert Roman number to array of values\\nvalues = digitsValues(s-'A'+1);\\n% change sign if next value is bigger\\nx = sum(values .* [sign(diff(-values)+eps),1]);\\n\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"romanNumbers = {'MMMCMXCIX', 'XLVIII', 'MMVIII'};\\nfor n = 1 : numel(romanNumbers)\\n fprintf('%10s = %4d\\\\n',romanNumbers{n}, rom2dec(romanNumbers{n}));\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \":- module test_roman.\\n\\n:- interface.\\n\\n:- import_module io.\\n\\n:- pred main(io::di, io::uo) is det.\\n\\n:- implementation.\\n\\n:- import_module char.\\n:- import_module exception.\\n:- import_module int.\\n:- import_module list.\\n:- import_module string.\\n\\n:- type conversion_error ---> not_a_roman_number.\\n\\n:- func build_int(list(char), int, int) = int.\\n:- func from_roman(string) = int.\\n:- pred roman_to_int(char::in, int::out) is semidet.\\n\\nfrom_roman(Roman) = Decimal :-\\n List = reverse(to_char_list(Roman)),\\n Decimal = build_int(List, 0, 0).\\n\\nbuild_int([], LastValue, Accumulator) = LastValue + Accumulator.\\nbuild_int([Digit|Rest], LastValue, Accumulator) = Sum :-\\n ( roman_to_int(Digit, Value) ->\\n ( Value < LastValue ->\\n Sum = build_int(Rest, Value, Accumulator - LastValue)\\n ; Sum = build_int(Rest, Value, Accumulator + LastValue) )\\n ; throw(not_a_roman_number) ).\\n\\nroman_to_int('I', 1).\\nroman_to_int('V', 5).\\nroman_to_int('X', 10).\\nroman_to_int('L', 50).\\nroman_to_int('C', 100).\\nroman_to_int('D', 500).\\nroman_to_int('M', 1000).\\n\\nmain(!IO) :-\\n command_line_arguments(Args, !IO),\\n foldl((pred(Arg::in, !.IO::di, !:IO::uo) is det :-\\n format(\\\"%s => %d\\\\n\\\", [s(Arg), i(from_roman(Arg))], !IO)),\\n Args, !IO).\\n\\n:- end_module test_roman.\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"main :: [sys_message]\\nmain = [ Stdout (s ++ \\\": \\\" ++ show (fromroman s) ++ \\\"\\\\n\\\")\\n | s <- [\\\"MCMXC\\\", \\\"MDCLXVI\\\", \\\"MMVII\\\", \\\"MMXXIII\\\"]\\n ]\\n\\nfromroman :: [char]->num\\nfromroman = f\\n where f [] = 0\\n f [x] = r x\\n f (x:y:xs) = f (y:xs) - r x, if r x < r y\\n = f (y:xs) + r x, otherwise\\n r 'M' = 1000\\n r 'D' = 500\\n r 'C' = 100\\n r 'L' = 50\\n r 'X' = 10\\n r 'V' = 5\\n r 'I' = 1\\n\",\n \"language\": \"Miranda\"\n },\n {\n \"code\": \"MODULE RomanNumerals;\\nFROM InOut IMPORT WriteString, WriteCard, WriteLn;\\nFROM Strings IMPORT Length;\\n\\n(* Convert given Roman numeral to binary *)\\nPROCEDURE DecodeRoman(s: ARRAY OF CHAR): CARDINAL;\\n VAR i, d, len, acc: CARDINAL;\\n\\n PROCEDURE Digit(d: CHAR): CARDINAL;\\n BEGIN\\n CASE CHR( BITSET(ORD(d)) + BITSET{5} ) OF (* lowercase *)\\n 'm': RETURN 1000;\\n | 'd': RETURN 500;\\n | 'c': RETURN 100;\\n | 'l': RETURN 50;\\n | 'x': RETURN 10;\\n | 'v': RETURN 5;\\n | 'i': RETURN 1;\\n ELSE\\n RETURN 0;\\n END;\\n END Digit;\\nBEGIN\\n len := Length(s);\\n acc := 0;\\n FOR i := 0 TO len-1 DO\\n d := Digit(s[i]);\\n IF d=0 THEN RETURN 0; END;\\n\\n IF (i # len-1) AND (d < Digit(s[i+1])) THEN\\n acc := acc - d;\\n ELSE\\n acc := acc + d;\\n END;\\n END;\\n RETURN acc;\\nEND DecodeRoman;\\n\\nPROCEDURE Show(s: ARRAY OF CHAR);\\nBEGIN\\n WriteString(s);\\n WriteString(\\\": \\\");\\n WriteCard(DecodeRoman(s), 0);\\n WriteLn();\\nEND Show;\\n\\nBEGIN\\n Show(\\\"MCMXC\\\");\\n Show(\\\"MDCLXVI\\\");\\n Show(\\\"mmvii\\\");\\n Show(\\\"mmxxi\\\");\\nEND RomanNumerals.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"def decodeSingle(letter)\\n\\tif letter = \\\"M\\\"\\n\\t\\treturn 1000\\n\\telse if letter = \\\"D\\\"\\n\\t\\treturn 500\\n\\telse if letter = \\\"C\\\"\\n\\t\\treturn 100\\n\\telse if letter = \\\"L\\\"\\n\\t\\treturn 50\\n\\telse if letter = \\\"X\\\"\\n\\t\\treturn 10\\n\\telse if letter = \\\"V\\\"\\n\\t\\treturn 5\\n\\telse if letter = \\\"I\\\"\\n\\t\\treturn 1\\n\\telse\\n\\t\\treturn 0\\n\\tend\\nend\\n\\ndef decode(roman)\\n\\tresult = 0\\n\\tuRoman = roman.toUpperCase()\\n\\t\\n\\tfor (i = 0) (i < len(uRoman) - 1) (i += 1)\\n\\t\\tif decodeSingle(uRoman[i]) < decodeSingle(uRoman[i + 1])\\n\\t\\t\\tresult -= decodeSingle(uRoman[i])\\n\\t\\telse\\n\\t\\t\\tresult += decodeSingle(uRoman[i])\\n\\t\\tend\\n\\tend\\n\\t\\n\\tresult += decodeSingle(uRoman[len(uRoman) - 1])\\n\\treturn result\\nend\\n\\nprintln decode(\\\"MCMXC\\\")\\nprintln decode(\\\"MMVIII\\\")\\nprintln decode(\\\"MDCLXVI\\\")\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref savelog symbols binary\\n\\n /* 1990 2008 1666 */\\nyears = Rexx('MCMXC MMVIII MDCLXVI')\\n\\nloop y_ = 1 to years.words\\n Say years.word(y_).right(10) || ':' decode(years.word(y_))\\n end y_\\n\\nreturn\\n\\nmethod decode(arg) public static returns int signals IllegalArgumentException\\n\\n parse arg.upper roman .\\n if roman.verify('MDCLXVI') \\\\= 0 then signal IllegalArgumentException\\n\\n -- always insert the value of the least significant numeral\\n decnum = rchar(roman.substr(roman.length, 1))\\n loop d_ = 1 to roman.length - 1\\n if rchar(roman.substr(d_, 1)) < rchar(roman.substr(d_ + 1, 1)) then do\\n -- Handle cases where numerals are not in descending order\\n -- subtract the value of the numeral\\n decnum = decnum - rchar(roman.substr(d_, 1))\\n end\\n else do\\n -- Normal case\\n -- add the value of the numeral\\n decnum = decnum + rchar(roman.substr(d_, 1))\\n end\\n end d_\\n\\n return decnum\\n\\nmethod rchar(arg) public static returns int\\n\\n parse arg.upper ch +1 .\\n select case ch\\n when 'M' then digit = 1000\\n when 'D' then digit = 500\\n when 'C' then digit = 100\\n when 'L' then digit = 50\\n when 'X' then digit = 10\\n when 'V' then digit = 5\\n when 'I' then digit = 1\\n otherwise digit = 0\\n end\\n\\n return digit\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"import tables\\n\\nlet rdecode = {'M': 1000, 'D': 500, 'C': 100, 'L': 50, 'X': 10, 'V': 5, 'I': 1}.toTable\\n\\nproc decode(roman: string): int =\\n for i in 0 ..< roman.high:\\n let (rd, rd1) = (rdecode[roman[i]], rdecode[roman[i+1]])\\n result += (if rd < rd1: -rd else: rd)\\n result += rdecode[roman[roman.high]]\\n\\nfor r in [\\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MDCLXVI\\\"]:\\n echo r, \\\" \\\", decode(r)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let decimal_of_roman roman =\\n let arabic = ref 0 in\\n let lastval = ref 0 in\\n for i = (String.length roman) - 1 downto 0 do\\n let n =\\n match roman.[i] with\\n | 'M' | 'm' -> 1000\\n | 'D' | 'd' -> 500\\n | 'C' | 'c' -> 100\\n | 'L' | 'l' -> 50\\n | 'X' | 'x' -> 10\\n | 'V' | 'v' -> 5\\n | 'I' | 'i' -> 1\\n | _ -> 0\\n in\\n if n < !lastval\\n then arabic := !arabic - n\\n else arabic := !arabic + n;\\n lastval := n\\n done;\\n !arabic\\n\\nlet () =\\n Printf.printf \\\" %d\\\\n\\\" (decimal_of_roman \\\"MCMXC\\\");\\n Printf.printf \\\" %d\\\\n\\\" (decimal_of_roman \\\"MMVIII\\\");\\n Printf.printf \\\" %d\\\\n\\\" (decimal_of_roman \\\"MDCLXVI\\\");\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"(* Scan the roman number from right to left. *)\\n(* When processing a roman digit, if the previously processed roman digit was\\n * greater than the current one, we must substract the latter from the current\\n * total, otherwise add it.\\n * Example:\\n * - MCMLXX read from right to left is XXLMCM\\n * the sum is 10 + 10 + 50 + 1000 - 100 + 1000 *)\\nlet decimal_of_roman roman =\\n (* Use 'String.uppercase' for OCaml 4.02 and previous. *)\\n let rom = String.uppercase_ascii roman in\\n (* A simple association list. IMHO a Hashtbl is a bit overkill here. *)\\n let romans = List.combine ['I'; 'V'; 'X'; 'L'; 'C'; 'D'; 'M']\\n [1; 5; 10; 50; 100; 500; 1000] in\\n let compare x y =\\n if x < y then -1 else 1\\n in\\n (* Scan the string from right to left using index i, and keeping track of\\n * the previously processed roman digit in prevdig. *)\\n let rec doloop i prevdig =\\n if i < 0 then 0\\n else\\n try\\n let currdig = List.assoc rom.[i] romans in\\n (currdig * compare currdig prevdig) + doloop (i - 1) currdig\\n with\\n (* Ignore any incorrect roman digit and just process the next one. *)\\n Not_found -> doloop (i - 1) 0\\n in\\n doloop (String.length rom - 1) 0\\n\\n\\n(* Some simple tests. *)\\nlet () =\\n let testit roman decimal =\\n let conv = decimal_of_roman roman in\\n let status = if conv = decimal then \\\"PASS\\\" else \\\"FAIL\\\" in\\n Printf.sprintf \\\"[%s] %s\\\\tgives %d.\\\\tExpected: %d.\\\\t\\\"\\n status roman conv decimal\\n in\\n print_endline \\\">>> Usual roman numbers.\\\";\\n print_endline (testit \\\"MCMXC\\\" 1990);\\n print_endline (testit \\\"MMVIII\\\" 2008);\\n print_endline (testit \\\"MDCLXVI\\\" 1666);\\n print_newline ();\\n\\n print_endline \\\">>> Roman numbers with lower case letters are OK.\\\";\\n print_endline (testit \\\"McmXC\\\" 1990);\\n print_endline (testit \\\"MMviii\\\" 2008);\\n print_endline (testit \\\"mdCLXVI\\\" 1666);\\n print_newline ();\\n\\n print_endline \\\">>> Incorrect roman digits are ignored.\\\";\\n print_endline (testit \\\"McmFFXC\\\" 1990);\\n print_endline (testit \\\"MMviiiPPPPP\\\" 2008);\\n print_endline (testit \\\"mdCLXVI_WHAT_NOW\\\" 1666);\\n print_endline (testit \\\"2 * PI ^ 2\\\" 1); (* The I in PI... *)\\n print_endline (testit \\\"E = MC^2\\\" 1100)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"fromRoman(s)={\\n my(v=Vecsmall(s),key=vector(88),cur,t=0,tmp);\\n key[73]=1;key[86]=5;key[88]=10;key[76]=50;key[67]=100;key[68]=500;key[77]=1000;\\n cur=key[v[1]];\\n for(i=2,#v,\\n tmp=key[v[i]];\\n if(!cur, cur=tmp; next);\\n if(tmp>cur,\\n t+=tmp-cur;\\n cur=0\\n ,\\n t+=cur;\\n cur=tmp\\n )\\n );\\n t+cur\\n};\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use 5.10.0;\\n\\n{\\n my @trans = (\\n [M => 1000], [CM => 900],\\n [D => 500], [CD => 400],\\n [C => 100], [XC => 90],\\n [L => 50], [XL => 40],\\n [X => 10], [IX => 9],\\n [V => 5], [IV => 4],\\n [I => 1],\\n );\\n\\n sub from_roman {\\n my $r = shift;\\n my $n = 0;\\n foreach my $pair (@trans) {\\n my ($k, $v) = @$pair;\\n $n += $v while $r =~ s/^$k//i;\\n }\\n return $n\\n }\\n}\\n\\nsay \\\"$_: \\\", from_roman($_) for qw(MCMXC MDCLXVI MMVIII);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\n\\nuse strict;\\nuse warnings;\\n\\nsub roman2decimal\\n {\\n (local $_, my $sum, my $zeros) = (shift, 0, '');\\n $zeros .= 0 while\\n $sum -= s/I(?=[VX])// - s/V// * 5 - s/I//g . $zeros,\\n tr/MDCLX/CLXVI/;\\n return $sum;\\n }\\n\\nprint s/$/ \\\": \\\" . roman2decimal($_) /er while <DATA>;\\n\\n__DATA__\\nMCMXC\\nMMVIII\\nMDCLXVI\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\n\\nuse strict;\\nuse warnings;\\n\\nsub roman2decimal\\n {\\n my $sum = 0;\\n $sum += $^R while $_[0] =~\\n / M (?{1000})\\n | D (?{ 500})\\n | C (?{ 100}) (?= [MD] (?{-100}) )?\\n | L (?{ 50})\\n | X (?{ 10}) (?= [CL] (?{ -10}) )?\\n | V (?{ 5})\\n | I (?{ 1}) (?= [XV] (?{ -1}) )?\\n /gx;\\n return $sum;\\n }\\n\\nprint s/$/ \\\": \\\" . roman2decimal($_) /er while <DATA>;\\n\\n__DATA__\\nMCMXC\\nMMVIII\\nMDCLXVI\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"with javascript_semantics\\nfunction romanDec(string s)\\n integer res = 0, prev = 0\\n for i=length(s) to 1 by -1 do\\n integer rdx = find(upper(s[i]),\\\"IVXLCDM\\\"),\\n rn = power(10,floor((rdx-1)/2))\\n if even(rdx) then rn *= 5 end if\\n res += iff(rn<prev?-rn:rn)\\n prev = rn\\n end for\\n return {s,res} -- (for output)\\nend function\\n\\n?apply({\\\"MCMXC\\\",\\\"MMVIII\\\",\\\"MDCLXVI\\\"},romanDec)\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"with javascript_semantics\\nrequires(\\\"1.0.5\\\")\\nfunction romanDec(string s)\\n return {s,scanf(s,\\\"%R\\\")[1][1]}\\nend function\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"def romanDec /# s -- n #/\\n 0 >ps 0 >ps\\n ( ( \\\"M\\\" 1000 ) ( \\\"D\\\" 500 ) ( \\\"C\\\" 100 ) ( \\\"L\\\" 50 ) ( \\\"X\\\" 10 ) ( \\\"V\\\" 5 ) ( \\\"I\\\" 1 ) )\\n\\n swap upper reverse\\n len while\\n pop rot rot tochar getd\\n if\\n dup ps> < if 0 swap - endif\\n dup ps> + >ps\\n >ps\\n swap\\n else\\n \\\"Error: \\\" print ? \\\"\\\"\\n endif\\n len\\n endwhile\\n drop drop\\n ps> drop ps>\\nenddef\\n\\n/# usage example: \\\"MMXX\\\" romanDec ? (show 2020) #/\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"\\\"MDCLXVI\\\" var romans\\n( 1000 500 100 50 10 5 1 ) var decmls\\n\\ndef romanDec /# s -- n #/\\n 0 var prev\\n 0 var res\\n upper\\n ( len 1 -1 ) for\\n get\\n romans swap find nip\\n dup if\\n decmls swap get nip\\n dup prev < if 0 swap - endif\\n dup res + var res\\n var prev\\n else\\n \\\"Error\\\" ? 0 var res exitfor\\n endif\\n endfor\\n drop\\n res\\nenddef\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"<?php\\n/**\\n * @author Elad Yosifon\\n */\\n$roman_to_decimal = array(\\n\\t'I' => 1,\\n\\t'V' => 5,\\n\\t'X' => 10,\\n\\t'L' => 50,\\n\\t'C' => 100,\\n\\t'D' => 500,\\n\\t'M' => 1000,\\n);\\n\\n/**\\n * @param $number\\n * @return int\\n */\\nfunction roman2decimal($number)\\n{\\n\\tglobal $roman_to_decimal;\\n\\n\\t// breaks the string into an array of chars\\n\\t$digits = str_split($number);\\n\\t$lastIndex = count($digits)-1;\\n\\t$sum = 0;\\n\\n\\tforeach($digits as $index => $digit)\\n\\t{\\n\\t\\tif(!isset($digits[$index]))\\n\\t\\t{\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tif(isset($roman_to_decimal[$digit]))\\n\\t\\t{\\n\\t\\t\\tif($index < $lastIndex)\\n\\t\\t\\t{\\n\\t\\t\\t\\t$left = $roman_to_decimal[$digits[$index]];\\n\\t\\t\\t\\t$right = $roman_to_decimal[$digits[$index+1]];\\n\\t\\t\\t\\tif($left < $right)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t$sum += ($right - $left);\\n\\t\\t\\t\\t\\tunset($digits[$index+1],$left, $right);\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tunset($left, $right);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t$sum += $roman_to_decimal[$digit];\\n\\t}\\n\\n\\treturn $sum;\\n}\\n\\n/*============= OUTPUT =============*/\\nheader('Content-Type: text/plain');\\n\\n$tests = array(\\n\\t\\\"I\\\" => array(roman2decimal('I'), 1),\\n\\t\\\"II\\\" => array(roman2decimal('II'), 2),\\n\\t\\\"III\\\" => array(roman2decimal('III'), 3),\\n\\t\\\"IV\\\" => array(roman2decimal('IV'), 4),\\n\\t\\\"V\\\" => array(roman2decimal('V'), 5),\\n\\t\\\"VI\\\" => array(roman2decimal('VI'), 6),\\n\\t\\\"VII\\\" => array(roman2decimal('VII'), 7),\\n\\t\\\"IX\\\" => array(roman2decimal('IX'), 9),\\n\\t\\\"X\\\" => array(roman2decimal('X'), 10),\\n\\t\\\"XI\\\" => array(roman2decimal('XI'), 11),\\n\\t\\\"XIV\\\" => array(roman2decimal('XIV'), 14),\\n\\t\\\"XV\\\" => array(roman2decimal('XV'), 15),\\n\\t\\\"XVI\\\" => array(roman2decimal('XVI'), 16),\\n\\t\\\"XVIV\\\" => array(roman2decimal('XVIV'), 19),\\n\\t\\\"XIX\\\" => array(roman2decimal('XIX'), 19),\\n\\t\\\"MDCLXVI\\\" => array(roman2decimal('MDCLXVI'), 1666),\\n\\t\\\"MCMXC\\\" => array(roman2decimal('MCMXC'), 1990),\\n\\t\\\"MMVIII\\\" => array(roman2decimal('MMVIII'), 2008),\\n\\t\\\"MMMCLIX\\\" => array(roman2decimal('MMMCLIX'), 3159),\\n\\t\\\"MCMLXXVII\\\" => array(roman2decimal('MCMLXXVII'), 1977),\\n);\\n\\n\\nforeach($tests as $key => $value)\\n{\\n\\techo \\\"($key == {$value[0]}) => \\\" . ($value[0] === $value[1] ? \\\"true\\\" : \\\"false, should be {$value[1]}.\\\") . \\\"\\\\n\\\";\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"go =>\\n List = [\\\"IV\\\",\\n \\\"XLII\\\",\\n \\\"M\\\",\\n \\\"MCXI\\\",\\n \\\"CMXI\\\",\\n \\\"MCM\\\",\\n \\\"MCMXC\\\",\\n \\\"MMVIII\\\",\\n \\\"MMIX\\\",\\n \\\"MCDXLIV\\\",\\n \\\"MDCLXVI\\\",\\n \\\"MMXII\\\"],\\n foreach(R in List)\\n printf(\\\"%-8s: %w\\\\n\\\", R, roman_decode(R))\\n end,\\n nl.\\n\\n\\nroman_decode(Str) = Res =>\\n if Str == \\\"\\\" then\\n Res := \\\"\\\"\\n else\\n D = new_map(findall((R=D), roman(R,D))),\\n Res = 0,\\n Old = 0,\\n foreach(S in Str)\\n N = D.get(S),\\n % Fix for the Roman convention that XC = 90, not 110.\\n if Old > 0, N > Old then\\n Res := Res - 2*Old\\n end,\\n Res := Res + N,\\n Old := N\\n end\\n end.\\n\\nroman('I', 1).\\nroman('V', 5).\\nroman('X', 10).\\nroman('L', 50).\\nroman('C', 100).\\nroman('D', 500).\\nroman('M', 1000).\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de roman2decimal (Rom)\\n (let L (replace (chop Rom) 'M 1000 'D 500 'C 100 'L 50 'X 10 'V 5 'I 1)\\n (sum '((A B) (if (>= A B) A (- A))) L (cdr L)) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"test_decode: procedure options (main); /* 28 January 2013 */\\n declare roman character (20) varying;\\n\\n do roman = 'i', 'ii', 'iii', 'iv', 'v', 'vi', 'vii', 'viii', 'iix',\\n 'ix', 'x', 'xi', 'xiv', 'MCMLXIV', 'MCMXC', 'MDCLXVI',\\n 'MIM', 'MM', 'MMXIII';\\n put skip list (roman, decode(roman));\\n end;\\n\\ndecode: procedure (roman) returns (fixed(15));\\n declare roman character (*) varying;\\n declare (current, previous) character (1);\\n declare n fixed (15);\\n declare i fixed binary;\\n\\n previous = ''; n = 0;\\n do i = length(roman) to 1 by -1;\\n current = substr(roman, i, 1);\\n if digit_value(current) < digit_value(previous) then\\n n = n - digit_value(current);\\n else if digit_value(current) > digit_value(previous) then\\n do;\\n n = n + digit_value(current);\\n previous = current;\\n end;\\n else\\n n = n + digit_value(current);\\n end;\\n return (n);\\nend decode;\\n\\ndigit_value: procedure (roman_char) returns (fixed);\\n declare roman_char character(1);\\n select (roman_char);\\n when ('M', 'm') return (1000);\\n when ('D', 'd') return (500);\\n when ('C', 'c') return (100);\\n when ('L', 'l') return (50);\\n when ('X', 'x') return (10);\\n when ('V', 'v') return (5);\\n when ('I', 'i') return (1);\\n otherwise return (0);\\n end;\\nend digit_value;\\n\\nend test_decode;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"100H:\\n/* CP/M CALLS */\\nBDOS: PROCEDURE (FN, ARG); DECLARE FN BYTE, ARG ADDRESS; GO TO 5; END BDOS;\\nEXIT: PROCEDURE; CALL BDOS(0,0); END EXIT;\\nPRINT: PROCEDURE (S); DECLARE S ADDRESS; CALL BDOS(9,S); END PRINT;\\n\\n/* CP/M COMMAND LINE ARGUMENT */\\nDECLARE ARG$LPTR ADDRESS INITIAL (80H), ARG$LEN BASED ARG$LPTR BYTE;\\nDECLARE ARG$PTR ADDRESS INITIAL (81H), ARG BASED ARG$PTR BYTE;\\n\\n/* CONVERT ROMAN NUMERAL TO BINARY */\\nREAD$ROMAN: PROCEDURE (RP) ADDRESS;\\n DECLARE DIGITS (7) BYTE INITIAL ('MDCLXVI');\\n DECLARE VALUES (7) ADDRESS INITIAL (1000,500,100,50,10,5,1);\\n DECLARE (RP, V, DVAL) ADDRESS, R BASED RP BYTE;\\n V = 0;\\n\\n GET$DIGIT: PROCEDURE (D) ADDRESS;\\n DECLARE (D, I) BYTE;\\n DO I = 0 TO LAST(DIGITS);\\n IF DIGITS(I) = D THEN RETURN VALUES(I);\\n END;\\n RETURN 0; /* NOT FOUND */\\n END GET$DIGIT;\\n\\n DO WHILE R <> '$';\\n DVAL = GET$DIGIT(R);\\n IF DVAL = 0 THEN RETURN 0; /* ERROR */\\n RP = RP + 1;\\n IF GET$DIGIT(R) > DVAL THEN\\n V = V - DVAL; /* SUBTRACTIVE PRINCIPLE */\\n ELSE\\n V = V + DVAL;\\n END;\\n RETURN V;\\nEND READ$ROMAN;\\n\\n/* PRINT BINARY NUMBER AS DECIMAL */\\nPRINT$NUMBER: PROCEDURE (N);\\n DECLARE S (6) BYTE INITIAL ('.....$');\\n DECLARE (N, P) ADDRESS, C BASED P BYTE;\\n P = .S(5);\\nDIGIT:\\n P = P - 1;\\n C = N MOD 10 + '0';\\n N = N / 10;\\n IF N > 0 THEN GO TO DIGIT;\\n CALL PRINT(P);\\nEND PRINT$NUMBER;\\n\\nIF ARG$LEN = 0 THEN DO;\\n CALL PRINT(.'NO INPUT$');\\n CALL EXIT;\\nEND;\\n\\nARG(ARG$LEN) = '$'; /* TERMINATE ARGUMENT STRING */\\nCALL PRINT(.ARG(1)); /* PRINT ROMAN NUMERAL */\\nCALL PRINT(.': $');\\nCALL PRINT$NUMBER(READ$ROMAN(.ARG(1))); /* CONVERT AND PRINT VALUE */\\nCALL EXIT;\\nEOF\\n\",\n \"language\": \"PL-M\"\n },\n {\n \"code\": \"/*****************************************************************\\n * $Author: Atanas Kebedjiev $\\n *****************************************************************\\n * PL/SQL code can be run as anonymous block.\\n * To test, execute the whole script or create the functions and then e.g. 'select rdecode('2012') from dual;\\n * Please note that task definition does not describe fully some current rules, such as\\n * * subtraction - IX XC CM are the valid subtraction combinations\\n * * A subtraction character cannot be repeated: 8 is expressed as VIII and not as IIX\\n * * V L and D cannot be used for subtraction\\n * * Any numeral cannot be repeated more than 3 times: 1910 should be MCMX and not MDCCCCX\\n * Code below does not validate the Roman numeral itself and will return a result even for a non-compliant number\\n * E.g. both MCMXCIX and IMM will return 1999 but the first one is the correct notation\\n */\\n\\nDECLARE\\n\\nFUNCTION rvalue(c IN CHAR) RETURN NUMBER IS\\n i INTEGER;\\nBEGIN\\n i := 0;\\n CASE (c)\\n when 'M' THEN i := 1000;\\n when 'D' THEN i := 500;\\n when 'C' THEN i := 100;\\n when 'L' THEN i := 50;\\n when 'X' THEN i := 10;\\n when 'V' THEN i := 5;\\n when 'I' THEN i := 1;\\n END CASE;\\n RETURN i;\\nEND;\\n\\n\\nFUNCTION decode(rn IN VARCHAR2) RETURN NUMBER IS\\n i INTEGER;\\n l INTEGER;\\n cr CHAR; -- current Roman numeral as substring from r\\n cv INTEGER; -- value of current Roman numeral\\n\\n gr CHAR; -- next Roman numeral\\n gv NUMBER; -- value of the next numeral;\\n\\n dv NUMBER; -- decimal value to return\\nBEGIN\\n l := length(rn);\\n i := 1;\\n dv := 0;\\n while (i <= l)\\n LOOP\\n cr := substr(rn,i,1);\\n cv := rvalue(cr);\\n\\n /* Look for a larger numeral in next position, like IV or CM\\n The number to subtract should be at least 1/10th of the bigger number\\n CM and XC are valid, but IC and XM are not */\\n IF (i < l) THEN\\n gr := substr(rn,i+1,1);\\n gv := rvalue(gr);\\n IF (cv < gv ) THEN\\n dv := dv - cv;\\n ELSE\\n dv := dv + cv;\\n END IF;\\n ELSE\\n dv := dv + cv;\\n END IF; -- need to add the last value unconditionally\\n\\n i := i + 1;\\n END LOOP;\\n\\nRETURN dv;\\n\\nEND;\\n\\nBEGIN\\n\\n DBMS_OUTPUT.PUT_LINE ('MMXII = ' || rdecode('MMXII')); -- 2012\\n DBMS_OUTPUT.PUT_LINE ('MCMLI = ' || rdecode('MCMLI')); -- 1951\\n DBMS_OUTPUT.PUT_LINE ('MCMLXXXVII = ' || rdecode('MCMLXXXVII')); -- 1987\\n DBMS_OUTPUT.PUT_LINE ('MDCLXVI = ' || rdecode('MDCLXVI')); -- 1666\\n DBMS_OUTPUT.PUT_LINE ('MCMXCIX = ' || rdecode('MCMXCIX')); -- 1999\\n\\nEND;\\n\",\n \"language\": \"PL-SQL\"\n },\n {\n \"code\": \"Filter FromRoman {\\n\\t$output = 0\\n\\t\\n\\tif ($_ -notmatch '^(M{1,3}|)(CM|CD|D?C{0,3}|)(XC|XL|L?X{0,3}|)(IX|IV|V?I{0,3}|)$') {\\n\\t\\tthrow 'Incorrect format'\\n\\t}\\n\\t\\n\\t$current = 1000\\n\\t$subtractor = 'M'\\n\\t$whole = $False\\n\\t$roman = $_\\n\\t'C','D','X','L','I','V',' ' `\\n\\t| %{\\n\\t\\tif ($whole = !$whole) {\\n\\t\\t\\t$current /= 10\\n\\t\\t\\t$subtractor = $_ + $subtractor[0]\\n\\t\\t\\t$_ = $subtractor[1]\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\t$subtractor = $subtractor[0] + $_\\n\\t\\t}\\n\\t\\t\\n\\t\\tif ($roman -match $subtractor) {\\n\\t\\t\\t$output += $current * (4,9)[$whole]\\n\\t\\t\\t$roman = $roman -replace $subtractor,''\\n\\t\\t}\\n\\t\\tif ($roman -match ($_ + '{1,3}')) {\\n\\t\\t\\t$output += $current * (5,10)[$whole] * $Matches[0].Length\\n\\t\\t}\\n\\t}\\n\\t\\n\\t$output\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"'XIX','IV','','MMCDLXXIX','MMMI' | FromRoman\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"decode_digit(i, 1).\\ndecode_digit(v, 5).\\ndecode_digit(x, 10).\\ndecode_digit(l, 50).\\ndecode_digit(c, 100).\\ndecode_digit(d, 500).\\ndecode_digit(m, 1000).\\n\\ndecode_string(Sum, _, [], Sum).\\n\\ndecode_string(LastSum, LastValue, [Digit|Rest], NextSum) :-\\n decode_digit(Digit, Value),\\n Value < LastValue,\\n Sum is LastSum - Value,\\n decode_string(Sum, Value, Rest, NextSum).\\n\\ndecode_string(LastSum, LastValue, [Digit|Rest], NextSum) :-\\n decode_digit(Digit, Value),\\n Value >= LastValue,\\n Sum is LastSum + Value,\\n decode_string(Sum, Value, Rest, NextSum).\\n\\ndecode_string(Atom, Value) :-\\n atom_chars(Atom, String),\\n reverse(String, [Last|Rest]),\\n decode_digit(Last, Start),\\n decode_string(Start, Start, Rest, Value).\\n\\ntest :-\\n decode_string(mcmxc, 1990),\\n decode_string(mmviii, 2008),\\n decode_string(mdclxvi, 1666).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Procedure romanDec(roman.s)\\n Protected i, n, lastval, arabic\\n\\n For i = Len(roman) To 1 Step -1\\n Select UCase(Mid(roman, i, 1))\\n Case \\\"M\\\"\\n n = 1000\\n Case \\\"D\\\"\\n n = 500\\n Case \\\"C\\\"\\n n = 100\\n Case \\\"L\\\"\\n n = 50\\n Case \\\"X\\\"\\n n = 10\\n Case \\\"V\\\"\\n n = 5\\n Case \\\"I\\\"\\n n = 1\\n Default\\n n = 0\\n EndSelect\\n If (n < lastval)\\n arabic - n\\n Else\\n arabic + n\\n EndIf\\n lastval = n\\n Next\\n\\n ProcedureReturn arabic\\nEndProcedure\\n\\nIf OpenConsole()\\n PrintN(Str(romanDec(\\\"MCMXCIX\\\"))) ;1999\\n PrintN(Str(romanDec(\\\"MDCLXVI\\\"))) ;1666\\n PrintN(Str(romanDec(\\\"XXV\\\"))) ;25\\n PrintN(Str(romanDec(\\\"CMLIV\\\"))) ;954\\n PrintN(Str(romanDec(\\\"MMXI\\\"))) ;2011\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\"): Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"_rdecode = dict(zip('MDCLXVI', (1000, 500, 100, 50, 10, 5, 1)))\\n\\ndef decode( roman ):\\n result = 0\\n for r, r1 in zip(roman, roman[1:]):\\n rd, rd1 = _rdecode[r], _rdecode[r1]\\n result += -rd if rd < rd1 else rd\\n return result + _rdecode[roman[-1]]\\n\\nif __name__ == '__main__':\\n for r in 'MCMXC MMVIII MDCLXVI'.split():\\n print( r, decode(r) )\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"roman_values = (('I',1), ('IV',4), ('V',5), ('IX',9),('X',10),('XL',40),('L',50),('XC',90),('C',100),\\n ('CD', 400), ('D', 500), ('CM', 900), ('M',1000))\\n\\ndef roman_value(roman):\\n total=0\\n for symbol,value in reversed(roman_values):\\n while roman.startswith(symbol):\\n total += value\\n roman = roman[len(symbol):]\\n return total\\n\\nif __name__=='__main__':\\n for value in \\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MDCLXVI\\\":\\n print('%s = %i' % (value, roman_value(value)))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"numerals = { 'M' : 1000, 'D' : 500, 'C' : 100, 'L' : 50, 'X' : 10, 'V' : 5, 'I' : 1 }\\ndef romannumeral2number(s):\\n return reduce(lambda x, y: -x + y if x < y else x + y, map(lambda x: numerals.get(x, 0), s.upper()))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Roman numerals decoded'''\\n\\nfrom operator import mul\\nfrom functools import reduce\\nfrom collections import defaultdict\\nfrom itertools import accumulate, chain, cycle\\n\\n\\n# intFromRoman :: String -> Maybe Int\\ndef intFromRoman(s):\\n '''Just the integer represented by a Roman\\n numeral string, or Nothing if any\\n characters are unrecognised.\\n '''\\n dct = defaultdict(\\n lambda: None,\\n zip(\\n 'IVXLCDM',\\n accumulate(chain([1], cycle([5, 2])), mul)\\n )\\n )\\n\\n def go(mb, x):\\n '''Just a letter value added to or\\n subtracted from a total, or Nothing\\n if no letter value is defined.\\n '''\\n if None in (mb, x):\\n return None\\n else:\\n r, total = mb\\n return x, total + (-x if x < r else x)\\n\\n return bindMay(reduce(\\n go,\\n [dct[k.upper()] for k in reversed(list(s))],\\n (0, 0)\\n ))(snd)\\n\\n\\n# ------------------------- TEST -------------------------\\ndef main():\\n '''Testing a sample of dates.'''\\n\\n print(\\n fTable(__doc__ + ':\\\\n')(str)(\\n maybe('(Contains unknown character)')(str)\\n )(\\n intFromRoman\\n )([\\n \\\"MDCLXVI\\\", \\\"MCMXC\\\", \\\"MMVIII\\\",\\n \\\"MMXVI\\\", \\\"MMXVIII\\\", \\\"MMZZIII\\\"\\n ])\\n )\\n\\n\\n# ----------------------- GENERIC ------------------------\\n\\n# bindMay (>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b\\ndef bindMay(m):\\n '''Injection operator for the Maybe monad.\\n If m is Nothing, it is passed straight through.\\n If m is Just(x), the result is an application\\n of the (a -> Maybe b) function (mf) to x.'''\\n return lambda mf: (\\n m if None is m else mf(m)\\n )\\n\\n\\n# maybe :: b -> (a -> b) -> Maybe a -> b\\ndef maybe(v):\\n '''Either the default value v, if m is Nothing,\\n or the application of f to x,\\n where m is Just(x).\\n '''\\n return lambda f: lambda m: v if None is m else (\\n f(m)\\n )\\n\\n\\n# snd :: (a, b) -> b\\ndef snd(ab):\\n '''Second member of a pair.'''\\n return ab[1]\\n\\n\\n# ---------------------- FORMATTING ----------------------\\n\\n# fTable :: String -> (a -> String) ->\\n# (b -> String) -> (a -> b) -> [a] -> String\\ndef fTable(s):\\n '''Heading -> x display function ->\\n fx display function -> f -> xs -> tabular string.\\n '''\\n def go(xShow, fxShow, f, xs):\\n ys = [xShow(x) for x in xs]\\n w = max(map(len, ys))\\n return s + '\\\\n' + '\\\\n'.join(map(\\n lambda x, y: (\\n f'{y.rjust(w, \\\" \\\")} -> {fxShow(f(x))}'\\n ),\\n xs, ys\\n ))\\n return lambda xShow: lambda fxShow: lambda f: (\\n lambda xs: go(xShow, fxShow, f, xs)\\n )\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"SCREEN _NEWIMAGE(400, 600, 32)\\n\\n\\nCLS\\n\\n\\nMain:\\n'------------------------------------------------\\n' CALLS THE romToDec FUNCTION WITH THE ROMAN\\n' NUMERALS AND RETURNS ITS DECIMAL EQUIVELENT.\\n'\\n PRINT \\\"ROMAN NUMERAL TO DECIMAL CONVERSION\\\"\\n PRINT: PRINT\\n\\n PRINT \\\"MDCCIV = \\\"; romToDec(\\\"MDCCIV\\\") '1704\\n PRINT \\\"MCMXC = \\\"; romToDec(\\\"MCMXC\\\") '1990\\n PRINT \\\"MMVIII = \\\"; romToDec(\\\"MMVIII\\\") '2008\\n PRINT \\\"MDCLXVI = \\\"; romToDec(\\\"MDCLXVI\\\") '1666\\n PRINT: PRINT\\n PRINT \\\"Here are other solutions not from the TASK:\\\"\\n PRINT \\\"MCMXCIX = \\\"; romToDec(\\\"MCMXCIX\\\") '1999\\n PRINT \\\"XXV = \\\"; romToDec(\\\"XXV\\\") '25\\n PRINT \\\"CMLIV = \\\"; romToDec(\\\"CMLIV\\\") '954\\n PRINT \\\"MMXI = \\\"; romToDec(\\\"MMXI\\\") '2011\\n PRINT \\\"MMIIIX = \\\"; romToDec(\\\"MMIIIX\\\") '2011\\n PRINT: PRINT\\n PRINT \\\"2011 can be written either as MMXI or MMIIIX\\\"\\n PRINT \\\"With the IX = 9, MMIIIX is also 2011.\\\"\\n PRINT \\\"2011 IS CORRECT (MM=2000 + II = 2 + IX = 9)\\\"\\n\\n END\\n\\n\\n\\nFUNCTION romToDec (roman AS STRING)\\n'------------------------------------------------------\\n' FUNCTION THAT CONVERTS ANY ROMAN NUMERAL TO A DECIMAL\\n'\\n prenum = 0: num = 0\\n LN = LEN(roman)\\n FOR i = LN TO 1 STEP -1\\n x$ = MID$(roman, i, 1)\\n n = 1000\\n SELECT CASE x$\\n CASE \\\"M\\\": n = n / 1\\n CASE \\\"D\\\": n = n / 2\\n CASE \\\"C\\\": n = n / 10\\n CASE \\\"L\\\": n = n / 20\\n CASE \\\"X\\\": n = n / 100\\n CASE \\\"V\\\": n = n / 200\\n CASE \\\"I\\\": n = n / n\\n CASE ELSE: n = 0\\n END SELECT\\n IF n < prenum THEN num = num - n ELSE num = num + n\\n prenum = n\\n NEXT i\\n\\n romToDec = num\\n\\nEND FUNCTION\\n\",\n \"language\": \"QB64\"\n },\n {\n \"code\": \"FUNCTION romToDec (roman$)\\n num = 0\\n prenum = 0\\n FOR i = LEN(roman$) TO 1 STEP -1\\n x$ = MID$(roman$, i, 1)\\n n = 0\\n IF x$ = \\\"M\\\" THEN n = 1000\\n IF x$ = \\\"D\\\" THEN n = 500\\n IF x$ = \\\"C\\\" THEN n = 100\\n IF x$ = \\\"L\\\" THEN n = 50\\n IF x$ = \\\"X\\\" THEN n = 10\\n IF x$ = \\\"V\\\" THEN n = 5\\n IF x$ = \\\"I\\\" THEN n = 1\\n\\n IF n < preNum THEN num = num - n ELSE num = num + n\\n preNum = n\\n NEXT i\\n\\n romToDec = num\\nEND FUNCTION\\n\\n!Testing\\nPRINT \\\"MCMXCIX = \\\"; romToDec(\\\"MCMXCIX\\\") '1999\\nPRINT \\\"MDCLXVI = \\\"; romToDec(\\\"MDCLXVI\\\") '1666\\nPRINT \\\"XXV = \\\"; romToDec(\\\"XXV\\\") '25\\nPRINT \\\"CMLIV = \\\"; romToDec(\\\"CMLIV\\\") '954\\nPRINT \\\"MMXI = \\\"; romToDec(\\\"MMXI\\\") '2011\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \" [ 2dup <\\n if\\n [ dip\\n [ 2 * - ]\\n dup ]\\n nip dup\\n rot + swap ] is roman ( t p n --> t p )\\n\\n [ 1 roman ] is I ( t p --> t p )\\n [ 5 roman ] is V ( t p --> t p )\\n [ 10 roman ] is X ( t p --> t p )\\n [ 50 roman ] is L ( t p --> t p )\\n [ 100 roman ] is C ( t p --> t p )\\n [ 500 roman ] is D ( t p --> t p )\\n [ 1000 roman ] is M ( t p --> t p )\\n\\n [ 0 1000 rot\\n $ \\\"\\\" swap\\n witheach\\n [ space join\\n join ]\\n quackery\\n drop ] is ->arabic ( $ --> n )\\n\\n $ \\\" MCMXC\\\" dup echo$ say \\\" = \\\" ->arabic echo cr\\n $ \\\" MMVIII\\\" dup echo$ say \\\" = \\\" ->arabic echo cr\\n $ \\\"MDCLXVI\\\" dup echo$ say \\\" = \\\" ->arabic echo cr\\n cr\\n $ \\\"I MIX VIVID MILD MIMIC\\\"\\n dup echo$ say \\\" = \\\" ->arabic echo cr\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"romanToArabic <- function(roman) {\\n romanLookup <- c(I=1L, V=5L, X=10L, L=50L, C=100L, D=500L, M=1000L)\\n rSplit <- strsplit(toupper(roman), character(0)) # Split input vector into characters\\n toArabic <- function(item) {\\n digits <- romanLookup[item]\\n if (length(digits) > 1L) {\\n smaller <- (digits[-length(digits)] < digits[-1L])\\n digits[smaller] <- - digits[smaller]\\n }\\n sum(digits)\\n }\\n vapply(rSplit, toArabic, integer(1))\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"romanToArabic(c(\\\"MCMXII\\\", \\\"LXXXVI\\\"))\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"as.integer(as.roman(c(\\\"MCMXII\\\", \\\"LXXXVI\\\"))\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(define (decode/roman number)\\n (define letter-values\\n (map cons '(#\\\\M #\\\\D #\\\\C #\\\\L #\\\\X #\\\\V #\\\\I) '(1000 500 100 50 10 5 1)))\\n (define (get-value letter)\\n (cdr (assq letter letter-values)))\\n (define lst (map get-value (string->list number)))\\n (+ (last lst)\\n (for/fold ((sum 0))\\n ((i (in-list lst)) (i+1 (in-list (cdr lst))))\\n (+ sum\\n (if (> i+1 i)\\n (- i)\\n i)))))\\n\\n(map decode/roman '(\\\"MCMXC\\\" \\\"MMVIII\\\" \\\"MDCLXVI\\\"))\\n;-> '(1990 2008 1666)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub rom-to-num($r) {\\n [+] gather $r.uc ~~ /\\n ^\\n [\\n | M { take 1000 }\\n | CM { take 900 }\\n | D { take 500 }\\n | CD { take 400 }\\n | C { take 100 }\\n | XC { take 90 }\\n | L { take 50 }\\n | XL { take 40 }\\n | X { take 10 }\\n | IX { take 9 }\\n | V { take 5 }\\n | IV { take 4 }\\n | I { take 1 }\\n ]+\\n $\\n /;\\n}\\n\\nsay \\\"$_ => &rom-to-num($_)\\\" for <MCMXC MDCLXVI MMVIII>;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"sub rom-to-num($r) {\\n [+] gather $r.uc ~~ /\\n ^\\n ( (C*)M { take 1000 - 100 * $0.chars } )*\\n ( (C*)D { take 500 - 100 * $0.chars } )?\\n ( (X*)C { take 100 - 10 * $0.chars } )*\\n ( (X*)L { take 50 - 10 * $0.chars } )?\\n ( (I*)X { take 10 - $0.chars } )*\\n ( (I*)V { take 5 - $0.chars } )?\\n ( I { take 1 } )*\\n [ $ || { return NaN } ]\\n /;\\n}\\n\\nsay \\\"$_ => \\\", rom-to-num($_) for <MCMXC mdclxvi MMViii IIXX ILL>;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"Red [\\n Purpose: \\\"Arabic <-> Roman numbers converter\\\"\\n Author: \\\"Didier Cadieu\\\"\\n Date: \\\"07-Oct-2016\\\"\\n]\\n\\ntable-r2a: reverse [1000 \\\"M\\\" 900 \\\"CM\\\" 500 \\\"D\\\" 400 \\\"CD\\\" 100 \\\"C\\\" 90 \\\"XC\\\" 50 \\\"L\\\" 40 \\\"XL\\\" 10 \\\"X\\\" 9 \\\"IX\\\" 5 \\\"V\\\" 4 \\\"IV\\\" 1 \\\"I\\\"]\\n\\nroman-to-arabic: func [r [string!] /local a b e] [\\n\\ta: 0\\n\\tparse r [any [b: [\\\"I\\\" [\\\"V\\\" | \\\"X\\\" | none] | \\\"X\\\" [\\\"L\\\" | \\\"C\\\" | none] | \\\"C\\\" [\\\"D\\\" | \\\"M\\\" | none] | \\\"V\\\" | \\\"L\\\" | \\\"D\\\" | \\\"M\\\"] e: (a: a + select table-r2a copy/part b e)]]\\n\\ta\\n]\\n\\n; Example usage:\\nprint roman-to-arabic \\\"XXXIII\\\"\\nprint roman-to-arabic \\\"MDCCCLXXXVIII\\\"\\nprint roman-to-arabic \\\"MMXVI\\\"\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"$ENTRY Go {\\n = <Prout <RomanDecode 'MCMXC'>>\\n <Prout <RomanDecode 'MMVIII'>>\\n <Prout <RomanDecode 'MDCLXVI'>>;\\n};\\n\\nRomanDecode {\\n = 0;\\n e.D, <Upper e.D>: {\\n 'M' e.R = <+ 1000 <RomanDecode e.R>>;\\n 'CM' e.R = <+ 900 <RomanDecode e.R>>;\\n 'D' e.R = <+ 500 <RomanDecode e.R>>;\\n 'CD' e.R = <+ 400 <RomanDecode e.R>>;\\n 'C' e.R = <+ 100 <RomanDecode e.R>>;\\n 'XC' e.R = <+ 90 <RomanDecode e.R>>;\\n 'L' e.R = <+ 50 <RomanDecode e.R>>;\\n 'XL' e.R = <+ 40 <RomanDecode e.R>>;\\n 'X' e.R = <+ 10 <RomanDecode e.R>>;\\n 'IX' e.R = <+ 9 <RomanDecode e.R>>;\\n 'V' e.R = <+ 5 <RomanDecode e.R>>;\\n 'IV' e.R = <+ 4 <RomanDecode e.R>>;\\n 'I' e.R = <+ 1 <RomanDecode e.R>>;\\n };\\n};\\n\",\n \"language\": \"Refal\"\n },\n {\n \"code\": \"/* Rexx */\\n\\nDo\\n /* 1990 2008 1666 */\\n years = 'MCMXC MMVIII MDCLXVI'\\n\\n Do y_ = 1 to words(years)\\n Say right(word(years, y_), 10) || ':' decode(word(years, y_))\\n End y_\\n\\n Return\\nEnd\\nExit\\n\\ndecode:\\n Procedure\\nDo\\n Parse upper arg roman .\\n\\n If verify(roman, 'MDCLXVI') = 0 then Do\\n\\n /* always insert the value of the least significant numeral */\\n decnum = rchar(substr(roman, length(roman), 1))\\n Do d_ = 1 to length(roman) - 1\\n If rchar(substr(roman, d_, 1)) < rchar(substr(roman, d_ + 1, 1)) then Do\\n /* Handle cases where numerals are not in descending order */\\n /* subtract the value of the numeral */\\n decnum = decnum - rchar(substr(roman, d_, 1))\\n End\\n else Do\\n /* Normal case */\\n /* add the value of the numeral */\\n decnum = decnum + rchar(substr(roman, d_, 1))\\n End\\n End d_\\n End\\n else Do\\n decnum = roman 'contains invalid roman numerals'\\n End\\n\\n Return decnum\\nEnd\\nExit\\n\\nrchar:\\n Procedure\\nDo\\n Parse upper arg ch +1 .\\n\\n select\\n when ch = 'M' then digit = 1000\\n when ch = 'D' then digit = 500\\n when ch = 'C' then digit = 100\\n when ch = 'L' then digit = 50\\n when ch = 'X' then digit = 10\\n when ch = 'V' then digit = 5\\n when ch = 'I' then digit = 1\\n otherwise digit = 0\\n end\\n\\n Return digit\\nEnd\\nExit\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program converts Roman numeral number(s) ───► Arabic numerals (or numbers). */\\nrYear = 'MCMXC' ; say right(rYear, 9)\\\":\\\" rom2dec(rYear)\\nrYear = 'mmviii' ; say right(rYear, 9)\\\":\\\" rom2dec(rYear)\\nrYear = 'MDCLXVI' ; say right(rYear, 9)\\\":\\\" rom2dec(rYear)\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nrom2dec: procedure; arg roman . /*obtain the Roman numeral number. */\\nif verify(roman, 'MDCLXVI')\\\\==0 then return \\\"***error*** invalid Roman number:\\\" roman\\n#=rChar(right(roman, 1)) /*start with the last Roman numeral. */\\n do j=1 for length(roman) - 1\\n x=rChar( substr(roman, j , 1) ) /*extract the current Roman numeral. */\\n y=rChar( substr(roman, j+1, 1) ) /*extract the next Roman numeral. */\\n if x<y then # = #-x /*Is x<y ? Then subtract it. */\\n else # = #+x /*Is x≥y ? \\\" add \\\" */\\n end /*j*/\\nreturn #\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nrChar: procedure; arg _ /*convert Roman number to Arabic digits*/\\n if _=='I' then return 1\\n if _=='V' then return 5\\n if _=='X' then return 10\\n if _=='L' then return 50\\n if _=='C' then return 100\\n if _=='D' then return 500\\n if _=='M' then return 1000\\n return 0 /*indicate an invalid Roman numeral. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program converts Roman numeral number(s) ───► Arabic numerals (or numbers). */\\nnumeric digits 1000 /*so we can handle the big numbers. */\\nparse arg z /*obtain optional arguments from the CL*/\\nif z='' then z= \\\"MCMXC mmviii IIXX LU MDCLXVI MDWLXVI ((mmm)) [[[[[D]]]]]\\\" /*defaults.*/\\n\\n do j=1 for words(z); y=word(z, j) /*process each of the Roman numbers. */\\n say right(y, 20)':' rom2dec(y) /*display original and decimal version.*/\\n end /*j*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nrom2dec: procedure; h='0'x; #=0; $=1; arg n . /*\\\"ARG\\\" uppercases N. */\\nn=translate(n, '()()', \\\"[]{}\\\"); _=verify(n, 'MDCLXVUIJ()') /*trans grouping symbols.*/\\nif _\\\\==0 then return '***error*** invalid Roman numeral:' substr(n,_,1) /*tell error*/\\n@.=1; @.m=1000; @.d=500; @.c=100; @.l=50; @.x=10; @.u=5; @.v=5 /*Roman numeral values. */\\n /* [↓] convert number. */\\n do k=length(n) to 1 by -1; _=substr(n, k, 1) /*examine a Roman numeral*/\\n /* [↑] scale up or down.*/\\n if _=='(' | _==\\\")\\\" then do; $=$*1000; if _=='(' then $=1 /* (≡scale ↑; )≡scale ↓ */\\n iterate /*go & process next digit*/\\n end\\n _=@._*$ /*scale it if necessary. */\\n if _>h then h=_ /*remember Roman numeral.*/\\n if _<h then #=#-_ /*char>next? Then sub. */\\n else #=#+_ /* else add. */\\n end /*k*/\\nreturn # /*return Arabic number. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"symbols = \\\"MDCLXVI\\\"\\nweights = [1000,500,100,50,10,5,1]\\n\\nsee \\\"MCMXCIX = \\\" + romanDec(\\\"MCMXCIX\\\") + nl\\nsee \\\"MDCLXVI =\\\" + romanDec(\\\"MDCLXVI\\\") + nl\\nsee \\\"XXV = \\\" + romanDec(\\\"XXV\\\") + nl\\nsee \\\"CMLIV = \\\" + romanDec(\\\"CMLIV\\\") + nl\\nsee \\\"MMXI = \\\" + romanDec(\\\"MMXI\\\") + nl\\n\\nfunc romanDec roman\\n n = 0\\n lastval = 0\\n arabic = 0\\n for i = len(roman) to 1 step -1\\n n = substr(symbols,roman[i])\\n if n > 0 n = weights[n] ok\\n if n < lastval arabic = arabic - n\\n else arabic = arabic + n ok\\n lastval = n\\n next\\n return arabic\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def fromRoman(roman)\\n r = roman.upcase\\n n = 0\\n until r.empty? do\\n case\\n when r.start_with?('M') then v = 1000; len = 1\\n when r.start_with?('CM') then v = 900; len = 2\\n when r.start_with?('D') then v = 500; len = 1\\n when r.start_with?('CD') then v = 400; len = 2\\n when r.start_with?('C') then v = 100; len = 1\\n when r.start_with?('XC') then v = 90; len = 2\\n when r.start_with?('L') then v = 50; len = 1\\n when r.start_with?('XL') then v = 40; len = 2\\n when r.start_with?('X') then v = 10; len = 1\\n when r.start_with?('IX') then v = 9; len = 2\\n when r.start_with?('V') then v = 5; len = 1\\n when r.start_with?('IV') then v = 4; len = 2\\n when r.start_with?('I') then v = 1; len = 1\\n else\\n raise ArgumentError.new(\\\"invalid roman numerals: \\\" + roman)\\n end\\n n += v\\n r.slice!(0,len)\\n end\\n n\\nend\\n\\n[ \\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MDCLXVI\\\" ].each {|r| p r => fromRoman(r)}\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"SYMBOLS = [ ['M', 1000], ['CM', 900], ['D', 500], ['CD', 400], ['C', 100], ['XC', 90],\\n ['L', 50], ['XL', 40], ['X', 10], ['IX', 9], ['V', 5], ['IV', 4], ['I', 1] ]\\n\\ndef parseRoman(roman)\\n r = roman.upcase\\n n = 0\\n SYMBOLS.each { |sym, val| n += val while r.sub!(/^#{sym}/, \\\"\\\") }\\n n\\nend\\n\\n[ \\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MDCLXVI\\\" ].each {|r| puts \\\"%8s :%5d\\\" % [r, parseRoman(r)]}\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"print \\\"MCMXCIX = \\\"; romToDec( \\\"MCMXCIX\\\") '1999\\nprint \\\"MDCLXVI = \\\"; romToDec( \\\"MDCLXVI\\\") '1666\\nprint \\\"XXV = \\\"; romToDec( \\\"XXV\\\") '25\\nprint \\\"CMLIV = \\\"; romToDec( \\\"CMLIV\\\") '954\\nprint \\\"MMXI = \\\"; romToDec( \\\"MMXI\\\") '2011\\n\\nfunction romToDec(roman$)\\n for i = len(roman$) to 1 step -1\\n x$ = mid$(roman$, i, 1)\\n n = 0\\n if x$ = \\\"M\\\" then n = 1000\\n if x$ = \\\"D\\\" then n = 500\\n if x$ = \\\"C\\\" then n = 100\\n if x$ = \\\"L\\\" then n = 50\\n if x$ = \\\"X\\\" then n = 10\\n if x$ = \\\"V\\\" then n = 5\\n if x$ = \\\"I\\\" then n = 1\\n\\n if n < preNum then num = num - n else num = num + n\\n preNum = n\\n next\\n\\n romToDec =num\\nend function\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"struct RomanNumeral {\\n symbol: &'static str,\\n value: u32\\n}\\n\\nconst NUMERALS: [RomanNumeral; 13] = [\\n RomanNumeral {symbol: \\\"M\\\", value: 1000},\\n RomanNumeral {symbol: \\\"CM\\\", value: 900},\\n RomanNumeral {symbol: \\\"D\\\", value: 500},\\n RomanNumeral {symbol: \\\"CD\\\", value: 400},\\n RomanNumeral {symbol: \\\"C\\\", value: 100},\\n RomanNumeral {symbol: \\\"XC\\\", value: 90},\\n RomanNumeral {symbol: \\\"L\\\", value: 50},\\n RomanNumeral {symbol: \\\"XL\\\", value: 40},\\n RomanNumeral {symbol: \\\"X\\\", value: 10},\\n RomanNumeral {symbol: \\\"IX\\\", value: 9},\\n RomanNumeral {symbol: \\\"V\\\", value: 5},\\n RomanNumeral {symbol: \\\"IV\\\", value: 4},\\n RomanNumeral {symbol: \\\"I\\\", value: 1}\\n];\\n\\nfn to_hindu(roman: &str) -> u32 {\\n match NUMERALS.iter().find(|num| roman.starts_with(num.symbol)) {\\n Some(num) => num.value + to_hindu(&roman[num.symbol.len()..]),\\n None => 0, // if string empty, add nothing\\n }\\n}\\n\\nfn main() {\\n let roms = [\\\"MMXIV\\\", \\\"MCMXCIX\\\", \\\"XXV\\\", \\\"MDCLXVI\\\", \\\"MMMDCCCLXXXVIII\\\"];\\n for &r in &roms {\\n // 15 is minimum formatting width of the first argument, there for alignment\\n println!(\\\"{:2$} = {}\\\", r, to_hindu(r), 15);\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"def fromRoman( r:String ) : Int = {\\n val arabicNumerals = List(\\\"CM\\\"->900,\\\"M\\\"->1000,\\\"CD\\\"->400,\\\"D\\\"->500,\\\"XC\\\"->90,\\\"C\\\"->100,\\n \\\"XL\\\"->40,\\\"L\\\"->50,\\\"IX\\\"->9,\\\"X\\\"->10,\\\"IV\\\"->4,\\\"V\\\"->5,\\\"I\\\"->1)\\t\\n\\n var s = r\\n arabicNumerals.foldLeft(0){ (n,t) => {\\n val l = s.length; s = s.replaceAll(t._1,\\\"\\\"); val c = (l - s.length)/t._1.length // Get the frequency\\n n + (c*t._2) // Add the arabic numerals up\\n } }\\n}\\n\\n// Here is a another version that does a simple running sum:\\ndef fromRoman2(s: String) : Int = {\\n val numerals = Map('I' -> 1, 'V' -> 5, 'X' -> 10, 'L' -> 50, 'C' -> 100, 'D' -> 500, 'M' -> 1000)\\n\\n s.toUpperCase.map(numerals).foldLeft((0,0)) {\\n case ((sum, last), curr) => (sum + curr + (if (last < curr) -2*last else 0), curr) }._1\\n }\\n}\\n\\n// A small test\\ndef test( roman:String ) = println( roman + \\\" => \\\" + fromRoman( roman ) )\\n\\ntest(\\\"MCMXC\\\")\\ntest(\\\"MMVIII\\\")\\ntest(\\\"MDCLXVI\\\")\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(use gauche.collection) ;; for fold2\\n\\n(define (char-val char)\\n (define i (string-scan \\\"IVXLCDM\\\" char))\\n (* (expt 10 (div i 2)) (expt 5 (mod i 2))))\\n\\n(define (decode roman)\\n (fold2\\n (lambda (n sum prev-val)\\n (values ((if (< n prev-val) - +) sum n) (max n prev-val)))\\n 0 0\\n (map char-val (reverse (string->list roman)))))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"(for-each\\n (^s (format #t \\\"~7d: ~d\\\\n\\\" s (decode s)))\\n '(\\\"MCMLVI\\\" \\\"XXC\\\" \\\"MCMXC\\\" \\\"XXCIII\\\" \\\"IIIIX\\\" \\\"MIM\\\" \\\"LXXIIX\\\"))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst func integer: ROMAN parse (in string: roman) is func\\n result\\n var integer: arabic is 0;\\n local\\n var integer: index is 0;\\n var integer: number is 0;\\n var integer: lastval is 0;\\n begin\\n for index range length(roman) downto 1 do\\n case roman[index] of\\n when {'M', 'm'}: number := 1000;\\n when {'D', 'd'}: number := 500;\\n when {'C', 'c'}: number := 100;\\n when {'L', 'l'}: number := 50;\\n when {'X', 'x'}: number := 10;\\n when {'V', 'v'}: number := 5;\\n when {'I', 'i'}: number := 1;\\n otherwise: raise RANGE_ERROR;\\n end case;\\n if number < lastval then\\n arabic -:= number;\\n else\\n arabic +:= number;\\n end if;\\n lastval := number;\\n end for;\\n end func;\\n\\nconst proc: main is func\\n begin\\n writeln(ROMAN parse \\\"MCMXC\\\");\\n writeln(ROMAN parse \\\"MMVIII\\\");\\n writeln(ROMAN parse \\\"MDCLXVI\\\");\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"function RomanNumeralsDecode numerals\\n\\tput {\\n\\t\\t\\\"M\\\": 1000,\\n\\t\\t\\\"D\\\": 500,\\n\\t\\t\\\"C\\\": 100,\\n\\t\\t\\\"L\\\": 50,\\n\\t\\t\\\"X\\\": 10,\\n\\t\\t\\\"V\\\": 5,\\n\\t\\t\\\"I\\\": 1\\n\\t} into values\\n\\t\\n\\tput 0 into total\\n\\trepeat with each character letter of numerals\\n\\t\\tif values.(character the counter + 1 of numerals) is less than or equal to values.(letter)\\n\\t\\t\\tadd values.(letter) to total\\n\\t\\telse\\n\\t\\t\\tsubtract values.(letter) from total\\n\\t\\tend if\\n\\tend repeat\\n\\treturn total\\nend RomanNumeralsDecode\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"repeat for each item in [\\n\\t\\\"MCMXC\\\",\\n\\t\\\"MMVIII\\\",\\n\\t\\\"MDCLXVI\\\",\\n]\\n\\tput RomanNumeralsDecode(it)\\nend repeat\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"func roman2arabic(roman) {\\n \\n var arabic = 0\\n var last_digit = 1000\\n \\n static m = Hash(\\n I => 1,\\n V => 5,\\n X => 10,\\n L => 50,\\n C => 100,\\n D => 500,\\n M => 1000,\\n )\\n \\n roman.uc.chars.map{m{_} \\\\\\\\ 0}.each { |digit|\\n if (last_digit < digit) {\\n arabic -= (2 * last_digit)\\n }\\n arabic += (last_digit = digit)\\n }\\n \\n return arabic\\n}\\n \\n%w(MCMXC MMVIII MDCLXVI).each { |roman_digit|\\n \\\"%-10s == %d\\\\n\\\".printf(roman_digit, roman2arabic(roman_digit))\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"func roman2arabic(digit) {\\n digit.uc.trans([\\n :M: '1000+',\\n :CM: '900+',\\n :D: '500+',\\n :CD: '400+',\\n :C: '100+',\\n :XC: '90+',\\n :L: '50+',\\n :XL: '40+',\\n :X: '10+',\\n :IX: '9+',\\n :V: '5+',\\n :IV: '4+',\\n :I: '1+',\\n ]).split('+').map{.to_i}.sum;\\n}\\n \\n%w(MCMXC MMVIII MDCLXVI).each { |roman_num|\\n say \\\"#{roman_num}\\\\t-> #{roman2arabic(roman_num)}\\\";\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"BEGIN\\n\\n INTEGER PROCEDURE FROMROMAN(S); TEXT S;\\n BEGIN\\n PROCEDURE P(INTVAL, NUM); INTEGER INTVAL; TEXT NUM;\\n BEGIN\\n INTEGER NLEN;\\n NLEN := NUM.LENGTH;\\n WHILE INDEX + NLEN - 1 <= SLEN AND THEN\\n S.SUB(INDEX, NLEN) = NUM DO\\n BEGIN\\n RESULT := RESULT + INTVAL;\\n INDEX := INDEX + NLEN;\\n END WHILE;\\n END P;\\n INTEGER RESULT, INDEX, SLEN;\\n SLEN := S.LENGTH;\\n INDEX := 1;\\n P( 1000, \\\"M\\\" );\\n P( 900, \\\"CM\\\" );\\n P( 500, \\\"D\\\" );\\n P( 400, \\\"CD\\\" );\\n P( 100, \\\"C\\\" );\\n P( 90, \\\"XC\\\" );\\n P( 50, \\\"L\\\" );\\n P( 40, \\\"XL\\\" );\\n P( 10, \\\"X\\\" );\\n P( 9, \\\"IX\\\" );\\n P( 5, \\\"V\\\" );\\n P( 4, \\\"IV\\\" );\\n P( 1, \\\"I\\\" );\\n FROMROMAN := RESULT;\\n END FROMROMAN;\\n\\n TEXT T;\\n FOR T :- \\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MDCLXVI\\\" DO\\n BEGIN\\n OUTTEXT(\\\"ROMAN \\\"\\\"\\\");\\n OUTTEXT(T);\\n OUTTEXT(\\\"\\\"\\\" => \\\");\\n OUTINT(FROMROMAN(T), 0);\\n OUTIMAGE;\\n END FOR;\\n\\nEND PROGRAM;\\n\",\n \"language\": \"Simula\"\n },\n {\n \"code\": \"* Roman to Arabic\\n define('arabic(n)s,ch,val,sum,x') :(arabic_end)\\narabic s = 'M1000 D500 C100 L50 X10 V5 I1 '\\n n = reverse(n)\\narab1 n len(1) . ch = :f(arab2)\\n s ch break(' ') . val\\n val = lt(val,x) (-1 * val)\\n sum = sum + val; x = val :(arab1)\\narab2 arabic = sum :(return)\\narabic_end\\n\\n* Test and display\\n tstr = 'MMX MCMXCIX MCDXCII MLXVI CDLXXVI \\\"\\ntloop tstr break(' ') . r span(' ') = :f(out)\\n astr = astr r '=' arabic(r) ' ' :(tloop)\\nout output = astr\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"* Roman to Arabic\\n\\tdefine(\\\"arabic1(romans,arabic1)rdigit,adigit,b4\\\")\\n\\tromans1 = \\\" 0 IX9 IV4 III3 II2 I1 VIII8 VII7 VI6 V5\\\" :(arabic1_end)\\narabic1 ident(romans) :s(return)\\n\\tromans (break(\\\"IV\\\") | rem) . b4 rem . rdigit = b4\\n romans1 \\\" \\\" rdigit any(\\\"0123456789\\\") . adigit\\n\\tarabic1 = adigit arabic1\\n romans = replace(romans,\\\"MDCLX\\\",\\\"CLXVI\\\") :(arabic1)\\narabic1_end\\n* Test and display\\n tstr = \\\"MMX MCMXCIX MCDXCII MLXVI CDLXXVI \\\"\\ntloop tstr break(' ') . r span(' ') = :f(out)\\n astr = astr r '=' arabic1(r) ' ' :(tloop)\\nout output = astr\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"* Roman to Arabic\\n\\tdefine(\\\"arabic1(romans,arabic1)rdigit,adigit,b4\\\")\\n\\tromans1 = \\\" 0 IX9 IV4 III3 II2 I1 VIII8 VII7 VI6 V5\\\" :(arabic1_end)\\narabic1 ident(romans) :s(return)\\n\\tromans (break(\\\"IV\\\") | rem) . b4 rem . rdigit = replace(b4,\\\"MDCLX\\\",\\\"CLXVI\\\")\\n romans1 \\\" \\\" rdigit any(\\\"0123456789\\\") . adigit\\n\\tarabic1 = adigit arabic1 :(arabic1)\\narabic1_end\\n* Test and display\\n tstr = \\\" MMX MCMXCIX MCDXCII MLXVI CDLXXVI \\\"\\n tstr span(' ') break(' ') $ r *?(astr = astr r '=' arabic1(r) ' ') fail\\n output = astr\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"r2a(r)=\\n n = [1,5,10,50,100,500,1000]\\n a,m = 0\\n > i, #.size(r)..1, -1\\n v,c = n[#.pos(\\\"IVXLCDM\\\",#.mid(r,i))]\\n ? v<m, v = -v\\n ? c>m, m = c\\n a += v\\n <\\n <= a\\n.\\n\\nt = [\\\"MMXI\\\",\\\"MIM\\\",\\\"MCMLVI\\\",\\\"MDCLXVI\\\",\\\"XXCIII\\\",\\\"LXXIIX\\\",\\\"IIIIX\\\"]\\n> i, 1..#.size(t,1)\\n #.output(t[i],\\\" = \\\",r2a(t[i]))\\n<\\n\",\n \"language\": \"SPL\"\n },\n {\n \"code\": \"extension Int {\\n init(romanNumerals: String) {\\n let values = [\\n ( \\\"M\\\", 1000),\\n (\\\"CM\\\", 900),\\n ( \\\"D\\\", 500),\\n (\\\"CD\\\", 400),\\n ( \\\"C\\\", 100),\\n (\\\"XC\\\", 90),\\n ( \\\"L\\\", 50),\\n (\\\"XL\\\", 40),\\n ( \\\"X\\\", 10),\\n (\\\"IX\\\", 9),\\n ( \\\"V\\\", 5),\\n (\\\"IV\\\", 4),\\n ( \\\"I\\\", 1),\\n ]\\n\\n self = 0\\n var raw = romanNumerals\\n for (digit, value) in values {\\n while raw.hasPrefix(digit) {\\n self += value\\n raw.removeFirst(digit.count)\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"Int(romanNumerals: \\\"MDCLXVI\\\") // 1666\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"def digits: [(M:1000\\\"1\\\"), (CM:900\\\"1\\\"), (D:500\\\"1\\\"), (CD:400\\\"1\\\"), (C:100\\\"1\\\"), (XC:90\\\"1\\\"), (L:50\\\"1\\\"), (XL:40\\\"1\\\"), (X:10\\\"1\\\"), (IX:9\\\"1\\\"), (V:5\\\"1\\\"), (IV:4\\\"1\\\"), (I:1\\\"1\\\")];\\ncomposer decodeRoman\\n @: 1;\\n [ <digit>* ] -> \\\\(@: 0\\\"1\\\"; $... -> @: $@ + $; $@ !\\\\)\\n rule digit: <value>* (@: $@ + 1;)\\n rule value: <='$digits($@)::key;'> -> $digits($@)::value\\nend decodeRoman\\n\\n'MCMXC' -> decodeRoman -> !OUT::write\\n'\\n' -> !OUT::write\\n'MMVIII' -> decodeRoman -> !OUT::write\\n'\\n' -> !OUT::write\\n'MDCLXVI' -> decodeRoman -> !OUT::write\\n\",\n \"language\": \"Tailspin\"\n },\n {\n \"code\": \"proc fromRoman rnum {\\n set map {M 1000+ CM 900+ D 500+ CD 400+ C 100+ XC 90+ L 50+ XL 40+ X 10+ IX 9+ V 5+ IV 4+ I 1+}\\n expr [string map $map $rnum]0}\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"foreach r {MCMXC MDCLXVI MMVIII} {\\n puts \\\"$r\\\\t-> [fromRoman $r]\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"Main:\\n!------------------------------------------------\\n! CALLS THE romToDec FUNCTION WITH THE ROMAN\\n! NUMERALS AND RETURNS ITS DECIMAL EQUIVELENT.\\n!\\n\\n PRINT \\\"MCMXC = \\\"; romToDec(\\\"MCMXC\\\") !1990\\n PRINT \\\"MMVIII = \\\"; romToDec(\\\"MMVIII\\\") !2008\\n PRINT \\\"MDCLXVI = \\\"; romToDec(\\\"MDCLXVI\\\") !1666\\n PRINT:PRINT\\n PRINT \\\"Here are other solutions not from the TASK:\\\"\\n PRINT \\\"MCMXCIX = \\\"; romToDec(\\\"MCMXCIX\\\") !1999\\n PRINT \\\"XXV = \\\"; romToDec(\\\"XXV\\\") !25\\n PRINT \\\"CMLIV = \\\"; romToDec(\\\"CMLIV\\\") !954\\n PRINT \\\"MMXI = \\\"; romToDec(\\\"MMXI\\\") !2011\\n PRINT:PRINT\\n PRINT \\\"Without error checking, this also is 2011, but is wrong\\\"\\n PRINT \\\"MMIIIX = \\\"; romToDec(\\\"MMIIIX\\\") !INVAID, 2011\\n\\nSTOP\\n\\n\\nFUNCTION romToDec(roman AS STRING) AS INTEGER\\n!------------------------------------------------------\\n! FUNCTION THAT CONVERTS ANY ROMAN NUMERAL TO A DECIMAL\\n!\\n prenum=0!num=0\\n ln=LEN(roman)\\n FOR i=ln TO 1 STEP -1\\n x$=MID(roman,i,1)\\n n=1000\\n SELECT CASE x$\\n CASE \\\"M\\\":n=n/1\\n CASE \\\"D\\\":n=n/2\\n CASE \\\"C\\\":n=n/10\\n CASE \\\"L\\\":n=n/20\\n CASE \\\"X\\\":n=n/100\\n CASE \\\"V\\\":n=n/200\\n CASE \\\"I\\\":n=n/n\\n CASE ELSE:n=0\\n END SELECT\\n IF n < preNum THEN num=num-n ELSE num=num+n\\n preNum=n\\n next i\\n\\n romToDec=num\\n\\nEND FUNCTION\\n\",\n \"language\": \"TechBASIC\"\n },\n {\n \"code\": \"PROGRAM:ROM2DEC\\n:Input Str1\\n:Disp real(21,Str1)\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"PROGRAM:ROM2DEC\\n:Input \\\"ROMAN:\\\",Str1\\n:{1000,500,100,50,10,5,1}➞L1\\n:0➞P\\n:0➞Y\\n:For(I,length(Str1),1,-1)\\n :inString(\\\"MDCLXVI\\\",sub(Str1,I,1))➞X\\n :If X≤0:Then\\n :Disp \\\"BAD NUMBER\\\"\\n :Stop\\n :End\\n :L1(x)➞N\\n :If N<P:Then\\n :Y–N➞Y\\n :Else\\n :Y+N➞Y\\n :End\\n :N➞P\\n:End\\n:Disp Y\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"loop: parse(roman)\\\\loop;\\nroman: string(!<<MDCLXVI>>) [n=0] num\\nletter: num/render letter;\\nnum: <M> [n=+1750]\\n | <D> [n=+764]\\n | <C> ( <M> [n=+1604]\\n | <D> [n=+620]\\n | [n=+144] )\\n | <L> [n=+62]\\n | <X> ( <C> [n=+132]\\n | <L> [n=+50]\\n | [n=+12] )\\n | <V> [n=+5]\\n | <I> ( <X> [n=+11]\\n | <V> [n=+4]\\n | [n++] );\\nrender: decimal(n) = { 1 * };\\n\\nn: 0;\\n\",\n \"language\": \"TMG\"\n },\n {\n \"code\": \"loop: [wsz = &a - &n]\\n parse(line)\\\\loop\\n parse(error)\\\\loop;\\nline: roman *;\\nroman: [n=0] [off=0]\\n comb((<^>),(<&>),(<M>))\\n comb((<M>),(<D>),(<C>))\\n comb((<C>),(<L>),(<X>))\\n comb((<X>),(<V>),(<I>))\\n [n>0?] decimal(n) = { 1 * };\\ncomb: proc(c1,c2,c3)\\n [v1 = *(wsz*off++ + &a)]\\n [v2 = *(wsz*off++ + &a)]\\n [v3 = *(wsz*off + &a)]\\n ( c3 ( c3 ( c3 [n=+(3*v3)]\\n | [n=+(2*v3)] )\\n | c1 [v1>0?] [n=+v1-v3]\\n | c2 [v2>0?] [n=+v2-v3]\\n | [n=+v3] )\\n | c2 [v2>0?] [n=+v2]\\n ( c3 ( c3 ( c3 [n=+(3*v3)]\\n | [n=+(2*v3)] )\\n | [n=+v3] )\\n | () )\\n | () );\\nerror: smark ignore(<<>>) string(notnewline) scopy *\\n = { <error: > 1 * };\\n\\nnotnewline: !<<\\n>>;\\n\\nn: 0;\\na: 0; 0; 1750; 764; 144; 62; 12; 5; 1;\\noff:0;\\nwsz:0;\\nv1: 0; v2: 0; v3: 0;\\n\",\n \"language\": \"TMG\"\n },\n {\n \"code\": \"FUNCTION romtodec(roman$)\\n LET num = 0\\n LET prenum = 0\\n FOR i = len(roman$) to 1 step -1\\n LET x$ = (roman$)[i:i+1-1]\\n LET n = 0\\n IF x$ = \\\"M\\\" then LET n = 1000\\n IF x$ = \\\"D\\\" then LET n = 500\\n IF x$ = \\\"C\\\" then LET n = 100\\n IF x$ = \\\"L\\\" then LET n = 50\\n IF x$ = \\\"X\\\" then LET n = 10\\n IF x$ = \\\"V\\\" then LET n = 5\\n IF x$ = \\\"I\\\" then LET n = 1\\n IF n < prenum then LET num = num-n else LET num = num+n\\n LET prenum = n\\n NEXT i\\n\\n LET romtodec = num\\nEND FUNCTION\\n\\n!Testing\\nPRINT \\\"MCMXCIX = \\\"; romToDec(\\\"MCMXCIX\\\") !1999\\nPRINT \\\"MDCLXVI = \\\"; romToDec(\\\"MDCLXVI\\\") !1666\\nPRINT \\\"XXV = \\\"; romToDec(\\\"XXV\\\") !25\\nPRINT \\\"CMLIV = \\\"; romToDec(\\\"CMLIV\\\") !954\\nPRINT \\\"MMXI = \\\"; romToDec(\\\"MMXI\\\") !2011\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nLOOP roman_number=\\\"MCMXC'MMVIII'MDCLXVI\\\"\\narab_number=DECODE (roman_number,ROMAN)\\nPRINT \\\"Roman number \\\",roman_number,\\\" equals \\\", arab_number\\nENDLOOP\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"#!/bin/bash\\n\\nroman_to_dec() {\\n local rnum=$1\\n local n=0\\n local prev=0\\n\\n for ((i=${#rnum}-1;i>=0;i--))\\n do\\n case \\\"${rnum:$i:1}\\\" in\\n M) a=1000 ;;\\n D) a=500 ;;\\n C) a=100 ;;\\n L) a=50 ;;\\n X) a=10 ;;\\n V) a=5 ;;\\n I) a=1 ;;\\n esac\\n\\n if [[ $a -lt $prev ]]\\n then\\n let n-=a\\n else\\n let n+=a\\n fi\\n\\n prev=$a\\n done\\n\\n echo \\\"$rnum = $n\\\"\\n}\\n\\nroman_to_dec MCMXC\\nroman_to_dec MMVIII\\nroman_to_dec MDCLXVI\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"const romans = [\\\"I\\\", \\\"III\\\", \\\"IV\\\", \\\"VIII\\\", \\\"XLIX\\\", \\\"CCII\\\", \\\"CDXXXIII\\\", \\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MDCLXVI\\\"]\\n\\nfn main() {\\n for roman in romans {println(\\\"${roman:-10} = ${roman_decode(roman)}\\\")}\\n}\\n\\nfn roman_decode(roman string) int {\\n mut n := 0\\n mut last := \\\"O\\\"\\n\\tif roman ==\\\"\\\" {return n}\\n for c in roman {\\n match c.ascii_str() {\\n \\\"I\\\" {n++}\\n \\\"V\\\" {if last == \\\"I\\\" {n += 3} else {n += 5}}\\n \\\"X\\\" {if last == \\\"I\\\" {n += 8} else {n += 10}}\\n \\\"L\\\" {if last == \\\"X\\\" {n += 30} else {n += 50}}\\n \\\"C\\\" {if last == \\\"X\\\" {n += 80} else {n += 100}}\\n \\\"D\\\" {if last == \\\"C\\\" {n += 300} else {n += 500}}\\n \\\"M\\\" {if last == \\\"C\\\" {n += 800} else {n += 1000}}\\n\\t\\t\\telse {last = c.ascii_str()}\\n }\\n }\\n return n\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Option Explicit\\n\\nSub Main_Romans_Decode()\\nDim Arr(), i&\\n\\n Arr = Array(\\\"III\\\", \\\"XXX\\\", \\\"CCC\\\", \\\"MMM\\\", \\\"VII\\\", \\\"LXVI\\\", \\\"CL\\\", \\\"MCC\\\", \\\"IV\\\", \\\"IX\\\", \\\"XC\\\", \\\"ICM\\\", \\\"DCCCXCIX\\\", \\\"CMI\\\", \\\"CIM\\\", \\\"MDCLXVI\\\", \\\"MCMXC\\\", \\\"MMXVII\\\")\\n For i = 0 To UBound(Arr)\\n Debug.Print Arr(i) & \\\" >>> \\\" & lngConvert(CStr(Arr(i)))\\n Next\\nEnd Sub\\n\\nFunction Convert(Letter As String) As Long\\nDim Romans(), DecInt(), Pos As Integer\\n\\n Romans = Array(\\\"M\\\", \\\"D\\\", \\\"C\\\", \\\"L\\\", \\\"X\\\", \\\"V\\\", \\\"I\\\")\\n DecInt = Array(1000, 500, 100, 50, 10, 5, 1)\\n Pos = -1\\n On Error Resume Next\\n Pos = Application.Match(Letter, Romans, 0) - 1\\n On Error GoTo 0\\n If Pos <> -1 Then Convert = DecInt(Pos)\\nEnd Function\\n\\nFunction lngConvert(strRom As String) 'recursive function\\nDim i As Long, iVal As Integer\\n\\n If Len(strRom) = 1 Then\\n lngConvert = Convert(strRom)\\n Else\\n iVal = Convert(Mid(strRom, 1, 1))\\n If iVal < Convert(Mid(strRom, 2, 1)) Then iVal = iVal * (-1)\\n lngConvert = iVal + lngConvert(Mid(strRom, 2, Len(strRom) - 1))\\n End If\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"' Roman numerals Encode - Visual Basic - 18/04/2019\\n\\nFunction toRoman(ByVal value)\\n Dim arabic\\n Dim roman\\n Dim i, result\\n arabic = Array(1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1)\\n roman = Array(\\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\", \\\"L\\\", \\\"XL\\\", \\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\", \\\"I\\\")\\n For i = 0 To 12\\n Do While value >= arabic(i)\\n result = result + roman(i)\\n value = value - arabic(i)\\n Loop\\n Next 'i\\n toRoman = result\\nEnd Function 'toRoman\\n\\n n=InputBox(\\\"Number, please\\\",\\\"Roman numerals/Encode\\\")\\n code=MsgBox(n & vbCrlf & toRoman(n),vbOKOnly+vbExclamation,\\\"Roman numerals/Encode\\\")\\n\\tIf code=vbOK Then ok=1\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"// Main program for testing the function\\n//\\ndo {\\n Get_Input(10, \\\"Enter a roman numeral: \\\", NOCR+STATLINE)\\n Call(\\\"Roman_to_Arabic\\\")\\n Reg_Type(10) Message(\\\"\\t= \\\") Num_Type(#1)\\n} while(#1)\\nReturn\\n\\n// Convert Roman numeral into numeric value\\n// in: @10 = Roman numeral\\n// out: #1 = numeric value\\n//\\n:Roman_to_Arabic:\\n Buf_Switch(Buf_Free)\\n Ins_Text(\\\"M1000 D500 C100 L50 X10 V5 I1\\\") Ins_Newline\\n Reg_Ins(10) Ins_Char(' ')\\n #1 = #2 = 0\\n\\n Repeat(ALL) {\\n #3 = #2 // #3 = previous character\\n Goto_Line(2) // roman numeral to be converted\\n if (At_EOL) {\\n Break // all done\\n }\\n Reg_Copy_Block(11, CP, CP+1, DELETE) // next character in roman numeral\\n if (Search(@11, BEGIN+ADVANCE+NOERR)) { // find character from the table\\n #2 = Num_Eval(SUPPRESS) // corresponding numeric value\\n if (#2 > #3) { // larger than previous digit?\\n #1 -= #3 // substract previous digit\\n } else {\\n #1 += #3 // add previous digit\\n }\\n }\\n }\\n Reg_Empty(11)\\n Buf_Quit(OK)\\nReturn\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar decode = Fn.new { |r|\\n if (r == \\\"\\\") return 0\\n var n = 0\\n var last = \\\"0\\\"\\n for (c in r) {\\n var k\\n if (c == \\\"I\\\") {\\n k = 1\\n } else if (c == \\\"V\\\") {\\n k = (last == \\\"I\\\") ? 3 : 5\\n } else if (c == \\\"X\\\") {\\n k = (last == \\\"I\\\") ? 8 : 10\\n } else if (c == \\\"L\\\") {\\n k = (last == \\\"X\\\") ? 30 : 50\\n } else if (c == \\\"C\\\") {\\n k = (last == \\\"X\\\") ? 80 : 100\\n } else if (c == \\\"D\\\") {\\n k = (last == \\\"C\\\") ? 300 : 500\\n } else if (c == \\\"M\\\") {\\n k = (last == \\\"C\\\") ? 800 : 1000\\n }\\n n = n + k\\n last = c\\n }\\n return n\\n}\\n\\nvar romans = [\\\"I\\\", \\\"III\\\", \\\"IV\\\", \\\"VIII\\\", \\\"XLIX\\\", \\\"CCII\\\", \\\"CDXXXIII\\\", \\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MDCLXVI\\\"]\\nfor (r in romans) System.print(\\\"%(Fmt.s(-10, r)) = %(decode.call(r))\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"PROGRAM \\\"romandec\\\"\\nVERSION \\\"0.0000\\\"\\n\\nDECLARE FUNCTION Entry ()\\nDECLARE FUNCTION romToDec (roman$)\\n\\nFUNCTION Entry ()\\n PRINT \\\"MCMXCIX = \\\"; romToDec(\\\"MCMXCIX\\\")\\n PRINT \\\"MDCLXVI = \\\"; romToDec(\\\"MDCLXVI\\\")\\n PRINT \\\"XXV = \\\"; romToDec(\\\"XXV\\\")\\n PRINT \\\"CMLIV = \\\"; romToDec(\\\"CMLIV\\\")\\n PRINT \\\"MMXI = \\\"; romToDec(\\\"MMXI\\\")\\nEND FUNCTION\\n\\nFUNCTION romToDec (roman$)\\n num = 0\\n prenum = 0\\n FOR i = LEN(roman$) TO 1 STEP -1\\n x$ = MID$(roman$, i, 1)\\n\\tSELECT CASE x$\\n\\t CASE \\\"M\\\" : n = 1000\\n\\t CASE \\\"D\\\" : n = 500\\n\\t CASE \\\"C\\\" : n = 100\\n\\t CASE \\\"L\\\" : n = 50\\n\\t CASE \\\"X\\\" : n = 10\\n\\t CASE \\\"V\\\" : n = 5\\n\\t CASE \\\"I\\\" : n = 1\\n\\tEND SELECT\\n IF n < prenum THEN num = num-n ELSE num = num+n\\n prenum = n\\n NEXT i\\n\\n RETURN num\\nEND FUNCTION\\nEND PROGRAM\\n\",\n \"language\": \"XBasic\"\n },\n {\n \"code\": \"(defun decode (r)\\n (define roman '((#\\\\m 1000) (#\\\\d 500) (#\\\\c 100) (#\\\\l 50) (#\\\\x 10) (#\\\\v 5) (#\\\\i 1)))\\n (defun to-arabic (rn rs a)\\n (cond\\n ((null rn) a)\\n ((eqv? (car rn) (caar rs)) (to-arabic (cdr rn) roman (if (and (not (eqv? (car rn) (cadr rn))) (< (cadar rs) (to-arabic (cdr rn) roman 0)))\\n (- a (cadar rs))\\n (+ a (cadar rs)) ) ) )\\n (t (to-arabic rn (cdr rs) a)) ) )\\n (to-arabic (string->list r) roman 0) )\\n\",\n \"language\": \"XLISP\"\n },\n {\n \"code\": \"[1] (mapcar decode '(\\\"mcmxc\\\" \\\"mmviii\\\" \\\"mdclxvi\\\"))\\n\\n(1990 2008 1666)\\n\",\n \"language\": \"XLISP\"\n },\n {\n \"code\": \"string 0; \\\\use zero-terminated strings\\ncode CrLf=9, IntOut=11;\\n\\nfunc Roman(Str); \\\\Convert Roman numeral string to decimal value\\nchar Str;\\nint I, Val, Val0, Sum;\\n[I:= 0; Sum:= 0; Val0:= 5000;\\nloop [case Str(I) of\\n ^M: Val:= 1000;\\n ^D: Val:= 500;\\n ^C: Val:= 100;\\n ^L: Val:= 50;\\n ^X: Val:= 10;\\n ^V: Val:= 5;\\n ^I: Val:= 1\\n other return Sum; \\\\zero string terminator\\n I:= I+1;\\n Sum:= Sum + Val;\\n if Val > Val0 then Sum:= Sum - 2*Val0;\\n Val0:= Val;\\n ];\\n];\\n\\n[IntOut(0, Roman(\\\"MCMXC\\\")); CrLf(0);\\n IntOut(0, Roman(\\\"MMVIII\\\")); CrLf(0);\\n IntOut(0, Roman(\\\"MDCLXVI\\\")); CrLf(0);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"xquery version \\\"3.1\\\";\\n\\ndeclare function local:decode-roman-numeral($roman-numeral as xs:string) {\\n $roman-numeral\\n => upper-case()\\n => for-each(\\n function($roman-numeral-uppercase) {\\n analyze-string($roman-numeral-uppercase, \\\".\\\")/fn:match\\n ! map { \\\"M\\\": 1000, \\\"D\\\": 500, \\\"C\\\": 100, \\\"L\\\": 50, \\\"X\\\": 10, \\\"V\\\": 5, \\\"I\\\": 1 }(.)\\n }\\n )\\n => fold-right([0,0],\\n function($number as xs:integer, $accumulator as array(*)) {\\n let $running-total := $accumulator?1\\n let $previous-number := $accumulator?2\\n return\\n if ($number lt $previous-number) then\\n [ $running-total - $number, $number ]\\n else\\n [ $running-total + $number, $number ]\\n }\\n )\\n => array:get(1)\\n};\\n\\nlet $roman-numerals :=\\n map {\\n \\\"MCMXCIX\\\": 1999,\\n \\\"MDCLXVI\\\": 1666,\\n \\\"XXV\\\": 25,\\n \\\"XIX\\\": 19,\\n \\\"XI\\\": 11,\\n \\\"CMLIV\\\": 954,\\n \\\"MMXI\\\": 2011,\\n \\\"CD\\\": 400,\\n \\\"MCMXC\\\": 1990,\\n \\\"MMVIII\\\": 2008,\\n \\\"MMIX\\\": 2009,\\n \\\"MMMDCCCLXXXVIII\\\": 3888\\n }\\nreturn\\n map:for-each(\\n $roman-numerals,\\n function($roman-numeral, $expected-value) {\\n local:decode-roman-numeral($roman-numeral) eq $expected-value\\n }\\n )\\n\",\n \"language\": \"XQuery\"\n },\n {\n \"code\": \"romans$ = \\\"MDCLXVI\\\"\\ndecmls$ = \\\"1000,500,100,50,10,5,1\\\"\\n\\nsub romanDec(s$)\\n local i, n, prev, res, decmls$(1)\\n\\t\\n n = token(decmls$, decmls$(), \\\",\\\")\\n\\t\\n for i = len(s$) to 1 step -1\\n n = val(decmls$(instr(romans$, mid$(s$, i, 1))))\\n if n < prev n = 0 - n\\n res = res + n\\n prev = n\\n next i\\n return res\\nend sub\\n\\n? romanDec(\\\"MCMXCIX\\\") // 1999\\n? romanDec(\\\"MDCLXVI\\\") // 1666\\n? romanDec(\\\"XXV\\\") // 25\\n? romanDec(\\\"XIX\\\") // 19\\n? romanDec(\\\"XI\\\") // 11\\n? romanDec(\\\"CMLIV\\\") // 954\\n? romanDec(\\\"MMXI\\\") // 2011\\n? romanDec(\\\"CD\\\") // 400\\n? romanDec(\\\"MCMXC\\\") // 1990\\n? romanDec(\\\"MMVIII\\\") // 2008\\n? romanDec(\\\"MMIX\\\") // 2009\\n? romanDec(\\\"MDCLXVI\\\") // 1666\\n? romanDec(\\\"MMMDCCCLXXXVIII\\\") // 3888\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"var romans = L(\\n L(\\\"M\\\", 1000), L(\\\"CM\\\", 900), L(\\\"D\\\", 500), L(\\\"CD\\\", 400), L(\\\"C\\\", 100),\\n L(\\\"XC\\\", 90), L(\\\"L\\\", 50), L(\\\"XL\\\", 40), L(\\\"X\\\", 10), L(\\\"IX\\\", 9),\\n L(\\\"V\\\", 5), L(\\\"IV\\\", 4), L(\\\"I\\\", 1));\\nfcn toArabic(romanNumber){\\t// romanNumber needs to be upper case\\n if (not RegExp(\\\"^[CDILMVX]+$\\\").matches(romanNumber))\\n throw(Exception.ValueError(\\\"Not a Roman number: %s\\\".fmt(romanNumber)));\\n reg value = 0;\\n foreach R,N in (romans){\\n while (0 == romanNumber.find(R)){\\n\\t value += N;\\n\\t romanNumber = romanNumber[R.len(),*];\\n }\\n }\\n return(value);\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"program: roman_decimal\\n input: 'XIII'\\n output: 13\\n\",\n \"language\": \"Zoea\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Roman-numerals-Decode"}}},{"rowIdx":1588,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- String_manipulation\nfrom: http://rosettacode.org/wiki/Roman_numerals/Encode\n","language":"00-META"},{"code":";Task:\nCreate a function taking a positive integer as its parameter and returning a string containing the Roman numeral representation of that integer. Modern Roman numerals are written by expressing each digit separately, starting with the left most digit and skipping any digit with a value of zero. \n\n\nIn Roman numerals:\n* 1990 is rendered: 1000=M, 900=CM, 90=XC; resulting in MCMXC\n* 2008 is written as 2000=MM, 8=VIII; or MMVIII\n* 1666 uses each Roman symbol in descending order: MDCLXVI\n<br><br>\n\n","language":"00-TASK"},{"code":"V anums = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\nV rnums = ‘M CM D CD C XC L XL X IX V IV I’.split(‘ ’)\n\nF to_roman(=x)\n V ret = ‘’\n L(a, r) zip(:anums, :rnums)\n (V n, x) = divmod(x, a)\n ret ‘’= r * n\n R ret\n\nV test = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 25, 30, 40,\n 50, 60, 69, 70, 80, 90, 99, 100, 200, 300, 400, 500, 600, 666, 700, 800, 900, 1000,\n 1009, 1444, 1666, 1945, 1997, 1999, 2000, 2008, 2010, 2011, 2500, 3000, 3999]\nL(val) test\n print(val‘ - ’to_roman(val))\n","language":"11l"},{"code":"* Roman numerals Encode - 11/05/2020\nROMAENC CSECT\n USING ROMAENC,R13 base register\n B 72(R15) skip savearea\n DC 17F'0' savearea\n SAVE (14,12) save previous context\n ST R13,4(R15) link backward\n ST R15,8(R13) link forward\n LR R13,R15 set addressability\n LA R6,1 i=1\n DO WHILE=(C,R6,LE,=A(8)) do i=1 to hbound(nums)\n LR R1,R6 i\n SLA R1,1 ~\n LH R8,NUMS-2(R1) n=nums(i)\n MVC PG,=CL80'.... :' clear buffer\n LA R9,PG @pg\n XDECO R8,XDEC edit n\n MVC 0(4,R9),XDEC+8 output n\n LA R9,7(R9) @pg+=7\n LA R7,1 j=1\n DO WHILE=(C,R7,LE,=A(13)) do j=1 to 13\n LR R1,R7 j\n SLA R1,1 ~\n LH R3,ARABIC-2(R1) aj=arabic(j)\n DO WHILE=(CR,R8,GE,R3) while n>=aj\n LR R1,R7 j\n SLA R1,1 ~\n LA R4,ROMAN-2(R1) roman(j)\n MVC 0(2,R9),0(R4) output roman(j)\n IF CLI,1(R9),NE,C' ' THEN if roman(j)[2]=' ' then\n LA R9,2(R9) @pg+=2\n ELSE , else\n LA R9,1(R9) @pg+=1\n ENDIF , endif\n SR R8,R3 n-=aj\n ENDDO , endwile\n LA R7,1(R7) j++\n ENDDO , enddo j\n XPRNT PG,L'PG print buffer\n LA R6,1(R6) i++\n ENDDO , enddo i\n L R13,4(0,R13) restore previous savearea pointer\n RETURN (14,12),RC=0 restore registers from calling save\nARABIC DC H'1000',H'900',H'500',H'400',H'100',H'90'\n DC H'50',H'40',H'10',H'9',H'5',H'4',H'1'\nROMAN DC CL2'M',CL2'CM',CL2'D',CL2'CD',CL2'C',CL2'XC'\n DC CL2'L',CL2'XL',CL2'X',CL2'IX',CL2'V',CL2'IV',CL2'I'\nNUMS DC H'14',H'16',H'21',H'888',H'1492',H'1999',H'2020',H'3999'\nPG DS CL80 buffer\nXDEC DS CL12 temp for xdeco\n REGEQU\n END ROMAENC\n","language":"360-Assembly"},{"code":"\t\torg\t100h\n\t\tjmp\ttest\n\t\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t\t;; Takes a 16-bit integer in HL, and stores it\n\t\t;; as a 0-terminated string starting at BC.\n\t\t;; On exit, all registers destroyed; BC pointing at\n\t\t;; end of string.\nmkroman:\tpush\th\t; put input on stack\n\t\tlxi\th,mkromantab\nmkromandgt:\tmov\ta,m\t; scan ahead to next entry\n\t\tana\ta\n\t\tinx\th\n\t\tjnz\tmkromandgt\n\t\txthl\t\t; load number\n\t\tmov\ta,h\t; if zero, we're done\n\t\tora\tl\n\t\tjz\tmkromandone\n\t\txthl\t\t; load next entry from table\n\t\tmov\te,m\t; de = number\n\t\tinx\th\n\t\tmov\td,m\n\t\tinx\th\n\t\txthl\t\t; load number\n\t\txra\ta\t; find how many we need\nsubtract:\tinr\ta\t; with trial subtraction\n\t\tdad\td\n\t\tjc\tsubtract\n\t\tpush\tpsw\t; keep counter\n\t\tmov\ta,d\t; we subtracted one too many\n\t\tcma\t\t; so we need to add one back\n\t\tmov\td,a\n\t\tmov\ta,e\n\t\tcma\n\t\tmov\te,a\n\t\tinx\td\n\t\tdad\td\n\t\tpop\td\t; restore counter (into D)\n\t\txthl\t\t; load table pointer\nstringouter:\tdcr\td\t; do we need to include one?\n\t\tjz\tmkromandgt\n\t\tpush\th\t; keep string location\nstringinner:\tmov\ta,m\t; copy string into target\n\t\tstax\tb\n\t\tana\ta\t; done yet?\n\t\tjz\tstringdone\n\t\tinx\th\n\t\tinx\tb\t; copy next character\n\t\tjmp\tstringinner\nstringdone:\tpop\th\t; restore string location\n\t\tjmp\tstringouter\nmkromandone:\tpop\td\t; remove temporary variable from stack\n\t\tret\nmkromantab:\tdb\t0\n\t\tdb\t18h,0fch,'M',0\t\t; The value for each entry\n\t\tdb\t7ch,0fch,'CM',0\t\t; is stored already negated\n\t\tdb\t0ch,0feh,'D',0\t\t; so that it can be immediately\n\t\tdb\t70h,0feh,'CD',0\t\t; added using `dad'.\n\t\tdb\t9ch,0ffh,'C',0\t\t; This also has the convenient\n\t\tdb\t0a6h,0ffh,'XC',0\t; property of not having any\n\t\tdb\t0ceh,0ffh,'L',0\t\t; zero bytes except the string\n\t\tdb\t0d8h,0ffh,'XL',0\t; and row terminators.\n\t\tdb\t0f6h,0ffh,'X',0\n\t\tdb\t0f7h,0ffh,'IX',0\n\t\tdb\t0fbh,0ffh,'V',0\n\t\tdb\t0fch,0ffh,'IV',0\n\t\tdb\t0ffh,0ffh,'I',0\n\t\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t\t;; Test code\ntest:\t\tmvi\tc,10\t; read string from console\n\t\tlxi\td,dgtbufdef\n\t\tcall\t5\n\t\tlxi\th,0\t; convert to integer\n\t\tlxi\tb,dgtbuf\nreaddgt:\tldax\tb\n\t\tana\ta\n\t\tjz\tconvert\n\t\tdad\th\t; hl *= 10\n\t\tmov\td,h\n\t\tmov\te,l\n\t\tdad\th\n\t\tdad\th\n\t\tdad\td\n\t\tsui\t'0'\n\t\tmov\te,a\n\t\tmvi\td,0\n\t\tdad\td\n\t\tinx\tb\n\t\tjmp\treaddgt\nconvert:\tlxi\tb,romanbuf\t; convert to roman\n\t\tcall\tmkroman\n\t\tmvi\ta,'$'\t; switch string terminator\n\t\tstax\tb\n\t\tmvi\tc,9\t; output result\n\t\tlxi\td,romanbuf\n\t\tjmp\t5\nnl:\t\tdb\t13,10,'$'\ndgtbufdef:\tdb\t5,0\ndgtbuf:\t\tds\t6\nromanbuf:\n","language":"8080-Assembly"},{"code":"\tmov ax,0070h\n\tcall EncodeRoman\n\tmov si,offset StringRam\n\tcall PrintString\n\tcall NewLine\t\n\t\n\tmov ax,1776h\n\tcall EncodeRoman\n\tmov si,offset StringRam\n\tcall PrintString\n\tcall NewLine\n\n\tmov ax,2021h\n\tcall EncodeRoman\n\tmov si,offset StringRam\n\tcall PrintString\n\tcall NewLine\n\n\tmov ax,3999h\n\tcall EncodeRoman\n\tmov si,offset StringRam\n\tcall PrintString\n\tcall NewLine\n\t\n\tmov ax,4000h\n\tcall EncodeRoman\n\tmov si,offset StringRam\n\n\t\n\tReturnToDos ;macro that calls the int that exits dos\n","language":"8086-Assembly"},{"code":";ROMAN NUMERALS MODULE\n\nEncodeRoman:\n;takes a BCD value in AX and stores its Roman numeral equivalent in ram.\n\n\tcall UnpackBCD\n\t\n\tcmp dh,03h\n\tjng continue_EncodeRoman\n\t;roman numerals only go up to 3999.\n\tjmp errorhandler_encodeRoman_inputTooBig\ncontinue_EncodeRoman:\n\tmov si,offset StringRam\n\t;using SI as destination of roman numerals.\n\tpush ax\t\n\tpush cx\n\t\tmov ch,0\n\t\tmov cl,dh\t\t\t\t\t;loop counter\n\t\tcmp dh,0\n\t\tjz skipThousands\nencodeRoman_handleThousands:\n\t\tmov al,\"M\"\n\t\tmov [ds:si],al\t\t\t\t;store in string ram\n\t\tinc si\n\t\t; call PrintChar\n\t\tloop encodeRoman_handleThousands\nskipThousands:\n\tpop cx\n\tpop ax\n\t\nencodeRoman_HandleHundreds:\n\tpushall\n\t\tmov bh,0\n\t\tmov bl,dl ;use bx as an offset into Roman_Lookup_Master\n\t\tSHL bl,1\n\t\tSHL bl,1\t;multiply by 2, we are indexing into a table with 4 bytes per row.\n\t\tmov di,offset Roman_Lookup_Master\n\t\tmov cx,4\ngetChar_Hundreds:\t\t\n\t\tmov al,[bx+es:di] ;get first char index\n\t\tpush bx\n\t\tpush di\n\t\t\tmov di,offset Roman_Hund\n\t\t\tmov bl,al\n\t\t\tmov al,[bx+es:di]\n\t\t\tcmp al,0\n\t\t\tjz skipNullChar_RomanHund\n\t\t\tmov [ds:si],al\t;store in ram\n\t\t\tinc si\n\t\t\t; call PrintChar\t\t\t\nskipNullChar_RomanHund:\n\t\tpop di\n\t\tpop bx\n\t\tinc di\n\t\tloop getChar_Hundreds\n\tpopall\n\t\n\t\nencodeRoman_HandleTens:\n\tpushall\n\t\tmov bh,0\n\t\tmov bl,ah ;use bx as an offset into Roman_Lookup_Master\n\t\tSHL bl,1\n\t\tSHL bl,1\t;multiply by 2, we are indexing into a table with 4 bytes per row.\n\t\tmov di,offset Roman_Lookup_Master\n\t\tmov cx,4\ngetChar_Tens:\t\t\n\t\tmov al,[bx+es:di] ;get first char index\n\t\tpush bx\n\t\tpush di\n\t\t\tmov di,offset Roman_Tens\n\t\t\tmov bl,al\n\t\t\tmov al,[bx+es:di]\n\t\t\tcmp al,0\n\t\t\tjz skipNullChar_RomanTens\n\t\t\tmov [ds:si],al\t;store in ram\n\t\t\tinc si\n\t\t\t; call PrintChar\t\t\t\nskipNullChar_RomanTens:\n\t\tpop di\n\t\tpop bx\n\t\tinc di\n\t\tloop getChar_Tens\n\tpopall\n\t\nencodeRoman_HandleOnes:\n\tpushall\n\t\tmov bh,0\n\t\tmov bl,al ;use bx as an offset into Roman_Lookup_Master\n\t\tSHL bl,1\n\t\tSHL bl,1\t;multiply by 2, we are indexing into a table with 4 bytes per row.\n\t\tmov di,offset Roman_Lookup_Master\n\t\tmov cx,4\ngetChar_Ones:\t\t\n\t\tmov al,[bx+es:di] ;get first char index\n\t\tpush bx\n\t\tpush di\n\t\t\tmov di,offset Roman_Ones\n\t\t\tmov bl,al\n\t\t\tmov al,[bx+es:di]\n\t\t\tcmp al,0\n\t\t\tjz skipNullChar_RomanOnes\n\t\t\tmov [ds:si],al\t;store in ram\n\t\t\tinc si\n\t\t\t; call PrintChar\t\t\t\nskipNullChar_RomanOnes:\n\t\tpop di\n\t\tpop bx\n\t\tinc di\n\t\tloop getChar_Ones\n\tpopall\n\t\n\tmov al,0\n\tmov [ds:si],al ;place a null terminator at the end of the string.\n\tret\n\n\t\t\t\nerrorhandler_encodeRoman_inputTooBig:\n\tpush ds\n\tpush ax\n\t\tLoadSegment ds,ax,@data\n\t\tmov al,01h\n\t\tmov byte ptr [ds:error_code],al\n\t\tmov ax, offset EncodeRoman\n\t\tmov word ptr [ds:error_routine],ax\n\t\t\n\t\tLoadSegment ds,ax,@code\n\t\tmov si,offset Roman_Error\n\t\tcall PrintString\n\tpop ax\n\tpop ds\n\tstc\t\t;set carry, allowing program to branch if error occurred.\n\tret\n\n\t\n\nRoman_Lookup_Master db 0,0,0,0\t;0\n\t\t db 0,0,0,1\t;1\n\t\t db 0,0,1,1\t;2\n\t\t db 0,1,1,1\t;3\n\t\t db 0,0,1,2\t;4\n\t\t db 0,0,0,2\t;5\n\t\t db 0,0,2,1\t;6\n\t\t db 0,2,1,1\t;7\n\t\t db 2,1,1,1\t;8\n\t\t db 0,0,1,3\t;9\n\nRoman_Ones\t db 0,\"IVX\" ;the same pattern is used regardless of what power of 10 we're working with\nRoman_Tens\t db 0,\"XLC\"\nRoman_Hund\t db 0,\"CDM\"\n\nRoman_Error\t db \"ERROR: BAD INPUT\",0\n\n\nUnpackBCD:\n;converts a \"packed\" BCD value in AX to an \"unpacked\" value in DX.AX\n;DX is the high byte, AX is the low byte.\n;CLOBBERS DX AND AX.\n\tmov dx,0\n\tmov dl,ah\n\tmov ah,0\n\tpush cx\n\t\tmov cl,4\n\t\trol dx,cl\n\t\t;BEFORE: DX = 00XYh\n\t\t;AFTER: DX = 0XY0h\n\t\tror dl,cl\t;DX = 0X0Yh\n\t\t\n\t\trol ax,cl\t\n\t\t;BEFORE: AX = 00XYh\n\t\t;AFTER: AX = 0XY0h\n\t\tror al,cl\t;AX = 0X0Yh\n\tpop cx\n\tret\n","language":"8086-Assembly"},{"code":"pushall macro\npush ax\npush bx\npush cx\npush dx\npush ds\npush es\npush di\n;I forgot SI in this macro, but once you add it in the code stops working! So I left it out.\nendm\n\npopall macro\npop di\npop es\npop ds\npop dx\npop cx\npop bx\npop ax\nendm\n","language":"8086-Assembly"},{"code":"DEFINE PTR=\"CARD\"\nCARD ARRAY arabic=[1000 900 500 400 100 90 50 40 10 9 5 4 1]\nPTR ARRAY roman(13)\n\nPROC InitRoman()\n roman(0)=\"M\" roman(1)=\"CM\" roman(2)=\"D\" roman(3)=\"CD\"\n roman(4)=\"C\" roman(5)=\"XC\" roman(6)=\"L\" roman(7)=\"XL\"\n roman(8)=\"X\" roman(9)=\"IX\" roman(10)=\"V\" roman(11)=\"IV\" roman(12)=\"I\"\nRETURN\n\nPROC EncodeRomanNumber(CARD n CHAR ARRAY res)\n BYTE i,len\n CHAR ARRAY tmp\n\n res(0)=0 len=0\n FOR i=0 TO 12\n DO\n WHILE arabic(i)<=n\n DO\n tmp=roman(i)\n SAssign(res,tmp,len+1,len+1+tmp(0))\n len==+tmp(0)\n n==-arabic(i)\n OD\n OD\n res(0)=len\nRETURN\n\nPROC Main()\n CARD ARRAY data=[1990 2008 5555 1666 3888 3999]\n BYTE i\n CHAR ARRAY r(20)\n\n InitRoman()\n FOR i=0 TO 5\n DO\n EncodeRomanNumber(data(i),r)\n PrintF(\"%U=%S%E\",data(i),r)\n OD\nRETURN\n","language":"Action-"},{"code":"function arabic2roman(num:Number):String {\n\tvar lookup:Object = {M:1000, CM:900, D:500, CD:400, C:100, XC:90, L:50, XL:40, X:10, IX:9, V:5, IV:4, I:1};\n\tvar roman:String = \"\", i:String;\n\tfor (i in lookup) {\n\t\twhile (num >= lookup[i]) {\n\t\t\troman += i;\n\t\t\tnum -= lookup[i];\n\t\t}\n\t}\n\treturn roman;\n}\ntrace(\"1990 in roman is \" + arabic2roman(1990));\ntrace(\"2008 in roman is \" + arabic2roman(2008));\ntrace(\"1666 in roman is \" + arabic2roman(1666));\n","language":"ActionScript"},{"code":"function roman2arabic(roman:String):Number {\n\tvar romanArr:Array = roman.toUpperCase().split('');\n\tvar lookup:Object = {I:1, V:5, X:10, L:50, C:100, D:500, M:1000};\n\tvar num:Number = 0, val:Number = 0;\n\twhile (romanArr.length) {\n\t\tval = lookup[romanArr.shift()];\n\t\tnum += val * (val < lookup[romanArr[0]] ? -1 : 1);\n\t}\n\treturn num;\n}\ntrace(\"MCMXC in arabic is \" + roman2arabic(\"MCMXC\"));\ntrace(\"MMVIII in arabic is \" + roman2arabic(\"MMVIII\"));\ntrace(\"MDCLXVI in arabic is \" + roman2arabic(\"MDCLXVI\"));\n","language":"ActionScript"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\n\nprocedure Roman_Numeral_Test is\n function To_Roman (Number : Positive) return String is\n subtype Digit is Integer range 0..9;\n function Roman (Figure : Digit; I, V, X : Character) return String is\n begin\n case Figure is\n when 0 => return \"\";\n when 1 => return \"\" & I;\n when 2 => return I & I;\n when 3 => return I & I & I;\n when 4 => return I & V;\n when 5 => return \"\" & V;\n when 6 => return V & I;\n when 7 => return V & I & I;\n when 8 => return V & I & I & I;\n when 9 => return I & X;\n end case;\n end Roman;\n begin\n pragma Assert (Number >= 1 and Number < 4000);\n return\n Roman (Number / 1000, 'M', ' ', ' ') &\n Roman (Number / 100 mod 10, 'C', 'D', 'M') &\n Roman (Number / 10 mod 10, 'X', 'L', 'C') &\n Roman (Number mod 10, 'I', 'V', 'X');\n end To_Roman;\nbegin\n Put_Line (To_Roman (1999));\n Put_Line (To_Roman (25));\n Put_Line (To_Roman (944));\nend Roman_Numeral_Test;\n","language":"Ada"},{"code":"[]CHAR roman = \"MDCLXVmdclxvi\"; # UPPERCASE for thousands #\n[]CHAR adjust roman = \"CCXXmmccxxii\";\n[]INT arabic = (1000000, 500000, 100000, 50000, 10000, 5000, 1000, 500, 100, 50, 10, 5, 1);\n[]INT adjust arabic = (100000, 100000, 10000, 10000, 1000, 1000, 100, 100, 10, 10, 1, 1, 0);\n\nPROC arabic to roman = (INT dclxvi)STRING: (\n INT in := dclxvi; # 666 #\n STRING out := \"\";\n FOR scale TO UPB roman WHILE in /= 0 DO\n INT multiples = in OVER arabic[scale];\n in -:= arabic[scale] * multiples;\n out +:= roman[scale] * multiples;\n IF in >= -adjust arabic[scale] + arabic[scale] THEN\n in -:= -adjust arabic[scale] + arabic[scale];\n out +:= adjust roman[scale] + roman[scale]\n FI\n OD;\n out\n);\n\nmain:(\n []INT test = (1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,25,30,40,50,60,69,70,\n 80,90,99,100,200,300,400,500,600,666,700,800,900,1000,1009,1444,1666,1945,1997,1999,\n 2000,2008,2500,3000,4000,4999,5000,6666,10000,50000,100000,500000,1000000,max int);\n FOR key TO UPB test DO\n INT val = test[key];\n print((val, \" - \", arabic to roman(val), new line))\n OD\n)\n","language":"ALGOL-68"},{"code":"BEGIN\n\nPROCEDURE ROMAN (INTEGER VALUE NUMBER; STRING(15) RESULT CHARACTERS; INTEGER RESULT LENGTH);\n COMMENT\n Returns the Roman number of an integer between 1 and 3999.\n \"MMMDCCCLXXXVIII\" (15 characters long) is the longest Roman number under 4000;\n BEGIN\n INTEGER PLACE, POWER;\n\n PROCEDURE APPEND (STRING(1) VALUE C);\n BEGIN CHARACTERS(LENGTH|1) := C; LENGTH := LENGTH + 1 END;\n\n PROCEDURE I; APPEND(CASE PLACE OF (\"I\",\"X\",\"C\",\"M\"));\n PROCEDURE V; APPEND(CASE PLACE OF (\"V\",\"L\",\"D\"));\n PROCEDURE X; APPEND(CASE PLACE OF (\"X\",\"C\",\"M\"));\n\n ASSERT (NUMBER >= 1) AND (NUMBER < 4000);\n\n CHARACTERS := \" \";\n LENGTH := 0;\n POWER := 1000;\n PLACE := 4;\n WHILE PLACE > 0 DO\n BEGIN\n CASE NUMBER DIV POWER + 1 OF BEGIN\n BEGIN END;\n BEGIN I END;\n BEGIN I; I END;\n BEGIN I; I; I END;\n BEGIN I; V END;\n BEGIN V END;\n BEGIN V; I END;\n BEGIN V; I; I END;\n BEGIN V; I; I; I END;\n BEGIN I; X END\n END;\n NUMBER := NUMBER REM POWER;\n POWER := POWER DIV 10;\n PLACE := PLACE - 1\n END\n END ROMAN;\n\nINTEGER I;\nSTRING(15) S;\n\nROMAN(1, S, I); WRITE(S, I);\nROMAN(3999, S, I); WRITE(S, I);\nROMAN(3888, S, I); WRITE(S, I);\nROMAN(2009, S, I); WRITE(S, I);\nROMAN(405, S, I); WRITE(S, I);\nEND.\n","language":"ALGOL-W"},{"code":"toRoman←{\n ⍝ Digits and corresponding values\n ds←((⊢≠⊃)⊆⊢)' M CM D CD C XC L XL X IX V IV I'\n vs←1000, ,100 10 1∘.×9 5 4 1\n ⍝ Input ≤ 0 is invalid\n ⍵≤0:⎕SIGNAL 11\n { 0=d←⊃⍸vs≤⍵:⍬ ⍝ Find highest digit in number\n (d⊃ds),∇⍵-d⊃vs ⍝ While one exists, add it and subtract from number\n }⍵\n}\n","language":"APL"},{"code":"------------------ ROMAN INTEGER STRINGS -----------------\n\n-- roman :: Int -> String\non roman(n)\n set kvs to {[\"M\", 1000], [\"CM\", 900], [\"D\", 500], ¬\n [\"CD\", 400], [\"C\", 100], [\"XC\", 90], [\"L\", 50], ¬\n [\"XL\", 40], [\"X\", 10], [\"IX\", 9], [\"V\", 5], ¬\n [\"IV\", 4], [\"I\", 1]}\n\n script stringAddedValueDeducted\n on |λ|(balance, kv)\n set {k, v} to kv\n set {q, r} to quotRem(balance, v)\n if q > 0 then\n {r, concat(replicate(q, k))}\n else\n {r, \"\"}\n end if\n end |λ|\n end script\n\n concat(snd(mapAccumL(stringAddedValueDeducted, n, kvs)))\nend roman\n\n\n--------------------------- TEST -------------------------\non run\n\n map(roman, [2016, 1990, 2008, 2000, 1666])\n\n --> {\"MMXVI\", \"MCMXC\", \"MMVIII\", \"MM\", \"MDCLXVI\"}\nend run\n\n\n---------------- GENERIC LIBRARY FUNCTIONS ---------------\n\n-- concat :: [[a]] -> [a] | [String] -> String\non concat(xs)\n script append\n on |λ|(a, b)\n a & b\n end |λ|\n end script\n\n if length of xs > 0 and ¬\n class of (item 1 of xs) is string then\n set unit to \"\"\n else\n set unit to {}\n end if\n foldl(append, unit, xs)\nend concat\n\n-- foldl :: (a -> b -> a) -> a -> [b] -> a\non foldl(f, startValue, xs)\n tell mReturn(f)\n set v to startValue\n set lng to length of xs\n repeat with i from 1 to lng\n set v to |λ|(v, item i of xs, i, xs)\n end repeat\n return v\n end tell\nend foldl\n\n-- map :: (a -> b) -> [a] -> [b]\non map(f, xs)\n tell mReturn(f)\n set lng to length of xs\n set lst to {}\n repeat with i from 1 to lng\n set end of lst to |λ|(item i of xs, i, xs)\n end repeat\n return lst\n end tell\nend map\n\n-- 'The mapAccumL function behaves like a combination of map and foldl;\n-- it applies a function to each element of a list, passing an\n-- accumulating parameter from left to right, and returning a final\n-- value of this accumulator together with the new list.' (see Hoogle)\n\n-- mapAccumL :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])\non mapAccumL(f, acc, xs)\n script\n on |λ|(a, x)\n tell mReturn(f) to set pair to |λ|(item 1 of a, x)\n [item 1 of pair, (item 2 of a) & {item 2 of pair}]\n end |λ|\n end script\n\n foldl(result, [acc, {}], xs)\nend mapAccumL\n\n-- Lift 2nd class handler function into 1st class script wrapper\n-- mReturn :: Handler -> Script\non mReturn(f)\n if class of f is script then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n\n-- quotRem :: Integral a => a -> a -> (a, a)\non quotRem(m, n)\n {m div n, m mod n}\nend quotRem\n\n-- Egyptian multiplication - progressively doubling a list, appending\n-- stages of doubling to an accumulator where needed for binary\n-- assembly of a target length\n\n-- replicate :: Int -> a -> [a]\non replicate(n, a)\n set out to {}\n if n < 1 then return out\n set dbl to {a}\n\n repeat while (n > 1)\n if (n mod 2) > 0 then set out to out & dbl\n set n to (n div 2)\n set dbl to (dbl & dbl)\n end repeat\n return out & dbl\nend replicate\n\n-- snd :: (a, b) -> b\non snd(xs)\n if class of xs is list and length of xs = 2 then\n item 2 of xs\n else\n missing value\n end if\nend snd\n","language":"AppleScript"},{"code":" 1 N = 1990: GOSUB 5: PRINT N\" = \"V$\n 2 N = 2008: GOSUB 5: PRINT N\" = \"V$\n 3 N = 1666: GOSUB 5: PRINT N\" = \"V$;\n 4 END\n 5 V = N:V$ = \"\": FOR I = 0 TO 12: FOR L = 1 TO 0 STEP 0:A = VAL ( MID$ (\"1E3900500400100+90+50+40+10+09+05+04+01\",I * 3 + 1,3))\n 6 L = (V - A) > = 0:V$ = V$ + MID$ (\"M.CMD.CDC.XCL.XLX.IXV.IVI\",I * 2 + 1,(I - INT (I / 2) * 2 + 1) * L):V = V - A * L: NEXT L,I\n 7 RETURN\n","language":"Applesoft-BASIC"},{"code":"nums: [[1000 \"M\"] [900 \"CM\"] [500 \"D\"] [400 \"CD\"] [100 \"C\"] [90 \"XC\"]\n [50 \"L\"] [40 \"XL\"] [10 \"X\"] [9 \"IX\"] [5 \"V\"] [4 \"IV\"] [1 \"I\"])\n\ntoRoman: function [x][\n ret: \"\"\n idx: 0\n initial: x\n loop nums 'num [\n d: num\\0\n l: num\\1\n\n i: 0\n while [i<initial/d] [\n ret: ret ++ l\n i: i+1\n ]\n\n initial: mod initial d\n ]\n return ret\n]\n\nloop [1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 25 30 40\n 50 60 69 70 80 90 99 100 200 300 400 500 600 666 700 800 900\n 1000 1009 1444 1666 1945 1997 1999 2000 2008 2010 2011 2500\n 3000 3999] 'n\n -> print [n \"->\" toRoman n]\n","language":"Arturo"},{"code":"REM Roman numerals/Encode\nDIM Weights(12)\nDIM Symbols$(12)\nDATA 1000, \"M\", 900, \"CM\", 500, \"D\", 400, \"CD\", 100, \"C\", 90, \"XC\", 50, \"L\"\nDATA 40, \"XL\", 10, \"X\", 9, \"IX\", 5, \"V\", 4, \"IV\", 1, \"I\"\nREM 3888 or MMMDCCCLXXXVIII (15 chars) is the longest string properly encoded\nREM with these symbols.\nFOR J = 0 TO 12\n READ Weights(J)\n READ Symbols$(J)\nNEXT J\n\nAValue = 1990\nGOSUB ToRoman:\nPRINT Roman$\nREM MCMXC\nAValue = 2022\nGOSUB ToRoman:\nPRINT Roman$\nREM MMXXII\nAValue = 3888\nGOSUB ToRoman:\nPRINT Roman$\nREM MMMDCCCLXXXVIII\nEND\n\nToRoman:\nREM Result: Roman$\nRoman$ = \"\"\nI = 0\nLoop:\n IF (I > 12 THEN ExitToRoman:\n IF AValue <= 0 THEN ExitToRoman:\n WHILE AValue >= Weights(I)\n Roman$ = Roman$ + Symbols$(I)\n AValue = AValue - Weights(I)\n WEND\n I = I + 1\n GOTO Loop:\nExitToRoman:\nRETURN\n","language":"ASIC"},{"code":"MsgBox % stor(444)\n\nstor(value)\n{\n romans = M,CM,D,CD,C,XC,L,XL,X,IX,V,IV,I\n M := 1000\n CM := 900\n D := 500\n CD := 400\n C := 100\n XC := 90\n L := 50\n XL := 40\n X := 10\n IX := 9\n V := 5\n IV := 4\n I := 1\n Loop, Parse, romans, `,\n {\n While, value >= %A_LoopField%\n {\n result .= A_LoopField\n value := value - (%A_LoopField%)\n }\n }\n Return result . \"O\"\n}\n","language":"AutoHotkey"},{"code":"(defun c:roman() (romanNumber (getint \"\\n Enter number > \"))\n(defun romanNumber (n / uni dec hun tho nstr strlist nlist rom)\n (if (and (> n 0) (<= n 3999))\n (progn\n (setq\n UNI (list \"\" \"I\" \"II\" \"III\" \"IV\" \"V\" \"VI\" \"VII\" \"VIII\" \"IX\")\n DEC (list \"\" \"X\" \"XX\" \"XXX\" \"XL\" \"L\" \"LX\" \"LXX\" \"LXXX\" \"XC\")\n HUN (list \"\" \"C\" \"CC\" \"CCC\" \"CD\" \"D\" \"DC\" \"DCC\" \"DCCC\" \"CM\")\n THO (list \"\" \"M\" \"MM\" \"MMM\")\n nstr (itoa n)\n )\n (while (> (strlen nstr) 0) (setq strlist (append strlist (list (substr nstr 1 1))) nstr (substr nstr 2 (strlen nstr))))\n (setq nlist (mapcar 'atoi strlist))\n (cond\n ((> n 999)(setq rom(strcat(nth (car nlist) THO)(nth (cadr nlist) HUN)(nth (caddr nlist) DEC) (nth (last nlist)UNI ))))\n ((and (> n 99)(<= n 999))(setq rom(strcat (nth (car nlist) HUN)(nth (cadr nlist) DEC) (nth (last nlist)UNI ))))\n ((and (> n 9)(<= n 99))(setq rom(strcat (nth (car nlist) DEC) (nth (last nlist)UNI ))))\n ((<= n 9)(setq rom(nth (last nlist)UNI)))\n )\n )\n (princ \"\\nNumber out of range!\")\n )\nrom\n)\n","language":"AutoLISP"},{"code":"# syntax: GAWK -f ROMAN_NUMERALS_ENCODE.AWK\nBEGIN {\n leng = split(\"1990 2008 1666\",arr,\" \")\n for (i=1; i<=leng; i++) {\n n = arr[i]\n printf(\"%s = %s\\n\",n,dec2roman(n))\n }\n exit(0)\n}\nfunction dec2roman(number, v,w,x,y,roman1,roman10,roman100,roman1000) {\n number = int(number) # force to integer\n if (number < 1 || number > 3999) { # number is too small | big\n return\n }\n split(\"I II III IV V VI VII VIII IX\",roman1,\" \") # 1 2 ... 9\n split(\"X XX XXX XL L LX LXX LXXX XC\",roman10,\" \") # 10 20 ... 90\n split(\"C CC CCC CD D DC DCC DCCC CM\",roman100,\" \") # 100 200 ... 900\n split(\"M MM MMM\",roman1000,\" \") # 1000 2000 3000\n v = (number - (number % 1000)) / 1000\n number = number % 1000\n w = (number - (number % 100)) / 100\n number = number % 100\n x = (number - (number % 10)) / 10\n y = number % 10\n return(roman1000[v] roman100[w] roman10[x] roman1[y])\n}\n","language":"AWK"},{"code":"OPTION BASE 1\n\nGLOBAL roman$[] = { \"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\" }\nGLOBAL number[] = { 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 }\n\nFUNCTION toroman$(value)\n\n LOCAL result$\n\n DOTIMES UBOUND(number)\n WHILE value >= number[_]\n result$ = result$ & roman$[_]\n DECR value, number[_]\n WEND\n DONE\n\n RETURN result$\n\nENDFUNC\n\nPRINT toroman$(1990)\nPRINT toroman$(2008)\nPRINT toroman$(1666)\n","language":"BaCon"},{"code":"print 1666+\" = \"+convert$(1666)\nprint 2008+\" = \"+convert$(2008)\nprint 1001+\" = \"+convert$(1001)\nprint 1999+\" = \"+convert$(1999)\n\nfunction convert$(value)\nconvert$=\"\"\narabic = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 }\nroman$ = {\"M\", \"CM\", \"D\",\"CD\", \"C\",\"XC\",\"L\",\"XL\",\"X\",\"IX\",\"V\",\"IV\",\"I\"}\n for i = 0 to 12\n while value >= arabic[i]\n\t convert$ += roman$[i]\n\t value = value - arabic[i]\n\t end while\n next i\nend function\n","language":"BASIC256"},{"code":"@echo off\nsetlocal enabledelayedexpansion\n\nset cnt=0&for %%A in (1000,900,500,400,100,90,50,40,10,9,5,4,1) do (set arab!cnt!=%%A&set /a cnt+=1)\nset cnt=0&for %%R in (M,CM,D,CD,C,XC,L,XL,X,IX,V,IV,I) do (set rom!cnt!=%%R&set /a cnt+=1)\n\n::Testing\ncall :toRoman 2009\necho 2009 = !result!\ncall :toRoman 1666\necho 1666 = !result!\ncall :toRoman 3888\necho 3888 = !result!\npause>nul\nexit/b 0\n\n::The \"function\"...\n:toRoman\nset value=%1\nset result=\n\nfor /l %%i in (0,1,12) do (\n\tset a=%%i\n\tcall :add_val\n)\ngoto :EOF\n\n:add_val\nif !value! lss !arab%a%! goto :EOF\nset result=!result!!rom%a%!\nset /a value-=!arab%a%!\ngoto add_val\n","language":"Batch-File"},{"code":" PRINT ;1999, FNroman(1999)\n PRINT ;2012, FNroman(2012)\n PRINT ;1666, FNroman(1666)\n PRINT ;3888, FNroman(3888)\n END\n\n DEF FNroman(n%)\n LOCAL i%, r$, arabic%(), roman$()\n DIM arabic%(12), roman$(12)\n arabic%() = 1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900,1000\n roman$() = \"I\",\"IV\", \"V\",\"IX\", \"X\",\"XL\", \"L\",\"XC\", \"C\",\"CD\", \"D\",\"CM\", \"M\"\n FOR i% = 12 TO 0 STEP -1\n WHILE n% >= arabic%(i%)\n r$ += roman$(i%)\n n% -= arabic%(i%)\n ENDWHILE\n NEXT\n = r$\n","language":"BBC-BASIC"},{"code":"get \"libhdr\"\n\nlet toroman(n, v) = valof\n$( let extract(n, val, rmn, v) = valof\n $( while n >= val\n $( n := n - val;\n for i=1 to rmn%0 do v%(v%0+i) := rmn%i\n v%0 := v%0 + rmn%0\n $)\n resultis n\n $)\n\n v%0 := 0\n n := extract(n, 1000, \"M\", v)\n n := extract(n, 900, \"CM\", v)\n n := extract(n, 500, \"D\", v)\n n := extract(n, 400, \"CD\", v)\n n := extract(n, 100, \"C\", v)\n n := extract(n, 90, \"XC\", v)\n n := extract(n, 50, \"L\", v)\n n := extract(n, 40, \"XL\", v)\n n := extract(n, 10, \"X\", v)\n n := extract(n, 9, \"IX\", v)\n n := extract(n, 5, \"V\", v)\n n := extract(n, 4, \"IV\", v)\n n := extract(n, 1, \"I\", v)\n resultis v\n$)\n\nlet show(n) be\n$( let v = vec 50\n writef(\"%I4 = %S*N\", n, toroman(n, v))\n$)\n\nlet start() be\n$( show(1666)\n show(2008)\n show(1001)\n show(1999)\n show(3888)\n show(2021)\n$)\n","language":"BCPL"},{"code":"&>0\\0>00p:#v_$ >:#,_ $ @\n4-v >5+#:/#<\\55+%:5/\\5%:\nvv_$9+00g+5g\\00g8+>5g\\00\ng>\\20p>:10p00g \\#v _20gv\n> 2+ v^-1g01\\g5+8<^ +9 _\n IVXLCDM\n","language":"Befunge"},{"code":"⟨ToRoman⇐R⟩ ← {\n ds ← 1↓¨(¯1+`⊏⊸=)⊸⊔\" I IV V IX X XL L XC C CD D CM M\"\n vs ← 1e3∾˜ ⥊1‿4‿5‿9×⌜˜10⋆↕3\n R ⇐ {\n 𝕨𝕊0: \"\";\n (⊑⟜ds∾·𝕊𝕩-⊑⟜vs) 1-˜⊑vs⍋𝕩\n }\n}\n","language":"BQN"},{"code":" ToRoman¨ 1990‿2008‿1666‿2021\n⟨ \"MCMXC\" \"MMVIII\" \"MDCLXVI\" \"MMXXI\" ⟩\n","language":"BQN"},{"code":"( ( encode\n = indian roman cifr tenfoldroman letter tenfold\n . !arg:#?indian\n & :?roman\n & whl\n ' ( @(!indian:#%?cifr ?indian)\n & :?tenfoldroman\n & whl\n ' ( !roman:%?letter ?roman\n & !tenfoldroman\n ( (I.X)\n (V.L)\n (X.C)\n (L.D)\n (C.M)\n : ? (!letter.?tenfold) ?\n & !tenfold\n | \"*\"\n )\n : ?tenfoldroman\n )\n & !tenfoldroman:?roman\n & ( !cifr:9&!roman I X:?roman\n | !cifr:~<4\n & !roman\n (!cifr:4&I|)\n V\n : ?roman\n & !cifr+-5:?cifr\n & ~\n | whl\n ' ( !cifr+-1:~<0:?cifr\n & !roman I:?roman\n )\n )\n )\n & ( !roman:? \"*\" ?&~`\n | str$!roman\n )\n )\n& 1990 2008 1666 3888 3999 4000:?NS\n& whl\n ' ( !NS:%?N ?NS\n & out\n $ ( encode$!N:?K&!N !K\n | str$(\"Can't convert \" !N \" to Roman numeral\")\n )\n )\n);\n","language":"Bracmat"},{"code":"#include <stdio.h>\n\n\nint main() {\n int arabic[] = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};\n\n // There is a bug: \"XL\\0\" is translated into sequence 58 4C 00 00, i.e. it is 4-bytes long...\n // Should be \"XL\" without \\0 etc.\n //\n char roman[13][3] = {\"M\\0\", \"CM\\0\", \"D\\0\", \"CD\\0\", \"C\\0\", \"XC\\0\", \"L\\0\", \"XL\\0\", \"X\\0\", \"IX\\0\", \"V\\0\", \"IV\\0\", \"I\\0\"};\n int N;\n\n printf(\"Enter arabic number:\\n\");\n scanf(\"%d\", &N);\n printf(\"\\nRoman number:\\n\");\n\n for (int i = 0; i < 13; i++) {\n while (N >= arabic[i]) {\n printf(\"%s\", roman[i]);\n N -= arabic[i];\n }\n }\n return 0;\n}\n","language":"C"},{"code":"#define _CRT_SECURE_NO_WARNINGS\n\n#include <stdio.h>\n#include <string.h>\n\nint RomanNumerals_parseInt(const char* string)\n{\n int value;\n return scanf(\"%u\", &value) == 1 && value > 0 ? value : 0;\n}\n\nconst char* RomanNumerals_toString(int value)\n{\n#define ROMAN_NUMERALS_MAX_OUTPUT_STRING_SIZE 64\n static buffer[ROMAN_NUMERALS_MAX_OUTPUT_STRING_SIZE];\n\n const static int maxValue = 5000;\n const static int minValue = 1;\n\n const static struct Digit {\n char string[4]; // It's better to use 4 than 3 (aligment).\n int value;\n } digits[] = {\n {\"M\", 1000}, {\"CM\", 900}, {\"D\", 500 }, {\"CD\", 400 },\n {\"C\", 100 }, {\"XC\", 90 }, {\"L\", 50 }, {\"XL\", 40},\n {\"X\", 10}, {\"IX\", 9}, {\"V\", 5}, {\"IV\", 4}, {\"I\", 1 },\n {\"?\", 0}\n };\n\n *buffer = '\\0'; // faster than memset(buffer, 0, sizeof(buffer));\n if (minValue <= value && value <= maxValue)\n {\n struct Digit* digit = &digits[0];\n\n while (digit->value)\n {\n while (value >= digit->value)\n {\n value -= digit->value;\n // It is not necessary - total length would not be exceeded...\n // if (strlen(buffer) + strlen(digit->string) < sizeof(buffer))\n strcat(buffer, digit->string);\n }\n digit++;\n }\n }\n return buffer;\n}\n\n\nint main(int argc, char* argv[])\n{\n if (argc < 2)\n {\n // Blanks are needed for a consistient blackground on some systems.\n // BTW, puts append an extra newline at the end.\n //\n puts(\"Write given numbers as Roman numerals. \\n\"\n \" \\n\"\n \"Usage: \\n\"\n \" roman n1 n2 n3 ... \\n\"\n \" \\n\"\n \"where n1 n2 n3 etc. are Arabic numerals\\n\");\n\n int numbers[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1498, 2022 };\n for (int i = 0; i < sizeof(numbers) / sizeof(int); i++)\n {\n printf(\"%4d = %s\\n\",\n numbers[i], RomanNumerals_toString(numbers[i]));\n }\n }\n else\n {\n for (int i = 1; i < argc; i++)\n {\n int number = RomanNumerals_parseInt(argv[i]);\n if (number)\n {\n puts(RomanNumerals_toString(number));\n }\n else\n {\n puts(\"???\");\n }\n }\n }\n\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <string>\n\nstd::string to_roman(int value)\n{\n struct romandata_t { int value; char const* numeral; };\n static romandata_t const romandata[] =\n { 1000, \"M\",\n 900, \"CM\",\n 500, \"D\",\n 400, \"CD\",\n 100, \"C\",\n 90, \"XC\",\n 50, \"L\",\n 40, \"XL\",\n 10, \"X\",\n 9, \"IX\",\n 5, \"V\",\n 4, \"IV\",\n 1, \"I\",\n 0, NULL }; // end marker\n\n std::string result;\n for (romandata_t const* current = romandata; current->value > 0; ++current)\n {\n while (value >= current->value)\n {\n result += current->numeral;\n value -= current->value;\n }\n }\n return result;\n}\n\nint main()\n{\n for (int i = 1; i <= 4000; ++i)\n {\n std::cout << to_roman(i) << std::endl;\n }\n}\n","language":"C++"},{"code":"#include <iostream>\n#include <string>\n\nstd::string to_roman(int x) {\n if (x <= 0)\n return \"Negative or zero!\";\n auto roman_digit = [](char one, char five, char ten, int x) {\n if (x <= 3)\n return std::string().assign(x, one);\n if (x <= 5)\n return std::string().assign(5 - x, one) + five;\n if (x <= 8)\n return five + std::string().assign(x - 5, one);\n return std::string().assign(10 - x, one) + ten;\n };\n if (x >= 1000)\n return x - 1000 > 0 ? \"M\" + to_roman(x - 1000) : \"M\";\n if (x >= 100) {\n auto s = roman_digit('C', 'D', 'M', x / 100);\n return x % 100 > 0 ? s + to_roman(x % 100) : s;\n }\n if (x >= 10) {\n auto s = roman_digit('X', 'L', 'C', x / 10);\n return x % 10 > 0 ? s + to_roman(x % 10) : s;\n }\n return roman_digit('I', 'V', 'X', x);\n}\n\nint main() {\n for (int i = 0; i < 2018; i++)\n std::cout << i << \" --> \" << to_roman(i) << std::endl;\n}\n","language":"C++"},{"code":"using System;\nclass Program\n{\n static uint[] nums = { 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 };\n static string[] rum = { \"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\" };\n\n static string ToRoman(uint number)\n {\n string value = \"\";\n for (int i = 0; i < nums.Length && number != 0; i++)\n {\n while (number >= nums[i])\n {\n number -= nums[i];\n value += rum[i];\n }\n }\n return value;\n }\n\n static void Main()\n {\n for (uint number = 1; number <= 1 << 10; number *= 2)\n {\n Console.WriteLine(\"{0} = {1}\", number, ToRoman(number));\n }\n }\n}\n","language":"C-sharp"},{"code":"Func<int, string> toRoman = (number) =>\n new Dictionary<int, string>\n {\n {1000, \"M\"},\n {900, \"CM\"},\n {500, \"D\"},\n {400, \"CD\"},\n {100, \"C\"},\n {90, \"XC\"},\n {50, \"L\"},\n {40, \"XL\"},\n {10, \"X\"},\n {9, \"IX\"},\n {5, \"V\"},\n {4, \"IV\"},\n {1, \"I\"}\n }.Aggregate(new string('I', number), (m, _) => m.Replace(new string('I', _.Key), _.Value));\n","language":"C-sharp"},{"code":"shared void run() {\n\t\n\tclass Numeral(shared Character char, shared Integer int) {}\n\t\n\tvalue tiers = [\n\t\t[Numeral('I', 1), Numeral('V', 5), Numeral('X', 10)],\n\t\t[Numeral('X', 10), Numeral('L', 50), Numeral('C', 100)],\n\t\t[Numeral('C', 100), Numeral('D', 500), Numeral('M', 1k)]\n\t];\n\t\n\tString toRoman(Integer hindu, Integer tierIndex = 2) {\n\t\t\n\t\tassert (exists tier = tiers[tierIndex]);\n\t\t\n\t\t\" Finds if it's a two character numeral like iv, ix, xl, xc, cd and cm.\"\n\t\tfunction findTwoCharacterNumeral() =>\n\t\t\tif (exists bigNum = tier.rest.find((numeral) => numeral.int - tier.first.int <= hindu < numeral.int))\n\t\t\tthen [tier.first, bigNum]\n\t\t\telse null;\n\t\t\n\t\tif (hindu <= 0) {\n\t\t\t// if it's zero then we are done!\n\t\t\treturn \"\";\n\t\t}\n\t\telse if (exists [smallNum, bigNum] = findTwoCharacterNumeral()) {\n\t\t\tvalue twoCharSymbol = \"``smallNum.char````bigNum.char``\";\n\t\t\tvalue twoCharValue = bigNum.int - smallNum.int;\n\t\t\treturn \"``twoCharSymbol````toRoman(hindu - twoCharValue, tierIndex)``\";\n\t\t}\n\t\telse if (exists num = tier.reversed.find((Numeral elem) => hindu >= elem.int)) {\n\t\t\treturn \"``num.char````toRoman(hindu - num.int, tierIndex)``\";\n\t\t}\n\t\telse {\n\t\t\t// nothing was found so move to the next smaller tier!\n\t\t\treturn toRoman(hindu, tierIndex - 1);\n\t\t}\n\t}\n\t\n\tassert (toRoman(1) == \"I\");\n\tassert (toRoman(2) == \"II\");\n\tassert (toRoman(4) == \"IV\");\n\tassert (toRoman(1666) == \"MDCLXVI\");\n\tassert (toRoman(1990) == \"MCMXC\");\n\tassert (toRoman(2008) == \"MMVIII\");\n}\n","language":"Ceylon"},{"code":"100 cls\n110 dim arabic(12), roman$(12)\n120 for j = 0 to 12 : read arabic(j),roman$(j) : next j\n130 data 1000,\"M\", 900,\"CM\", 500,\"D\", 400,\"CD\", 100,\"C\", 90,\"XC\"\n140 data 50,\"L\",40,\"XL\",10,\"X\",9,\"IX\",5,\"V\",4,\"IV\",1,\"I\"\n187 avalor = 1990 : print avalor \"= \"; : gosub 220 : print roman$ ' MCMXC\n188 avalor = 2008 : print avalor \"= \"; : gosub 220 : print roman$ ' MMXXII\n189 avalor = 1666 : print avalor \"= \"; : gosub 220 : print roman$ ' MDCLXVI\n200 end\n210 rem Encode to Roman\n220 roman$ = \"\" : i = 0\n230 while (i <= 12) and (avalor > 0)\n240 while avalor >= arabic(i)\n250 roman$ = roman$+roman$(i)\n260 avalor = avalor-arabic(i)\n270 wend\n280 i = i+1\n290 wend\n300 return\n","language":"Chipmunk-Basic"},{"code":"(def arabic->roman\n (partial clojure.pprint/cl-format nil \"~@R\"))\n\n(arabic->roman 147)\n;\"CXXIII\"\n(arabic->roman 99)\n;\"XCIX\"\n","language":"Clojure"},{"code":"(def roman-map\n (sorted-map\n 1 \"I\", 4 \"IV\", 5 \"V\", 9 \"IX\",\n 10 \"X\", 40 \"XL\", 50 \"L\", 90 \"XC\",\n 100 \"C\", 400 \"CD\", 500 \"D\", 900 \"CM\"\n 1000 \"M\"))\n\n(defn int->roman [n]\n {:pre (integer? n)}\n (loop [res (StringBuilder.), n n]\n (if-let [v (roman-map n)]\n (str (.append res v))\n (let [[k v] (->> roman-map keys (filter #(> n %)) last (find roman-map))]\n (recur (.append res v) (- n k))))))\n\n(int->roman 1999)\n; \"MCMXCIX\"\n","language":"Clojure"},{"code":"(defn a2r [a]\n (let [rv '(1000 500 100 50 10 5 1)\n rm (zipmap rv \"MDCLXVI\")\n dv (->> rv (take-nth 2) next #(interleave % %))]\n (loop [a a rv rv dv dv r nil]\n (if (<= a 0)\n r\n (let [v (first rv)\n d (or (first dv) 0)\n l (- v d)]\n (cond\n (= a v) (str r (rm v))\n (= a l) (str r (rm d) (rm v))\n (and (> a v) (> a l)) (recur (- a v) rv dv (str r (rm v)))\n (and (< a v) (< a l)) (recur a (rest rv) (rest dv) r)\n :else (recur (- a l) (rest rv) (rest dv) (str r (rm d) (rm v)))))))))\n","language":"Clojure"},{"code":"(a2r 1666)\n\"MDCLXVI\"\n\n(map a2r [1000 1 389 45])\n(\"M\" \"I\" \"CCCLXXXIX\" \"XLV\")\n","language":"Clojure"},{"code":"(def roman-map\n (sorted-map-by >\n 1 \"I\", 4 \"IV\", 5 \"V\", 9 \"IX\",\n 10 \"X\", 40 \"XL\", 50 \"L\", 90 \"XC\",\n 100 \"C\", 400 \"CD\", 500 \"D\", 900 \"CM\"\n 1000 \"M\"))\n\n(defn a2r\n ([r]\n (reduce str (a2r r (keys roman-map))))\n ([r n]\n (when-not (empty? n)\n (let [e (first n)\n v (- r e)\n roman (roman-map e)]\n (cond\n (< v 0) (a2r r (rest n))\n (= v 0) (cons roman [])\n (>= v e) (cons roman (a2r v n))\n (< v e) (cons roman (a2r v (rest n))))))))\n","language":"Clojure"},{"code":"(a2r 1666)\n\"MDCLXVI\"\n\n(map a2r [1000 1 389 45])\n(\"M\" \"I\" \"CCCLXXXIX\" \"XLV\")\n","language":"Clojure"},{"code":"roman = cluster is encode\n rep = null\n\n dmap = struct[v: int, s: string]\n darr = array[dmap]\n own chunks: darr := darr$\n [dmap${v: 1000, s: \"M\"},\n dmap${v: 900, s: \"CM\"},\n dmap${v: 500, s: \"D\"},\n dmap${v: 400, s: \"CD\"},\n dmap${v: 100, s: \"C\"},\n dmap${v: 90, s: \"XC\"},\n dmap${v: 50, s: \"L\"},\n dmap${v: 40, s: \"XL\"},\n dmap${v: 10, s: \"X\"},\n dmap${v: 9, s: \"IX\"},\n dmap${v: 5, s: \"V\"},\n dmap${v: 4, s: \"IV\"},\n dmap${v: 1, s: \"I\"}]\n\n largest_chunk = proc (i: int) returns (int, string)\n for chunk: dmap in darr$elements(chunks) do\n if chunk.v <= i then return (chunk.v, chunk.s) end\n end\n return (0, \"\")\n end largest_chunk\n\n encode = proc (i: int) returns (string)\n result: string := \"\"\n while i > 0 do\n val: int chunk: string\n val, chunk := largest_chunk(i)\n result := result || chunk\n i := i - val\n end\n return (result)\n end encode\nend roman\n\nstart_up = proc ()\n po: stream := stream$primary_output()\n tests: array[int] := array[int]$[1666, 2008, 1001, 1999, 3888, 2021]\n\n for test: int in array[int]$elements(tests) do\n stream$putl(po, int$unparse(test) || \" = \" || roman$encode(test))\n end\nend start_up\n","language":"CLU"},{"code":"IDENTIFICATION DIVISION.\nPROGRAM-ID. TOROMAN.\nDATA DIVISION.\nworking-storage section.\n 01 ws-number pic 9(4) value 0.\n 01 ws-save-number pic 9(4).\n 01 ws-tbl-def.\n 03 filler pic x(7) value '1000M '.\n 03 filler pic x(7) value '0900CM '.\n 03 filler pic x(7) value '0500D '.\n 03 filler pic x(7) value '0400CD '.\n 03 filler pic x(7) value '0100C '.\n 03 filler pic x(7) value '0090XC '.\n 03 filler pic x(7) value '0050L '.\n 03 filler pic x(7) value '0040XL '.\n 03 filler pic x(7) value '0010X '.\n 03 filler pic x(7) value '0009IX '.\n 03 filler pic x(7) value '0005V '.\n 03 filler pic x(7) value '0004IV '.\n 03 filler pic x(7) value '0001I '.\n 01 filler redefines ws-tbl-def.\n 03 filler occurs 13 times indexed by rx.\n 05 ws-tbl-divisor pic 9(4).\n 05 ws-tbl-roman-ch pic x(1) occurs 3 times indexed by cx.\n 01 ocx pic 99.\n 01 ws-roman.\n 03 ws-roman-ch pic x(1) occurs 16 times.\nPROCEDURE DIVISION.\n accept ws-number\n perform\n until ws-number = 0\n move ws-number to ws-save-number\n if ws-number > 0 and ws-number < 4000\n initialize ws-roman\n move 0 to ocx\n perform varying rx from 1 by +1\n until ws-number = 0\n perform until ws-number < ws-tbl-divisor (rx)\n perform varying cx from 1 by +1\n \t\t until ws-tbl-roman-ch (rx, cx) = spaces\n compute ocx = ocx + 1\n move ws-tbl-roman-ch (rx, cx) to ws-roman-ch (ocx)\n end-perform\n compute ws-number = ws-number - ws-tbl-divisor (rx)\n end-perform\n end-perform\n display 'inp=' ws-save-number ' roman=' ws-roman\n else\n display 'inp=' ws-save-number ' invalid'\n end-if\n accept ws-number\n end-perform\n .\n","language":"COBOL"},{"code":"decimal_to_roman = (n) ->\n # This should work for any positive integer, although it\n # gets a bit preposterous for large numbers.\n if n >= 4000\n thousands = decimal_to_roman n / 1000\n ones = decimal_to_roman n % 1000\n return \"M(#{thousands})#{ones}\"\n\n s = ''\n translate_each = (min, roman) ->\n while n >= min\n n -= min\n s += roman\n translate_each 1000, \"M\"\n translate_each 900, \"CM\"\n translate_each 500, \"D\"\n translate_each 400, \"CD\"\n translate_each 100, \"C\"\n translate_each 90, \"XC\"\n translate_each 50, \"L\"\n translate_each 40, \"XL\"\n translate_each 10, \"X\"\n translate_each 9, \"IX\"\n translate_each 5, \"V\"\n translate_each 4, \"IV\"\n translate_each 1, \"I\"\n s\n\n###################\ntests =\n IV: 4\n XLII: 42\n MCMXC: 1990\n MMVIII: 2008\n MDCLXVI: 1666\n 'M(IV)': 4000\n 'M(VI)IX': 6009\n 'M(M(CXXIII)CDLVI)DCCLXXXIX': 123456789\n 'M(MMMV)I': 3005001\n\nfor expected, decimal of tests\n roman = decimal_to_roman(decimal)\n if roman == expected\n console.log \"#{decimal} = #{roman}\"\n else\n console.log \"error for #{decimal}: #{roman} is wrong\"\n","language":"CoffeeScript"},{"code":"100 DIM RN$(12),NV(12)\n110 FOR I=0 TO 12\n120 : READ RN$(I), NV(I)\n130 NEXT I\n140 DATA M,1000, CM,900, D,500, CD,400\n150 DATA C, 100, XC, 90, L, 50, XL, 40\n160 DATA X, 10, IX, 9, V, 5, IV, 4\n170 DATA I, 1\n180 PRINT CHR$(19);CHR$(19);CHR$(147);CHR$(18);\n190 PRINT \"***** ROMAN NUMERAL ENCODER *****\";CHR$(27);\"T\"\n200 DO\n210 : PRINT \"ENTER NUMBER (0 TO QUIT):\";\n220 : OPEN 1,0:INPUT#1,AN$:CLOSE 1:PRINT\n230 : AN=VAL(AN$):IF AN=0 THEN EXIT\n240 : RN$=\"\"\n250 : DO WHILE AN > 0\n260 : FOR I=0 TO 12\n270 : IF AN >= NV(I) THEN BEGIN\n280 : RN$ = RN$+ RN$(I)\n290 : AN = AN - NV(I)\n300 : GOTO 330\n310 : BEND\n320 : NEXT I\n330 : LOOP\n340 : PRINT RN$;CHR$(13)\n350 LOOP\n","language":"Commodore-BASIC"},{"code":"100 DIM RN$(12),NV(12)\n110 FOR I=0 TO 12\n120 : READ RN$(I), NV(I)\n130 NEXT I\n140 DATA M,1000, CM,900, D,500, CD,400\n150 DATA C, 100, XC, 90, L, 50, XL, 40\n160 DATA X, 10, IX, 9, V, 5, IV, 4\n170 DATA I, 1\n180 PRINT CHR$(19);CHR$(19);CHR$(147);CHR$(18);\n190 PRINT \"***** ROMAN NUMERAL ENCODER *****\";CHR$(27);\"T\"\n200 DO\n210 : PRINT \"ENTER NUMBER (0 TO QUIT):\";\n220 : OPEN 1,0:INPUT#1,AN$:CLOSE 1:PRINT\n230 : AN=VAL(AN$):IF AN=0 THEN EXIT\n240 : RN$=\"\"\n250 : DO WHILE AN > 0\n260 : FOR I=0 TO 12\n270 : IF AN < NV(I) THEN 320\n280 : RN$ = RN$+ RN$(I)\n290 : AN = AN - NV(I)\n300 : I = 12\n320 : NEXT I\n330 : LOOP\n340 : PRINT RN$;CHR$(13)\n350 LOOP\n","language":"Commodore-BASIC"},{"code":"100 DIM RN$(12),NV(12)\n110 FOR I=0 TO 12\n120 : READ RN$(I), NV(I)\n130 NEXT I\n140 DATA M,1000, CM,900, D,500, CD,400\n150 DATA C, 100, XC, 90, L, 50, XL, 40\n160 DATA X, 10, IX, 9, V, 5, IV, 4\n170 DATA I, 1\n180 PRINT CHR$(19);CHR$(19);CHR$(147);CHR$(18);\n190 PRINT \"***** ROMAN NUMERAL ENCODER *****\";\n200 REM BEGIN MAIN LOOP\n210 : PRINT \"NUMBER (0 TO QUIT):\";\n220 : OPEN 1,0:INPUT#1,AN$:CLOSE 1:PRINT\n230 : AN=VAL(AN$):IF AN=0 THEN END\n240 : RN$=\"\"\n250 : IF AN <= 0 THEN 340\n260 : FOR I=0 TO 12\n270 : IF AN < NV(I) THEN 320\n280 : RN$ = RN$+ RN$(I)\n290 : AN = AN - NV(I)\n300 : I = 12\n320 : NEXT I\n330 : GOTO 250\n340 : PRINT RN$;CHR$(13)\n350 GOTO 210\n","language":"Commodore-BASIC"},{"code":"(defun roman-numeral (n)\n (format nil \"~@R\" n))\n","language":"Common-Lisp"},{"code":"include \"cowgol.coh\";\ninclude \"argv.coh\";\n\n# Encode the given number as a Roman numeral\nsub decimalToRoman(num: uint16, buf: [uint8]): (rslt: [uint8]) is\n # return the start of the buffer for easy printing\n rslt := buf;\n\n # Add string to buffer\n sub Add(str: [uint8]) is\n while [str] != 0 loop\n [buf] := [str];\n buf := @next buf;\n str := @next str;\n end loop;\n end sub;\n\n # Table of Roman numerals\n record Roman is\n value: uint16;\n string: [uint8];\n end record;\n\n var numerals: Roman[] := {\n {1000, \"M\"}, {900, \"CM\"}, {500, \"D\"}, {400, \"CD\"},\n {100, \"C\"}, {90, \"XC\"}, {50, \"L\"}, {40, \"XL\"},\n {10, \"X\"}, {9, \"IX\"}, {5, \"V\"}, {4, \"IV\"},\n {1, \"I\"}\n };\n\n var curNum := &numerals as [Roman];\n while num != 0 loop\n while num >= curNum.value loop\n Add(curNum.string);\n num := num - curNum.value;\n end loop;\n curNum := @next curNum;\n end loop;\n\n [buf] := 0; # terminate the string\nend sub;\n\n# Read numbers from the command line and print the corresponding Roman numerals\nArgvInit();\nvar buffer: uint8[100];\nloop\n var argmt := ArgvNext();\n if argmt == (0 as [uint8]) then\n break;\n end if;\n\n var dummy: [uint8];\n var number: int32;\n (number, dummy) := AToI(argmt);\n\n print(decimalToRoman(number as uint16, &buffer as [uint8]));\n print_nl();\nend loop;\n","language":"Cowgol"},{"code":"string toRoman(int n) pure nothrow\nin {\n assert(n < 5000);\n} body {\n static immutable weights = [1000, 900, 500, 400, 100, 90,\n 50, 40, 10, 9, 5, 4, 1];\n static immutable symbols = [\"M\",\"CM\",\"D\",\"CD\",\"C\",\"XC\",\"L\",\n \"XL\",\"X\",\"IX\",\"V\",\"IV\",\"I\"];\n\n string roman;\n foreach (i, w; weights) {\n while (n >= w) {\n roman ~= symbols[i];\n n -= w;\n }\n if (n == 0)\n break;\n }\n return roman;\n} unittest {\n assert(toRoman(455) == \"CDLV\");\n assert(toRoman(3456) == \"MMMCDLVI\");\n assert(toRoman(2488) == \"MMCDLXXXVIII\");\n}\n\nvoid main() {}\n","language":"D"},{"code":"program RomanNumeralsEncode;\n\n{$APPTYPE CONSOLE}\n\nfunction IntegerToRoman(aValue: Integer): string;\nvar\n i: Integer;\nconst\n WEIGHTS: array[0..12] of Integer = (1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1);\n SYMBOLS: array[0..12] of string = ('M', 'CM', 'D', 'CD', 'C', 'XC', 'L', 'XL', 'X', 'IX', 'V', 'IV', 'I');\nbegin\n for i := Low(WEIGHTS) to High(WEIGHTS) do\n begin\n while aValue >= WEIGHTS[i] do\n begin\n Result := Result + SYMBOLS[i];\n aValue := aValue - WEIGHTS[i];\n end;\n if aValue = 0 then\n Break;\n end;\nend;\n\nbegin\n Writeln(IntegerToRoman(1990)); // MCMXC\n Writeln(IntegerToRoman(2008)); // MMVIII\n Writeln(IntegerToRoman(1666)); // MDCLXVI\nend.\n","language":"Delphi"},{"code":"const weights = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1];\nconst symbols = [\"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\"];\n\nfunction toRoman(n : Integer) : String;\nvar\n i, w : Integer;\nbegin\n for i := 0 to weights.High do begin\n w := weights[i];\n while n >= w do begin\n Result += symbols[i];\n n -= w;\n end;\n if n = 0 then Break;\n end;\nend;\n\nPrintLn(toRoman(455));\nPrintLn(toRoman(3456));\nPrintLn(toRoman(2488));\n","language":"DWScript"},{"code":"func$ dec2rom dec .\n values[] = [ 1000 900 500 400 100 90 50 40 10 9 5 4 1 ]\n symbol$[] = [ \"M\" \"CM\" \"D\" \"CD\" \"C\" \"XC\" \"L\" \"XL\" \"X\" \"IX\" \"V\" \"IV\" \"I\" ]\n for i = 1 to len values[]\n while dec >= values[i]\n rom$ &= symbol$[i]\n dec -= values[i]\n .\n .\n return rom$\n.\nprint dec2rom 1990\nprint dec2rom 2008\nprint dec2rom 1666\n","language":"EasyLang"},{"code":"RomanEncode(UNSIGNED Int) := FUNCTION\n SetWeights := [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1];\n SetSymbols := ['M', 'CM', 'D', 'CD', 'C', 'XC', 'L', 'XL', 'X', 'IX', 'V', 'IV', 'I'];\n ProcessRec := RECORD\n UNSIGNED val;\n STRING Roman;\n END;\n dsWeights := DATASET(13,TRANSFORM(ProcessRec,SELF.val := Int, SELF := []));\n\n SymbolStr(i,n,STRING s) := CHOOSE(n+1,'',SetSymbols[i],SetSymbols[i]+SetSymbols[i],SetSymbols[i]+SetSymbols[i]+SetSymbols[i],s);\n\t\n RECORDOF(dsWeights) XF(dsWeights L, dsWeights R, INTEGER C) := TRANSFORM\n ThisVal := IF(C=1,R.Val,L.Val);\n IsDone := ThisVal = 0;\n SELF.Roman := IF(IsDone,L.Roman,L.Roman + SymbolStr(C,ThisVal DIV SetWeights[C],L.Roman));\n SELF.val := IF(IsDone,0,ThisVal - ((ThisVal DIV SetWeights[C])*SetWeights[C]));\n END;\n i := ITERATE(dsWeights,XF(LEFT,RIGHT,COUNTER));\n RETURN i[13].Roman;\nEND;\n\nRomanEncode(1954); //MCMLIV\nRomanEncode(1990 ); //MCMXC\nRomanEncode(2008 ); //MMVIII\nRomanEncode(1666); //MDCLXVI\n","language":"ECL"},{"code":"class\n\tAPPLICATION\n\ncreate\n\tmake\n\nfeature {NONE} -- Initialization\n\n\tmake\n\t\tlocal\n\t\t\tnumbers: ARRAY [INTEGER]\n\t\tdo\n\t\t\tnumbers := <<1990, 2008, 1666, 3159, 1977, 2010>>\n\t\t\t\t -- \"MCMXC\", \"MMVIII\", \"MDCLXVI\", \"MMMCLIX\", \"MCMLXXVII\", \"MMX\"\n\t\t\tacross numbers as n loop\n\t\t\t\tprint (n.item.out + \" in decimal Arabic numerals is \" +\n\t\t\t\t decimal_to_roman (n.item) + \" in Roman numerals.%N\")\n\t\t\tend\n\t\tend\n\nfeature -- Roman numerals\n\n\tdecimal_to_roman (a_int: INTEGER): STRING\n\t\t-- Representation of integer `a_int' as Roman numeral\n\t\trequire\n\t\t\ta_int > 0\n\t\tlocal\n\t\t\tdnums: ARRAY[INTEGER]\n\t\t\trnums: ARRAY[STRING]\n\n\t\t\tdnum: INTEGER\n\t\t\trnum: STRING\n\n\t\t\ti: INTEGER\n\t\tdo\n\t\t\tdnums := <<1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1>>\n\t\t\trnums := <<\"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\">>\n\n\t\t\tdnum := a_int\n\t\t\trnum := \"\"\n\n\t\t\tfrom\n\t\t\t\ti := 1\n\t\t\tuntil\n\t\t\t\ti > dnums.count or dnum <= 0\n\t\t\tloop\n\t\t\t\tfrom\n\t\t\t\tuntil\n\t\t\t\t\tdnum < dnums[i]\n\t\t\t\tloop\n\t\t\t\t\tdnum := dnum - dnums[i]\n\t\t\t\t\trnum := rnum + rnums[i]\n\t\t\t\tend\n\t\t\t\ti := i + 1\n\t\t\tend\n\n\t\t\tResult := rnum\n\t\tend\nend\n","language":"Eiffel"},{"code":"open number string math\n\ndigit x y z k =\n [[x],[x,x],[x,x,x],[x,y],[y],[y,x],[y,x,x],[y,x,x,x],[x,z]] :\n (toInt k - 1)\n\ntoRoman 0 = \"\"\ntoRoman x | x < 0 = fail \"Negative roman numeral\"\n | x >= 1000 = 'M' :: toRoman (x - 1000)\n | x >= 100 = let (q,r) = x `divrem` 100 in\n digit 'C' 'D' 'M' q ++ toRoman r\n | x >= 10 = let (q,r) = x `divrem` 10 in\n digit 'X' 'L' 'C' q ++ toRoman r\n | else = digit 'I' 'V' 'X' x\n\nmap (join \"\" << toRoman) [1999,25,944]\n","language":"Ela"},{"code":"import system'collections;\nimport system'routines;\nimport extensions;\nimport extensions'text;\n\nstatic RomanDictionary = Dictionary.new()\n .setAt(1000, \"M\")\n .setAt(900, \"CM\")\n .setAt(500, \"D\")\n .setAt(400, \"CD\")\n .setAt(100, \"C\")\n .setAt(90, \"XC\")\n .setAt(50, \"L\")\n .setAt(40, \"XL\")\n .setAt(10, \"X\")\n .setAt(9, \"IX\")\n .setAt(5, \"V\")\n .setAt(4, \"IV\")\n .setAt(1, \"I\");\n\nextension op\n{\n toRoman()\n = RomanDictionary.accumulate(new StringWriter(\"I\", self), (m,kv => m.replace(new StringWriter(\"I\",kv.Key).Value, kv.Value)));\n}\n\npublic program()\n{\n console.printLine(\"1990 : \", 1990.toRoman());\n console.printLine(\"2008 : \", 2008.toRoman());\n console.printLine(\"1666 : \", 1666.toRoman())\n}\n","language":"Elena"},{"code":"defmodule Roman_numeral do\n def encode(0), do: ''\n def encode(x) when x >= 1000, do: [?M | encode(x - 1000)]\n def encode(x) when x >= 100, do: digit(div(x,100), ?C, ?D, ?M) ++ encode(rem(x,100))\n def encode(x) when x >= 10, do: digit(div(x,10), ?X, ?L, ?C) ++ encode(rem(x,10))\n def encode(x) when x >= 1, do: digit(x, ?I, ?V, ?X)\n\n defp digit(1, x, _, _), do: [x]\n defp digit(2, x, _, _), do: [x, x]\n defp digit(3, x, _, _), do: [x, x, x]\n defp digit(4, x, y, _), do: [x, y]\n defp digit(5, _, y, _), do: [y]\n defp digit(6, x, y, _), do: [y, x]\n defp digit(7, x, y, _), do: [y, x, x]\n defp digit(8, x, y, _), do: [y, x, x, x]\n defp digit(9, x, _, z), do: [x, z]\nend\n","language":"Elixir"},{"code":"defmodule Roman_numeral do\n @symbols [ {1000, 'M'}, {900, 'CM'}, {500, 'D'}, {400, 'CD'}, {100, 'C'}, {90, 'XC'},\n {50, 'L'}, {40, 'XL'}, {10, 'X'}, {9, 'IX'}, {5, 'V'}, {4, 'IV'}, {1, 'I'} ]\n def encode(num) do\n {roman,_} = Enum.reduce(@symbols, {[], num}, fn {divisor, letter}, {memo, n} ->\n {memo ++ List.duplicate(letter, div(n, divisor)), rem(n, divisor)}\n end)\n Enum.join(roman)\n end\nend\n","language":"Elixir"},{"code":"Enum.each([1990, 2008, 1666], fn n ->\n IO.puts \"#{n}: #{Roman_numeral.encode(n)}\"\nend)\n","language":"Elixir"},{"code":"(defun ar2ro (AN)\n \"Translate from arabic number AN to roman number.\n For example, (ar2ro 1666) returns (M D C L X V I).\"\n (cond\n ((>= AN 1000) (cons 'M (ar2ro (- AN 1000))))\n ((>= AN 900) (cons 'C (cons 'M (ar2ro (- AN 900)))))\n ((>= AN 500) (cons 'D (ar2ro (- AN 500))))\n ((>= AN 400) (cons 'C (cons 'D (ar2ro (- AN 400)))))\n ((>= AN 100) (cons 'C (ar2ro (- AN 100))))\n ((>= AN 90) (cons 'X (cons 'C (ar2ro (- AN 90)))))\n ((>= AN 50) (cons 'L (ar2ro (- AN 50))))\n ((>= AN 40) (cons 'X (cons 'L (ar2ro (- AN 40)))))\n ((>= AN 10) (cons 'X (ar2ro (- AN 10))))\n ((>= AN 5) (cons 'V (ar2ro (- AN 5))))\n ((>= AN 4) (cons 'I (cons 'V (ar2ro (- AN 4)))))\n ((>= AN 1) (cons 'I (ar2ro (- AN 1))))\n ((= AN 0) nil)))\n","language":"Emacs-Lisp"},{"code":"-module(roman).\n-export([to_roman/1]).\n\nto_roman(0) -> [];\nto_roman(X) when X >= 1000 -> [$M | to_roman(X - 1000)];\nto_roman(X) when X >= 100 ->\n digit(X div 100, $C, $D, $M) ++ to_roman(X rem 100);\nto_roman(X) when X >= 10 ->\n digit(X div 10, $X, $L, $C) ++ to_roman(X rem 10);\nto_roman(X) when X >= 1 -> digit(X, $I, $V, $X).\n\ndigit(1, X, _, _) -> [X];\ndigit(2, X, _, _) -> [X, X];\ndigit(3, X, _, _) -> [X, X, X];\ndigit(4, X, Y, _) -> [X, Y];\ndigit(5, _, Y, _) -> [Y];\ndigit(6, X, Y, _) -> [Y, X];\ndigit(7, X, Y, _) -> [Y, X, X];\ndigit(8, X, Y, _) -> [Y, X, X, X];\ndigit(9, X, _, Z) -> [X, Z].\n","language":"Erlang"},{"code":"-module( roman_numerals ).\n\n-export( [encode_from_integer/1]).\n\n-record( encode_acc, {n, romans=\"\"} ).\n\nencode_from_integer( N ) when N > 0 ->\n #encode_acc{romans=Romans} = lists:foldl( fun encode_from_integer/2, #encode_acc{n=N}, map() ),\n Romans.\n\n\nencode_from_integer( _Map, #encode_acc{n=0}=Acc ) -> Acc;\nencode_from_integer( {_Roman, Value}, #encode_acc{n=N}=Acc ) when N < Value -> Acc;\nencode_from_integer( {Roman, Value}, #encode_acc{n=N, romans=Romans} ) ->\n Times = N div Value,\n New_roman = lists:flatten( lists:duplicate(Times, Roman) ),\n #encode_acc{n=N - (Times * Value), romans=Romans ++ New_roman}.\n\nmap() -> [{\"M\",1000}, {\"CM\",900}, {\"D\",500}, {\"CD\",400}, {\"C\",100}, {\"XC\",90}, {\"L\",50}, {\"XL\",40}, {\"X\",10}, {\"IX\",9}, {\"V\",5}, {\"IV\",4}, {\"I\\\n\",1}].\n","language":"Erlang"},{"code":"PROGRAM ARAB2ROMAN\n\nDIM ARABIC%[12],ROMAN$[12]\n\nPROCEDURE TOROMAN(VALUE->ANS$)\nLOCAL RESULT$\n FOR I%=0 TO 12 DO\n WHILE VALUE>=ARABIC%[I%] DO\n RESULT$+=ROMAN$[I%]\n VALUE-=ARABIC%[I%]\n END WHILE\n END FOR\n ANS$=RESULT$\nEND PROCEDURE\n\nBEGIN\n!\n!Testing\n!\n ARABIC%[]=(1000,900,500,400,100,90,50,40,10,9,5,4,1)\n ROMAN$[]=(\"M\",\"CM\",\"D\",\"CD\",\"C\",\"XC\",\"L\",\"XL\",\"X\",\"IX\",\"V\",\"IV\",\"I\")\n TOROMAN(2009->ANS$) PRINT(\"2009 = \";ANS$)\n TOROMAN(1666->ANS$) PRINT(\"1666 = \";ANS$)\n TOROMAN(3888->ANS$) PRINT(\"3888 = \";ANS$)\nEND PROGRAM\n","language":"ERRE"},{"code":"constant arabic = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 }\nconstant roman = {\"M\", \"CM\", \"D\",\"CD\", \"C\",\"XC\",\"L\",\"XL\",\"X\",\"IX\",\"V\",\"IV\",\"I\"}\n\nfunction toRoman(integer val)\n sequence result\n result = \"\"\n for i = 1 to 13 do\n while val >= arabic[i] do\n result &= roman[i]\n val -= arabic[i]\n end while\n end for\n return result\nend function\n\nprintf(1,\"%d = %s\\n\",{2009,toRoman(2009)})\nprintf(1,\"%d = %s\\n\",{1666,toRoman(1666)})\nprintf(1,\"%d = %s\\n\",{3888,toRoman(3888)})\n","language":"Euphoria"},{"code":"=ROMAN(2013,0)\n","language":"Excel"},{"code":"MMXIII\n","language":"Excel"},{"code":"let digit x y z = function\n 1 -> x\n | 2 -> x + x\n | 3 -> x + x + x\n | 4 -> x + y\n | 5 -> y\n | 6 -> y + x\n | 7 -> y + x + x\n | 8 -> y + x + x + x\n | 9 -> x + z\n | _ -> failwith \"invalid call to digit\"\n\nlet rec to_roman acc = function\n | x when x >= 1000 -> to_roman (acc + \"M\") (x - 1000)\n | x when x >= 100 -> to_roman (acc + digit \"C\" \"D\" \"M\" (x / 100)) (x % 100)\n | x when x >= 10 -> to_roman (acc + digit \"X\" \"L\" \"C\" (x / 10)) (x % 10)\n | x when x > 0 -> acc + digit \"I\" \"V\" \"X\" x\n | 0 -> acc\n | _ -> failwith \"invalid call to_roman (negative input)\"\n\nlet roman n = to_roman \"\" n\n\n[<EntryPoint>]\nlet main args =\n [1990; 2008; 1666]\n |> List.map (fun n -> roman n)\n |> List.iter (printfn \"%s\")\n 0\n","language":"F-Sharp"},{"code":"USE: roman\n( scratchpad ) 3333 >roman .\n\"mmmcccxxxiii\"\n","language":"Factor"},{"code":"CONSTANT: roman-digits\n { \"m\" \"cm\" \"d\" \"cd\" \"c\" \"xc\" \"l\" \"xl\" \"x\" \"ix\" \"v\" \"iv\" \"i\" }\n\nCONSTANT: roman-values\n { 1000 900 500 400 100 90 50 40 10 9 5 4 1 }\n\nERROR: roman-range-error n ;\n\n: roman-range-check ( n -- n )\n dup 1 10000 between? [ roman-range-error ] unless ;\n\n: >roman ( n -- str )\n roman-range-check\n roman-values roman-digits [\n [ /mod swap ] dip <repetition> concat\n ] 2map \"\" concat-as nip ;\n","language":"Factor"},{"code":"^$.\" \"\n[$999>][1000- \"M\"]#\n $899> [ 900-\"CM\"]?\n $499> [ 500- \"D\"]?\n $399> [ 400-\"CD\"]?\n[$ 99>][ 100- \"C\"]#\n $ 89> [ 90-\"XC\"]?\n $ 49> [ 50- \"L\"]?\n $ 39> [ 40-\"XL\"]?\n[$ 9>][ 10- \"X\"]#\n $ 8> [ 9-\"IX\"]?\n $ 4> [ 5- \"V\"]?\n $ 3> [ 4-\"IV\"]?\n[$ ][ 1- \"I\"]#%\n","language":"FALSE"},{"code":"**\n** converts a number to its roman numeral representation\n**\nclass RomanNumerals\n{\n\n private Str digit(Str x, Str y, Str z, Int i)\n {\n switch (i)\n {\n case 1: return x\n case 2: return x+x\n case 3: return x+x+x\n case 4: return x+y\n case 5: return y\n case 6: return y+x\n case 7: return y+x+x\n case 8: return y+x+x+x\n case 9: return x+z\n }\n return \"\"\n }\n\n Str toRoman(Int i)\n {\n if (i>=1000) { return \"M\" + toRoman(i-1000) }\n if (i>=100) { return digit(\"C\", \"D\", \"M\", i/100) + toRoman(i%100) }\n if (i>=10) { return digit(\"X\", \"L\", \"C\", i/10) + toRoman(i%10) }\n if (i>=1) { return digit(\"I\", \"V\", \"X\", i) }\n return \"\"\n }\n\n Void main()\n {\n 2000.times |i| { echo(\"$i = ${toRoman(i)}\") }\n }\n\n}\n","language":"Fan"},{"code":": vector create ( n -- ) 0 do , loop does> ( n -- ) swap cells + @ execute ;\n\\ these are ( numerals -- numerals )\n: ,I dup c@ C, ; : ,V dup 1 + c@ C, ; : ,X dup 2 + c@ C, ;\n\n\\ these are ( numerals -- )\n:noname ,I ,X drop ; :noname ,V ,I ,I ,I drop ; :noname ,V ,I ,I drop ;\n:noname ,V ,I drop ; :noname ,V drop ; :noname ,I ,V drop ;\n:noname ,I ,I ,I drop ; :noname ,I ,I drop ; :noname ,I drop ;\n' drop ( 0 : no output ) 10 vector ,digit\n\t\n: roman-rec ( numerals n -- ) 10 /mod dup if >r over 2 + r> recurse else drop then ,digit ;\n: roman ( n -- c-addr u )\n dup 0 4000 within 0= abort\" EX LIMITO!\"\n HERE SWAP s\" IVXLCDM\" drop swap roman-rec HERE OVER - ;\n\n1999 roman type \\ MCMXCIX\n 25 roman type \\ XXV\n 944 roman type \\ CMXLIV\n","language":"Forth"},{"code":"create romans 0 , 1 , 5 , 21 , 9 , 2 , 6 , 22 , 86 , 13 ,\n does> swap cells + @ ;\n\n: roman-digit ( a1 n1 a2 n2 -- a3)\n drop >r romans\n begin dup while tuck 4 mod 1- chars r@ + c@ over c! char+ swap 4 / repeat\n r> drop drop\n;\n\n: (split) swap >r /mod r> swap ;\n\n: >roman ( n1 a -- a n2)\n tuck 1000 (split) s\" M \" roman-digit 100 (split) s\" CDM\" roman-digit\n 10 (split) s\" XLC\" roman-digit 1 (split) s\" IVX\" roman-digit nip over -\n;\n\ncreate (roman) 16 chars allot\n\n1999 (roman) >roman type cr\n","language":"Forth"},{"code":"program roman_numerals\n\n implicit none\n\n write (*, '(a)') roman (2009)\n write (*, '(a)') roman (1666)\n write (*, '(a)') roman (3888)\n\ncontains\n\nfunction roman (n) result (r)\n\n implicit none\n integer, intent (in) :: n\n integer, parameter :: d_max = 13\n integer :: d\n integer :: m\n integer :: m_div\n character (32) :: r\n integer, dimension (d_max), parameter :: d_dec = &\n & (/1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1/)\n character (32), dimension (d_max), parameter :: d_rom = &\n & (/'M ', 'CM', 'D ', 'CD', 'C ', 'XC', 'L ', 'XL', 'X ', 'IX', 'V ', 'IV', 'I '/)\n\n r = ''\n m = n\n do d = 1, d_max\n m_div = m / d_dec (d)\n r = trim (r) // repeat (trim (d_rom (d)), m_div)\n m = m - d_dec (d) * m_div\n end do\n\nend function roman\n\nend program roman_numerals\n","language":"Fortran"},{"code":"DIM SHARED arabic(0 TO 12) AS Integer => {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 }\nDIM SHARED roman(0 TO 12) AS String*2 => {\"M\", \"CM\", \"D\",\"CD\", \"C\",\"XC\",\"L\",\"XL\",\"X\",\"IX\",\"V\",\"IV\",\"I\"}\n\nFUNCTION toRoman(value AS Integer) AS String\n DIM i \tAS Integer\n DIM result AS String\n\n FOR i = 0 TO 12\n DO WHILE value >= arabic(i)\n\t result = result + roman(i)\n\t value = value - arabic(i)\n\tLOOP\n NEXT i\n toRoman = result\nEND FUNCTION\n\n'Testing\nPRINT \"2009 = \"; toRoman(2009)\nPRINT \"1666 = \"; toRoman(1666)\nPRINT \"3888 = \"; toRoman(3888)\n","language":"FreeBASIC"},{"code":"' FB 1.05.0 Win64\n\nFunction romanEncode(n As Integer) As String\n If n < 1 OrElse n > 3999 Then Return \"\" '' can only encode numbers in range 1 to 3999\n Dim roman1(0 To 2) As String = {\"MMM\", \"MM\", \"M\"}\n Dim roman2(0 To 8) As String = {\"CM\", \"DCCC\", \"DCC\", \"DC\", \"D\", \"CD\", \"CCC\", \"CC\", \"C\"}\n Dim roman3(0 To 8) As String = {\"XC\", \"LXXX\", \"LXX\", \"LX\", \"L\", \"XL\", \"XXX\", \"XX\", \"X\"}\n Dim roman4(0 To 8) As String = {\"IX\", \"VIII\", \"VII\", \"VI\", \"V\", \"IV\", \"III\", \"II\", \"I\"}\n Dim As Integer thousands, hundreds, tens, units\n thousands = n \\ 1000\n n Mod= 1000\n hundreds = n \\ 100\n n Mod= 100\n tens = n \\ 10\n units = n Mod 10\n Dim roman As String = \"\"\n If thousands > 0 Then roman += roman1(3 - thousands)\n If hundreds > 0 Then roman += roman2(9 - hundreds)\n If tens > 0 Then roman += roman3(9 - tens)\n If units > 0 Then roman += roman4(9 - units)\n Return roman\nEnd Function\n\nDim a(2) As Integer = {1990, 2008, 1666}\nFor i As Integer = 0 To 2\n Print a(i); \" => \"; romanEncode(a(i))\nNext\n\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"window 1\n\nlocal fn DecimaltoRoman( decimal as short ) as Str15\n short arabic(12)\n Str15 roman(12)\n long i\n Str15 result : result = \"\"\n\n arabic(0) = 1000 : arabic(1) = 900 : arabic(2) = 500 : arabic(3) = 400\n arabic(4) = 100 : arabic(5) = 90 : arabic(6) = 50 : arabic(7) = 40\n arabic(8) = 10 : arabic(9) = 9 : arabic(10) = 5 : arabic(11) = 4: arabic(12) = 1\n\n roman(0) = \"M\" : roman(1) = \"CM\" : roman(2) = \"D\" : roman(3) = \"CD\"\n roman(4) = \"C\" : roman(5) = \"XC\" : roman(6) = \"L\" : roman(7) = \"XL\"\n roman(8) = \"X\" : roman(9) = \"IX\" : roman(10) = \"V\" : roman(11) = \"IV\" : roman(12) = \"I\"\n\n for i = 0 to 12\n while ( decimal >= arabic(i) )\n result = result + roman(i)\n decimal = decimal - arabic(i)\n wend\n next i\n if result == \"\" then result = \"Zepherium\"\nend fn = result\n\nprint \"1990 = \"; fn DecimaltoRoman( 1990 )\nprint \"2008 = \"; fn DecimaltoRoman( 2008 )\nprint \"2016 = \"; fn DecimaltoRoman( 2016 )\nprint \"1666 = \"; fn DecimaltoRoman( 1666 )\nprint \"3888 = \"; fn DecimaltoRoman( 3888 )\nprint \"1914 = \"; fn DecimaltoRoman( 1914 )\nprint \"1000 = \"; fn DecimaltoRoman( 1000 )\nprint \" 513 = \"; fn DecimaltoRoman( 513 )\nprint \" 33 = \"; fn DecimaltoRoman( 33 )\n\nHandleEvents\n","language":"FutureBasic"},{"code":"Public Sub Main()\n\n 'Testing\n Print \"2009 = \"; toRoman(2009)\n Print \"1666 = \"; toRoman(1666)\n Print \"3888 = \"; toRoman(3888)\n\nEnd\n\nFunction toRoman(value As Integer) As String\n\n Dim result As String\n Dim arabic As Integer[] = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\n Dim roman As String[] = [\"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\" , \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\"]\n\n\n For i As Integer = 0 To arabic.Max\n Do While value >= arabic[i]\n result &= roman[i]\n value -= arabic[i]\n Loop\n Next\n Return result\n\nEnd Function\n","language":"Gambas"},{"code":"package main\n\nimport \"fmt\"\n\nvar (\n m0 = []string{\"\", \"I\", \"II\", \"III\", \"IV\", \"V\", \"VI\", \"VII\", \"VIII\", \"IX\"}\n m1 = []string{\"\", \"X\", \"XX\", \"XXX\", \"XL\", \"L\", \"LX\", \"LXX\", \"LXXX\", \"XC\"}\n m2 = []string{\"\", \"C\", \"CC\", \"CCC\", \"CD\", \"D\", \"DC\", \"DCC\", \"DCCC\", \"CM\"}\n m3 = []string{\"\", \"M\", \"MM\", \"MMM\", \"I̅V̅\",\n \"V̅\", \"V̅I̅\", \"V̅I̅I̅\", \"V̅I̅I̅I̅\", \"I̅X̅\"}\n m4 = []string{\"\", \"X̅\", \"X̅X̅\", \"X̅X̅X̅\", \"X̅L̅\",\n \"L̅\", \"L̅X̅\", \"L̅X̅X̅\", \"L̅X̅X̅X̅\", \"X̅C̅\"}\n m5 = []string{\"\", \"C̅\", \"C̅C̅\", \"C̅C̅C̅\", \"C̅D̅\",\n \"D̅\", \"D̅C̅\", \"D̅C̅C̅\", \"D̅C̅C̅C̅\", \"C̅M̅\"}\n m6 = []string{\"\", \"M̅\", \"M̅M̅\", \"M̅M̅M̅\"}\n)\n\nfunc formatRoman(n int) (string, bool) {\n if n < 1 || n >= 4e6 {\n return \"\", false\n }\n // this is efficient in Go. the seven operands are evaluated,\n // then a single allocation is made of the exact size needed for the result.\n return m6[n/1e6] + m5[n%1e6/1e5] + m4[n%1e5/1e4] + m3[n%1e4/1e3] +\n m2[n%1e3/1e2] + m1[n%100/10] + m0[n%10],\n true\n}\n\nfunc main() {\n // show three numbers mentioned in task descriptions\n for _, n := range []int{1990, 2008, 1666} {\n r, ok := formatRoman(n)\n if ok {\n fmt.Println(n, \"==\", r)\n } else {\n fmt.Println(n, \"not representable\")\n }\n }\n}\n","language":"Go"},{"code":"#!/usr/bin/env golosh\n----\nThis module takes a decimal integer and converts it to a Roman numeral.\n----\nmodule Romannumeralsencode\n\naugment java.lang.Integer {\n\n function digits = |this| {\n\n var remaining = this\n let digits = vector[]\n while remaining > 0 {\n digits: prepend(remaining % 10)\n remaining = remaining / 10\n }\n return digits\n }\n\n ----\n 123: digitsWithPowers() will return [[1, 2], [2, 1], [3, 0]]\n ----\n function digitsWithPowers = |this| -> vector[\n [ this: digits(): get(i), (this: digits(): size() - 1) - i ] for (var i = 0, i < this: digits(): size(), i = i + 1)\n ]\n\n function encode = |this| {\n\n require(this > 0, \"the integer must be positive!\")\n\n let romanPattern = |digit, powerOf10| -> match {\n when digit == 1 then i\n when digit == 2 then i + i\n when digit == 3 then i + i + i\n when digit == 4 then i + v\n when digit == 5 then v\n when digit == 6 then v + i\n when digit == 7 then v + i + i\n when digit == 8 then v + i + i + i\n when digit == 9 then i + x\n otherwise \"\"\n } with {\n i, v, x = [\n [ \"I\", \"V\", \"X\" ],\n [ \"X\", \"L\", \"C\" ],\n [ \"C\", \"D\", \"M\" ],\n [ \"M\", \"?\", \"?\" ]\n ]: get(powerOf10)\n }\n\n return vector[ romanPattern(digit, power) foreach digit, power in this: digitsWithPowers() ]: join(\"\")\n }\n}\n\nfunction main = |args| {\n println(\"1990 == MCMXC? \" + (1990: encode() == \"MCMXC\"))\n println(\"2008 == MMVIII? \" + (2008: encode() == \"MMVIII\"))\n println(\"1666 == MDCLXVI? \" + (1666: encode() == \"MDCLXVI\"))\n}\n","language":"Golo"},{"code":"symbols = [ 1:'I', 4:'IV', 5:'V', 9:'IX', 10:'X', 40:'XL', 50:'L', 90:'XC', 100:'C', 400:'CD', 500:'D', 900:'CM', 1000:'M' ]\n\ndef roman(arabic) {\n def result = \"\"\n symbols.keySet().sort().reverse().each {\n while (arabic >= it) {\n arabic-=it\n result+=symbols[it]\n }\n }\n return result\n}\nassert roman(1) == 'I'\nassert roman(2) == 'II'\nassert roman(4) == 'IV'\nassert roman(8) == 'VIII'\nassert roman(16) == 'XVI'\nassert roman(32) == 'XXXII'\nassert roman(25) == 'XXV'\nassert roman(64) == 'LXIV'\nassert roman(128) == 'CXXVIII'\nassert roman(256) == 'CCLVI'\nassert roman(512) == 'DXII'\nassert roman(954) == 'CMLIV'\nassert roman(1024) == 'MXXIV'\nassert roman(1666) == 'MDCLXVI'\nassert roman(1990) == 'MCMXC'\nassert roman(2008) == 'MMVIII'\n","language":"Groovy"},{"code":"10 REM Roman numerals/Encode\n20 DIM WEIGHTS%(12), SYMBOLS$(12)\n30 FOR J% = 0 TO 12: READ WEIGHTS%(J%), SYMBOLS$(J%): NEXT J%\n40 DATA 1000, \"M\", 900, \"CM\", 500, \"D\", 400, \"CD\", 100, \"C\", 90, \"XC\"\n50 DATA 50, \"L\", 40, \"XL\", 10, \"X\", 9, \"IX\", 5, \"V\", 4, \"IV\", 1, \"I\"\n60 REM 3888 or MMMDCCCLXXXVIII (15 chars) is\n70 REM the longest string properly encoded\n80 REM with these symbols.\n90 AVALUE% = 1990: GOSUB 1000: PRINT ROMAN$ ' MCMXC\n100 AVALUE% = 2022: GOSUB 1000: PRINT ROMAN$ ' MMXXII\n110 AVALUE% = 3888: GOSUB 1000: PRINT ROMAN$ ' MMMDCCCLXXXVIII\n120 END\n990 REM Encode to roman\n1000 ROMAN$ = \"\": I% = 0\n1010 WHILE (I% <= 12) AND (AVALUE% > 0)\n1020 WHILE AVALUE% >= WEIGHTS%(I%)\n1030 ROMAN$ = ROMAN$ + SYMBOLS$(I%)\n1040 AVALUE% = AVALUE% - WEIGHTS%(I%)\n1050 WEND\n1060 I% = I% + 1\n1070 WEND\n1080 RETURN\n","language":"GW-BASIC"},{"code":"digit :: Char -> Char -> Char -> Integer -> String\ndigit x y z k =\n [[x], [x, x], [x, x, x], [x, y], [y], [y, x], [y, x, x], [y, x, x, x], [x, z]] !!\n (fromInteger k - 1)\n\ntoRoman :: Integer -> String\ntoRoman 0 = \"\"\ntoRoman x\n | x < 0 = error \"Negative roman numeral\"\ntoRoman x\n | x >= 1000 = 'M' : toRoman (x - 1000)\ntoRoman x\n | x >= 100 = digit 'C' 'D' 'M' q ++ toRoman r\n where\n (q, r) = x `divMod` 100\ntoRoman x\n | x >= 10 = digit 'X' 'L' 'C' q ++ toRoman r\n where\n (q, r) = x `divMod` 10\ntoRoman x = digit 'I' 'V' 'X' x\n\nmain :: IO ()\nmain = print $ toRoman <$> [1999, 25, 944]\n","language":"Haskell"},{"code":"import Data.Bifunctor (first)\nimport Data.List (mapAccumL)\nimport Data.Tuple (swap)\n\nroman :: Int -> String\nroman =\n romanFromInt $\n zip\n [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\n (words \"M CM D CD C XC L XL X IX V IV I\")\n\nromanFromInt :: [(Int, String)] -> Int -> String\nromanFromInt nks n = concat . snd $ mapAccumL go n nks\n where\n go a (v, s) = swap $ first ((>> s) . enumFromTo 1) $ quotRem a v\n\nmain :: IO ()\nmain = (putStrLn . unlines) (roman <$> [1666, 1990, 2008, 2016, 2018])\n","language":"Haskell"},{"code":"module Main where\n\n------------------------\n-- ENCODER FUNCTION --\n------------------------\n\nromanDigits = \"IVXLCDM\"\n\n-- Meaning and indices of the romanDigits sequence:\n--\n-- magnitude | 1 5 | index\n-- -----------|-------|-------\n-- 0 | I V | 0 1\n-- 1 | X L | 2 3\n-- 2 | C D | 4 5\n-- 3 | M | 6\n--\n-- romanPatterns are index offsets into romanDigits,\n-- from an index base of 2 * magnitude.\n\nromanPattern 0 = [] -- empty string\nromanPattern 1 = [0] -- I or X or C or M\nromanPattern 2 = [0,0] -- II or XX...\nromanPattern 3 = [0,0,0] -- III...\nromanPattern 4 = [0,1] -- IV...\nromanPattern 5 = [1] -- ...\nromanPattern 6 = [1,0]\nromanPattern 7 = [1,0,0]\nromanPattern 8 = [1,0,0,0]\nromanPattern 9 = [0,2]\n\nencodeValue 0 _ = \"\"\nencodeValue value magnitude = encodeValue rest (magnitude + 1) ++ digits\n where\n low = rem value 10 -- least significant digit (encoded now)\n rest = div value 10 -- the other digits (to be encoded next)\n indices = map addBase (romanPattern low)\n addBase i = i + (2 * magnitude)\n digits = map pickDigit indices\n pickDigit i = romanDigits!!i\n\nencode value = encodeValue value 0\n\n------------------\n-- TEST SUITE --\n------------------\n\nmain = do\n test \"MCMXC\" 1990\n test \"MMVIII\" 2008\n test \"MDCLXVI\" 1666\n\ntest expected value = putStrLn ((show value) ++ \" = \" ++ roman ++ remark)\n where\n roman = encode value\n remark =\n \" (\" ++\n (if roman == expected then \"PASS\"\n else (\"FAIL, expected \" ++ (show expected))) ++ \")\"\n","language":"Haskell"},{"code":"CHARACTER Roman*20\n\nCALL RomanNumeral(1990, Roman) ! MCMXC\nCALL RomanNumeral(2008, Roman) ! MMVIII\nCALL RomanNumeral(1666, Roman) ! MDCLXVI\n\nEND\n\nSUBROUTINE RomanNumeral( arabic, roman)\n CHARACTER roman\n DIMENSION ddec(13)\n DATA ddec/1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1/\n\n roman = ' '\n todo = arabic\n DO d = 1, 13\n DO rep = 1, todo / ddec(d)\n roman = TRIM(roman) // TRIM(CHAR(d, 13, \"M CM D CD C XC L XL X OX V IV I \"))\n todo = todo - ddec(d)\n ENDDO\n ENDDO\nEND\n","language":"HicEst"},{"code":"|%\n++ parse\n |= t=tape ^- @ud\n =. t (cass t)\n =| result=@ud\n |-\n ?~ t result\n ?~ t.t (add result (from-numeral i.t))\n =+ [a=(from-numeral i.t) b=(from-numeral i.t.t)]\n ?: (gte a b) $(result (add result a), t t.t)\n $(result (sub (add result b) a), t t.t.t)\n++ yield\n |= n=@ud ^- tape\n =| result=tape\n =/ values to-numeral\n |-\n ?~ values result\n ?: (gte n -.i.values)\n $(result (weld result +.i.values), n (sub n -.i.values))\n $(values t.values)\n++ from-numeral\n |= c=@t ^- @ud\n ?: =(c 'i') 1\n ?: =(c 'v') 5\n ?: =(c 'x') 10\n ?: =(c 'l') 50\n ?: =(c 'c') 100\n ?: =(c 'd') 500\n ?: =(c 'm') 1.000\n !!\n++ to-numeral\n ^- (list [@ud tape])\n :*\n [1.000 \"m\"]\n [900 \"cm\"]\n [500 \"d\"]\n [400 \"cd\"]\n [100 \"c\"]\n [90 \"xc\"]\n [50 \"l\"]\n [40 \"xl\"]\n [10 \"x\"]\n [9 \"ix\"]\n [5 \"v\"]\n [4 \"iv\"]\n [1 \"i\"]\n ~\n ==\n--\n","language":"Hoon"},{"code":"/+ *roman\n:- %say\n|= [* [x=$%([%from-roman tape] [%to-roman @ud]) ~] ~]\n:- %noun\n^- tape\n?- -.x\n %from-roman \"{<(parse +.x)>}\"\n %to-roman (yield +.x)\n==\n","language":"Hoon"},{"code":"link numbers # commas, roman\n\nprocedure main(arglist)\nevery x := !arglist do\n write(commas(x), \" -> \",roman(x)|\"*** can't convert to Roman numerals ***\")\nend\n","language":"Icon"},{"code":"procedure roman(n)\t\t#: convert integer to Roman numeral\n local arabic, result\n static equiv\n\n initial equiv := [\"\",\"I\",\"II\",\"III\",\"IV\",\"V\",\"VI\",\"VII\",\"VIII\",\"IX\"]\n\n integer(n) > 0 | fail\n result := \"\"\n every arabic := !n do\n result := map(result,\"IVXLCDM\",\"XLCDM**\") || equiv[arabic + 1]\n if find(\"*\",result) then fail else return result\nend\n","language":"Icon"},{"code":" PLEASE WRITE IN .1\n DO READ OUT .1\n DO GIVE UP\n","language":"Intercal"},{"code":"Roman := Object clone do (\n nums := list(1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1)\n rum := list(\"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\")\n\n numeral := method(number,\n result := \"\"\n for(i, 0, nums size,\n if(number == 0, break)\n while(number >= nums at(i),\n number = number - nums at(i)\n result = result .. rum at(i)\n )\n )\n return result\n )\n)\n\nRoman numeral(1666) println\n","language":"Io"},{"code":"100 PROGRAM \"Roman.bas\"\n110 DO\n120 PRINT :INPUT PROMPT \"Enter an arabic number: \":N\n130 IF N<1 THEN EXIT DO\n140 PRINT TOROMAN$(N)\n150 LOOP\n160 DEF TOROMAN$(X)\n170 IF X>3999 THEN\n180 LET TOROMAN$=\"Too big.\"\n190 EXIT DEF\n200 END IF\n210 RESTORE\n220 LET SUM$=\"\"\n230 FOR I=1 TO 13\n240 READ ARABIC,ROMAN$\n250 DO WHILE X>=ARABIC\n260 LET SUM$=SUM$&ROMAN$\n270 LET X=X-ARABIC\n280 LOOP\n290 NEXT\n300 LET TOROMAN$=SUM$\n310 END DEF\n320 DATA 1000,\"M\",900,\"CM\",500,\"D\",400,\"CD\",100,\"C\",90,\"XC\"\n330 DATA 50,\"L\",40,\"XL\",10,\"X\",9,\"IX\",5,\"V\",4,\"IV\",1,\"I\"\n","language":"IS-BASIC"},{"code":"R1000=. ;L:1 ,{ <@(<;._1);._2]0 :0\n C CC CCC CD D DC DCC DCCC CM\n X XX XXX XL L LX LXX LXXX XC\n I II III IV V VI VII VIII IX\n)\n\nrfd=: ('M' $~ <.@%&1000) , R1000 {::~ 1000&|\n","language":"J"},{"code":" rfd 1234\nMCCXXXIV\n rfd 567\nDLXVII\n rfd 89\nLXXXIX\n","language":"J"},{"code":"public class RN {\n\n enum Numeral {\n I(1), IV(4), V(5), IX(9), X(10), XL(40), L(50), XC(90), C(100), CD(400), D(500), CM(900), M(1000);\n int weight;\n\n Numeral(int weight) {\n this.weight = weight;\n }\n };\n\n public static String roman(long n) {\n\n if( n <= 0) {\n throw new IllegalArgumentException();\n }\n\n StringBuilder buf = new StringBuilder();\n\n final Numeral[] values = Numeral.values();\n for (int i = values.length - 1; i >= 0; i--) {\n while (n >= values[i].weight) {\n buf.append(values[i]);\n n -= values[i].weight;\n }\n }\n return buf.toString();\n }\n\n public static void test(long n) {\n System.out.println(n + \" = \" + roman(n));\n }\n\n public static void main(String[] args) {\n test(1999);\n test(25);\n test(944);\n test(0);\n }\n\n}\n","language":"Java"},{"code":"import java.util.Set;\nimport java.util.EnumSet;\nimport java.util.Collections;\nimport java.util.stream.Collectors;\nimport java.util.stream.LongStream;\n\npublic interface RomanNumerals {\n public enum Numeral {\n M(1000), CM(900), D(500), CD(400), C(100), XC(90), L(50), XL(40), X(10), IX(9), V(5), IV(4), I(1);\n\n public final long weight;\n\n private static final Set<Numeral> SET = Collections.unmodifiableSet(EnumSet.allOf(Numeral.class));\n\n private Numeral(long weight) {\n this.weight = weight;\n }\n\n public static Numeral getLargest(long weight) {\n return SET.stream()\n .filter(numeral -> weight >= numeral.weight)\n .findFirst()\n .orElse(I)\n ;\n }\n };\n\n public static String encode(long n) {\n return LongStream.iterate(n, l -> l - Numeral.getLargest(l).weight)\n .limit(Numeral.values().length)\n .filter(l -> l > 0)\n .mapToObj(Numeral::getLargest)\n .map(String::valueOf)\n .collect(Collectors.joining())\n ;\n }\n\n public static long decode(String roman) {\n long result = new StringBuilder(roman.toUpperCase()).reverse().chars()\n .mapToObj(c -> Character.toString((char) c))\n .map(numeral -> Enum.valueOf(Numeral.class, numeral))\n .mapToLong(numeral -> numeral.weight)\n .reduce(0, (a, b) -> a + (a <= b ? b : -b))\n ;\n if (roman.charAt(0) == roman.charAt(1)) {\n result += 2 * Enum.valueOf(Numeral.class, roman.substring(0, 1)).weight;\n }\n return result;\n }\n\n public static void test(long n) {\n System.out.println(n + \" = \" + encode(n));\n System.out.println(encode(n) + \" = \" + decode(encode(n)));\n }\n\n public static void main(String[] args) {\n LongStream.of(1999, 25, 944).forEach(RomanNumerals::test);\n }\n}\n","language":"Java"},{"code":"var roman = {\n map: [\n 1000, 'M', 900, 'CM', 500, 'D', 400, 'CD', 100, 'C', 90, 'XC',\n 50, 'L', 40, 'XL', 10, 'X', 9, 'IX', 5, 'V', 4, 'IV', 1, 'I',\n ],\n int_to_roman: function(n) {\n var value = '';\n for (var idx = 0; n > 0 && idx < this.map.length; idx += 2) {\n while (n >= this.map[idx]) {\n value += this.map[idx + 1];\n n -= this.map[idx];\n }\n }\n return value;\n }\n}\n\nroman.int_to_roman(1999); // \"MCMXCIX\"\n","language":"JavaScript"},{"code":"(function () {\n 'use strict';\n\n\n // If the Roman is a string, pass any delimiters through\n\n // (Int | String) -> String\n function romanTranscription(a) {\n if (typeof a === 'string') {\n var ps = a.split(/\\d+/),\n dlm = ps.length > 1 ? ps[1] : undefined;\n\n return (dlm ? a.split(dlm)\n .map(function (x) {\n return Number(x);\n }) : [a])\n .map(roman)\n .join(dlm);\n } else return roman(a);\n }\n\n // roman :: Int -> String\n function roman(n) {\n return [[1000, \"M\"], [900, \"CM\"], [500, \"D\"], [400, \"CD\"], [100,\n \"C\"], [90, \"XC\"], [50, \"L\"], [40, \"XL\"], [10, \"X\"], [9,\n \"IX\"], [5, \"V\"], [4, \"IV\"], [1, \"I\"]]\n .reduce(function (a, lstPair) {\n var m = a.remainder,\n v = lstPair[0];\n\n return (v > m ? a : {\n remainder: m % v,\n roman: a.roman + Array(\n Math.floor(m / v) + 1\n )\n .join(lstPair[1])\n });\n }, {\n remainder: n,\n roman: ''\n }).roman;\n }\n\n // TEST\n\n return [2016, 1990, 2008, \"14.09.2015\", 2000, 1666].map(\n romanTranscription);\n\n})();\n","language":"JavaScript"},{"code":"[\"MMXVI\", \"MCMXC\", \"MMVIII\", \"XIV.IX.MMXV\", \"MM\", \"MDCLXVI\"]\n","language":"JavaScript"},{"code":"(() => {\n \"use strict\";\n\n // -------------- ROMAN INTEGER STRINGS --------------\n\n // roman :: Int -> String\n const roman = n =>\n mapAccumL(residue =>\n ([k, v]) => second(\n q => 0 < q ? (\n k.repeat(q)\n ) : \"\"\n )(remQuot(residue)(v))\n )(n)(\n zip([\n \"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\",\n \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\"\n ])([\n 1000, 900, 500, 400, 100, 90,\n 50, 40, 10, 9, 5, 4, 1\n ])\n )[1]\n .join(\"\");\n\n\n // ---------------------- TEST -----------------------\n // main :: IO ()\n const main = () => (\n [2016, 1990, 2008, 2000, 2020, 1666].map(roman)\n ).join(\"\\n\");\n\n\n // ---------------- GENERIC FUNCTIONS ----------------\n\n // mapAccumL :: (acc -> x -> (acc, y)) -> acc ->\n // [x] -> (acc, [y])\n const mapAccumL = f =>\n // A tuple of an accumulation and a list\n // obtained by a combined map and fold,\n // with accumulation from left to right.\n acc => xs => [...xs].reduce(\n (a, x) => {\n const tpl = f(a[0])(x);\n\n return [\n tpl[0],\n a[1].concat(tpl[1])\n ];\n },\n [acc, []]\n );\n\n\n // remQuot :: Int -> Int -> (Int, Int)\n const remQuot = m =>\n n => [m % n, Math.trunc(m / n)];\n\n\n // second :: (a -> b) -> ((c, a) -> (c, b))\n const second = f =>\n // A function over a simple value lifted\n // to a function over a tuple.\n // f (a, b) -> (a, f(b))\n xy => [xy[0], f(xy[1])];\n\n\n // zip :: [a] -> [b] -> [(a, b)]\n const zip = xs =>\n // The paired members of xs and ys, up to\n // the length of the shorter of the two lists.\n ys => Array.from({\n length: Math.min(xs.length, ys.length)\n }, (_, i) => [xs[i], ys[i]]);\n\n\n // MAIN --\n return main();\n})();\n","language":"JavaScript"},{"code":"function toRoman(num) {\n return 'I'\n .repeat(num)\n .replace(/IIIII/g, 'V')\n .replace(/VV/g, 'X')\n .replace(/XXXXX/g, 'L')\n .replace(/LL/g, 'C')\n .replace(/CCCCC/g, 'D')\n .replace(/DD/g, 'M')\n .replace(/VIIII/g, 'IX')\n .replace(/LXXXX/g, 'XC')\n .replace(/XXXX/g, 'XL')\n .replace(/DCCCC/g, 'CM')\n .replace(/CCCC/g, 'CD')\n .replace(/IIII/g, 'IV');\n}\n\nconsole.log(toRoman(1666));\n","language":"JavaScript"},{"code":"MDCLXVI\n","language":"JavaScript"},{"code":"def to_roman_numeral:\n def romans:\n [100000, \"\\u2188\"],\n [90000, \"ↂ\\u2188\"],\n [50000, \"\\u2187\"],\n [40000, \"ↂ\\u2187\"],\n [10000, \"ↂ\"],\n [9000, \"Mↂ\"],\n [5000, \"ↁ\"],\n [4000, \"Mↁ\"],\n [1000, \"M\"],\n [900, \"CM\"],\n [500, \"D\"],\n [400, \"CD\"],\n [100, \"C\"],\n [90, \"XC\"],\n [50, \"L\"],\n [40, \"XL\"],\n [10, \"X\"],\n [9, \"IX\"],\n [5, \"V\"],\n [4, \"IV\"],\n [1, \"I\"] ;\n\n if . < 1 or . > 399999\n then \"to_roman_numeral: \\(.) is out of range\" | error\n else reduce romans as [$i, $r] ({n: .};\n until (.n < $i;\n .res += $r\n | .n = .n - $i ) )\n | .res\n end ;\n","language":"Jq"},{"code":"def testcases: [1668, 1990, 2008, 2020, 4444, 5000, 8999, 39999, 89999, 399999];\n\n\"Decimal => Roman:\",\n (testcases[]\n | \" \\(.) => \\(to_roman_numeral)\" )\n","language":"Jq"},{"code":"def digits: tostring | explode | map( [.]|implode|tonumber);\n# Non-negative integer to Roman numeral up to 399,999\ndef to_roman_numeral:\n if . < 1 or . > 399999\n then \"to_roman_numeral: \\(.) is out of range\" | error\n else [[\"I\", \"X\", \"C\", \"M\", \"ↂ\", \"\\u2188\"], [\"V\", \"L\", \"D\", \"ↁ\", \"\\u2187\"]] as $DR\n | (digits|reverse) as $digits\n | reduce range(0;$digits|length) as $omag ({rnum: \"\"};\n $digits[$omag] as $d\n | if $d == 0 then .omr = \"\"\n elif $d < 4 then .omr = $DR[0][$omag] * $d\n elif $d == 4 then .omr = $DR[0][$omag] + $DR[1][$omag]\n elif $d == 5 then .omr = $DR[1][$omag]\n elif $d < 9 then .omr = $DR[1][$omag] + ($DR[0][$omag] * ($d - 5))\n else .omr = $DR[0][$omag] + $DR[0][$omag+1]\n end\n | .rnum = .omr + .rnum )\n | .rnum\n end;\n","language":"Jq"},{"code":"/* Roman numerals, in Jsish */\nvar Roman = {\n ord: ['M', 'CM', 'D', 'CD', 'C', 'XC', 'L', 'XL', 'X', 'IX', 'V', 'IV', 'I'],\n val: [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1],\n\n fromRoman: function(roman:string):number {\n var n = 0;\n var re = /IV|IX|I|V|XC|XL|X|L|CD|CM|C|D|M/g;\n var matches = roman.match(re);\n if (!matches) return NaN;\n for (var hit of matches) n += this.val[this.ord.indexOf(hit)];\n return n;\n },\n\n toRoman: function(n:number):string {\n var roman = '';\n var idx = 0;\n while (n > 0) {\n while (n >= this.val[idx]) {\n roman += this.ord[idx];\n n -= this.val[idx];\n }\n idx++;\n }\n return roman;\n }\n};\n\nprovide('Roman', 1);\n\nif (Interp.conf('unitTest')) {\n; Roman.fromRoman('VIII');\n; Roman.fromRoman('MMMDIV');\n; Roman.fromRoman('CDIV');\n; Roman.fromRoman('MDCLXVI');\n; Roman.fromRoman('not');\n\n; Roman.toRoman(8);\n; Roman.toRoman(3504);\n; Roman.toRoman(404);\n; Roman.toRoman(1666);\n}\n\n/*\n=!EXPECTSTART!=\nRoman.fromRoman('VIII') ==> 8\nRoman.fromRoman('MMMDIV') ==> 3504\nRoman.fromRoman('CDIV') ==> 404\nRoman.fromRoman('MDCLXVI') ==> 1666\nRoman.fromRoman('not') ==> NaN\nRoman.toRoman(8) ==> VIII\nRoman.toRoman(3504) ==> MMMDIV\nRoman.toRoman(404) ==> CDIV\nRoman.toRoman(1666) ==> MDCLXVI\n=!EXPECTEND!=\n*/\n","language":"Jsish"},{"code":"using Printf\n\nfunction romanencode(n::Integer)\n if n < 1 || n > 4999 throw(DomainError()) end\n\n DR = [[\"I\", \"X\", \"C\", \"M\"] [\"V\", \"L\", \"D\", \"MMM\"]]\n rnum = \"\"\n for (omag, d) in enumerate(digits(n))\n if d == 0\n omr = \"\"\n elseif d < 4\n omr = DR[omag, 1] ^ d\n elseif d == 4\n omr = DR[omag, 1] * DR[omag, 2]\n elseif d == 5\n omr = DR[omag, 2]\n elseif d < 9\n omr = DR[omag, 2] * DR[omag, 1] ^ (d - 5)\n else\n omr = DR[omag, 1] * DR[omag + 1, 1]\n end\n rnum = omr * rnum\n end\n return rnum\nend\n\ntestcases = [1990, 2008, 1668]\nappend!(testcases, rand(1:4999, 12))\ntestcases = unique(testcases)\n\nprintln(\"Test romanencode, arabic => roman:\")\nfor n in testcases\n @printf(\"%-4i => %s\\n\", n, romanencode(n))\nend\n","language":"Julia"},{"code":"val romanNumerals = mapOf(\n 1000 to \"M\",\n 900 to \"CM\",\n 500 to \"D\",\n 400 to \"CD\",\n 100 to \"C\",\n 90 to \"XC\",\n 50 to \"L\",\n 40 to \"XL\",\n 10 to \"X\",\n 9 to \"IX\",\n 5 to \"V\",\n 4 to \"IV\",\n 1 to \"I\"\n)\n\nfun encode(number: Int): String? {\n if (number > 5000 || number < 1) {\n return null\n }\n var num = number\n var result = \"\"\n for ((multiple, numeral) in romanNumerals.entries) {\n while (num >= multiple) {\n num -= multiple\n result += numeral\n }\n }\n return result\n}\n\nfun main(args: Array<String>) {\n println(encode(1990))\n println(encode(1666))\n println(encode(2008))\n}\n","language":"Kotlin"},{"code":"fun Int.toRomanNumeral(): String {\n fun digit(k: Int, unit: String, five: String, ten: String): String {\n return when (k) {\n in 1..3 -> unit.repeat(k)\n 4 -> unit + five\n in 5..8 -> five + unit.repeat(k - 5)\n 9 -> unit + ten\n else -> throw IllegalArgumentException(\"$k not in range 1..9\")\n }\n }\n return when (this) {\n 0 -> \"\"\n in 1..9 -> digit(this, \"I\", \"V\", \"X\")\n in 10..99 -> digit(this / 10, \"X\", \"L\", \"C\") + (this % 10).toRomanNumeral()\n in 100..999 -> digit(this / 100, \"C\", \"D\", \"M\") + (this % 100).toRomanNumeral()\n in 1000..3999 -> \"M\" + (this - 1000).toRomanNumeral()\n else -> throw IllegalArgumentException(\"${this} not in range 0..3999\")\n }\n}\n","language":"Kotlin"},{"code":"define br => '\\r'\n// encode roman\ndefine encodeRoman(num::integer)::string => {\n\tlocal(ref = array('M'=1000, 'CM'=900, 'D'=500, 'CD'=400, 'C'=100, 'XC'=90, 'L'=50, 'XL'=40, 'X'=10, 'IX'=9, 'V'=5, 'IV'=4, 'I'=1))\n\tlocal(out = string)\n\twith i in #ref do => {\n\t\twhile(#num >= #i->second) => {\n\t\t\t#out->append(#i->first)\n\t\t\t#num -= #i->second\n\t\t}\n\t}\n\treturn #out\n}\n\n'1990 in roman is '+encodeRoman(1990)\nbr\n'2008 in roman is '+encodeRoman(2008)\nbr\n'1666 in roman is '+encodeRoman(1666)\n","language":"Lasso"},{"code":"\\documentclass{minimal}\n\\newcounter{currentyear}\n\\setcounter{currentyear}{\\year}\n\\begin{document}\nAnno Domini \\Roman{currentyear}\n\\end{document}\n","language":"LaTeX"},{"code":" dim arabic( 12)\n for i =0 to 12\n read k\n arabic( i) =k\n next i\n data 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1\n\n dim roman$( 12)\n for i =0 to 12\n read k$\n roman$( i) =k$\n next i\n data \"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\"\n\n print 2009, toRoman$( 2009)\n print 1666, toRoman$( 1666)\n print 3888, toRoman$( 3888)\n\n end\n\nfunction toRoman$( value)\n i =0\n result$ =\"\"\n for i = 0 to 12\n while value >=arabic( i)\n result$ = result$ + roman$( i)\n value = value - arabic( i)\n wend\n next i\n toRoman$ =result$\nend function\n","language":"Liberty-BASIC"},{"code":"function toRoman intNum\n local roman,numArabic\n put \"M,CM,D,CD,C,XC,L,XL,X,IX,V,IV,I\" into romans\n put \"1000,900,500,400,100,90,50,40,10,9,5,4,1\" into arabics\n put intNum into numArabic\n repeat with n = 1 to the number of items of romans\n put numArabic div item n of arabics into nums\n if nums > 0 then\n put repeatChar(item n of romans,nums) after roman\n add -(nums * item n of arabics) to numArabic\n end if\n end repeat\nreturn roman\nend toRoman\n\nfunction repeatChar c n\n local cc\n repeat n times\n put c after cc\n end repeat\n return cc\nend repeatChar\n","language":"LiveCode"},{"code":"make \"roman.rules [\n [1000 M] [900 CM] [500 D] [400 CD]\n [ 100 C] [ 90 XC] [ 50 L] [ 40 XL]\n [ 10 X] [ 9 IX] [ 5 V] [ 4 IV]\n [ 1 I]\n]\n\nto roman :n [:rules :roman.rules] [:acc \"||]\n if empty? :rules [output :acc]\n if :n < first first :rules [output (roman :n bf :rules :acc)]\n output (roman :n - first first :rules :rules word :acc last first :rules)\nend\n","language":"Logo"},{"code":"make \"patterns [[?] [? ?] [? ? ?] [? ?2] [?2] [?2 ?] [?2 ? ?] [?2 ? ? ?] [? ?3]]\n\nto digit :d :numerals\n if :d = 0 [output \"||]\n output apply (sentence \"\\( \"word (item :d :patterns) \"\\)) :numerals\nend\nto digits :n :numerals\n output word ifelse :n < 10 [\"||] [digits int :n/10 bf bf :numerals] ~\n digit modulo :n 10 :numerals\nend\nto roman :n\n if or :n < 0 :n >= 4000 [output [EX MODVS!]]\n output digits :n [I V X L C D M]\nend\n\nprint roman 1999 ; MCMXCIX\nprint roman 25 ; XXV\nprint roman 944 ; CMXLIV\n","language":"Logo"},{"code":"HAI 1.2\nI HAS A Romunz ITZ A BUKKIT\nRomunz HAS A SRS 0 ITZ \"M\"\nRomunz HAS A SRS 1 ITZ \"CM\"\nRomunz HAS A SRS 2 ITZ \"D\"\nRomunz HAS A SRS 3 ITZ \"CD\"\nRomunz HAS A SRS 4 ITZ \"C\"\nRomunz HAS A SRS 5 ITZ \"XC\"\nRomunz HAS A SRS 6 ITZ \"L\"\nRomunz HAS A SRS 7 ITZ \"XL\"\nRomunz HAS A SRS 8 ITZ \"X\"\nRomunz HAS A SRS 9 ITZ \"IX\"\nRomunz HAS A SRS 10 ITZ \"V\"\nRomunz HAS A SRS 11 ITZ \"IV\"\nRomunz HAS A SRS 12 ITZ \"I\"\n\nI HAS A Valuez ITZ A BUKKIT\nValuez HAS A SRS 0 ITZ 1000\nValuez HAS A SRS 1 ITZ 900\nValuez HAS A SRS 2 ITZ 500\nValuez HAS A SRS 3 ITZ 400\nValuez HAS A SRS 4 ITZ 100\nValuez HAS A SRS 5 ITZ 90\nValuez HAS A SRS 6 ITZ 50\nValuez HAS A SRS 7 ITZ 40\nValuez HAS A SRS 8 ITZ 10\nValuez HAS A SRS 9 ITZ 9\nValuez HAS A SRS 10 ITZ 5\nValuez HAS A SRS 11 ITZ 4\nValuez HAS A SRS 12 ITZ 1\n\nHOW IZ I Romunize YR Num\n I HAS A Result ITZ \"\"\n IM IN YR Outer UPPIN YR Dummy TIL BOTH SAEM Num AN 0\n IM IN YR Inner UPPIN YR Index TIL BOTH SAEM Index AN 13\n BOTH SAEM Num AN BIGGR OF Num AN Valuez'Z SRS Index, O RLY?\n YA RLY\n Num R DIFF OF Num AN Valuez'Z SRS Index\n Result R SMOOSH Result Romunz'Z SRS Index MKAY\n GTFO\n OIC\n IM OUTTA YR Inner\n IM OUTTA YR Outer\n FOUND YR Result\nIF U SAY SO\n\nVISIBLE SMOOSH 2009 \" = \" I IZ Romunize YR 2009 MKAY MKAY\nVISIBLE SMOOSH 1666 \" = \" I IZ Romunize YR 1666 MKAY MKAY\nVISIBLE SMOOSH 3888 \" = \" I IZ Romunize YR 3888 MKAY MKAY\nKTHXBYE\n","language":"LOLCODE"},{"code":"Function toRoman(value) As String\n\tDim arabic(12) As Integer\n\tDim roman(12) As String\n\t\n\tarabic(0) = 1000\n\tarabic(1) = 900\n\tarabic(2) = 500\n\tarabic(3) = 400\n\tarabic(4) = 100\n\tarabic(5) = 90\n\tarabic(6) = 50\n\tarabic(7) = 40\n\tarabic(8) = 10\n\tarabic(9) = 9\n\tarabic(10) = 5\n\tarabic(11) = 4\n\tarabic(12) = 1\n\t\n\troman(0) = \"M\"\n\troman(1) = \"CM\"\n\troman(2) = \"D\"\n\troman(3) = \"CD\"\n\troman(4) = \"C\"\n\troman(5) = \"XC\"\n\troman(6) = \"L\"\n\troman(7) = \"XL\"\n\troman(8) = \"X\"\n\troman(9) = \"IX\"\n\troman(10) = \"V\"\n\troman(11) = \"IV\"\n\troman(12) = \"I\"\n\t\n\tDim i As Integer, result As String\n\t\n\tFor i = 0 To 12\n\t\tDo While value >= arabic(i)\n\t\t\tresult = result + roman(i)\n\t\t\tvalue = value - arabic(i)\n\t\tLoop\n\tNext i\n\t\n\ttoRoman = result\nEnd Function\n","language":"LotusScript"},{"code":"romans = {\n{1000, \"M\"},\n{900, \"CM\"}, {500, \"D\"}, {400, \"CD\"}, {100, \"C\"},\n{90, \"XC\"}, {50, \"L\"}, {40, \"XL\"}, {10, \"X\"},\n{9, \"IX\"}, {5, \"V\"}, {4, \"IV\"}, {1, \"I\"} }\n\nk = io.read() + 0\nfor _, v in ipairs(romans) do --note that this is -not- ipairs.\n val, let = unpack(v)\n while k >= val do\n k = k - val\n\tio.write(let)\n end\nend\nprint()\n","language":"Lua"},{"code":"define(`roman',`ifelse(eval($1>=1000),1,`M`'roman(eval($1-1000))',\n`ifelse(eval($1>=900),1,`CM`'roman(eval($1-900))',\n`ifelse(eval($1>=500),1,`D`'roman(eval($1-500))',\n`ifelse(eval($1>=100),1,`C`'roman(eval($1-100))',\n`ifelse(eval($1>=90),1,`XC`'roman(eval($1-90))',\n`ifelse(eval($1>=50),1,`L`'roman(eval($1-50))',\n`ifelse(eval($1>=40),1,`XL`'roman(eval($1-40))',\n`ifelse(eval($1>=10),1,`X`'roman(eval($1-10))',\n`ifelse(eval($1>=9),1,`IX`'roman(eval($1-9))',\n`ifelse(eval($1>=5),1,`V`'roman(eval($1-5))',\n`ifelse(eval($1>=4),1,`IV`'roman(eval($1-4))',\n`ifelse(eval($1>=1),1,`I`'roman(eval($1-1))'\n)')')')')')')')')')')')')dnl\ndnl\nroman(3675)\n","language":"M4"},{"code":"> for n in [ 1666, 1990, 2008 ] do printf( \"%d\\t%s\\n\", n, convert( n, 'roman' ) ) end:\n1666 MDCLXVI\n1990 MCMXC\n2008 MMVIII\n","language":"Maple"},{"code":"RomanNumeral[4]\nRomanNumeral[99]\nRomanNumeral[1337]\nRomanNumeral[1666]\nRomanNumeral[6889]\n","language":"Mathematica"},{"code":":- module roman.\n\n:- interface.\n\n:- import_module io.\n\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\n\n:- import_module char, int, list, string.\n\nmain(!IO) :-\n command_line_arguments(Args, !IO),\n filter(is_all_digits, Args, CleanArgs),\n foldl((pred(Arg::in, !.IO::di, !:IO::uo) is det :-\n ( Roman = to_roman(Arg) ->\n format(\"%s => %s\", [s(Arg), s(Roman)], !IO), nl(!IO)\n ; format(\"%s cannot be converted.\", [s(Arg)], !IO), nl(!IO) )\n ), CleanArgs, !IO).\n\n:- func to_roman(string::in) = (string::out) is semidet.\nto_roman(Number) = from_char_list(build_roman(reverse(to_char_list(Number)))).\n\n:- func build_roman(list(char)) = list(char).\n:- mode build_roman(in) = out is semidet.\nbuild_roman([]) = [].\nbuild_roman([D|R]) = Roman :-\n map(promote, build_roman(R), Interim),\n Roman = Interim ++ digit_to_roman(D).\n\n:- func digit_to_roman(char) = list(char).\n:- mode digit_to_roman(in) = out is semidet.\ndigit_to_roman('0') = [].\ndigit_to_roman('1') = ['I'].\ndigit_to_roman('2') = ['I','I'].\ndigit_to_roman('3') = ['I','I','I'].\ndigit_to_roman('4') = ['I','V'].\ndigit_to_roman('5') = ['V'].\ndigit_to_roman('6') = ['V','I'].\ndigit_to_roman('7') = ['V','I','I'].\ndigit_to_roman('8') = ['V','I','I','I'].\ndigit_to_roman('9') = ['I','X'].\n\n:- pred promote(char::in, char::out) is semidet.\npromote('I', 'X').\npromote('V', 'L').\npromote('X', 'C').\npromote('L', 'D').\npromote('C', 'M').\n\n:- end_module roman.\n","language":"Mercury"},{"code":":- module roman2.\n\n:- interface.\n\n:- import_module io.\n\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\n\n:- import_module char, int, list, string.\n\nmain(!IO) :-\n command_line_arguments(Args, !IO),\n filter_map(to_int, Args, CleanArgs),\n foldl((pred(Arg::in, !.IO::di, !:IO::uo) is det :-\n ( Roman = to_roman(Arg) ->\n format(\"%i => %s\",\n [i(Arg), s(from_char_list(Roman))], !IO),\n nl(!IO)\n ; format(\"%i cannot be converted.\", [i(Arg)], !IO), nl(!IO) )\n ), CleanArgs, !IO).\n\n:- func to_roman(int) = list(char).\n:- mode to_roman(in) = out is semidet.\nto_roman(N) = ( N >= 1000 ->\n ['M'] ++ to_roman(N - 1000)\n ;( N >= 100 ->\n digit(N / 100, 'C', 'D', 'M') ++ to_roman(N rem 100)\n ;( N >= 10 ->\n digit(N / 10, 'X', 'L', 'C') ++ to_roman(N rem 10)\n ;( N >= 1 ->\n digit(N, 'I', 'V', 'X')\n ; [] ) ) ) ).\n\n:- func digit(int, char, char, char) = list(char).\n:- mode digit(in, in, in, in) = out is semidet.\ndigit(1, X, _, _) = [X].\ndigit(2, X, _, _) = [X, X].\ndigit(3, X, _, _) = [X, X, X].\ndigit(4, X, Y, _) = [X, Y].\ndigit(5, _, Y, _) = [Y].\ndigit(6, X, Y, _) = [Y, X].\ndigit(7, X, Y, _) = [Y, X, X].\ndigit(8, X, Y, _) = [Y, X, X, X].\ndigit(9, X, _, Z) = [X, Z].\n\n:- end_module roman2.\n","language":"Mercury"},{"code":"arabicNumeral = 1990\nConvertToRoman()\nTextWindow.WriteLine(romanNumeral) 'MCMXC\narabicNumeral = 2018\nConvertToRoman()\nTextWindow.WriteLine(romanNumeral) 'MMXVIII\narabicNumeral = 3888\nConvertToRoman()\nTextWindow.WriteLine(romanNumeral) 'MMMDCCCLXXXVIII\n\nSub ConvertToRoman\n weights[0] = 1000\n weights[1] = 900\n weights[2] = 500\n weights[3] = 400\n weights[4] = 100\n weights[5] = 90\n weights[6] = 50\n weights[7] = 40\n weights[8] = 10\n weights[9] = 9\n weights[10] = 5\n weights[11] = 4\n weights[12] = 1\n symbols[0] = \"M\"\n symbols[1] = \"CM\"\n symbols[2] = \"D\"\n symbols[3] = \"CD\"\n symbols[4] = \"C\"\n symbols[5] = \"XC\"\n symbols[6] = \"L\"\n symbols[7] = \"XL\"\n symbols[8] = \"X\"\n symbols[9] = \"IX\"\n symbols[10] = \"V\"\n symbols[11] = \"IV\"\n symbols[12] = \"I\"\n romanNumeral = \"\"\n i = 0\n While (i <= 12) And (arabicNumeral > 0)\n While arabicNumeral >= weights[i]\n romanNumeral = Text.Append(romanNumeral, symbols[i])\n arabicNumeral = arabicNumeral - weights[i]\n EndWhile\n i = i + 1\n EndWhile\nEndSub\n","language":"Microsoft-Small-Basic"},{"code":"main :: [sys_message]\nmain = [ Stdout (show n ++ \": \" ++ toroman n ++ \"\\n\")\n | n <- [1990, 2008, 1666, 2023]]\n\ntoroman :: num->[char]\ntoroman 0 = \"\"\ntoroman n = d ++ toroman (n - v)\n where digits = [(\"M\",1000),(\"CM\",900),(\"D\",500),(\"CD\",400),\n (\"C\",100),(\"XC\",90),(\"L\",50),(\"XL\",40),\n (\"X\",10),(\"IX\",9),(\"V\",5),(\"IV\",4),\n (\"I\",1)]\n (d, v) = hd [(d,v) | (d,v) <- digits; v <= n]\n","language":"Miranda"},{"code":"MODULE RomanNumeralsEncode;\n\nFROM Strings IMPORT\n Append;\nFROM STextIO IMPORT\n WriteString, WriteLn;\n\nCONST\n MaxChars = 15;\n (* 3888 or MMMDCCCLXXXVIII (15 chars) is the longest string properly encoded\n with these symbols. *)\n\nTYPE\n TRomanNumeral = ARRAY [0 .. MaxChars - 1] OF CHAR;\n\nPROCEDURE ToRoman(AValue: CARDINAL; VAR OUT Destination: ARRAY OF CHAR);\nTYPE\n TRomanSymbols = ARRAY [0 .. 1] OF CHAR;\n TWeights = ARRAY [0 .. 12] OF CARDINAL;\n TSymbols = ARRAY [0 .. 12] OF TRomanSymbols;\nCONST\n Weights = TWeights {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};\n Symbols = TSymbols {\"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\",\n \"V\", \"IV\", \"I\"};\nVAR\n I: CARDINAL;\nBEGIN\n Destination := \"\";\n I := 0;\n WHILE (I <= HIGH(Weights)) AND (AValue > 0) DO\n WHILE AValue >= Weights[I] DO\n Append(Symbols[I], Destination);\n AValue := AValue - Weights[I]\n END;\n INC(I);\n END;\nEND ToRoman;\n\nVAR\n Numeral: TRomanNumeral;\n\nBEGIN\n ToRoman(1990, Numeral); WriteString(Numeral); WriteLn; (* MCMXC *)\n ToRoman(2018, Numeral); WriteString(Numeral); WriteLn; (* MMXVIII *)\n ToRoman(3888, Numeral); WriteString(Numeral); WriteLn; (* MMMDCCCLXXXVIII *)\nEND RomanNumeralsEncode.\n","language":"Modula-2"},{"code":"TOROMAN(INPUT)\n ;Converts INPUT into a Roman numeral. INPUT must be an integer between 1 and 3999\n ;OUTPUT is the string to return\n ;I is a loop variable\n ;CURRVAL is the current value in the loop\n QUIT:($FIND(INPUT,\".\")>1)!(INPUT<=0)!(INPUT>3999) \"Invalid input\"\n NEW OUTPUT,I,CURRVAL\n SET OUTPUT=\"\",CURRVAL=INPUT\n SET:$DATA(ROMANNUM)=0 ROMANNUM=\"I^IV^V^IX^X^XL^L^XC^C^CD^D^CM^M\"\n SET:$DATA(ROMANVAL)=0 ROMANVAL=\"1^4^5^9^10^40^50^90^100^400^500^900^1000\"\n FOR I=$LENGTH(ROMANVAL,\"^\"):-1:1 DO\n .FOR Q:CURRVAL<$PIECE(ROMANVAL,\"^\",I) SET OUTPUT=OUTPUT_$PIECE(ROMANNUM,\"^\",I),CURRVAL=CURRVAL-$PIECE(ROMANVAL,\"^\",I)\n KILL I,CURRVAL\n QUIT OUTPUT\n","language":"MUMPS"},{"code":"TOROMAN(n)\n ;return empty string if input parameter 'n' is not in 1-3999\n Quit:(n'?1.4N)!(n'<4000)!'n \"\"\n New r Set r=\"\"\n New p Set p=$Length(n)\n New j,x\n For j=1:1:p Do\n . Set x=$Piece(\"~I~II~III~IV~V~VI~VII~VIII~IX\",\"~\",$Extract(n,j)+1)\n . Set x=$Translate(x,\"IVX\",$Piece(\"IVX~XLC~CDM~M\",\"~\",p-j+1))\n . Set r=r_x\n Quit r\n","language":"MUMPS"},{"code":"10 REM Roman numerals/Encode\n20 DIM WEIGHTS(12),SYMBOLS$(12)\n30 FOR I=0 TO 12\n40 READ WEIGHTS(I),SYMBOLS$(I)\n50 NEXT I\n60 DATA 1000,M,900,CM,500,D,400,CD,100,C,90,XC\n70 DATA 50,L,40,XL,10,X,9,IX,5,V,4,IV,1,I\n80 REM ** 3888 or MMMDCCCLXXXVIII (15 chars) is\n90 REM the longest string properly encoded\n100 REM with these symbols.\n110 V=1990:GOSUB 500\n120 PRINT ROMAN$:REM MCMXC\n130 V=2022:GOSUB 500\n140 PRINT ROMAN$:REM MMXXII\n150 V=3888:GOSUB 500\n160 PRINT ROMAN$:REM MMMDCCCLXXXVIII\n170 END\n490 REM ** Encode to roman\n500 ROMAN$=\"\"\n510 I=0\n520 IF I>12 OR V<=0 THEN RETURN\n530 IF V<WEIGHTS(I) THEN 570\n540 ROMAN$=ROMAN$+SYMBOLS$(I)\n550 V=V-WEIGHTS(I)\n560 GOTO 530\n570 I=I+1\n580 GOTO 520\n590 RETURN\n","language":"Nascom-BASIC"},{"code":"import strutils\n\nconst nums = [(1000, \"M\"), (900, \"CM\"), (500, \"D\"), (400, \"CD\"), (100, \"C\"), (90, \"XC\"),\n (50, \"L\"), (40, \"XL\"), (10, \"X\"), (9, \"IX\"), (5, \"V\"), (4, \"IV\"), (1, \"I\")]\n\nproc toRoman(n: Positive): string =\n var n = n.int\n for (a, r) in nums:\n result.add(repeat(r, n div a))\n n = n mod a\n\nfor i in [1, 2, 3, 4, 5, 6, 7, 8, 9, 10,\n 11, 12, 13, 14, 15, 16, 17, 18, 19, 20,\n 25, 30, 40, 50, 60, 69, 70, 80, 90, 99,\n 100, 200, 300, 400, 500, 600, 666, 700, 800, 900,\n 1000, 1009, 1444, 1666, 1945, 1997, 1999,\n 2000, 2008, 2010, 2011, 2500, 3000, 3999]:\n echo ($i).align(4), \": \", i.toRoman\n","language":"Nim"},{"code":"bundle Default {\n class Roman {\n nums: static : Int[];\n rum : static : String[];\n\n function : Init() ~ Nil {\n nums := [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1];\n rum := [\"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\"];\n }\n\n function : native : ToRoman(number : Int) ~ String {\n result := \"\";\n\n for(i :=0; i < nums->Size(); i += 1;) {\n while(number >= nums[i]) {\n result->Append(rum[i]);\n number -= nums[i];\n };\n };\n\n return result;\n }\n\n function : Main(args : String[]) ~ Nil {\n Init();\n\n ToRoman(1999)->PrintLine();\n ToRoman(25)->PrintLine();\n ToRoman(944)->PrintLine();\n }\n }\n}\n","language":"Objeck"},{"code":"let digit x y z = function\n 1 -> [x]\n | 2 -> [x;x]\n | 3 -> [x;x;x]\n | 4 -> [x;y]\n | 5 -> [y]\n | 6 -> [y;x]\n | 7 -> [y;x;x]\n | 8 -> [y;x;x;x]\n | 9 -> [x;z]\n\nlet rec to_roman x =\n if x = 0 then []\n else if x < 0 then\n invalid_arg \"Negative roman numeral\"\n else if x >= 1000 then\n 'M' :: to_roman (x - 1000)\n else if x >= 100 then\n digit 'C' 'D' 'M' (x / 100) @ to_roman (x mod 100)\n else if x >= 10 then\n digit 'X' 'L' 'C' (x / 10) @ to_roman (x mod 10)\n else\n digit 'I' 'V' 'X' x\n","language":"OCaml"},{"code":"[ [1000,\"M\"], [900,\"CM\"], [500,\"D\"], [400,\"CD\"], [100,\"C\"], [90,\"XC\"], [50,\"L\"], [40,\"XL\"], [10,\"X\"], [9,\"IX\"], [5,\"V\"], [4,\"IV\"], [1,\"I\"] ] const: Romans\n\n: roman(n)\n| r |\n StringBuffer new\n Romans forEach: r [ while(r first n <=) [ r second << n r first - ->n ] ] ;\n","language":"Oforth"},{"code":"FUNCTION encodeRoman RETURNS CHAR (\n i_i AS INT\n):\n\n DEF VAR cresult AS CHAR.\n DEF VAR croman AS CHAR EXTENT 7 INIT [ \"M\", \"D\", \"C\", \"L\", \"X\", \"V\", \"I\" ].\n DEF VAR idecimal AS INT EXTENT 7 INIT [ 1000, 500, 100, 50, 10, 5, 1 ].\n DEF VAR ipos AS INT INIT 1.\n\n DO WHILE i_i > 0:\n\n IF i_i - idecimal[ ipos ] >= 0 THEN\n ASSIGN\n cresult = cresult + croman[ ipos ]\n i_i = i_i - idecimal[ ipos ]\n .\n ELSE IF ipos < EXTENT( croman ) - 1 AND i_i - ( idecimal[ ipos ] - idecimal[ ipos + 2 ] ) >= 0 THEN\n ASSIGN\n cresult = cresult + croman[ ipos + 2 ] + croman[ ipos ]\n i_i = i_i - ( idecimal[ ipos ] - idecimal[ ipos + 2 ] )\n ipos = ipos + 1\n .\n ELSE\n ipos = ipos + 1.\n END.\n\n RETURN cresult.\n\nEND FUNCTION. /* encodeRoman */\n\nMESSAGE\n 1990 encodeRoman( 1990 ) SKIP\n 2008 encodeRoman( 2008 ) SKIP\n 2000 encodeRoman( 2000 ) SKIP\n 1666 encodeRoman( 1666 ) SKIP\nVIEW-AS ALERT-BOX.\n","language":"OpenEdge-Progress"},{"code":"declare\n fun {Digit X Y Z K}\n unit([X] [X X] [X X X] [X Y] [Y] [Y X] [Y X X] [Y X X X] [X Z])\n .K\n end\n\n fun {ToRoman X}\n if X == 0 then \"\"\n elseif X < 0 then raise toRoman(negativeInput X) end\n elseif X >= 1000 then \"M\"#{ToRoman X-1000}\n elseif X >= 100 then {Digit &C &D &M X div 100}#{ToRoman X mod 100}\n elseif X >= 10 then {Digit &X &L &C X div 10}#{ToRoman X mod 10}\n else {Digit &I &V &X X}\n end\n end\nin\n {ForAll {Map [1999 25 944] ToRoman} System.showInfo}\n","language":"Oz"},{"code":"oldRoman(n)={\n while(n>999999,\n n-=1000000;\n print1(\"((((I))))\")\n );\n if(n>499999,\n n-=500000;\n print1(\"I))))\")\n );\n while(n>99999,\n n-=100000;\n print1(\"(((I)))\")\n );\n if(n>49999,\n n-=50000;\n print1(\"I)))\")\n );\n while(n>9999,\n n-=10000;\n print1(\"((I))\")\n );\n if(n>4999,\n n-=5000;\n print1(\"I))\")\n );\n while(n>999,\n n-=1000;\n print1(\"(I)\")\n );\n if(n>499,\n n-=500;\n print1(\"I)\")\n );\n while(n>99,\n n-=100;\n print1(\"C\")\n );\n if(n>49,\n n-=50;\n print1(\"L\");\n );\n while(n>9,\n n-=10;\n print1(\"X\")\n );\n if(n>4,\n n-=5;\n print1(\"V\");\n );\n while(n,\n n--;\n print1(\"I\")\n );\n print()\n};\n","language":"PARI-GP"},{"code":"medievalRoman(n)={\n while(n>999,\n n-=1000;\n print1(\"M\")\n );\n if(n>899,\n n-=900;\n print1(\"CM\")\n );\n if(n>499,\n n-=500;\n print1(\"D\")\n );\n if(n>399,\n n-=400;\n print1(\"CD\")\n );\n while(n>99,\n n-=100;\n print1(\"C\")\n );\n if(n>89,\n n-=90;\n print1(\"XC\")\n );\n if(n>49,\n n-=50;\n print1(\"L\")\n );\n if(n>39,\n n-=40;\n print1(\"XL\")\n );\n while(n>9,\n n-=10;\n print1(\"X\")\n );\n if(n>8,\n n-=9;\n print1(\"IX\")\n );\n if(n>4,\n n-=5;\n print1(\"V\")\n );\n if(n>3,\n n-=4;\n print1(\"IV\")\n );\n while(n,\n n--;\n print1(\"I\")\n );\n print()\n};\n","language":"PARI-GP"},{"code":"<@ DEFUDOLITLIT>_RO|__Transformer|<@ DEFKEYPAR>__NationalNumericID|2</@><@ LETRESCS%NNMPAR>...|1</@></@>\n\n<@ ENU$$DLSTLITLIT>1990,2008,1,2,64,124,1666,10001|,|\n<@ SAYELTLST>...</@> is <@ SAY_ROELTLSTLIT>...|RomanLowerUnicode</@> <@ SAY_ROELTLSTLIT>...|RomanUpperUnicode</@> <@ SAY_ROELTLSTLIT>...|RomanASCII</@>\n</@>\n","language":"Peloton"},{"code":"<# DEFINE USERDEFINEDOPCODE LITERAL LITERAL>_RO|__Transformer|<# DEFINE KEYWORD PARAMETER>__NationalNumericID|2</#><# LET RESULT CAST NATIONALNUMBER PARAMETER>...|1</#></#>\n\n<# ENUMERATION LAMBDASPECIFIEDDELMITER LIST LITERAL LITERAL>1990,2008,1,2,64,124,1666,10001|,|\n<# SAY ELEMENT LIST>...</#> is <# SAY _RO ELEMENT LIST LITERAL>...|RomanLowerUnicode</#> <# SAY _RO ELEMENT LIST LITERAL>...|RomanUpperUnicode</#> <# SAY _RO ELEMENT LIST LITERAL>...|RomanASCII</#>\n</#>\n","language":"Peloton"},{"code":"my @symbols = ( [1000, 'M'], [900, 'CM'], [500, 'D'], [400, 'CD'], [100, 'C'], [90, 'XC'], [50, 'L'], [40, 'XL'], [10, 'X'], [9, 'IX'], [5, 'V'], [4, 'IV'], [1, 'I'] );\n\nsub roman {\n my($n, $r) = (shift, '');\n ($r, $n) = ('-', -$n) if $n < 0; # Optional handling of negative input\n foreach my $s (@symbols) {\n my($arabic, $roman) = @$s;\n ($r, $n) = ($r .= $roman x int($n/$arabic), $n % $arabic)\n if $n >= $arabic;\n }\n $r;\n}\n\nsay roman($_) for 1..2012;\n","language":"Perl"},{"code":"use Math::Roman qw/roman/;\nsay roman($_) for 1..2012'\n","language":"Perl"},{"code":"use List::MoreUtils qw( natatime );\n\nmy %symbols = (\n 1 => \"I\", 5 => \"V\", 10 => \"X\", 50 => \"L\", 100 => \"C\",\n 500 => \"D\", 1_000 => \"M\"\n);\n\nmy @subtractors = (\n 1_000, 100, 500, 100, 100, 10, 50, 10, 10, 1, 5, 1, 1, 0\n);\n\nsub roman {\n return '' if 0 == (my $n = shift);\n my $iter = natatime 2, @subtractors;\n while( my ($cut, $minus) = $iter->() ) {\n $n >= $cut\n and return $symbols{$cut} . roman($n - $cut);\n $n >= $cut - $minus\n and return $symbols{$minus} . roman($n + $minus);\n }\n};\n\nprint roman($_) . \"\\n\" for 1..2012;\n","language":"Perl"},{"code":"with javascript_semantics\nfunction toRoman(integer v)\n sequence roman = {\"M\", \"CM\", \"D\",\"CD\", \"C\",\"XC\",\"L\",\"XL\",\"X\",\"IX\",\"V\",\"IV\",\"I\"},\n decml = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 }\n string res = \"\"\n integer val = v\n for i=1 to length(roman) do\n while val>=decml[i] do\n res &= roman[i]\n val -= decml[i]\n end while\n end for\n return {v,res} -- (for output)\nend function\n\n?apply({1990,2008,1666},toRoman)\n","language":"Phix"},{"code":"with javascript_semantics\nrequires(\"1.0.5\")\nfunction toRoman(integer n)\n return {n,sprintf(\"%R\",n)}\nend function\n","language":"Phix"},{"code":"include ..\\Utilitys.pmt\n\ndef romanEnc /# n -- s #/\n var number\n \"\" var res\n ( ( 1000 \"M\" ) ( 900 \"CM\" ) ( 500 \"D\" ) ( 400 \"CD\" ) ( 100 \"C\" ) ( 90 \"XC\" )\n ( 50 \"L\" ) ( 40 \"XL\" ) ( 10 \"X\" ) ( 9 \"IX\" ) ( 5 \"V\" ) ( 4 \"IV\" ) ( 1 \"I\" ) )\n\n len for\n get 1 get\n number over / int\n number rot mod var number\n swap 2 get rot dup if\n for drop res over chain var res endfor\n else\n drop\n endif\n drop drop\n endfor\n drop\n res\nenddef\n\n1968 romanEnc print\n","language":"Phixmonti"},{"code":"def romanEnc /# n -- s #/\n var k\n ( ( 1000 \"M\" ) ( 900 \"CM\" ) ( 500 \"D\" ) ( 400 \"CD\" ) ( 100 \"C\" ) ( 90 \"XC\" )\n ( 50 \"L\" ) ( 40 \"XL\" ) ( 10 \"X\" ) ( 9 \"IX\" ) ( 5 \"V\" ) ( 4 \"IV\" ) ( 1 \"I\" ) )\n\n len for\n get 2 get var let 1 get var val drop\n k val >=\n while\n k val - var k\n let print\n k val >=\n endwhile\n endfor\n drop nl\nenddef\n\n1968 romanEnc\n","language":"Phixmonti"},{"code":"def romanEnc /# n -- s #/\n >ps\n ( ( 1000 \"M\" ) ( 900 \"CM\" ) ( 500 \"D\" ) ( 400 \"CD\" ) ( 100 \"C\" ) ( 90 \"XC\" )\n ( 50 \"L\" ) ( 40 \"XL\" ) ( 10 \"X\" ) ( 9 \"IX\" ) ( 5 \"V\" ) ( 4 \"IV\" ) ( 1 \"I\" ) )\n\n len for\n get 2 get swap 1 get nip\n tps over >=\n while\n ps> over - >ps\n over print\n tps over >=\n endwhile\n drop drop\n endfor\n ps> drop drop nl\nenddef\n\n1968 romanEnc\n","language":"Phixmonti"},{"code":"/**\n * int2roman\n * Convert any positive value of a 32-bit signed integer to its modern roman\n * numeral representation. Numerals within parentheses are multiplied by\n * 1000. ie. M == 1 000, (M) == 1 000 000, ((M)) == 1 000 000 000\n *\n * @param number - an integer between 1 and 2147483647\n * @return roman numeral representation of number\n */\nfunction int2roman($number)\n{\n\tif (!is_int($number) || $number < 1) return false; // ignore negative numbers and zero\n\t\n\t$integers = array(900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1);\n\t$numerals = array('CM', 'D', 'CD', 'C', 'XC', 'L', 'XL', 'X', 'IX', 'V', 'IV', 'I');\n\t$major = intval($number / 1000) * 1000;\n\t$minor = $number - $major;\n\t$numeral = $leastSig = '';\n\t\n\tfor ($i = 0; $i < sizeof($integers); $i++) {\n\t\twhile ($minor >= $integers[$i]) {\n\t\t\t$leastSig .= $numerals[$i];\n\t\t\t$minor -= $integers[$i];\n\t\t}\n\t}\n\t\n\tif ($number >= 1000 && $number < 40000) {\n\t\tif ($major >= 10000) {\n\t\t\t$numeral .= '(';\n\t\t\twhile ($major >= 10000) {\n\t\t\t\t$numeral .= 'X';\n\t\t\t\t$major -= 10000;\n\t\t\t}\n\t\t\t$numeral .= ')';\n\t\t}\n\t\tif ($major == 9000) {\n\t\t\t$numeral .= 'M(X)';\n\t\t\treturn $numeral . $leastSig;\n\t\t}\n\t\tif ($major == 4000) {\n\t\t\t$numeral .= 'M(V)';\n\t\t\treturn $numeral . $leastSig;\n\t\t}\n\t\tif ($major >= 5000) {\n\t\t\t$numeral .= '(V)';\n\t\t\t$major -= 5000;\n\t\t}\n\t\twhile ($major >= 1000) {\n\t\t\t$numeral .= 'M';\n\t\t\t$major -= 1000;\n\t\t}\n\t}\n\t\n\tif ($number >= 40000) {\n\t\t$major = $major/1000;\n\t\t$numeral .= '(' . int2roman($major) . ')';\n\t}\n\t\n\treturn $numeral . $leastSig;\n}\n","language":"PHP"},{"code":"go =>\n List = [455,999,1990,1999,2000,2001,2008,2009,2010,2011,2012,1666,3456,3888,4000],\n foreach(Val in List)\n printf(\"%4d: %w\\n\", Val, roman_encode(Val))\n end,\n nl.\n\nroman_encode(Val) = Res =>\n if Val <= 0 then\n Res := -1\n else\n Arabic = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1],\n Roman = [\"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\",\"L\",\"XL\",\"X\",\"IX\",\"V\",\"IV\",\"I\"],\n Res = \"\",\n foreach(I in 1..Arabic.length)\n while(Val >= Arabic[I])\n Res := Res ++ Roman[I],\n Val := Val - Arabic[I]\n end\n end\n end.\n","language":"Picat"},{"code":"go2 =>\n All = [Len=I=roman_encode(I) : I in 1..4000,E=roman_encode(I), Len=E.len].sort_down,\n println(All[1..2]),\n nl.\n","language":"Picat"},{"code":"(de roman (N)\n (pack\n (make\n (mapc\n '((C D)\n (while (>= N D)\n (dec 'N D)\n (link C) ) )\n '(M CM D CD C XC L XL X IX V IV I)\n (1000 900 500 400 100 90 50 40 10 9 5 4 1) ) ) ) )\n","language":"PicoLisp"},{"code":"import String;\nint main(){\n write(int2roman(2009) + \"\\n\");\n write(int2roman(1666) + \"\\n\");\n write(int2roman(1337) + \"\\n\");\n}\n","language":"Pike"},{"code":"/* From Wiki Fortran */\nroman: procedure (n) returns(character (32) varying);\n declare n fixed binary nonassignable;\n declare (d, m) fixed binary;\n declare (r, m_div) character (32) varying;\n declare d_dec(13) fixed binary static initial\n (1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1);\n declare d_rom(13) character (2) varying static initial\n ('M', 'CM', 'D', 'CD', 'C', 'XC', 'L',\n 'XL', 'X', 'IX', 'V', 'IV', 'I');\n r = '';\n m = n;\n do d = 1 to 13;\n m_div = m / d_dec (d);\n r = r || copy (d_rom (d), m_div);\n m = m - d_dec (d) * m_div;\n end;\n return (r);\nend roman;\n","language":"PL-I"},{"code":"/*****************************************************************\n * $Author: Atanas Kebedjiev $\n *****************************************************************\n * Encoding an Arabic numeral to a Roman in the range 1..3999 is much simpler as Oracle provides the conversion formats.\n * Please see also the SQL solution for the same task.\n */\n\nCREATE OR REPLACE\nFUNCTION rencode(an IN NUMBER)\n RETURN VARCHAR2\nIS\nBEGIN\n RETURN to_char(an, 'RN');\nEND rencode;\n\nBEGIN\n\n DBMS_OUTPUT.PUT_LINE ('2012 = ' || rencode('2012')); -- MMXII\n DBMS_OUTPUT.PUT_LINE ('1951 = ' || rencode('1951')); -- MCMLI\n DBMS_OUTPUT.PUT_LINE ('1987 = ' || rencode('1987')); -- MCMLXXXVII\n DBMS_OUTPUT.PUT_LINE ('1666 = ' || rencode('1666')); -- MDCLXVI\n DBMS_OUTPUT.PUT_LINE ('1999 = ' || rencode('1999')); -- MCMXCIX\n\nEND;\n","language":"PL-SQL"},{"code":"\\def\\upperroman#1{\\uppercase\\expandafter{\\romannumeral#1}}\nAnno Domini \\upperroman{\\year}\n\\bye\n","language":"PlainTeX"},{"code":"FUNCTION toRoman(value AS INTEGER) AS STRING\n DIM arabic(0 TO 12) AS INTEGER\n DIM roman(0 TO 12) AS STRING\n ARRAY ASSIGN arabic() = 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1\n ARRAY ASSIGN roman() = \"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\"\n\n DIM i AS INTEGER\n DIM result AS STRING\n\n FOR i = 0 TO 12\n DO WHILE value >= arabic(i)\n result = result & roman(i)\n value = value - arabic(i)\n LOOP\n NEXT i\n toRoman = result\nEND FUNCTION\n\nFUNCTION PBMAIN\n 'Testing\n ? \"2009 = \" & toRoman(2009)\n ? \"1666 = \" & toRoman(1666)\n ? \"3888 = \" & toRoman(3888)\nEND FUNCTION\n","language":"PowerBASIC"},{"code":"Filter ToRoman {\n\t$output = ''\n\t\n\tif ($_ -ge 4000) {\n\t\tthrow 'Number too high'\n\t}\n\t\n\t$current = 1000\n\t$subtractor = 'M'\n\t$whole = $False\n\t$decimal = $_\n\t'C','D','X','L','I','V',' ' `\n\t| %{\n\t\t$divisor = $current\n\t\tif ($whole = !$whole) {\n\t\t\t$current /= 10\n\t\t\t$subtractor = $_ + $subtractor[0]\n\t\t\t$_ = $subtractor[1]\n\t\t}\n\t\telse {\n\t\t\t$divisor *= 5\n\t\t\t$subtractor = $subtractor[0] + $_\n\t\t}\n\t\t\n\t\t$multiple = [Math]::floor($decimal / $divisor)\n\t\tif ($multiple) {\n\t\t\t$output += [string]$_ * $multiple\n\t\t\t$decimal %= $divisor\n\t\t}\n\t\tif ($decimal -ge ($divisor -= $current)) {\n\t\t\t$output += $subtractor\n\t\t\t$decimal -= $divisor\n\t\t}\n\t}\n\t\n\t$output\n}\n","language":"PowerShell"},{"code":"19,4,0,2479,3001 | ToRoman\n","language":"PowerShell"},{"code":":- use_module(library(clpfd)).\n\nroman :-\n\tLA = [ _ , 2010, _, 1449, _],\n\tLR = ['MDCCLXXXIX', _ , 'CX', _, 'MDCLXVI'],\n\tmaplist(roman, LA, LR),\n\tmaplist(my_print,LA, LR).\n\n\nroman(A, R) :-\n\tA #> 0,\n\troman(A, [u, t, h, th], LR, []),\n\tlabel([A]),\n\tparse_Roman(CR, LR, []),\n\tatom_chars(R, CR).\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% using DCG\n\nroman(0, []) --> [].\n\nroman(N, [H | T]) -->\n\t{N1 #= N / 10,\n\t N2 #= N mod 10},\n\troman(N1, T),\n\tunity(N2, H).\n\nunity(1, u) --> ['I'].\nunity(1, t) --> ['X'].\nunity(1, h) --> ['C'].\nunity(1, th)--> ['M'].\n\nunity(4, u) --> ['IV'].\nunity(4, t) --> ['XL'].\nunity(4, h) --> ['CD'].\nunity(4, th)--> ['MMMM'].\n\nunity(5, u) --> ['V'].\nunity(5, t) --> ['L'].\nunity(5, h) --> ['D'].\nunity(5, th)--> ['MMMMM'].\n\nunity(9, u) --> ['IX'].\nunity(9, t) --> ['XC'].\nunity(9, h) --> ['CM'].\nunity(9, th)--> ['MMMMMMMMM'].\n\nunity(0, _) --> [].\n\n\nunity(V, U)-->\n\t{V #> 5,\n\tV1 #= V - 5},\n\tunity(5, U),\n\tunity(V1, U).\n\nunity(V, U) -->\n\t{V #> 1, V #< 4,\n\tV1 #= V-1},\n\tunity(1, U),\n\tunity(V1, U).\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% Extraction of roman \"lexeme\"\nparse_Roman(['C','M'|T]) -->\n\t['CM'],\n\tparse_Roman(T).\n\nparse_Roman(['C','D'|T]) -->\n\t['CD'],\n\tparse_Roman(T).\n\nparse_Roman(['X','C'| T]) -->\n\t['XC'],\n\tparse_Roman(T).\n\n\nparse_Roman(['X','L'| T]) -->\n\t['XL'],\n\tparse_Roman(T).\n\n\nparse_Roman(['I','X'| T]) -->\n\t['IX'],\n\tparse_Roman(T).\n\n\nparse_Roman(['I','V'| T]) -->\n\t['IV'],\n\tparse_Roman(T).\n\nparse_Roman([H | T]) -->\n\t[H],\n\tparse_Roman(T).\n\n\nparse_Roman([]) -->\n\t[].\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nmy_print(A, R) :-\n\tformat('~w in roman is ~w~n', [A, R]).\n","language":"Prolog"},{"code":"#SymbolCount = 12 ;0 based count\nDataSection\n denominations:\n Data.s \"M\",\"CM\",\"D\",\"CD\",\"C\",\"XC\",\"L\",\"XL\",\"X\",\"IX\",\"V\",\"IV\",\"I\" ;0-12\n\n denomValues:\n Data.i 1000,900,500,400,100,90,50,40,10,9,5,4,1 ;values in decending sequential order\nEndDataSection\n\n;-setup\nStructure romanNumeral\n symbol.s\n value.i\nEndStructure\n\nGlobal Dim refRomanNum.romanNumeral(#SymbolCount)\n\nRestore denominations\nFor i = 0 To #SymbolCount\n Read.s refRomanNum(i)\\symbol\nNext\n\nRestore denomValues\nFor i = 0 To #SymbolCount\n Read refRomanNum(i)\\value\nNext\n\nProcedure.s decRoman(n)\n ;converts a decimal number to a roman numeral\n Protected roman$, i\n\n For i = 0 To #SymbolCount\n Repeat\n If n >= refRomanNum(i)\\value\n roman$ + refRomanNum(i)\\symbol\n n - refRomanNum(i)\\value\n Else\n Break\n EndIf\n ForEver\n Next\n\n ProcedureReturn roman$\nEndProcedure\n\nIf OpenConsole()\n\n PrintN(decRoman(1999)) ;MCMXCIX\n PrintN(decRoman(1666)) ;MDCLXVI\n PrintN(decRoman(25)) ;XXV\n PrintN(decRoman(954)) ;CMLIV\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\")\n Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"import roman\nprint(roman.toRoman(2022))\n","language":"Python"},{"code":"def toRoman(n):\n res=''\t\t#converts int to str(Roman numeral)\n reg=n\t\t#using the numerals (M,D,C,L,X,V,I)\n if reg<4000:#no more than three repetitions\n while reg>=1000:\t#thousands up to MMM\n res+='M'\t\t#MAX is MMMCMXCIX\n reg-=1000\t\t\n if reg>=900:\t\t#nine hundreds in 900-999\n res+='CM'\n reg-=900\n if reg>=500:\t\t#five hudreds in 500-899\n res+='D'\n reg-=500\n if reg>=400:\t\t#four hundreds in 400-499\n res+='CD'\n reg-=400\n while reg>=100:\t\t#hundreds in 100-399\n res+='C'\n reg-=100\n if reg>=90:\t\t\t#nine tens in 90-99\n res+='XC'\n reg-=90\n if reg>=50:\t\t\t#five Tens in 50-89\n res+='L'\n reg-=50\n if reg>=40:\n res+='XL'\t\t#four Tens\n reg-=40\n while reg>=10:\n res+=\"X\"\t\t#tens\n reg-=10\n if reg>=9:\n res+='IX'\t\t#nine Units\n reg-=9\n if reg>=5:\n res+='V'\t\t#five Units\n reg-=5\n if reg>=4:\n res+='IV'\t\t#four Units\n reg-=4\n while reg>0:\t\t#three or less Units\n res+='I'\n reg-=1\n return res\n","language":"Python"},{"code":"roman = \"MDCLXVmdclxvi\"; # UPPERCASE for thousands #\nadjust_roman = \"CCXXmmccxxii\";\narabic = (1000000, 500000, 100000, 50000, 10000, 5000, 1000, 500, 100, 50, 10, 5, 1);\nadjust_arabic = (100000, 100000, 10000, 10000, 1000, 1000, 100, 100, 10, 10, 1, 1, 0);\n\ndef arabic_to_roman(dclxvi):\n org = dclxvi; # 666 #\n out = \"\";\n for scale,arabic_scale in enumerate(arabic):\n if org == 0: break\n multiples = org / arabic_scale;\n org -= arabic_scale * multiples;\n out += roman[scale] * multiples;\n if org >= -adjust_arabic[scale] + arabic_scale:\n org -= -adjust_arabic[scale] + arabic_scale;\n out += adjust_roman[scale] + roman[scale]\n return out\n\nif __name__ == \"__main__\":\n test = (1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,25,30,40,50,60,69,70,\n 80,90,99,100,200,300,400,500,600,666,700,800,900,1000,1009,1444,1666,1945,1997,1999,\n 2000,2008,2500,3000,4000,4999,5000,6666,10000,50000,100000,500000,1000000);\n for val in test:\n print '%d - %s'%(val, arabic_to_roman(val))\n","language":"Python"},{"code":"romanDgts= 'ivxlcdmVXLCDM_'\n\ndef ToRoman(num):\n namoR = ''\n if num >=4000000:\n print 'Too Big -'\n return '-----'\n for rdix in range(0, len(romanDgts), 2):\n if num==0: break\n num,r = divmod(num,10)\n v,r = divmod(r, 5)\n if r==4:\n namoR += romanDgts[rdix+1+v] + romanDgts[rdix]\n else:\n namoR += r*romanDgts[rdix] + (romanDgts[rdix+1] if(v==1) else '')\n return namoR[-1::-1]\n","language":"Python"},{"code":"anums = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\nrnums = \"M CM D CD C XC L XL X IX V IV I\".split()\n\ndef to_roman(x):\n ret = []\n for a,r in zip(anums, rnums):\n n,x = divmod(x,a)\n ret.append(r*n)\n return ''.join(ret)\n\nif __name__ == \"__main__\":\n test = (1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,25,30,40,\n 50,60,69,70,80,90,99,100,200,300,400,500,600,666,700,800,900,\n 1000,1009,1444,1666,1945,1997,1999,2000,2008,2010,2011,2500,\n 3000,3999)\n\n for val in test:\n print '%d - %s'%(val, to_roman(val))\n","language":"Python"},{"code":"def arabic_to_roman(dclxvi):\n#===========================\n '''Convert an integer from the decimal notation to the Roman notation'''\n org = dclxvi; # 666 #\n out = \"\";\n for scale, arabic_scale in enumerate(arabic):\n if org == 0: break\n multiples = org // arabic_scale;\n org -= arabic_scale * multiples;\n out += roman[scale] * multiples;\n if (org >= -adjust_arabic[scale] + arabic_scale):\n org -= -adjust_arabic[scale] + arabic_scale;\n out += adjust_roman[scale] + roman[scale]\n return out\n\nif __name__ == \"__main__\":\n test = (1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,25,30,40,50,60,69,70,\n 80,90,99,100,200,300,400,500,600,666,700,800,900,1000,1009,1444,1666,1945,1997,1999,\n 2000,2008,2500,3000,4000,4999,5000,6666,10000,50000,100000,500000,1000000);\n\n for val in test:\n print(\"%8d %s\" %(val, arabic_to_roman(val)))\n","language":"Python"},{"code":"rnl = [ { '4' : 'MMMM', '3' : 'MMM', '2' : 'MM', '1' : 'M', '0' : '' }, { '9' : 'CM', '8' : 'DCCC', '7' : 'DCC',\n '6' : 'DC', '5' : 'D', '4' : 'CD', '3' : 'CCC', '2' : 'CC', '1' : 'C', '0' : '' }, { '9' : 'XC',\n '8' : 'LXXX', '7' : 'LXX', '6' : 'LX', '5' : 'L', '4' : 'XL', '3' : 'XXX', '2' : 'XX', '1' : 'X',\n '0' : '' }, { '9' : 'IX', '8' : 'VIII', '7' : 'VII', '6' : 'VI', '5' : 'V', '4' : 'IV', '3' : 'III',\n '2' : 'II', '1' : 'I', '0' : '' }]\n# Option 1\ndef number2romannumeral(n):\n return ''.join([rnl[x][y] for x, y in zip(range(4), str(n).zfill(4)) if n < 5000 and n > -1])\n# Option 2\ndef number2romannumeral(n):\n return reduce(lambda x, y: x + y, map(lambda x, y: rnl[x][y], range(4), str(n).zfill(4))) if -1 < n < 5000 else None\n","language":"Python"},{"code":"'''Encoding Roman Numerals'''\n\nfrom functools import reduce\nfrom itertools import chain\n\n\n# romanFromInt :: Int -> String\ndef romanFromInt(n):\n '''A string of Roman numerals encoding an integer.'''\n def go(a, ms):\n m, s = ms\n q, r = divmod(a, m)\n return (r, s * q)\n\n return concat(snd(mapAccumL(go)(n)(\n zip([\n 1000, 900, 500, 400, 100, 90, 50,\n 40, 10, 9, 5, 4, 1\n ], [\n 'M', 'CM', 'D', 'CD', 'C', 'XC', 'L',\n 'XL', 'X', 'IX', 'V', 'IV', 'I'\n ])\n )))\n\n\n# ------------------------- TEST -------------------------\n# main :: IO ()\ndef main():\n '''Sample of years'''\n for s in [\n romanFromInt(x) for x in [\n 1666, 1990, 2008, 2016, 2018, 2020\n ]\n ]:\n print(s)\n\n\n# ------------------ GENERIC FUNCTIONS -------------------\n\n# concat :: [[a]] -> [a]\n# concat :: [String] -> String\ndef concat(xxs):\n '''The concatenation of all the elements in a list.'''\n xs = list(chain.from_iterable(xxs))\n unit = '' if isinstance(xs, str) else []\n return unit if not xs else (\n ''.join(xs) if isinstance(xs[0], str) else xs\n )\n\n\n# mapAccumL :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])\ndef mapAccumL(f):\n '''A tuple of an accumulation and a list derived by a\n combined map and fold,\n with accumulation from left to right.'''\n def go(a, x):\n tpl = f(a[0], x)\n return (tpl[0], a[1] + [tpl[1]])\n return lambda acc: lambda xs: (\n reduce(go, xs, (acc, []))\n )\n\n\n# snd :: (a, b) -> b\ndef snd(tpl):\n '''Second component of a tuple.'''\n return tpl[1]\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"DIM SHARED arabic(0 TO 12)\nDIM SHARED roman$(0 TO 12)\n\nFUNCTION toRoman$ (value)\n LET result$ = \"\"\n FOR i = 0 TO 12\n DO WHILE value >= arabic(i)\n LET result$ = result$ + roman$(i)\n LET value = value - arabic(i)\n LOOP\n NEXT i\n toRoman$ = result$\nEND FUNCTION\n\nFOR i = 0 TO 12\n READ arabic(i), roman$(i)\nNEXT i\n\nDATA 1000, \"M\", 900, \"CM\", 500, \"D\", 400, \"CD\", 100, \"C\", 90, \"XC\"\nDATA 50, \"L\", 40, \"XL\", 10, \"X\", 9, \"IX\", 5, \"V\", 4, \"IV\", 1, \"I\"\n\n'Testing\nPRINT \"2009 = \"; toRoman$(2009)\nPRINT \"1666 = \"; toRoman$(1666)\nPRINT \"3888 = \"; toRoman$(3888)\n","language":"QBasic"},{"code":" [ $ \"\"\n swap 1000 /mod $ \"M\" rot of rot swap join swap\n dup 900 < not if [ 900 - dip [ $ \"CM\" join ] ]\n dup 500 < not if [ 500 - dip [ $ \"D\" join ] ]\n dup 400 < not if [ 400 - dip [ $ \"CD\" join ] ]\n 100 /mod $ \"C\" rot of rot swap join swap\n dup 90 < not if [ 90 - dip [ $ \"XC\" join ] ]\n dup 50 < not if [ 50 - dip [ $ \"L\" join ] ]\n dup 40 < not if [ 40 - dip [ $ \"XL\" join ] ]\n 10 /mod $ \"X\" rot of rot swap join swap\n dup 9 < not if [ 9 - dip [ $ \"IX\" join ] ]\n dup 5 < not if [ 5 - dip [ $ \"V\" join ] ]\n dup 4 < not if [ 4 - dip [ $ \"IV\" join ] ]\n $ \"I\" swap of join ]\n is ->roman ( n --> $ )\n\n 1990 dup echo say \" = \" ->roman echo$ cr\n 2008 dup echo say \" = \" ->roman echo$ cr\n 1666 dup echo say \" = \" ->roman echo$ cr\n","language":"Quackery"},{"code":"as.roman(1666) # MDCLXVI\n","language":"R"},{"code":"as.roman(1666) + 334 # MM\n","language":"R"},{"code":"#lang racket\n(define (encode/roman number)\n (cond ((>= number 1000) (string-append \"M\" (encode/roman (- number 1000))))\n ((>= number 900) (string-append \"CM\" (encode/roman (- number 900))))\n ((>= number 500) (string-append \"D\" (encode/roman (- number 500))))\n ((>= number 400) (string-append \"CD\" (encode/roman (- number 400))))\n ((>= number 100) (string-append \"C\" (encode/roman (- number 100))))\n ((>= number 90) (string-append \"XC\" (encode/roman (- number 90))))\n ((>= number 50) (string-append \"L\" (encode/roman (- number 50))))\n ((>= number 40) (string-append \"XL\" (encode/roman (- number 40))))\n ((>= number 10) (string-append \"X\" (encode/roman (- number 10))))\n ((>= number 9) (string-append \"IX\" (encode/roman (- number 9))))\n ((>= number 5) (string-append \"V\" (encode/roman (- number 5))))\n ((>= number 4) (string-append \"IV\" (encode/roman (- number 4))))\n ((>= number 1) (string-append \"I\" (encode/roman (- number 1))))\n (else \"\")))\n","language":"Racket"},{"code":"#lang racket\n(define (number->list n)\n (for/fold ([result null])\n ([decimal '(1000 900 500 400 100 90 50 40 10 9 5 4 1)]\n [roman '(M CM D CD C XC L XL X IX V IV I)])\n #:break (= n 0)\n (let-values ([(q r) (quotient/remainder n decimal)])\n (set! n r)\n (append result (make-list q roman)))))\n\n(define (encode/roman number)\n (string-join (map symbol->string (number->list number)) \"\"))\n\n(for ([n '(1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 25 30 40\n 50 60 69 70 80 90 99 100 200 300 400 500 600 666 700 800 900\n 1000 1009 1444 1666 1945 1997 1999 2000 2008 2010 2011 2500\n 3000 3999)])\n (printf \"~a ~a\\n\" n (encode/roman n)))\n","language":"Racket"},{"code":"my %symbols =\n 1 => \"I\", 5 => \"V\", 10 => \"X\", 50 => \"L\", 100 => \"C\",\n 500 => \"D\", 1_000 => \"M\";\n\nmy @subtractors =\n 1_000, 100, 500, 100, 100, 10, 50, 10, 10, 1, 5, 1, 1, 0;\n\nmulti sub roman (0) { '' }\nmulti sub roman (Int $n) {\n for @subtractors -> $cut, $minus {\n $n >= $cut\n and return %symbols{$cut} ~ roman($n - $cut);\n $n >= $cut - $minus\n and return %symbols{$minus} ~ roman($n + $minus);\n }\n}\n\n# Sample usage\n\nfor 1 .. 2_010 -> $x {\n say roman($x);\n}\n","language":"Raku"},{"code":"Red []\n\ntable: [1000 M 900 CM 500 D 400 CD 100 C 90 XC 50 L 40 XL 10 X 9 IX 5 V 4 IV 1 I]\n\nto-Roman: function [n [integer!] return: [string!]][\n out: copy \"\"\n foreach [a r] table [while [n >= a][append out r n: n - a]]\n out\n]\n\nforeach number [40 33 1888 2016][print [number \":\" to-Roman number]]\n","language":"Red"},{"code":"Red []\n\ntable: [1000 M 900 CM 500 D 400 CD 100 C 90 XC 50 L 40 XL 10 X 9 IX 5 V 4 IV 1 I]\n\nto-Roman: func [n [integer!] return: [string!]][\n case [\n tail? table [table: head table copy \"\"]\n table/1 > n [table: skip table 2 to-Roman n]\n 'else [append copy form table/2 to-Roman n - table/1]\n ]\n]\n\nforeach number [40 33 1888 2016][print [number \":\" to-Roman number]]\n","language":"Red"},{"code":"Red []\n\nto-Roman: function [n [integer!]] reduce [\n 'case collect [\n foreach [a r] [1000 M 900 CM 500 D 400 CD 100 C 90 XC 50 L 40 XL 10 X 9 IX 5 V 4 IV 1 I][\n keep compose/deep [n >= (a) [append copy (form r) any [to-Roman n - (a) copy \"\"]]]\n ]\t\n ]\n]\n\nforeach number [40 33 1888 2016][print [number \":\" to-Roman number]]\n","language":"Red"},{"code":": vector ( ...n\"- )\n here [ &, times ] dip : .data ` swap ` + ` @ ` do ` ; ;\n: .I dup @ ^buffer'add ;\n: .V dup 1 + @ ^buffer'add ;\n: .X dup 2 + @ ^buffer'add ;\n\n[ .I .X drop ]\n[ .V .I .I .I drop ]\n[ .V .I .I drop ]\n[ .V .I drop ]\n[ .V drop ]\n[ .I .V drop ]\n[ .I .I .I drop ]\n[ .I .I drop ]\n[ .I drop ]\n&drop\n10 vector .digit\n\n: record ( an- )\n 10 /mod dup [ [ over 2 + ] dip record ] &drop if .digit ;\n: toRoman ( n-a )\n here ^buffer'set\n dup 1 3999 within 0 =\n [ \"EX LIMITO!\\n\" ] [ \"IVXLCDM\" swap record here ] if ;\n","language":"Retro"},{"code":"roman: procedure\narg number\n\n/* handle only 1 to 3999, else return ? */\nif number >= 4000 | number <= 0 then return \"?\"\n\nromans = \" M CM D CD C XC L XL X IX V IV I\"\narabic = \"1000 900 500 400 100 90 50 40 10 9 5 4 1\"\n\nresult = \"\"\ndo i = 1 to words(romans)\n do while number >= word(arabic,i)\n result = result || word(romans,i)\n number = number - word(arabic,i)\n end\nend\nreturn result\n","language":"REXX"},{"code":"/*REXX program converts (Arabic) non─negative decimal integers (≥0) ───► Roman numerals.*/\nnumeric digits 10000 /*decimal digs can be higher if wanted.*/\nparse arg # /*obtain optional integers from the CL.*/\n@er= \"argument isn't a non-negative integer: \" /*literal used when issuing error msg. */\nif #='' then /*Nothing specified? Then generate #s.*/\n do\n do j= 0 by 11 to 111; #=# j; end\n #=# 49; do k=88 by 100 to 1200; #=# k; end\n #=# 1000 2000 3000 4000 5000 6000; do m=88 by 200 to 1200; #=# m; end\n #=# 1304 1405 1506 1607 1708 1809 1910 2011; do p= 4 to 50; #=# 10**p; end\n end /*finished with generation of numbers. */\n\n do i=1 for words(#); x=word(#, i) /*convert each of the numbers───►Roman.*/\n if \\datatype(x, 'W') | x<0 then say \"***error***\" @er x /*¬ whole #? negative?*/\n say right(x, 55) dec2rom(x)\n end /*i*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ndec2rom: procedure; parse arg n,# /*obtain the number, assign # to a null*/\n n=space(translate(n/1, , ','), 0) /*remove commas from normalized integer*/\n nulla= 'ZEPHIRUM NULLAE NULLA NIHIL' /*Roman words for \"nothing\" or \"none\". */\n if n==0 then return word(nulla, 1) /*return a Roman word for \"zero\". */\n maxnp=(length(n)-1)%3 /*find max(+1) # of parenthesis to use.*/\n highPos=(maxnp+1)*3 /*highest position of number. */\n nn=reverse( right(n, highPos, 0) ) /*digits for Arabic──►Roman conversion.*/\n do j=highPos to 1 by -3\n _=substr(nn, j, 1); select /*════════════════════hundreds.*/\n when _==9 then hx='CM'\n when _>=5 then hx='D'copies(\"C\", _-5)\n when _==4 then hx='CD'\n otherwise hx= copies('C', _)\n end /*select hundreds*/\n _=substr(nn, j-1, 1); select /*════════════════════════tens.*/\n when _==9 then tx='XC'\n when _>=5 then tx='L'copies(\"X\", _-5)\n when _==4 then tx='XL'\n otherwise tx= copies('X', _)\n end /*select tens*/\n _=substr(nn, j-2, 1); select /*═══════════════════════units.*/\n when _==9 then ux='IX'\n when _>=5 then ux='V'copies(\"I\", _-5)\n when _==4 then ux='IV'\n otherwise ux= copies('I', _)\n end /*select units*/\n $=hx || tx || ux\n if $\\=='' then #=# || copies(\"(\", (j-1)%3)$ ||copies(')', (j-1)%3)\n end /*j*/\n if pos('(I',#)\\==0 then do i=1 for 4 /*special case: M,MM,MMM,MMMM.*/\n if i==4 then _ = '(IV)'\n else _ = '('copies(\"I\", i)')'\n if pos(_, #)\\==0 then #=changestr(_, #, copies('M', i))\n end /*i*/\n return #\n","language":"REXX"},{"code":"arabic = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\nroman = [\"M\", \"CM\", \"D\", \"CD\", \"C\" ,\"XC\", \"L\", \"XL\" ,\"X\", \"IX\", \"V\", \"IV\", \"I\"]\n\nsee \"2009 = \" + toRoman(2009) + nl\nsee \"1666 = \" + toRoman(1666) + nl\nsee \"3888 = \" + toRoman(3888) + nl\n\nfunc toRoman val\n result = \"\"\n for i = 1 to 13\n while val >= arabic[i]\n result = result + roman[i]\n val = val - arabic[i]\n end\n next\n return result\n","language":"Ring"},{"code":"Symbols = { 1=>'I', 5=>'V', 10=>'X', 50=>'L', 100=>'C', 500=>'D', 1000=>'M' }\nSubtractors = [ [1000, 100], [500, 100], [100, 10], [50, 10], [10, 1], [5, 1], [1, 0] ]\n\ndef roman(num)\n return Symbols[num] if Symbols.has_key?(num)\n Subtractors.each do |cutPoint, subtractor|\n return roman(cutPoint) + roman(num - cutPoint) if num > cutPoint\n return roman(subtractor) + roman(num + subtractor) if num >= cutPoint - subtractor and num < cutPoint\n end\nend\n\n[1990, 2008, 1666].each do |i|\n puts \"%4d => %s\" % [i, roman(i)]\nend\n","language":"Ruby"},{"code":"Symbols = [ [1000, 'M'], [900, 'CM'], [500, 'D'], [400, 'CD'], [100, 'C'], [90, 'XC'], [50, 'L'], [40, 'XL'], [10, 'X'], [9, 'IX'], [5, 'V'], [4, 'IV'], [1, 'I'] ]\n\ndef arabic_to_roman(arabic)\n return '' if arabic.zero?\n Symbols.each { |arabic_rep, roman_rep| return roman_rep + arabic_to_roman(arabic - arabic_rep) if arabic >= arabic_rep }\nend\n","language":"Ruby"},{"code":"Symbols = [ [1000, 'M'], [900, 'CM'], [500, 'D'], [400, 'CD'], [100, 'C'], [90, 'XC'], [50, 'L'], [40, 'XL'], [10, 'X'], [9, 'IX'], [5, 'V'], [4, 'IV'], [1, 'I'] ]\n\ndef to_roman(num)\n Symbols.reduce \"\" do |memo, (divisor, letter)|\n div, num = num.divmod(divisor)\n memo + letter * div\n end\nend\n","language":"Ruby"},{"code":"[loop]\ninput \"Input value:\";val$\nprint roman$(val$)\ngoto [loop]\n\n' ------------------------------\n' Roman numerals\n' ------------------------------\nFUNCTION roman$(val$)\na2r$ = \"M:1000,CM:900,D:500,CD:400,C:100,XC:90,L:50,XL:40,X:10,IX:9,V:5,IV:4,I:1\"\nv = val(val$)\nfor i = 1 to 13\n r$ = word$(a2r$,i,\",\")\n a = val(word$(r$,2,\":\"))\n while v >= a\n roman$ = roman$ + word$(r$,1,\":\")\n v = v - a\n wend\nnext i\nEND FUNCTION\n","language":"Run-BASIC"},{"code":"struct RomanNumeral {\n symbol: &'static str,\n value: u32\n}\n\nconst NUMERALS: [RomanNumeral; 13] = [\n RomanNumeral {symbol: \"M\", value: 1000},\n RomanNumeral {symbol: \"CM\", value: 900},\n RomanNumeral {symbol: \"D\", value: 500},\n RomanNumeral {symbol: \"CD\", value: 400},\n RomanNumeral {symbol: \"C\", value: 100},\n RomanNumeral {symbol: \"XC\", value: 90},\n RomanNumeral {symbol: \"L\", value: 50},\n RomanNumeral {symbol: \"XL\", value: 40},\n RomanNumeral {symbol: \"X\", value: 10},\n RomanNumeral {symbol: \"IX\", value: 9},\n RomanNumeral {symbol: \"V\", value: 5},\n RomanNumeral {symbol: \"IV\", value: 4},\n RomanNumeral {symbol: \"I\", value: 1}\n];\n\nfn to_roman(mut number: u32) -> String {\n let mut min_numeral = String::new();\n for numeral in NUMERALS.iter() {\n while numeral.value <= number {\n min_numeral = min_numeral + numeral.symbol;\n number -= numeral.value;\n }\n }\n min_numeral\n}\n\nfn main() {\n let nums = [2014, 1999, 25, 1666, 3888];\n for &n in nums.iter() {\n // 4 is minimum printing width, for alignment\n println!(\"{:2$} = {}\", n, to_roman(n), 4);\n }\n}\n","language":"Rust"},{"code":"val romanDigits = Map(\n 1 -> \"I\", 5 -> \"V\",\n 10 -> \"X\", 50 -> \"L\",\n 100 -> \"C\", 500 -> \"D\",\n 1000 -> \"M\",\n 4 -> \"IV\", 9 -> \"IX\",\n 40 -> \"XL\", 90 -> \"XC\",\n 400 -> \"CD\", 900 -> \"CM\")\nval romanDigitsKeys = romanDigits.keysIterator.toList sortBy (x => -x)\ndef toRoman(n: Int): String = romanDigitsKeys find (_ >= n) match {\n case Some(key) => romanDigits(key) + toRoman(n - key)\n case None => \"\"\n}\n","language":"Scala"},{"code":"def toRoman( v:Int ) : String = {\n val romanNumerals = List(1000->\"M\",900->\"CM\",500->\"D\",400->\"CD\",100->\"C\",90->\"XC\",\n 50->\"L\",40->\"XL\",10->\"X\",9->\"IX\",5->\"V\",4->\"IV\",1->\"I\")\t\n\n var n = v\n romanNumerals.foldLeft(\"\"){(s,t) => {val c = n/t._1; n = n-t._1*c; s + (t._2 * c) } }\n}\n\n// A small test\ndef test( arabic:Int ) = println( arabic + \" => \" + toRoman( arabic ) )\n\ntest(1990)\ntest(2008)\ntest(1666)\n","language":"Scala"},{"code":"def toRoman(num: Int): String = {\n case class RomanUnit(value: Int, token: String)\n val romanNumerals = List(\n RomanUnit(1000, \"M\"),\n RomanUnit(900, \"CM\"),\n RomanUnit(500, \"D\"),\n RomanUnit(400, \"CD\"),\n RomanUnit(100, \"C\"),\n RomanUnit(90, \"XC\"),\n RomanUnit(50, \"L\"),\n RomanUnit(40, \"XL\"),\n RomanUnit(10, \"X\"),\n RomanUnit(9, \"IX\"),\n RomanUnit(5, \"V\"),\n RomanUnit(4, \"IV\"),\n RomanUnit(1, \"I\"))\n\n var remainingNumber = num\n romanNumerals.foldLeft(\"\") { (outputStr, romanUnit) =>\n {\n val times = remainingNumber / romanUnit.value\n remainingNumber -= romanUnit.value * times\n outputStr + (romanUnit.token * times)\n }\n }\n}\n","language":"Scala"},{"code":"(define (to-roman n)\n (format \"~@r\" n))\n","language":"Scheme"},{"code":"(define roman-decimal\n '((\"M\" . 1000)\n (\"CM\" . 900)\n (\"D\" . 500)\n (\"CD\" . 400)\n (\"C\" . 100)\n (\"XC\" . 90)\n (\"L\" . 50)\n (\"XL\" . 40)\n (\"X\" . 10)\n (\"IX\" . 9)\n (\"V\" . 5)\n (\"IV\" . 4)\n (\"I\" . 1)))\n\n(define (to-roman value)\n (apply string-append\n (let loop ((v value)\n (decode roman-decimal))\n (let ((r (caar decode))\n (d (cdar decode)))\n (cond\n ((= v 0) '())\n ((>= v d) (cons r (loop (- v d) decode)))\n (else (loop v (cdr decode))))))))\n\n\n(let loop ((n '(1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 25 30 40\n 50 60 69 70 80 90 99 100 200 300 400 500 600 666 700 800 900\n 1000 1009 1444 1666 1945 1997 1999 2000 2008 2010 2011 2500\n 3000 3999)))\n (unless (null? n)\n (printf \"~a ~a\\n\" (car n) (to-roman (car n)))\n (loop (cdr n))))\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n include \"stdio.s7i\";\n include \"wrinum.s7i\";\n\nconst proc: main is func\n local\n var integer: number is 0;\n begin\n for number range 1 to 3999 do\n writeln(str(ROMAN, number));\n end for;\n end func;\n","language":"Seed7"},{"code":"function RomanNumeralsEncode number\n\tput [\n\t\t(1, \"I\"),\n\t\t(4, \"IV\"),\n\t\t(5, \"V\"),\n\t\t(9, \"IX\"),\n\t\t(10, \"X\"),\n\t\t(40, \"XL\"),\n\t\t(50, \"L\"),\n\t\t(90, \"XC\"),\n\t\t(100, \"C\"),\n\t\t(400, \"CD\"),\n\t\t(500, \"D\"),\n\t\t(900, \"CM\"),\n\t\t(1000, \"M\")\n\t] into values\n\t\n\t\n\trepeat for index = each item of (the number of items in values)..1\n\t\tput item index of values into pair\n\t\trepeat while number is greater than or equal to the first item of pair\n\t\t\tput the second item of pair after numerals\n\t\t\tsubtract the first item of pair from number\n\t\tend repeat\n\tend repeat\n\treturn numerals\nend RomanNumeralsEncode\n","language":"SenseTalk"},{"code":"repeat for each item in [\n\t1990,\n\t2008,\n\t1666\t\n]\n\tput RomanNumeralsEncode(it)\nend repeat\n","language":"SenseTalk"},{"code":"examples := [2008, 1666, 1990];\n\nfor example in examples loop\n print( roman_numeral(example) );\nend loop;\n\nproc roman_numeral( n );\n R := [[1000, 'M'], [900, 'CM'], [500, 'D'], [400, 'CD'], [100, 'C'], [90, 'XC'], [50, 'L'], [40, 'XL'], [10, 'X'], [9, 'IX'], [5, 'V'], [4, 'IV'], [1, 'I']];\n roman := '';\n for numeral in R loop\n while n >= numeral(1) loop\n n := n - numeral(1);\n roman := roman + numeral(2);\n end loop;\n end loop;\n return roman;\nend;\n","language":"SETL"},{"code":"(define encodeGlyphs\n ACC 0 _ -> ACC\n ACC N [Glyph Value | Rest] -> (encodeGlyphs (@s ACC Glyph) (- N Value) [Glyph Value | Rest]) where (>= N Value)\n ACC N [Glyph Value | Rest] -> (encodeGlyphs ACC N Rest)\n)\n\n(define encodeRoman\n N -> (encodeGlyphs \"\" N [\"M\" 1000 \"CM\" 900 \"D\" 500 \"CD\" 400 \"C\" 100 \"XC\" 90 \"L\" 50 \"XL\" 40 \"X\" 10 \"IX\" 9 \"V\" 5 \"IV\" 4 \"I\" 1])\n)\n","language":"Shen"},{"code":"func arabic2roman(num, roman='') {\n static lookup = [\n :M:1000, :CM:900, :D:500,\n :CD:400, :C:100, :XC:90,\n :L:50, :XL:40, :X:10,\n :IX:9, :V:5, :IV:4,\n :I:1\n ];\n lookup.each { |pair|\n while (num >= pair.second) {\n roman += pair.first;\n num -= pair.second;\n }\n }\n return roman;\n}\nsay(\"1990 in roman is \" + arabic2roman(1990));\nsay(\"2008 in roman is \" + arabic2roman(2008));\nsay(\"1666 in roman is \" + arabic2roman(1666));\n","language":"Sidef"},{"code":"BEGIN\n\n TEXT PROCEDURE TOROMAN(N); INTEGER N;\n BEGIN\n PROCEDURE P(WEIGHT,LIT); INTEGER WEIGHT; TEXT LIT;\n BEGIN\n WHILE N >= WEIGHT DO\n BEGIN\n T :- T & LIT;\n N := N - WEIGHT;\n END WHILE;\n END P;\n TEXT T; T :- NOTEXT;\n P( 1000, \"M\" );\n P( 900, \"CM\" );\n P( 500, \"D\" );\n P( 400, \"CD\" );\n P( 100, \"C\" );\n P( 90, \"XC\" );\n P( 50, \"L\" );\n P( 40, \"XL\" );\n P( 10, \"X\" );\n P( 9, \"IX\" );\n P( 5, \"V\" );\n P( 4, \"IV\" );\n P( 1, \"I\" );\n TOROMAN :- T;\n END TOROMAN;\n\n INTEGER Y;\n FOR Y := 1990, 2008, 1666 DO\n BEGIN\n OUTTEXT(\"YEAR \");\n OUTINT(Y, 4);\n OUTTEXT(\" => \");\n OUTTEXT(TOROMAN(Y));\n OUTIMAGE;\n END FOR;\n\nEND PROGRAM;\n","language":"Simula"},{"code":"2013 printRomanOn:Stdout naive:false\n","language":"Smalltalk"},{"code":"printRomanOn:aStream naive:naive\n \"print the receiver as roman number to the argument, aStream.\n The naive argument controls if the conversion is\n correct (i.e. subtracting prefix notation for 4,9,40,90, etc.),\n or naive (i.e. print 4 as IIII and 9 as VIIII); also called simple.\n The naive version is often used for page numbers in documents.\"\n\n |restValue spec|\n\n restValue := self.\n restValue > 0 ifFalse:[self error:'negative roman'].\n\n naive ifTrue:[\n spec := #(\n \" value string repeat \"\n 1000 'M' true\n 500 'D' false\n 100 'C' true\n 50 'L' false\n 10 'X' true\n 5 'V' false\n 1 'I' true\n ).\n ] ifFalse:[\n spec := #(\n \" value string repeat \"\n 1000 'M' true\n 900 'CM' false\n 500 'D' false\n 400 'CD' false\n 100 'C' true\n 90 'XC' false\n 50 'L' false\n 40 'XL' false\n 10 'X' true\n 9 'IX' false\n 5 'V' false\n 4 'IV' false\n 1 'I' true\n ).\n ].\n\n spec\n inGroupsOf:3\n do:[:rValue :rString :repeatFlag |\n\n [\n (restValue >= rValue) ifTrue:[\n aStream nextPutAll:rString.\n restValue := restValue - rValue.\n ].\n ] doWhile:[ repeatFlag and:[ restValue >= rValue] ].\n ].\n","language":"Smalltalk"},{"code":"* ROMAN(N) - Convert integer N to Roman numeral form.\n*\n* N must be positive and less than 4000.\n*\n* An asterisk appears in the result if N >= 4000.\n*\n* The function fails if N is not an integer.\n\n\tDEFINE('ROMAN(N)UNITS') :(ROMAN_END)\n\n* Get rightmost digit to UNITS and remove it from N.\n* Return null result if argument is null.\nROMAN\tN RPOS(1) LEN(1) . UNITS = :F(RETURN)\n\n* Search for digit, replace with its Roman form.\n* Return failing if not a digit.\n\t'0,1I,2II,3III,4IV,5V,6VI,7VII,8VIII,9IX,' UNITS\n+\tBREAK(',') . UNITS :F(FRETURN)\n\n* Convert rest of N and multiply by 10. Propagate a\n* failure return from recursive call back to caller.\n\tROMAN = REPLACE(ROMAN(N), 'IVXLCDM', 'XLCDM**')\n+\tUNITS :S(RETURN) F(FRETURN)\nROMAN_END\n\n*\tTesting\n\tOUTPUT = \"1999 = \" ROMAN(1999)\n\tOUTPUT = \" 24 = \" ROMAN(24)\n\tOUTPUT = \" 944 = \" ROMAN(944)\n\nEND\n","language":"SNOBOL4"},{"code":"* # Arabic to Roman\n define('roman(n)s,ch,val,str') :(roman_end)\nroman roman = ge(n,4000) n :s(return)\n s = 'M1000 CM900 D500 CD400 C100 XC90 L50 XL40 X10 IX9 V5 IV4 I1 '\nrom1 s span(&ucase) . ch break(' ') . val span(' ') = :f(rom2)\n str = str dupl(ch,(n / val))\n n = remdr(n,val) :(rom1)\nrom2 roman = str :(return)\nroman_end\n\n* # Roman to Arabic\n define('arabic(n)s,ch,val,sum,x') :(arabic_end)\narabic s = 'M1000 D500 C100 L50 X10 V5 I1 '\n n = reverse(n)\narab1 n len(1) . ch = :f(arab2)\n s ch break(' ') . val\n val = lt(val,x) (-1 * val)\n sum = sum + val; x = val :(arab1)\narab2 arabic = sum :(return)\narabic_end\n\n* # Test and display\n tstr = '2010 1999 1492 1066 476 '\ntloop tstr break(' ') . year span(' ') = :f(out)\n r = roman(year)\n rstr = rstr year '=' r ' '\n astr = astr r '=' arabic(r) ' ' :(tloop)\nout output = rstr; output = astr\nend\n","language":"SNOBOL4"},{"code":"a2r(a)=\n r = \"\"\n n = [[\"M\",\"CM\",\"D\",\"CD\",\"C\",\"XC\",\"L\",\"XL\",\"X\",\"IX\",\"V\",\"IV\",\"I\"],[1000,900,500,400,100,90,50,40,10,9,5,4,1]]\n > i, 1..13\n > a!<n[i,2]\n r += n[i,1]\n a -= n[i,2]\n <\n <\n <= r\n.\n\nt = [1990,2008,1666]\n> i, 1..#.size(t,1)\n #.output(t[i],\" = \",a2r(t[i]))\n<\n","language":"SPL"},{"code":"--\n-- This only works under Oracle and has the limitation of 1 to 3999\n\n\nSQL> select to_char(1666, 'RN') urcoman, to_char(1666, 'rn') lcroman from dual;\n\nURCOMAN LCROMAN\n--------------- ---------------\n MDCLXVI mdclxvi\n","language":"SQL"},{"code":"func ator(var n: Int) -> String {\n\n var result = \"\"\n\n for (value, letter) in\n [( 1000, \"M\"),\n ( 900, \"CM\"),\n ( 500, \"D\"),\n ( 400, \"CD\"),\n ( 100, \"C\"),\n ( 90, \"XC\"),\n ( 50, \"L\"),\n ( 40, \"XL\"),\n ( 10, \"X\"),\n ( 9, \"IX\"),\n ( 5, \"V\"),\n ( 4, \"IV\"),\n ( 1, \"I\")]\n {\n while n >= value {\n result += letter\n n -= value\n }\n }\n return result\n}\n","language":"Swift"},{"code":"println(ator(1666)) // MDCLXVI\n","language":"Swift"},{"code":"print(ator(1666)) // MDCLXVI\n","language":"Swift"},{"code":"def digits: [(M:1000\"1\"), (CM:900\"1\"), (D:500\"1\"), (CD:400\"1\"), (C:100\"1\"), (XC:90\"1\"), (L:50\"1\"), (XL:40\"1\"), (X:10\"1\"), (IX:9\"1\"), (V:5\"1\"), (IV:4\"1\"), (I:1\"1\")];\ntemplates encodeRoman\n @: 1;\n '$ -> ($)\"1\" -> #;' !\n when <$digits($@)::value..> do\n $digits($@)::key !\n $ - $digits($@)::value -> #\n when <1\"1\"..> do\n @:$@ + 1;\n $ -> #\nend encodeRoman\n\n1990 -> encodeRoman -> !OUT::write\n'\n' -> !OUT::write\n2008 -> encodeRoman -> !OUT::write\n'\n' -> !OUT::write\n1666 -> encodeRoman -> !OUT::write\n","language":"Tailspin"},{"code":"proc to_roman {i} {\n set map {1000 M 900 CM 500 D 400 CD 100 C 90 XC 50 L 40 XL 10 X 9 IX 5 V 4 IV 1 I}\n foreach {value roman} $map {\n while {$i >= $value} {\n append res $roman\n incr i -$value\n }\n }\n return $res\n}\n","language":"Tcl"},{"code":"PROGRAM:DEC2ROM\n:\"=\"→Str1\n:Lbl ST\n:ClrHome\n:Disp \"NUMBER TO\"\n:Disp \"CONVERT:\"\n:Input A\n:If fPart(A) or A≠abs(A)\n:Then\n:Goto PI\n:End\n:A→B\n:While B≥1000\n:Str1+\"M\"→Str1\n:B-1000→B\n:End\n:If B≥900\n:Then\n:Str1+\"CM\"→Str1\n:B-900→B\n:End\n:If B≥500\n:Then\n:Str1+\"D\"→Str1\n:B-500→B\n:End\n:If B≥400\n:Then\n:Str1+\"CD\"?Str1\n:B-400→B\n:End\n:While B≥100\n:Str1+\"C\"→Str1\n:B-100→B\n:End\n:If B≥90\n:Then\n:Str1+\"XC\"→Str1\n:B-90→B\n:End\n:If B≥50\n:Then\n:Str1+\"L\"→Str1\n:B-50→B\n:End\n:If B≥40\n:Then\n:Str1+\"XL\"→Str1\n:B-40→B\n:End\n:While B≥10\n:Str1+\"X\"→Str1\n:B-10→B\n:End\n:If B≥9\n:Then\n:Str1+\"IX\"→Str1\n:B-9→B\n:End\n:If B≥5\n:Then\n:Str1+\"V\"→Str1\n:B-5→B\n:End\n:If B≥4\n:Then\n:Str1+\"IV\"→Str1\n:B-4→B\n:End\n:While B>0\n:Str1+\"I\"→Str1\n:B-1→B\n:End\n:ClrHome\n:Disp A\n:Disp Str1\n:Stop\n:Lbl PI\n:ClrHome\n:Disp \"THE NUMBER MUST\"\n:Disp \"BE A POSITIVE\"\n:Disp \"INTEGER.\"\n:Pause\n:Goto ST\n","language":"TI-83-BASIC"},{"code":"OPTION BASE 0\nDIM arabic(12), roman$(12)\n\nFOR i = 0 to 12\n READ arabic(i), roman$(i)\nNEXT i\n\nDATA 1000, \"M\", 900, \"CM\", 500, \"D\", 400, \"CD\", 100, \"C\", 90, \"XC\"\nDATA 50, \"L\", 40, \"XL\", 10, \"X\", 9, \"IX\", 5, \"V\", 4, \"IV\", 1, \"I\"\n\nFUNCTION toRoman$(value)\n LET result$ = \"\"\n FOR i = 0 TO 12\n DO WHILE value >= arabic(i)\n LET result$ = result$ & roman$(i)\n LET value = value - arabic(i)\n LOOP\n NEXT i\n LET toRoman$ = result$\nEND FUNCTION\n\n!Testing\nPRINT \"2009 = \"; toRoman$(2009)\nPRINT \"1666 = \"; toRoman$(1666)\nPRINT \"3888 = \"; toRoman$(3888)\nEND\n","language":"True-BASIC"},{"code":"$$ MODE TUSCRIPT\nLOOP arab_number=\"1990'2008'1666\"\nroman_number = ENCODE (arab_number,ROMAN)\nPRINT \"Arabic number \",arab_number, \" equals \", roman_number\nENDLOOP\n","language":"TUSCRIPT"},{"code":"// Roman numerals/Encode\n\nconst weightsSymbols: [number, string][] =\n [[1000, 'M'], [900, 'CM'], [500, 'D'], [400, 'CD'], [100, 'C'], [90, 'XC'],\n [50, 'L'], [40, 'XL'], [10, 'X'], [9, 'IX'], [5, 'V'], [4, 'IV'], [1, 'I']];\n// 3888 or MMMDCCCLXXXVIII (15 chars) is the longest string properly encoded\n// with these symbols.\n\nfunction toRoman(n: number): string {\n var roman = \"\"; // Result\n for (i = 0; i <= 12 && n > 0; i++) {\n var w = weightsSymbols[i][0];\n while (n >= w) {\n roman += weightsSymbols[i][1];\n n -= w;\n }\n }\n return roman;\n}\n\nconsole.log(toRoman(1990)); // MCMXC\nconsole.log(toRoman(2022)); // MMXXII\nconsole.log(toRoman(3888)); // MMMDCCCLXXXVIII\n","language":"TypeScript"},{"code":"roman() {\n local values=( 1000 900 500 400 100 90 50 40 10 9 5 4 1 )\n local roman=(\n [1000]=M [900]=CM [500]=D [400]=CD\n [100]=C [90]=XC [50]=L [40]=XL\n [10]=X [9]=IX [5]=V [4]=IV\n [1]=I\n )\n local nvmber=\"\"\n local num=$1\n for value in ${values[@]}; do\n while (( num >= value )); do\n nvmber+=${roman[value]}\n ((num -= value))\n done\n done\n echo $nvmber\n}\n\nfor test in 1999 24 944 1666 2008; do\n printf \"%d = %s\\n\" $test $(roman $test)\ndone\n","language":"UNIX-Shell"},{"code":"#import nat\n\nroman =\n\n-+\n 'IIII'%='IV'+ 'VIIII'%='IX'+ 'XXXX'%='XL'+ 'LXXXX'%='XC'+ 'CCCC'%='CD'+ 'DCCCC'%='CM',\n ~&plrDlSPSL/'MDCLXVI'+ iota*+ +^|(^|C/~&,\\/division)@rlX=>~&iNC <1000,500,100,50,10,5>+-\n","language":"Ursala"},{"code":"#show+\n\ntest = roman* <1990,2008,1,2,64,124,1666,10001>\n","language":"Ursala"},{"code":"const numerals = {1000:\"M\", 900:\"CM\", 500:\"D\", 400:\"CD\", 100:\"C\",\n 90:\"XC\", 50:\"L\", 40: \"XL\", 10:\"X\", 9:\"IX\", 5:\"V\", 4:\"IV\", 1:\"I\"}\n\nfn main() {\n println(encode(1990))\n println(encode(2008))\n println(encode(1666))\n}\n\nfn encode(number int) string {\n mut num := number\n mut result := \"\"\n if number < 1 || number > 5000 {return result}\n for digit, roman in numerals {\n for num >= digit {\n num -= digit\n result += roman\n }\n }\n return result\n}\n","language":"V-(Vlang)"},{"code":"string to_roman(int n)\n requires (n > 0 && n < 5000)\n{\n const int[] weights = {1000, 900, 500, 400, 100, 90,\n 50, 40, 10, 9, 5, 4, 1};\n const string[] symbols = {\"M\",\"CM\",\"D\",\"CD\",\"C\",\"XC\",\"L\",\n \"XL\",\"X\",\"IX\",\"V\",\"IV\",\"I\"};\n\n var roman = \"\", count = 0;\n foreach (var w in weights) {\n while (n >= w) {\n roman += symbols[count];\n n -= w;\n }\n if (n == 0)\n break;\n count++;\n }\n return roman;\n}\n\nvoid main() {\n print(\"%s\\n\", to_roman(455));\n print(\"%s\\n\", to_roman(3456));\n print(\"%s\\n\", to_roman(2488));\n}\n","language":"Vala"},{"code":"Private Function roman(n As Integer) As String\n roman = WorksheetFunction.roman(n)\nEnd Function\nPublic Sub main()\n s = [{10, 2016, 800, 2769, 1666, 476, 1453}]\n For Each x In s\n Debug.Print roman(CInt(x)); \" \";\n Next x\nEnd Sub\n","language":"VBA"},{"code":"// Main program for testing the function\n//\ndo {\n #1 = Get_Num(\"Number to convert: \", STATLINE)\n Call(\"NUM_TO_ROMAN\")\n Num_Type(#1, NOCR) Message(\" = \") Reg_Type(1) Type_Newline\n} while (Reg_Size(1))\nReturn\n\n// Convert numeric value into Roman number\n// #1 = number to convert; on return: T-reg(1) = Roman number\n//\n:NUM_TO_ROMAN:\n Reg_Empty(1) // @1 = Results (Roman number)\n if (#1 < 1) { Return } // non-positive numbers return empty string\n\n Buf_Switch(Buf_Free)\n Ins_Text(\"M1000,CM900,D500,CD400,C100,XC90,L50,XL40,X10,IX9,V5,IV4,I1\")\n\n BOF\n #2 = #1\n Repeat(ALL) {\n Search(\"|A|[|A]\", ADVANCE+ERRBREAK) // get next item from conversion list\n Reg_Copy_Block(20, CP-Chars_Matched, CP) // @20 = Letter(s) to be inserted\n #11 = Num_Eval() // #11 = magnitude (1000...1)\n while (#2 >= #11) {\n Reg_Set(1, @20, APPEND)\n #2 -= #11\n }\n }\n Buf_Quit(OK)\nReturn\n","language":"Vedit-macro-language"},{"code":"Function toRoman(value) As String\n Dim arabic As Variant\n Dim roman As Variant\n\n arabic = Array(1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1)\n roman = Array(\"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\")\n\n Dim i As Integer, result As String\n\n For i = 0 To 12\n Do While value >= arabic(i)\n result = result + roman(i)\n value = value - arabic(i)\n Loop\n Next i\n\n toRoman = result\nEnd Function\n\nSub Main()\n MsgBox toRoman(Val(InputBox(\"Number, please\")))\nEnd Sub\n","language":"Visual-Basic"},{"code":"var romans = [\n [1000, \"M\"],\n [900, \"CM\"],\n [500, \"D\"],\n [400, \"CD\"],\n [100, \"C\"],\n [90, \"XC\"],\n [50, \"L\"],\n [40, \"XL\"],\n [10, \"X\"],\n [9, \"IX\"],\n [5, \"V\"],\n [4, \"IV\"],\n [1, \"I\"]\n]\n\nvar encode = Fn.new { |n|\n if (n > 5000 || n < 1) return null\n var res = \"\"\n for (r in romans) {\n while (n >= r[0]) {\n n = n - r[0]\n res = res + r[1]\n }\n }\n return res\n}\n\nSystem.print(encode.call(1990))\nSystem.print(encode.call(1666))\nSystem.print(encode.call(2008))\nSystem.print(encode.call(2020))\n","language":"Wren"},{"code":"PROGRAM \"romanenc\"\nVERSION \"0.0000\"\n\nDECLARE FUNCTION Entry()\nINTERNAL FUNCTION ToRoman$(aValue%%)\n\n' 3888 or MMMDCCCLXXXVIII (15 chars) is the longest string properly encoded with these symbols.\n\nFUNCTION Entry()\n PRINT ToRoman$(1990) ' MCMXC\n PRINT ToRoman$(2018) ' MMXVIII\n PRINT ToRoman$(3888) ' MMMDCCCLXXXVIII\nEND FUNCTION\n\nFUNCTION ToRoman$(aValue%%)\n DIM weights%%[12]\n DIM symbols$[12]\n\n weights%%[0] = 1000\n weights%%[1] = 900\n weights%%[2] = 500\n weights%%[3] = 400\n weights%%[4] = 100\n weights%%[5] = 90\n weights%%[6] = 50\n weights%%[7] = 40\n weights%%[8] = 10\n weights%%[9] = 9\n weights%%[10] = 5\n weights%%[11] = 4\n weights%%[12] = 1\n\n symbols$[0] = \"M\"\n symbols$[1] = \"CM\"\n symbols$[2] = \"D\"\n symbols$[3] = \"CD\"\n symbols$[4] = \"C\"\n symbols$[5] = \"XC\"\n symbols$[6] = \"L\"\n symbols$[7] = \"XL\"\n symbols$[8] = \"X\"\n symbols$[9] = \"IX\"\n symbols$[10] = \"V\"\n symbols$[11] = \"IV\"\n symbols$[12] = \"I\"\n\n destination$ = \"\"\n i@@ = 0\n DO WHILE (i@@ <= 12) AND (aValue%% > 0)\n DO WHILE aValue%% >= weights%%[i@@]\n destination$ = destination$ + symbols$[i@@]\n aValue%% = aValue%% - weights%%[i@@]\n LOOP\n i@@ = i@@ + 1\n LOOP\n RETURN destination$\nEND FUNCTION\nEND PROGRAM\n","language":"XBasic"},{"code":"(defun roman (n)\n (define roman-numerals '((1000 \"m\") (900 \"cm\") (500 \"d\") (400 \"cd\") (100 \"c\") (90 \"xc\") (50 \"l\") (40 \"xl\") (10 \"x\") (9 \"ix\") (5 \"v\") (4 \"iv\") (1 \"i\")))\n (defun romanize (arabic-numeral numerals roman-numeral)\n (if (= arabic-numeral 0)\n roman-numeral\n (if (>= arabic-numeral (caar numerals))\n (romanize (- arabic-numeral (caar numerals)) numerals (string-append roman-numeral (cadar numerals)))\n (romanize arabic-numeral (cdr numerals) roman-numeral))))\n (romanize n roman-numerals \"\"))\n\n; test the function:\n(display (mapcar roman '(10 2016 800 2769 1666 476 1453)))\n","language":"XLISP"},{"code":"proc Rom(N, A, B, C); \\Display 1..9 in Roman numerals\nint N, A, B, C, I;\n[case N of\n9: [ChOut(0, C); ChOut(0, A)]; \\XI\n8,7,6,5:[ChOut(0, B); for I:= 1 to rem(N/5) do ChOut(0, C)]; \\V\n4: [ChOut(0, C); ChOut(0, B)] \\IV\nother for I:= 1 to N do ChOut(0, C); \\I\n];\n\nproc Roman(N); \\Display N in Roman numerals\nint N, Q;\n[Q:= N/1000; N:= rem(0); \\0..3999\nRom(Q, ^?, ^?, ^M);\nQ:= N/100; N:= rem(0); \\0..999\nRom(Q, ^M, ^D, ^C);\nQ:= N/10; N:= rem(0); \\0..99\nRom(Q, ^C, ^L, ^X);\nRom(N, ^X, ^V, ^I); \\0..9\n];\n\nint Tbl, I;\n[Tbl:= [1990, 2008, 1666, 0, 1, 3999, 2020, 1234];\nfor I:= 0 to 7 do\n [IntOut(0, Tbl(I)); Text(0, \". \"); Roman(Tbl(I)); CrLf(0)];\n]\n","language":"XPL0"},{"code":"<xsl:stylesheet version=\"1.0\" xmlns:xsl=\"http://www.w3.org/1999/XSL/Transform\">\n <xsl:template match=\"/data/number\">\n <xsl:call-template name=\"for\">\n <xsl:with-param name=\"stop\">13</xsl:with-param>\n \t<xsl:with-param name=\"value\"><xsl:value-of select=\"@value\"></xsl:value-of></xsl:with-param>\n </xsl:call-template>\n </xsl:template>\n\n <xsl:template name=\"for\">\n <xsl:param name=\"start\">1</xsl:param>\n <xsl:param name=\"stop\">1</xsl:param>\n <xsl:param name=\"step\">1</xsl:param>\n <xsl:param name=\"value\">1</xsl:param>\n <xsl:text/>\n <xsl:choose>\n <xsl:when test=\"($value > /data/roman\n/numeral[@pos=$start]/@value or $value = /data/roman\n/numeral[@pos=$start]/@value) \">\n <xsl:value-of select=\"/data/roman\n/numeral[@pos=$start]/@letter\"/>\n <xsl:call-template name=\"for\">\n <xsl:with-param name=\"stop\">\n <xsl:value-of select=\"$stop\"/>\n </xsl:with-param>\n <xsl:with-param name=\"start\">\n <xsl:value-of select=\"$start\"/>\n </xsl:with-param>\n <xsl:with-param name=\"value\">\n \t<xsl:value-of select=\"$value - /data/roman/numeral[@pos=$start]/@value\"/>\n </xsl:with-param>\n </xsl:call-template>\n </xsl:when>\n <xsl:otherwise>\n <xsl:if test=\"$start < $stop\">\n <xsl:call-template name=\"for\">\n <xsl:with-param name=\"stop\">\n <xsl:value-of select=\"$stop\"/>\n </xsl:with-param>\n <xsl:with-param name=\"start\">\n <xsl:value-of select=\"$start + $step\"/>\n </xsl:with-param>\n <xsl:with-param name=\"value\">\n \t<xsl:value-of select=\"$value\"/>\n </xsl:with-param>\n </xsl:call-template>\n </xsl:if>\n </xsl:otherwise>\n </xsl:choose>\n </xsl:template>\n</xsl:stylesheet>\n","language":"XSLT"},{"code":"roman$ = \"M, CM, D, CD, C, XC, L, XL, X, IX, V, IV, I\"\ndecml$ = \"1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1\"\n\nsub toRoman$(value)\n local res$, i, roman$(1), decml$(1), long\n\t\n long = token(roman$, roman$(), \", \")\n long = token(decml$, decml$(), \", \")\n\t\n for i=1 to long\n while(value >= val(decml$(i)))\n res$ = res$ + roman$(i)\n value = value - val(decml$(i))\n wend\n next i\n return res$\nend sub\n\nprint 400, \" \", toRoman$(400)\nprint 1990, \" \", toRoman$(1990)\nprint 2008, \" \", toRoman$(2008)\nprint 2009, \" \", toRoman$(2009)\nprint 1666, \" \", toRoman$(1666)\nprint 3888, \" \", toRoman$(3888)\n//Output:\n// 400 = CD\n// 1990 = MCMXC\n// 2008 = MMVIII\n// 2009 = MMIX\n// 1666 = MDCLXVI\n// 3888 = MMMDCCCLXXXVIII\n","language":"Yabasic"},{"code":"var [const] romans = L(\n L(\"M\", 1000), L(\"CM\", 900), L(\"D\", 500), L(\"CD\", 400), L(\"C\", 100),\n L(\"XC\", 90), L(\"L\", 50), L(\"XL\", 40), L(\"X\", 10), L(\"IX\", 9),\n L(\"V\", 5), L(\"IV\", 4), L(\"I\", 1));\nfcn toRoman(i){\t\t// convert int to a roman number\n reg text = \"\";\n foreach R,N in (romans){ text += R*(i/N); i = i%N; }\n return(text);\n}\n","language":"Zkl"},{"code":"program: decimal_roman\n input: 12\n output: 'XII'\n","language":"Zoea"},{"code":" 10 DATA 1000,\"M\",900,\"CM\"\n 20 DATA 500,\"D\",400,\"CD\"\n 30 DATA 100,\"C\",90,\"XC\"\n 40 DATA 50,\"L\",40,\"XL\"\n 50 DATA 10,\"X\",9,\"IX\"\n 60 DATA 5,\"V\",4,\"IV\",1,\"I\"\n 70 INPUT \"Enter an arabic number: \";V\n 80 LET VALUE=V\n 90 LET V$=\"\"\n100 FOR I=0 TO 12\n110 READ A,R$\n120 IF V<A THEN GO TO 160\n130 LET V$=V$+R$\n140 LET V=V-A\n150 GO TO 120\n160 NEXT I\n170 PRINT VALUE;\"=\";V$\n","language":"ZX-Spectrum-Basic"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- String_manipulation\\nfrom: http://rosettacode.org/wiki/Roman_numerals/Encode\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nCreate a function taking a positive integer as its parameter and returning a string containing the Roman numeral representation of that integer. Modern Roman numerals are written by expressing each digit separately, starting with the left most digit and skipping any digit with a value of zero. \\n\\n\\nIn Roman numerals:\\n* 1990 is rendered: 1000=M, 900=CM, 90=XC; resulting in MCMXC\\n* 2008 is written as 2000=MM, 8=VIII; or MMVIII\\n* 1666 uses each Roman symbol in descending order: MDCLXVI\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V anums = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\\nV rnums = ‘M CM D CD C XC L XL X IX V IV I’.split(‘ ’)\\n\\nF to_roman(=x)\\n V ret = ‘’\\n L(a, r) zip(:anums, :rnums)\\n (V n, x) = divmod(x, a)\\n ret ‘’= r * n\\n R ret\\n\\nV test = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 25, 30, 40,\\n 50, 60, 69, 70, 80, 90, 99, 100, 200, 300, 400, 500, 600, 666, 700, 800, 900, 1000,\\n 1009, 1444, 1666, 1945, 1997, 1999, 2000, 2008, 2010, 2011, 2500, 3000, 3999]\\nL(val) test\\n print(val‘ - ’to_roman(val))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Roman numerals Encode - 11/05/2020\\nROMAENC CSECT\\n USING ROMAENC,R13 base register\\n B 72(R15) skip savearea\\n DC 17F'0' savearea\\n SAVE (14,12) save previous context\\n ST R13,4(R15) link backward\\n ST R15,8(R13) link forward\\n LR R13,R15 set addressability\\n LA R6,1 i=1\\n DO WHILE=(C,R6,LE,=A(8)) do i=1 to hbound(nums)\\n LR R1,R6 i\\n SLA R1,1 ~\\n LH R8,NUMS-2(R1) n=nums(i)\\n MVC PG,=CL80'.... :' clear buffer\\n LA R9,PG @pg\\n XDECO R8,XDEC edit n\\n MVC 0(4,R9),XDEC+8 output n\\n LA R9,7(R9) @pg+=7\\n LA R7,1 j=1\\n DO WHILE=(C,R7,LE,=A(13)) do j=1 to 13\\n LR R1,R7 j\\n SLA R1,1 ~\\n LH R3,ARABIC-2(R1) aj=arabic(j)\\n DO WHILE=(CR,R8,GE,R3) while n>=aj\\n LR R1,R7 j\\n SLA R1,1 ~\\n LA R4,ROMAN-2(R1) roman(j)\\n MVC 0(2,R9),0(R4) output roman(j)\\n IF CLI,1(R9),NE,C' ' THEN if roman(j)[2]=' ' then\\n LA R9,2(R9) @pg+=2\\n ELSE , else\\n LA R9,1(R9) @pg+=1\\n ENDIF , endif\\n SR R8,R3 n-=aj\\n ENDDO , endwile\\n LA R7,1(R7) j++\\n ENDDO , enddo j\\n XPRNT PG,L'PG print buffer\\n LA R6,1(R6) i++\\n ENDDO , enddo i\\n L R13,4(0,R13) restore previous savearea pointer\\n RETURN (14,12),RC=0 restore registers from calling save\\nARABIC DC H'1000',H'900',H'500',H'400',H'100',H'90'\\n DC H'50',H'40',H'10',H'9',H'5',H'4',H'1'\\nROMAN DC CL2'M',CL2'CM',CL2'D',CL2'CD',CL2'C',CL2'XC'\\n DC CL2'L',CL2'XL',CL2'X',CL2'IX',CL2'V',CL2'IV',CL2'I'\\nNUMS DC H'14',H'16',H'21',H'888',H'1492',H'1999',H'2020',H'3999'\\nPG DS CL80 buffer\\nXDEC DS CL12 temp for xdeco\\n REGEQU\\n END ROMAENC\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"\\t\\torg\\t100h\\n\\t\\tjmp\\ttest\\n\\t\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t\\t;; Takes a 16-bit integer in HL, and stores it\\n\\t\\t;; as a 0-terminated string starting at BC.\\n\\t\\t;; On exit, all registers destroyed; BC pointing at\\n\\t\\t;; end of string.\\nmkroman:\\tpush\\th\\t; put input on stack\\n\\t\\tlxi\\th,mkromantab\\nmkromandgt:\\tmov\\ta,m\\t; scan ahead to next entry\\n\\t\\tana\\ta\\n\\t\\tinx\\th\\n\\t\\tjnz\\tmkromandgt\\n\\t\\txthl\\t\\t; load number\\n\\t\\tmov\\ta,h\\t; if zero, we're done\\n\\t\\tora\\tl\\n\\t\\tjz\\tmkromandone\\n\\t\\txthl\\t\\t; load next entry from table\\n\\t\\tmov\\te,m\\t; de = number\\n\\t\\tinx\\th\\n\\t\\tmov\\td,m\\n\\t\\tinx\\th\\n\\t\\txthl\\t\\t; load number\\n\\t\\txra\\ta\\t; find how many we need\\nsubtract:\\tinr\\ta\\t; with trial subtraction\\n\\t\\tdad\\td\\n\\t\\tjc\\tsubtract\\n\\t\\tpush\\tpsw\\t; keep counter\\n\\t\\tmov\\ta,d\\t; we subtracted one too many\\n\\t\\tcma\\t\\t; so we need to add one back\\n\\t\\tmov\\td,a\\n\\t\\tmov\\ta,e\\n\\t\\tcma\\n\\t\\tmov\\te,a\\n\\t\\tinx\\td\\n\\t\\tdad\\td\\n\\t\\tpop\\td\\t; restore counter (into D)\\n\\t\\txthl\\t\\t; load table pointer\\nstringouter:\\tdcr\\td\\t; do we need to include one?\\n\\t\\tjz\\tmkromandgt\\n\\t\\tpush\\th\\t; keep string location\\nstringinner:\\tmov\\ta,m\\t; copy string into target\\n\\t\\tstax\\tb\\n\\t\\tana\\ta\\t; done yet?\\n\\t\\tjz\\tstringdone\\n\\t\\tinx\\th\\n\\t\\tinx\\tb\\t; copy next character\\n\\t\\tjmp\\tstringinner\\nstringdone:\\tpop\\th\\t; restore string location\\n\\t\\tjmp\\tstringouter\\nmkromandone:\\tpop\\td\\t; remove temporary variable from stack\\n\\t\\tret\\nmkromantab:\\tdb\\t0\\n\\t\\tdb\\t18h,0fch,'M',0\\t\\t; The value for each entry\\n\\t\\tdb\\t7ch,0fch,'CM',0\\t\\t; is stored already negated\\n\\t\\tdb\\t0ch,0feh,'D',0\\t\\t; so that it can be immediately\\n\\t\\tdb\\t70h,0feh,'CD',0\\t\\t; added using `dad'.\\n\\t\\tdb\\t9ch,0ffh,'C',0\\t\\t; This also has the convenient\\n\\t\\tdb\\t0a6h,0ffh,'XC',0\\t; property of not having any\\n\\t\\tdb\\t0ceh,0ffh,'L',0\\t\\t; zero bytes except the string\\n\\t\\tdb\\t0d8h,0ffh,'XL',0\\t; and row terminators.\\n\\t\\tdb\\t0f6h,0ffh,'X',0\\n\\t\\tdb\\t0f7h,0ffh,'IX',0\\n\\t\\tdb\\t0fbh,0ffh,'V',0\\n\\t\\tdb\\t0fch,0ffh,'IV',0\\n\\t\\tdb\\t0ffh,0ffh,'I',0\\n\\t\\t;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\t\\t;; Test code\\ntest:\\t\\tmvi\\tc,10\\t; read string from console\\n\\t\\tlxi\\td,dgtbufdef\\n\\t\\tcall\\t5\\n\\t\\tlxi\\th,0\\t; convert to integer\\n\\t\\tlxi\\tb,dgtbuf\\nreaddgt:\\tldax\\tb\\n\\t\\tana\\ta\\n\\t\\tjz\\tconvert\\n\\t\\tdad\\th\\t; hl *= 10\\n\\t\\tmov\\td,h\\n\\t\\tmov\\te,l\\n\\t\\tdad\\th\\n\\t\\tdad\\th\\n\\t\\tdad\\td\\n\\t\\tsui\\t'0'\\n\\t\\tmov\\te,a\\n\\t\\tmvi\\td,0\\n\\t\\tdad\\td\\n\\t\\tinx\\tb\\n\\t\\tjmp\\treaddgt\\nconvert:\\tlxi\\tb,romanbuf\\t; convert to roman\\n\\t\\tcall\\tmkroman\\n\\t\\tmvi\\ta,'$'\\t; switch string terminator\\n\\t\\tstax\\tb\\n\\t\\tmvi\\tc,9\\t; output result\\n\\t\\tlxi\\td,romanbuf\\n\\t\\tjmp\\t5\\nnl:\\t\\tdb\\t13,10,'$'\\ndgtbufdef:\\tdb\\t5,0\\ndgtbuf:\\t\\tds\\t6\\nromanbuf:\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \"\\tmov ax,0070h\\n\\tcall EncodeRoman\\n\\tmov si,offset StringRam\\n\\tcall PrintString\\n\\tcall NewLine\\t\\n\\t\\n\\tmov ax,1776h\\n\\tcall EncodeRoman\\n\\tmov si,offset StringRam\\n\\tcall PrintString\\n\\tcall NewLine\\n\\n\\tmov ax,2021h\\n\\tcall EncodeRoman\\n\\tmov si,offset StringRam\\n\\tcall PrintString\\n\\tcall NewLine\\n\\n\\tmov ax,3999h\\n\\tcall EncodeRoman\\n\\tmov si,offset StringRam\\n\\tcall PrintString\\n\\tcall NewLine\\n\\t\\n\\tmov ax,4000h\\n\\tcall EncodeRoman\\n\\tmov si,offset StringRam\\n\\n\\t\\n\\tReturnToDos ;macro that calls the int that exits dos\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \";ROMAN NUMERALS MODULE\\n\\nEncodeRoman:\\n;takes a BCD value in AX and stores its Roman numeral equivalent in ram.\\n\\n\\tcall UnpackBCD\\n\\t\\n\\tcmp dh,03h\\n\\tjng continue_EncodeRoman\\n\\t;roman numerals only go up to 3999.\\n\\tjmp errorhandler_encodeRoman_inputTooBig\\ncontinue_EncodeRoman:\\n\\tmov si,offset StringRam\\n\\t;using SI as destination of roman numerals.\\n\\tpush ax\\t\\n\\tpush cx\\n\\t\\tmov ch,0\\n\\t\\tmov cl,dh\\t\\t\\t\\t\\t;loop counter\\n\\t\\tcmp dh,0\\n\\t\\tjz skipThousands\\nencodeRoman_handleThousands:\\n\\t\\tmov al,\\\"M\\\"\\n\\t\\tmov [ds:si],al\\t\\t\\t\\t;store in string ram\\n\\t\\tinc si\\n\\t\\t; call PrintChar\\n\\t\\tloop encodeRoman_handleThousands\\nskipThousands:\\n\\tpop cx\\n\\tpop ax\\n\\t\\nencodeRoman_HandleHundreds:\\n\\tpushall\\n\\t\\tmov bh,0\\n\\t\\tmov bl,dl ;use bx as an offset into Roman_Lookup_Master\\n\\t\\tSHL bl,1\\n\\t\\tSHL bl,1\\t;multiply by 2, we are indexing into a table with 4 bytes per row.\\n\\t\\tmov di,offset Roman_Lookup_Master\\n\\t\\tmov cx,4\\ngetChar_Hundreds:\\t\\t\\n\\t\\tmov al,[bx+es:di] ;get first char index\\n\\t\\tpush bx\\n\\t\\tpush di\\n\\t\\t\\tmov di,offset Roman_Hund\\n\\t\\t\\tmov bl,al\\n\\t\\t\\tmov al,[bx+es:di]\\n\\t\\t\\tcmp al,0\\n\\t\\t\\tjz skipNullChar_RomanHund\\n\\t\\t\\tmov [ds:si],al\\t;store in ram\\n\\t\\t\\tinc si\\n\\t\\t\\t; call PrintChar\\t\\t\\t\\nskipNullChar_RomanHund:\\n\\t\\tpop di\\n\\t\\tpop bx\\n\\t\\tinc di\\n\\t\\tloop getChar_Hundreds\\n\\tpopall\\n\\t\\n\\t\\nencodeRoman_HandleTens:\\n\\tpushall\\n\\t\\tmov bh,0\\n\\t\\tmov bl,ah ;use bx as an offset into Roman_Lookup_Master\\n\\t\\tSHL bl,1\\n\\t\\tSHL bl,1\\t;multiply by 2, we are indexing into a table with 4 bytes per row.\\n\\t\\tmov di,offset Roman_Lookup_Master\\n\\t\\tmov cx,4\\ngetChar_Tens:\\t\\t\\n\\t\\tmov al,[bx+es:di] ;get first char index\\n\\t\\tpush bx\\n\\t\\tpush di\\n\\t\\t\\tmov di,offset Roman_Tens\\n\\t\\t\\tmov bl,al\\n\\t\\t\\tmov al,[bx+es:di]\\n\\t\\t\\tcmp al,0\\n\\t\\t\\tjz skipNullChar_RomanTens\\n\\t\\t\\tmov [ds:si],al\\t;store in ram\\n\\t\\t\\tinc si\\n\\t\\t\\t; call PrintChar\\t\\t\\t\\nskipNullChar_RomanTens:\\n\\t\\tpop di\\n\\t\\tpop bx\\n\\t\\tinc di\\n\\t\\tloop getChar_Tens\\n\\tpopall\\n\\t\\nencodeRoman_HandleOnes:\\n\\tpushall\\n\\t\\tmov bh,0\\n\\t\\tmov bl,al ;use bx as an offset into Roman_Lookup_Master\\n\\t\\tSHL bl,1\\n\\t\\tSHL bl,1\\t;multiply by 2, we are indexing into a table with 4 bytes per row.\\n\\t\\tmov di,offset Roman_Lookup_Master\\n\\t\\tmov cx,4\\ngetChar_Ones:\\t\\t\\n\\t\\tmov al,[bx+es:di] ;get first char index\\n\\t\\tpush bx\\n\\t\\tpush di\\n\\t\\t\\tmov di,offset Roman_Ones\\n\\t\\t\\tmov bl,al\\n\\t\\t\\tmov al,[bx+es:di]\\n\\t\\t\\tcmp al,0\\n\\t\\t\\tjz skipNullChar_RomanOnes\\n\\t\\t\\tmov [ds:si],al\\t;store in ram\\n\\t\\t\\tinc si\\n\\t\\t\\t; call PrintChar\\t\\t\\t\\nskipNullChar_RomanOnes:\\n\\t\\tpop di\\n\\t\\tpop bx\\n\\t\\tinc di\\n\\t\\tloop getChar_Ones\\n\\tpopall\\n\\t\\n\\tmov al,0\\n\\tmov [ds:si],al ;place a null terminator at the end of the string.\\n\\tret\\n\\n\\t\\t\\t\\nerrorhandler_encodeRoman_inputTooBig:\\n\\tpush ds\\n\\tpush ax\\n\\t\\tLoadSegment ds,ax,@data\\n\\t\\tmov al,01h\\n\\t\\tmov byte ptr [ds:error_code],al\\n\\t\\tmov ax, offset EncodeRoman\\n\\t\\tmov word ptr [ds:error_routine],ax\\n\\t\\t\\n\\t\\tLoadSegment ds,ax,@code\\n\\t\\tmov si,offset Roman_Error\\n\\t\\tcall PrintString\\n\\tpop ax\\n\\tpop ds\\n\\tstc\\t\\t;set carry, allowing program to branch if error occurred.\\n\\tret\\n\\n\\t\\n\\nRoman_Lookup_Master db 0,0,0,0\\t;0\\n\\t\\t db 0,0,0,1\\t;1\\n\\t\\t db 0,0,1,1\\t;2\\n\\t\\t db 0,1,1,1\\t;3\\n\\t\\t db 0,0,1,2\\t;4\\n\\t\\t db 0,0,0,2\\t;5\\n\\t\\t db 0,0,2,1\\t;6\\n\\t\\t db 0,2,1,1\\t;7\\n\\t\\t db 2,1,1,1\\t;8\\n\\t\\t db 0,0,1,3\\t;9\\n\\nRoman_Ones\\t db 0,\\\"IVX\\\" ;the same pattern is used regardless of what power of 10 we're working with\\nRoman_Tens\\t db 0,\\\"XLC\\\"\\nRoman_Hund\\t db 0,\\\"CDM\\\"\\n\\nRoman_Error\\t db \\\"ERROR: BAD INPUT\\\",0\\n\\n\\nUnpackBCD:\\n;converts a \\\"packed\\\" BCD value in AX to an \\\"unpacked\\\" value in DX.AX\\n;DX is the high byte, AX is the low byte.\\n;CLOBBERS DX AND AX.\\n\\tmov dx,0\\n\\tmov dl,ah\\n\\tmov ah,0\\n\\tpush cx\\n\\t\\tmov cl,4\\n\\t\\trol dx,cl\\n\\t\\t;BEFORE: DX = 00XYh\\n\\t\\t;AFTER: DX = 0XY0h\\n\\t\\tror dl,cl\\t;DX = 0X0Yh\\n\\t\\t\\n\\t\\trol ax,cl\\t\\n\\t\\t;BEFORE: AX = 00XYh\\n\\t\\t;AFTER: AX = 0XY0h\\n\\t\\tror al,cl\\t;AX = 0X0Yh\\n\\tpop cx\\n\\tret\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \"pushall macro\\npush ax\\npush bx\\npush cx\\npush dx\\npush ds\\npush es\\npush di\\n;I forgot SI in this macro, but once you add it in the code stops working! So I left it out.\\nendm\\n\\npopall macro\\npop di\\npop es\\npop ds\\npop dx\\npop cx\\npop bx\\npop ax\\nendm\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \"DEFINE PTR=\\\"CARD\\\"\\nCARD ARRAY arabic=[1000 900 500 400 100 90 50 40 10 9 5 4 1]\\nPTR ARRAY roman(13)\\n\\nPROC InitRoman()\\n roman(0)=\\\"M\\\" roman(1)=\\\"CM\\\" roman(2)=\\\"D\\\" roman(3)=\\\"CD\\\"\\n roman(4)=\\\"C\\\" roman(5)=\\\"XC\\\" roman(6)=\\\"L\\\" roman(7)=\\\"XL\\\"\\n roman(8)=\\\"X\\\" roman(9)=\\\"IX\\\" roman(10)=\\\"V\\\" roman(11)=\\\"IV\\\" roman(12)=\\\"I\\\"\\nRETURN\\n\\nPROC EncodeRomanNumber(CARD n CHAR ARRAY res)\\n BYTE i,len\\n CHAR ARRAY tmp\\n\\n res(0)=0 len=0\\n FOR i=0 TO 12\\n DO\\n WHILE arabic(i)<=n\\n DO\\n tmp=roman(i)\\n SAssign(res,tmp,len+1,len+1+tmp(0))\\n len==+tmp(0)\\n n==-arabic(i)\\n OD\\n OD\\n res(0)=len\\nRETURN\\n\\nPROC Main()\\n CARD ARRAY data=[1990 2008 5555 1666 3888 3999]\\n BYTE i\\n CHAR ARRAY r(20)\\n\\n InitRoman()\\n FOR i=0 TO 5\\n DO\\n EncodeRomanNumber(data(i),r)\\n PrintF(\\\"%U=%S%E\\\",data(i),r)\\n OD\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"function arabic2roman(num:Number):String {\\n\\tvar lookup:Object = {M:1000, CM:900, D:500, CD:400, C:100, XC:90, L:50, XL:40, X:10, IX:9, V:5, IV:4, I:1};\\n\\tvar roman:String = \\\"\\\", i:String;\\n\\tfor (i in lookup) {\\n\\t\\twhile (num >= lookup[i]) {\\n\\t\\t\\troman += i;\\n\\t\\t\\tnum -= lookup[i];\\n\\t\\t}\\n\\t}\\n\\treturn roman;\\n}\\ntrace(\\\"1990 in roman is \\\" + arabic2roman(1990));\\ntrace(\\\"2008 in roman is \\\" + arabic2roman(2008));\\ntrace(\\\"1666 in roman is \\\" + arabic2roman(1666));\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"function roman2arabic(roman:String):Number {\\n\\tvar romanArr:Array = roman.toUpperCase().split('');\\n\\tvar lookup:Object = {I:1, V:5, X:10, L:50, C:100, D:500, M:1000};\\n\\tvar num:Number = 0, val:Number = 0;\\n\\twhile (romanArr.length) {\\n\\t\\tval = lookup[romanArr.shift()];\\n\\t\\tnum += val * (val < lookup[romanArr[0]] ? -1 : 1);\\n\\t}\\n\\treturn num;\\n}\\ntrace(\\\"MCMXC in arabic is \\\" + roman2arabic(\\\"MCMXC\\\"));\\ntrace(\\\"MMVIII in arabic is \\\" + roman2arabic(\\\"MMVIII\\\"));\\ntrace(\\\"MDCLXVI in arabic is \\\" + roman2arabic(\\\"MDCLXVI\\\"));\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\n\\nprocedure Roman_Numeral_Test is\\n function To_Roman (Number : Positive) return String is\\n subtype Digit is Integer range 0..9;\\n function Roman (Figure : Digit; I, V, X : Character) return String is\\n begin\\n case Figure is\\n when 0 => return \\\"\\\";\\n when 1 => return \\\"\\\" & I;\\n when 2 => return I & I;\\n when 3 => return I & I & I;\\n when 4 => return I & V;\\n when 5 => return \\\"\\\" & V;\\n when 6 => return V & I;\\n when 7 => return V & I & I;\\n when 8 => return V & I & I & I;\\n when 9 => return I & X;\\n end case;\\n end Roman;\\n begin\\n pragma Assert (Number >= 1 and Number < 4000);\\n return\\n Roman (Number / 1000, 'M', ' ', ' ') &\\n Roman (Number / 100 mod 10, 'C', 'D', 'M') &\\n Roman (Number / 10 mod 10, 'X', 'L', 'C') &\\n Roman (Number mod 10, 'I', 'V', 'X');\\n end To_Roman;\\nbegin\\n Put_Line (To_Roman (1999));\\n Put_Line (To_Roman (25));\\n Put_Line (To_Roman (944));\\nend Roman_Numeral_Test;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"[]CHAR roman = \\\"MDCLXVmdclxvi\\\"; # UPPERCASE for thousands #\\n[]CHAR adjust roman = \\\"CCXXmmccxxii\\\";\\n[]INT arabic = (1000000, 500000, 100000, 50000, 10000, 5000, 1000, 500, 100, 50, 10, 5, 1);\\n[]INT adjust arabic = (100000, 100000, 10000, 10000, 1000, 1000, 100, 100, 10, 10, 1, 1, 0);\\n\\nPROC arabic to roman = (INT dclxvi)STRING: (\\n INT in := dclxvi; # 666 #\\n STRING out := \\\"\\\";\\n FOR scale TO UPB roman WHILE in /= 0 DO\\n INT multiples = in OVER arabic[scale];\\n in -:= arabic[scale] * multiples;\\n out +:= roman[scale] * multiples;\\n IF in >= -adjust arabic[scale] + arabic[scale] THEN\\n in -:= -adjust arabic[scale] + arabic[scale];\\n out +:= adjust roman[scale] + roman[scale]\\n FI\\n OD;\\n out\\n);\\n\\nmain:(\\n []INT test = (1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,25,30,40,50,60,69,70,\\n 80,90,99,100,200,300,400,500,600,666,700,800,900,1000,1009,1444,1666,1945,1997,1999,\\n 2000,2008,2500,3000,4000,4999,5000,6666,10000,50000,100000,500000,1000000,max int);\\n FOR key TO UPB test DO\\n INT val = test[key];\\n print((val, \\\" - \\\", arabic to roman(val), new line))\\n OD\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"BEGIN\\n\\nPROCEDURE ROMAN (INTEGER VALUE NUMBER; STRING(15) RESULT CHARACTERS; INTEGER RESULT LENGTH);\\n COMMENT\\n Returns the Roman number of an integer between 1 and 3999.\\n \\\"MMMDCCCLXXXVIII\\\" (15 characters long) is the longest Roman number under 4000;\\n BEGIN\\n INTEGER PLACE, POWER;\\n\\n PROCEDURE APPEND (STRING(1) VALUE C);\\n BEGIN CHARACTERS(LENGTH|1) := C; LENGTH := LENGTH + 1 END;\\n\\n PROCEDURE I; APPEND(CASE PLACE OF (\\\"I\\\",\\\"X\\\",\\\"C\\\",\\\"M\\\"));\\n PROCEDURE V; APPEND(CASE PLACE OF (\\\"V\\\",\\\"L\\\",\\\"D\\\"));\\n PROCEDURE X; APPEND(CASE PLACE OF (\\\"X\\\",\\\"C\\\",\\\"M\\\"));\\n\\n ASSERT (NUMBER >= 1) AND (NUMBER < 4000);\\n\\n CHARACTERS := \\\" \\\";\\n LENGTH := 0;\\n POWER := 1000;\\n PLACE := 4;\\n WHILE PLACE > 0 DO\\n BEGIN\\n CASE NUMBER DIV POWER + 1 OF BEGIN\\n BEGIN END;\\n BEGIN I END;\\n BEGIN I; I END;\\n BEGIN I; I; I END;\\n BEGIN I; V END;\\n BEGIN V END;\\n BEGIN V; I END;\\n BEGIN V; I; I END;\\n BEGIN V; I; I; I END;\\n BEGIN I; X END\\n END;\\n NUMBER := NUMBER REM POWER;\\n POWER := POWER DIV 10;\\n PLACE := PLACE - 1\\n END\\n END ROMAN;\\n\\nINTEGER I;\\nSTRING(15) S;\\n\\nROMAN(1, S, I); WRITE(S, I);\\nROMAN(3999, S, I); WRITE(S, I);\\nROMAN(3888, S, I); WRITE(S, I);\\nROMAN(2009, S, I); WRITE(S, I);\\nROMAN(405, S, I); WRITE(S, I);\\nEND.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"toRoman←{\\n ⍝ Digits and corresponding values\\n ds←((⊢≠⊃)⊆⊢)' M CM D CD C XC L XL X IX V IV I'\\n vs←1000, ,100 10 1∘.×9 5 4 1\\n ⍝ Input ≤ 0 is invalid\\n ⍵≤0:⎕SIGNAL 11\\n { 0=d←⊃⍸vs≤⍵:⍬ ⍝ Find highest digit in number\\n (d⊃ds),∇⍵-d⊃vs ⍝ While one exists, add it and subtract from number\\n }⍵\\n}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"------------------ ROMAN INTEGER STRINGS -----------------\\n\\n-- roman :: Int -> String\\non roman(n)\\n set kvs to {[\\\"M\\\", 1000], [\\\"CM\\\", 900], [\\\"D\\\", 500], ¬\\n [\\\"CD\\\", 400], [\\\"C\\\", 100], [\\\"XC\\\", 90], [\\\"L\\\", 50], ¬\\n [\\\"XL\\\", 40], [\\\"X\\\", 10], [\\\"IX\\\", 9], [\\\"V\\\", 5], ¬\\n [\\\"IV\\\", 4], [\\\"I\\\", 1]}\\n\\n script stringAddedValueDeducted\\n on |λ|(balance, kv)\\n set {k, v} to kv\\n set {q, r} to quotRem(balance, v)\\n if q > 0 then\\n {r, concat(replicate(q, k))}\\n else\\n {r, \\\"\\\"}\\n end if\\n end |λ|\\n end script\\n\\n concat(snd(mapAccumL(stringAddedValueDeducted, n, kvs)))\\nend roman\\n\\n\\n--------------------------- TEST -------------------------\\non run\\n\\n map(roman, [2016, 1990, 2008, 2000, 1666])\\n\\n --> {\\\"MMXVI\\\", \\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MM\\\", \\\"MDCLXVI\\\"}\\nend run\\n\\n\\n---------------- GENERIC LIBRARY FUNCTIONS ---------------\\n\\n-- concat :: [[a]] -> [a] | [String] -> String\\non concat(xs)\\n script append\\n on |λ|(a, b)\\n a & b\\n end |λ|\\n end script\\n\\n if length of xs > 0 and ¬\\n class of (item 1 of xs) is string then\\n set unit to \\\"\\\"\\n else\\n set unit to {}\\n end if\\n foldl(append, unit, xs)\\nend concat\\n\\n-- foldl :: (a -> b -> a) -> a -> [b] -> a\\non foldl(f, startValue, xs)\\n tell mReturn(f)\\n set v to startValue\\n set lng to length of xs\\n repeat with i from 1 to lng\\n set v to |λ|(v, item i of xs, i, xs)\\n end repeat\\n return v\\n end tell\\nend foldl\\n\\n-- map :: (a -> b) -> [a] -> [b]\\non map(f, xs)\\n tell mReturn(f)\\n set lng to length of xs\\n set lst to {}\\n repeat with i from 1 to lng\\n set end of lst to |λ|(item i of xs, i, xs)\\n end repeat\\n return lst\\n end tell\\nend map\\n\\n-- 'The mapAccumL function behaves like a combination of map and foldl;\\n-- it applies a function to each element of a list, passing an\\n-- accumulating parameter from left to right, and returning a final\\n-- value of this accumulator together with the new list.' (see Hoogle)\\n\\n-- mapAccumL :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])\\non mapAccumL(f, acc, xs)\\n script\\n on |λ|(a, x)\\n tell mReturn(f) to set pair to |λ|(item 1 of a, x)\\n [item 1 of pair, (item 2 of a) & {item 2 of pair}]\\n end |λ|\\n end script\\n\\n foldl(result, [acc, {}], xs)\\nend mapAccumL\\n\\n-- Lift 2nd class handler function into 1st class script wrapper\\n-- mReturn :: Handler -> Script\\non mReturn(f)\\n if class of f is script then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\\n-- quotRem :: Integral a => a -> a -> (a, a)\\non quotRem(m, n)\\n {m div n, m mod n}\\nend quotRem\\n\\n-- Egyptian multiplication - progressively doubling a list, appending\\n-- stages of doubling to an accumulator where needed for binary\\n-- assembly of a target length\\n\\n-- replicate :: Int -> a -> [a]\\non replicate(n, a)\\n set out to {}\\n if n < 1 then return out\\n set dbl to {a}\\n\\n repeat while (n > 1)\\n if (n mod 2) > 0 then set out to out & dbl\\n set n to (n div 2)\\n set dbl to (dbl & dbl)\\n end repeat\\n return out & dbl\\nend replicate\\n\\n-- snd :: (a, b) -> b\\non snd(xs)\\n if class of xs is list and length of xs = 2 then\\n item 2 of xs\\n else\\n missing value\\n end if\\nend snd\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \" 1 N = 1990: GOSUB 5: PRINT N\\\" = \\\"V$\\n 2 N = 2008: GOSUB 5: PRINT N\\\" = \\\"V$\\n 3 N = 1666: GOSUB 5: PRINT N\\\" = \\\"V$;\\n 4 END\\n 5 V = N:V$ = \\\"\\\": FOR I = 0 TO 12: FOR L = 1 TO 0 STEP 0:A = VAL ( MID$ (\\\"1E3900500400100+90+50+40+10+09+05+04+01\\\",I * 3 + 1,3))\\n 6 L = (V - A) > = 0:V$ = V$ + MID$ (\\\"M.CMD.CDC.XCL.XLX.IXV.IVI\\\",I * 2 + 1,(I - INT (I / 2) * 2 + 1) * L):V = V - A * L: NEXT L,I\\n 7 RETURN\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"nums: [[1000 \\\"M\\\"] [900 \\\"CM\\\"] [500 \\\"D\\\"] [400 \\\"CD\\\"] [100 \\\"C\\\"] [90 \\\"XC\\\"]\\n [50 \\\"L\\\"] [40 \\\"XL\\\"] [10 \\\"X\\\"] [9 \\\"IX\\\"] [5 \\\"V\\\"] [4 \\\"IV\\\"] [1 \\\"I\\\"])\\n\\ntoRoman: function [x][\\n ret: \\\"\\\"\\n idx: 0\\n initial: x\\n loop nums 'num [\\n d: num\\\\0\\n l: num\\\\1\\n\\n i: 0\\n while [i<initial/d] [\\n ret: ret ++ l\\n i: i+1\\n ]\\n\\n initial: mod initial d\\n ]\\n return ret\\n]\\n\\nloop [1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 25 30 40\\n 50 60 69 70 80 90 99 100 200 300 400 500 600 666 700 800 900\\n 1000 1009 1444 1666 1945 1997 1999 2000 2008 2010 2011 2500\\n 3000 3999] 'n\\n -> print [n \\\"->\\\" toRoman n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"REM Roman numerals/Encode\\nDIM Weights(12)\\nDIM Symbols$(12)\\nDATA 1000, \\\"M\\\", 900, \\\"CM\\\", 500, \\\"D\\\", 400, \\\"CD\\\", 100, \\\"C\\\", 90, \\\"XC\\\", 50, \\\"L\\\"\\nDATA 40, \\\"XL\\\", 10, \\\"X\\\", 9, \\\"IX\\\", 5, \\\"V\\\", 4, \\\"IV\\\", 1, \\\"I\\\"\\nREM 3888 or MMMDCCCLXXXVIII (15 chars) is the longest string properly encoded\\nREM with these symbols.\\nFOR J = 0 TO 12\\n READ Weights(J)\\n READ Symbols$(J)\\nNEXT J\\n\\nAValue = 1990\\nGOSUB ToRoman:\\nPRINT Roman$\\nREM MCMXC\\nAValue = 2022\\nGOSUB ToRoman:\\nPRINT Roman$\\nREM MMXXII\\nAValue = 3888\\nGOSUB ToRoman:\\nPRINT Roman$\\nREM MMMDCCCLXXXVIII\\nEND\\n\\nToRoman:\\nREM Result: Roman$\\nRoman$ = \\\"\\\"\\nI = 0\\nLoop:\\n IF (I > 12 THEN ExitToRoman:\\n IF AValue <= 0 THEN ExitToRoman:\\n WHILE AValue >= Weights(I)\\n Roman$ = Roman$ + Symbols$(I)\\n AValue = AValue - Weights(I)\\n WEND\\n I = I + 1\\n GOTO Loop:\\nExitToRoman:\\nRETURN\\n\",\n \"language\": \"ASIC\"\n },\n {\n \"code\": \"MsgBox % stor(444)\\n\\nstor(value)\\n{\\n romans = M,CM,D,CD,C,XC,L,XL,X,IX,V,IV,I\\n M := 1000\\n CM := 900\\n D := 500\\n CD := 400\\n C := 100\\n XC := 90\\n L := 50\\n XL := 40\\n X := 10\\n IX := 9\\n V := 5\\n IV := 4\\n I := 1\\n Loop, Parse, romans, `,\\n {\\n While, value >= %A_LoopField%\\n {\\n result .= A_LoopField\\n value := value - (%A_LoopField%)\\n }\\n }\\n Return result . \\\"O\\\"\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"(defun c:roman() (romanNumber (getint \\\"\\\\n Enter number > \\\"))\\n(defun romanNumber (n / uni dec hun tho nstr strlist nlist rom)\\n (if (and (> n 0) (<= n 3999))\\n (progn\\n (setq\\n UNI (list \\\"\\\" \\\"I\\\" \\\"II\\\" \\\"III\\\" \\\"IV\\\" \\\"V\\\" \\\"VI\\\" \\\"VII\\\" \\\"VIII\\\" \\\"IX\\\")\\n DEC (list \\\"\\\" \\\"X\\\" \\\"XX\\\" \\\"XXX\\\" \\\"XL\\\" \\\"L\\\" \\\"LX\\\" \\\"LXX\\\" \\\"LXXX\\\" \\\"XC\\\")\\n HUN (list \\\"\\\" \\\"C\\\" \\\"CC\\\" \\\"CCC\\\" \\\"CD\\\" \\\"D\\\" \\\"DC\\\" \\\"DCC\\\" \\\"DCCC\\\" \\\"CM\\\")\\n THO (list \\\"\\\" \\\"M\\\" \\\"MM\\\" \\\"MMM\\\")\\n nstr (itoa n)\\n )\\n (while (> (strlen nstr) 0) (setq strlist (append strlist (list (substr nstr 1 1))) nstr (substr nstr 2 (strlen nstr))))\\n (setq nlist (mapcar 'atoi strlist))\\n (cond\\n ((> n 999)(setq rom(strcat(nth (car nlist) THO)(nth (cadr nlist) HUN)(nth (caddr nlist) DEC) (nth (last nlist)UNI ))))\\n ((and (> n 99)(<= n 999))(setq rom(strcat (nth (car nlist) HUN)(nth (cadr nlist) DEC) (nth (last nlist)UNI ))))\\n ((and (> n 9)(<= n 99))(setq rom(strcat (nth (car nlist) DEC) (nth (last nlist)UNI ))))\\n ((<= n 9)(setq rom(nth (last nlist)UNI)))\\n )\\n )\\n (princ \\\"\\\\nNumber out of range!\\\")\\n )\\nrom\\n)\\n\",\n \"language\": \"AutoLISP\"\n },\n {\n \"code\": \"# syntax: GAWK -f ROMAN_NUMERALS_ENCODE.AWK\\nBEGIN {\\n leng = split(\\\"1990 2008 1666\\\",arr,\\\" \\\")\\n for (i=1; i<=leng; i++) {\\n n = arr[i]\\n printf(\\\"%s = %s\\\\n\\\",n,dec2roman(n))\\n }\\n exit(0)\\n}\\nfunction dec2roman(number, v,w,x,y,roman1,roman10,roman100,roman1000) {\\n number = int(number) # force to integer\\n if (number < 1 || number > 3999) { # number is too small | big\\n return\\n }\\n split(\\\"I II III IV V VI VII VIII IX\\\",roman1,\\\" \\\") # 1 2 ... 9\\n split(\\\"X XX XXX XL L LX LXX LXXX XC\\\",roman10,\\\" \\\") # 10 20 ... 90\\n split(\\\"C CC CCC CD D DC DCC DCCC CM\\\",roman100,\\\" \\\") # 100 200 ... 900\\n split(\\\"M MM MMM\\\",roman1000,\\\" \\\") # 1000 2000 3000\\n v = (number - (number % 1000)) / 1000\\n number = number % 1000\\n w = (number - (number % 100)) / 100\\n number = number % 100\\n x = (number - (number % 10)) / 10\\n y = number % 10\\n return(roman1000[v] roman100[w] roman10[x] roman1[y])\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"OPTION BASE 1\\n\\nGLOBAL roman$[] = { \\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\", \\\"L\\\", \\\"XL\\\", \\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\", \\\"I\\\" }\\nGLOBAL number[] = { 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 }\\n\\nFUNCTION toroman$(value)\\n\\n LOCAL result$\\n\\n DOTIMES UBOUND(number)\\n WHILE value >= number[_]\\n result$ = result$ & roman$[_]\\n DECR value, number[_]\\n WEND\\n DONE\\n\\n RETURN result$\\n\\nENDFUNC\\n\\nPRINT toroman$(1990)\\nPRINT toroman$(2008)\\nPRINT toroman$(1666)\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"print 1666+\\\" = \\\"+convert$(1666)\\nprint 2008+\\\" = \\\"+convert$(2008)\\nprint 1001+\\\" = \\\"+convert$(1001)\\nprint 1999+\\\" = \\\"+convert$(1999)\\n\\nfunction convert$(value)\\nconvert$=\\\"\\\"\\narabic = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 }\\nroman$ = {\\\"M\\\", \\\"CM\\\", \\\"D\\\",\\\"CD\\\", \\\"C\\\",\\\"XC\\\",\\\"L\\\",\\\"XL\\\",\\\"X\\\",\\\"IX\\\",\\\"V\\\",\\\"IV\\\",\\\"I\\\"}\\n for i = 0 to 12\\n while value >= arabic[i]\\n\\t convert$ += roman$[i]\\n\\t value = value - arabic[i]\\n\\t end while\\n next i\\nend function\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off\\nsetlocal enabledelayedexpansion\\n\\nset cnt=0&for %%A in (1000,900,500,400,100,90,50,40,10,9,5,4,1) do (set arab!cnt!=%%A&set /a cnt+=1)\\nset cnt=0&for %%R in (M,CM,D,CD,C,XC,L,XL,X,IX,V,IV,I) do (set rom!cnt!=%%R&set /a cnt+=1)\\n\\n::Testing\\ncall :toRoman 2009\\necho 2009 = !result!\\ncall :toRoman 1666\\necho 1666 = !result!\\ncall :toRoman 3888\\necho 3888 = !result!\\npause>nul\\nexit/b 0\\n\\n::The \\\"function\\\"...\\n:toRoman\\nset value=%1\\nset result=\\n\\nfor /l %%i in (0,1,12) do (\\n\\tset a=%%i\\n\\tcall :add_val\\n)\\ngoto :EOF\\n\\n:add_val\\nif !value! lss !arab%a%! goto :EOF\\nset result=!result!!rom%a%!\\nset /a value-=!arab%a%!\\ngoto add_val\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" PRINT ;1999, FNroman(1999)\\n PRINT ;2012, FNroman(2012)\\n PRINT ;1666, FNroman(1666)\\n PRINT ;3888, FNroman(3888)\\n END\\n\\n DEF FNroman(n%)\\n LOCAL i%, r$, arabic%(), roman$()\\n DIM arabic%(12), roman$(12)\\n arabic%() = 1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900,1000\\n roman$() = \\\"I\\\",\\\"IV\\\", \\\"V\\\",\\\"IX\\\", \\\"X\\\",\\\"XL\\\", \\\"L\\\",\\\"XC\\\", \\\"C\\\",\\\"CD\\\", \\\"D\\\",\\\"CM\\\", \\\"M\\\"\\n FOR i% = 12 TO 0 STEP -1\\n WHILE n% >= arabic%(i%)\\n r$ += roman$(i%)\\n n% -= arabic%(i%)\\n ENDWHILE\\n NEXT\\n = r$\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\nlet toroman(n, v) = valof\\n$( let extract(n, val, rmn, v) = valof\\n $( while n >= val\\n $( n := n - val;\\n for i=1 to rmn%0 do v%(v%0+i) := rmn%i\\n v%0 := v%0 + rmn%0\\n $)\\n resultis n\\n $)\\n\\n v%0 := 0\\n n := extract(n, 1000, \\\"M\\\", v)\\n n := extract(n, 900, \\\"CM\\\", v)\\n n := extract(n, 500, \\\"D\\\", v)\\n n := extract(n, 400, \\\"CD\\\", v)\\n n := extract(n, 100, \\\"C\\\", v)\\n n := extract(n, 90, \\\"XC\\\", v)\\n n := extract(n, 50, \\\"L\\\", v)\\n n := extract(n, 40, \\\"XL\\\", v)\\n n := extract(n, 10, \\\"X\\\", v)\\n n := extract(n, 9, \\\"IX\\\", v)\\n n := extract(n, 5, \\\"V\\\", v)\\n n := extract(n, 4, \\\"IV\\\", v)\\n n := extract(n, 1, \\\"I\\\", v)\\n resultis v\\n$)\\n\\nlet show(n) be\\n$( let v = vec 50\\n writef(\\\"%I4 = %S*N\\\", n, toroman(n, v))\\n$)\\n\\nlet start() be\\n$( show(1666)\\n show(2008)\\n show(1001)\\n show(1999)\\n show(3888)\\n show(2021)\\n$)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"&>0\\\\0>00p:#v_$ >:#,_ $ @\\n4-v >5+#:/#<\\\\55+%:5/\\\\5%:\\nvv_$9+00g+5g\\\\00g8+>5g\\\\00\\ng>\\\\20p>:10p00g \\\\#v _20gv\\n> 2+ v^-1g01\\\\g5+8<^ +9 _\\n IVXLCDM\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \"⟨ToRoman⇐R⟩ ← {\\n ds ← 1↓¨(¯1+`⊏⊸=)⊸⊔\\\" I IV V IX X XL L XC C CD D CM M\\\"\\n vs ← 1e3∾˜ ⥊1‿4‿5‿9×⌜˜10⋆↕3\\n R ⇐ {\\n 𝕨𝕊0: \\\"\\\";\\n (⊑⟜ds∾·𝕊𝕩-⊑⟜vs) 1-˜⊑vs⍋𝕩\\n }\\n}\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \" ToRoman¨ 1990‿2008‿1666‿2021\\n⟨ \\\"MCMXC\\\" \\\"MMVIII\\\" \\\"MDCLXVI\\\" \\\"MMXXI\\\" ⟩\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"( ( encode\\n = indian roman cifr tenfoldroman letter tenfold\\n . !arg:#?indian\\n & :?roman\\n & whl\\n ' ( @(!indian:#%?cifr ?indian)\\n & :?tenfoldroman\\n & whl\\n ' ( !roman:%?letter ?roman\\n & !tenfoldroman\\n ( (I.X)\\n (V.L)\\n (X.C)\\n (L.D)\\n (C.M)\\n : ? (!letter.?tenfold) ?\\n & !tenfold\\n | \\\"*\\\"\\n )\\n : ?tenfoldroman\\n )\\n & !tenfoldroman:?roman\\n & ( !cifr:9&!roman I X:?roman\\n | !cifr:~<4\\n & !roman\\n (!cifr:4&I|)\\n V\\n : ?roman\\n & !cifr+-5:?cifr\\n & ~\\n | whl\\n ' ( !cifr+-1:~<0:?cifr\\n & !roman I:?roman\\n )\\n )\\n )\\n & ( !roman:? \\\"*\\\" ?&~`\\n | str$!roman\\n )\\n )\\n& 1990 2008 1666 3888 3999 4000:?NS\\n& whl\\n ' ( !NS:%?N ?NS\\n & out\\n $ ( encode$!N:?K&!N !K\\n | str$(\\\"Can't convert \\\" !N \\\" to Roman numeral\\\")\\n )\\n )\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\n\\nint main() {\\n int arabic[] = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};\\n\\n // There is a bug: \\\"XL\\\\0\\\" is translated into sequence 58 4C 00 00, i.e. it is 4-bytes long...\\n // Should be \\\"XL\\\" without \\\\0 etc.\\n //\\n char roman[13][3] = {\\\"M\\\\0\\\", \\\"CM\\\\0\\\", \\\"D\\\\0\\\", \\\"CD\\\\0\\\", \\\"C\\\\0\\\", \\\"XC\\\\0\\\", \\\"L\\\\0\\\", \\\"XL\\\\0\\\", \\\"X\\\\0\\\", \\\"IX\\\\0\\\", \\\"V\\\\0\\\", \\\"IV\\\\0\\\", \\\"I\\\\0\\\"};\\n int N;\\n\\n printf(\\\"Enter arabic number:\\\\n\\\");\\n scanf(\\\"%d\\\", &N);\\n printf(\\\"\\\\nRoman number:\\\\n\\\");\\n\\n for (int i = 0; i < 13; i++) {\\n while (N >= arabic[i]) {\\n printf(\\\"%s\\\", roman[i]);\\n N -= arabic[i];\\n }\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#define _CRT_SECURE_NO_WARNINGS\\n\\n#include <stdio.h>\\n#include <string.h>\\n\\nint RomanNumerals_parseInt(const char* string)\\n{\\n int value;\\n return scanf(\\\"%u\\\", &value) == 1 && value > 0 ? value : 0;\\n}\\n\\nconst char* RomanNumerals_toString(int value)\\n{\\n#define ROMAN_NUMERALS_MAX_OUTPUT_STRING_SIZE 64\\n static buffer[ROMAN_NUMERALS_MAX_OUTPUT_STRING_SIZE];\\n\\n const static int maxValue = 5000;\\n const static int minValue = 1;\\n\\n const static struct Digit {\\n char string[4]; // It's better to use 4 than 3 (aligment).\\n int value;\\n } digits[] = {\\n {\\\"M\\\", 1000}, {\\\"CM\\\", 900}, {\\\"D\\\", 500 }, {\\\"CD\\\", 400 },\\n {\\\"C\\\", 100 }, {\\\"XC\\\", 90 }, {\\\"L\\\", 50 }, {\\\"XL\\\", 40},\\n {\\\"X\\\", 10}, {\\\"IX\\\", 9}, {\\\"V\\\", 5}, {\\\"IV\\\", 4}, {\\\"I\\\", 1 },\\n {\\\"?\\\", 0}\\n };\\n\\n *buffer = '\\\\0'; // faster than memset(buffer, 0, sizeof(buffer));\\n if (minValue <= value && value <= maxValue)\\n {\\n struct Digit* digit = &digits[0];\\n\\n while (digit->value)\\n {\\n while (value >= digit->value)\\n {\\n value -= digit->value;\\n // It is not necessary - total length would not be exceeded...\\n // if (strlen(buffer) + strlen(digit->string) < sizeof(buffer))\\n strcat(buffer, digit->string);\\n }\\n digit++;\\n }\\n }\\n return buffer;\\n}\\n\\n\\nint main(int argc, char* argv[])\\n{\\n if (argc < 2)\\n {\\n // Blanks are needed for a consistient blackground on some systems.\\n // BTW, puts append an extra newline at the end.\\n //\\n puts(\\\"Write given numbers as Roman numerals. \\\\n\\\"\\n \\\" \\\\n\\\"\\n \\\"Usage: \\\\n\\\"\\n \\\" roman n1 n2 n3 ... \\\\n\\\"\\n \\\" \\\\n\\\"\\n \\\"where n1 n2 n3 etc. are Arabic numerals\\\\n\\\");\\n\\n int numbers[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1498, 2022 };\\n for (int i = 0; i < sizeof(numbers) / sizeof(int); i++)\\n {\\n printf(\\\"%4d = %s\\\\n\\\",\\n numbers[i], RomanNumerals_toString(numbers[i]));\\n }\\n }\\n else\\n {\\n for (int i = 1; i < argc; i++)\\n {\\n int number = RomanNumerals_parseInt(argv[i]);\\n if (number)\\n {\\n puts(RomanNumerals_toString(number));\\n }\\n else\\n {\\n puts(\\\"???\\\");\\n }\\n }\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <string>\\n\\nstd::string to_roman(int value)\\n{\\n struct romandata_t { int value; char const* numeral; };\\n static romandata_t const romandata[] =\\n { 1000, \\\"M\\\",\\n 900, \\\"CM\\\",\\n 500, \\\"D\\\",\\n 400, \\\"CD\\\",\\n 100, \\\"C\\\",\\n 90, \\\"XC\\\",\\n 50, \\\"L\\\",\\n 40, \\\"XL\\\",\\n 10, \\\"X\\\",\\n 9, \\\"IX\\\",\\n 5, \\\"V\\\",\\n 4, \\\"IV\\\",\\n 1, \\\"I\\\",\\n 0, NULL }; // end marker\\n\\n std::string result;\\n for (romandata_t const* current = romandata; current->value > 0; ++current)\\n {\\n while (value >= current->value)\\n {\\n result += current->numeral;\\n value -= current->value;\\n }\\n }\\n return result;\\n}\\n\\nint main()\\n{\\n for (int i = 1; i <= 4000; ++i)\\n {\\n std::cout << to_roman(i) << std::endl;\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <string>\\n\\nstd::string to_roman(int x) {\\n if (x <= 0)\\n return \\\"Negative or zero!\\\";\\n auto roman_digit = [](char one, char five, char ten, int x) {\\n if (x <= 3)\\n return std::string().assign(x, one);\\n if (x <= 5)\\n return std::string().assign(5 - x, one) + five;\\n if (x <= 8)\\n return five + std::string().assign(x - 5, one);\\n return std::string().assign(10 - x, one) + ten;\\n };\\n if (x >= 1000)\\n return x - 1000 > 0 ? \\\"M\\\" + to_roman(x - 1000) : \\\"M\\\";\\n if (x >= 100) {\\n auto s = roman_digit('C', 'D', 'M', x / 100);\\n return x % 100 > 0 ? s + to_roman(x % 100) : s;\\n }\\n if (x >= 10) {\\n auto s = roman_digit('X', 'L', 'C', x / 10);\\n return x % 10 > 0 ? s + to_roman(x % 10) : s;\\n }\\n return roman_digit('I', 'V', 'X', x);\\n}\\n\\nint main() {\\n for (int i = 0; i < 2018; i++)\\n std::cout << i << \\\" --> \\\" << to_roman(i) << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nclass Program\\n{\\n static uint[] nums = { 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 };\\n static string[] rum = { \\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\", \\\"L\\\", \\\"XL\\\", \\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\", \\\"I\\\" };\\n\\n static string ToRoman(uint number)\\n {\\n string value = \\\"\\\";\\n for (int i = 0; i < nums.Length && number != 0; i++)\\n {\\n while (number >= nums[i])\\n {\\n number -= nums[i];\\n value += rum[i];\\n }\\n }\\n return value;\\n }\\n\\n static void Main()\\n {\\n for (uint number = 1; number <= 1 << 10; number *= 2)\\n {\\n Console.WriteLine(\\\"{0} = {1}\\\", number, ToRoman(number));\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"Func<int, string> toRoman = (number) =>\\n new Dictionary<int, string>\\n {\\n {1000, \\\"M\\\"},\\n {900, \\\"CM\\\"},\\n {500, \\\"D\\\"},\\n {400, \\\"CD\\\"},\\n {100, \\\"C\\\"},\\n {90, \\\"XC\\\"},\\n {50, \\\"L\\\"},\\n {40, \\\"XL\\\"},\\n {10, \\\"X\\\"},\\n {9, \\\"IX\\\"},\\n {5, \\\"V\\\"},\\n {4, \\\"IV\\\"},\\n {1, \\\"I\\\"}\\n }.Aggregate(new string('I', number), (m, _) => m.Replace(new string('I', _.Key), _.Value));\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"shared void run() {\\n\\t\\n\\tclass Numeral(shared Character char, shared Integer int) {}\\n\\t\\n\\tvalue tiers = [\\n\\t\\t[Numeral('I', 1), Numeral('V', 5), Numeral('X', 10)],\\n\\t\\t[Numeral('X', 10), Numeral('L', 50), Numeral('C', 100)],\\n\\t\\t[Numeral('C', 100), Numeral('D', 500), Numeral('M', 1k)]\\n\\t];\\n\\t\\n\\tString toRoman(Integer hindu, Integer tierIndex = 2) {\\n\\t\\t\\n\\t\\tassert (exists tier = tiers[tierIndex]);\\n\\t\\t\\n\\t\\t\\\" Finds if it's a two character numeral like iv, ix, xl, xc, cd and cm.\\\"\\n\\t\\tfunction findTwoCharacterNumeral() =>\\n\\t\\t\\tif (exists bigNum = tier.rest.find((numeral) => numeral.int - tier.first.int <= hindu < numeral.int))\\n\\t\\t\\tthen [tier.first, bigNum]\\n\\t\\t\\telse null;\\n\\t\\t\\n\\t\\tif (hindu <= 0) {\\n\\t\\t\\t// if it's zero then we are done!\\n\\t\\t\\treturn \\\"\\\";\\n\\t\\t}\\n\\t\\telse if (exists [smallNum, bigNum] = findTwoCharacterNumeral()) {\\n\\t\\t\\tvalue twoCharSymbol = \\\"``smallNum.char````bigNum.char``\\\";\\n\\t\\t\\tvalue twoCharValue = bigNum.int - smallNum.int;\\n\\t\\t\\treturn \\\"``twoCharSymbol````toRoman(hindu - twoCharValue, tierIndex)``\\\";\\n\\t\\t}\\n\\t\\telse if (exists num = tier.reversed.find((Numeral elem) => hindu >= elem.int)) {\\n\\t\\t\\treturn \\\"``num.char````toRoman(hindu - num.int, tierIndex)``\\\";\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\t// nothing was found so move to the next smaller tier!\\n\\t\\t\\treturn toRoman(hindu, tierIndex - 1);\\n\\t\\t}\\n\\t}\\n\\t\\n\\tassert (toRoman(1) == \\\"I\\\");\\n\\tassert (toRoman(2) == \\\"II\\\");\\n\\tassert (toRoman(4) == \\\"IV\\\");\\n\\tassert (toRoman(1666) == \\\"MDCLXVI\\\");\\n\\tassert (toRoman(1990) == \\\"MCMXC\\\");\\n\\tassert (toRoman(2008) == \\\"MMVIII\\\");\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"100 cls\\n110 dim arabic(12), roman$(12)\\n120 for j = 0 to 12 : read arabic(j),roman$(j) : next j\\n130 data 1000,\\\"M\\\", 900,\\\"CM\\\", 500,\\\"D\\\", 400,\\\"CD\\\", 100,\\\"C\\\", 90,\\\"XC\\\"\\n140 data 50,\\\"L\\\",40,\\\"XL\\\",10,\\\"X\\\",9,\\\"IX\\\",5,\\\"V\\\",4,\\\"IV\\\",1,\\\"I\\\"\\n187 avalor = 1990 : print avalor \\\"= \\\"; : gosub 220 : print roman$ ' MCMXC\\n188 avalor = 2008 : print avalor \\\"= \\\"; : gosub 220 : print roman$ ' MMXXII\\n189 avalor = 1666 : print avalor \\\"= \\\"; : gosub 220 : print roman$ ' MDCLXVI\\n200 end\\n210 rem Encode to Roman\\n220 roman$ = \\\"\\\" : i = 0\\n230 while (i <= 12) and (avalor > 0)\\n240 while avalor >= arabic(i)\\n250 roman$ = roman$+roman$(i)\\n260 avalor = avalor-arabic(i)\\n270 wend\\n280 i = i+1\\n290 wend\\n300 return\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"(def arabic->roman\\n (partial clojure.pprint/cl-format nil \\\"~@R\\\"))\\n\\n(arabic->roman 147)\\n;\\\"CXXIII\\\"\\n(arabic->roman 99)\\n;\\\"XCIX\\\"\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(def roman-map\\n (sorted-map\\n 1 \\\"I\\\", 4 \\\"IV\\\", 5 \\\"V\\\", 9 \\\"IX\\\",\\n 10 \\\"X\\\", 40 \\\"XL\\\", 50 \\\"L\\\", 90 \\\"XC\\\",\\n 100 \\\"C\\\", 400 \\\"CD\\\", 500 \\\"D\\\", 900 \\\"CM\\\"\\n 1000 \\\"M\\\"))\\n\\n(defn int->roman [n]\\n {:pre (integer? n)}\\n (loop [res (StringBuilder.), n n]\\n (if-let [v (roman-map n)]\\n (str (.append res v))\\n (let [[k v] (->> roman-map keys (filter #(> n %)) last (find roman-map))]\\n (recur (.append res v) (- n k))))))\\n\\n(int->roman 1999)\\n; \\\"MCMXCIX\\\"\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defn a2r [a]\\n (let [rv '(1000 500 100 50 10 5 1)\\n rm (zipmap rv \\\"MDCLXVI\\\")\\n dv (->> rv (take-nth 2) next #(interleave % %))]\\n (loop [a a rv rv dv dv r nil]\\n (if (<= a 0)\\n r\\n (let [v (first rv)\\n d (or (first dv) 0)\\n l (- v d)]\\n (cond\\n (= a v) (str r (rm v))\\n (= a l) (str r (rm d) (rm v))\\n (and (> a v) (> a l)) (recur (- a v) rv dv (str r (rm v)))\\n (and (< a v) (< a l)) (recur a (rest rv) (rest dv) r)\\n :else (recur (- a l) (rest rv) (rest dv) (str r (rm d) (rm v)))))))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(a2r 1666)\\n\\\"MDCLXVI\\\"\\n\\n(map a2r [1000 1 389 45])\\n(\\\"M\\\" \\\"I\\\" \\\"CCCLXXXIX\\\" \\\"XLV\\\")\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(def roman-map\\n (sorted-map-by >\\n 1 \\\"I\\\", 4 \\\"IV\\\", 5 \\\"V\\\", 9 \\\"IX\\\",\\n 10 \\\"X\\\", 40 \\\"XL\\\", 50 \\\"L\\\", 90 \\\"XC\\\",\\n 100 \\\"C\\\", 400 \\\"CD\\\", 500 \\\"D\\\", 900 \\\"CM\\\"\\n 1000 \\\"M\\\"))\\n\\n(defn a2r\\n ([r]\\n (reduce str (a2r r (keys roman-map))))\\n ([r n]\\n (when-not (empty? n)\\n (let [e (first n)\\n v (- r e)\\n roman (roman-map e)]\\n (cond\\n (< v 0) (a2r r (rest n))\\n (= v 0) (cons roman [])\\n (>= v e) (cons roman (a2r v n))\\n (< v e) (cons roman (a2r v (rest n))))))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(a2r 1666)\\n\\\"MDCLXVI\\\"\\n\\n(map a2r [1000 1 389 45])\\n(\\\"M\\\" \\\"I\\\" \\\"CCCLXXXIX\\\" \\\"XLV\\\")\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"roman = cluster is encode\\n rep = null\\n\\n dmap = struct[v: int, s: string]\\n darr = array[dmap]\\n own chunks: darr := darr$\\n [dmap${v: 1000, s: \\\"M\\\"},\\n dmap${v: 900, s: \\\"CM\\\"},\\n dmap${v: 500, s: \\\"D\\\"},\\n dmap${v: 400, s: \\\"CD\\\"},\\n dmap${v: 100, s: \\\"C\\\"},\\n dmap${v: 90, s: \\\"XC\\\"},\\n dmap${v: 50, s: \\\"L\\\"},\\n dmap${v: 40, s: \\\"XL\\\"},\\n dmap${v: 10, s: \\\"X\\\"},\\n dmap${v: 9, s: \\\"IX\\\"},\\n dmap${v: 5, s: \\\"V\\\"},\\n dmap${v: 4, s: \\\"IV\\\"},\\n dmap${v: 1, s: \\\"I\\\"}]\\n\\n largest_chunk = proc (i: int) returns (int, string)\\n for chunk: dmap in darr$elements(chunks) do\\n if chunk.v <= i then return (chunk.v, chunk.s) end\\n end\\n return (0, \\\"\\\")\\n end largest_chunk\\n\\n encode = proc (i: int) returns (string)\\n result: string := \\\"\\\"\\n while i > 0 do\\n val: int chunk: string\\n val, chunk := largest_chunk(i)\\n result := result || chunk\\n i := i - val\\n end\\n return (result)\\n end encode\\nend roman\\n\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n tests: array[int] := array[int]$[1666, 2008, 1001, 1999, 3888, 2021]\\n\\n for test: int in array[int]$elements(tests) do\\n stream$putl(po, int$unparse(test) || \\\" = \\\" || roman$encode(test))\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \"IDENTIFICATION DIVISION.\\nPROGRAM-ID. TOROMAN.\\nDATA DIVISION.\\nworking-storage section.\\n 01 ws-number pic 9(4) value 0.\\n 01 ws-save-number pic 9(4).\\n 01 ws-tbl-def.\\n 03 filler pic x(7) value '1000M '.\\n 03 filler pic x(7) value '0900CM '.\\n 03 filler pic x(7) value '0500D '.\\n 03 filler pic x(7) value '0400CD '.\\n 03 filler pic x(7) value '0100C '.\\n 03 filler pic x(7) value '0090XC '.\\n 03 filler pic x(7) value '0050L '.\\n 03 filler pic x(7) value '0040XL '.\\n 03 filler pic x(7) value '0010X '.\\n 03 filler pic x(7) value '0009IX '.\\n 03 filler pic x(7) value '0005V '.\\n 03 filler pic x(7) value '0004IV '.\\n 03 filler pic x(7) value '0001I '.\\n 01 filler redefines ws-tbl-def.\\n 03 filler occurs 13 times indexed by rx.\\n 05 ws-tbl-divisor pic 9(4).\\n 05 ws-tbl-roman-ch pic x(1) occurs 3 times indexed by cx.\\n 01 ocx pic 99.\\n 01 ws-roman.\\n 03 ws-roman-ch pic x(1) occurs 16 times.\\nPROCEDURE DIVISION.\\n accept ws-number\\n perform\\n until ws-number = 0\\n move ws-number to ws-save-number\\n if ws-number > 0 and ws-number < 4000\\n initialize ws-roman\\n move 0 to ocx\\n perform varying rx from 1 by +1\\n until ws-number = 0\\n perform until ws-number < ws-tbl-divisor (rx)\\n perform varying cx from 1 by +1\\n \\t\\t until ws-tbl-roman-ch (rx, cx) = spaces\\n compute ocx = ocx + 1\\n move ws-tbl-roman-ch (rx, cx) to ws-roman-ch (ocx)\\n end-perform\\n compute ws-number = ws-number - ws-tbl-divisor (rx)\\n end-perform\\n end-perform\\n display 'inp=' ws-save-number ' roman=' ws-roman\\n else\\n display 'inp=' ws-save-number ' invalid'\\n end-if\\n accept ws-number\\n end-perform\\n .\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"decimal_to_roman = (n) ->\\n # This should work for any positive integer, although it\\n # gets a bit preposterous for large numbers.\\n if n >= 4000\\n thousands = decimal_to_roman n / 1000\\n ones = decimal_to_roman n % 1000\\n return \\\"M(#{thousands})#{ones}\\\"\\n\\n s = ''\\n translate_each = (min, roman) ->\\n while n >= min\\n n -= min\\n s += roman\\n translate_each 1000, \\\"M\\\"\\n translate_each 900, \\\"CM\\\"\\n translate_each 500, \\\"D\\\"\\n translate_each 400, \\\"CD\\\"\\n translate_each 100, \\\"C\\\"\\n translate_each 90, \\\"XC\\\"\\n translate_each 50, \\\"L\\\"\\n translate_each 40, \\\"XL\\\"\\n translate_each 10, \\\"X\\\"\\n translate_each 9, \\\"IX\\\"\\n translate_each 5, \\\"V\\\"\\n translate_each 4, \\\"IV\\\"\\n translate_each 1, \\\"I\\\"\\n s\\n\\n###################\\ntests =\\n IV: 4\\n XLII: 42\\n MCMXC: 1990\\n MMVIII: 2008\\n MDCLXVI: 1666\\n 'M(IV)': 4000\\n 'M(VI)IX': 6009\\n 'M(M(CXXIII)CDLVI)DCCLXXXIX': 123456789\\n 'M(MMMV)I': 3005001\\n\\nfor expected, decimal of tests\\n roman = decimal_to_roman(decimal)\\n if roman == expected\\n console.log \\\"#{decimal} = #{roman}\\\"\\n else\\n console.log \\\"error for #{decimal}: #{roman} is wrong\\\"\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"100 DIM RN$(12),NV(12)\\n110 FOR I=0 TO 12\\n120 : READ RN$(I), NV(I)\\n130 NEXT I\\n140 DATA M,1000, CM,900, D,500, CD,400\\n150 DATA C, 100, XC, 90, L, 50, XL, 40\\n160 DATA X, 10, IX, 9, V, 5, IV, 4\\n170 DATA I, 1\\n180 PRINT CHR$(19);CHR$(19);CHR$(147);CHR$(18);\\n190 PRINT \\\"***** ROMAN NUMERAL ENCODER *****\\\";CHR$(27);\\\"T\\\"\\n200 DO\\n210 : PRINT \\\"ENTER NUMBER (0 TO QUIT):\\\";\\n220 : OPEN 1,0:INPUT#1,AN$:CLOSE 1:PRINT\\n230 : AN=VAL(AN$):IF AN=0 THEN EXIT\\n240 : RN$=\\\"\\\"\\n250 : DO WHILE AN > 0\\n260 : FOR I=0 TO 12\\n270 : IF AN >= NV(I) THEN BEGIN\\n280 : RN$ = RN$+ RN$(I)\\n290 : AN = AN - NV(I)\\n300 : GOTO 330\\n310 : BEND\\n320 : NEXT I\\n330 : LOOP\\n340 : PRINT RN$;CHR$(13)\\n350 LOOP\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"100 DIM RN$(12),NV(12)\\n110 FOR I=0 TO 12\\n120 : READ RN$(I), NV(I)\\n130 NEXT I\\n140 DATA M,1000, CM,900, D,500, CD,400\\n150 DATA C, 100, XC, 90, L, 50, XL, 40\\n160 DATA X, 10, IX, 9, V, 5, IV, 4\\n170 DATA I, 1\\n180 PRINT CHR$(19);CHR$(19);CHR$(147);CHR$(18);\\n190 PRINT \\\"***** ROMAN NUMERAL ENCODER *****\\\";CHR$(27);\\\"T\\\"\\n200 DO\\n210 : PRINT \\\"ENTER NUMBER (0 TO QUIT):\\\";\\n220 : OPEN 1,0:INPUT#1,AN$:CLOSE 1:PRINT\\n230 : AN=VAL(AN$):IF AN=0 THEN EXIT\\n240 : RN$=\\\"\\\"\\n250 : DO WHILE AN > 0\\n260 : FOR I=0 TO 12\\n270 : IF AN < NV(I) THEN 320\\n280 : RN$ = RN$+ RN$(I)\\n290 : AN = AN - NV(I)\\n300 : I = 12\\n320 : NEXT I\\n330 : LOOP\\n340 : PRINT RN$;CHR$(13)\\n350 LOOP\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"100 DIM RN$(12),NV(12)\\n110 FOR I=0 TO 12\\n120 : READ RN$(I), NV(I)\\n130 NEXT I\\n140 DATA M,1000, CM,900, D,500, CD,400\\n150 DATA C, 100, XC, 90, L, 50, XL, 40\\n160 DATA X, 10, IX, 9, V, 5, IV, 4\\n170 DATA I, 1\\n180 PRINT CHR$(19);CHR$(19);CHR$(147);CHR$(18);\\n190 PRINT \\\"***** ROMAN NUMERAL ENCODER *****\\\";\\n200 REM BEGIN MAIN LOOP\\n210 : PRINT \\\"NUMBER (0 TO QUIT):\\\";\\n220 : OPEN 1,0:INPUT#1,AN$:CLOSE 1:PRINT\\n230 : AN=VAL(AN$):IF AN=0 THEN END\\n240 : RN$=\\\"\\\"\\n250 : IF AN <= 0 THEN 340\\n260 : FOR I=0 TO 12\\n270 : IF AN < NV(I) THEN 320\\n280 : RN$ = RN$+ RN$(I)\\n290 : AN = AN - NV(I)\\n300 : I = 12\\n320 : NEXT I\\n330 : GOTO 250\\n340 : PRINT RN$;CHR$(13)\\n350 GOTO 210\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"(defun roman-numeral (n)\\n (format nil \\\"~@R\\\" n))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\ninclude \\\"argv.coh\\\";\\n\\n# Encode the given number as a Roman numeral\\nsub decimalToRoman(num: uint16, buf: [uint8]): (rslt: [uint8]) is\\n # return the start of the buffer for easy printing\\n rslt := buf;\\n\\n # Add string to buffer\\n sub Add(str: [uint8]) is\\n while [str] != 0 loop\\n [buf] := [str];\\n buf := @next buf;\\n str := @next str;\\n end loop;\\n end sub;\\n\\n # Table of Roman numerals\\n record Roman is\\n value: uint16;\\n string: [uint8];\\n end record;\\n\\n var numerals: Roman[] := {\\n {1000, \\\"M\\\"}, {900, \\\"CM\\\"}, {500, \\\"D\\\"}, {400, \\\"CD\\\"},\\n {100, \\\"C\\\"}, {90, \\\"XC\\\"}, {50, \\\"L\\\"}, {40, \\\"XL\\\"},\\n {10, \\\"X\\\"}, {9, \\\"IX\\\"}, {5, \\\"V\\\"}, {4, \\\"IV\\\"},\\n {1, \\\"I\\\"}\\n };\\n\\n var curNum := &numerals as [Roman];\\n while num != 0 loop\\n while num >= curNum.value loop\\n Add(curNum.string);\\n num := num - curNum.value;\\n end loop;\\n curNum := @next curNum;\\n end loop;\\n\\n [buf] := 0; # terminate the string\\nend sub;\\n\\n# Read numbers from the command line and print the corresponding Roman numerals\\nArgvInit();\\nvar buffer: uint8[100];\\nloop\\n var argmt := ArgvNext();\\n if argmt == (0 as [uint8]) then\\n break;\\n end if;\\n\\n var dummy: [uint8];\\n var number: int32;\\n (number, dummy) := AToI(argmt);\\n\\n print(decimalToRoman(number as uint16, &buffer as [uint8]));\\n print_nl();\\nend loop;\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"string toRoman(int n) pure nothrow\\nin {\\n assert(n < 5000);\\n} body {\\n static immutable weights = [1000, 900, 500, 400, 100, 90,\\n 50, 40, 10, 9, 5, 4, 1];\\n static immutable symbols = [\\\"M\\\",\\\"CM\\\",\\\"D\\\",\\\"CD\\\",\\\"C\\\",\\\"XC\\\",\\\"L\\\",\\n \\\"XL\\\",\\\"X\\\",\\\"IX\\\",\\\"V\\\",\\\"IV\\\",\\\"I\\\"];\\n\\n string roman;\\n foreach (i, w; weights) {\\n while (n >= w) {\\n roman ~= symbols[i];\\n n -= w;\\n }\\n if (n == 0)\\n break;\\n }\\n return roman;\\n} unittest {\\n assert(toRoman(455) == \\\"CDLV\\\");\\n assert(toRoman(3456) == \\\"MMMCDLVI\\\");\\n assert(toRoman(2488) == \\\"MMCDLXXXVIII\\\");\\n}\\n\\nvoid main() {}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program RomanNumeralsEncode;\\n\\n{$APPTYPE CONSOLE}\\n\\nfunction IntegerToRoman(aValue: Integer): string;\\nvar\\n i: Integer;\\nconst\\n WEIGHTS: array[0..12] of Integer = (1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1);\\n SYMBOLS: array[0..12] of string = ('M', 'CM', 'D', 'CD', 'C', 'XC', 'L', 'XL', 'X', 'IX', 'V', 'IV', 'I');\\nbegin\\n for i := Low(WEIGHTS) to High(WEIGHTS) do\\n begin\\n while aValue >= WEIGHTS[i] do\\n begin\\n Result := Result + SYMBOLS[i];\\n aValue := aValue - WEIGHTS[i];\\n end;\\n if aValue = 0 then\\n Break;\\n end;\\nend;\\n\\nbegin\\n Writeln(IntegerToRoman(1990)); // MCMXC\\n Writeln(IntegerToRoman(2008)); // MMVIII\\n Writeln(IntegerToRoman(1666)); // MDCLXVI\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"const weights = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1];\\nconst symbols = [\\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\", \\\"L\\\", \\\"XL\\\", \\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\", \\\"I\\\"];\\n\\nfunction toRoman(n : Integer) : String;\\nvar\\n i, w : Integer;\\nbegin\\n for i := 0 to weights.High do begin\\n w := weights[i];\\n while n >= w do begin\\n Result += symbols[i];\\n n -= w;\\n end;\\n if n = 0 then Break;\\n end;\\nend;\\n\\nPrintLn(toRoman(455));\\nPrintLn(toRoman(3456));\\nPrintLn(toRoman(2488));\\n\",\n \"language\": \"DWScript\"\n },\n {\n \"code\": \"func$ dec2rom dec .\\n values[] = [ 1000 900 500 400 100 90 50 40 10 9 5 4 1 ]\\n symbol$[] = [ \\\"M\\\" \\\"CM\\\" \\\"D\\\" \\\"CD\\\" \\\"C\\\" \\\"XC\\\" \\\"L\\\" \\\"XL\\\" \\\"X\\\" \\\"IX\\\" \\\"V\\\" \\\"IV\\\" \\\"I\\\" ]\\n for i = 1 to len values[]\\n while dec >= values[i]\\n rom$ &= symbol$[i]\\n dec -= values[i]\\n .\\n .\\n return rom$\\n.\\nprint dec2rom 1990\\nprint dec2rom 2008\\nprint dec2rom 1666\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"RomanEncode(UNSIGNED Int) := FUNCTION\\n SetWeights := [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1];\\n SetSymbols := ['M', 'CM', 'D', 'CD', 'C', 'XC', 'L', 'XL', 'X', 'IX', 'V', 'IV', 'I'];\\n ProcessRec := RECORD\\n UNSIGNED val;\\n STRING Roman;\\n END;\\n dsWeights := DATASET(13,TRANSFORM(ProcessRec,SELF.val := Int, SELF := []));\\n\\n SymbolStr(i,n,STRING s) := CHOOSE(n+1,'',SetSymbols[i],SetSymbols[i]+SetSymbols[i],SetSymbols[i]+SetSymbols[i]+SetSymbols[i],s);\\n\\t\\n RECORDOF(dsWeights) XF(dsWeights L, dsWeights R, INTEGER C) := TRANSFORM\\n ThisVal := IF(C=1,R.Val,L.Val);\\n IsDone := ThisVal = 0;\\n SELF.Roman := IF(IsDone,L.Roman,L.Roman + SymbolStr(C,ThisVal DIV SetWeights[C],L.Roman));\\n SELF.val := IF(IsDone,0,ThisVal - ((ThisVal DIV SetWeights[C])*SetWeights[C]));\\n END;\\n i := ITERATE(dsWeights,XF(LEFT,RIGHT,COUNTER));\\n RETURN i[13].Roman;\\nEND;\\n\\nRomanEncode(1954); //MCMLIV\\nRomanEncode(1990 ); //MCMXC\\nRomanEncode(2008 ); //MMVIII\\nRomanEncode(1666); //MDCLXVI\\n\",\n \"language\": \"ECL\"\n },\n {\n \"code\": \"class\\n\\tAPPLICATION\\n\\ncreate\\n\\tmake\\n\\nfeature {NONE} -- Initialization\\n\\n\\tmake\\n\\t\\tlocal\\n\\t\\t\\tnumbers: ARRAY [INTEGER]\\n\\t\\tdo\\n\\t\\t\\tnumbers := <<1990, 2008, 1666, 3159, 1977, 2010>>\\n\\t\\t\\t\\t -- \\\"MCMXC\\\", \\\"MMVIII\\\", \\\"MDCLXVI\\\", \\\"MMMCLIX\\\", \\\"MCMLXXVII\\\", \\\"MMX\\\"\\n\\t\\t\\tacross numbers as n loop\\n\\t\\t\\t\\tprint (n.item.out + \\\" in decimal Arabic numerals is \\\" +\\n\\t\\t\\t\\t decimal_to_roman (n.item) + \\\" in Roman numerals.%N\\\")\\n\\t\\t\\tend\\n\\t\\tend\\n\\nfeature -- Roman numerals\\n\\n\\tdecimal_to_roman (a_int: INTEGER): STRING\\n\\t\\t-- Representation of integer `a_int' as Roman numeral\\n\\t\\trequire\\n\\t\\t\\ta_int > 0\\n\\t\\tlocal\\n\\t\\t\\tdnums: ARRAY[INTEGER]\\n\\t\\t\\trnums: ARRAY[STRING]\\n\\n\\t\\t\\tdnum: INTEGER\\n\\t\\t\\trnum: STRING\\n\\n\\t\\t\\ti: INTEGER\\n\\t\\tdo\\n\\t\\t\\tdnums := <<1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1>>\\n\\t\\t\\trnums := <<\\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\", \\\"L\\\", \\\"XL\\\", \\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\", \\\"I\\\">>\\n\\n\\t\\t\\tdnum := a_int\\n\\t\\t\\trnum := \\\"\\\"\\n\\n\\t\\t\\tfrom\\n\\t\\t\\t\\ti := 1\\n\\t\\t\\tuntil\\n\\t\\t\\t\\ti > dnums.count or dnum <= 0\\n\\t\\t\\tloop\\n\\t\\t\\t\\tfrom\\n\\t\\t\\t\\tuntil\\n\\t\\t\\t\\t\\tdnum < dnums[i]\\n\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\tdnum := dnum - dnums[i]\\n\\t\\t\\t\\t\\trnum := rnum + rnums[i]\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\ti := i + 1\\n\\t\\t\\tend\\n\\n\\t\\t\\tResult := rnum\\n\\t\\tend\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"open number string math\\n\\ndigit x y z k =\\n [[x],[x,x],[x,x,x],[x,y],[y],[y,x],[y,x,x],[y,x,x,x],[x,z]] :\\n (toInt k - 1)\\n\\ntoRoman 0 = \\\"\\\"\\ntoRoman x | x < 0 = fail \\\"Negative roman numeral\\\"\\n | x >= 1000 = 'M' :: toRoman (x - 1000)\\n | x >= 100 = let (q,r) = x `divrem` 100 in\\n digit 'C' 'D' 'M' q ++ toRoman r\\n | x >= 10 = let (q,r) = x `divrem` 10 in\\n digit 'X' 'L' 'C' q ++ toRoman r\\n | else = digit 'I' 'V' 'X' x\\n\\nmap (join \\\"\\\" << toRoman) [1999,25,944]\\n\",\n \"language\": \"Ela\"\n },\n {\n \"code\": \"import system'collections;\\nimport system'routines;\\nimport extensions;\\nimport extensions'text;\\n\\nstatic RomanDictionary = Dictionary.new()\\n .setAt(1000, \\\"M\\\")\\n .setAt(900, \\\"CM\\\")\\n .setAt(500, \\\"D\\\")\\n .setAt(400, \\\"CD\\\")\\n .setAt(100, \\\"C\\\")\\n .setAt(90, \\\"XC\\\")\\n .setAt(50, \\\"L\\\")\\n .setAt(40, \\\"XL\\\")\\n .setAt(10, \\\"X\\\")\\n .setAt(9, \\\"IX\\\")\\n .setAt(5, \\\"V\\\")\\n .setAt(4, \\\"IV\\\")\\n .setAt(1, \\\"I\\\");\\n\\nextension op\\n{\\n toRoman()\\n = RomanDictionary.accumulate(new StringWriter(\\\"I\\\", self), (m,kv => m.replace(new StringWriter(\\\"I\\\",kv.Key).Value, kv.Value)));\\n}\\n\\npublic program()\\n{\\n console.printLine(\\\"1990 : \\\", 1990.toRoman());\\n console.printLine(\\\"2008 : \\\", 2008.toRoman());\\n console.printLine(\\\"1666 : \\\", 1666.toRoman())\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"defmodule Roman_numeral do\\n def encode(0), do: ''\\n def encode(x) when x >= 1000, do: [?M | encode(x - 1000)]\\n def encode(x) when x >= 100, do: digit(div(x,100), ?C, ?D, ?M) ++ encode(rem(x,100))\\n def encode(x) when x >= 10, do: digit(div(x,10), ?X, ?L, ?C) ++ encode(rem(x,10))\\n def encode(x) when x >= 1, do: digit(x, ?I, ?V, ?X)\\n\\n defp digit(1, x, _, _), do: [x]\\n defp digit(2, x, _, _), do: [x, x]\\n defp digit(3, x, _, _), do: [x, x, x]\\n defp digit(4, x, y, _), do: [x, y]\\n defp digit(5, _, y, _), do: [y]\\n defp digit(6, x, y, _), do: [y, x]\\n defp digit(7, x, y, _), do: [y, x, x]\\n defp digit(8, x, y, _), do: [y, x, x, x]\\n defp digit(9, x, _, z), do: [x, z]\\nend\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"defmodule Roman_numeral do\\n @symbols [ {1000, 'M'}, {900, 'CM'}, {500, 'D'}, {400, 'CD'}, {100, 'C'}, {90, 'XC'},\\n {50, 'L'}, {40, 'XL'}, {10, 'X'}, {9, 'IX'}, {5, 'V'}, {4, 'IV'}, {1, 'I'} ]\\n def encode(num) do\\n {roman,_} = Enum.reduce(@symbols, {[], num}, fn {divisor, letter}, {memo, n} ->\\n {memo ++ List.duplicate(letter, div(n, divisor)), rem(n, divisor)}\\n end)\\n Enum.join(roman)\\n end\\nend\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"Enum.each([1990, 2008, 1666], fn n ->\\n IO.puts \\\"#{n}: #{Roman_numeral.encode(n)}\\\"\\nend)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"(defun ar2ro (AN)\\n \\\"Translate from arabic number AN to roman number.\\n For example, (ar2ro 1666) returns (M D C L X V I).\\\"\\n (cond\\n ((>= AN 1000) (cons 'M (ar2ro (- AN 1000))))\\n ((>= AN 900) (cons 'C (cons 'M (ar2ro (- AN 900)))))\\n ((>= AN 500) (cons 'D (ar2ro (- AN 500))))\\n ((>= AN 400) (cons 'C (cons 'D (ar2ro (- AN 400)))))\\n ((>= AN 100) (cons 'C (ar2ro (- AN 100))))\\n ((>= AN 90) (cons 'X (cons 'C (ar2ro (- AN 90)))))\\n ((>= AN 50) (cons 'L (ar2ro (- AN 50))))\\n ((>= AN 40) (cons 'X (cons 'L (ar2ro (- AN 40)))))\\n ((>= AN 10) (cons 'X (ar2ro (- AN 10))))\\n ((>= AN 5) (cons 'V (ar2ro (- AN 5))))\\n ((>= AN 4) (cons 'I (cons 'V (ar2ro (- AN 4)))))\\n ((>= AN 1) (cons 'I (ar2ro (- AN 1))))\\n ((= AN 0) nil)))\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"-module(roman).\\n-export([to_roman/1]).\\n\\nto_roman(0) -> [];\\nto_roman(X) when X >= 1000 -> [$M | to_roman(X - 1000)];\\nto_roman(X) when X >= 100 ->\\n digit(X div 100, $C, $D, $M) ++ to_roman(X rem 100);\\nto_roman(X) when X >= 10 ->\\n digit(X div 10, $X, $L, $C) ++ to_roman(X rem 10);\\nto_roman(X) when X >= 1 -> digit(X, $I, $V, $X).\\n\\ndigit(1, X, _, _) -> [X];\\ndigit(2, X, _, _) -> [X, X];\\ndigit(3, X, _, _) -> [X, X, X];\\ndigit(4, X, Y, _) -> [X, Y];\\ndigit(5, _, Y, _) -> [Y];\\ndigit(6, X, Y, _) -> [Y, X];\\ndigit(7, X, Y, _) -> [Y, X, X];\\ndigit(8, X, Y, _) -> [Y, X, X, X];\\ndigit(9, X, _, Z) -> [X, Z].\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"-module( roman_numerals ).\\n\\n-export( [encode_from_integer/1]).\\n\\n-record( encode_acc, {n, romans=\\\"\\\"} ).\\n\\nencode_from_integer( N ) when N > 0 ->\\n #encode_acc{romans=Romans} = lists:foldl( fun encode_from_integer/2, #encode_acc{n=N}, map() ),\\n Romans.\\n\\n\\nencode_from_integer( _Map, #encode_acc{n=0}=Acc ) -> Acc;\\nencode_from_integer( {_Roman, Value}, #encode_acc{n=N}=Acc ) when N < Value -> Acc;\\nencode_from_integer( {Roman, Value}, #encode_acc{n=N, romans=Romans} ) ->\\n Times = N div Value,\\n New_roman = lists:flatten( lists:duplicate(Times, Roman) ),\\n #encode_acc{n=N - (Times * Value), romans=Romans ++ New_roman}.\\n\\nmap() -> [{\\\"M\\\",1000}, {\\\"CM\\\",900}, {\\\"D\\\",500}, {\\\"CD\\\",400}, {\\\"C\\\",100}, {\\\"XC\\\",90}, {\\\"L\\\",50}, {\\\"XL\\\",40}, {\\\"X\\\",10}, {\\\"IX\\\",9}, {\\\"V\\\",5}, {\\\"IV\\\",4}, {\\\"I\\\\\\n\\\",1}].\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"PROGRAM ARAB2ROMAN\\n\\nDIM ARABIC%[12],ROMAN$[12]\\n\\nPROCEDURE TOROMAN(VALUE->ANS$)\\nLOCAL RESULT$\\n FOR I%=0 TO 12 DO\\n WHILE VALUE>=ARABIC%[I%] DO\\n RESULT$+=ROMAN$[I%]\\n VALUE-=ARABIC%[I%]\\n END WHILE\\n END FOR\\n ANS$=RESULT$\\nEND PROCEDURE\\n\\nBEGIN\\n!\\n!Testing\\n!\\n ARABIC%[]=(1000,900,500,400,100,90,50,40,10,9,5,4,1)\\n ROMAN$[]=(\\\"M\\\",\\\"CM\\\",\\\"D\\\",\\\"CD\\\",\\\"C\\\",\\\"XC\\\",\\\"L\\\",\\\"XL\\\",\\\"X\\\",\\\"IX\\\",\\\"V\\\",\\\"IV\\\",\\\"I\\\")\\n TOROMAN(2009->ANS$) PRINT(\\\"2009 = \\\";ANS$)\\n TOROMAN(1666->ANS$) PRINT(\\\"1666 = \\\";ANS$)\\n TOROMAN(3888->ANS$) PRINT(\\\"3888 = \\\";ANS$)\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"constant arabic = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 }\\nconstant roman = {\\\"M\\\", \\\"CM\\\", \\\"D\\\",\\\"CD\\\", \\\"C\\\",\\\"XC\\\",\\\"L\\\",\\\"XL\\\",\\\"X\\\",\\\"IX\\\",\\\"V\\\",\\\"IV\\\",\\\"I\\\"}\\n\\nfunction toRoman(integer val)\\n sequence result\\n result = \\\"\\\"\\n for i = 1 to 13 do\\n while val >= arabic[i] do\\n result &= roman[i]\\n val -= arabic[i]\\n end while\\n end for\\n return result\\nend function\\n\\nprintf(1,\\\"%d = %s\\\\n\\\",{2009,toRoman(2009)})\\nprintf(1,\\\"%d = %s\\\\n\\\",{1666,toRoman(1666)})\\nprintf(1,\\\"%d = %s\\\\n\\\",{3888,toRoman(3888)})\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"=ROMAN(2013,0)\\n\",\n \"language\": \"Excel\"\n },\n {\n \"code\": \"MMXIII\\n\",\n \"language\": \"Excel\"\n },\n {\n \"code\": \"let digit x y z = function\\n 1 -> x\\n | 2 -> x + x\\n | 3 -> x + x + x\\n | 4 -> x + y\\n | 5 -> y\\n | 6 -> y + x\\n | 7 -> y + x + x\\n | 8 -> y + x + x + x\\n | 9 -> x + z\\n | _ -> failwith \\\"invalid call to digit\\\"\\n\\nlet rec to_roman acc = function\\n | x when x >= 1000 -> to_roman (acc + \\\"M\\\") (x - 1000)\\n | x when x >= 100 -> to_roman (acc + digit \\\"C\\\" \\\"D\\\" \\\"M\\\" (x / 100)) (x % 100)\\n | x when x >= 10 -> to_roman (acc + digit \\\"X\\\" \\\"L\\\" \\\"C\\\" (x / 10)) (x % 10)\\n | x when x > 0 -> acc + digit \\\"I\\\" \\\"V\\\" \\\"X\\\" x\\n | 0 -> acc\\n | _ -> failwith \\\"invalid call to_roman (negative input)\\\"\\n\\nlet roman n = to_roman \\\"\\\" n\\n\\n[<EntryPoint>]\\nlet main args =\\n [1990; 2008; 1666]\\n |> List.map (fun n -> roman n)\\n |> List.iter (printfn \\\"%s\\\")\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USE: roman\\n( scratchpad ) 3333 >roman .\\n\\\"mmmcccxxxiii\\\"\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"CONSTANT: roman-digits\\n { \\\"m\\\" \\\"cm\\\" \\\"d\\\" \\\"cd\\\" \\\"c\\\" \\\"xc\\\" \\\"l\\\" \\\"xl\\\" \\\"x\\\" \\\"ix\\\" \\\"v\\\" \\\"iv\\\" \\\"i\\\" }\\n\\nCONSTANT: roman-values\\n { 1000 900 500 400 100 90 50 40 10 9 5 4 1 }\\n\\nERROR: roman-range-error n ;\\n\\n: roman-range-check ( n -- n )\\n dup 1 10000 between? [ roman-range-error ] unless ;\\n\\n: >roman ( n -- str )\\n roman-range-check\\n roman-values roman-digits [\\n [ /mod swap ] dip <repetition> concat\\n ] 2map \\\"\\\" concat-as nip ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"^$.\\\" \\\"\\n[$999>][1000- \\\"M\\\"]#\\n $899> [ 900-\\\"CM\\\"]?\\n $499> [ 500- \\\"D\\\"]?\\n $399> [ 400-\\\"CD\\\"]?\\n[$ 99>][ 100- \\\"C\\\"]#\\n $ 89> [ 90-\\\"XC\\\"]?\\n $ 49> [ 50- \\\"L\\\"]?\\n $ 39> [ 40-\\\"XL\\\"]?\\n[$ 9>][ 10- \\\"X\\\"]#\\n $ 8> [ 9-\\\"IX\\\"]?\\n $ 4> [ 5- \\\"V\\\"]?\\n $ 3> [ 4-\\\"IV\\\"]?\\n[$ ][ 1- \\\"I\\\"]#%\\n\",\n \"language\": \"FALSE\"\n },\n {\n \"code\": \"**\\n** converts a number to its roman numeral representation\\n**\\nclass RomanNumerals\\n{\\n\\n private Str digit(Str x, Str y, Str z, Int i)\\n {\\n switch (i)\\n {\\n case 1: return x\\n case 2: return x+x\\n case 3: return x+x+x\\n case 4: return x+y\\n case 5: return y\\n case 6: return y+x\\n case 7: return y+x+x\\n case 8: return y+x+x+x\\n case 9: return x+z\\n }\\n return \\\"\\\"\\n }\\n\\n Str toRoman(Int i)\\n {\\n if (i>=1000) { return \\\"M\\\" + toRoman(i-1000) }\\n if (i>=100) { return digit(\\\"C\\\", \\\"D\\\", \\\"M\\\", i/100) + toRoman(i%100) }\\n if (i>=10) { return digit(\\\"X\\\", \\\"L\\\", \\\"C\\\", i/10) + toRoman(i%10) }\\n if (i>=1) { return digit(\\\"I\\\", \\\"V\\\", \\\"X\\\", i) }\\n return \\\"\\\"\\n }\\n\\n Void main()\\n {\\n 2000.times |i| { echo(\\\"$i = ${toRoman(i)}\\\") }\\n }\\n\\n}\\n\",\n \"language\": \"Fan\"\n },\n {\n \"code\": \": vector create ( n -- ) 0 do , loop does> ( n -- ) swap cells + @ execute ;\\n\\\\ these are ( numerals -- numerals )\\n: ,I dup c@ C, ; : ,V dup 1 + c@ C, ; : ,X dup 2 + c@ C, ;\\n\\n\\\\ these are ( numerals -- )\\n:noname ,I ,X drop ; :noname ,V ,I ,I ,I drop ; :noname ,V ,I ,I drop ;\\n:noname ,V ,I drop ; :noname ,V drop ; :noname ,I ,V drop ;\\n:noname ,I ,I ,I drop ; :noname ,I ,I drop ; :noname ,I drop ;\\n' drop ( 0 : no output ) 10 vector ,digit\\n\\t\\n: roman-rec ( numerals n -- ) 10 /mod dup if >r over 2 + r> recurse else drop then ,digit ;\\n: roman ( n -- c-addr u )\\n dup 0 4000 within 0= abort\\\" EX LIMITO!\\\"\\n HERE SWAP s\\\" IVXLCDM\\\" drop swap roman-rec HERE OVER - ;\\n\\n1999 roman type \\\\ MCMXCIX\\n 25 roman type \\\\ XXV\\n 944 roman type \\\\ CMXLIV\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"create romans 0 , 1 , 5 , 21 , 9 , 2 , 6 , 22 , 86 , 13 ,\\n does> swap cells + @ ;\\n\\n: roman-digit ( a1 n1 a2 n2 -- a3)\\n drop >r romans\\n begin dup while tuck 4 mod 1- chars r@ + c@ over c! char+ swap 4 / repeat\\n r> drop drop\\n;\\n\\n: (split) swap >r /mod r> swap ;\\n\\n: >roman ( n1 a -- a n2)\\n tuck 1000 (split) s\\\" M \\\" roman-digit 100 (split) s\\\" CDM\\\" roman-digit\\n 10 (split) s\\\" XLC\\\" roman-digit 1 (split) s\\\" IVX\\\" roman-digit nip over -\\n;\\n\\ncreate (roman) 16 chars allot\\n\\n1999 (roman) >roman type cr\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"program roman_numerals\\n\\n implicit none\\n\\n write (*, '(a)') roman (2009)\\n write (*, '(a)') roman (1666)\\n write (*, '(a)') roman (3888)\\n\\ncontains\\n\\nfunction roman (n) result (r)\\n\\n implicit none\\n integer, intent (in) :: n\\n integer, parameter :: d_max = 13\\n integer :: d\\n integer :: m\\n integer :: m_div\\n character (32) :: r\\n integer, dimension (d_max), parameter :: d_dec = &\\n & (/1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1/)\\n character (32), dimension (d_max), parameter :: d_rom = &\\n & (/'M ', 'CM', 'D ', 'CD', 'C ', 'XC', 'L ', 'XL', 'X ', 'IX', 'V ', 'IV', 'I '/)\\n\\n r = ''\\n m = n\\n do d = 1, d_max\\n m_div = m / d_dec (d)\\n r = trim (r) // repeat (trim (d_rom (d)), m_div)\\n m = m - d_dec (d) * m_div\\n end do\\n\\nend function roman\\n\\nend program roman_numerals\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"DIM SHARED arabic(0 TO 12) AS Integer => {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 }\\nDIM SHARED roman(0 TO 12) AS String*2 => {\\\"M\\\", \\\"CM\\\", \\\"D\\\",\\\"CD\\\", \\\"C\\\",\\\"XC\\\",\\\"L\\\",\\\"XL\\\",\\\"X\\\",\\\"IX\\\",\\\"V\\\",\\\"IV\\\",\\\"I\\\"}\\n\\nFUNCTION toRoman(value AS Integer) AS String\\n DIM i \\tAS Integer\\n DIM result AS String\\n\\n FOR i = 0 TO 12\\n DO WHILE value >= arabic(i)\\n\\t result = result + roman(i)\\n\\t value = value - arabic(i)\\n\\tLOOP\\n NEXT i\\n toRoman = result\\nEND FUNCTION\\n\\n'Testing\\nPRINT \\\"2009 = \\\"; toRoman(2009)\\nPRINT \\\"1666 = \\\"; toRoman(1666)\\nPRINT \\\"3888 = \\\"; toRoman(3888)\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nFunction romanEncode(n As Integer) As String\\n If n < 1 OrElse n > 3999 Then Return \\\"\\\" '' can only encode numbers in range 1 to 3999\\n Dim roman1(0 To 2) As String = {\\\"MMM\\\", \\\"MM\\\", \\\"M\\\"}\\n Dim roman2(0 To 8) As String = {\\\"CM\\\", \\\"DCCC\\\", \\\"DCC\\\", \\\"DC\\\", \\\"D\\\", \\\"CD\\\", \\\"CCC\\\", \\\"CC\\\", \\\"C\\\"}\\n Dim roman3(0 To 8) As String = {\\\"XC\\\", \\\"LXXX\\\", \\\"LXX\\\", \\\"LX\\\", \\\"L\\\", \\\"XL\\\", \\\"XXX\\\", \\\"XX\\\", \\\"X\\\"}\\n Dim roman4(0 To 8) As String = {\\\"IX\\\", \\\"VIII\\\", \\\"VII\\\", \\\"VI\\\", \\\"V\\\", \\\"IV\\\", \\\"III\\\", \\\"II\\\", \\\"I\\\"}\\n Dim As Integer thousands, hundreds, tens, units\\n thousands = n \\\\ 1000\\n n Mod= 1000\\n hundreds = n \\\\ 100\\n n Mod= 100\\n tens = n \\\\ 10\\n units = n Mod 10\\n Dim roman As String = \\\"\\\"\\n If thousands > 0 Then roman += roman1(3 - thousands)\\n If hundreds > 0 Then roman += roman2(9 - hundreds)\\n If tens > 0 Then roman += roman3(9 - tens)\\n If units > 0 Then roman += roman4(9 - units)\\n Return roman\\nEnd Function\\n\\nDim a(2) As Integer = {1990, 2008, 1666}\\nFor i As Integer = 0 To 2\\n Print a(i); \\\" => \\\"; romanEncode(a(i))\\nNext\\n\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"window 1\\n\\nlocal fn DecimaltoRoman( decimal as short ) as Str15\\n short arabic(12)\\n Str15 roman(12)\\n long i\\n Str15 result : result = \\\"\\\"\\n\\n arabic(0) = 1000 : arabic(1) = 900 : arabic(2) = 500 : arabic(3) = 400\\n arabic(4) = 100 : arabic(5) = 90 : arabic(6) = 50 : arabic(7) = 40\\n arabic(8) = 10 : arabic(9) = 9 : arabic(10) = 5 : arabic(11) = 4: arabic(12) = 1\\n\\n roman(0) = \\\"M\\\" : roman(1) = \\\"CM\\\" : roman(2) = \\\"D\\\" : roman(3) = \\\"CD\\\"\\n roman(4) = \\\"C\\\" : roman(5) = \\\"XC\\\" : roman(6) = \\\"L\\\" : roman(7) = \\\"XL\\\"\\n roman(8) = \\\"X\\\" : roman(9) = \\\"IX\\\" : roman(10) = \\\"V\\\" : roman(11) = \\\"IV\\\" : roman(12) = \\\"I\\\"\\n\\n for i = 0 to 12\\n while ( decimal >= arabic(i) )\\n result = result + roman(i)\\n decimal = decimal - arabic(i)\\n wend\\n next i\\n if result == \\\"\\\" then result = \\\"Zepherium\\\"\\nend fn = result\\n\\nprint \\\"1990 = \\\"; fn DecimaltoRoman( 1990 )\\nprint \\\"2008 = \\\"; fn DecimaltoRoman( 2008 )\\nprint \\\"2016 = \\\"; fn DecimaltoRoman( 2016 )\\nprint \\\"1666 = \\\"; fn DecimaltoRoman( 1666 )\\nprint \\\"3888 = \\\"; fn DecimaltoRoman( 3888 )\\nprint \\\"1914 = \\\"; fn DecimaltoRoman( 1914 )\\nprint \\\"1000 = \\\"; fn DecimaltoRoman( 1000 )\\nprint \\\" 513 = \\\"; fn DecimaltoRoman( 513 )\\nprint \\\" 33 = \\\"; fn DecimaltoRoman( 33 )\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"Public Sub Main()\\n\\n 'Testing\\n Print \\\"2009 = \\\"; toRoman(2009)\\n Print \\\"1666 = \\\"; toRoman(1666)\\n Print \\\"3888 = \\\"; toRoman(3888)\\n\\nEnd\\n\\nFunction toRoman(value As Integer) As String\\n\\n Dim result As String\\n Dim arabic As Integer[] = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\\n Dim roman As String[] = [\\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\", \\\"L\\\" , \\\"XL\\\", \\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\", \\\"I\\\"]\\n\\n\\n For i As Integer = 0 To arabic.Max\\n Do While value >= arabic[i]\\n result &= roman[i]\\n value -= arabic[i]\\n Loop\\n Next\\n Return result\\n\\nEnd Function\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nvar (\\n m0 = []string{\\\"\\\", \\\"I\\\", \\\"II\\\", \\\"III\\\", \\\"IV\\\", \\\"V\\\", \\\"VI\\\", \\\"VII\\\", \\\"VIII\\\", \\\"IX\\\"}\\n m1 = []string{\\\"\\\", \\\"X\\\", \\\"XX\\\", \\\"XXX\\\", \\\"XL\\\", \\\"L\\\", \\\"LX\\\", \\\"LXX\\\", \\\"LXXX\\\", \\\"XC\\\"}\\n m2 = []string{\\\"\\\", \\\"C\\\", \\\"CC\\\", \\\"CCC\\\", \\\"CD\\\", \\\"D\\\", \\\"DC\\\", \\\"DCC\\\", \\\"DCCC\\\", \\\"CM\\\"}\\n m3 = []string{\\\"\\\", \\\"M\\\", \\\"MM\\\", \\\"MMM\\\", \\\"I̅V̅\\\",\\n \\\"V̅\\\", \\\"V̅I̅\\\", \\\"V̅I̅I̅\\\", \\\"V̅I̅I̅I̅\\\", \\\"I̅X̅\\\"}\\n m4 = []string{\\\"\\\", \\\"X̅\\\", \\\"X̅X̅\\\", \\\"X̅X̅X̅\\\", \\\"X̅L̅\\\",\\n \\\"L̅\\\", \\\"L̅X̅\\\", \\\"L̅X̅X̅\\\", \\\"L̅X̅X̅X̅\\\", \\\"X̅C̅\\\"}\\n m5 = []string{\\\"\\\", \\\"C̅\\\", \\\"C̅C̅\\\", \\\"C̅C̅C̅\\\", \\\"C̅D̅\\\",\\n \\\"D̅\\\", \\\"D̅C̅\\\", \\\"D̅C̅C̅\\\", \\\"D̅C̅C̅C̅\\\", \\\"C̅M̅\\\"}\\n m6 = []string{\\\"\\\", \\\"M̅\\\", \\\"M̅M̅\\\", \\\"M̅M̅M̅\\\"}\\n)\\n\\nfunc formatRoman(n int) (string, bool) {\\n if n < 1 || n >= 4e6 {\\n return \\\"\\\", false\\n }\\n // this is efficient in Go. the seven operands are evaluated,\\n // then a single allocation is made of the exact size needed for the result.\\n return m6[n/1e6] + m5[n%1e6/1e5] + m4[n%1e5/1e4] + m3[n%1e4/1e3] +\\n m2[n%1e3/1e2] + m1[n%100/10] + m0[n%10],\\n true\\n}\\n\\nfunc main() {\\n // show three numbers mentioned in task descriptions\\n for _, n := range []int{1990, 2008, 1666} {\\n r, ok := formatRoman(n)\\n if ok {\\n fmt.Println(n, \\\"==\\\", r)\\n } else {\\n fmt.Println(n, \\\"not representable\\\")\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"#!/usr/bin/env golosh\\n----\\nThis module takes a decimal integer and converts it to a Roman numeral.\\n----\\nmodule Romannumeralsencode\\n\\naugment java.lang.Integer {\\n\\n function digits = |this| {\\n\\n var remaining = this\\n let digits = vector[]\\n while remaining > 0 {\\n digits: prepend(remaining % 10)\\n remaining = remaining / 10\\n }\\n return digits\\n }\\n\\n ----\\n 123: digitsWithPowers() will return [[1, 2], [2, 1], [3, 0]]\\n ----\\n function digitsWithPowers = |this| -> vector[\\n [ this: digits(): get(i), (this: digits(): size() - 1) - i ] for (var i = 0, i < this: digits(): size(), i = i + 1)\\n ]\\n\\n function encode = |this| {\\n\\n require(this > 0, \\\"the integer must be positive!\\\")\\n\\n let romanPattern = |digit, powerOf10| -> match {\\n when digit == 1 then i\\n when digit == 2 then i + i\\n when digit == 3 then i + i + i\\n when digit == 4 then i + v\\n when digit == 5 then v\\n when digit == 6 then v + i\\n when digit == 7 then v + i + i\\n when digit == 8 then v + i + i + i\\n when digit == 9 then i + x\\n otherwise \\\"\\\"\\n } with {\\n i, v, x = [\\n [ \\\"I\\\", \\\"V\\\", \\\"X\\\" ],\\n [ \\\"X\\\", \\\"L\\\", \\\"C\\\" ],\\n [ \\\"C\\\", \\\"D\\\", \\\"M\\\" ],\\n [ \\\"M\\\", \\\"?\\\", \\\"?\\\" ]\\n ]: get(powerOf10)\\n }\\n\\n return vector[ romanPattern(digit, power) foreach digit, power in this: digitsWithPowers() ]: join(\\\"\\\")\\n }\\n}\\n\\nfunction main = |args| {\\n println(\\\"1990 == MCMXC? \\\" + (1990: encode() == \\\"MCMXC\\\"))\\n println(\\\"2008 == MMVIII? \\\" + (2008: encode() == \\\"MMVIII\\\"))\\n println(\\\"1666 == MDCLXVI? \\\" + (1666: encode() == \\\"MDCLXVI\\\"))\\n}\\n\",\n \"language\": \"Golo\"\n },\n {\n \"code\": \"symbols = [ 1:'I', 4:'IV', 5:'V', 9:'IX', 10:'X', 40:'XL', 50:'L', 90:'XC', 100:'C', 400:'CD', 500:'D', 900:'CM', 1000:'M' ]\\n\\ndef roman(arabic) {\\n def result = \\\"\\\"\\n symbols.keySet().sort().reverse().each {\\n while (arabic >= it) {\\n arabic-=it\\n result+=symbols[it]\\n }\\n }\\n return result\\n}\\nassert roman(1) == 'I'\\nassert roman(2) == 'II'\\nassert roman(4) == 'IV'\\nassert roman(8) == 'VIII'\\nassert roman(16) == 'XVI'\\nassert roman(32) == 'XXXII'\\nassert roman(25) == 'XXV'\\nassert roman(64) == 'LXIV'\\nassert roman(128) == 'CXXVIII'\\nassert roman(256) == 'CCLVI'\\nassert roman(512) == 'DXII'\\nassert roman(954) == 'CMLIV'\\nassert roman(1024) == 'MXXIV'\\nassert roman(1666) == 'MDCLXVI'\\nassert roman(1990) == 'MCMXC'\\nassert roman(2008) == 'MMVIII'\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"10 REM Roman numerals/Encode\\n20 DIM WEIGHTS%(12), SYMBOLS$(12)\\n30 FOR J% = 0 TO 12: READ WEIGHTS%(J%), SYMBOLS$(J%): NEXT J%\\n40 DATA 1000, \\\"M\\\", 900, \\\"CM\\\", 500, \\\"D\\\", 400, \\\"CD\\\", 100, \\\"C\\\", 90, \\\"XC\\\"\\n50 DATA 50, \\\"L\\\", 40, \\\"XL\\\", 10, \\\"X\\\", 9, \\\"IX\\\", 5, \\\"V\\\", 4, \\\"IV\\\", 1, \\\"I\\\"\\n60 REM 3888 or MMMDCCCLXXXVIII (15 chars) is\\n70 REM the longest string properly encoded\\n80 REM with these symbols.\\n90 AVALUE% = 1990: GOSUB 1000: PRINT ROMAN$ ' MCMXC\\n100 AVALUE% = 2022: GOSUB 1000: PRINT ROMAN$ ' MMXXII\\n110 AVALUE% = 3888: GOSUB 1000: PRINT ROMAN$ ' MMMDCCCLXXXVIII\\n120 END\\n990 REM Encode to roman\\n1000 ROMAN$ = \\\"\\\": I% = 0\\n1010 WHILE (I% <= 12) AND (AVALUE% > 0)\\n1020 WHILE AVALUE% >= WEIGHTS%(I%)\\n1030 ROMAN$ = ROMAN$ + SYMBOLS$(I%)\\n1040 AVALUE% = AVALUE% - WEIGHTS%(I%)\\n1050 WEND\\n1060 I% = I% + 1\\n1070 WEND\\n1080 RETURN\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \"digit :: Char -> Char -> Char -> Integer -> String\\ndigit x y z k =\\n [[x], [x, x], [x, x, x], [x, y], [y], [y, x], [y, x, x], [y, x, x, x], [x, z]] !!\\n (fromInteger k - 1)\\n\\ntoRoman :: Integer -> String\\ntoRoman 0 = \\\"\\\"\\ntoRoman x\\n | x < 0 = error \\\"Negative roman numeral\\\"\\ntoRoman x\\n | x >= 1000 = 'M' : toRoman (x - 1000)\\ntoRoman x\\n | x >= 100 = digit 'C' 'D' 'M' q ++ toRoman r\\n where\\n (q, r) = x `divMod` 100\\ntoRoman x\\n | x >= 10 = digit 'X' 'L' 'C' q ++ toRoman r\\n where\\n (q, r) = x `divMod` 10\\ntoRoman x = digit 'I' 'V' 'X' x\\n\\nmain :: IO ()\\nmain = print $ toRoman <$> [1999, 25, 944]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Bifunctor (first)\\nimport Data.List (mapAccumL)\\nimport Data.Tuple (swap)\\n\\nroman :: Int -> String\\nroman =\\n romanFromInt $\\n zip\\n [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\\n (words \\\"M CM D CD C XC L XL X IX V IV I\\\")\\n\\nromanFromInt :: [(Int, String)] -> Int -> String\\nromanFromInt nks n = concat . snd $ mapAccumL go n nks\\n where\\n go a (v, s) = swap $ first ((>> s) . enumFromTo 1) $ quotRem a v\\n\\nmain :: IO ()\\nmain = (putStrLn . unlines) (roman <$> [1666, 1990, 2008, 2016, 2018])\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"module Main where\\n\\n------------------------\\n-- ENCODER FUNCTION --\\n------------------------\\n\\nromanDigits = \\\"IVXLCDM\\\"\\n\\n-- Meaning and indices of the romanDigits sequence:\\n--\\n-- magnitude | 1 5 | index\\n-- -----------|-------|-------\\n-- 0 | I V | 0 1\\n-- 1 | X L | 2 3\\n-- 2 | C D | 4 5\\n-- 3 | M | 6\\n--\\n-- romanPatterns are index offsets into romanDigits,\\n-- from an index base of 2 * magnitude.\\n\\nromanPattern 0 = [] -- empty string\\nromanPattern 1 = [0] -- I or X or C or M\\nromanPattern 2 = [0,0] -- II or XX...\\nromanPattern 3 = [0,0,0] -- III...\\nromanPattern 4 = [0,1] -- IV...\\nromanPattern 5 = [1] -- ...\\nromanPattern 6 = [1,0]\\nromanPattern 7 = [1,0,0]\\nromanPattern 8 = [1,0,0,0]\\nromanPattern 9 = [0,2]\\n\\nencodeValue 0 _ = \\\"\\\"\\nencodeValue value magnitude = encodeValue rest (magnitude + 1) ++ digits\\n where\\n low = rem value 10 -- least significant digit (encoded now)\\n rest = div value 10 -- the other digits (to be encoded next)\\n indices = map addBase (romanPattern low)\\n addBase i = i + (2 * magnitude)\\n digits = map pickDigit indices\\n pickDigit i = romanDigits!!i\\n\\nencode value = encodeValue value 0\\n\\n------------------\\n-- TEST SUITE --\\n------------------\\n\\nmain = do\\n test \\\"MCMXC\\\" 1990\\n test \\\"MMVIII\\\" 2008\\n test \\\"MDCLXVI\\\" 1666\\n\\ntest expected value = putStrLn ((show value) ++ \\\" = \\\" ++ roman ++ remark)\\n where\\n roman = encode value\\n remark =\\n \\\" (\\\" ++\\n (if roman == expected then \\\"PASS\\\"\\n else (\\\"FAIL, expected \\\" ++ (show expected))) ++ \\\")\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"CHARACTER Roman*20\\n\\nCALL RomanNumeral(1990, Roman) ! MCMXC\\nCALL RomanNumeral(2008, Roman) ! MMVIII\\nCALL RomanNumeral(1666, Roman) ! MDCLXVI\\n\\nEND\\n\\nSUBROUTINE RomanNumeral( arabic, roman)\\n CHARACTER roman\\n DIMENSION ddec(13)\\n DATA ddec/1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1/\\n\\n roman = ' '\\n todo = arabic\\n DO d = 1, 13\\n DO rep = 1, todo / ddec(d)\\n roman = TRIM(roman) // TRIM(CHAR(d, 13, \\\"M CM D CD C XC L XL X OX V IV I \\\"))\\n todo = todo - ddec(d)\\n ENDDO\\n ENDDO\\nEND\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"|%\\n++ parse\\n |= t=tape ^- @ud\\n =. t (cass t)\\n =| result=@ud\\n |-\\n ?~ t result\\n ?~ t.t (add result (from-numeral i.t))\\n =+ [a=(from-numeral i.t) b=(from-numeral i.t.t)]\\n ?: (gte a b) $(result (add result a), t t.t)\\n $(result (sub (add result b) a), t t.t.t)\\n++ yield\\n |= n=@ud ^- tape\\n =| result=tape\\n =/ values to-numeral\\n |-\\n ?~ values result\\n ?: (gte n -.i.values)\\n $(result (weld result +.i.values), n (sub n -.i.values))\\n $(values t.values)\\n++ from-numeral\\n |= c=@t ^- @ud\\n ?: =(c 'i') 1\\n ?: =(c 'v') 5\\n ?: =(c 'x') 10\\n ?: =(c 'l') 50\\n ?: =(c 'c') 100\\n ?: =(c 'd') 500\\n ?: =(c 'm') 1.000\\n !!\\n++ to-numeral\\n ^- (list [@ud tape])\\n :*\\n [1.000 \\\"m\\\"]\\n [900 \\\"cm\\\"]\\n [500 \\\"d\\\"]\\n [400 \\\"cd\\\"]\\n [100 \\\"c\\\"]\\n [90 \\\"xc\\\"]\\n [50 \\\"l\\\"]\\n [40 \\\"xl\\\"]\\n [10 \\\"x\\\"]\\n [9 \\\"ix\\\"]\\n [5 \\\"v\\\"]\\n [4 \\\"iv\\\"]\\n [1 \\\"i\\\"]\\n ~\\n ==\\n--\\n\",\n \"language\": \"Hoon\"\n },\n {\n \"code\": \"/+ *roman\\n:- %say\\n|= [* [x=$%([%from-roman tape] [%to-roman @ud]) ~] ~]\\n:- %noun\\n^- tape\\n?- -.x\\n %from-roman \\\"{<(parse +.x)>}\\\"\\n %to-roman (yield +.x)\\n==\\n\",\n \"language\": \"Hoon\"\n },\n {\n \"code\": \"link numbers # commas, roman\\n\\nprocedure main(arglist)\\nevery x := !arglist do\\n write(commas(x), \\\" -> \\\",roman(x)|\\\"*** can't convert to Roman numerals ***\\\")\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"procedure roman(n)\\t\\t#: convert integer to Roman numeral\\n local arabic, result\\n static equiv\\n\\n initial equiv := [\\\"\\\",\\\"I\\\",\\\"II\\\",\\\"III\\\",\\\"IV\\\",\\\"V\\\",\\\"VI\\\",\\\"VII\\\",\\\"VIII\\\",\\\"IX\\\"]\\n\\n integer(n) > 0 | fail\\n result := \\\"\\\"\\n every arabic := !n do\\n result := map(result,\\\"IVXLCDM\\\",\\\"XLCDM**\\\") || equiv[arabic + 1]\\n if find(\\\"*\\\",result) then fail else return result\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \" PLEASE WRITE IN .1\\n DO READ OUT .1\\n DO GIVE UP\\n\",\n \"language\": \"Intercal\"\n },\n {\n \"code\": \"Roman := Object clone do (\\n nums := list(1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1)\\n rum := list(\\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\", \\\"L\\\", \\\"XL\\\", \\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\", \\\"I\\\")\\n\\n numeral := method(number,\\n result := \\\"\\\"\\n for(i, 0, nums size,\\n if(number == 0, break)\\n while(number >= nums at(i),\\n number = number - nums at(i)\\n result = result .. rum at(i)\\n )\\n )\\n return result\\n )\\n)\\n\\nRoman numeral(1666) println\\n\",\n \"language\": \"Io\"\n },\n {\n \"code\": \"100 PROGRAM \\\"Roman.bas\\\"\\n110 DO\\n120 PRINT :INPUT PROMPT \\\"Enter an arabic number: \\\":N\\n130 IF N<1 THEN EXIT DO\\n140 PRINT TOROMAN$(N)\\n150 LOOP\\n160 DEF TOROMAN$(X)\\n170 IF X>3999 THEN\\n180 LET TOROMAN$=\\\"Too big.\\\"\\n190 EXIT DEF\\n200 END IF\\n210 RESTORE\\n220 LET SUM$=\\\"\\\"\\n230 FOR I=1 TO 13\\n240 READ ARABIC,ROMAN$\\n250 DO WHILE X>=ARABIC\\n260 LET SUM$=SUM$&ROMAN$\\n270 LET X=X-ARABIC\\n280 LOOP\\n290 NEXT\\n300 LET TOROMAN$=SUM$\\n310 END DEF\\n320 DATA 1000,\\\"M\\\",900,\\\"CM\\\",500,\\\"D\\\",400,\\\"CD\\\",100,\\\"C\\\",90,\\\"XC\\\"\\n330 DATA 50,\\\"L\\\",40,\\\"XL\\\",10,\\\"X\\\",9,\\\"IX\\\",5,\\\"V\\\",4,\\\"IV\\\",1,\\\"I\\\"\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \"R1000=. ;L:1 ,{ <@(<;._1);._2]0 :0\\n C CC CCC CD D DC DCC DCCC CM\\n X XX XXX XL L LX LXX LXXX XC\\n I II III IV V VI VII VIII IX\\n)\\n\\nrfd=: ('M' $~ <.@%&1000) , R1000 {::~ 1000&|\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" rfd 1234\\nMCCXXXIV\\n rfd 567\\nDLXVII\\n rfd 89\\nLXXXIX\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class RN {\\n\\n enum Numeral {\\n I(1), IV(4), V(5), IX(9), X(10), XL(40), L(50), XC(90), C(100), CD(400), D(500), CM(900), M(1000);\\n int weight;\\n\\n Numeral(int weight) {\\n this.weight = weight;\\n }\\n };\\n\\n public static String roman(long n) {\\n\\n if( n <= 0) {\\n throw new IllegalArgumentException();\\n }\\n\\n StringBuilder buf = new StringBuilder();\\n\\n final Numeral[] values = Numeral.values();\\n for (int i = values.length - 1; i >= 0; i--) {\\n while (n >= values[i].weight) {\\n buf.append(values[i]);\\n n -= values[i].weight;\\n }\\n }\\n return buf.toString();\\n }\\n\\n public static void test(long n) {\\n System.out.println(n + \\\" = \\\" + roman(n));\\n }\\n\\n public static void main(String[] args) {\\n test(1999);\\n test(25);\\n test(944);\\n test(0);\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.util.Set;\\nimport java.util.EnumSet;\\nimport java.util.Collections;\\nimport java.util.stream.Collectors;\\nimport java.util.stream.LongStream;\\n\\npublic interface RomanNumerals {\\n public enum Numeral {\\n M(1000), CM(900), D(500), CD(400), C(100), XC(90), L(50), XL(40), X(10), IX(9), V(5), IV(4), I(1);\\n\\n public final long weight;\\n\\n private static final Set<Numeral> SET = Collections.unmodifiableSet(EnumSet.allOf(Numeral.class));\\n\\n private Numeral(long weight) {\\n this.weight = weight;\\n }\\n\\n public static Numeral getLargest(long weight) {\\n return SET.stream()\\n .filter(numeral -> weight >= numeral.weight)\\n .findFirst()\\n .orElse(I)\\n ;\\n }\\n };\\n\\n public static String encode(long n) {\\n return LongStream.iterate(n, l -> l - Numeral.getLargest(l).weight)\\n .limit(Numeral.values().length)\\n .filter(l -> l > 0)\\n .mapToObj(Numeral::getLargest)\\n .map(String::valueOf)\\n .collect(Collectors.joining())\\n ;\\n }\\n\\n public static long decode(String roman) {\\n long result = new StringBuilder(roman.toUpperCase()).reverse().chars()\\n .mapToObj(c -> Character.toString((char) c))\\n .map(numeral -> Enum.valueOf(Numeral.class, numeral))\\n .mapToLong(numeral -> numeral.weight)\\n .reduce(0, (a, b) -> a + (a <= b ? b : -b))\\n ;\\n if (roman.charAt(0) == roman.charAt(1)) {\\n result += 2 * Enum.valueOf(Numeral.class, roman.substring(0, 1)).weight;\\n }\\n return result;\\n }\\n\\n public static void test(long n) {\\n System.out.println(n + \\\" = \\\" + encode(n));\\n System.out.println(encode(n) + \\\" = \\\" + decode(encode(n)));\\n }\\n\\n public static void main(String[] args) {\\n LongStream.of(1999, 25, 944).forEach(RomanNumerals::test);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var roman = {\\n map: [\\n 1000, 'M', 900, 'CM', 500, 'D', 400, 'CD', 100, 'C', 90, 'XC',\\n 50, 'L', 40, 'XL', 10, 'X', 9, 'IX', 5, 'V', 4, 'IV', 1, 'I',\\n ],\\n int_to_roman: function(n) {\\n var value = '';\\n for (var idx = 0; n > 0 && idx < this.map.length; idx += 2) {\\n while (n >= this.map[idx]) {\\n value += this.map[idx + 1];\\n n -= this.map[idx];\\n }\\n }\\n return value;\\n }\\n}\\n\\nroman.int_to_roman(1999); // \\\"MCMXCIX\\\"\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(function () {\\n 'use strict';\\n\\n\\n // If the Roman is a string, pass any delimiters through\\n\\n // (Int | String) -> String\\n function romanTranscription(a) {\\n if (typeof a === 'string') {\\n var ps = a.split(/\\\\d+/),\\n dlm = ps.length > 1 ? ps[1] : undefined;\\n\\n return (dlm ? a.split(dlm)\\n .map(function (x) {\\n return Number(x);\\n }) : [a])\\n .map(roman)\\n .join(dlm);\\n } else return roman(a);\\n }\\n\\n // roman :: Int -> String\\n function roman(n) {\\n return [[1000, \\\"M\\\"], [900, \\\"CM\\\"], [500, \\\"D\\\"], [400, \\\"CD\\\"], [100,\\n \\\"C\\\"], [90, \\\"XC\\\"], [50, \\\"L\\\"], [40, \\\"XL\\\"], [10, \\\"X\\\"], [9,\\n \\\"IX\\\"], [5, \\\"V\\\"], [4, \\\"IV\\\"], [1, \\\"I\\\"]]\\n .reduce(function (a, lstPair) {\\n var m = a.remainder,\\n v = lstPair[0];\\n\\n return (v > m ? a : {\\n remainder: m % v,\\n roman: a.roman + Array(\\n Math.floor(m / v) + 1\\n )\\n .join(lstPair[1])\\n });\\n }, {\\n remainder: n,\\n roman: ''\\n }).roman;\\n }\\n\\n // TEST\\n\\n return [2016, 1990, 2008, \\\"14.09.2015\\\", 2000, 1666].map(\\n romanTranscription);\\n\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"[\\\"MMXVI\\\", \\\"MCMXC\\\", \\\"MMVIII\\\", \\\"XIV.IX.MMXV\\\", \\\"MM\\\", \\\"MDCLXVI\\\"]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n \\\"use strict\\\";\\n\\n // -------------- ROMAN INTEGER STRINGS --------------\\n\\n // roman :: Int -> String\\n const roman = n =>\\n mapAccumL(residue =>\\n ([k, v]) => second(\\n q => 0 < q ? (\\n k.repeat(q)\\n ) : \\\"\\\"\\n )(remQuot(residue)(v))\\n )(n)(\\n zip([\\n \\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\",\\n \\\"L\\\", \\\"XL\\\", \\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\", \\\"I\\\"\\n ])([\\n 1000, 900, 500, 400, 100, 90,\\n 50, 40, 10, 9, 5, 4, 1\\n ])\\n )[1]\\n .join(\\\"\\\");\\n\\n\\n // ---------------------- TEST -----------------------\\n // main :: IO ()\\n const main = () => (\\n [2016, 1990, 2008, 2000, 2020, 1666].map(roman)\\n ).join(\\\"\\\\n\\\");\\n\\n\\n // ---------------- GENERIC FUNCTIONS ----------------\\n\\n // mapAccumL :: (acc -> x -> (acc, y)) -> acc ->\\n // [x] -> (acc, [y])\\n const mapAccumL = f =>\\n // A tuple of an accumulation and a list\\n // obtained by a combined map and fold,\\n // with accumulation from left to right.\\n acc => xs => [...xs].reduce(\\n (a, x) => {\\n const tpl = f(a[0])(x);\\n\\n return [\\n tpl[0],\\n a[1].concat(tpl[1])\\n ];\\n },\\n [acc, []]\\n );\\n\\n\\n // remQuot :: Int -> Int -> (Int, Int)\\n const remQuot = m =>\\n n => [m % n, Math.trunc(m / n)];\\n\\n\\n // second :: (a -> b) -> ((c, a) -> (c, b))\\n const second = f =>\\n // A function over a simple value lifted\\n // to a function over a tuple.\\n // f (a, b) -> (a, f(b))\\n xy => [xy[0], f(xy[1])];\\n\\n\\n // zip :: [a] -> [b] -> [(a, b)]\\n const zip = xs =>\\n // The paired members of xs and ys, up to\\n // the length of the shorter of the two lists.\\n ys => Array.from({\\n length: Math.min(xs.length, ys.length)\\n }, (_, i) => [xs[i], ys[i]]);\\n\\n\\n // MAIN --\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"function toRoman(num) {\\n return 'I'\\n .repeat(num)\\n .replace(/IIIII/g, 'V')\\n .replace(/VV/g, 'X')\\n .replace(/XXXXX/g, 'L')\\n .replace(/LL/g, 'C')\\n .replace(/CCCCC/g, 'D')\\n .replace(/DD/g, 'M')\\n .replace(/VIIII/g, 'IX')\\n .replace(/LXXXX/g, 'XC')\\n .replace(/XXXX/g, 'XL')\\n .replace(/DCCCC/g, 'CM')\\n .replace(/CCCC/g, 'CD')\\n .replace(/IIII/g, 'IV');\\n}\\n\\nconsole.log(toRoman(1666));\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"MDCLXVI\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def to_roman_numeral:\\n def romans:\\n [100000, \\\"\\\\u2188\\\"],\\n [90000, \\\"ↂ\\\\u2188\\\"],\\n [50000, \\\"\\\\u2187\\\"],\\n [40000, \\\"ↂ\\\\u2187\\\"],\\n [10000, \\\"ↂ\\\"],\\n [9000, \\\"Mↂ\\\"],\\n [5000, \\\"ↁ\\\"],\\n [4000, \\\"Mↁ\\\"],\\n [1000, \\\"M\\\"],\\n [900, \\\"CM\\\"],\\n [500, \\\"D\\\"],\\n [400, \\\"CD\\\"],\\n [100, \\\"C\\\"],\\n [90, \\\"XC\\\"],\\n [50, \\\"L\\\"],\\n [40, \\\"XL\\\"],\\n [10, \\\"X\\\"],\\n [9, \\\"IX\\\"],\\n [5, \\\"V\\\"],\\n [4, \\\"IV\\\"],\\n [1, \\\"I\\\"] ;\\n\\n if . < 1 or . > 399999\\n then \\\"to_roman_numeral: \\\\(.) is out of range\\\" | error\\n else reduce romans as [$i, $r] ({n: .};\\n until (.n < $i;\\n .res += $r\\n | .n = .n - $i ) )\\n | .res\\n end ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def testcases: [1668, 1990, 2008, 2020, 4444, 5000, 8999, 39999, 89999, 399999];\\n\\n\\\"Decimal => Roman:\\\",\\n (testcases[]\\n | \\\" \\\\(.) => \\\\(to_roman_numeral)\\\" )\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def digits: tostring | explode | map( [.]|implode|tonumber);\\n# Non-negative integer to Roman numeral up to 399,999\\ndef to_roman_numeral:\\n if . < 1 or . > 399999\\n then \\\"to_roman_numeral: \\\\(.) is out of range\\\" | error\\n else [[\\\"I\\\", \\\"X\\\", \\\"C\\\", \\\"M\\\", \\\"ↂ\\\", \\\"\\\\u2188\\\"], [\\\"V\\\", \\\"L\\\", \\\"D\\\", \\\"ↁ\\\", \\\"\\\\u2187\\\"]] as $DR\\n | (digits|reverse) as $digits\\n | reduce range(0;$digits|length) as $omag ({rnum: \\\"\\\"};\\n $digits[$omag] as $d\\n | if $d == 0 then .omr = \\\"\\\"\\n elif $d < 4 then .omr = $DR[0][$omag] * $d\\n elif $d == 4 then .omr = $DR[0][$omag] + $DR[1][$omag]\\n elif $d == 5 then .omr = $DR[1][$omag]\\n elif $d < 9 then .omr = $DR[1][$omag] + ($DR[0][$omag] * ($d - 5))\\n else .omr = $DR[0][$omag] + $DR[0][$omag+1]\\n end\\n | .rnum = .omr + .rnum )\\n | .rnum\\n end;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"/* Roman numerals, in Jsish */\\nvar Roman = {\\n ord: ['M', 'CM', 'D', 'CD', 'C', 'XC', 'L', 'XL', 'X', 'IX', 'V', 'IV', 'I'],\\n val: [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1],\\n\\n fromRoman: function(roman:string):number {\\n var n = 0;\\n var re = /IV|IX|I|V|XC|XL|X|L|CD|CM|C|D|M/g;\\n var matches = roman.match(re);\\n if (!matches) return NaN;\\n for (var hit of matches) n += this.val[this.ord.indexOf(hit)];\\n return n;\\n },\\n\\n toRoman: function(n:number):string {\\n var roman = '';\\n var idx = 0;\\n while (n > 0) {\\n while (n >= this.val[idx]) {\\n roman += this.ord[idx];\\n n -= this.val[idx];\\n }\\n idx++;\\n }\\n return roman;\\n }\\n};\\n\\nprovide('Roman', 1);\\n\\nif (Interp.conf('unitTest')) {\\n; Roman.fromRoman('VIII');\\n; Roman.fromRoman('MMMDIV');\\n; Roman.fromRoman('CDIV');\\n; Roman.fromRoman('MDCLXVI');\\n; Roman.fromRoman('not');\\n\\n; Roman.toRoman(8);\\n; Roman.toRoman(3504);\\n; Roman.toRoman(404);\\n; Roman.toRoman(1666);\\n}\\n\\n/*\\n=!EXPECTSTART!=\\nRoman.fromRoman('VIII') ==> 8\\nRoman.fromRoman('MMMDIV') ==> 3504\\nRoman.fromRoman('CDIV') ==> 404\\nRoman.fromRoman('MDCLXVI') ==> 1666\\nRoman.fromRoman('not') ==> NaN\\nRoman.toRoman(8) ==> VIII\\nRoman.toRoman(3504) ==> MMMDIV\\nRoman.toRoman(404) ==> CDIV\\nRoman.toRoman(1666) ==> MDCLXVI\\n=!EXPECTEND!=\\n*/\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"using Printf\\n\\nfunction romanencode(n::Integer)\\n if n < 1 || n > 4999 throw(DomainError()) end\\n\\n DR = [[\\\"I\\\", \\\"X\\\", \\\"C\\\", \\\"M\\\"] [\\\"V\\\", \\\"L\\\", \\\"D\\\", \\\"MMM\\\"]]\\n rnum = \\\"\\\"\\n for (omag, d) in enumerate(digits(n))\\n if d == 0\\n omr = \\\"\\\"\\n elseif d < 4\\n omr = DR[omag, 1] ^ d\\n elseif d == 4\\n omr = DR[omag, 1] * DR[omag, 2]\\n elseif d == 5\\n omr = DR[omag, 2]\\n elseif d < 9\\n omr = DR[omag, 2] * DR[omag, 1] ^ (d - 5)\\n else\\n omr = DR[omag, 1] * DR[omag + 1, 1]\\n end\\n rnum = omr * rnum\\n end\\n return rnum\\nend\\n\\ntestcases = [1990, 2008, 1668]\\nappend!(testcases, rand(1:4999, 12))\\ntestcases = unique(testcases)\\n\\nprintln(\\\"Test romanencode, arabic => roman:\\\")\\nfor n in testcases\\n @printf(\\\"%-4i => %s\\\\n\\\", n, romanencode(n))\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"val romanNumerals = mapOf(\\n 1000 to \\\"M\\\",\\n 900 to \\\"CM\\\",\\n 500 to \\\"D\\\",\\n 400 to \\\"CD\\\",\\n 100 to \\\"C\\\",\\n 90 to \\\"XC\\\",\\n 50 to \\\"L\\\",\\n 40 to \\\"XL\\\",\\n 10 to \\\"X\\\",\\n 9 to \\\"IX\\\",\\n 5 to \\\"V\\\",\\n 4 to \\\"IV\\\",\\n 1 to \\\"I\\\"\\n)\\n\\nfun encode(number: Int): String? {\\n if (number > 5000 || number < 1) {\\n return null\\n }\\n var num = number\\n var result = \\\"\\\"\\n for ((multiple, numeral) in romanNumerals.entries) {\\n while (num >= multiple) {\\n num -= multiple\\n result += numeral\\n }\\n }\\n return result\\n}\\n\\nfun main(args: Array<String>) {\\n println(encode(1990))\\n println(encode(1666))\\n println(encode(2008))\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"fun Int.toRomanNumeral(): String {\\n fun digit(k: Int, unit: String, five: String, ten: String): String {\\n return when (k) {\\n in 1..3 -> unit.repeat(k)\\n 4 -> unit + five\\n in 5..8 -> five + unit.repeat(k - 5)\\n 9 -> unit + ten\\n else -> throw IllegalArgumentException(\\\"$k not in range 1..9\\\")\\n }\\n }\\n return when (this) {\\n 0 -> \\\"\\\"\\n in 1..9 -> digit(this, \\\"I\\\", \\\"V\\\", \\\"X\\\")\\n in 10..99 -> digit(this / 10, \\\"X\\\", \\\"L\\\", \\\"C\\\") + (this % 10).toRomanNumeral()\\n in 100..999 -> digit(this / 100, \\\"C\\\", \\\"D\\\", \\\"M\\\") + (this % 100).toRomanNumeral()\\n in 1000..3999 -> \\\"M\\\" + (this - 1000).toRomanNumeral()\\n else -> throw IllegalArgumentException(\\\"${this} not in range 0..3999\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"define br => '\\\\r'\\n// encode roman\\ndefine encodeRoman(num::integer)::string => {\\n\\tlocal(ref = array('M'=1000, 'CM'=900, 'D'=500, 'CD'=400, 'C'=100, 'XC'=90, 'L'=50, 'XL'=40, 'X'=10, 'IX'=9, 'V'=5, 'IV'=4, 'I'=1))\\n\\tlocal(out = string)\\n\\twith i in #ref do => {\\n\\t\\twhile(#num >= #i->second) => {\\n\\t\\t\\t#out->append(#i->first)\\n\\t\\t\\t#num -= #i->second\\n\\t\\t}\\n\\t}\\n\\treturn #out\\n}\\n\\n'1990 in roman is '+encodeRoman(1990)\\nbr\\n'2008 in roman is '+encodeRoman(2008)\\nbr\\n'1666 in roman is '+encodeRoman(1666)\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"\\\\documentclass{minimal}\\n\\\\newcounter{currentyear}\\n\\\\setcounter{currentyear}{\\\\year}\\n\\\\begin{document}\\nAnno Domini \\\\Roman{currentyear}\\n\\\\end{document}\\n\",\n \"language\": \"LaTeX\"\n },\n {\n \"code\": \" dim arabic( 12)\\n for i =0 to 12\\n read k\\n arabic( i) =k\\n next i\\n data 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1\\n\\n dim roman$( 12)\\n for i =0 to 12\\n read k$\\n roman$( i) =k$\\n next i\\n data \\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\", \\\"L\\\", \\\"XL\\\", \\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\", \\\"I\\\"\\n\\n print 2009, toRoman$( 2009)\\n print 1666, toRoman$( 1666)\\n print 3888, toRoman$( 3888)\\n\\n end\\n\\nfunction toRoman$( value)\\n i =0\\n result$ =\\\"\\\"\\n for i = 0 to 12\\n while value >=arabic( i)\\n result$ = result$ + roman$( i)\\n value = value - arabic( i)\\n wend\\n next i\\n toRoman$ =result$\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"function toRoman intNum\\n local roman,numArabic\\n put \\\"M,CM,D,CD,C,XC,L,XL,X,IX,V,IV,I\\\" into romans\\n put \\\"1000,900,500,400,100,90,50,40,10,9,5,4,1\\\" into arabics\\n put intNum into numArabic\\n repeat with n = 1 to the number of items of romans\\n put numArabic div item n of arabics into nums\\n if nums > 0 then\\n put repeatChar(item n of romans,nums) after roman\\n add -(nums * item n of arabics) to numArabic\\n end if\\n end repeat\\nreturn roman\\nend toRoman\\n\\nfunction repeatChar c n\\n local cc\\n repeat n times\\n put c after cc\\n end repeat\\n return cc\\nend repeatChar\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"make \\\"roman.rules [\\n [1000 M] [900 CM] [500 D] [400 CD]\\n [ 100 C] [ 90 XC] [ 50 L] [ 40 XL]\\n [ 10 X] [ 9 IX] [ 5 V] [ 4 IV]\\n [ 1 I]\\n]\\n\\nto roman :n [:rules :roman.rules] [:acc \\\"||]\\n if empty? :rules [output :acc]\\n if :n < first first :rules [output (roman :n bf :rules :acc)]\\n output (roman :n - first first :rules :rules word :acc last first :rules)\\nend\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"make \\\"patterns [[?] [? ?] [? ? ?] [? ?2] [?2] [?2 ?] [?2 ? ?] [?2 ? ? ?] [? ?3]]\\n\\nto digit :d :numerals\\n if :d = 0 [output \\\"||]\\n output apply (sentence \\\"\\\\( \\\"word (item :d :patterns) \\\"\\\\)) :numerals\\nend\\nto digits :n :numerals\\n output word ifelse :n < 10 [\\\"||] [digits int :n/10 bf bf :numerals] ~\\n digit modulo :n 10 :numerals\\nend\\nto roman :n\\n if or :n < 0 :n >= 4000 [output [EX MODVS!]]\\n output digits :n [I V X L C D M]\\nend\\n\\nprint roman 1999 ; MCMXCIX\\nprint roman 25 ; XXV\\nprint roman 944 ; CMXLIV\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"HAI 1.2\\nI HAS A Romunz ITZ A BUKKIT\\nRomunz HAS A SRS 0 ITZ \\\"M\\\"\\nRomunz HAS A SRS 1 ITZ \\\"CM\\\"\\nRomunz HAS A SRS 2 ITZ \\\"D\\\"\\nRomunz HAS A SRS 3 ITZ \\\"CD\\\"\\nRomunz HAS A SRS 4 ITZ \\\"C\\\"\\nRomunz HAS A SRS 5 ITZ \\\"XC\\\"\\nRomunz HAS A SRS 6 ITZ \\\"L\\\"\\nRomunz HAS A SRS 7 ITZ \\\"XL\\\"\\nRomunz HAS A SRS 8 ITZ \\\"X\\\"\\nRomunz HAS A SRS 9 ITZ \\\"IX\\\"\\nRomunz HAS A SRS 10 ITZ \\\"V\\\"\\nRomunz HAS A SRS 11 ITZ \\\"IV\\\"\\nRomunz HAS A SRS 12 ITZ \\\"I\\\"\\n\\nI HAS A Valuez ITZ A BUKKIT\\nValuez HAS A SRS 0 ITZ 1000\\nValuez HAS A SRS 1 ITZ 900\\nValuez HAS A SRS 2 ITZ 500\\nValuez HAS A SRS 3 ITZ 400\\nValuez HAS A SRS 4 ITZ 100\\nValuez HAS A SRS 5 ITZ 90\\nValuez HAS A SRS 6 ITZ 50\\nValuez HAS A SRS 7 ITZ 40\\nValuez HAS A SRS 8 ITZ 10\\nValuez HAS A SRS 9 ITZ 9\\nValuez HAS A SRS 10 ITZ 5\\nValuez HAS A SRS 11 ITZ 4\\nValuez HAS A SRS 12 ITZ 1\\n\\nHOW IZ I Romunize YR Num\\n I HAS A Result ITZ \\\"\\\"\\n IM IN YR Outer UPPIN YR Dummy TIL BOTH SAEM Num AN 0\\n IM IN YR Inner UPPIN YR Index TIL BOTH SAEM Index AN 13\\n BOTH SAEM Num AN BIGGR OF Num AN Valuez'Z SRS Index, O RLY?\\n YA RLY\\n Num R DIFF OF Num AN Valuez'Z SRS Index\\n Result R SMOOSH Result Romunz'Z SRS Index MKAY\\n GTFO\\n OIC\\n IM OUTTA YR Inner\\n IM OUTTA YR Outer\\n FOUND YR Result\\nIF U SAY SO\\n\\nVISIBLE SMOOSH 2009 \\\" = \\\" I IZ Romunize YR 2009 MKAY MKAY\\nVISIBLE SMOOSH 1666 \\\" = \\\" I IZ Romunize YR 1666 MKAY MKAY\\nVISIBLE SMOOSH 3888 \\\" = \\\" I IZ Romunize YR 3888 MKAY MKAY\\nKTHXBYE\\n\",\n \"language\": \"LOLCODE\"\n },\n {\n \"code\": \"Function toRoman(value) As String\\n\\tDim arabic(12) As Integer\\n\\tDim roman(12) As String\\n\\t\\n\\tarabic(0) = 1000\\n\\tarabic(1) = 900\\n\\tarabic(2) = 500\\n\\tarabic(3) = 400\\n\\tarabic(4) = 100\\n\\tarabic(5) = 90\\n\\tarabic(6) = 50\\n\\tarabic(7) = 40\\n\\tarabic(8) = 10\\n\\tarabic(9) = 9\\n\\tarabic(10) = 5\\n\\tarabic(11) = 4\\n\\tarabic(12) = 1\\n\\t\\n\\troman(0) = \\\"M\\\"\\n\\troman(1) = \\\"CM\\\"\\n\\troman(2) = \\\"D\\\"\\n\\troman(3) = \\\"CD\\\"\\n\\troman(4) = \\\"C\\\"\\n\\troman(5) = \\\"XC\\\"\\n\\troman(6) = \\\"L\\\"\\n\\troman(7) = \\\"XL\\\"\\n\\troman(8) = \\\"X\\\"\\n\\troman(9) = \\\"IX\\\"\\n\\troman(10) = \\\"V\\\"\\n\\troman(11) = \\\"IV\\\"\\n\\troman(12) = \\\"I\\\"\\n\\t\\n\\tDim i As Integer, result As String\\n\\t\\n\\tFor i = 0 To 12\\n\\t\\tDo While value >= arabic(i)\\n\\t\\t\\tresult = result + roman(i)\\n\\t\\t\\tvalue = value - arabic(i)\\n\\t\\tLoop\\n\\tNext i\\n\\t\\n\\ttoRoman = result\\nEnd Function\\n\",\n \"language\": \"LotusScript\"\n },\n {\n \"code\": \"romans = {\\n{1000, \\\"M\\\"},\\n{900, \\\"CM\\\"}, {500, \\\"D\\\"}, {400, \\\"CD\\\"}, {100, \\\"C\\\"},\\n{90, \\\"XC\\\"}, {50, \\\"L\\\"}, {40, \\\"XL\\\"}, {10, \\\"X\\\"},\\n{9, \\\"IX\\\"}, {5, \\\"V\\\"}, {4, \\\"IV\\\"}, {1, \\\"I\\\"} }\\n\\nk = io.read() + 0\\nfor _, v in ipairs(romans) do --note that this is -not- ipairs.\\n val, let = unpack(v)\\n while k >= val do\\n k = k - val\\n\\tio.write(let)\\n end\\nend\\nprint()\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"define(`roman',`ifelse(eval($1>=1000),1,`M`'roman(eval($1-1000))',\\n`ifelse(eval($1>=900),1,`CM`'roman(eval($1-900))',\\n`ifelse(eval($1>=500),1,`D`'roman(eval($1-500))',\\n`ifelse(eval($1>=100),1,`C`'roman(eval($1-100))',\\n`ifelse(eval($1>=90),1,`XC`'roman(eval($1-90))',\\n`ifelse(eval($1>=50),1,`L`'roman(eval($1-50))',\\n`ifelse(eval($1>=40),1,`XL`'roman(eval($1-40))',\\n`ifelse(eval($1>=10),1,`X`'roman(eval($1-10))',\\n`ifelse(eval($1>=9),1,`IX`'roman(eval($1-9))',\\n`ifelse(eval($1>=5),1,`V`'roman(eval($1-5))',\\n`ifelse(eval($1>=4),1,`IV`'roman(eval($1-4))',\\n`ifelse(eval($1>=1),1,`I`'roman(eval($1-1))'\\n)')')')')')')')')')')')')dnl\\ndnl\\nroman(3675)\\n\",\n \"language\": \"M4\"\n },\n {\n \"code\": \"> for n in [ 1666, 1990, 2008 ] do printf( \\\"%d\\\\t%s\\\\n\\\", n, convert( n, 'roman' ) ) end:\\n1666 MDCLXVI\\n1990 MCMXC\\n2008 MMVIII\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"RomanNumeral[4]\\nRomanNumeral[99]\\nRomanNumeral[1337]\\nRomanNumeral[1666]\\nRomanNumeral[6889]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \":- module roman.\\n\\n:- interface.\\n\\n:- import_module io.\\n\\n:- pred main(io::di, io::uo) is det.\\n\\n:- implementation.\\n\\n:- import_module char, int, list, string.\\n\\nmain(!IO) :-\\n command_line_arguments(Args, !IO),\\n filter(is_all_digits, Args, CleanArgs),\\n foldl((pred(Arg::in, !.IO::di, !:IO::uo) is det :-\\n ( Roman = to_roman(Arg) ->\\n format(\\\"%s => %s\\\", [s(Arg), s(Roman)], !IO), nl(!IO)\\n ; format(\\\"%s cannot be converted.\\\", [s(Arg)], !IO), nl(!IO) )\\n ), CleanArgs, !IO).\\n\\n:- func to_roman(string::in) = (string::out) is semidet.\\nto_roman(Number) = from_char_list(build_roman(reverse(to_char_list(Number)))).\\n\\n:- func build_roman(list(char)) = list(char).\\n:- mode build_roman(in) = out is semidet.\\nbuild_roman([]) = [].\\nbuild_roman([D|R]) = Roman :-\\n map(promote, build_roman(R), Interim),\\n Roman = Interim ++ digit_to_roman(D).\\n\\n:- func digit_to_roman(char) = list(char).\\n:- mode digit_to_roman(in) = out is semidet.\\ndigit_to_roman('0') = [].\\ndigit_to_roman('1') = ['I'].\\ndigit_to_roman('2') = ['I','I'].\\ndigit_to_roman('3') = ['I','I','I'].\\ndigit_to_roman('4') = ['I','V'].\\ndigit_to_roman('5') = ['V'].\\ndigit_to_roman('6') = ['V','I'].\\ndigit_to_roman('7') = ['V','I','I'].\\ndigit_to_roman('8') = ['V','I','I','I'].\\ndigit_to_roman('9') = ['I','X'].\\n\\n:- pred promote(char::in, char::out) is semidet.\\npromote('I', 'X').\\npromote('V', 'L').\\npromote('X', 'C').\\npromote('L', 'D').\\npromote('C', 'M').\\n\\n:- end_module roman.\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \":- module roman2.\\n\\n:- interface.\\n\\n:- import_module io.\\n\\n:- pred main(io::di, io::uo) is det.\\n\\n:- implementation.\\n\\n:- import_module char, int, list, string.\\n\\nmain(!IO) :-\\n command_line_arguments(Args, !IO),\\n filter_map(to_int, Args, CleanArgs),\\n foldl((pred(Arg::in, !.IO::di, !:IO::uo) is det :-\\n ( Roman = to_roman(Arg) ->\\n format(\\\"%i => %s\\\",\\n [i(Arg), s(from_char_list(Roman))], !IO),\\n nl(!IO)\\n ; format(\\\"%i cannot be converted.\\\", [i(Arg)], !IO), nl(!IO) )\\n ), CleanArgs, !IO).\\n\\n:- func to_roman(int) = list(char).\\n:- mode to_roman(in) = out is semidet.\\nto_roman(N) = ( N >= 1000 ->\\n ['M'] ++ to_roman(N - 1000)\\n ;( N >= 100 ->\\n digit(N / 100, 'C', 'D', 'M') ++ to_roman(N rem 100)\\n ;( N >= 10 ->\\n digit(N / 10, 'X', 'L', 'C') ++ to_roman(N rem 10)\\n ;( N >= 1 ->\\n digit(N, 'I', 'V', 'X')\\n ; [] ) ) ) ).\\n\\n:- func digit(int, char, char, char) = list(char).\\n:- mode digit(in, in, in, in) = out is semidet.\\ndigit(1, X, _, _) = [X].\\ndigit(2, X, _, _) = [X, X].\\ndigit(3, X, _, _) = [X, X, X].\\ndigit(4, X, Y, _) = [X, Y].\\ndigit(5, _, Y, _) = [Y].\\ndigit(6, X, Y, _) = [Y, X].\\ndigit(7, X, Y, _) = [Y, X, X].\\ndigit(8, X, Y, _) = [Y, X, X, X].\\ndigit(9, X, _, Z) = [X, Z].\\n\\n:- end_module roman2.\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"arabicNumeral = 1990\\nConvertToRoman()\\nTextWindow.WriteLine(romanNumeral) 'MCMXC\\narabicNumeral = 2018\\nConvertToRoman()\\nTextWindow.WriteLine(romanNumeral) 'MMXVIII\\narabicNumeral = 3888\\nConvertToRoman()\\nTextWindow.WriteLine(romanNumeral) 'MMMDCCCLXXXVIII\\n\\nSub ConvertToRoman\\n weights[0] = 1000\\n weights[1] = 900\\n weights[2] = 500\\n weights[3] = 400\\n weights[4] = 100\\n weights[5] = 90\\n weights[6] = 50\\n weights[7] = 40\\n weights[8] = 10\\n weights[9] = 9\\n weights[10] = 5\\n weights[11] = 4\\n weights[12] = 1\\n symbols[0] = \\\"M\\\"\\n symbols[1] = \\\"CM\\\"\\n symbols[2] = \\\"D\\\"\\n symbols[3] = \\\"CD\\\"\\n symbols[4] = \\\"C\\\"\\n symbols[5] = \\\"XC\\\"\\n symbols[6] = \\\"L\\\"\\n symbols[7] = \\\"XL\\\"\\n symbols[8] = \\\"X\\\"\\n symbols[9] = \\\"IX\\\"\\n symbols[10] = \\\"V\\\"\\n symbols[11] = \\\"IV\\\"\\n symbols[12] = \\\"I\\\"\\n romanNumeral = \\\"\\\"\\n i = 0\\n While (i <= 12) And (arabicNumeral > 0)\\n While arabicNumeral >= weights[i]\\n romanNumeral = Text.Append(romanNumeral, symbols[i])\\n arabicNumeral = arabicNumeral - weights[i]\\n EndWhile\\n i = i + 1\\n EndWhile\\nEndSub\\n\",\n \"language\": \"Microsoft-Small-Basic\"\n },\n {\n \"code\": \"main :: [sys_message]\\nmain = [ Stdout (show n ++ \\\": \\\" ++ toroman n ++ \\\"\\\\n\\\")\\n | n <- [1990, 2008, 1666, 2023]]\\n\\ntoroman :: num->[char]\\ntoroman 0 = \\\"\\\"\\ntoroman n = d ++ toroman (n - v)\\n where digits = [(\\\"M\\\",1000),(\\\"CM\\\",900),(\\\"D\\\",500),(\\\"CD\\\",400),\\n (\\\"C\\\",100),(\\\"XC\\\",90),(\\\"L\\\",50),(\\\"XL\\\",40),\\n (\\\"X\\\",10),(\\\"IX\\\",9),(\\\"V\\\",5),(\\\"IV\\\",4),\\n (\\\"I\\\",1)]\\n (d, v) = hd [(d,v) | (d,v) <- digits; v <= n]\\n\",\n \"language\": \"Miranda\"\n },\n {\n \"code\": \"MODULE RomanNumeralsEncode;\\n\\nFROM Strings IMPORT\\n Append;\\nFROM STextIO IMPORT\\n WriteString, WriteLn;\\n\\nCONST\\n MaxChars = 15;\\n (* 3888 or MMMDCCCLXXXVIII (15 chars) is the longest string properly encoded\\n with these symbols. *)\\n\\nTYPE\\n TRomanNumeral = ARRAY [0 .. MaxChars - 1] OF CHAR;\\n\\nPROCEDURE ToRoman(AValue: CARDINAL; VAR OUT Destination: ARRAY OF CHAR);\\nTYPE\\n TRomanSymbols = ARRAY [0 .. 1] OF CHAR;\\n TWeights = ARRAY [0 .. 12] OF CARDINAL;\\n TSymbols = ARRAY [0 .. 12] OF TRomanSymbols;\\nCONST\\n Weights = TWeights {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};\\n Symbols = TSymbols {\\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\", \\\"L\\\", \\\"XL\\\", \\\"X\\\", \\\"IX\\\",\\n \\\"V\\\", \\\"IV\\\", \\\"I\\\"};\\nVAR\\n I: CARDINAL;\\nBEGIN\\n Destination := \\\"\\\";\\n I := 0;\\n WHILE (I <= HIGH(Weights)) AND (AValue > 0) DO\\n WHILE AValue >= Weights[I] DO\\n Append(Symbols[I], Destination);\\n AValue := AValue - Weights[I]\\n END;\\n INC(I);\\n END;\\nEND ToRoman;\\n\\nVAR\\n Numeral: TRomanNumeral;\\n\\nBEGIN\\n ToRoman(1990, Numeral); WriteString(Numeral); WriteLn; (* MCMXC *)\\n ToRoman(2018, Numeral); WriteString(Numeral); WriteLn; (* MMXVIII *)\\n ToRoman(3888, Numeral); WriteString(Numeral); WriteLn; (* MMMDCCCLXXXVIII *)\\nEND RomanNumeralsEncode.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"TOROMAN(INPUT)\\n ;Converts INPUT into a Roman numeral. INPUT must be an integer between 1 and 3999\\n ;OUTPUT is the string to return\\n ;I is a loop variable\\n ;CURRVAL is the current value in the loop\\n QUIT:($FIND(INPUT,\\\".\\\")>1)!(INPUT<=0)!(INPUT>3999) \\\"Invalid input\\\"\\n NEW OUTPUT,I,CURRVAL\\n SET OUTPUT=\\\"\\\",CURRVAL=INPUT\\n SET:$DATA(ROMANNUM)=0 ROMANNUM=\\\"I^IV^V^IX^X^XL^L^XC^C^CD^D^CM^M\\\"\\n SET:$DATA(ROMANVAL)=0 ROMANVAL=\\\"1^4^5^9^10^40^50^90^100^400^500^900^1000\\\"\\n FOR I=$LENGTH(ROMANVAL,\\\"^\\\"):-1:1 DO\\n .FOR Q:CURRVAL<$PIECE(ROMANVAL,\\\"^\\\",I) SET OUTPUT=OUTPUT_$PIECE(ROMANNUM,\\\"^\\\",I),CURRVAL=CURRVAL-$PIECE(ROMANVAL,\\\"^\\\",I)\\n KILL I,CURRVAL\\n QUIT OUTPUT\\n\",\n \"language\": \"MUMPS\"\n },\n {\n \"code\": \"TOROMAN(n)\\n ;return empty string if input parameter 'n' is not in 1-3999\\n Quit:(n'?1.4N)!(n'<4000)!'n \\\"\\\"\\n New r Set r=\\\"\\\"\\n New p Set p=$Length(n)\\n New j,x\\n For j=1:1:p Do\\n . Set x=$Piece(\\\"~I~II~III~IV~V~VI~VII~VIII~IX\\\",\\\"~\\\",$Extract(n,j)+1)\\n . Set x=$Translate(x,\\\"IVX\\\",$Piece(\\\"IVX~XLC~CDM~M\\\",\\\"~\\\",p-j+1))\\n . Set r=r_x\\n Quit r\\n\",\n \"language\": \"MUMPS\"\n },\n {\n \"code\": \"10 REM Roman numerals/Encode\\n20 DIM WEIGHTS(12),SYMBOLS$(12)\\n30 FOR I=0 TO 12\\n40 READ WEIGHTS(I),SYMBOLS$(I)\\n50 NEXT I\\n60 DATA 1000,M,900,CM,500,D,400,CD,100,C,90,XC\\n70 DATA 50,L,40,XL,10,X,9,IX,5,V,4,IV,1,I\\n80 REM ** 3888 or MMMDCCCLXXXVIII (15 chars) is\\n90 REM the longest string properly encoded\\n100 REM with these symbols.\\n110 V=1990:GOSUB 500\\n120 PRINT ROMAN$:REM MCMXC\\n130 V=2022:GOSUB 500\\n140 PRINT ROMAN$:REM MMXXII\\n150 V=3888:GOSUB 500\\n160 PRINT ROMAN$:REM MMMDCCCLXXXVIII\\n170 END\\n490 REM ** Encode to roman\\n500 ROMAN$=\\\"\\\"\\n510 I=0\\n520 IF I>12 OR V<=0 THEN RETURN\\n530 IF V<WEIGHTS(I) THEN 570\\n540 ROMAN$=ROMAN$+SYMBOLS$(I)\\n550 V=V-WEIGHTS(I)\\n560 GOTO 530\\n570 I=I+1\\n580 GOTO 520\\n590 RETURN\\n\",\n \"language\": \"Nascom-BASIC\"\n },\n {\n \"code\": \"import strutils\\n\\nconst nums = [(1000, \\\"M\\\"), (900, \\\"CM\\\"), (500, \\\"D\\\"), (400, \\\"CD\\\"), (100, \\\"C\\\"), (90, \\\"XC\\\"),\\n (50, \\\"L\\\"), (40, \\\"XL\\\"), (10, \\\"X\\\"), (9, \\\"IX\\\"), (5, \\\"V\\\"), (4, \\\"IV\\\"), (1, \\\"I\\\")]\\n\\nproc toRoman(n: Positive): string =\\n var n = n.int\\n for (a, r) in nums:\\n result.add(repeat(r, n div a))\\n n = n mod a\\n\\nfor i in [1, 2, 3, 4, 5, 6, 7, 8, 9, 10,\\n 11, 12, 13, 14, 15, 16, 17, 18, 19, 20,\\n 25, 30, 40, 50, 60, 69, 70, 80, 90, 99,\\n 100, 200, 300, 400, 500, 600, 666, 700, 800, 900,\\n 1000, 1009, 1444, 1666, 1945, 1997, 1999,\\n 2000, 2008, 2010, 2011, 2500, 3000, 3999]:\\n echo ($i).align(4), \\\": \\\", i.toRoman\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"bundle Default {\\n class Roman {\\n nums: static : Int[];\\n rum : static : String[];\\n\\n function : Init() ~ Nil {\\n nums := [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1];\\n rum := [\\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\", \\\"L\\\", \\\"XL\\\", \\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\", \\\"I\\\"];\\n }\\n\\n function : native : ToRoman(number : Int) ~ String {\\n result := \\\"\\\";\\n\\n for(i :=0; i < nums->Size(); i += 1;) {\\n while(number >= nums[i]) {\\n result->Append(rum[i]);\\n number -= nums[i];\\n };\\n };\\n\\n return result;\\n }\\n\\n function : Main(args : String[]) ~ Nil {\\n Init();\\n\\n ToRoman(1999)->PrintLine();\\n ToRoman(25)->PrintLine();\\n ToRoman(944)->PrintLine();\\n }\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"let digit x y z = function\\n 1 -> [x]\\n | 2 -> [x;x]\\n | 3 -> [x;x;x]\\n | 4 -> [x;y]\\n | 5 -> [y]\\n | 6 -> [y;x]\\n | 7 -> [y;x;x]\\n | 8 -> [y;x;x;x]\\n | 9 -> [x;z]\\n\\nlet rec to_roman x =\\n if x = 0 then []\\n else if x < 0 then\\n invalid_arg \\\"Negative roman numeral\\\"\\n else if x >= 1000 then\\n 'M' :: to_roman (x - 1000)\\n else if x >= 100 then\\n digit 'C' 'D' 'M' (x / 100) @ to_roman (x mod 100)\\n else if x >= 10 then\\n digit 'X' 'L' 'C' (x / 10) @ to_roman (x mod 10)\\n else\\n digit 'I' 'V' 'X' x\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"[ [1000,\\\"M\\\"], [900,\\\"CM\\\"], [500,\\\"D\\\"], [400,\\\"CD\\\"], [100,\\\"C\\\"], [90,\\\"XC\\\"], [50,\\\"L\\\"], [40,\\\"XL\\\"], [10,\\\"X\\\"], [9,\\\"IX\\\"], [5,\\\"V\\\"], [4,\\\"IV\\\"], [1,\\\"I\\\"] ] const: Romans\\n\\n: roman(n)\\n| r |\\n StringBuffer new\\n Romans forEach: r [ while(r first n <=) [ r second << n r first - ->n ] ] ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"FUNCTION encodeRoman RETURNS CHAR (\\n i_i AS INT\\n):\\n\\n DEF VAR cresult AS CHAR.\\n DEF VAR croman AS CHAR EXTENT 7 INIT [ \\\"M\\\", \\\"D\\\", \\\"C\\\", \\\"L\\\", \\\"X\\\", \\\"V\\\", \\\"I\\\" ].\\n DEF VAR idecimal AS INT EXTENT 7 INIT [ 1000, 500, 100, 50, 10, 5, 1 ].\\n DEF VAR ipos AS INT INIT 1.\\n\\n DO WHILE i_i > 0:\\n\\n IF i_i - idecimal[ ipos ] >= 0 THEN\\n ASSIGN\\n cresult = cresult + croman[ ipos ]\\n i_i = i_i - idecimal[ ipos ]\\n .\\n ELSE IF ipos < EXTENT( croman ) - 1 AND i_i - ( idecimal[ ipos ] - idecimal[ ipos + 2 ] ) >= 0 THEN\\n ASSIGN\\n cresult = cresult + croman[ ipos + 2 ] + croman[ ipos ]\\n i_i = i_i - ( idecimal[ ipos ] - idecimal[ ipos + 2 ] )\\n ipos = ipos + 1\\n .\\n ELSE\\n ipos = ipos + 1.\\n END.\\n\\n RETURN cresult.\\n\\nEND FUNCTION. /* encodeRoman */\\n\\nMESSAGE\\n 1990 encodeRoman( 1990 ) SKIP\\n 2008 encodeRoman( 2008 ) SKIP\\n 2000 encodeRoman( 2000 ) SKIP\\n 1666 encodeRoman( 1666 ) SKIP\\nVIEW-AS ALERT-BOX.\\n\",\n \"language\": \"OpenEdge-Progress\"\n },\n {\n \"code\": \"declare\\n fun {Digit X Y Z K}\\n unit([X] [X X] [X X X] [X Y] [Y] [Y X] [Y X X] [Y X X X] [X Z])\\n .K\\n end\\n\\n fun {ToRoman X}\\n if X == 0 then \\\"\\\"\\n elseif X < 0 then raise toRoman(negativeInput X) end\\n elseif X >= 1000 then \\\"M\\\"#{ToRoman X-1000}\\n elseif X >= 100 then {Digit &C &D &M X div 100}#{ToRoman X mod 100}\\n elseif X >= 10 then {Digit &X &L &C X div 10}#{ToRoman X mod 10}\\n else {Digit &I &V &X X}\\n end\\n end\\nin\\n {ForAll {Map [1999 25 944] ToRoman} System.showInfo}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"oldRoman(n)={\\n while(n>999999,\\n n-=1000000;\\n print1(\\\"((((I))))\\\")\\n );\\n if(n>499999,\\n n-=500000;\\n print1(\\\"I))))\\\")\\n );\\n while(n>99999,\\n n-=100000;\\n print1(\\\"(((I)))\\\")\\n );\\n if(n>49999,\\n n-=50000;\\n print1(\\\"I)))\\\")\\n );\\n while(n>9999,\\n n-=10000;\\n print1(\\\"((I))\\\")\\n );\\n if(n>4999,\\n n-=5000;\\n print1(\\\"I))\\\")\\n );\\n while(n>999,\\n n-=1000;\\n print1(\\\"(I)\\\")\\n );\\n if(n>499,\\n n-=500;\\n print1(\\\"I)\\\")\\n );\\n while(n>99,\\n n-=100;\\n print1(\\\"C\\\")\\n );\\n if(n>49,\\n n-=50;\\n print1(\\\"L\\\");\\n );\\n while(n>9,\\n n-=10;\\n print1(\\\"X\\\")\\n );\\n if(n>4,\\n n-=5;\\n print1(\\\"V\\\");\\n );\\n while(n,\\n n--;\\n print1(\\\"I\\\")\\n );\\n print()\\n};\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"medievalRoman(n)={\\n while(n>999,\\n n-=1000;\\n print1(\\\"M\\\")\\n );\\n if(n>899,\\n n-=900;\\n print1(\\\"CM\\\")\\n );\\n if(n>499,\\n n-=500;\\n print1(\\\"D\\\")\\n );\\n if(n>399,\\n n-=400;\\n print1(\\\"CD\\\")\\n );\\n while(n>99,\\n n-=100;\\n print1(\\\"C\\\")\\n );\\n if(n>89,\\n n-=90;\\n print1(\\\"XC\\\")\\n );\\n if(n>49,\\n n-=50;\\n print1(\\\"L\\\")\\n );\\n if(n>39,\\n n-=40;\\n print1(\\\"XL\\\")\\n );\\n while(n>9,\\n n-=10;\\n print1(\\\"X\\\")\\n );\\n if(n>8,\\n n-=9;\\n print1(\\\"IX\\\")\\n );\\n if(n>4,\\n n-=5;\\n print1(\\\"V\\\")\\n );\\n if(n>3,\\n n-=4;\\n print1(\\\"IV\\\")\\n );\\n while(n,\\n n--;\\n print1(\\\"I\\\")\\n );\\n print()\\n};\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"<@ DEFUDOLITLIT>_RO|__Transformer|<@ DEFKEYPAR>__NationalNumericID|2</@><@ LETRESCS%NNMPAR>...|1</@></@>\\n\\n<@ ENU$$DLSTLITLIT>1990,2008,1,2,64,124,1666,10001|,|\\n<@ SAYELTLST>...</@> is <@ SAY_ROELTLSTLIT>...|RomanLowerUnicode</@> <@ SAY_ROELTLSTLIT>...|RomanUpperUnicode</@> <@ SAY_ROELTLSTLIT>...|RomanASCII</@>\\n</@>\\n\",\n \"language\": \"Peloton\"\n },\n {\n \"code\": \"<# DEFINE USERDEFINEDOPCODE LITERAL LITERAL>_RO|__Transformer|<# DEFINE KEYWORD PARAMETER>__NationalNumericID|2</#><# LET RESULT CAST NATIONALNUMBER PARAMETER>...|1</#></#>\\n\\n<# ENUMERATION LAMBDASPECIFIEDDELMITER LIST LITERAL LITERAL>1990,2008,1,2,64,124,1666,10001|,|\\n<# SAY ELEMENT LIST>...</#> is <# SAY _RO ELEMENT LIST LITERAL>...|RomanLowerUnicode</#> <# SAY _RO ELEMENT LIST LITERAL>...|RomanUpperUnicode</#> <# SAY _RO ELEMENT LIST LITERAL>...|RomanASCII</#>\\n</#>\\n\",\n \"language\": \"Peloton\"\n },\n {\n \"code\": \"my @symbols = ( [1000, 'M'], [900, 'CM'], [500, 'D'], [400, 'CD'], [100, 'C'], [90, 'XC'], [50, 'L'], [40, 'XL'], [10, 'X'], [9, 'IX'], [5, 'V'], [4, 'IV'], [1, 'I'] );\\n\\nsub roman {\\n my($n, $r) = (shift, '');\\n ($r, $n) = ('-', -$n) if $n < 0; # Optional handling of negative input\\n foreach my $s (@symbols) {\\n my($arabic, $roman) = @$s;\\n ($r, $n) = ($r .= $roman x int($n/$arabic), $n % $arabic)\\n if $n >= $arabic;\\n }\\n $r;\\n}\\n\\nsay roman($_) for 1..2012;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use Math::Roman qw/roman/;\\nsay roman($_) for 1..2012'\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use List::MoreUtils qw( natatime );\\n\\nmy %symbols = (\\n 1 => \\\"I\\\", 5 => \\\"V\\\", 10 => \\\"X\\\", 50 => \\\"L\\\", 100 => \\\"C\\\",\\n 500 => \\\"D\\\", 1_000 => \\\"M\\\"\\n);\\n\\nmy @subtractors = (\\n 1_000, 100, 500, 100, 100, 10, 50, 10, 10, 1, 5, 1, 1, 0\\n);\\n\\nsub roman {\\n return '' if 0 == (my $n = shift);\\n my $iter = natatime 2, @subtractors;\\n while( my ($cut, $minus) = $iter->() ) {\\n $n >= $cut\\n and return $symbols{$cut} . roman($n - $cut);\\n $n >= $cut - $minus\\n and return $symbols{$minus} . roman($n + $minus);\\n }\\n};\\n\\nprint roman($_) . \\\"\\\\n\\\" for 1..2012;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"with javascript_semantics\\nfunction toRoman(integer v)\\n sequence roman = {\\\"M\\\", \\\"CM\\\", \\\"D\\\",\\\"CD\\\", \\\"C\\\",\\\"XC\\\",\\\"L\\\",\\\"XL\\\",\\\"X\\\",\\\"IX\\\",\\\"V\\\",\\\"IV\\\",\\\"I\\\"},\\n decml = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 }\\n string res = \\\"\\\"\\n integer val = v\\n for i=1 to length(roman) do\\n while val>=decml[i] do\\n res &= roman[i]\\n val -= decml[i]\\n end while\\n end for\\n return {v,res} -- (for output)\\nend function\\n\\n?apply({1990,2008,1666},toRoman)\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"with javascript_semantics\\nrequires(\\\"1.0.5\\\")\\nfunction toRoman(integer n)\\n return {n,sprintf(\\\"%R\\\",n)}\\nend function\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\ndef romanEnc /# n -- s #/\\n var number\\n \\\"\\\" var res\\n ( ( 1000 \\\"M\\\" ) ( 900 \\\"CM\\\" ) ( 500 \\\"D\\\" ) ( 400 \\\"CD\\\" ) ( 100 \\\"C\\\" ) ( 90 \\\"XC\\\" )\\n ( 50 \\\"L\\\" ) ( 40 \\\"XL\\\" ) ( 10 \\\"X\\\" ) ( 9 \\\"IX\\\" ) ( 5 \\\"V\\\" ) ( 4 \\\"IV\\\" ) ( 1 \\\"I\\\" ) )\\n\\n len for\\n get 1 get\\n number over / int\\n number rot mod var number\\n swap 2 get rot dup if\\n for drop res over chain var res endfor\\n else\\n drop\\n endif\\n drop drop\\n endfor\\n drop\\n res\\nenddef\\n\\n1968 romanEnc print\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"def romanEnc /# n -- s #/\\n var k\\n ( ( 1000 \\\"M\\\" ) ( 900 \\\"CM\\\" ) ( 500 \\\"D\\\" ) ( 400 \\\"CD\\\" ) ( 100 \\\"C\\\" ) ( 90 \\\"XC\\\" )\\n ( 50 \\\"L\\\" ) ( 40 \\\"XL\\\" ) ( 10 \\\"X\\\" ) ( 9 \\\"IX\\\" ) ( 5 \\\"V\\\" ) ( 4 \\\"IV\\\" ) ( 1 \\\"I\\\" ) )\\n\\n len for\\n get 2 get var let 1 get var val drop\\n k val >=\\n while\\n k val - var k\\n let print\\n k val >=\\n endwhile\\n endfor\\n drop nl\\nenddef\\n\\n1968 romanEnc\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"def romanEnc /# n -- s #/\\n >ps\\n ( ( 1000 \\\"M\\\" ) ( 900 \\\"CM\\\" ) ( 500 \\\"D\\\" ) ( 400 \\\"CD\\\" ) ( 100 \\\"C\\\" ) ( 90 \\\"XC\\\" )\\n ( 50 \\\"L\\\" ) ( 40 \\\"XL\\\" ) ( 10 \\\"X\\\" ) ( 9 \\\"IX\\\" ) ( 5 \\\"V\\\" ) ( 4 \\\"IV\\\" ) ( 1 \\\"I\\\" ) )\\n\\n len for\\n get 2 get swap 1 get nip\\n tps over >=\\n while\\n ps> over - >ps\\n over print\\n tps over >=\\n endwhile\\n drop drop\\n endfor\\n ps> drop drop nl\\nenddef\\n\\n1968 romanEnc\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"/**\\n * int2roman\\n * Convert any positive value of a 32-bit signed integer to its modern roman\\n * numeral representation. Numerals within parentheses are multiplied by\\n * 1000. ie. M == 1 000, (M) == 1 000 000, ((M)) == 1 000 000 000\\n *\\n * @param number - an integer between 1 and 2147483647\\n * @return roman numeral representation of number\\n */\\nfunction int2roman($number)\\n{\\n\\tif (!is_int($number) || $number < 1) return false; // ignore negative numbers and zero\\n\\t\\n\\t$integers = array(900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1);\\n\\t$numerals = array('CM', 'D', 'CD', 'C', 'XC', 'L', 'XL', 'X', 'IX', 'V', 'IV', 'I');\\n\\t$major = intval($number / 1000) * 1000;\\n\\t$minor = $number - $major;\\n\\t$numeral = $leastSig = '';\\n\\t\\n\\tfor ($i = 0; $i < sizeof($integers); $i++) {\\n\\t\\twhile ($minor >= $integers[$i]) {\\n\\t\\t\\t$leastSig .= $numerals[$i];\\n\\t\\t\\t$minor -= $integers[$i];\\n\\t\\t}\\n\\t}\\n\\t\\n\\tif ($number >= 1000 && $number < 40000) {\\n\\t\\tif ($major >= 10000) {\\n\\t\\t\\t$numeral .= '(';\\n\\t\\t\\twhile ($major >= 10000) {\\n\\t\\t\\t\\t$numeral .= 'X';\\n\\t\\t\\t\\t$major -= 10000;\\n\\t\\t\\t}\\n\\t\\t\\t$numeral .= ')';\\n\\t\\t}\\n\\t\\tif ($major == 9000) {\\n\\t\\t\\t$numeral .= 'M(X)';\\n\\t\\t\\treturn $numeral . $leastSig;\\n\\t\\t}\\n\\t\\tif ($major == 4000) {\\n\\t\\t\\t$numeral .= 'M(V)';\\n\\t\\t\\treturn $numeral . $leastSig;\\n\\t\\t}\\n\\t\\tif ($major >= 5000) {\\n\\t\\t\\t$numeral .= '(V)';\\n\\t\\t\\t$major -= 5000;\\n\\t\\t}\\n\\t\\twhile ($major >= 1000) {\\n\\t\\t\\t$numeral .= 'M';\\n\\t\\t\\t$major -= 1000;\\n\\t\\t}\\n\\t}\\n\\t\\n\\tif ($number >= 40000) {\\n\\t\\t$major = $major/1000;\\n\\t\\t$numeral .= '(' . int2roman($major) . ')';\\n\\t}\\n\\t\\n\\treturn $numeral . $leastSig;\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"go =>\\n List = [455,999,1990,1999,2000,2001,2008,2009,2010,2011,2012,1666,3456,3888,4000],\\n foreach(Val in List)\\n printf(\\\"%4d: %w\\\\n\\\", Val, roman_encode(Val))\\n end,\\n nl.\\n\\nroman_encode(Val) = Res =>\\n if Val <= 0 then\\n Res := -1\\n else\\n Arabic = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1],\\n Roman = [\\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\",\\\"L\\\",\\\"XL\\\",\\\"X\\\",\\\"IX\\\",\\\"V\\\",\\\"IV\\\",\\\"I\\\"],\\n Res = \\\"\\\",\\n foreach(I in 1..Arabic.length)\\n while(Val >= Arabic[I])\\n Res := Res ++ Roman[I],\\n Val := Val - Arabic[I]\\n end\\n end\\n end.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"go2 =>\\n All = [Len=I=roman_encode(I) : I in 1..4000,E=roman_encode(I), Len=E.len].sort_down,\\n println(All[1..2]),\\n nl.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de roman (N)\\n (pack\\n (make\\n (mapc\\n '((C D)\\n (while (>= N D)\\n (dec 'N D)\\n (link C) ) )\\n '(M CM D CD C XC L XL X IX V IV I)\\n (1000 900 500 400 100 90 50 40 10 9 5 4 1) ) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"import String;\\nint main(){\\n write(int2roman(2009) + \\\"\\\\n\\\");\\n write(int2roman(1666) + \\\"\\\\n\\\");\\n write(int2roman(1337) + \\\"\\\\n\\\");\\n}\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"/* From Wiki Fortran */\\nroman: procedure (n) returns(character (32) varying);\\n declare n fixed binary nonassignable;\\n declare (d, m) fixed binary;\\n declare (r, m_div) character (32) varying;\\n declare d_dec(13) fixed binary static initial\\n (1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1);\\n declare d_rom(13) character (2) varying static initial\\n ('M', 'CM', 'D', 'CD', 'C', 'XC', 'L',\\n 'XL', 'X', 'IX', 'V', 'IV', 'I');\\n r = '';\\n m = n;\\n do d = 1 to 13;\\n m_div = m / d_dec (d);\\n r = r || copy (d_rom (d), m_div);\\n m = m - d_dec (d) * m_div;\\n end;\\n return (r);\\nend roman;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"/*****************************************************************\\n * $Author: Atanas Kebedjiev $\\n *****************************************************************\\n * Encoding an Arabic numeral to a Roman in the range 1..3999 is much simpler as Oracle provides the conversion formats.\\n * Please see also the SQL solution for the same task.\\n */\\n\\nCREATE OR REPLACE\\nFUNCTION rencode(an IN NUMBER)\\n RETURN VARCHAR2\\nIS\\nBEGIN\\n RETURN to_char(an, 'RN');\\nEND rencode;\\n\\nBEGIN\\n\\n DBMS_OUTPUT.PUT_LINE ('2012 = ' || rencode('2012')); -- MMXII\\n DBMS_OUTPUT.PUT_LINE ('1951 = ' || rencode('1951')); -- MCMLI\\n DBMS_OUTPUT.PUT_LINE ('1987 = ' || rencode('1987')); -- MCMLXXXVII\\n DBMS_OUTPUT.PUT_LINE ('1666 = ' || rencode('1666')); -- MDCLXVI\\n DBMS_OUTPUT.PUT_LINE ('1999 = ' || rencode('1999')); -- MCMXCIX\\n\\nEND;\\n\",\n \"language\": \"PL-SQL\"\n },\n {\n \"code\": \"\\\\def\\\\upperroman#1{\\\\uppercase\\\\expandafter{\\\\romannumeral#1}}\\nAnno Domini \\\\upperroman{\\\\year}\\n\\\\bye\\n\",\n \"language\": \"PlainTeX\"\n },\n {\n \"code\": \"FUNCTION toRoman(value AS INTEGER) AS STRING\\n DIM arabic(0 TO 12) AS INTEGER\\n DIM roman(0 TO 12) AS STRING\\n ARRAY ASSIGN arabic() = 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1\\n ARRAY ASSIGN roman() = \\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\", \\\"L\\\", \\\"XL\\\", \\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\", \\\"I\\\"\\n\\n DIM i AS INTEGER\\n DIM result AS STRING\\n\\n FOR i = 0 TO 12\\n DO WHILE value >= arabic(i)\\n result = result & roman(i)\\n value = value - arabic(i)\\n LOOP\\n NEXT i\\n toRoman = result\\nEND FUNCTION\\n\\nFUNCTION PBMAIN\\n 'Testing\\n ? \\\"2009 = \\\" & toRoman(2009)\\n ? \\\"1666 = \\\" & toRoman(1666)\\n ? \\\"3888 = \\\" & toRoman(3888)\\nEND FUNCTION\\n\",\n \"language\": \"PowerBASIC\"\n },\n {\n \"code\": \"Filter ToRoman {\\n\\t$output = ''\\n\\t\\n\\tif ($_ -ge 4000) {\\n\\t\\tthrow 'Number too high'\\n\\t}\\n\\t\\n\\t$current = 1000\\n\\t$subtractor = 'M'\\n\\t$whole = $False\\n\\t$decimal = $_\\n\\t'C','D','X','L','I','V',' ' `\\n\\t| %{\\n\\t\\t$divisor = $current\\n\\t\\tif ($whole = !$whole) {\\n\\t\\t\\t$current /= 10\\n\\t\\t\\t$subtractor = $_ + $subtractor[0]\\n\\t\\t\\t$_ = $subtractor[1]\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\t$divisor *= 5\\n\\t\\t\\t$subtractor = $subtractor[0] + $_\\n\\t\\t}\\n\\t\\t\\n\\t\\t$multiple = [Math]::floor($decimal / $divisor)\\n\\t\\tif ($multiple) {\\n\\t\\t\\t$output += [string]$_ * $multiple\\n\\t\\t\\t$decimal %= $divisor\\n\\t\\t}\\n\\t\\tif ($decimal -ge ($divisor -= $current)) {\\n\\t\\t\\t$output += $subtractor\\n\\t\\t\\t$decimal -= $divisor\\n\\t\\t}\\n\\t}\\n\\t\\n\\t$output\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"19,4,0,2479,3001 | ToRoman\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \":- use_module(library(clpfd)).\\n\\nroman :-\\n\\tLA = [ _ , 2010, _, 1449, _],\\n\\tLR = ['MDCCLXXXIX', _ , 'CX', _, 'MDCLXVI'],\\n\\tmaplist(roman, LA, LR),\\n\\tmaplist(my_print,LA, LR).\\n\\n\\nroman(A, R) :-\\n\\tA #> 0,\\n\\troman(A, [u, t, h, th], LR, []),\\n\\tlabel([A]),\\n\\tparse_Roman(CR, LR, []),\\n\\tatom_chars(R, CR).\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n% using DCG\\n\\nroman(0, []) --> [].\\n\\nroman(N, [H | T]) -->\\n\\t{N1 #= N / 10,\\n\\t N2 #= N mod 10},\\n\\troman(N1, T),\\n\\tunity(N2, H).\\n\\nunity(1, u) --> ['I'].\\nunity(1, t) --> ['X'].\\nunity(1, h) --> ['C'].\\nunity(1, th)--> ['M'].\\n\\nunity(4, u) --> ['IV'].\\nunity(4, t) --> ['XL'].\\nunity(4, h) --> ['CD'].\\nunity(4, th)--> ['MMMM'].\\n\\nunity(5, u) --> ['V'].\\nunity(5, t) --> ['L'].\\nunity(5, h) --> ['D'].\\nunity(5, th)--> ['MMMMM'].\\n\\nunity(9, u) --> ['IX'].\\nunity(9, t) --> ['XC'].\\nunity(9, h) --> ['CM'].\\nunity(9, th)--> ['MMMMMMMMM'].\\n\\nunity(0, _) --> [].\\n\\n\\nunity(V, U)-->\\n\\t{V #> 5,\\n\\tV1 #= V - 5},\\n\\tunity(5, U),\\n\\tunity(V1, U).\\n\\nunity(V, U) -->\\n\\t{V #> 1, V #< 4,\\n\\tV1 #= V-1},\\n\\tunity(1, U),\\n\\tunity(V1, U).\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\n% Extraction of roman \\\"lexeme\\\"\\nparse_Roman(['C','M'|T]) -->\\n\\t['CM'],\\n\\tparse_Roman(T).\\n\\nparse_Roman(['C','D'|T]) -->\\n\\t['CD'],\\n\\tparse_Roman(T).\\n\\nparse_Roman(['X','C'| T]) -->\\n\\t['XC'],\\n\\tparse_Roman(T).\\n\\n\\nparse_Roman(['X','L'| T]) -->\\n\\t['XL'],\\n\\tparse_Roman(T).\\n\\n\\nparse_Roman(['I','X'| T]) -->\\n\\t['IX'],\\n\\tparse_Roman(T).\\n\\n\\nparse_Roman(['I','V'| T]) -->\\n\\t['IV'],\\n\\tparse_Roman(T).\\n\\nparse_Roman([H | T]) -->\\n\\t[H],\\n\\tparse_Roman(T).\\n\\n\\nparse_Roman([]) -->\\n\\t[].\\n\\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\\nmy_print(A, R) :-\\n\\tformat('~w in roman is ~w~n', [A, R]).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"#SymbolCount = 12 ;0 based count\\nDataSection\\n denominations:\\n Data.s \\\"M\\\",\\\"CM\\\",\\\"D\\\",\\\"CD\\\",\\\"C\\\",\\\"XC\\\",\\\"L\\\",\\\"XL\\\",\\\"X\\\",\\\"IX\\\",\\\"V\\\",\\\"IV\\\",\\\"I\\\" ;0-12\\n\\n denomValues:\\n Data.i 1000,900,500,400,100,90,50,40,10,9,5,4,1 ;values in decending sequential order\\nEndDataSection\\n\\n;-setup\\nStructure romanNumeral\\n symbol.s\\n value.i\\nEndStructure\\n\\nGlobal Dim refRomanNum.romanNumeral(#SymbolCount)\\n\\nRestore denominations\\nFor i = 0 To #SymbolCount\\n Read.s refRomanNum(i)\\\\symbol\\nNext\\n\\nRestore denomValues\\nFor i = 0 To #SymbolCount\\n Read refRomanNum(i)\\\\value\\nNext\\n\\nProcedure.s decRoman(n)\\n ;converts a decimal number to a roman numeral\\n Protected roman$, i\\n\\n For i = 0 To #SymbolCount\\n Repeat\\n If n >= refRomanNum(i)\\\\value\\n roman$ + refRomanNum(i)\\\\symbol\\n n - refRomanNum(i)\\\\value\\n Else\\n Break\\n EndIf\\n ForEver\\n Next\\n\\n ProcedureReturn roman$\\nEndProcedure\\n\\nIf OpenConsole()\\n\\n PrintN(decRoman(1999)) ;MCMXCIX\\n PrintN(decRoman(1666)) ;MDCLXVI\\n PrintN(decRoman(25)) ;XXV\\n PrintN(decRoman(954)) ;CMLIV\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\")\\n Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import roman\\nprint(roman.toRoman(2022))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def toRoman(n):\\n res=''\\t\\t#converts int to str(Roman numeral)\\n reg=n\\t\\t#using the numerals (M,D,C,L,X,V,I)\\n if reg<4000:#no more than three repetitions\\n while reg>=1000:\\t#thousands up to MMM\\n res+='M'\\t\\t#MAX is MMMCMXCIX\\n reg-=1000\\t\\t\\n if reg>=900:\\t\\t#nine hundreds in 900-999\\n res+='CM'\\n reg-=900\\n if reg>=500:\\t\\t#five hudreds in 500-899\\n res+='D'\\n reg-=500\\n if reg>=400:\\t\\t#four hundreds in 400-499\\n res+='CD'\\n reg-=400\\n while reg>=100:\\t\\t#hundreds in 100-399\\n res+='C'\\n reg-=100\\n if reg>=90:\\t\\t\\t#nine tens in 90-99\\n res+='XC'\\n reg-=90\\n if reg>=50:\\t\\t\\t#five Tens in 50-89\\n res+='L'\\n reg-=50\\n if reg>=40:\\n res+='XL'\\t\\t#four Tens\\n reg-=40\\n while reg>=10:\\n res+=\\\"X\\\"\\t\\t#tens\\n reg-=10\\n if reg>=9:\\n res+='IX'\\t\\t#nine Units\\n reg-=9\\n if reg>=5:\\n res+='V'\\t\\t#five Units\\n reg-=5\\n if reg>=4:\\n res+='IV'\\t\\t#four Units\\n reg-=4\\n while reg>0:\\t\\t#three or less Units\\n res+='I'\\n reg-=1\\n return res\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"roman = \\\"MDCLXVmdclxvi\\\"; # UPPERCASE for thousands #\\nadjust_roman = \\\"CCXXmmccxxii\\\";\\narabic = (1000000, 500000, 100000, 50000, 10000, 5000, 1000, 500, 100, 50, 10, 5, 1);\\nadjust_arabic = (100000, 100000, 10000, 10000, 1000, 1000, 100, 100, 10, 10, 1, 1, 0);\\n\\ndef arabic_to_roman(dclxvi):\\n org = dclxvi; # 666 #\\n out = \\\"\\\";\\n for scale,arabic_scale in enumerate(arabic):\\n if org == 0: break\\n multiples = org / arabic_scale;\\n org -= arabic_scale * multiples;\\n out += roman[scale] * multiples;\\n if org >= -adjust_arabic[scale] + arabic_scale:\\n org -= -adjust_arabic[scale] + arabic_scale;\\n out += adjust_roman[scale] + roman[scale]\\n return out\\n\\nif __name__ == \\\"__main__\\\":\\n test = (1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,25,30,40,50,60,69,70,\\n 80,90,99,100,200,300,400,500,600,666,700,800,900,1000,1009,1444,1666,1945,1997,1999,\\n 2000,2008,2500,3000,4000,4999,5000,6666,10000,50000,100000,500000,1000000);\\n for val in test:\\n print '%d - %s'%(val, arabic_to_roman(val))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"romanDgts= 'ivxlcdmVXLCDM_'\\n\\ndef ToRoman(num):\\n namoR = ''\\n if num >=4000000:\\n print 'Too Big -'\\n return '-----'\\n for rdix in range(0, len(romanDgts), 2):\\n if num==0: break\\n num,r = divmod(num,10)\\n v,r = divmod(r, 5)\\n if r==4:\\n namoR += romanDgts[rdix+1+v] + romanDgts[rdix]\\n else:\\n namoR += r*romanDgts[rdix] + (romanDgts[rdix+1] if(v==1) else '')\\n return namoR[-1::-1]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"anums = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\\nrnums = \\\"M CM D CD C XC L XL X IX V IV I\\\".split()\\n\\ndef to_roman(x):\\n ret = []\\n for a,r in zip(anums, rnums):\\n n,x = divmod(x,a)\\n ret.append(r*n)\\n return ''.join(ret)\\n\\nif __name__ == \\\"__main__\\\":\\n test = (1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,25,30,40,\\n 50,60,69,70,80,90,99,100,200,300,400,500,600,666,700,800,900,\\n 1000,1009,1444,1666,1945,1997,1999,2000,2008,2010,2011,2500,\\n 3000,3999)\\n\\n for val in test:\\n print '%d - %s'%(val, to_roman(val))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def arabic_to_roman(dclxvi):\\n#===========================\\n '''Convert an integer from the decimal notation to the Roman notation'''\\n org = dclxvi; # 666 #\\n out = \\\"\\\";\\n for scale, arabic_scale in enumerate(arabic):\\n if org == 0: break\\n multiples = org // arabic_scale;\\n org -= arabic_scale * multiples;\\n out += roman[scale] * multiples;\\n if (org >= -adjust_arabic[scale] + arabic_scale):\\n org -= -adjust_arabic[scale] + arabic_scale;\\n out += adjust_roman[scale] + roman[scale]\\n return out\\n\\nif __name__ == \\\"__main__\\\":\\n test = (1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,25,30,40,50,60,69,70,\\n 80,90,99,100,200,300,400,500,600,666,700,800,900,1000,1009,1444,1666,1945,1997,1999,\\n 2000,2008,2500,3000,4000,4999,5000,6666,10000,50000,100000,500000,1000000);\\n\\n for val in test:\\n print(\\\"%8d %s\\\" %(val, arabic_to_roman(val)))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"rnl = [ { '4' : 'MMMM', '3' : 'MMM', '2' : 'MM', '1' : 'M', '0' : '' }, { '9' : 'CM', '8' : 'DCCC', '7' : 'DCC',\\n '6' : 'DC', '5' : 'D', '4' : 'CD', '3' : 'CCC', '2' : 'CC', '1' : 'C', '0' : '' }, { '9' : 'XC',\\n '8' : 'LXXX', '7' : 'LXX', '6' : 'LX', '5' : 'L', '4' : 'XL', '3' : 'XXX', '2' : 'XX', '1' : 'X',\\n '0' : '' }, { '9' : 'IX', '8' : 'VIII', '7' : 'VII', '6' : 'VI', '5' : 'V', '4' : 'IV', '3' : 'III',\\n '2' : 'II', '1' : 'I', '0' : '' }]\\n# Option 1\\ndef number2romannumeral(n):\\n return ''.join([rnl[x][y] for x, y in zip(range(4), str(n).zfill(4)) if n < 5000 and n > -1])\\n# Option 2\\ndef number2romannumeral(n):\\n return reduce(lambda x, y: x + y, map(lambda x, y: rnl[x][y], range(4), str(n).zfill(4))) if -1 < n < 5000 else None\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Encoding Roman Numerals'''\\n\\nfrom functools import reduce\\nfrom itertools import chain\\n\\n\\n# romanFromInt :: Int -> String\\ndef romanFromInt(n):\\n '''A string of Roman numerals encoding an integer.'''\\n def go(a, ms):\\n m, s = ms\\n q, r = divmod(a, m)\\n return (r, s * q)\\n\\n return concat(snd(mapAccumL(go)(n)(\\n zip([\\n 1000, 900, 500, 400, 100, 90, 50,\\n 40, 10, 9, 5, 4, 1\\n ], [\\n 'M', 'CM', 'D', 'CD', 'C', 'XC', 'L',\\n 'XL', 'X', 'IX', 'V', 'IV', 'I'\\n ])\\n )))\\n\\n\\n# ------------------------- TEST -------------------------\\n# main :: IO ()\\ndef main():\\n '''Sample of years'''\\n for s in [\\n romanFromInt(x) for x in [\\n 1666, 1990, 2008, 2016, 2018, 2020\\n ]\\n ]:\\n print(s)\\n\\n\\n# ------------------ GENERIC FUNCTIONS -------------------\\n\\n# concat :: [[a]] -> [a]\\n# concat :: [String] -> String\\ndef concat(xxs):\\n '''The concatenation of all the elements in a list.'''\\n xs = list(chain.from_iterable(xxs))\\n unit = '' if isinstance(xs, str) else []\\n return unit if not xs else (\\n ''.join(xs) if isinstance(xs[0], str) else xs\\n )\\n\\n\\n# mapAccumL :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])\\ndef mapAccumL(f):\\n '''A tuple of an accumulation and a list derived by a\\n combined map and fold,\\n with accumulation from left to right.'''\\n def go(a, x):\\n tpl = f(a[0], x)\\n return (tpl[0], a[1] + [tpl[1]])\\n return lambda acc: lambda xs: (\\n reduce(go, xs, (acc, []))\\n )\\n\\n\\n# snd :: (a, b) -> b\\ndef snd(tpl):\\n '''Second component of a tuple.'''\\n return tpl[1]\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"DIM SHARED arabic(0 TO 12)\\nDIM SHARED roman$(0 TO 12)\\n\\nFUNCTION toRoman$ (value)\\n LET result$ = \\\"\\\"\\n FOR i = 0 TO 12\\n DO WHILE value >= arabic(i)\\n LET result$ = result$ + roman$(i)\\n LET value = value - arabic(i)\\n LOOP\\n NEXT i\\n toRoman$ = result$\\nEND FUNCTION\\n\\nFOR i = 0 TO 12\\n READ arabic(i), roman$(i)\\nNEXT i\\n\\nDATA 1000, \\\"M\\\", 900, \\\"CM\\\", 500, \\\"D\\\", 400, \\\"CD\\\", 100, \\\"C\\\", 90, \\\"XC\\\"\\nDATA 50, \\\"L\\\", 40, \\\"XL\\\", 10, \\\"X\\\", 9, \\\"IX\\\", 5, \\\"V\\\", 4, \\\"IV\\\", 1, \\\"I\\\"\\n\\n'Testing\\nPRINT \\\"2009 = \\\"; toRoman$(2009)\\nPRINT \\\"1666 = \\\"; toRoman$(1666)\\nPRINT \\\"3888 = \\\"; toRoman$(3888)\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \" [ $ \\\"\\\"\\n swap 1000 /mod $ \\\"M\\\" rot of rot swap join swap\\n dup 900 < not if [ 900 - dip [ $ \\\"CM\\\" join ] ]\\n dup 500 < not if [ 500 - dip [ $ \\\"D\\\" join ] ]\\n dup 400 < not if [ 400 - dip [ $ \\\"CD\\\" join ] ]\\n 100 /mod $ \\\"C\\\" rot of rot swap join swap\\n dup 90 < not if [ 90 - dip [ $ \\\"XC\\\" join ] ]\\n dup 50 < not if [ 50 - dip [ $ \\\"L\\\" join ] ]\\n dup 40 < not if [ 40 - dip [ $ \\\"XL\\\" join ] ]\\n 10 /mod $ \\\"X\\\" rot of rot swap join swap\\n dup 9 < not if [ 9 - dip [ $ \\\"IX\\\" join ] ]\\n dup 5 < not if [ 5 - dip [ $ \\\"V\\\" join ] ]\\n dup 4 < not if [ 4 - dip [ $ \\\"IV\\\" join ] ]\\n $ \\\"I\\\" swap of join ]\\n is ->roman ( n --> $ )\\n\\n 1990 dup echo say \\\" = \\\" ->roman echo$ cr\\n 2008 dup echo say \\\" = \\\" ->roman echo$ cr\\n 1666 dup echo say \\\" = \\\" ->roman echo$ cr\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"as.roman(1666) # MDCLXVI\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"as.roman(1666) + 334 # MM\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(define (encode/roman number)\\n (cond ((>= number 1000) (string-append \\\"M\\\" (encode/roman (- number 1000))))\\n ((>= number 900) (string-append \\\"CM\\\" (encode/roman (- number 900))))\\n ((>= number 500) (string-append \\\"D\\\" (encode/roman (- number 500))))\\n ((>= number 400) (string-append \\\"CD\\\" (encode/roman (- number 400))))\\n ((>= number 100) (string-append \\\"C\\\" (encode/roman (- number 100))))\\n ((>= number 90) (string-append \\\"XC\\\" (encode/roman (- number 90))))\\n ((>= number 50) (string-append \\\"L\\\" (encode/roman (- number 50))))\\n ((>= number 40) (string-append \\\"XL\\\" (encode/roman (- number 40))))\\n ((>= number 10) (string-append \\\"X\\\" (encode/roman (- number 10))))\\n ((>= number 9) (string-append \\\"IX\\\" (encode/roman (- number 9))))\\n ((>= number 5) (string-append \\\"V\\\" (encode/roman (- number 5))))\\n ((>= number 4) (string-append \\\"IV\\\" (encode/roman (- number 4))))\\n ((>= number 1) (string-append \\\"I\\\" (encode/roman (- number 1))))\\n (else \\\"\\\")))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#lang racket\\n(define (number->list n)\\n (for/fold ([result null])\\n ([decimal '(1000 900 500 400 100 90 50 40 10 9 5 4 1)]\\n [roman '(M CM D CD C XC L XL X IX V IV I)])\\n #:break (= n 0)\\n (let-values ([(q r) (quotient/remainder n decimal)])\\n (set! n r)\\n (append result (make-list q roman)))))\\n\\n(define (encode/roman number)\\n (string-join (map symbol->string (number->list number)) \\\"\\\"))\\n\\n(for ([n '(1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 25 30 40\\n 50 60 69 70 80 90 99 100 200 300 400 500 600 666 700 800 900\\n 1000 1009 1444 1666 1945 1997 1999 2000 2008 2010 2011 2500\\n 3000 3999)])\\n (printf \\\"~a ~a\\\\n\\\" n (encode/roman n)))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my %symbols =\\n 1 => \\\"I\\\", 5 => \\\"V\\\", 10 => \\\"X\\\", 50 => \\\"L\\\", 100 => \\\"C\\\",\\n 500 => \\\"D\\\", 1_000 => \\\"M\\\";\\n\\nmy @subtractors =\\n 1_000, 100, 500, 100, 100, 10, 50, 10, 10, 1, 5, 1, 1, 0;\\n\\nmulti sub roman (0) { '' }\\nmulti sub roman (Int $n) {\\n for @subtractors -> $cut, $minus {\\n $n >= $cut\\n and return %symbols{$cut} ~ roman($n - $cut);\\n $n >= $cut - $minus\\n and return %symbols{$minus} ~ roman($n + $minus);\\n }\\n}\\n\\n# Sample usage\\n\\nfor 1 .. 2_010 -> $x {\\n say roman($x);\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"Red []\\n\\ntable: [1000 M 900 CM 500 D 400 CD 100 C 90 XC 50 L 40 XL 10 X 9 IX 5 V 4 IV 1 I]\\n\\nto-Roman: function [n [integer!] return: [string!]][\\n out: copy \\\"\\\"\\n foreach [a r] table [while [n >= a][append out r n: n - a]]\\n out\\n]\\n\\nforeach number [40 33 1888 2016][print [number \\\":\\\" to-Roman number]]\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"Red []\\n\\ntable: [1000 M 900 CM 500 D 400 CD 100 C 90 XC 50 L 40 XL 10 X 9 IX 5 V 4 IV 1 I]\\n\\nto-Roman: func [n [integer!] return: [string!]][\\n case [\\n tail? table [table: head table copy \\\"\\\"]\\n table/1 > n [table: skip table 2 to-Roman n]\\n 'else [append copy form table/2 to-Roman n - table/1]\\n ]\\n]\\n\\nforeach number [40 33 1888 2016][print [number \\\":\\\" to-Roman number]]\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"Red []\\n\\nto-Roman: function [n [integer!]] reduce [\\n 'case collect [\\n foreach [a r] [1000 M 900 CM 500 D 400 CD 100 C 90 XC 50 L 40 XL 10 X 9 IX 5 V 4 IV 1 I][\\n keep compose/deep [n >= (a) [append copy (form r) any [to-Roman n - (a) copy \\\"\\\"]]]\\n ]\\t\\n ]\\n]\\n\\nforeach number [40 33 1888 2016][print [number \\\":\\\" to-Roman number]]\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \": vector ( ...n\\\"- )\\n here [ &, times ] dip : .data ` swap ` + ` @ ` do ` ; ;\\n: .I dup @ ^buffer'add ;\\n: .V dup 1 + @ ^buffer'add ;\\n: .X dup 2 + @ ^buffer'add ;\\n\\n[ .I .X drop ]\\n[ .V .I .I .I drop ]\\n[ .V .I .I drop ]\\n[ .V .I drop ]\\n[ .V drop ]\\n[ .I .V drop ]\\n[ .I .I .I drop ]\\n[ .I .I drop ]\\n[ .I drop ]\\n&drop\\n10 vector .digit\\n\\n: record ( an- )\\n 10 /mod dup [ [ over 2 + ] dip record ] &drop if .digit ;\\n: toRoman ( n-a )\\n here ^buffer'set\\n dup 1 3999 within 0 =\\n [ \\\"EX LIMITO!\\\\n\\\" ] [ \\\"IVXLCDM\\\" swap record here ] if ;\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"roman: procedure\\narg number\\n\\n/* handle only 1 to 3999, else return ? */\\nif number >= 4000 | number <= 0 then return \\\"?\\\"\\n\\nromans = \\\" M CM D CD C XC L XL X IX V IV I\\\"\\narabic = \\\"1000 900 500 400 100 90 50 40 10 9 5 4 1\\\"\\n\\nresult = \\\"\\\"\\ndo i = 1 to words(romans)\\n do while number >= word(arabic,i)\\n result = result || word(romans,i)\\n number = number - word(arabic,i)\\n end\\nend\\nreturn result\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program converts (Arabic) non─negative decimal integers (≥0) ───► Roman numerals.*/\\nnumeric digits 10000 /*decimal digs can be higher if wanted.*/\\nparse arg # /*obtain optional integers from the CL.*/\\n@er= \\\"argument isn't a non-negative integer: \\\" /*literal used when issuing error msg. */\\nif #='' then /*Nothing specified? Then generate #s.*/\\n do\\n do j= 0 by 11 to 111; #=# j; end\\n #=# 49; do k=88 by 100 to 1200; #=# k; end\\n #=# 1000 2000 3000 4000 5000 6000; do m=88 by 200 to 1200; #=# m; end\\n #=# 1304 1405 1506 1607 1708 1809 1910 2011; do p= 4 to 50; #=# 10**p; end\\n end /*finished with generation of numbers. */\\n\\n do i=1 for words(#); x=word(#, i) /*convert each of the numbers───►Roman.*/\\n if \\\\datatype(x, 'W') | x<0 then say \\\"***error***\\\" @er x /*¬ whole #? negative?*/\\n say right(x, 55) dec2rom(x)\\n end /*i*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ndec2rom: procedure; parse arg n,# /*obtain the number, assign # to a null*/\\n n=space(translate(n/1, , ','), 0) /*remove commas from normalized integer*/\\n nulla= 'ZEPHIRUM NULLAE NULLA NIHIL' /*Roman words for \\\"nothing\\\" or \\\"none\\\". */\\n if n==0 then return word(nulla, 1) /*return a Roman word for \\\"zero\\\". */\\n maxnp=(length(n)-1)%3 /*find max(+1) # of parenthesis to use.*/\\n highPos=(maxnp+1)*3 /*highest position of number. */\\n nn=reverse( right(n, highPos, 0) ) /*digits for Arabic──►Roman conversion.*/\\n do j=highPos to 1 by -3\\n _=substr(nn, j, 1); select /*════════════════════hundreds.*/\\n when _==9 then hx='CM'\\n when _>=5 then hx='D'copies(\\\"C\\\", _-5)\\n when _==4 then hx='CD'\\n otherwise hx= copies('C', _)\\n end /*select hundreds*/\\n _=substr(nn, j-1, 1); select /*════════════════════════tens.*/\\n when _==9 then tx='XC'\\n when _>=5 then tx='L'copies(\\\"X\\\", _-5)\\n when _==4 then tx='XL'\\n otherwise tx= copies('X', _)\\n end /*select tens*/\\n _=substr(nn, j-2, 1); select /*═══════════════════════units.*/\\n when _==9 then ux='IX'\\n when _>=5 then ux='V'copies(\\\"I\\\", _-5)\\n when _==4 then ux='IV'\\n otherwise ux= copies('I', _)\\n end /*select units*/\\n $=hx || tx || ux\\n if $\\\\=='' then #=# || copies(\\\"(\\\", (j-1)%3)$ ||copies(')', (j-1)%3)\\n end /*j*/\\n if pos('(I',#)\\\\==0 then do i=1 for 4 /*special case: M,MM,MMM,MMMM.*/\\n if i==4 then _ = '(IV)'\\n else _ = '('copies(\\\"I\\\", i)')'\\n if pos(_, #)\\\\==0 then #=changestr(_, #, copies('M', i))\\n end /*i*/\\n return #\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"arabic = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\\nroman = [\\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\" ,\\\"XC\\\", \\\"L\\\", \\\"XL\\\" ,\\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\", \\\"I\\\"]\\n\\nsee \\\"2009 = \\\" + toRoman(2009) + nl\\nsee \\\"1666 = \\\" + toRoman(1666) + nl\\nsee \\\"3888 = \\\" + toRoman(3888) + nl\\n\\nfunc toRoman val\\n result = \\\"\\\"\\n for i = 1 to 13\\n while val >= arabic[i]\\n result = result + roman[i]\\n val = val - arabic[i]\\n end\\n next\\n return result\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"Symbols = { 1=>'I', 5=>'V', 10=>'X', 50=>'L', 100=>'C', 500=>'D', 1000=>'M' }\\nSubtractors = [ [1000, 100], [500, 100], [100, 10], [50, 10], [10, 1], [5, 1], [1, 0] ]\\n\\ndef roman(num)\\n return Symbols[num] if Symbols.has_key?(num)\\n Subtractors.each do |cutPoint, subtractor|\\n return roman(cutPoint) + roman(num - cutPoint) if num > cutPoint\\n return roman(subtractor) + roman(num + subtractor) if num >= cutPoint - subtractor and num < cutPoint\\n end\\nend\\n\\n[1990, 2008, 1666].each do |i|\\n puts \\\"%4d => %s\\\" % [i, roman(i)]\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"Symbols = [ [1000, 'M'], [900, 'CM'], [500, 'D'], [400, 'CD'], [100, 'C'], [90, 'XC'], [50, 'L'], [40, 'XL'], [10, 'X'], [9, 'IX'], [5, 'V'], [4, 'IV'], [1, 'I'] ]\\n\\ndef arabic_to_roman(arabic)\\n return '' if arabic.zero?\\n Symbols.each { |arabic_rep, roman_rep| return roman_rep + arabic_to_roman(arabic - arabic_rep) if arabic >= arabic_rep }\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"Symbols = [ [1000, 'M'], [900, 'CM'], [500, 'D'], [400, 'CD'], [100, 'C'], [90, 'XC'], [50, 'L'], [40, 'XL'], [10, 'X'], [9, 'IX'], [5, 'V'], [4, 'IV'], [1, 'I'] ]\\n\\ndef to_roman(num)\\n Symbols.reduce \\\"\\\" do |memo, (divisor, letter)|\\n div, num = num.divmod(divisor)\\n memo + letter * div\\n end\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"[loop]\\ninput \\\"Input value:\\\";val$\\nprint roman$(val$)\\ngoto [loop]\\n\\n' ------------------------------\\n' Roman numerals\\n' ------------------------------\\nFUNCTION roman$(val$)\\na2r$ = \\\"M:1000,CM:900,D:500,CD:400,C:100,XC:90,L:50,XL:40,X:10,IX:9,V:5,IV:4,I:1\\\"\\nv = val(val$)\\nfor i = 1 to 13\\n r$ = word$(a2r$,i,\\\",\\\")\\n a = val(word$(r$,2,\\\":\\\"))\\n while v >= a\\n roman$ = roman$ + word$(r$,1,\\\":\\\")\\n v = v - a\\n wend\\nnext i\\nEND FUNCTION\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"struct RomanNumeral {\\n symbol: &'static str,\\n value: u32\\n}\\n\\nconst NUMERALS: [RomanNumeral; 13] = [\\n RomanNumeral {symbol: \\\"M\\\", value: 1000},\\n RomanNumeral {symbol: \\\"CM\\\", value: 900},\\n RomanNumeral {symbol: \\\"D\\\", value: 500},\\n RomanNumeral {symbol: \\\"CD\\\", value: 400},\\n RomanNumeral {symbol: \\\"C\\\", value: 100},\\n RomanNumeral {symbol: \\\"XC\\\", value: 90},\\n RomanNumeral {symbol: \\\"L\\\", value: 50},\\n RomanNumeral {symbol: \\\"XL\\\", value: 40},\\n RomanNumeral {symbol: \\\"X\\\", value: 10},\\n RomanNumeral {symbol: \\\"IX\\\", value: 9},\\n RomanNumeral {symbol: \\\"V\\\", value: 5},\\n RomanNumeral {symbol: \\\"IV\\\", value: 4},\\n RomanNumeral {symbol: \\\"I\\\", value: 1}\\n];\\n\\nfn to_roman(mut number: u32) -> String {\\n let mut min_numeral = String::new();\\n for numeral in NUMERALS.iter() {\\n while numeral.value <= number {\\n min_numeral = min_numeral + numeral.symbol;\\n number -= numeral.value;\\n }\\n }\\n min_numeral\\n}\\n\\nfn main() {\\n let nums = [2014, 1999, 25, 1666, 3888];\\n for &n in nums.iter() {\\n // 4 is minimum printing width, for alignment\\n println!(\\\"{:2$} = {}\\\", n, to_roman(n), 4);\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"val romanDigits = Map(\\n 1 -> \\\"I\\\", 5 -> \\\"V\\\",\\n 10 -> \\\"X\\\", 50 -> \\\"L\\\",\\n 100 -> \\\"C\\\", 500 -> \\\"D\\\",\\n 1000 -> \\\"M\\\",\\n 4 -> \\\"IV\\\", 9 -> \\\"IX\\\",\\n 40 -> \\\"XL\\\", 90 -> \\\"XC\\\",\\n 400 -> \\\"CD\\\", 900 -> \\\"CM\\\")\\nval romanDigitsKeys = romanDigits.keysIterator.toList sortBy (x => -x)\\ndef toRoman(n: Int): String = romanDigitsKeys find (_ >= n) match {\\n case Some(key) => romanDigits(key) + toRoman(n - key)\\n case None => \\\"\\\"\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"def toRoman( v:Int ) : String = {\\n val romanNumerals = List(1000->\\\"M\\\",900->\\\"CM\\\",500->\\\"D\\\",400->\\\"CD\\\",100->\\\"C\\\",90->\\\"XC\\\",\\n 50->\\\"L\\\",40->\\\"XL\\\",10->\\\"X\\\",9->\\\"IX\\\",5->\\\"V\\\",4->\\\"IV\\\",1->\\\"I\\\")\\t\\n\\n var n = v\\n romanNumerals.foldLeft(\\\"\\\"){(s,t) => {val c = n/t._1; n = n-t._1*c; s + (t._2 * c) } }\\n}\\n\\n// A small test\\ndef test( arabic:Int ) = println( arabic + \\\" => \\\" + toRoman( arabic ) )\\n\\ntest(1990)\\ntest(2008)\\ntest(1666)\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"def toRoman(num: Int): String = {\\n case class RomanUnit(value: Int, token: String)\\n val romanNumerals = List(\\n RomanUnit(1000, \\\"M\\\"),\\n RomanUnit(900, \\\"CM\\\"),\\n RomanUnit(500, \\\"D\\\"),\\n RomanUnit(400, \\\"CD\\\"),\\n RomanUnit(100, \\\"C\\\"),\\n RomanUnit(90, \\\"XC\\\"),\\n RomanUnit(50, \\\"L\\\"),\\n RomanUnit(40, \\\"XL\\\"),\\n RomanUnit(10, \\\"X\\\"),\\n RomanUnit(9, \\\"IX\\\"),\\n RomanUnit(5, \\\"V\\\"),\\n RomanUnit(4, \\\"IV\\\"),\\n RomanUnit(1, \\\"I\\\"))\\n\\n var remainingNumber = num\\n romanNumerals.foldLeft(\\\"\\\") { (outputStr, romanUnit) =>\\n {\\n val times = remainingNumber / romanUnit.value\\n remainingNumber -= romanUnit.value * times\\n outputStr + (romanUnit.token * times)\\n }\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (to-roman n)\\n (format \\\"~@r\\\" n))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"(define roman-decimal\\n '((\\\"M\\\" . 1000)\\n (\\\"CM\\\" . 900)\\n (\\\"D\\\" . 500)\\n (\\\"CD\\\" . 400)\\n (\\\"C\\\" . 100)\\n (\\\"XC\\\" . 90)\\n (\\\"L\\\" . 50)\\n (\\\"XL\\\" . 40)\\n (\\\"X\\\" . 10)\\n (\\\"IX\\\" . 9)\\n (\\\"V\\\" . 5)\\n (\\\"IV\\\" . 4)\\n (\\\"I\\\" . 1)))\\n\\n(define (to-roman value)\\n (apply string-append\\n (let loop ((v value)\\n (decode roman-decimal))\\n (let ((r (caar decode))\\n (d (cdar decode)))\\n (cond\\n ((= v 0) '())\\n ((>= v d) (cons r (loop (- v d) decode)))\\n (else (loop v (cdr decode))))))))\\n\\n\\n(let loop ((n '(1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 25 30 40\\n 50 60 69 70 80 90 99 100 200 300 400 500 600 666 700 800 900\\n 1000 1009 1444 1666 1945 1997 1999 2000 2008 2010 2011 2500\\n 3000 3999)))\\n (unless (null? n)\\n (printf \\\"~a ~a\\\\n\\\" (car n) (to-roman (car n)))\\n (loop (cdr n))))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"stdio.s7i\\\";\\n include \\\"wrinum.s7i\\\";\\n\\nconst proc: main is func\\n local\\n var integer: number is 0;\\n begin\\n for number range 1 to 3999 do\\n writeln(str(ROMAN, number));\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"function RomanNumeralsEncode number\\n\\tput [\\n\\t\\t(1, \\\"I\\\"),\\n\\t\\t(4, \\\"IV\\\"),\\n\\t\\t(5, \\\"V\\\"),\\n\\t\\t(9, \\\"IX\\\"),\\n\\t\\t(10, \\\"X\\\"),\\n\\t\\t(40, \\\"XL\\\"),\\n\\t\\t(50, \\\"L\\\"),\\n\\t\\t(90, \\\"XC\\\"),\\n\\t\\t(100, \\\"C\\\"),\\n\\t\\t(400, \\\"CD\\\"),\\n\\t\\t(500, \\\"D\\\"),\\n\\t\\t(900, \\\"CM\\\"),\\n\\t\\t(1000, \\\"M\\\")\\n\\t] into values\\n\\t\\n\\t\\n\\trepeat for index = each item of (the number of items in values)..1\\n\\t\\tput item index of values into pair\\n\\t\\trepeat while number is greater than or equal to the first item of pair\\n\\t\\t\\tput the second item of pair after numerals\\n\\t\\t\\tsubtract the first item of pair from number\\n\\t\\tend repeat\\n\\tend repeat\\n\\treturn numerals\\nend RomanNumeralsEncode\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"repeat for each item in [\\n\\t1990,\\n\\t2008,\\n\\t1666\\t\\n]\\n\\tput RomanNumeralsEncode(it)\\nend repeat\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"examples := [2008, 1666, 1990];\\n\\nfor example in examples loop\\n print( roman_numeral(example) );\\nend loop;\\n\\nproc roman_numeral( n );\\n R := [[1000, 'M'], [900, 'CM'], [500, 'D'], [400, 'CD'], [100, 'C'], [90, 'XC'], [50, 'L'], [40, 'XL'], [10, 'X'], [9, 'IX'], [5, 'V'], [4, 'IV'], [1, 'I']];\\n roman := '';\\n for numeral in R loop\\n while n >= numeral(1) loop\\n n := n - numeral(1);\\n roman := roman + numeral(2);\\n end loop;\\n end loop;\\n return roman;\\nend;\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"(define encodeGlyphs\\n ACC 0 _ -> ACC\\n ACC N [Glyph Value | Rest] -> (encodeGlyphs (@s ACC Glyph) (- N Value) [Glyph Value | Rest]) where (>= N Value)\\n ACC N [Glyph Value | Rest] -> (encodeGlyphs ACC N Rest)\\n)\\n\\n(define encodeRoman\\n N -> (encodeGlyphs \\\"\\\" N [\\\"M\\\" 1000 \\\"CM\\\" 900 \\\"D\\\" 500 \\\"CD\\\" 400 \\\"C\\\" 100 \\\"XC\\\" 90 \\\"L\\\" 50 \\\"XL\\\" 40 \\\"X\\\" 10 \\\"IX\\\" 9 \\\"V\\\" 5 \\\"IV\\\" 4 \\\"I\\\" 1])\\n)\\n\",\n \"language\": \"Shen\"\n },\n {\n \"code\": \"func arabic2roman(num, roman='') {\\n static lookup = [\\n :M:1000, :CM:900, :D:500,\\n :CD:400, :C:100, :XC:90,\\n :L:50, :XL:40, :X:10,\\n :IX:9, :V:5, :IV:4,\\n :I:1\\n ];\\n lookup.each { |pair|\\n while (num >= pair.second) {\\n roman += pair.first;\\n num -= pair.second;\\n }\\n }\\n return roman;\\n}\\nsay(\\\"1990 in roman is \\\" + arabic2roman(1990));\\nsay(\\\"2008 in roman is \\\" + arabic2roman(2008));\\nsay(\\\"1666 in roman is \\\" + arabic2roman(1666));\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"BEGIN\\n\\n TEXT PROCEDURE TOROMAN(N); INTEGER N;\\n BEGIN\\n PROCEDURE P(WEIGHT,LIT); INTEGER WEIGHT; TEXT LIT;\\n BEGIN\\n WHILE N >= WEIGHT DO\\n BEGIN\\n T :- T & LIT;\\n N := N - WEIGHT;\\n END WHILE;\\n END P;\\n TEXT T; T :- NOTEXT;\\n P( 1000, \\\"M\\\" );\\n P( 900, \\\"CM\\\" );\\n P( 500, \\\"D\\\" );\\n P( 400, \\\"CD\\\" );\\n P( 100, \\\"C\\\" );\\n P( 90, \\\"XC\\\" );\\n P( 50, \\\"L\\\" );\\n P( 40, \\\"XL\\\" );\\n P( 10, \\\"X\\\" );\\n P( 9, \\\"IX\\\" );\\n P( 5, \\\"V\\\" );\\n P( 4, \\\"IV\\\" );\\n P( 1, \\\"I\\\" );\\n TOROMAN :- T;\\n END TOROMAN;\\n\\n INTEGER Y;\\n FOR Y := 1990, 2008, 1666 DO\\n BEGIN\\n OUTTEXT(\\\"YEAR \\\");\\n OUTINT(Y, 4);\\n OUTTEXT(\\\" => \\\");\\n OUTTEXT(TOROMAN(Y));\\n OUTIMAGE;\\n END FOR;\\n\\nEND PROGRAM;\\n\",\n \"language\": \"Simula\"\n },\n {\n \"code\": \"2013 printRomanOn:Stdout naive:false\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"printRomanOn:aStream naive:naive\\n \\\"print the receiver as roman number to the argument, aStream.\\n The naive argument controls if the conversion is\\n correct (i.e. subtracting prefix notation for 4,9,40,90, etc.),\\n or naive (i.e. print 4 as IIII and 9 as VIIII); also called simple.\\n The naive version is often used for page numbers in documents.\\\"\\n\\n |restValue spec|\\n\\n restValue := self.\\n restValue > 0 ifFalse:[self error:'negative roman'].\\n\\n naive ifTrue:[\\n spec := #(\\n \\\" value string repeat \\\"\\n 1000 'M' true\\n 500 'D' false\\n 100 'C' true\\n 50 'L' false\\n 10 'X' true\\n 5 'V' false\\n 1 'I' true\\n ).\\n ] ifFalse:[\\n spec := #(\\n \\\" value string repeat \\\"\\n 1000 'M' true\\n 900 'CM' false\\n 500 'D' false\\n 400 'CD' false\\n 100 'C' true\\n 90 'XC' false\\n 50 'L' false\\n 40 'XL' false\\n 10 'X' true\\n 9 'IX' false\\n 5 'V' false\\n 4 'IV' false\\n 1 'I' true\\n ).\\n ].\\n\\n spec\\n inGroupsOf:3\\n do:[:rValue :rString :repeatFlag |\\n\\n [\\n (restValue >= rValue) ifTrue:[\\n aStream nextPutAll:rString.\\n restValue := restValue - rValue.\\n ].\\n ] doWhile:[ repeatFlag and:[ restValue >= rValue] ].\\n ].\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"* ROMAN(N) - Convert integer N to Roman numeral form.\\n*\\n* N must be positive and less than 4000.\\n*\\n* An asterisk appears in the result if N >= 4000.\\n*\\n* The function fails if N is not an integer.\\n\\n\\tDEFINE('ROMAN(N)UNITS') :(ROMAN_END)\\n\\n* Get rightmost digit to UNITS and remove it from N.\\n* Return null result if argument is null.\\nROMAN\\tN RPOS(1) LEN(1) . UNITS = :F(RETURN)\\n\\n* Search for digit, replace with its Roman form.\\n* Return failing if not a digit.\\n\\t'0,1I,2II,3III,4IV,5V,6VI,7VII,8VIII,9IX,' UNITS\\n+\\tBREAK(',') . UNITS :F(FRETURN)\\n\\n* Convert rest of N and multiply by 10. Propagate a\\n* failure return from recursive call back to caller.\\n\\tROMAN = REPLACE(ROMAN(N), 'IVXLCDM', 'XLCDM**')\\n+\\tUNITS :S(RETURN) F(FRETURN)\\nROMAN_END\\n\\n*\\tTesting\\n\\tOUTPUT = \\\"1999 = \\\" ROMAN(1999)\\n\\tOUTPUT = \\\" 24 = \\\" ROMAN(24)\\n\\tOUTPUT = \\\" 944 = \\\" ROMAN(944)\\n\\nEND\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"* # Arabic to Roman\\n define('roman(n)s,ch,val,str') :(roman_end)\\nroman roman = ge(n,4000) n :s(return)\\n s = 'M1000 CM900 D500 CD400 C100 XC90 L50 XL40 X10 IX9 V5 IV4 I1 '\\nrom1 s span(&ucase) . ch break(' ') . val span(' ') = :f(rom2)\\n str = str dupl(ch,(n / val))\\n n = remdr(n,val) :(rom1)\\nrom2 roman = str :(return)\\nroman_end\\n\\n* # Roman to Arabic\\n define('arabic(n)s,ch,val,sum,x') :(arabic_end)\\narabic s = 'M1000 D500 C100 L50 X10 V5 I1 '\\n n = reverse(n)\\narab1 n len(1) . ch = :f(arab2)\\n s ch break(' ') . val\\n val = lt(val,x) (-1 * val)\\n sum = sum + val; x = val :(arab1)\\narab2 arabic = sum :(return)\\narabic_end\\n\\n* # Test and display\\n tstr = '2010 1999 1492 1066 476 '\\ntloop tstr break(' ') . year span(' ') = :f(out)\\n r = roman(year)\\n rstr = rstr year '=' r ' '\\n astr = astr r '=' arabic(r) ' ' :(tloop)\\nout output = rstr; output = astr\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"a2r(a)=\\n r = \\\"\\\"\\n n = [[\\\"M\\\",\\\"CM\\\",\\\"D\\\",\\\"CD\\\",\\\"C\\\",\\\"XC\\\",\\\"L\\\",\\\"XL\\\",\\\"X\\\",\\\"IX\\\",\\\"V\\\",\\\"IV\\\",\\\"I\\\"],[1000,900,500,400,100,90,50,40,10,9,5,4,1]]\\n > i, 1..13\\n > a!<n[i,2]\\n r += n[i,1]\\n a -= n[i,2]\\n <\\n <\\n <= r\\n.\\n\\nt = [1990,2008,1666]\\n> i, 1..#.size(t,1)\\n #.output(t[i],\\\" = \\\",a2r(t[i]))\\n<\\n\",\n \"language\": \"SPL\"\n },\n {\n \"code\": \"--\\n-- This only works under Oracle and has the limitation of 1 to 3999\\n\\n\\nSQL> select to_char(1666, 'RN') urcoman, to_char(1666, 'rn') lcroman from dual;\\n\\nURCOMAN LCROMAN\\n--------------- ---------------\\n MDCLXVI mdclxvi\\n\",\n \"language\": \"SQL\"\n },\n {\n \"code\": \"func ator(var n: Int) -> String {\\n\\n var result = \\\"\\\"\\n\\n for (value, letter) in\\n [( 1000, \\\"M\\\"),\\n ( 900, \\\"CM\\\"),\\n ( 500, \\\"D\\\"),\\n ( 400, \\\"CD\\\"),\\n ( 100, \\\"C\\\"),\\n ( 90, \\\"XC\\\"),\\n ( 50, \\\"L\\\"),\\n ( 40, \\\"XL\\\"),\\n ( 10, \\\"X\\\"),\\n ( 9, \\\"IX\\\"),\\n ( 5, \\\"V\\\"),\\n ( 4, \\\"IV\\\"),\\n ( 1, \\\"I\\\")]\\n {\\n while n >= value {\\n result += letter\\n n -= value\\n }\\n }\\n return result\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"println(ator(1666)) // MDCLXVI\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"print(ator(1666)) // MDCLXVI\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"def digits: [(M:1000\\\"1\\\"), (CM:900\\\"1\\\"), (D:500\\\"1\\\"), (CD:400\\\"1\\\"), (C:100\\\"1\\\"), (XC:90\\\"1\\\"), (L:50\\\"1\\\"), (XL:40\\\"1\\\"), (X:10\\\"1\\\"), (IX:9\\\"1\\\"), (V:5\\\"1\\\"), (IV:4\\\"1\\\"), (I:1\\\"1\\\")];\\ntemplates encodeRoman\\n @: 1;\\n '$ -> ($)\\\"1\\\" -> #;' !\\n when <$digits($@)::value..> do\\n $digits($@)::key !\\n $ - $digits($@)::value -> #\\n when <1\\\"1\\\"..> do\\n @:$@ + 1;\\n $ -> #\\nend encodeRoman\\n\\n1990 -> encodeRoman -> !OUT::write\\n'\\n' -> !OUT::write\\n2008 -> encodeRoman -> !OUT::write\\n'\\n' -> !OUT::write\\n1666 -> encodeRoman -> !OUT::write\\n\",\n \"language\": \"Tailspin\"\n },\n {\n \"code\": \"proc to_roman {i} {\\n set map {1000 M 900 CM 500 D 400 CD 100 C 90 XC 50 L 40 XL 10 X 9 IX 5 V 4 IV 1 I}\\n foreach {value roman} $map {\\n while {$i >= $value} {\\n append res $roman\\n incr i -$value\\n }\\n }\\n return $res\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"PROGRAM:DEC2ROM\\n:\\\"=\\\"→Str1\\n:Lbl ST\\n:ClrHome\\n:Disp \\\"NUMBER TO\\\"\\n:Disp \\\"CONVERT:\\\"\\n:Input A\\n:If fPart(A) or A≠abs(A)\\n:Then\\n:Goto PI\\n:End\\n:A→B\\n:While B≥1000\\n:Str1+\\\"M\\\"→Str1\\n:B-1000→B\\n:End\\n:If B≥900\\n:Then\\n:Str1+\\\"CM\\\"→Str1\\n:B-900→B\\n:End\\n:If B≥500\\n:Then\\n:Str1+\\\"D\\\"→Str1\\n:B-500→B\\n:End\\n:If B≥400\\n:Then\\n:Str1+\\\"CD\\\"?Str1\\n:B-400→B\\n:End\\n:While B≥100\\n:Str1+\\\"C\\\"→Str1\\n:B-100→B\\n:End\\n:If B≥90\\n:Then\\n:Str1+\\\"XC\\\"→Str1\\n:B-90→B\\n:End\\n:If B≥50\\n:Then\\n:Str1+\\\"L\\\"→Str1\\n:B-50→B\\n:End\\n:If B≥40\\n:Then\\n:Str1+\\\"XL\\\"→Str1\\n:B-40→B\\n:End\\n:While B≥10\\n:Str1+\\\"X\\\"→Str1\\n:B-10→B\\n:End\\n:If B≥9\\n:Then\\n:Str1+\\\"IX\\\"→Str1\\n:B-9→B\\n:End\\n:If B≥5\\n:Then\\n:Str1+\\\"V\\\"→Str1\\n:B-5→B\\n:End\\n:If B≥4\\n:Then\\n:Str1+\\\"IV\\\"→Str1\\n:B-4→B\\n:End\\n:While B>0\\n:Str1+\\\"I\\\"→Str1\\n:B-1→B\\n:End\\n:ClrHome\\n:Disp A\\n:Disp Str1\\n:Stop\\n:Lbl PI\\n:ClrHome\\n:Disp \\\"THE NUMBER MUST\\\"\\n:Disp \\\"BE A POSITIVE\\\"\\n:Disp \\\"INTEGER.\\\"\\n:Pause\\n:Goto ST\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"OPTION BASE 0\\nDIM arabic(12), roman$(12)\\n\\nFOR i = 0 to 12\\n READ arabic(i), roman$(i)\\nNEXT i\\n\\nDATA 1000, \\\"M\\\", 900, \\\"CM\\\", 500, \\\"D\\\", 400, \\\"CD\\\", 100, \\\"C\\\", 90, \\\"XC\\\"\\nDATA 50, \\\"L\\\", 40, \\\"XL\\\", 10, \\\"X\\\", 9, \\\"IX\\\", 5, \\\"V\\\", 4, \\\"IV\\\", 1, \\\"I\\\"\\n\\nFUNCTION toRoman$(value)\\n LET result$ = \\\"\\\"\\n FOR i = 0 TO 12\\n DO WHILE value >= arabic(i)\\n LET result$ = result$ & roman$(i)\\n LET value = value - arabic(i)\\n LOOP\\n NEXT i\\n LET toRoman$ = result$\\nEND FUNCTION\\n\\n!Testing\\nPRINT \\\"2009 = \\\"; toRoman$(2009)\\nPRINT \\\"1666 = \\\"; toRoman$(1666)\\nPRINT \\\"3888 = \\\"; toRoman$(3888)\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nLOOP arab_number=\\\"1990'2008'1666\\\"\\nroman_number = ENCODE (arab_number,ROMAN)\\nPRINT \\\"Arabic number \\\",arab_number, \\\" equals \\\", roman_number\\nENDLOOP\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"// Roman numerals/Encode\\n\\nconst weightsSymbols: [number, string][] =\\n [[1000, 'M'], [900, 'CM'], [500, 'D'], [400, 'CD'], [100, 'C'], [90, 'XC'],\\n [50, 'L'], [40, 'XL'], [10, 'X'], [9, 'IX'], [5, 'V'], [4, 'IV'], [1, 'I']];\\n// 3888 or MMMDCCCLXXXVIII (15 chars) is the longest string properly encoded\\n// with these symbols.\\n\\nfunction toRoman(n: number): string {\\n var roman = \\\"\\\"; // Result\\n for (i = 0; i <= 12 && n > 0; i++) {\\n var w = weightsSymbols[i][0];\\n while (n >= w) {\\n roman += weightsSymbols[i][1];\\n n -= w;\\n }\\n }\\n return roman;\\n}\\n\\nconsole.log(toRoman(1990)); // MCMXC\\nconsole.log(toRoman(2022)); // MMXXII\\nconsole.log(toRoman(3888)); // MMMDCCCLXXXVIII\\n\",\n \"language\": \"TypeScript\"\n },\n {\n \"code\": \"roman() {\\n local values=( 1000 900 500 400 100 90 50 40 10 9 5 4 1 )\\n local roman=(\\n [1000]=M [900]=CM [500]=D [400]=CD\\n [100]=C [90]=XC [50]=L [40]=XL\\n [10]=X [9]=IX [5]=V [4]=IV\\n [1]=I\\n )\\n local nvmber=\\\"\\\"\\n local num=$1\\n for value in ${values[@]}; do\\n while (( num >= value )); do\\n nvmber+=${roman[value]}\\n ((num -= value))\\n done\\n done\\n echo $nvmber\\n}\\n\\nfor test in 1999 24 944 1666 2008; do\\n printf \\\"%d = %s\\\\n\\\" $test $(roman $test)\\ndone\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#import nat\\n\\nroman =\\n\\n-+\\n 'IIII'%='IV'+ 'VIIII'%='IX'+ 'XXXX'%='XL'+ 'LXXXX'%='XC'+ 'CCCC'%='CD'+ 'DCCCC'%='CM',\\n ~&plrDlSPSL/'MDCLXVI'+ iota*+ +^|(^|C/~&,\\\\/division)@rlX=>~&iNC <1000,500,100,50,10,5>+-\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"#show+\\n\\ntest = roman* <1990,2008,1,2,64,124,1666,10001>\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"const numerals = {1000:\\\"M\\\", 900:\\\"CM\\\", 500:\\\"D\\\", 400:\\\"CD\\\", 100:\\\"C\\\",\\n 90:\\\"XC\\\", 50:\\\"L\\\", 40: \\\"XL\\\", 10:\\\"X\\\", 9:\\\"IX\\\", 5:\\\"V\\\", 4:\\\"IV\\\", 1:\\\"I\\\"}\\n\\nfn main() {\\n println(encode(1990))\\n println(encode(2008))\\n println(encode(1666))\\n}\\n\\nfn encode(number int) string {\\n mut num := number\\n mut result := \\\"\\\"\\n if number < 1 || number > 5000 {return result}\\n for digit, roman in numerals {\\n for num >= digit {\\n num -= digit\\n result += roman\\n }\\n }\\n return result\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"string to_roman(int n)\\n requires (n > 0 && n < 5000)\\n{\\n const int[] weights = {1000, 900, 500, 400, 100, 90,\\n 50, 40, 10, 9, 5, 4, 1};\\n const string[] symbols = {\\\"M\\\",\\\"CM\\\",\\\"D\\\",\\\"CD\\\",\\\"C\\\",\\\"XC\\\",\\\"L\\\",\\n \\\"XL\\\",\\\"X\\\",\\\"IX\\\",\\\"V\\\",\\\"IV\\\",\\\"I\\\"};\\n\\n var roman = \\\"\\\", count = 0;\\n foreach (var w in weights) {\\n while (n >= w) {\\n roman += symbols[count];\\n n -= w;\\n }\\n if (n == 0)\\n break;\\n count++;\\n }\\n return roman;\\n}\\n\\nvoid main() {\\n print(\\\"%s\\\\n\\\", to_roman(455));\\n print(\\\"%s\\\\n\\\", to_roman(3456));\\n print(\\\"%s\\\\n\\\", to_roman(2488));\\n}\\n\",\n \"language\": \"Vala\"\n },\n {\n \"code\": \"Private Function roman(n As Integer) As String\\n roman = WorksheetFunction.roman(n)\\nEnd Function\\nPublic Sub main()\\n s = [{10, 2016, 800, 2769, 1666, 476, 1453}]\\n For Each x In s\\n Debug.Print roman(CInt(x)); \\\" \\\";\\n Next x\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"// Main program for testing the function\\n//\\ndo {\\n #1 = Get_Num(\\\"Number to convert: \\\", STATLINE)\\n Call(\\\"NUM_TO_ROMAN\\\")\\n Num_Type(#1, NOCR) Message(\\\" = \\\") Reg_Type(1) Type_Newline\\n} while (Reg_Size(1))\\nReturn\\n\\n// Convert numeric value into Roman number\\n// #1 = number to convert; on return: T-reg(1) = Roman number\\n//\\n:NUM_TO_ROMAN:\\n Reg_Empty(1) // @1 = Results (Roman number)\\n if (#1 < 1) { Return } // non-positive numbers return empty string\\n\\n Buf_Switch(Buf_Free)\\n Ins_Text(\\\"M1000,CM900,D500,CD400,C100,XC90,L50,XL40,X10,IX9,V5,IV4,I1\\\")\\n\\n BOF\\n #2 = #1\\n Repeat(ALL) {\\n Search(\\\"|A|[|A]\\\", ADVANCE+ERRBREAK) // get next item from conversion list\\n Reg_Copy_Block(20, CP-Chars_Matched, CP) // @20 = Letter(s) to be inserted\\n #11 = Num_Eval() // #11 = magnitude (1000...1)\\n while (#2 >= #11) {\\n Reg_Set(1, @20, APPEND)\\n #2 -= #11\\n }\\n }\\n Buf_Quit(OK)\\nReturn\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"Function toRoman(value) As String\\n Dim arabic As Variant\\n Dim roman As Variant\\n\\n arabic = Array(1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1)\\n roman = Array(\\\"M\\\", \\\"CM\\\", \\\"D\\\", \\\"CD\\\", \\\"C\\\", \\\"XC\\\", \\\"L\\\", \\\"XL\\\", \\\"X\\\", \\\"IX\\\", \\\"V\\\", \\\"IV\\\", \\\"I\\\")\\n\\n Dim i As Integer, result As String\\n\\n For i = 0 To 12\\n Do While value >= arabic(i)\\n result = result + roman(i)\\n value = value - arabic(i)\\n Loop\\n Next i\\n\\n toRoman = result\\nEnd Function\\n\\nSub Main()\\n MsgBox toRoman(Val(InputBox(\\\"Number, please\\\")))\\nEnd Sub\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"var romans = [\\n [1000, \\\"M\\\"],\\n [900, \\\"CM\\\"],\\n [500, \\\"D\\\"],\\n [400, \\\"CD\\\"],\\n [100, \\\"C\\\"],\\n [90, \\\"XC\\\"],\\n [50, \\\"L\\\"],\\n [40, \\\"XL\\\"],\\n [10, \\\"X\\\"],\\n [9, \\\"IX\\\"],\\n [5, \\\"V\\\"],\\n [4, \\\"IV\\\"],\\n [1, \\\"I\\\"]\\n]\\n\\nvar encode = Fn.new { |n|\\n if (n > 5000 || n < 1) return null\\n var res = \\\"\\\"\\n for (r in romans) {\\n while (n >= r[0]) {\\n n = n - r[0]\\n res = res + r[1]\\n }\\n }\\n return res\\n}\\n\\nSystem.print(encode.call(1990))\\nSystem.print(encode.call(1666))\\nSystem.print(encode.call(2008))\\nSystem.print(encode.call(2020))\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"PROGRAM \\\"romanenc\\\"\\nVERSION \\\"0.0000\\\"\\n\\nDECLARE FUNCTION Entry()\\nINTERNAL FUNCTION ToRoman$(aValue%%)\\n\\n' 3888 or MMMDCCCLXXXVIII (15 chars) is the longest string properly encoded with these symbols.\\n\\nFUNCTION Entry()\\n PRINT ToRoman$(1990) ' MCMXC\\n PRINT ToRoman$(2018) ' MMXVIII\\n PRINT ToRoman$(3888) ' MMMDCCCLXXXVIII\\nEND FUNCTION\\n\\nFUNCTION ToRoman$(aValue%%)\\n DIM weights%%[12]\\n DIM symbols$[12]\\n\\n weights%%[0] = 1000\\n weights%%[1] = 900\\n weights%%[2] = 500\\n weights%%[3] = 400\\n weights%%[4] = 100\\n weights%%[5] = 90\\n weights%%[6] = 50\\n weights%%[7] = 40\\n weights%%[8] = 10\\n weights%%[9] = 9\\n weights%%[10] = 5\\n weights%%[11] = 4\\n weights%%[12] = 1\\n\\n symbols$[0] = \\\"M\\\"\\n symbols$[1] = \\\"CM\\\"\\n symbols$[2] = \\\"D\\\"\\n symbols$[3] = \\\"CD\\\"\\n symbols$[4] = \\\"C\\\"\\n symbols$[5] = \\\"XC\\\"\\n symbols$[6] = \\\"L\\\"\\n symbols$[7] = \\\"XL\\\"\\n symbols$[8] = \\\"X\\\"\\n symbols$[9] = \\\"IX\\\"\\n symbols$[10] = \\\"V\\\"\\n symbols$[11] = \\\"IV\\\"\\n symbols$[12] = \\\"I\\\"\\n\\n destination$ = \\\"\\\"\\n i@@ = 0\\n DO WHILE (i@@ <= 12) AND (aValue%% > 0)\\n DO WHILE aValue%% >= weights%%[i@@]\\n destination$ = destination$ + symbols$[i@@]\\n aValue%% = aValue%% - weights%%[i@@]\\n LOOP\\n i@@ = i@@ + 1\\n LOOP\\n RETURN destination$\\nEND FUNCTION\\nEND PROGRAM\\n\",\n \"language\": \"XBasic\"\n },\n {\n \"code\": \"(defun roman (n)\\n (define roman-numerals '((1000 \\\"m\\\") (900 \\\"cm\\\") (500 \\\"d\\\") (400 \\\"cd\\\") (100 \\\"c\\\") (90 \\\"xc\\\") (50 \\\"l\\\") (40 \\\"xl\\\") (10 \\\"x\\\") (9 \\\"ix\\\") (5 \\\"v\\\") (4 \\\"iv\\\") (1 \\\"i\\\")))\\n (defun romanize (arabic-numeral numerals roman-numeral)\\n (if (= arabic-numeral 0)\\n roman-numeral\\n (if (>= arabic-numeral (caar numerals))\\n (romanize (- arabic-numeral (caar numerals)) numerals (string-append roman-numeral (cadar numerals)))\\n (romanize arabic-numeral (cdr numerals) roman-numeral))))\\n (romanize n roman-numerals \\\"\\\"))\\n\\n; test the function:\\n(display (mapcar roman '(10 2016 800 2769 1666 476 1453)))\\n\",\n \"language\": \"XLISP\"\n },\n {\n \"code\": \"proc Rom(N, A, B, C); \\\\Display 1..9 in Roman numerals\\nint N, A, B, C, I;\\n[case N of\\n9: [ChOut(0, C); ChOut(0, A)]; \\\\XI\\n8,7,6,5:[ChOut(0, B); for I:= 1 to rem(N/5) do ChOut(0, C)]; \\\\V\\n4: [ChOut(0, C); ChOut(0, B)] \\\\IV\\nother for I:= 1 to N do ChOut(0, C); \\\\I\\n];\\n\\nproc Roman(N); \\\\Display N in Roman numerals\\nint N, Q;\\n[Q:= N/1000; N:= rem(0); \\\\0..3999\\nRom(Q, ^?, ^?, ^M);\\nQ:= N/100; N:= rem(0); \\\\0..999\\nRom(Q, ^M, ^D, ^C);\\nQ:= N/10; N:= rem(0); \\\\0..99\\nRom(Q, ^C, ^L, ^X);\\nRom(N, ^X, ^V, ^I); \\\\0..9\\n];\\n\\nint Tbl, I;\\n[Tbl:= [1990, 2008, 1666, 0, 1, 3999, 2020, 1234];\\nfor I:= 0 to 7 do\\n [IntOut(0, Tbl(I)); Text(0, \\\". \\\"); Roman(Tbl(I)); CrLf(0)];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"<xsl:stylesheet version=\\\"1.0\\\" xmlns:xsl=\\\"http://www.w3.org/1999/XSL/Transform\\\">\\n <xsl:template match=\\\"/data/number\\\">\\n <xsl:call-template name=\\\"for\\\">\\n <xsl:with-param name=\\\"stop\\\">13</xsl:with-param>\\n \\t<xsl:with-param name=\\\"value\\\"><xsl:value-of select=\\\"@value\\\"></xsl:value-of></xsl:with-param>\\n </xsl:call-template>\\n </xsl:template>\\n\\n <xsl:template name=\\\"for\\\">\\n <xsl:param name=\\\"start\\\">1</xsl:param>\\n <xsl:param name=\\\"stop\\\">1</xsl:param>\\n <xsl:param name=\\\"step\\\">1</xsl:param>\\n <xsl:param name=\\\"value\\\">1</xsl:param>\\n <xsl:text/>\\n <xsl:choose>\\n <xsl:when test=\\\"($value > /data/roman\\n/numeral[@pos=$start]/@value or $value = /data/roman\\n/numeral[@pos=$start]/@value) \\\">\\n <xsl:value-of select=\\\"/data/roman\\n/numeral[@pos=$start]/@letter\\\"/>\\n <xsl:call-template name=\\\"for\\\">\\n <xsl:with-param name=\\\"stop\\\">\\n <xsl:value-of select=\\\"$stop\\\"/>\\n </xsl:with-param>\\n <xsl:with-param name=\\\"start\\\">\\n <xsl:value-of select=\\\"$start\\\"/>\\n </xsl:with-param>\\n <xsl:with-param name=\\\"value\\\">\\n \\t<xsl:value-of select=\\\"$value - /data/roman/numeral[@pos=$start]/@value\\\"/>\\n </xsl:with-param>\\n </xsl:call-template>\\n </xsl:when>\\n <xsl:otherwise>\\n <xsl:if test=\\\"$start < $stop\\\">\\n <xsl:call-template name=\\\"for\\\">\\n <xsl:with-param name=\\\"stop\\\">\\n <xsl:value-of select=\\\"$stop\\\"/>\\n </xsl:with-param>\\n <xsl:with-param name=\\\"start\\\">\\n <xsl:value-of select=\\\"$start + $step\\\"/>\\n </xsl:with-param>\\n <xsl:with-param name=\\\"value\\\">\\n \\t<xsl:value-of select=\\\"$value\\\"/>\\n </xsl:with-param>\\n </xsl:call-template>\\n </xsl:if>\\n </xsl:otherwise>\\n </xsl:choose>\\n </xsl:template>\\n</xsl:stylesheet>\\n\",\n \"language\": \"XSLT\"\n },\n {\n \"code\": \"roman$ = \\\"M, CM, D, CD, C, XC, L, XL, X, IX, V, IV, I\\\"\\ndecml$ = \\\"1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1\\\"\\n\\nsub toRoman$(value)\\n local res$, i, roman$(1), decml$(1), long\\n\\t\\n long = token(roman$, roman$(), \\\", \\\")\\n long = token(decml$, decml$(), \\\", \\\")\\n\\t\\n for i=1 to long\\n while(value >= val(decml$(i)))\\n res$ = res$ + roman$(i)\\n value = value - val(decml$(i))\\n wend\\n next i\\n return res$\\nend sub\\n\\nprint 400, \\\" \\\", toRoman$(400)\\nprint 1990, \\\" \\\", toRoman$(1990)\\nprint 2008, \\\" \\\", toRoman$(2008)\\nprint 2009, \\\" \\\", toRoman$(2009)\\nprint 1666, \\\" \\\", toRoman$(1666)\\nprint 3888, \\\" \\\", toRoman$(3888)\\n//Output:\\n// 400 = CD\\n// 1990 = MCMXC\\n// 2008 = MMVIII\\n// 2009 = MMIX\\n// 1666 = MDCLXVI\\n// 3888 = MMMDCCCLXXXVIII\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"var [const] romans = L(\\n L(\\\"M\\\", 1000), L(\\\"CM\\\", 900), L(\\\"D\\\", 500), L(\\\"CD\\\", 400), L(\\\"C\\\", 100),\\n L(\\\"XC\\\", 90), L(\\\"L\\\", 50), L(\\\"XL\\\", 40), L(\\\"X\\\", 10), L(\\\"IX\\\", 9),\\n L(\\\"V\\\", 5), L(\\\"IV\\\", 4), L(\\\"I\\\", 1));\\nfcn toRoman(i){\\t\\t// convert int to a roman number\\n reg text = \\\"\\\";\\n foreach R,N in (romans){ text += R*(i/N); i = i%N; }\\n return(text);\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"program: decimal_roman\\n input: 12\\n output: 'XII'\\n\",\n \"language\": \"Zoea\"\n },\n {\n \"code\": \" 10 DATA 1000,\\\"M\\\",900,\\\"CM\\\"\\n 20 DATA 500,\\\"D\\\",400,\\\"CD\\\"\\n 30 DATA 100,\\\"C\\\",90,\\\"XC\\\"\\n 40 DATA 50,\\\"L\\\",40,\\\"XL\\\"\\n 50 DATA 10,\\\"X\\\",9,\\\"IX\\\"\\n 60 DATA 5,\\\"V\\\",4,\\\"IV\\\",1,\\\"I\\\"\\n 70 INPUT \\\"Enter an arabic number: \\\";V\\n 80 LET VALUE=V\\n 90 LET V$=\\\"\\\"\\n100 FOR I=0 TO 12\\n110 READ A,R$\\n120 IF V<A THEN GO TO 160\\n130 LET V$=V$+R$\\n140 LET V=V-A\\n150 GO TO 120\\n160 NEXT I\\n170 PRINT VALUE;\\\"=\\\";V$\\n\",\n \"language\": \"ZX-Spectrum-Basic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Roman-numerals-Encode"}}},{"rowIdx":1589,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Roots_of_a_quadratic_function\nnote: Arithmetic operations\n","language":"00-META"},{"code":"Write a program to find the roots of a quadratic equation, i.e., solve the equation <math>ax^2 + bx + c = 0</math>. \nYour program must correctly handle non-real roots, but it need not check that <math>a \\neq 0</math>.\n\nThe problem of solving a quadratic equation is a good example of how dangerous it can be to ignore the peculiarities of floating-point arithmetic. \nThe obvious way to implement the quadratic formula suffers catastrophic loss of accuracy when one of the roots to be found is much closer to 0 than the other. \nIn their classic textbook on numeric methods ''[http://www.pdas.com/fmm.htm Computer Methods for Mathematical Computations]'', George Forsythe, Michael Malcolm, and Cleve Moler suggest trying the naive algorithm with <math>a = 1</math>, <math>b = -10^5</math>, and <math>c = 1</math>. \n(For double-precision floats, set <math>b = -10^9</math>.) \nConsider the following implementation in [[Ada]]:\n<syntaxhighlight lang=\"ada\">with Ada.Text_IO; use Ada.Text_IO;\nwith Ada.Numerics.Elementary_Functions; use Ada.Numerics.Elementary_Functions;\n\nprocedure Quadratic_Equation is\n type Roots is array (1..2) of Float;\n function Solve (A, B, C : Float) return Roots is\n SD : constant Float := sqrt (B**2 - 4.0 * A * C);\n AA : constant Float := 2.0 * A;\n begin\n return ((- B + SD) / AA, (- B - SD) / AA);\n end Solve;\n\n R : constant Roots := Solve (1.0, -10.0E5, 1.0);\nbegin\n Put_Line (\"X1 =\" & Float'Image (R (1)) & \" X2 =\" & Float'Image (R (2)));\nend Quadratic_Equation;</syntaxhighlight>\n{{out}}\n<pre>X1 = 1.00000E+06 X2 = 0.00000E+00</pre>\nAs we can see, the second root has lost all significant figures. The right answer is that <code>X2</code> is about <math>10^{-6}</math>. The naive method is numerically unstable.\n\nSuggested by Middlebrook (D-OA), a better numerical method: to define two parameters <math> q = \\sqrt{a c} / b </math> and <math> f = 1/2 + \\sqrt{1 - 4 q^2} /2 </math>\n\nand the two roots of the quardratic are: <math> \\frac{-b}{a} f </math> and <math> \\frac{-c}{b f} </math>\n\n\n'''Task''': do it better. This means that given <math>a = 1</math>, <math>b = -10^9</math>, and <math>c = 1</math>, both of the roots your program returns should be greater than <math>10^{-11}</math>. Or, if your language can't do floating-point arithmetic any more precisely than single precision, your program should be able to handle <math>b = -10^6</math>. Either way, show what your program gives as the roots of the quadratic in question. See page 9 of \n[https://www.validlab.com/goldberg/paper.pdf \"What Every Scientist Should Know About Floating-Point Arithmetic\"] for a possible algorithm.\n\n","language":"00-TASK"},{"code":"F quad_roots(a, b, c)\n V sqd = Complex(b^2 - 4*a*c) ^ 0.5\n R ((-b + sqd) / (2 * a),\n (-b - sqd) / (2 * a))\n\nV testcases = [(3.0, 4.0, 4 / 3),\n (3.0, 2.0, -1.0),\n (3.0, 2.0, 1.0),\n (1.0, -1e9, 1.0),\n (1.0, -1e100, 1.0)]\n\nL(a, b, c) testcases\n V (r1, r2) = quad_roots(a, b, c)\n print(r1, end' ‘ ’)\n print(r2)\n","language":"11l"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\nwith Ada.Numerics.Elementary_Functions; use Ada.Numerics.Elementary_Functions;\n\nprocedure Quadratic_Equation is\n type Roots is array (1..2) of Float;\n function Solve (A, B, C : Float) return Roots is\n SD : constant Float := sqrt (B**2 - 4.0 * A * C);\n X : Float;\n begin\n if B < 0.0 then\n X := (- B + SD) / (2.0 * A);\n return (X, C / (A * X));\n else\n X := (- B - SD) / (2.0 * A);\n return (C / (A * X), X);\n end if;\n end Solve;\n\n R : constant Roots := Solve (1.0, -10.0E5, 1.0);\nbegin\n Put_Line (\"X1 =\" & Float'Image (R (1)) & \" X2 =\" & Float'Image (R (2)));\nend Quadratic_Equation;\n","language":"Ada"},{"code":"quadratic equation:\nBEGIN\n\n MODE ROOTS = UNION([]REAL, []COMPL);\n MODE QUADRATIC = STRUCT(REAL a,b,c);\n\n PROC solve = (QUADRATIC q)ROOTS:\n BEGIN\n REAL a = a OF q, b = b OF q, c = c OF q;\n REAL sa = b**2 - 4*a*c;\n IF sa >=0 THEN # handle the +ve case as REAL #\n REAL sqrt sa = ( b<0 | sqrt(sa) | -sqrt(sa));\n REAL r1 = (-b + sqrt sa)/(2*a),\n r2 = (-b - sqrt sa)/(2*a);\n []REAL((r1,r2))\n ELSE # handle the -ve case as COMPL conjugate pairs #\n COMPL compl sqrt sa = ( b<0 | complex sqrt(sa) | -complex sqrt(sa));\n COMPL r1 = (-b + compl sqrt sa)/(2*a),\n r2 = (-b - compl sqrt sa)/(2*a);\n []COMPL (r1, r2)\n FI\n END # solve #;\n\n PROC real evaluate = (QUADRATIC q, REAL x )REAL: (a OF q*x + b OF q)*x + c OF q;\n PROC compl evaluate = (QUADRATIC q, COMPL x)COMPL: (a OF q*x + b OF q)*x + c OF q;\n\n # only a very tiny difference between the 2 examples #\n []QUADRATIC test = ((1, -10e5, 1), (1, 0, 1), (1,-3,2), (1,3,2), (4,0,4), (3,4,5));\n\n FORMAT real fmt = $g(-0,8)$;\n FORMAT compl fmt = $f(real fmt)\"+\"f(real fmt)\"i\"$;\n FORMAT quadratic fmt = $f(real fmt)\" x**2 + \"f(real fmt)\" x + \"f(real fmt)\" = 0\"$;\n\n FOR index TO UPB test DO\n QUADRATIC quadratic = test[index];\n ROOTS r = solve(quadratic);\n\n# Output the two different scenerios #\n printf(($\"Quadratic: \"$, quadratic fmt, quadratic, $l$));\n CASE r IN\n ([]REAL r):\n printf(($\"REAL x1 = \"$, real fmt, r[1],\n $\", x2 = \"$, real fmt, r[2], $\"; \"$,\n $\"REAL y1 = \"$, real fmt, real evaluate(quadratic,r[1]),\n $\", y2 = \"$, real fmt, real evaluate(quadratic,r[2]), $\";\"ll$\n )),\n ([]COMPL c):\n printf(($\"COMPL x1,x2 = \"$, real fmt, re OF c[1], $\"+/-\"$,\n real fmt, ABS im OF c[1], $\"; \"$,\n $\"COMPL y1 = \"$, compl fmt, compl evaluate(quadratic,c[1]),\n $\", y2 = \"$, compl fmt, compl evaluate(quadratic,c[2]), $\";\"ll$\n ))\n ESAC\n OD\nEND # quadratic_equation #\n","language":"ALGOL-68"},{"code":"MsgBox % quadratic(u,v, 1,-3,2) \", \" u \", \" v\nMsgBox % quadratic(u,v, 1,3,2) \", \" u \", \" v\nMsgBox % quadratic(u,v, -2,4,-2) \", \" u \", \" v\nMsgBox % quadratic(u,v, 1,0,1) \", \" u \", \" v\nSetFormat FloatFast, 0.15e\nMsgBox % quadratic(u,v, 1,-1.0e8,1) \", \" u \", \" v\n\nquadratic(ByRef x1, ByRef x2, a,b,c) { ; -> #real roots {x1,x2} of ax²+bx+c\n If (a = 0)\n Return -1 ; ERROR: not quadratic\n d := b*b - 4*a*c\n If (d < 0) {\n x1 := x2 := \"\"\n Return 0\n }\n If (d = 0) {\n x1 := x2 := -b/2/a\n Return 1\n }\n x1 := (-b - (b<0 ? -sqrt(d) : sqrt(d)))/2/a\n x2 := c/a/x1\n Return 2\n}\n","language":"AutoHotkey"},{"code":" FOR test% = 1 TO 7\n READ a$, b$, c$\n PRINT \"For a = \" ; a$ \", b = \" ; b$ \", c = \" ; c$ TAB(32) ;\n PROCsolvequadratic(EVAL(a$), EVAL(b$), EVAL(c$))\n NEXT\n END\n\n DATA 1, -1E9, 1\n DATA 1, 0, 1\n DATA 2, -1, -6\n DATA 1, 2, -2\n DATA 0.5, SQR(2), 1\n DATA 1, 3, 2\n DATA 3, 4, 5\n\n DEF PROCsolvequadratic(a, b, c)\n LOCAL d, f\n d = b^2 - 4*a*c\n CASE SGN(d) OF\n WHEN 0:\n PRINT \"the single root is \" ; -b/2/a\n WHEN +1:\n f = (1 + SQR(1-4*a*c/b^2))/2\n PRINT \"the real roots are \" ; -f*b/a \" and \" ; -c/b/f\n WHEN -1:\n PRINT \"the complex roots are \" ; -b/2/a \" +/- \" ; SQR(-d)/2/a \"*i\"\n ENDCASE\n ENDPROC\n","language":"BBC-BASIC"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <complex.h>\n#include <math.h>\n\ntypedef double complex cplx;\n\nvoid quad_root\n(double a, double b, double c, cplx * ra, cplx *rb)\n{\n\tdouble d, e;\n\tif (!a) {\n\t\t*ra = b ? -c / b : 0;\n\t\t*rb = 0;\n\t\treturn;\n\t}\n\tif (!c) {\n\t\t*ra = 0;\n\t\t*rb = -b / a;\n\t\treturn;\n\t}\n\n\tb /= 2;\n\tif (fabs(b) > fabs(c)) {\n\t\te = 1 - (a / b) * (c / b);\n\t\td = sqrt(fabs(e)) * fabs(b);\n\t} else {\n\t\te = (c > 0) ? a : -a;\n\t\te = b * (b / fabs(c)) - e;\n\t\td = sqrt(fabs(e)) * sqrt(fabs(c));\n\t}\n\n\tif (e < 0) {\n\t\te = fabs(d / a);\n\t\td = -b / a;\n\t\t*ra = d + I * e;\n\t\t*rb = d - I * e;\n\t\treturn;\n\t}\n\n\td = (b >= 0) ? d : -d;\n\te = (d - b) / a;\n\td = e ? (c / e) / a : 0;\n\t*ra = d;\n\t*rb = e;\n\treturn;\n}\n\nint main()\n{\n\tcplx ra, rb;\n\tquad_root(1, 1e12 + 1, 1e12, &ra, &rb);\n\tprintf(\"(%g + %g i), (%g + %g i)\\n\",\n\t\tcreal(ra), cimag(ra), creal(rb), cimag(rb));\n\n\tquad_root(1e300, -1e307 + 1, 1e300, &ra, &rb);\n\tprintf(\"(%g + %g i), (%g + %g i)\\n\",\n\t\tcreal(ra), cimag(ra), creal(rb), cimag(rb));\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <math.h>\n#include <complex.h>\n\nvoid roots_quadratic_eq(double a, double b, double c, complex double *x)\n{\n double delta;\n\n delta = b*b - 4.0*a*c;\n x[0] = (-b + csqrt(delta)) / (2.0*a);\n x[1] = (-b - csqrt(delta)) / (2.0*a);\n}\n","language":"C"},{"code":"void roots_quadratic_eq2(double a, double b, double c, complex double *x)\n{\n b /= a;\n c /= a;\n double delta = b*b - 4*c;\n if ( delta < 0 ) {\n x[0] = -b/2 + I*sqrt(-delta)/2.0;\n x[1] = -b/2 - I*sqrt(-delta)/2.0;\n } else {\n double root = sqrt(delta);\n double sol = (b>0) ? (-b - root)/2.0 : (-b + root)/2.0;\n x[0] = sol;\n x[1] = c/sol;\n }\n}\n","language":"C"},{"code":"int main()\n{\n complex double x[2];\n\n roots_quadratic_eq(1, -1e20, 1, x);\n printf(\"x1 = (%.20le, %.20le)\\nx2 = (%.20le, %.20le)\\n\\n\",\n\t creal(x[0]), cimag(x[0]),\n\t creal(x[1]), cimag(x[1]));\n roots_quadratic_eq2(1, -1e20, 1, x);\n printf(\"x1 = (%.20le, %.20le)\\nx2 = (%.20le, %.20le)\\n\\n\",\n\t creal(x[0]), cimag(x[0]),\n\t creal(x[1]), cimag(x[1]));\n\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <utility>\n#include <complex>\n\ntypedef std::complex<double> complex;\n\nstd::pair<complex, complex>\n solve_quadratic_equation(double a, double b, double c)\n{\n b /= a;\n c /= a;\n double discriminant = b*b-4*c;\n if (discriminant < 0)\n return std::make_pair(complex(-b/2, std::sqrt(-discriminant)/2),\n complex(-b/2, -std::sqrt(-discriminant)/2));\n\n double root = std::sqrt(discriminant);\n double solution1 = (b > 0)? (-b - root)/2\n : (-b + root)/2;\n\n return std::make_pair(solution1, c/solution1);\n}\n\nint main()\n{\n std::pair<complex, complex> result = solve_quadratic_equation(1, -1e20, 1);\n std::cout << result.first << \", \" << result.second << std::endl;\n}\n","language":"C++"},{"code":"using System;\nusing System.Numerics;\n\nclass QuadraticRoots\n{\n static Tuple<Complex, Complex> Solve(double a, double b, double c)\n {\n var q = -(b + Math.Sign(b) * Complex.Sqrt(b * b - 4 * a * c)) / 2;\n return Tuple.Create(q / a, c / q);\n }\n\n static void Main()\n {\n Console.WriteLine(Solve(1, -1E20, 1));\n }\n}\n","language":"C-sharp"},{"code":"(defn quadratic\n \"Compute the roots of a quadratic in the form ax^2 + bx + c = 1.\n Returns any of nil, a float, or a vector.\"\n [a b c]\n (let [sq-d (Math/sqrt (- (* b b) (* 4 a c)))\n f #(/ (% b sq-d) (* 2 a))]\n (cond\n (neg? sq-d) nil\n (zero? sq-d) (f +)\n (pos? sq-d) [(f +) (f -)]\n :else nil))) ; maybe our number ended up as NaN\n","language":"Clojure"},{"code":"user=> (quadratic 1.0 1.0 1.0)\nnil\nuser=> (quadratic 1.0 2.0 1.0)\n1.0\nuser=> (quadratic 1.0 3.0 1.0)\n[2.618033988749895 0.3819660112501051]\n","language":"Clojure"},{"code":"(defun quadratic (a b c)\n (list\n (/ (+ (- b) (sqrt (- (expt b 2) (* 4 a c)))) (* 2 a))\n (/ (- (- b) (sqrt (- (expt b 2) (* 4 a c)))) (* 2 a))))\n","language":"Common-Lisp"},{"code":"import std.math, std.traits;\n\nCommonType!(T1, T2, T3)[] naiveQR(T1, T2, T3)\n (in T1 a, in T2 b, in T3 c)\npure nothrow if (isFloatingPoint!T1) {\n alias ReturnT = typeof(typeof(return).init[0]);\n if (a == 0)\n return [ReturnT(c / b)]; // It's a linear function.\n immutable ReturnT det = b ^^ 2 - 4 * a * c;\n if (det < 0)\n return []; // No real number root.\n immutable SD = sqrt(det);\n return [(-b + SD) / 2 * a, (-b - SD) / 2 * a];\n}\n\nCommonType!(T1, T2, T3)[] cautiQR(T1, T2, T3)\n (in T1 a, in T2 b, in T3 c)\npure nothrow if (isFloatingPoint!T1) {\n alias ReturnT = typeof(typeof(return).init[0]);\n if (a == 0)\n return [ReturnT(c / b)]; // It's a linear function.\n immutable ReturnT det = b ^^ 2 - 4 * a * c;\n if (det < 0)\n return []; // No real number root.\n immutable SD = sqrt(det);\n\n if (b * a < 0) {\n immutable x = (-b + SD) / 2 * a;\n return [x, c / (a * x)];\n } else {\n immutable x = (-b - SD) / 2 * a;\n return [c / (a * x), x];\n }\n}\n\nvoid main() {\n import std.stdio;\n writeln(\"With 32 bit float type:\");\n writefln(\" Naive: [%(%g, %)]\", naiveQR(1.0f, -10e5f, 1.0f));\n writefln(\"Cautious: [%(%g, %)]\", cautiQR(1.0f, -10e5f, 1.0f));\n writeln(\"\\nWith 64 bit double type:\");\n writefln(\" Naive: [%(%g, %)]\", naiveQR(1.0, -10e5, 1.0));\n writefln(\"Cautious: [%(%g, %)]\", cautiQR(1.0, -10e5, 1.0));\n writeln(\"\\nWith real type:\");\n writefln(\" Naive: [%(%g, %)]\", naiveQR(1.0L, -10e5L, 1.0L));\n writefln(\"Cautious: [%(%g, %)]\", cautiQR(1.0L, -10e5L, 1.0L));\n}\n","language":"D"},{"code":"defmodule Quadratic do\n def roots(a, b, c) do\n IO.puts \"Roots of a quadratic function (#{a}, #{b}, #{c})\"\n d = b * b - 4 * a * c\n a2 = a * 2\n cond do\n d > 0 ->\n sd = :math.sqrt(d)\n IO.puts \" the real roots are #{(- b + sd) / a2} and #{(- b - sd) / a2}\"\n d == 0 ->\n IO.puts \" the single root is #{- b / a2}\"\n true ->\n sd = :math.sqrt(-d)\n IO.puts \" the complex roots are #{- b / a2} +/- #{sd / a2}*i\"\n end\n end\nend\n\nQuadratic.roots(1, -2, 1)\nQuadratic.roots(1, -3, 2)\nQuadratic.roots(1, 0, 1)\nQuadratic.roots(1, -1.0e10, 1)\nQuadratic.roots(1, 2, 3)\nQuadratic.roots(2, -1, -6)\n","language":"Elixir"},{"code":"PROGRAM QUADRATIC\n\nPROCEDURE SOLVE_QUADRATIC\n D=B*B-4*A*C\n IF ABS(D)<1D-6 THEN D=0 END IF\n CASE SGN(D) OF\n 0->\n PRINT(\"the single root is \";-B/2/A)\n END ->\n 1->\n F=(1+SQR(1-4*A*C/(B*B)))/2\n PRINT(\"the real roots are \";-F*B/A;\"and \";-C/B/F)\n END ->\n -1->\n PRINT(\"the complex roots are \";-B/2/A;\"+/-\";SQR(-D)/2/A;\"*i\")\n END ->\n END CASE\nEND PROCEDURE\n\nBEGIN\n PRINT(CHR$(12);) ! CLS\n FOR TEST%=1 TO 7 DO\n READ(A,B,C)\n PRINT(\"For a=\";A;\",b=\";B;\",c=\";C;TAB(32);)\n SOLVE_QUADRATIC\n END FOR\n DATA(1,-1E9,1)\n DATA(1,0,1)\n DATA(2,-1,-6)\n DATA(1,2,-2)\n DATA(0.5,1.4142135,1)\n DATA(1,3,2)\n DATA(3,4,5)\nEND PROGRAM\n","language":"ERRE"},{"code":":: quadratic-equation ( a b c -- x1 x2 )\n b sq a c * 4 * - sqrt :> sd\n b 0 <\n [ b neg sd + a 2 * / ]\n [ b neg sd - a 2 * / ] if :> x\n x c a x * / ;\n","language":"Factor"},{"code":"( scratchpad ) 1 -1.e20 1 quadratic-equation\n--- Data stack:\n1.0e+20\n9.999999999999999e-21\n","language":"Factor"},{"code":":: quadratic-equation2 ( a b c -- x1 x2 )\n a c * sqrt b / :> q\n 1 4 q sq * - sqrt 0.5 * 0.5 + :> f\n b neg a / f * c neg b / f / ;\n","language":"Factor"},{"code":"( scratchpad ) 1 -1.e20 1 quadratic-equation\n--- Data stack:\n1.0e+20\n1.0e-20\n","language":"Factor"},{"code":": quadratic ( fa fb fc -- r1 r2 )\n frot frot\n ( c a b )\n fover 3 fpick f* -4e f* fover fdup f* f+\n ( c a b det )\n fdup f0< if abort\" imaginary roots\" then\n fsqrt\n fover f0< if fnegate then\n f+ fnegate\n ( c a b-det )\n 2e f/ fover f/\n ( c a r1 )\n frot frot f/ fover f/ ;\n","language":"Forth"},{"code":": quadratic { F: a F: b F: c -- r1 r2 }\n b b f* 4e a f* c f* f-\n fdup f0< if abort\" imaginary roots\" then\n fsqrt\n b f0< if fnegate then b f+ fnegate 2e f/ a f/\n c a f/ fover f/ ;\n\n\\ test\n1 set-precision\n1e -1e6 1e quadratic fs. fs. \\ 1e-6 1e6\n","language":"Forth"},{"code":"PROGRAM QUADRATIC\n\n IMPLICIT NONE\n INTEGER, PARAMETER :: dp = SELECTED_REAL_KIND(15)\n REAL(dp) :: a, b, c, e, discriminant, rroot1, rroot2\n COMPLEX(dp) :: croot1, croot2\n\n WRITE(*,*) \"Enter the coefficients of the equation ax^2 + bx + c\"\n WRITE(*, \"(A)\", ADVANCE=\"NO\") \"a = \"\n READ *, a\n WRITE(*,\"(A)\", ADVANCE=\"NO\") \"b = \"\n READ *, b\n WRITE(*,\"(A)\", ADVANCE=\"NO\") \"c = \"\n READ *, c\n\n WRITE(*,\"(3(A,E23.15))\") \"Coefficients are: a = \", a, \" b = \", b, \" c = \", c\n e = 1.0e-9_dp\n discriminant = b*b - 4.0_dp*a*c\n\n IF (ABS(discriminant) < e) THEN\n rroot1 = -b / (2.0_dp * a)\n WRITE(*,*) \"The roots are real and equal:\"\n WRITE(*,\"(A,E23.15)\") \"Root = \", rroot1\n ELSE IF (discriminant > 0) THEN\n rroot1 = -(b + SIGN(SQRT(discriminant), b)) / (2.0_dp * a)\n rroot2 = c / (a * rroot1)\n WRITE(*,*) \"The roots are real:\"\n WRITE(*,\"(2(A,E23.15))\") \"Root1 = \", rroot1, \" Root2 = \", rroot2\n ELSE\n croot1 = (-b + SQRT(CMPLX(discriminant))) / (2.0_dp*a)\n croot2 = CONJG(croot1)\n WRITE(*,*) \"The roots are complex:\"\n WRITE(*,\"(2(A,2E23.15,A))\") \"Root1 = \", croot1, \"j \", \" Root2 = \", croot2, \"j\"\n END IF\n","language":"Fortran"},{"code":"COMPUTE ROOTS OF A QUADRATIC FUNCTION - 1956\n READ 100,A,B,C\n 100 FORMAT(3F8.3)\n PRINT 100,A,B,C\n DISC=B**2-4.*A*C\n IF(DISC),1,2,3\n 1 XR=-B/(2.*A)\n XI=SQRT(-DISC)/(2.*A)\n XJ=-XI\n PRINT 311\n PRINT 312,XR,XI,XR,XJ\n 311 FORMAT(13HCOMPLEX ROOTS)\n 312 FORMAT(4HX1=(,2E12.4,6H),X2=(,2E12.4,1H))\n GO TO 999\n 2 X1=-B/(2.*A)\n X2=X1\n PRINT 321\n PRINT 332,X1,X2\n 321 FORMAT(16HEQUAL REAL ROOTS)\n GO TO 999\n 3 X1= (-B+SQRT(DISC)) / (2.*A)\n X2= (-B-SQRT(DISC)) / (2.*A)\n PRINT 331\n PRINT 332,X1,X2\n 331 FORMAT(10HREAL ROOTS)\n 332 FORMAT(3HX1=,E12.5,4H,X2=,E12.5)\n 999 STOP\n","language":"Fortran"},{"code":"' version 20-12-2020\n' compile with: fbc -s console\n\n#Include Once \"gmp.bi\"\n\nSub solvequadratic_n(a As Double ,b As Double, c As Double)\n\n Dim As Double f, d = b ^ 2 - 4 * a * c\n\n Select Case Sgn(d)\n Case 0\n Print \"1: the single root is \"; -b / 2 / a\n Case 1\n Print \"1: the real roots are \"; (-b + Sqr(d)) / 2 * a; \" and \";(-b - Sqr(d)) / 2 * a\n Case -1\n Print \"1: the complex roots are \"; -b / 2 / a; \" +/- \"; Sqr(-d) / 2 / a; \"*i\"\n End Select\n\nEnd Sub\n\nSub solvequadratic_c(a As Double ,b As Double, c As Double)\n\n Dim As Double f, d = b ^ 2 - 4 * a * c\n Select Case Sgn(d)\n Case 0\n Print \"2: the single root is \"; -b / 2 / a\n Case 1\n f = (1 + Sqr(1 - 4 * a *c / b ^ 2)) / 2\n Print \"2: the real roots are \"; -f * b / a; \" and \"; -c / b / f\n Case -1\n Print \"2: the complex roots are \"; -b / 2 / a; \" +/- \"; Sqr(-d) / 2 / a; \"*i\"\n End Select\nEnd Sub\n\nSub solvequadratic_gmp(a_ As Double ,b_ As Double, c_ As Double)\n\n #Define PRECISION 1024 ' about 300 digits\n #Define MAX 25\n\n Dim As ZString Ptr text\n text = Callocate (1000)\n Mpf_set_default_prec(PRECISION)\n\n Dim As Mpf_ptr a, b, c, d, t\n a = Allocate(Len(__mpf_struct)) : Mpf_init_set_d(a, a_)\n b = Allocate(Len(__mpf_struct)) : Mpf_init_set_d(b, b_)\n c = Allocate(Len(__mpf_struct)) : Mpf_init_set_d(c, c_)\n d = Allocate(Len(__mpf_struct)) : Mpf_init(d)\n t = Allocate(Len(__mpf_struct)) : Mpf_init(t)\n\n mpf_mul(d, b, b)\n mpf_set_ui(t, 4)\n mpf_mul(t, t, a)\n mpf_mul(t, t, c)\n mpf_sub(d, d, t)\n\n Select Case mpf_sgn(d)\n Case 0\n mpf_neg(t, b)\n mpf_div_ui(t, t, 2)\n mpf_div(t, t, a)\n Gmp_sprintf(text,\"%.*Fe\", MAX, t)\n Print \"3: the single root is \"; *text\n Case Is > 0\n mpf_sqrt(d, d)\n mpf_add(a, a, a)\n mpf_neg(t, b)\n mpf_add(t, t, d)\n mpf_div(t, t, a)\n Gmp_sprintf(text,\"%.*Fe\", MAX, t)\n Print \"3: the real roots are \"; *text; \" and \";\n mpf_neg(t, b)\n mpf_sub(t, t, d)\n mpf_div(t, t, a)\n Gmp_sprintf(text,\"%.*Fe\", MAX, t)\n Print *text\n Case Is < 0\n mpf_neg(t, b)\n mpf_div_ui(t, t, 2)\n mpf_div(t, t, a)\n Gmp_sprintf(text,\"%.*Fe\", MAX, t)\n Print \"3: the complex roots are \"; *text; \" +/- \";\n mpf_neg(t, d)\n mpf_sqrt(t, t)\n mpf_div_ui(t, t, 2)\n mpf_div(t, t, a)\n Gmp_sprintf(text,\"%.*Fe\", MAX, t)\n Print *text; \"*i\"\n End Select\n\nEnd Sub\n\n' ------=< MAIN >=------\n\nDim As Double a, b, c\nPrint \"1: is the naieve way\"\nPrint \"2: is the cautious way\"\nPrint \"3: is the naieve way with help of GMP\"\nPrint\n\nFor i As Integer = 1 To 10\n Read a, b, c\n Print \"Find root(s) for \"; Str(a); \"X^2\"; IIf(b < 0, \"\", \"+\");\n Print Str(b); \"X\"; IIf(c < 0, \"\", \"+\"); Str(c)\n solvequadratic_n(a, b , c)\n solvequadratic_c(a, b , c)\n solvequadratic_gmp(a, b , c)\n Print\nNext\n\n' empty keyboard buffer\nWhile Inkey <> \"\" : Wend\nPrint : Print \"hit any key to end program\"\nSleep\nEnd\n\nData 1, -1E9, 1\nData 1, 0, 1\nData 2, -1, -6\nData 1, 2, -2\nData 0.5, 1.4142135623731, 1\nData 1, 3, 2\nData 3, 4, 5\nData 1, -1e100, 1\nData 1, -1e200, 1\nData 1, -1e300, 1\n","language":"FreeBASIC"},{"code":"QuadraticRoots := function(a, b, c)\n local d;\n d := Sqrt(b*b - 4*a*c);\n return [ (-b+d)/(2*a), (-b-d)/(2*a) ];\nend;\n\n# Hint : E(12) is a 12th primitive root of 1\nQuadraticRoots(2, 2, -1);\n# [ 1/2*E(12)^4-1/2*E(12)^7+1/2*E(12)^8+1/2*E(12)^11,\n# 1/2*E(12)^4+1/2*E(12)^7+1/2*E(12)^8-1/2*E(12)^11 ]\n\n# This works also with floating-point numbers\nQuadraticRoots(2.0, 2.0, -1.0);\n# [ 0.366025, -1.36603 ]\n","language":"GAP"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n)\n\nfunc qr(a, b, c float64) ([]float64, []complex128) {\n d := b*b-4*a*c\n switch {\n case d == 0:\n // single root\n return []float64{-b/(2*a)}, nil\n case d > 0:\n // two real roots\n if b < 0 {\n d = math.Sqrt(d)-b\n } else {\n d = -math.Sqrt(d)-b\n }\n return []float64{d/(2*a), (2*c)/d}, nil\n case d < 0:\n // two complex roots\n\n den := 1/(2*a)\n t1 := complex(-b*den, 0)\n t2 := complex(0, math.Sqrt(-d)*den)\n return nil, []complex128{t1+t2, t1-t2}\n }\n // otherwise d overflowed or a coefficient was NAN\n return []float64{d}, nil\n}\n\nfunc test(a, b, c float64) {\n fmt.Print(\"coefficients: \", a, b, c, \" -> \")\n r, i := qr(a, b, c)\n switch len(r) {\n case 1:\n fmt.Println(\"one real root:\", r[0])\n case 2:\n fmt.Println(\"two real roots:\", r[0], r[1])\n default:\n fmt.Println(\"two complex roots:\", i[0], i[1])\n }\n}\n\nfunc main() {\n for _, c := range [][3]float64{\n {1, -2, 1},\n {1, 0, 1},\n {1, -10, 1},\n {1, -1000, 1},\n {1, -1e9, 1},\n } {\n test(c[0], c[1], c[2])\n }\n}\n","language":"Go"},{"code":"import Data.Complex (Complex, realPart)\n\ntype CD = Complex Double\n\nquadraticRoots :: (CD, CD, CD) -> (CD, CD)\nquadraticRoots (a, b, c)\n | 0 < realPart b =\n ( (2 * c) / (- b - d),\n (- b - d) / (2 * a)\n )\n | otherwise =\n ( (- b + d) / (2 * a),\n (2 * c) / (- b + d)\n )\n where\n d = sqrt $ b ^ 2 - 4 * a * c\n\nmain :: IO ()\nmain =\n mapM_\n (print . quadraticRoots)\n [ (3, 4, 4 / 3),\n (3, 2, -1),\n (3, 2, 1),\n (1, -10e5, 1),\n (1, -10e9, 1)\n ]\n","language":"Haskell"},{"code":"procedure main()\n solve(1.0, -10.0e5, 1.0)\nend\n\nprocedure solve(a,b,c)\n d := sqrt(b*b - 4.0*a*c)\n roots := if b < 0 then [r1 := (-b+d)/(2.0*a), c/(a*r1)]\n else [r1 := (-b-d)/(2.0*a), c/(a*r1)]\n write(a,\"*x^2 + \",b,\"*x + \",c,\" has roots \",roots[1],\" and \",roots[2])\nend\n","language":"Icon"},{"code":"compile_OPT IDL2\n\nprint, \"input a, press enter, input b, press enter, input c, press enter\"\nread,a,b,c\nPromt='Enter values of a,b,c and hit enter'\n\na0=0.0\nb0=0.0\nc0=0.0 ;make them floating point variables\n\nx=-b+sqrt((b^2)-4*a*c)\ny=-b-sqrt((b^2)-4*a*c)\nz=2*a\nd= x/z\ne= y/z\n\nprint, d,e\n","language":"IDL"},{"code":"100 PROGRAM \"Quadratic.bas\"\n110 PRINT \"Enter coefficients a, b and c:\":INPUT PROMPT \"a= ,b= ,c= \":A,B,C\n120 IF A=0 THEN\n130 PRINT \"The coefficient of x^2 can not be 0.\"\n140 ELSE\n150 LET D=B^2-4*A*C\n160 SELECT CASE SGN(D)\n170 CASE 0\n180 PRINT \"The single root is \";-B/2/A\n190 CASE 1\n200 PRINT \"The real roots are \";(-B+SQR(D))/(2*A);\"and \";(-B-SQR(D))/(2*A)\n210 CASE -1\n220 PRINT \"The complex roots are \";-B/2/A;\"+/- \";STR$(SQR(-D)/2/A);\"*i\"\n230 END SELECT\n240 END IF\n","language":"IS-BASIC"},{"code":" coeff =. _3 |.\\ 3 4 4r3 3 2 _1 3 2 1 1 _1e6 1 1 _1e9 1\n > {:\"1 p. coeff\n _0.666667 _0.666667\n _1 0.333333\n_0.333333j0.471405 _0.333333j_0.471405\n 1e6 1e_6\n 1e9 1e_9\n","language":"J"},{"code":" p. 0 16 _12 2 NB. return multiplier ; roots\n+-+-----+\n|2|4 2 0|\n+-+-----+\n p. 2 ; 4 2 0 NB. return coefficients\n0 16 _12 2\n","language":"J"},{"code":" 1{::p. 1 _1e5 1 NB. display roots\n100000 1e_5\n 1 _1e5 1 p. 1{::p. 1 _1e5 1 NB. test roots\n_3.38436e_7 0\n 1 _1e5 1 p. 1e5 1e_5 NB. test displayed roots\n1 9.99999e_11\n 1e5 1e_5 - 1{::p. 1 _1e5 1 NB. find difference\n1e_5 _1e_15\n 1 _1e5 1 p. 1e5 1e_5-1e_5 _1e_15 NB. test displayed roots with adjustment\n_3.38436e_7 0\n","language":"J"},{"code":"q_r=: verb define\n 'a b c' =. y\n q=. b %~ %: a * c\n f=. 0.5 + 0.5 * %:(1-4*q*q)\n (-b*f%a),(-c%b*f)\n)\n\n q_r 1 _1e6 1\n1e6 1e_6\n","language":"J"},{"code":"public class QuadraticRoots {\n private static class Complex {\n double re, im;\n\n public Complex(double re, double im) {\n this.re = re;\n this.im = im;\n }\n\n @Override\n public boolean equals(Object obj) {\n if (obj == this) {return true;}\n if (!(obj instanceof Complex)) {return false;}\n Complex other = (Complex) obj;\n return (re == other.re) && (im == other.im);\n }\n\n @Override\n public String toString() {\n if (im == 0.0) {return String.format(\"%g\", re);}\n if (re == 0.0) {return String.format(\"%gi\", im);}\n return String.format(\"%g %c %gi\", re,\n (im < 0.0 ? '-' : '+'), Math.abs(im));\n }\n }\n\n private static Complex[] quadraticRoots(double a, double b, double c) {\n Complex[] roots = new Complex[2];\n double d = b * b - 4.0 * a * c; // discriminant\n double aa = a + a;\n\n if (d < 0.0) {\n double re = -b / aa;\n double im = Math.sqrt(-d) / aa;\n roots[0] = new Complex(re, im);\n roots[1] = new Complex(re, -im);\n } else if (b < 0.0) {\n // Avoid calculating -b - Math.sqrt(d), to avoid any\n // subtractive cancellation when it is near zero.\n double re = (-b + Math.sqrt(d)) / aa;\n roots[0] = new Complex(re, 0.0);\n roots[1] = new Complex(c / (a * re), 0.0);\n } else {\n // Avoid calculating -b + Math.sqrt(d).\n double re = (-b - Math.sqrt(d)) / aa;\n roots[1] = new Complex(re, 0.0);\n roots[0] = new Complex(c / (a * re), 0.0);\n }\n return roots;\n }\n\n public static void main(String[] args) {\n double[][] equations = {\n {1.0, 22.0, -1323.0}, // two distinct real roots\n {6.0, -23.0, 20.0}, // with a != 1.0\n {1.0, -1.0e9, 1.0}, // with one root near zero\n {1.0, 2.0, 1.0}, // one real root (double root)\n {1.0, 0.0, 1.0}, // two imaginary roots\n {1.0, 1.0, 1.0} // two complex roots\n };\n for (int i = 0; i < equations.length; i++) {\n Complex[] roots = quadraticRoots(\n equations[i][0], equations[i][1], equations[i][2]);\n System.out.format(\"%na = %g b = %g c = %g%n\",\n equations[i][0], equations[i][1], equations[i][2]);\n if (roots[0].equals(roots[1])) {\n System.out.format(\"X1,2 = %s%n\", roots[0]);\n } else {\n System.out.format(\"X1 = %s%n\", roots[0]);\n System.out.format(\"X2 = %s%n\", roots[1]);\n }\n }\n }\n}\n","language":"Java"},{"code":"# Complex numbers as points [x,y] in the Cartesian plane\ndef real(z): if (z|type) == \"number\" then z else z[0] end;\n\ndef imag(z): if (z|type) == \"number\" then 0 else z[1] end;\n\ndef plus(x; y):\n if (x|type) == \"number\" then\n if (y|type) == \"number\" then [ x+y, 0 ]\n else [ x + y[0], y[1]]\n end\n elif (y|type) == \"number\" then plus(y;x)\n else [ x[0] + y[0], x[1] + y[1] ]\n end;\n\ndef multiply(x; y):\n if (x|type) == \"number\" then\n if (y|type) == \"number\" then [ x*y, 0 ]\n else [x * y[0], x * y[1]]\n end\n elif (y|type) == \"number\" then multiply(y;x)\n else [ x[0] * y[0] - x[1] * y[1], x[0] * y[1] + x[1] * y[0]]\n end;\n\ndef negate(x): multiply(-1; x);\n\ndef minus(x; y): plus(x; multiply(-1; y));\n\ndef conjugate(z):\n if (z|type) == \"number\" then [z, 0]\n else [z[0], -(z[1]) ]\n end;\n\ndef invert(z):\n if (z|type) == \"number\" then [1/z, 0]\n else\n ( (z[0] * z[0]) + (z[1] * z[1]) ) as $d\n # use \"0 + .\" to convert -0 back to 0\n | [ z[0]/$d, (0 + -(z[1]) / $d)]\n end;\n\ndef divide(x;y): multiply(x; invert(y));\n\ndef magnitude(z):\n real( multiply(z; conjugate(z))) | sqrt;\n\n# exp^z\ndef complex_exp(z):\n def expi(x): [ (x|cos), (x|sin) ];\n if (z|type) == \"number\" then z|exp\n elif z[0] == 0 then expi(z[1]) # for efficiency\n else multiply( (z[0]|exp); expi(z[1]) )\n end ;\n\ndef complex_sqrt(z):\n if imag(z) == 0 and real(z) >= 0 then [(real(z)|sqrt), 0]\n else\n magnitude(z) as $r\n | if $r == 0 then [0,0]\n else\n (real(z)/$r) as $a\n | (imag(z)/$r) as $b\n | $r | sqrt as $r\n | (($a | acos) / 2)\n | [ ($r * cos), ($r * sin)]\n end\n end ;\n","language":"Jq"},{"code":"# If there are infinitely many solutions, emit true;\n# if none, emit empty;\n# otherwise always emit two.\n# For numerical accuracy, Middlebrook's approach is adopted:\ndef quadratic_roots(a; b; c):\n if a == 0 and b == 0 then\n if c == 0 then true # infinitely many\n else empty # none\n end\n elif a == 0 then [-c/b, 0]\n elif b == 0 then (complex_sqrt(1/a) | (., negate(.)))\n else\n divide( plus(1.0; complex_sqrt( minus(1.0; (4 * a * c / (b*b))))); 2) as $f\n | negate(divide(multiply(b; $f); a)),\n negate(divide(c; multiply(b; $f)))\n end\n;\n","language":"Jq"},{"code":"def example:\n def pow(i): . as $in | reduce range(0;i) as $i (1; . * $in);\n def poly(a;b;c): plus( plus( multiply(a; multiply(.;.)); multiply(b;.)); c);\n def abs: if . < 0 then -. else . end;\n def zero(z):\n if z == 0 then 0\n else (magnitude(z)|abs) as $zero\n | if $zero < 1e-10 then \"+0\" else $zero end\n end;\n def lpad(n): tostring | (n - length) * \" \" + .;\n\n range(0; 13) as $i\n | (- (10|pow($i))) as $b\n | quadratic_roots(1; $b; 1) as $x\n | $x | poly(1; $b; 1) as $zero\n | \"\\($i|lpad(4)): error = \\(zero($zero)|lpad(18)) x=\\($x)\"\n;\n\nexample\n","language":"Jq"},{"code":"$ jq -M -r -n -f Roots_of_a_quadratic_function.jq\n 0: error = +0 x=[0.5,0.8660254037844386]\n 0: error = +0 x=[0.5000000000000001,-0.8660254037844387]\n 1: error = +0 x=[9.898979485566356,0]\n 1: error = +0 x=[0.10102051443364382,-0]\n 2: error = +0 x=[99.98999899979995,0]\n 2: error = +0 x=[0.010001000200050014,-0]\n 3: error = 1.1641532182693481e-10 x=[999.998999999,0]\n 3: error = +0 x=[0.0010000010000019998,-0]\n 4: error = +0 x=[9999.999899999999,0]\n 4: error = +0 x=[0.00010000000100000003,-0]\n 5: error = +0 x=[99999.99999,0]\n 5: error = +0 x=[1.0000000001e-05,-0]\n 6: error = 0.0001220703125 x=[999999.9999989999,0]\n 6: error = +0 x=[1.000000000001e-06,-0]\n 7: error = 0.015625 x=[9999999.9999999,0]\n 7: error = +0 x=[1.0000000000000101e-07,-0]\n 8: error = 1 x=[99999999.99999999,0]\n 8: error = +0 x=[1e-08,-0]\n 9: error = 1 x=[1000000000,0]\n 9: error = +0 x=[1e-09,-0]\n 10: error = 1 x=[10000000000,0]\n 10: error = +0 x=[1e-10,-0]\n 11: error = 1 x=[100000000000,0]\n 11: error = +0 x=[1e-11,-0]\n 12: error = 1 x=[1000000000000,0]\n 12: error = +0 x=[1e-12,-0]\n","language":"Jq"},{"code":"using Printf\n\nfunction quadroots(x::Real, y::Real, z::Real)\n a, b, c = promote(float(x), y, z)\n if a ≈ 0.0 return [-c / b] end\n Δ = b ^ 2 - 4a * c\n if Δ ≈ 0.0 return [-sqrt(c / a)] end\n if Δ < 0.0 Δ = complex(Δ) end\n d = sqrt(Δ)\n if b < 0.0\n d -= b\n return [d / 2a, 2c / d]\n else\n d = -d - b\n return [2c / d, d / 2a]\n end\nend\n\na = [1, 1, 1.0, 10]\nb = [10, 2, -10.0 ^ 9, 1]\nc = [1, 1, 1, 1]\n\nfor (x, y, z) in zip(a, b, c)\n @printf \"The roots of %.2fx² + %.2fx + %.2f\\n\\tx₀ = (%s)\\n\" x y z join(round.(quadroots(x, y, z), 2), \", \")\nend\n","language":"Julia"},{"code":" / naive method\n / sqr[x] and sqrt[x] must be provided\n quf:{[a;b;c]; s:sqrt[sqr[b]-4*a*c];(-b+s;-b-s)%2*a}\n\n quf[0.5;-2.5;2]\n1.0 4.0\n quf[1;8;15]\n-5.0 -3.0\n quf[1;10;1]\n-9.898979485566356 -0.10102051443364424\n","language":"K"},{"code":"import java.lang.Math.*\n\ndata class Equation(val a: Double, val b: Double, val c: Double) {\n data class Complex(val r: Double, val i: Double) {\n override fun toString() = when {\n i == 0.0 -> r.toString()\n r == 0.0 -> \"${i}i\"\n else -> \"$r + ${i}i\"\n }\n }\n\n data class Solution(val x1: Any, val x2: Any) {\n override fun toString() = when(x1) {\n x2 -> \"X1,2 = $x1\"\n else -> \"X1 = $x1, X2 = $x2\"\n }\n }\n\n val quadraticRoots by lazy {\n val _2a = a + a\n val d = b * b - 4.0 * a * c // discriminant\n if (d < 0.0) {\n val r = -b / _2a\n val i = sqrt(-d) / _2a\n Solution(Complex(r, i), Complex(r, -i))\n } else {\n // avoid calculating -b +/- sqrt(d), to avoid any\n // subtractive cancellation when it is near zero.\n val r = if (b < 0.0) (-b + sqrt(d)) / _2a else (-b - sqrt(d)) / _2a\n Solution(r, c / (a * r))\n }\n }\n}\n\nfun main(args: Array<String>) {\n val equations = listOf(Equation(1.0, 22.0, -1323.0), // two distinct real roots\n Equation(6.0, -23.0, 20.0), // with a != 1.0\n Equation(1.0, -1.0e9, 1.0), // with one root near zero\n Equation(1.0, 2.0, 1.0), // one real root (double root)\n Equation(1.0, 0.0, 1.0), // two imaginary roots\n Equation(1.0, 1.0, 1.0)) // two complex roots\n\n equations.forEach { println(\"$it\\n\" + it.quadraticRoots) }\n}\n","language":"Kotlin"},{"code":"1) using lambdas:\n\n{def equation\n {lambda {:a :b :c}\n {b equation :a*x{sup 2}+:b*x+:c=0}\n {{lambda {:a' :b' :d}\n {if {> :d 0}\n then {{lambda {:b' :d'}\n {equation.disp {+ :b' :d'} {- :b' :d'} 2 real roots}\n } :b' {/ {sqrt :d} :a'}}\n else {if {< :d 0}\n then {{lambda {:b' :d'}\n {equation.disp [:b',:d'] [:b',-:d'] 2 complex roots}\n } :b' {/ {sqrt {- :d}} :a'} }\n else {equation.disp :b' :b' one real double root}\n }}\n } {* 2 :a} {/ {- :b} {* 2 :a}} {- {* :b :b} {* 4 :a :c}} } }}\n\n2) using let:\n\n{def equation\n {lambda {:a :b :c}\n {b equation :a*x{sup 2}+:b*x+:c=0}\n {let { {:a' {* 2 :a}}\n {:b' {/ {- :b} {* 2 :a}}}\n {:d {- {* :b :b} {* 4 :a :c}}} }\n {if {> :d 0}\n then {let { {:b' :b'}\n {:d' {/ {sqrt :d} :a'}} }\n {equation.disp {+ :b' :d'} {- :b' :d'} 2 real roots} }\n else {if {< :d 0}\n then {let { {:b' :b'}\n {:d' {/ {sqrt {- :d}} :a'}} }\n {equation.disp [:b',:d'] [:b',-:d'] 2 complex roots} }\n else {equation.disp :b' :b' one real double root} }} }}}\n\n3) a function to display results in an HTML table format\n\n{def equation.disp\n {lambda {:x1 :x2 :txt}\n {table {@ style=\"background:#ffa\"}\n {tr {td :txt: }}\n {tr {td x1 = :x1 }}\n {tr {td x2 = :x2 }} } }}\n\n4) testing:\n\nequation 1*x2+1*x+-1=0\n2 real roots:\n x1 = 0.6180339887498949\n x2 = -1.618033988749895\n\nequation 1*x2+1*x+1=0\n2 complex roots:\n x1 = [-0.5,0.8660254037844386]\n x2 = [-0.5,-0.8660254037844386]\n\nequation 1*x2+-2*x+1=0\none real double root:\n x1 = 1\n x2 = 1\n","language":"Lambdatalk"},{"code":"a=1:b=2:c=3\n 'assume a<>0\n print quad$(a,b,c)\n end\n\nfunction quad$(a,b,c)\n D=b^2-4*a*c\n x=-1*b\n if D<0 then\n quad$=str$(x/(2*a));\" +i\";str$(sqr(abs(D))/(2*a));\" , \";str$(x/(2*a));\" -i\";str$(sqr(abs(D))/abs(2*a))\n else\n quad$=str$(x/(2*a)+sqr(D)/(2*a));\" , \";str$(x/(2*a)-sqr(D)/(2*a))\n end if\nend function\n","language":"Liberty-BASIC"},{"code":"to quadratic :a :b :c\n localmake \"d sqrt (:b*:b - 4*:a*:c)\n if :b < 0 [make \"d minus :d]\n output list (:d-:b)/(2*:a) (2*:c)/(:d-:b)\nend\n","language":"Logo"},{"code":"function qsolve(a, b, c)\n if b < 0 then return qsolve(-a, -b, -c) end\n val = b + (b^2 - 4*a*c)^(1/2) --this never exhibits instability if b > 0\n return -val / (2 * a), -2 * c / val --2c / val is the same as the \"unstable\" second root\nend\n\nfor i = 1, 12 do\n print(qsolve(1, 0-10^i, 1))\nend\n","language":"Lua"},{"code":"solve(a*x^2+b*x+c,x);\n\nsolve(1.0*x^2-10.0^9*x+1.0,x,explicit,allsolutions);\n\nfsolve(x^2-10^9*x+1,x,complex);\n","language":"Maple"},{"code":"Solve[a x^2 + b x + c == 0, x]\nSolve[x^2 - 10^5 x + 1 == 0, x]\nRoot[#1^2 - 10^5 #1 + 1 &, 1]\nRoot[#1^2 - 10^5 #1 + 1 &, 2]\nReduce[a x^2 + b x + c == 0, x]\nReduce[x^2 - 10^5 x + 1 == 0, x]\nFindInstance[x^2 - 10^5 x + 1 == 0, x, Reals, 2]\nFindRoot[x^2 - 10^5 x + 1 == 0, {x, 0}]\nFindRoot[x^2 - 10^5 x + 1 == 0, {x, 10^6}]\n","language":"Mathematica"},{"code":"roots([1 -3 2]) % coefficients in decreasing order of power e.g. [x^n ... x^2 x^1 x^0]\n","language":"MATLAB"},{"code":"solve(a*x^2 + b*x + c = 0, x);\n\n/* 2 2\n sqrt(b - 4 a c) + b sqrt(b - 4 a c) - b\n [x = - --------------------, x = --------------------]\n 2 a 2 a */\n\nfpprec: 40$\n\nsolve(x^2 - 10^9*x + 1 = 0, x);\n/* [x = 500000000 - sqrt(249999999999999999),\n x = sqrt(249999999999999999) + 500000000] */\n\nbfloat(%);\n/* [x = 1.0000000000000000009999920675269450501b-9,\n x = 9.99999999999999998999999999999999999b8] */\n","language":"Maxima"},{"code":"MODULE Quad EXPORTS Main;\n\nIMPORT IO, Fmt, Math;\n\nTYPE Roots = ARRAY [1..2] OF LONGREAL;\n\nVAR r: Roots;\n\nPROCEDURE Solve(a, b, c: LONGREAL): Roots =\n VAR sd: LONGREAL := Math.sqrt(b * b - 4.0D0 * a * c);\n x: LONGREAL;\n BEGIN\n IF b < 0.0D0 THEN\n x := (-b + sd) / (2.0D0 * a);\n RETURN Roots{x, c / (a * x)};\n ELSE\n x := (-b - sd) / (2.0D0 * a);\n RETURN Roots{c / (a * x), x};\n END;\n END Solve;\n\nBEGIN\n r := Solve(1.0D0, -10.0D5, 1.0D0);\n IO.Put(\"X1 = \" & Fmt.LongReal(r[1]) & \" X2 = \" & Fmt.LongReal(r[2]) & \"\\n\");\nEND Quad.\n","language":"Modula-3"},{"code":"import math, complex, strformat\n\nconst Epsilon = 1e-15\n\ntype\n\n SolKind = enum solDouble, solFloat, solComplex\n\n Roots = object\n case kind: SolKind\n of solDouble:\n fvalue: float\n of solFloat:\n fvalues: (float, float)\n of solComplex:\n cvalues: (Complex64, Complex64)\n\n\nfunc quadRoots(a, b, c: float): Roots =\n if a == 0:\n raise newException(ValueError, \"first coefficient cannot be null.\")\n let den = a * 2\n let Δ = b * b - a * c * 4\n if abs(Δ) < Epsilon:\n result = Roots(kind: solDouble, fvalue: -b / den)\n elif Δ < 0:\n let r = -b / den\n let i = sqrt(-Δ) / den\n result = Roots(kind: solComplex, cvalues: (complex64(r, i), complex64(r, -i)))\n else:\n let r = (if b < 0: -b + sqrt(Δ) else: -b - sqrt(Δ)) / den\n result = Roots(kind: solFloat, fvalues: (r, c / (a * r)))\n\n\nfunc `$`(r: Roots): string =\n case r.kind\n of solDouble:\n result = $r.fvalue\n of solFloat:\n result = &\"{r.fvalues[0]}, {r.fvalues[1]}\"\n of solComplex:\n result = &\"{r.cvalues[0].re} + {r.cvalues[0].im}i, {r.cvalues[1].re} + {r.cvalues[1].im}i\"\n\n\nwhen isMainModule:\n\n const Equations = [(1.0, -2.0, 1.0),\n (10.0, 1.0, 1.0),\n (1.0, -10.0, 1.0),\n (1.0, -1000.0, 1.0),\n (1.0, -1e9, 1.0)]\n\n for (a, b, c) in Equations:\n echo &\"Equation: {a=}, {b=}, {c=}\"\n let roots = quadRoots(a, b, c)\n let plural = if roots.kind == solDouble: \"\" else: \"s\"\n echo &\" root{plural}: {roots}\"\n","language":"Nim"},{"code":"type quadroots =\n | RealRoots of float * float\n | ComplexRoots of Complex.t * Complex.t ;;\n\nlet quadsolve a b c =\n let d = (b *. b) -. (4.0 *. a *. c) in\n if d < 0.0\n then\n let r = -. b /. (2.0 *. a)\n and i = sqrt(-. d) /. (2.0 *. a) in\n ComplexRoots ({ Complex.re = r; Complex.im = i },\n { Complex.re = r; Complex.im = (-.i) })\n else\n let r =\n if b < 0.0\n then ((sqrt d) -. b) /. (2.0 *. a)\n else ((sqrt d) +. b) /. (-2.0 *. a)\n in\n RealRoots (r, c /. (r *. a))\n;;\n","language":"OCaml"},{"code":"# quadsolve 1.0 0.0 (-2.0) ;;\n- : quadroots = RealRoots (-1.4142135623730951, 1.4142135623730949)\n\n# quadsolve 1.0 0.0 2.0 ;;\n- : quadroots =\nComplexRoots ({Complex.re = 0.; Complex.im = 1.4142135623730951},\n {Complex.re = 0.; Complex.im = -1.4142135623730951})\n\n# quadsolve 1.0 (-1.0e5) 1.0 ;;\n- : quadroots = RealRoots (99999.99999, 1.0000000001000001e-005)\n","language":"OCaml"},{"code":"roots(a,b,c)=polrootsreal(Pol([a,b,c]))\n","language":"PARI-GP"},{"code":"roots(a,b,c)={\n b /= a;\n c /= a;\n my (delta = b^2 - 4*c, root=sqrt(delta));\n if (delta < 0,\n [root-b,-root-b]/2\n ,\n my(sol=if(b>0, -b - root,-b + root)/2);\n [sol,c/sol]\n )\n};\n","language":"PARI-GP"},{"code":"roots(1,-1e9,1)\n","language":"PARI-GP"},{"code":"Program QuadraticRoots;\n\nvar\n a, b, c, q, f: double;\n\nbegin\n a := 1;\n b := -10e9;\n c := 1;\n q := sqrt(a * c) / b;\n f := (1 + sqrt(1 - 4 * q * q)) / 2;\n\n writeln ('Version 1:');\n writeln ('x1: ', (-b * f / a):16, ', x2: ', (-c / (b * f)):16);\n\n writeln ('Version 2:');\n q := sqrt(b * b - 4 * a * c);\n if b < 0 then\n begin\n f := (-b + q) / 2 * a;\n writeln ('x1: ', f:16, ', x2: ', (c / (a * f)):16);\n end\n else\n begin\n f := (-b - q) / 2 * a;\n writeln ('x1: ', (c / (a * f)):16, ', x2: ', f:16);\n end;\nend.\n","language":"Pascal"},{"code":"use Math::Complex;\n\n($x1,$x2) = solveQuad(1,2,3);\n\nprint \"x1 = $x1, x2 = $x2\\n\";\n\nsub solveQuad\n{\n\tmy ($a,$b,$c) = @_;\n\tmy $root = sqrt($b**2 - 4*$a*$c);\n\treturn ( -$b + $root )/(2*$a), ( -$b - $root )/(2*$a);\n}\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">solve_quadratic</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">t3</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">t3</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">f</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"for a=%g,b=%g,c=%g\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">t3</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000000;\">t</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">u</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">abs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)<</span><span style=\"color: #000000;\">1e-6</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">switch</span> <span style=\"color: #7060A8;\">sign</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"single root is %g\"</span>\n <span style=\"color: #000000;\">u</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{-</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"real roots are %g and %g\"</span>\n <span style=\"color: #000000;\">f</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #7060A8;\">sqrt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">/(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">)))/</span><span style=\"color: #000000;\">2</span>\n <span style=\"color: #000000;\">u</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{-</span><span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">case</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"complex roots are %g +/- %g*i\"</span>\n <span style=\"color: #000000;\">u</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{-</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">sqrt</span><span style=\"color: #0000FF;\">(-</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">switch</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%-25s the %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">u</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">tests</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1E9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">0.5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1.4142135</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">}}</span>\n\n <span style=\"color: #7060A8;\">papply</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tests</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">solve_quadratic</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"(scl 40)\n\n(de solveQuad (A B C)\n (let SD (sqrt (- (* B B) (* 4 A C)))\n (if (lt0 B)\n (list\n (*/ (- SD B) A 2.0)\n (*/ C 2.0 (*/ A A (- SD B) `(* 1.0 1.0))) )\n (list\n (*/ C 2.0 (*/ A A (- 0 B SD) `(* 1.0 1.0)))\n (*/ (- 0 B SD) A 2.0) ) ) ) )\n\n(mapcar round\n (solveQuad 1.0 -1000000.0 1.0)\n (6 .) )\n","language":"PicoLisp"},{"code":" declare (c1, c2) float complex,\n (a, b, c, x1, x2) float;\n\n get list (a, b, c);\n if b**2 < 4*a*c then\n do;\n c1 = (-b + sqrt(b**2 - 4+0i*a*c)) / (2*a);\n c2 = (-b - sqrt(b**2 - 4+0i*a*c)) / (2*a);\n put data (c1, c2);\n end;\n else\n do;\n x1 = (-b + sqrt(b**2 - 4*a*c)) / (2*a);\n x2 = (-b - sqrt(b**2 - 4*a*c)) / (2*a);\n put data (x1, x2);\n end;\n","language":"PL-I"},{"code":"#!/usr/bin/env python3\n\nimport math\nimport cmath\nimport numpy\n\ndef quad_discriminating_roots(a,b,c, entier = 1e-5):\n \"\"\"For reference, the naive algorithm which shows complete loss of\n precision on the quadratic in question. (This function also returns a\n characterization of the roots.)\"\"\"\n discriminant = b*b - 4*a*c\n a,b,c,d =complex(a), complex(b), complex(c), complex(discriminant)\n root1 = (-b + cmath.sqrt(d))/2./a\n root2 = (-b - cmath.sqrt(d))/2./a\n if abs(discriminant) < entier:\n return \"real and equal\", abs(root1), abs(root1)\n if discriminant > 0:\n return \"real\", root1.real, root2.real\n return \"complex\", root1, root2\n\ndef middlebrook(a, b, c):\n try:\n q = math.sqrt(a*c)/b\n f = .5+ math.sqrt(1-4*q*q)/2\n except ValueError:\n q = cmath.sqrt(a*c)/b\n f = .5+ cmath.sqrt(1-4*q*q)/2\n return (-b/a)*f, -c/(b*f)\n\ndef whatevery(a, b, c):\n try:\n d = math.sqrt(b*b-4*a*c)\n except ValueError:\n d = cmath.sqrt(b*b-4*a*c)\n if b > 0:\n return div(2*c, (-b-d)), div((-b-d), 2*a)\n else:\n return div((-b+d), 2*a), div(2*c, (-b+d))\n\ndef div(n, d):\n \"\"\"Divide, with a useful interpretation of division by zero.\"\"\"\n try:\n return n/d\n except ZeroDivisionError:\n if n:\n return n*float('inf')\n return float('nan')\n\ntestcases = [\n (3, 4, 4/3), # real, equal\n (3, 2, -1), # real, unequal\n (3, 2, 1), # complex\n (1, -1e9, 1), # ill-conditioned \"quadratic in question\" required by task.\n (1, -1e100, 1),\n (1, -1e200, 1),\n (1, -1e300, 1),\n]\n\nprint('Naive:')\nfor c in testcases:\n print(\"{} {:.5} {:.5}\".format(*quad_discriminating_roots(*c)))\n\nprint('\\nMiddlebrook:')\nfor c in testcases:\n print((\"{:.5} \"*2).format(*middlebrook(*c)))\n\nprint('\\nWhat Every...')\nfor c in testcases:\n print((\"{:.5} \"*2).format(*whatevery(*c)))\n\nprint('\\nNumpy:')\nfor c in testcases:\n print((\"{:.5} \"*2).format(*numpy.roots(c)))\n","language":"Python"},{"code":"qroots <- function(a, b, c) {\n r <- sqrt(b * b - 4 * a * c + 0i)\n if (abs(b - r) > abs(b + r)) {\n z <- (-b + r) / (2 * a)\n } else {\n z <- (-b - r) / (2 * a)\n }\n c(z, c / (z * a))\n}\n\nqroots(1, 0, 2i)\n[1] -1+1i 1-1i\n\nqroots(1, -1e9, 1)\n[1] 1e+09+0i 1e-09+0i\n","language":"R"},{"code":"polyroot(c(2i, 0, 1))\n[1] -1+1i 1-1i\n\npolyroot(c(1, -1e9, 1))\n[1] 1e-09+0i 1e+09+0i\n","language":"R"},{"code":"#lang racket\n(define (quadratic a b c)\n (let* ((-b (- b))\n (delta (- (expt b 2) (* 4 a c)))\n (denominator (* 2 a)))\n (list\n (/ (+ -b (sqrt delta)) denominator)\n (/ (- -b (sqrt delta)) denominator))))\n\n;(quadratic 1 0.0000000000001 -1)\n;'(0.99999999999995 -1.00000000000005)\n;(quadratic 1 0.0000000000001 1)\n;'(-5e-014+1.0i -5e-014-1.0i)\n","language":"Racket"},{"code":"for\n[1, 2, 1],\n[1, 2, 3],\n[1, -2, 1],\n[1, 0, -4],\n[1, -10⁶, 1]\n-> @coefficients {\n printf \"Roots for %d, %d, %d\\t=> (%s, %s)\\n\",\n |@coefficients, |quadroots(@coefficients);\n}\n\nsub quadroots (*[$a, $b, $c]) {\n ( -$b + $_ ) / (2 × $a),\n ( -$b - $_ ) / (2 × $a)\n given\n ($b² - 4 × $a × $c ).Complex.sqrt.narrow\n}\n","language":"Raku"},{"code":"/*REXX program finds the roots (which may be complex) of a quadratic function. */\nparse arg a b c . /*obtain the specified arguments: A B C*/\ncall quad a,b,c /*solve quadratic function via the sub.*/\nr1= r1/1; r2= r2/1; a= a/1; b= b/1; c= c/1 /*normalize numbers to a new precision.*/\nif r1j\\=0 then r1=r1||left('+',r1j>0)(r1j/1)\"i\" /*Imaginary part? Handle complex number*/\nif r2j\\=0 then r2=r2||left('+',r2j>0)(r2j/1)\"i\" /* \" \" \" \" \" */\n say ' a =' a /*display the normalized value of A. */\n say ' b =' b /* \" \" \" \" \" B. */\n say ' c =' c /* \" \" \" \" \" C. */\n say; say 'root1 =' r1 /* \" \" \" \" 1st root*/\n say 'root2 =' r2 /* \" \" \" \" 2nd root*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nquad: parse arg aa,bb,cc; numeric digits 200 /*obtain 3 args; use enough dec. digits*/\n $= sqrt(bb**2-4*aa*cc); L= length($) /*compute SQRT (which may be complex).*/\n r= 1 /(aa+aa); ?= right($, 1)=='i' /*compute reciprocal of 2*aa; Complex?*/\n if ? then do; r1= -bb *r; r2=r1; r1j= left($,L-1)*r; r2j=-r1j; end\n else do; r1=(-bb+$)*r; r2=(-bb-$)*r; r1j= 0; r2j= 0; end\n return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nsqrt: procedure; parse arg x 1 ox; if x=0 then return 0; d= digits(); m.= 9; numeric form\n numeric digits 9; h= d+6; x=abs(x); parse value format(x,2,1,,0) 'E0' with g 'E' _ .\n g=g*.5'e'_%2; do j=0 while h>9; m.j=h; h=h%2+1; end /*j*/\n do k=j+5 to 0 by -1; numeric digits m.k; g=(g+x/g)*.5; end /*k*/\n numeric digits d; return (g/1)left('i', ox<0) /*make complex if OX<0. */\n","language":"REXX"},{"code":"/* REXX ***************************************************************\n* 26.07.2913 Walter Pachl\n**********************************************************************/\n Numeric Digits 30\n Parse Arg a b c 1 alist\n Select\n When a='' | a='?' Then\n Call exit 'rexx qgl a b c solves a*x**2+b*x+c'\n When words(alist)<>3 Then\n Call exit 'three numbers are required'\n Otherwise\n Nop\n End\n gl=a'*x**2'\n Select\n When b<0 Then gl=gl||b'*x'\n When b>0 Then gl=gl||'+'||b'*x'\n Otherwise Nop\n End\n Select\n When c<0 Then gl=gl||c\n When c>0 Then gl=gl||'+'||c\n Otherwise Nop\n End\n Say gl '= 0'\n\n d=b**2-4*a*c\n If d<0 Then Do\n dd=sqrt(-d)\n r=-b/(2*a)\n i=dd/(2*a)\n x1=r'+'i'i'\n x2=r'-'i'i'\n End\n Else Do\n dd=sqrt(d)\n x1=(-b+dd)/(2*a)\n x2=(-b-dd)/(2*a)\n End\n Say 'x1='||x1\n Say 'x2='||x2\n Exit\nsqrt:\n/* REXX ***************************************************************\n* EXEC to calculate the square root of x with high precision\n**********************************************************************/\n Parse Arg x\n prec=digits()\n prec1=2*prec\n eps=10**(-prec1)\n k = 1\n Numeric Digits prec1\n r0= x\n r = 1\n Do i=1 By 1 Until r=r0 | (abs(r*r-x)<eps)\n r0 = r\n r = (r + x/r) / 2\n k = min(prec1,2*k)\n Numeric Digits (k + 5)\n End\n Numeric Digits prec\n Return (r+0)\nexit: Say arg(1)\nExit\n","language":"REXX"},{"code":"x1 = 0\nx2 = 0\nquadratic(3, 4, 4/3.0) # [-2/3]\nsee \"x1 = \" + x1 + \" x2 = \" + x2 + nl\nquadratic(3, 2, -1) # [1/3, -1]\nsee \"x1 = \" + x1 + \" x2 = \" + x2 + nl\nquadratic(-2, 7, 15) # [-3/2, 5]\nsee \"x1 = \" + x1 + \" x2 = \" + x2 + nl\nquadratic(1, -2, 1) # [1]\nsee \"x1 = \" + x1 + \" x2 = \" + x2 + nl\n\nfunc quadratic a, b, c\n sqrtDiscriminant = sqrt(pow(b,2) - 4*a*c)\n x1 = (-b + sqrtDiscriminant) / (2.0*a)\n x2 = (-b - sqrtDiscriminant) / (2.0*a)\n return [x1, x2]\n","language":"Ring"},{"code":"require 'cmath'\n\ndef quadratic(a, b, c)\n sqrt_discriminant = CMath.sqrt(b**2 - 4*a*c)\n [(-b + sqrt_discriminant) / (2.0*a), (-b - sqrt_discriminant) / (2.0*a)]\nend\n\np quadratic(3, 4, 4/3.0) # [-2/3]\np quadratic(3, 2, -1) # [1/3, -1]\np quadratic(3, 2, 1) # [(-1/3 + sqrt(2/9)i), (-1/3 - sqrt(2/9)i)]\np quadratic(1, 0, 1) # [(0+i), (0-i)]\np quadratic(1, -1e6, 1) # [1e6, 1e-6]\np quadratic(-2, 7, 15) # [-3/2, 5]\np quadratic(1, -2, 1) # [1]\np quadratic(1, 3, 3) # [(-3 + sqrt(3)i)/2), (-3 - sqrt(3)i)/2)]\n","language":"Ruby"},{"code":"print \"FOR 1,2,3 => \";quad$(1,2,3)\nprint \"FOR 4,5,6 => \";quad$(4,5,6)\n\nFUNCTION quad$(a,b,c)\n d = b^2-4 * a*c\n x = -1*b\n if d<0 then\n quad$ = str$(x/(2*a));\" +i\";str$(sqr(abs(d))/(2*a))+\" , \"+str$(x/(2*a));\" -i\";str$(sqr(abs(d))/abs(2*a))\n else\n quad$ = str$(x/(2*a)+sqr(d)/(2*a))+\" , \"+str$(x/(2*a)-sqr(d)/(2*a))\n end if\nEND FUNCTION\n","language":"Run-BASIC"},{"code":"import ArithmeticComplex._\nobject QuadraticRoots {\n def solve(a:Double, b:Double, c:Double)={\n val d = b*b-4.0*a*c\n val aa = a+a\n\n if (d < 0.0) { // complex roots\n val re= -b/aa;\n val im = math.sqrt(-d)/aa;\n (Complex(re, im), Complex(re, -im))\n }\n else { // real roots\n val re=if (b < 0.0) (-b+math.sqrt(d))/aa else (-b -math.sqrt(d))/aa\n (re, (c/(a*re)))\n }\t\n }\n}\n","language":"Scala"},{"code":"val equations=Array(\n (1.0, 22.0, -1323.0), // two distinct real roots\n (6.0, -23.0, 20.0), // with a != 1.0\n (1.0, -1.0e9, 1.0), // with one root near zero\n (1.0, 2.0, 1.0), // one real root (double root)\n (1.0, 0.0, 1.0), // two imaginary roots\n (1.0, 1.0, 1.0) // two complex roots\n);\n\t\nequations.foreach{v =>\n val (a,b,c)=v\n println(\"a=%g b=%g c=%g\".format(a,b,c))\n val roots=solve(a, b, c)\n println(\"x1=\"+roots._1)\n if(roots._1 != roots._2) println(\"x2=\"+roots._2)\n println\n}\n","language":"Scala"},{"code":"(define (quadratic a b c)\n\t(if (= a 0)\n\t(if (= b 0) 'fail (- (/ c b)))\n\t(let ((delta (- (* b b) (* 4 a c))))\n\t(if (and (real? delta) (> delta 0))\n\t\t(let ((u (+ b (* (if (>= b 0) 1 -1) (sqrt delta)))))\n\t\t\t(list (/ u -2 a) (/ (* -2 c) u)))\n\t\t(list\n\t\t\t(/ (- (sqrt delta) b) 2 a)\n\t\t\t(/ (+ (sqrt delta) b) -2 a))))))\n\n\n; examples\n\n(quadratic 1 -1 -1)\n; (1.618033988749895 -0.6180339887498948)\n\n(quadratic 1 0 -2)\n; (-1.4142135623730951 1.414213562373095)\n\n(quadratic 1 0 2)\n; (0+1.4142135623730951i 0-1.4142135623730951i)\n\n(quadratic 1+1i 2 5)\n; (-1.0922677260818898-1.1884256155834088i 0.09226772608188982+2.1884256155834088i)\n\n(quadratic 0 4 3)\n; -3/4\n\n(quadratic 0 0 1)\n; fail\n\n(quadratic 1 2 0)\n; (-2 0)\n\n(quadratic 1 2 1)\n; (-1 -1)\n\n(quadratic 1 -1e5 1)\n; (99999.99999 1.0000000001000001e-05)\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n include \"float.s7i\";\n include \"math.s7i\";\n\nconst type: roots is new struct\n var float: x1 is 0.0;\n var float: x2 is 0.0;\n end struct;\n\nconst func roots: solve (in float: a, in float: b, in float: c) is func\n result\n var roots: solution is roots.value;\n local\n var float: sd is 0.0;\n var float: x is 0.0;\n begin\n sd := sqrt(b**2 - 4.0 * a * c);\n if b < 0.0 then\n x := (-b + sd) / 2.0 * a;\n solution.x1 := x;\n solution.x2 := c / (a * x);\n else\n x := (-b - sd) / 2.0 * a;\n solution.x1 := c / (a * x);\n solution.x2 := x;\n end if;\n end func;\n\nconst proc: main is func\n local\n var roots: r is roots.value;\n begin\n r := solve(1.0, -10.0E5, 1.0);\n writeln(\"X1 = \" <& r.x1 digits 6 <& \" X2 = \" <& r.x2 digits 6);\n end func;\n","language":"Seed7"},{"code":"var sets = [\n [1, 2, 1],\n [1, 2, 3],\n [1, -2, 1],\n [1, 0, -4],\n [1, -1e6, 1],\n ]\n\nfunc quadroots(a, b, c) {\n var root = sqrt(b**2 - 4*a*c)\n\n [(-b + root) / (2 * a),\n (-b - root) / (2 * a)]\n}\n\nsets.each { |coefficients|\n say (\"Roots for #{coefficients}\",\n \"=> (#{quadroots(coefficients...).join(', ')})\")\n}\n","language":"Sidef"},{"code":"mata\n: polyroots((-2,0,1))\n 1 2\n +-----------------------------+\n 1 | 1.41421356 -1.41421356 |\n +-----------------------------+\n\n: polyroots((2,0,1))\n 1 2\n +-------------------------------+\n 1 | -1.41421356i 1.41421356i |\n +-------------------------------+\n","language":"Stata"},{"code":"package require math::complexnumbers\nnamespace import math::complexnumbers::complex math::complexnumbers::tostring\n\nproc quadratic {a b c} {\n set discrim [expr {$b**2 - 4*$a*$c}]\n set roots [list]\n if {$discrim < 0} {\n set term1 [expr {(-1.0*$b)/(2*$a)}]\n set term2 [expr {sqrt(abs($discrim))/(2*$a)}]\n lappend roots [tostring [complex $term1 $term2]] \\\n [tostring [complex $term1 [expr {-1 * $term2}]]]\n } elseif {$discrim == 0} {\n lappend roots [expr {-1.0*$b / (2*$a)}]\n } else {\n lappend roots [expr {(-1*$b + sqrt($discrim)) / (2 * $a)}] \\\n [expr {(-1*$b - sqrt($discrim)) / (2 * $a)}]\n }\n return $roots\n}\n\nproc report_quad {a b c} {\n puts [format \"%sx**2 + %sx + %s = 0\" $a $b $c]\n foreach root [quadratic $a $b $c] {\n puts \" x = $root\"\n }\n}\n\n# examples on this page\nreport_quad 3 4 [expr {4/3.0}] ;# {-2/3}\nreport_quad 3 2 -1 ;# {1/3, -1}\nreport_quad 3 2 1 ;# {(-1/3 + sqrt(2/9)i), (-1/3 - sqrt(2/9)i)}\nreport_quad 1 0 1 ;# {(0+i), (0-i)}\nreport_quad 1 -1e6 1 ;# {1e6, 1e-6}\n# examples from http://en.wikipedia.org/wiki/Quadratic_equation\nreport_quad -2 7 15 ;# {5, -3/2}\nreport_quad 1 -2 1 ;# {1}\nreport_quad 1 3 3 ;# {(-3 - sqrt(3)i)/2), (-3 + sqrt(3)i)/2)}\n","language":"Tcl"},{"code":"solve(x^2-1E9x+1.0)\n","language":"TI-89-BASIC"},{"code":"import \"./complex\" for Complex\n\nvar quadratic = Fn.new { |a, b, c|\n var d = b*b - 4*a*c\n if (d == 0) {\n // single root\n return [[-b/(2*a)], null]\n }\n if (d > 0) {\n // two real roots\n var sr = d.sqrt\n d = (b < 0) ? sr - b : -sr - b\n return [[d/(2*a), 2*c/d], null]\n }\n // two complex roots\n var den = 1 / (2*a)\n var t1 = Complex.new(-b*den, 0)\n var t2 = Complex.new(0, (-d).sqrt * den)\n return [[], [t1+t2, t1-t2]]\n}\n\nvar test = Fn.new { |a, b, c|\n System.write(\"coefficients: %(a), %(b), %(c) -> \")\n var roots = quadratic.call(a, b, c)\n var r = roots[0]\n if (r.count == 1) {\n System.print(\"one real root: %(r[0])\")\n } else if (r.count == 2) {\n System.print(\"two real roots: %(r[0]) and %(r[1])\")\n } else {\n var i = roots[1]\n System.print(\"two complex roots: %(i[0]) and %(i[1])\")\n }\n}\n\nvar coeffs = [\n [1, -2, 1],\n [1, 0, 1],\n [1, -10, 1],\n [1, -1000, 1],\n [1, -1e9, 1]\n]\n\nfor (c in coeffs) test.call(c[0], c[1], c[2])\n","language":"Wren"},{"code":"include xpllib; \\for Print\n\nfunc real QuadRoots(A, B, C); \\Return roots of quadratic equation\nreal A, B, C;\nreal D, E, R;\n[R:= [0., 0., 0.];\nR(0):= 0.; R(1):= 0.; R(2):= 0.;\nD:= B*B - 4.*A*C;\ncase of\nD = 0.: [R(0):= -B / (2.*A); \\single root\n R(1):= R(0);\n ];\nD > 0.: [if B < 0. then \\two real roots\n E:= sqrt(D) - B\n else E:= -sqrt(D) - B;\n R(0):= E / (2.*A);\n R(1):= 2. * C / E;\n ];\nD < 0.: [R(0):= -B / (2.*A); \\real\n R(2):= sqrt(-D) /(2.*A); \\imaginary\n ]\nother []; \\D overflowed or a coefficient was NaN\nreturn R;\n];\n\nfunc Test(A, B, C);\nreal A, B, C;\nreal R;\n[Print(\"coefficients: %g, %g, %g -> \", A, B, C);\nR:= QuadRoots(A, B, C);\nif R(2) # 0. then\n Print(\"two complex roots: %g+%gi, %g-%gi\\n\", R(0), R(2), R(0), R(2))\nelse [if R(0) = R(1) then\n Print(\"one real root: %g\\n\", R(0))\n else Print(\"two real roots: %15.15g, %15.15g\\n\", R(0), R(1));\n ];\n];\n\nreal C; int I;\n[C:= [ [1., -2., 1.],\n [1., 0., 1.],\n [1., -10., 1.],\n [1., -1000., 1.],\n [1., -1e9, 1.],\n [1., -4., 6.] ];\nfor I:= 0 to 5 do\n Test(C(I,0), C(I,1), C(I,2));\n]\n","language":"XPL0"},{"code":"fcn quadratic(a,b,c){ b=b.toFloat();\n println(\"Roots of a quadratic function %s, %s, %s\".fmt(a,b,c));\n d,a2:=(b*b - 4*a*c), a+a;\n if(d>0){\n sd:=d.sqrt();\n println(\" the real roots are %s and %s\".fmt((-b + sd)/a2,(-b - sd)/a2));\n }\n else if(d==0) println(\" the single root is \",-b/a2);\n else{\n sd:=(-d).sqrt();\n println(\" the complex roots are %s and \\U00B1;%si\".fmt(-b/a2,sd/a2));\n }\n}\n","language":"Zkl"},{"code":"foreach a,b,c in (T( T(1,-2,1), T(1,-3,2), T(1,0,1), T(1,-1.0e10,1), T(1,2,3), T(2,-1,-6)) ){\n quadratic(a,b,c)\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Roots_of_a_quadratic_function\\nnote: Arithmetic operations\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Write a program to find the roots of a quadratic equation, i.e., solve the equation <math>ax^2 + bx + c = 0</math>. \\nYour program must correctly handle non-real roots, but it need not check that <math>a \\\\neq 0</math>.\\n\\nThe problem of solving a quadratic equation is a good example of how dangerous it can be to ignore the peculiarities of floating-point arithmetic. \\nThe obvious way to implement the quadratic formula suffers catastrophic loss of accuracy when one of the roots to be found is much closer to 0 than the other. \\nIn their classic textbook on numeric methods ''[http://www.pdas.com/fmm.htm Computer Methods for Mathematical Computations]'', George Forsythe, Michael Malcolm, and Cleve Moler suggest trying the naive algorithm with <math>a = 1</math>, <math>b = -10^5</math>, and <math>c = 1</math>. \\n(For double-precision floats, set <math>b = -10^9</math>.) \\nConsider the following implementation in [[Ada]]:\\n<syntaxhighlight lang=\\\"ada\\\">with Ada.Text_IO; use Ada.Text_IO;\\nwith Ada.Numerics.Elementary_Functions; use Ada.Numerics.Elementary_Functions;\\n\\nprocedure Quadratic_Equation is\\n type Roots is array (1..2) of Float;\\n function Solve (A, B, C : Float) return Roots is\\n SD : constant Float := sqrt (B**2 - 4.0 * A * C);\\n AA : constant Float := 2.0 * A;\\n begin\\n return ((- B + SD) / AA, (- B - SD) / AA);\\n end Solve;\\n\\n R : constant Roots := Solve (1.0, -10.0E5, 1.0);\\nbegin\\n Put_Line (\\\"X1 =\\\" & Float'Image (R (1)) & \\\" X2 =\\\" & Float'Image (R (2)));\\nend Quadratic_Equation;</syntaxhighlight>\\n{{out}}\\n<pre>X1 = 1.00000E+06 X2 = 0.00000E+00</pre>\\nAs we can see, the second root has lost all significant figures. The right answer is that <code>X2</code> is about <math>10^{-6}</math>. The naive method is numerically unstable.\\n\\nSuggested by Middlebrook (D-OA), a better numerical method: to define two parameters <math> q = \\\\sqrt{a c} / b </math> and <math> f = 1/2 + \\\\sqrt{1 - 4 q^2} /2 </math>\\n\\nand the two roots of the quardratic are: <math> \\\\frac{-b}{a} f </math> and <math> \\\\frac{-c}{b f} </math>\\n\\n\\n'''Task''': do it better. This means that given <math>a = 1</math>, <math>b = -10^9</math>, and <math>c = 1</math>, both of the roots your program returns should be greater than <math>10^{-11}</math>. Or, if your language can't do floating-point arithmetic any more precisely than single precision, your program should be able to handle <math>b = -10^6</math>. Either way, show what your program gives as the roots of the quadratic in question. See page 9 of \\n[https://www.validlab.com/goldberg/paper.pdf \\\"What Every Scientist Should Know About Floating-Point Arithmetic\\\"] for a possible algorithm.\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F quad_roots(a, b, c)\\n V sqd = Complex(b^2 - 4*a*c) ^ 0.5\\n R ((-b + sqd) / (2 * a),\\n (-b - sqd) / (2 * a))\\n\\nV testcases = [(3.0, 4.0, 4 / 3),\\n (3.0, 2.0, -1.0),\\n (3.0, 2.0, 1.0),\\n (1.0, -1e9, 1.0),\\n (1.0, -1e100, 1.0)]\\n\\nL(a, b, c) testcases\\n V (r1, r2) = quad_roots(a, b, c)\\n print(r1, end' ‘ ’)\\n print(r2)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\nwith Ada.Numerics.Elementary_Functions; use Ada.Numerics.Elementary_Functions;\\n\\nprocedure Quadratic_Equation is\\n type Roots is array (1..2) of Float;\\n function Solve (A, B, C : Float) return Roots is\\n SD : constant Float := sqrt (B**2 - 4.0 * A * C);\\n X : Float;\\n begin\\n if B < 0.0 then\\n X := (- B + SD) / (2.0 * A);\\n return (X, C / (A * X));\\n else\\n X := (- B - SD) / (2.0 * A);\\n return (C / (A * X), X);\\n end if;\\n end Solve;\\n\\n R : constant Roots := Solve (1.0, -10.0E5, 1.0);\\nbegin\\n Put_Line (\\\"X1 =\\\" & Float'Image (R (1)) & \\\" X2 =\\\" & Float'Image (R (2)));\\nend Quadratic_Equation;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"quadratic equation:\\nBEGIN\\n\\n MODE ROOTS = UNION([]REAL, []COMPL);\\n MODE QUADRATIC = STRUCT(REAL a,b,c);\\n\\n PROC solve = (QUADRATIC q)ROOTS:\\n BEGIN\\n REAL a = a OF q, b = b OF q, c = c OF q;\\n REAL sa = b**2 - 4*a*c;\\n IF sa >=0 THEN # handle the +ve case as REAL #\\n REAL sqrt sa = ( b<0 | sqrt(sa) | -sqrt(sa));\\n REAL r1 = (-b + sqrt sa)/(2*a),\\n r2 = (-b - sqrt sa)/(2*a);\\n []REAL((r1,r2))\\n ELSE # handle the -ve case as COMPL conjugate pairs #\\n COMPL compl sqrt sa = ( b<0 | complex sqrt(sa) | -complex sqrt(sa));\\n COMPL r1 = (-b + compl sqrt sa)/(2*a),\\n r2 = (-b - compl sqrt sa)/(2*a);\\n []COMPL (r1, r2)\\n FI\\n END # solve #;\\n\\n PROC real evaluate = (QUADRATIC q, REAL x )REAL: (a OF q*x + b OF q)*x + c OF q;\\n PROC compl evaluate = (QUADRATIC q, COMPL x)COMPL: (a OF q*x + b OF q)*x + c OF q;\\n\\n # only a very tiny difference between the 2 examples #\\n []QUADRATIC test = ((1, -10e5, 1), (1, 0, 1), (1,-3,2), (1,3,2), (4,0,4), (3,4,5));\\n\\n FORMAT real fmt = $g(-0,8)$;\\n FORMAT compl fmt = $f(real fmt)\\\"+\\\"f(real fmt)\\\"i\\\"$;\\n FORMAT quadratic fmt = $f(real fmt)\\\" x**2 + \\\"f(real fmt)\\\" x + \\\"f(real fmt)\\\" = 0\\\"$;\\n\\n FOR index TO UPB test DO\\n QUADRATIC quadratic = test[index];\\n ROOTS r = solve(quadratic);\\n\\n# Output the two different scenerios #\\n printf(($\\\"Quadratic: \\\"$, quadratic fmt, quadratic, $l$));\\n CASE r IN\\n ([]REAL r):\\n printf(($\\\"REAL x1 = \\\"$, real fmt, r[1],\\n $\\\", x2 = \\\"$, real fmt, r[2], $\\\"; \\\"$,\\n $\\\"REAL y1 = \\\"$, real fmt, real evaluate(quadratic,r[1]),\\n $\\\", y2 = \\\"$, real fmt, real evaluate(quadratic,r[2]), $\\\";\\\"ll$\\n )),\\n ([]COMPL c):\\n printf(($\\\"COMPL x1,x2 = \\\"$, real fmt, re OF c[1], $\\\"+/-\\\"$,\\n real fmt, ABS im OF c[1], $\\\"; \\\"$,\\n $\\\"COMPL y1 = \\\"$, compl fmt, compl evaluate(quadratic,c[1]),\\n $\\\", y2 = \\\"$, compl fmt, compl evaluate(quadratic,c[2]), $\\\";\\\"ll$\\n ))\\n ESAC\\n OD\\nEND # quadratic_equation #\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"MsgBox % quadratic(u,v, 1,-3,2) \\\", \\\" u \\\", \\\" v\\nMsgBox % quadratic(u,v, 1,3,2) \\\", \\\" u \\\", \\\" v\\nMsgBox % quadratic(u,v, -2,4,-2) \\\", \\\" u \\\", \\\" v\\nMsgBox % quadratic(u,v, 1,0,1) \\\", \\\" u \\\", \\\" v\\nSetFormat FloatFast, 0.15e\\nMsgBox % quadratic(u,v, 1,-1.0e8,1) \\\", \\\" u \\\", \\\" v\\n\\nquadratic(ByRef x1, ByRef x2, a,b,c) { ; -> #real roots {x1,x2} of ax²+bx+c\\n If (a = 0)\\n Return -1 ; ERROR: not quadratic\\n d := b*b - 4*a*c\\n If (d < 0) {\\n x1 := x2 := \\\"\\\"\\n Return 0\\n }\\n If (d = 0) {\\n x1 := x2 := -b/2/a\\n Return 1\\n }\\n x1 := (-b - (b<0 ? -sqrt(d) : sqrt(d)))/2/a\\n x2 := c/a/x1\\n Return 2\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \" FOR test% = 1 TO 7\\n READ a$, b$, c$\\n PRINT \\\"For a = \\\" ; a$ \\\", b = \\\" ; b$ \\\", c = \\\" ; c$ TAB(32) ;\\n PROCsolvequadratic(EVAL(a$), EVAL(b$), EVAL(c$))\\n NEXT\\n END\\n\\n DATA 1, -1E9, 1\\n DATA 1, 0, 1\\n DATA 2, -1, -6\\n DATA 1, 2, -2\\n DATA 0.5, SQR(2), 1\\n DATA 1, 3, 2\\n DATA 3, 4, 5\\n\\n DEF PROCsolvequadratic(a, b, c)\\n LOCAL d, f\\n d = b^2 - 4*a*c\\n CASE SGN(d) OF\\n WHEN 0:\\n PRINT \\\"the single root is \\\" ; -b/2/a\\n WHEN +1:\\n f = (1 + SQR(1-4*a*c/b^2))/2\\n PRINT \\\"the real roots are \\\" ; -f*b/a \\\" and \\\" ; -c/b/f\\n WHEN -1:\\n PRINT \\\"the complex roots are \\\" ; -b/2/a \\\" +/- \\\" ; SQR(-d)/2/a \\\"*i\\\"\\n ENDCASE\\n ENDPROC\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <complex.h>\\n#include <math.h>\\n\\ntypedef double complex cplx;\\n\\nvoid quad_root\\n(double a, double b, double c, cplx * ra, cplx *rb)\\n{\\n\\tdouble d, e;\\n\\tif (!a) {\\n\\t\\t*ra = b ? -c / b : 0;\\n\\t\\t*rb = 0;\\n\\t\\treturn;\\n\\t}\\n\\tif (!c) {\\n\\t\\t*ra = 0;\\n\\t\\t*rb = -b / a;\\n\\t\\treturn;\\n\\t}\\n\\n\\tb /= 2;\\n\\tif (fabs(b) > fabs(c)) {\\n\\t\\te = 1 - (a / b) * (c / b);\\n\\t\\td = sqrt(fabs(e)) * fabs(b);\\n\\t} else {\\n\\t\\te = (c > 0) ? a : -a;\\n\\t\\te = b * (b / fabs(c)) - e;\\n\\t\\td = sqrt(fabs(e)) * sqrt(fabs(c));\\n\\t}\\n\\n\\tif (e < 0) {\\n\\t\\te = fabs(d / a);\\n\\t\\td = -b / a;\\n\\t\\t*ra = d + I * e;\\n\\t\\t*rb = d - I * e;\\n\\t\\treturn;\\n\\t}\\n\\n\\td = (b >= 0) ? d : -d;\\n\\te = (d - b) / a;\\n\\td = e ? (c / e) / a : 0;\\n\\t*ra = d;\\n\\t*rb = e;\\n\\treturn;\\n}\\n\\nint main()\\n{\\n\\tcplx ra, rb;\\n\\tquad_root(1, 1e12 + 1, 1e12, &ra, &rb);\\n\\tprintf(\\\"(%g + %g i), (%g + %g i)\\\\n\\\",\\n\\t\\tcreal(ra), cimag(ra), creal(rb), cimag(rb));\\n\\n\\tquad_root(1e300, -1e307 + 1, 1e300, &ra, &rb);\\n\\tprintf(\\\"(%g + %g i), (%g + %g i)\\\\n\\\",\\n\\t\\tcreal(ra), cimag(ra), creal(rb), cimag(rb));\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <math.h>\\n#include <complex.h>\\n\\nvoid roots_quadratic_eq(double a, double b, double c, complex double *x)\\n{\\n double delta;\\n\\n delta = b*b - 4.0*a*c;\\n x[0] = (-b + csqrt(delta)) / (2.0*a);\\n x[1] = (-b - csqrt(delta)) / (2.0*a);\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"void roots_quadratic_eq2(double a, double b, double c, complex double *x)\\n{\\n b /= a;\\n c /= a;\\n double delta = b*b - 4*c;\\n if ( delta < 0 ) {\\n x[0] = -b/2 + I*sqrt(-delta)/2.0;\\n x[1] = -b/2 - I*sqrt(-delta)/2.0;\\n } else {\\n double root = sqrt(delta);\\n double sol = (b>0) ? (-b - root)/2.0 : (-b + root)/2.0;\\n x[0] = sol;\\n x[1] = c/sol;\\n }\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"int main()\\n{\\n complex double x[2];\\n\\n roots_quadratic_eq(1, -1e20, 1, x);\\n printf(\\\"x1 = (%.20le, %.20le)\\\\nx2 = (%.20le, %.20le)\\\\n\\\\n\\\",\\n\\t creal(x[0]), cimag(x[0]),\\n\\t creal(x[1]), cimag(x[1]));\\n roots_quadratic_eq2(1, -1e20, 1, x);\\n printf(\\\"x1 = (%.20le, %.20le)\\\\nx2 = (%.20le, %.20le)\\\\n\\\\n\\\",\\n\\t creal(x[0]), cimag(x[0]),\\n\\t creal(x[1]), cimag(x[1]));\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <utility>\\n#include <complex>\\n\\ntypedef std::complex<double> complex;\\n\\nstd::pair<complex, complex>\\n solve_quadratic_equation(double a, double b, double c)\\n{\\n b /= a;\\n c /= a;\\n double discriminant = b*b-4*c;\\n if (discriminant < 0)\\n return std::make_pair(complex(-b/2, std::sqrt(-discriminant)/2),\\n complex(-b/2, -std::sqrt(-discriminant)/2));\\n\\n double root = std::sqrt(discriminant);\\n double solution1 = (b > 0)? (-b - root)/2\\n : (-b + root)/2;\\n\\n return std::make_pair(solution1, c/solution1);\\n}\\n\\nint main()\\n{\\n std::pair<complex, complex> result = solve_quadratic_equation(1, -1e20, 1);\\n std::cout << result.first << \\\", \\\" << result.second << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Numerics;\\n\\nclass QuadraticRoots\\n{\\n static Tuple<Complex, Complex> Solve(double a, double b, double c)\\n {\\n var q = -(b + Math.Sign(b) * Complex.Sqrt(b * b - 4 * a * c)) / 2;\\n return Tuple.Create(q / a, c / q);\\n }\\n\\n static void Main()\\n {\\n Console.WriteLine(Solve(1, -1E20, 1));\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn quadratic\\n \\\"Compute the roots of a quadratic in the form ax^2 + bx + c = 1.\\n Returns any of nil, a float, or a vector.\\\"\\n [a b c]\\n (let [sq-d (Math/sqrt (- (* b b) (* 4 a c)))\\n f #(/ (% b sq-d) (* 2 a))]\\n (cond\\n (neg? sq-d) nil\\n (zero? sq-d) (f +)\\n (pos? sq-d) [(f +) (f -)]\\n :else nil))) ; maybe our number ended up as NaN\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"user=> (quadratic 1.0 1.0 1.0)\\nnil\\nuser=> (quadratic 1.0 2.0 1.0)\\n1.0\\nuser=> (quadratic 1.0 3.0 1.0)\\n[2.618033988749895 0.3819660112501051]\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defun quadratic (a b c)\\n (list\\n (/ (+ (- b) (sqrt (- (expt b 2) (* 4 a c)))) (* 2 a))\\n (/ (- (- b) (sqrt (- (expt b 2) (* 4 a c)))) (* 2 a))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.math, std.traits;\\n\\nCommonType!(T1, T2, T3)[] naiveQR(T1, T2, T3)\\n (in T1 a, in T2 b, in T3 c)\\npure nothrow if (isFloatingPoint!T1) {\\n alias ReturnT = typeof(typeof(return).init[0]);\\n if (a == 0)\\n return [ReturnT(c / b)]; // It's a linear function.\\n immutable ReturnT det = b ^^ 2 - 4 * a * c;\\n if (det < 0)\\n return []; // No real number root.\\n immutable SD = sqrt(det);\\n return [(-b + SD) / 2 * a, (-b - SD) / 2 * a];\\n}\\n\\nCommonType!(T1, T2, T3)[] cautiQR(T1, T2, T3)\\n (in T1 a, in T2 b, in T3 c)\\npure nothrow if (isFloatingPoint!T1) {\\n alias ReturnT = typeof(typeof(return).init[0]);\\n if (a == 0)\\n return [ReturnT(c / b)]; // It's a linear function.\\n immutable ReturnT det = b ^^ 2 - 4 * a * c;\\n if (det < 0)\\n return []; // No real number root.\\n immutable SD = sqrt(det);\\n\\n if (b * a < 0) {\\n immutable x = (-b + SD) / 2 * a;\\n return [x, c / (a * x)];\\n } else {\\n immutable x = (-b - SD) / 2 * a;\\n return [c / (a * x), x];\\n }\\n}\\n\\nvoid main() {\\n import std.stdio;\\n writeln(\\\"With 32 bit float type:\\\");\\n writefln(\\\" Naive: [%(%g, %)]\\\", naiveQR(1.0f, -10e5f, 1.0f));\\n writefln(\\\"Cautious: [%(%g, %)]\\\", cautiQR(1.0f, -10e5f, 1.0f));\\n writeln(\\\"\\\\nWith 64 bit double type:\\\");\\n writefln(\\\" Naive: [%(%g, %)]\\\", naiveQR(1.0, -10e5, 1.0));\\n writefln(\\\"Cautious: [%(%g, %)]\\\", cautiQR(1.0, -10e5, 1.0));\\n writeln(\\\"\\\\nWith real type:\\\");\\n writefln(\\\" Naive: [%(%g, %)]\\\", naiveQR(1.0L, -10e5L, 1.0L));\\n writefln(\\\"Cautious: [%(%g, %)]\\\", cautiQR(1.0L, -10e5L, 1.0L));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"defmodule Quadratic do\\n def roots(a, b, c) do\\n IO.puts \\\"Roots of a quadratic function (#{a}, #{b}, #{c})\\\"\\n d = b * b - 4 * a * c\\n a2 = a * 2\\n cond do\\n d > 0 ->\\n sd = :math.sqrt(d)\\n IO.puts \\\" the real roots are #{(- b + sd) / a2} and #{(- b - sd) / a2}\\\"\\n d == 0 ->\\n IO.puts \\\" the single root is #{- b / a2}\\\"\\n true ->\\n sd = :math.sqrt(-d)\\n IO.puts \\\" the complex roots are #{- b / a2} +/- #{sd / a2}*i\\\"\\n end\\n end\\nend\\n\\nQuadratic.roots(1, -2, 1)\\nQuadratic.roots(1, -3, 2)\\nQuadratic.roots(1, 0, 1)\\nQuadratic.roots(1, -1.0e10, 1)\\nQuadratic.roots(1, 2, 3)\\nQuadratic.roots(2, -1, -6)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"PROGRAM QUADRATIC\\n\\nPROCEDURE SOLVE_QUADRATIC\\n D=B*B-4*A*C\\n IF ABS(D)<1D-6 THEN D=0 END IF\\n CASE SGN(D) OF\\n 0->\\n PRINT(\\\"the single root is \\\";-B/2/A)\\n END ->\\n 1->\\n F=(1+SQR(1-4*A*C/(B*B)))/2\\n PRINT(\\\"the real roots are \\\";-F*B/A;\\\"and \\\";-C/B/F)\\n END ->\\n -1->\\n PRINT(\\\"the complex roots are \\\";-B/2/A;\\\"+/-\\\";SQR(-D)/2/A;\\\"*i\\\")\\n END ->\\n END CASE\\nEND PROCEDURE\\n\\nBEGIN\\n PRINT(CHR$(12);) ! CLS\\n FOR TEST%=1 TO 7 DO\\n READ(A,B,C)\\n PRINT(\\\"For a=\\\";A;\\\",b=\\\";B;\\\",c=\\\";C;TAB(32);)\\n SOLVE_QUADRATIC\\n END FOR\\n DATA(1,-1E9,1)\\n DATA(1,0,1)\\n DATA(2,-1,-6)\\n DATA(1,2,-2)\\n DATA(0.5,1.4142135,1)\\n DATA(1,3,2)\\n DATA(3,4,5)\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \":: quadratic-equation ( a b c -- x1 x2 )\\n b sq a c * 4 * - sqrt :> sd\\n b 0 <\\n [ b neg sd + a 2 * / ]\\n [ b neg sd - a 2 * / ] if :> x\\n x c a x * / ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"( scratchpad ) 1 -1.e20 1 quadratic-equation\\n--- Data stack:\\n1.0e+20\\n9.999999999999999e-21\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \":: quadratic-equation2 ( a b c -- x1 x2 )\\n a c * sqrt b / :> q\\n 1 4 q sq * - sqrt 0.5 * 0.5 + :> f\\n b neg a / f * c neg b / f / ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"( scratchpad ) 1 -1.e20 1 quadratic-equation\\n--- Data stack:\\n1.0e+20\\n1.0e-20\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": quadratic ( fa fb fc -- r1 r2 )\\n frot frot\\n ( c a b )\\n fover 3 fpick f* -4e f* fover fdup f* f+\\n ( c a b det )\\n fdup f0< if abort\\\" imaginary roots\\\" then\\n fsqrt\\n fover f0< if fnegate then\\n f+ fnegate\\n ( c a b-det )\\n 2e f/ fover f/\\n ( c a r1 )\\n frot frot f/ fover f/ ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": quadratic { F: a F: b F: c -- r1 r2 }\\n b b f* 4e a f* c f* f-\\n fdup f0< if abort\\\" imaginary roots\\\" then\\n fsqrt\\n b f0< if fnegate then b f+ fnegate 2e f/ a f/\\n c a f/ fover f/ ;\\n\\n\\\\ test\\n1 set-precision\\n1e -1e6 1e quadratic fs. fs. \\\\ 1e-6 1e6\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"PROGRAM QUADRATIC\\n\\n IMPLICIT NONE\\n INTEGER, PARAMETER :: dp = SELECTED_REAL_KIND(15)\\n REAL(dp) :: a, b, c, e, discriminant, rroot1, rroot2\\n COMPLEX(dp) :: croot1, croot2\\n\\n WRITE(*,*) \\\"Enter the coefficients of the equation ax^2 + bx + c\\\"\\n WRITE(*, \\\"(A)\\\", ADVANCE=\\\"NO\\\") \\\"a = \\\"\\n READ *, a\\n WRITE(*,\\\"(A)\\\", ADVANCE=\\\"NO\\\") \\\"b = \\\"\\n READ *, b\\n WRITE(*,\\\"(A)\\\", ADVANCE=\\\"NO\\\") \\\"c = \\\"\\n READ *, c\\n\\n WRITE(*,\\\"(3(A,E23.15))\\\") \\\"Coefficients are: a = \\\", a, \\\" b = \\\", b, \\\" c = \\\", c\\n e = 1.0e-9_dp\\n discriminant = b*b - 4.0_dp*a*c\\n\\n IF (ABS(discriminant) < e) THEN\\n rroot1 = -b / (2.0_dp * a)\\n WRITE(*,*) \\\"The roots are real and equal:\\\"\\n WRITE(*,\\\"(A,E23.15)\\\") \\\"Root = \\\", rroot1\\n ELSE IF (discriminant > 0) THEN\\n rroot1 = -(b + SIGN(SQRT(discriminant), b)) / (2.0_dp * a)\\n rroot2 = c / (a * rroot1)\\n WRITE(*,*) \\\"The roots are real:\\\"\\n WRITE(*,\\\"(2(A,E23.15))\\\") \\\"Root1 = \\\", rroot1, \\\" Root2 = \\\", rroot2\\n ELSE\\n croot1 = (-b + SQRT(CMPLX(discriminant))) / (2.0_dp*a)\\n croot2 = CONJG(croot1)\\n WRITE(*,*) \\\"The roots are complex:\\\"\\n WRITE(*,\\\"(2(A,2E23.15,A))\\\") \\\"Root1 = \\\", croot1, \\\"j \\\", \\\" Root2 = \\\", croot2, \\\"j\\\"\\n END IF\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"COMPUTE ROOTS OF A QUADRATIC FUNCTION - 1956\\n READ 100,A,B,C\\n 100 FORMAT(3F8.3)\\n PRINT 100,A,B,C\\n DISC=B**2-4.*A*C\\n IF(DISC),1,2,3\\n 1 XR=-B/(2.*A)\\n XI=SQRT(-DISC)/(2.*A)\\n XJ=-XI\\n PRINT 311\\n PRINT 312,XR,XI,XR,XJ\\n 311 FORMAT(13HCOMPLEX ROOTS)\\n 312 FORMAT(4HX1=(,2E12.4,6H),X2=(,2E12.4,1H))\\n GO TO 999\\n 2 X1=-B/(2.*A)\\n X2=X1\\n PRINT 321\\n PRINT 332,X1,X2\\n 321 FORMAT(16HEQUAL REAL ROOTS)\\n GO TO 999\\n 3 X1= (-B+SQRT(DISC)) / (2.*A)\\n X2= (-B-SQRT(DISC)) / (2.*A)\\n PRINT 331\\n PRINT 332,X1,X2\\n 331 FORMAT(10HREAL ROOTS)\\n 332 FORMAT(3HX1=,E12.5,4H,X2=,E12.5)\\n 999 STOP\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' version 20-12-2020\\n' compile with: fbc -s console\\n\\n#Include Once \\\"gmp.bi\\\"\\n\\nSub solvequadratic_n(a As Double ,b As Double, c As Double)\\n\\n Dim As Double f, d = b ^ 2 - 4 * a * c\\n\\n Select Case Sgn(d)\\n Case 0\\n Print \\\"1: the single root is \\\"; -b / 2 / a\\n Case 1\\n Print \\\"1: the real roots are \\\"; (-b + Sqr(d)) / 2 * a; \\\" and \\\";(-b - Sqr(d)) / 2 * a\\n Case -1\\n Print \\\"1: the complex roots are \\\"; -b / 2 / a; \\\" +/- \\\"; Sqr(-d) / 2 / a; \\\"*i\\\"\\n End Select\\n\\nEnd Sub\\n\\nSub solvequadratic_c(a As Double ,b As Double, c As Double)\\n\\n Dim As Double f, d = b ^ 2 - 4 * a * c\\n Select Case Sgn(d)\\n Case 0\\n Print \\\"2: the single root is \\\"; -b / 2 / a\\n Case 1\\n f = (1 + Sqr(1 - 4 * a *c / b ^ 2)) / 2\\n Print \\\"2: the real roots are \\\"; -f * b / a; \\\" and \\\"; -c / b / f\\n Case -1\\n Print \\\"2: the complex roots are \\\"; -b / 2 / a; \\\" +/- \\\"; Sqr(-d) / 2 / a; \\\"*i\\\"\\n End Select\\nEnd Sub\\n\\nSub solvequadratic_gmp(a_ As Double ,b_ As Double, c_ As Double)\\n\\n #Define PRECISION 1024 ' about 300 digits\\n #Define MAX 25\\n\\n Dim As ZString Ptr text\\n text = Callocate (1000)\\n Mpf_set_default_prec(PRECISION)\\n\\n Dim As Mpf_ptr a, b, c, d, t\\n a = Allocate(Len(__mpf_struct)) : Mpf_init_set_d(a, a_)\\n b = Allocate(Len(__mpf_struct)) : Mpf_init_set_d(b, b_)\\n c = Allocate(Len(__mpf_struct)) : Mpf_init_set_d(c, c_)\\n d = Allocate(Len(__mpf_struct)) : Mpf_init(d)\\n t = Allocate(Len(__mpf_struct)) : Mpf_init(t)\\n\\n mpf_mul(d, b, b)\\n mpf_set_ui(t, 4)\\n mpf_mul(t, t, a)\\n mpf_mul(t, t, c)\\n mpf_sub(d, d, t)\\n\\n Select Case mpf_sgn(d)\\n Case 0\\n mpf_neg(t, b)\\n mpf_div_ui(t, t, 2)\\n mpf_div(t, t, a)\\n Gmp_sprintf(text,\\\"%.*Fe\\\", MAX, t)\\n Print \\\"3: the single root is \\\"; *text\\n Case Is > 0\\n mpf_sqrt(d, d)\\n mpf_add(a, a, a)\\n mpf_neg(t, b)\\n mpf_add(t, t, d)\\n mpf_div(t, t, a)\\n Gmp_sprintf(text,\\\"%.*Fe\\\", MAX, t)\\n Print \\\"3: the real roots are \\\"; *text; \\\" and \\\";\\n mpf_neg(t, b)\\n mpf_sub(t, t, d)\\n mpf_div(t, t, a)\\n Gmp_sprintf(text,\\\"%.*Fe\\\", MAX, t)\\n Print *text\\n Case Is < 0\\n mpf_neg(t, b)\\n mpf_div_ui(t, t, 2)\\n mpf_div(t, t, a)\\n Gmp_sprintf(text,\\\"%.*Fe\\\", MAX, t)\\n Print \\\"3: the complex roots are \\\"; *text; \\\" +/- \\\";\\n mpf_neg(t, d)\\n mpf_sqrt(t, t)\\n mpf_div_ui(t, t, 2)\\n mpf_div(t, t, a)\\n Gmp_sprintf(text,\\\"%.*Fe\\\", MAX, t)\\n Print *text; \\\"*i\\\"\\n End Select\\n\\nEnd Sub\\n\\n' ------=< MAIN >=------\\n\\nDim As Double a, b, c\\nPrint \\\"1: is the naieve way\\\"\\nPrint \\\"2: is the cautious way\\\"\\nPrint \\\"3: is the naieve way with help of GMP\\\"\\nPrint\\n\\nFor i As Integer = 1 To 10\\n Read a, b, c\\n Print \\\"Find root(s) for \\\"; Str(a); \\\"X^2\\\"; IIf(b < 0, \\\"\\\", \\\"+\\\");\\n Print Str(b); \\\"X\\\"; IIf(c < 0, \\\"\\\", \\\"+\\\"); Str(c)\\n solvequadratic_n(a, b , c)\\n solvequadratic_c(a, b , c)\\n solvequadratic_gmp(a, b , c)\\n Print\\nNext\\n\\n' empty keyboard buffer\\nWhile Inkey <> \\\"\\\" : Wend\\nPrint : Print \\\"hit any key to end program\\\"\\nSleep\\nEnd\\n\\nData 1, -1E9, 1\\nData 1, 0, 1\\nData 2, -1, -6\\nData 1, 2, -2\\nData 0.5, 1.4142135623731, 1\\nData 1, 3, 2\\nData 3, 4, 5\\nData 1, -1e100, 1\\nData 1, -1e200, 1\\nData 1, -1e300, 1\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"QuadraticRoots := function(a, b, c)\\n local d;\\n d := Sqrt(b*b - 4*a*c);\\n return [ (-b+d)/(2*a), (-b-d)/(2*a) ];\\nend;\\n\\n# Hint : E(12) is a 12th primitive root of 1\\nQuadraticRoots(2, 2, -1);\\n# [ 1/2*E(12)^4-1/2*E(12)^7+1/2*E(12)^8+1/2*E(12)^11,\\n# 1/2*E(12)^4+1/2*E(12)^7+1/2*E(12)^8-1/2*E(12)^11 ]\\n\\n# This works also with floating-point numbers\\nQuadraticRoots(2.0, 2.0, -1.0);\\n# [ 0.366025, -1.36603 ]\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n)\\n\\nfunc qr(a, b, c float64) ([]float64, []complex128) {\\n d := b*b-4*a*c\\n switch {\\n case d == 0:\\n // single root\\n return []float64{-b/(2*a)}, nil\\n case d > 0:\\n // two real roots\\n if b < 0 {\\n d = math.Sqrt(d)-b\\n } else {\\n d = -math.Sqrt(d)-b\\n }\\n return []float64{d/(2*a), (2*c)/d}, nil\\n case d < 0:\\n // two complex roots\\n\\n den := 1/(2*a)\\n t1 := complex(-b*den, 0)\\n t2 := complex(0, math.Sqrt(-d)*den)\\n return nil, []complex128{t1+t2, t1-t2}\\n }\\n // otherwise d overflowed or a coefficient was NAN\\n return []float64{d}, nil\\n}\\n\\nfunc test(a, b, c float64) {\\n fmt.Print(\\\"coefficients: \\\", a, b, c, \\\" -> \\\")\\n r, i := qr(a, b, c)\\n switch len(r) {\\n case 1:\\n fmt.Println(\\\"one real root:\\\", r[0])\\n case 2:\\n fmt.Println(\\\"two real roots:\\\", r[0], r[1])\\n default:\\n fmt.Println(\\\"two complex roots:\\\", i[0], i[1])\\n }\\n}\\n\\nfunc main() {\\n for _, c := range [][3]float64{\\n {1, -2, 1},\\n {1, 0, 1},\\n {1, -10, 1},\\n {1, -1000, 1},\\n {1, -1e9, 1},\\n } {\\n test(c[0], c[1], c[2])\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.Complex (Complex, realPart)\\n\\ntype CD = Complex Double\\n\\nquadraticRoots :: (CD, CD, CD) -> (CD, CD)\\nquadraticRoots (a, b, c)\\n | 0 < realPart b =\\n ( (2 * c) / (- b - d),\\n (- b - d) / (2 * a)\\n )\\n | otherwise =\\n ( (- b + d) / (2 * a),\\n (2 * c) / (- b + d)\\n )\\n where\\n d = sqrt $ b ^ 2 - 4 * a * c\\n\\nmain :: IO ()\\nmain =\\n mapM_\\n (print . quadraticRoots)\\n [ (3, 4, 4 / 3),\\n (3, 2, -1),\\n (3, 2, 1),\\n (1, -10e5, 1),\\n (1, -10e9, 1)\\n ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\n solve(1.0, -10.0e5, 1.0)\\nend\\n\\nprocedure solve(a,b,c)\\n d := sqrt(b*b - 4.0*a*c)\\n roots := if b < 0 then [r1 := (-b+d)/(2.0*a), c/(a*r1)]\\n else [r1 := (-b-d)/(2.0*a), c/(a*r1)]\\n write(a,\\\"*x^2 + \\\",b,\\\"*x + \\\",c,\\\" has roots \\\",roots[1],\\\" and \\\",roots[2])\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"compile_OPT IDL2\\n\\nprint, \\\"input a, press enter, input b, press enter, input c, press enter\\\"\\nread,a,b,c\\nPromt='Enter values of a,b,c and hit enter'\\n\\na0=0.0\\nb0=0.0\\nc0=0.0 ;make them floating point variables\\n\\nx=-b+sqrt((b^2)-4*a*c)\\ny=-b-sqrt((b^2)-4*a*c)\\nz=2*a\\nd= x/z\\ne= y/z\\n\\nprint, d,e\\n\",\n \"language\": \"IDL\"\n },\n {\n \"code\": \"100 PROGRAM \\\"Quadratic.bas\\\"\\n110 PRINT \\\"Enter coefficients a, b and c:\\\":INPUT PROMPT \\\"a= ,b= ,c= \\\":A,B,C\\n120 IF A=0 THEN\\n130 PRINT \\\"The coefficient of x^2 can not be 0.\\\"\\n140 ELSE\\n150 LET D=B^2-4*A*C\\n160 SELECT CASE SGN(D)\\n170 CASE 0\\n180 PRINT \\\"The single root is \\\";-B/2/A\\n190 CASE 1\\n200 PRINT \\\"The real roots are \\\";(-B+SQR(D))/(2*A);\\\"and \\\";(-B-SQR(D))/(2*A)\\n210 CASE -1\\n220 PRINT \\\"The complex roots are \\\";-B/2/A;\\\"+/- \\\";STR$(SQR(-D)/2/A);\\\"*i\\\"\\n230 END SELECT\\n240 END IF\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \" coeff =. _3 |.\\\\ 3 4 4r3 3 2 _1 3 2 1 1 _1e6 1 1 _1e9 1\\n > {:\\\"1 p. coeff\\n _0.666667 _0.666667\\n _1 0.333333\\n_0.333333j0.471405 _0.333333j_0.471405\\n 1e6 1e_6\\n 1e9 1e_9\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" p. 0 16 _12 2 NB. return multiplier ; roots\\n+-+-----+\\n|2|4 2 0|\\n+-+-----+\\n p. 2 ; 4 2 0 NB. return coefficients\\n0 16 _12 2\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 1{::p. 1 _1e5 1 NB. display roots\\n100000 1e_5\\n 1 _1e5 1 p. 1{::p. 1 _1e5 1 NB. test roots\\n_3.38436e_7 0\\n 1 _1e5 1 p. 1e5 1e_5 NB. test displayed roots\\n1 9.99999e_11\\n 1e5 1e_5 - 1{::p. 1 _1e5 1 NB. find difference\\n1e_5 _1e_15\\n 1 _1e5 1 p. 1e5 1e_5-1e_5 _1e_15 NB. test displayed roots with adjustment\\n_3.38436e_7 0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"q_r=: verb define\\n 'a b c' =. y\\n q=. b %~ %: a * c\\n f=. 0.5 + 0.5 * %:(1-4*q*q)\\n (-b*f%a),(-c%b*f)\\n)\\n\\n q_r 1 _1e6 1\\n1e6 1e_6\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class QuadraticRoots {\\n private static class Complex {\\n double re, im;\\n\\n public Complex(double re, double im) {\\n this.re = re;\\n this.im = im;\\n }\\n\\n @Override\\n public boolean equals(Object obj) {\\n if (obj == this) {return true;}\\n if (!(obj instanceof Complex)) {return false;}\\n Complex other = (Complex) obj;\\n return (re == other.re) && (im == other.im);\\n }\\n\\n @Override\\n public String toString() {\\n if (im == 0.0) {return String.format(\\\"%g\\\", re);}\\n if (re == 0.0) {return String.format(\\\"%gi\\\", im);}\\n return String.format(\\\"%g %c %gi\\\", re,\\n (im < 0.0 ? '-' : '+'), Math.abs(im));\\n }\\n }\\n\\n private static Complex[] quadraticRoots(double a, double b, double c) {\\n Complex[] roots = new Complex[2];\\n double d = b * b - 4.0 * a * c; // discriminant\\n double aa = a + a;\\n\\n if (d < 0.0) {\\n double re = -b / aa;\\n double im = Math.sqrt(-d) / aa;\\n roots[0] = new Complex(re, im);\\n roots[1] = new Complex(re, -im);\\n } else if (b < 0.0) {\\n // Avoid calculating -b - Math.sqrt(d), to avoid any\\n // subtractive cancellation when it is near zero.\\n double re = (-b + Math.sqrt(d)) / aa;\\n roots[0] = new Complex(re, 0.0);\\n roots[1] = new Complex(c / (a * re), 0.0);\\n } else {\\n // Avoid calculating -b + Math.sqrt(d).\\n double re = (-b - Math.sqrt(d)) / aa;\\n roots[1] = new Complex(re, 0.0);\\n roots[0] = new Complex(c / (a * re), 0.0);\\n }\\n return roots;\\n }\\n\\n public static void main(String[] args) {\\n double[][] equations = {\\n {1.0, 22.0, -1323.0}, // two distinct real roots\\n {6.0, -23.0, 20.0}, // with a != 1.0\\n {1.0, -1.0e9, 1.0}, // with one root near zero\\n {1.0, 2.0, 1.0}, // one real root (double root)\\n {1.0, 0.0, 1.0}, // two imaginary roots\\n {1.0, 1.0, 1.0} // two complex roots\\n };\\n for (int i = 0; i < equations.length; i++) {\\n Complex[] roots = quadraticRoots(\\n equations[i][0], equations[i][1], equations[i][2]);\\n System.out.format(\\\"%na = %g b = %g c = %g%n\\\",\\n equations[i][0], equations[i][1], equations[i][2]);\\n if (roots[0].equals(roots[1])) {\\n System.out.format(\\\"X1,2 = %s%n\\\", roots[0]);\\n } else {\\n System.out.format(\\\"X1 = %s%n\\\", roots[0]);\\n System.out.format(\\\"X2 = %s%n\\\", roots[1]);\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# Complex numbers as points [x,y] in the Cartesian plane\\ndef real(z): if (z|type) == \\\"number\\\" then z else z[0] end;\\n\\ndef imag(z): if (z|type) == \\\"number\\\" then 0 else z[1] end;\\n\\ndef plus(x; y):\\n if (x|type) == \\\"number\\\" then\\n if (y|type) == \\\"number\\\" then [ x+y, 0 ]\\n else [ x + y[0], y[1]]\\n end\\n elif (y|type) == \\\"number\\\" then plus(y;x)\\n else [ x[0] + y[0], x[1] + y[1] ]\\n end;\\n\\ndef multiply(x; y):\\n if (x|type) == \\\"number\\\" then\\n if (y|type) == \\\"number\\\" then [ x*y, 0 ]\\n else [x * y[0], x * y[1]]\\n end\\n elif (y|type) == \\\"number\\\" then multiply(y;x)\\n else [ x[0] * y[0] - x[1] * y[1], x[0] * y[1] + x[1] * y[0]]\\n end;\\n\\ndef negate(x): multiply(-1; x);\\n\\ndef minus(x; y): plus(x; multiply(-1; y));\\n\\ndef conjugate(z):\\n if (z|type) == \\\"number\\\" then [z, 0]\\n else [z[0], -(z[1]) ]\\n end;\\n\\ndef invert(z):\\n if (z|type) == \\\"number\\\" then [1/z, 0]\\n else\\n ( (z[0] * z[0]) + (z[1] * z[1]) ) as $d\\n # use \\\"0 + .\\\" to convert -0 back to 0\\n | [ z[0]/$d, (0 + -(z[1]) / $d)]\\n end;\\n\\ndef divide(x;y): multiply(x; invert(y));\\n\\ndef magnitude(z):\\n real( multiply(z; conjugate(z))) | sqrt;\\n\\n# exp^z\\ndef complex_exp(z):\\n def expi(x): [ (x|cos), (x|sin) ];\\n if (z|type) == \\\"number\\\" then z|exp\\n elif z[0] == 0 then expi(z[1]) # for efficiency\\n else multiply( (z[0]|exp); expi(z[1]) )\\n end ;\\n\\ndef complex_sqrt(z):\\n if imag(z) == 0 and real(z) >= 0 then [(real(z)|sqrt), 0]\\n else\\n magnitude(z) as $r\\n | if $r == 0 then [0,0]\\n else\\n (real(z)/$r) as $a\\n | (imag(z)/$r) as $b\\n | $r | sqrt as $r\\n | (($a | acos) / 2)\\n | [ ($r * cos), ($r * sin)]\\n end\\n end ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# If there are infinitely many solutions, emit true;\\n# if none, emit empty;\\n# otherwise always emit two.\\n# For numerical accuracy, Middlebrook's approach is adopted:\\ndef quadratic_roots(a; b; c):\\n if a == 0 and b == 0 then\\n if c == 0 then true # infinitely many\\n else empty # none\\n end\\n elif a == 0 then [-c/b, 0]\\n elif b == 0 then (complex_sqrt(1/a) | (., negate(.)))\\n else\\n divide( plus(1.0; complex_sqrt( minus(1.0; (4 * a * c / (b*b))))); 2) as $f\\n | negate(divide(multiply(b; $f); a)),\\n negate(divide(c; multiply(b; $f)))\\n end\\n;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def example:\\n def pow(i): . as $in | reduce range(0;i) as $i (1; . * $in);\\n def poly(a;b;c): plus( plus( multiply(a; multiply(.;.)); multiply(b;.)); c);\\n def abs: if . < 0 then -. else . end;\\n def zero(z):\\n if z == 0 then 0\\n else (magnitude(z)|abs) as $zero\\n | if $zero < 1e-10 then \\\"+0\\\" else $zero end\\n end;\\n def lpad(n): tostring | (n - length) * \\\" \\\" + .;\\n\\n range(0; 13) as $i\\n | (- (10|pow($i))) as $b\\n | quadratic_roots(1; $b; 1) as $x\\n | $x | poly(1; $b; 1) as $zero\\n | \\\"\\\\($i|lpad(4)): error = \\\\(zero($zero)|lpad(18)) x=\\\\($x)\\\"\\n;\\n\\nexample\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ jq -M -r -n -f Roots_of_a_quadratic_function.jq\\n 0: error = +0 x=[0.5,0.8660254037844386]\\n 0: error = +0 x=[0.5000000000000001,-0.8660254037844387]\\n 1: error = +0 x=[9.898979485566356,0]\\n 1: error = +0 x=[0.10102051443364382,-0]\\n 2: error = +0 x=[99.98999899979995,0]\\n 2: error = +0 x=[0.010001000200050014,-0]\\n 3: error = 1.1641532182693481e-10 x=[999.998999999,0]\\n 3: error = +0 x=[0.0010000010000019998,-0]\\n 4: error = +0 x=[9999.999899999999,0]\\n 4: error = +0 x=[0.00010000000100000003,-0]\\n 5: error = +0 x=[99999.99999,0]\\n 5: error = +0 x=[1.0000000001e-05,-0]\\n 6: error = 0.0001220703125 x=[999999.9999989999,0]\\n 6: error = +0 x=[1.000000000001e-06,-0]\\n 7: error = 0.015625 x=[9999999.9999999,0]\\n 7: error = +0 x=[1.0000000000000101e-07,-0]\\n 8: error = 1 x=[99999999.99999999,0]\\n 8: error = +0 x=[1e-08,-0]\\n 9: error = 1 x=[1000000000,0]\\n 9: error = +0 x=[1e-09,-0]\\n 10: error = 1 x=[10000000000,0]\\n 10: error = +0 x=[1e-10,-0]\\n 11: error = 1 x=[100000000000,0]\\n 11: error = +0 x=[1e-11,-0]\\n 12: error = 1 x=[1000000000000,0]\\n 12: error = +0 x=[1e-12,-0]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Printf\\n\\nfunction quadroots(x::Real, y::Real, z::Real)\\n a, b, c = promote(float(x), y, z)\\n if a ≈ 0.0 return [-c / b] end\\n Δ = b ^ 2 - 4a * c\\n if Δ ≈ 0.0 return [-sqrt(c / a)] end\\n if Δ < 0.0 Δ = complex(Δ) end\\n d = sqrt(Δ)\\n if b < 0.0\\n d -= b\\n return [d / 2a, 2c / d]\\n else\\n d = -d - b\\n return [2c / d, d / 2a]\\n end\\nend\\n\\na = [1, 1, 1.0, 10]\\nb = [10, 2, -10.0 ^ 9, 1]\\nc = [1, 1, 1, 1]\\n\\nfor (x, y, z) in zip(a, b, c)\\n @printf \\\"The roots of %.2fx² + %.2fx + %.2f\\\\n\\\\tx₀ = (%s)\\\\n\\\" x y z join(round.(quadroots(x, y, z), 2), \\\", \\\")\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \" / naive method\\n / sqr[x] and sqrt[x] must be provided\\n quf:{[a;b;c]; s:sqrt[sqr[b]-4*a*c];(-b+s;-b-s)%2*a}\\n\\n quf[0.5;-2.5;2]\\n1.0 4.0\\n quf[1;8;15]\\n-5.0 -3.0\\n quf[1;10;1]\\n-9.898979485566356 -0.10102051443364424\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"import java.lang.Math.*\\n\\ndata class Equation(val a: Double, val b: Double, val c: Double) {\\n data class Complex(val r: Double, val i: Double) {\\n override fun toString() = when {\\n i == 0.0 -> r.toString()\\n r == 0.0 -> \\\"${i}i\\\"\\n else -> \\\"$r + ${i}i\\\"\\n }\\n }\\n\\n data class Solution(val x1: Any, val x2: Any) {\\n override fun toString() = when(x1) {\\n x2 -> \\\"X1,2 = $x1\\\"\\n else -> \\\"X1 = $x1, X2 = $x2\\\"\\n }\\n }\\n\\n val quadraticRoots by lazy {\\n val _2a = a + a\\n val d = b * b - 4.0 * a * c // discriminant\\n if (d < 0.0) {\\n val r = -b / _2a\\n val i = sqrt(-d) / _2a\\n Solution(Complex(r, i), Complex(r, -i))\\n } else {\\n // avoid calculating -b +/- sqrt(d), to avoid any\\n // subtractive cancellation when it is near zero.\\n val r = if (b < 0.0) (-b + sqrt(d)) / _2a else (-b - sqrt(d)) / _2a\\n Solution(r, c / (a * r))\\n }\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val equations = listOf(Equation(1.0, 22.0, -1323.0), // two distinct real roots\\n Equation(6.0, -23.0, 20.0), // with a != 1.0\\n Equation(1.0, -1.0e9, 1.0), // with one root near zero\\n Equation(1.0, 2.0, 1.0), // one real root (double root)\\n Equation(1.0, 0.0, 1.0), // two imaginary roots\\n Equation(1.0, 1.0, 1.0)) // two complex roots\\n\\n equations.forEach { println(\\\"$it\\\\n\\\" + it.quadraticRoots) }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"1) using lambdas:\\n\\n{def equation\\n {lambda {:a :b :c}\\n {b equation :a*x{sup 2}+:b*x+:c=0}\\n {{lambda {:a' :b' :d}\\n {if {> :d 0}\\n then {{lambda {:b' :d'}\\n {equation.disp {+ :b' :d'} {- :b' :d'} 2 real roots}\\n } :b' {/ {sqrt :d} :a'}}\\n else {if {< :d 0}\\n then {{lambda {:b' :d'}\\n {equation.disp [:b',:d'] [:b',-:d'] 2 complex roots}\\n } :b' {/ {sqrt {- :d}} :a'} }\\n else {equation.disp :b' :b' one real double root}\\n }}\\n } {* 2 :a} {/ {- :b} {* 2 :a}} {- {* :b :b} {* 4 :a :c}} } }}\\n\\n2) using let:\\n\\n{def equation\\n {lambda {:a :b :c}\\n {b equation :a*x{sup 2}+:b*x+:c=0}\\n {let { {:a' {* 2 :a}}\\n {:b' {/ {- :b} {* 2 :a}}}\\n {:d {- {* :b :b} {* 4 :a :c}}} }\\n {if {> :d 0}\\n then {let { {:b' :b'}\\n {:d' {/ {sqrt :d} :a'}} }\\n {equation.disp {+ :b' :d'} {- :b' :d'} 2 real roots} }\\n else {if {< :d 0}\\n then {let { {:b' :b'}\\n {:d' {/ {sqrt {- :d}} :a'}} }\\n {equation.disp [:b',:d'] [:b',-:d'] 2 complex roots} }\\n else {equation.disp :b' :b' one real double root} }} }}}\\n\\n3) a function to display results in an HTML table format\\n\\n{def equation.disp\\n {lambda {:x1 :x2 :txt}\\n {table {@ style=\\\"background:#ffa\\\"}\\n {tr {td :txt: }}\\n {tr {td x1 = :x1 }}\\n {tr {td x2 = :x2 }} } }}\\n\\n4) testing:\\n\\nequation 1*x2+1*x+-1=0\\n2 real roots:\\n x1 = 0.6180339887498949\\n x2 = -1.618033988749895\\n\\nequation 1*x2+1*x+1=0\\n2 complex roots:\\n x1 = [-0.5,0.8660254037844386]\\n x2 = [-0.5,-0.8660254037844386]\\n\\nequation 1*x2+-2*x+1=0\\none real double root:\\n x1 = 1\\n x2 = 1\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"a=1:b=2:c=3\\n 'assume a<>0\\n print quad$(a,b,c)\\n end\\n\\nfunction quad$(a,b,c)\\n D=b^2-4*a*c\\n x=-1*b\\n if D<0 then\\n quad$=str$(x/(2*a));\\\" +i\\\";str$(sqr(abs(D))/(2*a));\\\" , \\\";str$(x/(2*a));\\\" -i\\\";str$(sqr(abs(D))/abs(2*a))\\n else\\n quad$=str$(x/(2*a)+sqr(D)/(2*a));\\\" , \\\";str$(x/(2*a)-sqr(D)/(2*a))\\n end if\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"to quadratic :a :b :c\\n localmake \\\"d sqrt (:b*:b - 4*:a*:c)\\n if :b < 0 [make \\\"d minus :d]\\n output list (:d-:b)/(2*:a) (2*:c)/(:d-:b)\\nend\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"function qsolve(a, b, c)\\n if b < 0 then return qsolve(-a, -b, -c) end\\n val = b + (b^2 - 4*a*c)^(1/2) --this never exhibits instability if b > 0\\n return -val / (2 * a), -2 * c / val --2c / val is the same as the \\\"unstable\\\" second root\\nend\\n\\nfor i = 1, 12 do\\n print(qsolve(1, 0-10^i, 1))\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"solve(a*x^2+b*x+c,x);\\n\\nsolve(1.0*x^2-10.0^9*x+1.0,x,explicit,allsolutions);\\n\\nfsolve(x^2-10^9*x+1,x,complex);\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"Solve[a x^2 + b x + c == 0, x]\\nSolve[x^2 - 10^5 x + 1 == 0, x]\\nRoot[#1^2 - 10^5 #1 + 1 &, 1]\\nRoot[#1^2 - 10^5 #1 + 1 &, 2]\\nReduce[a x^2 + b x + c == 0, x]\\nReduce[x^2 - 10^5 x + 1 == 0, x]\\nFindInstance[x^2 - 10^5 x + 1 == 0, x, Reals, 2]\\nFindRoot[x^2 - 10^5 x + 1 == 0, {x, 0}]\\nFindRoot[x^2 - 10^5 x + 1 == 0, {x, 10^6}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"roots([1 -3 2]) % coefficients in decreasing order of power e.g. [x^n ... x^2 x^1 x^0]\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"solve(a*x^2 + b*x + c = 0, x);\\n\\n/* 2 2\\n sqrt(b - 4 a c) + b sqrt(b - 4 a c) - b\\n [x = - --------------------, x = --------------------]\\n 2 a 2 a */\\n\\nfpprec: 40$\\n\\nsolve(x^2 - 10^9*x + 1 = 0, x);\\n/* [x = 500000000 - sqrt(249999999999999999),\\n x = sqrt(249999999999999999) + 500000000] */\\n\\nbfloat(%);\\n/* [x = 1.0000000000000000009999920675269450501b-9,\\n x = 9.99999999999999998999999999999999999b8] */\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"MODULE Quad EXPORTS Main;\\n\\nIMPORT IO, Fmt, Math;\\n\\nTYPE Roots = ARRAY [1..2] OF LONGREAL;\\n\\nVAR r: Roots;\\n\\nPROCEDURE Solve(a, b, c: LONGREAL): Roots =\\n VAR sd: LONGREAL := Math.sqrt(b * b - 4.0D0 * a * c);\\n x: LONGREAL;\\n BEGIN\\n IF b < 0.0D0 THEN\\n x := (-b + sd) / (2.0D0 * a);\\n RETURN Roots{x, c / (a * x)};\\n ELSE\\n x := (-b - sd) / (2.0D0 * a);\\n RETURN Roots{c / (a * x), x};\\n END;\\n END Solve;\\n\\nBEGIN\\n r := Solve(1.0D0, -10.0D5, 1.0D0);\\n IO.Put(\\\"X1 = \\\" & Fmt.LongReal(r[1]) & \\\" X2 = \\\" & Fmt.LongReal(r[2]) & \\\"\\\\n\\\");\\nEND Quad.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"import math, complex, strformat\\n\\nconst Epsilon = 1e-15\\n\\ntype\\n\\n SolKind = enum solDouble, solFloat, solComplex\\n\\n Roots = object\\n case kind: SolKind\\n of solDouble:\\n fvalue: float\\n of solFloat:\\n fvalues: (float, float)\\n of solComplex:\\n cvalues: (Complex64, Complex64)\\n\\n\\nfunc quadRoots(a, b, c: float): Roots =\\n if a == 0:\\n raise newException(ValueError, \\\"first coefficient cannot be null.\\\")\\n let den = a * 2\\n let Δ = b * b - a * c * 4\\n if abs(Δ) < Epsilon:\\n result = Roots(kind: solDouble, fvalue: -b / den)\\n elif Δ < 0:\\n let r = -b / den\\n let i = sqrt(-Δ) / den\\n result = Roots(kind: solComplex, cvalues: (complex64(r, i), complex64(r, -i)))\\n else:\\n let r = (if b < 0: -b + sqrt(Δ) else: -b - sqrt(Δ)) / den\\n result = Roots(kind: solFloat, fvalues: (r, c / (a * r)))\\n\\n\\nfunc `$`(r: Roots): string =\\n case r.kind\\n of solDouble:\\n result = $r.fvalue\\n of solFloat:\\n result = &\\\"{r.fvalues[0]}, {r.fvalues[1]}\\\"\\n of solComplex:\\n result = &\\\"{r.cvalues[0].re} + {r.cvalues[0].im}i, {r.cvalues[1].re} + {r.cvalues[1].im}i\\\"\\n\\n\\nwhen isMainModule:\\n\\n const Equations = [(1.0, -2.0, 1.0),\\n (10.0, 1.0, 1.0),\\n (1.0, -10.0, 1.0),\\n (1.0, -1000.0, 1.0),\\n (1.0, -1e9, 1.0)]\\n\\n for (a, b, c) in Equations:\\n echo &\\\"Equation: {a=}, {b=}, {c=}\\\"\\n let roots = quadRoots(a, b, c)\\n let plural = if roots.kind == solDouble: \\\"\\\" else: \\\"s\\\"\\n echo &\\\" root{plural}: {roots}\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"type quadroots =\\n | RealRoots of float * float\\n | ComplexRoots of Complex.t * Complex.t ;;\\n\\nlet quadsolve a b c =\\n let d = (b *. b) -. (4.0 *. a *. c) in\\n if d < 0.0\\n then\\n let r = -. b /. (2.0 *. a)\\n and i = sqrt(-. d) /. (2.0 *. a) in\\n ComplexRoots ({ Complex.re = r; Complex.im = i },\\n { Complex.re = r; Complex.im = (-.i) })\\n else\\n let r =\\n if b < 0.0\\n then ((sqrt d) -. b) /. (2.0 *. a)\\n else ((sqrt d) +. b) /. (-2.0 *. a)\\n in\\n RealRoots (r, c /. (r *. a))\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"# quadsolve 1.0 0.0 (-2.0) ;;\\n- : quadroots = RealRoots (-1.4142135623730951, 1.4142135623730949)\\n\\n# quadsolve 1.0 0.0 2.0 ;;\\n- : quadroots =\\nComplexRoots ({Complex.re = 0.; Complex.im = 1.4142135623730951},\\n {Complex.re = 0.; Complex.im = -1.4142135623730951})\\n\\n# quadsolve 1.0 (-1.0e5) 1.0 ;;\\n- : quadroots = RealRoots (99999.99999, 1.0000000001000001e-005)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"roots(a,b,c)=polrootsreal(Pol([a,b,c]))\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"roots(a,b,c)={\\n b /= a;\\n c /= a;\\n my (delta = b^2 - 4*c, root=sqrt(delta));\\n if (delta < 0,\\n [root-b,-root-b]/2\\n ,\\n my(sol=if(b>0, -b - root,-b + root)/2);\\n [sol,c/sol]\\n )\\n};\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"roots(1,-1e9,1)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"Program QuadraticRoots;\\n\\nvar\\n a, b, c, q, f: double;\\n\\nbegin\\n a := 1;\\n b := -10e9;\\n c := 1;\\n q := sqrt(a * c) / b;\\n f := (1 + sqrt(1 - 4 * q * q)) / 2;\\n\\n writeln ('Version 1:');\\n writeln ('x1: ', (-b * f / a):16, ', x2: ', (-c / (b * f)):16);\\n\\n writeln ('Version 2:');\\n q := sqrt(b * b - 4 * a * c);\\n if b < 0 then\\n begin\\n f := (-b + q) / 2 * a;\\n writeln ('x1: ', f:16, ', x2: ', (c / (a * f)):16);\\n end\\n else\\n begin\\n f := (-b - q) / 2 * a;\\n writeln ('x1: ', (c / (a * f)):16, ', x2: ', f:16);\\n end;\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use Math::Complex;\\n\\n($x1,$x2) = solveQuad(1,2,3);\\n\\nprint \\\"x1 = $x1, x2 = $x2\\\\n\\\";\\n\\nsub solveQuad\\n{\\n\\tmy ($a,$b,$c) = @_;\\n\\tmy $root = sqrt($b**2 - 4*$a*$c);\\n\\treturn ( -$b + $root )/(2*$a), ( -$b - $root )/(2*$a);\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">solve_quadratic</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">t3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">t3</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">f</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"for a=%g,b=%g,c=%g\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">t3</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000000;\\\">t</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">u</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">abs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)<</span><span style=\\\"color: #000000;\\\">1e-6</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">switch</span> <span style=\\\"color: #7060A8;\\\">sign</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"single root is %g\\\"</span>\\n <span style=\\\"color: #000000;\\\">u</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{-</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"real roots are %g and %g\\\"</span>\\n <span style=\\\"color: #000000;\\\">f</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #7060A8;\\\">sqrt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">/(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">)))/</span><span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #000000;\\\">u</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{-</span><span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">case</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"complex roots are %g +/- %g*i\\\"</span>\\n <span style=\\\"color: #000000;\\\">u</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{-</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">sqrt</span><span style=\\\"color: #0000FF;\\\">(-</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">switch</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%-25s the %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">u</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">tests</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1E9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">0.5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1.4142135</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">}}</span>\\n\\n <span style=\\\"color: #7060A8;\\\">papply</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tests</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">solve_quadratic</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(scl 40)\\n\\n(de solveQuad (A B C)\\n (let SD (sqrt (- (* B B) (* 4 A C)))\\n (if (lt0 B)\\n (list\\n (*/ (- SD B) A 2.0)\\n (*/ C 2.0 (*/ A A (- SD B) `(* 1.0 1.0))) )\\n (list\\n (*/ C 2.0 (*/ A A (- 0 B SD) `(* 1.0 1.0)))\\n (*/ (- 0 B SD) A 2.0) ) ) ) )\\n\\n(mapcar round\\n (solveQuad 1.0 -1000000.0 1.0)\\n (6 .) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \" declare (c1, c2) float complex,\\n (a, b, c, x1, x2) float;\\n\\n get list (a, b, c);\\n if b**2 < 4*a*c then\\n do;\\n c1 = (-b + sqrt(b**2 - 4+0i*a*c)) / (2*a);\\n c2 = (-b - sqrt(b**2 - 4+0i*a*c)) / (2*a);\\n put data (c1, c2);\\n end;\\n else\\n do;\\n x1 = (-b + sqrt(b**2 - 4*a*c)) / (2*a);\\n x2 = (-b - sqrt(b**2 - 4*a*c)) / (2*a);\\n put data (x1, x2);\\n end;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"#!/usr/bin/env python3\\n\\nimport math\\nimport cmath\\nimport numpy\\n\\ndef quad_discriminating_roots(a,b,c, entier = 1e-5):\\n \\\"\\\"\\\"For reference, the naive algorithm which shows complete loss of\\n precision on the quadratic in question. (This function also returns a\\n characterization of the roots.)\\\"\\\"\\\"\\n discriminant = b*b - 4*a*c\\n a,b,c,d =complex(a), complex(b), complex(c), complex(discriminant)\\n root1 = (-b + cmath.sqrt(d))/2./a\\n root2 = (-b - cmath.sqrt(d))/2./a\\n if abs(discriminant) < entier:\\n return \\\"real and equal\\\", abs(root1), abs(root1)\\n if discriminant > 0:\\n return \\\"real\\\", root1.real, root2.real\\n return \\\"complex\\\", root1, root2\\n\\ndef middlebrook(a, b, c):\\n try:\\n q = math.sqrt(a*c)/b\\n f = .5+ math.sqrt(1-4*q*q)/2\\n except ValueError:\\n q = cmath.sqrt(a*c)/b\\n f = .5+ cmath.sqrt(1-4*q*q)/2\\n return (-b/a)*f, -c/(b*f)\\n\\ndef whatevery(a, b, c):\\n try:\\n d = math.sqrt(b*b-4*a*c)\\n except ValueError:\\n d = cmath.sqrt(b*b-4*a*c)\\n if b > 0:\\n return div(2*c, (-b-d)), div((-b-d), 2*a)\\n else:\\n return div((-b+d), 2*a), div(2*c, (-b+d))\\n\\ndef div(n, d):\\n \\\"\\\"\\\"Divide, with a useful interpretation of division by zero.\\\"\\\"\\\"\\n try:\\n return n/d\\n except ZeroDivisionError:\\n if n:\\n return n*float('inf')\\n return float('nan')\\n\\ntestcases = [\\n (3, 4, 4/3), # real, equal\\n (3, 2, -1), # real, unequal\\n (3, 2, 1), # complex\\n (1, -1e9, 1), # ill-conditioned \\\"quadratic in question\\\" required by task.\\n (1, -1e100, 1),\\n (1, -1e200, 1),\\n (1, -1e300, 1),\\n]\\n\\nprint('Naive:')\\nfor c in testcases:\\n print(\\\"{} {:.5} {:.5}\\\".format(*quad_discriminating_roots(*c)))\\n\\nprint('\\\\nMiddlebrook:')\\nfor c in testcases:\\n print((\\\"{:.5} \\\"*2).format(*middlebrook(*c)))\\n\\nprint('\\\\nWhat Every...')\\nfor c in testcases:\\n print((\\\"{:.5} \\\"*2).format(*whatevery(*c)))\\n\\nprint('\\\\nNumpy:')\\nfor c in testcases:\\n print((\\\"{:.5} \\\"*2).format(*numpy.roots(c)))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"qroots <- function(a, b, c) {\\n r <- sqrt(b * b - 4 * a * c + 0i)\\n if (abs(b - r) > abs(b + r)) {\\n z <- (-b + r) / (2 * a)\\n } else {\\n z <- (-b - r) / (2 * a)\\n }\\n c(z, c / (z * a))\\n}\\n\\nqroots(1, 0, 2i)\\n[1] -1+1i 1-1i\\n\\nqroots(1, -1e9, 1)\\n[1] 1e+09+0i 1e-09+0i\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"polyroot(c(2i, 0, 1))\\n[1] -1+1i 1-1i\\n\\npolyroot(c(1, -1e9, 1))\\n[1] 1e-09+0i 1e+09+0i\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(define (quadratic a b c)\\n (let* ((-b (- b))\\n (delta (- (expt b 2) (* 4 a c)))\\n (denominator (* 2 a)))\\n (list\\n (/ (+ -b (sqrt delta)) denominator)\\n (/ (- -b (sqrt delta)) denominator))))\\n\\n;(quadratic 1 0.0000000000001 -1)\\n;'(0.99999999999995 -1.00000000000005)\\n;(quadratic 1 0.0000000000001 1)\\n;'(-5e-014+1.0i -5e-014-1.0i)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"for\\n[1, 2, 1],\\n[1, 2, 3],\\n[1, -2, 1],\\n[1, 0, -4],\\n[1, -10⁶, 1]\\n-> @coefficients {\\n printf \\\"Roots for %d, %d, %d\\\\t=> (%s, %s)\\\\n\\\",\\n |@coefficients, |quadroots(@coefficients);\\n}\\n\\nsub quadroots (*[$a, $b, $c]) {\\n ( -$b + $_ ) / (2 × $a),\\n ( -$b - $_ ) / (2 × $a)\\n given\\n ($b² - 4 × $a × $c ).Complex.sqrt.narrow\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program finds the roots (which may be complex) of a quadratic function. */\\nparse arg a b c . /*obtain the specified arguments: A B C*/\\ncall quad a,b,c /*solve quadratic function via the sub.*/\\nr1= r1/1; r2= r2/1; a= a/1; b= b/1; c= c/1 /*normalize numbers to a new precision.*/\\nif r1j\\\\=0 then r1=r1||left('+',r1j>0)(r1j/1)\\\"i\\\" /*Imaginary part? Handle complex number*/\\nif r2j\\\\=0 then r2=r2||left('+',r2j>0)(r2j/1)\\\"i\\\" /* \\\" \\\" \\\" \\\" \\\" */\\n say ' a =' a /*display the normalized value of A. */\\n say ' b =' b /* \\\" \\\" \\\" \\\" \\\" B. */\\n say ' c =' c /* \\\" \\\" \\\" \\\" \\\" C. */\\n say; say 'root1 =' r1 /* \\\" \\\" \\\" \\\" 1st root*/\\n say 'root2 =' r2 /* \\\" \\\" \\\" \\\" 2nd root*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nquad: parse arg aa,bb,cc; numeric digits 200 /*obtain 3 args; use enough dec. digits*/\\n $= sqrt(bb**2-4*aa*cc); L= length($) /*compute SQRT (which may be complex).*/\\n r= 1 /(aa+aa); ?= right($, 1)=='i' /*compute reciprocal of 2*aa; Complex?*/\\n if ? then do; r1= -bb *r; r2=r1; r1j= left($,L-1)*r; r2j=-r1j; end\\n else do; r1=(-bb+$)*r; r2=(-bb-$)*r; r1j= 0; r2j= 0; end\\n return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nsqrt: procedure; parse arg x 1 ox; if x=0 then return 0; d= digits(); m.= 9; numeric form\\n numeric digits 9; h= d+6; x=abs(x); parse value format(x,2,1,,0) 'E0' with g 'E' _ .\\n g=g*.5'e'_%2; do j=0 while h>9; m.j=h; h=h%2+1; end /*j*/\\n do k=j+5 to 0 by -1; numeric digits m.k; g=(g+x/g)*.5; end /*k*/\\n numeric digits d; return (g/1)left('i', ox<0) /*make complex if OX<0. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/* REXX ***************************************************************\\n* 26.07.2913 Walter Pachl\\n**********************************************************************/\\n Numeric Digits 30\\n Parse Arg a b c 1 alist\\n Select\\n When a='' | a='?' Then\\n Call exit 'rexx qgl a b c solves a*x**2+b*x+c'\\n When words(alist)<>3 Then\\n Call exit 'three numbers are required'\\n Otherwise\\n Nop\\n End\\n gl=a'*x**2'\\n Select\\n When b<0 Then gl=gl||b'*x'\\n When b>0 Then gl=gl||'+'||b'*x'\\n Otherwise Nop\\n End\\n Select\\n When c<0 Then gl=gl||c\\n When c>0 Then gl=gl||'+'||c\\n Otherwise Nop\\n End\\n Say gl '= 0'\\n\\n d=b**2-4*a*c\\n If d<0 Then Do\\n dd=sqrt(-d)\\n r=-b/(2*a)\\n i=dd/(2*a)\\n x1=r'+'i'i'\\n x2=r'-'i'i'\\n End\\n Else Do\\n dd=sqrt(d)\\n x1=(-b+dd)/(2*a)\\n x2=(-b-dd)/(2*a)\\n End\\n Say 'x1='||x1\\n Say 'x2='||x2\\n Exit\\nsqrt:\\n/* REXX ***************************************************************\\n* EXEC to calculate the square root of x with high precision\\n**********************************************************************/\\n Parse Arg x\\n prec=digits()\\n prec1=2*prec\\n eps=10**(-prec1)\\n k = 1\\n Numeric Digits prec1\\n r0= x\\n r = 1\\n Do i=1 By 1 Until r=r0 | (abs(r*r-x)<eps)\\n r0 = r\\n r = (r + x/r) / 2\\n k = min(prec1,2*k)\\n Numeric Digits (k + 5)\\n End\\n Numeric Digits prec\\n Return (r+0)\\nexit: Say arg(1)\\nExit\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"x1 = 0\\nx2 = 0\\nquadratic(3, 4, 4/3.0) # [-2/3]\\nsee \\\"x1 = \\\" + x1 + \\\" x2 = \\\" + x2 + nl\\nquadratic(3, 2, -1) # [1/3, -1]\\nsee \\\"x1 = \\\" + x1 + \\\" x2 = \\\" + x2 + nl\\nquadratic(-2, 7, 15) # [-3/2, 5]\\nsee \\\"x1 = \\\" + x1 + \\\" x2 = \\\" + x2 + nl\\nquadratic(1, -2, 1) # [1]\\nsee \\\"x1 = \\\" + x1 + \\\" x2 = \\\" + x2 + nl\\n\\nfunc quadratic a, b, c\\n sqrtDiscriminant = sqrt(pow(b,2) - 4*a*c)\\n x1 = (-b + sqrtDiscriminant) / (2.0*a)\\n x2 = (-b - sqrtDiscriminant) / (2.0*a)\\n return [x1, x2]\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'cmath'\\n\\ndef quadratic(a, b, c)\\n sqrt_discriminant = CMath.sqrt(b**2 - 4*a*c)\\n [(-b + sqrt_discriminant) / (2.0*a), (-b - sqrt_discriminant) / (2.0*a)]\\nend\\n\\np quadratic(3, 4, 4/3.0) # [-2/3]\\np quadratic(3, 2, -1) # [1/3, -1]\\np quadratic(3, 2, 1) # [(-1/3 + sqrt(2/9)i), (-1/3 - sqrt(2/9)i)]\\np quadratic(1, 0, 1) # [(0+i), (0-i)]\\np quadratic(1, -1e6, 1) # [1e6, 1e-6]\\np quadratic(-2, 7, 15) # [-3/2, 5]\\np quadratic(1, -2, 1) # [1]\\np quadratic(1, 3, 3) # [(-3 + sqrt(3)i)/2), (-3 - sqrt(3)i)/2)]\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"print \\\"FOR 1,2,3 => \\\";quad$(1,2,3)\\nprint \\\"FOR 4,5,6 => \\\";quad$(4,5,6)\\n\\nFUNCTION quad$(a,b,c)\\n d = b^2-4 * a*c\\n x = -1*b\\n if d<0 then\\n quad$ = str$(x/(2*a));\\\" +i\\\";str$(sqr(abs(d))/(2*a))+\\\" , \\\"+str$(x/(2*a));\\\" -i\\\";str$(sqr(abs(d))/abs(2*a))\\n else\\n quad$ = str$(x/(2*a)+sqr(d)/(2*a))+\\\" , \\\"+str$(x/(2*a)-sqr(d)/(2*a))\\n end if\\nEND FUNCTION\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"import ArithmeticComplex._\\nobject QuadraticRoots {\\n def solve(a:Double, b:Double, c:Double)={\\n val d = b*b-4.0*a*c\\n val aa = a+a\\n\\n if (d < 0.0) { // complex roots\\n val re= -b/aa;\\n val im = math.sqrt(-d)/aa;\\n (Complex(re, im), Complex(re, -im))\\n }\\n else { // real roots\\n val re=if (b < 0.0) (-b+math.sqrt(d))/aa else (-b -math.sqrt(d))/aa\\n (re, (c/(a*re)))\\n }\\t\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"val equations=Array(\\n (1.0, 22.0, -1323.0), // two distinct real roots\\n (6.0, -23.0, 20.0), // with a != 1.0\\n (1.0, -1.0e9, 1.0), // with one root near zero\\n (1.0, 2.0, 1.0), // one real root (double root)\\n (1.0, 0.0, 1.0), // two imaginary roots\\n (1.0, 1.0, 1.0) // two complex roots\\n);\\n\\t\\nequations.foreach{v =>\\n val (a,b,c)=v\\n println(\\\"a=%g b=%g c=%g\\\".format(a,b,c))\\n val roots=solve(a, b, c)\\n println(\\\"x1=\\\"+roots._1)\\n if(roots._1 != roots._2) println(\\\"x2=\\\"+roots._2)\\n println\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (quadratic a b c)\\n\\t(if (= a 0)\\n\\t(if (= b 0) 'fail (- (/ c b)))\\n\\t(let ((delta (- (* b b) (* 4 a c))))\\n\\t(if (and (real? delta) (> delta 0))\\n\\t\\t(let ((u (+ b (* (if (>= b 0) 1 -1) (sqrt delta)))))\\n\\t\\t\\t(list (/ u -2 a) (/ (* -2 c) u)))\\n\\t\\t(list\\n\\t\\t\\t(/ (- (sqrt delta) b) 2 a)\\n\\t\\t\\t(/ (+ (sqrt delta) b) -2 a))))))\\n\\n\\n; examples\\n\\n(quadratic 1 -1 -1)\\n; (1.618033988749895 -0.6180339887498948)\\n\\n(quadratic 1 0 -2)\\n; (-1.4142135623730951 1.414213562373095)\\n\\n(quadratic 1 0 2)\\n; (0+1.4142135623730951i 0-1.4142135623730951i)\\n\\n(quadratic 1+1i 2 5)\\n; (-1.0922677260818898-1.1884256155834088i 0.09226772608188982+2.1884256155834088i)\\n\\n(quadratic 0 4 3)\\n; -3/4\\n\\n(quadratic 0 0 1)\\n; fail\\n\\n(quadratic 1 2 0)\\n; (-2 0)\\n\\n(quadratic 1 2 1)\\n; (-1 -1)\\n\\n(quadratic 1 -1e5 1)\\n; (99999.99999 1.0000000001000001e-05)\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"float.s7i\\\";\\n include \\\"math.s7i\\\";\\n\\nconst type: roots is new struct\\n var float: x1 is 0.0;\\n var float: x2 is 0.0;\\n end struct;\\n\\nconst func roots: solve (in float: a, in float: b, in float: c) is func\\n result\\n var roots: solution is roots.value;\\n local\\n var float: sd is 0.0;\\n var float: x is 0.0;\\n begin\\n sd := sqrt(b**2 - 4.0 * a * c);\\n if b < 0.0 then\\n x := (-b + sd) / 2.0 * a;\\n solution.x1 := x;\\n solution.x2 := c / (a * x);\\n else\\n x := (-b - sd) / 2.0 * a;\\n solution.x1 := c / (a * x);\\n solution.x2 := x;\\n end if;\\n end func;\\n\\nconst proc: main is func\\n local\\n var roots: r is roots.value;\\n begin\\n r := solve(1.0, -10.0E5, 1.0);\\n writeln(\\\"X1 = \\\" <& r.x1 digits 6 <& \\\" X2 = \\\" <& r.x2 digits 6);\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"var sets = [\\n [1, 2, 1],\\n [1, 2, 3],\\n [1, -2, 1],\\n [1, 0, -4],\\n [1, -1e6, 1],\\n ]\\n\\nfunc quadroots(a, b, c) {\\n var root = sqrt(b**2 - 4*a*c)\\n\\n [(-b + root) / (2 * a),\\n (-b - root) / (2 * a)]\\n}\\n\\nsets.each { |coefficients|\\n say (\\\"Roots for #{coefficients}\\\",\\n \\\"=> (#{quadroots(coefficients...).join(', ')})\\\")\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"mata\\n: polyroots((-2,0,1))\\n 1 2\\n +-----------------------------+\\n 1 | 1.41421356 -1.41421356 |\\n +-----------------------------+\\n\\n: polyroots((2,0,1))\\n 1 2\\n +-------------------------------+\\n 1 | -1.41421356i 1.41421356i |\\n +-------------------------------+\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"package require math::complexnumbers\\nnamespace import math::complexnumbers::complex math::complexnumbers::tostring\\n\\nproc quadratic {a b c} {\\n set discrim [expr {$b**2 - 4*$a*$c}]\\n set roots [list]\\n if {$discrim < 0} {\\n set term1 [expr {(-1.0*$b)/(2*$a)}]\\n set term2 [expr {sqrt(abs($discrim))/(2*$a)}]\\n lappend roots [tostring [complex $term1 $term2]] \\\\\\n [tostring [complex $term1 [expr {-1 * $term2}]]]\\n } elseif {$discrim == 0} {\\n lappend roots [expr {-1.0*$b / (2*$a)}]\\n } else {\\n lappend roots [expr {(-1*$b + sqrt($discrim)) / (2 * $a)}] \\\\\\n [expr {(-1*$b - sqrt($discrim)) / (2 * $a)}]\\n }\\n return $roots\\n}\\n\\nproc report_quad {a b c} {\\n puts [format \\\"%sx**2 + %sx + %s = 0\\\" $a $b $c]\\n foreach root [quadratic $a $b $c] {\\n puts \\\" x = $root\\\"\\n }\\n}\\n\\n# examples on this page\\nreport_quad 3 4 [expr {4/3.0}] ;# {-2/3}\\nreport_quad 3 2 -1 ;# {1/3, -1}\\nreport_quad 3 2 1 ;# {(-1/3 + sqrt(2/9)i), (-1/3 - sqrt(2/9)i)}\\nreport_quad 1 0 1 ;# {(0+i), (0-i)}\\nreport_quad 1 -1e6 1 ;# {1e6, 1e-6}\\n# examples from http://en.wikipedia.org/wiki/Quadratic_equation\\nreport_quad -2 7 15 ;# {5, -3/2}\\nreport_quad 1 -2 1 ;# {1}\\nreport_quad 1 3 3 ;# {(-3 - sqrt(3)i)/2), (-3 + sqrt(3)i)/2)}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"solve(x^2-1E9x+1.0)\\n\",\n \"language\": \"TI-89-BASIC\"\n },\n {\n \"code\": \"import \\\"./complex\\\" for Complex\\n\\nvar quadratic = Fn.new { |a, b, c|\\n var d = b*b - 4*a*c\\n if (d == 0) {\\n // single root\\n return [[-b/(2*a)], null]\\n }\\n if (d > 0) {\\n // two real roots\\n var sr = d.sqrt\\n d = (b < 0) ? sr - b : -sr - b\\n return [[d/(2*a), 2*c/d], null]\\n }\\n // two complex roots\\n var den = 1 / (2*a)\\n var t1 = Complex.new(-b*den, 0)\\n var t2 = Complex.new(0, (-d).sqrt * den)\\n return [[], [t1+t2, t1-t2]]\\n}\\n\\nvar test = Fn.new { |a, b, c|\\n System.write(\\\"coefficients: %(a), %(b), %(c) -> \\\")\\n var roots = quadratic.call(a, b, c)\\n var r = roots[0]\\n if (r.count == 1) {\\n System.print(\\\"one real root: %(r[0])\\\")\\n } else if (r.count == 2) {\\n System.print(\\\"two real roots: %(r[0]) and %(r[1])\\\")\\n } else {\\n var i = roots[1]\\n System.print(\\\"two complex roots: %(i[0]) and %(i[1])\\\")\\n }\\n}\\n\\nvar coeffs = [\\n [1, -2, 1],\\n [1, 0, 1],\\n [1, -10, 1],\\n [1, -1000, 1],\\n [1, -1e9, 1]\\n]\\n\\nfor (c in coeffs) test.call(c[0], c[1], c[2])\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"include xpllib; \\\\for Print\\n\\nfunc real QuadRoots(A, B, C); \\\\Return roots of quadratic equation\\nreal A, B, C;\\nreal D, E, R;\\n[R:= [0., 0., 0.];\\nR(0):= 0.; R(1):= 0.; R(2):= 0.;\\nD:= B*B - 4.*A*C;\\ncase of\\nD = 0.: [R(0):= -B / (2.*A); \\\\single root\\n R(1):= R(0);\\n ];\\nD > 0.: [if B < 0. then \\\\two real roots\\n E:= sqrt(D) - B\\n else E:= -sqrt(D) - B;\\n R(0):= E / (2.*A);\\n R(1):= 2. * C / E;\\n ];\\nD < 0.: [R(0):= -B / (2.*A); \\\\real\\n R(2):= sqrt(-D) /(2.*A); \\\\imaginary\\n ]\\nother []; \\\\D overflowed or a coefficient was NaN\\nreturn R;\\n];\\n\\nfunc Test(A, B, C);\\nreal A, B, C;\\nreal R;\\n[Print(\\\"coefficients: %g, %g, %g -> \\\", A, B, C);\\nR:= QuadRoots(A, B, C);\\nif R(2) # 0. then\\n Print(\\\"two complex roots: %g+%gi, %g-%gi\\\\n\\\", R(0), R(2), R(0), R(2))\\nelse [if R(0) = R(1) then\\n Print(\\\"one real root: %g\\\\n\\\", R(0))\\n else Print(\\\"two real roots: %15.15g, %15.15g\\\\n\\\", R(0), R(1));\\n ];\\n];\\n\\nreal C; int I;\\n[C:= [ [1., -2., 1.],\\n [1., 0., 1.],\\n [1., -10., 1.],\\n [1., -1000., 1.],\\n [1., -1e9, 1.],\\n [1., -4., 6.] ];\\nfor I:= 0 to 5 do\\n Test(C(I,0), C(I,1), C(I,2));\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"fcn quadratic(a,b,c){ b=b.toFloat();\\n println(\\\"Roots of a quadratic function %s, %s, %s\\\".fmt(a,b,c));\\n d,a2:=(b*b - 4*a*c), a+a;\\n if(d>0){\\n sd:=d.sqrt();\\n println(\\\" the real roots are %s and %s\\\".fmt((-b + sd)/a2,(-b - sd)/a2));\\n }\\n else if(d==0) println(\\\" the single root is \\\",-b/a2);\\n else{\\n sd:=(-d).sqrt();\\n println(\\\" the complex roots are %s and \\\\U00B1;%si\\\".fmt(-b/a2,sd/a2));\\n }\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"foreach a,b,c in (T( T(1,-2,1), T(1,-3,2), T(1,0,1), T(1,-1.0e10,1), T(1,2,3), T(2,-1,-6)) ){\\n quadratic(a,b,c)\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Roots-of-a-quadratic-function"}}},{"rowIdx":1590,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Roots_of_unity\nnote: Arithmetic operations\n","language":"00-META"},{"code":"The purpose of this task is to explore working with [https://en.wikipedia.org/wiki/Complex_number complex numbers].\n\n\n;Task:\nGiven <big>'''n'''</big>, find the <big>'''n'''<sup>th</sup></big> [[wp:Roots of unity|roots of unity]].\n<br><br>\n\n","language":"00-TASK"},{"code":"F polar(r, theta)\n R r * (cos(theta) + sin(theta) * 1i)\n\nF croots(n)\n R (0 .< n).map(k -> polar(1, 2 * k * math:pi / @n))\n\nL(nr) 2..10\n print(nr‘ ’croots(nr))\n","language":"11l"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\nwith Ada.Float_Text_IO; use Ada.Float_Text_IO;\nwith Ada.Numerics.Complex_Types; use Ada.Numerics.Complex_Types;\n\nprocedure Roots_Of_Unity is\n Root : Complex;\nbegin\n for N in 2..10 loop\n Put_Line (\"N =\" & Integer'Image (N));\n for K in 0..N - 1 loop\n Root :=\n Compose_From_Polar\n ( Modulus => 1.0,\n Argument => Float (K),\n Cycle => Float (N)\n );\n -- Output\n Put (\" k =\" & Integer'Image (K) & \", \");\n if Re (Root) < 0.0 then\n Put (\"-\");\n else\n Put (\"+\");\n end if;\n Put (abs Re (Root), Fore => 1, Exp => 0);\n if Im (Root) < 0.0 then\n Put (\"-\");\n else\n Put (\"+\");\n end if;\n Put (abs Im (Root), Fore => 1, Exp => 0);\n Put_Line (\"i\");\n end loop;\n end loop;\nend Roots_Of_Unity;\n","language":"Ada"},{"code":"FORMAT complex fmt=$g(-6,4)\"⊥\"g(-6,4)$;\nFOR root FROM 2 TO 10 DO\n printf(($g(4)$,root));\n FOR n FROM 0 TO root-1 DO\n printf(($xf(complex fmt)$,complex exp( 0 I 2*pi*n/root)))\n OD;\n printf($l$)\nOD\n","language":"ALGOL-68"},{"code":"rect: function [r,phi][\n to :complex @[ r * cos phi, r * sin phi ]\n]\nroots: function [n][\n map 0..dec n 'k -> rect 1.0 2 * k * pi / n\n]\n\nloop 2..10 'nr ->\n print [pad to :string nr 3 \"=>\" join.with:\", \" to [:string] .format:\".3f\" roots nr]\n","language":"Arturo"},{"code":"(*\n\nThis program has to be compiled without -std=c99, which patscc will\ninsert unless you override the setting.\n\n##myatsccdef=\\\npatscc \\\n --gline \\\n -atsccomp gcc \\\n -I\"${PATSHOME}\" \\\n -I\"${PATSHOME}/ccomp/runtime\" \\\n -L\"${PATSHOME}/ccomp/atslib/lib\" \\\n -DATS_MEMALLOC_LIBC \\\n -o $fname($1) $1 -lm\n\n*)\n\n(*\n\n I use the C _Complex types, but not the newer _Imaginary types.\n Thus I demonstrate how one might add new floating point types\n nicely.\n\n (In my opinion, it is good to use m4 or similar tools when writing\n such repetitive code. Doing so reduces both work and the frequency\n of errors. Also you could then more easily add support for the many\n extension types such as \"_Float128 complex\" (quadruple precision).\n\n One could, of course, define one's own complex types directly in\n ATS.\n\n*)\n\n#include \"share/atspre_staload.hats\"\n\n#define ATS_EXTERN_PREFIX \"myatspre_\"\n\n#define NIL list_nil ()\n#define :: list_cons\n\n(*------------------------------------------------------------------*)\n\n%{^\n\n#include <complex.h>\n\n#define myatspre_inline ATSinline ()\n\ntypedef float complex myatstype_fcomplex;\ntypedef double complex myatstype_dcomplex;\ntypedef long double complex myatstype_lcomplex;\n\n#define myatspre_CMPLXF CMPLXF\n#define myatspre_CMPLX CMPLX\n#define myatspre_CMPLXL CMPLXL\n\nmyatspre_inline atsvoid_t0ype\nmyatspre_fprint_fcomplex (atstype_ref r,\n myatstype_fcomplex x)\n{\n double rx = crealf (x);\n double ix = cimagf (x);\n const char *plus = (ix < 0) ? \"\" : \"+\";\n fprintf ((FILE *) r, \"%f%s%fi\", rx, plus, ix);\n}\n\n#define myatspre_print_fcomplex(x) myatspre_fprint_fcomplex (stdout, (x))\n#define myatspre_prerr_fcomplex(x) myatspre_fprint_fcomplex (stderr, (x))\n\nmyatspre_inline atsvoid_t0ype\nmyatspre_fprint_dcomplex (atstype_ref r,\n myatstype_dcomplex x)\n{\n double rx = creal (x);\n double ix = cimag (x);\n const char *plus = (ix < 0) ? \"\" : \"+\";\n fprintf ((FILE *) r, \"%f%s%fi\", rx, plus, ix);\n}\n\n#define myatspre_print_dcomplex(x) myatspre_fprint_dcomplex (stdout, (x))\n#define myatspre_prerr_dcomplex(x) myatspre_fprint_dcomplex (stderr, (x))\n\nmyatspre_inline atsvoid_t0ype\nmyatspre_fprint_lcomplex (atstype_ref r,\n myatstype_lcomplex x)\n{\n long double rx = creall (x);\n long double ix = cimagl (x);\n const char *plus = (ix < 0) ? \"\" : \"+\";\n fprintf ((FILE *) r, \"%Lf%s%Lfi\", rx, plus, ix);\n}\n\n#define myatspre_print_lcomplex(x) myatspre_fprint_lcomplex (stdout, (x))\n#define myatspre_prerr_lcomplex(x) myatspre_fprint_lcomplex (stderr, (x))\n\nmyatspre_inline myatstype_fcomplex\nmyatspre_g0float_cmplx_float_fcomplex (atstype_float x,\n atstype_float y)\n{\n return myatspre_CMPLXF (x, y);\n}\n\nmyatspre_inline myatstype_dcomplex\nmyatspre_g0float_cmplx_double_dcomplex (atstype_double x,\n atstype_double y)\n{\n return myatspre_CMPLX (x, y);\n}\n\nmyatspre_inline myatstype_lcomplex\nmyatspre_g0float_cmplx_ldouble_lcomplex (atstype_ldouble x,\n atstype_ldouble y)\n{\n return myatspre_CMPLXL (x, y);\n}\n\nmyatspre_inline myatstype_fcomplex\nmyatspre_g0int2float_int_fcomplex (atstype_int x)\n{\n return x;\n}\n\nmyatspre_inline myatstype_dcomplex\nmyatspre_g0int2float_int_dcomplex (atstype_int x)\n{\n return x;\n}\n\nmyatspre_inline myatstype_lcomplex\nmyatspre_g0int2float_int_lcomplex (atstype_int x)\n{\n return x;\n}\n\nmyatspre_inline myatstype_fcomplex\nmyatspre_g0float_mul_fcomplex (myatstype_fcomplex x,\n myatstype_fcomplex y)\n{\n return x * y;\n}\n\nmyatspre_inline myatstype_dcomplex\nmyatspre_g0float_mul_dcomplex (myatstype_dcomplex x,\n myatstype_dcomplex y)\n{\n return x * y;\n}\n\nmyatspre_inline myatstype_lcomplex\nmyatspre_g0float_mul_lcomplex (myatstype_lcomplex x,\n myatstype_lcomplex y)\n{\n return x * y;\n}\n\nmyatspre_inline myatstype_fcomplex\nmyatspre_exp_fcomplex (myatstype_fcomplex x)\n{\n return cexpf (x);\n}\n\nmyatspre_inline myatstype_dcomplex\nmyatspre_exp_dcomplex (myatstype_dcomplex x)\n{\n return cexp (x);\n}\n\nmyatspre_inline myatstype_lcomplex\nmyatspre_exp_lcomplex (myatstype_lcomplex x)\n{\n return cexpl (x);\n}\n\nmyatspre_inline myatstype_fcomplex\nmyatspre_pow_fcomplex (myatstype_fcomplex x,\n myatstype_fcomplex y)\n{\n return cpowf (x, y);\n}\n\nmyatspre_inline myatstype_dcomplex\nmyatspre_pow_dcomplex (myatstype_dcomplex x,\n myatstype_dcomplex y)\n{\n return cpow (x, y);\n}\n\nmyatspre_inline myatstype_lcomplex\nmyatspre_pow_lcomplex (myatstype_lcomplex x,\n myatstype_lcomplex y)\n{\n return cpowl (x, y);\n}\n\n%}\n\n(*------------------------------------------------------------------*)\n\ntkindef fcomplex_kind = \"myatstype_fcomplex\"\nstadef fcmplxknd = fcomplex_kind\nstadef fcomplex = g0float fcmplxknd\n\ntkindef dcomplex_kind = \"myatstype_dcomplex\"\nstadef dcmplxknd = dcomplex_kind\nstadef dcomplex = g0float dcmplxknd\n\ntkindef lcomplex_kind = \"myatstype_lcomplex\"\nstadef lcmplxknd = lcomplex_kind\nstadef lcomplex = g0float lcmplxknd\n\nextern fn print_fcomplex : fcomplex -<1> void = \"mac#%\"\nextern fn prerr_fcomplex : fcomplex -<1> void = \"mac#%\"\nextern fn fprint_fcomplex : fprint_type fcomplex = \"mac#%\"\noverload print with print_fcomplex\noverload prerr with prerr_fcomplex\noverload fprint with fprint_fcomplex\nimplement fprint_val<fcomplex> = fprint_fcomplex\n\nextern fn print_dcomplex : dcomplex -<1> void = \"mac#%\"\nextern fn prerr_dcomplex : dcomplex -<1> void = \"mac#%\"\nextern fn fprint_dcomplex : fprint_type dcomplex = \"mac#%\"\noverload print with print_dcomplex\noverload prerr with prerr_dcomplex\noverload fprint with fprint_dcomplex\nimplement fprint_val<dcomplex> = fprint_dcomplex\n\nextern fn print_lcomplex : lcomplex -<1> void = \"mac#%\"\nextern fn prerr_lcomplex : lcomplex -<1> void = \"mac#%\"\nextern fn fprint_lcomplex : fprint_type lcomplex = \"mac#%\"\noverload print with print_lcomplex\noverload prerr with prerr_lcomplex\noverload fprint with fprint_lcomplex\nimplement fprint_val<lcomplex> = fprint_lcomplex\n\nextern fn g0int2float_int_fcomplex : int -<> fcomplex = \"mac#%\"\nextern fn g0int2float_int_dcomplex : int -<> dcomplex = \"mac#%\"\nextern fn g0int2float_int_lcomplex : int -<> lcomplex = \"mac#%\"\nimplement g0int2float<intknd,fcmplxknd> = g0int2float_int_fcomplex\nimplement g0int2float<intknd,dcmplxknd> = g0int2float_int_dcomplex\nimplement g0int2float<intknd,lcmplxknd> = g0int2float_int_lcomplex\n\nextern fn g0float_cmplx_float_fcomplex : (float, float) -<> fcomplex = \"mac#%\"\nextern fn g0float_cmplx_double_dcomplex : (double, double) -<> dcomplex = \"mac#%\"\nextern fn g0float_cmplx_ldouble_lcomplex : (ldouble, ldouble) -<> lcomplex = \"mac#%\"\nextern fn {tk2 : tkind} {tk1 : tkind} g0float_cmplx : (g0float tk1, g0float tk1) -<> g0float tk2\nimplement g0float_cmplx<fcmplxknd><fltknd> = g0float_cmplx_float_fcomplex\nimplement g0float_cmplx<dcmplxknd><dblknd> = g0float_cmplx_double_dcomplex\nimplement g0float_cmplx<lcmplxknd><ldblknd> = g0float_cmplx_ldouble_lcomplex\noverload cmplx with g0float_cmplx\n\nextern fn g0float_mul_fcomplex : g0float_aop_type fcmplxknd = \"mac#%\"\nextern fn g0float_mul_dcomplex : g0float_aop_type dcmplxknd = \"mac#%\"\nextern fn g0float_mul_lcomplex : g0float_aop_type lcmplxknd = \"mac#%\"\nimplement g0float_mul<fcmplxknd> = g0float_mul_fcomplex\nimplement g0float_mul<dcmplxknd> = g0float_mul_dcomplex\nimplement g0float_mul<lcmplxknd> = g0float_mul_lcomplex\n\n(*------------------------------------------------------------------*)\n(* Most \"math\" functions are not defined in the prelude. Here we will\n follow the conventions of libats/libc, which does not use the\n floating point typekinds. *)\n\nstaload \"libats/libc/SATS/math.sats\"\nstaload _ = \"libats/libc/DATS/math.dats\"\n\nextern fn exp_fcomplex : fcomplex -<> fcomplex = \"mac#%\"\nextern fn exp_dcomplex : dcomplex -<> dcomplex = \"mac#%\"\nextern fn exp_lcomplex : lcomplex -<> lcomplex = \"mac#%\"\nimplement exp<fcomplex> = exp_fcomplex\nimplement exp<dcomplex> = exp_dcomplex\nimplement exp<lcomplex> = exp_lcomplex\n\nextern fn pow_fcomplex : (fcomplex, fcomplex) -<> fcomplex = \"mac#%\"\nextern fn pow_dcomplex : (dcomplex, dcomplex) -<> dcomplex = \"mac#%\"\nextern fn pow_lcomplex : (lcomplex, lcomplex) -<> lcomplex = \"mac#%\"\nimplement pow<fcomplex> = pow_fcomplex\nimplement pow<dcomplex> = pow_dcomplex\nimplement pow<lcomplex> = pow_lcomplex\n\n(*------------------------------------------------------------------*)\n\nfn\nnth_roots_of_unity\n {n : pos}\n (n : int n)\n :<> list (dcomplex, n) =\n let\n val C = cmplx (0.0, ~((2.0 * M_PI) / g0i2f n))\n\n fun\n loop {k : nat | k <= n}\n .<k>.\n (k : int k,\n accum : list (dcomplex, n - k))\n :<> list (dcomplex, n) =\n if k = 0 then\n accum\n else\n loop (pred k, exp (g0i2f (pred k) * C) :: accum)\n in\n loop (n, NIL)\n end\n\nfn\nnth_powers {m : int}\n {n : pos}\n (lst : list (dcomplex, m),\n n : int n)\n :<1> list (dcomplex, m) =\n let\n val nth : dcomplex = g0i2f n\n implement list_map$fopr<dcomplex><dcomplex> x = pow (x, nth)\n in\n list_vt2t (list_map<dcomplex><dcomplex> lst)\n end\n\nfn\nshow_results\n {n : pos}\n (n : int n)\n :<1> void =\n let\n val nth_roots = nth_roots_of_unity n\n val ones = nth_powers (nth_roots, n)\n in\n println! ();\n println! (\"roots of unity = \", nth_roots);\n println! (\"roots raised \", n, \" = \", ones)\n end\n\nfun\nloop_over_args\n {argc : int}\n {k : pos | k <= argc}\n {p_args : addr}\n .<argc - k>.\n (pf_args : !array_v (string, p_args, argc) |\n argc : int argc,\n p_args : ptr p_args,\n k : int k)\n :<1> void =\n if k <> argc then\n let\n macdef args = !p_args\n val argument = args[k]\n val n = $extfcall ([n : int] int n, \"atoi\", argument)\n in\n if 0 < n then\n show_results n;\n loop_over_args (pf_args | argc, p_args, succ k)\n end\n\nimplement\nmain0 {argc} (argc, argv) =\n let\n val [p_args : addr]\n @(pf_args, pf_minus | p_args) =\n argv_takeout_strarr {argc} argv\n\n val () = loop_over_args {argc} {1} {p_args}\n (pf_args | argc, p_args, 1)\n\n prval () = minus_addback (pf_minus, pf_args | argv)\n in\n println! ()\n end\n\n(*------------------------------------------------------------------*)\n","language":"ATS"},{"code":"n := 8, a := 8*atan(1)/n\nLoop %n%\n i := A_Index-1, t .= cos(a*i) ((s:=sin(a*i))<0 ? \" - i*\" . -s : \" + i*\" . s) \"`n\"\nMsgbox % t\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f ROOTS_OF_UNITY.AWK\nBEGIN {\n pi = 3.1415926\n for (n=2; n<=5; n++) {\n printf(\"%d: \",n)\n for (root=0; root<=n-1; root++) {\n real = cos(2 * pi * root / n)\n imag = sin(2 * pi * root / n)\n printf(\"%8.5f %8.5fi\",real,imag)\n if (root != n-1) { printf(\", \") }\n }\n printf(\"\\n\")\n }\n exit(0)\n}\n","language":"AWK"},{"code":" CLS\n PI = 3.1415926#\n n = 5 'this can be changed for any desired n\n angle = 0 'start at angle 0\n DO\n \treal = COS(angle) 'real axis is the x axis\n \tIF (ABS(real) < 10 ^ -5) THEN real = 0 'get rid of annoying sci notation\n \timag = SIN(angle) 'imaginary axis is the y axis\n \tIF (ABS(imag) < 10 ^ -5) THEN imag = 0 'get rid of annoying sci notation\n \tPRINT real; \"+\"; imag; \"i\" 'answer on every line\n \tangle = angle + (2 * PI) / n\n 'all the way around the circle at even intervals\n LOOP WHILE angle < 2 * PI\n","language":"BASIC"},{"code":"twopi = 2 * pi\nn = 5\n\nfor m = 0 to n-1\n\ttheta = m*twopi/n\n\treal = cos(theta)\n\timag = sin(theta)\n\tif imag >= 0 then\n\t\tprint ljust(string(real),9,\"0\"); \" + \"; ljust(string(imag),13,\"0\"); \"i\"\n\telse\n\t\tprint ljust(string(real),9,\"0\"); \" - \"; ljust(string(-imag),13,\"0\"); \"i\"\n\tend if\nnext m\n","language":"BASIC256"},{"code":" @% = &20408\n FOR n% = 2 TO 5\n PRINT STR$(n%) \": \" ;\n FOR root% = 0 TO n%-1\n real = COS(2*PI * root% / n%)\n imag = SIN(2*PI * root% / n%)\n PRINT real imag \"i\" ;\n IF root% <> n%-1 PRINT \",\" ;\n NEXT\n PRINT\n NEXT n%\n","language":"BBC-BASIC"},{"code":"#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tdouble a, c, s, PI2 = atan2(1, 1) * 8;\n\tint n, i;\n\n\tfor (n = 1; n < 10; n++) for (i = 0; i < n; i++) {\n\t\tc = s = 0;\n\t\tif (!i )\t\tc = 1;\n\t\telse if(n == 4 * i)\ts = 1;\n\t\telse if(n == 2 * i)\tc = -1;\n\t\telse if(3 * n == 4 * i)\ts = -1;\n\t\telse\n\t\t\ta = i * PI2 / n, c = cos(a), s = sin(a);\n\n\t\tif (c) printf(\"%.2g\", c);\n\t\tprintf(s == 1 ? \"i\" : s == -1 ? \"-i\" : s ? \"%+.2gi\" : \"\", s);\n\t\tprintf(i == n - 1 ?\"\\n\":\", \");\n\t}\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <complex>\n#include <cmath>\n#include <iostream>\n\ndouble const pi = 4 * std::atan(1);\n\nint main()\n{\n for (int n = 2; n <= 10; ++n)\n {\n std::cout << n << \": \";\n for (int k = 0; k < n; ++k)\n std::cout << std::polar(1, 2*pi*k/n) << \" \";\n std::cout << std::endl;\n }\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Numerics;\n\nclass Program\n{\n static IEnumerable<Complex> RootsOfUnity(int degree)\n {\n return Enumerable\n .Range(0, degree)\n .Select(element => Complex.FromPolarCoordinates(1, 2 * Math.PI * element / degree));\n }\n\n static void Main()\n {\n var degree = 3;\n foreach (var root in RootsOfUnity(degree))\n {\n Console.WriteLine(root);\n }\n }\n}\n","language":"C-sharp"},{"code":"# Find the n nth-roots of 1\nnth_roots_of_unity = (n) ->\n (complex_unit_vector(2*Math.PI*i/n) for i in [1..n])\n\ncomplex_unit_vector = (rad) ->\n new Complex(Math.cos(rad), Math.sin(rad))\n\nclass Complex\n constructor: (@real, @imag) ->\n toString: ->\n round_z = (n) ->\n if Math.abs(n) < 0.00005 then 0 else n\n fmt = (n) -> n.toFixed(3)\n real = round_z @real\n imag = round_z @imag\n s = ''\n if real and imag\n \"#{fmt real}+#{fmt imag}i\"\n else if real or !imag\n \"#{fmt real}\"\n else\n \"#{fmt imag}i\"\n\ndo ->\n for n in [2..5]\n console.log \"---1 to the 1/#{n}\"\n for root in nth_roots_of_unity n\n console.log root.toString()\n","language":"CoffeeScript"},{"code":"(defun roots-of-unity (n)\n (loop for i below n\n collect (cis (* pi (/ (* 2 i) n)))))\n","language":"Common-Lisp"},{"code":"define theta = 0, real = 0, imag = 0\ndefine pi = 3.14, n = 5\n\nfor m = 0 to n - 1\n\n\tlet theta = m * (pi * 2) / n\n\tlet real = cos(theta)\n\tlet imag = sin(theta)\n\n\tif imag >= 0 then\n\n\t\tprint real, comma, \" \", imag, \"i\"\n\n\telse\n\n\t\tprint real, comma, \" \", imag * -1, \"i\"\n\n\tendif\n\n\twait\n\nnext m\n","language":"Craft-Basic"},{"code":"require \"complex\"\n\ndef roots_of_unity(n)\n (0...n).map { |k| Math.exp((2 * Math::PI * k / n).i) }\nend\n\np roots_of_unity(3)\n","language":"Crystal"},{"code":"def roots_of_unity(n)\n (0...n).map { |k| Complex.new(Math.cos(2 * Math::PI * k / n), Math.sin(2 * Math::PI * k / n)) }\nend\n","language":"Crystal"},{"code":"import std.stdio, std.range, std.algorithm, std.complex;\nimport std.math: PI;\n\nauto nthRoots(in int n) pure nothrow {\n return n.iota.map!(k => expi(PI * 2 * (k + 1) / n));\n}\n\nvoid main() {\n foreach (immutable i; 1 .. 6)\n writefln(\"#%d: [%(%5.2f, %)]\", i, i.nthRoots);\n}\n","language":"D"},{"code":"program Roots_of_unity;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.VarCmplx;\n\nfunction RootOfUnity(degree: integer): Tarray<Variant>;\nvar\n k: Integer;\nbegin\n SetLength(result, degree);\n for k := 0 to degree - 1 do\n Result[k] := VarComplexFromPolar(1, 2 * pi * k / degree);\nend;\n\nconst\n n = 3;\nvar\n num: Variant;\nbegin\n Writeln('Root of unity from ', n, ':'#10);\n for num in RootOfUnity(n) do\n Writeln(num);\n Readln;\nend.\n","language":"Delphi"},{"code":"numfmt 4 0\nfor n = 2 to 5\n write n & \": \"\n for root = 0 to n - 1\n real = cos (360 * root / n)\n imag = sin (360 * root / n)\n write real & \" \" & imag & \"i\"\n if root <> n - 1\n write \", \"\n .\n .\n print \"\"\n.\n","language":"EasyLang"},{"code":"(define (roots-1 n)\n (define theta (// (* 2 PI) n))\n (for/list ((i n))\n (polar 1. (* theta i))))\n\n(roots-1 2)\n → (1+0i -1+0i)\n(roots-1 3)\n → (1+0i -0.4999999999999998+0.8660254037844388i -0.5000000000000004-0.8660254037844384i)\n(roots-1 4)\n → (1+0i 0+i -1+0i 0-i)\n","language":"EchoLisp"},{"code":"PROGRAM UNITY_ROOTS\n\n!\n! for rosettacode.org\n!\n\nBEGIN\n PRINT(CHR$(12);) !CLS\n N=5 ! this can be changed for any desired n\n ANGLE=0 ! start at ANGLE 0\n REPEAT\n REAL=COS(ANGLE) ! real axis is the x axis\n IF (ABS(REAL)<10^-5) THEN REAL=0 END IF ! get rid of annoying sci notation\n IMAG=SIN(ANGLE) ! imaginary axis is the y axis\n IF (ABS(IMAG)<10^-5) THEN IMAG=0 END IF ! get rid of annoying sci notation\n PRINT(REAL;\"+\";IMAG;\"i\") ! answer on every line\n ANGLE+=(2*π)/N\n ! all the way around the circle at even intervals\n UNTIL ANGLE>=2*π\nEND PROGRAM\n","language":"ERRE"},{"code":"USING: math.functions prettyprint ;\n\n1 3 roots .\n","language":"Factor"},{"code":": f0. ( f -- )\n fdup 0e 0.001e f~ if fdrop 0e then f. ;\n: .roots ( n -- )\n dup 1 do\n pi i 2* 0 d>f f* dup 0 d>f f/ ( F: radians )\n fsincos cr .\" real \" f0. .\" imag \" f0.\n loop drop ;\n\n3 set-precision\n5 .roots\n","language":"Forth"},{"code":"require fsl-util.fs\nrequire fsl/complex.fs\n\n: abs= 1E-12 F~ ;\n: clamp-to-0 FDUP 0E0 abs= IF FDROP 0E0 THEN ;\n: zclamp-to-0\n clamp-to-0 FSWAP\n clamp-to-0 FSWAP ;\n: .roots\n 1+ 2 DO\n I . .\" : \"\n I 0 DO\n 1E0 2E0 PI F* I S>F F* J S>F F/ polar> zclamp-to-0 z. SPACE\n LOOP\n CR\n LOOP ;\n3 SET-PRECISION\n5 .roots\n","language":"Forth"},{"code":"PROGRAM Roots\n\n COMPLEX :: root\n INTEGER :: i, n\n REAL :: angle, pi\n\n pi = 4.0 * ATAN(1.0)\n DO n = 2, 7\n angle = 0.0\n WRITE(*,\"(I1,A)\", ADVANCE=\"NO\") n,\": \"\n DO i = 1, n\n root = CMPLX(COS(angle), SIN(angle))\n WRITE(*,\"(SP,2F7.4,A)\", ADVANCE=\"NO\") root, \"j \"\n angle = angle + (2.0*pi / REAL(n))\n END DO\n WRITE(*,*)\n END DO\n\nEND PROGRAM Roots\n","language":"Fortran"},{"code":"program unity\n real, parameter :: pi = 3.141592653589793\n complex, parameter :: i = (0, 1)\n complex, dimension(0:7-1) :: unit_circle\n integer :: n, j\n\n do n = 2, 7\n !!!! KEY STEP, does all the calculations in one statement !!!!\n unit_circle(0:n-1) = exp(2*i*pi/n * (/ (j, j=0, n-1) /) )\n\n write(*,\"(i1,a)\", advance=\"no\") n, \": \"\n write(*,\"(sp,2f7.4,a)\", advance=\"no\") (unit_circle(j), \"j \", j = 0, n-1)\n write(*,*)\n end do\n end program unity\n","language":"Fortran"},{"code":"#define twopi 6.2831853071795864769252867665590057684\n\ndim as uinteger m, n\ndim as double real, imag, theta\ninput \"n? \", n\n\nfor m = 0 to n-1\n theta = m*twopi/n\n real = cos(theta)\n imag = sin(theta)\n if imag >= 0 then\n print using \"#.##### + #.##### i\"; real; imag\n else\n print using \"#.##### - #.##### i\"; real; -imag\n end if\nnext m\n","language":"FreeBASIC"},{"code":"roots[n] :=\n{\n a = makeArray[[n], 0]\n alpha = 360/n degrees\n theta = 0 degrees\n for k = 0 to length[a] - 1\n {\n a@k = cos[theta] + i sin[theta]\n theta = theta + alpha\n }\n a\n}\n","language":"Frink"},{"code":"import math.{exp, Pi}\n\ndef rootsOfUnity( n ) = {exp( 2Pi i k/n ) | k <- 0:n}\n\nprintln( rootsOfUnity(3) )\n","language":"FunL"},{"code":"window 1, @\"Roots of Unity\", (0,0,1050,200)\n\nlong n, root\ndouble real, imag\n\nfor n = 2 to 7\n print n;\":\" ;\n for root = 0 to n-1\n real = cos( 2 * pi * root / n)\n imag = sin( 2 * pi * root / n)\n print using \"-##.#####\"; real;using \"-##.#####\"; imag; \"i\";\n if root != n-1 then print \",\";\n next\n print\nnext\n\nHandleEvents\n","language":"FutureBasic"},{"code":"roots := n -> List([0 .. n-1], k -> E(n)^k);\n\nr:=roots(7);\n# [ 1, E(7), E(7)^2, E(7)^3, E(7)^4, E(7)^5, E(7)^6 ]\n\nList(r, x -> x^7);\n# [ 1, 1, 1, 1, 1, 1, 1 ]\n","language":"GAP"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n \"math/cmplx\"\n)\n\nfunc main() {\n for n := 2; n <= 5; n++ {\n fmt.Printf(\"%d roots of 1:\\n\", n)\n for _, r := range roots(n) {\n fmt.Printf(\" %18.15f\\n\", r)\n }\n }\n}\n\nfunc roots(n int) []complex128 {\n r := make([]complex128, n)\n for i := 0; i < n; i++ {\n r[i] = cmplx.Rect(1, 2*math.Pi*float64(i)/float64(n))\n }\n return r\n}\n","language":"Go"},{"code":"/** The following closure creates a list of n evenly-spaced points around the unit circle,\n * useful in FFT calculations, among other things */\ndef rootsOfUnity = { n ->\n (0..<n).collect {\n Complex.fromPolar(1, 2 * Math.PI * it / n)\n }\n}\n","language":"Groovy"},{"code":"def tol = 0.000000001 // tolerance: acceptable \"wrongness\" to account for rounding error\n\n((1..6) + [16]). each { n ->\n println \"rootsOfUnity(${n}):\"\n def rou = rootsOfUnity(n)\n rou.each { println it }\n assert rou[0] == 1\n def actual = n > 1 ? rou[Math.floor(n/2) as int] : rou[0]\n def expected = n > 1 ? (n%2 == 0) ? -1 : ~rou[Math.ceil(n/2) as int] : rou[0]\n def message = n > 1 ? (n%2 == 0) ? 'middle-most root should be -1' : 'two middle-most roots should be conjugates' : ''\n assert (actual - expected).abs() < tol : message\n assert rou.every { (it.rho - 1) < tol } : 'all roots should have magnitude 1'\n println()\n}\n","language":"Groovy"},{"code":"import Data.Complex (Complex, cis)\n\nrootsOfUnity :: (Enum a, Floating a) => a -> [Complex a]\nrootsOfUnity n =\n [ cis (2 * pi * k / n)\n | k <- [0 .. n - 1] ]\n\nmain :: IO ()\nmain = mapM_ print $ rootsOfUnity 3\n","language":"Haskell"},{"code":"1.0 :+ 0.0\n(-0.4999999999999998) :+ 0.8660254037844388\n(-0.5000000000000004) :+ (-0.8660254037844384)\n","language":"Haskell"},{"code":"procedure main()\n roots(10)\nend\n\nprocedure roots(n)\n every n := 2 to 10 do\n every writes(n | (str_rep((0 to (n-1)) * 2 * &pi / n)) | \"\\n\")\nend\n\nprocedure str_rep(k)\n return \" \" || cos(k) || \"+\" || sin(k) || \"i\"\nend\n","language":"Icon"},{"code":"n = 5\nprint, exp( dcomplex( 0, 2*!dpi/n) ) ^ ( 1 + indgen(n) )\n","language":"IDL"},{"code":"( 0.30901699, 0.95105652)( -0.80901699, 0.58778525)( -0.80901699, -0.58778525)( 0.30901699, -0.95105652)( 1.0000000, -1.1102230e-16)\n","language":"IDL"},{"code":" rou=: [: ^ 0j2p1 * i. % ]\n\n rou 4\n1 0j1 _1 0j_1\n\n rou 5\n1 0.309017j0.951057 _0.809017j0.587785 _0.809017j_0.587785 0.309017j_0.951057\n","language":"J"},{"code":"rou1=: 3 : 0\n z=. 0 $ r=. ^ o. 0j2 % y [ e=. 1\n for. i.y do.\n z=. z,e\n e=. e*r\n end.\n z\n)\n","language":"J"},{"code":"import java.util.Locale;\n\npublic class Test {\n\n public static void main(String[] a) {\n for (int n = 2; n < 6; n++)\n unity(n);\n }\n\n public static void unity(int n) {\n System.out.printf(\"%n%d: \", n);\n\n //all the way around the circle at even intervals\n for (double angle = 0; angle < 2 * Math.PI; angle += (2 * Math.PI) / n) {\n\n double real = Math.cos(angle); //real axis is the x axis\n\n if (Math.abs(real) < 1.0E-3)\n real = 0.0; //get rid of annoying sci notation\n\n double imag = Math.sin(angle); //imaginary axis is the y axis\n\n if (Math.abs(imag) < 1.0E-3)\n imag = 0.0;\n\n System.out.printf(Locale.US, \"(%9f,%9f) \", real, imag);\n }\n }\n}\n","language":"Java"},{"code":"function Root(angle) {\n\twith (Math) { this.r = cos(angle); this.i = sin(angle) }\n}\n\nRoot.prototype.toFixed = function(p) {\n\treturn this.r.toFixed(p) + (this.i >= 0 ? '+' : '') + this.i.toFixed(p) + 'i'\n}\n\nfunction roots(n) {\n\tvar rs = [], teta = 2*Math.PI/n\n\tfor (var angle=0, i=0; i<n; angle+=teta, i+=1) rs.push( new Root(angle) )\n\treturn rs\n}\n\nfor (var n=2; n<8; n+=1) {\n\tdocument.write(n, ': ')\n\tvar rs=roots(n); for (var i=0; i<rs.length; i+=1) document.write( i ? ', ' : '', rs[i].toFixed(5) )\n\tdocument.write('<br>')\n}\n","language":"JavaScript"},{"code":"def nthroots(n):\n (8 * (1|atan)) as $twopi\n | range(0;n) | (($twopi * .) / n) as $angle | [ ($angle | cos), ($angle | sin) ];\n\nnthroots(10)\n","language":"Jq"},{"code":"$ uname -a\nDarwin Mac-mini 13.3.0 Darwin Kernel Version 13.3.0: Tue Jun 3 21:27:35 PDT 2014; root:xnu-2422.110.17~1/RELEASE_X86_64 x86_64\n\n$ time jq -c -n -f Roots_of_unity.jq\n[1,0]\n[0.8090169943749475,0.5877852522924731]\n[0.30901699437494745,0.9510565162951535]\n[-0.30901699437494734,0.9510565162951536]\n[-0.8090169943749473,0.5877852522924732]\n[-1,1.2246467991473532e-16]\n[-0.8090169943749475,-0.587785252292473]\n[-0.30901699437494756,-0.9510565162951535]\n[0.30901699437494723,-0.9510565162951536]\n[0.8090169943749473,-0.5877852522924732]\n\nreal\t0m0.015s\nuser\t0m0.004s\nsys\t0m0.004s\n","language":"Jq"},{"code":"nthroots(n::Integer) = [ cospi(2k/n)+sinpi(2k/n)im for k = 0:n-1 ]\n","language":"Julia"},{"code":"import java.lang.Math.*\n\ndata class Complex(val r: Double, val i: Double) {\n override fun toString() = when {\n i == 0.0 -> r.toString()\n r == 0.0 -> i.toString() + 'i'\n else -> \"$r + ${i}i\"\n }\n}\n\nfun unity_roots(n: Number) = (1..n.toInt() - 1).map {\n val a = it * 2 * PI / n.toDouble()\n var r = cos(a); if (abs(r) < 1e-6) r = 0.0\n var i = sin(a); if (abs(i) < 1e-6) i = 0.0\n Complex(r, i)\n}\n\nfun main(args: Array<String>) {\n (1..4).forEach { println(listOf(1) + unity_roots(it)) }\n println(listOf(1) + unity_roots(5.0))\n}\n","language":"Kotlin"},{"code":"// cleandisp just to display 0 when n < 10^-10\n{def cleandisp\n {lambda {:n}\n {if {<= {abs :n} 1.e-10} then 0 else :n}}}\n-> cleandisp\n\n{def uroots\n {lambda {:n}\n {S.map {{lambda {:n :i}\n {let { {:theta {/ {* 2 {PI} :i} :n}}\n } {cons {cleandisp {cos :theta}}\n {cleandisp {sin :theta}}}}} :n}\n {S.serie 0 {- :n 1}}} }}\n-> uroots\n\n{S.map {lambda {:i} {hr}i = :i -> {uroots :i}} {S.serie 2 10}}\n-> i = 2 -> (1 0) (-1 0) i = 3 -> (1 0) (-0.4999999999999998 0.8660254037844388) (-0.5000000000000004 -0.8660254037844384)\ni = 4 -> (1 0) (0 1) (-1 0) (0 -1)\ni = 5 -> (1 0) (0.30901699437494745 0.9510565162951535) (-0.8090169943749473 0.5877852522924732) (-0.8090169943749475 -0.587785252292473) (0.30901699437494723 -0.9510565162951536)\ni = 6 -> (1 0) (0.5000000000000001 0.8660254037844386) (-0.4999999999999998 0.8660254037844388) (-1 0) (-0.5000000000000004 -0.8660254037844384) (0.5 -0.8660254037844386)\ni = 7 -> (1 0) (0.6234898018587336 0.7818314824680297) (-0.22252093395631434 0.9749279121818236) (-0.900968867902419 0.43388373911755823) (-0.9009688679024191 -0.433883739117558) (-0.2225209339563146 -0.9749279121818235) (0.6234898018587334 -0.7818314824680299)\ni = 8 -> (1 0) (0.7071067811865476 0.7071067811865475) (0 1) (-0.7071067811865475 0.7071067811865476) (-1 0) (-0.7071067811865477 -0.7071067811865475) (0 -1) (0.7071067811865475 -0.7071067811865477)\ni = 9 -> (1 0) (0.7660444431189781 0.6427876096865393) (0.17364817766693041 0.984807753012208) (-0.4999999999999998 0.8660254037844388) (-0.9396926207859083 0.3420201433256689) (-0.9396926207859084 -0.34202014332566866) (-0.5000000000000004 -0.8660254037844384) (0.17364817766692997 -0.9848077530122081) (0.7660444431189779 -0.6427876096865396)\ni = 10 -> (1 0) (0.8090169943749475 0.5877852522924731) (0.30901699437494745 0.9510565162951535) (-0.30901699437494734 0.9510565162951536) (-0.8090169943749473 0.5877852522924732) (-1 0) (-0.8090169943749475 -0.587785252292473) (-0.30901699437494756 -0.9510565162951535) (0.30901699437494723 -0.9510565162951536) (0.8090169943749473 -0.5877852522924732)\n","language":"Lambdatalk"},{"code":"WindowWidth =400\nWindowHeight =400\n\n'nomainwin\n\nopen \"N'th Roots of One\" for graphics_nsb_nf as #w\n\n#w \"trapclose [quit]\"\n\nfor n =1 To 10\n angle =0\n #w \"font arial 16 bold\"\n print n; \"th roots.\"\n #w \"cls\"\n #w \"size 1 ; goto 200 200 ; down ; color lightgray ; circle 150 ; size 10 ; set 200 200 ; size 2\"\n #w \"up ; goto 200 0 ; down ; goto 200 400 ; up ; goto 0 200 ; down ; goto 400 200\"\n #w \"up ; goto 40 20 ; down ; color black\"\n #w \"font arial 6\"\n #w \"\\\"; n; \" roots of 1.\"\n\n for i = 1 To n\n x = cos( Radian( angle))\n y = sin( Radian( angle))\n\n print using( \"##\", i); \": ( \" + using( \"##.######\", x);_\n \" +i *\" +using( \"##.######\", y); \") or e^( i *\"; i -1; \" *2 *Pi/ \"; n; \")\"\n\n #w \"color \"; 255 *i /n; \" 0 \"; 256 -255 *i /n\n #w \"up ; goto 200 200\"\n #w \"down ; goto \"; 200 +150 *x; \" \"; 200 -150 *y\n #w \"up ; goto \"; 200 +165 *x; \" \"; 200 -165 *y\n #w \"\\\"; str$( i)\n #w \"up\"\n\n angle =angle +360 /n\n\n next i\n\n timer 500, [on]\n wait\n [on]\n timer 0\nnext n\n\nwait\n\n[quit]\n close #w\n\n end\n\nfunction Radian( theta)\n Radian =theta *3.1415926535 /180\nend function\n","language":"Liberty-BASIC"},{"code":"--defines addition, subtraction, negation, multiplication, division, conjugation, norms, and a conversion to strgs.\ncomplex = setmetatable({\n__add = function(u, v) return complex(u.real + v.real, u.imag + v.imag) end,\n__sub = function(u, v) return complex(u.real - v.real, u.imag - v.imag) end,\n__mul = function(u, v) return complex(u.real * v.real - u.imag * v.imag, u.real * v.imag + u.imag * v.real) end,\n__div = function(u, v) return u * complex(v.real / v.norm, -v.imag / v.norm) end,\n__unm = function(u) return complex(-u.real, -u.imag) end,\n__concat = function(u, v)\n if type(u) == \"table\" then return u.real .. \" + \" .. u.imag .. \"i\" .. v\n\telseif type(u) == \"string\" or type(u) == \"number\" then return u .. v.real .. \" + \" .. v.imag .. \"i\"\n\tend end,\n__index = function(u, index)\n local operations = {\n norm = function(u) return u.real ^ 2 + u.imag ^ 2 end,\n conj = function(u) return complex(u.real, -u.imag) end,\n }\n return operations[index] and operations[index](u)\nend,\n__newindex = function() error() end\n}, {\n__call = function(z, realpart, imagpart) return setmetatable({real = realpart, imag = imagpart}, complex) end\n} )\nn = io.read() + 0\nval = complex(math.cos(2*math.pi / n), math.sin(2*math.pi / n))\nroot = complex(1, 0)\nfor i = 1, n do\n root = root * val\n print(root .. \"\")\nend\n","language":"Lua"},{"code":"RootsOfUnity := proc( n )\n solve(z^n = 1, z);\nend proc:\n","language":"Maple"},{"code":"for i from 2 to 6 do\n printf( \"%d: %a\\n\", i, [ RootsOfUnity(i) ] );\nend do;\n","language":"Maple"},{"code":"2: [1, -1]\n3: [1, -1/2-1/2*I*3^(1/2), -1/2+1/2*I*3^(1/2)]\n4: [1, -1, I, -I]\n5: [1, 1/4*5^(1/2)-1/4+1/4*I*2^(1/2)*(5+5^(1/2))^(1/2), -1/4*5^(1/2)-1/4+1/4*I*2^(1/2)*(5-5^(1/2))^(1/2), -1/4*5^(1/2)-1/4-1/4*I*2^(1/2)*(5-5^(1/2))^(1/2), 1/4*5^(1/2)-1/4-1/4*I*2^(1/2)*(5+5^(1/2))^(1/2)]\n6: [1, -1, 1/2*(-2-2*I*3^(1/2))^(1/2), -1/2*(-2-2*I*3^(1/2))^(1/2), 1/2*(-2+2*I*3^(1/2))^(1/2), -1/2*(-2+2*I*3^(1/2))^(1/2)]\n","language":"Maple"},{"code":"RootsUnity[nthroot_Integer?Positive] := Table[Exp[2 Pi I i/nthroot], {i, 0, nthroot - 1}]\n","language":"Mathematica"},{"code":"function z = rootsOfUnity(n)\n\n assert(n >= 1,'n >= 1');\n z = roots([1 zeros(1,n-1) -1]);\n\nend\n","language":"MATLAB"},{"code":">> rootsOfUnity(3)\n\nans =\n\n -0.500000000000000 + 0.866025403784439i\n -0.500000000000000 - 0.866025403784439i\n 1.000000000000000\n","language":"MATLAB"},{"code":"solve(1 = x^n, x)\n","language":"Maxima"},{"code":"for n:1 thru 5 do display(solve(1 = x^n, x));\n","language":"Maxima"},{"code":"solve(1 = x, x) = [x = 1]\nsolve(1 = x^2, x) = [x = -1, x = 1]\nsolve(1 = x^3, x) = [x = (sqrt(3)*%i-1)/2, x = -(sqrt(3)*%i+1)/2, x = 1]\nsolve(1 = x^4, x) = [x = %i, x = -1, x = -%i, x = 1]\nsolve(1 = x^5, x) = [x = %e^((2*%i*%pi)/5), x = %e^((4*%i*%pi)/5), x = %e^(-(4*%i*%pi)/5), x = %e^(-(2*%i*%pi)/5), x = 1]\n","language":"Maxima"},{"code":"complexRoots = function(n)\n result = []\n for i in range(0, n-1)\n real = cos(2*pi * i/n)\n if abs(real) < 1e-6 then real = 0\n imag = sin(2*pi * i/n)\n if abs(imag) < 1e-6 then imag = 0\n result.push real + \" \" + \"+\" * (imag>=0) + imag + \"i\"\n end for\n return result\nend function\n\nfor i in range(2,5)\n print i + \": \" + complexRoots(i).join(\", \")\nend for\n","language":"MiniScript"},{"code":"import complex, math, sequtils, strformat, strutils\n\nproc roots(n: Positive): seq[Complex64] =\n for k in 0..<n:\n result.add rect(1.0, 2 * k.float * Pi / n.float)\n\nproc toString(z: Complex64): string =\n &\"{z.re:.3f} + {z.im:.3f}i\"\n\nfor nr in 2..10:\n let result = roots(nr).map(toString).join(\", \")\n echo &\"{nr:2}: {result}\"\n","language":"Nim"},{"code":"open Complex\n\nlet pi = 4. *. atan 1.\n\nlet () =\n for n = 1 to 10 do\n Printf.printf \"%2d \" n;\n for k = 1 to n do\n let ret = polar 1. (2. *. pi *. float_of_int k /. float_of_int n) in\n Printf.printf \"(%f + %f i)\" ret.re ret.im\n done;\n print_newline ()\n done\n","language":"OCaml"},{"code":"for j = 2 : 10\n printf(\"*** %d\\n\", j);\n for n = 1 : j\n disp(exp(2i*pi*n/j));\n endfor\n disp(\"\");\nendfor\n","language":"Octave"},{"code":"/*REXX program computes the K roots of unity (which include complex roots).*/\nparse Version v\nSay v\nparse arg n frac . /*get optional arguments from the C.L. */\nif n=='' then n=1 /*Not specified? Then use the default.*/\nif frac='' then frac=5 /* \" \" \" \" \" \" */\nstart=abs(n) /*assume only one K is wanted. */\nif n<0 then start=1 /*Negative? Then use a range of K's. */\n /*display unity roots for a range, or */\n do k=start to abs(n) /* just for one K. */\n say right(k 'roots of unity',40,\"-\") /*display a pretty separator with title*/\n do angle=0 by 360/k for k /*compute the angle for each root. */\n rp=adjust(rxCalcCos(angle,,'D')) /*compute real part via COS function.*/\n if left(rp,1)\\=='-' then rp=\" \"rp /*not negative? Then pad with a blank.*/\n ip=adjust(rxCalcSin(angle,,'D')) /*compute imaginary part via SIN funct.*/\n if left(ip,1)\\=='-' then ip=\"+\"ip /*Not negative? Then pad with + char.*/\n if ip=0 then say rp /*Only real part? Ignore imaginary part*/\n else say left(rp,frac+4)ip'i' /*show the real & imaginary part*/\n end /*angle*/\n end /*k*/\nexit /*stick a fork in it, we're all done. */\n/*----------------------------------------------------------------------------*/\nadjust: parse arg x; near0='1e-' || (digits()-digits()%10) /*compute small #*/\n if abs(x)<near0 then x=0 /*if near zero, then assume zero.*/\n return format(x,,frac)/1 /*fraction digits past dec point.*/\n::requires rxMath library\n","language":"OoRexx"},{"code":"vector(n,k,exp(2*Pi*I*k/n))\n","language":"PARI-GP"},{"code":"nth_roots(n) = my(z);sqrtn(1,n,&z); vector(n,i, z^i);\n","language":"PARI-GP"},{"code":"sixth_root = quadgen(-3); /* 6th root of unity, exact */\nvector(6,n, sixth_root^n) /* all the 6'th roots */\n","language":"PARI-GP"},{"code":"Program Roots;\n\nvar\n root: record // poor man's complex type.\n r: real;\n i: real;\n end;\n i, n: integer;\n angle: real;\n\nbegin\n for n := 2 to 7 do\n begin\n angle := 0.0;\n write(n, ': ');\n for i := 1 to n do\n begin\n root.r := cos(angle);\n root.i := sin(angle);\n write(root.r:8:5, root.i:8:5, 'i ');\n angle := angle + (2.0 * pi / n);\n end;\n writeln;\n end;\nend.\n","language":"Pascal"},{"code":"use Math::Complex;\n\nforeach my $n (2 .. 10) {\n printf \"%2d\", $n;\n my @roots = root(1,$n);\n foreach my $root (@roots) {\n $root->display_format(style => 'cartesian', format => '%.3f');\n print \" $root\";\n }\n print \"\\n\";\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">10</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%2d:\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">real</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">cos</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #004600;\">PI</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">imag</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sin</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #004600;\">PI</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s %6.3f %6.3fi\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\",\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">real</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">imag</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"(load \"@lib/math.l\")\n\n(for N (range 2 10)\n (let Angle 0.0\n (prin N \": \")\n (for I N\n (let Ipart (sin Angle)\n (prin\n (round (cos Angle) 4)\n (if (lt0 Ipart) \"-\" \"+\")\n \"j\"\n (round (abs Ipart) 4)\n \" \" ) )\n (inc 'Angle (*/ 2 pi N)) )\n (prinl) ) )\n","language":"PicoLisp"},{"code":"complex_roots:\n procedure (N);\n declare N fixed binary nonassignable;\n declare x float, c fixed decimal (10,8) complex;\n declare twopi float initial ((4*asin(1.0)));\n\n do x = 0 to twopi by twopi/N;\n c = complex(cos(x), sin(x));\n put skip list (c);\n end;\nend complex_roots;\n\n 1.00000000+0.00000000I\n 0.80901700+0.58778524I\n 0.30901697+0.95105654I\n -0.30901703+0.95105648I\n -0.80901706+0.58778518I\n -1.00000000-0.00000008I\n -0.80901694-0.58778536I\n -0.30901709-0.95105648I\n 0.30901712-0.95105648I\n 0.80901724-0.58778494I\n","language":"PL-I"},{"code":"roots(N, Rs) :-\n succ(Pn, N), numlist(0, Pn, Ks),\n maplist(root(N), Ks, Rs).\n\nroot(N, M, R2) :-\n R0 is (2*M) rdiv N, % multiple of PI\n (R0 > 1 -> R1 is R0 - 2; R1 = R0), % adjust for principal values\n cis(R1, R2).\n\ncis(0, 1) :- !.\ncis(1, -1) :- !.\ncis(1 rdiv 2, i) :- !.\ncis(-1 rdiv 2, -i) :- !.\ncis(-1 rdiv Q, exp(-i*pi/Q)) :- !.\ncis(1 rdiv Q, exp(i*pi/Q)) :- !.\ncis(P rdiv Q, exp(P*i*pi/Q)).\n","language":"Prolog"},{"code":"OpenConsole()\nFor n = 2 To 10\n angle = 0\n PrintN(Str(n))\n For i = 1 To n\n x.f = Cos(Radian(angle))\n y.f = Sin(Radian(angle))\n PrintN( Str(i) + \": \" + StrF(x, 6) + \" / \" + StrF(y, 6))\n angle = angle + (360 / n)\n Next\nNext\nInput()\n","language":"PureBasic"},{"code":"import cmath\n\n\nclass Complex(complex):\n def __repr__(self):\n rp = '%7.5f' % self.real if not self.pureImag() else ''\n ip = '%7.5fj' % self.imag if not self.pureReal() else ''\n conj = '' if (\n self.pureImag() or self.pureReal() or self.imag < 0.0\n ) else '+'\n return '0.0' if (\n self.pureImag() and self.pureReal()\n ) else rp + conj + ip\n\n def pureImag(self):\n return abs(self.real) < 0.000005\n\n def pureReal(self):\n return abs(self.imag) < 0.000005\n\n\ndef croots(n):\n if n <= 0:\n return None\n return (Complex(cmath.rect(1, 2 * k * cmath.pi / n)) for k in range(n))\n # in pre-Python 2.6:\n # return (Complex(cmath.exp(2j*k*cmath.pi/n)) for k in range(n))\n\n\nfor nr in range(2, 11):\n print(nr, list(croots(nr)))\n","language":"Python"},{"code":"for(j in 2:10) {\n r <- sprintf(\"%d: \", j)\n for(n in 1:j) {\n r <- paste(r, format(exp(2i*pi*n/j), digits=4), ifelse(n<j, \",\", \"\"))\n }\n print(r)\n}\n","language":"R"},{"code":"#lang racket\n\n(define (roots-of-unity n)\n (for/list ([k n])\n (make-polar 1 (* k (/ (* 2 pi) n)))))\n","language":"Racket"},{"code":"constant n = 10;\nfor ^n -> \\k {\n say cis(k*τ/n);\n}\n","language":"Raku"},{"code":".say for 1.roots(9)\n","language":"Raku"},{"code":"/*REXX program computes the K roots of unity (which usually includes complex roots).*/\nnumeric digits length( pi() ) - length(.) /*use number of decimal digits in pi. */\nparse arg n frac . /*get optional arguments from the C.L. */\nif n=='' | n==\",\" then n= 1 /*Not specified? Then use the default.*/\nif frac='' | frac==\",\" then frac= 5 /* \" \" \" \" \" \" */\n start= abs(n) /*assume only one K is wanted. */\nif n<0 then start= 1 /*Negative? Then use a range of K's. */\n do #=start to abs(n) /*show unity roots (for a range or 1).*/\n say right(# 'roots of unity', 40, \"─\") ' (showing' frac \"fractional decimal digits)\"\n do angle=0 by pi*2/# for # /*compute the angle for each root. */\n Rp= adj( cos(angle) ) /*the real part via COS function.*/\n Ip= adj( sin(angle) ) /* \" imaginary \" \" SIN \" */\n if Rp>=0 then Rp= ' 'Rp /*Not neg? Then pad with a blank char.*/\n if Ip>=0 then Ip= '+'Ip /* \" \" \" \" \" \" plus \" */\n if Ip =0 then say Rp /*Only real part? Ignore imaginary part*/\n else say left(Rp,frac+4)Ip'i' /*display the real and imaginary part. */\n end /*angle*/\n end /*#*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nadj: parse arg x; if abs(x) < ('1e-')(digits()*9%10) then x= 0; return format(x,,frac)/1\npi: pi=3.141592653589793238462643383279502884197169399375105820974944592307816; return pi\nr2r: pi2= pi() + pi; return arg(1) // pi2 /*reduce #radians: -2pi ─► +2pi radians*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncos: procedure; parse arg x; x= r2r(x); a= abs(x); numeric fuzz min(9, digits() - 9)\n pi1_3=pi/3; if a=pi1_3 then return .5; if a=pi*.5 | a=pi2 then return 0\n if a=pi then return -1; if a=pi1_3*2 then return -.5; z= 1; _= 1; $x= x * x\n do k=2 by 2 until p=z; p=z; _= -_ * $x / (k*(k-1)); z= z + _; end; return z\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nsin: procedure; parse arg x; x= r2r(x); numeric fuzz min(5, digits() - 3)\n if abs(x)=pi then return 0; $x= x * x; z= x; _= x\n do k=2 by 2 until p=z; p=z; _= -_ * $x / (k*(k+1)); z= z + _; end; return z\n","language":"REXX"},{"code":"decimals(4)\nfor n = 2 to 5\n see string(n) + \" : \"\n for root = 0 to n-1\n real = cos(2*3.14 * root / n)\n imag = sin(2*3.14 * root / n)\n see \"\" + real + \" \" + imag + \"i\"\n if root != n-1 see \", \" ok\n next\n see nl\nnext\n","language":"Ring"},{"code":"// specify polynomial\n>> n = 10;\n>> a = zeros(1,n+1); a[1] = 1; a[n+1] = -1;\n>> polyroots(a)\n radius roots success\n>> polyroots(a).roots\n -0.309016994 + 0.951056516i\n -0.809016994 + 0.587785252i\n -1 + 5.95570041e-23i\n -0.809016994 - 0.587785252i\n -0.309016994 - 0.951056516i\n 0.309016994 - 0.951056516i\n 0.809016994 - 0.587785252i\n 1 + 0i\n 0.809016994 + 0.587785252i\n 0.309016994 + 0.951056516i\n","language":"RLaB"},{"code":"def roots_of_unity(n)\n (0...n).map {|k| Complex.polar(1, 2 * Math::PI * k / n)}\nend\n\np roots_of_unity(3)\n","language":"Ruby"},{"code":"PI = 3.1415926535\nFOR n = 2 TO 5\n PRINT n;\":\" ;\n FOR root = 0 TO n-1\n real = COS(2*PI * root / n)\n imag = SIN(2*PI * root / n)\n PRINT using(\"-##.#####\",real);using(\"-##.#####\",imag);\"i\";\n IF root <> n-1 then PRINT \",\" ;\n NEXT\n PRINT\nNEXT\n","language":"Run-BASIC"},{"code":"use num::Complex;\nfn main() {\n let n = 8;\n let z = Complex::from_polar(&1.0,&(1.0*std::f64::consts::PI/n as f64));\n for k in 0..=n-1 {\n println!(\"e^{:2}πi/{} ≈ {:>14.3}\",2*k,n,z.powf(2.0*k as f64));\n }\n}\n","language":"Rust"},{"code":"def rootsOfUnity(n:Int)=for(k <- 0 until n) yield Complex.fromPolar(1.0, 2*math.Pi*k/n)\n","language":"Scala"},{"code":"(define pi (* 4 (atan 1)))\n\n(do ((n 2 (+ n 1)))\n ((> n 10))\n (display n)\n (do ((k 0 (+ k 1)))\n ((>= k n))\n (display \" \")\n (display (make-polar 1 (* 2 pi (/ k n)))))\n (newline))\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n include \"float.s7i\";\n include \"complex.s7i\";\n\nconst proc: main is func\n local\n var integer: n is 0;\n var integer: k is 0;\n begin\n for n range 2 to 10 do\n write(n lpad 2 <& \": \");\n for k range 0 to pred(n) do\n write(polar(1.0, 2.0 * PI * flt(k) / flt(n)) digits 4 lpad 15 <& \" \");\n end for;\n writeln;\n end for;\n end func;\n","language":"Seed7"},{"code":"2: 1.0000+0.0000i -1.0000+0.0000i\n 3: 1.0000+0.0000i -0.5000+0.8660i -0.5000-0.8660i\n 4: 1.0000+0.0000i 0.0000+1.0000i -1.0000+0.0000i 0.0000-1.0000i\n 5: 1.0000+0.0000i 0.3090+0.9511i -0.8090+0.5878i -0.8090-0.5878i 0.3090-0.9511i\n 6: 1.0000+0.0000i 0.5000+0.8660i -0.5000+0.8660i -1.0000+0.0000i -0.5000-0.8660i 0.5000-0.8660i\n 7: 1.0000+0.0000i 0.6235+0.7818i -0.2225+0.9749i -0.9010+0.4339i -0.9010-0.4339i -0.2225-0.9749i 0.6235-0.7818i\n 8: 1.0000+0.0000i 0.7071+0.7071i 0.0000+1.0000i -0.7071+0.7071i -1.0000+0.0000i -0.7071-0.7071i 0.0000-1.0000i 0.7071-0.7071i\n 9: 1.0000+0.0000i 0.7660+0.6428i 0.1736+0.9848i -0.5000+0.8660i -0.9397+0.3420i -0.9397-0.3420i -0.5000-0.8660i 0.1736-0.9848i 0.7660-0.6428i\n10: 1.0000+0.0000i 0.8090+0.5878i 0.3090+0.9511i -0.3090+0.9511i -0.8090+0.5878i -1.0000+0.0000i -0.8090-0.5878i -0.3090-0.9511i 0.3090-0.9511i 0.8090-0.5878i\n","language":"Seed7"},{"code":"func roots_of_unity(n) {\n n.of { |j|\n exp(2i * Num.pi / n * j)\n }\n}\n\nroots_of_unity(5).each { |c|\n printf(\"%+.5f%+.5fi\\n\", c.reals)\n}\n","language":"Sidef"},{"code":"function unity_roots(n) {\n\t// nth-root(1) = cos(2 * k * pi / n) + i * sin(2 * k * pi / n)\n\treturn map(range(n), function(idx, k) {\n\t\treturn {\n\t\t\t\"re\": cos(2 * k * M_PI / n),\n\t\t\t\"im\": sin(2 * k * M_PI / n)\n\t\t};\n\t});\n}\n\n// pirnt 6th roots of unity\nforeach(unity_roots(6), function(k, v) {\n\tprintf(\"%.3f%+.3fi\\n\", v.re, v.im);\n});\n","language":"Sparkling"},{"code":"n=7\nexp(2i*pi()/n*(0::n-1))\n 1\n +-----------------------------+\n 1 | 1 |\n 2 | .623489802 + .781831482i |\n 3 | -.222520934 + .974927912i |\n 4 | -.900968868 + .433883739i |\n 5 | -.900968868 - .433883739i |\n 6 | -.222520934 - .974927912i |\n 7 | .623489802 - .781831482i |\n +-----------------------------+\n","language":"Stata"},{"code":"package require Tcl 8.5\nnamespace import tcl::mathfunc::*\n\nset pi 3.14159265\nfor {set n 2} {$n <= 10} {incr n} {\n set angle 0.0\n set row $n:\n for {set i 1} {$i <= $n} {incr i} {\n lappend row [format %5.4f%+5.4fi [cos $angle] [sin $angle]]\n set angle [expr {$angle + 2*$pi/$n}]\n }\n puts $row\n}\n","language":"Tcl"},{"code":"cZeros(x^n - 1, x)\n","language":"TI-89-BASIC"},{"code":"{-1/2+√(3)/2*i, -1/2-√(3)/2*i, 1}\n","language":"TI-89-BASIC"},{"code":"LET num_pi = 3.1415926\nLET n = 5 !this can be changed for any desired n\nLET angle = 0 !start at angle 0\nDO\n LET real = COS(angle) !real axis is the x axis\n IF (ABS(real) < 10^(-5)) THEN !get rid of annoying sci notation\n LET real = 0\n END IF\n LET imag = SIN(angle) !imaginary axis is the y axis\n IF (ABS(imag) < 10^(-5)) THEN !get rid of annoying sci notation\n LET imag = 0\n END IF\n PRINT real; \"+\"; imag; \"i\" !answer on every line\n LET angle = angle+(2*num_pi)/n\n !all the way around the circle at even intervals\nLOOP WHILE angle < 2*num_pi\nEND\n","language":"True-BASIC"},{"code":"#import std\n#import nat\n#import flo\n\nroots = ~&htxPC+ c..mul:-0^*DlSiiDlStK9\\iota c..mul@iiX+ c..cpow/-1.+ div/1.+ float\n\n#cast %jLL\n\ntests = roots* <1,2,3,4,5,6>\n","language":"Ursala"},{"code":"import math\n\nfor n in 2..6 {\n print(\"${n}: \")\n for root in 0..n {\n real := math.cos(2 * 3.14 * root/n)\n imag := math.sin(2 * 3.14 * root/n)\n print(\"${real:.4} ${imag:.4}i\")\n if root != n - 1 {print(\", \")}\n }\n println(\"\")\n}\n","language":"V-(Vlang)"},{"code":"Public Sub roots_of_unity()\n For n = 2 To 9\n Debug.Print n; \"th roots of 1:\"\n For r00t = 0 To n - 1\n Debug.Print \" Root \"; r00t & \": \"; WorksheetFunction.Complex(Cos(2 * WorksheetFunction.Pi() * r00t / n), _\n Sin(2 * WorksheetFunction.Pi() * r00t / n))\n Next r00t\n Debug.Print\n Next n\nEnd Sub\n","language":"VBA"},{"code":"import \"./complex\" for Complex\nimport \"./fmt\" for Fmt\n\nvar roots = Fn.new { |n|\n var r = List.filled(n, null)\n for (i in 0...n) r[i] = Complex.fromPolar(1, 2 * Num.pi * i / n)\n return r\n}\n\nfor (n in 2..5) {\n Fmt.print(\"$d roots of 1:\", n)\n for (r in roots.call(n)) Fmt.print(\" $ 0.14z\", r)\n}\n","language":"Wren"},{"code":"twopi = 2 * pi\nn = 5\n\nfor m = 0 to n-1\n theta = m*twopi/n\n real = cos(theta)\n imag = sin(theta)\n if imag >= 0 then\n print real using(\"##.########\"), \" + \", imag using(\"#.########\"), \"i\"\n else\n print real using(\"##.########\"), \" + \", -imag using(\"#.########\"), \"i\"\n end if\nnext m\n","language":"Yabasic"},{"code":"PI2:=(0.0).pi*2;\nforeach n,i in ([1..9],n){\n c:=s:=0;\n if(not i) c = 1;\n else if(n==4*i) s = 1;\n else if(n==2*i) c = -1;\n else if(3*n==4*i) s = -1;\n else a,c,s:=PI2*i/n,a.cos(),a.sin();\n\n if(c) print(\"%.2g\".fmt(c));\n print( (s==1 and \"i\") or (s==-1 and \"-i\" or (s and \"%+.2gi\" or\"\")).fmt(s));\n print( (i==n-1) and \"\\n\" or \", \");\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Roots_of_unity\\nnote: Arithmetic operations\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"The purpose of this task is to explore working with [https://en.wikipedia.org/wiki/Complex_number complex numbers].\\n\\n\\n;Task:\\nGiven <big>'''n'''</big>, find the <big>'''n'''<sup>th</sup></big> [[wp:Roots of unity|roots of unity]].\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F polar(r, theta)\\n R r * (cos(theta) + sin(theta) * 1i)\\n\\nF croots(n)\\n R (0 .< n).map(k -> polar(1, 2 * k * math:pi / @n))\\n\\nL(nr) 2..10\\n print(nr‘ ’croots(nr))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\nwith Ada.Float_Text_IO; use Ada.Float_Text_IO;\\nwith Ada.Numerics.Complex_Types; use Ada.Numerics.Complex_Types;\\n\\nprocedure Roots_Of_Unity is\\n Root : Complex;\\nbegin\\n for N in 2..10 loop\\n Put_Line (\\\"N =\\\" & Integer'Image (N));\\n for K in 0..N - 1 loop\\n Root :=\\n Compose_From_Polar\\n ( Modulus => 1.0,\\n Argument => Float (K),\\n Cycle => Float (N)\\n );\\n -- Output\\n Put (\\\" k =\\\" & Integer'Image (K) & \\\", \\\");\\n if Re (Root) < 0.0 then\\n Put (\\\"-\\\");\\n else\\n Put (\\\"+\\\");\\n end if;\\n Put (abs Re (Root), Fore => 1, Exp => 0);\\n if Im (Root) < 0.0 then\\n Put (\\\"-\\\");\\n else\\n Put (\\\"+\\\");\\n end if;\\n Put (abs Im (Root), Fore => 1, Exp => 0);\\n Put_Line (\\\"i\\\");\\n end loop;\\n end loop;\\nend Roots_Of_Unity;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"FORMAT complex fmt=$g(-6,4)\\\"⊥\\\"g(-6,4)$;\\nFOR root FROM 2 TO 10 DO\\n printf(($g(4)$,root));\\n FOR n FROM 0 TO root-1 DO\\n printf(($xf(complex fmt)$,complex exp( 0 I 2*pi*n/root)))\\n OD;\\n printf($l$)\\nOD\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"rect: function [r,phi][\\n to :complex @[ r * cos phi, r * sin phi ]\\n]\\nroots: function [n][\\n map 0..dec n 'k -> rect 1.0 2 * k * pi / n\\n]\\n\\nloop 2..10 'nr ->\\n print [pad to :string nr 3 \\\"=>\\\" join.with:\\\", \\\" to [:string] .format:\\\".3f\\\" roots nr]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"(*\\n\\nThis program has to be compiled without -std=c99, which patscc will\\ninsert unless you override the setting.\\n\\n##myatsccdef=\\\\\\npatscc \\\\\\n --gline \\\\\\n -atsccomp gcc \\\\\\n -I\\\"${PATSHOME}\\\" \\\\\\n -I\\\"${PATSHOME}/ccomp/runtime\\\" \\\\\\n -L\\\"${PATSHOME}/ccomp/atslib/lib\\\" \\\\\\n -DATS_MEMALLOC_LIBC \\\\\\n -o $fname($1) $1 -lm\\n\\n*)\\n\\n(*\\n\\n I use the C _Complex types, but not the newer _Imaginary types.\\n Thus I demonstrate how one might add new floating point types\\n nicely.\\n\\n (In my opinion, it is good to use m4 or similar tools when writing\\n such repetitive code. Doing so reduces both work and the frequency\\n of errors. Also you could then more easily add support for the many\\n extension types such as \\\"_Float128 complex\\\" (quadruple precision).\\n\\n One could, of course, define one's own complex types directly in\\n ATS.\\n\\n*)\\n\\n#include \\\"share/atspre_staload.hats\\\"\\n\\n#define ATS_EXTERN_PREFIX \\\"myatspre_\\\"\\n\\n#define NIL list_nil ()\\n#define :: list_cons\\n\\n(*------------------------------------------------------------------*)\\n\\n%{^\\n\\n#include <complex.h>\\n\\n#define myatspre_inline ATSinline ()\\n\\ntypedef float complex myatstype_fcomplex;\\ntypedef double complex myatstype_dcomplex;\\ntypedef long double complex myatstype_lcomplex;\\n\\n#define myatspre_CMPLXF CMPLXF\\n#define myatspre_CMPLX CMPLX\\n#define myatspre_CMPLXL CMPLXL\\n\\nmyatspre_inline atsvoid_t0ype\\nmyatspre_fprint_fcomplex (atstype_ref r,\\n myatstype_fcomplex x)\\n{\\n double rx = crealf (x);\\n double ix = cimagf (x);\\n const char *plus = (ix < 0) ? \\\"\\\" : \\\"+\\\";\\n fprintf ((FILE *) r, \\\"%f%s%fi\\\", rx, plus, ix);\\n}\\n\\n#define myatspre_print_fcomplex(x) myatspre_fprint_fcomplex (stdout, (x))\\n#define myatspre_prerr_fcomplex(x) myatspre_fprint_fcomplex (stderr, (x))\\n\\nmyatspre_inline atsvoid_t0ype\\nmyatspre_fprint_dcomplex (atstype_ref r,\\n myatstype_dcomplex x)\\n{\\n double rx = creal (x);\\n double ix = cimag (x);\\n const char *plus = (ix < 0) ? \\\"\\\" : \\\"+\\\";\\n fprintf ((FILE *) r, \\\"%f%s%fi\\\", rx, plus, ix);\\n}\\n\\n#define myatspre_print_dcomplex(x) myatspre_fprint_dcomplex (stdout, (x))\\n#define myatspre_prerr_dcomplex(x) myatspre_fprint_dcomplex (stderr, (x))\\n\\nmyatspre_inline atsvoid_t0ype\\nmyatspre_fprint_lcomplex (atstype_ref r,\\n myatstype_lcomplex x)\\n{\\n long double rx = creall (x);\\n long double ix = cimagl (x);\\n const char *plus = (ix < 0) ? \\\"\\\" : \\\"+\\\";\\n fprintf ((FILE *) r, \\\"%Lf%s%Lfi\\\", rx, plus, ix);\\n}\\n\\n#define myatspre_print_lcomplex(x) myatspre_fprint_lcomplex (stdout, (x))\\n#define myatspre_prerr_lcomplex(x) myatspre_fprint_lcomplex (stderr, (x))\\n\\nmyatspre_inline myatstype_fcomplex\\nmyatspre_g0float_cmplx_float_fcomplex (atstype_float x,\\n atstype_float y)\\n{\\n return myatspre_CMPLXF (x, y);\\n}\\n\\nmyatspre_inline myatstype_dcomplex\\nmyatspre_g0float_cmplx_double_dcomplex (atstype_double x,\\n atstype_double y)\\n{\\n return myatspre_CMPLX (x, y);\\n}\\n\\nmyatspre_inline myatstype_lcomplex\\nmyatspre_g0float_cmplx_ldouble_lcomplex (atstype_ldouble x,\\n atstype_ldouble y)\\n{\\n return myatspre_CMPLXL (x, y);\\n}\\n\\nmyatspre_inline myatstype_fcomplex\\nmyatspre_g0int2float_int_fcomplex (atstype_int x)\\n{\\n return x;\\n}\\n\\nmyatspre_inline myatstype_dcomplex\\nmyatspre_g0int2float_int_dcomplex (atstype_int x)\\n{\\n return x;\\n}\\n\\nmyatspre_inline myatstype_lcomplex\\nmyatspre_g0int2float_int_lcomplex (atstype_int x)\\n{\\n return x;\\n}\\n\\nmyatspre_inline myatstype_fcomplex\\nmyatspre_g0float_mul_fcomplex (myatstype_fcomplex x,\\n myatstype_fcomplex y)\\n{\\n return x * y;\\n}\\n\\nmyatspre_inline myatstype_dcomplex\\nmyatspre_g0float_mul_dcomplex (myatstype_dcomplex x,\\n myatstype_dcomplex y)\\n{\\n return x * y;\\n}\\n\\nmyatspre_inline myatstype_lcomplex\\nmyatspre_g0float_mul_lcomplex (myatstype_lcomplex x,\\n myatstype_lcomplex y)\\n{\\n return x * y;\\n}\\n\\nmyatspre_inline myatstype_fcomplex\\nmyatspre_exp_fcomplex (myatstype_fcomplex x)\\n{\\n return cexpf (x);\\n}\\n\\nmyatspre_inline myatstype_dcomplex\\nmyatspre_exp_dcomplex (myatstype_dcomplex x)\\n{\\n return cexp (x);\\n}\\n\\nmyatspre_inline myatstype_lcomplex\\nmyatspre_exp_lcomplex (myatstype_lcomplex x)\\n{\\n return cexpl (x);\\n}\\n\\nmyatspre_inline myatstype_fcomplex\\nmyatspre_pow_fcomplex (myatstype_fcomplex x,\\n myatstype_fcomplex y)\\n{\\n return cpowf (x, y);\\n}\\n\\nmyatspre_inline myatstype_dcomplex\\nmyatspre_pow_dcomplex (myatstype_dcomplex x,\\n myatstype_dcomplex y)\\n{\\n return cpow (x, y);\\n}\\n\\nmyatspre_inline myatstype_lcomplex\\nmyatspre_pow_lcomplex (myatstype_lcomplex x,\\n myatstype_lcomplex y)\\n{\\n return cpowl (x, y);\\n}\\n\\n%}\\n\\n(*------------------------------------------------------------------*)\\n\\ntkindef fcomplex_kind = \\\"myatstype_fcomplex\\\"\\nstadef fcmplxknd = fcomplex_kind\\nstadef fcomplex = g0float fcmplxknd\\n\\ntkindef dcomplex_kind = \\\"myatstype_dcomplex\\\"\\nstadef dcmplxknd = dcomplex_kind\\nstadef dcomplex = g0float dcmplxknd\\n\\ntkindef lcomplex_kind = \\\"myatstype_lcomplex\\\"\\nstadef lcmplxknd = lcomplex_kind\\nstadef lcomplex = g0float lcmplxknd\\n\\nextern fn print_fcomplex : fcomplex -<1> void = \\\"mac#%\\\"\\nextern fn prerr_fcomplex : fcomplex -<1> void = \\\"mac#%\\\"\\nextern fn fprint_fcomplex : fprint_type fcomplex = \\\"mac#%\\\"\\noverload print with print_fcomplex\\noverload prerr with prerr_fcomplex\\noverload fprint with fprint_fcomplex\\nimplement fprint_val<fcomplex> = fprint_fcomplex\\n\\nextern fn print_dcomplex : dcomplex -<1> void = \\\"mac#%\\\"\\nextern fn prerr_dcomplex : dcomplex -<1> void = \\\"mac#%\\\"\\nextern fn fprint_dcomplex : fprint_type dcomplex = \\\"mac#%\\\"\\noverload print with print_dcomplex\\noverload prerr with prerr_dcomplex\\noverload fprint with fprint_dcomplex\\nimplement fprint_val<dcomplex> = fprint_dcomplex\\n\\nextern fn print_lcomplex : lcomplex -<1> void = \\\"mac#%\\\"\\nextern fn prerr_lcomplex : lcomplex -<1> void = \\\"mac#%\\\"\\nextern fn fprint_lcomplex : fprint_type lcomplex = \\\"mac#%\\\"\\noverload print with print_lcomplex\\noverload prerr with prerr_lcomplex\\noverload fprint with fprint_lcomplex\\nimplement fprint_val<lcomplex> = fprint_lcomplex\\n\\nextern fn g0int2float_int_fcomplex : int -<> fcomplex = \\\"mac#%\\\"\\nextern fn g0int2float_int_dcomplex : int -<> dcomplex = \\\"mac#%\\\"\\nextern fn g0int2float_int_lcomplex : int -<> lcomplex = \\\"mac#%\\\"\\nimplement g0int2float<intknd,fcmplxknd> = g0int2float_int_fcomplex\\nimplement g0int2float<intknd,dcmplxknd> = g0int2float_int_dcomplex\\nimplement g0int2float<intknd,lcmplxknd> = g0int2float_int_lcomplex\\n\\nextern fn g0float_cmplx_float_fcomplex : (float, float) -<> fcomplex = \\\"mac#%\\\"\\nextern fn g0float_cmplx_double_dcomplex : (double, double) -<> dcomplex = \\\"mac#%\\\"\\nextern fn g0float_cmplx_ldouble_lcomplex : (ldouble, ldouble) -<> lcomplex = \\\"mac#%\\\"\\nextern fn {tk2 : tkind} {tk1 : tkind} g0float_cmplx : (g0float tk1, g0float tk1) -<> g0float tk2\\nimplement g0float_cmplx<fcmplxknd><fltknd> = g0float_cmplx_float_fcomplex\\nimplement g0float_cmplx<dcmplxknd><dblknd> = g0float_cmplx_double_dcomplex\\nimplement g0float_cmplx<lcmplxknd><ldblknd> = g0float_cmplx_ldouble_lcomplex\\noverload cmplx with g0float_cmplx\\n\\nextern fn g0float_mul_fcomplex : g0float_aop_type fcmplxknd = \\\"mac#%\\\"\\nextern fn g0float_mul_dcomplex : g0float_aop_type dcmplxknd = \\\"mac#%\\\"\\nextern fn g0float_mul_lcomplex : g0float_aop_type lcmplxknd = \\\"mac#%\\\"\\nimplement g0float_mul<fcmplxknd> = g0float_mul_fcomplex\\nimplement g0float_mul<dcmplxknd> = g0float_mul_dcomplex\\nimplement g0float_mul<lcmplxknd> = g0float_mul_lcomplex\\n\\n(*------------------------------------------------------------------*)\\n(* Most \\\"math\\\" functions are not defined in the prelude. Here we will\\n follow the conventions of libats/libc, which does not use the\\n floating point typekinds. *)\\n\\nstaload \\\"libats/libc/SATS/math.sats\\\"\\nstaload _ = \\\"libats/libc/DATS/math.dats\\\"\\n\\nextern fn exp_fcomplex : fcomplex -<> fcomplex = \\\"mac#%\\\"\\nextern fn exp_dcomplex : dcomplex -<> dcomplex = \\\"mac#%\\\"\\nextern fn exp_lcomplex : lcomplex -<> lcomplex = \\\"mac#%\\\"\\nimplement exp<fcomplex> = exp_fcomplex\\nimplement exp<dcomplex> = exp_dcomplex\\nimplement exp<lcomplex> = exp_lcomplex\\n\\nextern fn pow_fcomplex : (fcomplex, fcomplex) -<> fcomplex = \\\"mac#%\\\"\\nextern fn pow_dcomplex : (dcomplex, dcomplex) -<> dcomplex = \\\"mac#%\\\"\\nextern fn pow_lcomplex : (lcomplex, lcomplex) -<> lcomplex = \\\"mac#%\\\"\\nimplement pow<fcomplex> = pow_fcomplex\\nimplement pow<dcomplex> = pow_dcomplex\\nimplement pow<lcomplex> = pow_lcomplex\\n\\n(*------------------------------------------------------------------*)\\n\\nfn\\nnth_roots_of_unity\\n {n : pos}\\n (n : int n)\\n :<> list (dcomplex, n) =\\n let\\n val C = cmplx (0.0, ~((2.0 * M_PI) / g0i2f n))\\n\\n fun\\n loop {k : nat | k <= n}\\n .<k>.\\n (k : int k,\\n accum : list (dcomplex, n - k))\\n :<> list (dcomplex, n) =\\n if k = 0 then\\n accum\\n else\\n loop (pred k, exp (g0i2f (pred k) * C) :: accum)\\n in\\n loop (n, NIL)\\n end\\n\\nfn\\nnth_powers {m : int}\\n {n : pos}\\n (lst : list (dcomplex, m),\\n n : int n)\\n :<1> list (dcomplex, m) =\\n let\\n val nth : dcomplex = g0i2f n\\n implement list_map$fopr<dcomplex><dcomplex> x = pow (x, nth)\\n in\\n list_vt2t (list_map<dcomplex><dcomplex> lst)\\n end\\n\\nfn\\nshow_results\\n {n : pos}\\n (n : int n)\\n :<1> void =\\n let\\n val nth_roots = nth_roots_of_unity n\\n val ones = nth_powers (nth_roots, n)\\n in\\n println! ();\\n println! (\\\"roots of unity = \\\", nth_roots);\\n println! (\\\"roots raised \\\", n, \\\" = \\\", ones)\\n end\\n\\nfun\\nloop_over_args\\n {argc : int}\\n {k : pos | k <= argc}\\n {p_args : addr}\\n .<argc - k>.\\n (pf_args : !array_v (string, p_args, argc) |\\n argc : int argc,\\n p_args : ptr p_args,\\n k : int k)\\n :<1> void =\\n if k <> argc then\\n let\\n macdef args = !p_args\\n val argument = args[k]\\n val n = $extfcall ([n : int] int n, \\\"atoi\\\", argument)\\n in\\n if 0 < n then\\n show_results n;\\n loop_over_args (pf_args | argc, p_args, succ k)\\n end\\n\\nimplement\\nmain0 {argc} (argc, argv) =\\n let\\n val [p_args : addr]\\n @(pf_args, pf_minus | p_args) =\\n argv_takeout_strarr {argc} argv\\n\\n val () = loop_over_args {argc} {1} {p_args}\\n (pf_args | argc, p_args, 1)\\n\\n prval () = minus_addback (pf_minus, pf_args | argv)\\n in\\n println! ()\\n end\\n\\n(*------------------------------------------------------------------*)\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \"n := 8, a := 8*atan(1)/n\\nLoop %n%\\n i := A_Index-1, t .= cos(a*i) ((s:=sin(a*i))<0 ? \\\" - i*\\\" . -s : \\\" + i*\\\" . s) \\\"`n\\\"\\nMsgbox % t\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f ROOTS_OF_UNITY.AWK\\nBEGIN {\\n pi = 3.1415926\\n for (n=2; n<=5; n++) {\\n printf(\\\"%d: \\\",n)\\n for (root=0; root<=n-1; root++) {\\n real = cos(2 * pi * root / n)\\n imag = sin(2 * pi * root / n)\\n printf(\\\"%8.5f %8.5fi\\\",real,imag)\\n if (root != n-1) { printf(\\\", \\\") }\\n }\\n printf(\\\"\\\\n\\\")\\n }\\n exit(0)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \" CLS\\n PI = 3.1415926#\\n n = 5 'this can be changed for any desired n\\n angle = 0 'start at angle 0\\n DO\\n \\treal = COS(angle) 'real axis is the x axis\\n \\tIF (ABS(real) < 10 ^ -5) THEN real = 0 'get rid of annoying sci notation\\n \\timag = SIN(angle) 'imaginary axis is the y axis\\n \\tIF (ABS(imag) < 10 ^ -5) THEN imag = 0 'get rid of annoying sci notation\\n \\tPRINT real; \\\"+\\\"; imag; \\\"i\\\" 'answer on every line\\n \\tangle = angle + (2 * PI) / n\\n 'all the way around the circle at even intervals\\n LOOP WHILE angle < 2 * PI\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"twopi = 2 * pi\\nn = 5\\n\\nfor m = 0 to n-1\\n\\ttheta = m*twopi/n\\n\\treal = cos(theta)\\n\\timag = sin(theta)\\n\\tif imag >= 0 then\\n\\t\\tprint ljust(string(real),9,\\\"0\\\"); \\\" + \\\"; ljust(string(imag),13,\\\"0\\\"); \\\"i\\\"\\n\\telse\\n\\t\\tprint ljust(string(real),9,\\\"0\\\"); \\\" - \\\"; ljust(string(-imag),13,\\\"0\\\"); \\\"i\\\"\\n\\tend if\\nnext m\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \" @% = &20408\\n FOR n% = 2 TO 5\\n PRINT STR$(n%) \\\": \\\" ;\\n FOR root% = 0 TO n%-1\\n real = COS(2*PI * root% / n%)\\n imag = SIN(2*PI * root% / n%)\\n PRINT real imag \\\"i\\\" ;\\n IF root% <> n%-1 PRINT \\\",\\\" ;\\n NEXT\\n PRINT\\n NEXT n%\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <math.h>\\n\\nint main()\\n{\\n\\tdouble a, c, s, PI2 = atan2(1, 1) * 8;\\n\\tint n, i;\\n\\n\\tfor (n = 1; n < 10; n++) for (i = 0; i < n; i++) {\\n\\t\\tc = s = 0;\\n\\t\\tif (!i )\\t\\tc = 1;\\n\\t\\telse if(n == 4 * i)\\ts = 1;\\n\\t\\telse if(n == 2 * i)\\tc = -1;\\n\\t\\telse if(3 * n == 4 * i)\\ts = -1;\\n\\t\\telse\\n\\t\\t\\ta = i * PI2 / n, c = cos(a), s = sin(a);\\n\\n\\t\\tif (c) printf(\\\"%.2g\\\", c);\\n\\t\\tprintf(s == 1 ? \\\"i\\\" : s == -1 ? \\\"-i\\\" : s ? \\\"%+.2gi\\\" : \\\"\\\", s);\\n\\t\\tprintf(i == n - 1 ?\\\"\\\\n\\\":\\\", \\\");\\n\\t}\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <complex>\\n#include <cmath>\\n#include <iostream>\\n\\ndouble const pi = 4 * std::atan(1);\\n\\nint main()\\n{\\n for (int n = 2; n <= 10; ++n)\\n {\\n std::cout << n << \\\": \\\";\\n for (int k = 0; k < n; ++k)\\n std::cout << std::polar(1, 2*pi*k/n) << \\\" \\\";\\n std::cout << std::endl;\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\nusing System.Numerics;\\n\\nclass Program\\n{\\n static IEnumerable<Complex> RootsOfUnity(int degree)\\n {\\n return Enumerable\\n .Range(0, degree)\\n .Select(element => Complex.FromPolarCoordinates(1, 2 * Math.PI * element / degree));\\n }\\n\\n static void Main()\\n {\\n var degree = 3;\\n foreach (var root in RootsOfUnity(degree))\\n {\\n Console.WriteLine(root);\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"# Find the n nth-roots of 1\\nnth_roots_of_unity = (n) ->\\n (complex_unit_vector(2*Math.PI*i/n) for i in [1..n])\\n\\ncomplex_unit_vector = (rad) ->\\n new Complex(Math.cos(rad), Math.sin(rad))\\n\\nclass Complex\\n constructor: (@real, @imag) ->\\n toString: ->\\n round_z = (n) ->\\n if Math.abs(n) < 0.00005 then 0 else n\\n fmt = (n) -> n.toFixed(3)\\n real = round_z @real\\n imag = round_z @imag\\n s = ''\\n if real and imag\\n \\\"#{fmt real}+#{fmt imag}i\\\"\\n else if real or !imag\\n \\\"#{fmt real}\\\"\\n else\\n \\\"#{fmt imag}i\\\"\\n\\ndo ->\\n for n in [2..5]\\n console.log \\\"---1 to the 1/#{n}\\\"\\n for root in nth_roots_of_unity n\\n console.log root.toString()\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(defun roots-of-unity (n)\\n (loop for i below n\\n collect (cis (* pi (/ (* 2 i) n)))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"define theta = 0, real = 0, imag = 0\\ndefine pi = 3.14, n = 5\\n\\nfor m = 0 to n - 1\\n\\n\\tlet theta = m * (pi * 2) / n\\n\\tlet real = cos(theta)\\n\\tlet imag = sin(theta)\\n\\n\\tif imag >= 0 then\\n\\n\\t\\tprint real, comma, \\\" \\\", imag, \\\"i\\\"\\n\\n\\telse\\n\\n\\t\\tprint real, comma, \\\" \\\", imag * -1, \\\"i\\\"\\n\\n\\tendif\\n\\n\\twait\\n\\nnext m\\n\",\n \"language\": \"Craft-Basic\"\n },\n {\n \"code\": \"require \\\"complex\\\"\\n\\ndef roots_of_unity(n)\\n (0...n).map { |k| Math.exp((2 * Math::PI * k / n).i) }\\nend\\n\\np roots_of_unity(3)\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"def roots_of_unity(n)\\n (0...n).map { |k| Complex.new(Math.cos(2 * Math::PI * k / n), Math.sin(2 * Math::PI * k / n)) }\\nend\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio, std.range, std.algorithm, std.complex;\\nimport std.math: PI;\\n\\nauto nthRoots(in int n) pure nothrow {\\n return n.iota.map!(k => expi(PI * 2 * (k + 1) / n));\\n}\\n\\nvoid main() {\\n foreach (immutable i; 1 .. 6)\\n writefln(\\\"#%d: [%(%5.2f, %)]\\\", i, i.nthRoots);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Roots_of_unity;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.VarCmplx;\\n\\nfunction RootOfUnity(degree: integer): Tarray<Variant>;\\nvar\\n k: Integer;\\nbegin\\n SetLength(result, degree);\\n for k := 0 to degree - 1 do\\n Result[k] := VarComplexFromPolar(1, 2 * pi * k / degree);\\nend;\\n\\nconst\\n n = 3;\\nvar\\n num: Variant;\\nbegin\\n Writeln('Root of unity from ', n, ':'#10);\\n for num in RootOfUnity(n) do\\n Writeln(num);\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"numfmt 4 0\\nfor n = 2 to 5\\n write n & \\\": \\\"\\n for root = 0 to n - 1\\n real = cos (360 * root / n)\\n imag = sin (360 * root / n)\\n write real & \\\" \\\" & imag & \\\"i\\\"\\n if root <> n - 1\\n write \\\", \\\"\\n .\\n .\\n print \\\"\\\"\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"(define (roots-1 n)\\n (define theta (// (* 2 PI) n))\\n (for/list ((i n))\\n (polar 1. (* theta i))))\\n\\n(roots-1 2)\\n → (1+0i -1+0i)\\n(roots-1 3)\\n → (1+0i -0.4999999999999998+0.8660254037844388i -0.5000000000000004-0.8660254037844384i)\\n(roots-1 4)\\n → (1+0i 0+i -1+0i 0-i)\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"PROGRAM UNITY_ROOTS\\n\\n!\\n! for rosettacode.org\\n!\\n\\nBEGIN\\n PRINT(CHR$(12);) !CLS\\n N=5 ! this can be changed for any desired n\\n ANGLE=0 ! start at ANGLE 0\\n REPEAT\\n REAL=COS(ANGLE) ! real axis is the x axis\\n IF (ABS(REAL)<10^-5) THEN REAL=0 END IF ! get rid of annoying sci notation\\n IMAG=SIN(ANGLE) ! imaginary axis is the y axis\\n IF (ABS(IMAG)<10^-5) THEN IMAG=0 END IF ! get rid of annoying sci notation\\n PRINT(REAL;\\\"+\\\";IMAG;\\\"i\\\") ! answer on every line\\n ANGLE+=(2*π)/N\\n ! all the way around the circle at even intervals\\n UNTIL ANGLE>=2*π\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"USING: math.functions prettyprint ;\\n\\n1 3 roots .\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": f0. ( f -- )\\n fdup 0e 0.001e f~ if fdrop 0e then f. ;\\n: .roots ( n -- )\\n dup 1 do\\n pi i 2* 0 d>f f* dup 0 d>f f/ ( F: radians )\\n fsincos cr .\\\" real \\\" f0. .\\\" imag \\\" f0.\\n loop drop ;\\n\\n3 set-precision\\n5 .roots\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"require fsl-util.fs\\nrequire fsl/complex.fs\\n\\n: abs= 1E-12 F~ ;\\n: clamp-to-0 FDUP 0E0 abs= IF FDROP 0E0 THEN ;\\n: zclamp-to-0\\n clamp-to-0 FSWAP\\n clamp-to-0 FSWAP ;\\n: .roots\\n 1+ 2 DO\\n I . .\\\" : \\\"\\n I 0 DO\\n 1E0 2E0 PI F* I S>F F* J S>F F/ polar> zclamp-to-0 z. SPACE\\n LOOP\\n CR\\n LOOP ;\\n3 SET-PRECISION\\n5 .roots\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"PROGRAM Roots\\n\\n COMPLEX :: root\\n INTEGER :: i, n\\n REAL :: angle, pi\\n\\n pi = 4.0 * ATAN(1.0)\\n DO n = 2, 7\\n angle = 0.0\\n WRITE(*,\\\"(I1,A)\\\", ADVANCE=\\\"NO\\\") n,\\\": \\\"\\n DO i = 1, n\\n root = CMPLX(COS(angle), SIN(angle))\\n WRITE(*,\\\"(SP,2F7.4,A)\\\", ADVANCE=\\\"NO\\\") root, \\\"j \\\"\\n angle = angle + (2.0*pi / REAL(n))\\n END DO\\n WRITE(*,*)\\n END DO\\n\\nEND PROGRAM Roots\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"program unity\\n real, parameter :: pi = 3.141592653589793\\n complex, parameter :: i = (0, 1)\\n complex, dimension(0:7-1) :: unit_circle\\n integer :: n, j\\n\\n do n = 2, 7\\n !!!! KEY STEP, does all the calculations in one statement !!!!\\n unit_circle(0:n-1) = exp(2*i*pi/n * (/ (j, j=0, n-1) /) )\\n\\n write(*,\\\"(i1,a)\\\", advance=\\\"no\\\") n, \\\": \\\"\\n write(*,\\\"(sp,2f7.4,a)\\\", advance=\\\"no\\\") (unit_circle(j), \\\"j \\\", j = 0, n-1)\\n write(*,*)\\n end do\\n end program unity\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"#define twopi 6.2831853071795864769252867665590057684\\n\\ndim as uinteger m, n\\ndim as double real, imag, theta\\ninput \\\"n? \\\", n\\n\\nfor m = 0 to n-1\\n theta = m*twopi/n\\n real = cos(theta)\\n imag = sin(theta)\\n if imag >= 0 then\\n print using \\\"#.##### + #.##### i\\\"; real; imag\\n else\\n print using \\\"#.##### - #.##### i\\\"; real; -imag\\n end if\\nnext m\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"roots[n] :=\\n{\\n a = makeArray[[n], 0]\\n alpha = 360/n degrees\\n theta = 0 degrees\\n for k = 0 to length[a] - 1\\n {\\n a@k = cos[theta] + i sin[theta]\\n theta = theta + alpha\\n }\\n a\\n}\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"import math.{exp, Pi}\\n\\ndef rootsOfUnity( n ) = {exp( 2Pi i k/n ) | k <- 0:n}\\n\\nprintln( rootsOfUnity(3) )\\n\",\n \"language\": \"FunL\"\n },\n {\n \"code\": \"window 1, @\\\"Roots of Unity\\\", (0,0,1050,200)\\n\\nlong n, root\\ndouble real, imag\\n\\nfor n = 2 to 7\\n print n;\\\":\\\" ;\\n for root = 0 to n-1\\n real = cos( 2 * pi * root / n)\\n imag = sin( 2 * pi * root / n)\\n print using \\\"-##.#####\\\"; real;using \\\"-##.#####\\\"; imag; \\\"i\\\";\\n if root != n-1 then print \\\",\\\";\\n next\\n print\\nnext\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"roots := n -> List([0 .. n-1], k -> E(n)^k);\\n\\nr:=roots(7);\\n# [ 1, E(7), E(7)^2, E(7)^3, E(7)^4, E(7)^5, E(7)^6 ]\\n\\nList(r, x -> x^7);\\n# [ 1, 1, 1, 1, 1, 1, 1 ]\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n \\\"math/cmplx\\\"\\n)\\n\\nfunc main() {\\n for n := 2; n <= 5; n++ {\\n fmt.Printf(\\\"%d roots of 1:\\\\n\\\", n)\\n for _, r := range roots(n) {\\n fmt.Printf(\\\" %18.15f\\\\n\\\", r)\\n }\\n }\\n}\\n\\nfunc roots(n int) []complex128 {\\n r := make([]complex128, n)\\n for i := 0; i < n; i++ {\\n r[i] = cmplx.Rect(1, 2*math.Pi*float64(i)/float64(n))\\n }\\n return r\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"/** The following closure creates a list of n evenly-spaced points around the unit circle,\\n * useful in FFT calculations, among other things */\\ndef rootsOfUnity = { n ->\\n (0..<n).collect {\\n Complex.fromPolar(1, 2 * Math.PI * it / n)\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def tol = 0.000000001 // tolerance: acceptable \\\"wrongness\\\" to account for rounding error\\n\\n((1..6) + [16]). each { n ->\\n println \\\"rootsOfUnity(${n}):\\\"\\n def rou = rootsOfUnity(n)\\n rou.each { println it }\\n assert rou[0] == 1\\n def actual = n > 1 ? rou[Math.floor(n/2) as int] : rou[0]\\n def expected = n > 1 ? (n%2 == 0) ? -1 : ~rou[Math.ceil(n/2) as int] : rou[0]\\n def message = n > 1 ? (n%2 == 0) ? 'middle-most root should be -1' : 'two middle-most roots should be conjugates' : ''\\n assert (actual - expected).abs() < tol : message\\n assert rou.every { (it.rho - 1) < tol } : 'all roots should have magnitude 1'\\n println()\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Data.Complex (Complex, cis)\\n\\nrootsOfUnity :: (Enum a, Floating a) => a -> [Complex a]\\nrootsOfUnity n =\\n [ cis (2 * pi * k / n)\\n | k <- [0 .. n - 1] ]\\n\\nmain :: IO ()\\nmain = mapM_ print $ rootsOfUnity 3\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"1.0 :+ 0.0\\n(-0.4999999999999998) :+ 0.8660254037844388\\n(-0.5000000000000004) :+ (-0.8660254037844384)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\n roots(10)\\nend\\n\\nprocedure roots(n)\\n every n := 2 to 10 do\\n every writes(n | (str_rep((0 to (n-1)) * 2 * &pi / n)) | \\\"\\\\n\\\")\\nend\\n\\nprocedure str_rep(k)\\n return \\\" \\\" || cos(k) || \\\"+\\\" || sin(k) || \\\"i\\\"\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"n = 5\\nprint, exp( dcomplex( 0, 2*!dpi/n) ) ^ ( 1 + indgen(n) )\\n\",\n \"language\": \"IDL\"\n },\n {\n \"code\": \"( 0.30901699, 0.95105652)( -0.80901699, 0.58778525)( -0.80901699, -0.58778525)( 0.30901699, -0.95105652)( 1.0000000, -1.1102230e-16)\\n\",\n \"language\": \"IDL\"\n },\n {\n \"code\": \" rou=: [: ^ 0j2p1 * i. % ]\\n\\n rou 4\\n1 0j1 _1 0j_1\\n\\n rou 5\\n1 0.309017j0.951057 _0.809017j0.587785 _0.809017j_0.587785 0.309017j_0.951057\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"rou1=: 3 : 0\\n z=. 0 $ r=. ^ o. 0j2 % y [ e=. 1\\n for. i.y do.\\n z=. z,e\\n e=. e*r\\n end.\\n z\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.Locale;\\n\\npublic class Test {\\n\\n public static void main(String[] a) {\\n for (int n = 2; n < 6; n++)\\n unity(n);\\n }\\n\\n public static void unity(int n) {\\n System.out.printf(\\\"%n%d: \\\", n);\\n\\n //all the way around the circle at even intervals\\n for (double angle = 0; angle < 2 * Math.PI; angle += (2 * Math.PI) / n) {\\n\\n double real = Math.cos(angle); //real axis is the x axis\\n\\n if (Math.abs(real) < 1.0E-3)\\n real = 0.0; //get rid of annoying sci notation\\n\\n double imag = Math.sin(angle); //imaginary axis is the y axis\\n\\n if (Math.abs(imag) < 1.0E-3)\\n imag = 0.0;\\n\\n System.out.printf(Locale.US, \\\"(%9f,%9f) \\\", real, imag);\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function Root(angle) {\\n\\twith (Math) { this.r = cos(angle); this.i = sin(angle) }\\n}\\n\\nRoot.prototype.toFixed = function(p) {\\n\\treturn this.r.toFixed(p) + (this.i >= 0 ? '+' : '') + this.i.toFixed(p) + 'i'\\n}\\n\\nfunction roots(n) {\\n\\tvar rs = [], teta = 2*Math.PI/n\\n\\tfor (var angle=0, i=0; i<n; angle+=teta, i+=1) rs.push( new Root(angle) )\\n\\treturn rs\\n}\\n\\nfor (var n=2; n<8; n+=1) {\\n\\tdocument.write(n, ': ')\\n\\tvar rs=roots(n); for (var i=0; i<rs.length; i+=1) document.write( i ? ', ' : '', rs[i].toFixed(5) )\\n\\tdocument.write('<br>')\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def nthroots(n):\\n (8 * (1|atan)) as $twopi\\n | range(0;n) | (($twopi * .) / n) as $angle | [ ($angle | cos), ($angle | sin) ];\\n\\nnthroots(10)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ uname -a\\nDarwin Mac-mini 13.3.0 Darwin Kernel Version 13.3.0: Tue Jun 3 21:27:35 PDT 2014; root:xnu-2422.110.17~1/RELEASE_X86_64 x86_64\\n\\n$ time jq -c -n -f Roots_of_unity.jq\\n[1,0]\\n[0.8090169943749475,0.5877852522924731]\\n[0.30901699437494745,0.9510565162951535]\\n[-0.30901699437494734,0.9510565162951536]\\n[-0.8090169943749473,0.5877852522924732]\\n[-1,1.2246467991473532e-16]\\n[-0.8090169943749475,-0.587785252292473]\\n[-0.30901699437494756,-0.9510565162951535]\\n[0.30901699437494723,-0.9510565162951536]\\n[0.8090169943749473,-0.5877852522924732]\\n\\nreal\\t0m0.015s\\nuser\\t0m0.004s\\nsys\\t0m0.004s\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"nthroots(n::Integer) = [ cospi(2k/n)+sinpi(2k/n)im for k = 0:n-1 ]\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import java.lang.Math.*\\n\\ndata class Complex(val r: Double, val i: Double) {\\n override fun toString() = when {\\n i == 0.0 -> r.toString()\\n r == 0.0 -> i.toString() + 'i'\\n else -> \\\"$r + ${i}i\\\"\\n }\\n}\\n\\nfun unity_roots(n: Number) = (1..n.toInt() - 1).map {\\n val a = it * 2 * PI / n.toDouble()\\n var r = cos(a); if (abs(r) < 1e-6) r = 0.0\\n var i = sin(a); if (abs(i) < 1e-6) i = 0.0\\n Complex(r, i)\\n}\\n\\nfun main(args: Array<String>) {\\n (1..4).forEach { println(listOf(1) + unity_roots(it)) }\\n println(listOf(1) + unity_roots(5.0))\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"// cleandisp just to display 0 when n < 10^-10\\n{def cleandisp\\n {lambda {:n}\\n {if {<= {abs :n} 1.e-10} then 0 else :n}}}\\n-> cleandisp\\n\\n{def uroots\\n {lambda {:n}\\n {S.map {{lambda {:n :i}\\n {let { {:theta {/ {* 2 {PI} :i} :n}}\\n } {cons {cleandisp {cos :theta}}\\n {cleandisp {sin :theta}}}}} :n}\\n {S.serie 0 {- :n 1}}} }}\\n-> uroots\\n\\n{S.map {lambda {:i} {hr}i = :i -> {uroots :i}} {S.serie 2 10}}\\n-> i = 2 -> (1 0) (-1 0) i = 3 -> (1 0) (-0.4999999999999998 0.8660254037844388) (-0.5000000000000004 -0.8660254037844384)\\ni = 4 -> (1 0) (0 1) (-1 0) (0 -1)\\ni = 5 -> (1 0) (0.30901699437494745 0.9510565162951535) (-0.8090169943749473 0.5877852522924732) (-0.8090169943749475 -0.587785252292473) (0.30901699437494723 -0.9510565162951536)\\ni = 6 -> (1 0) (0.5000000000000001 0.8660254037844386) (-0.4999999999999998 0.8660254037844388) (-1 0) (-0.5000000000000004 -0.8660254037844384) (0.5 -0.8660254037844386)\\ni = 7 -> (1 0) (0.6234898018587336 0.7818314824680297) (-0.22252093395631434 0.9749279121818236) (-0.900968867902419 0.43388373911755823) (-0.9009688679024191 -0.433883739117558) (-0.2225209339563146 -0.9749279121818235) (0.6234898018587334 -0.7818314824680299)\\ni = 8 -> (1 0) (0.7071067811865476 0.7071067811865475) (0 1) (-0.7071067811865475 0.7071067811865476) (-1 0) (-0.7071067811865477 -0.7071067811865475) (0 -1) (0.7071067811865475 -0.7071067811865477)\\ni = 9 -> (1 0) (0.7660444431189781 0.6427876096865393) (0.17364817766693041 0.984807753012208) (-0.4999999999999998 0.8660254037844388) (-0.9396926207859083 0.3420201433256689) (-0.9396926207859084 -0.34202014332566866) (-0.5000000000000004 -0.8660254037844384) (0.17364817766692997 -0.9848077530122081) (0.7660444431189779 -0.6427876096865396)\\ni = 10 -> (1 0) (0.8090169943749475 0.5877852522924731) (0.30901699437494745 0.9510565162951535) (-0.30901699437494734 0.9510565162951536) (-0.8090169943749473 0.5877852522924732) (-1 0) (-0.8090169943749475 -0.587785252292473) (-0.30901699437494756 -0.9510565162951535) (0.30901699437494723 -0.9510565162951536) (0.8090169943749473 -0.5877852522924732)\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"WindowWidth =400\\nWindowHeight =400\\n\\n'nomainwin\\n\\nopen \\\"N'th Roots of One\\\" for graphics_nsb_nf as #w\\n\\n#w \\\"trapclose [quit]\\\"\\n\\nfor n =1 To 10\\n angle =0\\n #w \\\"font arial 16 bold\\\"\\n print n; \\\"th roots.\\\"\\n #w \\\"cls\\\"\\n #w \\\"size 1 ; goto 200 200 ; down ; color lightgray ; circle 150 ; size 10 ; set 200 200 ; size 2\\\"\\n #w \\\"up ; goto 200 0 ; down ; goto 200 400 ; up ; goto 0 200 ; down ; goto 400 200\\\"\\n #w \\\"up ; goto 40 20 ; down ; color black\\\"\\n #w \\\"font arial 6\\\"\\n #w \\\"\\\\\\\"; n; \\\" roots of 1.\\\"\\n\\n for i = 1 To n\\n x = cos( Radian( angle))\\n y = sin( Radian( angle))\\n\\n print using( \\\"##\\\", i); \\\": ( \\\" + using( \\\"##.######\\\", x);_\\n \\\" +i *\\\" +using( \\\"##.######\\\", y); \\\") or e^( i *\\\"; i -1; \\\" *2 *Pi/ \\\"; n; \\\")\\\"\\n\\n #w \\\"color \\\"; 255 *i /n; \\\" 0 \\\"; 256 -255 *i /n\\n #w \\\"up ; goto 200 200\\\"\\n #w \\\"down ; goto \\\"; 200 +150 *x; \\\" \\\"; 200 -150 *y\\n #w \\\"up ; goto \\\"; 200 +165 *x; \\\" \\\"; 200 -165 *y\\n #w \\\"\\\\\\\"; str$( i)\\n #w \\\"up\\\"\\n\\n angle =angle +360 /n\\n\\n next i\\n\\n timer 500, [on]\\n wait\\n [on]\\n timer 0\\nnext n\\n\\nwait\\n\\n[quit]\\n close #w\\n\\n end\\n\\nfunction Radian( theta)\\n Radian =theta *3.1415926535 /180\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"--defines addition, subtraction, negation, multiplication, division, conjugation, norms, and a conversion to strgs.\\ncomplex = setmetatable({\\n__add = function(u, v) return complex(u.real + v.real, u.imag + v.imag) end,\\n__sub = function(u, v) return complex(u.real - v.real, u.imag - v.imag) end,\\n__mul = function(u, v) return complex(u.real * v.real - u.imag * v.imag, u.real * v.imag + u.imag * v.real) end,\\n__div = function(u, v) return u * complex(v.real / v.norm, -v.imag / v.norm) end,\\n__unm = function(u) return complex(-u.real, -u.imag) end,\\n__concat = function(u, v)\\n if type(u) == \\\"table\\\" then return u.real .. \\\" + \\\" .. u.imag .. \\\"i\\\" .. v\\n\\telseif type(u) == \\\"string\\\" or type(u) == \\\"number\\\" then return u .. v.real .. \\\" + \\\" .. v.imag .. \\\"i\\\"\\n\\tend end,\\n__index = function(u, index)\\n local operations = {\\n norm = function(u) return u.real ^ 2 + u.imag ^ 2 end,\\n conj = function(u) return complex(u.real, -u.imag) end,\\n }\\n return operations[index] and operations[index](u)\\nend,\\n__newindex = function() error() end\\n}, {\\n__call = function(z, realpart, imagpart) return setmetatable({real = realpart, imag = imagpart}, complex) end\\n} )\\nn = io.read() + 0\\nval = complex(math.cos(2*math.pi / n), math.sin(2*math.pi / n))\\nroot = complex(1, 0)\\nfor i = 1, n do\\n root = root * val\\n print(root .. \\\"\\\")\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"RootsOfUnity := proc( n )\\n solve(z^n = 1, z);\\nend proc:\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"for i from 2 to 6 do\\n printf( \\\"%d: %a\\\\n\\\", i, [ RootsOfUnity(i) ] );\\nend do;\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"2: [1, -1]\\n3: [1, -1/2-1/2*I*3^(1/2), -1/2+1/2*I*3^(1/2)]\\n4: [1, -1, I, -I]\\n5: [1, 1/4*5^(1/2)-1/4+1/4*I*2^(1/2)*(5+5^(1/2))^(1/2), -1/4*5^(1/2)-1/4+1/4*I*2^(1/2)*(5-5^(1/2))^(1/2), -1/4*5^(1/2)-1/4-1/4*I*2^(1/2)*(5-5^(1/2))^(1/2), 1/4*5^(1/2)-1/4-1/4*I*2^(1/2)*(5+5^(1/2))^(1/2)]\\n6: [1, -1, 1/2*(-2-2*I*3^(1/2))^(1/2), -1/2*(-2-2*I*3^(1/2))^(1/2), 1/2*(-2+2*I*3^(1/2))^(1/2), -1/2*(-2+2*I*3^(1/2))^(1/2)]\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"RootsUnity[nthroot_Integer?Positive] := Table[Exp[2 Pi I i/nthroot], {i, 0, nthroot - 1}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function z = rootsOfUnity(n)\\n\\n assert(n >= 1,'n >= 1');\\n z = roots([1 zeros(1,n-1) -1]);\\n\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \">> rootsOfUnity(3)\\n\\nans =\\n\\n -0.500000000000000 + 0.866025403784439i\\n -0.500000000000000 - 0.866025403784439i\\n 1.000000000000000\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"solve(1 = x^n, x)\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"for n:1 thru 5 do display(solve(1 = x^n, x));\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"solve(1 = x, x) = [x = 1]\\nsolve(1 = x^2, x) = [x = -1, x = 1]\\nsolve(1 = x^3, x) = [x = (sqrt(3)*%i-1)/2, x = -(sqrt(3)*%i+1)/2, x = 1]\\nsolve(1 = x^4, x) = [x = %i, x = -1, x = -%i, x = 1]\\nsolve(1 = x^5, x) = [x = %e^((2*%i*%pi)/5), x = %e^((4*%i*%pi)/5), x = %e^(-(4*%i*%pi)/5), x = %e^(-(2*%i*%pi)/5), x = 1]\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"complexRoots = function(n)\\n result = []\\n for i in range(0, n-1)\\n real = cos(2*pi * i/n)\\n if abs(real) < 1e-6 then real = 0\\n imag = sin(2*pi * i/n)\\n if abs(imag) < 1e-6 then imag = 0\\n result.push real + \\\" \\\" + \\\"+\\\" * (imag>=0) + imag + \\\"i\\\"\\n end for\\n return result\\nend function\\n\\nfor i in range(2,5)\\n print i + \\\": \\\" + complexRoots(i).join(\\\", \\\")\\nend for\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"import complex, math, sequtils, strformat, strutils\\n\\nproc roots(n: Positive): seq[Complex64] =\\n for k in 0..<n:\\n result.add rect(1.0, 2 * k.float * Pi / n.float)\\n\\nproc toString(z: Complex64): string =\\n &\\\"{z.re:.3f} + {z.im:.3f}i\\\"\\n\\nfor nr in 2..10:\\n let result = roots(nr).map(toString).join(\\\", \\\")\\n echo &\\\"{nr:2}: {result}\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"open Complex\\n\\nlet pi = 4. *. atan 1.\\n\\nlet () =\\n for n = 1 to 10 do\\n Printf.printf \\\"%2d \\\" n;\\n for k = 1 to n do\\n let ret = polar 1. (2. *. pi *. float_of_int k /. float_of_int n) in\\n Printf.printf \\\"(%f + %f i)\\\" ret.re ret.im\\n done;\\n print_newline ()\\n done\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"for j = 2 : 10\\n printf(\\\"*** %d\\\\n\\\", j);\\n for n = 1 : j\\n disp(exp(2i*pi*n/j));\\n endfor\\n disp(\\\"\\\");\\nendfor\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"/*REXX program computes the K roots of unity (which include complex roots).*/\\nparse Version v\\nSay v\\nparse arg n frac . /*get optional arguments from the C.L. */\\nif n=='' then n=1 /*Not specified? Then use the default.*/\\nif frac='' then frac=5 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nstart=abs(n) /*assume only one K is wanted. */\\nif n<0 then start=1 /*Negative? Then use a range of K's. */\\n /*display unity roots for a range, or */\\n do k=start to abs(n) /* just for one K. */\\n say right(k 'roots of unity',40,\\\"-\\\") /*display a pretty separator with title*/\\n do angle=0 by 360/k for k /*compute the angle for each root. */\\n rp=adjust(rxCalcCos(angle,,'D')) /*compute real part via COS function.*/\\n if left(rp,1)\\\\=='-' then rp=\\\" \\\"rp /*not negative? Then pad with a blank.*/\\n ip=adjust(rxCalcSin(angle,,'D')) /*compute imaginary part via SIN funct.*/\\n if left(ip,1)\\\\=='-' then ip=\\\"+\\\"ip /*Not negative? Then pad with + char.*/\\n if ip=0 then say rp /*Only real part? Ignore imaginary part*/\\n else say left(rp,frac+4)ip'i' /*show the real & imaginary part*/\\n end /*angle*/\\n end /*k*/\\nexit /*stick a fork in it, we're all done. */\\n/*----------------------------------------------------------------------------*/\\nadjust: parse arg x; near0='1e-' || (digits()-digits()%10) /*compute small #*/\\n if abs(x)<near0 then x=0 /*if near zero, then assume zero.*/\\n return format(x,,frac)/1 /*fraction digits past dec point.*/\\n::requires rxMath library\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"vector(n,k,exp(2*Pi*I*k/n))\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"nth_roots(n) = my(z);sqrtn(1,n,&z); vector(n,i, z^i);\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"sixth_root = quadgen(-3); /* 6th root of unity, exact */\\nvector(6,n, sixth_root^n) /* all the 6'th roots */\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"Program Roots;\\n\\nvar\\n root: record // poor man's complex type.\\n r: real;\\n i: real;\\n end;\\n i, n: integer;\\n angle: real;\\n\\nbegin\\n for n := 2 to 7 do\\n begin\\n angle := 0.0;\\n write(n, ': ');\\n for i := 1 to n do\\n begin\\n root.r := cos(angle);\\n root.i := sin(angle);\\n write(root.r:8:5, root.i:8:5, 'i ');\\n angle := angle + (2.0 * pi / n);\\n end;\\n writeln;\\n end;\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use Math::Complex;\\n\\nforeach my $n (2 .. 10) {\\n printf \\\"%2d\\\", $n;\\n my @roots = root(1,$n);\\n foreach my $root (@roots) {\\n $root->display_format(style => 'cartesian', format => '%.3f');\\n print \\\" $root\\\";\\n }\\n print \\\"\\\\n\\\";\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">10</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%2d:\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">real</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">cos</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #004600;\\\">PI</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">imag</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sin</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #004600;\\\">PI</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s %6.3f %6.3fi\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\",\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">real</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">imag</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(load \\\"@lib/math.l\\\")\\n\\n(for N (range 2 10)\\n (let Angle 0.0\\n (prin N \\\": \\\")\\n (for I N\\n (let Ipart (sin Angle)\\n (prin\\n (round (cos Angle) 4)\\n (if (lt0 Ipart) \\\"-\\\" \\\"+\\\")\\n \\\"j\\\"\\n (round (abs Ipart) 4)\\n \\\" \\\" ) )\\n (inc 'Angle (*/ 2 pi N)) )\\n (prinl) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"complex_roots:\\n procedure (N);\\n declare N fixed binary nonassignable;\\n declare x float, c fixed decimal (10,8) complex;\\n declare twopi float initial ((4*asin(1.0)));\\n\\n do x = 0 to twopi by twopi/N;\\n c = complex(cos(x), sin(x));\\n put skip list (c);\\n end;\\nend complex_roots;\\n\\n 1.00000000+0.00000000I\\n 0.80901700+0.58778524I\\n 0.30901697+0.95105654I\\n -0.30901703+0.95105648I\\n -0.80901706+0.58778518I\\n -1.00000000-0.00000008I\\n -0.80901694-0.58778536I\\n -0.30901709-0.95105648I\\n 0.30901712-0.95105648I\\n 0.80901724-0.58778494I\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"roots(N, Rs) :-\\n succ(Pn, N), numlist(0, Pn, Ks),\\n maplist(root(N), Ks, Rs).\\n\\nroot(N, M, R2) :-\\n R0 is (2*M) rdiv N, % multiple of PI\\n (R0 > 1 -> R1 is R0 - 2; R1 = R0), % adjust for principal values\\n cis(R1, R2).\\n\\ncis(0, 1) :- !.\\ncis(1, -1) :- !.\\ncis(1 rdiv 2, i) :- !.\\ncis(-1 rdiv 2, -i) :- !.\\ncis(-1 rdiv Q, exp(-i*pi/Q)) :- !.\\ncis(1 rdiv Q, exp(i*pi/Q)) :- !.\\ncis(P rdiv Q, exp(P*i*pi/Q)).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"OpenConsole()\\nFor n = 2 To 10\\n angle = 0\\n PrintN(Str(n))\\n For i = 1 To n\\n x.f = Cos(Radian(angle))\\n y.f = Sin(Radian(angle))\\n PrintN( Str(i) + \\\": \\\" + StrF(x, 6) + \\\" / \\\" + StrF(y, 6))\\n angle = angle + (360 / n)\\n Next\\nNext\\nInput()\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import cmath\\n\\n\\nclass Complex(complex):\\n def __repr__(self):\\n rp = '%7.5f' % self.real if not self.pureImag() else ''\\n ip = '%7.5fj' % self.imag if not self.pureReal() else ''\\n conj = '' if (\\n self.pureImag() or self.pureReal() or self.imag < 0.0\\n ) else '+'\\n return '0.0' if (\\n self.pureImag() and self.pureReal()\\n ) else rp + conj + ip\\n\\n def pureImag(self):\\n return abs(self.real) < 0.000005\\n\\n def pureReal(self):\\n return abs(self.imag) < 0.000005\\n\\n\\ndef croots(n):\\n if n <= 0:\\n return None\\n return (Complex(cmath.rect(1, 2 * k * cmath.pi / n)) for k in range(n))\\n # in pre-Python 2.6:\\n # return (Complex(cmath.exp(2j*k*cmath.pi/n)) for k in range(n))\\n\\n\\nfor nr in range(2, 11):\\n print(nr, list(croots(nr)))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"for(j in 2:10) {\\n r <- sprintf(\\\"%d: \\\", j)\\n for(n in 1:j) {\\n r <- paste(r, format(exp(2i*pi*n/j), digits=4), ifelse(n<j, \\\",\\\", \\\"\\\"))\\n }\\n print(r)\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (roots-of-unity n)\\n (for/list ([k n])\\n (make-polar 1 (* k (/ (* 2 pi) n)))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"constant n = 10;\\nfor ^n -> \\\\k {\\n say cis(k*τ/n);\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \".say for 1.roots(9)\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program computes the K roots of unity (which usually includes complex roots).*/\\nnumeric digits length( pi() ) - length(.) /*use number of decimal digits in pi. */\\nparse arg n frac . /*get optional arguments from the C.L. */\\nif n=='' | n==\\\",\\\" then n= 1 /*Not specified? Then use the default.*/\\nif frac='' | frac==\\\",\\\" then frac= 5 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n start= abs(n) /*assume only one K is wanted. */\\nif n<0 then start= 1 /*Negative? Then use a range of K's. */\\n do #=start to abs(n) /*show unity roots (for a range or 1).*/\\n say right(# 'roots of unity', 40, \\\"─\\\") ' (showing' frac \\\"fractional decimal digits)\\\"\\n do angle=0 by pi*2/# for # /*compute the angle for each root. */\\n Rp= adj( cos(angle) ) /*the real part via COS function.*/\\n Ip= adj( sin(angle) ) /* \\\" imaginary \\\" \\\" SIN \\\" */\\n if Rp>=0 then Rp= ' 'Rp /*Not neg? Then pad with a blank char.*/\\n if Ip>=0 then Ip= '+'Ip /* \\\" \\\" \\\" \\\" \\\" \\\" plus \\\" */\\n if Ip =0 then say Rp /*Only real part? Ignore imaginary part*/\\n else say left(Rp,frac+4)Ip'i' /*display the real and imaginary part. */\\n end /*angle*/\\n end /*#*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nadj: parse arg x; if abs(x) < ('1e-')(digits()*9%10) then x= 0; return format(x,,frac)/1\\npi: pi=3.141592653589793238462643383279502884197169399375105820974944592307816; return pi\\nr2r: pi2= pi() + pi; return arg(1) // pi2 /*reduce #radians: -2pi ─► +2pi radians*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncos: procedure; parse arg x; x= r2r(x); a= abs(x); numeric fuzz min(9, digits() - 9)\\n pi1_3=pi/3; if a=pi1_3 then return .5; if a=pi*.5 | a=pi2 then return 0\\n if a=pi then return -1; if a=pi1_3*2 then return -.5; z= 1; _= 1; $x= x * x\\n do k=2 by 2 until p=z; p=z; _= -_ * $x / (k*(k-1)); z= z + _; end; return z\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nsin: procedure; parse arg x; x= r2r(x); numeric fuzz min(5, digits() - 3)\\n if abs(x)=pi then return 0; $x= x * x; z= x; _= x\\n do k=2 by 2 until p=z; p=z; _= -_ * $x / (k*(k+1)); z= z + _; end; return z\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"decimals(4)\\nfor n = 2 to 5\\n see string(n) + \\\" : \\\"\\n for root = 0 to n-1\\n real = cos(2*3.14 * root / n)\\n imag = sin(2*3.14 * root / n)\\n see \\\"\\\" + real + \\\" \\\" + imag + \\\"i\\\"\\n if root != n-1 see \\\", \\\" ok\\n next\\n see nl\\nnext\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"// specify polynomial\\n>> n = 10;\\n>> a = zeros(1,n+1); a[1] = 1; a[n+1] = -1;\\n>> polyroots(a)\\n radius roots success\\n>> polyroots(a).roots\\n -0.309016994 + 0.951056516i\\n -0.809016994 + 0.587785252i\\n -1 + 5.95570041e-23i\\n -0.809016994 - 0.587785252i\\n -0.309016994 - 0.951056516i\\n 0.309016994 - 0.951056516i\\n 0.809016994 - 0.587785252i\\n 1 + 0i\\n 0.809016994 + 0.587785252i\\n 0.309016994 + 0.951056516i\\n\",\n \"language\": \"RLaB\"\n },\n {\n \"code\": \"def roots_of_unity(n)\\n (0...n).map {|k| Complex.polar(1, 2 * Math::PI * k / n)}\\nend\\n\\np roots_of_unity(3)\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"PI = 3.1415926535\\nFOR n = 2 TO 5\\n PRINT n;\\\":\\\" ;\\n FOR root = 0 TO n-1\\n real = COS(2*PI * root / n)\\n imag = SIN(2*PI * root / n)\\n PRINT using(\\\"-##.#####\\\",real);using(\\\"-##.#####\\\",imag);\\\"i\\\";\\n IF root <> n-1 then PRINT \\\",\\\" ;\\n NEXT\\n PRINT\\nNEXT\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use num::Complex;\\nfn main() {\\n let n = 8;\\n let z = Complex::from_polar(&1.0,&(1.0*std::f64::consts::PI/n as f64));\\n for k in 0..=n-1 {\\n println!(\\\"e^{:2}πi/{} ≈ {:>14.3}\\\",2*k,n,z.powf(2.0*k as f64));\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"def rootsOfUnity(n:Int)=for(k <- 0 until n) yield Complex.fromPolar(1.0, 2*math.Pi*k/n)\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define pi (* 4 (atan 1)))\\n\\n(do ((n 2 (+ n 1)))\\n ((> n 10))\\n (display n)\\n (do ((k 0 (+ k 1)))\\n ((>= k n))\\n (display \\\" \\\")\\n (display (make-polar 1 (* 2 pi (/ k n)))))\\n (newline))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"float.s7i\\\";\\n include \\\"complex.s7i\\\";\\n\\nconst proc: main is func\\n local\\n var integer: n is 0;\\n var integer: k is 0;\\n begin\\n for n range 2 to 10 do\\n write(n lpad 2 <& \\\": \\\");\\n for k range 0 to pred(n) do\\n write(polar(1.0, 2.0 * PI * flt(k) / flt(n)) digits 4 lpad 15 <& \\\" \\\");\\n end for;\\n writeln;\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"2: 1.0000+0.0000i -1.0000+0.0000i\\n 3: 1.0000+0.0000i -0.5000+0.8660i -0.5000-0.8660i\\n 4: 1.0000+0.0000i 0.0000+1.0000i -1.0000+0.0000i 0.0000-1.0000i\\n 5: 1.0000+0.0000i 0.3090+0.9511i -0.8090+0.5878i -0.8090-0.5878i 0.3090-0.9511i\\n 6: 1.0000+0.0000i 0.5000+0.8660i -0.5000+0.8660i -1.0000+0.0000i -0.5000-0.8660i 0.5000-0.8660i\\n 7: 1.0000+0.0000i 0.6235+0.7818i -0.2225+0.9749i -0.9010+0.4339i -0.9010-0.4339i -0.2225-0.9749i 0.6235-0.7818i\\n 8: 1.0000+0.0000i 0.7071+0.7071i 0.0000+1.0000i -0.7071+0.7071i -1.0000+0.0000i -0.7071-0.7071i 0.0000-1.0000i 0.7071-0.7071i\\n 9: 1.0000+0.0000i 0.7660+0.6428i 0.1736+0.9848i -0.5000+0.8660i -0.9397+0.3420i -0.9397-0.3420i -0.5000-0.8660i 0.1736-0.9848i 0.7660-0.6428i\\n10: 1.0000+0.0000i 0.8090+0.5878i 0.3090+0.9511i -0.3090+0.9511i -0.8090+0.5878i -1.0000+0.0000i -0.8090-0.5878i -0.3090-0.9511i 0.3090-0.9511i 0.8090-0.5878i\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"func roots_of_unity(n) {\\n n.of { |j|\\n exp(2i * Num.pi / n * j)\\n }\\n}\\n\\nroots_of_unity(5).each { |c|\\n printf(\\\"%+.5f%+.5fi\\\\n\\\", c.reals)\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"function unity_roots(n) {\\n\\t// nth-root(1) = cos(2 * k * pi / n) + i * sin(2 * k * pi / n)\\n\\treturn map(range(n), function(idx, k) {\\n\\t\\treturn {\\n\\t\\t\\t\\\"re\\\": cos(2 * k * M_PI / n),\\n\\t\\t\\t\\\"im\\\": sin(2 * k * M_PI / n)\\n\\t\\t};\\n\\t});\\n}\\n\\n// pirnt 6th roots of unity\\nforeach(unity_roots(6), function(k, v) {\\n\\tprintf(\\\"%.3f%+.3fi\\\\n\\\", v.re, v.im);\\n});\\n\",\n \"language\": \"Sparkling\"\n },\n {\n \"code\": \"n=7\\nexp(2i*pi()/n*(0::n-1))\\n 1\\n +-----------------------------+\\n 1 | 1 |\\n 2 | .623489802 + .781831482i |\\n 3 | -.222520934 + .974927912i |\\n 4 | -.900968868 + .433883739i |\\n 5 | -.900968868 - .433883739i |\\n 6 | -.222520934 - .974927912i |\\n 7 | .623489802 - .781831482i |\\n +-----------------------------+\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"package require Tcl 8.5\\nnamespace import tcl::mathfunc::*\\n\\nset pi 3.14159265\\nfor {set n 2} {$n <= 10} {incr n} {\\n set angle 0.0\\n set row $n:\\n for {set i 1} {$i <= $n} {incr i} {\\n lappend row [format %5.4f%+5.4fi [cos $angle] [sin $angle]]\\n set angle [expr {$angle + 2*$pi/$n}]\\n }\\n puts $row\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"cZeros(x^n - 1, x)\\n\",\n \"language\": \"TI-89-BASIC\"\n },\n {\n \"code\": \"{-1/2+√(3)/2*i, -1/2-√(3)/2*i, 1}\\n\",\n \"language\": \"TI-89-BASIC\"\n },\n {\n \"code\": \"LET num_pi = 3.1415926\\nLET n = 5 !this can be changed for any desired n\\nLET angle = 0 !start at angle 0\\nDO\\n LET real = COS(angle) !real axis is the x axis\\n IF (ABS(real) < 10^(-5)) THEN !get rid of annoying sci notation\\n LET real = 0\\n END IF\\n LET imag = SIN(angle) !imaginary axis is the y axis\\n IF (ABS(imag) < 10^(-5)) THEN !get rid of annoying sci notation\\n LET imag = 0\\n END IF\\n PRINT real; \\\"+\\\"; imag; \\\"i\\\" !answer on every line\\n LET angle = angle+(2*num_pi)/n\\n !all the way around the circle at even intervals\\nLOOP WHILE angle < 2*num_pi\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"#import std\\n#import nat\\n#import flo\\n\\nroots = ~&htxPC+ c..mul:-0^*DlSiiDlStK9\\\\iota c..mul@iiX+ c..cpow/-1.+ div/1.+ float\\n\\n#cast %jLL\\n\\ntests = roots* <1,2,3,4,5,6>\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"import math\\n\\nfor n in 2..6 {\\n print(\\\"${n}: \\\")\\n for root in 0..n {\\n real := math.cos(2 * 3.14 * root/n)\\n imag := math.sin(2 * 3.14 * root/n)\\n print(\\\"${real:.4} ${imag:.4}i\\\")\\n if root != n - 1 {print(\\\", \\\")}\\n }\\n println(\\\"\\\")\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Public Sub roots_of_unity()\\n For n = 2 To 9\\n Debug.Print n; \\\"th roots of 1:\\\"\\n For r00t = 0 To n - 1\\n Debug.Print \\\" Root \\\"; r00t & \\\": \\\"; WorksheetFunction.Complex(Cos(2 * WorksheetFunction.Pi() * r00t / n), _\\n Sin(2 * WorksheetFunction.Pi() * r00t / n))\\n Next r00t\\n Debug.Print\\n Next n\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"import \\\"./complex\\\" for Complex\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar roots = Fn.new { |n|\\n var r = List.filled(n, null)\\n for (i in 0...n) r[i] = Complex.fromPolar(1, 2 * Num.pi * i / n)\\n return r\\n}\\n\\nfor (n in 2..5) {\\n Fmt.print(\\\"$d roots of 1:\\\", n)\\n for (r in roots.call(n)) Fmt.print(\\\" $ 0.14z\\\", r)\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"twopi = 2 * pi\\nn = 5\\n\\nfor m = 0 to n-1\\n theta = m*twopi/n\\n real = cos(theta)\\n imag = sin(theta)\\n if imag >= 0 then\\n print real using(\\\"##.########\\\"), \\\" + \\\", imag using(\\\"#.########\\\"), \\\"i\\\"\\n else\\n print real using(\\\"##.########\\\"), \\\" + \\\", -imag using(\\\"#.########\\\"), \\\"i\\\"\\n end if\\nnext m\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"PI2:=(0.0).pi*2;\\nforeach n,i in ([1..9],n){\\n c:=s:=0;\\n if(not i) c = 1;\\n else if(n==4*i) s = 1;\\n else if(n==2*i) c = -1;\\n else if(3*n==4*i) s = -1;\\n else a,c,s:=PI2*i/n,a.cos(),a.sin();\\n\\n if(c) print(\\\"%.2g\\\".fmt(c));\\n print( (s==1 and \\\"i\\\") or (s==-1 and \\\"-i\\\" or (s and \\\"%+.2gi\\\" or\\\"\\\")).fmt(s));\\n print( (i==n-1) and \\\"\\\\n\\\" or \\\", \\\");\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Roots-of-unity"}}},{"rowIdx":1591,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Rosetta_Code/Count_examples\nnote: Rosetta Code related\n","language":"00-META"},{"code":"Find the total number of programming examples for each [[:Category:Programming Tasks|task]] and the total for all tasks.\n\nEssentially, count the number of occurrences of <tt>=={{header|</tt> on each task page.\n\nOutput:\n\n<pre>100 doors: 20 examples.\n99 Bottles of Beer: 29 examples.\nAbstract type: 10 examples.\n\nTotal: X examples.</pre>\n\nFor a full output, updated periodically, see [[Rosetta Code/Count examples/Full list]].\n\nYou'll need to use the Media Wiki API, which you can find out about locally, [http://rosettacode.org/mw/api.php here], or in Media Wiki's API documentation at, [http://www.mediawiki.org/wiki/API_Query API:Query]\n\n","language":"00-TASK"},{"code":"with Aws.Client, Aws.Messages, Aws.Response, Aws.Resources, Aws.Url;\nwith Dom.Readers, Dom.Core, Dom.Core.Documents, Dom.Core.Nodes, Dom.Core.Attrs;\nwith Input_Sources.Strings, Unicode, Unicode.Ces.Utf8;\nwith Ada.Strings.Unbounded, Ada.Strings.Fixed, Ada.Text_IO, Ada.Command_Line;\nwith Ada.Containers.Vectors;\n\nuse Aws.Client, Aws.Messages, Aws.Response, Aws.Resources, Aws.Url;\nuse Dom.Readers, Dom.Core, Dom.Core.Documents, Dom.Core.Nodes, Dom.Core.Attrs;\nuse Aws, Ada.Strings.Unbounded, Ada.Strings.Fixed, Input_Sources.Strings;\nuse Ada.Text_IO, Ada.Command_Line;\n\nprocedure Count_Examples is\n\n package Members_Vectors is new Ada.Containers.Vectors (\n Index_Type => Positive,\n Element_Type => Unbounded_String);\n use Members_Vectors;\n\n Exemples : Vector;\n Nbr_Lg, Total : Natural := 0;\n\n procedure Get_Vector (Category : in String; Mbr_Vector : in out Vector) is\n Reader : Tree_Reader;\n Doc : Document;\n List : Node_List;\n N : Node;\n A : Attr;\n Page : Aws.Response.Data;\n Uri_Xml : constant String :=\n \"http://rosettacode.org/mw/api.php?action=query&list=categorymembers\"\n &\n \"&format=xml&cmlimit=500&cmtitle=Category:\";\n begin\n Page := Client.Get (Uri_Xml & Category);\n if Response.Status_Code (Page) not in Messages.Success then\n raise Client.Connection_Error;\n end if;\n declare\n Xml : constant String := Message_Body (Page);\n Source : String_Input;\n begin\n Open\n (Xml'Unrestricted_Access,\n Unicode.Ces.Utf8.Utf8_Encoding,\n Source);\n Parse (Reader, Source);\n Close (Source);\n end;\n Doc := Get_Tree (Reader);\n List := Get_Elements_By_Tag_Name (Doc, \"cm\");\n for Index in 1 .. Length (List) loop\n N := Item (List, Index - 1);\n A := Get_Named_Item (Attributes (N), \"title\");\n Append (Mbr_Vector, To_Unbounded_String (Value (A)));\n end loop;\n Free (List);\n Free (Reader);\n end Get_Vector;\n\n function Scan_Page (Title : String) return Natural is\n Page : Aws.Response.Data;\n File : Aws.Resources.File_Type;\n Buffer : String (1 .. 1024);\n Languages, Position, Last : Natural := 0;\n begin\n Page :=\n Client.Get\n (\"http://rosettacode.org/mw/index.php?title=\" &\n Aws.Url.Encode (Title) &\n \"&action=raw\");\n Response.Message_Body (Page, File);\n while not End_Of_File (File) loop\n Resources.Get_Line (File, Buffer, Last);\n Position :=\n Index\n (Source => Buffer (Buffer'First .. Last),\n Pattern => \"=={{header|\");\n if Position > 0 then\n Languages := Languages + 1;\n end if;\n end loop;\n Close (File);\n return Languages;\n end Scan_Page;\n\nbegin\n Get_Vector (\"Programming_Tasks\", Exemples);\n\n for I in First_Index (Exemples) .. Last_Index (Exemples) loop\n declare\n Title : constant String :=\n To_String (Members_Vectors.Element (Exemples, I));\n begin\n Nbr_Lg := Scan_Page (Title);\n Total := Total + Nbr_Lg;\n Put_Line (Title & \" :\" & Integer'Image (Nbr_Lg) & \" exemples.\");\n end;\n end loop;\n\n Put_Line (\"Total :\" & Integer'Image (Total) & \" exemples.\");\nend Count_Examples;\n","language":"Ada"},{"code":"UrlDownloadToFile\n , http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\n , tasks.xml\nFileRead, tasks, tasks.xml\npos = 0\nquote = \" ; \"\nregtitle := \"<cm.*?title=\" . quote . \"(.*?)\" . quote\nWhile, pos := RegExMatch(tasks, regtitle, title, pos + 1)\n{\n UrlDownloadToFile\n , % \"http://www.rosettacode.org/w/index.php?title=\" . title1 . \"&action=raw\"\n , task.xml\n FileRead, task, task.xml\n RegExReplace(task, \"\\{\\{header\\|\", \"\", count)\n current := title1 . \": \" . count . \" examples.`n\"\n output .= current\n TrayTip, current, % current\n}\nMsgBox % output\nReturn\n","language":"AutoHotkey"},{"code":" VDU 23,22,640;512;8,16,16,128+8 : REM Enable UTF-8 support\n\n SYS \"LoadLibrary\", \"URLMON.DLL\" TO urlmon%\n SYS \"GetProcAddress\", urlmon%, \"URLDownloadToFileA\" TO UDTF\n special$ = \"+()'\"\n\n url$ = \"http://www.rosettacode.org/w/api.php?action=query\" + \\\n \\ \"&list=categorymembers&cmtitle=Category:Programming_Tasks\" + \\\n \\ \"&cmlimit=500&format=xml\"\n file$ = @tmp$ + \"tasks.xml\"\n SYS UDTF, 0, url$, file$, 0, 0 TO fail%\n IF fail% ERROR 100, \"File download failed (tasks)\"\n\n Total% = 0\n file% = OPENIN(file$)\n WHILE NOT EOF#file%\n a$ = GET$#file%\n i% = 0\n REPEAT\n i% = INSTR(a$, \"title=\", i%+1)\n IF i% THEN\n j% = INSTR(a$, \">\", i%)\n title$ = MID$(a$, i%+7, j%-i%-10)\n REM Replace HTML codes:\n REPEAT\n k% = INSTR(title$, \"&\")\n IF k% THEN\n l% = INSTR(title$, \";\", k%)\n title$ = LEFT$(title$,k%-1) + \\\n \\ FNhtml(MID$(title$,k%,l%-k%+1)) + MID$(title$,l%+1)\n ENDIF\n UNTIL k% = 0\n t$ = title$\n REM Substitute characters not allowed in a URL:\n FOR s% = 1 TO LEN(special$)\n REPEAT\n s$ = MID$(special$, s%, 1)\n k% = INSTR(t$, s$)\n IF k% t$ = LEFT$(t$,k%-1) + \"%\" + STR$~ASCs$ + MID$(t$,k%+1)\n UNTIL k% = 0\n NEXT\n url$ = \"http://www.rosettacode.org/w/index.php?title=\" + t$ + \\\n \\ \"&action=raw\"\n file$ = @tmp$ + \"title.htm\"\n SYS UDTF, 0, url$, file$, 0, 0 TO fail%\n IF fail% ERROR 100, \"File download failed \" + t$\n examples% = 0\n task% = OPENIN(file$)\n WHILE NOT EOF#task%\n IF INSTR(GET$#task%, \"=={{header|\") examples% += 1\n ENDWHILE\n CLOSE #task%\n Total% += examples%\n PRINT title$ \": \" ; examples% \" examples.\"\n ENDIF\n UNTIL i% = 0\n i% = INSTR(a$, \"cmcontinue=\")\n IF i% THEN\n CLOSE #file%\n j% = INSTR(a$, \"\"\"\", i%+1)\n k% = INSTR(a$, \"\"\"\", j%+1)\n url$ = \"http://www.rosettacode.org/w/api.php?action=query\" + \\\n \\ \"&list=categorymembers&cmtitle=Category:Programming_Tasks\" + \\\n \\ \"&cmlimit=500&format=xml&cmcontinue=\" + MID$(a$,j%+1,k%-j%)\n REPEAT\n i% = INSTR(url$, \"|\")\n IF i% url$ = LEFT$(url$,i%-1) + \"%7C\" + MID$(url$,i%+1)\n UNTIL i% = 0\n file$ = @tmp$ + \"tasks.xml\"\n SYS UDTF, 0, url$, file$, 0, 0 TO fail%\n IF fail% ERROR 100, \"File download failed (continue)\"\n file% = OPENIN(file$)\n ENDIF\n ENDWHILE\n CLOSE #file%\n PRINT ' \"Total: \" ; Total% \" examples.\"\n END\n\n DEF FNhtml(h$)\n IF LEFT$(h$,2) = \"&#\" THEN = CHR$(VALMID$(h$,3))\n CASE h$ OF\n WHEN \""\": = \"\"\"\"\n ENDCASE\n = h$\n","language":"BBC-BASIC"},{"code":"( ( get-page\n =\n . sys$(str$(\"wget -q -O wget.out \\\"\" !arg \\\"))\n & get$(\"wget.out\",HT ML)\n )\n& get-page$\"http://rosettacode.org/wiki/Category:Programming_Tasks\"\n : ? (table.?) ?tasklist (.table.) ?\n& 0:?list\n& whl\n ' ( !tasklist\n : ?\n ( a\n . (href.@(?:\"/wiki/\" ?href)) (title.?title)\n & get-page$(str$(\"http://rosettacode.org/wiki/\" !href))\n : ?task\n & 0:?cnt\n & whl\n ' ( !task\n : ?\n ( (span.(class.mw-headline) (id.?))\n ?span\n (.span.)\n ?task\n & !span\n : ?\n ( a\n . (href.@(?:\"/wiki/Category:\" ?))\n (title.@(?:\"Category:\" ?))\n )\n @\n (.a.)\n ?\n )\n & 1+!cnt:?cnt\n )\n & (!cnt.!title)+!list:?list\n )\n ?tasklist\n )\n& lst$(list,taskfreq,NEW)\n)\n","language":"Bracmat"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text.RegularExpressions;\nusing System.Net;\n\nclass Task {\n private string _task;\n private int _examples;\n\n public Task(string task, int examples) {\n _task = task;\n _examples = examples;\n }\n\n public string Name {\n get { return _task; }\n }\n\n public int Examples {\n get { return _examples; }\n }\n\n public override string ToString() {\n return String.Format(\"{0}: {1} examples.\", this._task, this._examples);\n }\n}\n\nclass Program {\n static List<string> GetTitlesFromCategory(string category, WebClient wc) {\n string content = wc.DownloadString(\n String.Format(\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:{0}&cmlimit=500&format=json\", category)\n );\n\n return new Regex(\"\\\"title\\\":\\\"(.+?)\\\"\").Matches(content).Cast<Match>().Select(x => x.Groups[1].Value.Replace(\"\\\\/\", \"/\")).ToList();\n }\n\n static string GetSourceCodeFromPage(string page, WebClient wc) {\n return wc.DownloadString(\n String.Format(\"http://www.rosettacode.org/w/index.php?title={0}&action=raw\", page)\n );\n }\n\n static void Main(string[] args) {\n WebClient wc = new WebClient();\n List<Task> tasks = new List<Task>();\n List<string> tasknames = GetTitlesFromCategory(\"Programming_Tasks\", wc);\n\n foreach (string task in tasknames) {\n try {\n string content = GetSourceCodeFromPage(WebUtility.UrlEncode(task), wc);\n int count = new Regex(\"=={{header\", RegexOptions.IgnoreCase).Matches(content).Count;\n Task t = new Task(task, count);\n\n Console.WriteLine(t);\n tasks.Add(t);\n }\n catch (Exception ex) {\n Console.WriteLine(\"**** Unable to get task \\\"\" + task + \"\\\": \" + ex.Message);\n }\n }\n\n Console.WriteLine(\"\\nTotal: {0} examples.\", tasks.Select(x => x.Examples).Sum());\n }\n}\n","language":"C-sharp"},{"code":"(ns count-examples\n (:import [java.net URLEncoder])\n (:use [clojure.contrib.http.agent :only (http-agent string)]\n [clojure.contrib.json :only (read-json)]\n [clojure.contrib.string :only (join)]))\n\n(defn url-encode [v] (URLEncoder/encode (str v) \"utf-8\"))\n\n(defn rosettacode-get [path params]\n (let [param-string (join \"&\" (for [[n v] params] (str (name n) \"=\" (url-encode v))))]\n (string (http-agent (format \"http://www.rosettacode.org/w/%s?%s\" path param-string)))))\n\n(defn rosettacode-query [params]\n (read-json (rosettacode-get \"api.php\" (merge {:action \"query\" :format \"json\"} params))))\n\n(defn list-cm\n ([params] (list-cm params nil))\n ([params continue]\n (let [cm-params (merge {:list \"categorymembers\"} params (or continue {}))\n result (rosettacode-query cm-params)]\n (concat (-> result (:query) (:categorymembers))\n (if-let [cmcontinue (-> result (:query-continue) (:categorymembers))]\n (list-cm params cmcontinue))))))\n\n(defn programming-tasks []\n (let [result (list-cm {:cmtitle \"Category:Programming_Tasks\" :cmlimit 50})]\n (map #(:title %) result)))\n\n(defn task-count [task]\n [task (count\n (re-seq #\"==\\{\\{header\"\n (rosettacode-get \"index.php\" {:action \"raw\" :title task})))])\n\n(defn print-result []\n (let [task-counts (map task-count (programming-tasks))]\n (doseq [[task count] task-counts]\n (println (str task \":\") count)\n (flush))\n (println \"Total: \" (reduce #(+ %1 (second %2)) 0 task-counts))))\n","language":"Clojure"},{"code":"count-examples> (print-result)\n100 doors: 73\n24 game: 18\n24 game/Solve: 14\n99 Bottles of Beer: 89\nAbstract type: 27\nAccumulator factory: 23\nAckermann function: 73\nActive Directory/Connect: 4\nActive Directory/Search for a user: 3\nActive object: 14\nAdd a variable to a class instance at runtime: 21\nAddress of a variable: 20\n...\nTotal: 11216\nnil\n","language":"Clojure"},{"code":"import tango.io.Stdout;\nimport tango.net.http.HttpClient;\nimport tango.net.http.HttpHeaders;\nimport tango.text.xml.Document;\nimport tango.text.Util;\n\nalias HttpHeader.ContentLength CL;\n\nauto url = \"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\";\nvoid main()\n{\n auto client = new HttpClient (HttpClient.Get, url);\n client.open();\n char[] mainData, tmp;\n int total, i;\n\n void cat(void[] content) { tmp ~= cast(char[]) content; }\n\n if (client.isResponseOK) {\n client.read(&cat, client.getResponseHeaders.getInt(CL));\n mainData = tmp;\n tmp = null;\n\n auto doc = new Document!(char);\n doc.parse(mainData);\n foreach (n; doc.query.descendant(\"cm\").attribute(\"title\")) {\n auto subClient = new HttpClient(HttpClient.Get,\n \"http://www.rosettacode.org/w/index.php?title=\" ~\n replace(n.value.dup, ' ', '_') ~ \"&action=raw\");\n subClient.open();\n if (! subClient.isResponseOK) {\n Stderr (client.getResponse);\n break;\n }\n subClient.read(&cat, subClient.getResponseHeaders.getInt(CL));\n foreach (segment; patterns(cast(char[])tmp, \"=={{header|\")) i++;\n --i;\n if (i) --i;\n Stdout.formatln (\"{0,-40} - {}\", n.value, i);\n total += i;\n tmp = null;\n i = 0;\n }\n Stdout(\"total examples: \", total).newline;\n } else {\n Stderr (client.getResponse);\n }\n}\n","language":"D"},{"code":"package com.eglexamples.client;\n\nimport org.eclipse.edt.rui.widgets.*;\n\nhandler RosettaCodeHandler type RUIhandler{initialUI =[ui], title = \"Rosetta Code Tasks and Counts\"}\n\n ui GridLayout{columns = 3, rows = 4, cellPadding = 4, children = [ b1, dg1, l1, l2, l3, l4 ]};\n\n b1 Button{ layoutData = new GridLayoutData{ row = 1, column = 1 }, text = \"Go!\", onClick ::= b1_onClick };\n l1 TextLabel{ layoutData = new GridLayoutData{ row = 1, column = 2 }, text = \"Total Tasks:\" };\n l2 TextLabel{ layoutData = new GridLayoutData{ row = 1, column = 3 }, text = \"0\" };\n\n l3 TextLabel{ layoutData = new GridLayoutData{ row = 2, column = 2 }, text = \"Total Implementations:\" };\n l4 TextLabel{ layoutData = new GridLayoutData{ row = 2, column = 3 }, text = \"0\" };\n\n dg1 DataGrid{ layoutData = new GridLayoutData{ row = 3, column = 1, horizontalSpan = 3 },\n \tpageSize = 10, showScrollbar = true,\n\tcolumns = [ new DataGridColumn{name = \"title\", displayName = \"Task\", width=220},\n\t\t new DataGridColumn{name = \"count\", displayName = \"Count\", width=100} ] };\n\n cmcontinue string?;\n title string?;\n allTasks Task[];\n\t\n restBindingTasks IHttp? = new HttpRest{\n restType = eglx.rest.ServiceType.TrueRest,\n \trequest.uri = \"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=1&format=json\"};\n\n restBindingPageDetail IHttp? = new HttpRest{\n restType = eglx.rest.ServiceType.TrueRest,\n \trequest.uri = \"http://rosettacode.org/mw/index.php\"};\n\t\n function b1_onClick(event Event in)\n\tcall ProxyFunctions.listTasks(\"\") using restBindingTasks\n \t returning to listTasksCallBack onException exceptionHandler;\n end\n\n function listTasksCallBack(retResult RosettaCodeJSON in)\n\ttitle = retResult.query.categorymembers[1].title;\n\tcmcontinue = retResult.queryContinue.categorymembers.cmcontinue;\n\n\tcall ProxyFunctions.fetchPageDetail(title) using restBindingPageDetail\n \t returning to pageDetailCallBack onException exceptionHandler;\n end\n\n function pageDetailCallBack(pageResults string in)\n \tcount int = countSubstring(\"=={{header\", pageResults);\n \tallTasks.appendElement(new Task { title = title, count = count });\n\tl2.text = l2.text as int + 1;\n\tl4.text = l4.text as int + count;\n \t\n \tif(cmcontinue != null)\n\t call ProxyFunctions.listTasks(cmcontinue) using restBindingTasks\n\t\treturning to listTasksCallBack onException exceptionHandler;\n\telse\n\t dg1.data = allTasks as any[];\n\tend\n end\n\n function countSubstring(substr string in, str string in) returns(int)\n\tif(str.length() > 0 and substr.length() > 0)\n\t return (str.length() - str.replaceStr(subStr, \"\").length()) / subStr.length();\n\telse\n\t return 0;\n\tend\n end\n\t\n function exceptionHandler(exp AnyException in)\n end\n\nend\n\nrecord Task\n\ttitle string;\n\tcount int;\nend\n","language":"EGL"},{"code":"package com.eglexamples.client;\n\nlibrary ProxyFunctions\n\n function listTasks(continueLocation String in) returns (RosettaCodeJSON) {\n\t @Rest{method = _GET, uriTemplate = \"&cmcontinue={continueLocation}\",\n\t requestFormat = None, responseFormat = JSON}\n }\n end\t\n\n function fetchPageDetail(title String in) returns (String) {\n\t @Rest{method = _GET, uriTemplate = \"?title={title}&action=raw\",\n\t requestFormat = None, responseFormat = None}\n }\n end\t\n\nend\n\nrecord RosettaCodeJSON\n query Query;\n queryContinue QueryContinue{JSONName = \"query-continue\"};\nend\n\nrecord Query\n categorymembers Categorymembers[];\nend\n\nrecord Categorymembers\n cmcontinue string?;\n pageid int?;\n ns int?;\n title string?;\nend\n\nrecord QueryContinue\n categorymembers Categorymembers;\nend\n","language":"EGL"},{"code":"-module(rosseta_examples).\n-include_lib(\"xmerl/include/xmerl.hrl\").\n\n-export([main/0]).\n\nmain() ->\n application:start(inets),\n Titles = read_titles(empty),\n Result = lists:foldl(fun(Title,Acc) -> Acc + calculate_one(Title) end, 0, Titles),\n io:format(\"Total: ~p examples.\\n\",[Result]),\n application:stop(inets).\n\nread_titles(CurrentContinue) ->\n URL0 = \"http://rosettacode.org/mw/api.php?\" ++\n \"action=query&list=categorymembers&cmtitle=Category:Programming_Tasks\" ++\n \"&cmlimit=500&format=xml\",\n URL =\n case CurrentContinue of\n empty -> URL0;\n _ -> URL0 ++ \"&cmcontinue=\" ++ CurrentContinue\n end,\n {ok,Answer} = httpc:request(URL),\n {Document,_} = xmerl_scan:string(lists:last(tuple_to_list(Answer))),\n Continue =\n [Value || #xmlAttribute{value = Value} <- xmerl_xpath:string(\"//@cmcontinue\", Document)],\n Titles =\n [Value || #xmlAttribute{value = Value} <- xmerl_xpath:string(\"//@title\", Document)],\n case Continue of\n []->\n Titles;\n [ContValue | _] ->\n Titles ++ read_titles(ContValue)\n end.\n\ncalculate_one(Title0) ->\n Title = replace_chars(Title0),\n URL = \"http://www.rosettacode.org/w/index.php?title=\" ++\n Title ++ \"&action=raw\",\n case httpc:request(URL) of\n {ok,Result} ->\n {match,Found} =\n re:run(lists:last(tuple_to_list(Result)), \"\\n=={{header(|)\", [global]),\n io:format(\"~ts: ~p examples.\\n\",[Title0,length(Found)]),\n length(Found);\n {error,socket_closed_remotely} ->\n io:format(\"Socket closed remotely. Retry.\\n\"),\n calculate_one(Title0)\n end.\n\nreplace_chars(String) ->\n replace_chars(String,[]).\n\nreplace_chars([$ | T],Acc) ->\n replace_chars(T, [$_| Acc]);\nreplace_chars([$+| T],Acc) ->\n replace_chars(T, lists:reverse(\"%2B\") ++ Acc);\nreplace_chars([8211| T],Acc) ->\n replace_chars(T, lists:reverse(\"%E2%80%93\") ++ Acc);\nreplace_chars([Other| T],Acc) ->\n replace_chars(T, [Other| Acc]);\nreplace_chars([],Acc) ->\n lists:reverse(Acc).\n","language":"Erlang"},{"code":"#r \"System.Xml.Linq.dll\"\n\nlet uri1 = \"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\"\nlet uri2 task = sprintf \"http://www.rosettacode.org/w/index.php?title=%s&action=raw\" task\n\n[|for xml in (System.Xml.Linq.XDocument.Load uri1).Root.Descendants() do\n for attrib in xml.Attributes() do\n if attrib.Name.LocalName = \"title\" then\n yield async {\n let uri = uri2 (attrib.Value.Replace(\" \", \"_\") |> System.Web.HttpUtility.UrlEncode)\n use client = new System.Net.WebClient()\n let! html = client.AsyncDownloadString(System.Uri uri)\n let sols' = html.Split([|\"{{header|\"|], System.StringSplitOptions.None).Length - 1\n lock stdout (fun () -> printfn \"%s: %d examples\" attrib.Value sols')\n return sols' }|]\n|> Async.Parallel\n|> Async.RunSynchronously\n|> fun xs -> printfn \"Total: %d examples\" (Seq.sum xs)\n","language":"F-Sharp"},{"code":"USING: arrays assocs concurrency.combinators\nconcurrency.semaphores formatting hashtables http.client io\njson.reader kernel math math.parser sequences splitting\nurls.encoding ;\nIN: rosetta-code.count-examples\n\nCONSTANT: list-url \"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&cmprop=title&format=json\"\n\n: titles ( query -- titles )\n \"query\" of \"categorymembers\" of [ \"title\" of ] map ;\n: continued-url ( query -- url/f )\n \"query-continue\" of \"categorymembers\" of\n [ assoc>query list-url swap \"&\" glue ] [ f ] if* ;\n\n: (all-programming-titles) ( titles url -- titles' url' )\n http-get nip json> [ titles append ] [ continued-url ] bi\n [ (all-programming-titles) ] [ f ] if* ;\n: all-programming-titles ( -- titles ) { } list-url (all-programming-titles) drop ;\n\nCONSTANT: content-base-url \"http://rosettacode.org/mw/index.php?title=&action=raw\"\n: content-url ( title -- url )\n \" \" \"_\" replace\n \"title\" associate assoc>query\n content-base-url swap \"&\" glue ;\n\n: occurences ( seq subseq -- n ) split-subseq length 1 - ;\n: count-examples ( title -- n )\n content-url http-get nip \"=={{header|\" occurences ;\n\n: print-task ( title n -- ) \"%s: %d examples.\\n\" printf ;\n: print-total ( assoc -- ) values sum \"Total: %d examples.\\n\" printf ;\n: fetch-counts ( titles -- assoc )\n 10 <semaphore> [\n [ dup count-examples 2array ] with-semaphore\n ] curry parallel-map ;\n\n: print-counts ( titles -- )\n [ [ print-task ] assoc-each nl ] [ print-total ] bi ;\n: rosetta-examples ( -- )\n all-programming-titles fetch-counts print-counts ;\n\nMAIN: rosetta-examples\n","language":"Factor"},{"code":"package main\n\nimport (\n \"bytes\"\n \"encoding/xml\"\n \"fmt\"\n \"io\"\n \"io/ioutil\"\n \"net/http\"\n \"net/url\"\n \"strings\"\n)\n\nfunc req(u string, foundCm func(string)) string {\n resp, err := http.Get(u)\n if err != nil {\n fmt.Println(err) // connection or request fail\n return \"\"\n }\n defer resp.Body.Close()\n for p := xml.NewDecoder(resp.Body); ; {\n t, err := p.RawToken()\n switch s, ok := t.(xml.StartElement); {\n case err == io.EOF:\n return \"\"\n case err != nil:\n fmt.Println(err)\n return \"\"\n case !ok:\n continue\n case s.Name.Local == \"cm\":\n for _, a := range s.Attr {\n if a.Name.Local == \"title\" {\n foundCm(a.Value)\n }\n }\n case s.Name.Local == \"categorymembers\" && len(s.Attr) > 0 &&\n s.Attr[0].Name.Local == \"cmcontinue\":\n return url.QueryEscape(s.Attr[0].Value)\n }\n }\n return \"\"\n}\n\nfunc main() {\n taskQuery := \"http://rosettacode.org/mw/api.php?action=query\" +\n \"&format=xml&list=categorymembers&cmlimit=500\" +\n \"&cmtitle=Category:Programming_Tasks\"\n continueAt := req(taskQuery, count)\n for continueAt > \"\" {\n continueAt = req(taskQuery+\"&cmcontinue=\"+continueAt, count)\n }\n fmt.Printf(\"Total: %d examples.\\n\", total)\n}\n\nvar marker = []byte(\"=={{header|\")\nvar total int\n\nfunc count(cm string) {\n taskFmt := \"http://rosettacode.org/mw/index.php?title=%s&action=raw\"\n taskEsc := url.QueryEscape(strings.Replace(cm, \" \", \"_\", -1))\n resp, err := http.Get(fmt.Sprintf(taskFmt, taskEsc))\n var page []byte\n if err == nil {\n page, err = ioutil.ReadAll(resp.Body)\n resp.Body.Close()\n }\n if err != nil {\n fmt.Println(err)\n return\n }\n examples := bytes.Count(page, marker)\n fmt.Printf(\"%s: %d\\n\", cm, examples)\n total += examples\n}\n","language":"Go"},{"code":"import Network.Browser\nimport Network.HTTP\nimport Network.URI\nimport Data.List\nimport Data.Maybe\nimport Text.XML.Light\nimport Control.Arrow\n\njustifyR w = foldl ((.return).(++).tail) (replicate w ' ')\nshowFormatted t n = t ++ \": \" ++ justifyR 4 (show n)\n\ngetRespons url = do\n rsp <- Network.Browser.browse $ do\n setAllowRedirects True\n setOutHandler $ const (return ()) -- quiet\n request $ getRequest url\n return $ rspBody $ snd rsp\n\ngetNumbOfExampels p = do\n let pg = intercalate \"_\" $ words p\n rsp <- getRespons $ \"http://www.rosettacode.org/w/index.php?title=\" ++ pg ++ \"&action=raw\"\n let taskPage = rsp\n countEx = length $ filter (==\"=={{header|\") $ takeWhile(not.null) $ unfoldr (Just. (take 11 &&& drop 1)) taskPage\n return countEx\n\nprogTaskExamples = do\n rsp <- getRespons \"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\"\n\n let xmls = onlyElems $ parseXML $ rsp\n tasks = concatMap (map (fromJust.findAttr (unqual \"title\")). filterElementsName (== unqual \"cm\")) xmls\n\n taskxx <- mapM getNumbOfExampels tasks\n let ns = taskxx\n tot = sum ns\n\n mapM_ putStrLn $ zipWith showFormatted tasks ns\n putStrLn $ (\"Total: \" ++) $ show tot\n","language":"Haskell"},{"code":"*Main> progTaskExamples\n100 doors: 56\n24 game: 11\n24 game Player: 9\n99 Bottles of Beer: 73\nAbstract type: 23\nAckermann Function: 61\nActive object: 9\n...\nTotal: 9156\n","language":"Haskell"},{"code":"$define RCINDEX \"http://rosettacode.org/mw/api.php?format=xml&action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500\"\n$define RCTASK \"http://rosettacode.org/mw/index.php?action=raw&title=\"\n$define RCUA \"User-Agent: Unicon Rosetta 0.1\"\n$define RCXUA \"X-Unicon: http://unicon.org/\"\n$define TASKTOT \"* Total Tasks *\"\n$define TOTTOT \"* Total Headers*\"\n\nlink strings\nlink hexcvt\n\nprocedure main(A) # simple single threaded read all at once implementation\n Tasks := table(0)\n every task := taskNames() do {\n Tasks[TASKTOT] +:= 1 # count tasks\n every lang := languages(task) do { # count languages\n Tasks[task] +:= 1\n Tasks[TOTTOT] +:= 1\n }\n }\n every insert(O := set(),key(Tasks)) # extract & sort keys\n O := put(sort(O--set(TOTTOT,TASKTOT)),TASKTOT,TOTTOT) # move totals to end\n every write(k := !O, \" : \", Tasks[k],\" examples.\") # report\nend\n\n# Generate task names\nprocedure taskNames()\n continue := \"\"\n while \\(txt := ReadURL(RCINDEX||continue)) do {\n txt ? {\n while tab(find(\"<cm \") & find(s :=\"title=\\\"\")+*s) do\n suspend tab(find(\"\\\"\"))\\1\n if tab(find(\"cmcontinue=\")) then {\n continue := \"&\"||tab(upto(' \\t'))\n }\n else break\n }\n }\nend\n\n# Generate language headers in a task\nprocedure languages(task)\n static WS\n initial WS := ' \\t'\n page := ReadURL(RCTASK||CleanURI(task))\n page ? while (tab(find(\"\\n==\")),tab(many(WS))|\"\",tab(find(\"{{\"))) do {\n header := tab(find(\"==\"))\n header ? {\n while tab(find(\"{{header|\")) do {\n suspend 2(=\"{{header|\",tab(find(\"}}\")))\\1\n }\n }\n }\nend\n\nprocedure CleanURI(u) #: clean up a URI\n static tr,dxml # xml & http translation\n initial {\n tr := table()\n every c := !string(~(&digits++&letters++'-_.!~*()/\\'`')) do\n tr[c] := \"%\"||hexstring(ord(c),2)\n every /tr[c := !string(&cset)] := c\n tr[\" \"] := \"_\" # wiki convention\n every push(dxml := [],\"&#\"||right(ord(c := !\"&<>'\\\"\"),3,\"0\")||\";\",c)\n }\n\n dxml[1] := u # insert URI as 1st arg\n u := replacem!dxml # de-xml it\n every (c := \"\") ||:= tr[!u] # reencode everything\n c := replace(c,\"%3E\",\"'\") # Hack to put single quotes back in\n c := replace(c,\"%26quot%3B\",\"\\\"\") # Hack to put double quotes back in\n return c\nend\n\nprocedure ReadURL(url) #: read URL into string\n page := open(url,\"m\",RCUA,RCXUA) | stop(\"Unable to open \",url)\n text := \"\"\n if page[\"Status-Code\"] < 300 then while text ||:= reads(page,-1)\n else write(&errout,image(url),\": \",\n page[\"Status-Code\"],\" \",page[\"Reason-Phrase\"])\n close(page)\n return text\nend\n","language":"Haskell"},{"code":"require 'web/gethttp'\n\ngetAllTaskSolnCounts=: monad define\n tasks=. getCategoryMembers 'Programming_Tasks'\n counts=. getTaskSolnCounts &> tasks\n tasks;counts\n)\n\ngetTaskSolnCounts=: monad define\n makeuri=. 'http://www.rosettacode.org/w/index.php?title=' , ,&'&action=raw'\n wikidata=. gethttp makeuri urlencode y\n ([: +/ '{{header|'&E.) wikidata\n)\n\nformatSolnCounts=: monad define\n 'tasks counts'=. y\n tasks=. tasks , &.>':'\n res=. ;:^:_1 tasks ,. (8!:0 counts) ,. <'examples.'\n res , 'Total examples: ' , \": +/counts\n)\n","language":"J"},{"code":" formatSolnCounts getAllTaskSolnCounts ''\n100 doors: 61 examples.\n24 game: 15 examples.\n24 game Player: 11 examples.\n99 Bottles of Beer: 76 examples.\n...\n","language":"J"},{"code":"import java.util.ArrayList;\nimport ScreenScrape;\n\npublic class CountProgramExamples {\n private static final String baseURL = \"http://rosettacode.org/wiki/\";\n private static final String rootURL = \"http://www.rosettacode.org/w/\"\n + \"api.php?action=query&list=categorymembers\"\n + \"&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\";\n private static final String taskBegin = \"title=\\\"\";\n private static final String taskEnd = \"\\\"\";\n private static final String exmplBegin = \"<span class=\\\"tocnumber\\\">\";\n private static final String exmplEnd = \"</span>\";\n private static final String editBegin = \"<span class=\\\"editsection\\\">\";\n\n /**\n * @param args\n */\n public static void main(String[] args) {\n int exTotal = 0;\n try {\n // Get root query results\n ArrayList<String> tasks = new ArrayList<String>();\n ScreenScrape ss = new ScreenScrape();\n String rootPage = ss.read(rootURL);\n while (rootPage.contains(taskBegin)) {\n rootPage = rootPage.substring(rootPage.indexOf(taskBegin)\n + taskBegin.length());\n String title = rootPage.substring(0, rootPage.indexOf(taskEnd));\n if (!title.contains(\"Category:\")) {\n tasks.add(title);\n }\n rootPage = rootPage.substring(rootPage.indexOf(taskEnd));\n }\n // Loop through each task and print count\n for (String task : tasks) {\n String title = task.replaceAll(\"'\", \"'\");\n String taskPage = ss.read(baseURL + title.replaceAll(\" \", \"_\"));\n int exSubTot;\n if (taskPage.contains(exmplBegin)) {\n int startPos = taskPage.lastIndexOf(exmplBegin)\n + exmplBegin.length();\n String countStr = taskPage.substring(startPos,\n taskPage.indexOf(exmplEnd, startPos));\n exSubTot = Integer\n .parseInt(countStr.contains(\".\") ? countStr\n .substring(0, countStr.indexOf(\".\"))\n : countStr);\n } else {\n exSubTot = 0;\n while (taskPage.contains(editBegin)) {\n taskPage = taskPage.substring(taskPage\n .indexOf(editBegin) + editBegin.length());\n exSubTot++;\n }\n }\n exTotal += exSubTot;\n System.out.println(title + \": \" + exSubTot + \" examples.\");\n }\n // Print total\n System.out.println(\"\\nTotal: \" + exTotal + \" examples.\");\n } catch (Exception e) {\n System.out.println(title);\n System.out.println(startPos + \":\"\n + taskPage.indexOf(exmplEnd, startPos));\n System.out.println(taskPage);\n e.printStackTrace(System.out);\n }\n }\n}\n","language":"Java"},{"code":"#!/bin/bash\n\n# Produce lines of the form: URI TITLE\nfunction titles {\n local uri=\"http://www.rosettacode.org/mw/api.php?action=query&list=categorymembers\"\n uri+=\"&cmtitle=Category:Programming_Tasks&cmlimit=5000&format=json\"\n curl -Ss \"$uri\" |\n jq -r '.query.categorymembers[] | .title | \"\\(@uri) \\(.)\"'\n}\n\n# Syntax: count URI\nfunction count {\n local uri=\"$1\"\n curl -Ss \"http://rosettacode.org/mw/index.php?title=${uri}&action=raw\" |\n jq -R -n 'reduce (inputs|select(test(\"=={{header\\\\|\"))) as $x(0; .+1)'\n}\n\nlocal n=0 i\nwhile read uri title\ndo\n i=$(count \"$uri\")\n echo \"$title: $i examples.\"\n n=$((n + i))\ndone < <(titles)\necho Total: $n examples.\n","language":"Jq"},{"code":"using HTTP, JSON, Dates\n\nrosorg = \"http://rosettacode.org\"\nqURI = \"/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=json\"\nqdURI = \"/w/api.php?action=query&list=categorymembers&cmtitle=Category:Draft_Programming_Tasks&cmlimit=500&format=json\"\nsqURI = rosorg * \"/wiki/\"\ntopages(js, v) = for d in js[\"query\"][\"categorymembers\"] push!(v, sqURI * replace(d[\"title\"], \" \" => \"_\")) end\n\nfunction getpages(uri)\n wikipages = Vector{String}()\n response = HTTP.request(\"GET\", rosorg * uri)\n if response.status == 200\n fromjson = JSON.parse(String(response.body))\n topages(fromjson, wikipages)\n while haskey(fromjson, \"continue\")\n cmcont, cont = fromjson[\"continue\"][\"cmcontinue\"], fromjson[\"continue\"][\"continue\"]\n response = HTTP.request(\"GET\", rosorg * uri * \"&cmcontinue=$cmcont&continue=$cont\")\n fromjson = JSON.parse(String(response.body))\n topages(fromjson, wikipages)\n end\n end\n wikipages\nend\n\nfunction processtaskpages(wpages, verbose=false)\n totalexamples = 0\n for pag in wpages\n response = HTTP.request(\"GET\", pag)\n if response.status == 200\n n = length(collect(eachmatch(r\"span class=\\\"mw-headline\\\"\", String(response.body))))\n if verbose\n println(\"Wiki page $pag => $n examples.\")\n end\n totalexamples += n\n end\n end\n println(\"Total of $totalexamples on $(length(wpages)) task pages.\\n\")\nend\n\n\nprintln(\"Programming examples at $(DateTime(now())):\")\nqURI |> getpages |> processtaskpages\n\nprintln(\"Draft programming tasks:\")\nqdURI |> getpages |> processtaskpages\n","language":"Julia"},{"code":"local(root = json_deserialize(curl('http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=10&format=json')->result))\nlocal(tasks = array, title = string, urltitle = string, thiscount = 0, totalex = 0)\nwith i in #root->find('query')->find('categorymembers') do => {^\n\t#thiscount = 0\n\t#title = #i->find('title')\n\t#urltitle = #i->find('title')\n\t#urltitle->replace(' ','_')\n\t\n\t#title+': '\n\tlocal(src = curl('http://rosettacode.org/mw/index.php?title='+#urltitle->asBytes->encodeurl+'&action=raw')->result->asString)\n\t#thiscount = (#src->split('=={{header|'))->size - 1\n\t#thiscount < 0 ? #thiscount = 0\n\t#thiscount + ' examples.'\n\t#totalex += #thiscount\n\t'\\r'\n^}\n'Total: '+#totalex+' examples.'\n","language":"Lasso"},{"code":"on mouseUp\n put empty into fld \"taskurls\"\n put URL \"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=10&format=xml\" into apixml\n put revXMLCreateTree(apixml,true,true,false) into pDocID\n put \"/api/query/categorymembers/cm\" into pXPathExpression\n repeat for each line xmlnode in revXMLEvaluateXPath(pDocID, pXPathExpression)\n put revXMLAttribute(pDocID,xmlnode,\"title\") into pgTitle\n put revXMLAttribute(pDocID,xmlnode,\"pageid\") into pageId\n put \"http://www.rosettacode.org/w/index.php?title=\" & urlEncode(pgTitle) & \"&action=raw\" into taskURL\n put URL taskURL into taskPage\n filter lines of taskPage with \"=={{header|*\"\n put the number of lines of taskPage into taskTotal\n put pgTitle & comma & taskTotal & cr after fld \"tasks\"\n add taskTotal to allTaskTotal\n end repeat\n put \"Total\" & comma & allTaskTotal after fld \"tasks\"\nend mouseUp\n","language":"LiveCode"},{"code":"ConvertUTF8 := proc( str )\n local i, tempstring, uniindex;\n try\n tempstring := str;\n uniindex := [StringTools:-SearchAll(\"\\u\",str)];\n if uniindex <> [] then\n for i in uniindex do\n tempstring := StringTools:-Substitute(tempstring, str[i..i+5], UTF8:-unicode(str[i+2..i+5]));\n end do:\n end if;\n return tempstring;\n catch:\n return str;\n end try;\n end proc:\nprint_examples := proc(lst)\n\tlocal task, count, url, headers, item;\n\tfor task in lst do\n\t\tcount := 0:\n\t\turl := cat(\"http://www.rosettacode.org/mw/index.php?title=\", StringTools:-Encode(StringTools:-SubstituteAll(task[\"title\"], \" \", \"_\"), 'percent'), \"&action=raw\"):\n\t\theaders := [StringTools:-SearchAll(\"=={{header|\",URL:-Get(url))]:\n\t\tfor item in headers do\n\t\t\tcount++:\n\t\tend do:\n\t\tprintf(\"%s has %d examples\\n\",ConvertUTF8(task[\"title\"]), count);\n\tend do:\nend proc:\n\n\nx := JSON:-ParseFile(\"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=20&format=json\"):\nprint_examples(x[\"query\"][\"categorymembers\"]);\nwhile(assigned(x[\"continue\"][\"cmcontinue\"])) do\n\tcontinue := x[\"continue\"][\"cmcontinue\"]:\n\tmore_tasks:= cat(\"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=20&format=json\", \"&continue=\", x[\"continue\"][\"continue\"], \"&cmcontinue=\", x[\"continue\"][\"cmcontinue\"]):\n\tx := JSON:-ParseFile(more_tasks):\n\tprint_examples(x[\"query\"][\"categorymembers\"]);\nend do:\n","language":"Maple"},{"code":"TaskList = Flatten[\n Import[\"http://rosettacode.org/wiki/Category:Programming_Tasks\", \"Data\"][[1, 1]]];\nPrint[\"Task \\\"\", StringReplace[#, \"_\" -> \" \"], \"\\\" has \",\n Length@Select[Import[\"http://rosettacode.org/wiki/\" <> #, \"Data\"][[1,2]],\n StringFreeQ[#, __ ~~ \"Programming Task\" | __ ~~ \"Omit\"]& ], \" example(s)\"]&\n ~Map~ StringReplace[TaskList, \" \" -> \"_\"]\n","language":"Mathematica"},{"code":" function c = count_examples(url)\n c = 0;\n [s, success] = urlread (url);\n if ~success, return; end;\n c = length(strfind(s,'<h2><span class='));\n end;\n\n % script\n s = urlread ('http://rosettacode.org/wiki/Category:Programming_Tasks');\n pat = '<li><a href=\"/wiki/';\n ix = strfind(s,pat)+length(pat)-6;\n for k = 1:length(ix);\n % look through all tasks\n e = find(s(ix(k):end)==34,1)-2;\n t = s(ix(k)+[0:e]); % task\n c = count_examples(['http://rosettacode.org',t]);\n printf('Task \"%s\" has %i examples.\\n',t(7:end), c); \t\n end;\n","language":"MATLAB"},{"code":"import httpclient, strutils, xmltree, xmlparser, cgi\n\nproc count(s, sub: string): int =\n var i = 0\n while true:\n i = s.find(sub, i)\n if i < 0: break\n inc i\n inc result\n\nconst\n mainSite = \"http://www.rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\"\n subSite = \"http://www.rosettacode.org/mw/index.php?title=$#&action=raw\"\n\nvar client = newHttpClient()\nvar sum = 0\nfor node in client.getContent(mainSite).parseXml().findAll(\"cm\"):\n let t = node.attr(\"title\").replace(\" \", \"_\")\n let c = client.getContent(subSite % encodeUrl(t)).toLower().count(\"{{header|\")\n echo t.replace(\"_\", \" \"), \": \", c, \" examples.\"\n inc sum, c\n\necho \"\\nTotal: \", sum, \" examples.\"\n","language":"Nim"},{"code":"use HTTP;\nuse XML;\n\nclass RosettaCount {\n function : Main(args : String[]) ~ Nil {\n taks_xml := HttpGet(\"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\");\n parser := XmlParser->New(taks_xml);\n if(parser->Parse()) {\n task_names := parser->FindElements(\"/api/query/categorymembers/cm\");\n if(task_names <> Nil) {\n each(i : task_names) {\n task_name := task_names->Get(i)->As(XmlElement)->GetAttribute(\"title\")->GetValue();\n task_url := \"http://rosettacode.org/mw/index.php?title=\";\n task_url->Append(task_name);\n task_url->Append(\"&action=raw\");\n\n task := HttpGet(task_url);\n counts := task->FindAll(\"=={{header|\");\n if(counts->Size() > 0) {\n IO.Console->Print(UrlUtility->Decode(task_name))->Print(\": \")->PrintLine(counts->Size());\n };\n };\n };\n };\n }\n\n function : HttpGet(url : String) ~ String {\n xml := \"\";\n\n client := HttpClient->New();\n lines := client->Get(url);\n each(i : lines) {\n xml->Append(lines->Get(i)->As(String));\n };\n\n return xml;\n }\n}\n","language":"Objeck"},{"code":"open Http_client.Convenience\n\n\nlet repl_quote s =\n let reg = Str.regexp_string \"'\" in\n (Str.global_replace reg \"%27\" s)\n\nlet repl_space s =\n let s = String.copy s in\n for i = 0 to pred(String.length s) do\n if s.[i] = ' ' then s.[i] <- '_'\n done;\n (s)\n(* or in OCaml 4.00+:\n let repl_space = String.map (fun c -> if c = ' ' then '_' else c)\n*)\n\nlet count_ex s =\n let pat = Str.regexp_string \"=={{header|\" in\n let rec aux n p =\n try\n let p = Str.search_forward pat s p in\n aux (n+1) (p+1)\n with Not_found -> (n)\n in\n aux 0 0\n\nlet get_child child xml =\n let child =\n List.find\n (function Xml.Element (tag,_,_) when tag = child -> true | _ -> false) xml\n in\n Xml.children child\n\nlet () =\n let url = \"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&\\\n cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\" in\n\n let xml = Xml.parse_string (http_get url) in\n\n let total = ref 0 in\n at_exit (fun () -> Printf.printf \"\\n Total: %d\\n\" !total);\n\n let f = function\n | Xml.Element (\"cm\", attrs, _) ->\n (try\n let _title = List.assoc \"title\" attrs in\n let title = repl_quote (repl_space _title) in\n let url = \"http://www.rosettacode.org/w/index.php?title=\"^ title ^\"&action=raw\" in\n let n = count_ex (http_get url) in\n Printf.printf \"%s: %d\\n%!\" _title n;\n total := n + !total;\n with Http_client.Http_error (404, _) -> ())\n | _ -> ()\n in\n\n match xml with\n | Xml.Element (\"api\", _, ch) ->\n let query = get_child \"query\" ch in\n let catmb = get_child \"categorymembers\" query in\n List.iter f catmb\n | _ -> ()\n","language":"OCaml"},{"code":"declare\n [HTTPClient] = {Module.link ['x-ozlib://mesaros/net/HTTPClient.ozf']}\n [XMLParser] = {Module.link ['x-oz://system/xml/Parser.ozf']}\n [StringX] = {Module.link ['x-oz://system/String.ozf']}\n [Regex] = {Module.link ['x-oz://contrib/regex']}\n\n AllTasksUrl = \"http://rosettacode.org/mw/api.php?action=query&list=\"#\n \"categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\"\n\n proc {Main}\n AllTasks = {Parse {GetPage AllTasksUrl}}\n TaskTitles = {GetTitles AllTasks}\n Total = {NewCell 0}\n in\n for Task in TaskTitles do\n TaskPage = {GetPage {TaskUrl Task}}\n RE = {Regex.compile \"{{header\\\\|\" [extended newline icase]}\n NumMatches = {Length {Regex.allMatches RE TaskPage}}\n in\n {System.showInfo Task#\": \"#NumMatches#\" examples.\"}\n Total := @Total + NumMatches\n end\n {System.showInfo \"Total: \"#@Total#\" examples.\"}\n end\n\n fun {TaskUrl Task}\n \"http://rosettacode.org/mw/index.php?\"#\n \"title=\"#{PercentEncode {StringX.replace Task \" \" \"_\"}}#\n \"&action=raw\"\n end\n\n %% GetPage\n local\n Client = {New HTTPClient.urlGET init(inPrms(toFile:false toStrm:true) _)}\n in\n fun {GetPage RawUrl}\n Url = {VirtualString.toString RawUrl}\n OutParams\n HttpResponseParams\n in\n {Client getService(Url ?OutParams ?HttpResponseParams)}\n OutParams.sOut\n end\n end\n\n %% Parse\n local\n Parser = {New XMLParser.parser init}\n in\n fun {Parse Xs} {Parser parseVS(Xs $)} end\n end\n\n fun {GetTitles Doc}\n CMs = Doc.2.1.children.1.children.1.children\n fun {Attributes element(attributes:As ...)} As end\n fun {IsTitle attribute(name:N ...)} N == title end\n in\n {Map {Filter {Flatten {Map CMs Attributes}} IsTitle}\n fun {$ A} {Atom.toString A.value} end}\n end\n\n fun {PercentEncode Xs}\n case Xs of nil then nil\n [] X|Xr then\n if {Char.isDigit X} orelse {Member X [&- &_ &. &~]}\n orelse X >= &a andthen X =< &z\n orelse X >= &z andthen X =< &Z then\n X|{PercentEncode Xr}\n else\n {Append &%|{ToHex2 X} {PercentEncode Xr}}\n end\n end\n end\n\n fun {ToHex2 X}\n [{ToHex1 X div 16} {ToHex1 X mod 16}]\n end\n\n fun {ToHex1 X}\n if X >= 0 andthen X =< 9 then &0 + X\n elseif X >= 10 andthen X =< 15 then &A + X - 10\n end\n end\nin\n {Main}\n","language":"Oz"},{"code":"use HTTP::Tiny;\n\nmy $site = \"http://rosettacode.org\";\nmy $list_url = \"/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\";\n\nmy $response = HTTP::Tiny->new->get(\"$site$list_url\");\nfor ($response->{content} =~ /cm.*?title=\"(.*?)\"/g) {\n (my $slug = $_) =~ tr/ /_/;\n my $response = HTTP::Tiny->new->get(\"$site/wiki/$slug\");\n my $count = () = $response->{content} =~ /toclevel-1/g;\n print \"$_: $count examples\\n\";\n}\n","language":"Perl"},{"code":"use Mojo::UserAgent;\n\nmy $site = \"http://rosettacode.org\";\nmy $list_url = \"/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\";\n\nmy $ua = Mojo::UserAgent->new;\n$ua->get(\"$site$list_url\")->res->dom->find('cm')->each(sub {\n (my $slug = $_->{title}) =~ tr/ /_/;\n my $count = $ua->get(\"$site/wiki/$slug\")->res->dom->find(\"#toc .toclevel-1\")->size;\n say \"$_->{title}: $count examples\";\n});\n","language":"Perl"},{"code":"(notonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\rosettacode_cache.e\n -- ================================\n --\n -- Common routines for handling rc_cache etc.\n --</span>\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- (libcurl, file i/o, peek, progress..)</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">builtins</span><span style=\"color: #0000FF;\">\\</span><span style=\"color: #004080;\">timedate</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">day</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">timedelta</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">days</span><span style=\"color: #0000FF;\">:=</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">refresh_cache</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">21</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">day</span> <span style=\"color: #000080;font-style:italic;\">-- 0 for always [NB refresh_cache += timedelta(days:=1) below]</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">days</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">delta</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">ceil</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">delta</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">day</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%d day%s\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">\"s\"</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">hex</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ascii</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">columnize</span><span style=\"color: #0000FF;\">({{</span><span style=\"color: #008000;\">\"%22\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`\"`</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"%27\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"'\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"%2A\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"*\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"%2B\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"+\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"%3A\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\":\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"%5E\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`^`</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"%E2%80%93\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"-\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"%E2%80%99\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"'\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"%C3%A8\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"e\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"%C3%A9\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"e\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"%C3%B6\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"o\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"%C5%91\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"o\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\""\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`\"`</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"'\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"'\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"_\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">}})</span>\n\n <span style=\"color: #008080;\">global</span> <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">html_clean</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">substitute_all</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">hex</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ascii</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">builtins</span><span style=\"color: #0000FF;\">\\</span><span style=\"color: #000000;\">libcurl</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">curl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">NULL</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pErrorBuffer</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">write_callback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">pData</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">nmemb</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">bytes_written</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">size</span> <span style=\"color: #0000FF;\">*</span> <span style=\"color: #000000;\">nmemb</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">peek</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">pData</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">bytes_written</span><span style=\"color: #0000FF;\">}))</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">bytes_written</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">write_cb</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">call_back</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #008000;\">'+'</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">write_callback</span><span style=\"color: #0000FF;\">})</span>\n\n <span style=\"color: #008080;\">global</span> <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">wastitle</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span> <span style=\"color: #000080;font-style:italic;\">-- don't clobber \"NEED EDITING\"/Downloading messages</span>\n <span style=\"color: #008080;\">global</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">show_title</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">progress</span>\n\n <span style=\"color: #008080;\">global</span> <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">open_download</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">url</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">text</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">refetch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">why</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"not found\"</span>\n <span style=\"color: #000000;\">filename</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">join_path</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #008000;\">\"rc_cache\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">file_exists</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000080;font-style:italic;\">-- use existing file if <= refresh_cache days old</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">last_mod</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">get_file_date</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">delta</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">timedate_diff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">last_mod</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">date</span><span style=\"color: #0000FF;\">())</span>\n <span style=\"color: #000000;\">refetch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">delta</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">refresh_cache</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">match</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\".hist\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">why</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">days</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">delta</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">&</span> <span style=\"color: #008000;\">\" > \"</span> <span style=\"color: #0000FF;\">&</span> <span style=\"color: #000000;\">days</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">refresh_cache</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #7060A8;\">get_file_size</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">why</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"filesize of 0\"</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">text</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">trim</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">get_text</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #004080;\">sequence</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">why</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"no text\"</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">)<</span><span style=\"color: #000000;\">10</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">why</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"<10 bytes\"</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">refetch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">refetch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">directory</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">get_file_path</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">get_file_type</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">directory</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #004600;\">FILETYPE_DIRECTORY</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">create_directory</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">directory</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">make_parent</span><span style=\"color: #0000FF;\">:=</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"cannot create %s directory\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">directory</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">refetch</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">wastitle</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"x\"</span> <span style=\"color: #000080;font-style:italic;\">-- don't clobber</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">nofn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"(%d/%d, %.1f%%) \"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">100</span><span style=\"color: #0000FF;\">}):</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">title</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Downloading %s%s (%s)...\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">nofn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">html_clean</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">why</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">show_title</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">title</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">NULL</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">curl_global_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">curl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">curl_easy_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">pErrorBuffer</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">allocate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">CURL_ERROR_SIZE</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">curl_easy_setopt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">CURLOPT_ERRORBUFFER</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pErrorBuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">curl_easy_setopt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">CURLOPT_WRITEFUNCTION</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">write_cb</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">url</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">url</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%3A\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\":\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">url</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">url</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%2A\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"*\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">curl_easy_setopt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">CURLOPT_URL</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">url</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">fn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">open</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"wb\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">!=-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"cannot open \"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">curl_easy_setopt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">CURLOPT_WRITEDATA</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">CURLcode</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">curl_easy_perform</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">CURLE_OK</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">error</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">CURLE_COULDNT_RESOLVE_HOST</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">error</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #008000;\">\" [CURLE_COULDNT_RESOLVE_HOST]\"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Error %s downloading file, retry?(Y/N):\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">error</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">lower</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">wait_key</span><span style=\"color: #0000FF;\">())!=</span><span style=\"color: #008000;\">'y'</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #7060A8;\">abort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Y\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #7060A8;\">close</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">refresh_cache</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #7060A8;\">timedelta</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">days</span><span style=\"color: #0000FF;\">:=</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- did I mention it is slow?</span>\n <span style=\"color: #000000;\">text</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">get_text</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">text</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">global</span> <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">open_category</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">open_download</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\".htm\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"http://rosettacode.org/wiki/Category:\"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">filename</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">global</span> <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">dewiki</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">exclude</span><span style=\"color: #0000FF;\">={})</span>\n <span style=\"color: #000080;font-style:italic;\">-- extract tasks from eg `<li><a href=\"/wiki/100_doors\"`</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">tasks</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">start</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">finish</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">match</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">`<div class=\"printfooter\">`</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">finish</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">start</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">match</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">`<li><a href=\"/wiki/`</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">start</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">`<li><a href=\"/wiki/`</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">finish</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">'\"'</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">task</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">finish</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">task</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute_all</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">task</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"*\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\":\"</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #008000;\">\"%2A\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%3A\"</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">tasks</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tasks</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">task</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">start</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">finish</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">tasks</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">global</span> <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">curl_cleanup</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #004600;\">NULL</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">curl_easy_cleanup</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">free</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pErrorBuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">curl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">NULL</span>\n <span style=\"color: #000000;\">pErrorBuffer</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">NULL</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n<!--\n","language":"Phix"},{"code":"(notonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\Count_examples.exw\n -- ===============================\n --\n -- (This uses a few '&' instead of/as well as 'a', fairly obviously for everyone's sanity..)\n -- Counts no of \"<nowiki>{{</nowiki>he&der|\" (nb not \"==<nowiki>{{</nowiki>he&der|\") via web api (but gets tasks via scraping).\n -- Since downloading all the pages can be very slow, this uses a cache.\n -- Limiting (notdone) by \"Phix\" fairly obviously speeds it up tenfold :-)\n --</span>\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- (fairly obviously this will never ever run in a browser!)</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">include_drafts</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">sort_by_count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000080;font-style:italic;\">-- notlang = \"Phix\" -- or \"\" (ie a zero length string) for all</span>\n <span style=\"color: #000000;\">notlang</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span>\n\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">rosettacode_cache</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">count_tasks</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">get_file_type</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"rc_cache\"</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #004600;\">FILETYPE_DIRECTORY</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">create_directory</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"rc_cache\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"cannot create rc_cache directory\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000080;font-style:italic;\">-- note this lot use web scraping (as cribbed from a similar task) ...</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">tasks</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">dewiki</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">open_category</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Programming_Tasks\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">include_drafts</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">tasks</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">dewiki</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">open_category</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Draft_Programming_Tasks\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">tasks</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tasks</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">notlang</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000080;font-style:italic;\">-- filter already done in specified language</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">langurl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"http://rosettacode.org/wiki/Category:\"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">notlang</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">done</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">dewiki</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">open_download</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">notlang</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\".htm\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">langurl</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tasks</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">ti</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">tasks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ti</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">done</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">d</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">tasks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ti</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">done</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">tasks</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">tasks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">done</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%d tasks found\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tasks</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #000080;font-style:italic;\">-- ... whereas the individual tasks use the web api instead (3x smaller/faster)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">total_count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">task_counts</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tasks</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tasks</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">ti</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">tasks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #000000;\">url</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"http://rosettacode.org/mw/index.php?title=%s&action=raw\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">ti</span><span style=\"color: #0000FF;\">}),</span>\n <span style=\"color: #000000;\">contents</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">open_download</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ti</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\".raw\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">url</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">prev</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">curr</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">start</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">start</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">match</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">`<nowiki>{{</nowiki>hea`</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">`der|`</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">contents</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000080;font-style:italic;\">--\n -- skip duplicates/we also have to cope with eg\n -- ==<nowiki>{{</nowiki>he&der|Python<nowiki>}}</nowiki>== \\\n -- ===<nowiki>{{</nowiki>he&der|Python<nowiki>}}</nowiki> Original=== } count\n -- ===<nowiki>{{</nowiki>he&der|Python<nowiki>}}</nowiki> Succinct=== } once\n -- ===<nowiki>{{</nowiki>he&der|Python<nowiki>}}</nowiki> Recursive === /\n -- ==<nowiki>{{</nowiki>he&der|Mathematica<nowiki>}}</nowiki> / <nowiki>{{</nowiki>he&der|Wolfram Language<nowiki>}}</nowiki>== \\\n -- ==<nowiki>{{</nowiki>he&der|Icon<nowiki>}}</nowiki> and <nowiki>{{</nowiki>he&der|Unicon<nowiki>}}</nowiki>== } count\n -- == <nowiki>{{</nowiki>he&der|Icon<nowiki>}}</nowiki> and <nowiki>{{</nowiki>he&der|Unicon<nowiki>}}</nowiki> == / both\n -- == <nowiki>{{</nowiki>he&der|Java<nowiki>}}</nowiki>==\n -- etc. Note however that this /does/ count eg\n -- ===<nowiki>{{</nowiki>he&der|Applesoft BASIC<nowiki>}}</nowiki>=== \\\n -- ===<nowiki>{{</nowiki>he&der|BASIC256<nowiki>}}</nowiki>=== } count\n -- ===<nowiki>{{</nowiki>he&der|Commodore BASIC<nowiki>}}</nowiki>=== } 'em\n -- ===<nowiki>{{</nowiki>he&der|IS-BASIC<nowiki>}}</nowiki>=== } all\n -- ===<nowiki>{{</nowiki>he&der|Sinclair ZX81 BASIC<nowiki>}}</nowiki>=== /\n --</span>\n <span style=\"color: #000000;\">curr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">contents</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #7060A8;\">match</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">`<nowiki>}}</nowiki>`</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">contents</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">start</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">curr</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">prev</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">prev</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">curr</span>\n <span style=\"color: #000000;\">start</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">`<nowiki>{{</nowiki>hea`</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">`der|`</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">sort_by_count</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">task_counts</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">count</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">notlang</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tasks</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">mod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">200</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%s: %d\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">html_clean</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ti</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">total_count</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">count</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">get_key</span><span style=\"color: #0000FF;\">()=</span><span style=\"color: #000000;\">#1B</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"escape keyed\\n\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">curl_cleanup</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">sort_by_count</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">tags</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">custom_sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">task_counts</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tasks</span><span style=\"color: #0000FF;\">)))</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tags</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">ti</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">tags</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%s: %d\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">html_clean</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tasks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">ti</span><span style=\"color: #0000FF;\">]),</span><span style=\"color: #000000;\">task_counts</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">ti</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">total_count</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Total: %d\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">count_tasks</span><span style=\"color: #0000FF;\">()})</span>\n<!--\n","language":"Phix"},{"code":"(load \"@lib/http.l\")\n\n(client \"rosettacode.org\" 80\n \"mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\"\n (while (from \" title=\\\"\")\n (let Task (till \"\\\"\")\n (client \"rosettacode.org\" 80 (pack \"wiki/\" (replace Task \" \" \"_\"))\n (let Cnt 0\n (while (from \"<span class=\\\"tocnumber\\\">\")\n (unless (sub? \".\" (till \"<\" T))\n (inc 'Cnt) ) )\n (out NIL (prinl (ht:Pack Task) \": \" Cnt)) ) ) ) ) )\n","language":"PicoLisp"},{"code":"Procedure handleError(value, msg.s)\n If value = 0\n MessageRequester(\"Error\", msg)\n End\n EndIf\nEndProcedure\n\nhandleError(InitNetwork(), \"Unable to initialize network functions.\")\nIf OpenConsole()\n Define url$, x1$, y1$, title$, unescapedTitle$, encodedURL$\n Define x2, i, j, totalExamples, totalTasks\n url$ = \"http://www.rosettacode.org/mw/api.php?action=query\" +\n \"&list=categorymembers&cmtitle=Category:Programming_Tasks\" +\n \"&cmlimit=500&format=xml\"\n\n Repeat\n handleError(ReceiveHTTPFile(url$, \"tasks.xml\"), \"Unable to access tasks URL.\")\n\n handleError(ReadFile(0, \"tasks.xml\"), \"Unable to read 'task.xml' file.\")\n x1$ = ReadString(0)\n CloseFile(0)\n\n Repeat\n x2 = FindString(x1$, \"title=\", x2 + 1)\n If x2\n title$ = Mid(x1$, x2 + 7, 99)\n title$ = Left(title$, FindString(title$, \">\", 1) - 4)\n unescapedTitle$ = UnescapeString(ReplaceString(title$, \"'\", \"'\"), #PB_String_EscapeXML)\n encodedURL$ = URLEncoder(\"http://www.rosettacode.org/mw/index.php?title=\" + unescapedTitle$ + \"&action=raw\")\n If ReceiveHTTPFile(encodedURL$, \"task.xml\")\n ReadFile(0, \"task.xml\")\n While Not Eof(0)\n y1$ = ReadString(0)\n If FindString(y1$, \"=={{header|\", 1, #PB_String_NoCase)\n totalExamples + 1\n EndIf\n Wend\n CloseFile(0)\n\n PrintN(unescapedTitle$ +\": \" + Str(totalExamples) + \" examples\")\n\n totalTasks + totalExamples\n totalExamples = 0\n EndIf\n EndIf\n Until x2 = 0\n\n ;check for additional pages of tasks\n x2 = FindString(x1$, \"cmcontinue=\")\n If x2\n i = FindString(x1$, #DQUOTE$, x2 + 1)\n j = FindString(x1$, #DQUOTE$, i + 1)\n url$ = URLEncoder(\"http://www.rosettacode.org/mw/api.php?action=query\" +\n \"&list=categorymembers&cmtitle=Category:Programming_Tasks\" +\n \"&cmlimit=500&format=xml&cmcontinue=\" + Mid(x1$, i + 1, j - i))\n Else\n Break ;all done\n EndIf\n ForEver\n\n PrintN(\"Total: \" + Str(totalTasks) + \" examples\")\n Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"from urllib.request import urlopen, Request\nimport xml.dom.minidom\n\nr = Request(\n 'https://www.rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml',\n headers={'User-Agent': 'Mozilla/5.0'})\nx = urlopen(r)\n\ntasks = []\nfor i in xml.dom.minidom.parseString(x.read()).getElementsByTagName('cm'):\n t = i.getAttribute('title').replace(' ', '_')\n r = Request(f'https://www.rosettacode.org/mw/index.php?title={t}&action=raw',\n headers={'User-Agent': 'Mozilla/5.0'})\n y = urlopen(r)\n tasks.append( y.read().lower().count(b'{{header|') )\n print(t.replace('_', ' ') + f': {tasks[-1]} examples.')\n\nprint(f'\\nTotal: {sum(tasks)} examples.')\n","language":"Python"},{"code":"\"\"\"Count Rosetta Code tasks implementations using the Semantic MediaWiki API.\nWorks with Python >= 3.7.\"\"\"\nimport json\nimport logging\n\nfrom dataclasses import dataclass\nfrom dataclasses import field\n\nfrom datetime import datetime\n\nfrom typing import Any\nfrom typing import Dict\nfrom typing import List\nfrom typing import Optional\nfrom typing import Set\nfrom typing import Tuple\n\nimport requests\nfrom requests.adapters import HTTPAdapter\nfrom requests.adapters import Retry\n\nlogging.basicConfig(level=logging.WARN)\n\n# See https://www.semantic-mediawiki.org/wiki/Help:API:ask\n_SM_ASK: Dict[str, str] = {\n \"action\": \"ask\",\n \"format\": \"json\",\n \"formatversion\": \"2\",\n \"api_version\": \"3\",\n}\n\n_SM_ASK_REQUEST_BLOCK_SIZE = 500\n\n\n@dataclass(frozen=True)\nclass Page:\n # fulltext is the page's title, not the page content.\n fulltext: str\n fullurl: str\n namespace: int\n exists: str\n displaytitle: str\n\n\n@dataclass(frozen=True, eq=False)\nclass Lang(Page):\n def __eq__(self, other: object) -> bool:\n if isinstance(other, Lang):\n return self.fullurl == other.fullurl\n elif isinstance(other, str):\n return self.fullurl == other\n return False\n\n def __hash__(self) -> int:\n return hash(self.fullurl)\n\n def unimplemented(self, tasks: Set[\"Task\"]) -> Set[\"Task\"]:\n return {task for task in tasks if self.fullurl not in task.exclude}\n\n def omitted_from(self, tasks: Set[\"Task\"]) -> Set[\"Task\"]:\n return {task for task in tasks if self.fullurl in task.omitted_from}\n\n\n@dataclass(frozen=True)\nclass Task(Page):\n title: str\n implemented_in: Set[Lang] = field(repr=False, compare=False)\n omitted_from: Set[Lang] = field(repr=False, compare=False)\n exclude: Set[Lang] = field(repr=False, compare=False)\n\n def not_implemented_in(self, langs: Set[Lang]) -> Set[Lang]:\n return langs.difference(self.exclude)\n\n\n@dataclass\nclass TaskResponseBlock:\n tasks: List[Task]\n continue_offset: Optional[int] = None\n\n\n@dataclass\nclass LanguageResponseBlock:\n langs: List[Lang]\n continue_offset: Optional[int] = None\n\n\ndef sm_ask_category(\n session: requests.Session,\n url: str,\n category: str,\n limit: int,\n offset: int,\n known_langs: Set[Lang],\n) -> TaskResponseBlock:\n query_params = {\n **_SM_ASK,\n \"query\": (\n f\"[[Category:{category}]]\"\n \"|?Implemented in language\"\n \"|?Omitted from language\"\n f\"|limit={limit}\"\n f\"|offset={offset}\"\n ),\n }\n\n # Display some progress\n log(f\"ask [[Category:{category}]] offset={offset}\")\n\n response = session.get(url, params=query_params)\n response.raise_for_status()\n data = response.json()\n handle_warnings_and_errors(data)\n return _transform_implemented_in_response_data(data, known_langs)\n\n\ndef sm_ask_tasks(\n session: requests.Session,\n url: str,\n limit: int,\n offset: int,\n known_langs: Set[Lang],\n):\n return sm_ask_category(\n session, url, \"Programming Tasks\", limit, offset, known_langs\n )\n\n\ndef sm_ask_drafts(\n session: requests.Session,\n url: str,\n limit: int,\n offset: int,\n known_langs: Set[Lang],\n):\n return sm_ask_category(\n session, url, \"Draft Programming Tasks\", limit, offset, known_langs\n )\n\n\ndef sm_ask_languages(\n session: requests.Session,\n url: str,\n limit: int,\n offset: int,\n) -> LanguageResponseBlock:\n query_params = {\n **_SM_ASK,\n \"query\": (\n \"[[Is language::+]]\"\n \"|?Implemented in language\"\n \"|?Omitted from language\"\n f\"|limit={limit}\"\n f\"|offset={offset}\"\n ),\n }\n\n # Display some progress\n log(f\"ask [[Is language::+]] offset={offset}\")\n\n response = session.get(url, params=query_params)\n response.raise_for_status()\n data = response.json()\n handle_warnings_and_errors(data)\n return _transform_language_response_data(data)\n\n\ndef sm_ask_all_tasks(\n session: requests.Session, url: str, known_langs: Set[Lang]\n) -> List[Task]:\n block = sm_ask_tasks(\n session,\n url,\n limit=_SM_ASK_REQUEST_BLOCK_SIZE,\n offset=0,\n known_langs=known_langs,\n )\n tasks = block.tasks\n\n while block.continue_offset:\n block = sm_ask_tasks(\n session,\n url,\n limit=_SM_ASK_REQUEST_BLOCK_SIZE,\n offset=block.continue_offset,\n known_langs=known_langs,\n )\n tasks.extend(block.tasks)\n\n return tasks\n\n\ndef sm_ask_all_drafts(\n session: requests.Session, url: str, known_langs: Set[Lang]\n) -> List[Task]:\n block = sm_ask_drafts(\n session,\n url,\n limit=_SM_ASK_REQUEST_BLOCK_SIZE,\n offset=0,\n known_langs=known_langs,\n )\n tasks = block.tasks\n\n while block.continue_offset:\n block = sm_ask_drafts(\n session,\n url,\n limit=_SM_ASK_REQUEST_BLOCK_SIZE,\n offset=block.continue_offset,\n known_langs=known_langs,\n )\n tasks.extend(block.tasks)\n\n return tasks\n\n\ndef sm_ask_all_languages(session: requests.Session, url: str) -> List[Lang]:\n block = sm_ask_languages(\n session,\n url,\n limit=_SM_ASK_REQUEST_BLOCK_SIZE,\n offset=0,\n )\n langs = block.langs\n\n while block.continue_offset:\n block = sm_ask_languages(\n session,\n url,\n limit=_SM_ASK_REQUEST_BLOCK_SIZE,\n offset=block.continue_offset,\n )\n langs.extend(block.langs)\n\n return langs\n\n\ndef _transform_implemented_in_response_data(\n data: Any, known_langs: Set[Lang]\n) -> TaskResponseBlock:\n tasks: List[Task] = []\n for result in data[\"query\"][\"results\"]:\n for task_title, task_page in result.items():\n # We're excluding implementations that don't have a corresponding\n # category page with an \"Is Language\" property.\n implemented_in = {\n Lang(**lang)\n for lang in task_page[\"printouts\"][\"Implemented in language\"]\n }.intersection(known_langs)\n\n omitted_from = (\n {\n Lang(**lang)\n for lang in task_page[\"printouts\"][\"Omitted from language\"]\n }\n .intersection(known_langs)\n .difference(implemented_in)\n )\n\n tasks.append(\n Task(\n title=task_title,\n implemented_in=implemented_in,\n omitted_from=omitted_from,\n fulltext=task_page[\"fulltext\"],\n fullurl=task_page[\"fullurl\"],\n namespace=task_page[\"namespace\"],\n exists=task_page[\"exists\"],\n displaytitle=task_page[\"displaytitle\"],\n exclude=implemented_in.union(omitted_from),\n )\n )\n\n return TaskResponseBlock(\n tasks=tasks, continue_offset=data.get(\"query-continue-offset\", None)\n )\n\n\ndef _transform_language_response_data(data: Any) -> LanguageResponseBlock:\n langs: List[Lang] = []\n for result in data[\"query\"][\"results\"]:\n for _, task_page in result.items():\n langs.append(\n Lang(\n fulltext=task_page[\"fulltext\"],\n fullurl=task_page[\"fullurl\"],\n namespace=task_page[\"namespace\"],\n exists=task_page[\"exists\"],\n displaytitle=task_page[\"displaytitle\"],\n )\n )\n\n return LanguageResponseBlock(\n langs=langs, continue_offset=data.get(\"query-continue-offset\", None)\n )\n\n\ndef get_session() -> requests.Session:\n \"\"\"Setup a requests.Session with retries.\"\"\"\n retry_strategy = Retry(\n total=5,\n status_forcelist=[429, 500, 502, 503, 504],\n allowed_methods=[\"HEAD\", \"GET\", \"OPTIONS\"],\n )\n adapter = HTTPAdapter(max_retries=retry_strategy)\n session = requests.Session()\n session.mount(\"https://\", adapter)\n session.mount(\"http://\", adapter)\n return session\n\n\ndef log(msg: str) -> None:\n print(f\"{datetime.now().isoformat(' ', 'seconds')}: {msg}\")\n\n\ndef handle_warnings_and_errors(data: Any) -> None:\n if data.get(\"errors\"):\n for error in data[\"errors\"]:\n logging.error(json.dumps(error))\n # legacy format\n if data.get(\"error\"):\n logging.error(json.dumps(data[\"error\"]))\n if data.get(\"warnings\"):\n for warning in data[\"warnings\"]:\n logging.warning(json.dumps(warning))\n\n\ndef count_examples(url: str, n: int = 30) -> None:\n \"\"\"Print a table to stdout containing implementation counts for the first\n `n` tasks, sorted by number implementations (most to least).\"\"\"\n session = get_session()\n langs = set(sm_ask_all_languages(session, url))\n tasks = sm_ask_all_tasks(session, url, langs)\n drafts = sm_ask_all_drafts(session, url, langs)\n all_tasks = [*tasks, *drafts]\n\n # Map of task to (implemented in, not implemented in, omitted from)\n counts: Dict[Task, Tuple[int, int, int]] = {}\n\n # Running total of examples for all tasks. Where a language has multiple examples\n # for a single tasks, we only count one example.\n total: int = 0\n\n for task in all_tasks:\n total += len(task.implemented_in)\n counts[task] = (\n len(task.implemented_in),\n len(task.not_implemented_in(langs)),\n len(task.omitted_from),\n )\n\n # Pretty print\n top = sorted(counts.items(), key=lambda it: it[1][0], reverse=True)[:n]\n pad = max([len(task.fulltext) for task, _ in top])\n\n print(\"\\nKnown languages:\", len(langs))\n print(\"Total tasks:\", len(all_tasks))\n print(\"Total examples:\", total)\n print(f\"{'Task':>{pad}} | Implemented In | Not Implemented In | Omitted From\")\n print(\"-\" * (pad + 1), \"+\", \"-\" * 16, \"+\", \"-\" * 20, \"+\", \"-\" * 13, sep=\"\")\n\n for task, _counts in top:\n implemented_in, not_implemented_in, omitted_from = _counts\n print(\n f\"{task.fulltext:>{pad}} |\"\n f\"{implemented_in:>15} |\"\n f\"{not_implemented_in:>19} |\"\n f\"{omitted_from:>13}\"\n )\n\n\nif __name__ == \"__main__\":\n import argparse\n\n URL = \"https://rosettacode.org/w/api.php\"\n parser = argparse.ArgumentParser(description=\"Count tasks on Rosetta Code.\")\n\n parser.add_argument(\n \"--rows\",\n \"-n\",\n type=int,\n default=30,\n dest=\"n\",\n help=\"number of rows to display in the output table (default: 30)\",\n )\n\n parser.add_argument(\n \"--url\",\n default=URL,\n help=f\"target MediaWiki URL (default: {URL})\",\n )\n\n args = parser.parse_args()\n count_examples(args.url, args.n)\n","language":"Python"},{"code":"library(XML)\nlibrary(RCurl)\ndoc <- xmlInternalTreeParse(\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\")\nnodes <- getNodeSet(doc,\"//cm\")\ntitles = as.character( sapply(nodes, xmlGetAttr, \"title\") )\nheaders <- list()\ncounts <- list()\nfor (i in 1:length(titles)){\n\theaders[[i]] <- getURL( paste(\"http://rosettacode.org/mw/index.php?title=\", gsub(\" \", \"_\", titles[i]), \"&action=raw\", sep=\"\") )\n\tcounts[[i]] <- strsplit(headers[[i]],split=\" \")[[1]]\n\tcounts[[i]] <- grep(\"\\\\{\\\\{header\", counts[[i]])\n\tcat(titles[i], \":\", length(counts[[i]]), \"examples\\n\")\n}\ncat(\"Total: \", length(unlist(counts)), \"examples\\n\")\n","language":"R"},{"code":"#lang racket\n\n(require net/url net/uri-codec json (only-in racket/dict [dict-ref ref]))\n\n(define (RC-get verb params)\n ((compose1 get-pure-port string->url format)\n \"http://rosettacode.org/mw/~a.php?~a\" verb (alist->form-urlencoded params)))\n\n(define (get-category catname)\n (let loop ([c #f])\n (define t\n ((compose1 read-json RC-get) 'api\n `([action . \"query\"] [format . \"json\"]\n [list . \"categorymembers\"] [cmtitle . ,(format \"Category:~a\" catname)]\n [cmcontinue . ,(and c (ref c 'cmcontinue))] [cmlimit . \"500\"])))\n (define (c-m key) (ref (ref t key '()) 'categorymembers #f))\n (append (for/list ([page (c-m 'query)]) (ref page 'title))\n (cond [(c-m 'query-continue) => loop] [else '()]))))\n\n(printf \"Total: ~a\\n\"\n (for/sum ([task (get-category 'Programming_Tasks)])\n (define s ((compose1 length regexp-match-positions*)\n #rx\"=={{\" (RC-get 'index `([action . \"raw\"] [title . ,task]))))\n (printf \"~a: ~a\\n\" task s)\n s))\n","language":"Racket"},{"code":"use HTTP::UserAgent;\nuse URI::Escape;\nuse JSON::Fast;\nuse Lingua::EN::Numbers :short;\n\nunit sub MAIN ( Bool :nf(:$no-fetch) = False, :t(:$tier) = 1 );\n\n# Friendlier descriptions for task categories\nmy %cat = (\n 'Programming_Tasks' => 'Task',\n 'Draft_Programming_Tasks' => 'Draft'\n);\n\nmy $client = HTTP::UserAgent.new;\n$client.timeout = 10;\n\nmy $url = 'https://rosettacode.org/w';\n\nmy $hashfile = './RC_Task_count.json';\nmy $tablefile = \"./RC_Task_count-{$tier}.txt\";\n\nmy %tasks;\n\nmy @places = <① ② ③ ④ ⑤ ⑥ ⑦ ⑧ ⑨ ⑩ ⑪ ⑫ ⑬ ⑭ ⑮ ⑯ ⑰ ⑱ ⑲ ⑳ ㉑ ㉒ ㉓ ㉔ ㉕\n ㉖ ㉗ ㉘ ㉙ ㉚ ㉛ ㉜ ㉝ ㉞ ㉟ ㊱ ㊲ ㊳ ㊴ ㊵ ㊶ ㊷ ㊸ ㊹ ㊺ ㊺ ㊻ ㊼ ㊽ ㊾ ㊿>;\n\n# clear screen\nrun($*DISTRO.is-win ?? 'cls' !! 'clear') unless $no-fetch;\n\nmy %counts =\n mediawiki-query(\n $url, 'pages',\n :generator<categorymembers>,\n :gcmtitle<Category:Programming Languages>,\n :gcmlimit<350>,\n :rawcontinue(),\n :prop<categoryinfo>\n )\n .map({ .<title>.subst(/^'Category:'/, '') => .<categoryinfo><pages> || 0 });\n\nmy $per-tier = 10;\n\nmy $which = (^$per-tier) »+» $per-tier * ($tier - 1);\n\nmy @top-n = %counts.sort( {-.value, .key} )[|$which].map: *.key.trans(' ' => '_');\n\n# dump a copy to STDOUT, mostly for debugging purposes\nsay \"<pre>{tc $tier.&ord-n} {$per-tier.&card} programming languages by number of task examples completed:\";\nsay ' ', join ' ', .map( {(\"{(@places[|$which])[$_]} {@top-n[$_]}\").fmt(\"%-15s\")} ) for (^@top-n).batch(5);\nsay \"</pre>\\n\";\n\nunless $no-fetch {\n\n note 'Retrieving task information...';\n\n mkdir('./pages') unless './pages'.IO.e;\n\n @top-n = %counts.sort( {-.value, .key} )[^@places].map: *.key.trans(' ' => '_');;\n\n for %cat.keys.sort -> $cat {\n mediawiki-query(\n $url, 'pages',\n :generator<categorymembers>,\n :gcmtitle(\"Category:$cat\"),\n :gcmlimit<350>,\n :rawcontinue(),\n :prop<title>\n ).map({\n my $page;\n my $response;\n\n loop {\n $response = $client.get(\"{ $url }/index.php?title={ uri-escape .<title> }&action=raw\");\n if $response.is-success {\n $page = $response.content;\n last;\n } else {\n redo;\n }\n }\n\n \"./pages/{ uri-escape .<title>.subst(/' '/, '_', :g) }\".IO.spurt($page);\n my $lc = $page.lc.trans(' ' => '_');\n my $count = +$lc.comb(/ ^^'==' <-[\\n=]>* '{{header|' <-[}]>+? '}}==' \\h* $$ /);\n %tasks{.<title>} = {'cat' => %cat{$cat}, :$count};\n %tasks{.<title>}<top-n> = (^@top-n).map( {\n ($lc.contains(\"==\\{\\{header|{@top-n[$_].lc}}}\") or\n # Deal with 3 part headers - {{header|F_Sharp|F#}}, {{header|C_Sharp|C#}}, etc.\n $lc.contains(\"==\\{\\{header|{@top-n[$_].lc}|\") or\n # Icon and Unicon are their own special flowers\n $lc.contains(\"}}_and_\\{\\{header|{@top-n[$_].lc}}}==\") or\n # Language1 / Language2 for shared entries (e.g. C / C++)\n $lc.contains(rx/'}}''_'*'/''_'*'{{header|'$(@top-n[$_].lc)'}}=='/)) ??\n (@places[$_]) !!\n # Check if the task was omitted\n $lc.contains(\"\\{\\{omit_from|{@top-n[$_].lc}\") ?? 'O' !!\n # The task is neither done or omitted\n ' '\n } ).join;\n print clear, 1 + $++, ' ', %cat{$cat}, ' ', .<title>;\n })\n }\n\n print clear;\n\n note \"\\nTask information saved to local file: {$hashfile.IO.absolute}\";\n $hashfile.IO.spurt(%tasks.&to-json);\n\n}\n\n# Load information from local file\n%tasks = $hashfile.IO.e ?? $hashfile.IO.slurp.&from-json !! ( );\n\n@top-n = %counts.sort( {-.value, .key} )[|$which].map: *.key.trans(' ' => '_');\n\n# Convert saved task info to a table\nnote \"\\nBuilding table...\";\nmy $count = +%tasks;\nmy $taskcnt = +%tasks.grep: *.value.<cat> eq %cat<Programming_Tasks>;\nmy $draftcnt = $count - $taskcnt;\nmy $total = sum %tasks{*}»<count>;\n\n# Dump table to a file\nmy $out = open($tablefile, :w) or die \"$!\\n\";\n\n$out.say: \"<pre>{tc $tier.&ord-n} {$per-tier.&card} programming languages by number of task examples completed:\";\n$out.say: ' ', join ' ', .map( {(\"{(@places[|$which])[$_]} {@top-n[$_]}\").fmt(\"%-15s\")} ) for (^@top-n).batch(5);\n$out.say: \"</pre>\\n\\n<div style=\\\"height:40em;overflow:scroll;\\\">\";\n\n# Add table boilerplate and caption\n$out.say:\n '{|class=\"wikitable sortable\"', \"\\n\",\n \"|+ As of { DateTime.new(time) } :: Tasks: { $taskcnt } ::<span style=\\\"background-color:#ffd\\\"> Draft Tasks:\",\n \"{ $draftcnt } </span>:: Total Tasks: { $count } :: Total Examples: { $total }\\n\",\n \"!Count!!Task!!{(@places[|$which]).join('!!')}\"\n;\n\n# Sort tasks by count then add row\nfor %tasks.sort: { [-.value<count>, .key] } -> $task {\n $out.say:\n ( $task.value<cat> eq 'Draft'\n ?? \"|- style=\\\"background-color: #ffc\\\"\\n\"\n !! \"|-\\n\"\n ),\n \"| { $task.value<count> }\\n\",\n ( $task.key ~~ /\\d/\n ?? \"|data-sort-value=\\\"{ $task.key.&naturally }\\\"| [[{uri-escape $task.key}|{$task.key}]]\\n\"\n !! \"| [[{uri-escape $task.key}|{$task.key}]]\\n\"\n ),\n \"|{ $task.value<top-n>.comb[|$which].join('||') }\"\n}\n\n$out.say( \"|}\\n</div>\" );\n$out.close;\n\nnote \"Table file saved as: {$tablefile.IO.absolute}\";\n\nsub mediawiki-query ($site, $type, *%query) {\n my $url = \"$site/api.php?\" ~ uri-query-string(\n :action<query>, :format<json>, :formatversion<2>, |%query);\n my $continue = '';\n\n gather loop {\n my $response = $client.get(\"$url&$continue\");\n my $data = from-json($response.content);\n take $_ for $data.<query>.{$type}.values;\n $continue = uri-query-string |($data.<query-continue>{*}».hash.hash or last);\n }\n}\n\nsub uri-query-string (*%fields) { %fields.map({ \"{.key}={uri-escape .value}\" }).join(\"&\") }\n\nsub naturally ($a) { $a.lc.subst(/(\\d+)/, ->$/ {0~(65+$0.chars).chr~$0},:g) }\n\nsub clear { \"\\r\" ~ ' ' x 116 ~ \"\\r\" }\n","language":"Raku"},{"code":"# Project: Rosetta Code/Count examples\n\nload \"stdlib.ring\"\nros= download(\"http://rosettacode.org/wiki/Category:Programming_Tasks\")\npos = 1\nnum = 0\ntotalros = 0\nrosname = \"\"\nrostitle = \"\"\nfor n = 1 to len(ros)\n nr = searchstring(ros,'<li><a href=\"/wiki/',pos)\n if nr = 0\n exit\n else\n pos = nr + 1\n ok\n nr = searchname(nr)\n nr = searchtitle(nr)\nnext\nsee nl\nsee \"Total: \" + totalros + \" examples.\" + nl\n\nfunc searchstring(str,substr,n)\n newstr=right(str,len(str)-n+1)\n nr = substr(newstr, substr)\n if nr = 0\n return 0\n else\n return n + nr -1\n ok\n\nfunc searchname(sn)\n nr2 = searchstring(ros,'\">',sn)\n nr3 = searchstring(ros,\"</a></li>\",sn)\n rosname = substr(ros,nr2+2,nr3-nr2-2)\n return sn\n\nfunc searchtitle(sn)\n st = searchstring(ros,\"title=\",sn)\n rostitle = substr(ros,sn+19,st-sn-21)\n rostitle = \"rosettacode.org/wiki/\" + rostitle\n rostitle = download(rostitle)\n sum = count(rostitle,\"Edit section:\")\n num = num + 1\n see \"\" + num + \". \" + rosname + \": \" + sum + \" examples.\" + nl\n totalros = totalros + sum\n return sn\n\nfunc count(cstring,dstring)\n sum = 0\n while substr(cstring,dstring) > 0\n sum = sum + 1\n cstring = substr(cstring,substr(cstring,dstring)+len(string(sum)))\n end\n return sum\n","language":"Ring"},{"code":"require 'open-uri'\nrequire 'rexml/document'\n\nmodule RosettaCode\n\n URL_ROOT = \"http://rosettacode.org/mw\"\n\n def self.get_url(page, query)\n begin\n # Ruby 1.9.2\n pstr = URI.encode_www_form_component(page)\n qstr = URI.encode_www_form(query)\n rescue NoMethodError\n require 'cgi'\n pstr = CGI.escape(page)\n qstr = query.map {|k,v|\n \"%s=%s\" % [CGI.escape(k.to_s), CGI.escape(v.to_s)]}.join(\"&\")\n end\n url = \"#{URL_ROOT}/#{pstr}?#{qstr}\"\n p url if $DEBUG\n url\n end\n\n def self.get_api_url(query)\n get_url \"api.php\", query\n end\n\n def self.category_members(category)\n query = {\n \"action\" => \"query\",\n \"list\" => \"categorymembers\",\n \"cmtitle\" => \"Category:#{category}\",\n \"format\" => \"xml\",\n \"cmlimit\" => 500,\n }\n while true\n url = get_api_url query\n doc = REXML::Document.new open(url)\n\n REXML::XPath.each(doc, \"//cm\") do |task|\n yield task.attribute(\"title\").value\n end\n\n continue = REXML::XPath.first(doc, \"//query-continue\")\n break if continue.nil?\n cm = REXML::XPath.first(continue, \"categorymembers\")\n query[\"cmcontinue\"] = cm.attribute(\"cmcontinue\").value\n end\n end\n\nend\n","language":"Ruby"},{"code":"require 'rosettacode'\n\ntotal_examples = 0\n\nRosettaCode.category_members(\"Programming_Tasks\") do |task|\n url = RosettaCode.get_url(\"index.php\", {\"action\" => \"raw\", \"title\" => task})\n examples = open(url).read.scan(\"=={{header\").length\n puts \"#{task}: #{examples}\"\n total_examples += examples\nend\n\nputs\nputs \"Total: #{total_examples}\"\n","language":"Ruby"},{"code":"html \"<table border=1><tr bgcolor=wheat align=center><td>Num</td><td>Task</td><td>Examples</td></tr>\"\n\na$\t= httpGet$(\"http://rosettacode.org/wiki/Category:Programming_Tasks\")\na$\t= word$(a$,1,\"</table></div>\")\ni\t= instr(a$,\"<a href=\"\"/wiki/\")\ni\t= instr(a$,\"<a href=\"\"/wiki/\",i+1)\nwhile i > 0\n count\t= count + 1\n i\t= instr(a$,\"<a href=\"\"/wiki/\",i+1)\n j\t= instr(a$,\">\",i+5)\n a1$\t= mid$(a$,i+15,j-i)\n taskId$ = word$(a1$,1,\"\"\"\")\n task$ = word$(a1$,3,\"\"\"\")\n url$\t= \"http://rosettacode.org/wiki/\";taskId$\n a2$\t= httpGet$(url$)\n ii\t= instr(a2$,\"<span class=\"\"tocnumber\"\">\")\n jj\t= 0\n while ii > 0\n jj\t= ii\n ii\t= instr(a2$,\"<span class=\"\"tocnumber\"\">\",ii+10)\n wend\n if jj = 0 then\n examp = 0\n else\n kk\t= instr(a2$,\"<\",jj+24)\n examp = int(val(mid$(a2$,jj+24,kk-jj-24)))\n end if\n html \"<tr><td align=right>\";count;\"</td><td>\";task$;\"</td><td align=right>\";examp;\"</td></tr>\"\n totExamp = totExamp + examp\nwend\nhtml \"<tr bgcolor=wheat><td>**</td><td>** Total **</td><td align=right>\";totExamp;\"</td></tr></table>\"\nend\n","language":"Run-BASIC"},{"code":"extern crate reqwest;\nextern crate url;\nextern crate rustc_serialize;\n\nuse std::io::Read;\nuse self::url::Url;\nuse rustc_serialize::json::{self, Json};\n\npub struct Task {\n page_id: u64,\n pub title: String,\n}\n\n#[derive(Debug)]\nenum ParseError {\n /// Something went wrong with the HTTP request to the API.\n Http(reqwest::Error),\n\n /// There was a problem parsing the API response into JSON.\n Json(json::ParserError),\n\n /// Unexpected JSON format from response\n UnexpectedFormat,\n}\nimpl From<json::ParserError> for ParseError {\n fn from(error: json::ParserError) -> Self {\n ParseError::Json(error)\n }\n}\n\nimpl From<reqwest::Error> for ParseError {\n fn from(error: reqwest::Error) -> Self {\n ParseError::Http(error)\n }\n}\n\n\nfn construct_query_category(category: &str) -> Url {\n let mut base_url = Url::parse(\"http://rosettacode.org/mw/api.php\").unwrap();\n let cat = format!(\"Category:{}\", category);\n let query_pairs = vec![(\"action\", \"query\"),\n (\"format\", \"json\"),\n (\"list\", \"categorymembers\"),\n (\"cmlimit\", \"500\"),\n (\"cmtitle\", &cat),\n (\"continue\", \"\")];\n base_url.query_pairs_mut().extend_pairs(query_pairs.into_iter());\n base_url\n}\n\nfn construct_query_task_content(task_id: &str) -> Url {\n let mut base_url = Url::parse(\"http://rosettacode.org/mw/api.php\").unwrap();\n let mut query_pairs =\n vec![(\"action\", \"query\"), (\"format\", \"json\"), (\"prop\", \"revisions\"), (\"rvprop\", \"content\")];\n query_pairs.push((\"pageids\", task_id));\n base_url.query_pairs_mut().extend_pairs(query_pairs.into_iter());\n base_url\n}\n\nfn query_api(url: Url) -> Result<Json, ParseError> {\n let mut response = try!(reqwest::get(url.as_str()));\n // Build JSON\n let mut body = String::new();\n response.read_to_string(&mut body).unwrap();\n\n Ok(try!(Json::from_str(&body)))\n}\n\nfn parse_all_tasks(reply: &Json) -> Result<Vec<Task>, ParseError> {\n let json_to_task = |json: &Json| -> Result<Task, ParseError> {\n let page_id: u64 = try!(json.find(\"pageid\")\n .and_then(|id| id.as_u64())\n .ok_or(ParseError::UnexpectedFormat));\n let title: &str = try!(json.find(\"title\")\n .and_then(|title| title.as_string())\n .ok_or(ParseError::UnexpectedFormat));\n\n Ok(Task {\n page_id: page_id,\n title: title.to_owned(),\n })\n };\n let tasks_json = try!(reply.find_path(&[\"query\", \"categorymembers\"])\n .and_then(|tasks| tasks.as_array())\n .ok_or(ParseError::UnexpectedFormat));\n\n // Convert into own type\n tasks_json.iter().map(json_to_task).collect()\n}\nfn count_number_examples(task: &Json, task_id: u64) -> Result<u32, ParseError> {\n let revisions =\n try!(task.find_path(&[\"query\", \"pages\", task_id.to_string().as_str(), \"revisions\"])\n .and_then(|content| content.as_array())\n .ok_or(ParseError::UnexpectedFormat));\n let content = try!(revisions[0]\n .find(\"*\")\n .and_then(|content| content.as_string())\n .ok_or(ParseError::UnexpectedFormat));\n Ok(content.split(\"=={{header\").count() as u32)\n}\n\npub fn query_all_tasks() -> Vec<Task> {\n let query = construct_query_category(\"Programming_Tasks\");\n let json: Json = query_api(query).unwrap();\n parse_all_tasks(&json).unwrap()\n}\n\npub fn query_a_task(task: &Task) -> u32 {\n let query = construct_query_task_content(&task.page_id.to_string());\n let json: Json = query_api(query).unwrap();\n count_number_examples(&json, task.page_id).unwrap()\n}\n","language":"Rust"},{"code":"extern crate count_examples;\nfn main() {\n let all_tasks = count_examples::query_all_tasks();\n for task in &all_tasks {\n let count = count_examples::query_a_task(task);\n println!(\"Task: {} has {} examples\", task.title, count);\n }\n}\n","language":"Rust"},{"code":"import scala.language.postfixOps\n\nobject TaskCount extends App {\n import java.net.{ URL, URLEncoder }\n import scala.io.Source.fromURL\n\n System.setProperty(\"http.agent\", \"*\")\n val allTasksURL =\n \"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\"\n val allTasks = xml.parsing.XhtmlParser(fromURL(new URL(allTasksURL)))\n\n val regexExpr = \"(?i)==\\\\{\\\\{header\\\\|\".r\n\n def oneTaskURL(title: String) = {\n println(s\"Check $title\")\n \"http://www.rosettacode.org/w/index.php?title=%s&action=raw\" format URLEncoder.encode(title.replace(' ', '_'), \"UTF-8\")\n }\n\n def count(title: String) = regexExpr findAllIn fromURL(new URL(oneTaskURL(title)))(io.Codec.UTF8).mkString length\n\n val counts = for (task <- allTasks \\\\ \"cm\" \\\\ \"@title\" map (_.text)) yield scala.actors.Futures.future((task, count(task)))\n\n counts map (_.apply) map Function.tupled(\"%s: %d examples.\" format (_, _)) foreach println\n println(\"\\nTotal: %d examples.\" format (counts map (_.apply._2) sum))\n}\n","language":"Scala"},{"code":"var lwp = require('LWP::UserAgent').new(agent => 'Mozilla/5.0');\n\nvar site = 'http://rosettacode.org';\nvar list_url = '/mw/api.php?action=query&list=categorymembers&'+\n 'cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml';\n\nvar content = lwp.get(site + list_url).decoded_content;\n\nwhile (var m = content.match(/cm.*?title=\"(.*?)\"/g)) {\n (var slug = m[0]).gsub!(' ', '_');\n var count = lwp.get(\"#{site}/wiki/#{slug}\").decoded_content.count(/toclevel-1/g);\n say \"#{m[0]}: #{count} examples\";\n}\n","language":"Sidef"},{"code":"package require Tcl 8.5\npackage require http\npackage require json\n\nfconfigure stdout -buffering none\n\nproc get_tasks {category} {\n set start [clock milliseconds]\n puts -nonewline \"getting $category members...\"\n set base_url http://www.rosettacode.org/w/api.php\n set query {action query list categorymembers cmtitle Category:%s format json cmlimit 500}\n set this_query [dict create {*}[split [format $query $category]]]\n set tasks [list]\n\n while {1} {\n set url [join [list $base_url [http::formatQuery {*}$this_query]] ?]\n set response [http::geturl $url]\n if {[set s [http::status $response]] ne \"ok\" || [http::ncode $response] != 200} {\n error \"Oops: url=$url\\nstatus=$s\\nhttp code=[http::code $response]\"\n }\n set data [json::json2dict [http::data $response]]\n http::cleanup $response\n\n # add tasks to list\n foreach task [dict get $data query categorymembers] {\n lappend tasks [dict get [dict create {*}$task] title]\n }\n\n if {[catch {dict get $data query-continue categorymembers cmcontinue} continue_task] != 0} {\n # no more continuations, we're done\n break\n }\n dict set this_query cmcontinue $continue_task\n }\n puts \" found [llength $tasks] tasks in [expr {[clock milliseconds] - $start}] milliseconds\"\n return $tasks\n}\n\n# This proc can be replaced by a single regexp command:\n# set count [regexp -all \"***=$needle\" $haystack]\n# However this proc is more efficient -- we're dealing with plain strings only.\nproc count_substrings {needle haystack} {\n set count 0\n set idx 0\n while {[set idx [string first $needle $haystack $idx]] != -1} {\n incr count\n incr idx\n }\n return $count\n}\n\nset total 0\nforeach task [get_tasks Programming_Tasks] {\n set url [format \"http://www.rosettacode.org/w/index.php?title=%s&action=raw\" [string map {{ } _} $task]]\n set response [http::geturl $url]\n if {[set s [http::status $response]] ne \"ok\" || [http::ncode $response] != 200} {\n error \"Oops: url=$url\\nstatus=$s\\nhttp code=[http::code $response]\"\n }\n set count [count_substrings \"\\{\\{header|\" [http::data $response]]\n puts [format \"%3d examples in %s\" $count $task]\n http::cleanup $response\n incr total $count\n}\n\nputs \"\\nTotal: $total examples\"\n","language":"Tcl"},{"code":"$$ MODE TUSCRIPT\nurl=\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\"\ndata=REQUEST (url)\n\nBUILD S_TABLE beg=*\nDATA :title=\":\nBUILD S_TABLE end=*\nDATA :\":\n\ntitles=EXTRACT (data,beg|,end,1,0,\"~~\")\ntitles=SPLIT (titles,\":~~:\")\nsz_titles=SIZE (titles)\n\nBUILD R_TABLE header=\":==\\{\\{header|:\"\nall=*\n\nERROR/STOP CREATE (\"tasks\",seq-e,-std-)\n\nCOMPILE\nLOOP title=titles\nask=*\nask =SET_VALUE(ask,\"title\",title)\nask =SET_VALUE(ask,\"action\",\"raw\")\nask =ENCODE (ask,cgi)\nhttp =\"http://www.rosettacode.org/mw/index.php\"\nurl =CONCAT (http,\"?\",ask)\ndata =REQUEST (url)\nheader =FILTER_INDEX (data,header,-)\nsz_header=SIZE(header)\nline =CONCAT (title,\"=\",sz_header,\" members\")\nFILE \"tasks\" = line\nall =APPEND(all,sz_header)\nENDLOOP\n\nENDCOMPILE\nall =JOIN(all),sum=SUM(all),time=time()\nline=CONCAT (time,\": \", sz_titles, \" Programing Tasks: \", sum, \" solutions\")\n\nFILE \"tasks\" = line\n","language":"TUSCRIPT"},{"code":"#!/usr/bin/env bash\nSITE=https://www.rosettacode.org\nAPI=$SITE/mw/api.php\nPAGES=$SITE/mw/index.php\nquery=\"$API?action=query\"\nquery+=$(printf '&%s' \\\n list=categorymembers \\\n cmtitle=Category:Programming_Tasks \\\n cmlimit=500)\ntotal=0\nwhile read title; do\n t=${title// /_}\n tasks=$(curl -s \"$PAGES?title=$t&action=raw\" \\\n | grep -c '{{header|')\n printf '%s: %d examples.\\n' \"$title\" \"$tasks\"\n let total+=tasks\ndone < <(curl -s \"$query&format=json\" \\\n | jq -r '.query.categorymembers[].title')\n\nprintf '\\nTotal: %d examples.\\n' \"$total\"\n","language":"UNIX-Shell"},{"code":"/* Rosetta_Code_Count_examples.wren */\n\nimport \"./pattern\" for Pattern\n\nvar CURLOPT_URL = 10002\nvar CURLOPT_FOLLOWLOCATION = 52\nvar CURLOPT_WRITEFUNCTION = 20011\nvar CURLOPT_WRITEDATA = 10001\n\nforeign class Buffer {\n construct new() {} // C will allocate buffer of a suitable size\n\n foreign value // returns buffer contents as a string\n}\n\nforeign class Curl {\n construct easyInit() {}\n\n foreign easySetOpt(opt, param)\n\n foreign easyPerform()\n\n foreign easyCleanup()\n}\n\nvar curl = Curl.easyInit()\n\nvar getContent = Fn.new { |url|\n var buffer = Buffer.new()\n curl.easySetOpt(CURLOPT_URL, url)\n curl.easySetOpt(CURLOPT_FOLLOWLOCATION, 1)\n curl.easySetOpt(CURLOPT_WRITEFUNCTION, 0) // write function to be supplied by C\n curl.easySetOpt(CURLOPT_WRITEDATA, buffer)\n curl.easyPerform()\n return buffer.value\n}\n\nvar url = \"https://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\"\nvar content = getContent.call(url)\nvar p = Pattern.new(\"title/=\\\"[+1^\\\"]\\\"\")\nvar matches = p.findAll(content)\nfor (m in matches) {\n var title = m.capsText[0].replace(\"'\", \"'\").replace(\""\", \"\\\"\")\n var title2 = title.replace(\" \", \"_\").replace(\"+\", \"\\%252B\")\n var taskUrl = \"https://www.rosettacode.org/w/index.php?title=%(title2)&action=raw\"\n var taskContent = getContent.call(taskUrl)\n var lines = taskContent.split(\"\\n\")\n var count = lines.count { |line| line.trim().startsWith(\"=={{header|\") }\n System.print(\"%(title) : %(count) examples\")\n}\n\ncurl.easyCleanup()\n","language":"Wren"},{"code":"/* gcc Rosetta_Code_Count_examples.c -o Rosetta_Code_Count_examples -lcurl -lwren -lm */\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <curl/curl.h>\n#include \"wren.h\"\n\nstruct MemoryStruct {\n char *memory;\n size_t size;\n};\n\n/* C <=> Wren interface functions */\n\nstatic size_t WriteMemoryCallback(void *contents, size_t size, size_t nmemb, void *userp) {\n size_t realsize = size * nmemb;\n struct MemoryStruct *mem = (struct MemoryStruct *)userp;\n\n char *ptr = realloc(mem->memory, mem->size + realsize + 1);\n if(!ptr) {\n /* out of memory! */\n printf(\"not enough memory (realloc returned NULL)\\n\");\n return 0;\n }\n\n mem->memory = ptr;\n memcpy(&(mem->memory[mem->size]), contents, realsize);\n mem->size += realsize;\n mem->memory[mem->size] = 0;\n return realsize;\n}\n\nvoid C_bufferAllocate(WrenVM* vm) {\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenSetSlotNewForeign(vm, 0, 0, sizeof(struct MemoryStruct));\n ms->memory = malloc(1);\n ms->size = 0;\n}\n\nvoid C_bufferFinalize(void* data) {\n struct MemoryStruct *ms = (struct MemoryStruct *)data;\n free(ms->memory);\n}\n\nvoid C_curlAllocate(WrenVM* vm) {\n CURL** pcurl = (CURL**)wrenSetSlotNewForeign(vm, 0, 0, sizeof(CURL*));\n *pcurl = curl_easy_init();\n}\n\nvoid C_value(WrenVM* vm) {\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 0);\n wrenSetSlotString(vm, 0, ms->memory);\n}\n\nvoid C_easyPerform(WrenVM* vm) {\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\n curl_easy_perform(curl);\n}\n\nvoid C_easyCleanup(WrenVM* vm) {\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\n curl_easy_cleanup(curl);\n}\n\nvoid C_easySetOpt(WrenVM* vm) {\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\n CURLoption opt = (CURLoption)wrenGetSlotDouble(vm, 1);\n if (opt < 10000) {\n long lparam = (long)wrenGetSlotDouble(vm, 2);\n curl_easy_setopt(curl, opt, lparam);\n } else if (opt < 20000) {\n if (opt == CURLOPT_WRITEDATA) {\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 2);\n curl_easy_setopt(curl, opt, (void *)ms);\n } else if (opt == CURLOPT_URL) {\n const char *url = wrenGetSlotString(vm, 2);\n curl_easy_setopt(curl, opt, url);\n }\n } else if (opt < 30000) {\n if (opt == CURLOPT_WRITEFUNCTION) {\n curl_easy_setopt(curl, opt, &WriteMemoryCallback);\n }\n }\n}\n\nWrenForeignClassMethods bindForeignClass(WrenVM* vm, const char* module, const char* className) {\n WrenForeignClassMethods methods;\n methods.allocate = NULL;\n methods.finalize = NULL;\n if (strcmp(module, \"main\") == 0) {\n if (strcmp(className, \"Buffer\") == 0) {\n methods.allocate = C_bufferAllocate;\n methods.finalize = C_bufferFinalize;\n } else if (strcmp(className, \"Curl\") == 0) {\n methods.allocate = C_curlAllocate;\n }\n }\n return methods;\n}\n\nWrenForeignMethodFn bindForeignMethod(\n WrenVM* vm,\n const char* module,\n const char* className,\n bool isStatic,\n const char* signature) {\n if (strcmp(module, \"main\") == 0) {\n if (strcmp(className, \"Buffer\") == 0) {\n if (!isStatic && strcmp(signature, \"value\") == 0) return C_value;\n } else if (strcmp(className, \"Curl\") == 0) {\n if (!isStatic && strcmp(signature, \"easySetOpt(_,_)\") == 0) return C_easySetOpt;\n if (!isStatic && strcmp(signature, \"easyPerform()\") == 0) return C_easyPerform;\n if (!isStatic && strcmp(signature, \"easyCleanup()\") == 0) return C_easyCleanup;\n }\n }\n return NULL;\n}\n\nstatic void writeFn(WrenVM* vm, const char* text) {\n printf(\"%s\", text);\n}\n\nvoid errorFn(WrenVM* vm, WrenErrorType errorType, const char* module, const int line, const char* msg) {\n switch (errorType) {\n case WREN_ERROR_COMPILE:\n printf(\"[%s line %d] [Error] %s\\n\", module, line, msg);\n break;\n case WREN_ERROR_STACK_TRACE:\n printf(\"[%s line %d] in %s\\n\", module, line, msg);\n break;\n case WREN_ERROR_RUNTIME:\n printf(\"[Runtime Error] %s\\n\", msg);\n break;\n }\n}\n\nchar *readFile(const char *fileName) {\n FILE *f = fopen(fileName, \"r\");\n fseek(f, 0, SEEK_END);\n long fsize = ftell(f);\n rewind(f);\n char *script = malloc(fsize + 1);\n fread(script, 1, fsize, f);\n fclose(f);\n script[fsize] = 0;\n return script;\n}\n\nstatic void loadModuleComplete(WrenVM* vm, const char* module, WrenLoadModuleResult result) {\n if( result.source) free((void*)result.source);\n}\n\nWrenLoadModuleResult loadModule(WrenVM* vm, const char* name) {\n WrenLoadModuleResult result = {0};\n if (strcmp(name, \"random\") != 0 && strcmp(name, \"meta\") != 0) {\n result.onComplete = loadModuleComplete;\n char fullName[strlen(name) + 6];\n strcpy(fullName, name);\n strcat(fullName, \".wren\");\n result.source = readFile(fullName);\n }\n return result;\n}\n\nint main(int argc, char **argv) {\n WrenConfiguration config;\n wrenInitConfiguration(&config);\n config.writeFn = &writeFn;\n config.errorFn = &errorFn;\n config.bindForeignClassFn = &bindForeignClass;\n config.bindForeignMethodFn = &bindForeignMethod;\n config.loadModuleFn = &loadModule;\n WrenVM* vm = wrenNewVM(&config);\n const char* module = \"main\";\n const char* fileName = \"Rosetta_Code_Count_examples.wren\";\n char *script = readFile(fileName);\n WrenInterpretResult result = wrenInterpret(vm, module, script);\n switch (result) {\n case WREN_RESULT_COMPILE_ERROR:\n printf(\"Compile Error!\\n\");\n break;\n case WREN_RESULT_RUNTIME_ERROR:\n printf(\"Runtime Error!\\n\");\n break;\n case WREN_RESULT_SUCCESS:\n break;\n }\n wrenFreeVM(vm);\n free(script);\n return 0;\n}\n","language":"Wren"},{"code":"var [const] YAJL=Import(\"zklYAJL\")[0], CURL=Import(\"zklCurl\");\n\nfcn getTasks(language){\n continueValue,tasks:=\"\",Data(0,String); // \"nm\\0nm\\0....\"\n do{\n page:=CURL().get((\"http://rosettacode.org/mw/api.php?\"\n \"action=query&cmlimit=500\"\n\t \"&format=json\"\n\t \"&list=categorymembers\"\n\t \"&cmtitle=Category:%s\"\n\t \"&cmcontinue=%s\").fmt(language,continueValue));\n page=page[0].del(0,page[1]); // get rid of HTML header\n json:=YAJL().write(page).close();\n json[\"query\"][\"categorymembers\"].pump(tasks,T(\"get\",\"title\"));\n continueValue=json.find(\"continue\") //continue:-||,cmcontinue:page|954|19)\n .toList().apply(\"concat\",\"=\").concat(\"&\");\n }while(continueValue);\n tasks\n}\nre:=RegExp(0'!\\s+==\\s*{{\\s*header\\s*\\|!); // == {{ header | zkl\nforeach task in (getTasks(\"Programming_Tasks\")){\n page:=CURL().get(\n \"http://www.rosettacode.org/mw/index.php?title=%s&action=raw\"\n .fmt(CURL.urlEncode(task)));\n page=page[0].del(0,page[1]); // get rid of HTML header\n cnt,n:=0,0; while(re.search(page,True,n)){ cnt+=1; n=re.matched[0].sum(0); }\n \"%4d: %s\".fmt(cnt,task).println();\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Rosetta_Code/Count_examples\\nnote: Rosetta Code related\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Find the total number of programming examples for each [[:Category:Programming Tasks|task]] and the total for all tasks.\\n\\nEssentially, count the number of occurrences of <tt>=={{header|</tt> on each task page.\\n\\nOutput:\\n\\n<pre>100 doors: 20 examples.\\n99 Bottles of Beer: 29 examples.\\nAbstract type: 10 examples.\\n\\nTotal: X examples.</pre>\\n\\nFor a full output, updated periodically, see [[Rosetta Code/Count examples/Full list]].\\n\\nYou'll need to use the Media Wiki API, which you can find out about locally, [http://rosettacode.org/mw/api.php here], or in Media Wiki's API documentation at, [http://www.mediawiki.org/wiki/API_Query API:Query]\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"with Aws.Client, Aws.Messages, Aws.Response, Aws.Resources, Aws.Url;\\nwith Dom.Readers, Dom.Core, Dom.Core.Documents, Dom.Core.Nodes, Dom.Core.Attrs;\\nwith Input_Sources.Strings, Unicode, Unicode.Ces.Utf8;\\nwith Ada.Strings.Unbounded, Ada.Strings.Fixed, Ada.Text_IO, Ada.Command_Line;\\nwith Ada.Containers.Vectors;\\n\\nuse Aws.Client, Aws.Messages, Aws.Response, Aws.Resources, Aws.Url;\\nuse Dom.Readers, Dom.Core, Dom.Core.Documents, Dom.Core.Nodes, Dom.Core.Attrs;\\nuse Aws, Ada.Strings.Unbounded, Ada.Strings.Fixed, Input_Sources.Strings;\\nuse Ada.Text_IO, Ada.Command_Line;\\n\\nprocedure Count_Examples is\\n\\n package Members_Vectors is new Ada.Containers.Vectors (\\n Index_Type => Positive,\\n Element_Type => Unbounded_String);\\n use Members_Vectors;\\n\\n Exemples : Vector;\\n Nbr_Lg, Total : Natural := 0;\\n\\n procedure Get_Vector (Category : in String; Mbr_Vector : in out Vector) is\\n Reader : Tree_Reader;\\n Doc : Document;\\n List : Node_List;\\n N : Node;\\n A : Attr;\\n Page : Aws.Response.Data;\\n Uri_Xml : constant String :=\\n \\\"http://rosettacode.org/mw/api.php?action=query&list=categorymembers\\\"\\n &\\n \\\"&format=xml&cmlimit=500&cmtitle=Category:\\\";\\n begin\\n Page := Client.Get (Uri_Xml & Category);\\n if Response.Status_Code (Page) not in Messages.Success then\\n raise Client.Connection_Error;\\n end if;\\n declare\\n Xml : constant String := Message_Body (Page);\\n Source : String_Input;\\n begin\\n Open\\n (Xml'Unrestricted_Access,\\n Unicode.Ces.Utf8.Utf8_Encoding,\\n Source);\\n Parse (Reader, Source);\\n Close (Source);\\n end;\\n Doc := Get_Tree (Reader);\\n List := Get_Elements_By_Tag_Name (Doc, \\\"cm\\\");\\n for Index in 1 .. Length (List) loop\\n N := Item (List, Index - 1);\\n A := Get_Named_Item (Attributes (N), \\\"title\\\");\\n Append (Mbr_Vector, To_Unbounded_String (Value (A)));\\n end loop;\\n Free (List);\\n Free (Reader);\\n end Get_Vector;\\n\\n function Scan_Page (Title : String) return Natural is\\n Page : Aws.Response.Data;\\n File : Aws.Resources.File_Type;\\n Buffer : String (1 .. 1024);\\n Languages, Position, Last : Natural := 0;\\n begin\\n Page :=\\n Client.Get\\n (\\\"http://rosettacode.org/mw/index.php?title=\\\" &\\n Aws.Url.Encode (Title) &\\n \\\"&action=raw\\\");\\n Response.Message_Body (Page, File);\\n while not End_Of_File (File) loop\\n Resources.Get_Line (File, Buffer, Last);\\n Position :=\\n Index\\n (Source => Buffer (Buffer'First .. Last),\\n Pattern => \\\"=={{header|\\\");\\n if Position > 0 then\\n Languages := Languages + 1;\\n end if;\\n end loop;\\n Close (File);\\n return Languages;\\n end Scan_Page;\\n\\nbegin\\n Get_Vector (\\\"Programming_Tasks\\\", Exemples);\\n\\n for I in First_Index (Exemples) .. Last_Index (Exemples) loop\\n declare\\n Title : constant String :=\\n To_String (Members_Vectors.Element (Exemples, I));\\n begin\\n Nbr_Lg := Scan_Page (Title);\\n Total := Total + Nbr_Lg;\\n Put_Line (Title & \\\" :\\\" & Integer'Image (Nbr_Lg) & \\\" exemples.\\\");\\n end;\\n end loop;\\n\\n Put_Line (\\\"Total :\\\" & Integer'Image (Total) & \\\" exemples.\\\");\\nend Count_Examples;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"UrlDownloadToFile\\n , http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\n , tasks.xml\\nFileRead, tasks, tasks.xml\\npos = 0\\nquote = \\\" ; \\\"\\nregtitle := \\\"<cm.*?title=\\\" . quote . \\\"(.*?)\\\" . quote\\nWhile, pos := RegExMatch(tasks, regtitle, title, pos + 1)\\n{\\n UrlDownloadToFile\\n , % \\\"http://www.rosettacode.org/w/index.php?title=\\\" . title1 . \\\"&action=raw\\\"\\n , task.xml\\n FileRead, task, task.xml\\n RegExReplace(task, \\\"\\\\{\\\\{header\\\\|\\\", \\\"\\\", count)\\n current := title1 . \\\": \\\" . count . \\\" examples.`n\\\"\\n output .= current\\n TrayTip, current, % current\\n}\\nMsgBox % output\\nReturn\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \" VDU 23,22,640;512;8,16,16,128+8 : REM Enable UTF-8 support\\n\\n SYS \\\"LoadLibrary\\\", \\\"URLMON.DLL\\\" TO urlmon%\\n SYS \\\"GetProcAddress\\\", urlmon%, \\\"URLDownloadToFileA\\\" TO UDTF\\n special$ = \\\"+()'\\\"\\n\\n url$ = \\\"http://www.rosettacode.org/w/api.php?action=query\\\" + \\\\\\n \\\\ \\\"&list=categorymembers&cmtitle=Category:Programming_Tasks\\\" + \\\\\\n \\\\ \\\"&cmlimit=500&format=xml\\\"\\n file$ = @tmp$ + \\\"tasks.xml\\\"\\n SYS UDTF, 0, url$, file$, 0, 0 TO fail%\\n IF fail% ERROR 100, \\\"File download failed (tasks)\\\"\\n\\n Total% = 0\\n file% = OPENIN(file$)\\n WHILE NOT EOF#file%\\n a$ = GET$#file%\\n i% = 0\\n REPEAT\\n i% = INSTR(a$, \\\"title=\\\", i%+1)\\n IF i% THEN\\n j% = INSTR(a$, \\\">\\\", i%)\\n title$ = MID$(a$, i%+7, j%-i%-10)\\n REM Replace HTML codes:\\n REPEAT\\n k% = INSTR(title$, \\\"&\\\")\\n IF k% THEN\\n l% = INSTR(title$, \\\";\\\", k%)\\n title$ = LEFT$(title$,k%-1) + \\\\\\n \\\\ FNhtml(MID$(title$,k%,l%-k%+1)) + MID$(title$,l%+1)\\n ENDIF\\n UNTIL k% = 0\\n t$ = title$\\n REM Substitute characters not allowed in a URL:\\n FOR s% = 1 TO LEN(special$)\\n REPEAT\\n s$ = MID$(special$, s%, 1)\\n k% = INSTR(t$, s$)\\n IF k% t$ = LEFT$(t$,k%-1) + \\\"%\\\" + STR$~ASCs$ + MID$(t$,k%+1)\\n UNTIL k% = 0\\n NEXT\\n url$ = \\\"http://www.rosettacode.org/w/index.php?title=\\\" + t$ + \\\\\\n \\\\ \\\"&action=raw\\\"\\n file$ = @tmp$ + \\\"title.htm\\\"\\n SYS UDTF, 0, url$, file$, 0, 0 TO fail%\\n IF fail% ERROR 100, \\\"File download failed \\\" + t$\\n examples% = 0\\n task% = OPENIN(file$)\\n WHILE NOT EOF#task%\\n IF INSTR(GET$#task%, \\\"=={{header|\\\") examples% += 1\\n ENDWHILE\\n CLOSE #task%\\n Total% += examples%\\n PRINT title$ \\\": \\\" ; examples% \\\" examples.\\\"\\n ENDIF\\n UNTIL i% = 0\\n i% = INSTR(a$, \\\"cmcontinue=\\\")\\n IF i% THEN\\n CLOSE #file%\\n j% = INSTR(a$, \\\"\\\"\\\"\\\", i%+1)\\n k% = INSTR(a$, \\\"\\\"\\\"\\\", j%+1)\\n url$ = \\\"http://www.rosettacode.org/w/api.php?action=query\\\" + \\\\\\n \\\\ \\\"&list=categorymembers&cmtitle=Category:Programming_Tasks\\\" + \\\\\\n \\\\ \\\"&cmlimit=500&format=xml&cmcontinue=\\\" + MID$(a$,j%+1,k%-j%)\\n REPEAT\\n i% = INSTR(url$, \\\"|\\\")\\n IF i% url$ = LEFT$(url$,i%-1) + \\\"%7C\\\" + MID$(url$,i%+1)\\n UNTIL i% = 0\\n file$ = @tmp$ + \\\"tasks.xml\\\"\\n SYS UDTF, 0, url$, file$, 0, 0 TO fail%\\n IF fail% ERROR 100, \\\"File download failed (continue)\\\"\\n file% = OPENIN(file$)\\n ENDIF\\n ENDWHILE\\n CLOSE #file%\\n PRINT ' \\\"Total: \\\" ; Total% \\\" examples.\\\"\\n END\\n\\n DEF FNhtml(h$)\\n IF LEFT$(h$,2) = \\\"&#\\\" THEN = CHR$(VALMID$(h$,3))\\n CASE h$ OF\\n WHEN \\\""\\\": = \\\"\\\"\\\"\\\"\\n ENDCASE\\n = h$\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"( ( get-page\\n =\\n . sys$(str$(\\\"wget -q -O wget.out \\\\\\\"\\\" !arg \\\\\\\"))\\n & get$(\\\"wget.out\\\",HT ML)\\n )\\n& get-page$\\\"http://rosettacode.org/wiki/Category:Programming_Tasks\\\"\\n : ? (table.?) ?tasklist (.table.) ?\\n& 0:?list\\n& whl\\n ' ( !tasklist\\n : ?\\n ( a\\n . (href.@(?:\\\"/wiki/\\\" ?href)) (title.?title)\\n & get-page$(str$(\\\"http://rosettacode.org/wiki/\\\" !href))\\n : ?task\\n & 0:?cnt\\n & whl\\n ' ( !task\\n : ?\\n ( (span.(class.mw-headline) (id.?))\\n ?span\\n (.span.)\\n ?task\\n & !span\\n : ?\\n ( a\\n . (href.@(?:\\\"/wiki/Category:\\\" ?))\\n (title.@(?:\\\"Category:\\\" ?))\\n )\\n @\\n (.a.)\\n ?\\n )\\n & 1+!cnt:?cnt\\n )\\n & (!cnt.!title)+!list:?list\\n )\\n ?tasklist\\n )\\n& lst$(list,taskfreq,NEW)\\n)\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\nusing System.Text.RegularExpressions;\\nusing System.Net;\\n\\nclass Task {\\n private string _task;\\n private int _examples;\\n\\n public Task(string task, int examples) {\\n _task = task;\\n _examples = examples;\\n }\\n\\n public string Name {\\n get { return _task; }\\n }\\n\\n public int Examples {\\n get { return _examples; }\\n }\\n\\n public override string ToString() {\\n return String.Format(\\\"{0}: {1} examples.\\\", this._task, this._examples);\\n }\\n}\\n\\nclass Program {\\n static List<string> GetTitlesFromCategory(string category, WebClient wc) {\\n string content = wc.DownloadString(\\n String.Format(\\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:{0}&cmlimit=500&format=json\\\", category)\\n );\\n\\n return new Regex(\\\"\\\\\\\"title\\\\\\\":\\\\\\\"(.+?)\\\\\\\"\\\").Matches(content).Cast<Match>().Select(x => x.Groups[1].Value.Replace(\\\"\\\\\\\\/\\\", \\\"/\\\")).ToList();\\n }\\n\\n static string GetSourceCodeFromPage(string page, WebClient wc) {\\n return wc.DownloadString(\\n String.Format(\\\"http://www.rosettacode.org/w/index.php?title={0}&action=raw\\\", page)\\n );\\n }\\n\\n static void Main(string[] args) {\\n WebClient wc = new WebClient();\\n List<Task> tasks = new List<Task>();\\n List<string> tasknames = GetTitlesFromCategory(\\\"Programming_Tasks\\\", wc);\\n\\n foreach (string task in tasknames) {\\n try {\\n string content = GetSourceCodeFromPage(WebUtility.UrlEncode(task), wc);\\n int count = new Regex(\\\"=={{header\\\", RegexOptions.IgnoreCase).Matches(content).Count;\\n Task t = new Task(task, count);\\n\\n Console.WriteLine(t);\\n tasks.Add(t);\\n }\\n catch (Exception ex) {\\n Console.WriteLine(\\\"**** Unable to get task \\\\\\\"\\\" + task + \\\"\\\\\\\": \\\" + ex.Message);\\n }\\n }\\n\\n Console.WriteLine(\\\"\\\\nTotal: {0} examples.\\\", tasks.Select(x => x.Examples).Sum());\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(ns count-examples\\n (:import [java.net URLEncoder])\\n (:use [clojure.contrib.http.agent :only (http-agent string)]\\n [clojure.contrib.json :only (read-json)]\\n [clojure.contrib.string :only (join)]))\\n\\n(defn url-encode [v] (URLEncoder/encode (str v) \\\"utf-8\\\"))\\n\\n(defn rosettacode-get [path params]\\n (let [param-string (join \\\"&\\\" (for [[n v] params] (str (name n) \\\"=\\\" (url-encode v))))]\\n (string (http-agent (format \\\"http://www.rosettacode.org/w/%s?%s\\\" path param-string)))))\\n\\n(defn rosettacode-query [params]\\n (read-json (rosettacode-get \\\"api.php\\\" (merge {:action \\\"query\\\" :format \\\"json\\\"} params))))\\n\\n(defn list-cm\\n ([params] (list-cm params nil))\\n ([params continue]\\n (let [cm-params (merge {:list \\\"categorymembers\\\"} params (or continue {}))\\n result (rosettacode-query cm-params)]\\n (concat (-> result (:query) (:categorymembers))\\n (if-let [cmcontinue (-> result (:query-continue) (:categorymembers))]\\n (list-cm params cmcontinue))))))\\n\\n(defn programming-tasks []\\n (let [result (list-cm {:cmtitle \\\"Category:Programming_Tasks\\\" :cmlimit 50})]\\n (map #(:title %) result)))\\n\\n(defn task-count [task]\\n [task (count\\n (re-seq #\\\"==\\\\{\\\\{header\\\"\\n (rosettacode-get \\\"index.php\\\" {:action \\\"raw\\\" :title task})))])\\n\\n(defn print-result []\\n (let [task-counts (map task-count (programming-tasks))]\\n (doseq [[task count] task-counts]\\n (println (str task \\\":\\\") count)\\n (flush))\\n (println \\\"Total: \\\" (reduce #(+ %1 (second %2)) 0 task-counts))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"count-examples> (print-result)\\n100 doors: 73\\n24 game: 18\\n24 game/Solve: 14\\n99 Bottles of Beer: 89\\nAbstract type: 27\\nAccumulator factory: 23\\nAckermann function: 73\\nActive Directory/Connect: 4\\nActive Directory/Search for a user: 3\\nActive object: 14\\nAdd a variable to a class instance at runtime: 21\\nAddress of a variable: 20\\n...\\nTotal: 11216\\nnil\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"import tango.io.Stdout;\\nimport tango.net.http.HttpClient;\\nimport tango.net.http.HttpHeaders;\\nimport tango.text.xml.Document;\\nimport tango.text.Util;\\n\\nalias HttpHeader.ContentLength CL;\\n\\nauto url = \\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\";\\nvoid main()\\n{\\n auto client = new HttpClient (HttpClient.Get, url);\\n client.open();\\n char[] mainData, tmp;\\n int total, i;\\n\\n void cat(void[] content) { tmp ~= cast(char[]) content; }\\n\\n if (client.isResponseOK) {\\n client.read(&cat, client.getResponseHeaders.getInt(CL));\\n mainData = tmp;\\n tmp = null;\\n\\n auto doc = new Document!(char);\\n doc.parse(mainData);\\n foreach (n; doc.query.descendant(\\\"cm\\\").attribute(\\\"title\\\")) {\\n auto subClient = new HttpClient(HttpClient.Get,\\n \\\"http://www.rosettacode.org/w/index.php?title=\\\" ~\\n replace(n.value.dup, ' ', '_') ~ \\\"&action=raw\\\");\\n subClient.open();\\n if (! subClient.isResponseOK) {\\n Stderr (client.getResponse);\\n break;\\n }\\n subClient.read(&cat, subClient.getResponseHeaders.getInt(CL));\\n foreach (segment; patterns(cast(char[])tmp, \\\"=={{header|\\\")) i++;\\n --i;\\n if (i) --i;\\n Stdout.formatln (\\\"{0,-40} - {}\\\", n.value, i);\\n total += i;\\n tmp = null;\\n i = 0;\\n }\\n Stdout(\\\"total examples: \\\", total).newline;\\n } else {\\n Stderr (client.getResponse);\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"package com.eglexamples.client;\\n\\nimport org.eclipse.edt.rui.widgets.*;\\n\\nhandler RosettaCodeHandler type RUIhandler{initialUI =[ui], title = \\\"Rosetta Code Tasks and Counts\\\"}\\n\\n ui GridLayout{columns = 3, rows = 4, cellPadding = 4, children = [ b1, dg1, l1, l2, l3, l4 ]};\\n\\n b1 Button{ layoutData = new GridLayoutData{ row = 1, column = 1 }, text = \\\"Go!\\\", onClick ::= b1_onClick };\\n l1 TextLabel{ layoutData = new GridLayoutData{ row = 1, column = 2 }, text = \\\"Total Tasks:\\\" };\\n l2 TextLabel{ layoutData = new GridLayoutData{ row = 1, column = 3 }, text = \\\"0\\\" };\\n\\n l3 TextLabel{ layoutData = new GridLayoutData{ row = 2, column = 2 }, text = \\\"Total Implementations:\\\" };\\n l4 TextLabel{ layoutData = new GridLayoutData{ row = 2, column = 3 }, text = \\\"0\\\" };\\n\\n dg1 DataGrid{ layoutData = new GridLayoutData{ row = 3, column = 1, horizontalSpan = 3 },\\n \\tpageSize = 10, showScrollbar = true,\\n\\tcolumns = [ new DataGridColumn{name = \\\"title\\\", displayName = \\\"Task\\\", width=220},\\n\\t\\t new DataGridColumn{name = \\\"count\\\", displayName = \\\"Count\\\", width=100} ] };\\n\\n cmcontinue string?;\\n title string?;\\n allTasks Task[];\\n\\t\\n restBindingTasks IHttp? = new HttpRest{\\n restType = eglx.rest.ServiceType.TrueRest,\\n \\trequest.uri = \\\"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=1&format=json\\\"};\\n\\n restBindingPageDetail IHttp? = new HttpRest{\\n restType = eglx.rest.ServiceType.TrueRest,\\n \\trequest.uri = \\\"http://rosettacode.org/mw/index.php\\\"};\\n\\t\\n function b1_onClick(event Event in)\\n\\tcall ProxyFunctions.listTasks(\\\"\\\") using restBindingTasks\\n \\t returning to listTasksCallBack onException exceptionHandler;\\n end\\n\\n function listTasksCallBack(retResult RosettaCodeJSON in)\\n\\ttitle = retResult.query.categorymembers[1].title;\\n\\tcmcontinue = retResult.queryContinue.categorymembers.cmcontinue;\\n\\n\\tcall ProxyFunctions.fetchPageDetail(title) using restBindingPageDetail\\n \\t returning to pageDetailCallBack onException exceptionHandler;\\n end\\n\\n function pageDetailCallBack(pageResults string in)\\n \\tcount int = countSubstring(\\\"=={{header\\\", pageResults);\\n \\tallTasks.appendElement(new Task { title = title, count = count });\\n\\tl2.text = l2.text as int + 1;\\n\\tl4.text = l4.text as int + count;\\n \\t\\n \\tif(cmcontinue != null)\\n\\t call ProxyFunctions.listTasks(cmcontinue) using restBindingTasks\\n\\t\\treturning to listTasksCallBack onException exceptionHandler;\\n\\telse\\n\\t dg1.data = allTasks as any[];\\n\\tend\\n end\\n\\n function countSubstring(substr string in, str string in) returns(int)\\n\\tif(str.length() > 0 and substr.length() > 0)\\n\\t return (str.length() - str.replaceStr(subStr, \\\"\\\").length()) / subStr.length();\\n\\telse\\n\\t return 0;\\n\\tend\\n end\\n\\t\\n function exceptionHandler(exp AnyException in)\\n end\\n\\nend\\n\\nrecord Task\\n\\ttitle string;\\n\\tcount int;\\nend\\n\",\n \"language\": \"EGL\"\n },\n {\n \"code\": \"package com.eglexamples.client;\\n\\nlibrary ProxyFunctions\\n\\n function listTasks(continueLocation String in) returns (RosettaCodeJSON) {\\n\\t @Rest{method = _GET, uriTemplate = \\\"&cmcontinue={continueLocation}\\\",\\n\\t requestFormat = None, responseFormat = JSON}\\n }\\n end\\t\\n\\n function fetchPageDetail(title String in) returns (String) {\\n\\t @Rest{method = _GET, uriTemplate = \\\"?title={title}&action=raw\\\",\\n\\t requestFormat = None, responseFormat = None}\\n }\\n end\\t\\n\\nend\\n\\nrecord RosettaCodeJSON\\n query Query;\\n queryContinue QueryContinue{JSONName = \\\"query-continue\\\"};\\nend\\n\\nrecord Query\\n categorymembers Categorymembers[];\\nend\\n\\nrecord Categorymembers\\n cmcontinue string?;\\n pageid int?;\\n ns int?;\\n title string?;\\nend\\n\\nrecord QueryContinue\\n categorymembers Categorymembers;\\nend\\n\",\n \"language\": \"EGL\"\n },\n {\n \"code\": \"-module(rosseta_examples).\\n-include_lib(\\\"xmerl/include/xmerl.hrl\\\").\\n\\n-export([main/0]).\\n\\nmain() ->\\n application:start(inets),\\n Titles = read_titles(empty),\\n Result = lists:foldl(fun(Title,Acc) -> Acc + calculate_one(Title) end, 0, Titles),\\n io:format(\\\"Total: ~p examples.\\\\n\\\",[Result]),\\n application:stop(inets).\\n\\nread_titles(CurrentContinue) ->\\n URL0 = \\\"http://rosettacode.org/mw/api.php?\\\" ++\\n \\\"action=query&list=categorymembers&cmtitle=Category:Programming_Tasks\\\" ++\\n \\\"&cmlimit=500&format=xml\\\",\\n URL =\\n case CurrentContinue of\\n empty -> URL0;\\n _ -> URL0 ++ \\\"&cmcontinue=\\\" ++ CurrentContinue\\n end,\\n {ok,Answer} = httpc:request(URL),\\n {Document,_} = xmerl_scan:string(lists:last(tuple_to_list(Answer))),\\n Continue =\\n [Value || #xmlAttribute{value = Value} <- xmerl_xpath:string(\\\"//@cmcontinue\\\", Document)],\\n Titles =\\n [Value || #xmlAttribute{value = Value} <- xmerl_xpath:string(\\\"//@title\\\", Document)],\\n case Continue of\\n []->\\n Titles;\\n [ContValue | _] ->\\n Titles ++ read_titles(ContValue)\\n end.\\n\\ncalculate_one(Title0) ->\\n Title = replace_chars(Title0),\\n URL = \\\"http://www.rosettacode.org/w/index.php?title=\\\" ++\\n Title ++ \\\"&action=raw\\\",\\n case httpc:request(URL) of\\n {ok,Result} ->\\n {match,Found} =\\n re:run(lists:last(tuple_to_list(Result)), \\\"\\\\n=={{header(|)\\\", [global]),\\n io:format(\\\"~ts: ~p examples.\\\\n\\\",[Title0,length(Found)]),\\n length(Found);\\n {error,socket_closed_remotely} ->\\n io:format(\\\"Socket closed remotely. Retry.\\\\n\\\"),\\n calculate_one(Title0)\\n end.\\n\\nreplace_chars(String) ->\\n replace_chars(String,[]).\\n\\nreplace_chars([$ | T],Acc) ->\\n replace_chars(T, [$_| Acc]);\\nreplace_chars([$+| T],Acc) ->\\n replace_chars(T, lists:reverse(\\\"%2B\\\") ++ Acc);\\nreplace_chars([8211| T],Acc) ->\\n replace_chars(T, lists:reverse(\\\"%E2%80%93\\\") ++ Acc);\\nreplace_chars([Other| T],Acc) ->\\n replace_chars(T, [Other| Acc]);\\nreplace_chars([],Acc) ->\\n lists:reverse(Acc).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"#r \\\"System.Xml.Linq.dll\\\"\\n\\nlet uri1 = \\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\"\\nlet uri2 task = sprintf \\\"http://www.rosettacode.org/w/index.php?title=%s&action=raw\\\" task\\n\\n[|for xml in (System.Xml.Linq.XDocument.Load uri1).Root.Descendants() do\\n for attrib in xml.Attributes() do\\n if attrib.Name.LocalName = \\\"title\\\" then\\n yield async {\\n let uri = uri2 (attrib.Value.Replace(\\\" \\\", \\\"_\\\") |> System.Web.HttpUtility.UrlEncode)\\n use client = new System.Net.WebClient()\\n let! html = client.AsyncDownloadString(System.Uri uri)\\n let sols' = html.Split([|\\\"{{header|\\\"|], System.StringSplitOptions.None).Length - 1\\n lock stdout (fun () -> printfn \\\"%s: %d examples\\\" attrib.Value sols')\\n return sols' }|]\\n|> Async.Parallel\\n|> Async.RunSynchronously\\n|> fun xs -> printfn \\\"Total: %d examples\\\" (Seq.sum xs)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: arrays assocs concurrency.combinators\\nconcurrency.semaphores formatting hashtables http.client io\\njson.reader kernel math math.parser sequences splitting\\nurls.encoding ;\\nIN: rosetta-code.count-examples\\n\\nCONSTANT: list-url \\\"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&cmprop=title&format=json\\\"\\n\\n: titles ( query -- titles )\\n \\\"query\\\" of \\\"categorymembers\\\" of [ \\\"title\\\" of ] map ;\\n: continued-url ( query -- url/f )\\n \\\"query-continue\\\" of \\\"categorymembers\\\" of\\n [ assoc>query list-url swap \\\"&\\\" glue ] [ f ] if* ;\\n\\n: (all-programming-titles) ( titles url -- titles' url' )\\n http-get nip json> [ titles append ] [ continued-url ] bi\\n [ (all-programming-titles) ] [ f ] if* ;\\n: all-programming-titles ( -- titles ) { } list-url (all-programming-titles) drop ;\\n\\nCONSTANT: content-base-url \\\"http://rosettacode.org/mw/index.php?title=&action=raw\\\"\\n: content-url ( title -- url )\\n \\\" \\\" \\\"_\\\" replace\\n \\\"title\\\" associate assoc>query\\n content-base-url swap \\\"&\\\" glue ;\\n\\n: occurences ( seq subseq -- n ) split-subseq length 1 - ;\\n: count-examples ( title -- n )\\n content-url http-get nip \\\"=={{header|\\\" occurences ;\\n\\n: print-task ( title n -- ) \\\"%s: %d examples.\\\\n\\\" printf ;\\n: print-total ( assoc -- ) values sum \\\"Total: %d examples.\\\\n\\\" printf ;\\n: fetch-counts ( titles -- assoc )\\n 10 <semaphore> [\\n [ dup count-examples 2array ] with-semaphore\\n ] curry parallel-map ;\\n\\n: print-counts ( titles -- )\\n [ [ print-task ] assoc-each nl ] [ print-total ] bi ;\\n: rosetta-examples ( -- )\\n all-programming-titles fetch-counts print-counts ;\\n\\nMAIN: rosetta-examples\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bytes\\\"\\n \\\"encoding/xml\\\"\\n \\\"fmt\\\"\\n \\\"io\\\"\\n \\\"io/ioutil\\\"\\n \\\"net/http\\\"\\n \\\"net/url\\\"\\n \\\"strings\\\"\\n)\\n\\nfunc req(u string, foundCm func(string)) string {\\n resp, err := http.Get(u)\\n if err != nil {\\n fmt.Println(err) // connection or request fail\\n return \\\"\\\"\\n }\\n defer resp.Body.Close()\\n for p := xml.NewDecoder(resp.Body); ; {\\n t, err := p.RawToken()\\n switch s, ok := t.(xml.StartElement); {\\n case err == io.EOF:\\n return \\\"\\\"\\n case err != nil:\\n fmt.Println(err)\\n return \\\"\\\"\\n case !ok:\\n continue\\n case s.Name.Local == \\\"cm\\\":\\n for _, a := range s.Attr {\\n if a.Name.Local == \\\"title\\\" {\\n foundCm(a.Value)\\n }\\n }\\n case s.Name.Local == \\\"categorymembers\\\" && len(s.Attr) > 0 &&\\n s.Attr[0].Name.Local == \\\"cmcontinue\\\":\\n return url.QueryEscape(s.Attr[0].Value)\\n }\\n }\\n return \\\"\\\"\\n}\\n\\nfunc main() {\\n taskQuery := \\\"http://rosettacode.org/mw/api.php?action=query\\\" +\\n \\\"&format=xml&list=categorymembers&cmlimit=500\\\" +\\n \\\"&cmtitle=Category:Programming_Tasks\\\"\\n continueAt := req(taskQuery, count)\\n for continueAt > \\\"\\\" {\\n continueAt = req(taskQuery+\\\"&cmcontinue=\\\"+continueAt, count)\\n }\\n fmt.Printf(\\\"Total: %d examples.\\\\n\\\", total)\\n}\\n\\nvar marker = []byte(\\\"=={{header|\\\")\\nvar total int\\n\\nfunc count(cm string) {\\n taskFmt := \\\"http://rosettacode.org/mw/index.php?title=%s&action=raw\\\"\\n taskEsc := url.QueryEscape(strings.Replace(cm, \\\" \\\", \\\"_\\\", -1))\\n resp, err := http.Get(fmt.Sprintf(taskFmt, taskEsc))\\n var page []byte\\n if err == nil {\\n page, err = ioutil.ReadAll(resp.Body)\\n resp.Body.Close()\\n }\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n examples := bytes.Count(page, marker)\\n fmt.Printf(\\\"%s: %d\\\\n\\\", cm, examples)\\n total += examples\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Network.Browser\\nimport Network.HTTP\\nimport Network.URI\\nimport Data.List\\nimport Data.Maybe\\nimport Text.XML.Light\\nimport Control.Arrow\\n\\njustifyR w = foldl ((.return).(++).tail) (replicate w ' ')\\nshowFormatted t n = t ++ \\\": \\\" ++ justifyR 4 (show n)\\n\\ngetRespons url = do\\n rsp <- Network.Browser.browse $ do\\n setAllowRedirects True\\n setOutHandler $ const (return ()) -- quiet\\n request $ getRequest url\\n return $ rspBody $ snd rsp\\n\\ngetNumbOfExampels p = do\\n let pg = intercalate \\\"_\\\" $ words p\\n rsp <- getRespons $ \\\"http://www.rosettacode.org/w/index.php?title=\\\" ++ pg ++ \\\"&action=raw\\\"\\n let taskPage = rsp\\n countEx = length $ filter (==\\\"=={{header|\\\") $ takeWhile(not.null) $ unfoldr (Just. (take 11 &&& drop 1)) taskPage\\n return countEx\\n\\nprogTaskExamples = do\\n rsp <- getRespons \\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\"\\n\\n let xmls = onlyElems $ parseXML $ rsp\\n tasks = concatMap (map (fromJust.findAttr (unqual \\\"title\\\")). filterElementsName (== unqual \\\"cm\\\")) xmls\\n\\n taskxx <- mapM getNumbOfExampels tasks\\n let ns = taskxx\\n tot = sum ns\\n\\n mapM_ putStrLn $ zipWith showFormatted tasks ns\\n putStrLn $ (\\\"Total: \\\" ++) $ show tot\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"*Main> progTaskExamples\\n100 doors: 56\\n24 game: 11\\n24 game Player: 9\\n99 Bottles of Beer: 73\\nAbstract type: 23\\nAckermann Function: 61\\nActive object: 9\\n...\\nTotal: 9156\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"$define RCINDEX \\\"http://rosettacode.org/mw/api.php?format=xml&action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500\\\"\\n$define RCTASK \\\"http://rosettacode.org/mw/index.php?action=raw&title=\\\"\\n$define RCUA \\\"User-Agent: Unicon Rosetta 0.1\\\"\\n$define RCXUA \\\"X-Unicon: http://unicon.org/\\\"\\n$define TASKTOT \\\"* Total Tasks *\\\"\\n$define TOTTOT \\\"* Total Headers*\\\"\\n\\nlink strings\\nlink hexcvt\\n\\nprocedure main(A) # simple single threaded read all at once implementation\\n Tasks := table(0)\\n every task := taskNames() do {\\n Tasks[TASKTOT] +:= 1 # count tasks\\n every lang := languages(task) do { # count languages\\n Tasks[task] +:= 1\\n Tasks[TOTTOT] +:= 1\\n }\\n }\\n every insert(O := set(),key(Tasks)) # extract & sort keys\\n O := put(sort(O--set(TOTTOT,TASKTOT)),TASKTOT,TOTTOT) # move totals to end\\n every write(k := !O, \\\" : \\\", Tasks[k],\\\" examples.\\\") # report\\nend\\n\\n# Generate task names\\nprocedure taskNames()\\n continue := \\\"\\\"\\n while \\\\(txt := ReadURL(RCINDEX||continue)) do {\\n txt ? {\\n while tab(find(\\\"<cm \\\") & find(s :=\\\"title=\\\\\\\"\\\")+*s) do\\n suspend tab(find(\\\"\\\\\\\"\\\"))\\\\1\\n if tab(find(\\\"cmcontinue=\\\")) then {\\n continue := \\\"&\\\"||tab(upto(' \\\\t'))\\n }\\n else break\\n }\\n }\\nend\\n\\n# Generate language headers in a task\\nprocedure languages(task)\\n static WS\\n initial WS := ' \\\\t'\\n page := ReadURL(RCTASK||CleanURI(task))\\n page ? while (tab(find(\\\"\\\\n==\\\")),tab(many(WS))|\\\"\\\",tab(find(\\\"{{\\\"))) do {\\n header := tab(find(\\\"==\\\"))\\n header ? {\\n while tab(find(\\\"{{header|\\\")) do {\\n suspend 2(=\\\"{{header|\\\",tab(find(\\\"}}\\\")))\\\\1\\n }\\n }\\n }\\nend\\n\\nprocedure CleanURI(u) #: clean up a URI\\n static tr,dxml # xml & http translation\\n initial {\\n tr := table()\\n every c := !string(~(&digits++&letters++'-_.!~*()/\\\\'`')) do\\n tr[c] := \\\"%\\\"||hexstring(ord(c),2)\\n every /tr[c := !string(&cset)] := c\\n tr[\\\" \\\"] := \\\"_\\\" # wiki convention\\n every push(dxml := [],\\\"&#\\\"||right(ord(c := !\\\"&<>'\\\\\\\"\\\"),3,\\\"0\\\")||\\\";\\\",c)\\n }\\n\\n dxml[1] := u # insert URI as 1st arg\\n u := replacem!dxml # de-xml it\\n every (c := \\\"\\\") ||:= tr[!u] # reencode everything\\n c := replace(c,\\\"%3E\\\",\\\"'\\\") # Hack to put single quotes back in\\n c := replace(c,\\\"%26quot%3B\\\",\\\"\\\\\\\"\\\") # Hack to put double quotes back in\\n return c\\nend\\n\\nprocedure ReadURL(url) #: read URL into string\\n page := open(url,\\\"m\\\",RCUA,RCXUA) | stop(\\\"Unable to open \\\",url)\\n text := \\\"\\\"\\n if page[\\\"Status-Code\\\"] < 300 then while text ||:= reads(page,-1)\\n else write(&errout,image(url),\\\": \\\",\\n page[\\\"Status-Code\\\"],\\\" \\\",page[\\\"Reason-Phrase\\\"])\\n close(page)\\n return text\\nend\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"require 'web/gethttp'\\n\\ngetAllTaskSolnCounts=: monad define\\n tasks=. getCategoryMembers 'Programming_Tasks'\\n counts=. getTaskSolnCounts &> tasks\\n tasks;counts\\n)\\n\\ngetTaskSolnCounts=: monad define\\n makeuri=. 'http://www.rosettacode.org/w/index.php?title=' , ,&'&action=raw'\\n wikidata=. gethttp makeuri urlencode y\\n ([: +/ '{{header|'&E.) wikidata\\n)\\n\\nformatSolnCounts=: monad define\\n 'tasks counts'=. y\\n tasks=. tasks , &.>':'\\n res=. ;:^:_1 tasks ,. (8!:0 counts) ,. <'examples.'\\n res , 'Total examples: ' , \\\": +/counts\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" formatSolnCounts getAllTaskSolnCounts ''\\n100 doors: 61 examples.\\n24 game: 15 examples.\\n24 game Player: 11 examples.\\n99 Bottles of Beer: 76 examples.\\n...\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport ScreenScrape;\\n\\npublic class CountProgramExamples {\\n private static final String baseURL = \\\"http://rosettacode.org/wiki/\\\";\\n private static final String rootURL = \\\"http://www.rosettacode.org/w/\\\"\\n + \\\"api.php?action=query&list=categorymembers\\\"\\n + \\\"&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\";\\n private static final String taskBegin = \\\"title=\\\\\\\"\\\";\\n private static final String taskEnd = \\\"\\\\\\\"\\\";\\n private static final String exmplBegin = \\\"<span class=\\\\\\\"tocnumber\\\\\\\">\\\";\\n private static final String exmplEnd = \\\"</span>\\\";\\n private static final String editBegin = \\\"<span class=\\\\\\\"editsection\\\\\\\">\\\";\\n\\n /**\\n * @param args\\n */\\n public static void main(String[] args) {\\n int exTotal = 0;\\n try {\\n // Get root query results\\n ArrayList<String> tasks = new ArrayList<String>();\\n ScreenScrape ss = new ScreenScrape();\\n String rootPage = ss.read(rootURL);\\n while (rootPage.contains(taskBegin)) {\\n rootPage = rootPage.substring(rootPage.indexOf(taskBegin)\\n + taskBegin.length());\\n String title = rootPage.substring(0, rootPage.indexOf(taskEnd));\\n if (!title.contains(\\\"Category:\\\")) {\\n tasks.add(title);\\n }\\n rootPage = rootPage.substring(rootPage.indexOf(taskEnd));\\n }\\n // Loop through each task and print count\\n for (String task : tasks) {\\n String title = task.replaceAll(\\\"'\\\", \\\"'\\\");\\n String taskPage = ss.read(baseURL + title.replaceAll(\\\" \\\", \\\"_\\\"));\\n int exSubTot;\\n if (taskPage.contains(exmplBegin)) {\\n int startPos = taskPage.lastIndexOf(exmplBegin)\\n + exmplBegin.length();\\n String countStr = taskPage.substring(startPos,\\n taskPage.indexOf(exmplEnd, startPos));\\n exSubTot = Integer\\n .parseInt(countStr.contains(\\\".\\\") ? countStr\\n .substring(0, countStr.indexOf(\\\".\\\"))\\n : countStr);\\n } else {\\n exSubTot = 0;\\n while (taskPage.contains(editBegin)) {\\n taskPage = taskPage.substring(taskPage\\n .indexOf(editBegin) + editBegin.length());\\n exSubTot++;\\n }\\n }\\n exTotal += exSubTot;\\n System.out.println(title + \\\": \\\" + exSubTot + \\\" examples.\\\");\\n }\\n // Print total\\n System.out.println(\\\"\\\\nTotal: \\\" + exTotal + \\\" examples.\\\");\\n } catch (Exception e) {\\n System.out.println(title);\\n System.out.println(startPos + \\\":\\\"\\n + taskPage.indexOf(exmplEnd, startPos));\\n System.out.println(taskPage);\\n e.printStackTrace(System.out);\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"#!/bin/bash\\n\\n# Produce lines of the form: URI TITLE\\nfunction titles {\\n local uri=\\\"http://www.rosettacode.org/mw/api.php?action=query&list=categorymembers\\\"\\n uri+=\\\"&cmtitle=Category:Programming_Tasks&cmlimit=5000&format=json\\\"\\n curl -Ss \\\"$uri\\\" |\\n jq -r '.query.categorymembers[] | .title | \\\"\\\\(@uri) \\\\(.)\\\"'\\n}\\n\\n# Syntax: count URI\\nfunction count {\\n local uri=\\\"$1\\\"\\n curl -Ss \\\"http://rosettacode.org/mw/index.php?title=${uri}&action=raw\\\" |\\n jq -R -n 'reduce (inputs|select(test(\\\"=={{header\\\\\\\\|\\\"))) as $x(0; .+1)'\\n}\\n\\nlocal n=0 i\\nwhile read uri title\\ndo\\n i=$(count \\\"$uri\\\")\\n echo \\\"$title: $i examples.\\\"\\n n=$((n + i))\\ndone < <(titles)\\necho Total: $n examples.\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using HTTP, JSON, Dates\\n\\nrosorg = \\\"http://rosettacode.org\\\"\\nqURI = \\\"/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=json\\\"\\nqdURI = \\\"/w/api.php?action=query&list=categorymembers&cmtitle=Category:Draft_Programming_Tasks&cmlimit=500&format=json\\\"\\nsqURI = rosorg * \\\"/wiki/\\\"\\ntopages(js, v) = for d in js[\\\"query\\\"][\\\"categorymembers\\\"] push!(v, sqURI * replace(d[\\\"title\\\"], \\\" \\\" => \\\"_\\\")) end\\n\\nfunction getpages(uri)\\n wikipages = Vector{String}()\\n response = HTTP.request(\\\"GET\\\", rosorg * uri)\\n if response.status == 200\\n fromjson = JSON.parse(String(response.body))\\n topages(fromjson, wikipages)\\n while haskey(fromjson, \\\"continue\\\")\\n cmcont, cont = fromjson[\\\"continue\\\"][\\\"cmcontinue\\\"], fromjson[\\\"continue\\\"][\\\"continue\\\"]\\n response = HTTP.request(\\\"GET\\\", rosorg * uri * \\\"&cmcontinue=$cmcont&continue=$cont\\\")\\n fromjson = JSON.parse(String(response.body))\\n topages(fromjson, wikipages)\\n end\\n end\\n wikipages\\nend\\n\\nfunction processtaskpages(wpages, verbose=false)\\n totalexamples = 0\\n for pag in wpages\\n response = HTTP.request(\\\"GET\\\", pag)\\n if response.status == 200\\n n = length(collect(eachmatch(r\\\"span class=\\\\\\\"mw-headline\\\\\\\"\\\", String(response.body))))\\n if verbose\\n println(\\\"Wiki page $pag => $n examples.\\\")\\n end\\n totalexamples += n\\n end\\n end\\n println(\\\"Total of $totalexamples on $(length(wpages)) task pages.\\\\n\\\")\\nend\\n\\n\\nprintln(\\\"Programming examples at $(DateTime(now())):\\\")\\nqURI |> getpages |> processtaskpages\\n\\nprintln(\\\"Draft programming tasks:\\\")\\nqdURI |> getpages |> processtaskpages\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"local(root = json_deserialize(curl('http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=10&format=json')->result))\\nlocal(tasks = array, title = string, urltitle = string, thiscount = 0, totalex = 0)\\nwith i in #root->find('query')->find('categorymembers') do => {^\\n\\t#thiscount = 0\\n\\t#title = #i->find('title')\\n\\t#urltitle = #i->find('title')\\n\\t#urltitle->replace(' ','_')\\n\\t\\n\\t#title+': '\\n\\tlocal(src = curl('http://rosettacode.org/mw/index.php?title='+#urltitle->asBytes->encodeurl+'&action=raw')->result->asString)\\n\\t#thiscount = (#src->split('=={{header|'))->size - 1\\n\\t#thiscount < 0 ? #thiscount = 0\\n\\t#thiscount + ' examples.'\\n\\t#totalex += #thiscount\\n\\t'\\\\r'\\n^}\\n'Total: '+#totalex+' examples.'\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"on mouseUp\\n put empty into fld \\\"taskurls\\\"\\n put URL \\\"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=10&format=xml\\\" into apixml\\n put revXMLCreateTree(apixml,true,true,false) into pDocID\\n put \\\"/api/query/categorymembers/cm\\\" into pXPathExpression\\n repeat for each line xmlnode in revXMLEvaluateXPath(pDocID, pXPathExpression)\\n put revXMLAttribute(pDocID,xmlnode,\\\"title\\\") into pgTitle\\n put revXMLAttribute(pDocID,xmlnode,\\\"pageid\\\") into pageId\\n put \\\"http://www.rosettacode.org/w/index.php?title=\\\" & urlEncode(pgTitle) & \\\"&action=raw\\\" into taskURL\\n put URL taskURL into taskPage\\n filter lines of taskPage with \\\"=={{header|*\\\"\\n put the number of lines of taskPage into taskTotal\\n put pgTitle & comma & taskTotal & cr after fld \\\"tasks\\\"\\n add taskTotal to allTaskTotal\\n end repeat\\n put \\\"Total\\\" & comma & allTaskTotal after fld \\\"tasks\\\"\\nend mouseUp\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"ConvertUTF8 := proc( str )\\n local i, tempstring, uniindex;\\n try\\n tempstring := str;\\n uniindex := [StringTools:-SearchAll(\\\"\\\\u\\\",str)];\\n if uniindex <> [] then\\n for i in uniindex do\\n tempstring := StringTools:-Substitute(tempstring, str[i..i+5], UTF8:-unicode(str[i+2..i+5]));\\n end do:\\n end if;\\n return tempstring;\\n catch:\\n return str;\\n end try;\\n end proc:\\nprint_examples := proc(lst)\\n\\tlocal task, count, url, headers, item;\\n\\tfor task in lst do\\n\\t\\tcount := 0:\\n\\t\\turl := cat(\\\"http://www.rosettacode.org/mw/index.php?title=\\\", StringTools:-Encode(StringTools:-SubstituteAll(task[\\\"title\\\"], \\\" \\\", \\\"_\\\"), 'percent'), \\\"&action=raw\\\"):\\n\\t\\theaders := [StringTools:-SearchAll(\\\"=={{header|\\\",URL:-Get(url))]:\\n\\t\\tfor item in headers do\\n\\t\\t\\tcount++:\\n\\t\\tend do:\\n\\t\\tprintf(\\\"%s has %d examples\\\\n\\\",ConvertUTF8(task[\\\"title\\\"]), count);\\n\\tend do:\\nend proc:\\n\\n\\nx := JSON:-ParseFile(\\\"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=20&format=json\\\"):\\nprint_examples(x[\\\"query\\\"][\\\"categorymembers\\\"]);\\nwhile(assigned(x[\\\"continue\\\"][\\\"cmcontinue\\\"])) do\\n\\tcontinue := x[\\\"continue\\\"][\\\"cmcontinue\\\"]:\\n\\tmore_tasks:= cat(\\\"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=20&format=json\\\", \\\"&continue=\\\", x[\\\"continue\\\"][\\\"continue\\\"], \\\"&cmcontinue=\\\", x[\\\"continue\\\"][\\\"cmcontinue\\\"]):\\n\\tx := JSON:-ParseFile(more_tasks):\\n\\tprint_examples(x[\\\"query\\\"][\\\"categorymembers\\\"]);\\nend do:\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"TaskList = Flatten[\\n Import[\\\"http://rosettacode.org/wiki/Category:Programming_Tasks\\\", \\\"Data\\\"][[1, 1]]];\\nPrint[\\\"Task \\\\\\\"\\\", StringReplace[#, \\\"_\\\" -> \\\" \\\"], \\\"\\\\\\\" has \\\",\\n Length@Select[Import[\\\"http://rosettacode.org/wiki/\\\" <> #, \\\"Data\\\"][[1,2]],\\n StringFreeQ[#, __ ~~ \\\"Programming Task\\\" | __ ~~ \\\"Omit\\\"]& ], \\\" example(s)\\\"]&\\n ~Map~ StringReplace[TaskList, \\\" \\\" -> \\\"_\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \" function c = count_examples(url)\\n c = 0;\\n [s, success] = urlread (url);\\n if ~success, return; end;\\n c = length(strfind(s,'<h2><span class='));\\n end;\\n\\n % script\\n s = urlread ('http://rosettacode.org/wiki/Category:Programming_Tasks');\\n pat = '<li><a href=\\\"/wiki/';\\n ix = strfind(s,pat)+length(pat)-6;\\n for k = 1:length(ix);\\n % look through all tasks\\n e = find(s(ix(k):end)==34,1)-2;\\n t = s(ix(k)+[0:e]); % task\\n c = count_examples(['http://rosettacode.org',t]);\\n printf('Task \\\"%s\\\" has %i examples.\\\\n',t(7:end), c); \\t\\n end;\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"import httpclient, strutils, xmltree, xmlparser, cgi\\n\\nproc count(s, sub: string): int =\\n var i = 0\\n while true:\\n i = s.find(sub, i)\\n if i < 0: break\\n inc i\\n inc result\\n\\nconst\\n mainSite = \\\"http://www.rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\"\\n subSite = \\\"http://www.rosettacode.org/mw/index.php?title=$#&action=raw\\\"\\n\\nvar client = newHttpClient()\\nvar sum = 0\\nfor node in client.getContent(mainSite).parseXml().findAll(\\\"cm\\\"):\\n let t = node.attr(\\\"title\\\").replace(\\\" \\\", \\\"_\\\")\\n let c = client.getContent(subSite % encodeUrl(t)).toLower().count(\\\"{{header|\\\")\\n echo t.replace(\\\"_\\\", \\\" \\\"), \\\": \\\", c, \\\" examples.\\\"\\n inc sum, c\\n\\necho \\\"\\\\nTotal: \\\", sum, \\\" examples.\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use HTTP;\\nuse XML;\\n\\nclass RosettaCount {\\n function : Main(args : String[]) ~ Nil {\\n taks_xml := HttpGet(\\\"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\");\\n parser := XmlParser->New(taks_xml);\\n if(parser->Parse()) {\\n task_names := parser->FindElements(\\\"/api/query/categorymembers/cm\\\");\\n if(task_names <> Nil) {\\n each(i : task_names) {\\n task_name := task_names->Get(i)->As(XmlElement)->GetAttribute(\\\"title\\\")->GetValue();\\n task_url := \\\"http://rosettacode.org/mw/index.php?title=\\\";\\n task_url->Append(task_name);\\n task_url->Append(\\\"&action=raw\\\");\\n\\n task := HttpGet(task_url);\\n counts := task->FindAll(\\\"=={{header|\\\");\\n if(counts->Size() > 0) {\\n IO.Console->Print(UrlUtility->Decode(task_name))->Print(\\\": \\\")->PrintLine(counts->Size());\\n };\\n };\\n };\\n };\\n }\\n\\n function : HttpGet(url : String) ~ String {\\n xml := \\\"\\\";\\n\\n client := HttpClient->New();\\n lines := client->Get(url);\\n each(i : lines) {\\n xml->Append(lines->Get(i)->As(String));\\n };\\n\\n return xml;\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"open Http_client.Convenience\\n\\n\\nlet repl_quote s =\\n let reg = Str.regexp_string \\\"'\\\" in\\n (Str.global_replace reg \\\"%27\\\" s)\\n\\nlet repl_space s =\\n let s = String.copy s in\\n for i = 0 to pred(String.length s) do\\n if s.[i] = ' ' then s.[i] <- '_'\\n done;\\n (s)\\n(* or in OCaml 4.00+:\\n let repl_space = String.map (fun c -> if c = ' ' then '_' else c)\\n*)\\n\\nlet count_ex s =\\n let pat = Str.regexp_string \\\"=={{header|\\\" in\\n let rec aux n p =\\n try\\n let p = Str.search_forward pat s p in\\n aux (n+1) (p+1)\\n with Not_found -> (n)\\n in\\n aux 0 0\\n\\nlet get_child child xml =\\n let child =\\n List.find\\n (function Xml.Element (tag,_,_) when tag = child -> true | _ -> false) xml\\n in\\n Xml.children child\\n\\nlet () =\\n let url = \\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&\\\\\\n cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\" in\\n\\n let xml = Xml.parse_string (http_get url) in\\n\\n let total = ref 0 in\\n at_exit (fun () -> Printf.printf \\\"\\\\n Total: %d\\\\n\\\" !total);\\n\\n let f = function\\n | Xml.Element (\\\"cm\\\", attrs, _) ->\\n (try\\n let _title = List.assoc \\\"title\\\" attrs in\\n let title = repl_quote (repl_space _title) in\\n let url = \\\"http://www.rosettacode.org/w/index.php?title=\\\"^ title ^\\\"&action=raw\\\" in\\n let n = count_ex (http_get url) in\\n Printf.printf \\\"%s: %d\\\\n%!\\\" _title n;\\n total := n + !total;\\n with Http_client.Http_error (404, _) -> ())\\n | _ -> ()\\n in\\n\\n match xml with\\n | Xml.Element (\\\"api\\\", _, ch) ->\\n let query = get_child \\\"query\\\" ch in\\n let catmb = get_child \\\"categorymembers\\\" query in\\n List.iter f catmb\\n | _ -> ()\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"declare\\n [HTTPClient] = {Module.link ['x-ozlib://mesaros/net/HTTPClient.ozf']}\\n [XMLParser] = {Module.link ['x-oz://system/xml/Parser.ozf']}\\n [StringX] = {Module.link ['x-oz://system/String.ozf']}\\n [Regex] = {Module.link ['x-oz://contrib/regex']}\\n\\n AllTasksUrl = \\\"http://rosettacode.org/mw/api.php?action=query&list=\\\"#\\n \\\"categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\"\\n\\n proc {Main}\\n AllTasks = {Parse {GetPage AllTasksUrl}}\\n TaskTitles = {GetTitles AllTasks}\\n Total = {NewCell 0}\\n in\\n for Task in TaskTitles do\\n TaskPage = {GetPage {TaskUrl Task}}\\n RE = {Regex.compile \\\"{{header\\\\\\\\|\\\" [extended newline icase]}\\n NumMatches = {Length {Regex.allMatches RE TaskPage}}\\n in\\n {System.showInfo Task#\\\": \\\"#NumMatches#\\\" examples.\\\"}\\n Total := @Total + NumMatches\\n end\\n {System.showInfo \\\"Total: \\\"#@Total#\\\" examples.\\\"}\\n end\\n\\n fun {TaskUrl Task}\\n \\\"http://rosettacode.org/mw/index.php?\\\"#\\n \\\"title=\\\"#{PercentEncode {StringX.replace Task \\\" \\\" \\\"_\\\"}}#\\n \\\"&action=raw\\\"\\n end\\n\\n %% GetPage\\n local\\n Client = {New HTTPClient.urlGET init(inPrms(toFile:false toStrm:true) _)}\\n in\\n fun {GetPage RawUrl}\\n Url = {VirtualString.toString RawUrl}\\n OutParams\\n HttpResponseParams\\n in\\n {Client getService(Url ?OutParams ?HttpResponseParams)}\\n OutParams.sOut\\n end\\n end\\n\\n %% Parse\\n local\\n Parser = {New XMLParser.parser init}\\n in\\n fun {Parse Xs} {Parser parseVS(Xs $)} end\\n end\\n\\n fun {GetTitles Doc}\\n CMs = Doc.2.1.children.1.children.1.children\\n fun {Attributes element(attributes:As ...)} As end\\n fun {IsTitle attribute(name:N ...)} N == title end\\n in\\n {Map {Filter {Flatten {Map CMs Attributes}} IsTitle}\\n fun {$ A} {Atom.toString A.value} end}\\n end\\n\\n fun {PercentEncode Xs}\\n case Xs of nil then nil\\n [] X|Xr then\\n if {Char.isDigit X} orelse {Member X [&- &_ &. &~]}\\n orelse X >= &a andthen X =< &z\\n orelse X >= &z andthen X =< &Z then\\n X|{PercentEncode Xr}\\n else\\n {Append &%|{ToHex2 X} {PercentEncode Xr}}\\n end\\n end\\n end\\n\\n fun {ToHex2 X}\\n [{ToHex1 X div 16} {ToHex1 X mod 16}]\\n end\\n\\n fun {ToHex1 X}\\n if X >= 0 andthen X =< 9 then &0 + X\\n elseif X >= 10 andthen X =< 15 then &A + X - 10\\n end\\n end\\nin\\n {Main}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"use HTTP::Tiny;\\n\\nmy $site = \\\"http://rosettacode.org\\\";\\nmy $list_url = \\\"/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\";\\n\\nmy $response = HTTP::Tiny->new->get(\\\"$site$list_url\\\");\\nfor ($response->{content} =~ /cm.*?title=\\\"(.*?)\\\"/g) {\\n (my $slug = $_) =~ tr/ /_/;\\n my $response = HTTP::Tiny->new->get(\\\"$site/wiki/$slug\\\");\\n my $count = () = $response->{content} =~ /toclevel-1/g;\\n print \\\"$_: $count examples\\\\n\\\";\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use Mojo::UserAgent;\\n\\nmy $site = \\\"http://rosettacode.org\\\";\\nmy $list_url = \\\"/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\";\\n\\nmy $ua = Mojo::UserAgent->new;\\n$ua->get(\\\"$site$list_url\\\")->res->dom->find('cm')->each(sub {\\n (my $slug = $_->{title}) =~ tr/ /_/;\\n my $count = $ua->get(\\\"$site/wiki/$slug\\\")->res->dom->find(\\\"#toc .toclevel-1\\\")->size;\\n say \\\"$_->{title}: $count examples\\\";\\n});\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\rosettacode_cache.e\\n -- ================================\\n --\\n -- Common routines for handling rc_cache etc.\\n --</span>\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (libcurl, file i/o, peek, progress..)</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">builtins</span><span style=\\\"color: #0000FF;\\\">\\\\</span><span style=\\\"color: #004080;\\\">timedate</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">day</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">timedelta</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">days</span><span style=\\\"color: #0000FF;\\\">:=</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">refresh_cache</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">21</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">day</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 0 for always [NB refresh_cache += timedelta(days:=1) below]</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">days</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">delta</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">ceil</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">delta</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">day</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%d day%s\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">\\\"s\\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">hex</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ascii</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">columnize</span><span style=\\\"color: #0000FF;\\\">({{</span><span style=\\\"color: #008000;\\\">\\\"%22\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`\\\"`</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"%27\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"'\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"%2A\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"*\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"%2B\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"+\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"%3A\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\":\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"%5E\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`^`</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"%E2%80%93\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"-\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"%E2%80%99\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"'\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"%C3%A8\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"e\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"%C3%A9\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"e\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"%C3%B6\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"o\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"%C5%91\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"o\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\""\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`\\\"`</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"'\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"'\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"_\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">}})</span>\\n\\n <span style=\\\"color: #008080;\\\">global</span> <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">html_clean</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">substitute_all</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">hex</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ascii</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">builtins</span><span style=\\\"color: #0000FF;\\\">\\\\</span><span style=\\\"color: #000000;\\\">libcurl</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">curl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pErrorBuffer</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">write_callback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">pData</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">nmemb</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">bytes_written</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">size</span> <span style=\\\"color: #0000FF;\\\">*</span> <span style=\\\"color: #000000;\\\">nmemb</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">peek</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">pData</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">bytes_written</span><span style=\\\"color: #0000FF;\\\">}))</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">bytes_written</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">write_cb</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">call_back</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #008000;\\\">'+'</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">write_callback</span><span style=\\\"color: #0000FF;\\\">})</span>\\n\\n <span style=\\\"color: #008080;\\\">global</span> <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">wastitle</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- don't clobber \\\"NEED EDITING\\\"/Downloading messages</span>\\n <span style=\\\"color: #008080;\\\">global</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">show_title</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">progress</span>\\n\\n <span style=\\\"color: #008080;\\\">global</span> <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">open_download</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">url</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">text</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">refetch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">why</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"not found\\\"</span>\\n <span style=\\\"color: #000000;\\\">filename</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">join_path</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #008000;\\\">\\\"rc_cache\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">file_exists</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- use existing file if <= refresh_cache days old</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">last_mod</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">get_file_date</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">delta</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">timedate_diff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">last_mod</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">date</span><span style=\\\"color: #0000FF;\\\">())</span>\\n <span style=\\\"color: #000000;\\\">refetch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">delta</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">refresh_cache</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">match</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\".hist\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">why</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">days</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">delta</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">&</span> <span style=\\\"color: #008000;\\\">\\\" > \\\"</span> <span style=\\\"color: #0000FF;\\\">&</span> <span style=\\\"color: #000000;\\\">days</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">refresh_cache</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #7060A8;\\\">get_file_size</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">why</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"filesize of 0\\\"</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">text</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">trim</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">get_text</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #004080;\\\">sequence</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">why</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"no text\\\"</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">)<</span><span style=\\\"color: #000000;\\\">10</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">why</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"<10 bytes\\\"</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">refetch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">refetch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">directory</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">get_file_path</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">get_file_type</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">directory</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #004600;\\\">FILETYPE_DIRECTORY</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">create_directory</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">directory</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">make_parent</span><span style=\\\"color: #0000FF;\\\">:=</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"cannot create %s directory\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">directory</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">refetch</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">wastitle</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"x\\\"</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- don't clobber</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">nofn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"(%d/%d, %.1f%%) \\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">100</span><span style=\\\"color: #0000FF;\\\">}):</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">title</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Downloading %s%s (%s)...\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">nofn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">html_clean</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">why</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">show_title</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">title</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">NULL</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">curl_global_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">curl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">curl_easy_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">pErrorBuffer</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">allocate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">CURL_ERROR_SIZE</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">curl_easy_setopt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">CURLOPT_ERRORBUFFER</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pErrorBuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">curl_easy_setopt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">CURLOPT_WRITEFUNCTION</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">write_cb</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">url</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">url</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%3A\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\":\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">url</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">url</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%2A\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"*\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">curl_easy_setopt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">CURLOPT_URL</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">url</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">fn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">open</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"wb\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">!=-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"cannot open \\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">curl_easy_setopt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">CURLOPT_WRITEDATA</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">CURLcode</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">curl_easy_perform</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">CURLE_OK</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">error</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">CURLE_COULDNT_RESOLVE_HOST</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">error</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #008000;\\\">\\\" [CURLE_COULDNT_RESOLVE_HOST]\\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Error %s downloading file, retry?(Y/N):\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">error</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">lower</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">wait_key</span><span style=\\\"color: #0000FF;\\\">())!=</span><span style=\\\"color: #008000;\\\">'y'</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #7060A8;\\\">abort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Y\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #7060A8;\\\">close</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">refresh_cache</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #7060A8;\\\">timedelta</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">days</span><span style=\\\"color: #0000FF;\\\">:=</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- did I mention it is slow?</span>\\n <span style=\\\"color: #000000;\\\">text</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">get_text</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">text</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">global</span> <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">open_category</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">open_download</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\".htm\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"http://rosettacode.org/wiki/Category:\\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">filename</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">global</span> <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">dewiki</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">exclude</span><span style=\\\"color: #0000FF;\\\">={})</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- extract tasks from eg `<li><a href=\\\"/wiki/100_doors\\\"`</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">tasks</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">start</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">finish</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">match</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">`<div class=\\\"printfooter\\\">`</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">finish</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">start</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">match</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">`<li><a href=\\\"/wiki/`</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">start</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">`<li><a href=\\\"/wiki/`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">finish</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">'\\\"'</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">task</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">finish</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">task</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute_all</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">task</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"*\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\":\\\"</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #008000;\\\">\\\"%2A\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%3A\\\"</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">tasks</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tasks</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">task</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">start</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">finish</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">tasks</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">global</span> <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">curl_cleanup</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #004600;\\\">NULL</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">curl_easy_cleanup</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">free</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pErrorBuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">curl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">NULL</span>\\n <span style=\\\"color: #000000;\\\">pErrorBuffer</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">NULL</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\Count_examples.exw\\n -- ===============================\\n --\\n -- (This uses a few '&' instead of/as well as 'a', fairly obviously for everyone's sanity..)\\n -- Counts no of \\\"<nowiki>{{</nowiki>he&der|\\\" (nb not \\\"==<nowiki>{{</nowiki>he&der|\\\") via web api (but gets tasks via scraping).\\n -- Since downloading all the pages can be very slow, this uses a cache.\\n -- Limiting (notdone) by \\\"Phix\\\" fairly obviously speeds it up tenfold :-)\\n --</span>\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (fairly obviously this will never ever run in a browser!)</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">include_drafts</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">sort_by_count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- notlang = \\\"Phix\\\" -- or \\\"\\\" (ie a zero length string) for all</span>\\n <span style=\\\"color: #000000;\\\">notlang</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span>\\n\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">rosettacode_cache</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">count_tasks</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">get_file_type</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"rc_cache\\\"</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #004600;\\\">FILETYPE_DIRECTORY</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">create_directory</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"rc_cache\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"cannot create rc_cache directory\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- note this lot use web scraping (as cribbed from a similar task) ...</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">tasks</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">dewiki</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">open_category</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Programming_Tasks\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">include_drafts</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">tasks</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">dewiki</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">open_category</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Draft_Programming_Tasks\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">tasks</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tasks</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">notlang</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- filter already done in specified language</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">langurl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"http://rosettacode.org/wiki/Category:\\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">notlang</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">done</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">dewiki</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">open_download</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">notlang</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\".htm\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">langurl</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tasks</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">ti</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">tasks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ti</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">done</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">tasks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ti</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">done</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">tasks</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">tasks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">done</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%d tasks found\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tasks</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- ... whereas the individual tasks use the web api instead (3x smaller/faster)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">total_count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">task_counts</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tasks</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tasks</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">ti</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">tasks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">url</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"http://rosettacode.org/mw/index.php?title=%s&action=raw\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">ti</span><span style=\\\"color: #0000FF;\\\">}),</span>\\n <span style=\\\"color: #000000;\\\">contents</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">open_download</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ti</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\".raw\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">url</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">prev</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">curr</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">start</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">start</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">match</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">`<nowiki>{{</nowiki>hea`</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">`der|`</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">contents</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- skip duplicates/we also have to cope with eg\\n -- ==<nowiki>{{</nowiki>he&der|Python<nowiki>}}</nowiki>== \\\\\\n -- ===<nowiki>{{</nowiki>he&der|Python<nowiki>}}</nowiki> Original=== } count\\n -- ===<nowiki>{{</nowiki>he&der|Python<nowiki>}}</nowiki> Succinct=== } once\\n -- ===<nowiki>{{</nowiki>he&der|Python<nowiki>}}</nowiki> Recursive === /\\n -- ==<nowiki>{{</nowiki>he&der|Mathematica<nowiki>}}</nowiki> / <nowiki>{{</nowiki>he&der|Wolfram Language<nowiki>}}</nowiki>== \\\\\\n -- ==<nowiki>{{</nowiki>he&der|Icon<nowiki>}}</nowiki> and <nowiki>{{</nowiki>he&der|Unicon<nowiki>}}</nowiki>== } count\\n -- == <nowiki>{{</nowiki>he&der|Icon<nowiki>}}</nowiki> and <nowiki>{{</nowiki>he&der|Unicon<nowiki>}}</nowiki> == / both\\n -- == <nowiki>{{</nowiki>he&der|Java<nowiki>}}</nowiki>==\\n -- etc. Note however that this /does/ count eg\\n -- ===<nowiki>{{</nowiki>he&der|Applesoft BASIC<nowiki>}}</nowiki>=== \\\\\\n -- ===<nowiki>{{</nowiki>he&der|BASIC256<nowiki>}}</nowiki>=== } count\\n -- ===<nowiki>{{</nowiki>he&der|Commodore BASIC<nowiki>}}</nowiki>=== } 'em\\n -- ===<nowiki>{{</nowiki>he&der|IS-BASIC<nowiki>}}</nowiki>=== } all\\n -- ===<nowiki>{{</nowiki>he&der|Sinclair ZX81 BASIC<nowiki>}}</nowiki>=== /\\n --</span>\\n <span style=\\\"color: #000000;\\\">curr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">contents</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #7060A8;\\\">match</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">`<nowiki>}}</nowiki>`</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">contents</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">start</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">curr</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">prev</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">prev</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">curr</span>\\n <span style=\\\"color: #000000;\\\">start</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">`<nowiki>{{</nowiki>hea`</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">`der|`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">sort_by_count</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">task_counts</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">count</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">notlang</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tasks</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">mod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">200</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%s: %d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">html_clean</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ti</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">total_count</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">count</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">get_key</span><span style=\\\"color: #0000FF;\\\">()=</span><span style=\\\"color: #000000;\\\">#1B</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"escape keyed\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">curl_cleanup</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">sort_by_count</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">tags</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">custom_sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">task_counts</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tasks</span><span style=\\\"color: #0000FF;\\\">)))</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tags</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">ti</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">tags</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%s: %d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">html_clean</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tasks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">ti</span><span style=\\\"color: #0000FF;\\\">]),</span><span style=\\\"color: #000000;\\\">task_counts</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">ti</span><span style=\\\"color: #0000FF;\\\">]})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">total_count</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Total: %d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">count_tasks</span><span style=\\\"color: #0000FF;\\\">()})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(load \\\"@lib/http.l\\\")\\n\\n(client \\\"rosettacode.org\\\" 80\\n \\\"mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\"\\n (while (from \\\" title=\\\\\\\"\\\")\\n (let Task (till \\\"\\\\\\\"\\\")\\n (client \\\"rosettacode.org\\\" 80 (pack \\\"wiki/\\\" (replace Task \\\" \\\" \\\"_\\\"))\\n (let Cnt 0\\n (while (from \\\"<span class=\\\\\\\"tocnumber\\\\\\\">\\\")\\n (unless (sub? \\\".\\\" (till \\\"<\\\" T))\\n (inc 'Cnt) ) )\\n (out NIL (prinl (ht:Pack Task) \\\": \\\" Cnt)) ) ) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"Procedure handleError(value, msg.s)\\n If value = 0\\n MessageRequester(\\\"Error\\\", msg)\\n End\\n EndIf\\nEndProcedure\\n\\nhandleError(InitNetwork(), \\\"Unable to initialize network functions.\\\")\\nIf OpenConsole()\\n Define url$, x1$, y1$, title$, unescapedTitle$, encodedURL$\\n Define x2, i, j, totalExamples, totalTasks\\n url$ = \\\"http://www.rosettacode.org/mw/api.php?action=query\\\" +\\n \\\"&list=categorymembers&cmtitle=Category:Programming_Tasks\\\" +\\n \\\"&cmlimit=500&format=xml\\\"\\n\\n Repeat\\n handleError(ReceiveHTTPFile(url$, \\\"tasks.xml\\\"), \\\"Unable to access tasks URL.\\\")\\n\\n handleError(ReadFile(0, \\\"tasks.xml\\\"), \\\"Unable to read 'task.xml' file.\\\")\\n x1$ = ReadString(0)\\n CloseFile(0)\\n\\n Repeat\\n x2 = FindString(x1$, \\\"title=\\\", x2 + 1)\\n If x2\\n title$ = Mid(x1$, x2 + 7, 99)\\n title$ = Left(title$, FindString(title$, \\\">\\\", 1) - 4)\\n unescapedTitle$ = UnescapeString(ReplaceString(title$, \\\"'\\\", \\\"'\\\"), #PB_String_EscapeXML)\\n encodedURL$ = URLEncoder(\\\"http://www.rosettacode.org/mw/index.php?title=\\\" + unescapedTitle$ + \\\"&action=raw\\\")\\n If ReceiveHTTPFile(encodedURL$, \\\"task.xml\\\")\\n ReadFile(0, \\\"task.xml\\\")\\n While Not Eof(0)\\n y1$ = ReadString(0)\\n If FindString(y1$, \\\"=={{header|\\\", 1, #PB_String_NoCase)\\n totalExamples + 1\\n EndIf\\n Wend\\n CloseFile(0)\\n\\n PrintN(unescapedTitle$ +\\\": \\\" + Str(totalExamples) + \\\" examples\\\")\\n\\n totalTasks + totalExamples\\n totalExamples = 0\\n EndIf\\n EndIf\\n Until x2 = 0\\n\\n ;check for additional pages of tasks\\n x2 = FindString(x1$, \\\"cmcontinue=\\\")\\n If x2\\n i = FindString(x1$, #DQUOTE$, x2 + 1)\\n j = FindString(x1$, #DQUOTE$, i + 1)\\n url$ = URLEncoder(\\\"http://www.rosettacode.org/mw/api.php?action=query\\\" +\\n \\\"&list=categorymembers&cmtitle=Category:Programming_Tasks\\\" +\\n \\\"&cmlimit=500&format=xml&cmcontinue=\\\" + Mid(x1$, i + 1, j - i))\\n Else\\n Break ;all done\\n EndIf\\n ForEver\\n\\n PrintN(\\\"Total: \\\" + Str(totalTasks) + \\\" examples\\\")\\n Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"from urllib.request import urlopen, Request\\nimport xml.dom.minidom\\n\\nr = Request(\\n 'https://www.rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml',\\n headers={'User-Agent': 'Mozilla/5.0'})\\nx = urlopen(r)\\n\\ntasks = []\\nfor i in xml.dom.minidom.parseString(x.read()).getElementsByTagName('cm'):\\n t = i.getAttribute('title').replace(' ', '_')\\n r = Request(f'https://www.rosettacode.org/mw/index.php?title={t}&action=raw',\\n headers={'User-Agent': 'Mozilla/5.0'})\\n y = urlopen(r)\\n tasks.append( y.read().lower().count(b'{{header|') )\\n print(t.replace('_', ' ') + f': {tasks[-1]} examples.')\\n\\nprint(f'\\\\nTotal: {sum(tasks)} examples.')\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"\\\"\\\"\\\"Count Rosetta Code tasks implementations using the Semantic MediaWiki API.\\nWorks with Python >= 3.7.\\\"\\\"\\\"\\nimport json\\nimport logging\\n\\nfrom dataclasses import dataclass\\nfrom dataclasses import field\\n\\nfrom datetime import datetime\\n\\nfrom typing import Any\\nfrom typing import Dict\\nfrom typing import List\\nfrom typing import Optional\\nfrom typing import Set\\nfrom typing import Tuple\\n\\nimport requests\\nfrom requests.adapters import HTTPAdapter\\nfrom requests.adapters import Retry\\n\\nlogging.basicConfig(level=logging.WARN)\\n\\n# See https://www.semantic-mediawiki.org/wiki/Help:API:ask\\n_SM_ASK: Dict[str, str] = {\\n \\\"action\\\": \\\"ask\\\",\\n \\\"format\\\": \\\"json\\\",\\n \\\"formatversion\\\": \\\"2\\\",\\n \\\"api_version\\\": \\\"3\\\",\\n}\\n\\n_SM_ASK_REQUEST_BLOCK_SIZE = 500\\n\\n\\n@dataclass(frozen=True)\\nclass Page:\\n # fulltext is the page's title, not the page content.\\n fulltext: str\\n fullurl: str\\n namespace: int\\n exists: str\\n displaytitle: str\\n\\n\\n@dataclass(frozen=True, eq=False)\\nclass Lang(Page):\\n def __eq__(self, other: object) -> bool:\\n if isinstance(other, Lang):\\n return self.fullurl == other.fullurl\\n elif isinstance(other, str):\\n return self.fullurl == other\\n return False\\n\\n def __hash__(self) -> int:\\n return hash(self.fullurl)\\n\\n def unimplemented(self, tasks: Set[\\\"Task\\\"]) -> Set[\\\"Task\\\"]:\\n return {task for task in tasks if self.fullurl not in task.exclude}\\n\\n def omitted_from(self, tasks: Set[\\\"Task\\\"]) -> Set[\\\"Task\\\"]:\\n return {task for task in tasks if self.fullurl in task.omitted_from}\\n\\n\\n@dataclass(frozen=True)\\nclass Task(Page):\\n title: str\\n implemented_in: Set[Lang] = field(repr=False, compare=False)\\n omitted_from: Set[Lang] = field(repr=False, compare=False)\\n exclude: Set[Lang] = field(repr=False, compare=False)\\n\\n def not_implemented_in(self, langs: Set[Lang]) -> Set[Lang]:\\n return langs.difference(self.exclude)\\n\\n\\n@dataclass\\nclass TaskResponseBlock:\\n tasks: List[Task]\\n continue_offset: Optional[int] = None\\n\\n\\n@dataclass\\nclass LanguageResponseBlock:\\n langs: List[Lang]\\n continue_offset: Optional[int] = None\\n\\n\\ndef sm_ask_category(\\n session: requests.Session,\\n url: str,\\n category: str,\\n limit: int,\\n offset: int,\\n known_langs: Set[Lang],\\n) -> TaskResponseBlock:\\n query_params = {\\n **_SM_ASK,\\n \\\"query\\\": (\\n f\\\"[[Category:{category}]]\\\"\\n \\\"|?Implemented in language\\\"\\n \\\"|?Omitted from language\\\"\\n f\\\"|limit={limit}\\\"\\n f\\\"|offset={offset}\\\"\\n ),\\n }\\n\\n # Display some progress\\n log(f\\\"ask [[Category:{category}]] offset={offset}\\\")\\n\\n response = session.get(url, params=query_params)\\n response.raise_for_status()\\n data = response.json()\\n handle_warnings_and_errors(data)\\n return _transform_implemented_in_response_data(data, known_langs)\\n\\n\\ndef sm_ask_tasks(\\n session: requests.Session,\\n url: str,\\n limit: int,\\n offset: int,\\n known_langs: Set[Lang],\\n):\\n return sm_ask_category(\\n session, url, \\\"Programming Tasks\\\", limit, offset, known_langs\\n )\\n\\n\\ndef sm_ask_drafts(\\n session: requests.Session,\\n url: str,\\n limit: int,\\n offset: int,\\n known_langs: Set[Lang],\\n):\\n return sm_ask_category(\\n session, url, \\\"Draft Programming Tasks\\\", limit, offset, known_langs\\n )\\n\\n\\ndef sm_ask_languages(\\n session: requests.Session,\\n url: str,\\n limit: int,\\n offset: int,\\n) -> LanguageResponseBlock:\\n query_params = {\\n **_SM_ASK,\\n \\\"query\\\": (\\n \\\"[[Is language::+]]\\\"\\n \\\"|?Implemented in language\\\"\\n \\\"|?Omitted from language\\\"\\n f\\\"|limit={limit}\\\"\\n f\\\"|offset={offset}\\\"\\n ),\\n }\\n\\n # Display some progress\\n log(f\\\"ask [[Is language::+]] offset={offset}\\\")\\n\\n response = session.get(url, params=query_params)\\n response.raise_for_status()\\n data = response.json()\\n handle_warnings_and_errors(data)\\n return _transform_language_response_data(data)\\n\\n\\ndef sm_ask_all_tasks(\\n session: requests.Session, url: str, known_langs: Set[Lang]\\n) -> List[Task]:\\n block = sm_ask_tasks(\\n session,\\n url,\\n limit=_SM_ASK_REQUEST_BLOCK_SIZE,\\n offset=0,\\n known_langs=known_langs,\\n )\\n tasks = block.tasks\\n\\n while block.continue_offset:\\n block = sm_ask_tasks(\\n session,\\n url,\\n limit=_SM_ASK_REQUEST_BLOCK_SIZE,\\n offset=block.continue_offset,\\n known_langs=known_langs,\\n )\\n tasks.extend(block.tasks)\\n\\n return tasks\\n\\n\\ndef sm_ask_all_drafts(\\n session: requests.Session, url: str, known_langs: Set[Lang]\\n) -> List[Task]:\\n block = sm_ask_drafts(\\n session,\\n url,\\n limit=_SM_ASK_REQUEST_BLOCK_SIZE,\\n offset=0,\\n known_langs=known_langs,\\n )\\n tasks = block.tasks\\n\\n while block.continue_offset:\\n block = sm_ask_drafts(\\n session,\\n url,\\n limit=_SM_ASK_REQUEST_BLOCK_SIZE,\\n offset=block.continue_offset,\\n known_langs=known_langs,\\n )\\n tasks.extend(block.tasks)\\n\\n return tasks\\n\\n\\ndef sm_ask_all_languages(session: requests.Session, url: str) -> List[Lang]:\\n block = sm_ask_languages(\\n session,\\n url,\\n limit=_SM_ASK_REQUEST_BLOCK_SIZE,\\n offset=0,\\n )\\n langs = block.langs\\n\\n while block.continue_offset:\\n block = sm_ask_languages(\\n session,\\n url,\\n limit=_SM_ASK_REQUEST_BLOCK_SIZE,\\n offset=block.continue_offset,\\n )\\n langs.extend(block.langs)\\n\\n return langs\\n\\n\\ndef _transform_implemented_in_response_data(\\n data: Any, known_langs: Set[Lang]\\n) -> TaskResponseBlock:\\n tasks: List[Task] = []\\n for result in data[\\\"query\\\"][\\\"results\\\"]:\\n for task_title, task_page in result.items():\\n # We're excluding implementations that don't have a corresponding\\n # category page with an \\\"Is Language\\\" property.\\n implemented_in = {\\n Lang(**lang)\\n for lang in task_page[\\\"printouts\\\"][\\\"Implemented in language\\\"]\\n }.intersection(known_langs)\\n\\n omitted_from = (\\n {\\n Lang(**lang)\\n for lang in task_page[\\\"printouts\\\"][\\\"Omitted from language\\\"]\\n }\\n .intersection(known_langs)\\n .difference(implemented_in)\\n )\\n\\n tasks.append(\\n Task(\\n title=task_title,\\n implemented_in=implemented_in,\\n omitted_from=omitted_from,\\n fulltext=task_page[\\\"fulltext\\\"],\\n fullurl=task_page[\\\"fullurl\\\"],\\n namespace=task_page[\\\"namespace\\\"],\\n exists=task_page[\\\"exists\\\"],\\n displaytitle=task_page[\\\"displaytitle\\\"],\\n exclude=implemented_in.union(omitted_from),\\n )\\n )\\n\\n return TaskResponseBlock(\\n tasks=tasks, continue_offset=data.get(\\\"query-continue-offset\\\", None)\\n )\\n\\n\\ndef _transform_language_response_data(data: Any) -> LanguageResponseBlock:\\n langs: List[Lang] = []\\n for result in data[\\\"query\\\"][\\\"results\\\"]:\\n for _, task_page in result.items():\\n langs.append(\\n Lang(\\n fulltext=task_page[\\\"fulltext\\\"],\\n fullurl=task_page[\\\"fullurl\\\"],\\n namespace=task_page[\\\"namespace\\\"],\\n exists=task_page[\\\"exists\\\"],\\n displaytitle=task_page[\\\"displaytitle\\\"],\\n )\\n )\\n\\n return LanguageResponseBlock(\\n langs=langs, continue_offset=data.get(\\\"query-continue-offset\\\", None)\\n )\\n\\n\\ndef get_session() -> requests.Session:\\n \\\"\\\"\\\"Setup a requests.Session with retries.\\\"\\\"\\\"\\n retry_strategy = Retry(\\n total=5,\\n status_forcelist=[429, 500, 502, 503, 504],\\n allowed_methods=[\\\"HEAD\\\", \\\"GET\\\", \\\"OPTIONS\\\"],\\n )\\n adapter = HTTPAdapter(max_retries=retry_strategy)\\n session = requests.Session()\\n session.mount(\\\"https://\\\", adapter)\\n session.mount(\\\"http://\\\", adapter)\\n return session\\n\\n\\ndef log(msg: str) -> None:\\n print(f\\\"{datetime.now().isoformat(' ', 'seconds')}: {msg}\\\")\\n\\n\\ndef handle_warnings_and_errors(data: Any) -> None:\\n if data.get(\\\"errors\\\"):\\n for error in data[\\\"errors\\\"]:\\n logging.error(json.dumps(error))\\n # legacy format\\n if data.get(\\\"error\\\"):\\n logging.error(json.dumps(data[\\\"error\\\"]))\\n if data.get(\\\"warnings\\\"):\\n for warning in data[\\\"warnings\\\"]:\\n logging.warning(json.dumps(warning))\\n\\n\\ndef count_examples(url: str, n: int = 30) -> None:\\n \\\"\\\"\\\"Print a table to stdout containing implementation counts for the first\\n `n` tasks, sorted by number implementations (most to least).\\\"\\\"\\\"\\n session = get_session()\\n langs = set(sm_ask_all_languages(session, url))\\n tasks = sm_ask_all_tasks(session, url, langs)\\n drafts = sm_ask_all_drafts(session, url, langs)\\n all_tasks = [*tasks, *drafts]\\n\\n # Map of task to (implemented in, not implemented in, omitted from)\\n counts: Dict[Task, Tuple[int, int, int]] = {}\\n\\n # Running total of examples for all tasks. Where a language has multiple examples\\n # for a single tasks, we only count one example.\\n total: int = 0\\n\\n for task in all_tasks:\\n total += len(task.implemented_in)\\n counts[task] = (\\n len(task.implemented_in),\\n len(task.not_implemented_in(langs)),\\n len(task.omitted_from),\\n )\\n\\n # Pretty print\\n top = sorted(counts.items(), key=lambda it: it[1][0], reverse=True)[:n]\\n pad = max([len(task.fulltext) for task, _ in top])\\n\\n print(\\\"\\\\nKnown languages:\\\", len(langs))\\n print(\\\"Total tasks:\\\", len(all_tasks))\\n print(\\\"Total examples:\\\", total)\\n print(f\\\"{'Task':>{pad}} | Implemented In | Not Implemented In | Omitted From\\\")\\n print(\\\"-\\\" * (pad + 1), \\\"+\\\", \\\"-\\\" * 16, \\\"+\\\", \\\"-\\\" * 20, \\\"+\\\", \\\"-\\\" * 13, sep=\\\"\\\")\\n\\n for task, _counts in top:\\n implemented_in, not_implemented_in, omitted_from = _counts\\n print(\\n f\\\"{task.fulltext:>{pad}} |\\\"\\n f\\\"{implemented_in:>15} |\\\"\\n f\\\"{not_implemented_in:>19} |\\\"\\n f\\\"{omitted_from:>13}\\\"\\n )\\n\\n\\nif __name__ == \\\"__main__\\\":\\n import argparse\\n\\n URL = \\\"https://rosettacode.org/w/api.php\\\"\\n parser = argparse.ArgumentParser(description=\\\"Count tasks on Rosetta Code.\\\")\\n\\n parser.add_argument(\\n \\\"--rows\\\",\\n \\\"-n\\\",\\n type=int,\\n default=30,\\n dest=\\\"n\\\",\\n help=\\\"number of rows to display in the output table (default: 30)\\\",\\n )\\n\\n parser.add_argument(\\n \\\"--url\\\",\\n default=URL,\\n help=f\\\"target MediaWiki URL (default: {URL})\\\",\\n )\\n\\n args = parser.parse_args()\\n count_examples(args.url, args.n)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"library(XML)\\nlibrary(RCurl)\\ndoc <- xmlInternalTreeParse(\\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\")\\nnodes <- getNodeSet(doc,\\\"//cm\\\")\\ntitles = as.character( sapply(nodes, xmlGetAttr, \\\"title\\\") )\\nheaders <- list()\\ncounts <- list()\\nfor (i in 1:length(titles)){\\n\\theaders[[i]] <- getURL( paste(\\\"http://rosettacode.org/mw/index.php?title=\\\", gsub(\\\" \\\", \\\"_\\\", titles[i]), \\\"&action=raw\\\", sep=\\\"\\\") )\\n\\tcounts[[i]] <- strsplit(headers[[i]],split=\\\" \\\")[[1]]\\n\\tcounts[[i]] <- grep(\\\"\\\\\\\\{\\\\\\\\{header\\\", counts[[i]])\\n\\tcat(titles[i], \\\":\\\", length(counts[[i]]), \\\"examples\\\\n\\\")\\n}\\ncat(\\\"Total: \\\", length(unlist(counts)), \\\"examples\\\\n\\\")\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require net/url net/uri-codec json (only-in racket/dict [dict-ref ref]))\\n\\n(define (RC-get verb params)\\n ((compose1 get-pure-port string->url format)\\n \\\"http://rosettacode.org/mw/~a.php?~a\\\" verb (alist->form-urlencoded params)))\\n\\n(define (get-category catname)\\n (let loop ([c #f])\\n (define t\\n ((compose1 read-json RC-get) 'api\\n `([action . \\\"query\\\"] [format . \\\"json\\\"]\\n [list . \\\"categorymembers\\\"] [cmtitle . ,(format \\\"Category:~a\\\" catname)]\\n [cmcontinue . ,(and c (ref c 'cmcontinue))] [cmlimit . \\\"500\\\"])))\\n (define (c-m key) (ref (ref t key '()) 'categorymembers #f))\\n (append (for/list ([page (c-m 'query)]) (ref page 'title))\\n (cond [(c-m 'query-continue) => loop] [else '()]))))\\n\\n(printf \\\"Total: ~a\\\\n\\\"\\n (for/sum ([task (get-category 'Programming_Tasks)])\\n (define s ((compose1 length regexp-match-positions*)\\n #rx\\\"=={{\\\" (RC-get 'index `([action . \\\"raw\\\"] [title . ,task]))))\\n (printf \\\"~a: ~a\\\\n\\\" task s)\\n s))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use HTTP::UserAgent;\\nuse URI::Escape;\\nuse JSON::Fast;\\nuse Lingua::EN::Numbers :short;\\n\\nunit sub MAIN ( Bool :nf(:$no-fetch) = False, :t(:$tier) = 1 );\\n\\n# Friendlier descriptions for task categories\\nmy %cat = (\\n 'Programming_Tasks' => 'Task',\\n 'Draft_Programming_Tasks' => 'Draft'\\n);\\n\\nmy $client = HTTP::UserAgent.new;\\n$client.timeout = 10;\\n\\nmy $url = 'https://rosettacode.org/w';\\n\\nmy $hashfile = './RC_Task_count.json';\\nmy $tablefile = \\\"./RC_Task_count-{$tier}.txt\\\";\\n\\nmy %tasks;\\n\\nmy @places = <① ② ③ ④ ⑤ ⑥ ⑦ ⑧ ⑨ ⑩ ⑪ ⑫ ⑬ ⑭ ⑮ ⑯ ⑰ ⑱ ⑲ ⑳ ㉑ ㉒ ㉓ ㉔ ㉕\\n ㉖ ㉗ ㉘ ㉙ ㉚ ㉛ ㉜ ㉝ ㉞ ㉟ ㊱ ㊲ ㊳ ㊴ ㊵ ㊶ ㊷ ㊸ ㊹ ㊺ ㊺ ㊻ ㊼ ㊽ ㊾ ㊿>;\\n\\n# clear screen\\nrun($*DISTRO.is-win ?? 'cls' !! 'clear') unless $no-fetch;\\n\\nmy %counts =\\n mediawiki-query(\\n $url, 'pages',\\n :generator<categorymembers>,\\n :gcmtitle<Category:Programming Languages>,\\n :gcmlimit<350>,\\n :rawcontinue(),\\n :prop<categoryinfo>\\n )\\n .map({ .<title>.subst(/^'Category:'/, '') => .<categoryinfo><pages> || 0 });\\n\\nmy $per-tier = 10;\\n\\nmy $which = (^$per-tier) »+» $per-tier * ($tier - 1);\\n\\nmy @top-n = %counts.sort( {-.value, .key} )[|$which].map: *.key.trans(' ' => '_');\\n\\n# dump a copy to STDOUT, mostly for debugging purposes\\nsay \\\"<pre>{tc $tier.&ord-n} {$per-tier.&card} programming languages by number of task examples completed:\\\";\\nsay ' ', join ' ', .map( {(\\\"{(@places[|$which])[$_]} {@top-n[$_]}\\\").fmt(\\\"%-15s\\\")} ) for (^@top-n).batch(5);\\nsay \\\"</pre>\\\\n\\\";\\n\\nunless $no-fetch {\\n\\n note 'Retrieving task information...';\\n\\n mkdir('./pages') unless './pages'.IO.e;\\n\\n @top-n = %counts.sort( {-.value, .key} )[^@places].map: *.key.trans(' ' => '_');;\\n\\n for %cat.keys.sort -> $cat {\\n mediawiki-query(\\n $url, 'pages',\\n :generator<categorymembers>,\\n :gcmtitle(\\\"Category:$cat\\\"),\\n :gcmlimit<350>,\\n :rawcontinue(),\\n :prop<title>\\n ).map({\\n my $page;\\n my $response;\\n\\n loop {\\n $response = $client.get(\\\"{ $url }/index.php?title={ uri-escape .<title> }&action=raw\\\");\\n if $response.is-success {\\n $page = $response.content;\\n last;\\n } else {\\n redo;\\n }\\n }\\n\\n \\\"./pages/{ uri-escape .<title>.subst(/' '/, '_', :g) }\\\".IO.spurt($page);\\n my $lc = $page.lc.trans(' ' => '_');\\n my $count = +$lc.comb(/ ^^'==' <-[\\\\n=]>* '{{header|' <-[}]>+? '}}==' \\\\h* $$ /);\\n %tasks{.<title>} = {'cat' => %cat{$cat}, :$count};\\n %tasks{.<title>}<top-n> = (^@top-n).map( {\\n ($lc.contains(\\\"==\\\\{\\\\{header|{@top-n[$_].lc}}}\\\") or\\n # Deal with 3 part headers - {{header|F_Sharp|F#}}, {{header|C_Sharp|C#}}, etc.\\n $lc.contains(\\\"==\\\\{\\\\{header|{@top-n[$_].lc}|\\\") or\\n # Icon and Unicon are their own special flowers\\n $lc.contains(\\\"}}_and_\\\\{\\\\{header|{@top-n[$_].lc}}}==\\\") or\\n # Language1 / Language2 for shared entries (e.g. C / C++)\\n $lc.contains(rx/'}}''_'*'/''_'*'{{header|'$(@top-n[$_].lc)'}}=='/)) ??\\n (@places[$_]) !!\\n # Check if the task was omitted\\n $lc.contains(\\\"\\\\{\\\\{omit_from|{@top-n[$_].lc}\\\") ?? 'O' !!\\n # The task is neither done or omitted\\n ' '\\n } ).join;\\n print clear, 1 + $++, ' ', %cat{$cat}, ' ', .<title>;\\n })\\n }\\n\\n print clear;\\n\\n note \\\"\\\\nTask information saved to local file: {$hashfile.IO.absolute}\\\";\\n $hashfile.IO.spurt(%tasks.&to-json);\\n\\n}\\n\\n# Load information from local file\\n%tasks = $hashfile.IO.e ?? $hashfile.IO.slurp.&from-json !! ( );\\n\\n@top-n = %counts.sort( {-.value, .key} )[|$which].map: *.key.trans(' ' => '_');\\n\\n# Convert saved task info to a table\\nnote \\\"\\\\nBuilding table...\\\";\\nmy $count = +%tasks;\\nmy $taskcnt = +%tasks.grep: *.value.<cat> eq %cat<Programming_Tasks>;\\nmy $draftcnt = $count - $taskcnt;\\nmy $total = sum %tasks{*}»<count>;\\n\\n# Dump table to a file\\nmy $out = open($tablefile, :w) or die \\\"$!\\\\n\\\";\\n\\n$out.say: \\\"<pre>{tc $tier.&ord-n} {$per-tier.&card} programming languages by number of task examples completed:\\\";\\n$out.say: ' ', join ' ', .map( {(\\\"{(@places[|$which])[$_]} {@top-n[$_]}\\\").fmt(\\\"%-15s\\\")} ) for (^@top-n).batch(5);\\n$out.say: \\\"</pre>\\\\n\\\\n<div style=\\\\\\\"height:40em;overflow:scroll;\\\\\\\">\\\";\\n\\n# Add table boilerplate and caption\\n$out.say:\\n '{|class=\\\"wikitable sortable\\\"', \\\"\\\\n\\\",\\n \\\"|+ As of { DateTime.new(time) } :: Tasks: { $taskcnt } ::<span style=\\\\\\\"background-color:#ffd\\\\\\\"> Draft Tasks:\\\",\\n \\\"{ $draftcnt } </span>:: Total Tasks: { $count } :: Total Examples: { $total }\\\\n\\\",\\n \\\"!Count!!Task!!{(@places[|$which]).join('!!')}\\\"\\n;\\n\\n# Sort tasks by count then add row\\nfor %tasks.sort: { [-.value<count>, .key] } -> $task {\\n $out.say:\\n ( $task.value<cat> eq 'Draft'\\n ?? \\\"|- style=\\\\\\\"background-color: #ffc\\\\\\\"\\\\n\\\"\\n !! \\\"|-\\\\n\\\"\\n ),\\n \\\"| { $task.value<count> }\\\\n\\\",\\n ( $task.key ~~ /\\\\d/\\n ?? \\\"|data-sort-value=\\\\\\\"{ $task.key.&naturally }\\\\\\\"| [[{uri-escape $task.key}|{$task.key}]]\\\\n\\\"\\n !! \\\"| [[{uri-escape $task.key}|{$task.key}]]\\\\n\\\"\\n ),\\n \\\"|{ $task.value<top-n>.comb[|$which].join('||') }\\\"\\n}\\n\\n$out.say( \\\"|}\\\\n</div>\\\" );\\n$out.close;\\n\\nnote \\\"Table file saved as: {$tablefile.IO.absolute}\\\";\\n\\nsub mediawiki-query ($site, $type, *%query) {\\n my $url = \\\"$site/api.php?\\\" ~ uri-query-string(\\n :action<query>, :format<json>, :formatversion<2>, |%query);\\n my $continue = '';\\n\\n gather loop {\\n my $response = $client.get(\\\"$url&$continue\\\");\\n my $data = from-json($response.content);\\n take $_ for $data.<query>.{$type}.values;\\n $continue = uri-query-string |($data.<query-continue>{*}».hash.hash or last);\\n }\\n}\\n\\nsub uri-query-string (*%fields) { %fields.map({ \\\"{.key}={uri-escape .value}\\\" }).join(\\\"&\\\") }\\n\\nsub naturally ($a) { $a.lc.subst(/(\\\\d+)/, ->$/ {0~(65+$0.chars).chr~$0},:g) }\\n\\nsub clear { \\\"\\\\r\\\" ~ ' ' x 116 ~ \\\"\\\\r\\\" }\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"# Project: Rosetta Code/Count examples\\n\\nload \\\"stdlib.ring\\\"\\nros= download(\\\"http://rosettacode.org/wiki/Category:Programming_Tasks\\\")\\npos = 1\\nnum = 0\\ntotalros = 0\\nrosname = \\\"\\\"\\nrostitle = \\\"\\\"\\nfor n = 1 to len(ros)\\n nr = searchstring(ros,'<li><a href=\\\"/wiki/',pos)\\n if nr = 0\\n exit\\n else\\n pos = nr + 1\\n ok\\n nr = searchname(nr)\\n nr = searchtitle(nr)\\nnext\\nsee nl\\nsee \\\"Total: \\\" + totalros + \\\" examples.\\\" + nl\\n\\nfunc searchstring(str,substr,n)\\n newstr=right(str,len(str)-n+1)\\n nr = substr(newstr, substr)\\n if nr = 0\\n return 0\\n else\\n return n + nr -1\\n ok\\n\\nfunc searchname(sn)\\n nr2 = searchstring(ros,'\\\">',sn)\\n nr3 = searchstring(ros,\\\"</a></li>\\\",sn)\\n rosname = substr(ros,nr2+2,nr3-nr2-2)\\n return sn\\n\\nfunc searchtitle(sn)\\n st = searchstring(ros,\\\"title=\\\",sn)\\n rostitle = substr(ros,sn+19,st-sn-21)\\n rostitle = \\\"rosettacode.org/wiki/\\\" + rostitle\\n rostitle = download(rostitle)\\n sum = count(rostitle,\\\"Edit section:\\\")\\n num = num + 1\\n see \\\"\\\" + num + \\\". \\\" + rosname + \\\": \\\" + sum + \\\" examples.\\\" + nl\\n totalros = totalros + sum\\n return sn\\n\\nfunc count(cstring,dstring)\\n sum = 0\\n while substr(cstring,dstring) > 0\\n sum = sum + 1\\n cstring = substr(cstring,substr(cstring,dstring)+len(string(sum)))\\n end\\n return sum\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'open-uri'\\nrequire 'rexml/document'\\n\\nmodule RosettaCode\\n\\n URL_ROOT = \\\"http://rosettacode.org/mw\\\"\\n\\n def self.get_url(page, query)\\n begin\\n # Ruby 1.9.2\\n pstr = URI.encode_www_form_component(page)\\n qstr = URI.encode_www_form(query)\\n rescue NoMethodError\\n require 'cgi'\\n pstr = CGI.escape(page)\\n qstr = query.map {|k,v|\\n \\\"%s=%s\\\" % [CGI.escape(k.to_s), CGI.escape(v.to_s)]}.join(\\\"&\\\")\\n end\\n url = \\\"#{URL_ROOT}/#{pstr}?#{qstr}\\\"\\n p url if $DEBUG\\n url\\n end\\n\\n def self.get_api_url(query)\\n get_url \\\"api.php\\\", query\\n end\\n\\n def self.category_members(category)\\n query = {\\n \\\"action\\\" => \\\"query\\\",\\n \\\"list\\\" => \\\"categorymembers\\\",\\n \\\"cmtitle\\\" => \\\"Category:#{category}\\\",\\n \\\"format\\\" => \\\"xml\\\",\\n \\\"cmlimit\\\" => 500,\\n }\\n while true\\n url = get_api_url query\\n doc = REXML::Document.new open(url)\\n\\n REXML::XPath.each(doc, \\\"//cm\\\") do |task|\\n yield task.attribute(\\\"title\\\").value\\n end\\n\\n continue = REXML::XPath.first(doc, \\\"//query-continue\\\")\\n break if continue.nil?\\n cm = REXML::XPath.first(continue, \\\"categorymembers\\\")\\n query[\\\"cmcontinue\\\"] = cm.attribute(\\\"cmcontinue\\\").value\\n end\\n end\\n\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"require 'rosettacode'\\n\\ntotal_examples = 0\\n\\nRosettaCode.category_members(\\\"Programming_Tasks\\\") do |task|\\n url = RosettaCode.get_url(\\\"index.php\\\", {\\\"action\\\" => \\\"raw\\\", \\\"title\\\" => task})\\n examples = open(url).read.scan(\\\"=={{header\\\").length\\n puts \\\"#{task}: #{examples}\\\"\\n total_examples += examples\\nend\\n\\nputs\\nputs \\\"Total: #{total_examples}\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"html \\\"<table border=1><tr bgcolor=wheat align=center><td>Num</td><td>Task</td><td>Examples</td></tr>\\\"\\n\\na$\\t= httpGet$(\\\"http://rosettacode.org/wiki/Category:Programming_Tasks\\\")\\na$\\t= word$(a$,1,\\\"</table></div>\\\")\\ni\\t= instr(a$,\\\"<a href=\\\"\\\"/wiki/\\\")\\ni\\t= instr(a$,\\\"<a href=\\\"\\\"/wiki/\\\",i+1)\\nwhile i > 0\\n count\\t= count + 1\\n i\\t= instr(a$,\\\"<a href=\\\"\\\"/wiki/\\\",i+1)\\n j\\t= instr(a$,\\\">\\\",i+5)\\n a1$\\t= mid$(a$,i+15,j-i)\\n taskId$ = word$(a1$,1,\\\"\\\"\\\"\\\")\\n task$ = word$(a1$,3,\\\"\\\"\\\"\\\")\\n url$\\t= \\\"http://rosettacode.org/wiki/\\\";taskId$\\n a2$\\t= httpGet$(url$)\\n ii\\t= instr(a2$,\\\"<span class=\\\"\\\"tocnumber\\\"\\\">\\\")\\n jj\\t= 0\\n while ii > 0\\n jj\\t= ii\\n ii\\t= instr(a2$,\\\"<span class=\\\"\\\"tocnumber\\\"\\\">\\\",ii+10)\\n wend\\n if jj = 0 then\\n examp = 0\\n else\\n kk\\t= instr(a2$,\\\"<\\\",jj+24)\\n examp = int(val(mid$(a2$,jj+24,kk-jj-24)))\\n end if\\n html \\\"<tr><td align=right>\\\";count;\\\"</td><td>\\\";task$;\\\"</td><td align=right>\\\";examp;\\\"</td></tr>\\\"\\n totExamp = totExamp + examp\\nwend\\nhtml \\\"<tr bgcolor=wheat><td>**</td><td>** Total **</td><td align=right>\\\";totExamp;\\\"</td></tr></table>\\\"\\nend\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"extern crate reqwest;\\nextern crate url;\\nextern crate rustc_serialize;\\n\\nuse std::io::Read;\\nuse self::url::Url;\\nuse rustc_serialize::json::{self, Json};\\n\\npub struct Task {\\n page_id: u64,\\n pub title: String,\\n}\\n\\n#[derive(Debug)]\\nenum ParseError {\\n /// Something went wrong with the HTTP request to the API.\\n Http(reqwest::Error),\\n\\n /// There was a problem parsing the API response into JSON.\\n Json(json::ParserError),\\n\\n /// Unexpected JSON format from response\\n UnexpectedFormat,\\n}\\nimpl From<json::ParserError> for ParseError {\\n fn from(error: json::ParserError) -> Self {\\n ParseError::Json(error)\\n }\\n}\\n\\nimpl From<reqwest::Error> for ParseError {\\n fn from(error: reqwest::Error) -> Self {\\n ParseError::Http(error)\\n }\\n}\\n\\n\\nfn construct_query_category(category: &str) -> Url {\\n let mut base_url = Url::parse(\\\"http://rosettacode.org/mw/api.php\\\").unwrap();\\n let cat = format!(\\\"Category:{}\\\", category);\\n let query_pairs = vec![(\\\"action\\\", \\\"query\\\"),\\n (\\\"format\\\", \\\"json\\\"),\\n (\\\"list\\\", \\\"categorymembers\\\"),\\n (\\\"cmlimit\\\", \\\"500\\\"),\\n (\\\"cmtitle\\\", &cat),\\n (\\\"continue\\\", \\\"\\\")];\\n base_url.query_pairs_mut().extend_pairs(query_pairs.into_iter());\\n base_url\\n}\\n\\nfn construct_query_task_content(task_id: &str) -> Url {\\n let mut base_url = Url::parse(\\\"http://rosettacode.org/mw/api.php\\\").unwrap();\\n let mut query_pairs =\\n vec![(\\\"action\\\", \\\"query\\\"), (\\\"format\\\", \\\"json\\\"), (\\\"prop\\\", \\\"revisions\\\"), (\\\"rvprop\\\", \\\"content\\\")];\\n query_pairs.push((\\\"pageids\\\", task_id));\\n base_url.query_pairs_mut().extend_pairs(query_pairs.into_iter());\\n base_url\\n}\\n\\nfn query_api(url: Url) -> Result<Json, ParseError> {\\n let mut response = try!(reqwest::get(url.as_str()));\\n // Build JSON\\n let mut body = String::new();\\n response.read_to_string(&mut body).unwrap();\\n\\n Ok(try!(Json::from_str(&body)))\\n}\\n\\nfn parse_all_tasks(reply: &Json) -> Result<Vec<Task>, ParseError> {\\n let json_to_task = |json: &Json| -> Result<Task, ParseError> {\\n let page_id: u64 = try!(json.find(\\\"pageid\\\")\\n .and_then(|id| id.as_u64())\\n .ok_or(ParseError::UnexpectedFormat));\\n let title: &str = try!(json.find(\\\"title\\\")\\n .and_then(|title| title.as_string())\\n .ok_or(ParseError::UnexpectedFormat));\\n\\n Ok(Task {\\n page_id: page_id,\\n title: title.to_owned(),\\n })\\n };\\n let tasks_json = try!(reply.find_path(&[\\\"query\\\", \\\"categorymembers\\\"])\\n .and_then(|tasks| tasks.as_array())\\n .ok_or(ParseError::UnexpectedFormat));\\n\\n // Convert into own type\\n tasks_json.iter().map(json_to_task).collect()\\n}\\nfn count_number_examples(task: &Json, task_id: u64) -> Result<u32, ParseError> {\\n let revisions =\\n try!(task.find_path(&[\\\"query\\\", \\\"pages\\\", task_id.to_string().as_str(), \\\"revisions\\\"])\\n .and_then(|content| content.as_array())\\n .ok_or(ParseError::UnexpectedFormat));\\n let content = try!(revisions[0]\\n .find(\\\"*\\\")\\n .and_then(|content| content.as_string())\\n .ok_or(ParseError::UnexpectedFormat));\\n Ok(content.split(\\\"=={{header\\\").count() as u32)\\n}\\n\\npub fn query_all_tasks() -> Vec<Task> {\\n let query = construct_query_category(\\\"Programming_Tasks\\\");\\n let json: Json = query_api(query).unwrap();\\n parse_all_tasks(&json).unwrap()\\n}\\n\\npub fn query_a_task(task: &Task) -> u32 {\\n let query = construct_query_task_content(&task.page_id.to_string());\\n let json: Json = query_api(query).unwrap();\\n count_number_examples(&json, task.page_id).unwrap()\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"extern crate count_examples;\\nfn main() {\\n let all_tasks = count_examples::query_all_tasks();\\n for task in &all_tasks {\\n let count = count_examples::query_a_task(task);\\n println!(\\\"Task: {} has {} examples\\\", task.title, count);\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import scala.language.postfixOps\\n\\nobject TaskCount extends App {\\n import java.net.{ URL, URLEncoder }\\n import scala.io.Source.fromURL\\n\\n System.setProperty(\\\"http.agent\\\", \\\"*\\\")\\n val allTasksURL =\\n \\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\"\\n val allTasks = xml.parsing.XhtmlParser(fromURL(new URL(allTasksURL)))\\n\\n val regexExpr = \\\"(?i)==\\\\\\\\{\\\\\\\\{header\\\\\\\\|\\\".r\\n\\n def oneTaskURL(title: String) = {\\n println(s\\\"Check $title\\\")\\n \\\"http://www.rosettacode.org/w/index.php?title=%s&action=raw\\\" format URLEncoder.encode(title.replace(' ', '_'), \\\"UTF-8\\\")\\n }\\n\\n def count(title: String) = regexExpr findAllIn fromURL(new URL(oneTaskURL(title)))(io.Codec.UTF8).mkString length\\n\\n val counts = for (task <- allTasks \\\\\\\\ \\\"cm\\\" \\\\\\\\ \\\"@title\\\" map (_.text)) yield scala.actors.Futures.future((task, count(task)))\\n\\n counts map (_.apply) map Function.tupled(\\\"%s: %d examples.\\\" format (_, _)) foreach println\\n println(\\\"\\\\nTotal: %d examples.\\\" format (counts map (_.apply._2) sum))\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"var lwp = require('LWP::UserAgent').new(agent => 'Mozilla/5.0');\\n\\nvar site = 'http://rosettacode.org';\\nvar list_url = '/mw/api.php?action=query&list=categorymembers&'+\\n 'cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml';\\n\\nvar content = lwp.get(site + list_url).decoded_content;\\n\\nwhile (var m = content.match(/cm.*?title=\\\"(.*?)\\\"/g)) {\\n (var slug = m[0]).gsub!(' ', '_');\\n var count = lwp.get(\\\"#{site}/wiki/#{slug}\\\").decoded_content.count(/toclevel-1/g);\\n say \\\"#{m[0]}: #{count} examples\\\";\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"package require Tcl 8.5\\npackage require http\\npackage require json\\n\\nfconfigure stdout -buffering none\\n\\nproc get_tasks {category} {\\n set start [clock milliseconds]\\n puts -nonewline \\\"getting $category members...\\\"\\n set base_url http://www.rosettacode.org/w/api.php\\n set query {action query list categorymembers cmtitle Category:%s format json cmlimit 500}\\n set this_query [dict create {*}[split [format $query $category]]]\\n set tasks [list]\\n\\n while {1} {\\n set url [join [list $base_url [http::formatQuery {*}$this_query]] ?]\\n set response [http::geturl $url]\\n if {[set s [http::status $response]] ne \\\"ok\\\" || [http::ncode $response] != 200} {\\n error \\\"Oops: url=$url\\\\nstatus=$s\\\\nhttp code=[http::code $response]\\\"\\n }\\n set data [json::json2dict [http::data $response]]\\n http::cleanup $response\\n\\n # add tasks to list\\n foreach task [dict get $data query categorymembers] {\\n lappend tasks [dict get [dict create {*}$task] title]\\n }\\n\\n if {[catch {dict get $data query-continue categorymembers cmcontinue} continue_task] != 0} {\\n # no more continuations, we're done\\n break\\n }\\n dict set this_query cmcontinue $continue_task\\n }\\n puts \\\" found [llength $tasks] tasks in [expr {[clock milliseconds] - $start}] milliseconds\\\"\\n return $tasks\\n}\\n\\n# This proc can be replaced by a single regexp command:\\n# set count [regexp -all \\\"***=$needle\\\" $haystack]\\n# However this proc is more efficient -- we're dealing with plain strings only.\\nproc count_substrings {needle haystack} {\\n set count 0\\n set idx 0\\n while {[set idx [string first $needle $haystack $idx]] != -1} {\\n incr count\\n incr idx\\n }\\n return $count\\n}\\n\\nset total 0\\nforeach task [get_tasks Programming_Tasks] {\\n set url [format \\\"http://www.rosettacode.org/w/index.php?title=%s&action=raw\\\" [string map {{ } _} $task]]\\n set response [http::geturl $url]\\n if {[set s [http::status $response]] ne \\\"ok\\\" || [http::ncode $response] != 200} {\\n error \\\"Oops: url=$url\\\\nstatus=$s\\\\nhttp code=[http::code $response]\\\"\\n }\\n set count [count_substrings \\\"\\\\{\\\\{header|\\\" [http::data $response]]\\n puts [format \\\"%3d examples in %s\\\" $count $task]\\n http::cleanup $response\\n incr total $count\\n}\\n\\nputs \\\"\\\\nTotal: $total examples\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nurl=\\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\"\\ndata=REQUEST (url)\\n\\nBUILD S_TABLE beg=*\\nDATA :title=\\\":\\nBUILD S_TABLE end=*\\nDATA :\\\":\\n\\ntitles=EXTRACT (data,beg|,end,1,0,\\\"~~\\\")\\ntitles=SPLIT (titles,\\\":~~:\\\")\\nsz_titles=SIZE (titles)\\n\\nBUILD R_TABLE header=\\\":==\\\\{\\\\{header|:\\\"\\nall=*\\n\\nERROR/STOP CREATE (\\\"tasks\\\",seq-e,-std-)\\n\\nCOMPILE\\nLOOP title=titles\\nask=*\\nask =SET_VALUE(ask,\\\"title\\\",title)\\nask =SET_VALUE(ask,\\\"action\\\",\\\"raw\\\")\\nask =ENCODE (ask,cgi)\\nhttp =\\\"http://www.rosettacode.org/mw/index.php\\\"\\nurl =CONCAT (http,\\\"?\\\",ask)\\ndata =REQUEST (url)\\nheader =FILTER_INDEX (data,header,-)\\nsz_header=SIZE(header)\\nline =CONCAT (title,\\\"=\\\",sz_header,\\\" members\\\")\\nFILE \\\"tasks\\\" = line\\nall =APPEND(all,sz_header)\\nENDLOOP\\n\\nENDCOMPILE\\nall =JOIN(all),sum=SUM(all),time=time()\\nline=CONCAT (time,\\\": \\\", sz_titles, \\\" Programing Tasks: \\\", sum, \\\" solutions\\\")\\n\\nFILE \\\"tasks\\\" = line\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"#!/usr/bin/env bash\\nSITE=https://www.rosettacode.org\\nAPI=$SITE/mw/api.php\\nPAGES=$SITE/mw/index.php\\nquery=\\\"$API?action=query\\\"\\nquery+=$(printf '&%s' \\\\\\n list=categorymembers \\\\\\n cmtitle=Category:Programming_Tasks \\\\\\n cmlimit=500)\\ntotal=0\\nwhile read title; do\\n t=${title// /_}\\n tasks=$(curl -s \\\"$PAGES?title=$t&action=raw\\\" \\\\\\n | grep -c '{{header|')\\n printf '%s: %d examples.\\\\n' \\\"$title\\\" \\\"$tasks\\\"\\n let total+=tasks\\ndone < <(curl -s \\\"$query&format=json\\\" \\\\\\n | jq -r '.query.categorymembers[].title')\\n\\nprintf '\\\\nTotal: %d examples.\\\\n' \\\"$total\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"/* Rosetta_Code_Count_examples.wren */\\n\\nimport \\\"./pattern\\\" for Pattern\\n\\nvar CURLOPT_URL = 10002\\nvar CURLOPT_FOLLOWLOCATION = 52\\nvar CURLOPT_WRITEFUNCTION = 20011\\nvar CURLOPT_WRITEDATA = 10001\\n\\nforeign class Buffer {\\n construct new() {} // C will allocate buffer of a suitable size\\n\\n foreign value // returns buffer contents as a string\\n}\\n\\nforeign class Curl {\\n construct easyInit() {}\\n\\n foreign easySetOpt(opt, param)\\n\\n foreign easyPerform()\\n\\n foreign easyCleanup()\\n}\\n\\nvar curl = Curl.easyInit()\\n\\nvar getContent = Fn.new { |url|\\n var buffer = Buffer.new()\\n curl.easySetOpt(CURLOPT_URL, url)\\n curl.easySetOpt(CURLOPT_FOLLOWLOCATION, 1)\\n curl.easySetOpt(CURLOPT_WRITEFUNCTION, 0) // write function to be supplied by C\\n curl.easySetOpt(CURLOPT_WRITEDATA, buffer)\\n curl.easyPerform()\\n return buffer.value\\n}\\n\\nvar url = \\\"https://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\"\\nvar content = getContent.call(url)\\nvar p = Pattern.new(\\\"title/=\\\\\\\"[+1^\\\\\\\"]\\\\\\\"\\\")\\nvar matches = p.findAll(content)\\nfor (m in matches) {\\n var title = m.capsText[0].replace(\\\"'\\\", \\\"'\\\").replace(\\\""\\\", \\\"\\\\\\\"\\\")\\n var title2 = title.replace(\\\" \\\", \\\"_\\\").replace(\\\"+\\\", \\\"\\\\%252B\\\")\\n var taskUrl = \\\"https://www.rosettacode.org/w/index.php?title=%(title2)&action=raw\\\"\\n var taskContent = getContent.call(taskUrl)\\n var lines = taskContent.split(\\\"\\\\n\\\")\\n var count = lines.count { |line| line.trim().startsWith(\\\"=={{header|\\\") }\\n System.print(\\\"%(title) : %(count) examples\\\")\\n}\\n\\ncurl.easyCleanup()\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"/* gcc Rosetta_Code_Count_examples.c -o Rosetta_Code_Count_examples -lcurl -lwren -lm */\\n\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <curl/curl.h>\\n#include \\\"wren.h\\\"\\n\\nstruct MemoryStruct {\\n char *memory;\\n size_t size;\\n};\\n\\n/* C <=> Wren interface functions */\\n\\nstatic size_t WriteMemoryCallback(void *contents, size_t size, size_t nmemb, void *userp) {\\n size_t realsize = size * nmemb;\\n struct MemoryStruct *mem = (struct MemoryStruct *)userp;\\n\\n char *ptr = realloc(mem->memory, mem->size + realsize + 1);\\n if(!ptr) {\\n /* out of memory! */\\n printf(\\\"not enough memory (realloc returned NULL)\\\\n\\\");\\n return 0;\\n }\\n\\n mem->memory = ptr;\\n memcpy(&(mem->memory[mem->size]), contents, realsize);\\n mem->size += realsize;\\n mem->memory[mem->size] = 0;\\n return realsize;\\n}\\n\\nvoid C_bufferAllocate(WrenVM* vm) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenSetSlotNewForeign(vm, 0, 0, sizeof(struct MemoryStruct));\\n ms->memory = malloc(1);\\n ms->size = 0;\\n}\\n\\nvoid C_bufferFinalize(void* data) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)data;\\n free(ms->memory);\\n}\\n\\nvoid C_curlAllocate(WrenVM* vm) {\\n CURL** pcurl = (CURL**)wrenSetSlotNewForeign(vm, 0, 0, sizeof(CURL*));\\n *pcurl = curl_easy_init();\\n}\\n\\nvoid C_value(WrenVM* vm) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 0);\\n wrenSetSlotString(vm, 0, ms->memory);\\n}\\n\\nvoid C_easyPerform(WrenVM* vm) {\\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\\n curl_easy_perform(curl);\\n}\\n\\nvoid C_easyCleanup(WrenVM* vm) {\\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\\n curl_easy_cleanup(curl);\\n}\\n\\nvoid C_easySetOpt(WrenVM* vm) {\\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\\n CURLoption opt = (CURLoption)wrenGetSlotDouble(vm, 1);\\n if (opt < 10000) {\\n long lparam = (long)wrenGetSlotDouble(vm, 2);\\n curl_easy_setopt(curl, opt, lparam);\\n } else if (opt < 20000) {\\n if (opt == CURLOPT_WRITEDATA) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 2);\\n curl_easy_setopt(curl, opt, (void *)ms);\\n } else if (opt == CURLOPT_URL) {\\n const char *url = wrenGetSlotString(vm, 2);\\n curl_easy_setopt(curl, opt, url);\\n }\\n } else if (opt < 30000) {\\n if (opt == CURLOPT_WRITEFUNCTION) {\\n curl_easy_setopt(curl, opt, &WriteMemoryCallback);\\n }\\n }\\n}\\n\\nWrenForeignClassMethods bindForeignClass(WrenVM* vm, const char* module, const char* className) {\\n WrenForeignClassMethods methods;\\n methods.allocate = NULL;\\n methods.finalize = NULL;\\n if (strcmp(module, \\\"main\\\") == 0) {\\n if (strcmp(className, \\\"Buffer\\\") == 0) {\\n methods.allocate = C_bufferAllocate;\\n methods.finalize = C_bufferFinalize;\\n } else if (strcmp(className, \\\"Curl\\\") == 0) {\\n methods.allocate = C_curlAllocate;\\n }\\n }\\n return methods;\\n}\\n\\nWrenForeignMethodFn bindForeignMethod(\\n WrenVM* vm,\\n const char* module,\\n const char* className,\\n bool isStatic,\\n const char* signature) {\\n if (strcmp(module, \\\"main\\\") == 0) {\\n if (strcmp(className, \\\"Buffer\\\") == 0) {\\n if (!isStatic && strcmp(signature, \\\"value\\\") == 0) return C_value;\\n } else if (strcmp(className, \\\"Curl\\\") == 0) {\\n if (!isStatic && strcmp(signature, \\\"easySetOpt(_,_)\\\") == 0) return C_easySetOpt;\\n if (!isStatic && strcmp(signature, \\\"easyPerform()\\\") == 0) return C_easyPerform;\\n if (!isStatic && strcmp(signature, \\\"easyCleanup()\\\") == 0) return C_easyCleanup;\\n }\\n }\\n return NULL;\\n}\\n\\nstatic void writeFn(WrenVM* vm, const char* text) {\\n printf(\\\"%s\\\", text);\\n}\\n\\nvoid errorFn(WrenVM* vm, WrenErrorType errorType, const char* module, const int line, const char* msg) {\\n switch (errorType) {\\n case WREN_ERROR_COMPILE:\\n printf(\\\"[%s line %d] [Error] %s\\\\n\\\", module, line, msg);\\n break;\\n case WREN_ERROR_STACK_TRACE:\\n printf(\\\"[%s line %d] in %s\\\\n\\\", module, line, msg);\\n break;\\n case WREN_ERROR_RUNTIME:\\n printf(\\\"[Runtime Error] %s\\\\n\\\", msg);\\n break;\\n }\\n}\\n\\nchar *readFile(const char *fileName) {\\n FILE *f = fopen(fileName, \\\"r\\\");\\n fseek(f, 0, SEEK_END);\\n long fsize = ftell(f);\\n rewind(f);\\n char *script = malloc(fsize + 1);\\n fread(script, 1, fsize, f);\\n fclose(f);\\n script[fsize] = 0;\\n return script;\\n}\\n\\nstatic void loadModuleComplete(WrenVM* vm, const char* module, WrenLoadModuleResult result) {\\n if( result.source) free((void*)result.source);\\n}\\n\\nWrenLoadModuleResult loadModule(WrenVM* vm, const char* name) {\\n WrenLoadModuleResult result = {0};\\n if (strcmp(name, \\\"random\\\") != 0 && strcmp(name, \\\"meta\\\") != 0) {\\n result.onComplete = loadModuleComplete;\\n char fullName[strlen(name) + 6];\\n strcpy(fullName, name);\\n strcat(fullName, \\\".wren\\\");\\n result.source = readFile(fullName);\\n }\\n return result;\\n}\\n\\nint main(int argc, char **argv) {\\n WrenConfiguration config;\\n wrenInitConfiguration(&config);\\n config.writeFn = &writeFn;\\n config.errorFn = &errorFn;\\n config.bindForeignClassFn = &bindForeignClass;\\n config.bindForeignMethodFn = &bindForeignMethod;\\n config.loadModuleFn = &loadModule;\\n WrenVM* vm = wrenNewVM(&config);\\n const char* module = \\\"main\\\";\\n const char* fileName = \\\"Rosetta_Code_Count_examples.wren\\\";\\n char *script = readFile(fileName);\\n WrenInterpretResult result = wrenInterpret(vm, module, script);\\n switch (result) {\\n case WREN_RESULT_COMPILE_ERROR:\\n printf(\\\"Compile Error!\\\\n\\\");\\n break;\\n case WREN_RESULT_RUNTIME_ERROR:\\n printf(\\\"Runtime Error!\\\\n\\\");\\n break;\\n case WREN_RESULT_SUCCESS:\\n break;\\n }\\n wrenFreeVM(vm);\\n free(script);\\n return 0;\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"var [const] YAJL=Import(\\\"zklYAJL\\\")[0], CURL=Import(\\\"zklCurl\\\");\\n\\nfcn getTasks(language){\\n continueValue,tasks:=\\\"\\\",Data(0,String); // \\\"nm\\\\0nm\\\\0....\\\"\\n do{\\n page:=CURL().get((\\\"http://rosettacode.org/mw/api.php?\\\"\\n \\\"action=query&cmlimit=500\\\"\\n\\t \\\"&format=json\\\"\\n\\t \\\"&list=categorymembers\\\"\\n\\t \\\"&cmtitle=Category:%s\\\"\\n\\t \\\"&cmcontinue=%s\\\").fmt(language,continueValue));\\n page=page[0].del(0,page[1]); // get rid of HTML header\\n json:=YAJL().write(page).close();\\n json[\\\"query\\\"][\\\"categorymembers\\\"].pump(tasks,T(\\\"get\\\",\\\"title\\\"));\\n continueValue=json.find(\\\"continue\\\") //continue:-||,cmcontinue:page|954|19)\\n .toList().apply(\\\"concat\\\",\\\"=\\\").concat(\\\"&\\\");\\n }while(continueValue);\\n tasks\\n}\\nre:=RegExp(0'!\\\\s+==\\\\s*{{\\\\s*header\\\\s*\\\\|!); // == {{ header | zkl\\nforeach task in (getTasks(\\\"Programming_Tasks\\\")){\\n page:=CURL().get(\\n \\\"http://www.rosettacode.org/mw/index.php?title=%s&action=raw\\\"\\n .fmt(CURL.urlEncode(task)));\\n page=page[0].del(0,page[1]); // get rid of HTML header\\n cnt,n:=0,0; while(re.search(page,True,n)){ cnt+=1; n=re.matched[0].sum(0); }\\n \\\"%4d: %s\\\".fmt(cnt,task).println();\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Rosetta-Code-Count-examples"}}},{"rowIdx":1592,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Rosetta_Code/Find_unimplemented_tasks\nnote: Rosetta Code related\n","language":"00-META"},{"code":";Task:\nGiven the name of a language on Rosetta Code, find all tasks which are not implemented in that language.\n\n\nNote: Implementations should allow for fetching more data than can be returned in one request to Rosetta Code.\n\nYou'll need to use the Media Wiki API, which you can find out about locally, [http://rosettacode.org/mw/api.php here], or in Media Wiki's API documentation at, [http://www.mediawiki.org/wiki/API_Query API:Query]\n<br><br>\n\n","language":"00-TASK"},{"code":"with Aws.Client, Aws.Messages, Aws.Response, Aws.Resources, Aws.Url;\nwith Dom.Readers, Dom.Core, Dom.Core.Documents, Dom.Core.Nodes, Dom.Core.Attrs;\nwith Input_Sources.Strings, Unicode, Unicode.Ces.Utf8;\nwith Ada.Strings.Unbounded, Ada.Text_IO, Ada.Command_Line;\nwith Ada.Containers.Vectors;\n\nuse Aws.Client, Aws.Messages, Aws.Response, Aws.Resources, Aws.Url;\nuse Dom.Readers, Dom.Core, Dom.Core.Documents, Dom.Core.Nodes, Dom.Core.Attrs;\nuse Aws, Ada.Strings.Unbounded, Input_Sources.Strings;\nuse Ada.Text_IO, Ada.Command_Line;\n\nprocedure Not_Coded is\n\n package Members_Vectors is new Ada.Containers.Vectors (\n Index_Type => Positive,\n Element_Type => Unbounded_String);\n use Members_Vectors;\n\n All_Tasks, Language_Members : Vector;\n\n procedure Get_Vector (Category : in String; Mbr_Vector : in out Vector) is\n Reader : Tree_Reader;\n Doc : Document;\n List : Node_List;\n N : Node;\n A : Attr;\n Page : Aws.Response.Data;\n S : Messages.Status_Code;\n\n -- Query has cmlimit value of 100, so we need 5 calls to\n -- retrieve the complete list of Programming_category\n Uri_Xml : constant String :=\n \"http://rosettacode.org/mw/api.php?action=query&list=categorymembers\"\n &\n \"&format=xml&cmlimit=100&cmtitle=Category:\";\n Cmcontinue : Unbounded_String := Null_Unbounded_String;\n begin\n loop\n Page :=\n Aws.Client.Get (Uri_Xml & Category & (To_String (Cmcontinue)));\n S := Response.Status_Code (Page);\n if S not in Messages.Success then\n Put_Line\n (\"Unable to retrieve data => Status Code :\" &\n Image (S) &\n \" Reason :\" &\n Reason_Phrase (S));\n raise Connection_Error;\n end if;\n declare\n Xml : constant String := Message_Body (Page);\n Source : String_Input;\n begin\n Open\n (Xml'Unrestricted_Access,\n Unicode.Ces.Utf8.Utf8_Encoding,\n Source);\n Parse (Reader, Source);\n Close (Source);\n end;\n Doc := Get_Tree (Reader);\n List := Get_Elements_By_Tag_Name (Doc, \"cm\");\n for Index in 1 .. Length (List) loop\n N := Item (List, Index - 1);\n A := Get_Named_Item (Attributes (N), \"title\");\n Members_Vectors.Append\n (Mbr_Vector,\n To_Unbounded_String (Value (A)));\n end loop;\n Free (List);\n List := Get_Elements_By_Tag_Name (Doc, \"query-continue\");\n if Length (List) = 0 then\n -- we are done\n Free (List);\n Free (Reader);\n exit;\n end if;\n N := First_Child (Item (List, 0));\n A := Get_Named_Item (Attributes (N), \"cmcontinue\");\n Cmcontinue :=\n To_Unbounded_String\n (\"&cmcontinue=\" & Aws.Url.Encode (Value (A)));\n Free (List);\n Free (Reader);\n end loop;\n end Get_Vector;\n\n procedure Quick_Diff (From : in out Vector; Substract : in Vector) is\n Beginning, Position : Extended_Index;\n begin\n -- take adavantage that both lists are already sorted\n Beginning := First_Index (From);\n for I in First_Index (Substract) .. Last_Index (Substract) loop\n Position :=\n Find_Index\n (Container => From,\n Item => Members_Vectors.Element (Substract, I),\n Index => Beginning);\n if not (Position = No_Index) then\n Delete (From, Position);\n Beginning := Position;\n end if;\n end loop;\n end Quick_Diff;\n\nbegin\n if Argument_Count = 0 then\n Put_Line (\"Can't process : No language given!\");\n return;\n else\n Get_Vector (Argument (1), Language_Members);\n end if;\n\n Get_Vector (\"Programming_Tasks\", All_Tasks);\n Quick_Diff (All_Tasks, Language_Members);\n\n for I in First_Index (All_Tasks) .. Last_Index (All_Tasks) loop\n Put_Line (To_String (Members_Vectors.Element (All_Tasks, I)));\n end loop;\n Put_Line\n (\"Numbers of tasks not implemented :=\" &\n Integer'Image (Last_Index ((All_Tasks))));\nend Not_Coded;\n","language":"Ada"},{"code":"/* ARM assembly Raspberry PI */\n/* program tasksearchRasp.s */\n/* access RosettaCode.org and data extract */\n/* use openssl for access to port 443 */\n/* test openssl : package libssl-dev */\n\n/* REMARK 1 : this program use routines in a include file\n see task Include a file language arm assembly\n for the routine affichageMess conversion10\n see at end of this program the instruction include */\n\n/*******************************************/\n/* Constantes */\n/*******************************************/\n.include \"../constantes.inc\"\n\n//.equ EXIT, 1\n.equ TAILLEBUFFER, 500\n\n.equ SSL_OP_NO_SSLv3, 0x02000000\n.equ SSL_OP_NO_COMPRESSION, 0x00020000\n.equ SSL_MODE_AUTO_RETRY, 0x00000004\n.equ SSL_CTRL_MODE, 33\n\n.equ BIO_C_SET_CONNECT, 100\n.equ BIO_C_DO_STATE_MACHINE, 101\n.equ BIO_C_SET_SSL, 109\n.equ BIO_C_GET_SSL, 110\n\n.equ LGBUFFERREQ, 512001\n.equ LGBUFFER2, 128001\n\n/*********************************/\n/* Initialized data */\n/*********************************/\n.data\nszMessDebutPgm: .asciz \"Program 32 bits start \\n\"\nszRetourLigne: .asciz \"\\n\"\nszMessFinOK: .asciz \"Program end OK. \\n\"\nszMessErreur: .asciz \"Erreur !!!\"\n//szMessExtractArea: .asciz \"Extraction = \"\nszMessConnectOK: .asciz \"Connexion site OK.\\n\"\nszMessInitOK: .asciz \"Initialisation SSL OK.\\n\"\nszMessReqOK: .asciz \"Send requete OK.\\n\"\nszNomSite1: .asciz \"www.rosettacode.org:443\" @ host name and port\nszLibStart: .asciz \"<query><categorymembers>\" @ search string\nszLibsearch1: .asciz \"<cm pageid=\"\nszLibsearch2: .asciz \"title=\"\nszNomrepCertif: .asciz \"/pi/certificats\"\nszRequete1: .asciz \"GET /w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=1000&format=xml HTTP/1.1 \\r\\nHost: rosettacode.org\\r\\nConnection: keep-alive\\r\\nContent-Type: text/plain\\r\\n\\r\\n\"\nszRequete2: .asciz \"GET /w/api.php?action=query&list=categorymembers&cmtitle=Category:ARM%20Assembly&cmlimit=500&format=xml HTTP/1.1 \\r\\nHost: rosettacode.org\\r\\nConnection: keep-alive\\r\\nContent-Type: text/plain\\r\\n\\r\\n\"\n\n/*********************************/\n/* UnInitialized data */\n/*********************************/\n.bss\n.align 4\nsBufferreq: .skip LGBUFFERREQ\nsBufferreq1: .skip LGBUFFERREQ\nszExtractArea: .skip TAILLEBUFFER\nszExtractArea1: .skip TAILLEBUFFER\nszTaskName: .skip 128\nszTaskNamePgm: .skip 128\n.align 4\nstNewSSL: .skip 200\n/*********************************/\n/* code section */\n/*********************************/\n.text\n.global main\nmain:\n ldr r0,iAdrszMessDebutPgm\n bl affichageMess @ start message\n\n /* connexion host port 443 and send query */\n ldr r0,iAdrszNomSite1\n ldr r1,iAdrszRequete1\n ldr r2,iAdrsBufferreq\n bl envoiRequete\n cmp r0,#-1\n beq 99f @ error ?\n\n ldr r0,iAdrszNomSite1\n ldr r1,iAdrszRequete2\n ldr r2,iAdrsBufferreq1\n bl envoiRequete\n cmp r0,#-1\n beq 99f @ error ?\n\n bl analyseReponse\n\n ldr r0,iAdrszMessFinOK @ end message\n bl affichageMess\n mov r0, #0 @ return code ok\n b 100f\n99:\n ldr r0,iAdrszMessErreur @ error\n bl affichageMess\n mov r0, #1 @ return code error\n b 100f\n100:\n mov r7,#EXIT @ program end\n svc #0 @ system call\niAdrszMessDebutPgm: .int szMessDebutPgm\niAdrszMessFinOK: .int szMessFinOK\niAdrszMessErreur: .int szMessErreur\niAdrszNomSite1: .int szNomSite1\niAdrszRequete2: .int szRequete2\niAdrszRequete1: .int szRequete1\niAdrsBufferreq: .int sBufferreq\niAdrsBufferreq1: .int sBufferreq1\n/*********************************************************/\n/* connexion host port 443 and send query */\n/*********************************************************/\nenvoiRequete:\n push {r2-r9,lr} @ save registers\n mov r8,r0 @ save address site name\n mov r9,r1 @ save address requete\n mov r7,r2 @ save address buffer\n @*************************************\n @ openSsl functions use *\n @*************************************\n @init ssl\n mov r0,#0\n bl OPENSSL_init_crypto\n bl ERR_load_BIO_strings\n mov r2, #0\n mov r1, #0\n mov r0, #2\n bl OPENSSL_init_crypto\n mov r2, #0\n mov r1, #0\n mov r0, #0\n bl OPENSSL_init_ssl\n cmp r0,#0\n blt erreur\n bl TLS_client_method\n bl SSL_CTX_new\n cmp r0,#0\n ble erreur\n mov r6,r0 @ save ctx\n ldr r1,iFlag\n bl SSL_CTX_set_options\n mov r0,r6\n mov r1,#0\n ldr r2,iAdrszNomrepCertif\n bl SSL_CTX_load_verify_locations\n cmp r0,#0\n ble erreur\n mov r0,r6\n bl BIO_new_ssl_connect\n cmp r0,#0\n beq erreur\n cmp r0,#-1\n beq erreur\n mov r5,r0 @ save bio\n ldr r0,iAdrszMessInitOK\n bl affichageMess\n mov r0,r5\n mov r1,#BIO_C_GET_SSL\n mov r2,#0\n ldr r3,iAdrstNewSSL\n bl BIO_ctrl\n ldr r0,iAdrstNewSSL\n ldr r0,[r0]\n mov r1,#SSL_CTRL_MODE\n mov r2,#SSL_MODE_AUTO_RETRY\n mov r3,#0\n bl SSL_ctrl\n mov r0,r5 @ bio\n mov r1,#BIO_C_SET_CONNECT\n mov r2,#0\n mov r3,r8 @ site address\n bl BIO_ctrl\n mov r0,r5 @ bio\n mov r1,#BIO_C_DO_STATE_MACHINE\n mov r2,#0\n mov r3,#0\n bl BIO_ctrl\n cmp r0,#0\n blt erreur\n\n ldr r0,iAdrszMessConnectOK\n bl affichageMess\n @ compute query length\n mov r2,#0 @ init length\n mov r1,r9 @ query address\n1: @ loop compute length query\n ldrb r0,[r1,r2]\n cmp r0,#0\n addne r2,#1\n bne 1b\n @ send query\n mov r0,r5 @ bio\n @ r1 = address query\n @ r2 = length query\n mov r3,#0\n bl BIO_write @ send query\n cmp r0,#0\n blt erreur\n ldr r0,iAdrszMessReqOK\n bl affichageMess\n2: @ begin loop to read datas\n mov r0,r5 @ bio\n mov r1,r7 @ buffer address\n mov r2,#LGBUFFERREQ - 1\n mov r3,#0\n bl BIO_read\n cmp r0,#0\n ble 4f @ error ou pb server\n mov r1,r7\n add r7,r0\n sub r2,r7,#6\n ldr r2,[r2]\n ldr r3,iCharEnd\n cmp r2,r3 @ text end ?\n beq 4f\n mov r1,#0xFF @ delay loop\n3:\n subs r1,#1\n bgt 3b\n b 2b @ loop read other chunk\n4: @ read end\n //ldr r0,iAdrsBufferreq @ to display buffer response of the query\n //bl affichageMess\n mov r0, r5 @ close bio\n bl BIO_free_all\n mov r0,#0\n b 100f\nerreur: @ error display\n ldr r1,iAdrszMessErreur\n bl afficheerreur\n mov r0,#-1 @ error code\n b 100f\n100:\n pop {r2-r9,pc} @ restaur registers\niFlag: .int SSL_OP_NO_SSLv3 | SSL_OP_NO_COMPRESSION\niAdrstNewSSL: .int stNewSSL\niAdrszNomrepCertif: .int szNomrepCertif\niCharEnd: .int 0x0A0D300A\niAdrszMessConnectOK: .int szMessConnectOK\niAdrszMessInitOK: .int szMessInitOK\niAdrszMessReqOK: .int szMessReqOK\n/*********************************************************/\n/* response analyze */\n/*********************************************************/\nanalyseReponse:\n push {r1-r6,lr} @ save registers\n @ search start in task buffer\n ldr r0,iAdrsBufferreq @ buffer address\n mov r7,r0\n ldr r1,iAdrszLibStart @ key text address\n bl rechercheSousChaine\n cmp r0,#-1\n beq 99f\n add r7,r7,r0 @ new search buffer address\n mov r0,r7\n @ search start in task buffer\n ldr r0,iAdrsBufferreq11 @ buffer address\n mov r5,r0\n ldr r1,iAdrszLibStart @ key text address\n bl rechercheSousChaine\n cmp r0,#-1\n beq 99f @ error ?\n add r5,r5,r0\n mov r0,r5\n1: @ loop begin to find task in program buffer\n mov r0,r5\n ldr r1,iAdrszLibsearch1 @ text code task address\n mov r2,#1 @ occurence key text\n mov r3,#2 @ offset\n ldr r4,iAdrszExtractArea1 @ address result area\n bl extChaine\n cmp r0,#-1\n beq 99f @ error ?\n mov r5,r0 @ new address to search\n ldr r0,iAdrszExtractArea1\n bl conversionAtoD @ conversion code task to numeric\n mov r10,r0 @ save numeric code\n mov r0,r5 @ search task name in pgm buffer @\n ldr r1,iAdrszLibsearch2 @ key text address\n mov r2,#1 @ occurence key text\n mov r3,#2 @ offset\n ldr r4,iAdrszTaskNamePgm @ address result area\n bl extChaine\n cmp r0,#-1\n beq 99f\n mov r5,r0 @ new address to search\n2: @ loop search buffer tasks\n mov r0,r7\n ldr r1,iAdrszLibsearch1 @ key text address\n mov r2,#1 @ occurence key text\n mov r3,#2 @ offset\n ldr r4,iAdrszExtractArea @ address result area\n bl extChaine\n cmp r0,#-1\n beq 99f\n mov r7,r0\n mov r0,r7\n ldr r1,iAdrszLibsearch2 @ key text address\n mov r2,#1 @ occurence key text\n mov r3,#2 @ offset\n ldr r4,iAdrszTaskName @ address result area\n bl extChaine\n cmp r0,#-1\n beq 99f\n mov r7,r0 @ new search address in task buffer\n ldr r0,iAdrszExtractArea\n bl conversionAtoD @ conversion code task in numeric\n cmp r10,r0 @ compere two task code\n beq 10f @ search next codes if equals\n\n ldr r0,iAdrszTaskName @ else display task name\n bl affichageMess\n ldr r0,iAdrszRetourLigne\n bl affichageMess\n\n add r0,r7,#4 @ search if end of task list\n ldrb r2,[r0]\n cmp r2,#'/'\n bne 2b @ no -> loop\n add r0,#1\n ldrb r2,[r0]\n cmp r2,#'c'\n bne 2b @ no -> loop\n\n b 100f @ yes -> list end\n10:\n add r0,r5,#4 @ search if end of pgm task list\n ldrb r2,[r0]\n cmp r2,#'/'\n bne 1b\n add r0,#1\n ldrb r2,[r0]\n cmp r2,#'c'\n bne 1b\n\n b 100f @ list pgm end\n\n99:\n ldr r0,iAdrszMessErreur1 @ error\n bl affichageMess\n mov r0, #-1 @ error return code\n b 100f\n100:\n pop {r1-r6,pc} @ restaur registers\niAdrsBufferreq11: .int sBufferreq1\niAdrszLibStart: .int szLibStart\niAdrszLibsearch1: .int szLibsearch1\niAdrszLibsearch2: .int szLibsearch2\niAdrszTaskName: .int szTaskName\niAdrszTaskNamePgm: .int szTaskNamePgm\niAdrszExtractArea: .int szExtractArea\niAdrszExtractArea1: .int szExtractArea1\niAdrszRetourLigne: .int szRetourLigne\niAdrszMessErreur1: .int szMessErreur\n/*********************************************************/\n/* Text Extraction behind text key */\n/*********************************************************/\n/* r0 buffer address */\n/* r1 key text to search */\n/* r2 number occurences to key text */\n/* r3 offset */\n/* r4 result address */\nextChaine:\n push {r2-r8,lr} @ save registers\n mov r5,r0 @ save buffer address\n mov r6,r1 @ save key text\n @ compute text length\n mov r7,#0\n1: @ loop\n ldrb r0,[r5,r7] @ load a byte\n cmp r0,#0 @ end ?\n addne r7,#1 @ no -> loop\n bne 1b\n add r7,r5 @ compute text end\n\n mov r8,#0\n2: @ compute length text key\n ldrb r0,[r6,r8]\n cmp r0,#0\n addne r8,#1\n bne 2b\n\n3: @ loop to search nième(r2) key text\n mov r0,r5\n mov r1,r6\n bl rechercheSousChaine\n cmp r0,#0\n blt 100f\n subs r2,#1\n addgt r5,r0\n addgt r5,r8\n bgt 3b\n add r0,r5 @ add address text to index\n add r3,r0 @ add offset\n sub r3,#1\n @ and add length key text\n add r3,r8\n cmp r3,r7 @ > at text end\n movge r0,#-1 @ yes -> error\n bge 100f\n mov r0,#0\n4: @ character loop copy\n ldrb r2,[r3,r0]\n strb r2,[r4,r0]\n cmp r2,#0 @ text end ?\n moveq r0,#0 @ return zero\n beq 100f\n cmp r2,#'\"' @ text end ?\n beq 5f\n cmp r0,#48 @ extraction length\n beq 5f\n add r0,#1\n b 4b @ and loop\n5:\n mov r2,#0 @ store final zéro\n strb r2,[r4,r0]\n add r0,#1\n add r0,r3 @ r0 return the last position of extraction\n @ it is possible o search another text\n100:\n \tpop {r2-r8,pc} @ restaur registers\n\n/******************************************************************/\n/* search substring in string */\n/******************************************************************/\n/* r0 contains address string */\n/* r1 contains address substring */\n/* r0 return start index substring or -1 if not find */\nrechercheSousChaine:\n push {r1-r6,lr} @ save registers\n mov r2,#0 @ index position string\n mov r3,#0 @ index position substring\n mov r6,#-1 @ search index\n ldrb r4,[r1,r3] @ load first byte substring\n cmp r4,#0 @ zero final ?\n moveq r0,#-1 @ error\n beq 100f\n1:\n ldrb r5,[r0,r2] @ load string byte\n cmp r5,#0 @ zero final ?\n moveq r0,#-1 @ yes -> not find\n beq 100f\n cmp r5,r4 @ compare character two strings\n beq 2f\n mov r6,#-1 @ not equal - > raz index\n mov r3,#0 @ and raz byte counter\n ldrb r4,[r1,r3] @ and load byte\n add r2,#1 @ and increment byte counter\n b 1b @ and loop\n2: @ characters equal\n cmp r6,#-1 @ first character equal ?\n moveq r6,r2 @ yes -> start index in r6\n add r3,#1 @ increment substring counter\n ldrb r4,[r1,r3] @ and load next byte\n cmp r4,#0 @ zero final ?\n beq 3f @ yes -> search end\n add r2,#1 @ else increment string index\n b 1b @ and loop\n3:\n mov r0,r6 @ return start index substring in the string\n100:\n pop {r1-r6,pc} @ restaur registres\n\n/***************************************************/\n/* ROUTINES INCLUDE */\n/***************************************************/\n.include \"../affichage.inc\"\n","language":"ARM-Assembly"},{"code":"#NoEnv ; do not resolve environment variables (speed)\n#SingleInstance force ; allow only one instance\nSetBatchLines, -1 ; set to highest script speed\nSetControlDelay, 0 ; set delay between control commands to lowest\n\n; additional label, for clarity only\nAutoExec:\n Gui, Add, DDL, x10 y10 w270 r20 vlngStr ; add drop-down list\n Gui, Add, Button, x290 y10 gShowLng, Show Unimplemented ; add button\n Gui, Add, ListView, x10 y36 w400 h300 vcatLst gOnLV, Unimplemented ; add listview\n Gui, Add, StatusBar, vsbStr, ; add statusbar\n Gui, Show, , RosettaCode unimplemented list ; show the gui\n allLng := getList(\"lng\") ; get a list of all available languages\n selectStr = Select language... ; set selection string for ddl\n GuiControl, , LngStr, |%selectStr%||%allLng% ; set the ddl to new contents\n SB_SetIcon(\"user32.dll\", 5) ; change statusbar icon\n SB_SetText(\"Done loading languages. Select from menu.\") ; change statusbar text\nReturn ; end of the autoexec section. Script waits for input.\n\n; subroutine for language list in ddl update\nShowLng:\n Gui, Submit, NoHide ; refresh all gui variables\n If (lngStr != selectStr) ; if the current selected language is not the selection string\n {\n SB_SetIcon(\"user32.dll\", 2) ; set statusbar icon to exclamation\n SB_SetText(\"Loading unimplemented tasks... Please wait.\") ; set statusbar text\n allTsk := getList(\"tsk\") ; get a list of all tasks\n allThis := getList(lngStr) ; get a list of all done tasks for this language\n Loop, Parse, allTsk, | ; parse the list of all tasks\n {\n If !InStr(allThis,A_LoopField) ; if the current task is not found in the list of all tasks\n notImpl .= A_LoopField . \"|\" ; add the current field to the notImpl variable\n allTskCnt := A_Index ; save the index for final count\n }\n StringTrimRight, notImpl, notImpl, 1 ; remove last delimiter\n LV_Delete() ; emty the listview\n GuiControl, -Redraw, catLst ; set the listview to not redraw while adding (speed)\n Loop, Parse, notImpl, | ; parse the list of not implemented tasks\n {\n LV_Add(\"\", A_LoopField) ; add them to the listview, field by field\n notImplCnt := A_Index ; save the index for final count\n }\n GuiControl, +Redraw, catLst ; set the listview back to normal\n SB_SetIcon(\"user32.dll\", 5) ; change statusbar icon to information\n SB_SetText(\"There are \" . notImplCnt . \" of \" . allTskCnt\n . \" tasks unimplemented. Double-click task to open in browser.\") ; set the statusbar text\n notImpl = ; empty the notImpl variable\n notImplCnt = 0 ; set the count back to 0\n }\nReturn\n\n; subroutine for action on listview\nOnLV:\n If (A_GuiEvent = \"DoubleClick\") ; if the listview was double-clicked\n {\n LV_GetText(rowTxt, A_EventInfo) ; get the text of the clicked row\n rowTxt := Enc_Uri(rowTxt) ; uri-encode the text\n StringReplace, rowTxt, rowTxt, `%20, _, All ; replace all space-encodings with underscores\n Run % \"http://rosettacode.org/wiki/\" . rowTxt ; run the resulting link in the default browser\n }\nReturn\n\n; generic function to gather list\ngetList(category)\n{\n fileName = temp.xml ; set temp-file name\n If (category = \"lng\") ; if the category received is lng\n {\n category = Programming_Languages ; set the category\n fileName = lng.xml ; set temp-file name\n IfExist, %fileName% ; if the file already exists\n {\n FileGetTime, modTime, %fileName% ; get the last modified time\n EnvSub, modTime, %A_Now%, days ; get the difference between now and last modified time in days\n If (modTime < 3) ; if the result is less than 3\n Goto, GetFileNoDL ; go to function-internal subroutine to parse\n }\n SB_SetIcon(\"user32.dll\", 2) ; set statusbar icon\n SB_SetText(\"Loading languages... Please wait.\") ; set statusbar text\n }\n If (category = \"tsk\") ; if the category received is tsk\n category = Programming_Tasks ; set the category\n\n getFile: ; function-internal subroutine for getting a file and parsing it\n ; construct the url\n url := \"http://www.rosettacode.org/w/api.php?action=query&list=\"\n . \"categorymembers&cmtitle=Category:\" . category\n . \"&cmlimit=500&format=xml\" . doContinue\n UrlDownloadToFile, %url%, %fileName% ; download the url\n\n getFileNoDL: ; function-internal subroutine for parsing a file\n FileRead, data, %fileName% ; read file into variable\n pos = 1 ; set while-loop counter\n rxp = title=\"(.*?)\" ; set regular expression\n While (pos := RegExMatch(data, rxp, title, pos)) ; get the contents of the title fields one-by-one\n {\n If InStr(title1, \"Category:\") ; if the contents contain Category:\n StringTrimLeft, title1, title1, 9 ; remove that from the contents\n StringReplace, title1, title1, |, `|, All ; escape all containing delimiters\n title1 := Dec_XML(UTF82Ansi(title1)) ; convert to ansi first and then decode html entities\n allTitles .= title1 . \"|\" ; add this title to list\n pos++ ; increment counter\n }\n rxp = cmcontinue=\"(.*?)\" ; set regular expression\n If RegExMatch(data, rxp, next) ; when found\n {\n doContinue = &cmcontinue=%next1% ; set continuation string to add to url\n Goto getFile ; go to function-internal subroutine to redownload and parse\n }\n StringTrimRight, allTitles, allTitles, 1 ; remove last delimiter from result\n Return allTitles ; return result\n}\n\n; function to convert html entities to ansi equivalents\nDec_XML(str)\n{\n Loop\n If RegexMatch(str, \"S)(&#(\\d+);)\", dec)\n StringReplace, str, str, %dec1%, % Chr(dec2), All\n Else If RegexMatch(str, \"Si)(&#x([\\da-f]+);)\", hex)\n StringReplace, str, str, %hex1%, % Chr(\"0x\" . hex2), All\n Else\n Break\n StringReplace, str, str, , %A_Space%, All\n StringReplace, str, str, ", \", All\n StringReplace, str, str, ', ', All\n StringReplace, str, str, <, <, All\n StringReplace, str, str, >, >, All\n StringReplace, str, str, &, &, All\n return, str\n}\n\n; function to uri-encode input string\nEnc_Uri(str)\n{\n f = %A_FormatInteger%\n SetFormat, Integer, Hex\n If RegExMatch(str, \"^\\w+:/{0,2}\", pr)\n StringTrimLeft, str, str, StrLen(pr)\n StringReplace, str, str, `%, `%25, All\n Loop\n If RegExMatch(str, \"i)[^\\w\\.~%/:]\", char)\n StringReplace, str, str, %char%, % \"%\" . SubStr(Asc(char),3), All\n Else Break\n SetFormat, Integer, %f%\n Return, pr . str\n}\n\n; function to convert unicode to ansi text\nUTF82Ansi(zString)\n{\n Ansi2Unicode(zString, wString, 65001)\n Unicode2Ansi(wString, sString, 0)\n Return sString\n}\n\n; helper function for unicode to ansi function\nAnsi2Unicode(ByRef sString, ByRef wString, CP = 0)\n{\n nSize := DllCall(\"MultiByteToWideChar\", \"Uint\", CP\n , \"Uint\", 0, \"Uint\", &sString, \"int\", -1\n , \"Uint\", 0, \"int\", 0)\n VarSetCapacity(wString, nSize * 2)\n DllCall(\"MultiByteToWideChar\"\n , \"Uint\", CP, \"Uint\", 0, \"Uint\", &sString, \"int\", -1\n , \"Uint\", &wString, \"int\", nSize)\n}\n\n; helper function for unicode to ansi function\nUnicode2Ansi(ByRef wString, ByRef sString, CP = 0)\n{\n nSize := DllCall(\"WideCharToMultiByte\"\n , \"Uint\", CP, \"Uint\", 0, \"Uint\", &wString, \"int\", -1\n , \"Uint\", 0, \"int\", 0, \"Uint\", 0, \"Uint\", 0)\n VarSetCapacity(sString, nSize)\n DllCall(\"WideCharToMultiByte\"\n , \"Uint\", CP, \"Uint\", 0, \"Uint\", &wString, \"int\", -1\n , \"str\", sString, \"int\", nSize, \"Uint\", 0, \"Uint\", 0)\n}\n\n; subroutine called when user closes the gui\nGuiClose:\n ExitApp ; exit the script\nReturn\n","language":"AutoHotkey"},{"code":" SYS \"LoadLibrary\", \"URLMON.DLL\" TO U%\n IF U% == 0 ERROR 100, \"DLL not available in your OS\"\n SYS \"GetProcAddress\", U%, \"URLDownloadToFileA\" TO U%\n\n Q$=CHR$34 : REM The quote\n BlkSize%=256 * 1024 : REM 256k must be enough\n DIM Blk% BlkSize% - 1 : REM Reserve memory block to load data into\n\n PROCFetchData(\"Programming_Tasks\")\n\n REM Count number of tasks and declare and populate Task$() array.\n P%=Blk%\n REPEAT\n I%=INSTR($$P%, \"title\")\n IF I% Tasks%+=1 : P%+=I%\n UNTIL I% == 0\n DIM Task$(Tasks%-1)\n P%=Blk%\n FOR I%=0 TO Tasks% - 1\n Task$(I%)=FNValue(P%, \"title\")\n NEXT\n\n PROCShowUnimplemented(\"BBC_BASIC\")\n PROCShowUnimplemented(\"C++\")\n END\n\n REM -------------------------------------------------------------------------\n REM Compare each task title against loaded language data in memory.\n DEF PROCShowUnimplemented(language$)\n LOCAL i%, j%, mem%, n%\n\n PROCFetchData(language$)\n mem%=Blk%\n PRINT \"Unimplemented tasks for the '\" language$ \"' programming language:\"\n FOR i%=0 TO Tasks% - 1\n j%=INSTR($$mem%, Task$(i%))\n IF j% THEN\n mem%+=j%\n ELSE\n n%+=1\n PRINT \" -\" Task$(i%)\n ENDIF\n NEXT\n PRINT \"Total is: \";n% '\n ENDPROC\n\n REM -------------------------------------------------------------------------\n REM Stitch the pages for this category together in the memory block.\n DEF PROCFetchData(category$)\n LOCAL mem%, continue$, e%, f%, tempfile$, url$\n\n tempfile$=@tmp$ + \"result.json\"\n mem%=Blk%\n REPEAT\n url$=\"http://www.rosettacode.org/w/api.php?\" +\\\n \\ \"action=query&list=categorymembers&cmtitle=Category:\" + category$ +\\\n \\ \"&cmlimit=500&format=json&cmcontinue=\" + continue$\n\n SYS U%, 0, url$, tempfile$, 0, 0 TO e% : REM Get one page to a file\n IF e% ERROR 100, \"Can't get data from Rosetta API\"\n\n f%=OPENINtempfile$ : e%=EXT#f% : CLOSE#f% : REM Get file size\n IF mem% - Blk% + e% > BlkSize% ERROR 100, \"Insufficient memory to load data\"\n OSCLI \"LOAD \" + tempfile$ + \" \" + STR$~mem% : REM Append to previous\n e%=mem% + e%\n ?e%=0 : REM Terminating 0x00\n continue$=FNValue(mem%, \"cmcontinue\") : REM Loaded page contains this name?\n mem%=e% : REM Advance memory pointer\n UNTIL continue$ == \"\"\n ENDPROC\n\n REM -------------------------------------------------------------------------\n REM Retrieve value for a JSON name from address p% and advance p% afterwards.\n DEF FNValue(RETURN p%, name$)\n LOCAL s%\n\n name$=Q$ + name$ + Q$ + \":\"\n s%=INSTR($$p%, name$)\n IF s% == 0 THEN =\"\"\n p%+=s% + LENname$\n =LEFT$($$p%, INSTR($$p%, Q$) - 1)\n","language":"BBC-BASIC"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text.RegularExpressions;\nusing System.Net;\n\nclass Program {\n static List<string> GetTitlesFromCategory(string category) {\n string searchQueryFormat = \"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:{0}&format=json{1}\";\n List<string> results = new List<string>();\n string cmcontinue = string.Empty;\n\n do {\n string cmContinueKeyValue;\n\n //append continue variable as needed\n if (cmcontinue.Length > 0)\n cmContinueKeyValue = String.Format(\"&cmcontinue={0}\", cmcontinue);\n else\n cmContinueKeyValue = String.Empty;\n\n //execute query\n string query = String.Format(searchQueryFormat, category, cmContinueKeyValue);\n string content = new WebClient().DownloadString(query);\n\n results.AddRange(new Regex(\"\\\"title\\\":\\\"(.+?)\\\"\").Matches(content).Cast<Match>().Select(x => x.Groups[1].Value));\n\n //detect if more results are available\n cmcontinue = Regex.Match(content, @\"{\"\"cmcontinue\"\":\"\"([^\"\"]+)\"\"}\", RegexOptions.IgnoreCase).Groups[\"1\"].Value;\n } while (cmcontinue.Length > 0);\n\n return results;\n }\n\n static string[] GetUnimplementedTasksFromLanguage(string language) {\n List<string> alltasks = GetTitlesFromCategory(\"Programming_Tasks\");\n List<string> lang = GetTitlesFromCategory(language);\n\n return alltasks.Where(x => !lang.Contains(x)).ToArray();\n }\n\n static void Main(string[] args) {\n string[] unimpl = GetUnimplementedTasksFromLanguage(args[0]);\n\n foreach (string i in unimpl) Console.WriteLine(i);\n }\n}\n","language":"C-sharp"},{"code":"(require\n '[clojure.xml :as xml]\n '[clojure.set :as set]\n '[clojure.string :as string])\n(import '[java.net URLEncoder])\n","language":"Clojure"},{"code":"(defn titles-cont [url]\n (let [docseq (-> url xml/parse xml-seq)]\n ((juxt #(filter string? %), #(-> (filter map? %) first :cmcontinue))\n (for [{:keys [tag attrs content]} docseq :when (#{:cm :query-continue} tag)]\n (if (= tag :cm)\n (attrs :title)\n (-> content first :attrs))))))\n","language":"Clojure"},{"code":"(defn urlencode [s] (URLEncoder/encode s \"UTF-8\"))\n(defn param [p v] (str p (urlencode v)))\n\n(defn get-titles\n ([category]\n (let [urlbase \"http://www.rosettacode.org/w/api.php\"\n params [\"action=query\"\n \"list=categorymembers\"\n \"format=xml\"\n \"cmlimit=200\"\n (param \"cmtitle=Category:\" category)]\n url (str urlbase \"?\" (string/join \"&\" params)]\n (get-titles url nil)))\n ([url continue-at]\n (let [continue-param (if continue-at (param \"&cmcontinue=\" continue-at))\n [titles continue] (titles-cont (str url continue-param))]\n (if continue\n (lazy-cat titles (get-titles url continue))\n titles))))\n","language":"Clojure"},{"code":"(defn unimplemented [lang-name]\n (let [title-set #(future (apply sorted-set (get-titles %)))\n all-titles (title-set \"Programming_Tasks\")\n lang-titles (title-set lang-name)]\n (seq (set/difference @all-titles @lang-titles))))\n\n(let [titles (unimplemented \"Clojure\")]\n (doseq [title titles] (println title))\n (println \"count: \" (count titles)))\n(shutdown-agents)\n","language":"Clojure"},{"code":"#!/usr/bin/env rune\n\n# NOTE: This program will not work in released E, because TermL is an\n# imperfect superset of JSON in that version: it does not accept \"\\/\".\n# If you build E from the latest source in SVN then it will work.\n#\n# Usage: rosettacode-cat-subtract.e [<syntaxhighlight lang=\"e\">]\n#\n# Prints a list of tasks which have not been completed in the language.\n# If unspecified, the default language is E.\n\npragma.syntax(\"0.9\")\npragma.enable(\"accumulator\")\n\ndef termParser := <import:org.quasiliteral.term.makeTermParser>\ndef jURLEncoder := <unsafe:java.net.makeURLEncoder>\n\ndef urlEncode(text) {\n return jURLEncoder.encode(text, \"UTF-8\")\n}\n\n/** Convert JSON-as-term-tree to the corresponding natural E data structures. */\ndef jsonTermToData(term) {\n switch (term) {\n\n # JSON object to E map\n match term`{@assocs*}` {\n return accum [].asMap() for term`@{key :String}: @valueJson` in assocs {\n _.with(key, jsonTermToData(valueJson))\n }\n }\n\n # JSON array to E list\n match term`[@elements*]` {\n return accum [] for elem in elements { _.with(jsonTermToData(elem)) }\n }\n\n # Literals just need to be coerced\n match lit :any[String, int, float64] {\n return lit\n }\n\n # Doesn't support true/false/null, but we don't need that for this application.\n }\n}\n\ndef fetchCategoryAccum(name, membersSoFar :Set, extraArgs) {\n stderr.println(`Fetching Category:$name $extraArgs...`)\n\n def categoryAPIResource := <http>[`//rosettacode.org/w/api.php?` +\n `action=query&list=categorymembers&cmtitle=Category:${urlEncode(name)}&` +\n `format=json&cmlimit=500&cmprop=title$extraArgs`]\n\n def members :=\n when (def responseJSON := categoryAPIResource <- getTwine()) -> {\n # stderr.println(`Fetched Category:$name $extraArgs, parsing...`)\n def response := jsonTermToData(termParser(responseJSON))\n\n # stderr.println(`Parsed Category:$name $extraArgs response, extracting data...`)\n def [\n \"query\" => [\"categorymembers\" => records],\n \"query-continue\" => continueData := null\n ] := response\n def members := accum membersSoFar for record in records { _.with(record[\"title\"]) }\n\n switch (continueData) {\n match ==null {\n stderr.println(`Got all ${members.size()} for Category:$name.`)\n members\n }\n match [\"categorymembers\" => [\"cmcontinue\" => continueParam]] {\n stderr.println(`Fetched ${members.size()} members for Category:$name...`)\n fetchCategoryAccum(name, members, `&cmcontinue=` + urlEncode(continueParam))\n }\n }\n } catch p { throw(p) }\n\n return members\n}\n\ndef fetchCategory(name) {\n return fetchCategoryAccum(name, [].asSet(), \"\")\n}\n\n# Interpret program arguments\ndef lang := switch (interp.getArgs()) {\n match [lang] { lang }\n match [] { \"E\" }\n}\n\n# Fetch categories\nwhen (def allTasks := fetchCategory(\"Programming_Tasks\"),\n def doneTasks := fetchCategory(lang),\n def omitTasks := fetchCategory(lang + \"/Omit\")\n ) -> {\n\n # Compute difference and report\n def notDoneTasks := allTasks &! (doneTasks | omitTasks)\n println()\n println(\"\\n\".rjoin(notDoneTasks.getElements().sort()))\n\n} catch p {\n # Whoops, something went wrong\n stderr.println(`$p${p.eStack()}`)\n}\n","language":"E"},{"code":"-module( find_unimplemented_tasks ).\n-include_lib( \"xmerl/include/xmerl.hrl\" ).\n\n-export( [init_http/0, per_language/1, rosetta_code_list_of/1] ).\n\ninit_http() ->\n\tapplication:start( inets ).\n\nper_language( Language ) ->\n\tok = init_http(),\n\tTasks = rosetta_code_list_of( \"Programming_Tasks\" ),\n\tUninplemented = Tasks -- rosetta_code_list_of( Language ),\n\tio:fwrite( \"Unimplemented total: ~p~n\", [erlang:length(Uninplemented)] ),\n\t[io:fwrite(\"~p~n\", [X]) || X <- Uninplemented].\n\nrosetta_code_list_of( Category ) ->\n\tURL = \"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmlimit=500&format=xml&cmtitle=Category:\"\n\t++ Category,\n\ttitle_contents( URL, \"\", [] ).\n\n\n\ntitle_contents( URL, Continue, Acc ) ->\n\t{ok, {{_HTTP,200,\"OK\"}, _Headers, Body}} = httpc:request( URL ++ Continue ),\n\t{XML, _} = xmerl_scan:string( Body ),\n\tNews = xml_selection( \"title\", XML ),\n\tNew_continue = title_contents_url_continue( xml_selection(\"cmcontinue\", XML) ),\n\ttitle_contents_continue( URL, New_continue, Acc ++ News ).\n\ntitle_contents_continue( _URL, \"\", Acc ) -> Acc;\ntitle_contents_continue( URL, Continue, Acc ) -> title_contents( URL, Continue, Acc ).\n\ntitle_contents_url_continue( [] ) -> \"\";\ntitle_contents_url_continue( [Continue | _] ) -> \"&cmcontinue=\" ++ Continue.\n\nxml_selection( Selection, XML ) ->\n\t[lists:map( fun xml_8211/1, X) || #xmlAttribute{value=X} <- xmerl_xpath:string(\"//@\" ++ Selection, XML)].\n\nxml_8211( 8211 ) -> $-;\nxml_8211( 924 ) -> $\\s;\nxml_8211( 1050 ) -> $\\s;\nxml_8211( 1052 ) -> $\\s;\nxml_8211( Character ) -> Character.\n","language":"Erlang"},{"code":"package main\n\nimport (\n \"encoding/xml\"\n \"fmt\"\n \"io\"\n \"net/http\"\n \"net/url\"\n)\n\nconst language = \"Go\"\n\nvar baseQuery = \"http://rosettacode.org/mw/api.php?action=query\" +\n \"&format=xml&list=categorymembers&cmlimit=100\"\n\nfunc req(u string, foundCm func(string)) string {\n resp, err := http.Get(u)\n if err != nil {\n fmt.Println(err) // connection or request fail\n return \"\"\n }\n defer resp.Body.Close()\n for p := xml.NewDecoder(resp.Body); ; {\n t, err := p.RawToken()\n switch s, ok := t.(xml.StartElement); {\n case err == io.EOF:\n return \"\"\n case err != nil:\n fmt.Println(err)\n return \"\"\n case !ok:\n continue\n case s.Name.Local == \"cm\":\n for _, a := range s.Attr {\n if a.Name.Local == \"title\" {\n foundCm(a.Value)\n }\n }\n case s.Name.Local == \"categorymembers\" && len(s.Attr) > 0 &&\n s.Attr[0].Name.Local == \"cmcontinue\":\n return url.QueryEscape(s.Attr[0].Value)\n }\n }\n return \"\"\n}\n\nfunc main() {\n // get language members, store in a map\n langMap := make(map[string]bool)\n storeLang := func(cm string) { langMap[cm] = true }\n languageQuery := baseQuery + \"&cmtitle=Category:\" + language\n continueAt := req(languageQuery, storeLang)\n for continueAt > \"\" {\n continueAt = req(languageQuery+\"&cmcontinue=\"+continueAt, storeLang)\n }\n\n // a quick check to avoid long output\n if len(langMap) == 0 {\n fmt.Println(\"no tasks implemented for\", language)\n return\n }\n\n // get tasks, print as we go along\n printUnImp := func(cm string) {\n if !langMap[cm] {\n fmt.Println(cm)\n }\n }\n taskQuery := baseQuery + \"&cmtitle=Category:Programming_Tasks\"\n continueAt = req(taskQuery, printUnImp)\n for continueAt > \"\" {\n continueAt = req(taskQuery+\"&cmcontinue=\"+continueAt, printUnImp)\n }\n}\n","language":"Go"},{"code":"import Network.Browser\nimport Network.HTTP\nimport Network.URI\nimport Data.List\nimport Data.Maybe\nimport Text.XML.Light\nimport Control.Arrow\nimport Data.Char\n\ngetRespons url = do\n rsp <- Network.Browser.browse $ do\n setAllowRedirects True\n setOutHandler $ const (return ()) -- quiet\n request $ getRequest url\n return $ rspBody $ snd rsp\n\nreplaceWithSpace c = (\\x -> if c==x then ' ' else x)\n\nencl = chr 34\n\nunimpTasks lang = do\n allTasks <- getRespons \"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\"\n impl <- getRespons ( \"http://rosettacode.org/json/isb/\" ++ lang ++ \".json\")\n let langxx = map (map(replaceWithSpace '_')) $ filter (/=\",\") $ words $ map (replaceWithSpace encl ) $ init $ drop 1 impl\n xml = onlyElems $ parseXML allTasks\n allxx = concatMap (map (fromJust.findAttr (unqual \"title\")). filterElementsName (== unqual \"cm\")) xml\n mapM_ putStrLn $ sort $ allxx \\\\ langxx\n","language":"Haskell"},{"code":"import Network.HTTP\nimport Data.Text (splitOn, pack, unpack)\nimport Data.List\n\ngetTasks :: String -> IO [String]\ngetTasks url = do\n resp <- simpleHTTP (getRequest url)\n body <- getResponseBody resp\n return $ tail $ map (unpack . head . splitOn (pack \"\\\"}\")) $ splitOn (pack \"\\\"title\\\":\\\"\") (pack body)\n\nmain :: String -> IO ()\nmain lang = do\n implTasks <- getTasks $ \"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:\" ++ lang ++ \"&format=json&cmlimit=500\"\n allTasks <- getTasks \"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&format=json&cmlimit=500\"\n mapM_ putStrLn $ allTasks \\\\ implTasks\n","language":"Haskell"},{"code":"$define RCINDEX \"http://rosettacode.org/mw/api.php?format=xml&action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500\"\n$define RCTASK \"http://rosettacode.org/mw/index.php?action=raw&title=\"\n$define RCUA \"User-Agent: Unicon Rosetta 0.1\"\n$define RCXUA \"X-Unicon: http://unicon.org/\"\n$define TASKTOT \"* Total Tasks *\"\n$define TOTTOT \"* Total Headers*\"\n\nlink strings\nlink hexcvt\n\nprocedure main(A) # simple single threaded read all at once implementation\n lang := \\A[1] | \"Unicon\"\n write(\"Unimplemented tasks for \",lang,\" as of \",&date)\n every task := taskNames() do {\n if lang == languages(task) then next\n write(task)\n }\nend\n\n# Generate task names\nprocedure taskNames()\n continue := \"\"\n while \\(txt := ReadURL(RCINDEX||continue)) do {\n txt ? {\n while tab(find(\"<cm \") & find(s :=\"title=\\\"\")+*s) do\n suspend tab(find(\"\\\"\"))\\1\n if tab(find(\"cmcontinue=\")) then {\n continue := \"&\"||tab(upto(' \\t'))\n }\n else break\n }\n }\nend\n\n# Generate language headers in a task\nprocedure languages(task)\n static WS\n initial WS := ' \\t'\n page := ReadURL(RCTASK||CleanURI(task))\n page ? while (tab(find(\"\\n==\")),tab(many(WS))|\"\",tab(find(\"{{\"))) do {\n header := tab(find(\"==\"))\n header ? {\n while tab(find(\"{{header|\")) do {\n suspend 2(=\"{{header|\",tab(find(\"}}\")))\\1\n }\n }\n }\nend\n\nprocedure CleanURI(u) #: clean up a URI\n static tr,dxml # xml & http translation\n initial {\n tr := table()\n every c := !string(~(&digits++&letters++'-_.!~*()/\\'`')) do\n tr[c] := \"%\"||hexstring(ord(c),2)\n every /tr[c := !string(&cset)] := c\n tr[\" \"] := \"_\" # wiki convention\n every push(dxml := [],\"&#\"||right(ord(c := !\"&<>'\\\"\"),3,\"0\")||\";\",c)\n }\n\n dxml[1] := u # insert URI as 1st arg\n u := replacem!dxml # de-xml it\n every (c := \"\") ||:= tr[!u] # reencode everything\n c := replace(c,\"%3E\",\"'\") # Hack to put single quotes back in\n c := replace(c,\"%26quot%3B\",\"\\\"\") # Hack to put double quotes back in\n return c\nend\n\nprocedure ReadURL(url) #: read URL into string\n page := open(url,\"m\",RCUA,RCXUA) | stop(\"Unable to open \",url)\n text := \"\"\n if page[\"Status-Code\"] < 300 then while text ||:= reads(page,-1)\n else write(&errout,image(url),\": \",\n page[\"Status-Code\"],\" \",page[\"Reason-Phrase\"])\n close(page)\n return text\nend\n","language":"Icon"},{"code":"require 'strings web/gethttp'\n\nfindUnimpTasks=: ('Programming_Tasks' -.&getCategoryMembers ,&'/Omit') ([ #~ -.@e.) getCategoryMembers\n\ngetTagContents=: dyad define\n 'starttag endtag'=. x\n ('\\' -.~ endtag&taketo)&.>@(starttag&E. <@((#starttag)&}.);.1 ]) y\n)\n\nNB. RosettaCode Utilities\nparseTitles=: ('\"title\":\"';'\"')&getTagContents\nparseCMcontinue=:('\"cmcontinue\":\"';'\"')&getTagContents\ngetCMcontquery=: ('&cmcontinue=' , urlencode)^:(0 < #)@>@parseCMcontinue\n\ngetCategoryMembers=: monad define\n buildqry=. 'action=query&list=categorymembers&cmtitle=Category:' , ,&'&cmlimit=500&format=json'\n url=.'http://www.rosettacode.org/w/api.php'\n uri=. url ,'?', buildqry urlencode y\n catmbrs=. qrycont=. ''\n whilst. #qrycont=. ,getCMcontquery jsondat do.\n jsondat=. '-sL' gethttp uri , qrycont\n catmbrs=. catmbrs, parseTitles jsondat\n end.\n catmbrs\n)\n","language":"J"},{"code":" 4{. findUnimpTasks 'J' NB. get first 4 unimplemented tasks for J\n┌────────────────┬────────────────────────┬──────────────────────────────────┬──────────────┐\n│15 puzzle solver│Active Directory/Connect│Active Directory/Search for a user│Atomic updates│\n└────────────────┴────────────────────────┴──────────────────────────────────┴──────────────┘\n","language":"J"},{"code":"(function (strXPath) {\n var xr = document.evaluate(\n strXPath,\n document,\n null, 0, 0\n ),\n\n oNode = xr.iterateNext(),\n lstTasks = [];\n\n while (oNode) {\n lstTasks.push(oNode.title);\n oNode = xr.iterateNext();\n }\n\n return [\n lstTasks.length + \" items found in \" + document.title,\n ''\n ].concat(lstTasks).join('\\n')\n\n})(\n '//*[@id=\"mw-content-text\"]/div[2]/table/tbody/tr/td/ul/li/a'\n);\n","language":"JavaScript"},{"code":"using HTTP, JSON\n\nconst baseuri = \"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:\"\nconst enduri = \"&cmlimit=500&format=json\"\nqueries(x) = baseuri * HTTP.Strings.escapehtml(x) * enduri\n\nfunction getimplemented(query)\n tasksdone = Vector{String}()\n request = query\n while (resp = HTTP.request(\"GET\", request)).status == 200\n fromjson = JSON.parse(String(resp.body))\n for d in fromjson[\"query\"][\"categorymembers\"]\n if haskey(d, \"title\")\n push!(tasksdone, d[\"title\"])\n end\n end\n if haskey(fromjson, \"continue\")\n cmcont, cont = fromjson[\"continue\"][\"cmcontinue\"], fromjson[\"continue\"][\"continue\"]\n request = query * \"&cmcontinue=$cmcont&continue=$cont\"\n else\n break\n end\n end\n tasksdone\nend\n\nalltasks = getimplemented(queries(\"Programming_Tasks\"))\n\nshowunimp(x) = (println(\"\\nUnimplemented in $x:\"); for t in setdiff(alltasks,\n getimplemented(queries(x))) println(t) end)\n\nshowunimp(\"Julia\")\nshowunimp(\"C++\")\n","language":"Julia"},{"code":"local requests = require('requests')\nlocal lang = arg[1]\n\nlocal function merge_tables(existing, from_req)\n local result = existing\n\n for _, v in ipairs(from_req) do\n result[v.title] = true\n end\n\n return result\nend\n\nlocal function get_task_list(category)\n local url = 'http://www.rosettacode.org/mw/api.php'\n local query = {\n action = 'query',\n list = 'categorymembers',\n cmtitle = string.format('Category:%s', category),\n cmlimit = 500,\n cmtype = 'page',\n format = 'json'\n }\n local categories = {}\n\n while true do\n local resp = assert(requests.get({ url, params = query }).json())\n\n categories = merge_tables(categories, resp.query.categorymembers)\n\n if resp.continue then\n query.cmcontinue = resp.continue.cmcontinue\n else\n break\n end\n end\n\n return categories\nend\n\nlocal function get_open_tasks(lang)\n if not lang then error('Language missing!') end\n local all_tasks = get_task_list('Programming_Tasks')\n local lang_tasks = get_task_list(lang)\n local task_list = {}\n\n for t, _ in pairs(all_tasks) do\n if not lang_tasks[t] then\n table.insert(task_list, t)\n end\n end\n\n table.sort(task_list)\n return task_list\nend\n\nlocal open_tasks = get_open_tasks(lang)\n\nio.write(string.format('%s has %d unimplemented programming tasks: \\n', lang, #open_tasks))\nfor _, t in ipairs(open_tasks) do\n io.write(string.format(' %s\\n', t))\nend\n","language":"Lua"},{"code":"#Example with the Maple Language\nlan := \"Maple\":\nx := URL:-Get(cat(\"http://rosettacode.org/wiki/Reports:Tasks_not_implemented_in_\", StringTools:-SubstituteAll(lan, \" \", \"_\")), output = content):\nx := StringTools:-StringSplit(x, \"<h2><span class=\\\"mw-headline\\\" id=\\\"Not_implemented\\\">Not implemented</span>\")[2]:\nx := StringTools:-StringSplit(x, \"<span class=\\\"mw-headline\\\" id=\\\"Draft_tasks_without_implementation\\\">Draft tasks without implementation</span>\")[1]:\nx := StringTools:-StringSplit(x,\"<li><a href=\\\"/wiki/\")[2..]:\nfor problem in x do\n\tprintf(\"%s\\n\", StringTools:-SubstituteAll(StringTools:-Decode(StringTools:-StringSplit(problem, \"\\\" title=\")[1], 'percent'), \"_\", \" \"));\nend do:\n","language":"Maple"},{"code":"ClearAll[ImportAll]\nImportAll[lang_String] :=\n Module[{data, continue, cmcontinue, extra, xml, next},\n data = {};\n continue = True;\n cmcontinue = \"\";\n While[continue,\n extra = If[cmcontinue =!= \"\", \"&cmcontinue=\" <> cmcontinue, \"\"];\n xml = Import[\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:\" <> lang <> \"&cmlimit=500&format=xml\" <> extra, \"XML\"];\n AppendTo[data, Cases[xml, XMLElement[\"cm\", _, {}], \\[Infinity]]];\n next = Flatten[Cases[xml, {\"cmcontinue\" -> _}, \\[Infinity]]];\n If[Length[next] > 0,\n next = First[next];\n cmcontinue = \"cmcontinue\" /. next;\n ,\n continue = False;\n ];\n ];\n Cases[Flatten[data], HoldPattern[\"title\" -> x_] :> x, \\[Infinity]]\n ]\nComplement[ImportAll[\"Programming_Tasks\"], ImportAll[\"Mathematica\"]]\n","language":"Mathematica"},{"code":"url = \"http://rosettacode.org/wiki/Reports:Tasks_not_implemented_in_Mathematica\";\nhtml = Import[url, \"XMLObject\"];\npos = Position[html, XMLElement[\"div\", {\"class\" -> \"mw-content-ltr\", \"dir\" -> \"ltr\", \"lang\" -> \"en\"}, ___]];\npos = First[pos];\ndata = Extract[html, pos];\npos = Position[data, XMLElement[\"li\", {}, {XMLElement[\"a\", {\"shape\" -> \"rect\", \"href\" -> _, \"title\" -> x_}, {x_}]}]];\ndata = Extract[data, pos];\ndata = data[[All, -1, -1, 2]];\ndata = {\"title\", \"href\"} /. # & /@ %;\ndata[[All, 2]] = \"http://rosettacode.org\" <> # & /@ data[[All, 2]];\nnewb = data[[All, 1]];\ndata = Hyperlink @@@ data;\ndata // Column\n","language":"Mathematica"},{"code":"import httpclient, strutils, xmltree, xmlparser, cgi, os\n\n\nproc findrc(category: string): seq[string] =\n\n var\n name = \"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:$#&cmlimit=500&format=xml\" % encodeUrl(category)\n cmcontinue = \"\"\n client = newHttpClient()\n\n while true:\n var x = client.getContent(name & cmcontinue).parseXml()\n for node in x.findAll(\"cm\"):\n result.add node.attr(\"title\")\n\n cmcontinue.setLen(0)\n for node in x.findAll(\"continue\"):\n let u = node.attr(\"cmcontinue\")\n if u.len != 0: cmcontinue = u.encodeUrl()\n\n if cmcontinue.len > 0: cmcontinue = \"&cmcontinue=\" & cmcontinue\n else: break\n\n\nproc chooselang(): string =\n if paramCount() < 1: \"Nim\" else: paramStr(1)\n\n\nlet alltasks = findrc(\"Programming_Tasks\")\nlet lang = chooselang()\nlet langTasks = lang.findrc()\necho \"Unimplemented tasks for language \", lang, ':'\nfor task in alltasks:\n if task notin langTasks:\n echo \" \", task\n","language":"Nim"},{"code":"declare\n [HTTPClient] = {Link ['x-ozlib://mesaros/net/HTTPClient.ozf']}\n [XMLParser] = {Link ['x-oz://system/xml/Parser.ozf']}\n\n fun {FindUnimplementedTasks Language}\n AllTasks = {FindCategory \"Programming Tasks\"}\n LangTasks = {FindCategory Language}\n in\n {ListDiff AllTasks LangTasks}\n end\n\n fun {FindCategory Cat}\n CatUrl = \"http://www.rosettacode.org/mw/api.php?action=query\"\n #\"&list=categorymembers\"\n #\"&cmtitle=Category:\"#{PercentEncode Cat}\n #\"&cmlimit=500&format=xml\"\n\n fun {Loop CMContinue}\n [_ Doc] = {Parse {GetPage CatUrl#CMContinue}}\n Titles = {XPath Doc\n [api query categorymembers cm {Attribute title}]}\n in\n case {XPath Doc\n [api 'query-continue' categorymembers {Attribute cmcontinue}]}\n of nil then Titles\n [] [NewCMContinueAtom] then\n NewCMContinue = {PercentEncode {Atom.toString NewCMContinueAtom}}\n in\n {Append Titles\n {Loop \"&cmcontinue=\"#NewCMContinue}}\n end\n end\n in\n {Loop nil}\n end\n\n\n %% XPath emulation\n fun {XPath Doc Path}\n P|Pr = Path\n in\n Doc.name = P %% assert\n {FoldL Pr XPathStep [Doc]}\n end\n\n Nothing = {NewName}\n fun {NotNothing X} X \\= Nothing end\n\n fun {XPathStep Elements P}\n if {Atom.is P} then\n {FilteredChildren Elements P}\n elseif {Procedure.is P} then\n {Filter {Map Elements P} NotNothing}\n end\n end\n\n %% A flat list of all Type-children of all Elements.\n fun {FilteredChildren Elements Type}\n {Flatten\n {Map Elements\n fun {$ E}\n {Filter E.children\n fun {$ X}\n case X of element(name:!Type ...) then true\n else false\n end\n end}\n end}}\n end\n\n fun {Attribute Attr}\n fun {$ Element}\n case {Filter Element.attributes fun {$ A} A.name == Attr end}\n of [A] then A.value\n else Nothing\n end\n end\n end\n\n\n %% GetPage\n Client = {New HTTPClient.urlGET init(inPrms(toFile:false toStrm:true) _)}\n fun {GetPage RawUrl}\n Url = {VirtualString.toString RawUrl}\n OutParams\n in\n {Client getService(Url ?OutParams ?_)}\n OutParams.sOut\n end\n\n fun {PercentEncode Xs}\n case Xs of nil then nil\n [] X|Xr then\n if {Char.isDigit X} orelse {Member X [&- &_ &. &~]}\n orelse X >= &a andthen X =< &z\n orelse X >= &z andthen X =< &Z then\n X|{PercentEncode Xr}\n else\n {Append &%|{ToHex2 X} {PercentEncode Xr}}\n end\n end\n end\n\n fun {ToHex2 X}\n [{ToHex1 X div 16} {ToHex1 X mod 16}]\n end\n\n fun {ToHex1 X}\n if X >= 0 andthen X =< 9 then &0 + X\n elseif X >= 10 andthen X =< 15 then &A + X - 10\n end\n end\n\n\n %% Parse\n local\n Parser = {New XMLParser.parser init}\n in\n fun {Parse Xs} {Parser parseVS(Xs $)} end\n end\n\n fun {ListDiff Xs Ys}\n {FoldL Ys List.subtract Xs}\n end\nin\n %% show tasks not implemented in Oz\n {ForAll {FindUnimplementedTasks \"Oz\"} System.showInfo}\n","language":"Oz"},{"code":"use LWP::UserAgent;\n\nmy $ua = LWP::UserAgent->new;\n$ua->agent('');\n\nsub enc { join '', map {sprintf '%%%02x', ord} split //, shift }\nsub get { $ua->request( HTTP::Request->new( GET => shift))->content }\n\nsub tasks {\n my($category) = shift;\n my $fmt = 'http://www.rosettacode.org/w/api.php?' .\n 'action=query&generator=categorymembers&gcmtitle=Category:%s&gcmlimit=500&format=json&rawcontinue=';\n my @tasks;\n my $json = get(sprintf $fmt, $category);\n while (1) {\n push @tasks, $json =~ /\"title\":\"(.+?)\"\\}/g;\n $json =~ /\"gcmcontinue\":\"(.+?)\"\\}/ or last;\n $json = get(sprintf $fmt . '&gcmcontinue=%s', $category, enc $1);\n }\n @tasks;\n}\n\nmy %language = map {$_, 1} tasks shift || 'perl';\n$language{$_} or print \"$_\\n\" foreach tasks('Programming_Tasks'), tasks('Draft_Programming_Tasks');\n","language":"Perl"},{"code":"(notonline)-->\n <span style=\"color: #000080;font-style:italic;\">-- demo\\rosetta\\Find_unimplemented_tasks.exw</span>\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- (libcurl, file i/o, peek, progress..)</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">language</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"Phix\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000080;font-style:italic;\">-- language = \"Go\",\n -- language = \"Julia\",\n -- language = \"Python\",\n -- language = \"Wren\",</span>\n <span style=\"color: #000000;\">base_query</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"http://rosettacode.org/mw/api.php?action=query\"</span><span style=\"color: #0000FF;\">&</span>\n <span style=\"color: #008000;\">\"&format=xml&list=categorymembers&cmlimit=100\"</span>\n\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">builtins</span><span style=\"color: #0000FF;\">\\</span><span style=\"color: #000000;\">libcurl</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">curl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">NULL</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">pErrorBuffer</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">builtins</span><span style=\"color: #0000FF;\">\\</span><span style=\"color: #000000;\">xml</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">req</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">url</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">rid</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">NULL</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">curl_global_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">curl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">curl_easy_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">pErrorBuffer</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">allocate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">CURL_ERROR_SIZE</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">curl_easy_setopt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">CURLOPT_ERRORBUFFER</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pErrorBuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">curl_easy_setopt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">CURLOPT_URL</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">url</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">curl_easy_perform_ex</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curl</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #004080;\">integer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">error</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%d [%s]\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">peek_string</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pErrorBuffer</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Download error: %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">error</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #004080;\">string</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">xml</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">xml_parse</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)[</span><span style=\"color: #000000;\">XML_CONTENTS</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">xml_get_nodes</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">xml</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"continue\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">=={}?</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">xml_get_attribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #008000;\">\"cmcontinue\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">xml</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">xml_get_nodes</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">xml</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"query\"</span><span style=\"color: #0000FF;\">)[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">xml</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">xml_get_nodes</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">xml</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"categorymembers\"</span><span style=\"color: #0000FF;\">)[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">xml</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">xml_get_nodes</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">xml</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"cm\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">xml</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">call_proc</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rid</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">xml_get_attribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">xml</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #008000;\">\"title\"</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">html_clean</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`"`</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`\"`</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`'`</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`'`</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\xE2\\x80\\x99\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"'\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\xC3\\xB6\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"o\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%3A\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\":\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%E2%80%93\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"-\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%E2%80%99\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"'\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%27\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"'\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%2B\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"+\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%C3%A8\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"e\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%C3%A9\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"e\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%C3%B6\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"o\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%C5%91\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"o\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%22\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`\"`</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%2A\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"*\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">ri</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">titles</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">store_title</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">title</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">titles</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">titles</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">title</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">unimplemented_count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">task_count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">print_unimplemented</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">title</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">title</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">titles</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">title</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">html_clean</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">title</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">title</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">unimplemented_count</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">task_count</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Loading implemented tasks list...\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- get and store task itles</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">lang_query</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">base_query</span> <span style=\"color: #0000FF;\">&</span> <span style=\"color: #008000;\">\"&cmtitle=Category:\"</span> <span style=\"color: #0000FF;\">&</span> <span style=\"color: #000000;\">language</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">continue_at</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">req</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lang_query</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">store_title</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">continue_at</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #008000;\">\"\"</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">continue_at</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">req</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lang_query</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\"&cmcontinue=\"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">continue_at</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">store_title</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- a quick check to avoid long output</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">titles</span><span style=\"color: #0000FF;\">)==</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"no tasks implemented for %s\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">language</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">return</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- get tasks, print as we go along</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Tasks:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">task_query</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">base_query</span> <span style=\"color: #0000FF;\">&</span> <span style=\"color: #008000;\">\"&cmtitle=Category:Programming_Tasks\"</span>\n <span style=\"color: #000000;\">continue_at</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">req</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">task_query</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">print_unimplemented</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">continue_at</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #008000;\">\"\"</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">continue_at</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">req</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">task_query</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\"&cmcontinue=\"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">continue_at</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">print_unimplemented</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%d unimplemented tasks found for %s.\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">unimplemented_count</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">language</span><span style=\"color: #0000FF;\">})</span>\n\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">full_tasks</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">unimplemented_count</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Draft tasks:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">task_query</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">base_query</span> <span style=\"color: #0000FF;\">&</span> <span style=\"color: #008000;\">\"&cmtitle=Category:Draft_Programming_Tasks\"</span>\n <span style=\"color: #000000;\">continue_at</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">req</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">task_query</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">print_unimplemented</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">continue_at</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #008000;\">\"\"</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">continue_at</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">req</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">task_query</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\"&cmcontinue=\"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">continue_at</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">print_unimplemented</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">draft_tasks</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">unimplemented_count</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">full_tasks</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%d unimplemented draft tasks found for %s.\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">draft_tasks</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">language</span><span style=\"color: #0000FF;\">})</span>\n\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%d unimplemented tasks in total found for %s (out of %d).\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">unimplemented_count</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">language</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">task_count</span><span style=\"color: #0000FF;\">})</span>\n\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n<!--\n","language":"Phix"},{"code":"(load \"@lib/http.l\" \"@lib/xm.l\")\n\n(de rosettaCategory (Cat)\n (let (Cont NIL Xml)\n (make\n (loop\n (client \"rosettacode.org\" 80\n (pack\n \"mw/api.php?action=query&list=categorymembers&cmtitle=Category:\"\n Cat\n \"&cmlimit=200&format=xml\"\n Cont )\n (while (line))\n (setq Xml (and (xml?) (xml))) )\n (NIL Xml)\n (for M (body Xml 'query 'categorymembers)\n (link (attr M 'title)) )\n (NIL (attr Xml 'query-continue' categorymembers 'cmcontinue))\n (setq Cont (pack \"&cmcontinue=\" @)) ) ) ) )\n\n(de unimplemented (Task)\n (diff\n (rosettaCategory \"Programming_Tasks\")\n (rosettaCategory Task) ) )\n","language":"PicoLisp"},{"code":"function Find-UnimplementedTask\n{\n [CmdletBinding()]\n [OutputType([string[]])]\n Param\n (\n [Parameter(Mandatory=$true,\n Position=0)]\n [string]\n $Language\n )\n\n $url = \"http://rosettacode.org/wiki/Reports:Tasks_not_implemented_in_$Language\"\n $web = Invoke-WebRequest $url\n $unimplemented = 1\n\n [string[]](($web.AllElements |\n Where-Object {$_.class -eq \"mw-content-ltr\"})[$unimplemented].outerText -split \"`r`n\" |\n Select-String -Pattern \"[^0-9A-Z]$\" -CaseSensitive)\n}\n","language":"PowerShell"},{"code":"$tasks = Find-UnimplementedTask -Language PowerShell\n\n$tasks[0..5],\".`n.`n.\",$tasks[-6..-1]\nWrite-Host \"`nTotal unimplemented Tasks: $($tasks.Count)\"\n","language":"PowerShell"},{"code":"\"\"\"\nGiven the name of a language on Rosetta Code,\nfinds all tasks which are not implemented in that language.\n\"\"\"\nfrom operator import attrgetter\nfrom typing import Iterator\n\nimport mwclient\n\nURL = 'www.rosettacode.org'\nAPI_PATH = '/mw/'\n\n\ndef unimplemented_tasks(language: str,\n *,\n url: str,\n api_path: str) -> Iterator[str]:\n \"\"\"Yields all unimplemented tasks for a specified language\"\"\"\n site = mwclient.Site(url, path=api_path)\n all_tasks = site.categories['Programming Tasks']\n language_tasks = site.categories[language]\n name = attrgetter('name')\n all_tasks_names = map(name, all_tasks)\n language_tasks_names = set(map(name, language_tasks))\n for task in all_tasks_names:\n if task not in language_tasks_names:\n yield task\n\n\nif __name__ == '__main__':\n tasks = unimplemented_tasks('Python', url=URL, api_path=API_PATH)\n print(*tasks, sep='\\n')\n","language":"Python"},{"code":"\"\"\"\nGiven the name of a language on Rosetta Code,\nfinds all tasks which are not implemented in that language.\n\"\"\"\nfrom functools import partial\nfrom operator import itemgetter\nfrom typing import (Dict,\n Iterator,\n Union)\n\nimport requests\n\nURL = 'http://www.rosettacode.org/mw/api.php'\nREQUEST_PARAMETERS = dict(action='query',\n list='categorymembers',\n cmlimit=500,\n rawcontinue=True,\n format='json')\n\n\ndef unimplemented_tasks(language: str,\n *,\n url: str,\n request_params: Dict[str, Union[str, int, bool]]\n ) -> Iterator[str]:\n \"\"\"Yields all unimplemented tasks for a specified language\"\"\"\n with requests.Session() as session:\n tasks = partial(tasks_titles,\n session=session,\n url=url,\n **request_params)\n all_tasks = tasks(cmtitle='Category:Programming_Tasks')\n language_tasks = set(tasks(cmtitle=f'Category:{language}'))\n for task in all_tasks:\n if task not in language_tasks:\n yield task\n\n\ndef tasks_titles(*,\n session: requests.Session,\n url: str,\n **params: Union[str, int, bool]) -> Iterator[str]:\n \"\"\"Yields tasks names for a specified category\"\"\"\n while True:\n request = session.get(url, params=params)\n data = request.json()\n yield from map(itemgetter('title'), data['query']['categorymembers'])\n query_continue = data.get('query-continue')\n if query_continue is None:\n return\n params.update(query_continue['categorymembers'])\n\n\nif __name__ == '__main__':\n tasks = unimplemented_tasks('Python',\n url=URL,\n request_params=REQUEST_PARAMETERS)\n print(*tasks, sep='\\n')\n","language":"Python"},{"code":"import xml.dom.minidom\nimport urllib, sys\n\ndef findrc(category):\n name = \"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:%s&cmlimit=500&format=xml\" % urllib.quote(category)\n cmcontinue, titles = '', []\n while True:\n u = urllib.urlopen(name + cmcontinue)\n xmldata = u.read()\n u.close()\n x = xml.dom.minidom.parseString(xmldata)\n titles += [i.getAttribute(\"title\") for i in x.getElementsByTagName(\"cm\")]\n cmcontinue = filter( None,\n (urllib.quote(i.getAttribute(\"cmcontinue\"))\n for i in x.getElementsByTagName(\"categorymembers\")) )\n if cmcontinue:\n cmcontinue = '&cmcontinue=' + cmcontinue[0]\n else:\n break\n return titles\n\nalltasks = findrc(\"Programming_Tasks\")\nlang = findrc(sys.argv[1])\n\nfor i in [i for i in alltasks if i not in lang]:\n print i\n","language":"Python"},{"code":"#Aamrun, 3rd February 2023\n\nimport xml.dom.minidom\nimport sys, urllib.parse, urllib.request\n\ndef findrc(category):\n name = \"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:%s&cmlimit=500&format=xml\" % urllib.parse.quote(category)\n cmcontinue, titles = '', []\n while True:\n u = urllib.request.urlopen(name + cmcontinue)\n xmldata = u.read()\n u.close()\n x = xml.dom.minidom.parseString(xmldata)\n titles += [i.getAttribute(\"title\") for i in x.getElementsByTagName(\"cm\")]\n cmcontinue = list(filter( None,\n (urllib.parse.quote(i.getAttribute(\"cmcontinue\"))\n for i in x.getElementsByTagName(\"categorymembers\")) ))\n if cmcontinue:\n cmcontinue = '&cmcontinue=' + cmcontinue[0]\n else:\n break\n return titles\n\nalltasks = findrc(\"Programming_Tasks\")\nlang = findrc(sys.argv[1])\n\nfor i in [i for i in alltasks if i not in lang]:\n print(i)\n","language":"Python"},{"code":"library(XML)\nfind.unimplemented.tasks <- function(lang=\"R\"){\n\tPT <- xmlInternalTreeParse( paste(\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\",sep=\"\") )\n\tPT.nodes <- getNodeSet(PT,\"//cm\")\n\tPT.titles = as.character( sapply(PT.nodes, xmlGetAttr, \"title\") )\n\tlanguage <- xmlInternalTreeParse( paste(\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:\",\n\tlang, \"&cmlimit=500&format=xml\",sep=\"\") )\n\tlang.nodes <- getNodeSet(language,\"//cm\")\n\tlang.titles = as.character( sapply(lang.nodes, xmlGetAttr, \"title\") )\n\tunimplemented <- setdiff(PT.titles, lang.titles)\n\tunimplemented\n}\n# Usage\nfind.unimplemented.tasks(lang=\"Python\")\nlangs <- c(\"R\",\"python\",\"perl\")\nsapply(langs, find.unimplemented.tasks) # fetching data for multiple languages\n","language":"R"},{"code":"#lang racket\n\n(require net/url net/uri-codec json (only-in racket/dict [dict-ref ref]))\n\n(define (RC-get verb params)\n ((compose1 get-pure-port string->url format)\n \"http://rosettacode.org/mw/~a.php?~a\" verb (alist->form-urlencoded params)))\n\n(define (get-category catname)\n (let loop ([c #f])\n (define t\n ((compose1 read-json RC-get) 'api\n `([action . \"query\"] [format . \"json\"]\n [list . \"categorymembers\"] [cmtitle . ,(format \"Category:~a\" catname)]\n [cmcontinue . ,(and c (ref c 'cmcontinue))] [cmlimit . \"500\"])))\n (define (c-m key) (ref (ref t key '()) 'categorymembers #f))\n (append (for/list ([page (c-m 'query)]) (ref page 'title))\n (cond [(c-m 'query-continue) => loop] [else '()]))))\n\n;; The above is the required \"library\" code, same as the \"Rosetta\n;; Code/Count\" entry\n\n(define (show-unimplemented lang)\n (for-each displayln (remove* (get-category lang)\n (get-category 'Programming_Tasks))))\n\n(show-unimplemented 'Racket) ; see all of the Racket entries\n","language":"Racket"},{"code":"use HTTP::UserAgent;\nuse URI::Escape;\nuse JSON::Fast;\nuse Sort::Naturally;\n\nunit sub MAIN( Str :$lang = 'Raku' );\n\nmy $client = HTTP::UserAgent.new;\nmy $url = 'https://rosettacode.org/w';\n\nmy @total;\nmy @impl;\n\n@total.append: .&get-cat for 'Programming_Tasks', 'Draft_Programming_Tasks';\n@impl = get-cat $lang;\n\nsay \"Unimplemented tasks in $lang:\";\nmy @unimplemented = (@total (-) @impl).keys.sort: *.&naturally;\n.say for @unimplemented;\nsay \"{+@unimplemented} unimplemented tasks\";\n\nsub get-cat ($category) {\n flat mediawiki-query(\n $url, 'pages',\n :generator<categorymembers>,\n :gcmtitle(\"Category:$category\"),\n :gcmlimit<350>,\n :rawcontinue(),\n :prop<title>\n ).map({ .<title> });\n}\n\nsub mediawiki-query ($site, $type, *%query) {\n my $url = \"$site/api.php?\" ~ uri-query-string(\n :action<query>, :format<json>, :formatversion<2>, |%query);\n my $continue = '';\n\n gather loop {\n my $response = $client.get(\"$url&$continue\");\n my $data = from-json($response.content);\n take $_ for $data.<query>.{$type}.values;\n $continue = uri-query-string |($data.<query-continue>{*}».hash.hash or last);\n }\n}\n\nsub uri-query-string (*%fields) { %fields.map({ \"{.key}={uri-escape .value}\" }).join(\"&\") }\n","language":"Raku"},{"code":"# Project: Rosetta Code/Find unimplemented tasks\n\nload \"stdlib.ring\"\nros= download(\"http://rosettacode.org/wiki/Category:Programming_Tasks\")\nlang = \"Ring\"\npos = 1\nnum = 0\ntotalros = 0\nrosname = \"\"\nrostitle = \"\"\nsee \"Tasks not implemented in \" + lang + \" language:\" + nl\nfor n = 1 to len(ros)\n nr = searchstring(ros,'<li><a href=\"/wiki/',pos)\n if nr = 0\n exit\n else\n pos = nr + 1\n ok\n nr = searchname(nr)\n nr = searchtitle(nr)\nnext\nsee nl\nsee \"Total: \" + totalros + \" examples.\" + nl\n\nfunc searchstring(str,substr,n)\n newstr=right(str,len(str)-n+1)\n nr = substr(newstr, substr)\n if nr = 0\n return 0\n else\n return n + nr -1\n ok\n\nfunc searchname(sn)\n nr2 = searchstring(ros,'\">',sn)\n nr3 = searchstring(ros,\"</a></li>\",sn)\n rosname = substr(ros,nr2+2,nr3-nr2-2)\n return sn\n\nfunc searchtitle(sn)\n st = searchstring(ros,\"title=\",sn)\n rostitle = substr(ros,sn+19,st-sn-21)\n rostitle = \"rosettacode.org/wiki/\" + rostitle\n rostitle = download(rostitle)\n s = substr(rostitle,lang)\n if s = 0\n num = num + 1\n totalros = totalros + 1\n see \"\" + num + \". \" + rosname + nl\n ok\n return sn\n\nfunc count(cstring,dstring)\n sum = 0\n while substr(cstring,dstring) > 0\n sum = sum + 1\n cstring = substr(cstring,substr(cstring,dstring)+len(string(sum)))\n end\n return sum\n","language":"Ring"},{"code":"require 'rosettacode'\nrequire 'time'\n\nmodule RosettaCode\n def self.get_unimplemented(lang)\n programming_tasks = []\n category_members(\"Programming_Tasks\") {|task| programming_tasks << task}\n\n lang_tasks = []\n category_members(lang) {|task| lang_tasks << task}\n\n lang_tasks_omit = []\n category_members(\"#{lang}/Omit\") {|task| lang_tasks_omit << task}\n\n [programming_tasks - lang_tasks, lang_tasks_omit]\n end\n\n def self.created_time(title)\n url = get_api_url({\n \"action\" => \"query\",\n \"titles\" => title,\n \"format\" => \"xml\",\n \"rvlimit\" => 500,\n \"prop\" => \"revisions\",\n \"rvprop\" => \"timestamp\"\n })\n doc = REXML::Document.new open(url)\n REXML::XPath.each(doc, \"//rev\").collect do |node|\n Time.parse( node.attribute(\"timestamp\").value )\n end.min\n end\n\nend\n\nputs Time.now\nlang = ARGV[0] || \"Ruby\"\nunimplemented, omitted = RosettaCode.get_unimplemented(lang)\nunimplemented.collect {|title| [title, RosettaCode.created_time(title)]} .\n sort_by {|e| e[1]} .\n each do |title, date|\n puts \"%s %6s %s\" % [\n date.strftime(\"%Y-%m-%d\"),\n omitted.include?(title) ? \"[omit]\" : \"\" ,\n title\n ]\n end\n","language":"Ruby"},{"code":"WordWrap$ = \"style='white-space: pre-wrap;white-space: -moz-pre-wrap;white-space: -pre-wrap;white-space: -o-pre-wrap;word-wrap: break-word'\"\na$\t= httpGet$(\"http://rosettacode.org/wiki/Category:Programming_Languages\")\na$\t= word$(a$,2,\"mw-subcategories\")\na$\t= word$(a$,1,\"</table>\")\ni\t= instr(a$,\"/wiki/Category:\")\nhtml \"<B> Select language from list<BR>\"\nhtml \"<SELECT name='lang'>\"\nwhile i <> 0\n j\t= instr(a$,\"\"\" title=\"\"Category:\",i)\n lang$\t= mid$(a$,i+15,j-i-15)\n k\t= instr(a$,\"\"\">\",j + 18)\n langName$ = mid$(a$,j + 18,k-(j+18))\n count\t= count + 1\n html \"<option value='\";lang$;\"'>\";langName$;\"</option>\"\n i\t= instr(a$,\"/wiki/Category:\",k)\nwend\nhtml \"</select>\"\nhtml \"<p>Number of Languages:\";count;\"<BR> \"\nbutton #go,\"GO\", [go]\nhtml \" \"\nbutton #ex, \"Exit\", [exit]\nwait\n\n[go]\ncls\nlang$\t= #request get$(\"lang\")\nh$\t= \"http://rosettacode.org/wiki/Reports:Tasks_not_implemented_in_\";lang$\na$\t= httpGet$(h$)\na$\t= word$(a$,3,\"mw-content-ltr\")\nhtml \"<table border=1><tr>\"\ni\t= instr(a$,\"<a href=\"\"/wiki/\")\nwhile i > 0\n i\t= instr(a$,\"title=\"\"\",i)\n j\t= instr(a$,\"\"\">\",i+7)\n if c mod 4\t= 0 then html \"</tr><tr \";WordWrap$;\">\"\n c\t= c + 1\n html \"<td>\";mid$(a$,i+7,j-(i+7));\"</td>\"\n i\t= instr(a$,\"<a href=\"\"/wiki/\",i+7)\nwend\nhtml \"</tr></table>\"\nprint \"Total unImplemented Tasks:\";c\n[exit]\nend\n","language":"Run-BASIC"},{"code":"use std::collections::{BTreeMap, HashSet};\n\nuse reqwest::Url;\nuse serde::Deserialize;\nuse serde_json::Value;\n\n/// A Rosetta Code task.\n#[derive(Clone, PartialEq, Eq, Hash, Debug, Deserialize)]\npub struct Task {\n /// The ID of the page containing the task in the MediaWiki API.\n #[serde(rename = \"pageid\")]\n pub id: u64,\n\n /// The human-readable title of the task.\n pub title: String,\n}\n\n/// Encapsulates errors that might occur during JSON parsing.\n#[derive(Debug)]\nenum TaskParseError {\n /// Something went wrong with the HTTP request to the API.\n Http(reqwest::Error),\n\n /// There was a problem parsing the API response into JSON.\n Json(serde_json::Error),\n\n /// The response JSON contained unexpected keys or values.\n UnexpectedFormat,\n}\n\nimpl From<serde_json::Error> for TaskParseError {\n fn from(err: serde_json::Error) -> Self {\n TaskParseError::Json(err)\n }\n}\n\nimpl From<reqwest::Error> for TaskParseError {\n fn from(err: reqwest::Error) -> Self {\n TaskParseError::Http(err)\n }\n}\n\n/// Represents a category of pages on Rosetta Code, such as \"Rust\".\nstruct Category {\n name: String,\n continue_params: Option<BTreeMap<String, String>>,\n}\n\nimpl Category {\n fn new(name: &str) -> Category {\n let mut continue_params = BTreeMap::new();\n continue_params.insert(\"continue\".to_owned(), \"\".to_owned());\n\n Category {\n name: name.to_owned(),\n continue_params: Some(continue_params),\n }\n }\n}\n\n/// Sends a request to Rosetta Code through the MediaWiki API. If successful, returns the response\n/// as a JSON object.\nfn query_api(\n category_name: &str,\n continue_params: &BTreeMap<String, String>,\n) -> Result<Value, TaskParseError> {\n let mut url = Url::parse(\"http://rosettacode.org/mw/api.php\").expect(\"invalid URL\");\n url.query_pairs_mut()\n .append_pair(\"action\", \"query\")\n .append_pair(\"list\", \"categorymembers\")\n .append_pair(\"cmtitle\", &format!(\"Category:{}\", category_name))\n .append_pair(\"cmlimit\", \"500\")\n .append_pair(\"format\", \"json\")\n .extend_pairs(continue_params);\n\n Ok(reqwest::blocking::get(url)?.json()?)\n}\n\n/// Given a JSON object, parses the task information from the MediaWiki API response.\nfn parse_tasks(json: &Value) -> Result<Vec<Task>, TaskParseError> {\n let tasks_json = json\n .pointer(\"/query/categorymembers\")\n .and_then(Value::as_array)\n .ok_or(TaskParseError::UnexpectedFormat)?;\n\n tasks_json\n .iter()\n .map(|json| Task::deserialize(json).map_err(From::from))\n .collect()\n}\n\nimpl Iterator for Category {\n type Item = Vec<Task>;\n\n fn next(&mut self) -> Option<Self::Item> {\n self.continue_params.as_ref()?;\n\n query_api(&self.name, self.continue_params.as_ref()?)\n .and_then(|result| {\n // If there are more pages of results to request, save them for the next iteration.\n self.continue_params =\n result\n .get(\"continue\")\n .and_then(Value::as_object)\n .map(|continue_params| {\n continue_params\n .iter()\n .map(|(key, value)| {\n (key.to_owned(), value.as_str().unwrap().to_owned())\n })\n .collect()\n });\n\n parse_tasks(&result)\n })\n .map_err(|err| println!(\"Error parsing response: {:?}\", err))\n .ok()\n }\n}\n\npub fn all_tasks() -> Vec<Task> {\n Category::new(\"Programming Tasks\").flatten().collect()\n}\n\npub fn unimplemented_tasks(lang: &str) -> Vec<Task> {\n let all_tasks = all_tasks().iter().cloned().collect::<HashSet<_>>();\n let implemented_tasks = Category::new(lang).flatten().collect::<HashSet<_>>();\n let mut unimplemented_tasks = all_tasks\n .difference(&implemented_tasks)\n .cloned()\n .collect::<Vec<Task>>();\n unimplemented_tasks.sort_by(|a, b| a.title.cmp(&b.title));\n unimplemented_tasks\n}\n\n\nfn main() {\n for task in find_unimplemented_tasks::unimplemented_tasks(\"Rust\") {\n println!(\"{:6} {}\", task.id, task.title);\n }\n}\n","language":"Rust"},{"code":"import com.softwaremill.sttp.json4s._\nimport com.softwaremill.sttp.quick._\n\nimplicit val serialization = org.json4s.native.Serialization\nimport org.json4s.DefaultFormats\nimplicit val formats = DefaultFormats\n\ncase class Task(pageid: Int, title: String)\ncase class Category(categorymembers: List[Task])\ncase class Query(query: Category)\n\nList(\"Programming Tasks\", \"Scala\")\n .map { title =>\n sttp\n .get(uri\"http://www.rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:${title}&cmlimit=1000&format=json\")\n .header(\"User-Agent\", mozillaUserAgent)\n .response(asJson[Query])\n .send()\n .body\n }\n .map {\n case Right(r) => r.query.categorymembers.toSet\n case Left(s) => Set.empty[Task]\n }\n .foldRight(Set.empty[Task])((acc: Set[Task], ele: Set[Task]) => acc -- ele)\n","language":"Scala"},{"code":"package require Tcl 8.5\npackage require http\npackage require json\npackage require struct::set\n\nfconfigure stdout -buffering none\n\n# Initialize a cache of lookups\narray set cache {}\nproc log msg {\n #puts -nonewline $msg\n}\n\nproc get_tasks {category} {\n global cache\n if {[info exists cache($category)]} {\n\treturn $cache($category)\n }\n set base_url http://www.rosettacode.org/mw/api.php\n set query {\n\taction\tquery\n\tlist\tcategorymembers\n\tcmtitle\tCategory:%s\n\tformat\tjson\n\tcmlimit\t500\n }\n set query [list {*}$query]; # remove excess whitespace\n set this_query [dict create {*}[split [format $query $category]]]\n set tasks [list]\n\n while {1} {\n set url [join [list $base_url [http::formatQuery {*}$this_query]] ?]\n while 1 {\n set response [http::geturl $url]\n\t # Process redirects\n if {[http::ncode $response] == 301} {\n set newurl [dict get [http::meta $response] Location]\n if {[string match http://* $newurl]} {\n set url $newurl\n } else {\n set url [regexp -inline {http://[^/]+} $url]\n append url $newurl\n }\n continue\n }\n\t # Check for oopsies!\n if {\n\t\t[set s [http::status $response]] ne \"ok\"\n\t\t|| [http::ncode $response] != 200\n\t } then {\n error \"Oops: url=$url\\nstatus=$s\\nhttp code=[http::code $response]\"\n }\n break\n }\n\n\t# Get the data out of the message\n set data [json::json2dict [http::data $response]]\n http::cleanup $response\n\n # add tasks to list\n foreach task [dict get $data query categorymembers] {\n lappend tasks [dict get [dict create {*}$task] title]\n }\n\n if {[catch {\n\t dict get $data query-continue categorymembers cmcontinue\n\t} continue_task]} then {\n # no more continuations, we're done\n break\n }\n dict set this_query cmcontinue $continue_task\n }\n return [set cache($category) $tasks]\n}\n\nproc get_unimplemented {lang} {\n set tasks [get_tasks Programming_Tasks]\n set collected [get_tasks Collection_Members]\n set doneTasks [get_tasks $lang]\n set omittedTasks [get_tasks $lang/Omit]\n\n # Map generic collection task categories to specific ones\n set tasks [regsub -all {Category:(\\S+)} $tasks \"\\\\1/$lang\"]\n\n set collectOfLang [struct::set intersect $collected $doneTasks]\n set ignorable [struct::set union $doneTasks $omittedTasks $collectOfLang]\n set unimplemented [struct::set difference $tasks $ignorable]\n\n puts \"\\n$lang has [llength $unimplemented] unimplemented programming tasks:\"\n if {[llength $unimplemented]} {\n\tputs \" [join [lsort $unimplemented] \"\\n \"]\"\n }\n}\n\ncatch {console show}\ncatch {wm withdraw .}\nforeach lang {Perl Python Ruby Tcl} {\n get_unimplemented $lang\n}\n","language":"Tcl"},{"code":"Set http= CreateObject(\"WinHttp.WinHttpRequest.5.1\")\nSet oDic = WScript.CreateObject(\"scripting.dictionary\")\n\nstart=\"https://rosettacode.org\"\nConst lang=\"VBScript\"\nDim oHF\n\ngettaskslist \"about:/wiki/Category:Programming_Tasks\" ,True\nprint odic.Count\ngettaskslist \"about:/wiki/Category:Draft_Programming_Tasks\",True\nprint \"total tasks \" & odic.Count\ngettaskslist \"about:/wiki/Category:\"&lang,False\nprint \"total tasks not in \" & lang & \" \" &odic.Count & vbcrlf\nFor Each d In odic.keys\n print d &vbTab & Replace(odic(d),\"about:\", start)\nnext\nWScript.Quit(1)\n\nSub print(s):\n On Error Resume Next\n WScript.stdout.WriteLine (s)\n If err= &h80070006& Then WScript.echo \" Please run this script with CScript\": WScript.quit\nEnd Sub\n\nFunction getpage(name)\n Set oHF=Nothing\n Set oHF = CreateObject(\"HTMLFILE\")\n http.open \"GET\",name,False ''synchronous!\n http.send\n oHF.write \"<html><body></body></html>\"\n oHF.body.innerHTML = http.responsetext\n Set getpage=Nothing\nEnd Function\n\nSub gettaskslist(b,build)\n nextpage=b\n While nextpage <>\"\"\n\n nextpage=Replace(nextpage,\"about:\", start)\n WScript.Echo nextpage\n getpage(nextpage)\n Set xtoc = oHF.getElementbyId(\"mw-pages\")\n nextpage=\"\"\n For Each ch In xtoc.children\n If ch.innertext= \"next page\" Then\n nextpage=ch.attributes(\"href\").value\n ': WScript.Echo nextpage\n ElseIf ch.attributes(\"class\").value=\"mw-content-ltr\" Then\n Set ytoc=ch.children(0)\n 'WScript.Echo ytoc.attributes(\"class\").value '\"mw-category mw-category-columns\"\n Exit For\n End If\n Next\n For Each ch1 In ytoc.children 'mw-category-group\n 'WScript.Echo \">\" &ch1.children(0).innertext &\"<\"\n For Each ch2 In ch1.children(1).children '\"mw_category_group\".ul\n Set ch=ch2.children(0)\n If build Then\n odic.Add ch.innertext , ch.attributes(\"href\").value\n else\n if odic.exists(ch.innertext) then odic.Remove ch.innertext\n End if\n 'WScript.Echo ch.innertext , ch.attributes(\"href\").value\n Next\n Next\n Wend\nEnd Sub\n","language":"VBScript"},{"code":"/* Rosetta_Code_Find_unimplemented_tasks.wren */\n\nimport \"./pattern\" for Pattern\n\nvar CURLOPT_URL = 10002\nvar CURLOPT_FOLLOWLOCATION = 52\nvar CURLOPT_WRITEFUNCTION = 20011\nvar CURLOPT_WRITEDATA = 10001\n\nforeign class Buffer {\n construct new() {} // C will allocate buffer of a suitable size\n\n foreign value // returns buffer contents as a string\n}\n\nforeign class Curl {\n construct easyInit() {}\n\n foreign easySetOpt(opt, param)\n\n foreign easyPerform()\n\n foreign easyCleanup()\n}\n\nvar curl = Curl.easyInit()\n\nvar getContent = Fn.new { |url|\n var buffer = Buffer.new()\n curl.easySetOpt(CURLOPT_URL, url)\n curl.easySetOpt(CURLOPT_FOLLOWLOCATION, 1)\n curl.easySetOpt(CURLOPT_WRITEFUNCTION, 0) // write function to be supplied by C\n curl.easySetOpt(CURLOPT_WRITEDATA, buffer)\n curl.easyPerform()\n return buffer.value\n}\n\nvar p1 = Pattern.new(\"title/=\\\"[+1^\\\"]\\\"\")\nvar p2 = Pattern.new(\"cmcontinue/=\\\"[+1^\\\"]\\\"\")\n\nvar findTasks = Fn.new { |category|\n var url = \"https://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:%(category)&cmlimit=500&format=xml\"\n var cmcontinue = \"\"\n var tasks = []\n while (true) {\n var content = getContent.call(url + cmcontinue)\n var matches1 = p1.findAll(content)\n for (m in matches1) {\n var title = m.capsText[0].replace(\"'\", \"'\").replace(\""\", \"\\\"\")\n tasks.add(title)\n }\n var m2 = p2.find(content)\n if (m2) cmcontinue = \"&cmcontinue=%(m2.capsText[0])\" else break\n }\n return tasks\n}\n\nvar tasks1 = findTasks.call(\"Programming_Tasks\") // 'full' tasks only\nvar tasks2 = findTasks.call(\"Draft_Programming_Tasks\")\nvar lang = \"Wren\"\nvar langTasks = findTasks.call(lang) // includes draft tasks\ncurl.easyCleanup()\nSystem.print(\"Unimplemented 'full' tasks in %(lang):\")\nfor (task in tasks1) {\n if (!langTasks.contains(task)) System.print(\" \" + task)\n}\nSystem.print(\"\\nUnimplemented 'draft' tasks in %(lang):\")\nfor (task in tasks2) {\n if (!langTasks.contains(task)) System.print(\" \" + task)\n}\n","language":"Wren"},{"code":"/* gcc Rosetta_Code_Find_unimplemented_tasks.c -o Rosetta_Code_Find_unimplemented_tasks -lcurl -lwren -lm */\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <curl/curl.h>\n#include \"wren.h\"\n\nstruct MemoryStruct {\n char *memory;\n size_t size;\n};\n\n/* C <=> Wren interface functions */\n\nstatic size_t WriteMemoryCallback(void *contents, size_t size, size_t nmemb, void *userp) {\n size_t realsize = size * nmemb;\n struct MemoryStruct *mem = (struct MemoryStruct *)userp;\n\n char *ptr = realloc(mem->memory, mem->size + realsize + 1);\n if(!ptr) {\n /* out of memory! */\n printf(\"not enough memory (realloc returned NULL)\\n\");\n return 0;\n }\n\n mem->memory = ptr;\n memcpy(&(mem->memory[mem->size]), contents, realsize);\n mem->size += realsize;\n mem->memory[mem->size] = 0;\n return realsize;\n}\n\nvoid C_bufferAllocate(WrenVM* vm) {\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenSetSlotNewForeign(vm, 0, 0, sizeof(struct MemoryStruct));\n ms->memory = malloc(1);\n ms->size = 0;\n}\n\nvoid C_bufferFinalize(void* data) {\n struct MemoryStruct *ms = (struct MemoryStruct *)data;\n free(ms->memory);\n}\n\nvoid C_curlAllocate(WrenVM* vm) {\n CURL** pcurl = (CURL**)wrenSetSlotNewForeign(vm, 0, 0, sizeof(CURL*));\n *pcurl = curl_easy_init();\n}\n\nvoid C_value(WrenVM* vm) {\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 0);\n wrenSetSlotString(vm, 0, ms->memory);\n}\n\nvoid C_easyPerform(WrenVM* vm) {\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\n curl_easy_perform(curl);\n}\n\nvoid C_easyCleanup(WrenVM* vm) {\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\n curl_easy_cleanup(curl);\n}\n\nvoid C_easySetOpt(WrenVM* vm) {\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\n CURLoption opt = (CURLoption)wrenGetSlotDouble(vm, 1);\n if (opt < 10000) {\n long lparam = (long)wrenGetSlotDouble(vm, 2);\n curl_easy_setopt(curl, opt, lparam);\n } else if (opt < 20000) {\n if (opt == CURLOPT_WRITEDATA) {\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 2);\n curl_easy_setopt(curl, opt, (void *)ms);\n } else if (opt == CURLOPT_URL) {\n const char *url = wrenGetSlotString(vm, 2);\n curl_easy_setopt(curl, opt, url);\n }\n } else if (opt < 30000) {\n if (opt == CURLOPT_WRITEFUNCTION) {\n curl_easy_setopt(curl, opt, &WriteMemoryCallback);\n }\n }\n}\n\nWrenForeignClassMethods bindForeignClass(WrenVM* vm, const char* module, const char* className) {\n WrenForeignClassMethods methods;\n methods.allocate = NULL;\n methods.finalize = NULL;\n if (strcmp(module, \"main\") == 0) {\n if (strcmp(className, \"Buffer\") == 0) {\n methods.allocate = C_bufferAllocate;\n methods.finalize = C_bufferFinalize;\n } else if (strcmp(className, \"Curl\") == 0) {\n methods.allocate = C_curlAllocate;\n }\n }\n return methods;\n}\n\nWrenForeignMethodFn bindForeignMethod(\n WrenVM* vm,\n const char* module,\n const char* className,\n bool isStatic,\n const char* signature) {\n if (strcmp(module, \"main\") == 0) {\n if (strcmp(className, \"Buffer\") == 0) {\n if (!isStatic && strcmp(signature, \"value\") == 0) return C_value;\n } else if (strcmp(className, \"Curl\") == 0) {\n if (!isStatic && strcmp(signature, \"easySetOpt(_,_)\") == 0) return C_easySetOpt;\n if (!isStatic && strcmp(signature, \"easyPerform()\") == 0) return C_easyPerform;\n if (!isStatic && strcmp(signature, \"easyCleanup()\") == 0) return C_easyCleanup;\n }\n }\n return NULL;\n}\n\nstatic void writeFn(WrenVM* vm, const char* text) {\n printf(\"%s\", text);\n}\n\nvoid errorFn(WrenVM* vm, WrenErrorType errorType, const char* module, const int line, const char* msg) {\n switch (errorType) {\n case WREN_ERROR_COMPILE:\n printf(\"[%s line %d] [Error] %s\\n\", module, line, msg);\n break;\n case WREN_ERROR_STACK_TRACE:\n printf(\"[%s line %d] in %s\\n\", module, line, msg);\n break;\n case WREN_ERROR_RUNTIME:\n printf(\"[Runtime Error] %s\\n\", msg);\n break;\n }\n}\n\nchar *readFile(const char *fileName) {\n FILE *f = fopen(fileName, \"r\");\n fseek(f, 0, SEEK_END);\n long fsize = ftell(f);\n rewind(f);\n char *script = malloc(fsize + 1);\n fread(script, 1, fsize, f);\n fclose(f);\n script[fsize] = 0;\n return script;\n}\n\nstatic void loadModuleComplete(WrenVM* vm, const char* module, WrenLoadModuleResult result) {\n if( result.source) free((void*)result.source);\n}\n\nWrenLoadModuleResult loadModule(WrenVM* vm, const char* name) {\n WrenLoadModuleResult result = {0};\n if (strcmp(name, \"random\") != 0 && strcmp(name, \"meta\") != 0) {\n result.onComplete = loadModuleComplete;\n char fullName[strlen(name) + 6];\n strcpy(fullName, name);\n strcat(fullName, \".wren\");\n result.source = readFile(fullName);\n }\n return result;\n}\n\nint main(int argc, char **argv) {\n WrenConfiguration config;\n wrenInitConfiguration(&config);\n config.writeFn = &writeFn;\n config.errorFn = &errorFn;\n config.bindForeignClassFn = &bindForeignClass;\n config.bindForeignMethodFn = &bindForeignMethod;\n config.loadModuleFn = &loadModule;\n WrenVM* vm = wrenNewVM(&config);\n const char* module = \"main\";\n const char* fileName = \"Rosetta_Code_Find_unimplemented_tasks.wren\";\n char *script = readFile(fileName);\n WrenInterpretResult result = wrenInterpret(vm, module, script);\n switch (result) {\n case WREN_RESULT_COMPILE_ERROR:\n printf(\"Compile Error!\\n\");\n break;\n case WREN_RESULT_RUNTIME_ERROR:\n printf(\"Runtime Error!\\n\");\n break;\n case WREN_RESULT_SUCCESS:\n break;\n }\n wrenFreeVM(vm);\n free(script);\n return 0;\n}\n","language":"Wren"},{"code":"var [const] YAJL=Import(\"zklYAJL\")[0], CURL=Import(\"zklCurl\");\n\nfcn getTasks(language){\n continueValue,tasks:=\"\",Data(0,String); // \"nm\\0nm\\0....\"\n do{\n page:=CURL().get((\"http://rosettacode.org/mw/api.php?\"\n \"action=query&cmlimit=500\"\n\t \"&format=json\"\n\t \"&list=categorymembers\"\n\t \"&cmtitle=Category:%s\"\n\t \"&cmcontinue=%s\").fmt(language,continueValue));\n page=page[0].del(0,page[1]); // get rid of HTML header\n json:=YAJL().write(page).close();\n json[\"query\"][\"categorymembers\"].pump(tasks,T(\"get\",\"title\"));\n continueValue=json.find(\"continue\") //continue:-||,cmcontinue:page|954|19)\n .toList().apply(\"concat\",\"=\").concat(\"&\");\n }while(continueValue);\n tasks\n}\n\nallTasks:=getTasks.future(\"Programming_Tasks\"); // thread\n","language":"Zkl"},{"code":"language:=\"zkl\";\ntasks:=getTasks(language);\nlangTasks:=Dictionary(); tasks.pump(Void,langTasks.add.fp1(Void));\nunimplementedTasks:=allTasks.filter('wrap(nm){ (not langTasks.holds(nm)) });\nprintln(\"Found %d unimplemented tasks for %s:\"\n .fmt(unimplementedTasks.len(1),language));\nunimplementedTasks.pump(Console.println);\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Rosetta_Code/Find_unimplemented_tasks\\nnote: Rosetta Code related\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nGiven the name of a language on Rosetta Code, find all tasks which are not implemented in that language.\\n\\n\\nNote: Implementations should allow for fetching more data than can be returned in one request to Rosetta Code.\\n\\nYou'll need to use the Media Wiki API, which you can find out about locally, [http://rosettacode.org/mw/api.php here], or in Media Wiki's API documentation at, [http://www.mediawiki.org/wiki/API_Query API:Query]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"with Aws.Client, Aws.Messages, Aws.Response, Aws.Resources, Aws.Url;\\nwith Dom.Readers, Dom.Core, Dom.Core.Documents, Dom.Core.Nodes, Dom.Core.Attrs;\\nwith Input_Sources.Strings, Unicode, Unicode.Ces.Utf8;\\nwith Ada.Strings.Unbounded, Ada.Text_IO, Ada.Command_Line;\\nwith Ada.Containers.Vectors;\\n\\nuse Aws.Client, Aws.Messages, Aws.Response, Aws.Resources, Aws.Url;\\nuse Dom.Readers, Dom.Core, Dom.Core.Documents, Dom.Core.Nodes, Dom.Core.Attrs;\\nuse Aws, Ada.Strings.Unbounded, Input_Sources.Strings;\\nuse Ada.Text_IO, Ada.Command_Line;\\n\\nprocedure Not_Coded is\\n\\n package Members_Vectors is new Ada.Containers.Vectors (\\n Index_Type => Positive,\\n Element_Type => Unbounded_String);\\n use Members_Vectors;\\n\\n All_Tasks, Language_Members : Vector;\\n\\n procedure Get_Vector (Category : in String; Mbr_Vector : in out Vector) is\\n Reader : Tree_Reader;\\n Doc : Document;\\n List : Node_List;\\n N : Node;\\n A : Attr;\\n Page : Aws.Response.Data;\\n S : Messages.Status_Code;\\n\\n -- Query has cmlimit value of 100, so we need 5 calls to\\n -- retrieve the complete list of Programming_category\\n Uri_Xml : constant String :=\\n \\\"http://rosettacode.org/mw/api.php?action=query&list=categorymembers\\\"\\n &\\n \\\"&format=xml&cmlimit=100&cmtitle=Category:\\\";\\n Cmcontinue : Unbounded_String := Null_Unbounded_String;\\n begin\\n loop\\n Page :=\\n Aws.Client.Get (Uri_Xml & Category & (To_String (Cmcontinue)));\\n S := Response.Status_Code (Page);\\n if S not in Messages.Success then\\n Put_Line\\n (\\\"Unable to retrieve data => Status Code :\\\" &\\n Image (S) &\\n \\\" Reason :\\\" &\\n Reason_Phrase (S));\\n raise Connection_Error;\\n end if;\\n declare\\n Xml : constant String := Message_Body (Page);\\n Source : String_Input;\\n begin\\n Open\\n (Xml'Unrestricted_Access,\\n Unicode.Ces.Utf8.Utf8_Encoding,\\n Source);\\n Parse (Reader, Source);\\n Close (Source);\\n end;\\n Doc := Get_Tree (Reader);\\n List := Get_Elements_By_Tag_Name (Doc, \\\"cm\\\");\\n for Index in 1 .. Length (List) loop\\n N := Item (List, Index - 1);\\n A := Get_Named_Item (Attributes (N), \\\"title\\\");\\n Members_Vectors.Append\\n (Mbr_Vector,\\n To_Unbounded_String (Value (A)));\\n end loop;\\n Free (List);\\n List := Get_Elements_By_Tag_Name (Doc, \\\"query-continue\\\");\\n if Length (List) = 0 then\\n -- we are done\\n Free (List);\\n Free (Reader);\\n exit;\\n end if;\\n N := First_Child (Item (List, 0));\\n A := Get_Named_Item (Attributes (N), \\\"cmcontinue\\\");\\n Cmcontinue :=\\n To_Unbounded_String\\n (\\\"&cmcontinue=\\\" & Aws.Url.Encode (Value (A)));\\n Free (List);\\n Free (Reader);\\n end loop;\\n end Get_Vector;\\n\\n procedure Quick_Diff (From : in out Vector; Substract : in Vector) is\\n Beginning, Position : Extended_Index;\\n begin\\n -- take adavantage that both lists are already sorted\\n Beginning := First_Index (From);\\n for I in First_Index (Substract) .. Last_Index (Substract) loop\\n Position :=\\n Find_Index\\n (Container => From,\\n Item => Members_Vectors.Element (Substract, I),\\n Index => Beginning);\\n if not (Position = No_Index) then\\n Delete (From, Position);\\n Beginning := Position;\\n end if;\\n end loop;\\n end Quick_Diff;\\n\\nbegin\\n if Argument_Count = 0 then\\n Put_Line (\\\"Can't process : No language given!\\\");\\n return;\\n else\\n Get_Vector (Argument (1), Language_Members);\\n end if;\\n\\n Get_Vector (\\\"Programming_Tasks\\\", All_Tasks);\\n Quick_Diff (All_Tasks, Language_Members);\\n\\n for I in First_Index (All_Tasks) .. Last_Index (All_Tasks) loop\\n Put_Line (To_String (Members_Vectors.Element (All_Tasks, I)));\\n end loop;\\n Put_Line\\n (\\\"Numbers of tasks not implemented :=\\\" &\\n Integer'Image (Last_Index ((All_Tasks))));\\nend Not_Coded;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"/* ARM assembly Raspberry PI */\\n/* program tasksearchRasp.s */\\n/* access RosettaCode.org and data extract */\\n/* use openssl for access to port 443 */\\n/* test openssl : package libssl-dev */\\n\\n/* REMARK 1 : this program use routines in a include file\\n see task Include a file language arm assembly\\n for the routine affichageMess conversion10\\n see at end of this program the instruction include */\\n\\n/*******************************************/\\n/* Constantes */\\n/*******************************************/\\n.include \\\"../constantes.inc\\\"\\n\\n//.equ EXIT, 1\\n.equ TAILLEBUFFER, 500\\n\\n.equ SSL_OP_NO_SSLv3, 0x02000000\\n.equ SSL_OP_NO_COMPRESSION, 0x00020000\\n.equ SSL_MODE_AUTO_RETRY, 0x00000004\\n.equ SSL_CTRL_MODE, 33\\n\\n.equ BIO_C_SET_CONNECT, 100\\n.equ BIO_C_DO_STATE_MACHINE, 101\\n.equ BIO_C_SET_SSL, 109\\n.equ BIO_C_GET_SSL, 110\\n\\n.equ LGBUFFERREQ, 512001\\n.equ LGBUFFER2, 128001\\n\\n/*********************************/\\n/* Initialized data */\\n/*********************************/\\n.data\\nszMessDebutPgm: .asciz \\\"Program 32 bits start \\\\n\\\"\\nszRetourLigne: .asciz \\\"\\\\n\\\"\\nszMessFinOK: .asciz \\\"Program end OK. \\\\n\\\"\\nszMessErreur: .asciz \\\"Erreur !!!\\\"\\n//szMessExtractArea: .asciz \\\"Extraction = \\\"\\nszMessConnectOK: .asciz \\\"Connexion site OK.\\\\n\\\"\\nszMessInitOK: .asciz \\\"Initialisation SSL OK.\\\\n\\\"\\nszMessReqOK: .asciz \\\"Send requete OK.\\\\n\\\"\\nszNomSite1: .asciz \\\"www.rosettacode.org:443\\\" @ host name and port\\nszLibStart: .asciz \\\"<query><categorymembers>\\\" @ search string\\nszLibsearch1: .asciz \\\"<cm pageid=\\\"\\nszLibsearch2: .asciz \\\"title=\\\"\\nszNomrepCertif: .asciz \\\"/pi/certificats\\\"\\nszRequete1: .asciz \\\"GET /w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=1000&format=xml HTTP/1.1 \\\\r\\\\nHost: rosettacode.org\\\\r\\\\nConnection: keep-alive\\\\r\\\\nContent-Type: text/plain\\\\r\\\\n\\\\r\\\\n\\\"\\nszRequete2: .asciz \\\"GET /w/api.php?action=query&list=categorymembers&cmtitle=Category:ARM%20Assembly&cmlimit=500&format=xml HTTP/1.1 \\\\r\\\\nHost: rosettacode.org\\\\r\\\\nConnection: keep-alive\\\\r\\\\nContent-Type: text/plain\\\\r\\\\n\\\\r\\\\n\\\"\\n\\n/*********************************/\\n/* UnInitialized data */\\n/*********************************/\\n.bss\\n.align 4\\nsBufferreq: .skip LGBUFFERREQ\\nsBufferreq1: .skip LGBUFFERREQ\\nszExtractArea: .skip TAILLEBUFFER\\nszExtractArea1: .skip TAILLEBUFFER\\nszTaskName: .skip 128\\nszTaskNamePgm: .skip 128\\n.align 4\\nstNewSSL: .skip 200\\n/*********************************/\\n/* code section */\\n/*********************************/\\n.text\\n.global main\\nmain:\\n ldr r0,iAdrszMessDebutPgm\\n bl affichageMess @ start message\\n\\n /* connexion host port 443 and send query */\\n ldr r0,iAdrszNomSite1\\n ldr r1,iAdrszRequete1\\n ldr r2,iAdrsBufferreq\\n bl envoiRequete\\n cmp r0,#-1\\n beq 99f @ error ?\\n\\n ldr r0,iAdrszNomSite1\\n ldr r1,iAdrszRequete2\\n ldr r2,iAdrsBufferreq1\\n bl envoiRequete\\n cmp r0,#-1\\n beq 99f @ error ?\\n\\n bl analyseReponse\\n\\n ldr r0,iAdrszMessFinOK @ end message\\n bl affichageMess\\n mov r0, #0 @ return code ok\\n b 100f\\n99:\\n ldr r0,iAdrszMessErreur @ error\\n bl affichageMess\\n mov r0, #1 @ return code error\\n b 100f\\n100:\\n mov r7,#EXIT @ program end\\n svc #0 @ system call\\niAdrszMessDebutPgm: .int szMessDebutPgm\\niAdrszMessFinOK: .int szMessFinOK\\niAdrszMessErreur: .int szMessErreur\\niAdrszNomSite1: .int szNomSite1\\niAdrszRequete2: .int szRequete2\\niAdrszRequete1: .int szRequete1\\niAdrsBufferreq: .int sBufferreq\\niAdrsBufferreq1: .int sBufferreq1\\n/*********************************************************/\\n/* connexion host port 443 and send query */\\n/*********************************************************/\\nenvoiRequete:\\n push {r2-r9,lr} @ save registers\\n mov r8,r0 @ save address site name\\n mov r9,r1 @ save address requete\\n mov r7,r2 @ save address buffer\\n @*************************************\\n @ openSsl functions use *\\n @*************************************\\n @init ssl\\n mov r0,#0\\n bl OPENSSL_init_crypto\\n bl ERR_load_BIO_strings\\n mov r2, #0\\n mov r1, #0\\n mov r0, #2\\n bl OPENSSL_init_crypto\\n mov r2, #0\\n mov r1, #0\\n mov r0, #0\\n bl OPENSSL_init_ssl\\n cmp r0,#0\\n blt erreur\\n bl TLS_client_method\\n bl SSL_CTX_new\\n cmp r0,#0\\n ble erreur\\n mov r6,r0 @ save ctx\\n ldr r1,iFlag\\n bl SSL_CTX_set_options\\n mov r0,r6\\n mov r1,#0\\n ldr r2,iAdrszNomrepCertif\\n bl SSL_CTX_load_verify_locations\\n cmp r0,#0\\n ble erreur\\n mov r0,r6\\n bl BIO_new_ssl_connect\\n cmp r0,#0\\n beq erreur\\n cmp r0,#-1\\n beq erreur\\n mov r5,r0 @ save bio\\n ldr r0,iAdrszMessInitOK\\n bl affichageMess\\n mov r0,r5\\n mov r1,#BIO_C_GET_SSL\\n mov r2,#0\\n ldr r3,iAdrstNewSSL\\n bl BIO_ctrl\\n ldr r0,iAdrstNewSSL\\n ldr r0,[r0]\\n mov r1,#SSL_CTRL_MODE\\n mov r2,#SSL_MODE_AUTO_RETRY\\n mov r3,#0\\n bl SSL_ctrl\\n mov r0,r5 @ bio\\n mov r1,#BIO_C_SET_CONNECT\\n mov r2,#0\\n mov r3,r8 @ site address\\n bl BIO_ctrl\\n mov r0,r5 @ bio\\n mov r1,#BIO_C_DO_STATE_MACHINE\\n mov r2,#0\\n mov r3,#0\\n bl BIO_ctrl\\n cmp r0,#0\\n blt erreur\\n\\n ldr r0,iAdrszMessConnectOK\\n bl affichageMess\\n @ compute query length\\n mov r2,#0 @ init length\\n mov r1,r9 @ query address\\n1: @ loop compute length query\\n ldrb r0,[r1,r2]\\n cmp r0,#0\\n addne r2,#1\\n bne 1b\\n @ send query\\n mov r0,r5 @ bio\\n @ r1 = address query\\n @ r2 = length query\\n mov r3,#0\\n bl BIO_write @ send query\\n cmp r0,#0\\n blt erreur\\n ldr r0,iAdrszMessReqOK\\n bl affichageMess\\n2: @ begin loop to read datas\\n mov r0,r5 @ bio\\n mov r1,r7 @ buffer address\\n mov r2,#LGBUFFERREQ - 1\\n mov r3,#0\\n bl BIO_read\\n cmp r0,#0\\n ble 4f @ error ou pb server\\n mov r1,r7\\n add r7,r0\\n sub r2,r7,#6\\n ldr r2,[r2]\\n ldr r3,iCharEnd\\n cmp r2,r3 @ text end ?\\n beq 4f\\n mov r1,#0xFF @ delay loop\\n3:\\n subs r1,#1\\n bgt 3b\\n b 2b @ loop read other chunk\\n4: @ read end\\n //ldr r0,iAdrsBufferreq @ to display buffer response of the query\\n //bl affichageMess\\n mov r0, r5 @ close bio\\n bl BIO_free_all\\n mov r0,#0\\n b 100f\\nerreur: @ error display\\n ldr r1,iAdrszMessErreur\\n bl afficheerreur\\n mov r0,#-1 @ error code\\n b 100f\\n100:\\n pop {r2-r9,pc} @ restaur registers\\niFlag: .int SSL_OP_NO_SSLv3 | SSL_OP_NO_COMPRESSION\\niAdrstNewSSL: .int stNewSSL\\niAdrszNomrepCertif: .int szNomrepCertif\\niCharEnd: .int 0x0A0D300A\\niAdrszMessConnectOK: .int szMessConnectOK\\niAdrszMessInitOK: .int szMessInitOK\\niAdrszMessReqOK: .int szMessReqOK\\n/*********************************************************/\\n/* response analyze */\\n/*********************************************************/\\nanalyseReponse:\\n push {r1-r6,lr} @ save registers\\n @ search start in task buffer\\n ldr r0,iAdrsBufferreq @ buffer address\\n mov r7,r0\\n ldr r1,iAdrszLibStart @ key text address\\n bl rechercheSousChaine\\n cmp r0,#-1\\n beq 99f\\n add r7,r7,r0 @ new search buffer address\\n mov r0,r7\\n @ search start in task buffer\\n ldr r0,iAdrsBufferreq11 @ buffer address\\n mov r5,r0\\n ldr r1,iAdrszLibStart @ key text address\\n bl rechercheSousChaine\\n cmp r0,#-1\\n beq 99f @ error ?\\n add r5,r5,r0\\n mov r0,r5\\n1: @ loop begin to find task in program buffer\\n mov r0,r5\\n ldr r1,iAdrszLibsearch1 @ text code task address\\n mov r2,#1 @ occurence key text\\n mov r3,#2 @ offset\\n ldr r4,iAdrszExtractArea1 @ address result area\\n bl extChaine\\n cmp r0,#-1\\n beq 99f @ error ?\\n mov r5,r0 @ new address to search\\n ldr r0,iAdrszExtractArea1\\n bl conversionAtoD @ conversion code task to numeric\\n mov r10,r0 @ save numeric code\\n mov r0,r5 @ search task name in pgm buffer @\\n ldr r1,iAdrszLibsearch2 @ key text address\\n mov r2,#1 @ occurence key text\\n mov r3,#2 @ offset\\n ldr r4,iAdrszTaskNamePgm @ address result area\\n bl extChaine\\n cmp r0,#-1\\n beq 99f\\n mov r5,r0 @ new address to search\\n2: @ loop search buffer tasks\\n mov r0,r7\\n ldr r1,iAdrszLibsearch1 @ key text address\\n mov r2,#1 @ occurence key text\\n mov r3,#2 @ offset\\n ldr r4,iAdrszExtractArea @ address result area\\n bl extChaine\\n cmp r0,#-1\\n beq 99f\\n mov r7,r0\\n mov r0,r7\\n ldr r1,iAdrszLibsearch2 @ key text address\\n mov r2,#1 @ occurence key text\\n mov r3,#2 @ offset\\n ldr r4,iAdrszTaskName @ address result area\\n bl extChaine\\n cmp r0,#-1\\n beq 99f\\n mov r7,r0 @ new search address in task buffer\\n ldr r0,iAdrszExtractArea\\n bl conversionAtoD @ conversion code task in numeric\\n cmp r10,r0 @ compere two task code\\n beq 10f @ search next codes if equals\\n\\n ldr r0,iAdrszTaskName @ else display task name\\n bl affichageMess\\n ldr r0,iAdrszRetourLigne\\n bl affichageMess\\n\\n add r0,r7,#4 @ search if end of task list\\n ldrb r2,[r0]\\n cmp r2,#'/'\\n bne 2b @ no -> loop\\n add r0,#1\\n ldrb r2,[r0]\\n cmp r2,#'c'\\n bne 2b @ no -> loop\\n\\n b 100f @ yes -> list end\\n10:\\n add r0,r5,#4 @ search if end of pgm task list\\n ldrb r2,[r0]\\n cmp r2,#'/'\\n bne 1b\\n add r0,#1\\n ldrb r2,[r0]\\n cmp r2,#'c'\\n bne 1b\\n\\n b 100f @ list pgm end\\n\\n99:\\n ldr r0,iAdrszMessErreur1 @ error\\n bl affichageMess\\n mov r0, #-1 @ error return code\\n b 100f\\n100:\\n pop {r1-r6,pc} @ restaur registers\\niAdrsBufferreq11: .int sBufferreq1\\niAdrszLibStart: .int szLibStart\\niAdrszLibsearch1: .int szLibsearch1\\niAdrszLibsearch2: .int szLibsearch2\\niAdrszTaskName: .int szTaskName\\niAdrszTaskNamePgm: .int szTaskNamePgm\\niAdrszExtractArea: .int szExtractArea\\niAdrszExtractArea1: .int szExtractArea1\\niAdrszRetourLigne: .int szRetourLigne\\niAdrszMessErreur1: .int szMessErreur\\n/*********************************************************/\\n/* Text Extraction behind text key */\\n/*********************************************************/\\n/* r0 buffer address */\\n/* r1 key text to search */\\n/* r2 number occurences to key text */\\n/* r3 offset */\\n/* r4 result address */\\nextChaine:\\n push {r2-r8,lr} @ save registers\\n mov r5,r0 @ save buffer address\\n mov r6,r1 @ save key text\\n @ compute text length\\n mov r7,#0\\n1: @ loop\\n ldrb r0,[r5,r7] @ load a byte\\n cmp r0,#0 @ end ?\\n addne r7,#1 @ no -> loop\\n bne 1b\\n add r7,r5 @ compute text end\\n\\n mov r8,#0\\n2: @ compute length text key\\n ldrb r0,[r6,r8]\\n cmp r0,#0\\n addne r8,#1\\n bne 2b\\n\\n3: @ loop to search nième(r2) key text\\n mov r0,r5\\n mov r1,r6\\n bl rechercheSousChaine\\n cmp r0,#0\\n blt 100f\\n subs r2,#1\\n addgt r5,r0\\n addgt r5,r8\\n bgt 3b\\n add r0,r5 @ add address text to index\\n add r3,r0 @ add offset\\n sub r3,#1\\n @ and add length key text\\n add r3,r8\\n cmp r3,r7 @ > at text end\\n movge r0,#-1 @ yes -> error\\n bge 100f\\n mov r0,#0\\n4: @ character loop copy\\n ldrb r2,[r3,r0]\\n strb r2,[r4,r0]\\n cmp r2,#0 @ text end ?\\n moveq r0,#0 @ return zero\\n beq 100f\\n cmp r2,#'\\\"' @ text end ?\\n beq 5f\\n cmp r0,#48 @ extraction length\\n beq 5f\\n add r0,#1\\n b 4b @ and loop\\n5:\\n mov r2,#0 @ store final zéro\\n strb r2,[r4,r0]\\n add r0,#1\\n add r0,r3 @ r0 return the last position of extraction\\n @ it is possible o search another text\\n100:\\n \\tpop {r2-r8,pc} @ restaur registers\\n\\n/******************************************************************/\\n/* search substring in string */\\n/******************************************************************/\\n/* r0 contains address string */\\n/* r1 contains address substring */\\n/* r0 return start index substring or -1 if not find */\\nrechercheSousChaine:\\n push {r1-r6,lr} @ save registers\\n mov r2,#0 @ index position string\\n mov r3,#0 @ index position substring\\n mov r6,#-1 @ search index\\n ldrb r4,[r1,r3] @ load first byte substring\\n cmp r4,#0 @ zero final ?\\n moveq r0,#-1 @ error\\n beq 100f\\n1:\\n ldrb r5,[r0,r2] @ load string byte\\n cmp r5,#0 @ zero final ?\\n moveq r0,#-1 @ yes -> not find\\n beq 100f\\n cmp r5,r4 @ compare character two strings\\n beq 2f\\n mov r6,#-1 @ not equal - > raz index\\n mov r3,#0 @ and raz byte counter\\n ldrb r4,[r1,r3] @ and load byte\\n add r2,#1 @ and increment byte counter\\n b 1b @ and loop\\n2: @ characters equal\\n cmp r6,#-1 @ first character equal ?\\n moveq r6,r2 @ yes -> start index in r6\\n add r3,#1 @ increment substring counter\\n ldrb r4,[r1,r3] @ and load next byte\\n cmp r4,#0 @ zero final ?\\n beq 3f @ yes -> search end\\n add r2,#1 @ else increment string index\\n b 1b @ and loop\\n3:\\n mov r0,r6 @ return start index substring in the string\\n100:\\n pop {r1-r6,pc} @ restaur registres\\n\\n/***************************************************/\\n/* ROUTINES INCLUDE */\\n/***************************************************/\\n.include \\\"../affichage.inc\\\"\\n\",\n \"language\": \"ARM-Assembly\"\n },\n {\n \"code\": \"#NoEnv ; do not resolve environment variables (speed)\\n#SingleInstance force ; allow only one instance\\nSetBatchLines, -1 ; set to highest script speed\\nSetControlDelay, 0 ; set delay between control commands to lowest\\n\\n; additional label, for clarity only\\nAutoExec:\\n Gui, Add, DDL, x10 y10 w270 r20 vlngStr ; add drop-down list\\n Gui, Add, Button, x290 y10 gShowLng, Show Unimplemented ; add button\\n Gui, Add, ListView, x10 y36 w400 h300 vcatLst gOnLV, Unimplemented ; add listview\\n Gui, Add, StatusBar, vsbStr, ; add statusbar\\n Gui, Show, , RosettaCode unimplemented list ; show the gui\\n allLng := getList(\\\"lng\\\") ; get a list of all available languages\\n selectStr = Select language... ; set selection string for ddl\\n GuiControl, , LngStr, |%selectStr%||%allLng% ; set the ddl to new contents\\n SB_SetIcon(\\\"user32.dll\\\", 5) ; change statusbar icon\\n SB_SetText(\\\"Done loading languages. Select from menu.\\\") ; change statusbar text\\nReturn ; end of the autoexec section. Script waits for input.\\n\\n; subroutine for language list in ddl update\\nShowLng:\\n Gui, Submit, NoHide ; refresh all gui variables\\n If (lngStr != selectStr) ; if the current selected language is not the selection string\\n {\\n SB_SetIcon(\\\"user32.dll\\\", 2) ; set statusbar icon to exclamation\\n SB_SetText(\\\"Loading unimplemented tasks... Please wait.\\\") ; set statusbar text\\n allTsk := getList(\\\"tsk\\\") ; get a list of all tasks\\n allThis := getList(lngStr) ; get a list of all done tasks for this language\\n Loop, Parse, allTsk, | ; parse the list of all tasks\\n {\\n If !InStr(allThis,A_LoopField) ; if the current task is not found in the list of all tasks\\n notImpl .= A_LoopField . \\\"|\\\" ; add the current field to the notImpl variable\\n allTskCnt := A_Index ; save the index for final count\\n }\\n StringTrimRight, notImpl, notImpl, 1 ; remove last delimiter\\n LV_Delete() ; emty the listview\\n GuiControl, -Redraw, catLst ; set the listview to not redraw while adding (speed)\\n Loop, Parse, notImpl, | ; parse the list of not implemented tasks\\n {\\n LV_Add(\\\"\\\", A_LoopField) ; add them to the listview, field by field\\n notImplCnt := A_Index ; save the index for final count\\n }\\n GuiControl, +Redraw, catLst ; set the listview back to normal\\n SB_SetIcon(\\\"user32.dll\\\", 5) ; change statusbar icon to information\\n SB_SetText(\\\"There are \\\" . notImplCnt . \\\" of \\\" . allTskCnt\\n . \\\" tasks unimplemented. Double-click task to open in browser.\\\") ; set the statusbar text\\n notImpl = ; empty the notImpl variable\\n notImplCnt = 0 ; set the count back to 0\\n }\\nReturn\\n\\n; subroutine for action on listview\\nOnLV:\\n If (A_GuiEvent = \\\"DoubleClick\\\") ; if the listview was double-clicked\\n {\\n LV_GetText(rowTxt, A_EventInfo) ; get the text of the clicked row\\n rowTxt := Enc_Uri(rowTxt) ; uri-encode the text\\n StringReplace, rowTxt, rowTxt, `%20, _, All ; replace all space-encodings with underscores\\n Run % \\\"http://rosettacode.org/wiki/\\\" . rowTxt ; run the resulting link in the default browser\\n }\\nReturn\\n\\n; generic function to gather list\\ngetList(category)\\n{\\n fileName = temp.xml ; set temp-file name\\n If (category = \\\"lng\\\") ; if the category received is lng\\n {\\n category = Programming_Languages ; set the category\\n fileName = lng.xml ; set temp-file name\\n IfExist, %fileName% ; if the file already exists\\n {\\n FileGetTime, modTime, %fileName% ; get the last modified time\\n EnvSub, modTime, %A_Now%, days ; get the difference between now and last modified time in days\\n If (modTime < 3) ; if the result is less than 3\\n Goto, GetFileNoDL ; go to function-internal subroutine to parse\\n }\\n SB_SetIcon(\\\"user32.dll\\\", 2) ; set statusbar icon\\n SB_SetText(\\\"Loading languages... Please wait.\\\") ; set statusbar text\\n }\\n If (category = \\\"tsk\\\") ; if the category received is tsk\\n category = Programming_Tasks ; set the category\\n\\n getFile: ; function-internal subroutine for getting a file and parsing it\\n ; construct the url\\n url := \\\"http://www.rosettacode.org/w/api.php?action=query&list=\\\"\\n . \\\"categorymembers&cmtitle=Category:\\\" . category\\n . \\\"&cmlimit=500&format=xml\\\" . doContinue\\n UrlDownloadToFile, %url%, %fileName% ; download the url\\n\\n getFileNoDL: ; function-internal subroutine for parsing a file\\n FileRead, data, %fileName% ; read file into variable\\n pos = 1 ; set while-loop counter\\n rxp = title=\\\"(.*?)\\\" ; set regular expression\\n While (pos := RegExMatch(data, rxp, title, pos)) ; get the contents of the title fields one-by-one\\n {\\n If InStr(title1, \\\"Category:\\\") ; if the contents contain Category:\\n StringTrimLeft, title1, title1, 9 ; remove that from the contents\\n StringReplace, title1, title1, |, `|, All ; escape all containing delimiters\\n title1 := Dec_XML(UTF82Ansi(title1)) ; convert to ansi first and then decode html entities\\n allTitles .= title1 . \\\"|\\\" ; add this title to list\\n pos++ ; increment counter\\n }\\n rxp = cmcontinue=\\\"(.*?)\\\" ; set regular expression\\n If RegExMatch(data, rxp, next) ; when found\\n {\\n doContinue = &cmcontinue=%next1% ; set continuation string to add to url\\n Goto getFile ; go to function-internal subroutine to redownload and parse\\n }\\n StringTrimRight, allTitles, allTitles, 1 ; remove last delimiter from result\\n Return allTitles ; return result\\n}\\n\\n; function to convert html entities to ansi equivalents\\nDec_XML(str)\\n{\\n Loop\\n If RegexMatch(str, \\\"S)(&#(\\\\d+);)\\\", dec)\\n StringReplace, str, str, %dec1%, % Chr(dec2), All\\n Else If RegexMatch(str, \\\"Si)(&#x([\\\\da-f]+);)\\\", hex)\\n StringReplace, str, str, %hex1%, % Chr(\\\"0x\\\" . hex2), All\\n Else\\n Break\\n StringReplace, str, str, , %A_Space%, All\\n StringReplace, str, str, ", \\\", All\\n StringReplace, str, str, ', ', All\\n StringReplace, str, str, <, <, All\\n StringReplace, str, str, >, >, All\\n StringReplace, str, str, &, &, All\\n return, str\\n}\\n\\n; function to uri-encode input string\\nEnc_Uri(str)\\n{\\n f = %A_FormatInteger%\\n SetFormat, Integer, Hex\\n If RegExMatch(str, \\\"^\\\\w+:/{0,2}\\\", pr)\\n StringTrimLeft, str, str, StrLen(pr)\\n StringReplace, str, str, `%, `%25, All\\n Loop\\n If RegExMatch(str, \\\"i)[^\\\\w\\\\.~%/:]\\\", char)\\n StringReplace, str, str, %char%, % \\\"%\\\" . SubStr(Asc(char),3), All\\n Else Break\\n SetFormat, Integer, %f%\\n Return, pr . str\\n}\\n\\n; function to convert unicode to ansi text\\nUTF82Ansi(zString)\\n{\\n Ansi2Unicode(zString, wString, 65001)\\n Unicode2Ansi(wString, sString, 0)\\n Return sString\\n}\\n\\n; helper function for unicode to ansi function\\nAnsi2Unicode(ByRef sString, ByRef wString, CP = 0)\\n{\\n nSize := DllCall(\\\"MultiByteToWideChar\\\", \\\"Uint\\\", CP\\n , \\\"Uint\\\", 0, \\\"Uint\\\", &sString, \\\"int\\\", -1\\n , \\\"Uint\\\", 0, \\\"int\\\", 0)\\n VarSetCapacity(wString, nSize * 2)\\n DllCall(\\\"MultiByteToWideChar\\\"\\n , \\\"Uint\\\", CP, \\\"Uint\\\", 0, \\\"Uint\\\", &sString, \\\"int\\\", -1\\n , \\\"Uint\\\", &wString, \\\"int\\\", nSize)\\n}\\n\\n; helper function for unicode to ansi function\\nUnicode2Ansi(ByRef wString, ByRef sString, CP = 0)\\n{\\n nSize := DllCall(\\\"WideCharToMultiByte\\\"\\n , \\\"Uint\\\", CP, \\\"Uint\\\", 0, \\\"Uint\\\", &wString, \\\"int\\\", -1\\n , \\\"Uint\\\", 0, \\\"int\\\", 0, \\\"Uint\\\", 0, \\\"Uint\\\", 0)\\n VarSetCapacity(sString, nSize)\\n DllCall(\\\"WideCharToMultiByte\\\"\\n , \\\"Uint\\\", CP, \\\"Uint\\\", 0, \\\"Uint\\\", &wString, \\\"int\\\", -1\\n , \\\"str\\\", sString, \\\"int\\\", nSize, \\\"Uint\\\", 0, \\\"Uint\\\", 0)\\n}\\n\\n; subroutine called when user closes the gui\\nGuiClose:\\n ExitApp ; exit the script\\nReturn\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \" SYS \\\"LoadLibrary\\\", \\\"URLMON.DLL\\\" TO U%\\n IF U% == 0 ERROR 100, \\\"DLL not available in your OS\\\"\\n SYS \\\"GetProcAddress\\\", U%, \\\"URLDownloadToFileA\\\" TO U%\\n\\n Q$=CHR$34 : REM The quote\\n BlkSize%=256 * 1024 : REM 256k must be enough\\n DIM Blk% BlkSize% - 1 : REM Reserve memory block to load data into\\n\\n PROCFetchData(\\\"Programming_Tasks\\\")\\n\\n REM Count number of tasks and declare and populate Task$() array.\\n P%=Blk%\\n REPEAT\\n I%=INSTR($$P%, \\\"title\\\")\\n IF I% Tasks%+=1 : P%+=I%\\n UNTIL I% == 0\\n DIM Task$(Tasks%-1)\\n P%=Blk%\\n FOR I%=0 TO Tasks% - 1\\n Task$(I%)=FNValue(P%, \\\"title\\\")\\n NEXT\\n\\n PROCShowUnimplemented(\\\"BBC_BASIC\\\")\\n PROCShowUnimplemented(\\\"C++\\\")\\n END\\n\\n REM -------------------------------------------------------------------------\\n REM Compare each task title against loaded language data in memory.\\n DEF PROCShowUnimplemented(language$)\\n LOCAL i%, j%, mem%, n%\\n\\n PROCFetchData(language$)\\n mem%=Blk%\\n PRINT \\\"Unimplemented tasks for the '\\\" language$ \\\"' programming language:\\\"\\n FOR i%=0 TO Tasks% - 1\\n j%=INSTR($$mem%, Task$(i%))\\n IF j% THEN\\n mem%+=j%\\n ELSE\\n n%+=1\\n PRINT \\\" -\\\" Task$(i%)\\n ENDIF\\n NEXT\\n PRINT \\\"Total is: \\\";n% '\\n ENDPROC\\n\\n REM -------------------------------------------------------------------------\\n REM Stitch the pages for this category together in the memory block.\\n DEF PROCFetchData(category$)\\n LOCAL mem%, continue$, e%, f%, tempfile$, url$\\n\\n tempfile$=@tmp$ + \\\"result.json\\\"\\n mem%=Blk%\\n REPEAT\\n url$=\\\"http://www.rosettacode.org/w/api.php?\\\" +\\\\\\n \\\\ \\\"action=query&list=categorymembers&cmtitle=Category:\\\" + category$ +\\\\\\n \\\\ \\\"&cmlimit=500&format=json&cmcontinue=\\\" + continue$\\n\\n SYS U%, 0, url$, tempfile$, 0, 0 TO e% : REM Get one page to a file\\n IF e% ERROR 100, \\\"Can't get data from Rosetta API\\\"\\n\\n f%=OPENINtempfile$ : e%=EXT#f% : CLOSE#f% : REM Get file size\\n IF mem% - Blk% + e% > BlkSize% ERROR 100, \\\"Insufficient memory to load data\\\"\\n OSCLI \\\"LOAD \\\" + tempfile$ + \\\" \\\" + STR$~mem% : REM Append to previous\\n e%=mem% + e%\\n ?e%=0 : REM Terminating 0x00\\n continue$=FNValue(mem%, \\\"cmcontinue\\\") : REM Loaded page contains this name?\\n mem%=e% : REM Advance memory pointer\\n UNTIL continue$ == \\\"\\\"\\n ENDPROC\\n\\n REM -------------------------------------------------------------------------\\n REM Retrieve value for a JSON name from address p% and advance p% afterwards.\\n DEF FNValue(RETURN p%, name$)\\n LOCAL s%\\n\\n name$=Q$ + name$ + Q$ + \\\":\\\"\\n s%=INSTR($$p%, name$)\\n IF s% == 0 THEN =\\\"\\\"\\n p%+=s% + LENname$\\n =LEFT$($$p%, INSTR($$p%, Q$) - 1)\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\nusing System.Text.RegularExpressions;\\nusing System.Net;\\n\\nclass Program {\\n static List<string> GetTitlesFromCategory(string category) {\\n string searchQueryFormat = \\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:{0}&format=json{1}\\\";\\n List<string> results = new List<string>();\\n string cmcontinue = string.Empty;\\n\\n do {\\n string cmContinueKeyValue;\\n\\n //append continue variable as needed\\n if (cmcontinue.Length > 0)\\n cmContinueKeyValue = String.Format(\\\"&cmcontinue={0}\\\", cmcontinue);\\n else\\n cmContinueKeyValue = String.Empty;\\n\\n //execute query\\n string query = String.Format(searchQueryFormat, category, cmContinueKeyValue);\\n string content = new WebClient().DownloadString(query);\\n\\n results.AddRange(new Regex(\\\"\\\\\\\"title\\\\\\\":\\\\\\\"(.+?)\\\\\\\"\\\").Matches(content).Cast<Match>().Select(x => x.Groups[1].Value));\\n\\n //detect if more results are available\\n cmcontinue = Regex.Match(content, @\\\"{\\\"\\\"cmcontinue\\\"\\\":\\\"\\\"([^\\\"\\\"]+)\\\"\\\"}\\\", RegexOptions.IgnoreCase).Groups[\\\"1\\\"].Value;\\n } while (cmcontinue.Length > 0);\\n\\n return results;\\n }\\n\\n static string[] GetUnimplementedTasksFromLanguage(string language) {\\n List<string> alltasks = GetTitlesFromCategory(\\\"Programming_Tasks\\\");\\n List<string> lang = GetTitlesFromCategory(language);\\n\\n return alltasks.Where(x => !lang.Contains(x)).ToArray();\\n }\\n\\n static void Main(string[] args) {\\n string[] unimpl = GetUnimplementedTasksFromLanguage(args[0]);\\n\\n foreach (string i in unimpl) Console.WriteLine(i);\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(require\\n '[clojure.xml :as xml]\\n '[clojure.set :as set]\\n '[clojure.string :as string])\\n(import '[java.net URLEncoder])\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defn titles-cont [url]\\n (let [docseq (-> url xml/parse xml-seq)]\\n ((juxt #(filter string? %), #(-> (filter map? %) first :cmcontinue))\\n (for [{:keys [tag attrs content]} docseq :when (#{:cm :query-continue} tag)]\\n (if (= tag :cm)\\n (attrs :title)\\n (-> content first :attrs))))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defn urlencode [s] (URLEncoder/encode s \\\"UTF-8\\\"))\\n(defn param [p v] (str p (urlencode v)))\\n\\n(defn get-titles\\n ([category]\\n (let [urlbase \\\"http://www.rosettacode.org/w/api.php\\\"\\n params [\\\"action=query\\\"\\n \\\"list=categorymembers\\\"\\n \\\"format=xml\\\"\\n \\\"cmlimit=200\\\"\\n (param \\\"cmtitle=Category:\\\" category)]\\n url (str urlbase \\\"?\\\" (string/join \\\"&\\\" params)]\\n (get-titles url nil)))\\n ([url continue-at]\\n (let [continue-param (if continue-at (param \\\"&cmcontinue=\\\" continue-at))\\n [titles continue] (titles-cont (str url continue-param))]\\n (if continue\\n (lazy-cat titles (get-titles url continue))\\n titles))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defn unimplemented [lang-name]\\n (let [title-set #(future (apply sorted-set (get-titles %)))\\n all-titles (title-set \\\"Programming_Tasks\\\")\\n lang-titles (title-set lang-name)]\\n (seq (set/difference @all-titles @lang-titles))))\\n\\n(let [titles (unimplemented \\\"Clojure\\\")]\\n (doseq [title titles] (println title))\\n (println \\\"count: \\\" (count titles)))\\n(shutdown-agents)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"#!/usr/bin/env rune\\n\\n# NOTE: This program will not work in released E, because TermL is an\\n# imperfect superset of JSON in that version: it does not accept \\\"\\\\/\\\".\\n# If you build E from the latest source in SVN then it will work.\\n#\\n# Usage: rosettacode-cat-subtract.e [<syntaxhighlight lang=\\\"e\\\">]\\n#\\n# Prints a list of tasks which have not been completed in the language.\\n# If unspecified, the default language is E.\\n\\npragma.syntax(\\\"0.9\\\")\\npragma.enable(\\\"accumulator\\\")\\n\\ndef termParser := <import:org.quasiliteral.term.makeTermParser>\\ndef jURLEncoder := <unsafe:java.net.makeURLEncoder>\\n\\ndef urlEncode(text) {\\n return jURLEncoder.encode(text, \\\"UTF-8\\\")\\n}\\n\\n/** Convert JSON-as-term-tree to the corresponding natural E data structures. */\\ndef jsonTermToData(term) {\\n switch (term) {\\n\\n # JSON object to E map\\n match term`{@assocs*}` {\\n return accum [].asMap() for term`@{key :String}: @valueJson` in assocs {\\n _.with(key, jsonTermToData(valueJson))\\n }\\n }\\n\\n # JSON array to E list\\n match term`[@elements*]` {\\n return accum [] for elem in elements { _.with(jsonTermToData(elem)) }\\n }\\n\\n # Literals just need to be coerced\\n match lit :any[String, int, float64] {\\n return lit\\n }\\n\\n # Doesn't support true/false/null, but we don't need that for this application.\\n }\\n}\\n\\ndef fetchCategoryAccum(name, membersSoFar :Set, extraArgs) {\\n stderr.println(`Fetching Category:$name $extraArgs...`)\\n\\n def categoryAPIResource := <http>[`//rosettacode.org/w/api.php?` +\\n `action=query&list=categorymembers&cmtitle=Category:${urlEncode(name)}&` +\\n `format=json&cmlimit=500&cmprop=title$extraArgs`]\\n\\n def members :=\\n when (def responseJSON := categoryAPIResource <- getTwine()) -> {\\n # stderr.println(`Fetched Category:$name $extraArgs, parsing...`)\\n def response := jsonTermToData(termParser(responseJSON))\\n\\n # stderr.println(`Parsed Category:$name $extraArgs response, extracting data...`)\\n def [\\n \\\"query\\\" => [\\\"categorymembers\\\" => records],\\n \\\"query-continue\\\" => continueData := null\\n ] := response\\n def members := accum membersSoFar for record in records { _.with(record[\\\"title\\\"]) }\\n\\n switch (continueData) {\\n match ==null {\\n stderr.println(`Got all ${members.size()} for Category:$name.`)\\n members\\n }\\n match [\\\"categorymembers\\\" => [\\\"cmcontinue\\\" => continueParam]] {\\n stderr.println(`Fetched ${members.size()} members for Category:$name...`)\\n fetchCategoryAccum(name, members, `&cmcontinue=` + urlEncode(continueParam))\\n }\\n }\\n } catch p { throw(p) }\\n\\n return members\\n}\\n\\ndef fetchCategory(name) {\\n return fetchCategoryAccum(name, [].asSet(), \\\"\\\")\\n}\\n\\n# Interpret program arguments\\ndef lang := switch (interp.getArgs()) {\\n match [lang] { lang }\\n match [] { \\\"E\\\" }\\n}\\n\\n# Fetch categories\\nwhen (def allTasks := fetchCategory(\\\"Programming_Tasks\\\"),\\n def doneTasks := fetchCategory(lang),\\n def omitTasks := fetchCategory(lang + \\\"/Omit\\\")\\n ) -> {\\n\\n # Compute difference and report\\n def notDoneTasks := allTasks &! (doneTasks | omitTasks)\\n println()\\n println(\\\"\\\\n\\\".rjoin(notDoneTasks.getElements().sort()))\\n\\n} catch p {\\n # Whoops, something went wrong\\n stderr.println(`$p${p.eStack()}`)\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"-module( find_unimplemented_tasks ).\\n-include_lib( \\\"xmerl/include/xmerl.hrl\\\" ).\\n\\n-export( [init_http/0, per_language/1, rosetta_code_list_of/1] ).\\n\\ninit_http() ->\\n\\tapplication:start( inets ).\\n\\nper_language( Language ) ->\\n\\tok = init_http(),\\n\\tTasks = rosetta_code_list_of( \\\"Programming_Tasks\\\" ),\\n\\tUninplemented = Tasks -- rosetta_code_list_of( Language ),\\n\\tio:fwrite( \\\"Unimplemented total: ~p~n\\\", [erlang:length(Uninplemented)] ),\\n\\t[io:fwrite(\\\"~p~n\\\", [X]) || X <- Uninplemented].\\n\\nrosetta_code_list_of( Category ) ->\\n\\tURL = \\\"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmlimit=500&format=xml&cmtitle=Category:\\\"\\n\\t++ Category,\\n\\ttitle_contents( URL, \\\"\\\", [] ).\\n\\n\\n\\ntitle_contents( URL, Continue, Acc ) ->\\n\\t{ok, {{_HTTP,200,\\\"OK\\\"}, _Headers, Body}} = httpc:request( URL ++ Continue ),\\n\\t{XML, _} = xmerl_scan:string( Body ),\\n\\tNews = xml_selection( \\\"title\\\", XML ),\\n\\tNew_continue = title_contents_url_continue( xml_selection(\\\"cmcontinue\\\", XML) ),\\n\\ttitle_contents_continue( URL, New_continue, Acc ++ News ).\\n\\ntitle_contents_continue( _URL, \\\"\\\", Acc ) -> Acc;\\ntitle_contents_continue( URL, Continue, Acc ) -> title_contents( URL, Continue, Acc ).\\n\\ntitle_contents_url_continue( [] ) -> \\\"\\\";\\ntitle_contents_url_continue( [Continue | _] ) -> \\\"&cmcontinue=\\\" ++ Continue.\\n\\nxml_selection( Selection, XML ) ->\\n\\t[lists:map( fun xml_8211/1, X) || #xmlAttribute{value=X} <- xmerl_xpath:string(\\\"//@\\\" ++ Selection, XML)].\\n\\nxml_8211( 8211 ) -> $-;\\nxml_8211( 924 ) -> $\\\\s;\\nxml_8211( 1050 ) -> $\\\\s;\\nxml_8211( 1052 ) -> $\\\\s;\\nxml_8211( Character ) -> Character.\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"encoding/xml\\\"\\n \\\"fmt\\\"\\n \\\"io\\\"\\n \\\"net/http\\\"\\n \\\"net/url\\\"\\n)\\n\\nconst language = \\\"Go\\\"\\n\\nvar baseQuery = \\\"http://rosettacode.org/mw/api.php?action=query\\\" +\\n \\\"&format=xml&list=categorymembers&cmlimit=100\\\"\\n\\nfunc req(u string, foundCm func(string)) string {\\n resp, err := http.Get(u)\\n if err != nil {\\n fmt.Println(err) // connection or request fail\\n return \\\"\\\"\\n }\\n defer resp.Body.Close()\\n for p := xml.NewDecoder(resp.Body); ; {\\n t, err := p.RawToken()\\n switch s, ok := t.(xml.StartElement); {\\n case err == io.EOF:\\n return \\\"\\\"\\n case err != nil:\\n fmt.Println(err)\\n return \\\"\\\"\\n case !ok:\\n continue\\n case s.Name.Local == \\\"cm\\\":\\n for _, a := range s.Attr {\\n if a.Name.Local == \\\"title\\\" {\\n foundCm(a.Value)\\n }\\n }\\n case s.Name.Local == \\\"categorymembers\\\" && len(s.Attr) > 0 &&\\n s.Attr[0].Name.Local == \\\"cmcontinue\\\":\\n return url.QueryEscape(s.Attr[0].Value)\\n }\\n }\\n return \\\"\\\"\\n}\\n\\nfunc main() {\\n // get language members, store in a map\\n langMap := make(map[string]bool)\\n storeLang := func(cm string) { langMap[cm] = true }\\n languageQuery := baseQuery + \\\"&cmtitle=Category:\\\" + language\\n continueAt := req(languageQuery, storeLang)\\n for continueAt > \\\"\\\" {\\n continueAt = req(languageQuery+\\\"&cmcontinue=\\\"+continueAt, storeLang)\\n }\\n\\n // a quick check to avoid long output\\n if len(langMap) == 0 {\\n fmt.Println(\\\"no tasks implemented for\\\", language)\\n return\\n }\\n\\n // get tasks, print as we go along\\n printUnImp := func(cm string) {\\n if !langMap[cm] {\\n fmt.Println(cm)\\n }\\n }\\n taskQuery := baseQuery + \\\"&cmtitle=Category:Programming_Tasks\\\"\\n continueAt = req(taskQuery, printUnImp)\\n for continueAt > \\\"\\\" {\\n continueAt = req(taskQuery+\\\"&cmcontinue=\\\"+continueAt, printUnImp)\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Network.Browser\\nimport Network.HTTP\\nimport Network.URI\\nimport Data.List\\nimport Data.Maybe\\nimport Text.XML.Light\\nimport Control.Arrow\\nimport Data.Char\\n\\ngetRespons url = do\\n rsp <- Network.Browser.browse $ do\\n setAllowRedirects True\\n setOutHandler $ const (return ()) -- quiet\\n request $ getRequest url\\n return $ rspBody $ snd rsp\\n\\nreplaceWithSpace c = (\\\\x -> if c==x then ' ' else x)\\n\\nencl = chr 34\\n\\nunimpTasks lang = do\\n allTasks <- getRespons \\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\"\\n impl <- getRespons ( \\\"http://rosettacode.org/json/isb/\\\" ++ lang ++ \\\".json\\\")\\n let langxx = map (map(replaceWithSpace '_')) $ filter (/=\\\",\\\") $ words $ map (replaceWithSpace encl ) $ init $ drop 1 impl\\n xml = onlyElems $ parseXML allTasks\\n allxx = concatMap (map (fromJust.findAttr (unqual \\\"title\\\")). filterElementsName (== unqual \\\"cm\\\")) xml\\n mapM_ putStrLn $ sort $ allxx \\\\\\\\ langxx\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Network.HTTP\\nimport Data.Text (splitOn, pack, unpack)\\nimport Data.List\\n\\ngetTasks :: String -> IO [String]\\ngetTasks url = do\\n resp <- simpleHTTP (getRequest url)\\n body <- getResponseBody resp\\n return $ tail $ map (unpack . head . splitOn (pack \\\"\\\\\\\"}\\\")) $ splitOn (pack \\\"\\\\\\\"title\\\\\\\":\\\\\\\"\\\") (pack body)\\n\\nmain :: String -> IO ()\\nmain lang = do\\n implTasks <- getTasks $ \\\"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:\\\" ++ lang ++ \\\"&format=json&cmlimit=500\\\"\\n allTasks <- getTasks \\\"http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&format=json&cmlimit=500\\\"\\n mapM_ putStrLn $ allTasks \\\\\\\\ implTasks\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"$define RCINDEX \\\"http://rosettacode.org/mw/api.php?format=xml&action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500\\\"\\n$define RCTASK \\\"http://rosettacode.org/mw/index.php?action=raw&title=\\\"\\n$define RCUA \\\"User-Agent: Unicon Rosetta 0.1\\\"\\n$define RCXUA \\\"X-Unicon: http://unicon.org/\\\"\\n$define TASKTOT \\\"* Total Tasks *\\\"\\n$define TOTTOT \\\"* Total Headers*\\\"\\n\\nlink strings\\nlink hexcvt\\n\\nprocedure main(A) # simple single threaded read all at once implementation\\n lang := \\\\A[1] | \\\"Unicon\\\"\\n write(\\\"Unimplemented tasks for \\\",lang,\\\" as of \\\",&date)\\n every task := taskNames() do {\\n if lang == languages(task) then next\\n write(task)\\n }\\nend\\n\\n# Generate task names\\nprocedure taskNames()\\n continue := \\\"\\\"\\n while \\\\(txt := ReadURL(RCINDEX||continue)) do {\\n txt ? {\\n while tab(find(\\\"<cm \\\") & find(s :=\\\"title=\\\\\\\"\\\")+*s) do\\n suspend tab(find(\\\"\\\\\\\"\\\"))\\\\1\\n if tab(find(\\\"cmcontinue=\\\")) then {\\n continue := \\\"&\\\"||tab(upto(' \\\\t'))\\n }\\n else break\\n }\\n }\\nend\\n\\n# Generate language headers in a task\\nprocedure languages(task)\\n static WS\\n initial WS := ' \\\\t'\\n page := ReadURL(RCTASK||CleanURI(task))\\n page ? while (tab(find(\\\"\\\\n==\\\")),tab(many(WS))|\\\"\\\",tab(find(\\\"{{\\\"))) do {\\n header := tab(find(\\\"==\\\"))\\n header ? {\\n while tab(find(\\\"{{header|\\\")) do {\\n suspend 2(=\\\"{{header|\\\",tab(find(\\\"}}\\\")))\\\\1\\n }\\n }\\n }\\nend\\n\\nprocedure CleanURI(u) #: clean up a URI\\n static tr,dxml # xml & http translation\\n initial {\\n tr := table()\\n every c := !string(~(&digits++&letters++'-_.!~*()/\\\\'`')) do\\n tr[c] := \\\"%\\\"||hexstring(ord(c),2)\\n every /tr[c := !string(&cset)] := c\\n tr[\\\" \\\"] := \\\"_\\\" # wiki convention\\n every push(dxml := [],\\\"&#\\\"||right(ord(c := !\\\"&<>'\\\\\\\"\\\"),3,\\\"0\\\")||\\\";\\\",c)\\n }\\n\\n dxml[1] := u # insert URI as 1st arg\\n u := replacem!dxml # de-xml it\\n every (c := \\\"\\\") ||:= tr[!u] # reencode everything\\n c := replace(c,\\\"%3E\\\",\\\"'\\\") # Hack to put single quotes back in\\n c := replace(c,\\\"%26quot%3B\\\",\\\"\\\\\\\"\\\") # Hack to put double quotes back in\\n return c\\nend\\n\\nprocedure ReadURL(url) #: read URL into string\\n page := open(url,\\\"m\\\",RCUA,RCXUA) | stop(\\\"Unable to open \\\",url)\\n text := \\\"\\\"\\n if page[\\\"Status-Code\\\"] < 300 then while text ||:= reads(page,-1)\\n else write(&errout,image(url),\\\": \\\",\\n page[\\\"Status-Code\\\"],\\\" \\\",page[\\\"Reason-Phrase\\\"])\\n close(page)\\n return text\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"require 'strings web/gethttp'\\n\\nfindUnimpTasks=: ('Programming_Tasks' -.&getCategoryMembers ,&'/Omit') ([ #~ -.@e.) getCategoryMembers\\n\\ngetTagContents=: dyad define\\n 'starttag endtag'=. x\\n ('\\\\' -.~ endtag&taketo)&.>@(starttag&E. <@((#starttag)&}.);.1 ]) y\\n)\\n\\nNB. RosettaCode Utilities\\nparseTitles=: ('\\\"title\\\":\\\"';'\\\"')&getTagContents\\nparseCMcontinue=:('\\\"cmcontinue\\\":\\\"';'\\\"')&getTagContents\\ngetCMcontquery=: ('&cmcontinue=' , urlencode)^:(0 < #)@>@parseCMcontinue\\n\\ngetCategoryMembers=: monad define\\n buildqry=. 'action=query&list=categorymembers&cmtitle=Category:' , ,&'&cmlimit=500&format=json'\\n url=.'http://www.rosettacode.org/w/api.php'\\n uri=. url ,'?', buildqry urlencode y\\n catmbrs=. qrycont=. ''\\n whilst. #qrycont=. ,getCMcontquery jsondat do.\\n jsondat=. '-sL' gethttp uri , qrycont\\n catmbrs=. catmbrs, parseTitles jsondat\\n end.\\n catmbrs\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 4{. findUnimpTasks 'J' NB. get first 4 unimplemented tasks for J\\n┌────────────────┬────────────────────────┬──────────────────────────────────┬──────────────┐\\n│15 puzzle solver│Active Directory/Connect│Active Directory/Search for a user│Atomic updates│\\n└────────────────┴────────────────────────┴──────────────────────────────────┴──────────────┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"(function (strXPath) {\\n var xr = document.evaluate(\\n strXPath,\\n document,\\n null, 0, 0\\n ),\\n\\n oNode = xr.iterateNext(),\\n lstTasks = [];\\n\\n while (oNode) {\\n lstTasks.push(oNode.title);\\n oNode = xr.iterateNext();\\n }\\n\\n return [\\n lstTasks.length + \\\" items found in \\\" + document.title,\\n ''\\n ].concat(lstTasks).join('\\\\n')\\n\\n})(\\n '//*[@id=\\\"mw-content-text\\\"]/div[2]/table/tbody/tr/td/ul/li/a'\\n);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"using HTTP, JSON\\n\\nconst baseuri = \\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:\\\"\\nconst enduri = \\\"&cmlimit=500&format=json\\\"\\nqueries(x) = baseuri * HTTP.Strings.escapehtml(x) * enduri\\n\\nfunction getimplemented(query)\\n tasksdone = Vector{String}()\\n request = query\\n while (resp = HTTP.request(\\\"GET\\\", request)).status == 200\\n fromjson = JSON.parse(String(resp.body))\\n for d in fromjson[\\\"query\\\"][\\\"categorymembers\\\"]\\n if haskey(d, \\\"title\\\")\\n push!(tasksdone, d[\\\"title\\\"])\\n end\\n end\\n if haskey(fromjson, \\\"continue\\\")\\n cmcont, cont = fromjson[\\\"continue\\\"][\\\"cmcontinue\\\"], fromjson[\\\"continue\\\"][\\\"continue\\\"]\\n request = query * \\\"&cmcontinue=$cmcont&continue=$cont\\\"\\n else\\n break\\n end\\n end\\n tasksdone\\nend\\n\\nalltasks = getimplemented(queries(\\\"Programming_Tasks\\\"))\\n\\nshowunimp(x) = (println(\\\"\\\\nUnimplemented in $x:\\\"); for t in setdiff(alltasks,\\n getimplemented(queries(x))) println(t) end)\\n\\nshowunimp(\\\"Julia\\\")\\nshowunimp(\\\"C++\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"local requests = require('requests')\\nlocal lang = arg[1]\\n\\nlocal function merge_tables(existing, from_req)\\n local result = existing\\n\\n for _, v in ipairs(from_req) do\\n result[v.title] = true\\n end\\n\\n return result\\nend\\n\\nlocal function get_task_list(category)\\n local url = 'http://www.rosettacode.org/mw/api.php'\\n local query = {\\n action = 'query',\\n list = 'categorymembers',\\n cmtitle = string.format('Category:%s', category),\\n cmlimit = 500,\\n cmtype = 'page',\\n format = 'json'\\n }\\n local categories = {}\\n\\n while true do\\n local resp = assert(requests.get({ url, params = query }).json())\\n\\n categories = merge_tables(categories, resp.query.categorymembers)\\n\\n if resp.continue then\\n query.cmcontinue = resp.continue.cmcontinue\\n else\\n break\\n end\\n end\\n\\n return categories\\nend\\n\\nlocal function get_open_tasks(lang)\\n if not lang then error('Language missing!') end\\n local all_tasks = get_task_list('Programming_Tasks')\\n local lang_tasks = get_task_list(lang)\\n local task_list = {}\\n\\n for t, _ in pairs(all_tasks) do\\n if not lang_tasks[t] then\\n table.insert(task_list, t)\\n end\\n end\\n\\n table.sort(task_list)\\n return task_list\\nend\\n\\nlocal open_tasks = get_open_tasks(lang)\\n\\nio.write(string.format('%s has %d unimplemented programming tasks: \\\\n', lang, #open_tasks))\\nfor _, t in ipairs(open_tasks) do\\n io.write(string.format(' %s\\\\n', t))\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"#Example with the Maple Language\\nlan := \\\"Maple\\\":\\nx := URL:-Get(cat(\\\"http://rosettacode.org/wiki/Reports:Tasks_not_implemented_in_\\\", StringTools:-SubstituteAll(lan, \\\" \\\", \\\"_\\\")), output = content):\\nx := StringTools:-StringSplit(x, \\\"<h2><span class=\\\\\\\"mw-headline\\\\\\\" id=\\\\\\\"Not_implemented\\\\\\\">Not implemented</span>\\\")[2]:\\nx := StringTools:-StringSplit(x, \\\"<span class=\\\\\\\"mw-headline\\\\\\\" id=\\\\\\\"Draft_tasks_without_implementation\\\\\\\">Draft tasks without implementation</span>\\\")[1]:\\nx := StringTools:-StringSplit(x,\\\"<li><a href=\\\\\\\"/wiki/\\\")[2..]:\\nfor problem in x do\\n\\tprintf(\\\"%s\\\\n\\\", StringTools:-SubstituteAll(StringTools:-Decode(StringTools:-StringSplit(problem, \\\"\\\\\\\" title=\\\")[1], 'percent'), \\\"_\\\", \\\" \\\"));\\nend do:\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"ClearAll[ImportAll]\\nImportAll[lang_String] :=\\n Module[{data, continue, cmcontinue, extra, xml, next},\\n data = {};\\n continue = True;\\n cmcontinue = \\\"\\\";\\n While[continue,\\n extra = If[cmcontinue =!= \\\"\\\", \\\"&cmcontinue=\\\" <> cmcontinue, \\\"\\\"];\\n xml = Import[\\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:\\\" <> lang <> \\\"&cmlimit=500&format=xml\\\" <> extra, \\\"XML\\\"];\\n AppendTo[data, Cases[xml, XMLElement[\\\"cm\\\", _, {}], \\\\[Infinity]]];\\n next = Flatten[Cases[xml, {\\\"cmcontinue\\\" -> _}, \\\\[Infinity]]];\\n If[Length[next] > 0,\\n next = First[next];\\n cmcontinue = \\\"cmcontinue\\\" /. next;\\n ,\\n continue = False;\\n ];\\n ];\\n Cases[Flatten[data], HoldPattern[\\\"title\\\" -> x_] :> x, \\\\[Infinity]]\\n ]\\nComplement[ImportAll[\\\"Programming_Tasks\\\"], ImportAll[\\\"Mathematica\\\"]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"url = \\\"http://rosettacode.org/wiki/Reports:Tasks_not_implemented_in_Mathematica\\\";\\nhtml = Import[url, \\\"XMLObject\\\"];\\npos = Position[html, XMLElement[\\\"div\\\", {\\\"class\\\" -> \\\"mw-content-ltr\\\", \\\"dir\\\" -> \\\"ltr\\\", \\\"lang\\\" -> \\\"en\\\"}, ___]];\\npos = First[pos];\\ndata = Extract[html, pos];\\npos = Position[data, XMLElement[\\\"li\\\", {}, {XMLElement[\\\"a\\\", {\\\"shape\\\" -> \\\"rect\\\", \\\"href\\\" -> _, \\\"title\\\" -> x_}, {x_}]}]];\\ndata = Extract[data, pos];\\ndata = data[[All, -1, -1, 2]];\\ndata = {\\\"title\\\", \\\"href\\\"} /. # & /@ %;\\ndata[[All, 2]] = \\\"http://rosettacode.org\\\" <> # & /@ data[[All, 2]];\\nnewb = data[[All, 1]];\\ndata = Hyperlink @@@ data;\\ndata // Column\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import httpclient, strutils, xmltree, xmlparser, cgi, os\\n\\n\\nproc findrc(category: string): seq[string] =\\n\\n var\\n name = \\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:$#&cmlimit=500&format=xml\\\" % encodeUrl(category)\\n cmcontinue = \\\"\\\"\\n client = newHttpClient()\\n\\n while true:\\n var x = client.getContent(name & cmcontinue).parseXml()\\n for node in x.findAll(\\\"cm\\\"):\\n result.add node.attr(\\\"title\\\")\\n\\n cmcontinue.setLen(0)\\n for node in x.findAll(\\\"continue\\\"):\\n let u = node.attr(\\\"cmcontinue\\\")\\n if u.len != 0: cmcontinue = u.encodeUrl()\\n\\n if cmcontinue.len > 0: cmcontinue = \\\"&cmcontinue=\\\" & cmcontinue\\n else: break\\n\\n\\nproc chooselang(): string =\\n if paramCount() < 1: \\\"Nim\\\" else: paramStr(1)\\n\\n\\nlet alltasks = findrc(\\\"Programming_Tasks\\\")\\nlet lang = chooselang()\\nlet langTasks = lang.findrc()\\necho \\\"Unimplemented tasks for language \\\", lang, ':'\\nfor task in alltasks:\\n if task notin langTasks:\\n echo \\\" \\\", task\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"declare\\n [HTTPClient] = {Link ['x-ozlib://mesaros/net/HTTPClient.ozf']}\\n [XMLParser] = {Link ['x-oz://system/xml/Parser.ozf']}\\n\\n fun {FindUnimplementedTasks Language}\\n AllTasks = {FindCategory \\\"Programming Tasks\\\"}\\n LangTasks = {FindCategory Language}\\n in\\n {ListDiff AllTasks LangTasks}\\n end\\n\\n fun {FindCategory Cat}\\n CatUrl = \\\"http://www.rosettacode.org/mw/api.php?action=query\\\"\\n #\\\"&list=categorymembers\\\"\\n #\\\"&cmtitle=Category:\\\"#{PercentEncode Cat}\\n #\\\"&cmlimit=500&format=xml\\\"\\n\\n fun {Loop CMContinue}\\n [_ Doc] = {Parse {GetPage CatUrl#CMContinue}}\\n Titles = {XPath Doc\\n [api query categorymembers cm {Attribute title}]}\\n in\\n case {XPath Doc\\n [api 'query-continue' categorymembers {Attribute cmcontinue}]}\\n of nil then Titles\\n [] [NewCMContinueAtom] then\\n NewCMContinue = {PercentEncode {Atom.toString NewCMContinueAtom}}\\n in\\n {Append Titles\\n {Loop \\\"&cmcontinue=\\\"#NewCMContinue}}\\n end\\n end\\n in\\n {Loop nil}\\n end\\n\\n\\n %% XPath emulation\\n fun {XPath Doc Path}\\n P|Pr = Path\\n in\\n Doc.name = P %% assert\\n {FoldL Pr XPathStep [Doc]}\\n end\\n\\n Nothing = {NewName}\\n fun {NotNothing X} X \\\\= Nothing end\\n\\n fun {XPathStep Elements P}\\n if {Atom.is P} then\\n {FilteredChildren Elements P}\\n elseif {Procedure.is P} then\\n {Filter {Map Elements P} NotNothing}\\n end\\n end\\n\\n %% A flat list of all Type-children of all Elements.\\n fun {FilteredChildren Elements Type}\\n {Flatten\\n {Map Elements\\n fun {$ E}\\n {Filter E.children\\n fun {$ X}\\n case X of element(name:!Type ...) then true\\n else false\\n end\\n end}\\n end}}\\n end\\n\\n fun {Attribute Attr}\\n fun {$ Element}\\n case {Filter Element.attributes fun {$ A} A.name == Attr end}\\n of [A] then A.value\\n else Nothing\\n end\\n end\\n end\\n\\n\\n %% GetPage\\n Client = {New HTTPClient.urlGET init(inPrms(toFile:false toStrm:true) _)}\\n fun {GetPage RawUrl}\\n Url = {VirtualString.toString RawUrl}\\n OutParams\\n in\\n {Client getService(Url ?OutParams ?_)}\\n OutParams.sOut\\n end\\n\\n fun {PercentEncode Xs}\\n case Xs of nil then nil\\n [] X|Xr then\\n if {Char.isDigit X} orelse {Member X [&- &_ &. &~]}\\n orelse X >= &a andthen X =< &z\\n orelse X >= &z andthen X =< &Z then\\n X|{PercentEncode Xr}\\n else\\n {Append &%|{ToHex2 X} {PercentEncode Xr}}\\n end\\n end\\n end\\n\\n fun {ToHex2 X}\\n [{ToHex1 X div 16} {ToHex1 X mod 16}]\\n end\\n\\n fun {ToHex1 X}\\n if X >= 0 andthen X =< 9 then &0 + X\\n elseif X >= 10 andthen X =< 15 then &A + X - 10\\n end\\n end\\n\\n\\n %% Parse\\n local\\n Parser = {New XMLParser.parser init}\\n in\\n fun {Parse Xs} {Parser parseVS(Xs $)} end\\n end\\n\\n fun {ListDiff Xs Ys}\\n {FoldL Ys List.subtract Xs}\\n end\\nin\\n %% show tasks not implemented in Oz\\n {ForAll {FindUnimplementedTasks \\\"Oz\\\"} System.showInfo}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"use LWP::UserAgent;\\n\\nmy $ua = LWP::UserAgent->new;\\n$ua->agent('');\\n\\nsub enc { join '', map {sprintf '%%%02x', ord} split //, shift }\\nsub get { $ua->request( HTTP::Request->new( GET => shift))->content }\\n\\nsub tasks {\\n my($category) = shift;\\n my $fmt = 'http://www.rosettacode.org/w/api.php?' .\\n 'action=query&generator=categorymembers&gcmtitle=Category:%s&gcmlimit=500&format=json&rawcontinue=';\\n my @tasks;\\n my $json = get(sprintf $fmt, $category);\\n while (1) {\\n push @tasks, $json =~ /\\\"title\\\":\\\"(.+?)\\\"\\\\}/g;\\n $json =~ /\\\"gcmcontinue\\\":\\\"(.+?)\\\"\\\\}/ or last;\\n $json = get(sprintf $fmt . '&gcmcontinue=%s', $category, enc $1);\\n }\\n @tasks;\\n}\\n\\nmy %language = map {$_, 1} tasks shift || 'perl';\\n$language{$_} or print \\\"$_\\\\n\\\" foreach tasks('Programming_Tasks'), tasks('Draft_Programming_Tasks');\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- demo\\\\rosetta\\\\Find_unimplemented_tasks.exw</span>\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (libcurl, file i/o, peek, progress..)</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">language</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"Phix\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- language = \\\"Go\\\",\\n -- language = \\\"Julia\\\",\\n -- language = \\\"Python\\\",\\n -- language = \\\"Wren\\\",</span>\\n <span style=\\\"color: #000000;\\\">base_query</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"http://rosettacode.org/mw/api.php?action=query\\\"</span><span style=\\\"color: #0000FF;\\\">&</span>\\n <span style=\\\"color: #008000;\\\">\\\"&format=xml&list=categorymembers&cmlimit=100\\\"</span>\\n\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">builtins</span><span style=\\\"color: #0000FF;\\\">\\\\</span><span style=\\\"color: #000000;\\\">libcurl</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">curl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">NULL</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">pErrorBuffer</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">builtins</span><span style=\\\"color: #0000FF;\\\">\\\\</span><span style=\\\"color: #000000;\\\">xml</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">req</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">url</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">rid</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">NULL</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">curl_global_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">curl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">curl_easy_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">pErrorBuffer</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">allocate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">CURL_ERROR_SIZE</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">curl_easy_setopt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">CURLOPT_ERRORBUFFER</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pErrorBuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">curl_easy_setopt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">CURLOPT_URL</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">url</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">curl_easy_perform_ex</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curl</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #004080;\\\">integer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">error</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%d [%s]\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">peek_string</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pErrorBuffer</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Download error: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">error</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #004080;\\\">string</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">xml</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">xml_parse</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)[</span><span style=\\\"color: #000000;\\\">XML_CONTENTS</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">xml_get_nodes</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">xml</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"continue\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">=={}?</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">xml_get_attribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #008000;\\\">\\\"cmcontinue\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">xml</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">xml_get_nodes</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">xml</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"query\\\"</span><span style=\\\"color: #0000FF;\\\">)[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">xml</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">xml_get_nodes</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">xml</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"categorymembers\\\"</span><span style=\\\"color: #0000FF;\\\">)[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">xml</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">xml_get_nodes</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">xml</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"cm\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">xml</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">call_proc</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rid</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">xml_get_attribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">xml</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #008000;\\\">\\\"title\\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">html_clean</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`"`</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`\\\"`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`'`</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`'`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\xE2\\\\x80\\\\x99\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"'\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\xC3\\\\xB6\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"o\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%3A\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\":\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%E2%80%93\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"-\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%E2%80%99\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"'\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%27\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"'\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%2B\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"+\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%C3%A8\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"e\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%C3%A9\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"e\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%C3%B6\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"o\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%C5%91\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"o\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%22\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`\\\"`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%2A\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"*\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">ri</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">titles</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">store_title</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">title</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">titles</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">titles</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">title</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">unimplemented_count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">task_count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">print_unimplemented</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">title</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">title</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">titles</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">title</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">html_clean</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">title</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">title</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">unimplemented_count</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">task_count</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Loading implemented tasks list...\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- get and store task itles</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">lang_query</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">base_query</span> <span style=\\\"color: #0000FF;\\\">&</span> <span style=\\\"color: #008000;\\\">\\\"&cmtitle=Category:\\\"</span> <span style=\\\"color: #0000FF;\\\">&</span> <span style=\\\"color: #000000;\\\">language</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">continue_at</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">req</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lang_query</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">store_title</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">continue_at</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">continue_at</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">req</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lang_query</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\"&cmcontinue=\\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">continue_at</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">store_title</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- a quick check to avoid long output</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">titles</span><span style=\\\"color: #0000FF;\\\">)==</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"no tasks implemented for %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">language</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">return</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- get tasks, print as we go along</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Tasks:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">task_query</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">base_query</span> <span style=\\\"color: #0000FF;\\\">&</span> <span style=\\\"color: #008000;\\\">\\\"&cmtitle=Category:Programming_Tasks\\\"</span>\\n <span style=\\\"color: #000000;\\\">continue_at</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">req</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">task_query</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">print_unimplemented</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">continue_at</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">continue_at</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">req</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">task_query</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\"&cmcontinue=\\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">continue_at</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">print_unimplemented</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%d unimplemented tasks found for %s.\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">unimplemented_count</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">language</span><span style=\\\"color: #0000FF;\\\">})</span>\\n\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">full_tasks</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">unimplemented_count</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Draft tasks:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">task_query</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">base_query</span> <span style=\\\"color: #0000FF;\\\">&</span> <span style=\\\"color: #008000;\\\">\\\"&cmtitle=Category:Draft_Programming_Tasks\\\"</span>\\n <span style=\\\"color: #000000;\\\">continue_at</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">req</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">task_query</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">print_unimplemented</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">continue_at</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">continue_at</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">req</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">task_query</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\"&cmcontinue=\\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">continue_at</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">print_unimplemented</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">draft_tasks</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">unimplemented_count</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">full_tasks</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%d unimplemented draft tasks found for %s.\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">draft_tasks</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">language</span><span style=\\\"color: #0000FF;\\\">})</span>\\n\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%d unimplemented tasks in total found for %s (out of %d).\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">unimplemented_count</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">language</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">task_count</span><span style=\\\"color: #0000FF;\\\">})</span>\\n\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(load \\\"@lib/http.l\\\" \\\"@lib/xm.l\\\")\\n\\n(de rosettaCategory (Cat)\\n (let (Cont NIL Xml)\\n (make\\n (loop\\n (client \\\"rosettacode.org\\\" 80\\n (pack\\n \\\"mw/api.php?action=query&list=categorymembers&cmtitle=Category:\\\"\\n Cat\\n \\\"&cmlimit=200&format=xml\\\"\\n Cont )\\n (while (line))\\n (setq Xml (and (xml?) (xml))) )\\n (NIL Xml)\\n (for M (body Xml 'query 'categorymembers)\\n (link (attr M 'title)) )\\n (NIL (attr Xml 'query-continue' categorymembers 'cmcontinue))\\n (setq Cont (pack \\\"&cmcontinue=\\\" @)) ) ) ) )\\n\\n(de unimplemented (Task)\\n (diff\\n (rosettaCategory \\\"Programming_Tasks\\\")\\n (rosettaCategory Task) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"function Find-UnimplementedTask\\n{\\n [CmdletBinding()]\\n [OutputType([string[]])]\\n Param\\n (\\n [Parameter(Mandatory=$true,\\n Position=0)]\\n [string]\\n $Language\\n )\\n\\n $url = \\\"http://rosettacode.org/wiki/Reports:Tasks_not_implemented_in_$Language\\\"\\n $web = Invoke-WebRequest $url\\n $unimplemented = 1\\n\\n [string[]](($web.AllElements |\\n Where-Object {$_.class -eq \\\"mw-content-ltr\\\"})[$unimplemented].outerText -split \\\"`r`n\\\" |\\n Select-String -Pattern \\\"[^0-9A-Z]$\\\" -CaseSensitive)\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$tasks = Find-UnimplementedTask -Language PowerShell\\n\\n$tasks[0..5],\\\".`n.`n.\\\",$tasks[-6..-1]\\nWrite-Host \\\"`nTotal unimplemented Tasks: $($tasks.Count)\\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nGiven the name of a language on Rosetta Code,\\nfinds all tasks which are not implemented in that language.\\n\\\"\\\"\\\"\\nfrom operator import attrgetter\\nfrom typing import Iterator\\n\\nimport mwclient\\n\\nURL = 'www.rosettacode.org'\\nAPI_PATH = '/mw/'\\n\\n\\ndef unimplemented_tasks(language: str,\\n *,\\n url: str,\\n api_path: str) -> Iterator[str]:\\n \\\"\\\"\\\"Yields all unimplemented tasks for a specified language\\\"\\\"\\\"\\n site = mwclient.Site(url, path=api_path)\\n all_tasks = site.categories['Programming Tasks']\\n language_tasks = site.categories[language]\\n name = attrgetter('name')\\n all_tasks_names = map(name, all_tasks)\\n language_tasks_names = set(map(name, language_tasks))\\n for task in all_tasks_names:\\n if task not in language_tasks_names:\\n yield task\\n\\n\\nif __name__ == '__main__':\\n tasks = unimplemented_tasks('Python', url=URL, api_path=API_PATH)\\n print(*tasks, sep='\\\\n')\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\nGiven the name of a language on Rosetta Code,\\nfinds all tasks which are not implemented in that language.\\n\\\"\\\"\\\"\\nfrom functools import partial\\nfrom operator import itemgetter\\nfrom typing import (Dict,\\n Iterator,\\n Union)\\n\\nimport requests\\n\\nURL = 'http://www.rosettacode.org/mw/api.php'\\nREQUEST_PARAMETERS = dict(action='query',\\n list='categorymembers',\\n cmlimit=500,\\n rawcontinue=True,\\n format='json')\\n\\n\\ndef unimplemented_tasks(language: str,\\n *,\\n url: str,\\n request_params: Dict[str, Union[str, int, bool]]\\n ) -> Iterator[str]:\\n \\\"\\\"\\\"Yields all unimplemented tasks for a specified language\\\"\\\"\\\"\\n with requests.Session() as session:\\n tasks = partial(tasks_titles,\\n session=session,\\n url=url,\\n **request_params)\\n all_tasks = tasks(cmtitle='Category:Programming_Tasks')\\n language_tasks = set(tasks(cmtitle=f'Category:{language}'))\\n for task in all_tasks:\\n if task not in language_tasks:\\n yield task\\n\\n\\ndef tasks_titles(*,\\n session: requests.Session,\\n url: str,\\n **params: Union[str, int, bool]) -> Iterator[str]:\\n \\\"\\\"\\\"Yields tasks names for a specified category\\\"\\\"\\\"\\n while True:\\n request = session.get(url, params=params)\\n data = request.json()\\n yield from map(itemgetter('title'), data['query']['categorymembers'])\\n query_continue = data.get('query-continue')\\n if query_continue is None:\\n return\\n params.update(query_continue['categorymembers'])\\n\\n\\nif __name__ == '__main__':\\n tasks = unimplemented_tasks('Python',\\n url=URL,\\n request_params=REQUEST_PARAMETERS)\\n print(*tasks, sep='\\\\n')\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import xml.dom.minidom\\nimport urllib, sys\\n\\ndef findrc(category):\\n name = \\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:%s&cmlimit=500&format=xml\\\" % urllib.quote(category)\\n cmcontinue, titles = '', []\\n while True:\\n u = urllib.urlopen(name + cmcontinue)\\n xmldata = u.read()\\n u.close()\\n x = xml.dom.minidom.parseString(xmldata)\\n titles += [i.getAttribute(\\\"title\\\") for i in x.getElementsByTagName(\\\"cm\\\")]\\n cmcontinue = filter( None,\\n (urllib.quote(i.getAttribute(\\\"cmcontinue\\\"))\\n for i in x.getElementsByTagName(\\\"categorymembers\\\")) )\\n if cmcontinue:\\n cmcontinue = '&cmcontinue=' + cmcontinue[0]\\n else:\\n break\\n return titles\\n\\nalltasks = findrc(\\\"Programming_Tasks\\\")\\nlang = findrc(sys.argv[1])\\n\\nfor i in [i for i in alltasks if i not in lang]:\\n print i\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#Aamrun, 3rd February 2023\\n\\nimport xml.dom.minidom\\nimport sys, urllib.parse, urllib.request\\n\\ndef findrc(category):\\n name = \\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:%s&cmlimit=500&format=xml\\\" % urllib.parse.quote(category)\\n cmcontinue, titles = '', []\\n while True:\\n u = urllib.request.urlopen(name + cmcontinue)\\n xmldata = u.read()\\n u.close()\\n x = xml.dom.minidom.parseString(xmldata)\\n titles += [i.getAttribute(\\\"title\\\") for i in x.getElementsByTagName(\\\"cm\\\")]\\n cmcontinue = list(filter( None,\\n (urllib.parse.quote(i.getAttribute(\\\"cmcontinue\\\"))\\n for i in x.getElementsByTagName(\\\"categorymembers\\\")) ))\\n if cmcontinue:\\n cmcontinue = '&cmcontinue=' + cmcontinue[0]\\n else:\\n break\\n return titles\\n\\nalltasks = findrc(\\\"Programming_Tasks\\\")\\nlang = findrc(sys.argv[1])\\n\\nfor i in [i for i in alltasks if i not in lang]:\\n print(i)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"library(XML)\\nfind.unimplemented.tasks <- function(lang=\\\"R\\\"){\\n\\tPT <- xmlInternalTreeParse( paste(\\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml\\\",sep=\\\"\\\") )\\n\\tPT.nodes <- getNodeSet(PT,\\\"//cm\\\")\\n\\tPT.titles = as.character( sapply(PT.nodes, xmlGetAttr, \\\"title\\\") )\\n\\tlanguage <- xmlInternalTreeParse( paste(\\\"http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:\\\",\\n\\tlang, \\\"&cmlimit=500&format=xml\\\",sep=\\\"\\\") )\\n\\tlang.nodes <- getNodeSet(language,\\\"//cm\\\")\\n\\tlang.titles = as.character( sapply(lang.nodes, xmlGetAttr, \\\"title\\\") )\\n\\tunimplemented <- setdiff(PT.titles, lang.titles)\\n\\tunimplemented\\n}\\n# Usage\\nfind.unimplemented.tasks(lang=\\\"Python\\\")\\nlangs <- c(\\\"R\\\",\\\"python\\\",\\\"perl\\\")\\nsapply(langs, find.unimplemented.tasks) # fetching data for multiple languages\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require net/url net/uri-codec json (only-in racket/dict [dict-ref ref]))\\n\\n(define (RC-get verb params)\\n ((compose1 get-pure-port string->url format)\\n \\\"http://rosettacode.org/mw/~a.php?~a\\\" verb (alist->form-urlencoded params)))\\n\\n(define (get-category catname)\\n (let loop ([c #f])\\n (define t\\n ((compose1 read-json RC-get) 'api\\n `([action . \\\"query\\\"] [format . \\\"json\\\"]\\n [list . \\\"categorymembers\\\"] [cmtitle . ,(format \\\"Category:~a\\\" catname)]\\n [cmcontinue . ,(and c (ref c 'cmcontinue))] [cmlimit . \\\"500\\\"])))\\n (define (c-m key) (ref (ref t key '()) 'categorymembers #f))\\n (append (for/list ([page (c-m 'query)]) (ref page 'title))\\n (cond [(c-m 'query-continue) => loop] [else '()]))))\\n\\n;; The above is the required \\\"library\\\" code, same as the \\\"Rosetta\\n;; Code/Count\\\" entry\\n\\n(define (show-unimplemented lang)\\n (for-each displayln (remove* (get-category lang)\\n (get-category 'Programming_Tasks))))\\n\\n(show-unimplemented 'Racket) ; see all of the Racket entries\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use HTTP::UserAgent;\\nuse URI::Escape;\\nuse JSON::Fast;\\nuse Sort::Naturally;\\n\\nunit sub MAIN( Str :$lang = 'Raku' );\\n\\nmy $client = HTTP::UserAgent.new;\\nmy $url = 'https://rosettacode.org/w';\\n\\nmy @total;\\nmy @impl;\\n\\n@total.append: .&get-cat for 'Programming_Tasks', 'Draft_Programming_Tasks';\\n@impl = get-cat $lang;\\n\\nsay \\\"Unimplemented tasks in $lang:\\\";\\nmy @unimplemented = (@total (-) @impl).keys.sort: *.&naturally;\\n.say for @unimplemented;\\nsay \\\"{+@unimplemented} unimplemented tasks\\\";\\n\\nsub get-cat ($category) {\\n flat mediawiki-query(\\n $url, 'pages',\\n :generator<categorymembers>,\\n :gcmtitle(\\\"Category:$category\\\"),\\n :gcmlimit<350>,\\n :rawcontinue(),\\n :prop<title>\\n ).map({ .<title> });\\n}\\n\\nsub mediawiki-query ($site, $type, *%query) {\\n my $url = \\\"$site/api.php?\\\" ~ uri-query-string(\\n :action<query>, :format<json>, :formatversion<2>, |%query);\\n my $continue = '';\\n\\n gather loop {\\n my $response = $client.get(\\\"$url&$continue\\\");\\n my $data = from-json($response.content);\\n take $_ for $data.<query>.{$type}.values;\\n $continue = uri-query-string |($data.<query-continue>{*}».hash.hash or last);\\n }\\n}\\n\\nsub uri-query-string (*%fields) { %fields.map({ \\\"{.key}={uri-escape .value}\\\" }).join(\\\"&\\\") }\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"# Project: Rosetta Code/Find unimplemented tasks\\n\\nload \\\"stdlib.ring\\\"\\nros= download(\\\"http://rosettacode.org/wiki/Category:Programming_Tasks\\\")\\nlang = \\\"Ring\\\"\\npos = 1\\nnum = 0\\ntotalros = 0\\nrosname = \\\"\\\"\\nrostitle = \\\"\\\"\\nsee \\\"Tasks not implemented in \\\" + lang + \\\" language:\\\" + nl\\nfor n = 1 to len(ros)\\n nr = searchstring(ros,'<li><a href=\\\"/wiki/',pos)\\n if nr = 0\\n exit\\n else\\n pos = nr + 1\\n ok\\n nr = searchname(nr)\\n nr = searchtitle(nr)\\nnext\\nsee nl\\nsee \\\"Total: \\\" + totalros + \\\" examples.\\\" + nl\\n\\nfunc searchstring(str,substr,n)\\n newstr=right(str,len(str)-n+1)\\n nr = substr(newstr, substr)\\n if nr = 0\\n return 0\\n else\\n return n + nr -1\\n ok\\n\\nfunc searchname(sn)\\n nr2 = searchstring(ros,'\\\">',sn)\\n nr3 = searchstring(ros,\\\"</a></li>\\\",sn)\\n rosname = substr(ros,nr2+2,nr3-nr2-2)\\n return sn\\n\\nfunc searchtitle(sn)\\n st = searchstring(ros,\\\"title=\\\",sn)\\n rostitle = substr(ros,sn+19,st-sn-21)\\n rostitle = \\\"rosettacode.org/wiki/\\\" + rostitle\\n rostitle = download(rostitle)\\n s = substr(rostitle,lang)\\n if s = 0\\n num = num + 1\\n totalros = totalros + 1\\n see \\\"\\\" + num + \\\". \\\" + rosname + nl\\n ok\\n return sn\\n\\nfunc count(cstring,dstring)\\n sum = 0\\n while substr(cstring,dstring) > 0\\n sum = sum + 1\\n cstring = substr(cstring,substr(cstring,dstring)+len(string(sum)))\\n end\\n return sum\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'rosettacode'\\nrequire 'time'\\n\\nmodule RosettaCode\\n def self.get_unimplemented(lang)\\n programming_tasks = []\\n category_members(\\\"Programming_Tasks\\\") {|task| programming_tasks << task}\\n\\n lang_tasks = []\\n category_members(lang) {|task| lang_tasks << task}\\n\\n lang_tasks_omit = []\\n category_members(\\\"#{lang}/Omit\\\") {|task| lang_tasks_omit << task}\\n\\n [programming_tasks - lang_tasks, lang_tasks_omit]\\n end\\n\\n def self.created_time(title)\\n url = get_api_url({\\n \\\"action\\\" => \\\"query\\\",\\n \\\"titles\\\" => title,\\n \\\"format\\\" => \\\"xml\\\",\\n \\\"rvlimit\\\" => 500,\\n \\\"prop\\\" => \\\"revisions\\\",\\n \\\"rvprop\\\" => \\\"timestamp\\\"\\n })\\n doc = REXML::Document.new open(url)\\n REXML::XPath.each(doc, \\\"//rev\\\").collect do |node|\\n Time.parse( node.attribute(\\\"timestamp\\\").value )\\n end.min\\n end\\n\\nend\\n\\nputs Time.now\\nlang = ARGV[0] || \\\"Ruby\\\"\\nunimplemented, omitted = RosettaCode.get_unimplemented(lang)\\nunimplemented.collect {|title| [title, RosettaCode.created_time(title)]} .\\n sort_by {|e| e[1]} .\\n each do |title, date|\\n puts \\\"%s %6s %s\\\" % [\\n date.strftime(\\\"%Y-%m-%d\\\"),\\n omitted.include?(title) ? \\\"[omit]\\\" : \\\"\\\" ,\\n title\\n ]\\n end\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"WordWrap$ = \\\"style='white-space: pre-wrap;white-space: -moz-pre-wrap;white-space: -pre-wrap;white-space: -o-pre-wrap;word-wrap: break-word'\\\"\\na$\\t= httpGet$(\\\"http://rosettacode.org/wiki/Category:Programming_Languages\\\")\\na$\\t= word$(a$,2,\\\"mw-subcategories\\\")\\na$\\t= word$(a$,1,\\\"</table>\\\")\\ni\\t= instr(a$,\\\"/wiki/Category:\\\")\\nhtml \\\"<B> Select language from list<BR>\\\"\\nhtml \\\"<SELECT name='lang'>\\\"\\nwhile i <> 0\\n j\\t= instr(a$,\\\"\\\"\\\" title=\\\"\\\"Category:\\\",i)\\n lang$\\t= mid$(a$,i+15,j-i-15)\\n k\\t= instr(a$,\\\"\\\"\\\">\\\",j + 18)\\n langName$ = mid$(a$,j + 18,k-(j+18))\\n count\\t= count + 1\\n html \\\"<option value='\\\";lang$;\\\"'>\\\";langName$;\\\"</option>\\\"\\n i\\t= instr(a$,\\\"/wiki/Category:\\\",k)\\nwend\\nhtml \\\"</select>\\\"\\nhtml \\\"<p>Number of Languages:\\\";count;\\\"<BR> \\\"\\nbutton #go,\\\"GO\\\", [go]\\nhtml \\\" \\\"\\nbutton #ex, \\\"Exit\\\", [exit]\\nwait\\n\\n[go]\\ncls\\nlang$\\t= #request get$(\\\"lang\\\")\\nh$\\t= \\\"http://rosettacode.org/wiki/Reports:Tasks_not_implemented_in_\\\";lang$\\na$\\t= httpGet$(h$)\\na$\\t= word$(a$,3,\\\"mw-content-ltr\\\")\\nhtml \\\"<table border=1><tr>\\\"\\ni\\t= instr(a$,\\\"<a href=\\\"\\\"/wiki/\\\")\\nwhile i > 0\\n i\\t= instr(a$,\\\"title=\\\"\\\"\\\",i)\\n j\\t= instr(a$,\\\"\\\"\\\">\\\",i+7)\\n if c mod 4\\t= 0 then html \\\"</tr><tr \\\";WordWrap$;\\\">\\\"\\n c\\t= c + 1\\n html \\\"<td>\\\";mid$(a$,i+7,j-(i+7));\\\"</td>\\\"\\n i\\t= instr(a$,\\\"<a href=\\\"\\\"/wiki/\\\",i+7)\\nwend\\nhtml \\\"</tr></table>\\\"\\nprint \\\"Total unImplemented Tasks:\\\";c\\n[exit]\\nend\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use std::collections::{BTreeMap, HashSet};\\n\\nuse reqwest::Url;\\nuse serde::Deserialize;\\nuse serde_json::Value;\\n\\n/// A Rosetta Code task.\\n#[derive(Clone, PartialEq, Eq, Hash, Debug, Deserialize)]\\npub struct Task {\\n /// The ID of the page containing the task in the MediaWiki API.\\n #[serde(rename = \\\"pageid\\\")]\\n pub id: u64,\\n\\n /// The human-readable title of the task.\\n pub title: String,\\n}\\n\\n/// Encapsulates errors that might occur during JSON parsing.\\n#[derive(Debug)]\\nenum TaskParseError {\\n /// Something went wrong with the HTTP request to the API.\\n Http(reqwest::Error),\\n\\n /// There was a problem parsing the API response into JSON.\\n Json(serde_json::Error),\\n\\n /// The response JSON contained unexpected keys or values.\\n UnexpectedFormat,\\n}\\n\\nimpl From<serde_json::Error> for TaskParseError {\\n fn from(err: serde_json::Error) -> Self {\\n TaskParseError::Json(err)\\n }\\n}\\n\\nimpl From<reqwest::Error> for TaskParseError {\\n fn from(err: reqwest::Error) -> Self {\\n TaskParseError::Http(err)\\n }\\n}\\n\\n/// Represents a category of pages on Rosetta Code, such as \\\"Rust\\\".\\nstruct Category {\\n name: String,\\n continue_params: Option<BTreeMap<String, String>>,\\n}\\n\\nimpl Category {\\n fn new(name: &str) -> Category {\\n let mut continue_params = BTreeMap::new();\\n continue_params.insert(\\\"continue\\\".to_owned(), \\\"\\\".to_owned());\\n\\n Category {\\n name: name.to_owned(),\\n continue_params: Some(continue_params),\\n }\\n }\\n}\\n\\n/// Sends a request to Rosetta Code through the MediaWiki API. If successful, returns the response\\n/// as a JSON object.\\nfn query_api(\\n category_name: &str,\\n continue_params: &BTreeMap<String, String>,\\n) -> Result<Value, TaskParseError> {\\n let mut url = Url::parse(\\\"http://rosettacode.org/mw/api.php\\\").expect(\\\"invalid URL\\\");\\n url.query_pairs_mut()\\n .append_pair(\\\"action\\\", \\\"query\\\")\\n .append_pair(\\\"list\\\", \\\"categorymembers\\\")\\n .append_pair(\\\"cmtitle\\\", &format!(\\\"Category:{}\\\", category_name))\\n .append_pair(\\\"cmlimit\\\", \\\"500\\\")\\n .append_pair(\\\"format\\\", \\\"json\\\")\\n .extend_pairs(continue_params);\\n\\n Ok(reqwest::blocking::get(url)?.json()?)\\n}\\n\\n/// Given a JSON object, parses the task information from the MediaWiki API response.\\nfn parse_tasks(json: &Value) -> Result<Vec<Task>, TaskParseError> {\\n let tasks_json = json\\n .pointer(\\\"/query/categorymembers\\\")\\n .and_then(Value::as_array)\\n .ok_or(TaskParseError::UnexpectedFormat)?;\\n\\n tasks_json\\n .iter()\\n .map(|json| Task::deserialize(json).map_err(From::from))\\n .collect()\\n}\\n\\nimpl Iterator for Category {\\n type Item = Vec<Task>;\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n self.continue_params.as_ref()?;\\n\\n query_api(&self.name, self.continue_params.as_ref()?)\\n .and_then(|result| {\\n // If there are more pages of results to request, save them for the next iteration.\\n self.continue_params =\\n result\\n .get(\\\"continue\\\")\\n .and_then(Value::as_object)\\n .map(|continue_params| {\\n continue_params\\n .iter()\\n .map(|(key, value)| {\\n (key.to_owned(), value.as_str().unwrap().to_owned())\\n })\\n .collect()\\n });\\n\\n parse_tasks(&result)\\n })\\n .map_err(|err| println!(\\\"Error parsing response: {:?}\\\", err))\\n .ok()\\n }\\n}\\n\\npub fn all_tasks() -> Vec<Task> {\\n Category::new(\\\"Programming Tasks\\\").flatten().collect()\\n}\\n\\npub fn unimplemented_tasks(lang: &str) -> Vec<Task> {\\n let all_tasks = all_tasks().iter().cloned().collect::<HashSet<_>>();\\n let implemented_tasks = Category::new(lang).flatten().collect::<HashSet<_>>();\\n let mut unimplemented_tasks = all_tasks\\n .difference(&implemented_tasks)\\n .cloned()\\n .collect::<Vec<Task>>();\\n unimplemented_tasks.sort_by(|a, b| a.title.cmp(&b.title));\\n unimplemented_tasks\\n}\\n\\n\\nfn main() {\\n for task in find_unimplemented_tasks::unimplemented_tasks(\\\"Rust\\\") {\\n println!(\\\"{:6} {}\\\", task.id, task.title);\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import com.softwaremill.sttp.json4s._\\nimport com.softwaremill.sttp.quick._\\n\\nimplicit val serialization = org.json4s.native.Serialization\\nimport org.json4s.DefaultFormats\\nimplicit val formats = DefaultFormats\\n\\ncase class Task(pageid: Int, title: String)\\ncase class Category(categorymembers: List[Task])\\ncase class Query(query: Category)\\n\\nList(\\\"Programming Tasks\\\", \\\"Scala\\\")\\n .map { title =>\\n sttp\\n .get(uri\\\"http://www.rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:${title}&cmlimit=1000&format=json\\\")\\n .header(\\\"User-Agent\\\", mozillaUserAgent)\\n .response(asJson[Query])\\n .send()\\n .body\\n }\\n .map {\\n case Right(r) => r.query.categorymembers.toSet\\n case Left(s) => Set.empty[Task]\\n }\\n .foldRight(Set.empty[Task])((acc: Set[Task], ele: Set[Task]) => acc -- ele)\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"package require Tcl 8.5\\npackage require http\\npackage require json\\npackage require struct::set\\n\\nfconfigure stdout -buffering none\\n\\n# Initialize a cache of lookups\\narray set cache {}\\nproc log msg {\\n #puts -nonewline $msg\\n}\\n\\nproc get_tasks {category} {\\n global cache\\n if {[info exists cache($category)]} {\\n\\treturn $cache($category)\\n }\\n set base_url http://www.rosettacode.org/mw/api.php\\n set query {\\n\\taction\\tquery\\n\\tlist\\tcategorymembers\\n\\tcmtitle\\tCategory:%s\\n\\tformat\\tjson\\n\\tcmlimit\\t500\\n }\\n set query [list {*}$query]; # remove excess whitespace\\n set this_query [dict create {*}[split [format $query $category]]]\\n set tasks [list]\\n\\n while {1} {\\n set url [join [list $base_url [http::formatQuery {*}$this_query]] ?]\\n while 1 {\\n set response [http::geturl $url]\\n\\t # Process redirects\\n if {[http::ncode $response] == 301} {\\n set newurl [dict get [http::meta $response] Location]\\n if {[string match http://* $newurl]} {\\n set url $newurl\\n } else {\\n set url [regexp -inline {http://[^/]+} $url]\\n append url $newurl\\n }\\n continue\\n }\\n\\t # Check for oopsies!\\n if {\\n\\t\\t[set s [http::status $response]] ne \\\"ok\\\"\\n\\t\\t|| [http::ncode $response] != 200\\n\\t } then {\\n error \\\"Oops: url=$url\\\\nstatus=$s\\\\nhttp code=[http::code $response]\\\"\\n }\\n break\\n }\\n\\n\\t# Get the data out of the message\\n set data [json::json2dict [http::data $response]]\\n http::cleanup $response\\n\\n # add tasks to list\\n foreach task [dict get $data query categorymembers] {\\n lappend tasks [dict get [dict create {*}$task] title]\\n }\\n\\n if {[catch {\\n\\t dict get $data query-continue categorymembers cmcontinue\\n\\t} continue_task]} then {\\n # no more continuations, we're done\\n break\\n }\\n dict set this_query cmcontinue $continue_task\\n }\\n return [set cache($category) $tasks]\\n}\\n\\nproc get_unimplemented {lang} {\\n set tasks [get_tasks Programming_Tasks]\\n set collected [get_tasks Collection_Members]\\n set doneTasks [get_tasks $lang]\\n set omittedTasks [get_tasks $lang/Omit]\\n\\n # Map generic collection task categories to specific ones\\n set tasks [regsub -all {Category:(\\\\S+)} $tasks \\\"\\\\\\\\1/$lang\\\"]\\n\\n set collectOfLang [struct::set intersect $collected $doneTasks]\\n set ignorable [struct::set union $doneTasks $omittedTasks $collectOfLang]\\n set unimplemented [struct::set difference $tasks $ignorable]\\n\\n puts \\\"\\\\n$lang has [llength $unimplemented] unimplemented programming tasks:\\\"\\n if {[llength $unimplemented]} {\\n\\tputs \\\" [join [lsort $unimplemented] \\\"\\\\n \\\"]\\\"\\n }\\n}\\n\\ncatch {console show}\\ncatch {wm withdraw .}\\nforeach lang {Perl Python Ruby Tcl} {\\n get_unimplemented $lang\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"Set http= CreateObject(\\\"WinHttp.WinHttpRequest.5.1\\\")\\nSet oDic = WScript.CreateObject(\\\"scripting.dictionary\\\")\\n\\nstart=\\\"https://rosettacode.org\\\"\\nConst lang=\\\"VBScript\\\"\\nDim oHF\\n\\ngettaskslist \\\"about:/wiki/Category:Programming_Tasks\\\" ,True\\nprint odic.Count\\ngettaskslist \\\"about:/wiki/Category:Draft_Programming_Tasks\\\",True\\nprint \\\"total tasks \\\" & odic.Count\\ngettaskslist \\\"about:/wiki/Category:\\\"&lang,False\\nprint \\\"total tasks not in \\\" & lang & \\\" \\\" &odic.Count & vbcrlf\\nFor Each d In odic.keys\\n print d &vbTab & Replace(odic(d),\\\"about:\\\", start)\\nnext\\nWScript.Quit(1)\\n\\nSub print(s):\\n On Error Resume Next\\n WScript.stdout.WriteLine (s)\\n If err= &h80070006& Then WScript.echo \\\" Please run this script with CScript\\\": WScript.quit\\nEnd Sub\\n\\nFunction getpage(name)\\n Set oHF=Nothing\\n Set oHF = CreateObject(\\\"HTMLFILE\\\")\\n http.open \\\"GET\\\",name,False ''synchronous!\\n http.send\\n oHF.write \\\"<html><body></body></html>\\\"\\n oHF.body.innerHTML = http.responsetext\\n Set getpage=Nothing\\nEnd Function\\n\\nSub gettaskslist(b,build)\\n nextpage=b\\n While nextpage <>\\\"\\\"\\n\\n nextpage=Replace(nextpage,\\\"about:\\\", start)\\n WScript.Echo nextpage\\n getpage(nextpage)\\n Set xtoc = oHF.getElementbyId(\\\"mw-pages\\\")\\n nextpage=\\\"\\\"\\n For Each ch In xtoc.children\\n If ch.innertext= \\\"next page\\\" Then\\n nextpage=ch.attributes(\\\"href\\\").value\\n ': WScript.Echo nextpage\\n ElseIf ch.attributes(\\\"class\\\").value=\\\"mw-content-ltr\\\" Then\\n Set ytoc=ch.children(0)\\n 'WScript.Echo ytoc.attributes(\\\"class\\\").value '\\\"mw-category mw-category-columns\\\"\\n Exit For\\n End If\\n Next\\n For Each ch1 In ytoc.children 'mw-category-group\\n 'WScript.Echo \\\">\\\" &ch1.children(0).innertext &\\\"<\\\"\\n For Each ch2 In ch1.children(1).children '\\\"mw_category_group\\\".ul\\n Set ch=ch2.children(0)\\n If build Then\\n odic.Add ch.innertext , ch.attributes(\\\"href\\\").value\\n else\\n if odic.exists(ch.innertext) then odic.Remove ch.innertext\\n End if\\n 'WScript.Echo ch.innertext , ch.attributes(\\\"href\\\").value\\n Next\\n Next\\n Wend\\nEnd Sub\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"/* Rosetta_Code_Find_unimplemented_tasks.wren */\\n\\nimport \\\"./pattern\\\" for Pattern\\n\\nvar CURLOPT_URL = 10002\\nvar CURLOPT_FOLLOWLOCATION = 52\\nvar CURLOPT_WRITEFUNCTION = 20011\\nvar CURLOPT_WRITEDATA = 10001\\n\\nforeign class Buffer {\\n construct new() {} // C will allocate buffer of a suitable size\\n\\n foreign value // returns buffer contents as a string\\n}\\n\\nforeign class Curl {\\n construct easyInit() {}\\n\\n foreign easySetOpt(opt, param)\\n\\n foreign easyPerform()\\n\\n foreign easyCleanup()\\n}\\n\\nvar curl = Curl.easyInit()\\n\\nvar getContent = Fn.new { |url|\\n var buffer = Buffer.new()\\n curl.easySetOpt(CURLOPT_URL, url)\\n curl.easySetOpt(CURLOPT_FOLLOWLOCATION, 1)\\n curl.easySetOpt(CURLOPT_WRITEFUNCTION, 0) // write function to be supplied by C\\n curl.easySetOpt(CURLOPT_WRITEDATA, buffer)\\n curl.easyPerform()\\n return buffer.value\\n}\\n\\nvar p1 = Pattern.new(\\\"title/=\\\\\\\"[+1^\\\\\\\"]\\\\\\\"\\\")\\nvar p2 = Pattern.new(\\\"cmcontinue/=\\\\\\\"[+1^\\\\\\\"]\\\\\\\"\\\")\\n\\nvar findTasks = Fn.new { |category|\\n var url = \\\"https://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:%(category)&cmlimit=500&format=xml\\\"\\n var cmcontinue = \\\"\\\"\\n var tasks = []\\n while (true) {\\n var content = getContent.call(url + cmcontinue)\\n var matches1 = p1.findAll(content)\\n for (m in matches1) {\\n var title = m.capsText[0].replace(\\\"'\\\", \\\"'\\\").replace(\\\""\\\", \\\"\\\\\\\"\\\")\\n tasks.add(title)\\n }\\n var m2 = p2.find(content)\\n if (m2) cmcontinue = \\\"&cmcontinue=%(m2.capsText[0])\\\" else break\\n }\\n return tasks\\n}\\n\\nvar tasks1 = findTasks.call(\\\"Programming_Tasks\\\") // 'full' tasks only\\nvar tasks2 = findTasks.call(\\\"Draft_Programming_Tasks\\\")\\nvar lang = \\\"Wren\\\"\\nvar langTasks = findTasks.call(lang) // includes draft tasks\\ncurl.easyCleanup()\\nSystem.print(\\\"Unimplemented 'full' tasks in %(lang):\\\")\\nfor (task in tasks1) {\\n if (!langTasks.contains(task)) System.print(\\\" \\\" + task)\\n}\\nSystem.print(\\\"\\\\nUnimplemented 'draft' tasks in %(lang):\\\")\\nfor (task in tasks2) {\\n if (!langTasks.contains(task)) System.print(\\\" \\\" + task)\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"/* gcc Rosetta_Code_Find_unimplemented_tasks.c -o Rosetta_Code_Find_unimplemented_tasks -lcurl -lwren -lm */\\n\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <curl/curl.h>\\n#include \\\"wren.h\\\"\\n\\nstruct MemoryStruct {\\n char *memory;\\n size_t size;\\n};\\n\\n/* C <=> Wren interface functions */\\n\\nstatic size_t WriteMemoryCallback(void *contents, size_t size, size_t nmemb, void *userp) {\\n size_t realsize = size * nmemb;\\n struct MemoryStruct *mem = (struct MemoryStruct *)userp;\\n\\n char *ptr = realloc(mem->memory, mem->size + realsize + 1);\\n if(!ptr) {\\n /* out of memory! */\\n printf(\\\"not enough memory (realloc returned NULL)\\\\n\\\");\\n return 0;\\n }\\n\\n mem->memory = ptr;\\n memcpy(&(mem->memory[mem->size]), contents, realsize);\\n mem->size += realsize;\\n mem->memory[mem->size] = 0;\\n return realsize;\\n}\\n\\nvoid C_bufferAllocate(WrenVM* vm) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenSetSlotNewForeign(vm, 0, 0, sizeof(struct MemoryStruct));\\n ms->memory = malloc(1);\\n ms->size = 0;\\n}\\n\\nvoid C_bufferFinalize(void* data) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)data;\\n free(ms->memory);\\n}\\n\\nvoid C_curlAllocate(WrenVM* vm) {\\n CURL** pcurl = (CURL**)wrenSetSlotNewForeign(vm, 0, 0, sizeof(CURL*));\\n *pcurl = curl_easy_init();\\n}\\n\\nvoid C_value(WrenVM* vm) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 0);\\n wrenSetSlotString(vm, 0, ms->memory);\\n}\\n\\nvoid C_easyPerform(WrenVM* vm) {\\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\\n curl_easy_perform(curl);\\n}\\n\\nvoid C_easyCleanup(WrenVM* vm) {\\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\\n curl_easy_cleanup(curl);\\n}\\n\\nvoid C_easySetOpt(WrenVM* vm) {\\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\\n CURLoption opt = (CURLoption)wrenGetSlotDouble(vm, 1);\\n if (opt < 10000) {\\n long lparam = (long)wrenGetSlotDouble(vm, 2);\\n curl_easy_setopt(curl, opt, lparam);\\n } else if (opt < 20000) {\\n if (opt == CURLOPT_WRITEDATA) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 2);\\n curl_easy_setopt(curl, opt, (void *)ms);\\n } else if (opt == CURLOPT_URL) {\\n const char *url = wrenGetSlotString(vm, 2);\\n curl_easy_setopt(curl, opt, url);\\n }\\n } else if (opt < 30000) {\\n if (opt == CURLOPT_WRITEFUNCTION) {\\n curl_easy_setopt(curl, opt, &WriteMemoryCallback);\\n }\\n }\\n}\\n\\nWrenForeignClassMethods bindForeignClass(WrenVM* vm, const char* module, const char* className) {\\n WrenForeignClassMethods methods;\\n methods.allocate = NULL;\\n methods.finalize = NULL;\\n if (strcmp(module, \\\"main\\\") == 0) {\\n if (strcmp(className, \\\"Buffer\\\") == 0) {\\n methods.allocate = C_bufferAllocate;\\n methods.finalize = C_bufferFinalize;\\n } else if (strcmp(className, \\\"Curl\\\") == 0) {\\n methods.allocate = C_curlAllocate;\\n }\\n }\\n return methods;\\n}\\n\\nWrenForeignMethodFn bindForeignMethod(\\n WrenVM* vm,\\n const char* module,\\n const char* className,\\n bool isStatic,\\n const char* signature) {\\n if (strcmp(module, \\\"main\\\") == 0) {\\n if (strcmp(className, \\\"Buffer\\\") == 0) {\\n if (!isStatic && strcmp(signature, \\\"value\\\") == 0) return C_value;\\n } else if (strcmp(className, \\\"Curl\\\") == 0) {\\n if (!isStatic && strcmp(signature, \\\"easySetOpt(_,_)\\\") == 0) return C_easySetOpt;\\n if (!isStatic && strcmp(signature, \\\"easyPerform()\\\") == 0) return C_easyPerform;\\n if (!isStatic && strcmp(signature, \\\"easyCleanup()\\\") == 0) return C_easyCleanup;\\n }\\n }\\n return NULL;\\n}\\n\\nstatic void writeFn(WrenVM* vm, const char* text) {\\n printf(\\\"%s\\\", text);\\n}\\n\\nvoid errorFn(WrenVM* vm, WrenErrorType errorType, const char* module, const int line, const char* msg) {\\n switch (errorType) {\\n case WREN_ERROR_COMPILE:\\n printf(\\\"[%s line %d] [Error] %s\\\\n\\\", module, line, msg);\\n break;\\n case WREN_ERROR_STACK_TRACE:\\n printf(\\\"[%s line %d] in %s\\\\n\\\", module, line, msg);\\n break;\\n case WREN_ERROR_RUNTIME:\\n printf(\\\"[Runtime Error] %s\\\\n\\\", msg);\\n break;\\n }\\n}\\n\\nchar *readFile(const char *fileName) {\\n FILE *f = fopen(fileName, \\\"r\\\");\\n fseek(f, 0, SEEK_END);\\n long fsize = ftell(f);\\n rewind(f);\\n char *script = malloc(fsize + 1);\\n fread(script, 1, fsize, f);\\n fclose(f);\\n script[fsize] = 0;\\n return script;\\n}\\n\\nstatic void loadModuleComplete(WrenVM* vm, const char* module, WrenLoadModuleResult result) {\\n if( result.source) free((void*)result.source);\\n}\\n\\nWrenLoadModuleResult loadModule(WrenVM* vm, const char* name) {\\n WrenLoadModuleResult result = {0};\\n if (strcmp(name, \\\"random\\\") != 0 && strcmp(name, \\\"meta\\\") != 0) {\\n result.onComplete = loadModuleComplete;\\n char fullName[strlen(name) + 6];\\n strcpy(fullName, name);\\n strcat(fullName, \\\".wren\\\");\\n result.source = readFile(fullName);\\n }\\n return result;\\n}\\n\\nint main(int argc, char **argv) {\\n WrenConfiguration config;\\n wrenInitConfiguration(&config);\\n config.writeFn = &writeFn;\\n config.errorFn = &errorFn;\\n config.bindForeignClassFn = &bindForeignClass;\\n config.bindForeignMethodFn = &bindForeignMethod;\\n config.loadModuleFn = &loadModule;\\n WrenVM* vm = wrenNewVM(&config);\\n const char* module = \\\"main\\\";\\n const char* fileName = \\\"Rosetta_Code_Find_unimplemented_tasks.wren\\\";\\n char *script = readFile(fileName);\\n WrenInterpretResult result = wrenInterpret(vm, module, script);\\n switch (result) {\\n case WREN_RESULT_COMPILE_ERROR:\\n printf(\\\"Compile Error!\\\\n\\\");\\n break;\\n case WREN_RESULT_RUNTIME_ERROR:\\n printf(\\\"Runtime Error!\\\\n\\\");\\n break;\\n case WREN_RESULT_SUCCESS:\\n break;\\n }\\n wrenFreeVM(vm);\\n free(script);\\n return 0;\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"var [const] YAJL=Import(\\\"zklYAJL\\\")[0], CURL=Import(\\\"zklCurl\\\");\\n\\nfcn getTasks(language){\\n continueValue,tasks:=\\\"\\\",Data(0,String); // \\\"nm\\\\0nm\\\\0....\\\"\\n do{\\n page:=CURL().get((\\\"http://rosettacode.org/mw/api.php?\\\"\\n \\\"action=query&cmlimit=500\\\"\\n\\t \\\"&format=json\\\"\\n\\t \\\"&list=categorymembers\\\"\\n\\t \\\"&cmtitle=Category:%s\\\"\\n\\t \\\"&cmcontinue=%s\\\").fmt(language,continueValue));\\n page=page[0].del(0,page[1]); // get rid of HTML header\\n json:=YAJL().write(page).close();\\n json[\\\"query\\\"][\\\"categorymembers\\\"].pump(tasks,T(\\\"get\\\",\\\"title\\\"));\\n continueValue=json.find(\\\"continue\\\") //continue:-||,cmcontinue:page|954|19)\\n .toList().apply(\\\"concat\\\",\\\"=\\\").concat(\\\"&\\\");\\n }while(continueValue);\\n tasks\\n}\\n\\nallTasks:=getTasks.future(\\\"Programming_Tasks\\\"); // thread\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"language:=\\\"zkl\\\";\\ntasks:=getTasks(language);\\nlangTasks:=Dictionary(); tasks.pump(Void,langTasks.add.fp1(Void));\\nunimplementedTasks:=allTasks.filter('wrap(nm){ (not langTasks.holds(nm)) });\\nprintln(\\\"Found %d unimplemented tasks for %s:\\\"\\n .fmt(unimplementedTasks.len(1),language));\\nunimplementedTasks.pump(Console.println);\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Rosetta-Code-Find-unimplemented-tasks"}}},{"rowIdx":1593,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Rosetta Code related\nfrom: http://rosettacode.org/wiki/Rosetta_Code/Fix_code_tags\nnote: Text processing\n","language":"00-META"},{"code":";; This task has been <em>revised</em> for the hosting change Rosetta Code has had in August 2022. \n;; See the Python example for a new example to fit the revised task.\n\n;Task:\nFix Rosetta Code deprecated code tags, with these rules:\n<pre>\nChange <lang %s> to <syntaxhighlight lang=%s>\nChange </lang> to </syntaxhighlight>\nChange <lang> to <syntaxhighlight lang=text>\n</pre>\n\n;Demonstrate the task on these examples:\n<pre>\n<lang AutoHotkey>; usage: > fixtags.ahk input.txt ouput.txt\nFileRead, text, %1%\nlangs = ada,awk,autohotkey,etc\nslang = /lang\nslang := \"<\" . slang . \"/>\"\nLoop, Parse, langs, `,\n{\n tag1 = <%A_LoopField%>\n tag2 = </%A_LoopField%>\n text := RegExReplace(text, tag1, \"<lang \" . A_LoopField . \">\")\n text := RegExReplace(text, tag2, slang)\n text := RegExReplace(text, \"<code (.+?)>(.*?)</code>\"\n , \"<lang $1>$2\" . slang)\n}\nFileAppend, % text, %2%\n</lang>\n</pre>\n<pre>\n<lang perl>my @langs = qw(ada cpp-qt pascal lscript z80 visualprolog\nhtml4strict cil objc asm progress teraterm hq9plus genero tsql\nemail pic16 tcl apt_sources io apache vhdl avisynth winbatch\nvbnet ini scilab ocaml-brief sas actionscript3 qbasic perl bnf\ncobol powershell php kixtart visualfoxpro mirc make javascript\ncpp sdlbasic cadlisp php-brief rails verilog xml csharp\nactionscript nsis bash typoscript freebasic dot applescript\nhaskell dos oracle8 cfdg glsl lotusscript mpasm latex sql klonec\nruby ocaml smarty python oracle11 caddcl robots groovy smalltalk\ndiff fortran cfm lua modula3 vb autoit java text scala\nlotusformulas pixelbender reg _div whitespace providex asp css\nlolcode lisp inno mysql plsql matlab oobas vim delphi xorg_conf\ngml prolog bf per scheme mxml d basic4gl m68k gnuplot idl abap\nintercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel\npovray c gettext);\n\nmy $text = join \"\", <STDIN>;\nmy $slang=\"/lang\";\nfor (@langs) {\n $text =~ s|<$_>|<lang $_>|g;\n $text =~ s|</$_>|<$slang>|g;\n}\n\n$text =~ s|<code (.+?)>(.*?)</code>|<lang $1>$2<$slang>|sg;\n\nprint $text;</lang>\n</pre>\n<pre>\n<lang>HAI 1.3\n\nI HAS A bottles ITZ 99 I HAS A plural ITZ \"Z\" I HAS A lyric ITZ \"99 BOTTLZ OV BEER\"\n\nIM IN YR song\n\n VISIBLE lyric \" ON TEH WALL\"\n VISIBLE lyric\n VISIBLE \"TAEK 1 DOWN, PAZ IT AROUN\"\n bottles R DIFF OF bottles AN 1\n NOT bottles, O RLY?\n YA RLY, VISIBLE \"NO MOAR BOTTLZ OV BEER ON TEH WALL\", GTFO\n OIC\n BOTH SAEM bottles AN 1, O RLY?\n YA RLY, plural R \"\"\n OIC\n lyric R SMOOSH bottles \" BOTTL\" plural \" OV BEER\" MKAY\n VISIBLE lyric \" ON TEH WALL:)\"\nIM OUTTA YR song\n\nKTHXBYE</lang>\n</pre>\n<br><br>\n\n","language":"00-TASK"},{"code":"V languages = [‘abap’, ‘actionscript’, ‘actionscript3’,\n ‘ada’, ‘apache’, ‘applescript’, ‘apt_sources’, ‘asm’, ‘asp’,\n ‘autoit’, ‘avisynth’, ‘bar’, ‘bash’, ‘basic4gl’, ‘bf’,\n ‘blitzbasic’, ‘bnf’, ‘boo’, ‘c’, ‘caddcl’, ‘cadlisp’, ‘cfdg’,\n ‘cfm’, ‘cil’, ‘c_mac’, ‘cobol’, ‘cpp’, ‘cpp-qt’, ‘csharp’, ‘css’,\n ‘d’, ‘delphi’, ‘diff’, ‘_div’, ‘dos’, ‘dot’, ‘eiffel’, ‘email’,\n ‘foo’, ‘fortran’, ‘freebasic’, ‘genero’, ‘gettext’, ‘glsl’, ‘gml’,\n ‘gnuplot’, ‘go’, ‘groovy’, ‘haskell’, ‘hq9plus’, ‘html4strict’,\n ‘idl’, ‘ini’, ‘inno’, ‘intercal’, ‘io’, ‘java’, ‘java5’,\n ‘javascript’, ‘kixtart’, ‘klonec’, ‘klonecpp’, ‘latex’, ‘lisp’,\n ‘lolcode’, ‘lotusformulas’, ‘lotusscript’, ‘lscript’, ‘lua’,\n ‘m68k’, ‘make’, ‘matlab’, ‘mirc’, ‘modula3’, ‘mpasm’, ‘mxml’,\n ‘mysql’, ‘nsis’, ‘objc’, ‘ocaml’, ‘ocaml-brief’, ‘oobas’,\n ‘oracle11’, ‘oracle8’, ‘pascal’, ‘per’, ‘perl’, ‘php’, ‘php-brief’,\n ‘pic16’, ‘pixelbender’, ‘plsql’, ‘povray’, ‘powershell’,\n ‘progress’, ‘prolog’, ‘providex’, ‘python’, ‘qbasic’, ‘rails’,\n ‘reg’, ‘robots’, ‘ruby’, ‘sas’, ‘scala’, ‘scheme’, ‘scilab’,\n ‘sdlbasic’, ‘smalltalk’, ‘smarty’, ‘sql’, ‘tcl’, ‘teraterm’,\n ‘text’, ‘thinbasic’, ‘tsql’, ‘typoscript’, ‘vb’, ‘vbnet’,\n ‘verilog’, ‘vhdl’, ‘vim’, ‘visualfoxpro’, ‘visualprolog’,\n ‘whitespace’, ‘winbatch’, ‘xml’, ‘xorg_conf’, ‘xpp’, ‘z80’]\n\nV text =\n‘Lorem ipsum <code foo>saepe audire</code> elaboraret ne quo, id equidem\natomorum inciderint usu. <foo>In sit inermis deleniti percipit</foo>,\nius ex tale civibus omittam. <barf>Vix ut doctus cetero invenire</barf>, his eu\naltera electram. Tota adhuc altera te sea, <code bar>soluta appetere ut mel</bar>.\nQuo quis graecis vivendo te, <baz>posse nullam lobortis ex usu</code>. Eam volumus perpetua\nconstituto id, mea an omittam fierent vituperatoribus.’\n\nL(lang) languages\n text = text.replace(‘<’lang‘>’, ‘<lang ’lang‘>’)\n text = text.replace(‘</’lang‘>’, ‘</’\"\"‘lang>’)\n text = text.replace(‘<code ’lang‘>’, ‘<lang ’lang‘>’)\ntext = text.replace(‘</code>’, ‘</’\"\"‘lang>’)\n\nprint(text)\n","language":"11l"},{"code":"; usage: > fixtags.ahk input.txt ouput.txt\nFileRead, text, %1%\nlangs = ada,awk,autohotkey,etc\nslang = /lang\nslang := \"<\" . slang . \"/>\"\nLoop, Parse, langs, `,\n{\n tag1 = <%A_LoopField%>\n tag2 = </%A_LoopField%>\n text := RegExReplace(text, tag1, \"<lang \" . A_LoopField . \">\")\n text := RegExReplace(text, tag2, slang)\n text := RegExReplace(text, \"<code (.+?)>(.*?)</code>\"\n , \"<lang $1>$2\" . slang)\n}\nFileAppend, % text, %2%\n","language":"AutoHotkey"},{"code":"import std.stdio, std.regex, std.string, std.array;\n\nimmutable langs = \"_div abap actionscript actionscript3 ada apache\napplescript apt_sources asm asp autoit avisynth bash basic4gl bf\nblitzbasic bnf boo c c_mac caddcl cadlisp cfdg cfm cil cobol cpp\ncpp-qt csharp css d delphi diff dos dot eiffel email fortran\nfreebasic genero gettext glsl gml gnuplot groovy haskell hq9plus\nhtml4strict idl ini inno intercal io java java5 javascript kixtart\nklonec klonecpp latex lisp lolcode lotusformulas lotusscript\nlscript lua m68k make matlab mirc modula3 mpasm mxml mysql nsis\nobjc ocaml ocaml-brief oobas oracle11 oracle8 pascal per perl php\nphp-brief pic16 pixelbender plsql povray powershell progress\nprolog providex python qbasic rails reg robots ruby sas scala\nscheme scilab sdlbasic smalltalk smarty sql tcl teraterm text\nthinbasic tsql typoscript vb vbnet verilog vhdl vim visualfoxpro\nvisualprolog whitespace winbatch xml xorg_conf xpp z80\".split;\n\nstring fixTags(string text) {\n static immutable slang = \"/lang\";\n static immutable code = \"code\";\n\n foreach (immutable lang; langs) {\n text = text.replace(\"<%s>\".format(lang),\n \"<lang %s>\".format(lang));\n text = text.replace(\"</%s>\".format(lang),\n \"<%s>\".format(slang));\n }\n\n return text.replace(\"<%s (.+?)>(.*?)</%s>\"\n .format(code, code).regex(\"g\"),\n \"<lang $1>$2<%s>\".format(slang));\n}\n\nvoid main() {\n (\"lorem ipsum <c>some c code</c>dolor sit amet, <csharp>some \" ~\n \"csharp code</csharp> consectetur adipisicing elit, <code r>\" ~\n \" some r code </code>sed do eiusmod tempor incididunt\")\n .fixTags\n .writeln;\n}\n","language":"D"},{"code":"program Fix_code_tags;\n\n{$APPTYPE CONSOLE}\n\nuses\n Winapi.Windows,\n System.SysUtils,\n System.Classes,\n System.RegularExpressions;\n\nconst\n LANGS: array of string = ['abap', 'actionscript', 'actionscript3', 'ada',\n 'apache', 'applescript', 'apt_sources', 'asm', 'asp', 'autoit', 'avisynth',\n 'bash', 'basic4gl', 'bf', 'blitzbasic', 'bnf', 'boo', 'c', 'caddcl',\n 'cadlisp', 'cfdg', 'cfm', 'cil', 'c_mac', 'cobol', 'cpp', 'cpp-qt', 'csharp',\n 'css', 'd', 'delphi', 'diff', '_div', 'dos', 'dot', 'eiffel', 'email',\n 'fortran', 'freebasic', 'genero', 'gettext', 'glsl', 'gml', 'gnuplot', 'go',\n 'groovy', 'haskell', 'hq9plus', 'html4strict', 'idl', 'ini', 'inno',\n 'intercal', 'io', 'java', 'java5', 'javascript', 'kixtart', 'klonec',\n 'klonecpp', 'latex', 'lisp', 'lolcode', 'lotusformulas', 'lotusscript',\n 'lscript', 'lua', 'm68k', 'make', 'matlab', 'mirc', 'modula3', 'mpasm',\n 'mxml', 'mysql', 'nsis', 'objc', 'ocaml', 'ocaml-brief', 'oobas', 'oracle11',\n 'oracle8', 'pascal', 'per', 'perl', 'php', 'php-brief', 'pic16',\n 'pixelbender', 'plsql', 'povray', 'powershell', 'progress', 'prolog',\n 'providex', 'python', 'qbasic', 'rails', 'reg', 'robots', 'ruby', 'sas',\n 'scala', 'scheme', 'scilab', 'sdlbasic', 'smalltalk', 'smarty', 'sql', 'tcl',\n 'teraterm', 'text', 'thinbasic', 'tsql', 'typoscript', 'vb', 'vbnet',\n 'verilog', 'vhdl', 'vim', 'visualfoxpro', 'visualprolog', 'whitespace',\n 'winbatch', 'xml', 'xorg_conf', 'xpp', 'z80'];\n\nprocedure repl(const Match: TMatch; var code: ansistring);\n\n procedure replace(_new: ansistring);\n begin\n code := StringReplace(code, Match.Value, '<' + _new + '>', [rfReplaceAll]);\n end;\n\nbegin\n if Match.Value = '/code' then\n begin\n replace('/lang');\n exit;\n end;\n\n if Match.Value = '</code>' then\n begin\n replace('/lang');\n exit;\n end;\n\n var mid := Lowercase(Trim(copy(Match.Value, 2, length(Match.Value) - 2)));\n\n for var lg in LANGS do\n begin\n if mid = lg then\n begin\n replace(format('lang %s', [lg]));\n exit;\n end;\n\n if mid[1] = '/' then\n begin\n replace('/lang');\n exit;\n end;\n\n if (pos('code', mid) = 1) and (copy(mid, 6, length(mid) - 2) = lg) then\n begin\n replace(format('lang %s', [lg]));\n exit;\n end;\n end;\nend;\n\nfunction Lang(input: ansistring): ansistring;\nvar\n reg: Tregex;\n match: TMatch;\nbegin\n reg := TRegex.Create('<[^>]+>');\n Result := input;\n for match in reg.Matches(input) do\n Repl(match, Result);\nend;\n\nfunction ReadAll: Ansistring;\nvar\n Buffer: array[0..1000] of byte;\n StdIn: TStream;\n Count: Integer;\n buf: Ansistring;\nbegin\n StdIn := THandleStream.Create(GetStdHandle(STD_INPUT_HANDLE));\n Result := '';\n while True do\n begin\n Count := StdIn.Read(Buffer, 1000);\n if Count = 0 then\n Break;\n SetLength(buf, Count);\n CopyMemory(@buf[1], @Buffer[0], Count);\n Result := Result + buf;\n end;\n StdIn.Free;\nend;\n\nprocedure Fix();\nvar\n input, output: ansistring;\nbegin\n input := ReadAll;\n output := Lang(input);\n writeln(output);\nend;\n\nbegin\n Fix;\nend.\n","language":"Delphi"},{"code":"#! /usr/bin/env escript\n-module( fix_code_tags ).\n-mode( compile ).\n\nmain( _ ) ->\n\tFile_lines = loop( io:get_line(\"\"), [] ),\n\tCode_fixed_lines = fix_code_tag( binary:list_to_bin(File_lines) ),\n%\ttrue = code:add_pathz( \"ebin\" ),\n%\tok = find_unimplemented_tasks:init(),\n%\tDict = dict:from_list( [dict_tuple(X) || X <- rank_languages_by_popularity:rosettacode_languages()],\n\tDict = dict:from_list( [dict_tuple(X) || X <- [\"foo\", \"bar\", \"baz\"]] ),\n\t{_Dict, All_fixed_lines} = lists:foldl( fun fix_language_tag/2, {Dict, Code_fixed_lines}, dict:fetch_keys(Dict) ),\n\tio:fwrite( \"~s\", [binary:bin_to_list(All_fixed_lines)] ).\n\n\n\ndict_tuple( Language ) -> {binary:list_to_bin(string:to_lower(Language)), binary:list_to_bin(Language)}.\n\nfix_code_tag( Binary ) ->\n\tAvoid_wiki = binary:list_to_bin( [<<\"<\">>, <<\"lang \">>] ),\n\tCode_fixed_lines = binary:replace( Binary, <<\"<code \">>, Avoid_wiki, [global] ),\n\tAvoid_wiki_again = binary:list_to_bin( [<<\"</\">>, <<\"lang \">>] ),\n\tbinary:replace( Code_fixed_lines, <<\"</code>\">>, Avoid_wiki_again, [global] ).\n\nfix_language_tag( Language_key, {Dict, Binary} ) ->\n\tLanguage = fix_language_tag_rosettacode_language( Language_key, dict:find(Language_key, Dict) ),\n\tLanguage_start_old = binary:list_to_bin( [<<\"<\">>, Language, <<\">\">>] ),\n\tLanguage_start_new = binary:list_to_bin( [<<\"<\">>, <<\"lang \">>, Language, <<\">\">>] ),\n\tFixed_lines = binary:replace( Binary, Language_start_old, Language_start_new, [global] ),\n\tLanguage_stop_old = binary:list_to_bin( [<<\"</\">>, Language, <<\">\">>] ),\n\tLanguage_stop_new = binary:list_to_bin( [<<\"</\">>, <<\"lang>\">>] ),\n\t{Dict, binary:replace( Fixed_lines, Language_stop_old, Language_stop_new, [global] )}.\n\nfix_language_tag_rosettacode_language( _Language_key, {ok, Language} ) -> Language;\nfix_language_tag_rosettacode_language( Language_key, error ) -> Language_key.\n\nloop( eof, Acc ) -> lists:reverse( Acc );\nloop( Line, Acc ) -> loop( io:get_line(\"\"), [Line | Acc] ).\n","language":"Erlang"},{"code":"open System\nopen System.Text.RegularExpressions\n\n[<EntryPoint>]\nlet main argv =\n let langs = [| \"foo\"; \"foo 2\"; \"bar\"; \"baz\" |]; // An array of (pseudo) languages we handle\n let regexStringAlternationOfLanguageNames = String.Join(\"|\", (Array.map Regex.Escape langs))\n let regexForOldLangSyntax =\n new Regex(String.Format(\"\"\"\n < # Opening of a tag.\n ( # Group alternation of 2 cases\n ( # Group for alternation of 2 cases with a language name\n (?<CloseMarker>/) # Might be a closing tag,\n | # Or\n code\\s # an old <code ...> tag\n )? # End of alternation; optional\n \\b(?<Lang>{0})\\b # Followed by the captured Language alternation\n | # Or\n (?<CloseMarker>/code)# An old </code> end tag\n ) # End of group\n > # The final tag closing\n \"\"\", regexStringAlternationOfLanguageNames),\n RegexOptions.IgnorePatternWhitespace ||| RegexOptions.ExplicitCapture)\n\n let replaceEvaluator (m : Match) =\n if m.Groups.Item(\"CloseMarker\").Length > 0 then \"</\" + \"lang>\"\n else \"<lang \" + m.Groups.Item(\"Lang\").Value + \">\"\n\n printfn \"%s\" (regexForOldLangSyntax.Replace(Console.In.ReadToEnd(), replaceEvaluator))\n 0\n","language":"F-Sharp"},{"code":"package main\n\nimport \"fmt\"\nimport \"io/ioutil\"\nimport \"log\"\nimport \"os\"\nimport \"regexp\"\nimport \"strings\"\n\nfunc main() {\n\terr := fix()\n\tif err != nil {\n\t\tlog.Fatalln(err)\n\t}\n}\n\nfunc fix() (err error) {\n\tbuf, err := ioutil.ReadAll(os.Stdin)\n\tif err != nil {\n\t\treturn err\n\t}\n\tout, err := Lang(string(buf))\n\tif err != nil {\n\t\treturn err\n\t}\n\tfmt.Println(out)\n\treturn nil\n}\n\nfunc Lang(in string) (out string, err error) {\n\treg := regexp.MustCompile(\"<[^>]+>\")\n\tout = reg.ReplaceAllStringFunc(in, repl)\n\treturn out, nil\n}\n\nfunc repl(in string) (out string) {\n\tif in == \"</code>\" {\n\t\t// Change </code> to </ lang>\n\t\treturn \"</\"+\"lang>\"\n\t}\n\n\t// mid is the content in between '<' and '>'.\n\tmid := in[1 : len(in)-1]\n\n\t// thanks, random lua guy\n\tvar langs = []string{\n\t\t\"abap\", \"actionscript\", \"actionscript3\", \"ada\", \"apache\", \"applescript\",\n\t\t\"apt_sources\", \"asm\", \"asp\", \"autoit\", \"avisynth\", \"bash\", \"basic4gl\",\n\t\t\"bf\", \"blitzbasic\", \"bnf\", \"boo\", \"c\", \"caddcl\", \"cadlisp\", \"cfdg\", \"cfm\",\n\t\t\"cil\", \"c_mac\", \"cobol\", \"cpp\", \"cpp-qt\", \"csharp\", \"css\", \"d\", \"delphi\",\n\t\t\"diff\", \"_div\", \"dos\", \"dot\", \"eiffel\", \"email\", \"fortran\", \"freebasic\",\n\t\t\"genero\", \"gettext\", \"glsl\", \"gml\", \"gnuplot\", \"go\", \"groovy\", \"haskell\",\n\t\t\"hq9plus\", \"html4strict\", \"idl\", \"ini\", \"inno\", \"intercal\", \"io\", \"java\",\n\t\t\"java5\", \"javascript\", \"kixtart\", \"klonec\", \"klonecpp\", \"latex\", \"lisp\",\n\t\t\"lolcode\", \"lotusformulas\", \"lotusscript\", \"lscript\", \"lua\", \"m68k\",\n\t\t\"make\", \"matlab\", \"mirc\", \"modula3\", \"mpasm\", \"mxml\", \"mysql\", \"nsis\",\n\t\t\"objc\", \"ocaml\", \"ocaml-brief\", \"oobas\", \"oracle11\", \"oracle8\", \"pascal\",\n\t\t\"per\", \"perl\", \"php\", \"php-brief\", \"pic16\", \"pixelbender\", \"plsql\",\n\t\t\"povray\", \"powershell\", \"progress\", \"prolog\", \"providex\", \"python\",\n\t\t\"qbasic\", \"rails\", \"reg\", \"robots\", \"ruby\", \"sas\", \"scala\", \"scheme\",\n\t\t\"scilab\", \"sdlbasic\", \"smalltalk\", \"smarty\", \"sql\", \"tcl\", \"teraterm\",\n\t\t\"text\", \"thinbasic\", \"tsql\", \"typoscript\", \"vb\", \"vbnet\", \"verilog\",\n\t\t\"vhdl\", \"vim\", \"visualfoxpro\", \"visualprolog\", \"whitespace\", \"winbatch\",\n\t\t\"xml\", \"xorg_conf\", \"xpp\", \"z80\",\n\t}\n\tfor _, lang := range langs {\n\t\tif mid == lang {\n\t\t\t// Change <%s> to <lang %s>\n\t\t\treturn fmt.Sprintf(\"<lang %s>\", lang)\n\t\t}\n\n\t\tif strings.HasPrefix(mid, \"/\") {\n\t\t\tif mid[len(\"/\"):] == lang {\n\t\t\t\t// Change </%s> to </ lang>\n\t\t\t\treturn \"</\"+\"lang>\"\n\t\t\t}\n\t\t}\n\n\t\tif strings.HasPrefix(mid, \"code \") {\n\t\t\tif mid[len(\"code \"):] == lang {\n\t\t\t\t// Change <code %s> to <lang %s>\n\t\t\t\treturn fmt.Sprintf(\"<lang %s>\", lang)\n\t\t\t}\n\t\t}\n\t}\n\n\treturn in\n}\n","language":"Go"},{"code":"require 'printf strings files'\n\nlangs=. <;._1 LF -.~ noun define NB. replace with real lang strings\n foo bar\n baz\n)\n","language":"J"},{"code":"fixCodeTags=: rplc&(, <;._2;._2 &> patterns vbsprintf _5]\\ 5#langs)\n","language":"J"},{"code":" 'converted.txt' fwrite~ fixCodeTags fread 'wikisource.txt'\n","language":"J"},{"code":"import java.io.BufferedReader;\nimport java.io.File;\nimport java.io.FileReader;\nimport java.io.FileWriter;\n\npublic class FixCodeTags\n{\n\tpublic static void main(String[] args)\n\t{\n\t\tString sourcefile=args[0];\n\t\tString convertedfile=args[1];\n\t\tconvert(sourcefile,convertedfile);\n\t}\n\t\tstatic String[] languages = {\"abap\", \"actionscript\", \"actionscript3\",\n\t\t\t\"ada\", \"apache\", \"applescript\", \"apt_sources\", \"asm\", \"asp\",\n\t\t\t\"autoit\", \"avisynth\", \"bar\", \"bash\", \"basic4gl\", \"bf\",\n\t\t\t\"blitzbasic\", \"bnf\", \"boo\", \"c\", \"caddcl\", \"cadlisp\", \"cfdg\",\n\t\t\t\"cfm\", \"cil\", \"c_mac\", \"cobol\", \"cpp\", \"cpp-qt\", \"csharp\", \"css\",\n\t\t\t\"d\", \"delphi\", \"diff\", \"_div\", \"dos\", \"dot\", \"eiffel\", \"email\",\n\t\t\t\"foo\", \"fortran\", \"freebasic\", \"genero\", \"gettext\", \"glsl\", \"gml\",\n\t\t\t\"gnuplot\", \"go\", \"groovy\", \"haskell\", \"hq9plus\", \"html4strict\",\n\t\t\t\"idl\", \"ini\", \"inno\", \"intercal\", \"io\", \"java\", \"java5\",\n\t\t\t\"javascript\", \"kixtart\", \"klonec\", \"klonecpp\", \"latex\", \"lisp\",\n\t\t\t\"lolcode\", \"lotusformulas\", \"lotusscript\", \"lscript\", \"lua\",\n\t\t\t\"m68k\", \"make\", \"matlab\", \"mirc\", \"modula3\", \"mpasm\", \"mxml\",\n\t\t\t\"mysql\", \"nsis\", \"objc\", \"ocaml\", \"ocaml-brief\", \"oobas\",\n\t\t\t\"oracle11\", \"oracle8\", \"pascal\", \"per\", \"perl\", \"php\", \"php-brief\",\n\t\t\t\"pic16\", \"pixelbender\", \"plsql\", \"povray\", \"powershell\",\n\t\t\t\"progress\", \"prolog\", \"providex\", \"python\", \"qbasic\", \"rails\",\n\t\t\t\"reg\", \"robots\", \"ruby\", \"sas\", \"scala\", \"scheme\", \"scilab\",\n\t\t\t\"sdlbasic\", \"smalltalk\", \"smarty\", \"sql\", \"tcl\", \"teraterm\",\n\t\t\t\"text\", \"thinbasic\", \"tsql\", \"typoscript\", \"vb\", \"vbnet\",\n\t\t\t\"verilog\", \"vhdl\", \"vim\", \"visualfoxpro\", \"visualprolog\",\n\t\t\t\"whitespace\", \"winbatch\", \"xml\", \"xorg_conf\", \"xpp\", \"z80\"};\n\tstatic void convert(String sourcefile,String convertedfile)\n\t{\n\t\ttry\n\t\t{\n\t\t\tBufferedReader br=new BufferedReader(new FileReader(sourcefile));\n\t\t\t//String buffer to store contents of the file\n\t\t\tStringBuffer sb=new StringBuffer(\"\");\n\t\t\tString line;\n\t\t\twhile((line=br.readLine())!=null)\n\t\t\t{\n\t\t\t\tfor(int i=0;i<languages.length;i++)\n\t\t\t\t{\n\t\t\t\t\tString lang=languages[i];\n\t\t\t\t\tline=line.replaceAll(\"<\"+lang+\">\", \"<lang \"+lang+\">\");\n\t\t\t\t\tline=line.replaceAll(\"</\"+lang+\">\", \"</\"+\"lang>\");\n\t\t\t\t\tline=line.replaceAll(\"<code \"+lang+\">\", \"<lang \"+lang+\">\");\n\t\t\t\t\tline=line.replaceAll(\"</code>\", \"</\"+\"lang>\");\n\t\t\t\t}\n\t\t\t\tsb.append(line);\n\t\t\t}\n\t\t\tbr.close();\n\t\t\t\n\t\t\tFileWriter fw=new FileWriter(new File(convertedfile));\n\t\t\t//Write entire string buffer into the file\n\t\t\tfw.write(sb.toString());\n\t\t\tfw.close();\n\t\t}\n\t\tcatch (Exception e)\n\t\t{\n\t\t\tSystem.out.println(\"Something went horribly wrong: \"+e.getMessage());\n\t\t}\n\t}\n}\n","language":"Java"},{"code":"var langs = ['foo', 'bar', 'baz']; // real list of langs goes here\nvar end_tag = '</'+'lang>';\n\nvar line;\nwhile (line = readline()) {\n line = line.replace(new RegExp('</code>', 'gi'), end_tag);\n for (var i = 0; i < langs.length; i++)\n line = line.replace(new RegExp('<(?:code )?(' + langs[i] + ')>', 'gi'), '<lang $1>')\n .replace(new RegExp('</' + langs[i] + '>', 'gi'), end_tag);\n print(line);\n}\n","language":"JavaScript"},{"code":"function fixtags(text::AbstractString)\n langs = [\"ada\", \"cpp-qt\", \"pascal\", \"lscript\", \"z80\", \"visualprolog\",\n \"html4strict\", \"cil\", \"objc\", \"asm\", \"progress\", \"teraterm\", \"hq9plus\",\n \"genero\", \"tsql\", \"email\", \"pic16\", \"tcl\", \"apt_sources\", \"io\", \"apache\",\n \"vhdl\", \"avisynth\", \"winbatch\", \"vbnet\", \"ini\", \"scilab\", \"ocaml-brief\",\n \"sas\", \"actionscript3\", \"qbasic\", \"perl\", \"bnf\", \"cobol\", \"powershell\",\n \"php\", \"kixtart\", \"visualfoxpro\", \"mirc\", \"make\", \"javascript\", \"cpp\",\n \"sdlbasic\", \"cadlisp\", \"php-brief\", \"rails\", \"verilog\", \"xml\", \"csharp\",\n \"actionscript\", \"nsis\", \"bash\", \"typoscript\", \"freebasic\", \"dot\",\n \"applescript\", \"haskell\", \"dos\", \"oracle8\", \"cfdg\", \"glsl\", \"lotusscript\",\n \"mpasm\", \"latex\", \"sql\", \"klonec\", \"ruby\", \"ocaml\", \"smarty\", \"python\",\n \"oracle11\", \"caddcl\", \"robots\", \"groovy\", \"smalltalk\", \"diff\", \"fortran\",\n \"cfm\", \"lua\", \"modula3\", \"vb\", \"autoit\", \"java\", \"text\", \"scala\",\n \"lotusformulas\", \"pixelbender\", \"reg\", \"_div\", \"whitespace\", \"providex\",\n \"asp\", \"css\", \"lolcode\", \"lisp\", \"inno\", \"mysql\", \"plsql\", \"matlab\",\n \"oobas\", \"vim\", \"delphi\", \"xorg_conf\", \"gml\", \"prolog\", \"bf\", \"per\",\n \"scheme\", \"mxml\", \"d\", \"basic4gl\", \"m68k\", \"gnuplot\", \"idl\", \"abap\",\n \"intercal\", \"c_mac\", \"thinbasic\", \"java5\", \"xpp\", \"boo\", \"klonecpp\",\n \"blitzbasic\", \"eiffel\", \"povray\", \"c\", \"gettext\"]\n\n slang = \"/lang\"\n code = \"code\"\n\n for l in langs\n text = replace(text, \"<$l>\",\"<lang $l>\")\n text = replace(text, \"</$l>\", \"<$slang>\")\n end\n\n text = replace(text, Regex(\"(?s)<$code (.+?)>(.*?)</$code>\"), \"<lang \\\\1>\\\\2<$slang>\")\nend\n\nconst txt = readstring(ARGS[1])\nprintln(fixtags(txt))\n","language":"Julia"},{"code":"--thanks, random python guy\nlangs = {'ada', 'cpp-qt', 'pascal', 'lscript', 'z80', 'visualprolog',\n'html4strict', 'cil', 'objc', 'asm', 'progress', 'teraterm', 'hq9plus',\n'genero', 'tsql', 'email', 'pic16', 'tcl', 'apt_sources', 'io', 'apache',\n'vhdl', 'avisynth', 'winbatch', 'vbnet', 'ini', 'scilab', 'ocaml-brief',\n'sas', 'actionscript3', 'qbasic', 'perl', 'bnf', 'cobol', 'powershell',\n'php', 'kixtart', 'visualfoxpro', 'mirc', 'make', 'javascript', 'cpp',\n'sdlbasic', 'cadlisp', 'php-brief', 'rails', 'verilog', 'xml', 'csharp',\n'actionscript', 'nsis', 'bash', 'typoscript', 'freebasic', 'dot',\n'applescript', 'haskell', 'dos', 'oracle8', 'cfdg', 'glsl', 'lotusscript',\n'mpasm', 'latex', 'sql', 'klonec', 'ruby', 'ocaml', 'smarty', 'python',\n'oracle11', 'caddcl', 'robots', 'groovy', 'smalltalk', 'diff', 'fortran',\n'cfm', 'lua', 'modula3', 'vb', 'autoit', 'java', 'text', 'scala',\n'lotusformulas', 'pixelbender', 'reg', '_div', 'whitespace', 'providex',\n'asp', 'css', 'lolcode', 'lisp', 'inno', 'mysql', 'plsql', 'matlab',\n'oobas', 'vim', 'delphi', 'xorg_conf', 'gml', 'prolog', 'bf', 'per',\n'scheme', 'mxml', 'd', 'basic4gl', 'm68k', 'gnuplot', 'idl', 'abap',\n'intercal', 'c_mac', 'thinbasic', 'java5', 'xpp', 'boo', 'klonecpp',\n'blitzbasic', 'eiffel', 'povray', 'c', 'gettext'}\n\nfor line in io.lines() do\n for i, v in ipairs(langs) do\n\tline = line:gsub(\"<\" .. v .. \">\", \"<lang \" .. v .. \">\")\n line = line:gsub(\"<code \" .. v .. \">\", \"<lang \" .. v .. \">\")\n line = line:gsub(\"</\" .. v .. \">\", \"</\" .. \"lang>\") --the weird concatenation is to prevent the markup from breaking\n line = line:gsub(\"</\" .. \"code>\", \"</\" .. \"lang>\")\n end\n print(line)\nend\n","language":"Lua"},{"code":"#Used <#/lang> to desensitize wiki\ntxt := FileTools[Text][ReadFile](\"C:/Users/username/Desktop/text.txt\"):\n#langs should be a real list of programming languages\nlangs := ['foo', 'bar', 'baz', 'barf'];\nfor lan in langs do\n\ttxt := StringTools:-SubstituteAll(txt, cat(\"<\", lan, \">\"), cat (\"<lang \", lan, \">\")):\n\ttxt := StringTools:-SubstituteAll(txt, cat(\"</\", lan, \">\"), \"<#/lang>\"):\n\ttxt := StringTools:-SubstituteAll(txt, cat(\"<code \", lan, \">\"), cat (\"<lang \", lan, \">\")):\n\ttxt := StringTools:-SubstituteAll(txt, \"</code>\", \"<#/lang>\"):\nend do;\nprint(txt);\n","language":"Maple"},{"code":"StringReplace[Import[\"wikisource.txt\"],\n{\"</\"~~Shortest[__]~~\">\"->\"</lang>\",\n(\"<code \"|\"<\")~~Shortest[x__]~~\">\"->\"<lang \"~~ x~~\">\"}\n]>>\"converted.txt\"\n","language":"Mathematica"},{"code":"import re, strutils\n\nconst\n Langs = [\"ada\", \"cpp-qt\", \"pascal\", \"lscript\", \"z80\", \"visualprolog\",\n \"html4strict\", \"cil\", \"objc\", \"asm\", \"progress\", \"teraterm\", \"hq9plus\",\n \"genero\", \"tsql\", \"email\", \"pic16\", \"tcl\", \"apt_sources\", \"io\", \"apache\",\n \"vhdl\", \"avisynth\", \"winbatch\", \"vbnet\", \"ini\", \"scilab\", \"ocaml-brief\",\n \"sas\", \"actionscript3\", \"qbasic\", \"perl\", \"bnf\", \"cobol\", \"powershell\",\n \"php\", \"kixtart\", \"visualfoxpro\", \"mirc\", \"make\", \"javascript\", \"cpp\",\n \"sdlbasic\", \"cadlisp\", \"php-brief\", \"rails\", \"verilog\", \"xml\", \"csharp\",\n \"actionscript\", \"nsis\", \"bash\", \"typoscript\", \"freebasic\", \"dot\",\n \"applescript\", \"haskell\", \"dos\", \"oracle8\", \"cfdg\", \"glsl\", \"lotusscript\",\n \"mpasm\", \"latex\", \"sql\", \"klonec\", \"ruby\", \"ocaml\", \"smarty\", \"python\",\n \"oracle11\", \"caddcl\", \"robots\", \"groovy\", \"smalltalk\", \"diff\", \"fortran\",\n \"cfm\", \"lua\", \"modula3\", \"vb\", \"autoit\", \"java\", \"text\", \"scala\",\n \"lotusformulas\", \"pixelbender\", \"reg\", \"_div\", \"whitespace\", \"providex\",\n \"asp\", \"css\", \"lolcode\", \"lisp\", \"inno\", \"mysql\", \"plsql\", \"matlab\",\n \"oobas\", \"vim\", \"delphi\", \"xorg_conf\", \"gml\", \"prolog\", \"bf\", \"per\",\n \"scheme\", \"mxml\", \"d\", \"basic4gl\", \"m68k\", \"gnuplot\", \"idl\", \"abap\",\n \"intercal\", \"c_mac\", \"thinbasic\", \"java5\", \"xpp\", \"boo\", \"klonecpp\",\n \"blitzbasic\", \"eiffel\", \"povray\", \"c\", \"gettext\"]\n\nvar text = stdin.readAll()\n\nfor lang in Langs:\n text = text.replace(\"<$#>\" % lang, \"<lang $#>\" % lang)\n text = text.replace(\"</$#>\" % lang, \"</lang>\")\n\ntext = text.replacef(re\"(?s)<code (.+?)>(.*?)</code>\", r\"<lang $1>$2</lang>\")\n\nstdout.write text\n","language":"Nim"},{"code":"#load \"str.cma\"\n\nlet langs =\n Str.split (Str.regexp \" \")\n \"actionscript ada algol68 amigae applescript autohotkey awk bash basic \\\n befunge bf c cfm cobol cpp csharp d delphi e eiffel factor false forth \\\n fortran fsharp haskell haxe j java javascript lisaac lisp logo lua m4 \\\n mathematica maxscript modula3 moo objc ocaml octave oz pascal perl \\\n raku php pike pop11 powershell prolog python qbasic r rebol ruby \\\n scala scheme slate smalltalk tcl ti89b vbnet vedit\"\n\nlet read_in ic =\n let buf = Buffer.create 16384\n and tmp = String.create 4096 in\n let rec aux() =\n let bytes = input ic tmp 0 4096 in\n if bytes > 0 then begin\n Buffer.add_substring buf tmp 0 bytes;\n aux()\n end\n in\n (try aux() with End_of_file -> ());\n (Buffer.contents buf)\n\nlet repl pat tpl str =\n let reg = Str.regexp_string_case_fold pat in\n let str = Str.global_replace reg tpl str in\n (str)\n\n(* change <%s> to <lang %s> *)\nlet repl1 lang str =\n let pat = \"<\" ^ lang ^ \">\"\n and tpl = \"<lang \" ^ lang ^ \">\" in\n (repl pat tpl str)\n\n(* change </%s> to </la\\ng> *)\nlet repl2 lang str =\n let pat = \"</\" ^ lang ^ \">\"\n and tpl = \"</lang\"^\">\" in\n (repl pat tpl str)\n\n(* change <code %s> to <lang %s> *)\nlet repl3 lang str =\n let pat = \"<code \" ^ lang ^ \">\"\n and tpl = \"<lang \" ^ lang ^ \">\" in\n (repl pat tpl str)\n\n(* change </code> to </la\\ng> *)\nlet repl4 lang str =\n let pat = \"</code>\"\n and tpl = \"</lang\"^\">\" in\n (repl pat tpl str)\n\n\nlet () =\n print_string (\n List.fold_left (fun str lang ->\n (repl4 lang (repl3 lang (repl2 lang (repl1 lang str))))\n ) (read_in stdin) langs)\n","language":"OCaml"},{"code":" (repl4 lang (repl3 lang (repl2 lang (repl1 lang str))))\n","language":"OCaml"},{"code":" List.fold_right (fun repl -> repl lang) [repl1; repl2; repl3; repl4] str\n","language":"OCaml"},{"code":"my @langs = qw(ada cpp-qt pascal lscript z80 visualprolog\nhtml4strict cil objc asm progress teraterm hq9plus genero tsql\nemail pic16 tcl apt_sources io apache vhdl avisynth winbatch\nvbnet ini scilab ocaml-brief sas actionscript3 qbasic perl bnf\ncobol powershell php kixtart visualfoxpro mirc make javascript\ncpp sdlbasic cadlisp php-brief rails verilog xml csharp\nactionscript nsis bash typoscript freebasic dot applescript\nhaskell dos oracle8 cfdg glsl lotusscript mpasm latex sql klonec\nruby ocaml smarty python oracle11 caddcl robots groovy smalltalk\ndiff fortran cfm lua modula3 vb autoit java text scala\nlotusformulas pixelbender reg _div whitespace providex asp css\nlolcode lisp inno mysql plsql matlab oobas vim delphi xorg_conf\ngml prolog bf per scheme mxml d basic4gl m68k gnuplot idl abap\nintercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel\npovray c gettext);\n\nmy $text = join \"\", <STDIN>;\nmy $slang=\"/lang\";\nfor (@langs) {\n $text =~ s|<$_>|<lang $_>|g;\n $text =~ s|</$_>|<$slang>|g;\n}\n\n$text =~ s|<code (.+?)>(.*?)</code>|<lang $1>$2<$slang>|sg;\n\nprint $text;\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">ltext</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">`_div abap actionscript actionscript3 ada apache\n applescript apt_sources asm asp autoit avisynth bash basic4gl bf\n blitzbasic bnf boo c c_mac caddcl cadlisp cfdg cfm cil cobol cpp\n cpp-qt csharp css d delphi diff dos dot eiffel email fortran\n freebasic genero gettext glsl gml gnuplot groovy haskell hq9plus\n html4strict idl ini inno intercal io java java5 javascript kixtart\n klonec klonecpp latex lisp lolcode lotusformulas lotusscript\n lscript lua m68k make matlab mirc modula3 mpasm mxml mysql nsis\n objc ocaml ocaml-brief oobas oracle11 oracle8 pascal per perl php\n php-brief pic16 pixelbender plsql povray powershell progress\n prolog providex python qbasic r rails reg robots ruby sas scala\n scheme scilab sdlbasic smalltalk smarty sql tcl teraterm text\n thinbasic tsql typoscript vb vbnet verilog vhdl vim visualfoxpro\n visualprolog whitespace winbatch xml xorg_conf xpp z80`</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">langs</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ltext</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">))</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">fix_tags</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">langs</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">lang</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">langs</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #000000;\">openl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"<%s>\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">lang</span><span style=\"color: #0000FF;\">}),</span>\n <span style=\"color: #000000;\">openc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"<code %s>\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">lang</span><span style=\"color: #0000FF;\">}),</span>\n <span style=\"color: #000000;\">lopen</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"<lang %s>\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">lang</span><span style=\"color: #0000FF;\">}),</span>\n <span style=\"color: #000000;\">closl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"</%s>\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">lang</span><span style=\"color: #0000FF;\">}),</span>\n <span style=\"color: #000000;\">closc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"</%s>\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"code\"</span><span style=\"color: #0000FF;\">}),</span>\n <span style=\"color: #000000;\">lclos</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"</%s>\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"lang\"</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">text</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute_all</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">openl</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">openc</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">closl</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">closc</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">lopen</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">lopen</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">lclos</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">lclos</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">text</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">test</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n lorem ipsum <c>some c code</c>dolor sit amet, <csharp>some\n csharp code</csharp> consectetur adipisicing elit, <code r>\n some r code </code>sed do eiusmod tempor incididunt\n \"\"\"</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">fix_tags</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">))</span>\n<!--\n","language":"Phix"},{"code":"#!/usr/bin/picolisp /usr/lib/picolisp/lib.l\n\n(let Lang '(\"ada\" \"awk\" \"c\" \"forth\" \"prolog\" \"python\" \"z80\")\n (in NIL\n (while (echo \"<\")\n (let S (till \">\" T)\n (cond\n ((pre? \"code \" S) (prin \"<lang\" (cddddr (chop S))))\n ((member S Lang) (prin \"<lang \" S))\n ((= S \"/code\") (prin \"</lang\"))\n ((and (pre? \"/\" S) (member (pack (cdr (chop S))) Lang))\n (prin \"</lang\") )\n (T (prin \"<\" S)) ) ) ) ) )\n(bye)\n","language":"PicoLisp"},{"code":"If Not OpenConsole()\n End\nElseIf CountProgramParameters() <> 2\n PrintN(\"Usage: \"+GetFilePart(ProgramFilename())+\" InFile OutFile\")\n End\nEndIf\n\nDefine Infile$ =ProgramParameter(), Outfile$=ProgramParameter()\nIf ReadFile(0,Infile$)\n NewList Out$()\n Define line$, part$, new$, pos1, pos2\n While Not Eof(0)\n line$=ReadString(0): pos2=0\n Repeat\n pos1=FindString(line$,\"<\",pos2)\n pos2=FindString(line$,\">\",pos1)\n If pos1 And pos2\n part$=Mid(line$,pos1+1,pos2-pos1-1)\n If Mid(part$,1,1)=\"/\"\n new$=\"<\"+\"/lang>\" ; Line split to avoid problem forum coding\n ElseIf Mid(part$,1,5)=\"code \"\n new$=\"<lang \"+Mid(part$,6)+\">\"\n Else\n new$=\"<lang \"+part$+\">\"\n EndIf\n line$=ReplaceString(line$,\"<\"+part$+\">\",new$)\n Else\n Break\n EndIf\n ForEver\n AddElement(Out$()): Out$()=line$\n Wend\n CloseFile(0)\n If CreateFile(1, Outfile$)\n ForEach Out$()\n WriteStringN(1,Out$())\n Next\n CloseFile(1)\n EndIf\nEndIf\n","language":"PureBasic"},{"code":"\"\"\" Rosetta Code task rosettacode.org/wiki/Rosetta_Code/Fix_code_tags \"\"\"\n\nfrom re import sub\n\ntesttexts = [\n\"\"\"<lang AutoHotkey>; usage: > fixtags.ahk input.txt ouput.txt\nFileRead, text, %1%\nlangs = ada,awk,autohotkey,etc\nslang = /lang\nslang := \"<\" . slang . \"/>\"\nLoop, Parse, langs, `,\n{\n tag1 = <%A_LoopField%>\n tag2 = </%A_LoopField%>\n text := RegExReplace(text, tag1, \"<lang \" . A_LoopField . \">\")\n text := RegExReplace(text, tag2, slang)\n text := RegExReplace(text, \"<code (.+?)>(.*?)</code>\"\n , \"<lang $1>$2\" . slang)\n}\nFileAppend, % text, %2%\n</lang>\"\"\",\n \"\"\"<lang perl>my @langs = qw(ada cpp-qt pascal lscript z80 visualprolog\nhtml4strict cil objc asm progress teraterm hq9plus genero tsql\nemail pic16 tcl apt_sources io apache vhdl avisynth winbatch\nvbnet ini scilab ocaml-brief sas actionscript3 qbasic perl bnf\ncobol powershell php kixtart visualfoxpro mirc make javascript\ncpp sdlbasic cadlisp php-brief rails verilog xml csharp\nactionscript nsis bash typoscript freebasic dot applescript\nhaskell dos oracle8 cfdg glsl lotusscript mpasm latex sql klonec\nruby ocaml smarty python oracle11 caddcl robots groovy smalltalk\ndiff fortran cfm lua modula3 vb autoit java text scala\nlotusformulas pixelbender reg _div whitespace providex asp css\nlolcode lisp inno mysql plsql matlab oobas vim delphi xorg_conf\ngml prolog bf per scheme mxml d basic4gl m68k gnuplot idl abap\nintercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel\npovray c gettext);\n\nmy $text = join \"\", <STDIN>;\nmy $slang=\"/lang\";\nfor (@langs) {\n $text =~ s|<$_>|<lang $_>|g;\n $text =~ s|</$_>|<$slang>|g;\n}\n\n$text =~ s|<code (.+?)>(.*?)</code>|<lang $1>$2<$slang>|sg;\n\nprint $text;</lang>\"\"\",\n \"\"\"<lang>HAI 1.3\n\nI HAS A bottles ITZ 99 I HAS A plural ITZ \"Z\" I HAS A lyric ITZ \"99 BOTTLZ OV BEER\"\n\nIM IN YR song\n\n VISIBLE lyric \" ON TEH WALL\"\n VISIBLE lyric\n VISIBLE \"TAEK 1 DOWN, PAZ IT AROUN\"\n bottles R DIFF OF bottles AN 1\n NOT bottles, O RLY?\n YA RLY, VISIBLE \"NO MOAR BOTTLZ OV BEER ON TEH WALL\", GTFO\n OIC\n BOTH SAEM bottles AN 1, O RLY?\n YA RLY, plural R \"\"\n OIC\n lyric R SMOOSH bottles \" BOTTL\" plural \" OV BEER\" MKAY\n VISIBLE lyric \" ON TEH WALL:)\"\nIM OUTTA YR song\n\nKTHXBYE</lang>\n\"\"\"]\n\nfor txt in testtexts:\n text2 = sub(r'<lang\\s+\\\"?([\\w\\d\\s]+)\\\"?\\s?>', r'<syntaxhighlight lang=\\1>', txt)\n text2 = sub(r'<lang\\s*>', '<syntaxhighlight lang=text>', text2)\n text2 = sub(r'</lang\\s*>', '</syntax'+'highlight>', text2)\n print(txt, '\\n=>\\n', text2)\n","language":"Python"},{"code":"; usage: > fixtags.ahk input.txt ouput.txt\nFileRead, text, %1%\nlangs = ada,awk,autohotkey,etc\nslang = /lang\nslang := \"<\" . slang . \"/>\"\nLoop, Parse, langs, `,\n{\n tag1 = <%A_LoopField%>\n tag2 = </%A_LoopField%>\n text := RegExReplace(text, tag1, \"<lang \" . A_LoopField . \">\")\n text := RegExReplace(text, tag2, slang)\n text := RegExReplace(text, \"<code (.+?)>(.*?)</code>\"\n , \"<lang $1>$2\" . slang)\n}\nFileAppend, % text, %2%\n","language":"Python"},{"code":"my @langs = qw(ada cpp-qt pascal lscript z80 visualprolog\nhtml4strict cil objc asm progress teraterm hq9plus genero tsql\nemail pic16 tcl apt_sources io apache vhdl avisynth winbatch\nvbnet ini scilab ocaml-brief sas actionscript3 qbasic perl bnf\ncobol powershell php kixtart visualfoxpro mirc make javascript\ncpp sdlbasic cadlisp php-brief rails verilog xml csharp\nactionscript nsis bash typoscript freebasic dot applescript\nhaskell dos oracle8 cfdg glsl lotusscript mpasm latex sql klonec\nruby ocaml smarty python oracle11 caddcl robots groovy smalltalk\ndiff fortran cfm lua modula3 vb autoit java text scala\nlotusformulas pixelbender reg _div whitespace providex asp css\nlolcode lisp inno mysql plsql matlab oobas vim delphi xorg_conf\ngml prolog bf per scheme mxml d basic4gl m68k gnuplot idl abap\nintercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel\npovray c gettext);\n\nmy $text = join \"\", <STDIN>;\nmy $slang=\"/lang\";\nfor (@langs) {\n $text =~ s|<$_>|<lang $_>|g;\n $text =~ s|</$_>|<$slang>|g;\n}\n\n$text =~ s|<code (.+?)>(.*?)</code>|<lang $1>$2<$slang>|sg;\n\nprint $text;\n","language":"Python"},{"code":"HAI 1.3\n\nI HAS A bottles ITZ 99 I HAS A plural ITZ \"Z\" I HAS A lyric ITZ \"99 BOTTLZ OV BEER\"\n\nIM IN YR song\n\n VISIBLE lyric \" ON TEH WALL\"\n VISIBLE lyric\n VISIBLE \"TAEK 1 DOWN, PAZ IT AROUN\"\n bottles R DIFF OF bottles AN 1\n NOT bottles, O RLY?\n YA RLY, VISIBLE \"NO MOAR BOTTLZ OV BEER ON TEH WALL\", GTFO\n OIC\n BOTH SAEM bottles AN 1, O RLY?\n YA RLY, plural R \"\"\n OIC\n lyric R SMOOSH bottles \" BOTTL\" plural \" OV BEER\" MKAY\n VISIBLE lyric \" ON TEH WALL:)\"\nIM OUTTA YR song\n\nKTHXBYE\n","language":"Python"},{"code":"fixtags <- function(page)\n{\n langs <- c(\"c\", \"c-sharp\", \"r\") # a complete list is required, obviously\n langs <- paste(langs, collapse=\"|\")\n page <- gsub(paste(\"<(\", langs, \")>\", sep=\"\"), \"<lang \\\\1>\", page)\n page <- gsub(paste(\"</(\", langs, \")>\", sep=\"\"), \"</#####lang>\", page)\n page <- gsub(paste(\"<code(\", langs, \")>\", sep=\"\"), \"<lang \\\\1>\", page)\n page <- gsub(paste(\"</code>\", sep=\"\"), \"</#####lang>\", page)\n page\n}\n\npage <- \"lorem ipsum <c>some c code</c>dolor sit amet,<c-sharp>some c-sharp code</c-sharp>\nconsectetur adipisicing elit,<code r>some r code</code>sed do eiusmod tempor incididunt\"\nfixtags(page)\n","language":"R"},{"code":"#lang racket\n\n(define lang-names '(\"X\" \"Y\" \"Z\"))\n\n(define rx\n (regexp (string-join lang-names \"|\"\n #:before-first \"<((/?(?:code)?)(?:( )?(\"\n #:after-last \"))?)>\")))\n\n(let loop () ; does all in a single scan\n (define m (regexp-match rx (current-input-port) 0 #f (current-output-port)))\n (when m\n (define-values [all pfx space lang] (apply values (cdr m)))\n (printf \"<~a>\"\n (cond [(not lang) (if (equal? pfx #\"/code\") #\"/lang\" all)]\n [space (if (equal? pfx #\"code\") (bytes-append #\"lang \" lang) all)]\n [(equal? pfx #\"\") (bytes-append #\"lang \" lang)]\n [(equal? pfx #\"/\") #\"/lang\"]\n [else all]))\n (loop)))\n","language":"Racket"},{"code":"my @langs = <\n abap actionscript actionscript3 ada apache applescript apt_sources\n asm asp autoit avisynth bash basic4gl bf blitzbasic bnf boo c caddcl\n cadlisp cfdg cfm cil c_mac cobol cpp cpp-qt csharp css d delphi\n diff _div dos dot eiffel email fortran freebasic genero gettext\n glsl gml gnuplot groovy haskell hq9plus html4strict idl ini inno\n intercal io java java5 javascript kixtart klonec klonecpp latex lisp\n lolcode lotusformulas lotusscript lscript lua m68k make matlab mirc\n modula3 mpasm mxml mysql nsis objc ocaml ocaml-brief oobas oracle11\n oracle8 pascal per perl php php-brief pic16 pixelbender plsql povray\n powershell progress prolog providex python qbasic rails reg robots\n ruby sas scala scheme scilab sdlbasic smalltalk smarty sql tcl teraterm\n text thinbasic tsql typoscript vb vbnet verilog vhdl vim visualfoxpro\n visualprolog whitespace winbatch xml xorg_conf xpp z80\n>;\n\n$_ = slurp;\n\nfor @langs -> $l {\n s:g:i [ '<' 'lang '? $l '>' ] = \"<lang $l>\";\n s:g [ '</' $l '>' ] = '</' ~ 'lang>';\n}\n\ns:g [ '<code '(.+?) '>' (.*?) '</code>' ] = \"<lang $0>{$1}</\"~\"lang>\";\n\n.say;\n","language":"Raku"},{"code":"use v6;\n\nconstant @langs = < abap actionscript actionscript3 ada … >;\n\nslurp().subst(\n rx:r{\n | '<' <( $<need-add-space>=<?> )> @langs '>'\n | '</' <( @langs )> '>'\n | '<' '/'? <( code )> [<.ws> @langs]? '>'\n },\n 'lang' ~ \" \" x *<need-add-space>.so,\n :g,\n).print\n","language":"Raku"},{"code":"/*REXX program fixes (changes) depreciated HTML code tags with newer tags. */\n@=\"<\"; old.=; old.1 = @'%s>' ; new.1 = @\"lang %s>\"\n old.2 = @'/%s>' ; new.2 = @\"/lang>\"\n old.3 = @'code %s>' ; new.3 = @\"lang %s>\"\n old.4 = @'/code>' ; new.4 = @\"/lang>\"\n\niFID = 'Wikisource.txt' /*the Input File IDentifier. */\noFID = 'converted.txt' /*the Output \" \" */\n\n do while lines(iFID)\\==0 /*keep reading the file until finished.*/\n $= linein(iFID) /*read a record from the input file. */\n do j=1 while old.j \\== '' /*change old ──► new until finished. */\n $= changestr(old.j,$,new.j) /*let REXX do the heavy lifting. */\n end /*j*/\n call lineout oFID,$ /*write re-formatted record to output. */\n end /*while*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"# get all stdin in one string\n#text = $stdin.read\n# for testing, use\ntext = DATA.read\nslash_lang = '/lang'\nlangs = %w(foo bar baz) # actual list of languages declared here\nfor lang in langs\n text.gsub!(Regexp.new(\"<(#{lang})>\")) {\"<lang #$1>\"}\n text.gsub!(Regexp.new(\"</#{lang}>\"), \"<#{slash_lang}>\")\nend\ntext.gsub!(/<code (.*?)>/, '<lang \\1>')\ntext.gsub!(/<\\/code>/, \"<#{slash_lang}>\")\nprint text\n\n__END__\nLorem ipsum <code foo>saepe audire</code> elaboraret ne quo, id equidem\natomorum inciderint usu. <foo>In sit inermis deleniti percipit</foo>,\nius ex tale civibus omittam. <barf>Vix ut doctus cetero invenire</barf>, his eu\naltera electram. Tota adhuc altera te sea, <code bar>soluta appetere ut mel</bar>.\nQuo quis graecis vivendo te, <baz>posse nullam lobortis ex usu</code>. Eam volumus perpetua\nconstituto id, mea an omittam fierent vituperatoribus.\n","language":"Ruby"},{"code":"extern crate regex;\n\nuse std::io;\nuse std::io::prelude::*;\n\nuse regex::Regex;\n\nconst LANGUAGES: &str =\n \"_div abap actionscript actionscript3 ada apache applescript apt_sources asm asp autoit \\\n avisynth bash basic4gl bf blitzbasic bnf boo c c_mac caddcl cadlisp cfdg cfm cil cobol cpp \\\n cpp-qt csharp css d delphi diff dos dot eiffel email fortran freebasic genero gettext glsl \\\n gml gnuplot groovy haskell hq9plus html4strict idl ini inno intercal io java java5 \\\n javascript kixtart klonec klonecpp latex lisp lolcode lotusformulas lotusscript lscript lua \\\n m68k make matlab mirc modula3 mpasm mxml mysql nsis objc ocaml ocaml-brief oobas oracle11 \\\n oracle8 pascal per perl php php-brief pic16 pixelbender plsql povray powershell progress \\\n prolog providex python qbasic rails reg robots ruby rust sas scala scheme scilab sdlbasic \\\n smalltalk smarty sql tcl teraterm text thinbasic tsql typoscript vb vbnet verilog vhdl vim \\\n visualfoxpro visualprolog whitespace winbatch xml xorg_conf xpp z80\";\n\nfn fix_tags(languages: &[&str], text: &str) -> String {\n let mut replaced_text = text.to_owned();\n\n for lang in languages.iter() {\n let bad_open = Regex::new(&format!(\"<{lang}>|<code {lang}>\", lang = lang)).unwrap();\n let bad_close = Regex::new(&format!(\"</{lang}>|</code>\", lang = lang)).unwrap();\n let open = format!(\"<lang {}>\", lang);\n let close = \"</lang>\";\n\n replaced_text = bad_open.replace_all(&replaced_text, &open[..]).into_owned();\n replaced_text = bad_close\n .replace_all(&replaced_text, &close[..])\n .into_owned();\n }\n\n replaced_text\n}\n\nfn main() {\n let stdin = io::stdin();\n let mut buf = String::new();\n stdin.lock().read_to_string(&mut buf).unwrap();\n println!(\n \"{}\",\n fix_tags(&LANGUAGES.split_whitespace().collect::<Vec<_>>(), &buf)\n );\n}\n","language":"Rust"},{"code":"object FixCodeTags extends App {\n val rx = // See for regex explanation: https://regex101.com/r/N8X4x7/3/\n // Flags ignore case, dot matching line breaks, unicode support\n s\"(?is)<(?:(?:code\\\\s+)?(${langs.mkString(\"|\")}))>(.+?|)<\\\\/(?:code|\\\\1)>\".r\n\n def langs = // Real list of langs goes here\n Seq(\"bar\", \"baz\", \"foo\", \"Scala\", \"உயிர்/Uyir\", \"Müller\")\n\n def markDown =\n \"\"\"Lorem ipsum <Code foo>saepe audire</code> elaboraret ne quo, id equidem\n |atomorum inciderint usu. <foo>In sit inermis deleniti percipit</foo>, ius\n |ex tale civibus omittam. <barf>Vix ut doctus cetero invenire</barf>, his eu\n |altera electram. Tota adhuc altera te sea, <code bar>soluta appetere ut mel\n |</bar>. Quo quis graecis vivendo te, <baz>posse nullam lobortis ex usu</code>.\n |Eam volumus perpetua constituto id, mea an omittam fierent vituperatoribus.\n |Empty element: <Müller></Müller><scaLa></Scala><உயிர்/Uyir></உயிர்/Uyir>\"\"\".stripMargin\n\n println(rx.replaceAllIn(markDown, _ match {\n case rx(langName, langCode) => s\"<lang ${langName.capitalize}>${langCode}<${\"/lan\"}g>\"\n })) // ${\"/lan\"}g is the <noWiki> escape.\n\n}\n","language":"Scala"},{"code":"var langs = %w(ada cpp-qt pascal lscript z80 visualprolog\nhtml4strict cil objc asm progress teraterm hq9plus genero tsql\nemail pic16 tcl apt_sources io apache vhdl avisynth winbatch\nvbnet ini scilab ocaml-brief sas actionscript3 qbasic perl bnf\ncobol powershell php kixtart visualfoxpro mirc make javascript\ncpp sdlbasic cadlisp php-brief rails verilog xml csharp\nactionscript nsis bash typoscript freebasic dot applescript\nhaskell dos oracle8 cfdg glsl lotusscript mpasm latex sql klonec\nruby ocaml smarty python oracle11 caddcl robots groovy smalltalk\ndiff fortran cfm lua modula3 vb autoit java text scala\nlotusformulas pixelbender reg _div whitespace providex asp css\nlolcode lisp inno mysql plsql matlab oobas vim delphi xorg_conf\ngml prolog bf per scheme mxml d basic4gl m68k gnuplot idl abap\nintercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel\npovray c gettext).join('|');\n\nvar text = ARGF.slurp;\n\ntext.gsub!(Regex.new('<(' + langs + ')>'), {|s1| \"<lang #{s1}>\" });\ntext.gsub!(Regex.new('</(' + langs + ')>'), \"</\" + \"lang>\");\ntext.gsub!(\n Regex.new('<code\\h+(' + langs + ')>(.*?)</code>', 's'),\n {|s1,s2| \"<lang #{s1}>#{s2}</\" + \"lang>\"}\n);\n\nprint text;\n","language":"Sidef"},{"code":"set langs {\n ada cpp-qt pascal lscript z80 visualprolog html4strict cil objc asm progress teraterm\n hq9plus genero tsql email pic16 tcl apt_sources io apache vhdl avisynth winbatch vbnet\n ini scilab ocaml-brief sas actionscript3 qbasic perl bnf cobol powershell php kixtart\n visualfoxpro mirc make javascript cpp sdlbasic cadlisp php-brief rails verilog xml\n csharp actionscript nsis bash typoscript freebasic dot applescript haskell dos oracle8\n cfdg glsl lotusscript mpasm latex sql klonec ruby ocaml smarty python oracle11 caddcl\n robots groovy smalltalk diff fortran cfm lua modula3 vb autoit java text scala lotusformulas\n pixelbender reg _div whitespace providex asp css lolcode lisp inno mysql plsql matlab\n oobas vim delphi xorg_conf gml prolog bf per scheme mxml d basic4gl m68k gnuplot idl\n abap intercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel povray c gettext\n}\n\nset text [read stdin]\nset slang /lang\nforeach lang $langs {\n set text [regsub -all \"<$lang>\" $text \"<lang $lang>\"]\n set text [regsub -all \"</$lang>\" $text \"<$slang>\"]\n}\nset text [regsub -all \"<code (.+?)>(.+?)</code>\" $text \"<lang \\\\1>\\\\2<$slang>\"]</lang>\nAlternatively, for foreach loop may be replaced with:\n<lang tcl>set text [regexp -all \"<([join $langs |])>\" $text {<lang \\1>}]\nset text [regexp -all \"</(?:[join $langs |])>\" $text \"<$slang>\"]</lang>\n\nThis task does not require regular expressions at all:\n<lang tcl>set replacements [list </code> <$slang>]\nforeach lang $langs {\n lappend replacements \"<$lang>\" \"<lang $lang>\"\n lappend replacements \"</$lang>\" \"<$slang>\"\n lappend replacements \"<code $lang>\" \"<lang $lang>\"\n}\nset text [string map $replacements $text]\n","language":"Tcl"},{"code":"import \"./pattern\" for Pattern\n\nvar source1 = \"\"\"\n<lang AutoHotkey>; usage: > fixtags.ahk input.txt ouput.txt\nFileRead, text, %1%\nlangs = ada,awk,autohotkey,etc\nslang = /lang\nslang := \"<\" . slang . \"/>\"\nLoop, Parse, langs, `,\n{\n tag1 = <%A_LoopField%>\n tag2 = </%A_LoopField%>\n text := RegExReplace(text, tag1, \"<lang \" . A_LoopField . \">\")\n text := RegExReplace(text, tag2, slang)\n text := RegExReplace(text, \"<code (.+?)>(.*?)</code>\"\n , \"<lang $1>$2\" . slang)\n}\nFileAppend, % text, %2%\n</lang>\n\"\"\"\n\nvar source2 = \"\"\"\n<lang perl>my @langs = qw(ada cpp-qt pascal lscript z80 visualprolog\nhtml4strict cil objc asm progress teraterm hq9plus genero tsql\nemail pic16 tcl apt_sources io apache vhdl avisynth winbatch\nvbnet ini scilab ocaml-brief sas actionscript3 qbasic perl bnf\ncobol powershell php kixtart visualfoxpro mirc make javascript\ncpp sdlbasic cadlisp php-brief rails verilog xml csharp\nactionscript nsis bash typoscript freebasic dot applescript\nhaskell dos oracle8 cfdg glsl lotusscript mpasm latex sql klonec\nruby ocaml smarty python oracle11 caddcl robots groovy smalltalk\ndiff fortran cfm lua modula3 vb autoit java text scala\nlotusformulas pixelbender reg _div whitespace providex asp css\nlolcode lisp inno mysql plsql matlab oobas vim delphi xorg_conf\ngml prolog bf per scheme mxml d basic4gl m68k gnuplot idl abap\nintercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel\npovray c gettext);\n\nmy $text = join \"\", <STDIN>;\nmy $slang=\"/lang\";\nfor (@langs) {\n $text =~ s|<$_>|<lang $_>|g;\n $text =~ s|</$_>|<$slang>|g;\n}\n\n$text =~ s|<code (.+?)>(.*?)</code>|<lang $1>$2<$slang>|sg;\n\nprint $text;</lang>\n\"\"\"\n\nvar source3 = \"\"\"\n<lang>HAI 1.3\n\nI HAS A bottles ITZ 99 I HAS A plural ITZ \"Z\" I HAS A lyric ITZ \"99 BOTTLZ OV BEER\"\n\nIM IN YR song\n\n VISIBLE lyric \" ON TEH WALL\"\n VISIBLE lyric\n VISIBLE \"TAEK 1 DOWN, PAZ IT AROUN\"\n bottles R DIFF OF bottles AN 1\n NOT bottles, O RLY?\n YA RLY, VISIBLE \"NO MOAR BOTTLZ OV BEER ON TEH WALL\", GTFO\n OIC\n BOTH SAEM bottles AN 1, O RLY?\n YA RLY, plural R \"\"\n OIC\n lyric R SMOOSH bottles \" BOTTL\" plural \" OV BEER\" MKAY\n VISIBLE lyric \" ON TEH WALL:)\"\nIM OUTTA YR song\n\nKTHXBYE</lang>\n\"\"\"\n\nvar p = Pattern.new(\"<lang [+1^>]>\")\nvar sh = \"syntaxhighlight\"\nvar repl = \"<%(sh) lang=\\\"$1\\\">\"\nfor (source in [source1, source2, source3]) {\n source = p.replace(source, repl, 1, 0).\n replace(\"<lang>\", \"<%(sh) lang=\\\"text\\\">\").\n replace(\"</lang>\", \"</%(sh)>\")\n System.print(source)\n System.print()\n}\n","language":"Wren"},{"code":"; usage: > fixtags.ahk input.txt ouput.txt\nFileRead, text, %1%\nlangs = ada,awk,autohotkey,etc\nslang = /lang\nslang := \"<\" . slang . \"/>\"\nLoop, Parse, langs, `,\n{\n tag1 = <%A_LoopField%>\n tag2 = </%A_LoopField%>\n text := RegExReplace(text, tag1, \"<lang \" . A_LoopField . \">\")\n text := RegExReplace(text, tag2, slang)\n text := RegExReplace(text, \"<code (.+?)>(.*?)</code>\"\n , \"<lang $1>$2\" . slang)\n}\nFileAppend, % text, %2%\n","language":"Wren"},{"code":"my @langs = qw(ada cpp-qt pascal lscript z80 visualprolog\nhtml4strict cil objc asm progress teraterm hq9plus genero tsql\nemail pic16 tcl apt_sources io apache vhdl avisynth winbatch\nvbnet ini scilab ocaml-brief sas actionscript3 qbasic perl bnf\ncobol powershell php kixtart visualfoxpro mirc make javascript\ncpp sdlbasic cadlisp php-brief rails verilog xml csharp\nactionscript nsis bash typoscript freebasic dot applescript\nhaskell dos oracle8 cfdg glsl lotusscript mpasm latex sql klonec\nruby ocaml smarty python oracle11 caddcl robots groovy smalltalk\ndiff fortran cfm lua modula3 vb autoit java text scala\nlotusformulas pixelbender reg _div whitespace providex asp css\nlolcode lisp inno mysql plsql matlab oobas vim delphi xorg_conf\ngml prolog bf per scheme mxml d basic4gl m68k gnuplot idl abap\nintercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel\npovray c gettext);\n\nmy $text = join \"\", <STDIN>;\nmy $slang=\"/lang\";\nfor (@langs) {\n $text =~ s|<$_>|<lang $_>|g;\n $text =~ s|</$_>|<$slang>|g;\n}\n\n$text =~ s|<code (.+?)>(.*?)</code>|<lang $1>$2<$slang>|sg;\n\nprint $text;\n","language":"Wren"},{"code":"HAI 1.3\n\nI HAS A bottles ITZ 99 I HAS A plural ITZ \"Z\" I HAS A lyric ITZ \"99 BOTTLZ OV BEER\"\n\nIM IN YR song\n\n VISIBLE lyric \" ON TEH WALL\"\n VISIBLE lyric\n VISIBLE \"TAEK 1 DOWN, PAZ IT AROUN\"\n bottles R DIFF OF bottles AN 1\n NOT bottles, O RLY?\n YA RLY, VISIBLE \"NO MOAR BOTTLZ OV BEER ON TEH WALL\", GTFO\n OIC\n BOTH SAEM bottles AN 1, O RLY?\n YA RLY, plural R \"\"\n OIC\n lyric R SMOOSH bottles \" BOTTL\" plural \" OV BEER\" MKAY\n VISIBLE lyric \" ON TEH WALL:)\"\nIM OUTTA YR song\n\nKTHXBYE\n","language":"Wren"},{"code":"fcn replace(data,src,dstpat){\n re,n,buf:=RegExp(src),0,Data();\n while(re.search(data,True,n)){\n matched:=re.matched;\t// L(L(12,3),\"c\")\n data[matched[0].xplode()]=re.sub(data,dstpat,buf); // \"\\1\" --> \"c\"\n n=matched[0].sum(0); // move past change\n }\n}\ndata:=File.stdin.read();\nforeach src,dst in (T(\n T(0'|<(\\w+)>|, 0'|<lang \\1>|), T(0'|</(\\w+)>|,\"</\" \"lang>\"),\n T(0'|<code (\\w+)>|,0'|<lang \\1>|) )){\n replace(data,src,dst)\n}\nprint(data.text);\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Rosetta Code related\\nfrom: http://rosettacode.org/wiki/Rosetta_Code/Fix_code_tags\\nnote: Text processing\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";; This task has been <em>revised</em> for the hosting change Rosetta Code has had in August 2022. \\n;; See the Python example for a new example to fit the revised task.\\n\\n;Task:\\nFix Rosetta Code deprecated code tags, with these rules:\\n<pre>\\nChange <lang %s> to <syntaxhighlight lang=%s>\\nChange </lang> to </syntaxhighlight>\\nChange <lang> to <syntaxhighlight lang=text>\\n</pre>\\n\\n;Demonstrate the task on these examples:\\n<pre>\\n<lang AutoHotkey>; usage: > fixtags.ahk input.txt ouput.txt\\nFileRead, text, %1%\\nlangs = ada,awk,autohotkey,etc\\nslang = /lang\\nslang := \\\"<\\\" . slang . \\\"/>\\\"\\nLoop, Parse, langs, `,\\n{\\n tag1 = <%A_LoopField%>\\n tag2 = </%A_LoopField%>\\n text := RegExReplace(text, tag1, \\\"<lang \\\" . A_LoopField . \\\">\\\")\\n text := RegExReplace(text, tag2, slang)\\n text := RegExReplace(text, \\\"<code (.+?)>(.*?)</code>\\\"\\n , \\\"<lang $1>$2\\\" . slang)\\n}\\nFileAppend, % text, %2%\\n</lang>\\n</pre>\\n<pre>\\n<lang perl>my @langs = qw(ada cpp-qt pascal lscript z80 visualprolog\\nhtml4strict cil objc asm progress teraterm hq9plus genero tsql\\nemail pic16 tcl apt_sources io apache vhdl avisynth winbatch\\nvbnet ini scilab ocaml-brief sas actionscript3 qbasic perl bnf\\ncobol powershell php kixtart visualfoxpro mirc make javascript\\ncpp sdlbasic cadlisp php-brief rails verilog xml csharp\\nactionscript nsis bash typoscript freebasic dot applescript\\nhaskell dos oracle8 cfdg glsl lotusscript mpasm latex sql klonec\\nruby ocaml smarty python oracle11 caddcl robots groovy smalltalk\\ndiff fortran cfm lua modula3 vb autoit java text scala\\nlotusformulas pixelbender reg _div whitespace providex asp css\\nlolcode lisp inno mysql plsql matlab oobas vim delphi xorg_conf\\ngml prolog bf per scheme mxml d basic4gl m68k gnuplot idl abap\\nintercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel\\npovray c gettext);\\n\\nmy $text = join \\\"\\\", <STDIN>;\\nmy $slang=\\\"/lang\\\";\\nfor (@langs) {\\n $text =~ s|<$_>|<lang $_>|g;\\n $text =~ s|</$_>|<$slang>|g;\\n}\\n\\n$text =~ s|<code (.+?)>(.*?)</code>|<lang $1>$2<$slang>|sg;\\n\\nprint $text;</lang>\\n</pre>\\n<pre>\\n<lang>HAI 1.3\\n\\nI HAS A bottles ITZ 99 I HAS A plural ITZ \\\"Z\\\" I HAS A lyric ITZ \\\"99 BOTTLZ OV BEER\\\"\\n\\nIM IN YR song\\n\\n VISIBLE lyric \\\" ON TEH WALL\\\"\\n VISIBLE lyric\\n VISIBLE \\\"TAEK 1 DOWN, PAZ IT AROUN\\\"\\n bottles R DIFF OF bottles AN 1\\n NOT bottles, O RLY?\\n YA RLY, VISIBLE \\\"NO MOAR BOTTLZ OV BEER ON TEH WALL\\\", GTFO\\n OIC\\n BOTH SAEM bottles AN 1, O RLY?\\n YA RLY, plural R \\\"\\\"\\n OIC\\n lyric R SMOOSH bottles \\\" BOTTL\\\" plural \\\" OV BEER\\\" MKAY\\n VISIBLE lyric \\\" ON TEH WALL:)\\\"\\nIM OUTTA YR song\\n\\nKTHXBYE</lang>\\n</pre>\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V languages = [‘abap’, ‘actionscript’, ‘actionscript3’,\\n ‘ada’, ‘apache’, ‘applescript’, ‘apt_sources’, ‘asm’, ‘asp’,\\n ‘autoit’, ‘avisynth’, ‘bar’, ‘bash’, ‘basic4gl’, ‘bf’,\\n ‘blitzbasic’, ‘bnf’, ‘boo’, ‘c’, ‘caddcl’, ‘cadlisp’, ‘cfdg’,\\n ‘cfm’, ‘cil’, ‘c_mac’, ‘cobol’, ‘cpp’, ‘cpp-qt’, ‘csharp’, ‘css’,\\n ‘d’, ‘delphi’, ‘diff’, ‘_div’, ‘dos’, ‘dot’, ‘eiffel’, ‘email’,\\n ‘foo’, ‘fortran’, ‘freebasic’, ‘genero’, ‘gettext’, ‘glsl’, ‘gml’,\\n ‘gnuplot’, ‘go’, ‘groovy’, ‘haskell’, ‘hq9plus’, ‘html4strict’,\\n ‘idl’, ‘ini’, ‘inno’, ‘intercal’, ‘io’, ‘java’, ‘java5’,\\n ‘javascript’, ‘kixtart’, ‘klonec’, ‘klonecpp’, ‘latex’, ‘lisp’,\\n ‘lolcode’, ‘lotusformulas’, ‘lotusscript’, ‘lscript’, ‘lua’,\\n ‘m68k’, ‘make’, ‘matlab’, ‘mirc’, ‘modula3’, ‘mpasm’, ‘mxml’,\\n ‘mysql’, ‘nsis’, ‘objc’, ‘ocaml’, ‘ocaml-brief’, ‘oobas’,\\n ‘oracle11’, ‘oracle8’, ‘pascal’, ‘per’, ‘perl’, ‘php’, ‘php-brief’,\\n ‘pic16’, ‘pixelbender’, ‘plsql’, ‘povray’, ‘powershell’,\\n ‘progress’, ‘prolog’, ‘providex’, ‘python’, ‘qbasic’, ‘rails’,\\n ‘reg’, ‘robots’, ‘ruby’, ‘sas’, ‘scala’, ‘scheme’, ‘scilab’,\\n ‘sdlbasic’, ‘smalltalk’, ‘smarty’, ‘sql’, ‘tcl’, ‘teraterm’,\\n ‘text’, ‘thinbasic’, ‘tsql’, ‘typoscript’, ‘vb’, ‘vbnet’,\\n ‘verilog’, ‘vhdl’, ‘vim’, ‘visualfoxpro’, ‘visualprolog’,\\n ‘whitespace’, ‘winbatch’, ‘xml’, ‘xorg_conf’, ‘xpp’, ‘z80’]\\n\\nV text =\\n‘Lorem ipsum <code foo>saepe audire</code> elaboraret ne quo, id equidem\\natomorum inciderint usu. <foo>In sit inermis deleniti percipit</foo>,\\nius ex tale civibus omittam. <barf>Vix ut doctus cetero invenire</barf>, his eu\\naltera electram. Tota adhuc altera te sea, <code bar>soluta appetere ut mel</bar>.\\nQuo quis graecis vivendo te, <baz>posse nullam lobortis ex usu</code>. Eam volumus perpetua\\nconstituto id, mea an omittam fierent vituperatoribus.’\\n\\nL(lang) languages\\n text = text.replace(‘<’lang‘>’, ‘<lang ’lang‘>’)\\n text = text.replace(‘</’lang‘>’, ‘</’\\\"\\\"‘lang>’)\\n text = text.replace(‘<code ’lang‘>’, ‘<lang ’lang‘>’)\\ntext = text.replace(‘</code>’, ‘</’\\\"\\\"‘lang>’)\\n\\nprint(text)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"; usage: > fixtags.ahk input.txt ouput.txt\\nFileRead, text, %1%\\nlangs = ada,awk,autohotkey,etc\\nslang = /lang\\nslang := \\\"<\\\" . slang . \\\"/>\\\"\\nLoop, Parse, langs, `,\\n{\\n tag1 = <%A_LoopField%>\\n tag2 = </%A_LoopField%>\\n text := RegExReplace(text, tag1, \\\"<lang \\\" . A_LoopField . \\\">\\\")\\n text := RegExReplace(text, tag2, slang)\\n text := RegExReplace(text, \\\"<code (.+?)>(.*?)</code>\\\"\\n , \\\"<lang $1>$2\\\" . slang)\\n}\\nFileAppend, % text, %2%\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"import std.stdio, std.regex, std.string, std.array;\\n\\nimmutable langs = \\\"_div abap actionscript actionscript3 ada apache\\napplescript apt_sources asm asp autoit avisynth bash basic4gl bf\\nblitzbasic bnf boo c c_mac caddcl cadlisp cfdg cfm cil cobol cpp\\ncpp-qt csharp css d delphi diff dos dot eiffel email fortran\\nfreebasic genero gettext glsl gml gnuplot groovy haskell hq9plus\\nhtml4strict idl ini inno intercal io java java5 javascript kixtart\\nklonec klonecpp latex lisp lolcode lotusformulas lotusscript\\nlscript lua m68k make matlab mirc modula3 mpasm mxml mysql nsis\\nobjc ocaml ocaml-brief oobas oracle11 oracle8 pascal per perl php\\nphp-brief pic16 pixelbender plsql povray powershell progress\\nprolog providex python qbasic rails reg robots ruby sas scala\\nscheme scilab sdlbasic smalltalk smarty sql tcl teraterm text\\nthinbasic tsql typoscript vb vbnet verilog vhdl vim visualfoxpro\\nvisualprolog whitespace winbatch xml xorg_conf xpp z80\\\".split;\\n\\nstring fixTags(string text) {\\n static immutable slang = \\\"/lang\\\";\\n static immutable code = \\\"code\\\";\\n\\n foreach (immutable lang; langs) {\\n text = text.replace(\\\"<%s>\\\".format(lang),\\n \\\"<lang %s>\\\".format(lang));\\n text = text.replace(\\\"</%s>\\\".format(lang),\\n \\\"<%s>\\\".format(slang));\\n }\\n\\n return text.replace(\\\"<%s (.+?)>(.*?)</%s>\\\"\\n .format(code, code).regex(\\\"g\\\"),\\n \\\"<lang $1>$2<%s>\\\".format(slang));\\n}\\n\\nvoid main() {\\n (\\\"lorem ipsum <c>some c code</c>dolor sit amet, <csharp>some \\\" ~\\n \\\"csharp code</csharp> consectetur adipisicing elit, <code r>\\\" ~\\n \\\" some r code </code>sed do eiusmod tempor incididunt\\\")\\n .fixTags\\n .writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Fix_code_tags;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n Winapi.Windows,\\n System.SysUtils,\\n System.Classes,\\n System.RegularExpressions;\\n\\nconst\\n LANGS: array of string = ['abap', 'actionscript', 'actionscript3', 'ada',\\n 'apache', 'applescript', 'apt_sources', 'asm', 'asp', 'autoit', 'avisynth',\\n 'bash', 'basic4gl', 'bf', 'blitzbasic', 'bnf', 'boo', 'c', 'caddcl',\\n 'cadlisp', 'cfdg', 'cfm', 'cil', 'c_mac', 'cobol', 'cpp', 'cpp-qt', 'csharp',\\n 'css', 'd', 'delphi', 'diff', '_div', 'dos', 'dot', 'eiffel', 'email',\\n 'fortran', 'freebasic', 'genero', 'gettext', 'glsl', 'gml', 'gnuplot', 'go',\\n 'groovy', 'haskell', 'hq9plus', 'html4strict', 'idl', 'ini', 'inno',\\n 'intercal', 'io', 'java', 'java5', 'javascript', 'kixtart', 'klonec',\\n 'klonecpp', 'latex', 'lisp', 'lolcode', 'lotusformulas', 'lotusscript',\\n 'lscript', 'lua', 'm68k', 'make', 'matlab', 'mirc', 'modula3', 'mpasm',\\n 'mxml', 'mysql', 'nsis', 'objc', 'ocaml', 'ocaml-brief', 'oobas', 'oracle11',\\n 'oracle8', 'pascal', 'per', 'perl', 'php', 'php-brief', 'pic16',\\n 'pixelbender', 'plsql', 'povray', 'powershell', 'progress', 'prolog',\\n 'providex', 'python', 'qbasic', 'rails', 'reg', 'robots', 'ruby', 'sas',\\n 'scala', 'scheme', 'scilab', 'sdlbasic', 'smalltalk', 'smarty', 'sql', 'tcl',\\n 'teraterm', 'text', 'thinbasic', 'tsql', 'typoscript', 'vb', 'vbnet',\\n 'verilog', 'vhdl', 'vim', 'visualfoxpro', 'visualprolog', 'whitespace',\\n 'winbatch', 'xml', 'xorg_conf', 'xpp', 'z80'];\\n\\nprocedure repl(const Match: TMatch; var code: ansistring);\\n\\n procedure replace(_new: ansistring);\\n begin\\n code := StringReplace(code, Match.Value, '<' + _new + '>', [rfReplaceAll]);\\n end;\\n\\nbegin\\n if Match.Value = '/code' then\\n begin\\n replace('/lang');\\n exit;\\n end;\\n\\n if Match.Value = '</code>' then\\n begin\\n replace('/lang');\\n exit;\\n end;\\n\\n var mid := Lowercase(Trim(copy(Match.Value, 2, length(Match.Value) - 2)));\\n\\n for var lg in LANGS do\\n begin\\n if mid = lg then\\n begin\\n replace(format('lang %s', [lg]));\\n exit;\\n end;\\n\\n if mid[1] = '/' then\\n begin\\n replace('/lang');\\n exit;\\n end;\\n\\n if (pos('code', mid) = 1) and (copy(mid, 6, length(mid) - 2) = lg) then\\n begin\\n replace(format('lang %s', [lg]));\\n exit;\\n end;\\n end;\\nend;\\n\\nfunction Lang(input: ansistring): ansistring;\\nvar\\n reg: Tregex;\\n match: TMatch;\\nbegin\\n reg := TRegex.Create('<[^>]+>');\\n Result := input;\\n for match in reg.Matches(input) do\\n Repl(match, Result);\\nend;\\n\\nfunction ReadAll: Ansistring;\\nvar\\n Buffer: array[0..1000] of byte;\\n StdIn: TStream;\\n Count: Integer;\\n buf: Ansistring;\\nbegin\\n StdIn := THandleStream.Create(GetStdHandle(STD_INPUT_HANDLE));\\n Result := '';\\n while True do\\n begin\\n Count := StdIn.Read(Buffer, 1000);\\n if Count = 0 then\\n Break;\\n SetLength(buf, Count);\\n CopyMemory(@buf[1], @Buffer[0], Count);\\n Result := Result + buf;\\n end;\\n StdIn.Free;\\nend;\\n\\nprocedure Fix();\\nvar\\n input, output: ansistring;\\nbegin\\n input := ReadAll;\\n output := Lang(input);\\n writeln(output);\\nend;\\n\\nbegin\\n Fix;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"#! /usr/bin/env escript\\n-module( fix_code_tags ).\\n-mode( compile ).\\n\\nmain( _ ) ->\\n\\tFile_lines = loop( io:get_line(\\\"\\\"), [] ),\\n\\tCode_fixed_lines = fix_code_tag( binary:list_to_bin(File_lines) ),\\n%\\ttrue = code:add_pathz( \\\"ebin\\\" ),\\n%\\tok = find_unimplemented_tasks:init(),\\n%\\tDict = dict:from_list( [dict_tuple(X) || X <- rank_languages_by_popularity:rosettacode_languages()],\\n\\tDict = dict:from_list( [dict_tuple(X) || X <- [\\\"foo\\\", \\\"bar\\\", \\\"baz\\\"]] ),\\n\\t{_Dict, All_fixed_lines} = lists:foldl( fun fix_language_tag/2, {Dict, Code_fixed_lines}, dict:fetch_keys(Dict) ),\\n\\tio:fwrite( \\\"~s\\\", [binary:bin_to_list(All_fixed_lines)] ).\\n\\n\\n\\ndict_tuple( Language ) -> {binary:list_to_bin(string:to_lower(Language)), binary:list_to_bin(Language)}.\\n\\nfix_code_tag( Binary ) ->\\n\\tAvoid_wiki = binary:list_to_bin( [<<\\\"<\\\">>, <<\\\"lang \\\">>] ),\\n\\tCode_fixed_lines = binary:replace( Binary, <<\\\"<code \\\">>, Avoid_wiki, [global] ),\\n\\tAvoid_wiki_again = binary:list_to_bin( [<<\\\"</\\\">>, <<\\\"lang \\\">>] ),\\n\\tbinary:replace( Code_fixed_lines, <<\\\"</code>\\\">>, Avoid_wiki_again, [global] ).\\n\\nfix_language_tag( Language_key, {Dict, Binary} ) ->\\n\\tLanguage = fix_language_tag_rosettacode_language( Language_key, dict:find(Language_key, Dict) ),\\n\\tLanguage_start_old = binary:list_to_bin( [<<\\\"<\\\">>, Language, <<\\\">\\\">>] ),\\n\\tLanguage_start_new = binary:list_to_bin( [<<\\\"<\\\">>, <<\\\"lang \\\">>, Language, <<\\\">\\\">>] ),\\n\\tFixed_lines = binary:replace( Binary, Language_start_old, Language_start_new, [global] ),\\n\\tLanguage_stop_old = binary:list_to_bin( [<<\\\"</\\\">>, Language, <<\\\">\\\">>] ),\\n\\tLanguage_stop_new = binary:list_to_bin( [<<\\\"</\\\">>, <<\\\"lang>\\\">>] ),\\n\\t{Dict, binary:replace( Fixed_lines, Language_stop_old, Language_stop_new, [global] )}.\\n\\nfix_language_tag_rosettacode_language( _Language_key, {ok, Language} ) -> Language;\\nfix_language_tag_rosettacode_language( Language_key, error ) -> Language_key.\\n\\nloop( eof, Acc ) -> lists:reverse( Acc );\\nloop( Line, Acc ) -> loop( io:get_line(\\\"\\\"), [Line | Acc] ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"open System\\nopen System.Text.RegularExpressions\\n\\n[<EntryPoint>]\\nlet main argv =\\n let langs = [| \\\"foo\\\"; \\\"foo 2\\\"; \\\"bar\\\"; \\\"baz\\\" |]; // An array of (pseudo) languages we handle\\n let regexStringAlternationOfLanguageNames = String.Join(\\\"|\\\", (Array.map Regex.Escape langs))\\n let regexForOldLangSyntax =\\n new Regex(String.Format(\\\"\\\"\\\"\\n < # Opening of a tag.\\n ( # Group alternation of 2 cases\\n ( # Group for alternation of 2 cases with a language name\\n (?<CloseMarker>/) # Might be a closing tag,\\n | # Or\\n code\\\\s # an old <code ...> tag\\n )? # End of alternation; optional\\n \\\\b(?<Lang>{0})\\\\b # Followed by the captured Language alternation\\n | # Or\\n (?<CloseMarker>/code)# An old </code> end tag\\n ) # End of group\\n > # The final tag closing\\n \\\"\\\"\\\", regexStringAlternationOfLanguageNames),\\n RegexOptions.IgnorePatternWhitespace ||| RegexOptions.ExplicitCapture)\\n\\n let replaceEvaluator (m : Match) =\\n if m.Groups.Item(\\\"CloseMarker\\\").Length > 0 then \\\"</\\\" + \\\"lang>\\\"\\n else \\\"<lang \\\" + m.Groups.Item(\\\"Lang\\\").Value + \\\">\\\"\\n\\n printfn \\\"%s\\\" (regexForOldLangSyntax.Replace(Console.In.ReadToEnd(), replaceEvaluator))\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\nimport \\\"io/ioutil\\\"\\nimport \\\"log\\\"\\nimport \\\"os\\\"\\nimport \\\"regexp\\\"\\nimport \\\"strings\\\"\\n\\nfunc main() {\\n\\terr := fix()\\n\\tif err != nil {\\n\\t\\tlog.Fatalln(err)\\n\\t}\\n}\\n\\nfunc fix() (err error) {\\n\\tbuf, err := ioutil.ReadAll(os.Stdin)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tout, err := Lang(string(buf))\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tfmt.Println(out)\\n\\treturn nil\\n}\\n\\nfunc Lang(in string) (out string, err error) {\\n\\treg := regexp.MustCompile(\\\"<[^>]+>\\\")\\n\\tout = reg.ReplaceAllStringFunc(in, repl)\\n\\treturn out, nil\\n}\\n\\nfunc repl(in string) (out string) {\\n\\tif in == \\\"</code>\\\" {\\n\\t\\t// Change </code> to </ lang>\\n\\t\\treturn \\\"</\\\"+\\\"lang>\\\"\\n\\t}\\n\\n\\t// mid is the content in between '<' and '>'.\\n\\tmid := in[1 : len(in)-1]\\n\\n\\t// thanks, random lua guy\\n\\tvar langs = []string{\\n\\t\\t\\\"abap\\\", \\\"actionscript\\\", \\\"actionscript3\\\", \\\"ada\\\", \\\"apache\\\", \\\"applescript\\\",\\n\\t\\t\\\"apt_sources\\\", \\\"asm\\\", \\\"asp\\\", \\\"autoit\\\", \\\"avisynth\\\", \\\"bash\\\", \\\"basic4gl\\\",\\n\\t\\t\\\"bf\\\", \\\"blitzbasic\\\", \\\"bnf\\\", \\\"boo\\\", \\\"c\\\", \\\"caddcl\\\", \\\"cadlisp\\\", \\\"cfdg\\\", \\\"cfm\\\",\\n\\t\\t\\\"cil\\\", \\\"c_mac\\\", \\\"cobol\\\", \\\"cpp\\\", \\\"cpp-qt\\\", \\\"csharp\\\", \\\"css\\\", \\\"d\\\", \\\"delphi\\\",\\n\\t\\t\\\"diff\\\", \\\"_div\\\", \\\"dos\\\", \\\"dot\\\", \\\"eiffel\\\", \\\"email\\\", \\\"fortran\\\", \\\"freebasic\\\",\\n\\t\\t\\\"genero\\\", \\\"gettext\\\", \\\"glsl\\\", \\\"gml\\\", \\\"gnuplot\\\", \\\"go\\\", \\\"groovy\\\", \\\"haskell\\\",\\n\\t\\t\\\"hq9plus\\\", \\\"html4strict\\\", \\\"idl\\\", \\\"ini\\\", \\\"inno\\\", \\\"intercal\\\", \\\"io\\\", \\\"java\\\",\\n\\t\\t\\\"java5\\\", \\\"javascript\\\", \\\"kixtart\\\", \\\"klonec\\\", \\\"klonecpp\\\", \\\"latex\\\", \\\"lisp\\\",\\n\\t\\t\\\"lolcode\\\", \\\"lotusformulas\\\", \\\"lotusscript\\\", \\\"lscript\\\", \\\"lua\\\", \\\"m68k\\\",\\n\\t\\t\\\"make\\\", \\\"matlab\\\", \\\"mirc\\\", \\\"modula3\\\", \\\"mpasm\\\", \\\"mxml\\\", \\\"mysql\\\", \\\"nsis\\\",\\n\\t\\t\\\"objc\\\", \\\"ocaml\\\", \\\"ocaml-brief\\\", \\\"oobas\\\", \\\"oracle11\\\", \\\"oracle8\\\", \\\"pascal\\\",\\n\\t\\t\\\"per\\\", \\\"perl\\\", \\\"php\\\", \\\"php-brief\\\", \\\"pic16\\\", \\\"pixelbender\\\", \\\"plsql\\\",\\n\\t\\t\\\"povray\\\", \\\"powershell\\\", \\\"progress\\\", \\\"prolog\\\", \\\"providex\\\", \\\"python\\\",\\n\\t\\t\\\"qbasic\\\", \\\"rails\\\", \\\"reg\\\", \\\"robots\\\", \\\"ruby\\\", \\\"sas\\\", \\\"scala\\\", \\\"scheme\\\",\\n\\t\\t\\\"scilab\\\", \\\"sdlbasic\\\", \\\"smalltalk\\\", \\\"smarty\\\", \\\"sql\\\", \\\"tcl\\\", \\\"teraterm\\\",\\n\\t\\t\\\"text\\\", \\\"thinbasic\\\", \\\"tsql\\\", \\\"typoscript\\\", \\\"vb\\\", \\\"vbnet\\\", \\\"verilog\\\",\\n\\t\\t\\\"vhdl\\\", \\\"vim\\\", \\\"visualfoxpro\\\", \\\"visualprolog\\\", \\\"whitespace\\\", \\\"winbatch\\\",\\n\\t\\t\\\"xml\\\", \\\"xorg_conf\\\", \\\"xpp\\\", \\\"z80\\\",\\n\\t}\\n\\tfor _, lang := range langs {\\n\\t\\tif mid == lang {\\n\\t\\t\\t// Change <%s> to <lang %s>\\n\\t\\t\\treturn fmt.Sprintf(\\\"<lang %s>\\\", lang)\\n\\t\\t}\\n\\n\\t\\tif strings.HasPrefix(mid, \\\"/\\\") {\\n\\t\\t\\tif mid[len(\\\"/\\\"):] == lang {\\n\\t\\t\\t\\t// Change </%s> to </ lang>\\n\\t\\t\\t\\treturn \\\"</\\\"+\\\"lang>\\\"\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif strings.HasPrefix(mid, \\\"code \\\") {\\n\\t\\t\\tif mid[len(\\\"code \\\"):] == lang {\\n\\t\\t\\t\\t// Change <code %s> to <lang %s>\\n\\t\\t\\t\\treturn fmt.Sprintf(\\\"<lang %s>\\\", lang)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn in\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"require 'printf strings files'\\n\\nlangs=. <;._1 LF -.~ noun define NB. replace with real lang strings\\n foo bar\\n baz\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"fixCodeTags=: rplc&(, <;._2;._2 &> patterns vbsprintf _5]\\\\ 5#langs)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 'converted.txt' fwrite~ fixCodeTags fread 'wikisource.txt'\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.io.BufferedReader;\\nimport java.io.File;\\nimport java.io.FileReader;\\nimport java.io.FileWriter;\\n\\npublic class FixCodeTags\\n{\\n\\tpublic static void main(String[] args)\\n\\t{\\n\\t\\tString sourcefile=args[0];\\n\\t\\tString convertedfile=args[1];\\n\\t\\tconvert(sourcefile,convertedfile);\\n\\t}\\n\\t\\tstatic String[] languages = {\\\"abap\\\", \\\"actionscript\\\", \\\"actionscript3\\\",\\n\\t\\t\\t\\\"ada\\\", \\\"apache\\\", \\\"applescript\\\", \\\"apt_sources\\\", \\\"asm\\\", \\\"asp\\\",\\n\\t\\t\\t\\\"autoit\\\", \\\"avisynth\\\", \\\"bar\\\", \\\"bash\\\", \\\"basic4gl\\\", \\\"bf\\\",\\n\\t\\t\\t\\\"blitzbasic\\\", \\\"bnf\\\", \\\"boo\\\", \\\"c\\\", \\\"caddcl\\\", \\\"cadlisp\\\", \\\"cfdg\\\",\\n\\t\\t\\t\\\"cfm\\\", \\\"cil\\\", \\\"c_mac\\\", \\\"cobol\\\", \\\"cpp\\\", \\\"cpp-qt\\\", \\\"csharp\\\", \\\"css\\\",\\n\\t\\t\\t\\\"d\\\", \\\"delphi\\\", \\\"diff\\\", \\\"_div\\\", \\\"dos\\\", \\\"dot\\\", \\\"eiffel\\\", \\\"email\\\",\\n\\t\\t\\t\\\"foo\\\", \\\"fortran\\\", \\\"freebasic\\\", \\\"genero\\\", \\\"gettext\\\", \\\"glsl\\\", \\\"gml\\\",\\n\\t\\t\\t\\\"gnuplot\\\", \\\"go\\\", \\\"groovy\\\", \\\"haskell\\\", \\\"hq9plus\\\", \\\"html4strict\\\",\\n\\t\\t\\t\\\"idl\\\", \\\"ini\\\", \\\"inno\\\", \\\"intercal\\\", \\\"io\\\", \\\"java\\\", \\\"java5\\\",\\n\\t\\t\\t\\\"javascript\\\", \\\"kixtart\\\", \\\"klonec\\\", \\\"klonecpp\\\", \\\"latex\\\", \\\"lisp\\\",\\n\\t\\t\\t\\\"lolcode\\\", \\\"lotusformulas\\\", \\\"lotusscript\\\", \\\"lscript\\\", \\\"lua\\\",\\n\\t\\t\\t\\\"m68k\\\", \\\"make\\\", \\\"matlab\\\", \\\"mirc\\\", \\\"modula3\\\", \\\"mpasm\\\", \\\"mxml\\\",\\n\\t\\t\\t\\\"mysql\\\", \\\"nsis\\\", \\\"objc\\\", \\\"ocaml\\\", \\\"ocaml-brief\\\", \\\"oobas\\\",\\n\\t\\t\\t\\\"oracle11\\\", \\\"oracle8\\\", \\\"pascal\\\", \\\"per\\\", \\\"perl\\\", \\\"php\\\", \\\"php-brief\\\",\\n\\t\\t\\t\\\"pic16\\\", \\\"pixelbender\\\", \\\"plsql\\\", \\\"povray\\\", \\\"powershell\\\",\\n\\t\\t\\t\\\"progress\\\", \\\"prolog\\\", \\\"providex\\\", \\\"python\\\", \\\"qbasic\\\", \\\"rails\\\",\\n\\t\\t\\t\\\"reg\\\", \\\"robots\\\", \\\"ruby\\\", \\\"sas\\\", \\\"scala\\\", \\\"scheme\\\", \\\"scilab\\\",\\n\\t\\t\\t\\\"sdlbasic\\\", \\\"smalltalk\\\", \\\"smarty\\\", \\\"sql\\\", \\\"tcl\\\", \\\"teraterm\\\",\\n\\t\\t\\t\\\"text\\\", \\\"thinbasic\\\", \\\"tsql\\\", \\\"typoscript\\\", \\\"vb\\\", \\\"vbnet\\\",\\n\\t\\t\\t\\\"verilog\\\", \\\"vhdl\\\", \\\"vim\\\", \\\"visualfoxpro\\\", \\\"visualprolog\\\",\\n\\t\\t\\t\\\"whitespace\\\", \\\"winbatch\\\", \\\"xml\\\", \\\"xorg_conf\\\", \\\"xpp\\\", \\\"z80\\\"};\\n\\tstatic void convert(String sourcefile,String convertedfile)\\n\\t{\\n\\t\\ttry\\n\\t\\t{\\n\\t\\t\\tBufferedReader br=new BufferedReader(new FileReader(sourcefile));\\n\\t\\t\\t//String buffer to store contents of the file\\n\\t\\t\\tStringBuffer sb=new StringBuffer(\\\"\\\");\\n\\t\\t\\tString line;\\n\\t\\t\\twhile((line=br.readLine())!=null)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor(int i=0;i<languages.length;i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tString lang=languages[i];\\n\\t\\t\\t\\t\\tline=line.replaceAll(\\\"<\\\"+lang+\\\">\\\", \\\"<lang \\\"+lang+\\\">\\\");\\n\\t\\t\\t\\t\\tline=line.replaceAll(\\\"</\\\"+lang+\\\">\\\", \\\"</\\\"+\\\"lang>\\\");\\n\\t\\t\\t\\t\\tline=line.replaceAll(\\\"<code \\\"+lang+\\\">\\\", \\\"<lang \\\"+lang+\\\">\\\");\\n\\t\\t\\t\\t\\tline=line.replaceAll(\\\"</code>\\\", \\\"</\\\"+\\\"lang>\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tsb.append(line);\\n\\t\\t\\t}\\n\\t\\t\\tbr.close();\\n\\t\\t\\t\\n\\t\\t\\tFileWriter fw=new FileWriter(new File(convertedfile));\\n\\t\\t\\t//Write entire string buffer into the file\\n\\t\\t\\tfw.write(sb.toString());\\n\\t\\t\\tfw.close();\\n\\t\\t}\\n\\t\\tcatch (Exception e)\\n\\t\\t{\\n\\t\\t\\tSystem.out.println(\\\"Something went horribly wrong: \\\"+e.getMessage());\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var langs = ['foo', 'bar', 'baz']; // real list of langs goes here\\nvar end_tag = '</'+'lang>';\\n\\nvar line;\\nwhile (line = readline()) {\\n line = line.replace(new RegExp('</code>', 'gi'), end_tag);\\n for (var i = 0; i < langs.length; i++)\\n line = line.replace(new RegExp('<(?:code )?(' + langs[i] + ')>', 'gi'), '<lang $1>')\\n .replace(new RegExp('</' + langs[i] + '>', 'gi'), end_tag);\\n print(line);\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"function fixtags(text::AbstractString)\\n langs = [\\\"ada\\\", \\\"cpp-qt\\\", \\\"pascal\\\", \\\"lscript\\\", \\\"z80\\\", \\\"visualprolog\\\",\\n \\\"html4strict\\\", \\\"cil\\\", \\\"objc\\\", \\\"asm\\\", \\\"progress\\\", \\\"teraterm\\\", \\\"hq9plus\\\",\\n \\\"genero\\\", \\\"tsql\\\", \\\"email\\\", \\\"pic16\\\", \\\"tcl\\\", \\\"apt_sources\\\", \\\"io\\\", \\\"apache\\\",\\n \\\"vhdl\\\", \\\"avisynth\\\", \\\"winbatch\\\", \\\"vbnet\\\", \\\"ini\\\", \\\"scilab\\\", \\\"ocaml-brief\\\",\\n \\\"sas\\\", \\\"actionscript3\\\", \\\"qbasic\\\", \\\"perl\\\", \\\"bnf\\\", \\\"cobol\\\", \\\"powershell\\\",\\n \\\"php\\\", \\\"kixtart\\\", \\\"visualfoxpro\\\", \\\"mirc\\\", \\\"make\\\", \\\"javascript\\\", \\\"cpp\\\",\\n \\\"sdlbasic\\\", \\\"cadlisp\\\", \\\"php-brief\\\", \\\"rails\\\", \\\"verilog\\\", \\\"xml\\\", \\\"csharp\\\",\\n \\\"actionscript\\\", \\\"nsis\\\", \\\"bash\\\", \\\"typoscript\\\", \\\"freebasic\\\", \\\"dot\\\",\\n \\\"applescript\\\", \\\"haskell\\\", \\\"dos\\\", \\\"oracle8\\\", \\\"cfdg\\\", \\\"glsl\\\", \\\"lotusscript\\\",\\n \\\"mpasm\\\", \\\"latex\\\", \\\"sql\\\", \\\"klonec\\\", \\\"ruby\\\", \\\"ocaml\\\", \\\"smarty\\\", \\\"python\\\",\\n \\\"oracle11\\\", \\\"caddcl\\\", \\\"robots\\\", \\\"groovy\\\", \\\"smalltalk\\\", \\\"diff\\\", \\\"fortran\\\",\\n \\\"cfm\\\", \\\"lua\\\", \\\"modula3\\\", \\\"vb\\\", \\\"autoit\\\", \\\"java\\\", \\\"text\\\", \\\"scala\\\",\\n \\\"lotusformulas\\\", \\\"pixelbender\\\", \\\"reg\\\", \\\"_div\\\", \\\"whitespace\\\", \\\"providex\\\",\\n \\\"asp\\\", \\\"css\\\", \\\"lolcode\\\", \\\"lisp\\\", \\\"inno\\\", \\\"mysql\\\", \\\"plsql\\\", \\\"matlab\\\",\\n \\\"oobas\\\", \\\"vim\\\", \\\"delphi\\\", \\\"xorg_conf\\\", \\\"gml\\\", \\\"prolog\\\", \\\"bf\\\", \\\"per\\\",\\n \\\"scheme\\\", \\\"mxml\\\", \\\"d\\\", \\\"basic4gl\\\", \\\"m68k\\\", \\\"gnuplot\\\", \\\"idl\\\", \\\"abap\\\",\\n \\\"intercal\\\", \\\"c_mac\\\", \\\"thinbasic\\\", \\\"java5\\\", \\\"xpp\\\", \\\"boo\\\", \\\"klonecpp\\\",\\n \\\"blitzbasic\\\", \\\"eiffel\\\", \\\"povray\\\", \\\"c\\\", \\\"gettext\\\"]\\n\\n slang = \\\"/lang\\\"\\n code = \\\"code\\\"\\n\\n for l in langs\\n text = replace(text, \\\"<$l>\\\",\\\"<lang $l>\\\")\\n text = replace(text, \\\"</$l>\\\", \\\"<$slang>\\\")\\n end\\n\\n text = replace(text, Regex(\\\"(?s)<$code (.+?)>(.*?)</$code>\\\"), \\\"<lang \\\\\\\\1>\\\\\\\\2<$slang>\\\")\\nend\\n\\nconst txt = readstring(ARGS[1])\\nprintln(fixtags(txt))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"--thanks, random python guy\\nlangs = {'ada', 'cpp-qt', 'pascal', 'lscript', 'z80', 'visualprolog',\\n'html4strict', 'cil', 'objc', 'asm', 'progress', 'teraterm', 'hq9plus',\\n'genero', 'tsql', 'email', 'pic16', 'tcl', 'apt_sources', 'io', 'apache',\\n'vhdl', 'avisynth', 'winbatch', 'vbnet', 'ini', 'scilab', 'ocaml-brief',\\n'sas', 'actionscript3', 'qbasic', 'perl', 'bnf', 'cobol', 'powershell',\\n'php', 'kixtart', 'visualfoxpro', 'mirc', 'make', 'javascript', 'cpp',\\n'sdlbasic', 'cadlisp', 'php-brief', 'rails', 'verilog', 'xml', 'csharp',\\n'actionscript', 'nsis', 'bash', 'typoscript', 'freebasic', 'dot',\\n'applescript', 'haskell', 'dos', 'oracle8', 'cfdg', 'glsl', 'lotusscript',\\n'mpasm', 'latex', 'sql', 'klonec', 'ruby', 'ocaml', 'smarty', 'python',\\n'oracle11', 'caddcl', 'robots', 'groovy', 'smalltalk', 'diff', 'fortran',\\n'cfm', 'lua', 'modula3', 'vb', 'autoit', 'java', 'text', 'scala',\\n'lotusformulas', 'pixelbender', 'reg', '_div', 'whitespace', 'providex',\\n'asp', 'css', 'lolcode', 'lisp', 'inno', 'mysql', 'plsql', 'matlab',\\n'oobas', 'vim', 'delphi', 'xorg_conf', 'gml', 'prolog', 'bf', 'per',\\n'scheme', 'mxml', 'd', 'basic4gl', 'm68k', 'gnuplot', 'idl', 'abap',\\n'intercal', 'c_mac', 'thinbasic', 'java5', 'xpp', 'boo', 'klonecpp',\\n'blitzbasic', 'eiffel', 'povray', 'c', 'gettext'}\\n\\nfor line in io.lines() do\\n for i, v in ipairs(langs) do\\n\\tline = line:gsub(\\\"<\\\" .. v .. \\\">\\\", \\\"<lang \\\" .. v .. \\\">\\\")\\n line = line:gsub(\\\"<code \\\" .. v .. \\\">\\\", \\\"<lang \\\" .. v .. \\\">\\\")\\n line = line:gsub(\\\"</\\\" .. v .. \\\">\\\", \\\"</\\\" .. \\\"lang>\\\") --the weird concatenation is to prevent the markup from breaking\\n line = line:gsub(\\\"</\\\" .. \\\"code>\\\", \\\"</\\\" .. \\\"lang>\\\")\\n end\\n print(line)\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"#Used <#/lang> to desensitize wiki\\ntxt := FileTools[Text][ReadFile](\\\"C:/Users/username/Desktop/text.txt\\\"):\\n#langs should be a real list of programming languages\\nlangs := ['foo', 'bar', 'baz', 'barf'];\\nfor lan in langs do\\n\\ttxt := StringTools:-SubstituteAll(txt, cat(\\\"<\\\", lan, \\\">\\\"), cat (\\\"<lang \\\", lan, \\\">\\\")):\\n\\ttxt := StringTools:-SubstituteAll(txt, cat(\\\"</\\\", lan, \\\">\\\"), \\\"<#/lang>\\\"):\\n\\ttxt := StringTools:-SubstituteAll(txt, cat(\\\"<code \\\", lan, \\\">\\\"), cat (\\\"<lang \\\", lan, \\\">\\\")):\\n\\ttxt := StringTools:-SubstituteAll(txt, \\\"</code>\\\", \\\"<#/lang>\\\"):\\nend do;\\nprint(txt);\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"StringReplace[Import[\\\"wikisource.txt\\\"],\\n{\\\"</\\\"~~Shortest[__]~~\\\">\\\"->\\\"</lang>\\\",\\n(\\\"<code \\\"|\\\"<\\\")~~Shortest[x__]~~\\\">\\\"->\\\"<lang \\\"~~ x~~\\\">\\\"}\\n]>>\\\"converted.txt\\\"\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import re, strutils\\n\\nconst\\n Langs = [\\\"ada\\\", \\\"cpp-qt\\\", \\\"pascal\\\", \\\"lscript\\\", \\\"z80\\\", \\\"visualprolog\\\",\\n \\\"html4strict\\\", \\\"cil\\\", \\\"objc\\\", \\\"asm\\\", \\\"progress\\\", \\\"teraterm\\\", \\\"hq9plus\\\",\\n \\\"genero\\\", \\\"tsql\\\", \\\"email\\\", \\\"pic16\\\", \\\"tcl\\\", \\\"apt_sources\\\", \\\"io\\\", \\\"apache\\\",\\n \\\"vhdl\\\", \\\"avisynth\\\", \\\"winbatch\\\", \\\"vbnet\\\", \\\"ini\\\", \\\"scilab\\\", \\\"ocaml-brief\\\",\\n \\\"sas\\\", \\\"actionscript3\\\", \\\"qbasic\\\", \\\"perl\\\", \\\"bnf\\\", \\\"cobol\\\", \\\"powershell\\\",\\n \\\"php\\\", \\\"kixtart\\\", \\\"visualfoxpro\\\", \\\"mirc\\\", \\\"make\\\", \\\"javascript\\\", \\\"cpp\\\",\\n \\\"sdlbasic\\\", \\\"cadlisp\\\", \\\"php-brief\\\", \\\"rails\\\", \\\"verilog\\\", \\\"xml\\\", \\\"csharp\\\",\\n \\\"actionscript\\\", \\\"nsis\\\", \\\"bash\\\", \\\"typoscript\\\", \\\"freebasic\\\", \\\"dot\\\",\\n \\\"applescript\\\", \\\"haskell\\\", \\\"dos\\\", \\\"oracle8\\\", \\\"cfdg\\\", \\\"glsl\\\", \\\"lotusscript\\\",\\n \\\"mpasm\\\", \\\"latex\\\", \\\"sql\\\", \\\"klonec\\\", \\\"ruby\\\", \\\"ocaml\\\", \\\"smarty\\\", \\\"python\\\",\\n \\\"oracle11\\\", \\\"caddcl\\\", \\\"robots\\\", \\\"groovy\\\", \\\"smalltalk\\\", \\\"diff\\\", \\\"fortran\\\",\\n \\\"cfm\\\", \\\"lua\\\", \\\"modula3\\\", \\\"vb\\\", \\\"autoit\\\", \\\"java\\\", \\\"text\\\", \\\"scala\\\",\\n \\\"lotusformulas\\\", \\\"pixelbender\\\", \\\"reg\\\", \\\"_div\\\", \\\"whitespace\\\", \\\"providex\\\",\\n \\\"asp\\\", \\\"css\\\", \\\"lolcode\\\", \\\"lisp\\\", \\\"inno\\\", \\\"mysql\\\", \\\"plsql\\\", \\\"matlab\\\",\\n \\\"oobas\\\", \\\"vim\\\", \\\"delphi\\\", \\\"xorg_conf\\\", \\\"gml\\\", \\\"prolog\\\", \\\"bf\\\", \\\"per\\\",\\n \\\"scheme\\\", \\\"mxml\\\", \\\"d\\\", \\\"basic4gl\\\", \\\"m68k\\\", \\\"gnuplot\\\", \\\"idl\\\", \\\"abap\\\",\\n \\\"intercal\\\", \\\"c_mac\\\", \\\"thinbasic\\\", \\\"java5\\\", \\\"xpp\\\", \\\"boo\\\", \\\"klonecpp\\\",\\n \\\"blitzbasic\\\", \\\"eiffel\\\", \\\"povray\\\", \\\"c\\\", \\\"gettext\\\"]\\n\\nvar text = stdin.readAll()\\n\\nfor lang in Langs:\\n text = text.replace(\\\"<$#>\\\" % lang, \\\"<lang $#>\\\" % lang)\\n text = text.replace(\\\"</$#>\\\" % lang, \\\"</lang>\\\")\\n\\ntext = text.replacef(re\\\"(?s)<code (.+?)>(.*?)</code>\\\", r\\\"<lang $1>$2</lang>\\\")\\n\\nstdout.write text\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#load \\\"str.cma\\\"\\n\\nlet langs =\\n Str.split (Str.regexp \\\" \\\")\\n \\\"actionscript ada algol68 amigae applescript autohotkey awk bash basic \\\\\\n befunge bf c cfm cobol cpp csharp d delphi e eiffel factor false forth \\\\\\n fortran fsharp haskell haxe j java javascript lisaac lisp logo lua m4 \\\\\\n mathematica maxscript modula3 moo objc ocaml octave oz pascal perl \\\\\\n raku php pike pop11 powershell prolog python qbasic r rebol ruby \\\\\\n scala scheme slate smalltalk tcl ti89b vbnet vedit\\\"\\n\\nlet read_in ic =\\n let buf = Buffer.create 16384\\n and tmp = String.create 4096 in\\n let rec aux() =\\n let bytes = input ic tmp 0 4096 in\\n if bytes > 0 then begin\\n Buffer.add_substring buf tmp 0 bytes;\\n aux()\\n end\\n in\\n (try aux() with End_of_file -> ());\\n (Buffer.contents buf)\\n\\nlet repl pat tpl str =\\n let reg = Str.regexp_string_case_fold pat in\\n let str = Str.global_replace reg tpl str in\\n (str)\\n\\n(* change <%s> to <lang %s> *)\\nlet repl1 lang str =\\n let pat = \\\"<\\\" ^ lang ^ \\\">\\\"\\n and tpl = \\\"<lang \\\" ^ lang ^ \\\">\\\" in\\n (repl pat tpl str)\\n\\n(* change </%s> to </la\\\\ng> *)\\nlet repl2 lang str =\\n let pat = \\\"</\\\" ^ lang ^ \\\">\\\"\\n and tpl = \\\"</lang\\\"^\\\">\\\" in\\n (repl pat tpl str)\\n\\n(* change <code %s> to <lang %s> *)\\nlet repl3 lang str =\\n let pat = \\\"<code \\\" ^ lang ^ \\\">\\\"\\n and tpl = \\\"<lang \\\" ^ lang ^ \\\">\\\" in\\n (repl pat tpl str)\\n\\n(* change </code> to </la\\\\ng> *)\\nlet repl4 lang str =\\n let pat = \\\"</code>\\\"\\n and tpl = \\\"</lang\\\"^\\\">\\\" in\\n (repl pat tpl str)\\n\\n\\nlet () =\\n print_string (\\n List.fold_left (fun str lang ->\\n (repl4 lang (repl3 lang (repl2 lang (repl1 lang str))))\\n ) (read_in stdin) langs)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \" (repl4 lang (repl3 lang (repl2 lang (repl1 lang str))))\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \" List.fold_right (fun repl -> repl lang) [repl1; repl2; repl3; repl4] str\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"my @langs = qw(ada cpp-qt pascal lscript z80 visualprolog\\nhtml4strict cil objc asm progress teraterm hq9plus genero tsql\\nemail pic16 tcl apt_sources io apache vhdl avisynth winbatch\\nvbnet ini scilab ocaml-brief sas actionscript3 qbasic perl bnf\\ncobol powershell php kixtart visualfoxpro mirc make javascript\\ncpp sdlbasic cadlisp php-brief rails verilog xml csharp\\nactionscript nsis bash typoscript freebasic dot applescript\\nhaskell dos oracle8 cfdg glsl lotusscript mpasm latex sql klonec\\nruby ocaml smarty python oracle11 caddcl robots groovy smalltalk\\ndiff fortran cfm lua modula3 vb autoit java text scala\\nlotusformulas pixelbender reg _div whitespace providex asp css\\nlolcode lisp inno mysql plsql matlab oobas vim delphi xorg_conf\\ngml prolog bf per scheme mxml d basic4gl m68k gnuplot idl abap\\nintercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel\\npovray c gettext);\\n\\nmy $text = join \\\"\\\", <STDIN>;\\nmy $slang=\\\"/lang\\\";\\nfor (@langs) {\\n $text =~ s|<$_>|<lang $_>|g;\\n $text =~ s|</$_>|<$slang>|g;\\n}\\n\\n$text =~ s|<code (.+?)>(.*?)</code>|<lang $1>$2<$slang>|sg;\\n\\nprint $text;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">ltext</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">`_div abap actionscript actionscript3 ada apache\\n applescript apt_sources asm asp autoit avisynth bash basic4gl bf\\n blitzbasic bnf boo c c_mac caddcl cadlisp cfdg cfm cil cobol cpp\\n cpp-qt csharp css d delphi diff dos dot eiffel email fortran\\n freebasic genero gettext glsl gml gnuplot groovy haskell hq9plus\\n html4strict idl ini inno intercal io java java5 javascript kixtart\\n klonec klonecpp latex lisp lolcode lotusformulas lotusscript\\n lscript lua m68k make matlab mirc modula3 mpasm mxml mysql nsis\\n objc ocaml ocaml-brief oobas oracle11 oracle8 pascal per perl php\\n php-brief pic16 pixelbender plsql povray powershell progress\\n prolog providex python qbasic r rails reg robots ruby sas scala\\n scheme scilab sdlbasic smalltalk smarty sql tcl teraterm text\\n thinbasic tsql typoscript vb vbnet verilog vhdl vim visualfoxpro\\n visualprolog whitespace winbatch xml xorg_conf xpp z80`</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">langs</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ltext</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">fix_tags</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">langs</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">lang</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">langs</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">openl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"<%s>\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">lang</span><span style=\\\"color: #0000FF;\\\">}),</span>\\n <span style=\\\"color: #000000;\\\">openc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"<code %s>\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">lang</span><span style=\\\"color: #0000FF;\\\">}),</span>\\n <span style=\\\"color: #000000;\\\">lopen</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"<lang %s>\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">lang</span><span style=\\\"color: #0000FF;\\\">}),</span>\\n <span style=\\\"color: #000000;\\\">closl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"</%s>\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">lang</span><span style=\\\"color: #0000FF;\\\">}),</span>\\n <span style=\\\"color: #000000;\\\">closc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"</%s>\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"code\\\"</span><span style=\\\"color: #0000FF;\\\">}),</span>\\n <span style=\\\"color: #000000;\\\">lclos</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"</%s>\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"lang\\\"</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">text</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute_all</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">openl</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">openc</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">closl</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">closc</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">lopen</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">lopen</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">lclos</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">lclos</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">text</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">test</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n lorem ipsum <c>some c code</c>dolor sit amet, <csharp>some\\n csharp code</csharp> consectetur adipisicing elit, <code r>\\n some r code </code>sed do eiusmod tempor incididunt\\n \\\"\\\"\\\"</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">fix_tags</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">))</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"#!/usr/bin/picolisp /usr/lib/picolisp/lib.l\\n\\n(let Lang '(\\\"ada\\\" \\\"awk\\\" \\\"c\\\" \\\"forth\\\" \\\"prolog\\\" \\\"python\\\" \\\"z80\\\")\\n (in NIL\\n (while (echo \\\"<\\\")\\n (let S (till \\\">\\\" T)\\n (cond\\n ((pre? \\\"code \\\" S) (prin \\\"<lang\\\" (cddddr (chop S))))\\n ((member S Lang) (prin \\\"<lang \\\" S))\\n ((= S \\\"/code\\\") (prin \\\"</lang\\\"))\\n ((and (pre? \\\"/\\\" S) (member (pack (cdr (chop S))) Lang))\\n (prin \\\"</lang\\\") )\\n (T (prin \\\"<\\\" S)) ) ) ) ) )\\n(bye)\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"If Not OpenConsole()\\n End\\nElseIf CountProgramParameters() <> 2\\n PrintN(\\\"Usage: \\\"+GetFilePart(ProgramFilename())+\\\" InFile OutFile\\\")\\n End\\nEndIf\\n\\nDefine Infile$ =ProgramParameter(), Outfile$=ProgramParameter()\\nIf ReadFile(0,Infile$)\\n NewList Out$()\\n Define line$, part$, new$, pos1, pos2\\n While Not Eof(0)\\n line$=ReadString(0): pos2=0\\n Repeat\\n pos1=FindString(line$,\\\"<\\\",pos2)\\n pos2=FindString(line$,\\\">\\\",pos1)\\n If pos1 And pos2\\n part$=Mid(line$,pos1+1,pos2-pos1-1)\\n If Mid(part$,1,1)=\\\"/\\\"\\n new$=\\\"<\\\"+\\\"/lang>\\\" ; Line split to avoid problem forum coding\\n ElseIf Mid(part$,1,5)=\\\"code \\\"\\n new$=\\\"<lang \\\"+Mid(part$,6)+\\\">\\\"\\n Else\\n new$=\\\"<lang \\\"+part$+\\\">\\\"\\n EndIf\\n line$=ReplaceString(line$,\\\"<\\\"+part$+\\\">\\\",new$)\\n Else\\n Break\\n EndIf\\n ForEver\\n AddElement(Out$()): Out$()=line$\\n Wend\\n CloseFile(0)\\n If CreateFile(1, Outfile$)\\n ForEach Out$()\\n WriteStringN(1,Out$())\\n Next\\n CloseFile(1)\\n EndIf\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"\\\"\\\"\\\" Rosetta Code task rosettacode.org/wiki/Rosetta_Code/Fix_code_tags \\\"\\\"\\\"\\n\\nfrom re import sub\\n\\ntesttexts = [\\n\\\"\\\"\\\"<lang AutoHotkey>; usage: > fixtags.ahk input.txt ouput.txt\\nFileRead, text, %1%\\nlangs = ada,awk,autohotkey,etc\\nslang = /lang\\nslang := \\\"<\\\" . slang . \\\"/>\\\"\\nLoop, Parse, langs, `,\\n{\\n tag1 = <%A_LoopField%>\\n tag2 = </%A_LoopField%>\\n text := RegExReplace(text, tag1, \\\"<lang \\\" . A_LoopField . \\\">\\\")\\n text := RegExReplace(text, tag2, slang)\\n text := RegExReplace(text, \\\"<code (.+?)>(.*?)</code>\\\"\\n , \\\"<lang $1>$2\\\" . slang)\\n}\\nFileAppend, % text, %2%\\n</lang>\\\"\\\"\\\",\\n \\\"\\\"\\\"<lang perl>my @langs = qw(ada cpp-qt pascal lscript z80 visualprolog\\nhtml4strict cil objc asm progress teraterm hq9plus genero tsql\\nemail pic16 tcl apt_sources io apache vhdl avisynth winbatch\\nvbnet ini scilab ocaml-brief sas actionscript3 qbasic perl bnf\\ncobol powershell php kixtart visualfoxpro mirc make javascript\\ncpp sdlbasic cadlisp php-brief rails verilog xml csharp\\nactionscript nsis bash typoscript freebasic dot applescript\\nhaskell dos oracle8 cfdg glsl lotusscript mpasm latex sql klonec\\nruby ocaml smarty python oracle11 caddcl robots groovy smalltalk\\ndiff fortran cfm lua modula3 vb autoit java text scala\\nlotusformulas pixelbender reg _div whitespace providex asp css\\nlolcode lisp inno mysql plsql matlab oobas vim delphi xorg_conf\\ngml prolog bf per scheme mxml d basic4gl m68k gnuplot idl abap\\nintercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel\\npovray c gettext);\\n\\nmy $text = join \\\"\\\", <STDIN>;\\nmy $slang=\\\"/lang\\\";\\nfor (@langs) {\\n $text =~ s|<$_>|<lang $_>|g;\\n $text =~ s|</$_>|<$slang>|g;\\n}\\n\\n$text =~ s|<code (.+?)>(.*?)</code>|<lang $1>$2<$slang>|sg;\\n\\nprint $text;</lang>\\\"\\\"\\\",\\n \\\"\\\"\\\"<lang>HAI 1.3\\n\\nI HAS A bottles ITZ 99 I HAS A plural ITZ \\\"Z\\\" I HAS A lyric ITZ \\\"99 BOTTLZ OV BEER\\\"\\n\\nIM IN YR song\\n\\n VISIBLE lyric \\\" ON TEH WALL\\\"\\n VISIBLE lyric\\n VISIBLE \\\"TAEK 1 DOWN, PAZ IT AROUN\\\"\\n bottles R DIFF OF bottles AN 1\\n NOT bottles, O RLY?\\n YA RLY, VISIBLE \\\"NO MOAR BOTTLZ OV BEER ON TEH WALL\\\", GTFO\\n OIC\\n BOTH SAEM bottles AN 1, O RLY?\\n YA RLY, plural R \\\"\\\"\\n OIC\\n lyric R SMOOSH bottles \\\" BOTTL\\\" plural \\\" OV BEER\\\" MKAY\\n VISIBLE lyric \\\" ON TEH WALL:)\\\"\\nIM OUTTA YR song\\n\\nKTHXBYE</lang>\\n\\\"\\\"\\\"]\\n\\nfor txt in testtexts:\\n text2 = sub(r'<lang\\\\s+\\\\\\\"?([\\\\w\\\\d\\\\s]+)\\\\\\\"?\\\\s?>', r'<syntaxhighlight lang=\\\\1>', txt)\\n text2 = sub(r'<lang\\\\s*>', '<syntaxhighlight lang=text>', text2)\\n text2 = sub(r'</lang\\\\s*>', '</syntax'+'highlight>', text2)\\n print(txt, '\\\\n=>\\\\n', text2)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"; usage: > fixtags.ahk input.txt ouput.txt\\nFileRead, text, %1%\\nlangs = ada,awk,autohotkey,etc\\nslang = /lang\\nslang := \\\"<\\\" . slang . \\\"/>\\\"\\nLoop, Parse, langs, `,\\n{\\n tag1 = <%A_LoopField%>\\n tag2 = </%A_LoopField%>\\n text := RegExReplace(text, tag1, \\\"<lang \\\" . A_LoopField . \\\">\\\")\\n text := RegExReplace(text, tag2, slang)\\n text := RegExReplace(text, \\\"<code (.+?)>(.*?)</code>\\\"\\n , \\\"<lang $1>$2\\\" . slang)\\n}\\nFileAppend, % text, %2%\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"my @langs = qw(ada cpp-qt pascal lscript z80 visualprolog\\nhtml4strict cil objc asm progress teraterm hq9plus genero tsql\\nemail pic16 tcl apt_sources io apache vhdl avisynth winbatch\\nvbnet ini scilab ocaml-brief sas actionscript3 qbasic perl bnf\\ncobol powershell php kixtart visualfoxpro mirc make javascript\\ncpp sdlbasic cadlisp php-brief rails verilog xml csharp\\nactionscript nsis bash typoscript freebasic dot applescript\\nhaskell dos oracle8 cfdg glsl lotusscript mpasm latex sql klonec\\nruby ocaml smarty python oracle11 caddcl robots groovy smalltalk\\ndiff fortran cfm lua modula3 vb autoit java text scala\\nlotusformulas pixelbender reg _div whitespace providex asp css\\nlolcode lisp inno mysql plsql matlab oobas vim delphi xorg_conf\\ngml prolog bf per scheme mxml d basic4gl m68k gnuplot idl abap\\nintercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel\\npovray c gettext);\\n\\nmy $text = join \\\"\\\", <STDIN>;\\nmy $slang=\\\"/lang\\\";\\nfor (@langs) {\\n $text =~ s|<$_>|<lang $_>|g;\\n $text =~ s|</$_>|<$slang>|g;\\n}\\n\\n$text =~ s|<code (.+?)>(.*?)</code>|<lang $1>$2<$slang>|sg;\\n\\nprint $text;\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"HAI 1.3\\n\\nI HAS A bottles ITZ 99 I HAS A plural ITZ \\\"Z\\\" I HAS A lyric ITZ \\\"99 BOTTLZ OV BEER\\\"\\n\\nIM IN YR song\\n\\n VISIBLE lyric \\\" ON TEH WALL\\\"\\n VISIBLE lyric\\n VISIBLE \\\"TAEK 1 DOWN, PAZ IT AROUN\\\"\\n bottles R DIFF OF bottles AN 1\\n NOT bottles, O RLY?\\n YA RLY, VISIBLE \\\"NO MOAR BOTTLZ OV BEER ON TEH WALL\\\", GTFO\\n OIC\\n BOTH SAEM bottles AN 1, O RLY?\\n YA RLY, plural R \\\"\\\"\\n OIC\\n lyric R SMOOSH bottles \\\" BOTTL\\\" plural \\\" OV BEER\\\" MKAY\\n VISIBLE lyric \\\" ON TEH WALL:)\\\"\\nIM OUTTA YR song\\n\\nKTHXBYE\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"fixtags <- function(page)\\n{\\n langs <- c(\\\"c\\\", \\\"c-sharp\\\", \\\"r\\\") # a complete list is required, obviously\\n langs <- paste(langs, collapse=\\\"|\\\")\\n page <- gsub(paste(\\\"<(\\\", langs, \\\")>\\\", sep=\\\"\\\"), \\\"<lang \\\\\\\\1>\\\", page)\\n page <- gsub(paste(\\\"</(\\\", langs, \\\")>\\\", sep=\\\"\\\"), \\\"</#####lang>\\\", page)\\n page <- gsub(paste(\\\"<code(\\\", langs, \\\")>\\\", sep=\\\"\\\"), \\\"<lang \\\\\\\\1>\\\", page)\\n page <- gsub(paste(\\\"</code>\\\", sep=\\\"\\\"), \\\"</#####lang>\\\", page)\\n page\\n}\\n\\npage <- \\\"lorem ipsum <c>some c code</c>dolor sit amet,<c-sharp>some c-sharp code</c-sharp>\\nconsectetur adipisicing elit,<code r>some r code</code>sed do eiusmod tempor incididunt\\\"\\nfixtags(page)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define lang-names '(\\\"X\\\" \\\"Y\\\" \\\"Z\\\"))\\n\\n(define rx\\n (regexp (string-join lang-names \\\"|\\\"\\n #:before-first \\\"<((/?(?:code)?)(?:( )?(\\\"\\n #:after-last \\\"))?)>\\\")))\\n\\n(let loop () ; does all in a single scan\\n (define m (regexp-match rx (current-input-port) 0 #f (current-output-port)))\\n (when m\\n (define-values [all pfx space lang] (apply values (cdr m)))\\n (printf \\\"<~a>\\\"\\n (cond [(not lang) (if (equal? pfx #\\\"/code\\\") #\\\"/lang\\\" all)]\\n [space (if (equal? pfx #\\\"code\\\") (bytes-append #\\\"lang \\\" lang) all)]\\n [(equal? pfx #\\\"\\\") (bytes-append #\\\"lang \\\" lang)]\\n [(equal? pfx #\\\"/\\\") #\\\"/lang\\\"]\\n [else all]))\\n (loop)))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my @langs = <\\n abap actionscript actionscript3 ada apache applescript apt_sources\\n asm asp autoit avisynth bash basic4gl bf blitzbasic bnf boo c caddcl\\n cadlisp cfdg cfm cil c_mac cobol cpp cpp-qt csharp css d delphi\\n diff _div dos dot eiffel email fortran freebasic genero gettext\\n glsl gml gnuplot groovy haskell hq9plus html4strict idl ini inno\\n intercal io java java5 javascript kixtart klonec klonecpp latex lisp\\n lolcode lotusformulas lotusscript lscript lua m68k make matlab mirc\\n modula3 mpasm mxml mysql nsis objc ocaml ocaml-brief oobas oracle11\\n oracle8 pascal per perl php php-brief pic16 pixelbender plsql povray\\n powershell progress prolog providex python qbasic rails reg robots\\n ruby sas scala scheme scilab sdlbasic smalltalk smarty sql tcl teraterm\\n text thinbasic tsql typoscript vb vbnet verilog vhdl vim visualfoxpro\\n visualprolog whitespace winbatch xml xorg_conf xpp z80\\n>;\\n\\n$_ = slurp;\\n\\nfor @langs -> $l {\\n s:g:i [ '<' 'lang '? $l '>' ] = \\\"<lang $l>\\\";\\n s:g [ '</' $l '>' ] = '</' ~ 'lang>';\\n}\\n\\ns:g [ '<code '(.+?) '>' (.*?) '</code>' ] = \\\"<lang $0>{$1}</\\\"~\\\"lang>\\\";\\n\\n.say;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"use v6;\\n\\nconstant @langs = < abap actionscript actionscript3 ada … >;\\n\\nslurp().subst(\\n rx:r{\\n | '<' <( $<need-add-space>=<?> )> @langs '>'\\n | '</' <( @langs )> '>'\\n | '<' '/'? <( code )> [<.ws> @langs]? '>'\\n },\\n 'lang' ~ \\\" \\\" x *<need-add-space>.so,\\n :g,\\n).print\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program fixes (changes) depreciated HTML code tags with newer tags. */\\n@=\\\"<\\\"; old.=; old.1 = @'%s>' ; new.1 = @\\\"lang %s>\\\"\\n old.2 = @'/%s>' ; new.2 = @\\\"/lang>\\\"\\n old.3 = @'code %s>' ; new.3 = @\\\"lang %s>\\\"\\n old.4 = @'/code>' ; new.4 = @\\\"/lang>\\\"\\n\\niFID = 'Wikisource.txt' /*the Input File IDentifier. */\\noFID = 'converted.txt' /*the Output \\\" \\\" */\\n\\n do while lines(iFID)\\\\==0 /*keep reading the file until finished.*/\\n $= linein(iFID) /*read a record from the input file. */\\n do j=1 while old.j \\\\== '' /*change old ──► new until finished. */\\n $= changestr(old.j,$,new.j) /*let REXX do the heavy lifting. */\\n end /*j*/\\n call lineout oFID,$ /*write re-formatted record to output. */\\n end /*while*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# get all stdin in one string\\n#text = $stdin.read\\n# for testing, use\\ntext = DATA.read\\nslash_lang = '/lang'\\nlangs = %w(foo bar baz) # actual list of languages declared here\\nfor lang in langs\\n text.gsub!(Regexp.new(\\\"<(#{lang})>\\\")) {\\\"<lang #$1>\\\"}\\n text.gsub!(Regexp.new(\\\"</#{lang}>\\\"), \\\"<#{slash_lang}>\\\")\\nend\\ntext.gsub!(/<code (.*?)>/, '<lang \\\\1>')\\ntext.gsub!(/<\\\\/code>/, \\\"<#{slash_lang}>\\\")\\nprint text\\n\\n__END__\\nLorem ipsum <code foo>saepe audire</code> elaboraret ne quo, id equidem\\natomorum inciderint usu. <foo>In sit inermis deleniti percipit</foo>,\\nius ex tale civibus omittam. <barf>Vix ut doctus cetero invenire</barf>, his eu\\naltera electram. Tota adhuc altera te sea, <code bar>soluta appetere ut mel</bar>.\\nQuo quis graecis vivendo te, <baz>posse nullam lobortis ex usu</code>. Eam volumus perpetua\\nconstituto id, mea an omittam fierent vituperatoribus.\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"extern crate regex;\\n\\nuse std::io;\\nuse std::io::prelude::*;\\n\\nuse regex::Regex;\\n\\nconst LANGUAGES: &str =\\n \\\"_div abap actionscript actionscript3 ada apache applescript apt_sources asm asp autoit \\\\\\n avisynth bash basic4gl bf blitzbasic bnf boo c c_mac caddcl cadlisp cfdg cfm cil cobol cpp \\\\\\n cpp-qt csharp css d delphi diff dos dot eiffel email fortran freebasic genero gettext glsl \\\\\\n gml gnuplot groovy haskell hq9plus html4strict idl ini inno intercal io java java5 \\\\\\n javascript kixtart klonec klonecpp latex lisp lolcode lotusformulas lotusscript lscript lua \\\\\\n m68k make matlab mirc modula3 mpasm mxml mysql nsis objc ocaml ocaml-brief oobas oracle11 \\\\\\n oracle8 pascal per perl php php-brief pic16 pixelbender plsql povray powershell progress \\\\\\n prolog providex python qbasic rails reg robots ruby rust sas scala scheme scilab sdlbasic \\\\\\n smalltalk smarty sql tcl teraterm text thinbasic tsql typoscript vb vbnet verilog vhdl vim \\\\\\n visualfoxpro visualprolog whitespace winbatch xml xorg_conf xpp z80\\\";\\n\\nfn fix_tags(languages: &[&str], text: &str) -> String {\\n let mut replaced_text = text.to_owned();\\n\\n for lang in languages.iter() {\\n let bad_open = Regex::new(&format!(\\\"<{lang}>|<code {lang}>\\\", lang = lang)).unwrap();\\n let bad_close = Regex::new(&format!(\\\"</{lang}>|</code>\\\", lang = lang)).unwrap();\\n let open = format!(\\\"<lang {}>\\\", lang);\\n let close = \\\"</lang>\\\";\\n\\n replaced_text = bad_open.replace_all(&replaced_text, &open[..]).into_owned();\\n replaced_text = bad_close\\n .replace_all(&replaced_text, &close[..])\\n .into_owned();\\n }\\n\\n replaced_text\\n}\\n\\nfn main() {\\n let stdin = io::stdin();\\n let mut buf = String::new();\\n stdin.lock().read_to_string(&mut buf).unwrap();\\n println!(\\n \\\"{}\\\",\\n fix_tags(&LANGUAGES.split_whitespace().collect::<Vec<_>>(), &buf)\\n );\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object FixCodeTags extends App {\\n val rx = // See for regex explanation: https://regex101.com/r/N8X4x7/3/\\n // Flags ignore case, dot matching line breaks, unicode support\\n s\\\"(?is)<(?:(?:code\\\\\\\\s+)?(${langs.mkString(\\\"|\\\")}))>(.+?|)<\\\\\\\\/(?:code|\\\\\\\\1)>\\\".r\\n\\n def langs = // Real list of langs goes here\\n Seq(\\\"bar\\\", \\\"baz\\\", \\\"foo\\\", \\\"Scala\\\", \\\"உயிர்/Uyir\\\", \\\"Müller\\\")\\n\\n def markDown =\\n \\\"\\\"\\\"Lorem ipsum <Code foo>saepe audire</code> elaboraret ne quo, id equidem\\n |atomorum inciderint usu. <foo>In sit inermis deleniti percipit</foo>, ius\\n |ex tale civibus omittam. <barf>Vix ut doctus cetero invenire</barf>, his eu\\n |altera electram. Tota adhuc altera te sea, <code bar>soluta appetere ut mel\\n |</bar>. Quo quis graecis vivendo te, <baz>posse nullam lobortis ex usu</code>.\\n |Eam volumus perpetua constituto id, mea an omittam fierent vituperatoribus.\\n |Empty element: <Müller></Müller><scaLa></Scala><உயிர்/Uyir></உயிர்/Uyir>\\\"\\\"\\\".stripMargin\\n\\n println(rx.replaceAllIn(markDown, _ match {\\n case rx(langName, langCode) => s\\\"<lang ${langName.capitalize}>${langCode}<${\\\"/lan\\\"}g>\\\"\\n })) // ${\\\"/lan\\\"}g is the <noWiki> escape.\\n\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"var langs = %w(ada cpp-qt pascal lscript z80 visualprolog\\nhtml4strict cil objc asm progress teraterm hq9plus genero tsql\\nemail pic16 tcl apt_sources io apache vhdl avisynth winbatch\\nvbnet ini scilab ocaml-brief sas actionscript3 qbasic perl bnf\\ncobol powershell php kixtart visualfoxpro mirc make javascript\\ncpp sdlbasic cadlisp php-brief rails verilog xml csharp\\nactionscript nsis bash typoscript freebasic dot applescript\\nhaskell dos oracle8 cfdg glsl lotusscript mpasm latex sql klonec\\nruby ocaml smarty python oracle11 caddcl robots groovy smalltalk\\ndiff fortran cfm lua modula3 vb autoit java text scala\\nlotusformulas pixelbender reg _div whitespace providex asp css\\nlolcode lisp inno mysql plsql matlab oobas vim delphi xorg_conf\\ngml prolog bf per scheme mxml d basic4gl m68k gnuplot idl abap\\nintercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel\\npovray c gettext).join('|');\\n\\nvar text = ARGF.slurp;\\n\\ntext.gsub!(Regex.new('<(' + langs + ')>'), {|s1| \\\"<lang #{s1}>\\\" });\\ntext.gsub!(Regex.new('</(' + langs + ')>'), \\\"</\\\" + \\\"lang>\\\");\\ntext.gsub!(\\n Regex.new('<code\\\\h+(' + langs + ')>(.*?)</code>', 's'),\\n {|s1,s2| \\\"<lang #{s1}>#{s2}</\\\" + \\\"lang>\\\"}\\n);\\n\\nprint text;\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"set langs {\\n ada cpp-qt pascal lscript z80 visualprolog html4strict cil objc asm progress teraterm\\n hq9plus genero tsql email pic16 tcl apt_sources io apache vhdl avisynth winbatch vbnet\\n ini scilab ocaml-brief sas actionscript3 qbasic perl bnf cobol powershell php kixtart\\n visualfoxpro mirc make javascript cpp sdlbasic cadlisp php-brief rails verilog xml\\n csharp actionscript nsis bash typoscript freebasic dot applescript haskell dos oracle8\\n cfdg glsl lotusscript mpasm latex sql klonec ruby ocaml smarty python oracle11 caddcl\\n robots groovy smalltalk diff fortran cfm lua modula3 vb autoit java text scala lotusformulas\\n pixelbender reg _div whitespace providex asp css lolcode lisp inno mysql plsql matlab\\n oobas vim delphi xorg_conf gml prolog bf per scheme mxml d basic4gl m68k gnuplot idl\\n abap intercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel povray c gettext\\n}\\n\\nset text [read stdin]\\nset slang /lang\\nforeach lang $langs {\\n set text [regsub -all \\\"<$lang>\\\" $text \\\"<lang $lang>\\\"]\\n set text [regsub -all \\\"</$lang>\\\" $text \\\"<$slang>\\\"]\\n}\\nset text [regsub -all \\\"<code (.+?)>(.+?)</code>\\\" $text \\\"<lang \\\\\\\\1>\\\\\\\\2<$slang>\\\"]</lang>\\nAlternatively, for foreach loop may be replaced with:\\n<lang tcl>set text [regexp -all \\\"<([join $langs |])>\\\" $text {<lang \\\\1>}]\\nset text [regexp -all \\\"</(?:[join $langs |])>\\\" $text \\\"<$slang>\\\"]</lang>\\n\\nThis task does not require regular expressions at all:\\n<lang tcl>set replacements [list </code> <$slang>]\\nforeach lang $langs {\\n lappend replacements \\\"<$lang>\\\" \\\"<lang $lang>\\\"\\n lappend replacements \\\"</$lang>\\\" \\\"<$slang>\\\"\\n lappend replacements \\\"<code $lang>\\\" \\\"<lang $lang>\\\"\\n}\\nset text [string map $replacements $text]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"./pattern\\\" for Pattern\\n\\nvar source1 = \\\"\\\"\\\"\\n<lang AutoHotkey>; usage: > fixtags.ahk input.txt ouput.txt\\nFileRead, text, %1%\\nlangs = ada,awk,autohotkey,etc\\nslang = /lang\\nslang := \\\"<\\\" . slang . \\\"/>\\\"\\nLoop, Parse, langs, `,\\n{\\n tag1 = <%A_LoopField%>\\n tag2 = </%A_LoopField%>\\n text := RegExReplace(text, tag1, \\\"<lang \\\" . A_LoopField . \\\">\\\")\\n text := RegExReplace(text, tag2, slang)\\n text := RegExReplace(text, \\\"<code (.+?)>(.*?)</code>\\\"\\n , \\\"<lang $1>$2\\\" . slang)\\n}\\nFileAppend, % text, %2%\\n</lang>\\n\\\"\\\"\\\"\\n\\nvar source2 = \\\"\\\"\\\"\\n<lang perl>my @langs = qw(ada cpp-qt pascal lscript z80 visualprolog\\nhtml4strict cil objc asm progress teraterm hq9plus genero tsql\\nemail pic16 tcl apt_sources io apache vhdl avisynth winbatch\\nvbnet ini scilab ocaml-brief sas actionscript3 qbasic perl bnf\\ncobol powershell php kixtart visualfoxpro mirc make javascript\\ncpp sdlbasic cadlisp php-brief rails verilog xml csharp\\nactionscript nsis bash typoscript freebasic dot applescript\\nhaskell dos oracle8 cfdg glsl lotusscript mpasm latex sql klonec\\nruby ocaml smarty python oracle11 caddcl robots groovy smalltalk\\ndiff fortran cfm lua modula3 vb autoit java text scala\\nlotusformulas pixelbender reg _div whitespace providex asp css\\nlolcode lisp inno mysql plsql matlab oobas vim delphi xorg_conf\\ngml prolog bf per scheme mxml d basic4gl m68k gnuplot idl abap\\nintercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel\\npovray c gettext);\\n\\nmy $text = join \\\"\\\", <STDIN>;\\nmy $slang=\\\"/lang\\\";\\nfor (@langs) {\\n $text =~ s|<$_>|<lang $_>|g;\\n $text =~ s|</$_>|<$slang>|g;\\n}\\n\\n$text =~ s|<code (.+?)>(.*?)</code>|<lang $1>$2<$slang>|sg;\\n\\nprint $text;</lang>\\n\\\"\\\"\\\"\\n\\nvar source3 = \\\"\\\"\\\"\\n<lang>HAI 1.3\\n\\nI HAS A bottles ITZ 99 I HAS A plural ITZ \\\"Z\\\" I HAS A lyric ITZ \\\"99 BOTTLZ OV BEER\\\"\\n\\nIM IN YR song\\n\\n VISIBLE lyric \\\" ON TEH WALL\\\"\\n VISIBLE lyric\\n VISIBLE \\\"TAEK 1 DOWN, PAZ IT AROUN\\\"\\n bottles R DIFF OF bottles AN 1\\n NOT bottles, O RLY?\\n YA RLY, VISIBLE \\\"NO MOAR BOTTLZ OV BEER ON TEH WALL\\\", GTFO\\n OIC\\n BOTH SAEM bottles AN 1, O RLY?\\n YA RLY, plural R \\\"\\\"\\n OIC\\n lyric R SMOOSH bottles \\\" BOTTL\\\" plural \\\" OV BEER\\\" MKAY\\n VISIBLE lyric \\\" ON TEH WALL:)\\\"\\nIM OUTTA YR song\\n\\nKTHXBYE</lang>\\n\\\"\\\"\\\"\\n\\nvar p = Pattern.new(\\\"<lang [+1^>]>\\\")\\nvar sh = \\\"syntaxhighlight\\\"\\nvar repl = \\\"<%(sh) lang=\\\\\\\"$1\\\\\\\">\\\"\\nfor (source in [source1, source2, source3]) {\\n source = p.replace(source, repl, 1, 0).\\n replace(\\\"<lang>\\\", \\\"<%(sh) lang=\\\\\\\"text\\\\\\\">\\\").\\n replace(\\\"</lang>\\\", \\\"</%(sh)>\\\")\\n System.print(source)\\n System.print()\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"; usage: > fixtags.ahk input.txt ouput.txt\\nFileRead, text, %1%\\nlangs = ada,awk,autohotkey,etc\\nslang = /lang\\nslang := \\\"<\\\" . slang . \\\"/>\\\"\\nLoop, Parse, langs, `,\\n{\\n tag1 = <%A_LoopField%>\\n tag2 = </%A_LoopField%>\\n text := RegExReplace(text, tag1, \\\"<lang \\\" . A_LoopField . \\\">\\\")\\n text := RegExReplace(text, tag2, slang)\\n text := RegExReplace(text, \\\"<code (.+?)>(.*?)</code>\\\"\\n , \\\"<lang $1>$2\\\" . slang)\\n}\\nFileAppend, % text, %2%\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"my @langs = qw(ada cpp-qt pascal lscript z80 visualprolog\\nhtml4strict cil objc asm progress teraterm hq9plus genero tsql\\nemail pic16 tcl apt_sources io apache vhdl avisynth winbatch\\nvbnet ini scilab ocaml-brief sas actionscript3 qbasic perl bnf\\ncobol powershell php kixtart visualfoxpro mirc make javascript\\ncpp sdlbasic cadlisp php-brief rails verilog xml csharp\\nactionscript nsis bash typoscript freebasic dot applescript\\nhaskell dos oracle8 cfdg glsl lotusscript mpasm latex sql klonec\\nruby ocaml smarty python oracle11 caddcl robots groovy smalltalk\\ndiff fortran cfm lua modula3 vb autoit java text scala\\nlotusformulas pixelbender reg _div whitespace providex asp css\\nlolcode lisp inno mysql plsql matlab oobas vim delphi xorg_conf\\ngml prolog bf per scheme mxml d basic4gl m68k gnuplot idl abap\\nintercal c_mac thinbasic java5 xpp boo klonecpp blitzbasic eiffel\\npovray c gettext);\\n\\nmy $text = join \\\"\\\", <STDIN>;\\nmy $slang=\\\"/lang\\\";\\nfor (@langs) {\\n $text =~ s|<$_>|<lang $_>|g;\\n $text =~ s|</$_>|<$slang>|g;\\n}\\n\\n$text =~ s|<code (.+?)>(.*?)</code>|<lang $1>$2<$slang>|sg;\\n\\nprint $text;\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"HAI 1.3\\n\\nI HAS A bottles ITZ 99 I HAS A plural ITZ \\\"Z\\\" I HAS A lyric ITZ \\\"99 BOTTLZ OV BEER\\\"\\n\\nIM IN YR song\\n\\n VISIBLE lyric \\\" ON TEH WALL\\\"\\n VISIBLE lyric\\n VISIBLE \\\"TAEK 1 DOWN, PAZ IT AROUN\\\"\\n bottles R DIFF OF bottles AN 1\\n NOT bottles, O RLY?\\n YA RLY, VISIBLE \\\"NO MOAR BOTTLZ OV BEER ON TEH WALL\\\", GTFO\\n OIC\\n BOTH SAEM bottles AN 1, O RLY?\\n YA RLY, plural R \\\"\\\"\\n OIC\\n lyric R SMOOSH bottles \\\" BOTTL\\\" plural \\\" OV BEER\\\" MKAY\\n VISIBLE lyric \\\" ON TEH WALL:)\\\"\\nIM OUTTA YR song\\n\\nKTHXBYE\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn replace(data,src,dstpat){\\n re,n,buf:=RegExp(src),0,Data();\\n while(re.search(data,True,n)){\\n matched:=re.matched;\\t// L(L(12,3),\\\"c\\\")\\n data[matched[0].xplode()]=re.sub(data,dstpat,buf); // \\\"\\\\1\\\" --> \\\"c\\\"\\n n=matched[0].sum(0); // move past change\\n }\\n}\\ndata:=File.stdin.read();\\nforeach src,dst in (T(\\n T(0'|<(\\\\w+)>|, 0'|<lang \\\\1>|), T(0'|</(\\\\w+)>|,\\\"</\\\" \\\"lang>\\\"),\\n T(0'|<code (\\\\w+)>|,0'|<lang \\\\1>|) )){\\n replace(data,src,dst)\\n}\\nprint(data.text);\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Rosetta-Code-Fix-code-tags"}}},{"rowIdx":1594,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Text processing\n- Networking and Web Interaction\n- Sorting\n- Rosetta Code related\nfrom: http://rosettacode.org/wiki/Rosetta_Code/Rank_languages_by_number_of_users\n","language":"00-META"},{"code":";Task:\nSort most popular programming languages based on the number of users on Rosetta Code. \n\nShow the languages with at least 100 users.\n\n\n;A method to solve the task:\nUsers of a computer programming language '''X''' are those referenced in the page: \n https://rosettacode.org/wiki/Category:X_User, or preferably: \n https://rosettacode.org/mw/index.php?title=Category:X_User&redirect=no to avoid re-directions. \n\nIn order to find the list of such categories, it's possible to first parse the entries of: \n http://rosettacode.org/mw/index.php?title=Special:Categories&limit=5000. \n\nThen download and parse each computer language ''users'' category to find the number of users of that computer language.\n\n\nSample output on 18 February 2019:\n<pre>Language Users\n--------------------------\nC 391\nJava 276\nC++ 275\nPython 262\nJavaScript 238\nPerl 171\nPHP 167\nSQL 138\nUNIX Shell 131\nBASIC 120\nC sharp 118\nPascal 116\nHaskell 102</pre>\n\nA Rosetta Code user usually declares using a language with the [[Template:Mylang|mylang]] template. This template is expected to appear on the User page. However, in some cases it appears in a user Talk page. It's not necessary to take this into account. For instance, among the 373 C users in the table above, 3 are actually declared in a Talk page.\n<br><br>\n\n","language":"00-TASK"},{"code":"package main\n\nimport (\n \"fmt\"\n \"io/ioutil\"\n \"net/http\"\n \"regexp\"\n \"sort\"\n \"strconv\"\n)\n\ntype Result struct {\n lang string\n users int\n}\n\nfunc main() {\n const minimum = 25\n ex := `\"Category:(.+?)( User)?\"(\\}|,\"categoryinfo\":\\{\"size\":(\\d+),)`\n re := regexp.MustCompile(ex)\n page := \"http://rosettacode.org/mw/api.php?\"\n action := \"action=query\"\n format := \"format=json\"\n fversion := \"formatversion=2\"\n generator := \"generator=categorymembers\"\n gcmTitle := \"gcmtitle=Category:Language%20users\"\n gcmLimit := \"gcmlimit=500\"\n prop := \"prop=categoryinfo\"\n rawContinue := \"rawcontinue=\"\n page += fmt.Sprintf(\"%s&%s&%s&%s&%s&%s&%s&%s\", action, format, fversion,\n generator, gcmTitle, gcmLimit, prop, rawContinue)\n resp, _ := http.Get(page)\n body, _ := ioutil.ReadAll(resp.Body)\n matches := re.FindAllStringSubmatch(string(body), -1)\n resp.Body.Close()\n var results []Result\n for _, match := range matches {\n if len(match) == 5 {\n users, _ := strconv.Atoi(match[4])\n if users >= minimum {\n result := Result{match[1], users}\n results = append(results, result)\n }\n }\n }\n sort.Slice(results, func(i, j int) bool {\n return results[j].users < results[i].users\n })\n\n fmt.Println(\"Rank Users Language\")\n fmt.Println(\"---- ----- --------\")\n rank := 0\n lastUsers := 0\n lastRank := 0\n for i, result := range results {\n eq := \" \"\n rank = i + 1\n if lastUsers == result.users {\n eq = \"=\"\n rank = lastRank\n } else {\n lastUsers = result.users\n lastRank = rank\n }\n fmt.Printf(\" %-2d%s %3d %s\\n\", rank, eq, result.users, result.lang)\n }\n}\n","language":"Go"},{"code":"\"\"\" Rank languages on Rosetta Code's site by number of users.\"\"\"\n\nusing Dates\nusing HTTP\nusing JSON3\n\nconst URL = \"https://rosettacode.org/w/api.php?\"\nconst PARAMS = [\"action\" => \"query\", \"format\" => \"json\", \"formatversion\" => \"2\", \"generator\" => \"categorymembers\",\n \"gcmtitle\" => \"Category:Language%20users\", \"gcmlimit\" => \"500\", \"rawcontinue\" => \"\", \"prop\" => \"categoryinfo\"]\n\nconst resp = HTTP.get(URL * join(map(p -> p[1] * (p[2] == \"\" ? \"\" : (\"=\" * p[2])), PARAMS), \"&\"))\nconst counts = Pair{Int, String}[]\n\nfor p in JSON3.read(String(resp.body)).query.pages\n contains(p.title, \"Category\") && push!(counts, p.categoryinfo.size => p.title)\nend\n\nprintln(\"Date: \", now(), \"\\nLanguage Users\\n----------------------\")\nfor p in sort!(filter(p -> p[1] >= 100, counts), rev = true)\n println(rpad(replace(p[2], r\"Category:(.+) User\" => s\"\\1\"), 16), lpad(p[1], 4))\nend\n","language":"Julia"},{"code":"import algorithm, httpclient, json, strformat, strscans, strutils\n\nconst\n Action = \"action=query\"\n Format = \"format=json\"\n FormatVersion = \"formatversion=2\"\n Generator = \"generator=categorymembers\"\n GcmTitle = \"gcmtitle=Category:Language%20users\"\n GcmLimit = \"gcmlimit=500\"\n Prop = \"prop=categoryinfo\"\n\n Page = \"http://rosettacode.org/w/api.php?\" &\n [Action, Format, Formatversion, Generator, GcmTitle, GcmLimit, Prop].join(\"&\")\n\ntype Counts = tuple[lang: string, count: int]\n\nproc cmp(a, b: Counts): int =\n ## Compare two count tuples. Place the one with greater count field first and when\n ## count fields are equal, place the one with the first name in alphabetic order.\n result = cmp(b.count, a.count)\n if result == 0: result = cmp(a.lang, b.lang)\n\nvar client = newHttpClient()\nvar counts: seq[Counts]\nvar url = Page\n\nwhile true:\n\n # Access to the page and load the JSON representation.\n let response = client.get(url)\n if response.status != $Http200: break\n let root = response.body.parseJson()\n\n # Extract language names and number of users.\n for node in root{\"query\", \"pages\"}:\n var lang: string\n if node[\"title\"].getStr().scanf(\"Category:$+ User\", lang):\n let count = node{\"categoryinfo\", \"size\"}.getInt()\n counts.add (lang, count)\n if \"continue\" notin root: break\n\n # Load continuation page.\n let gcmcont = root{\"continue\", \"gcmcontinue\"}.getStr()\n let cont = root{\"continue\", \"continue\"}.getStr()\n url = Page & fmt\"&gcmcontinue={gcmcont}&continue={cont}\"\n\n# Sort and display.\ncounts.sort(cmp)\nvar rank, lastCount = 0\nfor i, (lang, count) in counts:\n if count != lastCount:\n rank = i + 1\n lastCount = count\n echo &\"{rank:3} {count:4} - {lang}\"\n","language":"Nim"},{"code":"use strict;\nuse warnings;\nuse JSON;\nuse URI::Escape;\nuse LWP::UserAgent;\n\nmy $client = LWP::UserAgent->new;\n$client->agent(\"Rosettacode Perl task solver\");\nmy $url = 'http://rosettacode.org/mw';\nmy $minimum = 100;\n\nsub uri_query_string {\n my(%fields) = @_;\n 'action=query&format=json&formatversion=2&' .\n join '&', map { $_ . '=' . uri_escape($fields{$_}) } keys %fields\n}\n\nsub mediawiki_query {\n my($site, $type, %query) = @_;\n my $url = \"$site/api.php?\" . uri_query_string(%query);\n my %languages = ();\n\n my $req = HTTP::Request->new( GET => $url );\n my $response = $client->request($req);\n $response->is_success or die \"Failed to GET '$url': \", $response->status_line;\n my $data = decode_json($response->content);\n for my $row ( @{${$data}{query}{pages}} ) {\n next unless defined $$row{categoryinfo} && $$row{title} =~ /User/;\n my($title) = $$row{title} =~ /Category:(.*?) User/;\n my($count) = $$row{categoryinfo}{pages};\n $languages{$title} = $count;\n }\n %languages;\n}\n\nmy %table = mediawiki_query(\n $url, 'pages',\n ( generator => 'categorymembers',\n gcmtitle => 'Category:Language users',\n gcmlimit => '999',\n prop => 'categoryinfo',\n rawcontinue => '',\n )\n);\n\nfor my $k (sort { $table{$b} <=> $table{$a} } keys %table) {\n printf \"%4d %s\\n\", $table{$k}, $k if $table{$k} > $minimum;\n}\n","language":"Perl"},{"code":"\"\"\"Rank languages by number of users. Requires Python >=3.5\"\"\"\n\nimport requests\n\n# MediaWiki API URL.\nURL = \"http://rosettacode.org/mw/api.php\"\n\n# Query string parameters\nPARAMS = {\n \"action\": \"query\",\n \"format\": \"json\",\n \"formatversion\": 2,\n \"generator\": \"categorymembers\",\n \"gcmtitle\": \"Category:Language users\",\n \"gcmlimit\": 500,\n \"prop\": \"categoryinfo\",\n}\n\n\ndef fetch_data():\n counts = {}\n continue_ = {\"continue\": \"\"}\n\n # Keep making HTTP requests to the MediaWiki API if more records are\n # available.\n while continue_:\n resp = requests.get(URL, params={**PARAMS, **continue_})\n resp.raise_for_status()\n\n data = resp.json()\n\n # Grab the title (language) and size (count) only.\n counts.update(\n {\n p[\"title\"]: p.get(\"categoryinfo\", {}).get(\"size\", 0)\n for p in data[\"query\"][\"pages\"]\n }\n )\n\n continue_ = data.get(\"continue\", {})\n\n return counts\n\n\nif __name__ == \"__main__\":\n # Request data from the MediaWiki API.\n counts = fetch_data()\n\n # Filter out languages that have less than 100 users.\n at_least_100 = [(lang, count) for lang, count in counts.items() if count >= 100]\n\n # Sort languages by number of users\n top_languages = sorted(at_least_100, key=lambda x: x[1], reverse=True)\n\n # Pretty print\n for i, lang in enumerate(top_languages):\n print(f\"{i+1:<5}{lang[0][9:][:-5]:<20}{lang[1]}\")\n","language":"Python"},{"code":"#lang racket\n\n(require racket/hash\n net/url\n json)\n\n(define limit 64)\n(define (replacer cat) (regexp-replace #rx\"^Category:(.*?) User$\" cat \"\\\\1\"))\n(define category \"Category:Language users\")\n(define entries \"users\")\n\n(define api-url (string->url \"http://rosettacode.org/mw/api.php\"))\n(define (make-complete-url gcmcontinue)\n (struct-copy url api-url\n [query `([format . \"json\"]\n [action . \"query\"]\n [generator . \"categorymembers\"]\n [gcmtitle . ,category]\n [gcmlimit . \"200\"]\n [gcmcontinue . ,gcmcontinue]\n [continue . \"\"]\n [prop . \"categoryinfo\"])]))\n\n(define @ hash-ref)\n\n(define table (make-hash))\n\n(let loop ([gcmcontinue \"\"])\n (define resp (read-json (get-pure-port (make-complete-url gcmcontinue))))\n (hash-union! table\n (for/hash ([(k v) (in-hash (@ (@ resp 'query) 'pages))])\n (values (@ v 'title #f) (@ (@ v 'categoryinfo (hash)) 'size 0))))\n (cond [(@ resp 'continue #f) => (λ (c) (loop (@ c 'gcmcontinue)))]))\n\n(for/fold ([prev #f] [rank #f] #:result (void))\n ([item (in-list (sort (hash->list table) > #:key cdr))] [i (in-range limit)])\n (match-define (cons cat size) item)\n (define this-rank (if (equal? prev size) rank (add1 i)))\n (printf \"Rank: ~a ~a ~a\\n\"\n (~a this-rank #:align 'right #:min-width 2)\n (~a (format \"(~a ~a)\" size entries) #:align 'right #:min-width 14)\n (replacer cat))\n (values size this-rank))\n","language":"Racket"},{"code":"use HTTP::UserAgent;\nuse URI::Escape;\nuse JSON::Fast;\n\nmy $client = HTTP::UserAgent.new;\n\nmy $url = 'https://rosettacode.org/w';\n\nmy $start-time = now;\n\nsay \"========= Generated: { DateTime.new(time) } =========\";\n\nmy $lang = 1;\nmy $rank = 0;\nmy $last = 0;\nmy $tie = ' ';\nmy $minimum = 25;\n\n.say for\n mediawiki-query(\n $url, 'pages',\n :generator<categorymembers>,\n :gcmtitle<Category:Language users>,\n :gcmlimit<350>,\n :rawcontinue(),\n :prop<categoryinfo>\n )\n\n .map({ %( count => .<categoryinfo><pages> || 0,\n lang => .<title>.subst(/^'Category:' (.+) ' User'/, ->$/ {$0}) ) })\n\n .sort( { -.<count>, .<syntaxhighlight lang=\"text\"> } )\n\n .map( { last if .<count> < $minimum; display(.<count>, .<syntaxhighlight lang=\"text\">) } );\n\nsay \"========= elapsed: {(now - $start-time).round(.01)} seconds =========\";\n\nsub display ($count, $which) {\n if $last != $count { $last = $count; $rank = $lang; $tie = ' ' } else { $tie = 'T' };\n sprintf \"#%3d Rank: %2d %s with %-4s users: %s\", $lang++, $rank, $tie, $count, $which;\n}\n\nsub mediawiki-query ($site, $type, *%query) {\n my $url = \"$site/api.php?\" ~ uri-query-string(\n :action<query>, :format<json>, :formatversion<2>, |%query);\n my $continue = '';\n\n gather loop {\n my $response = $client.get(\"$url&$continue\");\n my $data = from-json($response.content);\n take $_ for $data.<query>.{$type}.values;\n $continue = uri-query-string |($data.<query-continue>{*}».hash.hash or last);\n }\n}\n\nsub uri-query-string (*%fields) {\n join '&', %fields.map: { \"{.key}={uri-escape .value}\" }\n}\n","language":"Raku"},{"code":"/*REXX program reads 2 files & displays a ranked list of Rosetta Code languages by users*/\nparse arg catFID lanFID outFID . /*obtain optional arguments from the CL*/\ncall init /*initialize some REXX variables. */\ncall get /*obtain data from two separate files. */\ncall eSort #,0 /*sort languages along with members. */\ncall tSort /* \" \" that are tied in rank.*/\ncall eSort #,1 /* \" \" along with members. */\ncall out /*create the RC_USER.OUT (output) file.*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncommas: parse arg _; do jc=length(_)-3 to 1 by -3; _= insert(\",\",_,jc); end; return _\ns: if arg(1)==1 then return arg(3); return word(arg(2) 's',1) /*pluralizer.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\neSort: procedure expose #. @. !tr.; arg N,p2; h= N /*sort: number of members*/\n do while h>1; h= h % 2 /*halve number of records*/\n do i=1 for N-h; j= i; k= h + i /*sort this part of list.*/\n if p2 then do while !tR.k==!tR.j & @.k>@.j /*this uses a hard swap ↓*/\n @= @.j; #= !tR.j; @.j= @.k; !tR.j= !tR.k; @.k= @; !tR.k= #\n if h>=j then leave; j= j - h; k= k - h\n end /*while !tR.k==···*/\n else do while #.k<#.j /*this uses a hard swap ↓*/\n @= @.j; #= #.j; @.j= @.k; #.j= #.k; @.k= @; #.k= #\n if h>=j then leave; j= j - h; k= k - h\n end /*while #.k<···*/\n end /*i*/ /*hard swaps needed for embedded blanks.*/\n end /*while h>1*/; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nget: langs= 0; call rdr 'languages' /*assign languages ───► L.ααα */\n call rdr 'categories' /*append categories ───► catHeap */\n #= 0\n do j=1 until catHeap=='' /*process the heap of categories. */\n parse var catHeap cat.j (sep) catHeap /*get a category from the catHeap. */\n parse var cat.j cat.j '<' \"(\" mems . /*untangle the strange─looking string. */\n cat.j= space(cat.j); ?=cat.j; upper ? /*remove any superfluous blanks. */\n if ?=='' | \\L.? then iterate /*it's blank or it's not a language. */\n if pos(',', mems)\\==0 then mems= space(translate(mems,,\",\"), 0) /*¬commas.*/\n if \\datatype(mems, 'W') then iterate /*is the \"members\" number not numeric? */\n #.0= #.0 + mems /*bump the number of members found. */\n if u.?\\==0 then do; do f=1 for # until ?==@u.f\n end /*f*/\n #.f= #.f + mems; iterate j /*languages in different cases.*/\n end /* [↑] handle any possible duplicates.*/\n u.?= u.? + 1; #= # + 1 /*bump a couple of counters. */\n #.#= #.# + mems; @.#= cat.j; @u.#=? /*bump the counter; assign it (upper).*/\n end /*j*/\n\n !.=; @tno= '(total) number of' /*array holds indication of TIED langs.*/\n call tell right(commas(#), 9) @tno 'languages detected in the category file'\n call tell right(commas(langs),9) ' \" \" \" \" \" \" \" language \"'\n call tell right(commas(#.0), 9) @tno 'entries (users of lanugages) detected', , 1\n term= 0\n return /*don't show any more msgs──►term. [↑] */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ninit: sep= '█'; L.=0; #.=0; u.=#.; catHeap=; term=1; old.= /*assign some REXX vars*/\n if catFID=='' then catFID= \"RC_USER.CAT\" /*Not specified? Then use the default.*/\n if lanFID=='' then lanFID= \"RC_USER.LAN\" /* \" \" \" \" \" \" */\n if outFID=='' then outFID= \"RC_USER.OUT\" /* \" \" \" \" \" \" */\n call tell center('timestamp: ' date() time(\"Civil\"),79,'═'), 2, 1; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nout: w= length( commas(#) ); rank= 0 /* [↓] show by ascending rank of lang.*/\n do t=# by -1 for #; rank= rank + 1 /*bump rank of a programming language. */\n call tell right('rank:' right(commas(!tR.t), w), 20-1) right(!.t, 7),\n right('('commas(#.t) left(\"entr\"s(#.t, 'ies', \"y\")')', 9), 20) @.t\n end /*#*/ /* [↑] S(···) pluralizes a word. */\n call tell left('', 27) \"☼ end─of─list. ☼\", 1, 2; return /*bottom title.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nrdr: arg which 2; igAst= 1 /*ARG uppers WHICH, obtain the 1st char*/\n if which=='L' then inFID= lanFID /*use this fileID for the languages. */\n if which=='C' then inFID= catFID /* \" \" \" \" \" categories. */\n Uyir= 'α«ëα«»α«┐α«░α»ì/Uyir' /*Unicode (in text) name for Uyir */\n old.0= '╬£C++' ; new.0= \"µC++\" /*Unicode ╬£C++ ───► ASCII─8: µC++ */\n old.1= 'UC++' ; new.1= \"µC++\" /*old UC++ ───► ASCII─8: µC++ */\n old.2= '╨£╨Ü-' ; new.2= \"MK-\" /*Unicode ╨£╨Ü─ ───► ASCII-8: MK- */\n old.3= 'D├⌐j├á' ; new.3= \"Déjà\" /*Unicode ├⌐j├á ───► ASCII─8: Déjà */\n old.4= 'Cach├⌐' ; new.4= \"Caché\" /*Unicode Cach├⌐ ───► ASCII─8: Caché */\n old.5= '??-61/52' ; new.5= \"MK-61/52\" /*somewhere past, a mis─translated: MK-*/\n old.6= 'F┼ìrmul├ª' ; new.6= 'Fôrmulæ' /*Unicode ───► ASCII─8: Fôrmulæ */\n old.7= '╨£iniZinc' ; new.7= 'MiniZinc' /*Unicode ───► ASCII─8: MiniZinc*/\n old.8= Uyir ; new.8= 'Uyir' /*Unicode ───► ASCII─8: Uyir */\n old.9= 'Perl 6' ; new.9= 'Raku' /* (old name) ───► (new name) */\n\n do recs=0 while lines(inFID) \\== 0 /*read a file, a single line at a time.*/\n $= translate( linein(inFID), , '9'x) /*handle any stray TAB ('09'x) chars.*/\n $$= space($); if $$=='' then iterate /*ignore all blank lines in the file(s)*/\n do v=0 while old.v \\== '' /*translate Unicode variations of langs*/\n if pos(old.v, $$) \\==0 then $$= changestr(old.v, $$, new.v)\n end /*v*/ /* [↑] handle different lang spellings*/\n if igAst then do; igAst= pos(' * ', $)==0; if igAst then iterate; end\n if pos('RETRIEVED FROM', translate($$))\\==0 then leave /*pseudo End─Of─Data?.*/\n if which=='L' then do; if left($$, 1)\\==\"*\" then iterate /*lang ¬legitimate?*/\n parse upper var $$ '*' $$ \"<\"; $$= space($$)\n if $$=='' then iterate\n $$= $$ 'USER'\n L.$$= 1\n langs= langs + 1 /*bump # of languages/users found.*/\n iterate\n end /* [↓] extract computer language name.*/\n if left($$, 1)=='*' then $$= sep || space( substr($$, 2) )\n catHeap= catHeap $$ /*append to the catHeap (CATegory) heap*/\n end /*recs*/\n call tell right( commas(recs), 9) 'records read from file: ' inFID\n return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ntell: do '0'arg(2); call lineout outFID,\" \" ; if term then say ; end\n call lineout outFID,arg(1) ; if term then say arg(1)\n do '0'arg(3); call lineout outFID,\" \" ; if term then say ; end\n return /*show BEFORE blank lines (if any), message, show AFTER blank lines.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ntSort: tied=; r= 0 /*add true rank (tR) ───► the entries. */\n do j=# by -1 for #; r= r+1; tR= r; !tR.j= r; jp= j+1; jm= j-1\n if tied=='' then pR= r; tied= /*handle when language rank is untied. */\n if #.j==#.jp | #.j==#.jm then do; !.j= '[tied]'; tied= !.j; end\n if #.j==#.jp then do; tR= pR; !tR.j= pR; end\n else pR= r\n end /*j*/; return\n","language":"REXX"},{"code":"copy \"http://rosettacode.org/mw/index.php?title=Special:Categories&limit=5000\" categ.html, replace\nimport delimited categ.html, delim(\"@\") enc(\"utf-8\") clear\nkeep if ustrpos(v1,\"/wiki/Category:\") & ustrpos(v1,\"_User\")\ngen i = ustrpos(v1,\"href=\")\ngen j = ustrpos(v1,char(34),i+1)\ngen k = ustrpos(v1,char(34),j+1)\ngen s = usubstr(v1,j+7,k-j-7)\nreplace i = ustrpos(v1,\"title=\")\nreplace j = ustrpos(v1,\">\",i+1)\nreplace k = ustrpos(v1,\" User\",j+1)\ngen lang = usubstr(v1,j+1,k-j)\nkeep s lang\ngen users=.\n\nforval i=1/`c(N)' {\n\tlocal s\n\tpreserve\n\tcopy `\"https://rosettacode.org/mw/index.php?title=`=s[`i']'&redirect=no\"' `i'.html, replace\n\timport delimited `i'.html, delim(\"@\") enc(\"utf-8\") clear\n\tcount if ustrpos(v1,\"/wiki/User\")\n\tlocal m `r(N)'\n\trestore\n\treplace users=`m' in `i'\n\terase `i'.html\n}\n\ndrop s\ngsort -users lang\ncompress\nleftalign\nlist in f/50\nsave rc_users, replace\n","language":"Stata"},{"code":"/* Rosetta_Code_Rank_languages_by_number_of_users.wren */\n\nimport \"./pattern\" for Pattern\nimport \"./fmt\" for Fmt\n\nvar CURLOPT_URL = 10002\nvar CURLOPT_FOLLOWLOCATION = 52\nvar CURLOPT_WRITEFUNCTION = 20011\nvar CURLOPT_WRITEDATA = 10001\n\nforeign class Buffer {\n construct new() {} // C will allocate buffer of a suitable size\n\n foreign value // returns buffer contents as a string\n}\n\nforeign class Curl {\n construct easyInit() {}\n\n foreign easySetOpt(opt, param)\n\n foreign easyPerform()\n\n foreign easyCleanup()\n}\n\nvar curl = Curl.easyInit()\n\nvar getContent = Fn.new { |url|\n var buffer = Buffer.new()\n curl.easySetOpt(CURLOPT_URL, url)\n curl.easySetOpt(CURLOPT_FOLLOWLOCATION, 1)\n curl.easySetOpt(CURLOPT_WRITEFUNCTION, 0) // write function to be supplied by C\n curl.easySetOpt(CURLOPT_WRITEDATA, buffer)\n curl.easyPerform()\n return buffer.value\n}\n\nvar p = Pattern.new(\" User\\\">[+1^<]<//a>\\u200f\\u200e ([#13/d] member~s)\")\nvar url = \"https://rosettacode.org/w/index.php?title=Special:Categories&limit=5000\"\nvar content = getContent.call(url)\nvar matches = p.findAll(content)\nvar over100s = []\nfor (m in matches) {\n var numUsers = Num.fromString(m.capsText[1])\n if (numUsers >= 100) {\n var language = m.capsText[0][0..-6]\n over100s.add([language, numUsers])\n }\n}\nover100s.sort { |a, b| a[1] > b[1] }\nSystem.print(\"Languages with at least 100 users as at 3 February, 2024:\")\nvar rank = 0\nvar lastScore = 0\nvar lastRank = 0\nfor (i in 0...over100s.count) {\n var pair = over100s[i]\n var eq = \" \"\n rank = i + 1\n if (lastScore == pair[1]) {\n eq = \"=\"\n rank = lastRank\n } else {\n lastScore = pair[1]\n lastRank = rank\n }\n Fmt.print(\"$-2d$s $-11s $d\", rank, eq, pair[0], pair[1])\n}\n","language":"Wren"},{"code":"/* gcc Rosetta_Code_Rank_languages_by_number_of_users.c -o Rosetta_Code_Rank_languages_by_number_of_users -lcurl -lwren -lm */\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <curl/curl.h>\n#include \"wren.h\"\n\nstruct MemoryStruct {\n char *memory;\n size_t size;\n};\n\n/* C <=> Wren interface functions */\n\nstatic size_t WriteMemoryCallback(void *contents, size_t size, size_t nmemb, void *userp) {\n size_t realsize = size * nmemb;\n struct MemoryStruct *mem = (struct MemoryStruct *)userp;\n\n char *ptr = realloc(mem->memory, mem->size + realsize + 1);\n if(!ptr) {\n /* out of memory! */\n printf(\"not enough memory (realloc returned NULL)\\n\");\n return 0;\n }\n\n mem->memory = ptr;\n memcpy(&(mem->memory[mem->size]), contents, realsize);\n mem->size += realsize;\n mem->memory[mem->size] = 0;\n return realsize;\n}\n\nvoid C_bufferAllocate(WrenVM* vm) {\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenSetSlotNewForeign(vm, 0, 0, sizeof(struct MemoryStruct));\n ms->memory = malloc(1);\n ms->size = 0;\n}\n\nvoid C_bufferFinalize(void* data) {\n struct MemoryStruct *ms = (struct MemoryStruct *)data;\n free(ms->memory);\n}\n\nvoid C_curlAllocate(WrenVM* vm) {\n CURL** pcurl = (CURL**)wrenSetSlotNewForeign(vm, 0, 0, sizeof(CURL*));\n *pcurl = curl_easy_init();\n}\n\nvoid C_value(WrenVM* vm) {\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 0);\n wrenSetSlotString(vm, 0, ms->memory);\n}\n\nvoid C_easyPerform(WrenVM* vm) {\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\n curl_easy_perform(curl);\n}\n\nvoid C_easyCleanup(WrenVM* vm) {\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\n curl_easy_cleanup(curl);\n}\n\nvoid C_easySetOpt(WrenVM* vm) {\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\n CURLoption opt = (CURLoption)wrenGetSlotDouble(vm, 1);\n if (opt < 10000) {\n long lparam = (long)wrenGetSlotDouble(vm, 2);\n curl_easy_setopt(curl, opt, lparam);\n } else if (opt < 20000) {\n if (opt == CURLOPT_WRITEDATA) {\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 2);\n curl_easy_setopt(curl, opt, (void *)ms);\n } else if (opt == CURLOPT_URL) {\n const char *url = wrenGetSlotString(vm, 2);\n curl_easy_setopt(curl, opt, url);\n }\n } else if (opt < 30000) {\n if (opt == CURLOPT_WRITEFUNCTION) {\n curl_easy_setopt(curl, opt, &WriteMemoryCallback);\n }\n }\n}\n\nWrenForeignClassMethods bindForeignClass(WrenVM* vm, const char* module, const char* className) {\n WrenForeignClassMethods methods;\n methods.allocate = NULL;\n methods.finalize = NULL;\n if (strcmp(module, \"main\") == 0) {\n if (strcmp(className, \"Buffer\") == 0) {\n methods.allocate = C_bufferAllocate;\n methods.finalize = C_bufferFinalize;\n } else if (strcmp(className, \"Curl\") == 0) {\n methods.allocate = C_curlAllocate;\n }\n }\n return methods;\n}\n\nWrenForeignMethodFn bindForeignMethod(\n WrenVM* vm,\n const char* module,\n const char* className,\n bool isStatic,\n const char* signature) {\n if (strcmp(module, \"main\") == 0) {\n if (strcmp(className, \"Buffer\") == 0) {\n if (!isStatic && strcmp(signature, \"value\") == 0) return C_value;\n } else if (strcmp(className, \"Curl\") == 0) {\n if (!isStatic && strcmp(signature, \"easySetOpt(_,_)\") == 0) return C_easySetOpt;\n if (!isStatic && strcmp(signature, \"easyPerform()\") == 0) return C_easyPerform;\n if (!isStatic && strcmp(signature, \"easyCleanup()\") == 0) return C_easyCleanup;\n }\n }\n return NULL;\n}\n\nstatic void writeFn(WrenVM* vm, const char* text) {\n printf(\"%s\", text);\n}\n\nvoid errorFn(WrenVM* vm, WrenErrorType errorType, const char* module, const int line, const char* msg) {\n switch (errorType) {\n case WREN_ERROR_COMPILE:\n printf(\"[%s line %d] [Error] %s\\n\", module, line, msg);\n break;\n case WREN_ERROR_STACK_TRACE:\n printf(\"[%s line %d] in %s\\n\", module, line, msg);\n break;\n case WREN_ERROR_RUNTIME:\n printf(\"[Runtime Error] %s\\n\", msg);\n break;\n }\n}\n\nchar *readFile(const char *fileName) {\n FILE *f = fopen(fileName, \"r\");\n fseek(f, 0, SEEK_END);\n long fsize = ftell(f);\n rewind(f);\n char *script = malloc(fsize + 1);\n fread(script, 1, fsize, f);\n fclose(f);\n script[fsize] = 0;\n return script;\n}\n\nstatic void loadModuleComplete(WrenVM* vm, const char* module, WrenLoadModuleResult result) {\n if( result.source) free((void*)result.source);\n}\n\nWrenLoadModuleResult loadModule(WrenVM* vm, const char* name) {\n WrenLoadModuleResult result = {0};\n if (strcmp(name, \"random\") != 0 && strcmp(name, \"meta\") != 0) {\n result.onComplete = loadModuleComplete;\n char fullName[strlen(name) + 6];\n strcpy(fullName, name);\n strcat(fullName, \".wren\");\n result.source = readFile(fullName);\n }\n return result;\n}\n\nint main(int argc, char **argv) {\n WrenConfiguration config;\n wrenInitConfiguration(&config);\n config.writeFn = &writeFn;\n config.errorFn = &errorFn;\n config.bindForeignClassFn = &bindForeignClass;\n config.bindForeignMethodFn = &bindForeignMethod;\n config.loadModuleFn = &loadModule;\n WrenVM* vm = wrenNewVM(&config);\n const char* module = \"main\";\n const char* fileName = \"Rosetta_Code_Rank_languages_by_number_of_users.wren\";\n char *script = readFile(fileName);\n WrenInterpretResult result = wrenInterpret(vm, module, script);\n switch (result) {\n case WREN_RESULT_COMPILE_ERROR:\n printf(\"Compile Error!\\n\");\n break;\n case WREN_RESULT_RUNTIME_ERROR:\n printf(\"Runtime Error!\\n\");\n break;\n case WREN_RESULT_SUCCESS:\n break;\n }\n wrenFreeVM(vm);\n free(script);\n return 0;\n}\n","language":"Wren"},{"code":"const MIN_USERS=60;\nvar [const] CURL=Import(\"zklCurl\"), YAJL=Import(\"zklYAJL\")[0];\n\nfcn rsGet{\n continueValue,r,curl := \"\",List, CURL();\n do{\t// eg 5 times\n page:=(\"http://rosettacode.org/mw/api.php?action=query\"\n \"&generator=categorymembers&prop=categoryinfo\"\n\t\"&gcmtitle=Category%%3ALanguage%%20users\"\n\t\"&rawcontinue=&format=json&gcmlimit=350\"\n\t\"%s\").fmt(continueValue);\n page=curl.get(page);\n page=page[0].del(0,page[1]); // get rid of HTML header\n json:=YAJL().write(page).close();\n json[\"query\"][\"pages\"].pump(r.append,'wrap(x){ x=x[1];\n //(\"2708\",Dictionary(title:Category:C User,...,categoryinfo:D(pages:373,size:373,...)))\n\t // or title:SmartBASIC\n\t if((pgs:=x.find(\"categoryinfo\")) and (pgs=pgs.find(\"pages\")) and\n\t pgs>=MIN_USERS)\n\t return(pgs,x[\"title\"].replace(\"Category:\",\"\").replace(\" User\",\"\"));\n\t return(Void.Skip);\n });\n if(continueValue=json.find(\"query-continue\",\"\"))\n continueValue=String(\"&gcmcontinue=\",\n\t continueValue[\"categorymembers\"][\"gcmcontinue\"]);\n }while(continueValue);\n r\n}\n\nallLangs:=rsGet();\nallLangs=allLangs.sort(fcn(a,b){ a[0]>b[0] });\nprintln(\"========== \",Time.Date.prettyDay(),\" ==========\");\nforeach n,pgnm in ([1..].zip(allLangs))\n { println(\"#%3d with %4s users: %s\".fmt(n,pgnm.xplode())) }\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Text processing\\n- Networking and Web Interaction\\n- Sorting\\n- Rosetta Code related\\nfrom: http://rosettacode.org/wiki/Rosetta_Code/Rank_languages_by_number_of_users\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nSort most popular programming languages based on the number of users on Rosetta Code. \\n\\nShow the languages with at least 100 users.\\n\\n\\n;A method to solve the task:\\nUsers of a computer programming language '''X''' are those referenced in the page: \\n https://rosettacode.org/wiki/Category:X_User, or preferably: \\n https://rosettacode.org/mw/index.php?title=Category:X_User&redirect=no to avoid re-directions. \\n\\nIn order to find the list of such categories, it's possible to first parse the entries of: \\n http://rosettacode.org/mw/index.php?title=Special:Categories&limit=5000. \\n\\nThen download and parse each computer language ''users'' category to find the number of users of that computer language.\\n\\n\\nSample output on 18 February 2019:\\n<pre>Language Users\\n--------------------------\\nC 391\\nJava 276\\nC++ 275\\nPython 262\\nJavaScript 238\\nPerl 171\\nPHP 167\\nSQL 138\\nUNIX Shell 131\\nBASIC 120\\nC sharp 118\\nPascal 116\\nHaskell 102</pre>\\n\\nA Rosetta Code user usually declares using a language with the [[Template:Mylang|mylang]] template. This template is expected to appear on the User page. However, in some cases it appears in a user Talk page. It's not necessary to take this into account. For instance, among the 373 C users in the table above, 3 are actually declared in a Talk page.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"io/ioutil\\\"\\n \\\"net/http\\\"\\n \\\"regexp\\\"\\n \\\"sort\\\"\\n \\\"strconv\\\"\\n)\\n\\ntype Result struct {\\n lang string\\n users int\\n}\\n\\nfunc main() {\\n const minimum = 25\\n ex := `\\\"Category:(.+?)( User)?\\\"(\\\\}|,\\\"categoryinfo\\\":\\\\{\\\"size\\\":(\\\\d+),)`\\n re := regexp.MustCompile(ex)\\n page := \\\"http://rosettacode.org/mw/api.php?\\\"\\n action := \\\"action=query\\\"\\n format := \\\"format=json\\\"\\n fversion := \\\"formatversion=2\\\"\\n generator := \\\"generator=categorymembers\\\"\\n gcmTitle := \\\"gcmtitle=Category:Language%20users\\\"\\n gcmLimit := \\\"gcmlimit=500\\\"\\n prop := \\\"prop=categoryinfo\\\"\\n rawContinue := \\\"rawcontinue=\\\"\\n page += fmt.Sprintf(\\\"%s&%s&%s&%s&%s&%s&%s&%s\\\", action, format, fversion,\\n generator, gcmTitle, gcmLimit, prop, rawContinue)\\n resp, _ := http.Get(page)\\n body, _ := ioutil.ReadAll(resp.Body)\\n matches := re.FindAllStringSubmatch(string(body), -1)\\n resp.Body.Close()\\n var results []Result\\n for _, match := range matches {\\n if len(match) == 5 {\\n users, _ := strconv.Atoi(match[4])\\n if users >= minimum {\\n result := Result{match[1], users}\\n results = append(results, result)\\n }\\n }\\n }\\n sort.Slice(results, func(i, j int) bool {\\n return results[j].users < results[i].users\\n })\\n\\n fmt.Println(\\\"Rank Users Language\\\")\\n fmt.Println(\\\"---- ----- --------\\\")\\n rank := 0\\n lastUsers := 0\\n lastRank := 0\\n for i, result := range results {\\n eq := \\\" \\\"\\n rank = i + 1\\n if lastUsers == result.users {\\n eq = \\\"=\\\"\\n rank = lastRank\\n } else {\\n lastUsers = result.users\\n lastRank = rank\\n }\\n fmt.Printf(\\\" %-2d%s %3d %s\\\\n\\\", rank, eq, result.users, result.lang)\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"\\\"\\\"\\\" Rank languages on Rosetta Code's site by number of users.\\\"\\\"\\\"\\n\\nusing Dates\\nusing HTTP\\nusing JSON3\\n\\nconst URL = \\\"https://rosettacode.org/w/api.php?\\\"\\nconst PARAMS = [\\\"action\\\" => \\\"query\\\", \\\"format\\\" => \\\"json\\\", \\\"formatversion\\\" => \\\"2\\\", \\\"generator\\\" => \\\"categorymembers\\\",\\n \\\"gcmtitle\\\" => \\\"Category:Language%20users\\\", \\\"gcmlimit\\\" => \\\"500\\\", \\\"rawcontinue\\\" => \\\"\\\", \\\"prop\\\" => \\\"categoryinfo\\\"]\\n\\nconst resp = HTTP.get(URL * join(map(p -> p[1] * (p[2] == \\\"\\\" ? \\\"\\\" : (\\\"=\\\" * p[2])), PARAMS), \\\"&\\\"))\\nconst counts = Pair{Int, String}[]\\n\\nfor p in JSON3.read(String(resp.body)).query.pages\\n contains(p.title, \\\"Category\\\") && push!(counts, p.categoryinfo.size => p.title)\\nend\\n\\nprintln(\\\"Date: \\\", now(), \\\"\\\\nLanguage Users\\\\n----------------------\\\")\\nfor p in sort!(filter(p -> p[1] >= 100, counts), rev = true)\\n println(rpad(replace(p[2], r\\\"Category:(.+) User\\\" => s\\\"\\\\1\\\"), 16), lpad(p[1], 4))\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import algorithm, httpclient, json, strformat, strscans, strutils\\n\\nconst\\n Action = \\\"action=query\\\"\\n Format = \\\"format=json\\\"\\n FormatVersion = \\\"formatversion=2\\\"\\n Generator = \\\"generator=categorymembers\\\"\\n GcmTitle = \\\"gcmtitle=Category:Language%20users\\\"\\n GcmLimit = \\\"gcmlimit=500\\\"\\n Prop = \\\"prop=categoryinfo\\\"\\n\\n Page = \\\"http://rosettacode.org/w/api.php?\\\" &\\n [Action, Format, Formatversion, Generator, GcmTitle, GcmLimit, Prop].join(\\\"&\\\")\\n\\ntype Counts = tuple[lang: string, count: int]\\n\\nproc cmp(a, b: Counts): int =\\n ## Compare two count tuples. Place the one with greater count field first and when\\n ## count fields are equal, place the one with the first name in alphabetic order.\\n result = cmp(b.count, a.count)\\n if result == 0: result = cmp(a.lang, b.lang)\\n\\nvar client = newHttpClient()\\nvar counts: seq[Counts]\\nvar url = Page\\n\\nwhile true:\\n\\n # Access to the page and load the JSON representation.\\n let response = client.get(url)\\n if response.status != $Http200: break\\n let root = response.body.parseJson()\\n\\n # Extract language names and number of users.\\n for node in root{\\\"query\\\", \\\"pages\\\"}:\\n var lang: string\\n if node[\\\"title\\\"].getStr().scanf(\\\"Category:$+ User\\\", lang):\\n let count = node{\\\"categoryinfo\\\", \\\"size\\\"}.getInt()\\n counts.add (lang, count)\\n if \\\"continue\\\" notin root: break\\n\\n # Load continuation page.\\n let gcmcont = root{\\\"continue\\\", \\\"gcmcontinue\\\"}.getStr()\\n let cont = root{\\\"continue\\\", \\\"continue\\\"}.getStr()\\n url = Page & fmt\\\"&gcmcontinue={gcmcont}&continue={cont}\\\"\\n\\n# Sort and display.\\ncounts.sort(cmp)\\nvar rank, lastCount = 0\\nfor i, (lang, count) in counts:\\n if count != lastCount:\\n rank = i + 1\\n lastCount = count\\n echo &\\\"{rank:3} {count:4} - {lang}\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse JSON;\\nuse URI::Escape;\\nuse LWP::UserAgent;\\n\\nmy $client = LWP::UserAgent->new;\\n$client->agent(\\\"Rosettacode Perl task solver\\\");\\nmy $url = 'http://rosettacode.org/mw';\\nmy $minimum = 100;\\n\\nsub uri_query_string {\\n my(%fields) = @_;\\n 'action=query&format=json&formatversion=2&' .\\n join '&', map { $_ . '=' . uri_escape($fields{$_}) } keys %fields\\n}\\n\\nsub mediawiki_query {\\n my($site, $type, %query) = @_;\\n my $url = \\\"$site/api.php?\\\" . uri_query_string(%query);\\n my %languages = ();\\n\\n my $req = HTTP::Request->new( GET => $url );\\n my $response = $client->request($req);\\n $response->is_success or die \\\"Failed to GET '$url': \\\", $response->status_line;\\n my $data = decode_json($response->content);\\n for my $row ( @{${$data}{query}{pages}} ) {\\n next unless defined $$row{categoryinfo} && $$row{title} =~ /User/;\\n my($title) = $$row{title} =~ /Category:(.*?) User/;\\n my($count) = $$row{categoryinfo}{pages};\\n $languages{$title} = $count;\\n }\\n %languages;\\n}\\n\\nmy %table = mediawiki_query(\\n $url, 'pages',\\n ( generator => 'categorymembers',\\n gcmtitle => 'Category:Language users',\\n gcmlimit => '999',\\n prop => 'categoryinfo',\\n rawcontinue => '',\\n )\\n);\\n\\nfor my $k (sort { $table{$b} <=> $table{$a} } keys %table) {\\n printf \\\"%4d %s\\\\n\\\", $table{$k}, $k if $table{$k} > $minimum;\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"\\\"\\\"\\\"Rank languages by number of users. Requires Python >=3.5\\\"\\\"\\\"\\n\\nimport requests\\n\\n# MediaWiki API URL.\\nURL = \\\"http://rosettacode.org/mw/api.php\\\"\\n\\n# Query string parameters\\nPARAMS = {\\n \\\"action\\\": \\\"query\\\",\\n \\\"format\\\": \\\"json\\\",\\n \\\"formatversion\\\": 2,\\n \\\"generator\\\": \\\"categorymembers\\\",\\n \\\"gcmtitle\\\": \\\"Category:Language users\\\",\\n \\\"gcmlimit\\\": 500,\\n \\\"prop\\\": \\\"categoryinfo\\\",\\n}\\n\\n\\ndef fetch_data():\\n counts = {}\\n continue_ = {\\\"continue\\\": \\\"\\\"}\\n\\n # Keep making HTTP requests to the MediaWiki API if more records are\\n # available.\\n while continue_:\\n resp = requests.get(URL, params={**PARAMS, **continue_})\\n resp.raise_for_status()\\n\\n data = resp.json()\\n\\n # Grab the title (language) and size (count) only.\\n counts.update(\\n {\\n p[\\\"title\\\"]: p.get(\\\"categoryinfo\\\", {}).get(\\\"size\\\", 0)\\n for p in data[\\\"query\\\"][\\\"pages\\\"]\\n }\\n )\\n\\n continue_ = data.get(\\\"continue\\\", {})\\n\\n return counts\\n\\n\\nif __name__ == \\\"__main__\\\":\\n # Request data from the MediaWiki API.\\n counts = fetch_data()\\n\\n # Filter out languages that have less than 100 users.\\n at_least_100 = [(lang, count) for lang, count in counts.items() if count >= 100]\\n\\n # Sort languages by number of users\\n top_languages = sorted(at_least_100, key=lambda x: x[1], reverse=True)\\n\\n # Pretty print\\n for i, lang in enumerate(top_languages):\\n print(f\\\"{i+1:<5}{lang[0][9:][:-5]:<20}{lang[1]}\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require racket/hash\\n net/url\\n json)\\n\\n(define limit 64)\\n(define (replacer cat) (regexp-replace #rx\\\"^Category:(.*?) User$\\\" cat \\\"\\\\\\\\1\\\"))\\n(define category \\\"Category:Language users\\\")\\n(define entries \\\"users\\\")\\n\\n(define api-url (string->url \\\"http://rosettacode.org/mw/api.php\\\"))\\n(define (make-complete-url gcmcontinue)\\n (struct-copy url api-url\\n [query `([format . \\\"json\\\"]\\n [action . \\\"query\\\"]\\n [generator . \\\"categorymembers\\\"]\\n [gcmtitle . ,category]\\n [gcmlimit . \\\"200\\\"]\\n [gcmcontinue . ,gcmcontinue]\\n [continue . \\\"\\\"]\\n [prop . \\\"categoryinfo\\\"])]))\\n\\n(define @ hash-ref)\\n\\n(define table (make-hash))\\n\\n(let loop ([gcmcontinue \\\"\\\"])\\n (define resp (read-json (get-pure-port (make-complete-url gcmcontinue))))\\n (hash-union! table\\n (for/hash ([(k v) (in-hash (@ (@ resp 'query) 'pages))])\\n (values (@ v 'title #f) (@ (@ v 'categoryinfo (hash)) 'size 0))))\\n (cond [(@ resp 'continue #f) => (λ (c) (loop (@ c 'gcmcontinue)))]))\\n\\n(for/fold ([prev #f] [rank #f] #:result (void))\\n ([item (in-list (sort (hash->list table) > #:key cdr))] [i (in-range limit)])\\n (match-define (cons cat size) item)\\n (define this-rank (if (equal? prev size) rank (add1 i)))\\n (printf \\\"Rank: ~a ~a ~a\\\\n\\\"\\n (~a this-rank #:align 'right #:min-width 2)\\n (~a (format \\\"(~a ~a)\\\" size entries) #:align 'right #:min-width 14)\\n (replacer cat))\\n (values size this-rank))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use HTTP::UserAgent;\\nuse URI::Escape;\\nuse JSON::Fast;\\n\\nmy $client = HTTP::UserAgent.new;\\n\\nmy $url = 'https://rosettacode.org/w';\\n\\nmy $start-time = now;\\n\\nsay \\\"========= Generated: { DateTime.new(time) } =========\\\";\\n\\nmy $lang = 1;\\nmy $rank = 0;\\nmy $last = 0;\\nmy $tie = ' ';\\nmy $minimum = 25;\\n\\n.say for\\n mediawiki-query(\\n $url, 'pages',\\n :generator<categorymembers>,\\n :gcmtitle<Category:Language users>,\\n :gcmlimit<350>,\\n :rawcontinue(),\\n :prop<categoryinfo>\\n )\\n\\n .map({ %( count => .<categoryinfo><pages> || 0,\\n lang => .<title>.subst(/^'Category:' (.+) ' User'/, ->$/ {$0}) ) })\\n\\n .sort( { -.<count>, .<syntaxhighlight lang=\\\"text\\\"> } )\\n\\n .map( { last if .<count> < $minimum; display(.<count>, .<syntaxhighlight lang=\\\"text\\\">) } );\\n\\nsay \\\"========= elapsed: {(now - $start-time).round(.01)} seconds =========\\\";\\n\\nsub display ($count, $which) {\\n if $last != $count { $last = $count; $rank = $lang; $tie = ' ' } else { $tie = 'T' };\\n sprintf \\\"#%3d Rank: %2d %s with %-4s users: %s\\\", $lang++, $rank, $tie, $count, $which;\\n}\\n\\nsub mediawiki-query ($site, $type, *%query) {\\n my $url = \\\"$site/api.php?\\\" ~ uri-query-string(\\n :action<query>, :format<json>, :formatversion<2>, |%query);\\n my $continue = '';\\n\\n gather loop {\\n my $response = $client.get(\\\"$url&$continue\\\");\\n my $data = from-json($response.content);\\n take $_ for $data.<query>.{$type}.values;\\n $continue = uri-query-string |($data.<query-continue>{*}».hash.hash or last);\\n }\\n}\\n\\nsub uri-query-string (*%fields) {\\n join '&', %fields.map: { \\\"{.key}={uri-escape .value}\\\" }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program reads 2 files & displays a ranked list of Rosetta Code languages by users*/\\nparse arg catFID lanFID outFID . /*obtain optional arguments from the CL*/\\ncall init /*initialize some REXX variables. */\\ncall get /*obtain data from two separate files. */\\ncall eSort #,0 /*sort languages along with members. */\\ncall tSort /* \\\" \\\" that are tied in rank.*/\\ncall eSort #,1 /* \\\" \\\" along with members. */\\ncall out /*create the RC_USER.OUT (output) file.*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncommas: parse arg _; do jc=length(_)-3 to 1 by -3; _= insert(\\\",\\\",_,jc); end; return _\\ns: if arg(1)==1 then return arg(3); return word(arg(2) 's',1) /*pluralizer.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\neSort: procedure expose #. @. !tr.; arg N,p2; h= N /*sort: number of members*/\\n do while h>1; h= h % 2 /*halve number of records*/\\n do i=1 for N-h; j= i; k= h + i /*sort this part of list.*/\\n if p2 then do while !tR.k==!tR.j & @.k>@.j /*this uses a hard swap ↓*/\\n @= @.j; #= !tR.j; @.j= @.k; !tR.j= !tR.k; @.k= @; !tR.k= #\\n if h>=j then leave; j= j - h; k= k - h\\n end /*while !tR.k==···*/\\n else do while #.k<#.j /*this uses a hard swap ↓*/\\n @= @.j; #= #.j; @.j= @.k; #.j= #.k; @.k= @; #.k= #\\n if h>=j then leave; j= j - h; k= k - h\\n end /*while #.k<···*/\\n end /*i*/ /*hard swaps needed for embedded blanks.*/\\n end /*while h>1*/; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nget: langs= 0; call rdr 'languages' /*assign languages ───► L.ααα */\\n call rdr 'categories' /*append categories ───► catHeap */\\n #= 0\\n do j=1 until catHeap=='' /*process the heap of categories. */\\n parse var catHeap cat.j (sep) catHeap /*get a category from the catHeap. */\\n parse var cat.j cat.j '<' \\\"(\\\" mems . /*untangle the strange─looking string. */\\n cat.j= space(cat.j); ?=cat.j; upper ? /*remove any superfluous blanks. */\\n if ?=='' | \\\\L.? then iterate /*it's blank or it's not a language. */\\n if pos(',', mems)\\\\==0 then mems= space(translate(mems,,\\\",\\\"), 0) /*¬commas.*/\\n if \\\\datatype(mems, 'W') then iterate /*is the \\\"members\\\" number not numeric? */\\n #.0= #.0 + mems /*bump the number of members found. */\\n if u.?\\\\==0 then do; do f=1 for # until ?==@u.f\\n end /*f*/\\n #.f= #.f + mems; iterate j /*languages in different cases.*/\\n end /* [↑] handle any possible duplicates.*/\\n u.?= u.? + 1; #= # + 1 /*bump a couple of counters. */\\n #.#= #.# + mems; @.#= cat.j; @u.#=? /*bump the counter; assign it (upper).*/\\n end /*j*/\\n\\n !.=; @tno= '(total) number of' /*array holds indication of TIED langs.*/\\n call tell right(commas(#), 9) @tno 'languages detected in the category file'\\n call tell right(commas(langs),9) ' \\\" \\\" \\\" \\\" \\\" \\\" \\\" language \\\"'\\n call tell right(commas(#.0), 9) @tno 'entries (users of lanugages) detected', , 1\\n term= 0\\n return /*don't show any more msgs──►term. [↑] */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ninit: sep= '█'; L.=0; #.=0; u.=#.; catHeap=; term=1; old.= /*assign some REXX vars*/\\n if catFID=='' then catFID= \\\"RC_USER.CAT\\\" /*Not specified? Then use the default.*/\\n if lanFID=='' then lanFID= \\\"RC_USER.LAN\\\" /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n if outFID=='' then outFID= \\\"RC_USER.OUT\\\" /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n call tell center('timestamp: ' date() time(\\\"Civil\\\"),79,'═'), 2, 1; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nout: w= length( commas(#) ); rank= 0 /* [↓] show by ascending rank of lang.*/\\n do t=# by -1 for #; rank= rank + 1 /*bump rank of a programming language. */\\n call tell right('rank:' right(commas(!tR.t), w), 20-1) right(!.t, 7),\\n right('('commas(#.t) left(\\\"entr\\\"s(#.t, 'ies', \\\"y\\\")')', 9), 20) @.t\\n end /*#*/ /* [↑] S(···) pluralizes a word. */\\n call tell left('', 27) \\\"☼ end─of─list. ☼\\\", 1, 2; return /*bottom title.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nrdr: arg which 2; igAst= 1 /*ARG uppers WHICH, obtain the 1st char*/\\n if which=='L' then inFID= lanFID /*use this fileID for the languages. */\\n if which=='C' then inFID= catFID /* \\\" \\\" \\\" \\\" \\\" categories. */\\n Uyir= 'α«ëα«»α«┐α«░α»ì/Uyir' /*Unicode (in text) name for Uyir */\\n old.0= '╬£C++' ; new.0= \\\"µC++\\\" /*Unicode ╬£C++ ───► ASCII─8: µC++ */\\n old.1= 'UC++' ; new.1= \\\"µC++\\\" /*old UC++ ───► ASCII─8: µC++ */\\n old.2= '╨£╨Ü-' ; new.2= \\\"MK-\\\" /*Unicode ╨£╨Ü─ ───► ASCII-8: MK- */\\n old.3= 'D├⌐j├á' ; new.3= \\\"Déjà\\\" /*Unicode ├⌐j├á ───► ASCII─8: Déjà */\\n old.4= 'Cach├⌐' ; new.4= \\\"Caché\\\" /*Unicode Cach├⌐ ───► ASCII─8: Caché */\\n old.5= '??-61/52' ; new.5= \\\"MK-61/52\\\" /*somewhere past, a mis─translated: MK-*/\\n old.6= 'F┼ìrmul├ª' ; new.6= 'Fôrmulæ' /*Unicode ───► ASCII─8: Fôrmulæ */\\n old.7= '╨£iniZinc' ; new.7= 'MiniZinc' /*Unicode ───► ASCII─8: MiniZinc*/\\n old.8= Uyir ; new.8= 'Uyir' /*Unicode ───► ASCII─8: Uyir */\\n old.9= 'Perl 6' ; new.9= 'Raku' /* (old name) ───► (new name) */\\n\\n do recs=0 while lines(inFID) \\\\== 0 /*read a file, a single line at a time.*/\\n $= translate( linein(inFID), , '9'x) /*handle any stray TAB ('09'x) chars.*/\\n $$= space($); if $$=='' then iterate /*ignore all blank lines in the file(s)*/\\n do v=0 while old.v \\\\== '' /*translate Unicode variations of langs*/\\n if pos(old.v, $$) \\\\==0 then $$= changestr(old.v, $$, new.v)\\n end /*v*/ /* [↑] handle different lang spellings*/\\n if igAst then do; igAst= pos(' * ', $)==0; if igAst then iterate; end\\n if pos('RETRIEVED FROM', translate($$))\\\\==0 then leave /*pseudo End─Of─Data?.*/\\n if which=='L' then do; if left($$, 1)\\\\==\\\"*\\\" then iterate /*lang ¬legitimate?*/\\n parse upper var $$ '*' $$ \\\"<\\\"; $$= space($$)\\n if $$=='' then iterate\\n $$= $$ 'USER'\\n L.$$= 1\\n langs= langs + 1 /*bump # of languages/users found.*/\\n iterate\\n end /* [↓] extract computer language name.*/\\n if left($$, 1)=='*' then $$= sep || space( substr($$, 2) )\\n catHeap= catHeap $$ /*append to the catHeap (CATegory) heap*/\\n end /*recs*/\\n call tell right( commas(recs), 9) 'records read from file: ' inFID\\n return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ntell: do '0'arg(2); call lineout outFID,\\\" \\\" ; if term then say ; end\\n call lineout outFID,arg(1) ; if term then say arg(1)\\n do '0'arg(3); call lineout outFID,\\\" \\\" ; if term then say ; end\\n return /*show BEFORE blank lines (if any), message, show AFTER blank lines.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ntSort: tied=; r= 0 /*add true rank (tR) ───► the entries. */\\n do j=# by -1 for #; r= r+1; tR= r; !tR.j= r; jp= j+1; jm= j-1\\n if tied=='' then pR= r; tied= /*handle when language rank is untied. */\\n if #.j==#.jp | #.j==#.jm then do; !.j= '[tied]'; tied= !.j; end\\n if #.j==#.jp then do; tR= pR; !tR.j= pR; end\\n else pR= r\\n end /*j*/; return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"copy \\\"http://rosettacode.org/mw/index.php?title=Special:Categories&limit=5000\\\" categ.html, replace\\nimport delimited categ.html, delim(\\\"@\\\") enc(\\\"utf-8\\\") clear\\nkeep if ustrpos(v1,\\\"/wiki/Category:\\\") & ustrpos(v1,\\\"_User\\\")\\ngen i = ustrpos(v1,\\\"href=\\\")\\ngen j = ustrpos(v1,char(34),i+1)\\ngen k = ustrpos(v1,char(34),j+1)\\ngen s = usubstr(v1,j+7,k-j-7)\\nreplace i = ustrpos(v1,\\\"title=\\\")\\nreplace j = ustrpos(v1,\\\">\\\",i+1)\\nreplace k = ustrpos(v1,\\\" User\\\",j+1)\\ngen lang = usubstr(v1,j+1,k-j)\\nkeep s lang\\ngen users=.\\n\\nforval i=1/`c(N)' {\\n\\tlocal s\\n\\tpreserve\\n\\tcopy `\\\"https://rosettacode.org/mw/index.php?title=`=s[`i']'&redirect=no\\\"' `i'.html, replace\\n\\timport delimited `i'.html, delim(\\\"@\\\") enc(\\\"utf-8\\\") clear\\n\\tcount if ustrpos(v1,\\\"/wiki/User\\\")\\n\\tlocal m `r(N)'\\n\\trestore\\n\\treplace users=`m' in `i'\\n\\terase `i'.html\\n}\\n\\ndrop s\\ngsort -users lang\\ncompress\\nleftalign\\nlist in f/50\\nsave rc_users, replace\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"/* Rosetta_Code_Rank_languages_by_number_of_users.wren */\\n\\nimport \\\"./pattern\\\" for Pattern\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar CURLOPT_URL = 10002\\nvar CURLOPT_FOLLOWLOCATION = 52\\nvar CURLOPT_WRITEFUNCTION = 20011\\nvar CURLOPT_WRITEDATA = 10001\\n\\nforeign class Buffer {\\n construct new() {} // C will allocate buffer of a suitable size\\n\\n foreign value // returns buffer contents as a string\\n}\\n\\nforeign class Curl {\\n construct easyInit() {}\\n\\n foreign easySetOpt(opt, param)\\n\\n foreign easyPerform()\\n\\n foreign easyCleanup()\\n}\\n\\nvar curl = Curl.easyInit()\\n\\nvar getContent = Fn.new { |url|\\n var buffer = Buffer.new()\\n curl.easySetOpt(CURLOPT_URL, url)\\n curl.easySetOpt(CURLOPT_FOLLOWLOCATION, 1)\\n curl.easySetOpt(CURLOPT_WRITEFUNCTION, 0) // write function to be supplied by C\\n curl.easySetOpt(CURLOPT_WRITEDATA, buffer)\\n curl.easyPerform()\\n return buffer.value\\n}\\n\\nvar p = Pattern.new(\\\" User\\\\\\\">[+1^<]<//a>\\\\u200f\\\\u200e ([#13/d] member~s)\\\")\\nvar url = \\\"https://rosettacode.org/w/index.php?title=Special:Categories&limit=5000\\\"\\nvar content = getContent.call(url)\\nvar matches = p.findAll(content)\\nvar over100s = []\\nfor (m in matches) {\\n var numUsers = Num.fromString(m.capsText[1])\\n if (numUsers >= 100) {\\n var language = m.capsText[0][0..-6]\\n over100s.add([language, numUsers])\\n }\\n}\\nover100s.sort { |a, b| a[1] > b[1] }\\nSystem.print(\\\"Languages with at least 100 users as at 3 February, 2024:\\\")\\nvar rank = 0\\nvar lastScore = 0\\nvar lastRank = 0\\nfor (i in 0...over100s.count) {\\n var pair = over100s[i]\\n var eq = \\\" \\\"\\n rank = i + 1\\n if (lastScore == pair[1]) {\\n eq = \\\"=\\\"\\n rank = lastRank\\n } else {\\n lastScore = pair[1]\\n lastRank = rank\\n }\\n Fmt.print(\\\"$-2d$s $-11s $d\\\", rank, eq, pair[0], pair[1])\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"/* gcc Rosetta_Code_Rank_languages_by_number_of_users.c -o Rosetta_Code_Rank_languages_by_number_of_users -lcurl -lwren -lm */\\n\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <curl/curl.h>\\n#include \\\"wren.h\\\"\\n\\nstruct MemoryStruct {\\n char *memory;\\n size_t size;\\n};\\n\\n/* C <=> Wren interface functions */\\n\\nstatic size_t WriteMemoryCallback(void *contents, size_t size, size_t nmemb, void *userp) {\\n size_t realsize = size * nmemb;\\n struct MemoryStruct *mem = (struct MemoryStruct *)userp;\\n\\n char *ptr = realloc(mem->memory, mem->size + realsize + 1);\\n if(!ptr) {\\n /* out of memory! */\\n printf(\\\"not enough memory (realloc returned NULL)\\\\n\\\");\\n return 0;\\n }\\n\\n mem->memory = ptr;\\n memcpy(&(mem->memory[mem->size]), contents, realsize);\\n mem->size += realsize;\\n mem->memory[mem->size] = 0;\\n return realsize;\\n}\\n\\nvoid C_bufferAllocate(WrenVM* vm) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenSetSlotNewForeign(vm, 0, 0, sizeof(struct MemoryStruct));\\n ms->memory = malloc(1);\\n ms->size = 0;\\n}\\n\\nvoid C_bufferFinalize(void* data) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)data;\\n free(ms->memory);\\n}\\n\\nvoid C_curlAllocate(WrenVM* vm) {\\n CURL** pcurl = (CURL**)wrenSetSlotNewForeign(vm, 0, 0, sizeof(CURL*));\\n *pcurl = curl_easy_init();\\n}\\n\\nvoid C_value(WrenVM* vm) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 0);\\n wrenSetSlotString(vm, 0, ms->memory);\\n}\\n\\nvoid C_easyPerform(WrenVM* vm) {\\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\\n curl_easy_perform(curl);\\n}\\n\\nvoid C_easyCleanup(WrenVM* vm) {\\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\\n curl_easy_cleanup(curl);\\n}\\n\\nvoid C_easySetOpt(WrenVM* vm) {\\n CURL* curl = *(CURL**)wrenGetSlotForeign(vm, 0);\\n CURLoption opt = (CURLoption)wrenGetSlotDouble(vm, 1);\\n if (opt < 10000) {\\n long lparam = (long)wrenGetSlotDouble(vm, 2);\\n curl_easy_setopt(curl, opt, lparam);\\n } else if (opt < 20000) {\\n if (opt == CURLOPT_WRITEDATA) {\\n struct MemoryStruct *ms = (struct MemoryStruct *)wrenGetSlotForeign(vm, 2);\\n curl_easy_setopt(curl, opt, (void *)ms);\\n } else if (opt == CURLOPT_URL) {\\n const char *url = wrenGetSlotString(vm, 2);\\n curl_easy_setopt(curl, opt, url);\\n }\\n } else if (opt < 30000) {\\n if (opt == CURLOPT_WRITEFUNCTION) {\\n curl_easy_setopt(curl, opt, &WriteMemoryCallback);\\n }\\n }\\n}\\n\\nWrenForeignClassMethods bindForeignClass(WrenVM* vm, const char* module, const char* className) {\\n WrenForeignClassMethods methods;\\n methods.allocate = NULL;\\n methods.finalize = NULL;\\n if (strcmp(module, \\\"main\\\") == 0) {\\n if (strcmp(className, \\\"Buffer\\\") == 0) {\\n methods.allocate = C_bufferAllocate;\\n methods.finalize = C_bufferFinalize;\\n } else if (strcmp(className, \\\"Curl\\\") == 0) {\\n methods.allocate = C_curlAllocate;\\n }\\n }\\n return methods;\\n}\\n\\nWrenForeignMethodFn bindForeignMethod(\\n WrenVM* vm,\\n const char* module,\\n const char* className,\\n bool isStatic,\\n const char* signature) {\\n if (strcmp(module, \\\"main\\\") == 0) {\\n if (strcmp(className, \\\"Buffer\\\") == 0) {\\n if (!isStatic && strcmp(signature, \\\"value\\\") == 0) return C_value;\\n } else if (strcmp(className, \\\"Curl\\\") == 0) {\\n if (!isStatic && strcmp(signature, \\\"easySetOpt(_,_)\\\") == 0) return C_easySetOpt;\\n if (!isStatic && strcmp(signature, \\\"easyPerform()\\\") == 0) return C_easyPerform;\\n if (!isStatic && strcmp(signature, \\\"easyCleanup()\\\") == 0) return C_easyCleanup;\\n }\\n }\\n return NULL;\\n}\\n\\nstatic void writeFn(WrenVM* vm, const char* text) {\\n printf(\\\"%s\\\", text);\\n}\\n\\nvoid errorFn(WrenVM* vm, WrenErrorType errorType, const char* module, const int line, const char* msg) {\\n switch (errorType) {\\n case WREN_ERROR_COMPILE:\\n printf(\\\"[%s line %d] [Error] %s\\\\n\\\", module, line, msg);\\n break;\\n case WREN_ERROR_STACK_TRACE:\\n printf(\\\"[%s line %d] in %s\\\\n\\\", module, line, msg);\\n break;\\n case WREN_ERROR_RUNTIME:\\n printf(\\\"[Runtime Error] %s\\\\n\\\", msg);\\n break;\\n }\\n}\\n\\nchar *readFile(const char *fileName) {\\n FILE *f = fopen(fileName, \\\"r\\\");\\n fseek(f, 0, SEEK_END);\\n long fsize = ftell(f);\\n rewind(f);\\n char *script = malloc(fsize + 1);\\n fread(script, 1, fsize, f);\\n fclose(f);\\n script[fsize] = 0;\\n return script;\\n}\\n\\nstatic void loadModuleComplete(WrenVM* vm, const char* module, WrenLoadModuleResult result) {\\n if( result.source) free((void*)result.source);\\n}\\n\\nWrenLoadModuleResult loadModule(WrenVM* vm, const char* name) {\\n WrenLoadModuleResult result = {0};\\n if (strcmp(name, \\\"random\\\") != 0 && strcmp(name, \\\"meta\\\") != 0) {\\n result.onComplete = loadModuleComplete;\\n char fullName[strlen(name) + 6];\\n strcpy(fullName, name);\\n strcat(fullName, \\\".wren\\\");\\n result.source = readFile(fullName);\\n }\\n return result;\\n}\\n\\nint main(int argc, char **argv) {\\n WrenConfiguration config;\\n wrenInitConfiguration(&config);\\n config.writeFn = &writeFn;\\n config.errorFn = &errorFn;\\n config.bindForeignClassFn = &bindForeignClass;\\n config.bindForeignMethodFn = &bindForeignMethod;\\n config.loadModuleFn = &loadModule;\\n WrenVM* vm = wrenNewVM(&config);\\n const char* module = \\\"main\\\";\\n const char* fileName = \\\"Rosetta_Code_Rank_languages_by_number_of_users.wren\\\";\\n char *script = readFile(fileName);\\n WrenInterpretResult result = wrenInterpret(vm, module, script);\\n switch (result) {\\n case WREN_RESULT_COMPILE_ERROR:\\n printf(\\\"Compile Error!\\\\n\\\");\\n break;\\n case WREN_RESULT_RUNTIME_ERROR:\\n printf(\\\"Runtime Error!\\\\n\\\");\\n break;\\n case WREN_RESULT_SUCCESS:\\n break;\\n }\\n wrenFreeVM(vm);\\n free(script);\\n return 0;\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"const MIN_USERS=60;\\nvar [const] CURL=Import(\\\"zklCurl\\\"), YAJL=Import(\\\"zklYAJL\\\")[0];\\n\\nfcn rsGet{\\n continueValue,r,curl := \\\"\\\",List, CURL();\\n do{\\t// eg 5 times\\n page:=(\\\"http://rosettacode.org/mw/api.php?action=query\\\"\\n \\\"&generator=categorymembers&prop=categoryinfo\\\"\\n\\t\\\"&gcmtitle=Category%%3ALanguage%%20users\\\"\\n\\t\\\"&rawcontinue=&format=json&gcmlimit=350\\\"\\n\\t\\\"%s\\\").fmt(continueValue);\\n page=curl.get(page);\\n page=page[0].del(0,page[1]); // get rid of HTML header\\n json:=YAJL().write(page).close();\\n json[\\\"query\\\"][\\\"pages\\\"].pump(r.append,'wrap(x){ x=x[1];\\n //(\\\"2708\\\",Dictionary(title:Category:C User,...,categoryinfo:D(pages:373,size:373,...)))\\n\\t // or title:SmartBASIC\\n\\t if((pgs:=x.find(\\\"categoryinfo\\\")) and (pgs=pgs.find(\\\"pages\\\")) and\\n\\t pgs>=MIN_USERS)\\n\\t return(pgs,x[\\\"title\\\"].replace(\\\"Category:\\\",\\\"\\\").replace(\\\" User\\\",\\\"\\\"));\\n\\t return(Void.Skip);\\n });\\n if(continueValue=json.find(\\\"query-continue\\\",\\\"\\\"))\\n continueValue=String(\\\"&gcmcontinue=\\\",\\n\\t continueValue[\\\"categorymembers\\\"][\\\"gcmcontinue\\\"]);\\n }while(continueValue);\\n r\\n}\\n\\nallLangs:=rsGet();\\nallLangs=allLangs.sort(fcn(a,b){ a[0]>b[0] });\\nprintln(\\\"========== \\\",Time.Date.prettyDay(),\\\" ==========\\\");\\nforeach n,pgnm in ([1..].zip(allLangs))\\n { println(\\\"#%3d with %4s users: %s\\\".fmt(n,pgnm.xplode())) }\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Rosetta-Code-Rank-languages-by-number-of-users"}}},{"rowIdx":1595,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- String_manipulation\nfrom: http://rosettacode.org/wiki/Rot-13\nnote: Encryption\n","language":"00-META"},{"code":";Task:\nImplement a '''rot-13''' function (or procedure, class, subroutine, or other \"callable\" object as appropriate to your programming environment). \n\nOptionally wrap this function in a utility program (like [[:Category:Tr|tr]], which acts like a common [[UNIX]] utility, performing a line-by-line rot-13 encoding of every line of input contained in each file listed on its command line, or (if no filenames are passed thereon) acting as a filter on its \"standard input.\" \n\n\n(A number of UNIX scripting languages and utilities, such as ''awk'' and ''sed'' either default to processing files in this way or have command line switches or modules to easily implement these wrapper semantics, e.g., [[Perl]] and [[Python]]).\n\nThe '''rot-13''' encoding is commonly known from the early days of Usenet \"Netnews\" as a way of obfuscating text to prevent casual reading of [[wp:Spoiler (media)|spoiler]] or potentially offensive material. \n\nMany news reader and mail user agent programs have built-in '''rot-13''' encoder/decoders or have the ability to feed a message through any external utility script for performing this (or other) actions.\n\nThe definition of the rot-13 function is to simply replace every letter of the ASCII alphabet with the letter which is \"rotated\" 13 characters \"around\" the 26 letter alphabet from its normal cardinal position (wrapping around from '''z''' to '''a''' as necessary). \n\nThus the letters '''abc''' become '''nop''' and so on. \n\nTechnically '''rot-13''' is a \"mono-alphabetic substitution cipher\" with a trivial \"key\". \n\nA proper implementation should work on upper and lower case letters, preserve case, and pass all non-alphabetic characters \nin the input stream through without alteration.\n\n\n;Related tasks:\n* [[Caesar cipher]]\n* [[Substitution Cipher]]\n* [[Vigenère Cipher/Cryptanalysis]]\n\n\n{{Template:Strings}}\n<br><br>\n\n","language":"00-TASK"},{"code":"F rot13(string)\n V r = ‘ ’ * string.len\n L(c) string\n r[L.index] = S c\n ‘a’..‘z’\n Char(code' (c.code - ‘a’.code + 13) % 26 + ‘a’.code)\n ‘A’..‘Z’\n Char(code' (c.code - ‘A’.code + 13) % 26 + ‘A’.code)\n E\n c\n R r\n\nprint(rot13(‘foo’))\nprint(rot13(‘sbb’))\n","language":"11l"},{"code":"ROT13 CSECT\n USING ROT13,R15 use calling register\n XPRNT CC,L'CC\n TR CC,TABLE translate\n XPRNT CC,L'CC\n TR CC,TABLE translate\n XPRNT CC,L'CC\n BR R14 return to caller\nCC DC CL10'{NOWHERE!}'\nTABLE DC CL64' '\n* 0123456789ABCDEF\n DC CL16' .<(+|' X'4.'\n DC CL16' !$*);^' X'5.'\n DC CL16'&& ,%_>?' X'6.'\n DC CL16'-/ `:#@''=\"' X'7.'\n DC CL16' nopqrstuv ' X'8.'\n DC CL16' wxyzabcde ' X'9.'\n DC CL16' ~fghijklm [ ' X'A.'\n DC CL16' ] ' X'B.'\n DC CL16'{NOPQRSTUV ' X'C.'\n DC CL16'}WXYZABCDE ' X'D.'\n DC CL16'\\ FGHIJKLM ' X'E.'\n DC CL16'0123456789 ' X'F.'\n* 0123456789ABCDEF\n YREGS\n END ROT13\n","language":"360-Assembly"},{"code":"buffer = $fa ; or anywhere in zero page that's good\nmaxpage = $95 ; if non-terminated that's bad\n\norg $1900\n.rot13\n stx buffer\n sty buffer+1\n ldy #0\n beq readit\n.loop cmp #$7b ; high range\n bcs next ; >= {\n cmp #$41 ; low range\n bcc next ; < A\n cmp #$4e\n bcc add13 ; < N\n cmp #$5b\n bcc sub13set ; < [\n cmp #$61\n bcc next ; < a\n cmp #$6e\n bcs sub13 ; >= n\n.add13 adc #13 ; we only get here via bcc; so clc not needed\n bne storeit\n.sub13set sec ; because we got here via bcc; so sec is needed\n.sub13 sbc #13 ; we can get here via bcs; so sec not needed\n.storeit sta (buffer),y\n.next iny\n bne readit\n ldx buffer+1\n cpx maxpage\n beq done\n inx\n stx buffer+1\n.readit lda (buffer),y ; quit on ascii 0\n bne loop\n.done rts\n.end\nsave \"rot-13\", rot13, end\n","language":"6502-Assembly"},{"code":"/* ARM assembly AARCH64 Raspberry PI 3B */\n/* program rot1364.s */\n/************************************/\n/* Constantes */\n/************************************/\n/* for this file see task include a file in language AArch64 assembly*/\n.include \"../includeConstantesARM64.inc\"\n\n.equ STRINGSIZE, 500\n\n//.include \"../../ficmacros64.inc\"\n/************************************/\n/* Initialized data */\n/************************************/\n.data\nszMessString: .asciz \"String :\\n\"\nszMessEncrip: .asciz \"\\nEncrypted :\\n\"\nszMessDecrip: .asciz \"\\nDecrypted :\\n\"\nszString1: .asciz \"{NOWHERE! abcd xyz 1234}\"\n\nszCarriageReturn: .asciz \"\\n\"\n/************************************/\n/* UnInitialized data */\n/************************************/\n.bss\nszString2: .skip STRINGSIZE\nszString3: .skip STRINGSIZE\n/************************************/\n/* code section */\n/************************************/\n.text\n.global main\nmain:\n\n ldr x0,qAdrszMessString // display message\n bl affichageMess\n ldr x0,qAdrszString1 // display string\n bl affichageMess\n ldr x0,qAdrszString1\n ldr x1,qAdrszString2\n bl encryptRot13\n ldr x0,qAdrszMessEncrip\n bl affichageMess\n ldr x0,qAdrszString2 // display string\n bl affichageMess\n ldr x0,qAdrszString2\n ldr x1,qAdrszString3\n bl decryptRot13\n ldr x0,qAdrszMessDecrip\n bl affichageMess\n ldr x0,qAdrszString3 // display string\n bl affichageMess\n ldr x0,qAdrszCarriageReturn\n bl affichageMess\n100: // standard end of the program\n mov x0, #0 // return code\n mov x8,EXIT\n svc 0 // perform system call\nqAdrszMessString: .quad szMessString\nqAdrszMessDecrip: .quad szMessDecrip\nqAdrszMessEncrip: .quad szMessEncrip\nqAdrszString1: .quad szString1\nqAdrszString2: .quad szString2\nqAdrszString3: .quad szString3\nqAdrszCarriageReturn: .quad szCarriageReturn\n/******************************************************************/\n/* encrypt strings */\n/******************************************************************/\n/* x0 contains the address of the string1 */\n/* x1 contains the address of the encrypted string */\nencryptRot13:\n stp x3,lr,[sp,-16]! // save registers\n stp x4,x5,[sp,-16]! // save registers\n mov x3,#0 // counter byte string 1\n mov x2,#13 // rot characters number\n1:\n ldrb w4,[x0,x3] // load byte string 1\n cmp w4,#0 // zero final ?\n bne 2f\n strb w4,[x1,x3]\n mov x0,x3\n b 100f\n2:\n cmp w4,#65 // < A ?\n bge 3f\n strb w4,[x1,x3]\n add x3,x3,#1\n b 1b // and loop\n3:\n cmp x4,#90 // > Z\n bgt 4f\n add x4,x4,x2 // add key\n cmp x4,#90 // > Z\n sub x5,x4,26\n csel x4,x5,x4,gt\n strb w4,[x1,x3]\n add x3,x3,#1\n b 1b\n4:\n cmp x4,#97 // < a ?\n bge 5f\n strb w4,[x1,x3]\n add x3,x3,#1\n b 1b\n5:\n cmp x4,#122 //> z\n ble 6f\n strb w4,[x1,x3]\n add x3,x3,#1\n b 1b\n6:\n add x4,x4,x2\n cmp x4,#122\n sub x5,x4,26\n csel x4,x5,x4,gt\n strb w4,[x1,x3]\n add x3,x3,#1\n b 1b\n\n100:\n ldp x4,x5,[sp],16 // restaur registers\n ldp x3,lr,[sp],16 // restaur registers\n ret\n/******************************************************************/\n/* decrypt strings */\n/******************************************************************/\n/* x0 contains the address of the encrypted string1 */\n/* x1 contains the address of the decrypted string */\ndecryptRot13:\n stp x3,lr,[sp,-16]! // save registers\n stp x4,x5,[sp,-16]! // save registers\n mov x3,#0 // counter byte string 1\n mov x2,#13 // rot characters number\n1:\n ldrb w4,[x0,x3] // load byte string 1\n cmp w4,#0 // zero final ?\n bne 2f\n strb w4,[x1,x3]\n mov x0,x3\n b 100f\n2:\n cmp x4,#65 // < A ?\n bge 3f\n strb w4,[x1,x3]\n add x3,x3,#1\n b 1b // and loop\n3:\n cmp x4,#90 // > Z\n bgt 4f\n sub x4,x4,x2 // substract key\n cmp x4,#65 // < A\n add x5,x4,26\n csel x4,x5,x4,lt\n strb w4,[x1,x3]\n add x3,x3,#1\n b 1b\n4:\n cmp x4,#97 // < a ?\n bge 5f\n strb w4,[x1,x3]\n add x3,x3,#1\n b 1b\n5:\n cmp x4,#122 // > z\n ble 6f\n strb w4,[x1,x3]\n add x3,x3,#1\n b 1b\n6:\n sub x4,x4,x2 // substract key\n cmp x4,#97 // < a\n add x5,x4,26\n csel x4,x5,x4,lt\n strb w4,[x1,x3]\n add x3,x3,#1\n b 1b\n\n100:\n ldp x4,x5,[sp],16 // restaur registers\n ldp x3,lr,[sp],16 // restaur registers\n ret\n/***************************************************/\n/* ROUTINES INCLUDE */\n/***************************************************/\n/* for this file see task include a file in language AArch64 assembly*/\n.include \"../includeARM64.inc\"\n","language":"AArch64-Assembly"},{"code":"(include-book \"arithmetic-3/top\" :dir :system)\n\n(defun char-btn (c low high)\n (and (char>= c low)\n (char<= c high)))\n\n(defun rot-13-cs (cs)\n (cond ((endp cs) nil)\n ((or (char-btn (first cs) #\\a #\\m)\n (char-btn (first cs) #\\A #\\M))\n (cons (code-char (+ (char-code (first cs)) 13))\n (rot-13-cs (rest cs))))\n ((or (char-btn (first cs) #\\n #\\z)\n (char-btn (first cs) #\\N #\\Z))\n (cons (code-char (- (char-code (first cs)) 13))\n (rot-13-cs (rest cs))))\n (t (cons (first cs) (rot-13-cs (rest cs))))))\n\n(defun rot-13 (s)\n (coerce (rot-13-cs (coerce s 'list)) 'string))\n","language":"ACL2"},{"code":"with Ada.Text_IO.Text_Streams; use Ada.Text_IO.Text_Streams;\nwith Ada.Strings.Maps; use Ada.Strings.Maps;\nwith Ada.Command_Line; use Ada.Command_Line;\n\nprocedure Rot_13 is\n\n From_Sequence : Character_Sequence := \"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n Result_Sequence : Character_Sequence := \"nopqrstuvwxyzabcdefghijklmNOPQRSTUVWXYZABCDEFGHIJKLM\";\n Rot_13_Mapping : Character_Mapping := To_Mapping(From_Sequence, Result_Sequence);\n\n In_Char : Character;\n Stdio : Stream_Access := Stream(Ada.Text_IO.Standard_Input);\n Stdout : Stream_Access := Stream(Ada.Text_Io.Standard_Output);\n Input : Ada.Text_Io.File_Type;\n\nbegin\n if Argument_Count > 0 then\n for I in 1..Argument_Count loop\n begin\n Ada.Text_Io.Open(File => Input, Mode => Ada.Text_Io.In_File, Name => Argument(I));\n Stdio := Stream(Input);\n while not Ada.Text_Io.End_Of_File(Input) loop\n In_Char :=Character'Input(Stdio);\n Character'Output(Stdout, Value(Rot_13_Mapping, In_Char));\n end loop;\n Ada.Text_IO.Close(Input);\n exception\n when Ada.Text_IO.Name_Error =>\n Ada.Text_Io.Put_Line(File => Ada.Text_Io.Standard_Error, Item => \"File \" & Argument(I) & \" is not a file.\");\n when Ada.Text_Io.Status_Error =>\n Ada.Text_Io.Put_Line(File => Ada.Text_Io.Standard_Error, Item => \"File \" & Argument(I) & \" is already opened.\");\n end;\n end loop;\n else\n while not Ada.Text_Io.End_Of_File loop\n In_Char :=Character'Input(Stdio);\n Character'Output(Stdout, Value(Rot_13_Mapping, In_Char));\n end loop;\n end if;\nend Rot_13;\n","language":"Ada"},{"code":"BEGIN\n CHAR c;\n on logical file end(stand in, (REF FILE f)BOOL: (stop; SKIP));\n on line end(stand in, (REF FILE f)BOOL: (print(new line); FALSE));\n DO\n read(c);\n IF c >= \"A\" AND c <= \"M\" OR c >= \"a\" AND c <= \"m\" THEN\n c := REPR(ABS c + 13)\n ELIF c >= \"N\" AND c <= \"Z\" OR c >= \"n\" AND c <= \"z\" THEN\n c := REPR(ABS c - 13)\n FI;\n print(c)\n OD\nEND # rot13 #\n","language":"ALGOL-68"},{"code":"r1 ← ⎕UCS ∘ {+/⍵,13×(⍵≥65)∧(⍵<78),(-(⍵≥78)∧(⍵≤90)),(⍵≥97)∧(⍵<110),(-(⍵≥110)∧(⍵≤122))} ∘ ⎕UCS\nrot13 ← { r1 ¨ ⍵ }\n","language":"APL"},{"code":"r1 ← { ⎕UCS {+/⍵,13×(⍵≥65)∧(⍵<78),(-(⍵≥78)∧(⍵≤90)),(⍵≥97)∧(⍵<110),(-(⍵≥110)∧(⍵≤122))} ⎕UCS ⍵ }\nrot13 ← { r1 ¨ ⍵ }\n","language":"APL"},{"code":"⍝ 2023-03-03\n\nk←'AaBbCcDdEeFfGgHhIiJjKkLlMmzZyYxXwWvVuUtTsSrRqQpPoOnN'\nrot←{⍵∊k:[53-k⍳⍵]⋄⍵}¨\n","language":"APL"},{"code":"to rot13(textString)\n do shell script \"tr a-zA-Z n-za-mN-ZA-M <<<\" & quoted form of textString\nend rot13\n","language":"AppleScript"},{"code":"to rot13(textString)\n set theIDs to id of textString\n repeat with thisID in theIDs\n if (((thisID < 123) and (thisID > 96)) or ((thisID < 91) and (thisID > 64))) then ¬\n tell (thisID mod 32) to set thisID's contents to thisID - it + (it + 12) mod 26 + 1\n end repeat\n\n return string id theIDs\nend rot13\n","language":"AppleScript"},{"code":"rot13(\"nowhere ABJURER\")\n","language":"AppleScript"},{"code":"-- ROT 13 --------------------------------------------------------------------\n\n-- rot13 :: String -> String\non rot13(str)\n script rt13\n on |λ|(x)\n if (x ≥ \"a\" and x ≤ \"m\") or (x ≥ \"A\" and x ≤ \"M\") then\n character id ((id of x) + 13)\n else if (x ≥ \"n\" and x ≤ \"z\") or (x ≥ \"N\" and x ≤ \"Z\") then\n character id ((id of x) - 13)\n else\n x\n end if\n end |λ|\n end script\n\n intercalate(\"\", map(rt13, characters of str))\nend rot13\n\n\n-- TEST ----------------------------------------------------------------------\non run\n rot13(\"nowhere ABJURER\")\n\n --> \"abjurer NOWHERE\"\nend run\n\n\n-- GENERIC FUNCTIONS ---------------------------------------------------------\n\n-- map :: (a -> b) -> [a] -> [b]\non map(f, xs)\n tell mReturn(f)\n set lng to length of xs\n set lst to {}\n repeat with i from 1 to lng\n set end of lst to |λ|(item i of xs, i, xs)\n end repeat\n return lst\n end tell\nend map\n\n-- intercalate :: Text -> [Text] -> Text\non intercalate(strText, lstText)\n set {dlm, my text item delimiters} to {my text item delimiters, strText}\n set strJoined to lstText as text\n set my text item delimiters to dlm\n return strJoined\nend intercalate\n\n-- Lift 2nd class handler function into 1st class script wrapper\n-- mReturn :: Handler -> Script\non mReturn(f)\n if class of f is script then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n","language":"AppleScript"},{"code":"100HOME:INPUT\"ENTER A STRING:\";S$:FORL=1TOLEN(S$):I$=MID$(S$,L,1):LC=(ASC(I$)>95)*32:C$=CHR$(ASC(I$)-LC):IFC$>=\"A\"ANDC$<=\"Z\"THENC$=CHR$(ASC(C$)+13):C$=CHR$(ASC(C$)-26*(C$>\"Z\")):I$=CHR$(ASC(C$)+LC)\n110A$=A$+I$:NEXT:PRINTA$\n","language":"Applesoft-BASIC"},{"code":"/* ARM assembly Raspberry PI */\n/* program rot13.s */\n/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes */\n/************************************/\n.include \"../constantes.inc\"\n\n.equ STRINGSIZE, 500\n/************************************/\n/* Initialized data */\n/************************************/\n.data\nszMessString: .asciz \"String :\\n\"\nszMessEncrip: .asciz \"\\nEncrypted :\\n\"\nszMessDecrip: .asciz \"\\nDecrypted :\\n\"\nszString1: .asciz \"{NOWHERE! abcd xyz 1234}\"\n\nszCarriageReturn: .asciz \"\\n\"\n/************************************/\n/* UnInitialized data */\n/************************************/\n.bss\nszString2: .skip STRINGSIZE\nszString3: .skip STRINGSIZE\n/************************************/\n/* code section */\n/************************************/\n.text\n.global main\nmain:\n\n ldr r0,iAdrszMessString @ display message\n bl affichageMess\n ldr r0,iAdrszString1 @ display string\n bl affichageMess\n ldr r0,iAdrszString1\n ldr r1,iAdrszString2\n bl encryptRot13\n ldr r0,iAdrszMessEncrip\n bl affichageMess\n ldr r0,iAdrszString2 @ display string\n bl affichageMess\n ldr r0,iAdrszString2\n ldr r1,iAdrszString3\n bl decryptRot13\n ldr r0,iAdrszMessDecrip\n bl affichageMess\n ldr r0,iAdrszString3 @ display string\n bl affichageMess\n ldr r0,iAdrszCarriageReturn\n bl affichageMess\n100: @ standard end of the program\n mov r0, #0 @ return code\n mov r7, #EXIT @ request to exit program\n svc 0 @ perform system call\niAdrszMessString: .int szMessString\niAdrszMessDecrip: .int szMessDecrip\niAdrszMessEncrip: .int szMessEncrip\niAdrszString1: .int szString1\niAdrszString2: .int szString2\niAdrszString3: .int szString3\niAdrszCarriageReturn: .int szCarriageReturn\n/******************************************************************/\n/* encrypt strings */\n/******************************************************************/\n/* r0 contains the address of the string1 */\n/* r1 contains the address of the encrypted string */\nencryptRot13:\n push {r3,r4,lr} @ save registers\n mov r3,#0 @ counter byte string 1\n mov r2,#13 @ rot characters number\n1:\n ldrb r4,[r0,r3] @ load byte string 1\n cmp r4,#0 @ zero final ?\n streqb r4,[r1,r3]\n moveq r0,r3\n beq 100f\n cmp r4,#65 @ < A ?\n strltb r4,[r1,r3]\n addlt r3,#1\n blt 1b\n cmp r4,#90 @ > Z\n bgt 2f\n add r4,r2 @ add key\n cmp r4,#90 @ > Z\n subgt r4,#26\n strb r4,[r1,r3]\n add r3,#1\n b 1b\n2:\n cmp r4,#97 @ < a ?\n strltb r4,[r1,r3]\n addlt r3,#1\n blt 1b\n cmp r4,#122 @> z\n strgtb r4,[r1,r3]\n addgt r3,#1\n bgt 1b\n add r4,r2\n cmp r4,#122\n subgt r4,#26\n strb r4,[r1,r3]\n add r3,#1\n b 1b\n\n100:\n pop {r3,r4,lr} @ restaur registers\n bx lr @ return\n/******************************************************************/\n/* decrypt strings */\n/******************************************************************/\n/* r0 contains the address of the encrypted string1 */\n/* r1 contains the address of the decrypted string */\ndecryptRot13:\n push {r3,r4,lr} @ save registers\n mov r3,#0 @ counter byte string 1\n mov r2,#13 @ rot characters number\n1:\n ldrb r4,[r0,r3] @ load byte string 1\n cmp r4,#0 @ zero final ?\n streqb r4,[r1,r3]\n moveq r0,r3\n beq 100f\n cmp r4,#65 @ < A ?\n strltb r4,[r1,r3]\n addlt r3,#1\n blt 1b\n cmp r4,#90 @ > Z\n bgt 2f\n sub r4,r2 @ substract key\n cmp r4,#65 @ < A\n addlt r4,#26\n strb r4,[r1,r3]\n add r3,#1\n b 1b\n2:\n cmp r4,#97 @ < a ?\n strltb r4,[r1,r3]\n addlt r3,#1\n blt 1b\n cmp r4,#122 @ > z\n strgtb r4,[r1,r3]\n addgt r3,#1\n bgt 1b\n sub r4,r2 @ substract key\n cmp r4,#97 @ < a\n addlt r4,#26\n strb r4,[r1,r3]\n add r3,#1\n b 1b\n\n100:\n pop {r3,r4,lr} @ restaur registers\n bx lr @ return\n/***************************************************/\n/* ROUTINES INCLUDE */\n/***************************************************/\n/* for this file see task include a file in language ARM assembly*/\n.include \"../affichage.inc\"\n","language":"ARM-Assembly"},{"code":"rot13: function [c][\n case [in? lower c]\n when? -> `a`..`m` -> return to :char (to :integer c) + 13\n when? -> `n`..`z` -> return to :char (to :integer c) - 13\n else -> return c\n]\n\nloop \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\" 'ch\n -> prints rot13 ch\n\nprint \"\"\n","language":"Arturo"},{"code":"ROT13(string) ; by Raccoon July-2009\n{\n Static a := \"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ \"\n Static b := \"nopqrstuvwxyzabcdefghijklmNOPQRSTUVWXYZABCDEFGHIJKLM \"\n s=\n Loop, Parse, string\n {\n c := substr(b,instr(a,A_LoopField,True),1)\n if (c != \" \")\n s .= c\n else\n s .= A_LoopField\n }\n Return s\n}\n","language":"AutoHotkey"},{"code":"ROT13(string) ; by Raccoon July-2009\n{\n s=\n Loop, Parse, string\n {\n c := asc(A_LoopField)\n if (c >= 97) && (c <= 109) || (c >= 65) && (c <= 77)\n c += 13\n else if (c >= 110) && (c <= 122) || (c >= 78) && (c <= 90)\n c -= 13\n s .= chr(c)\n }\n Return s\n}\n","language":"AutoHotkey"},{"code":"Str0=Hello, This is a sample text with 1 2 3 or other digits!@#$^&*()-_=\nStr1 := Rot13(Str0)\nStr2 := Rot13(Str1)\nMsgBox % Str0 \"`n\" Str1 \"`n\" Str2\n\nRot13(string)\n{\n Loop Parse, string\n {\n char := Asc(A_LoopField)\n ; o is 'A' code if it is an uppercase letter, and 'a' code if it is a lowercase letter\n o := Asc(\"A\") * (Asc(\"A\") <= char && char <= Asc(\"Z\")) + Asc(\"a\") * (Asc(\"a\") <= char && char <= Asc(\"z\"))\n If (o > 0)\n {\n ; Set between 0 and 25, add rotation factor, modulus alphabet size\n char := Mod(char - o + 13, 26)\n ; Transform back to char, upper or lower\n char := Chr(char + o)\n }\n Else\n {\n ; Non alphabetic, unchanged\n char := A_LoopField\n }\n rStr .= char\n }\n Return rStr\n}\n","language":"AutoHotkey"},{"code":"Rot13(string) {\n Output := \"\"\n Loop, Parse, string\n {\n a := ~Asc(A_LoopField)\n Output .= Chr(~a-1//(~(a|32)//13*2-11)*13)\n }\n return Output\n}\n","language":"AutoHotkey"},{"code":"# usage: awk -f rot13.awk\nBEGIN {\n for(i=0; i < 256; i++) {\n amap[sprintf(\"%c\", i)] = i\n }\n for(l=amap[\"a\"]; l <= amap[\"z\"]; l++) {\n rot13[l] = sprintf(\"%c\", (((l-amap[\"a\"])+13) % 26 ) + amap[\"a\"])\n }\n FS = \"\"\n}\n{\n o = \"\"\n for(i=1; i <= NF; i++) {\n if ( amap[tolower($i)] in rot13 ) {\n c = rot13[amap[tolower($i)]]\n if ( tolower($i) != $i ) c = toupper(c)\n o = o c\n } else {\n o = o $i\n }\n }\n print o\n}\n","language":"AWK"},{"code":"INPUT \"String: \", s$\nPRINT \"Output: \", REPLACE$(s$, \"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\", \"nopqrstuvwxyzabcdefghijklmNOPQRSTUVWXYZABCDEFGHIJKLM\", 2)\n","language":"BaCon"},{"code":"CLS\nINPUT \"Enter a string: \", s$\nans$ = \"\"\nFOR a = 1 TO LEN(s$)\n letter$ = MID$(s$, a, 1)\n IF letter$ >= \"A\" AND letter$ <= \"Z\" THEN\n char$ = CHR$(ASC(letter$) + 13)\n IF char$ > \"Z\" THEN char$ = CHR$(ASC(char$) - 26)\n ELSEIF letter$ >= \"a\" AND letter$ <= \"z\" THEN\n char$ = CHR$(ASC(letter$) + 13)\n IF char$ > \"z\" THEN char$ = CHR$(ASC(char$) - 26)\n ELSE\n char$ = letter$\n END IF\n ans$ = ans$ + char$\nNEXT a\nPRINT ans$\n","language":"BASIC"},{"code":"INPUT \"Enter a string \"; Text$\nFOR c% = 1 TO LEN(Text$)\n SELECT CASE ASC(MID$(Text$, c%, 1))\n CASE 65 TO 90\n MID$(Text$, c%, 1) = CHR$(65 + ((ASC(MID$(Text$, c%, 1)) - 65 + 13) MOD 26))\n CASE 97 TO 122\n MID$(Text$, c%, 1) = CHR$(97 + ((ASC(MID$(Text$, c%, 1)) - 97 + 13) MOD 26))\n END SELECT\nNEXT c%\nPRINT \"Converted......: \"; Text$\n","language":"BASIC"},{"code":"# rot13 Cipher v2.0\n# basic256 1.1.4.0\n# 2101031238\n\ndec$ = \"\"\ntype$ = \"cleartext \"\nctext$ = \"\"\nsp = 0\niOffset = 13 #offset assumed to be 13 - uncomment line 11 to change\n\ninput \"For decrypt enter \" + \"<d> \" + \" -- else press enter > \",dec$\n# input \"Enter offset > \", iOffset\n\nif dec$ = \"d\" OR dec$ = \"D\" then\n iOffset = 26 - iOffset\n type$ = \"ciphertext \"\nend if\n\ninput \"Enter \" + type$ + \"> \", str$\nstr$ = upper(str$)\n\nfor i = 1 to length(str$)\n iTemp = asc(mid(str$,i,1))\n if iTemp > 64 AND iTemp < 91 then\n iTemp = ((iTemp - 65) + iOffset) % 26\n print chr(iTemp + 65);\n sp = sp + 1\n if sp = 5 then\n print(' ');\n sp = 0\n endif\n endif\nnext i\n","language":"BASIC256"},{"code":"@echo off & setlocal enabledelayedexpansion\n\n:: ROT13 obfuscator Michael Sanders - 2017\n::\n:: example: rot13.cmd Rire abgvpr cflpuvpf arire jva gur ybggrel?\n\n:setup\n\n set str=%*\n set buf=%str%\n set len=0\n\n:getlength\n\n if not defined buf goto :start\n set buf=%buf:~1%\n set /a len+=1\n goto :getlength\n\n:start\n\n if %len% leq 0 (echo rot13: zero length string & exit /b 1)\n set abc=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\n set nop=NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm\n set r13=\n set num=0\n set /a len-=1\n\n:rot13\n\n for /l %%x in (!num!,1,%len%) do (\n set log=0\n for /l %%y in (0,1,51) do (\n if \"!str:~%%x,1!\"==\"!abc:~%%y,1!\" (\n call set r13=!r13!!nop:~%%y,1!\n set /a num=%%x+1\n set /a log+=1\n if !num! lss %len% goto :rot13\n )\n )\n if !log!==0 call set r13=!r13!!str:~%%x,1!\n )\n\n:done\n\n echo !r13!\n endlocal & exit /b 0\n","language":"Batch-File"},{"code":" REPEAT\n INPUT A$\n PRINT FNrot13(A$)\n UNTIL FALSE\n END\n\n DEF FNrot13(A$)\n LOCAL A%,B$,C$\n IF A$=\"\" THEN =\"\"\n FOR A%=1 TO LEN A$\n C$=MID$(A$,A%,1)\n IF C$<\"A\" OR (C$>\"Z\" AND C$<\"a\") OR C$>\"z\" THEN\n B$=B$+C$\n ELSE\n IF (ASC(C$) AND &DF)<ASC(\"N\") THEN\n B$=B$+CHR$(ASC(C$)+13)\n ELSE\n B$=B$+CHR$(ASC(C$)-13)\n ENDIF\n ENDIF\n NEXT A%\n =B$\n","language":"BBC-BASIC"},{"code":"get \"libhdr\"\n\nlet rot13(x) =\n 'A' <= x <= 'Z' -> (x - 'A' + 13) rem 26 + 'A',\n 'a' <= x <= 'z' -> (x - 'a' + 13) rem 26 + 'a',\n x\n\nlet start() be\n$( let ch = rdch()\n if ch = endstreamch then break\n wrch(rot13(ch))\n$) repeat\n","language":"BCPL"},{"code":"~:\"z\"`#v_:\"m\"`#v_:\"`\"` |>\n :\"Z\"`#v_:\"M\"`#v_:\"@\"`|>\n : 0 `#v_@v-6-7< >\n, < <+6+7 <<v\n","language":"Befunge"},{"code":"chars ← ⥊ \"AaNn\" +⌜ ↕13\n\nRot13 ← {𝕨 ⊣⌾((𝕩=52)⊸/) ⊏⟜chars 52|26+𝕩}⟜(chars⊸⊐)\n","language":"BQN"},{"code":"Rot13 \"Abcdefghijklm:Nopqrstuvwxyz_123 aBCDEFGHIJKLM-nOPQRSTUVWXYZ.\"\n","language":"BQN"},{"code":"blsq ) \"HELLO WORLD\"{{'A'Zr\\\\/Fi}m[13?+26.%'A'Zr\\\\/si}ww\n\"URYYB JBEYQ\"\nblsq ) \"URYYB JBEYQ\"{{'A'Zr\\\\/Fi}m[13?+26.%'A'Zr\\\\/si}ww\n\"HELLO WORLD\"\n","language":"Burlesque"},{"code":"#include <ctype.h>\n#include <limits.h>\n#include <stdio.h>\n#include <stdlib.h>\n\nstatic char rot13_table[UCHAR_MAX + 1];\n\nstatic void init_rot13_table(void) {\n\tstatic const unsigned char upper[] = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n\tstatic const unsigned char lower[] = \"abcdefghijklmnopqrstuvwxyz\";\n\n\tfor (int ch = '\\0'; ch <= UCHAR_MAX; ch++) {\n\t\trot13_table[ch] = ch;\n\t}\n\tfor (const unsigned char *p = upper; p[13] != '\\0'; p++) {\n\t\trot13_table[p[0]] = p[13];\n\t\trot13_table[p[13]] = p[0];\n\t}\n\tfor (const unsigned char *p = lower; p[13] != '\\0'; p++) {\n\t\trot13_table[p[0]] = p[13];\n\t\trot13_table[p[13]] = p[0];\n\t}\n}\n\nstatic void rot13_file(FILE *fp)\n{\n\tint ch;\n\twhile ((ch = fgetc(fp)) != EOF) {\n\t\tfputc(rot13_table[ch], stdout);\n\t}\n}\n\nint main(int argc, char *argv[])\n{\n\tinit_rot13_table();\n\n\tif (argc > 1) {\n\t\tfor (int i = 1; i < argc; i++) {\n\t\t\tFILE *fp = fopen(argv[i], \"r\");\n\t\t\tif (fp == NULL) {\n\t\t\t\tperror(argv[i]);\n\t\t\t\treturn EXIT_FAILURE;\n\t\t\t}\n\t\t\trot13_file(fp);\n\t\t\tfclose(fp);\n\t\t}\n\t} else {\n\t\trot13_file(stdin);\n\t}\n\treturn EXIT_SUCCESS;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <istream>\n#include <ostream>\n#include <fstream>\n#include <cstdlib>\n#include <string>\n\n// the rot13 function\nstd::string rot13(std::string s)\n{\n static std::string const\n lcalph = \"abcdefghijklmnopqrstuvwxyz\",\n ucalph = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n\n std::string result;\n std::string::size_type pos;\n\n result.reserve(s.length());\n\n for (std::string::iterator it = s.begin(); it != s.end(); ++it)\n {\n if ( (pos = lcalph.find(*it)) != std::string::npos )\n result.push_back(lcalph[(pos+13) % 26]);\n else if ( (pos = ucalph.find(*it)) != std::string::npos )\n result.push_back(ucalph[(pos+13) % 26]);\n else\n result.push_back(*it);\n }\n\n return result;\n}\n\n// function to output the rot13 of a file on std::cout\n// returns false if an error occurred processing the file, true otherwise\n// on entry, the argument is must be open for reading\nint rot13_stream(std::istream& is)\n{\n std::string line;\n while (std::getline(is, line))\n {\n if (!(std::cout << rot13(line) << \"\\n\"))\n return false;\n }\n return is.eof();\n}\n\n// the main program\nint main(int argc, char* argv[])\n{\n if (argc == 1) // no arguments given\n return rot13_stream(std::cin)? EXIT_SUCCESS : EXIT_FAILURE;\n\n std::ifstream file;\n for (int i = 1; i < argc; ++i)\n {\n file.open(argv[i], std::ios::in);\n if (!file)\n {\n std::cerr << argv[0] << \": could not open for reading: \" << argv[i] << \"\\n\";\n return EXIT_FAILURE;\n }\n if (!rot13_stream(file))\n {\n if (file.eof())\n // no error occurred for file, so the error must have been in output\n std::cerr << argv[0] << \": error writing to stdout\\n\";\n else\n std::cerr << argv[0] << \": error reading from \" << argv[i] << \"\\n\";\n return EXIT_FAILURE;\n }\n file.clear();\n file.close();\n if (!file)\n std::cerr << argv[0] << \": warning: closing failed for \" << argv[i] << \"\\n\";\n }\n return EXIT_SUCCESS;\n}\n","language":"C++"},{"code":"#include <iostream>\n#include <string>\n#include <boost/iostreams/concepts.hpp> // output_filter\n#include <boost/iostreams/operations.hpp> // put\n#include <boost/iostreams/filtering_stream.hpp>\n#include <fstream>\nnamespace io = boost::iostreams;\n\nclass rot_output_filter : public io::output_filter\n{\npublic:\n explicit rot_output_filter(int r=13):rotby(r),negrot(alphlen-r){};\n\n template<typename Sink>\n bool put(Sink& dest, int c){\n char uc = toupper(c);\n\n if(('A' <= uc) && (uc <= ('Z'-rotby)))\n c = c + rotby;\n else if ((('Z'-rotby) <= uc) && (uc <= 'Z'))\n c = c - negrot;\n return boost::iostreams::put(dest, c);\n };\nprivate:\n static const int alphlen = 26;\n const int rotby;\n const int negrot;\n};\n\nint main(int argc, char *argv[])\n{\n io::filtering_ostream out;\n out.push(rot_output_filter(13));\n out.push(std::cout);\n\n if (argc == 1) out << std::cin.rdbuf();\n else for(int i = 1; i < argc; ++i){\n std::ifstream in(argv[i]);\n out << in.rdbuf();\n }\n}\n","language":"C++"},{"code":"#include <string>\n#include <iostream>\n#include <fstream>\n\nchar rot13(const char c){\n\tif (c >= 'a' && c <= 'z')\n\t\treturn (c - 'a' + 13) % 26 + 'a';\n\telse if (c >= 'A' && c <= 'Z')\n\t\treturn (c - 'A' + 13) % 26 + 'A';\n\treturn c;\n}\n\nstd::string &rot13(std::string &s){\n\tfor (auto &c : s) //range based for is the only used C++11 feature\n\t\tc = rot13(c);\n\treturn s;\n}\n\nvoid rot13(std::istream &in, std::ostream &out){\n\tstd::string s;\n\twhile (std::getline(in, s))\n\t\tout << rot13(s) << '\\n';\n}\n\nint main(int argc, char *argv[]){\n\tif (argc == 1)\n\t\trot13(std::cin, std::cout);\n\tfor (int arg = 1; arg < argc; ++arg){\n\t\tstd::ifstream f(argv[arg]);\n\t\tif (!f)\n\t\t\treturn EXIT_FAILURE;\n\t\trot13(f, std::cout);\n\t}\n}\n","language":"C++"},{"code":"using System;\nusing System;\nusing System.IO;\nusing System.Linq;\nusing System.Text;\n\n\nclass Program {\n private static char shift(char c) {\n\t\treturn c.ToString().ToLower().First() switch {\n\t\t\t>= 'a' and <= 'm' => (char)(c + 13),\n\t\t\t>= 'n' and <= 'z' => (char)(c - 13),\n\t\t\tvar _ => c\n\t\t};\n }\n\n static string Rot13(string s) => new string(s.Select(c => shift(c)).ToArray());\n\n\n static void Main(string[] args) {\n foreach (var file in args.Where(file => File.Exists(file))) {\n Console.WriteLine(Rot13(File.ReadAllText(file)));\n }\n if (!args.Any()) {\n Console.WriteLine(Rot13(Console.In.ReadToEnd()));\n }\n }\n}\n","language":"C-sharp"},{"code":"100 rem ROT-13\n110 cls : rem 110 HOME for Applesoft BASIC\n120 input \"Enter a string: \";a$\n130 gosub 160\n140 print b$\n150 end\n160 rem FUNCTION rot13\n170 for i = 1 to len(a$)\n180 n = asc(mid$(a$,i,1))\n190 e = 255\n200 if n > 64 and n < 91 then e = 90 : rem uppercase\n210 if n > 96 and n < 123 then e = 122 : rem lowercase\n220 if e < 255 then n = n+13\n230 if n > e then n = n-26\n240 b$ = b$+chr$(n)\n250 next\n260 return\n","language":"Chipmunk-Basic"},{"code":"(ns rosettacode.rot-13)\n\n(let [a (int \\a) m (int \\m) A (int \\A) M (int \\M)\n n (int \\n) z (int \\z) N (int \\N) Z (int \\Z)]\n (defn rot-13 [^Character c]\n (char (let [i (int c)]\n (cond-> i\n (or (<= a i m) (<= A i M)) (+ 13)\n (or (<= n i z) (<= N i Z)) (- 13))))))\n\n(apply str (map rot-13 \"The Quick Brown Fox Jumped Over The Lazy Dog!\"))\n\n; An alternative implementation using a map:\n(let [A (into #{} \"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\")\n Am (->> (cycle A) (drop 26) (take 52) (zipmap A))]\n (defn rot13 [^String in]\n (apply str (map #(Am % %) in))))\n\n(rot13 \"The Quick Brown Fox Jumped Over The Lazy Dog!\")\n","language":"Clojure"},{"code":"rot13 = proc (c: char) returns (char)\n base: int\n letter: bool := false\n if c>='A' & c<='Z' then\n base := char$c2i('A')\n letter := true\n elseif c>='a' & c<='z' then\n base := char$c2i('a')\n letter := true\n end\n if ~letter then return(c) end\n return(char$i2c((char$c2i(c)-base+13)//26+base))\nend rot13\n\nstart_up = proc ()\n po: stream := stream$primary_output()\n pi: stream := stream$primary_input()\n while true do\n stream$putc(po,rot13(stream$getc(pi)))\n except when end_of_file: break end\n end\nend start_up\n","language":"CLU"},{"code":"FORMAT IDENTIFICATION DIVISION.\n PROGRAM-ID. rot-13.\n\n DATA DIVISION.\n LINKAGE SECTION.\n 77 in-str PIC X(100).\n 77 out-str PIC X(100).\n\n PROCEDURE DIVISION USING BY REFERENCE in-str, out-str.\n MOVE in-str TO out-str\n INSPECT out-str\n CONVERTING \"abcdefghijklmnopqrstuvwxyz\"\n TO \"nopqrstuvwxyzabcdefghijklm\"\n INSPECT out-str\n CONVERTING \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n TO \"NOPQRSTUVWXYZABCDEFGHIJKLM\"\n EXIT PROGRAM.\n\n END PROGRAM rot-13.\n","language":"COBOL"},{"code":"IDENTIFICATION DIVISION.\nFUNCTION-ID. rot-13.\n\nDATA DIVISION.\nLOCAL-STORAGE SECTION.\n01 STR-LENGTH CONSTANT AS 100.\n01 normal-lower CONSTANT AS \"abcdefghijklmnopqrstuvwxyz\".\n01 rot13-lower CONSTANT AS \"nopqrstuvwxyzabcdefghijklm\".\n01 normal-upper CONSTANT AS \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\".\n01 rot13-upper CONSTANT AS \"NOPQRSTUVWXYZABCDEFGHIJKLM\".\nLINKAGE SECTION.\n77 in-str PICTURE IS X(STR-LENGTH).\n77 out-str PICTURE IS X(STR-LENGTH).\n\nPROCEDURE DIVISION USING in-str, RETURNING out-str.\n MOVE in-str TO out-str\n INSPECT out-str CONVERTING normal-lower TO rot13-lower\n INSPECT out-str CONVERTING normal-upper TO rot13-upper\n GOBACK.\n\nEND FUNCTION rot-13.\n","language":"COBOL"},{"code":"1 rem rot-13 cipher\n2 rem rosetta code\n10 print chr$(147);chr$(14);\n25 gosub 1000\n30 print chr$(147);\"Enter a message to translate.\"\n35 print:print \"Press CTRL-Z when finished.\":print\n40 mg$=\"\":gosub 2000\n45 print chr$(147);\"Processing...\":gosub 3000\n50 print chr$(147);\"The translated message is:\"\n55 print:print cm$\n100 print:print \"Do another one? \";\n110 get k$:if k$<>\"y\" and k$<>\"n\" then 110\n120 print k$:if k$=\"y\" then goto 10\n130 end\n\n1000 rem generate encoding table\n1010 ec$=\"mnopqrstuvwxyzabcdefghijklMNOPQRSTUVWXYZABCDEFGHIJKL\"\n1099 return\n\n2000 rem get user input routine\n2005 print chr$(18);\" \";chr$(146);chr$(157);\n2010 get k$:if k$=\"\" then 2010\n2012 if k$=chr$(13) then print \" \";chr$(157);\n2015 print k$;\n2020 if k$=chr$(20) then mg$=left$(mg$,len(mg$)-1):goto 2040\n2025 if len(mg$)=255 or k$=chr$(26) then return\n2030 mg$=mg$+k$\n2040 goto 2005\n\n3000 rem translate message\n3005 cm$=\"\"\n3010 for i=1 to len(mg$)\n3015 c=asc(mid$(mg$,i,1))\n3020 if c<65 or (c>90 and c<193) or c>218 then cm$=cm$+chr$(c):goto 3030\n3025 if c>=65 and c<=90 then c=c-64\n3030 if c>=193 and c<=218 then c=(c-192)+26\n3035 cm$=cm$+mid$(ec$,c,1)\n3040 next i\n3050 return\n","language":"Commodore-BASIC"},{"code":"(defconstant +alphabet+\n'(#\\A #\\B #\\C #\\D #\\E #\\F #\\G #\\H #\\I #\\J #\\K #\\L #\\M #\\N #\\O #\\P\n #\\Q #\\R #\\S #\\T #\\U #\\V #\\W #\\X #\\Y #\\Z))\n\n(defun rot13 (s)\n (map 'string\n (lambda (c &aux (n (position (char-upcase c) +alphabet+)))\n (if n\n (funcall\n (if (lower-case-p c) #'char-downcase #'identity)\n (nth (mod (+ 13 n) 26) +alphabet+))\n c))\n s))\n","language":"Common-Lisp"},{"code":"(defun rot13 (string)\n (map 'string\n (lambda (char &aux (code (char-code char)))\n (if (alpha-char-p char)\n (if (> (- code (char-code (if (upper-case-p char)\n #\\A #\\a))) 12)\n (code-char (- code 13))\n (code-char (+ code 13)))\n char))\n string))\n\n(rot13 \"Moron\") ; -> \"Zbeba\"\n","language":"Common-Lisp"},{"code":"(defconstant +a+ \"AaBbCcDdEeFfGgHhIiJjKkLlMmzZyYxXwWvVuUtTsSrRqQpPoOnN\")\n\n(defun rot (txt)\n (map 'string\n #'(lambda (x)\n (if (find x +a+)\n (char +a+ (- 51 (position x +a+)))\n x))\n txt))\n","language":"Common-Lisp"},{"code":"alias rot13 [\n\tpush alpha [\n\t\t\"A B C D E F G H I J K L M N O P Q R S T U V W X Y Z\"\n\t\t\"a b c d e f g h i j k l m n o p q r s t u v w x y z\"\n\t] [ push chars [] [\n\t\tloop i (strlen $arg1) [\n\t\t\tlooplist n $alpha [\n\t\t\t\tif (! (listlen $chars)) [\n\t\t\t\t\talias chars (? (> (listindex $n (substr $arg1 $i 1)) -1) $n [])\n\t\t\t\t]\n\t\t\t]\n\t\t\talias arg1 (\n\t\t\t\tconcatword (substr $arg1 0 $i) (\n\t\t\t\t\t? (listlen $chars) (\n\t\t\t\t\t\tat $chars (\n\t\t\t\t\t\t\tmod (+ (\n\t\t\t\t\t\t\t\tlistindex $chars (substr $arg1 $i 1)\n\t\t\t\t\t\t\t) 13 ) (listlen $chars)\n\t\t\t\t\t\t)\n\t\t\t\t\t) (substr $arg1 $i 1)\n\t\t\t\t) (substr $arg1 (+ $i 1) (strlen $arg1))\n\t\t\t)\n\t\t\talias chars []\n\t\t]\n\t] ]\n\tresult $arg1\n]\n","language":"Cubescript"},{"code":">>> rot13 \"Hello World\"\n> Uryyb Jbeyq\n>>> rot13 \"Gur Dhvpx Oebja Sbk Whzcf Bire Gur Ynml Qbt!\"\n> The Quick Brown Fox Jumps Over The Lazy Dog!\n","language":"Cubescript"},{"code":"import std.stdio;\nimport std.ascii: letters, U = uppercase, L = lowercase;\nimport std.string: makeTrans, translate;\n\nimmutable r13 = makeTrans(letters,\n //U[13 .. $] ~ U[0 .. 13] ~\n U[13 .. U.length] ~ U[0 .. 13] ~\n L[13 .. L.length] ~ L[0 .. 13]);\n\nvoid main() {\n writeln(\"This is the 1st test!\".translate(r13, null));\n}\n","language":"D"},{"code":"import std.stdio, std.string, std.traits;\n\npure S rot13(S)(in S s) if (isSomeString!S) {\n return rot(s, 13);\n}\n\npure S rot(S)(in S s, in int key) if (isSomeString!S) {\n auto r = s.dup;\n\n foreach (i, ref c; r) {\n if ('a' <= c && c <= 'z')\n c = ((c - 'a' + key) % 26 + 'a');\n else if ('A' <= c && c <= 'Z')\n c = ((c - 'A' + key) % 26 + 'A');\n }\n return cast(S) r;\n}\n\nvoid main() {\n \"Gur Dhvpx Oebja Sbk Whzcf Bire Gur Ynml Qbt!\".rot13().writeln();\n}\n","language":"D"},{"code":"String rot13char(int charCode) {\n if ((charCode >= 'A'.codeUnitAt(0) && charCode <= 'M'.codeUnitAt(0)) ||\n (charCode >= 'a'.codeUnitAt(0) && charCode <= 'm'.codeUnitAt(0))) {\n return String.fromCharCode(charCode + 13);\n } else if ((charCode >= 'N'.codeUnitAt(0) && charCode <= 'Z'.codeUnitAt(0)) ||\n (charCode >= 'n'.codeUnitAt(0) && charCode <= 'z'.codeUnitAt(0))) {\n return String.fromCharCode(charCode - 13);\n } else {\n return String.fromCharCode(charCode);\n }\n}\n\nString rot13(String str) {\n return String.fromCharCodes(str.runes.map((rune) {\n return rot13char(rune).codeUnitAt(0);\n }));\n}\n\nvoid main() {\n print(rot13(\"The quick brown fox jumps over the lazy dog\"));\n}\n","language":"Dart"},{"code":"program Rot13;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils;\n\nfunction Rot13char(c: AnsiChar): AnsiChar;\nbegin\n Result := c;\n if c in ['a'..'m', 'A'..'M'] then\n Result := AnsiChar(ord(c) + 13)\n else if c in ['n'..'z', 'N'..'Z'] then\n Result := AnsiChar(ord(c) - 13);\nend;\n\nfunction Rot13Fn(s: ansistring): ansistring;\nvar i: Integer;\nbegin\n SetLength(result, length(s));\n for i := 1 to length(s) do\n Result[i] := Rot13char(s[i]);\nend;\n\nbegin\n writeln(Rot13Fn('nowhere ABJURER'));\n readln;\nend.\n","language":"Delphi"},{"code":"func Char.Rot13() {\n return Char(this.Order() + 13)\n when this is >= 'a' and <= 'm' or >= 'A' and <= 'M'\n return Char(this.Order() - 13)\n when this is >= 'n' and <= 'z' or >= 'N' and <= 'Z'\n return this\n}\n\nfunc String.Rot13() {\n var cs = []\n for c in this {\n cs.Add(c.Rot13())\n }\n String.Concat(values: cs)\n}\n\n\"ABJURER nowhere\".Rot13()\n","language":"Dyalect"},{"code":"pragma.enable(\"accumulator\")\n\nvar rot13Map := [].asMap()\nfor a in ['a', 'A'] {\n for i in 0..!26 {\n rot13Map with= (a + i, E.toString(a + (i + 13) % 26))\n }\n}\n\ndef rot13(s :String) {\n return accum \"\" for c in s { _ + rot13Map.fetch(c, fn{ c }) }\n}\n","language":"E"},{"code":"func$ rot13 str$ .\n for c$ in strchars str$\n c = strcode c$\n if c >= 65 and c <= 90\n c = (c + 13 - 65) mod 26 + 65\n elif c >= 97 and c <= 122\n c = (c + 13 - 97) mod 26 + 97\n .\n enc$ &= strchar c\n .\n return enc$\n.\nenc$ = rot13 \"Rosetta Code\"\nprint enc$\nprint rot13 enc$\n","language":"EasyLang"},{"code":"import system'routines;\nimport extensions;\nimport extensions'text;\n\nsingleton rotConvertor\n{\n char convert(char ch)\n {\n if (($97 <= ch && ch <= $109) || ($65 <= ch && ch <= $77))\n {\n ^ (ch.toInt() + 13).toChar()\n };\n if (($110 <= ch && ch <= $122) || ($78 <= ch && ch <= $90))\n {\n ^ (ch.toInt() - 13).toChar()\n };\n\n ^ ch\n }\n\n string convert(string s)\n = s.selectBy::(ch => rotConvertor.convert(ch)).summarize(new StringWriter());\n}\n\npublic program()\n{\n if (program_arguments.Length > 1)\n {\n console.printLine(rotConvertor.convert(program_arguments[1]))\n }\n}\n","language":"Elena"},{"code":"defmodule RC do\n def rot13(clist) do\n f = fn(c) when (?A <= c and c <= ?M) or (?a <= c and c <= ?m) -> c + 13\n (c) when (?N <= c and c <= ?Z) or (?n <= c and c <= ?z) -> c - 13\n (c) -> c\n end\n Enum.map(clist, f)\n end\nend\n\nIO.inspect encode = RC.rot13('Rosetta Code')\nIO.inspect RC.rot13(encode)\n","language":"Elixir"},{"code":"defmodule Rot13 do\n @moduledoc \"\"\"\n ROT13 encoding program. Takes user input and outputs encoded text.\n \"\"\"\n\n @spec sign(integer | float) :: -1 | 1\n def sign(int) do\n if int >= 0 do 1\n else -1\n end\n end\n\n @spec rotate(charlist) :: charlist\n def rotate(string_chars) do\n string_chars\n |> Enum.map(\n fn char ->\n char_up = << char :: utf8 >>\n |> String.upcase()\n |> String.to_charlist()\n |> Enum.at(0)\n if ?A <= char_up and char_up <= ?Z do\n <<\n char + (-13 * trunc(sign(char_up - 77.5))) :: utf8\n >>\n else\n << char :: utf8 >>\n end\n end)\n end\n\n @spec start(any, any) :: {:ok, pid}\n def start(_type, _args) do\n IO.puts(\"Enter string to encode:\")\n IO.puts(\n [\n \"Encoded string:\\n\",\n IO.read(:line)\n |> String.trim()\n |> String.to_charlist()\n |> rotate()\n ]\n )\n Task.start(fn -> :timer.sleep(1000) end)\n end\nend\n","language":"Elixir"},{"code":"(rot13-string \"abc\") ;=> \"nop\"\n(with-temp-buffer\n (insert \"abc\")\n (rot13-region (point-min) (point-max))\n (buffer-string)) ;=> \"nop\"\n","language":"Emacs-Lisp"},{"code":"(defun rot-13 (string)\n (let* ((len (length string))\n (output (make-string len ?\\s)))\n (dotimes (i len)\n (let ((char (aref string i)))\n (cond\n ((or (and (>= char ?n) (<= char ?z))\n (and (>= char ?N) (<= char ?Z)))\n (aset output i (- char 13)))\n ((or (and (>= char ?a) (<= char ?m))\n (and (>= char ?A) (<= char ?M)))\n (aset output i (+ char 13)))\n (t\n (aset output i char)))))\n output))\n","language":"Emacs-Lisp"},{"code":"rot13(Str) ->\n F = fun(C) when (C >= $A andalso C =< $M); (C >= $a andalso C =< $m) -> C + 13;\n (C) when (C >= $N andalso C =< $Z); (C >= $n andalso C =< $z) -> C - 13;\n (C) -> C\n end,\n lists:map(F, Str).\n","language":"Erlang"},{"code":"PROGRAM ROT13\n\nBEGIN\nINPUT(\"Enter a string \",TEXT$)\nFOR C%=1 TO LEN(TEXT$) DO\n A%=ASC(MID$(TEXT$,C%,1))\n CASE A% OF\n 65..90->\n MID$(TEXT$,C%,1)=CHR$(65+(A%-65+13) MOD 26)\n END ->\n 97..122->\n MID$(TEXT$,C%,1)=CHR$(97+(A%-97+13) MOD 26)\n END ->\n END CASE\nEND FOR\nPRINT(\"Converted: \";TEXT$)\nEND PROGRAM\n","language":"ERRE"},{"code":"include std/types.e\ninclude std/text.e\n\natom FALSE = 0\natom TRUE = not FALSE\n\nfunction Rot13( object oStuff )\n\tinteger iOffset\n\tinteger bIsUpper\n\tobject oResult\n\tsequence sAlphabet = \"abcdefghijklmnopqrstuvwxyz\"\n\tif sequence(oStuff) then\n\t\toResult = repeat( 0, length( oStuff ) )\n\t\tfor i = 1 to length( oStuff ) do\n\t\t\toResult[ i ] = Rot13( oStuff[ i ] )\n\t\tend for\n\telse\n\t\tbIsUpper = FALSE\n\t\tif t_upper( oStuff ) then\n\t\t\tbIsUpper = TRUE\n\t\t\toStuff = lower( oStuff )\n\t\tend if\n\t\tiOffset = find( oStuff, sAlphabet )\n\t\tif iOffset != 0 then\n\t\t\tiOffset += 13\n\t\t\tiOffset = remainder( iOffset, 26 )\n\t\t\tif iOffset = 0 then iOffset = 1 end if\n\t\t\toResult = sAlphabet[iOffset]\n\t\t\tif bIsUpper then\n\t\t\t\toResult = upper(oResult)\n\t\t\tend if\n\t\telse\n\t\t\toResult = oStuff --sprintf( \"%s\", oStuff )\n\t\tend if\n\tend if\n\treturn oResult\nend function\n\nputs( 1, Rot13( \"abjurer NOWHERE.\" ) & \"\\n\" )\n","language":"Euphoria"},{"code":"let rot13 (s : string) =\n let rot c =\n match c with\n | c when c > 64 && c < 91 -> ((c - 65 + 13) % 26) + 65\n | c when c > 96 && c < 123 -> ((c - 97 + 13) % 26) + 97\n | _ -> c\n s |> Array.of_seq\n |> Array.map(int >> rot >> char)\n |> (fun seq -> new string(seq))\n","language":"F-Sharp"},{"code":"#! /usr/bin/env factor\n\nUSING: kernel io ascii math combinators sequences ;\nIN: rot13\n\n: rot-base ( ch ch -- ch ) [ - 13 + 26 mod ] keep + ;\n\n: rot13-ch ( ch -- ch )\n {\n { [ dup letter? ] [ CHAR: a rot-base ] }\n { [ dup LETTER? ] [ CHAR: A rot-base ] }\n [ ]\n }\n cond ;\n\n: rot13 ( str -- str ) [ rot13-ch ] map ;\n\n: main ( -- )\n [ readln dup ]\n [ rot13 print flush ]\n while\n drop ;\n\nMAIN: main\n","language":"Factor"},{"code":"[^$1+][$32|$$'z>'a@>|$[\\%]?~[13\\'m>[_]?+]?,]#%\n","language":"FALSE"},{"code":"class Rot13\n{\n static Str rot13 (Str input)\n {\n Str result := \"\"\n input.each |Int c|\n {\n if ((c.lower >= 'a') && (c.lower <= 'm'))\n result += (c+13).toChar\n else if ((c.lower >= 'n') && (c.lower <= 'z'))\n result += (c-13).toChar\n else\n result += c.toChar\n }\n return result\n }\n\n public static Void main (Str[] args)\n {\n if (args.size == 1)\n { // process each line of given file\n Str filename := args[0]\n File(filename.toUri).eachLine |Str line|\n {\n echo (rot13(line))\n }\n }\n else\n {\n echo (\"Test:\")\n Str text := \"abcstuABCSTU123!+-\"\n echo (\"Text $text becomes ${rot13(text)}\")\n }\n }\n}\n","language":"Fantom"},{"code":"#APPTYPE CONSOLE\n\nREM Create a CircularQueue object\nREM CQ.Store item\nREM CQ.Find items\nREM CQ.Forward nItems\nREM CQ.Recall\n\nREM SO CQ init WITH \"A\"... \"Z\"\nREM CQ.Find \"B\"\nREM QC.Forward 13\nREM QC.Recall\n\nCLASS CircularQueue\n\titems[]\n\thead\n\ttail\n\there\n\t\n\tSUB INITIALIZE(dArray)\n\t\thead = 0\n\t\ttail = 0\n\t\there = 0\n\t\tFOR DIM i = LBOUND(dArray) TO UBOUND(dArray)\n\t\t\titems[tail] = dArray[i]\n\t\t\ttail = tail + 1\n\t\tNEXT\n\tEND SUB\n\t\n\tSUB TERMINATE()\n\t\tREM\n\tEND SUB\n\t\n\tMETHOD Put(s AS STRING)\n\t\titems[tail] = s\n\t\ttail = tail + 1\n\tEND METHOD\n\t\n\tMETHOD Find(s AS STRING)\n\t\tFOR DIM i = head TO tail - 1\n\t\t\tIF items[i] = s THEN\n\t\t\t\there = i\n\t\t\t\tRETURN TRUE\n\t\t\tEND IF\n\t\tNEXT\n\t\tRETURN FALSE\n\tEND METHOD\n\t\n\tMETHOD Move(n AS INTEGER)\n\t\tDIM bound AS INTEGER = UBOUND(items) + 1\n\t\there = (here + n) MOD bound\n\tEND METHOD\n\t\n\tMETHOD Recall()\n\t\tRETURN items[here]\n\tEND METHOD\n\t\n\tPROPERTY Size()\n\t\tRETURN COUNT(items)\n\tEND PROPERTY\nEND CLASS\n\nDIM CQ AS NEW CircularQueue({\"A\", \"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"H\", \"I\", \"J\", \"K\", \"L\", \"M\", \"N\", \"O\", \"P\", \"Q\", \"R\", \"S\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\", \"Z\"})\n\nDIM c AS STRING\nDIM isUppercase AS INTEGER\nDIM s AS STRING = \"nowhere ABJURER\"\n\nFOR DIM i = 1 TO LEN(s)\n\tc = MID(s, i, 1)\n\tisUppercase = lstrcmp(LCASE(c), c)\n\tIF CQ.Find(UCASE(c)) THEN\n\t\tCQ.Move(13)\n\t\tPRINT IIF(isUppercase, UCASE(CQ.Recall()), LCASE(CQ.Recall())) ;\n\tELSE\n\t\tPRINT c;\n\tEND IF\nNEXT\n\nPAUSE\n","language":"FBSL"},{"code":"(fn rot13 [s]\n (let [a :ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\n b :NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm]\n (s:gsub :%a #(b:sub (a:find $)))))\n","language":"Fennel"},{"code":": r13 ( c -- o )\n dup 32 or \\ tolower\n dup [char] a [char] z 1+ within if\n [char] m > if -13 else 13 then +\n else drop then ;\n","language":"Forth"},{"code":": ,chars ( end start -- )\n do i c, loop ;\n\n: xlate create does> ( c -- c' ) + c@ ;\n\nxlate rot13\n char A 0 ,chars\n char Z 1+ char N ,chars\n char N char A ,chars\n char a char Z 1+ ,chars\n char z 1+ char n ,chars\n char n char a ,chars\n 256 char z 1+ ,chars\n\n: rot13-string ( addr len -- )\n over + swap do i c@ rot13 i c! loop ;\n\n: .rot13\" ( string -- )\n [char] \" parse 2dup rot13-string type ;\n\n.rot13\" abjurer NOWHERE\" \\ nowhere ABJURER\n","language":"Forth"},{"code":"program test_rot_13\n\n implicit none\n integer, parameter :: len_max = 256\n integer, parameter :: unit = 10\n character (len_max) :: file\n character (len_max) :: fmt\n character (len_max) :: line\n integer :: arg\n integer :: arg_max\n integer :: iostat\n\n write (fmt, '(a, i0, a)') '(a', len_max, ')'\n arg_max = iargc ()\n if (arg_max > 0) then\n! Encode all files listed on the command line.\n do arg = 1, arg_max\n call getarg (arg, file)\n open (unit, file = file, iostat = iostat)\n if (iostat /= 0) cycle\n do\n read (unit, fmt = fmt, iostat = iostat) line\n if (iostat /= 0) exit\n write (*, '(a)') trim (rot_13 (line))\n end do\n close (unit)\n end do\n else\n! Encode standard input.\n do\n read (*, fmt = fmt, iostat = iostat) line\n if (iostat /= 0) exit\n write (*, '(a)') trim (rot_13 (line))\n end do\n end if\n\ncontains\n\n function rot_13 (input) result (output)\n\n implicit none\n character (len_max), intent (in) :: input\n character (len_max) :: output\n integer :: i\n\n output = input\n do i = 1, len_trim (output)\n select case (output (i : i))\n case ('A' : 'M', 'a' : 'm')\n output (i : i) = char (ichar (output (i : i)) + 13)\n case ('N' : 'Z', 'n' : 'z')\n output (i : i) = char (ichar (output (i : i)) - 13)\n end select\n end do\n\n end function rot_13\n\nend program test_rot_13\n","language":"Fortran"},{"code":"> cat foo.txt\nfoo\n> cat bar.txt\nbar\n> ./rot_13 foo.txt bar.txt\nsbb\none\n> ./rot_13 < foo.txt\nsbb\n> cat foo.txt bar.txt | ./rot_13\nsbb\none\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\n' uses in place encoding/decoding\nSub rot13(ByRef s As String)\n If s = \"\" Then Exit Sub\n Dim code As Integer\n For i As Integer = 0 To Len(s) - 1\n Select Case As Const s[i]\n Case 65 To 90 '' A to Z\n code = s[i] + 13\n If code > 90 Then code -= 26\n s[i] = code\n Case 97 To 122 '' a to z\n code = s[i] + 13\n If code > 122 Then code -= 26\n s[i] = code\n End Select\n Next\nEnd Sub\n\nDim s As String = \"nowhere ABJURER\"\nPrint \"Before encoding : \"; s\nrot13(s)\nPrint \"After encoding : \"; s\nrot13(s)\nPrint \"After decoding : \"; s\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"import io.{lines, stdin}\n\ndef rot13( s ) =\n buf = StringBuilder()\n\n for c <- s\n if isalpha( c )\n n = ((ord(c) and 0x1F) - 1 + 13)%26 + 1\n\n buf.append( chr(n or (if isupper(c) then 64 else 96)) )\n else\n buf.append( c )\n\n buf.toString()\n\ndef rot13lines( ls ) =\n for l <- ls\n println( rot13(l) )\n\nif _name_ == '-main-'\n if args.isEmpty()\n rot13lines( stdin() )\n else\n for f <- args\n rot13lines( lines(f) )\n","language":"FunL"},{"code":"rot13 := function(s)\n local upper, lower, c, n, t;\n upper := \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n lower := \"abcdefghijklmnopqrstuvwxyz\";\n t := [ ];\n for c in s do\n n := Position(upper, c);\n if n <> fail then\n Add(t, upper[((n+12) mod 26) + 1]);\n else\n n := Position(lower, c);\n if n <> fail then\n Add(t, lower[((n+12) mod 26) + 1]);\n else\n Add(t, c);\n fi;\n fi;\n od;\n return t;\nend;\n\na := \"England expects that every man will do his duty\";\n# \"England expects that every man will do his duty\"\nb := rot13(a);\n# \"Ratynaq rkcrpgf gung rirel zna jvyy qb uvf qhgl\"\nc := rot13(b);\n# \"England expects that every man will do his duty\"\n","language":"GAP"},{"code":"/[a-mA-M]/=@int-char{@add{@char-int{$1};13}}\n/[n-zN-Z]/=@int-char{@sub{@char-int{$1};13}}\n","language":"Gema"},{"code":"#define rot13\nvar in, out, i, working;\nin = argument0;\nout = \"\";\nfor (i = 1; i <= string_length(in); i += 1)\n {\n working = ord(string_char_at(in, i));\n if ((working > 64) && (working < 91))\n {\n working += 13;\n if (working > 90)\n {\n working -= 26;\n }\n }\n else if ((working > 96) && (working < 123))\n {\n working += 13;\n if (working > 122) working -= 26;\n }\n out += chr(working);\n }\nreturn out;\n","language":"GML"},{"code":"show_message(rot13(\"My dog has fleas!\"));\n","language":"GML"},{"code":"package main\n\nimport (\n \"fmt\"\n \"strings\"\n)\n\nfunc rot13char(c rune) rune {\n if c >= 'a' && c <= 'm' || c >= 'A' && c <= 'M' {\n return c + 13\n } else if c >= 'n' && c <= 'z' || c >= 'N' && c <= 'Z' {\n return c - 13\n }\n return c\n}\n\nfunc rot13(s string) string {\n return strings.Map(rot13char, s)\n}\n\nfunc main() {\n fmt.Println(rot13(\"nowhere ABJURER\"))\n}\n","language":"Go"},{"code":"#!/usr/bin/env golosh\n----\nThis module encrypts strings by rotating each character by 13.\n----\nmodule Rot13\n\naugment java.lang.Character {\n\n function rot13 = |this| -> match {\n when this >= 'a' and this <= 'z' then charValue((this - 'a' + 13) % 26 + 'a')\n when this >= 'A' and this <= 'Z' then charValue((this - 'A' + 13) % 26 + 'A')\n otherwise this\n }\n}\n\naugment java.lang.String {\n\n function rot13 = |this| -> vector[this: charAt(i): rot13() foreach i in [0..this: length()]]: join(\"\")\n}\n\nfunction main = |args| {\n\n require('A': rot13() == 'N', \"A is not N\")\n require(\"n\": rot13() == \"a\", \"n is not a\")\n require(\"nowhere ABJURER\": rot13() == \"abjurer NOWHERE\", \"nowhere is not abjurer\")\n\n foreach string in args {\n print(string: rot13())\n print(\" \")\n }\n println(\"\")\n}\n","language":"Golo"},{"code":"def rot13 = { String s ->\n (s as List).collect { ch ->\n switch (ch) {\n case ('a'..'m') + ('A'..'M'):\n return (((ch as char) + 13) as char)\n case ('n'..'z') + ('N'..'Z'):\n return (((ch as char) - 13) as char)\n default:\n return ch\n }\n }.inject (\"\") { string, ch -> string += ch}\n}\n","language":"Groovy"},{"code":"println rot13(\"Noyr jnf V, 'rer V fnj Ryon.\")\n","language":"Groovy"},{"code":"10 INPUT \"Enter a string: \",A$\n20 GOSUB 50\n30 PRINT B$\n40 END\n50 FOR I=1 TO LEN(A$)\n60 N=ASC(MID$(A$,I,1))\n70 E=255\n80 IF N>64 AND N<91 THEN E=90 ' uppercase\n90 IF N>96 AND N<123 THEN E=122 ' lowercase\n100 IF E<255 THEN N=N+13\n110 IF N>E THEN N=N-26\n120 B$=B$+CHR$(N)\n130 NEXT\n140 RETURN\n","language":"GW-BASIC"},{"code":"import Data.Char (chr, isAlpha, ord, toLower)\nimport Data.Bool (bool)\n\nrot13 :: Char -> Char\nrot13 c\n | isAlpha c = chr $ bool (-) (+) ('m' >= toLower c) (ord c) 13\n | otherwise = c\n\n-- Simple test\nmain :: IO ()\nmain = print $ rot13 <$> \"Abjurer nowhere\"\n","language":"Haskell"},{"code":"import Data.Char (chr, isAlpha, ord, toLower)\nimport Data.Bool (bool)\n\nrot13 :: Char -> Char\nrot13 =\n let rot = flip ((bool (-) (+) . ('m' >=) . toLower) <*> ord)\n in (bool <*> chr . rot 13) <*> isAlpha\n\n-- Simple test\nmain :: IO ()\nmain = print $ rot13 <$> \"Abjurer nowhere\"\n","language":"Haskell"},{"code":"import System.Environment\nimport System.IO\nimport System.Directory\nimport Control.Monad\n\nhInteract :: (String -> String) -> Handle -> Handle -> IO ()\nhInteract f hIn hOut =\n hGetContents hIn >>= hPutStr hOut . f\n\nprocessByTemp :: (Handle -> Handle -> IO ()) -> String -> IO ()\nprocessByTemp f name = do\n hIn <- openFile name ReadMode\n let tmp = name ++ \"$\"\n hOut <- openFile tmp WriteMode\n f hIn hOut\n hClose hIn\n hClose hOut\n removeFile name\n renameFile tmp name\n\nprocess :: (Handle -> Handle -> IO ()) -> [String] -> IO ()\nprocess f [] = f stdin stdout\nprocess f ns = mapM_ (processByTemp f) ns\n","language":"Haskell"},{"code":"main = do\n names <- getArgs\n process (hInteract (map rot13)) names\n","language":"Haskell"},{"code":"public static function rot13(input: String): String {\n\tvar buf = new StringBuf();\n\tfor (charInt in new haxe.iterators.StringIterator(input)) {\n\t\tif (charInt >= 0x41 && charInt <= 0x4d || charInt >= 0x61 && charInt <= 0x6d)\n\t\t\tcharInt += 13;\n\t\telse if (charInt >= 0x4e && charInt <= 0x5a || charInt >= 0x6e && charInt <= 0x7a)\n\t\t\tcharInt -= 13;\n\t\tbuf.addChar(charInt);\n\t}\n\treturn buf.toString();\n}\n","language":"Haxe"},{"code":"CHARACTER c, txt='abc? XYZ!', cod*100\n\n DO i = 1, LEN_TRIM(txt)\n c = txt(i)\n n = ICHAR(txt(i))\n IF( (c >= 'a') * (c <= 'm') + (c >= 'A') * (c <= 'M') ) THEN\n c = CHAR( ICHAR(c) + 13 )\n ELSEIF( (c >= 'n') * (c <= 'z') + (c >= 'N') * (c <= 'Z') ) THEN\n c = CHAR( ICHAR(c) - 13 )\n ENDIF\n\n cod(i) = c\n ENDDO\n\n WRITE(ClipBoard, Name) txt, cod ! txt=abc? XYZ!; cod=nop? KLM!;\nEND\n","language":"HicEst"},{"code":"#!/usr/bin/env hy\n(require hyrule [defmain])\n\n(setv lowers (lfor *x* (range 26)\n (chr (+ *x* (ord \"a\"))))) ; generate latin lower 26 chars\n(setv uppers (list (map str.upper lowers))) ; and the upper case\n(setv lowers (list (map ord lowers))) ; convert to unicode codepoints\n(setv uppers (list (map ord uppers)))\n(setv translations ; a dictionary with from->to\n (dict (zip ; codepoint mapping\n (+ lowers uppers)\n (+ (cut lowers 13 None)\n (cut lowers 0 13)\n (cut uppers 13 None)\n (cut uppers 0 13)))))\n\n(defn rot13 [string]\n (return (.translate string translations)))\n\n(defmain []\n (import fileinput)\n (for [*line* (fileinput.input)]\n (print (rot13 *line*) :end \"\")))\n","language":"Hy"},{"code":"procedure main(arglist)\n file := open(arglist[1],\"r\") | &input\n every write(rot13(|read(file)))\nend\n\nprocedure rot13(s) #: returns rot13(string)\nstatic a,n\ninitial {\n a := &lcase || &ucase\n (&lcase || &lcase) ? n := ( move(13), move(*&lcase) )\n (&ucase || &ucase) ? n ||:= ( move(13), move(*&ucase) )\n }\nreturn map(s,a,n)\nend\n","language":"Icon"},{"code":"(function ROT-13-char ch\n (let x (char-code ch)\n x- (or (< 109 x 123) (< 77 x 91)))\n (if (or (< 96 x 123) (< 64 x 91))\n (char-code ((x- - +) x 13))\n ch))\n\n(function ROT-13 text\n (.. str (map ROT-13-char text)))\n\n(ROT-13 \"The Quick Brown Fox Jumps Over The Lazy Dog!\")\n;returns \"Gur Dhvpx Oebja Sbk Whzcf Bire Gur Ynml Qbt!\"\n","language":"Insitux"},{"code":"100 PROGRAM \"Rot13.bas\"\n110 DO\n120 LINE INPUT PROMPT \"Line: \":LINE$\n130 PRINT ROT13$(LINE$)\n140 LOOP UNTIL LINE$=\"\"\n150 DEF ROT13$(TEXT$)\n160 LET RESULT$=\"\"\n170 FOR I=1 TO LEN(TEXT$)\n180 LET CH$=TEXT$(I)\n190 SELECT CASE CH$\n200 CASE \"A\" TO \"M\",\"a\" TO \"m\"\n210 LET CH$=CHR$(ORD(CH$)+13)\n220 CASE \"N\" TO \"Z\",\"n\" TO \"z\"\n230 LET CH$=CHR$(ORD(CH$)-13)\n240 CASE ELSE\n250 END SELECT\n260 LET RESULT$=RESULT$&CH$\n270 NEXT\n280 LET ROT13$=RESULT$\n290 END DEF\n","language":"IS-BASIC"},{"code":"rot13=: {&((65 97+/~i.2 13) |.@[} i.256)&.(a.&i.)\n","language":"J"},{"code":"fn rot_13(anon string: String) throws -> String {\n mut builder = StringBuilder::create()\n for code_point in string.code_points() {\n builder.append(match code_point {\n 'a'..'n' => code_point + 13\n 'n'..('z' + 1) => code_point - 13\n 'A'..'N' => code_point + 13\n 'N'..('Z' + 1) => code_point - 13\n else => code_point\n })\n }\n return builder.to_string()\n}\n\n\nfn main() {\n println(\"{}\", rot_13(\"The quick brown fox jumps over the lazy dog.\"))\n}\n","language":"Jakt"},{"code":"import java.io.*;\n\npublic class Rot13 {\n\n public static void main(String[] args) throws IOException {\n if (args.length >= 1) {\n for (String file : args) {\n try (InputStream in = new BufferedInputStream(new FileInputStream(file))) {\n rot13(in, System.out);\n }\n }\n } else {\n rot13(System.in, System.out);\n }\n }\n\n private static void rot13(InputStream in, OutputStream out) throws IOException {\n int ch;\n while ((ch = in.read()) != -1) {\n out.write(rot13((char) ch));\n }\n }\n\n private static char rot13(char ch) {\n if (ch >= 'A' && ch <= 'Z') {\n return (char) (((ch - 'A') + 13) % 26 + 'A');\n }\n if (ch >= 'a' && ch <= 'z') {\n return (char) (((ch - 'a') + 13) % 26 + 'a');\n }\n return ch;\n }\n}\n","language":"Java"},{"code":"function rot13(c) {\n return c.replace(/([a-m])|([n-z])/ig, function($0,$1,$2) {\n return String.fromCharCode($1 ? $1.charCodeAt(0) + 13 : $2 ? $2.charCodeAt(0) - 13 : 0) || $0;\n });\n}\nrot13(\"ABJURER nowhere\") // NOWHERE abjurer\n","language":"JavaScript"},{"code":"function rot13(value){\n if (!value)\n return \"\";\n\n function singleChar(c) {\n if (c.toUpperCase() < \"A\" || c.toUpperCase() > \"Z\")\n return c;\n\n if (c.toUpperCase() <= \"M\")\n return String.fromCharCode(c.charCodeAt(0) + 13);\n\n return String.fromCharCode(c.charCodeAt(0) - 13);\n }\n\n return _.map(value.split(\"\"), singleChar).join(\"\");\n}\n\ndescribe(\"Rot-13\", function() {\n it(\"Given nothing will return nothing\", function() {\n expect(rot13()).toBe(\"\");\n });\n\n it(\"Given empty string will return empty string\", function() {\n expect(rot13(\"\")).toBe(\"\");\n });\n\n it(\"Given A will return N\", function() {\n expect(rot13(\"A\")).toBe(\"N\");\n });\n\n it(\"Given B will return O\", function() {\n expect(rot13(\"B\")).toBe(\"O\");\n });\n\n it(\"Given N will return A\", function() {\n expect(rot13(\"N\")).toBe(\"A\");\n });\n\n it(\"Given Z will return M\", function() {\n expect(rot13(\"Z\")).toBe(\"M\");\n });\n\n it(\"Given ZA will return MN\", function() {\n expect(rot13(\"ZA\")).toBe(\"MN\");\n });\n\n it(\"Given HELLO will return URYYB\", function() {\n expect(rot13(\"HELLO\")).toBe(\"URYYB\");\n });\n\n it(\"Given hello will return uryyb\", function() {\n expect(rot13(\"hello\")).toBe(\"uryyb\");\n });\n\n\n it(\"Given hello1 will return uryyb1\", function() {\n expect(rot13(\"hello1\")).toBe(\"uryyb1\");\n });\n});\n","language":"JavaScript"},{"code":"#!/usr/bin/env jq -M -R -r -f\n# or perhaps:\n#!/usr/local/bin/jq -M -R -r -f\n\n# If your operating system does not allow more than one option\n# to be specified on the command line,\n# then consider using a version of jq that allows\n# command-line options to be squished together (-MRrf),\n# or see the following subsection.\n\ndef rot13:\n explode\n | map( if 65 <= . and . <= 90 then ((. - 52) % 26) + 65\n elif 97 <= . and . <= 122 then (. - 84) % 26 + 97\n else .\n end)\n | implode;\n\nrot13\n","language":"Jq"},{"code":"#!/bin/bash\n\njq -M -R -r '\n\ndef rot13:\n explode\n | map( if 65 <= . and . <= 90 then ((. - 52) % 26) + 65\n elif 97 <= . and . <= 122 then (. - 84) % 26 + 97\n else .\n end)\n | implode;\n\nrot13'\n","language":"Jq"},{"code":"#!/usr/local/bin/jsish\n/* ROT-13 in Jsish */\nfunction rot13(msg:string) {\n return msg.replace(/([a-m])|([n-z])/ig, function(m,p1,p2,ofs,str) {\n return String.fromCharCode(\n p1 ? p1.charCodeAt(0) + 13 : p2 ? p2.charCodeAt(0) - 13 : 0) || m;\n });\n}\nprovide('rot13', Util.verConvert(\"1.0\"));\n\n/* rot13 command line utility */\nif (isMain()) {\n /* Unit testing */\n if (Interp.conf('unitTest') > 0) {\n; rot13('ABJURER nowhere 123!');\n; rot13(rot13('Same old same old'));\n return;\n }\n\n /* rot-13 of data lines from given filenames or stdin, to stdout */\n function processFile(fname:string) {\n var str;\n if (fname == \"stdin\") fname = \"./stdin\";\n if (fname == \"-\") fname = \"stdin\";\n var fin = new Channel(fname, 'r');\n while (str = fin.gets()) puts(rot13(str));\n fin.close();\n }\n\n if (console.args.length == 0) console.args.push('-');\n for (var fn of console.args) {\n try { processFile(fn); } catch(err) { puts(err, \"processing\", fn); }\n }\n}\n\n/*\n=!EXPECTSTART!=\nrot13('ABJURER nowhere 123!') ==> NOWHERE abjurer 123!\nrot13(rot13('Same old same old')) ==> Same old same old\n=!EXPECTEND!=\n*/\n","language":"Jsish"},{"code":"# Julia 1.0\nfunction rot13(c::Char)\n shft = islowercase(c) ? 'a' : 'A'\n isletter(c) ? c = shft + (c - shft + 13) % 26 : c\nend\n\nrot13(str::AbstractString) = map(rot13, str)\n","language":"Julia"},{"code":"replace(\"nowhere ABJURER\", r\"[A-Za-z]\" => s -> map(c -> c + (uppercase(c) < 'N' ? 13 : -13), s))\n","language":"Julia"},{"code":" rot13: {a:+65 97+\\:2 13#!26;_ci@[!256;a;:;|a]_ic x}\n\n rot13 \"Testing! 1 2 3\"\n\"Grfgvat! 1 2 3\"\n","language":"K"},{"code":"import java.io.*\n\nfun String.rot13() = map {\n when {\n it.isUpperCase() -> { val x = it + 13; if (x > 'Z') x - 26 else x }\n it.isLowerCase() -> { val x = it + 13; if (x > 'z') x - 26 else x }\n else -> it\n } }.toCharArray()\n\nfun InputStreamReader.println() =\n try { BufferedReader(this).forEachLine { println(it.rot13()) } }\n catch (e: IOException) { e.printStackTrace() }\n\nfun main(args: Array<String>) {\n if (args.any())\n args.forEach { FileReader(it).println() }\n else\n InputStreamReader(System.`in`).println()\n}\n","language":"Kotlin"},{"code":"#!/bin/ksh\n\n# rot-13 function\n\n#\t# Variables:\n#\ninteger ROT_NUM=13\t\t\t# Generalize to any ROT\n\nstring1=\"A2p\"\t\t\t\t# Default \"test\"\nstring=${1:-${string1}}\t\t# Allow command line input\n\ntypeset -a lcalph=( a b c d e f g h i j k l m n o p q r s t u v w x y z )\ntypeset -a ucalph=( A B C D E F G H I J K L M N O P Q R S T U V W X Y Z )\n\n#\t# Functions:\n#\n#\t# Function _rotN(char) - return the \"rotated\" N letter to char\n# Needs: $ROT_NUM defined\n#\nfunction _rotN {\n\ttypeset _char ; _char=\"$1\"\n\ttypeset _casechk _alpha _oldIFS _buff _indx\n\n\t[[ ${_char} != @(\\w) || ${_char} == @(\\d) ]] && echo \"${_char}\" && return\t# Non-alpha\n\n\ttypeset -l _casechk=\"${_char}\"\n\t[[ ${_casechk} == \"${_char}\" ]] && nameref _aplha=lcalph || nameref _aplha=ucalph\n\n\t_oldIFS=\"$IFS\" ; IFS='' ; _buff=\"${_aplha[*]}\" ; IFS=\"${oldIFS}\"\n\t_indx=${_buff%${_char}*}\n\techo ${_aplha[$(( (${#_indx}+ROT_NUM) % (ROT_NUM * 2) ))]}\n\ttypeset +n _aplha\n\treturn\n}\n\n ######\n# main #\n ######\n\nfor ((i=0; i<${#string}; i++)); do\n\tbuff+=$(_rotN \"${string:${i}:1}\")\ndone\n\nprint \"${string}\"\nprint \"${buff}\"\n","language":"Ksh"},{"code":"abcdefghijklomnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXZ.\n","language":"Lambdatalk"},{"code":"{def rot13\n\n {def rot13.alphabet {A.split\n abcdefghijklomnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXZ_.}}\n\n {def rot13.delta\n {lambda {:i :a}\n {A.get {% {+ {A.in? {A.get :i :a} {rot13.alphabet}}\n 32} 64} {rot13.alphabet}}}}\n {def rot13.r\n {lambda {:a :b :n :i}\n {if {> :i :n}\n then :b\n else {rot13.r :a\n {A.set! :i {rot13.delta :i :a} :b}\n :n {+ :i 1}} }}}\n\n {lambda {:txt}\n {let { {:t {S.replace \\s by _ in :txt}} }\n {S.replace _ by space in\n {A.join {rot13.r {A.split :t}\n {A.new}\n {- {W.length :t} 1}\n 0 }}}}}}\n-> rot13\n\n1) encoding:\n\n{rot13 abcdefghijklomnopqrstuvwxyz\n 0123456789\n ABCDEFGHIJKLMNOPQRSTUVWXZ.}\n-> 56789ABCDEFGKIJKLMNOPQRSTUV3WXZ .abcde3fghijklomnopqrstuvwxyz0124\n\n2) decoding:\n\n{rot13 56789ABCDEFGKIJKLMNOPQRSTUV3WXZ .abcde3fghijklomnopqrstuvwxyz0124}\n-> abcdefghijklomnopqrstuvwxyz 0123456789 ABCDEFGKIJKLMNOPQRSTUVWXZ.\n","language":"Lambdatalk"},{"code":"// Extend the string type\n\ndefine string->rot13 => {\n local(\n rot13 = bytes,\n i, a, b\n )\n\n with char in .eachCharacter\n let int = #char->integer\n do {\n // We only modify these ranges, set range if we should modify\n #int >= 65 and #int < 91 ? local(a=65,b=91) |\n #int >= 97 and #int < 123 ? local(a=97,b=123) | local(a=0,b=0)\n\n if(#a && #b) => {\n #i = (#int+13) % #b // loop back if past ceiling (#b)\n #i += #a * (1 - #i / #a) // offset if below floor (#a)\n #rot13->import8bits(#i) // import the new character\n else\n #rot13->append(#char) // just append the character\n }\n }\n\n return #rot13->asstring\n}\n","language":"Lasso"},{"code":"define rot13(p::string) => {\n local(\n rot13 = bytes,\n a = bytes('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'),\n b = bytes('NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm'),\n i\n )\n\n with char in #p->eachCharacter\n let c = bytes(#char) do {\n #i = #a->find(#b)\n #i ? #rot13->import8bits(#b->get(#i)) | #rot13->append(#c)\n }\n\n return #rot13->asString\n}\n\nrot13('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz')\n","language":"Lasso"},{"code":"input \"Type some text to be encoded, then ENTER. \";tx$\n\ntex$ = Rot13$(tx$)\nprint tex$\n'check\nprint Rot13$(tex$)\n\nwait\n\nFunction Rot13$(t$)\n if t$=\"\" then\n Rot13$=\"\"\n exit function\n end if\n for i = 1 to len(t$)\n c$=mid$(t$,i,1)\n ch$=c$\n if (asc(c$)>=asc(\"A\")) and (asc(c$)<=asc(\"Z\")) then\n ch$=chr$(asc(c$)+13)\n if (asc(ch$)>asc(\"Z\")) then ch$=chr$(asc(ch$)-26)\n end if\n if (asc(c$)>=asc(\"a\")) and (asc(c$)<=asc(\"z\")) then\n ch$=chr$(asc(c$)+13)\n if (asc(ch$)>asc(\"z\")) then ch$=chr$(asc(ch$)-26)\n end if\n rot$=rot$+ch$\n next\n Rot13$=rot$\n end function\n","language":"Liberty-BASIC"},{"code":"Function Rot13$(t$)\n for i = 1 to len(t$)\n ch$=mid$(t$,i,1)\n if (asc(ch$)>=asc(\"A\")) and (asc(ch$)<=asc(\"Z\")) then\n ch$=chr$(asc(\"A\")+ (asc(ch$)-asc(\"A\")+13) mod 26)\n end if\n if (asc(ch$)>=asc(\"a\")) and (asc(ch$)<=asc(\"z\")) then\n ch$=chr$(asc(\"a\")+ (asc(ch$)-asc(\"a\")+13) mod 26)\n end if\n Rot13$=Rot13$+ch$\n next\n end function\n","language":"Liberty-BASIC"},{"code":"implement Rot13;\n\ninclude \"sys.m\"; sys: Sys;\ninclude \"draw.m\";\n\nRot13: module\n{\n\tinit:\tfn(ctxt: ref Draw->Context, argv: list of string);\n};\n\nstdout: ref Sys->FD;\ntab: array of int;\n\ninit(nil: ref Draw->Context, args: list of string)\n{\n\tsys = load Sys Sys->PATH;\n\tstdout = sys->fildes(1);\n\tinittab();\n\targs = tl args;\n\tif(args == nil)\n\t\targs = \"-\" :: nil;\n\tfor(; args != nil; args = tl args){\n\t\tfile := hd args;\n\t\tif(file != \"-\"){\n\t\t\tfd := sys->open(file, Sys->OREAD);\n\t\t\tif(fd == nil){\n\t\t\t\tsys->fprint(sys->fildes(2), \"rot13: cannot open %s: %r\\n\", file);\n\t\t\t\traise \"fail:bad open\";\n\t\t\t}\n\t\t\trot13cat(fd, file);\n\t\t}else\n\t\t\trot13cat(sys->fildes(0), \"<stdin>\");\n\t}\n}\n\ninittab()\n{\n\ttab = array[256] of int;\n\tfor(i := 0; i < 256; i++)\n\t\ttab[i] = i;\n\n\tfor(i = 'a'; i <= 'z'; i++)\n\t\ttab[i] = (((i - 'a') + 13) % 26) + 'a';\n\tfor(i = 'A'; i <= 'Z'; i++)\n\t\ttab[i] = (((i - 'A') + 13) % 26) + 'A';\n}\n\n\nrot13(s: string): string\n{\n\tfor(i := 0; i < len s; i++) {\n\t\tif(s[i] < 256)\n\t\t\ts[i] = tab[s[i]];\n\t}\n\treturn s;\n}\n\nrot13cat(fd: ref Sys->FD, file: string)\n{\n\tbuf := array[Sys->ATOMICIO] of byte;\n\n\twhile((n := sys->read(fd, buf, len buf)) > 0) {\n\t\tobuf := array of byte (rot13(string buf));\n\t\tif(sys->write(stdout, obuf, n) < n) {\n\t\t\tsys->fprint(sys->fildes(2), \"rot13: write error: %r\\n\");\n\t\t\traise \"fail:write error\";\n\t\t}\n\t}\n\tif(n < 0) {\n\t\tsys->fprint(sys->fildes(2), \"rot13: error reading %s: %r\\n\", file);\n\t\traise \"fail:read error\";\n\t}\n}\n","language":"Limbo"},{"code":"function rot13 S\n repeat with i = 1 to length(S)\n get chartonum(char i of S)\n if it < 65 or it > 122 or (it > 90 and it < 97) then next repeat\n put char it - 64 of \"NOPQRSTUVWXYZABCDEFGHIJKLM nopqrstuvwxyzabcdefghijklm\" into char i of S\n end repeat\n return S\nend rot13\n","language":"LiveCode"},{"code":"10 INPUT \"Enter a string: \",a$\n20 GOSUB 50\n30 PRINT b$\n40 END\n50 FOR i=1 TO LEN(a$)\n60 n=ASC(MID$(a$,i,1))\n70 e=255\n80 IF n>64 AND n<91 THEN e=90 ' uppercase\n90 IF n>96 AND n<123 THEN e=122 ' lowercase\n100 IF e<255 THEN n=n+13\n110 IF n>e THEN n=n-26\n120 b$=b$+CHR$(n)\n130 NEXT\n140 RETURN\n","language":"Locomotive-Basic"},{"code":"to rot13 :c\n make \"a difference ascii lowercase :c ascii \"a\n if or :a < 0 :a > 25 [output :c]\n make \"delta ifelse :a < 13 [13] [-13]\n output char sum :delta ascii :c\nend\n\nprint map \"rot13 \"|abjurer NOWHERE|\nnowhere ABJURER\n","language":"Logo"},{"code":"function rot13(s)\n\tlocal a = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\"\n\tlocal b = \"NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm\"\n\treturn (s:gsub(\"%a\", function(c) return b:sub(a:find(c)) end))\nend\n","language":"Lua"},{"code":"function rot13(s)\n return (s:gsub(\"%a\", function(c) c=c:byte() return string.char(c+(c%32<14 and 13 or -13)) end))\nend\n","language":"Lua"},{"code":"CLS\nINPUT \"Enter a string: \", s$\nans$ = \"\"\nFOR a = 1 TO LEN(s$)\n letter$ = MID$(s$, a, 1)\n IF letter$ >= \"A\" AND letter$ <= \"Z\" THEN\n char$ = CHR$(ASC(letter$) + 13)\n IF char$ > \"Z\" THEN char$ = CHR$(ASC(char$) - 26)\n ELSE.IF letter$ >= \"a\" AND letter$ <= \"z\" THEN\n char$ = CHR$(ASC(letter$) + 13)\n IF char$ > \"z\" THEN char$ = CHR$(ASC(char$) - 26)\n ELSE\n char$ = letter$\n END IF\n ans$ = ans$ + char$\nNEXT a\nPRINT ans$\n","language":"M2000-Interpreter"},{"code":"b'BA@?>=<;:9876543210/.-,+*)('&%$#\"!Q=+^:('&Y$#m!1So.QOO=v('98$65a`_^]\\[ZYXWVUTSRQ#I2MLKJIHGFE\nDCBA@#!7~|4{y1xv.us+rp(om%lj\"ig}fd\"cx``uz]rwvYnslkTonPfOjiKgJeG]\\EC_X]@[Z<R;VU7S6QP2N1LK-I,GF(\nD'BA#?>7~;:9y16w43s10)p-,l*#(i&%e#d!~``{tyxZpuXsrTTongOkdMhg`Hd]ba`_^W@[ZYXW9UNSRQPOHMLKJ-++FE\n''<A$?>=<;:387xw43s10/(-&m*)('&}${d!~}|^zyxwvutmVqpiRQlkjiKafedc\\E`_^@\\[ZYX;V9NMRQ42NGLK.IH*F?\nDCBA$#>7~;{{8xx5uu2rr/oo,ll)ii&f|e\"!aw`{z\\r[vXnmVTpongPkNihgJ_dcFa`B^]\\UZ=RWV8TSLQ4ON0LE.IHA)E\n>'BA:?!7~5|38y6/v321q).-&m*)i'&%|{d!~}_{zs\\wvutsUqTonPlOjiKgJedFbE`_A]@[Z<X;VU7S6QP22GL/JIB+FE\nDC%;@?>7~;:987w5v32r0)p-,+k)('~g$#\"b~w|uz]xwvutsrqTinQlOjLhgfeH]bE`CB]\\>ZSXWVUTSRQPON1LE.I,+*(\n(&&$$\"\"~~||zzxxv4u210/(-n+l)ji~g|eccaa_{zy[qZoXVVTponPfOdiLJJ_HFba`BXAV?==;;9977pQPONMLKJIHGFE\nDCBA@?>=<;:9876543210/.-,+*)('&%$#\"!~}|{zyxwvutsrqponmlkjihgfedcF!`_^]\\[ZYXWVUTSRQPONMLKJIHGFE\nDCBA@?>=<;:9876543210/.-JI*)FE&%$#\"!~}|{zyxwvutsrqponmlkjihgJ%dcF!`_^]\\[ZYXWVUTSRQPO2kLKJIHGF)\nbCBA@?>=<;:9876543210/.-JI*)FE3%$#\"!~}|{zyxwvutsrqponmlkjihgJ%dcF!`_B{\\[>wXWVUTSRQPO2kLKJIHGF)\nbCBA@?>=<;:9876543210/.-JI*)FE&%$#\"!~}|{zyxwvutsrqponmlkjihgJ%dcF!`_B{\\[ZYX;VUTS6Q4O200EJIH*@)\n>'%A@?!7~5|zzx65u3,s*qoommk)(h&}f{dbb``^^\\xwYutWVkToRmlkjMLgfHdcF[DBB@\\?==RWV8TM6K4220LK-IB+@E\n(&&;$\"\"~~||zzxxv4u21r/.o,mlk\"i&g$#\"!b}`{^\\\\qvYWWlUSSQQOkjiKaJ_HFFD`_A]V?T=;;997SRQ3I2G0.JIH*@)\n>'%A@\">=~}4{8y6wv3trr).omm$)j'&g$#d!ba`u^y\\wZYtWrqTonmOOdihK`IHG\\a`_AW@U><XWV8N7LQ422G0.JI+G@)\n>C&$$9\"~~||z87w5.u,sqqoommkki'h%$e\"yb}`_t][wvXtmVkpSQQfOMihgI_H]FD`_A]V?T=;;99775QPO1G0E.,HG)E\n>'<A$\"\"7~||z8y654u,s0qp',m*)ii&}$e\"cb``^z][[putVrkTiRPPNjMKK`edFb[DYB@\\?==RWVU7M6K42200..,,*F)\nDCB%@9>!~;|zz165u32s*qoommkki'&f${dy~a__t][[YutVrkTinQOOdMKKIIGGEaD_^A\\?ZYR;:U8SR533NMLEJ-,G*(\n(=B%##8=<|:3z1xvvttr0/o-&m$)jhh}fd\"!~`v_t][wvXtmVkpSQQfOMMKKIIGGEaD_^A\\?ZYXQV9T7R5PO11LKJIB+F)\nD'%%:#!!};:z81x/vttrrppnnlljjhhf$e\"!~a|{zyr[vYXmrqpRnQfkjiKaJ_HFFDDBB@@>><<::88664P3NMLE.I,+@)\n'CBA#9\"7<}{{2ywwuussqqoommkkiig%f#\"!xa`{^yx[YYnsVUpSQQfOMMKgfHd]F[`CAAV?=YX:VO8M6442200..,,**(\nD'BA$?\"7<}:{z16w43ss0)p-n+*j('h}fddb~a__tyxZvoXmVTpoQmfOdMKKIIGGEECCAA?[>YXW:UN76Q4ON1//JIBG*)\nDC%A@#8!}}{{yyw5vtt+0/o-&m$kiiggeeccaa_{^\\\\qvYtsVqTonglOjMLafIdcEE`_^W@[>=;W:88MRQ3OH1F/-IH*F?\n(=&$@?>~6}4{yywwu32r0)p',mkk\"iggeecca}`{zy\\wvunWrUpSnmOOjihg`eHcFaDBBW@U><<:V977LQP2NG0E.,,**(\nDC%A:#8!}}{{yywwu3t10/p-,+*#(ih%fddybw|{z\\r[puXVVkTRRPPNNLhgIe^G\\ECCAA??==;;9U8SR5PI21L/JI,**?\n('&;$9\"~~|:{yy054t2+r)pnnl*kii~%$d\"ybw`^^\\xwYunWlqTRRgPNNLLJJHdGbaD_BW@[>=R;PU8SR44OHM0K.-+G*(\n(=BA#?8!6}{98x6/v-trrppnnlljjhhffd\"c~}|_zsx[vYtWrqSSnmfOjMhgIedG\\a`B^W@U><<::8TS5QJ3H1//-I,**?\nDC%A:#8!}}{{yywwu3t10/p-,%l)ji~%$#c!bw|_zyx[vutmrUpSnQlkMMhgfe^GbEDYBW\\[=YR;P9775QP2NG0EJ-++@)\n'CB$@9\"7<}{{2ywwuussqqoommk)j'&%f#\"!~w`{^y\\wvutsUUjonQfOjMLaJ_HFFDDB^]?[T=RW:88M64PO1MF/DI,**?\n(&BA#?8!6}{{yywwuus1r/.-&ml)j'&geez!ba|_]]rwZXXmrqSohQfkNLLaJHHFFDDBB@@>><<::886R5PO2M0EJ-,G*E\nD'%%@9\"!~5|3zxxv4uss*/.n,%l#jh&geez!~`|u^s\\ZZXXVVTTRRPPNjMKK`eHcbE`C^W@?Z=XW:88SRKP32M0..CHG)E\n>'<%#?>~<5|38yww.ussq/.n,%l#(igg|eccaa__]][[YYWsVqpSnQlkdiLgJeHcbDD_^]V?Z=X;99NS644I2GL/--BG*E\nDC&A@?8!~}49z76wuu210/(-nm*)i'&g|eccaa_{z\\xqZoXVVTTRRPPNNLLJfIdcFaD_^]\\UZ=X;:O8MRQP2H1F/-IH*F?\n(=B%##8!}}{{yywwuussqqoom+l)('~g$e\"caav{^yxwpYtWVkpSnmOOdMhKfIGG\\EZ_B@@UZ=XWV9N765JO2ML/--HAF)\n(C&$$9\"7~||zzx6wuu,10p.'n%lj('g%|ez!b``u^\\\\ZvuWslUjoRPPeNLLJJHHFbE`_B]@[TY<W:U8SR44ONG0K.IH*FE\n(=&$@#!!6;:z81x/vttrrppnnlljjhhffd\"c~}|_zyr[ZYnsVqpSQQlkjchKJedFbaDY^A??TYX:VO8M6442200..,,*FE\n'C<%:#!!}}{{y7x54u2s0/.',m*k(i&%ee\"!~}v_z]x[YYnWUqpRngPeNLhgIe^G\\aDBBW@>ZY;WP9N7553ON0LE.C,**(\n(&&$$\">!<;:{8765.u2sr).-,l*k\"'&%e{dy~a__t][wvuWmVkTRRPPNNLLJJHHFFDDB^A\\[ZS<;V9TS644IN10K.,,AF)\n''<A@\">7~5:{yy0wuussqqoommkkiiggeec!b}|_z]rwZYtWrqTRRmfONMbK`edFb[DYB@\\[=YR;PU866K42NM/KD-BG*(\n(=&$$\"\"~~||zzxxvvt2s0/p-n+$k(i&geezcx}`{zy\\wvotWVqTonQOOjihaJIdGEEZ_^@\\[>SX;99NS6QP3N1LKJC,G*E\nDC%A$9\"~~||zzxxvvttr0/.n&m$)jhh}fd\"!~`v_ty\\ZZoXVrqpRhQfOMiLgfeHcba`Y^A@?T=R;PU8SR5PI210EJIH*@)\n>C&$$9\"~~||zzxxvvttrrppnnl*k('h%|ed!~}_{^s\\qZXtWUUjonPleNcLJJHHFbaC_XAV[><<Q:8TS5QJ3H1//--++))\n'C&A@#>!6}:{z16w43ss0).o,ml#(igg|#\"!aw`u^\\\\ZZXtsrTjShQOkjiKaJ_HFba`BXAV?==;;99775Q4ONM0KDI,G*E\n(&&;$9>!}}4987w/v-trrppn,+k)\"i~%fddyb``^zy[wpYnWUUSSQQOOMiLgfeHcb[D_B]\\[=Y<Q:8866442NML.D-B+))\n'CB$@9\"7<}{{2ywwuussq/p-,+l)('~%f#dcx}`{z\\\\wvutmVqTonPleNchKII^GEEC_B@@UZY;WP9N75QPO1G0E.,,**(\nDCB$:#8=~||3zxxvvttr0q.-,m*)('~g$edybw`^zyxZpYnWUqpoQgPeNLLJJHdcEaZCXA??==;;997S6QPOH1L/J-HG))\n>C&A$?>~<;|3zx6wuu,10p.'n%ljjh&geez!~`|u^s\\ZZXXVVTTRRPPNjMKK`eHcbaDY^A\\?>SX;VU77RK4O21//-I,**?\nDC%A:#8!}}{9zxx/43s1*q(ommk)(h&}f{\"caav_]][[YYWsVqpoRmfONMbK`eHcbECC^]V[>=XW9UN7L53311/KJ,HA*?\nD'%%:#!!}}{{yywwuus1r/.o,m*)\"'h%fez!~}_{^sxwvXnWlqTRRgPNjihJ`I^cFDDYB@@>><XWV8N7L53311//--++)E\n(CBA$?>=6}|{27x54uss0/.-&+lk('g%|ez!b``u^\\\\ZZXtsrTjShQOkjLhaJ_HFFDDBB@@>><X;VU8S6QPONGL/.I,GF)\nDCB$$9>=~5|{z1x/4uss*/.n,%l#jhhffddb~}_{t]rwZXXmVTpoQmfOdMKKIIGGEEC_B]\\?ZS<;V9TS644I210E.C,*F)\n''<A@\">7~5|z87w5.u,1rpp'nllj(igg|#\"b~w`u^\\\\ZvuWslUjoRPPeNLLJJHHFbE`_B]@U>Y<W:UT66QJO2M0K.,,AF)\n''<%#?\"~~5:9y70w.ussq/.-m%l#(igg|eccaa__]][[YYWsVqpoRmfkNiLgJedFFa`YB]@[Z<XW:OTS5QJ3HM0..C,**(\nD'%%:?>~<5|3zxxvvt21q/(o&mkkiiggeec!b}|{^yxqZuXsVqpRRmlkdiLgJedFbaDYB@@>ZY;WP9NS644I200..,H+))\n>CB$@9\"7~||zzxxvvt2s0/.o,+*#(ih%fddy~}|^z]rwvXtmVkpSQQfOMMKgfeG]F[DBB@@>><<::88664P3NM0K.IHGF?\n(C&A$?>=<;{{276w.u2s0/o-,m$)jhh}$#c!xav_]][[YYWWUqTRRglkMibK`IGGEECCAA?[>YXWP9T7R5PO11FK.I,+@E\n(&&;@?!=6}49zxx/vttr0/.n&m$kiiggeeccaa__]][wZutsVkpSRQfkjLhaJ_dGEEZCAA?[Z<XQ:O866442200..,,**(\nD'BA$?\"=6}|9zxx/4u21rpp-,%*kji~ge#\"!aw`u^\\\\ZvutVlUjSQQOkjiKaJ_HFFDDBB@@>Z=XW:U8SRKP32M0KJ-++FE\nD=&%$9\"7<}{{276v4-t+rppn,mkk\"'&f${dyb`|{]yr[pYWWUUSSQQOOMMKgJedGbE`_^W@?Z=XW:88SRQPIN10/D-B+)E\n(&&;@?!=6}4{y7xvv-21q/(o&mkki'hff{\"!a}v_t][[YYWWUUSSQmPNNchKfeHcFa`_^W\\?Z=X;VUTSR44INM0E.I,G*(\n(=B%##8!};:9y1x/vttr0/.n&m$kiiggeeccaa__]y\\wvunWVqTonQOOdMLgJHH]baC_XAV?==;;997S644INM/KD-B+))\n''%%##!!};|98y6w.uts*/pnn%l#(i&%f#d!x}`_z]xwZXXsrkTSnQOOdMKgfHd]F[`CAAV?=YX:VO8MR533H1//--++))\n''%%##!=~;:{8y65.ut1r/.omm*)(!&gfez!b``uz][[putVrkTiRPPNNLLJfIGG\\a`B^W@U><<:VU7SL5JO200E.,,**(\n(&B%@?\"=~;:927x5v3t10pp-,+*#j'h%fddy~a__ty\\wvuXsrqpiRmPkNLLafeGcbEZCX]\\[=S<Q:8TSR4J3H1/KJ,HA*?\n(&&$$\"\"~~||zzxxv4u210)po,m*)jhh}$edcxav_]][[YutVrkTiRPPNNLLJJHHFFD`C^]@[>SX;V9T7RQ33NG0K.I,**?\n(=&$@?>~6}4{y76v4-t+0qoo&mkkiiggeeccaa__]y\\wvuXslUTShmPkjMKKfe^cFE`_A]V?T=;;9UT6RK4I20LKJ,B+@)\n''%%##!!}}{{y7x54u2s0/(-nml#('&f|ezcaa_{zy[qZoXVVTTRRPPNNLLJJHdGbaD_B]\\[T=X;V9TS55PONMFK.I,G*(\n(=BA#?>!6;|zz16w432s0/.-&+l)j'h%$#\"!aav{z]r[vYXmVTponPfOdMKKIeHFF[`_A]V?T=;;9UT6RK4I200..,,**(\nD'BA@9\"!~5|38y65vtt+rq.-,l$k\"igge#\"b~w`uz][[pYWWUUSSQQOOMMKKIeHcbE`CXA\\?Z=XW99TMR5P3N1//DI,**?\nDC%A:#8!}}{{yyw54t2+r)pn,+*j\"i~%fddyb``^^\\\\ZZXtWrqpSnglOjMLaJ_dcbDZCX]@>>S<:VUT6L5J311//--++))\n'CBA#9\"7<}{{2yw543s+r).omm$ki'&%e{dyb`|_zyx[vunWrUpSnmOOjihafIdGbECCXAV?==;;9U866KPO1MF/D-++)E\nD&B;$9\"~~||zzxxv4u210q.-,%*kj'h%$ecc~}|{t]\\wvXtsVkpSnmPkNihgf_HcFaD_^]\\[==RWV9N7R5P311FK.,,AF)\nDCB;$#\"7<}{{2y0wuussq/.n,%l#(igg|eccaa_{z\\xqZotWUUjSQQOOMMKgJedGbEZ_B]@[>YX::UN7R54I20LKJ,B+@)\n''%A@?!7~5|zzxxvvttrrppn,m*)(i&}fedy~a|{^\\\\wvotWVqpRnmPeNLLJfeGc\\EZ_B@@U><<::8T755JON0LE.C,*F)\n''<A@\">7~5|zzxxvvt2s0/p-n+*#(i&gf{dbb``^zy[wpYnsVTTiRPPNNLhgIe^G\\aDBBW@>><<::8T7RQP3NMLE.-,A*?\nD'BA$?\"=<;:38y6w4u210/.nn%*)j!h%f#dbbw|{]yr[puXVVkTRRPPNNLLJJHdcbDZCX]@>>S<::88664P3NMLE.-,AF)\nDC&$$9\"!<;{92y05vtt+rppnnlljjh&%$dzcx}`^^s\\ZZXXVVTTRnQlkNiLaJeHG\\a`_A]@UZ=XWV9TMR54O2ML/--HG@)\n(C&$$9>=};:{2ywwuus10p.'n%ljjhhffddbb``^z]xwZuXsrkToRmPkjLLgfe^cFaDCXAV?=YX:VO8MR533H1//--+GF(\nD=&;$\"\"~~||zzxxv4u210q.-,%*k(i&g$#cc~}|{t]x[vuWsrUjSQQOkNLLafeGc\\EZCAA??==;W:88MRQ3OH1F/--++))\n'C&$$9>!<;:{8765.u2sr)p'nlljjhhffddb~}_{t]r[YYWWUUSoRmlkdMhKJ_dcbDZCX]@>>S<::8866442200..,,**(\nD'BA@9\"=~}4{27x54tt+0q.onlljjhhf$#c!xav_]][[YYWWUUSoRmlkNchKJeHcbECC^W@?Z=;;PUT6RK4I200..,,**(\n(&&$$\"\"~~|:{87x5v3,s0q.o,+kk('~%f#d!b``uz][[pYnsVTTinQlkjMhg`eHGF[`C^]@>>YXWP98SR4PO2G0..,,*FE\n'C<%:#!!}}{{yywwuus1r/.o,m*)(!h%f#d!~``{zyxqvYtWVkTinQOOdihJf_H]FD`CAAV[Z<XQ:O8664PO1MF/D-++))\n''%%##!!};|987x5432+0q.o,mkk\"'&f$#dybw|_zyxqZuXWlqTonmfOjMhKfeGG\\E`C^A??T=R;997S644INM/KD-B+)E\nD&B;$9\"~~||zzxxvvttr0q.-,m$kji~%f#\"caa|uz]\\wZXXmrqSonQfOMihJf_H]FDDBB@\\[=YR;PU866K4220LK-IB+@E\n(&&;$\"\"~~||z8y65v3t1*/p-n+l)(hh%${d!bav{^\\\\qZXtWUUjonPleNcLJJHdcbDZCXA??==;;9977553O2MLK.IHA*)\nD'BA$\"\"=<;49zyx/v-trrppnnl*)i'~g|eccaa__]][[YuXsrUpSnmlejMLgJedGEE`_^]V?>YX:VU8MRQ3OH1FK.,,A*(\nD'%%:?>~<5|3zx6wuu,10p.'n%ljjhhffd\"caav{z\\xqZoXVVTTRRPlOMMbgJedGbE`_^]V?Z=X;VUTSR44INM0E.I,+@E\n(&&;@?>~6}4{y765u-t+rppnnllj('g%|ezcaa__]][[YuXsrqjSRmPkjMKK`eHGbECCXAV?==;W:88MRQ3OH1F/-I,**?\nDC%A:#8!};:9y1x/vttrrppnnllj(i&%f#dy~a`{zy[wZoXmVTTRRPlkMibK`eHFF[DBB@\\[=YR;PU866K42NM/KD-BG*(\n(=&$$\"\"~~|:{87x5v3,sr/p-,mkk('~%fedybw`^zy[wpYnsVTTiRPPNNLLJfeGc\\EZCAA??==;;9U8SR5P3NMFK.I,+@E\n(CB$$?>=6}:{zxxv432r*q(ommkki'&%e{dy~a__t][[YYWWUUSoRmlkNihg`IdGbE`_AA\\[ZYRW:U87LQ422G0.JIH*@)\n>'%%##!!}}{{yywwuus1r/.-n+*)(!&gf#d!~a|{z\\\\qvuXmVUpSQQfOMihgI_H]bECCXA??=YX:VO8M6442200..,,**(\nD'BA$?8!~}49z76wuu,sr/pnn%l#(igg|#d!~a|_t]x[ZotWrqSSnglOjMhgIedG\\ECCA]@>>SXW9UN7L53311//--++))\n''%A$\"\"7<}:98y6/4uts*q(o&+l)(igg$#zcb}`^^sxwYunWlUSSQQOOMiLJJ_dcEaZCXA??=YX:VO8MR533H1//--++)E\n(CB%@#>=6}:{8y65uu210).o,m*kii~%fddy~}_{t]r[YYWWUUSSQmlNjcLaJHHFFDDBB@\\?ZYX;VUTMR543HM0KJ-++FE\nDC<%$#!!};:z81x/4uss*qoommk)('g}f{dbb``^^\\\\ZvYtsVqTonmleNiLgJedcbaCCX]\\?T=X;:O86RQP2H1FK.,,A*(\nDCB$:#8!};:z81x/vttrrppnnlljjh&g$#\"yba`u^sx[vuXVVkpSRmlNjcLaJHHFFDDBB@@>><<::886R5PO2M0EJ-,+@E\n(CB%##>7~}:98x0w.ussq/.n,%l#(igg|ec!~`|u^sx[YYnWUqpoQgPejMKK`IGGEECCAA??=Y<WV9T7RK4O21FK.IH**E\nD=B%@#>=};:{27xvv-2s0/.o,+$)j'h%f#\"bb}|{t]x[vYWWlUSSQQOkjLhaJ_HFFDDBB@@>><<:V9TSR5PONG0K.I,GF(\n(CBA@9>!<}|38yww.us10/o'n%ljjh&%$dzcxa_{^\\\\qvuWslUjSQQOkjLhaJ_dGEEZCAA??==;W:UTS6QPONGL/.I,GF)\nDCB$$9>=~5|{8yww.ussqqo-,l*#j!&geezcaa_{z\\xqZoXVVTTRRPPNjMhgJe^GbEDY^A\\[==R;V9866442N1//DIH*F?\n(=&$$\">=<|4{2ywwuussqqo-n+*)j!hg$e\"!b``{ty\\[vYWWlqpRnmPeNLLJJHHFFD`_A]V?T=;;9977553O2ML/J-HAF)\n(C&A@#!!<;4{z7xvv-2sqq(o&+*)i!h}fd\"!a}v_ty\\ZZoXVVTpoQmfOdiLJJ_HFFDDBB@@>><<:V9TS6Q4ONG0/J-++@E\n(&&;$9\"~~||zzxxv43s1*q(-nll#jh&%e#zcx}`^^s\\ZZXXVVTpSnmPkNihg`eHGF[`C^]@>>YXWVO8764PON0F/DI,**?\n(&&$@?>~6}4{yywwu321q)p',mkk\"iggeecca}`{z]x[vutslUToRmlOjihJJ_dcF[DCBW@U><<:V977LQP2NG0E.,,**(\nDC%A:#8!}}{{yywwu3t10q.'n+l)j'&ff{\"c~a|_]]rwvXtmVkpSQQfOMMKKIedcE[DYB@@>><<::88664P3NML/DI,+F)\nDC&$$?8!~}4{276v4-t+rppnnl*)i'~g|#dbbw`^^\\\\ZZXXVVTTRnQlkNiLg`IdGbE`_AA\\[TY<W:U866KP311FK.IHG*E\nD=B%@#\"7<}{{2765u-t+rp.omm$)(h&}f{dbb`|_]]rwvXtmVkTRnmOkdMbgJHH]FDDBB@@>><<:V9TSR5PONG0/J-HG*(\n(CBA@9>!~;|zz1xvvt21q/(o&mkkiiggeeccaa__]y\\wvYtWrqpohmPkNihgIeH]ba`BXAV?==;;9UT6RK4I200..,,**(\n(&&$@#>=<5|9zy0w.u,1r/.-n%lk(i&%fdd!x}`_^sxwvXnWlUSoRPPejiKg`I^GEa`_AW@U><<::8866442200.J-HG*E\n(C<A$#>!<;|zz76/vu2sqq(-,l*)j!&%e#zcxa__]][[YYWWUUSSQQOOMiLgfIdGbaZC^A\\?==R;PU8SRQ4ONMFK.-H+FE\n(&&A@?>7~}:{yy054t21r).omm$)j'&g$e\"!~}v_z]\\qZoXmrqpRhQfOMihJf_H]bECCXA??==;;9977553311/K.IHG@)\n(C&A@#!!6;|{z16wuu,1rpp',+k)\"i~geeccaa_{^\\\\qvuWslUjSQQOkjLhaJ_dGEEZCAA??==;W:UT7R5JO2M0/DI,GF(\n(C<%@#>=};:{2ywwuus10p.'n%*kii~geec!~`|u^s\\ZZXXVVTTRnQlkjMhaJIH]bE`_B@@[ZSX;:U866KPO1ML/D-++))\n''%%##!=<|:3z16wuu,sqqoommk)j'&g$e\"!x}`{^y\\wvXXsrqjSnQlOMMbgJHH]FDDB^A??TYX:VO8M6442200..,,**(\n(&B%@?>!<;:3z7x5v32rr/.-,%*k(i&geez!b``u^s\\ZvuWslUjSQmlNjcLafIGG\\EC_^@\\U>SX;99N7553311//--++)E\n(CBA$?>=<5:{8yx/432r0q(-n+*)\"i&gf{\"!~`v_ty\\ZZoXVVTTRRPPNNLLJJHHFFD`C^]\\U>=X;VU866K43N1//D-+GF(\nD=&;@#!!6}{98x6/v-trrppnnlljjhhffd\"c~}`{^s\\wZuXsrTTohmPkNiLJJ_H]FD`_A]V?T=;;9UT6RK4IN1//D-++))\n''%%##!!};|987x5.3t1rq(-nll#j!&g$#\"c~}v_^]rwZutWUUponglONMKKIeHFF[`_A]V?T=;WV8TM6K42N1//DIH*F?\n(=&$$\"\"~~||zzx6w43t1r/.-&+l)ji~%f#\"bb}|{zs\\wZuXVVkpoQmlOdihJf_H]FDDBB@@>><<::8866442N1LKJ-HGFE\n>'&A$?>!<;:zz165v-ts0/o-,m$)jhh}$#c!xav_]][[YYWsrTpiRglOMMbKIIGGEECCAA?[>YX;VO876K4IN1LK.,,AF)\n(C&$$9>=};:{27x54u2s*/p-nm$k\"'h%$dd!xa|_z][[putVrqTinQlkjMhaJIH]bE`_B@@[ZSX;:9N7553ONM/E.C,*FE\n'C<%:#!!}}{{yywwuus1r/.o,m*)\"'hgf{\"c~}`^^yxwpYXsVTTiRglOMMbgJedGbE`_^W@[>=RW:UT66QPONGL/J-,**(\n(&BA#?8!6}{{yywwuussqqo-n+*)j'&%${\"cb}`{z]xwvXXmrqTiRQPejiKg`I^cFDDYB@@>ZY;WP9NS644I20LK-IB+@E\n(&&;$\">=};4{27xvv-trrppnnlljjh&g$#d!xa`_ty\\wvYWWlUTonPleNchKII^GEECCA]\\>ZS<Q:8866442200..,H+FE\n(C&;$#>=<|:{2765u-t+rppnnlljjh&%e#zcx}`^^s\\ZvuWslUjoRPPeNLLJJHHFbE`_B]@[TY<;:OT7RQ422MLE.-H+))\n>CB$@9\"7~|:{yy054t2+r)pn,+k)\"i~geeccaa_{zy[qZotWUUjSQQOOMMKgJedGbE`_XA@[>YX;99TSRKP32M0..CH+))\n>'<%#?>=}5|3zx65u3,s*/pnn%ljjhhffddbb``^^\\x[vuXsVqpohmPkNMbgJedFFa`_^W@[>YX:VU8MR533HM0KJI,GFE\nD=&A$?\"=<;:9yy054u,s0qp'n%lj(igg|#\"b~w`u^\\xwYunWlUSonPleNchKII^GEa`B^W@UZ=;;P977553311//-I,GFE\n>'&A$?>!}}49zy6wuu,10p.-n%*kii~%f#\"c~av{^]\\qvYtsVTTohQPkNLLafeGc\\EZCAA?[><<QVU7SL5J31ML.JC,A*(\n(&&$$\"\"~~||z8y65v3t1*qp-n+*kii&%|#dcbw|_]]r[YuXVVkpoQmfOdMKKIIGGEa`B^W@U><<::88664P3NM0K.IHAF)\n('<A$\"\"7~5:{87x5v321*qpo&+l)(i&g$#\"!x}`{^y\\wvutsUUjonQfOjMhKII^cbD`YBW@>Z=;;PUT6RK4I200..,,**(\n(&&$$\"\"~<}:981xw4uss*q(-n+*k(i~gfez!b}|_]]xqvYXsrTpiRglOMMbKIIGcFDDY^]?[T=R;9UT6RK4I200..,,**(\n(&&$@#>=~;|927x5v3t10pp-,%l)j'hff{\"!~`v_t][[YYWsrTpiRgPNNLLJfeGc\\EZ_B@@U><<::886R5PON1LKD-,+@E\n(CB%##>=<5:{z765u-t+rp.omm$)(h&}f{db~}|^t]r[YYWWUUSSQQOOMMKgJedGbE`_^W\\?Z=<Q:OT7RQ33NMLKD-H+F)\n''<A@?!7~5|zzxxv43s1*q(ommkkiiggeecca}`{zy\\wvutmVUTiRglkjLbK`IGGEECCAA??==;;99775Q4ON1LE.-,AF)\nDC&$$9>!~;:z87x/4uss*/p-,m*k\"'h%f#d!~``{t]x[vYWWlUSonmOeNcLJJHHFFDDBB@@>><<:V9TSR5PI2M0/DI,**?\n(=B%@?>!<;49z7xw.3t10/p-,+$k(ih}$e\"!~a|{zyrwZYXmVkTinQOOdiLgfId]FEDY^]\\>T=RW:88M6442200..,,**(\n(&&$$\">!<;|92y6w4uss*q(-n+*)j!h%fez!b}|^^yrwZuXsVTTinmOkdMbKIIGcFDDY^]?[T=R;9UT6RK4I200..,,**(\n(&&$@#>=<}:38yxw.u,sqqoom+ljj!&%e#zcxa_{zy[qZoXVVTTRRPPNNLhKfeHcFa`YBA\\?ZY<::UTSLQ43N1//DI,**?\n(&&$$\"\"~<;{92y0wuus10p.'n%*kii~geeccaa_{^yx[vYtsrkpSnQlOjiKKfedc\\E`C^]?[Z=RWV8TM6KP311F/--++))\n''%%##!!}}{{y7x543t10/.'n+l)j'&%$#ccx}|_t]x[vYWWlUSonPleNcLJJHdcEaZCX]@>>S<:VU7SL5JO200E.,,**(\n(&&$$\">!<;:3zy6w43trr).on+ljj!&geez!~`|u^sx[YYnWUUSSQQOOMMKKIIGGEEC_B]\\?Z=RW:9T755JONM/E.C,**(\nDCB$:#8!};:z81x/vttr0/o-&m$)jhh}fddbb``^^\\x[vuXsVqjSRmPNNchKfeHFFa`Y^A@?TYX:VO8MR533H1/KJ,HA*?\nD'%%:#!!}}{{yywwuussqqo-nll#(i&%f#d!~w|_z]\\qZXtWUUjonmOeNcLJfedF\\EZCAA??=YX:VO8M6442200..,H+FE\nD'BA@9\"!<}:9zxx5432+0qp-nll#jh&%e#zcx}`^^s\\ZZXtsrTjShQOkjiKaJ_HFba`BXAV?==;;99775Q4ON1L/JIHG@E\n('BA@\">!6}{987w/v-trrppn,mkk\"'&f${dyb``^^\\\\ZZXXVrUpoRmfONihJfeH]bECCX]\\>ZS<Q:886R533HML.JC,A*(\n(&&$$\"\"~~||zzx6wuu,1r/.o,m$kj'h%$ecc~w|_^y\\ZZotsUqjShmPNNcLJJHHFFDDBB@\\[=YR;PU866K42200..,H+FE\n(C&A:?\"=~}498x65v-t+rppnnllj('&f|ezca}|{]s\\qvYWWlUSSQQOOMMKgJedcFa`YB]@?TY<WV88SRQJO2M0/--+GFE\n'=&;$\"\"~~||zzxxvvttr0q.-,m*)(!&gf#d!~a__zyxwpYXsVTTiRPlkMibK`eHFF[DB^]?[T=R;9977553311//--+G*E\nD'B%@?>=6}|9z76w432rr).-n%lk(igg|ec!~`|u^s\\ZZXtsUqjShQOOMMKgfeG]F[`CAAV?==;;997S6QP3NG0K.I,GF(\n(=B%@#>=};:{2ywwuus10p.'n%*kii~geeccaa__]][[YuXsrqTinQPkjLhgJ_H]FDDB^]\\>T=R;9977553311//--+G*E\nD'B%@9\"!~5:{yy0w.3t10q.o,+$)j'h%f#\"bb}|{t]x[vYWWlqTRRglOMMbgfHd]F[DBB@@>><<::886644220L/JIH+FE\nD=&%$9>!<;|zz7654-2sr/pnn%*)i'&g|#\"b~w`u^\\\\ZZXXVVTTRRPPNNLLJfIdcFaD_^]\\UZ=<;P9N75QPO1G0E.,HGF(\n>'<A$\"\"7~||z876v.u,1rpp'nlljjhhffddb~a|{^yr[ZYnsrTpoRgPNjMKK`edFb[DYB@@>Z=;;PUT6RK4I200..,,**(\n(&&$@#!!6;|98y6w.u2s0q.-mm*#(i&g$eccx}|^zy\\qvYWWlqTonmPkdiLgJeHcbDD_^W@[>YX:VU8MRQ3OH1FK.,,A*(\n(&&$@?!=6}49zxx/vttrrppnnlljjh&g$#\"c~}v_^]rwZutWUUponglONMKKIIGcbD`YBW@>ZY;WP9N75QP2NG0EJ-++@)\n'CB$@9\"7<}{{2ywwuussq/p-,m*k('&}$e\"cbw`u^s\\ZZXXVVTTRRPPNjihJ`I^cFDDYB@\\[Z<R;PU866K42NML.D-B+)E\n(CBA$?>=<5|{8y65v321qq(-,m$kji~g|#dbbw|{]yr[pYWWUUSonPleNcLJfeGc\\EZ_B@@U><<::8866442N1LK.IB+*E\n(CB%##8=~}|3876v.u,sq/.n,%l#jh&%e#zcx}`^^s\\ZvutVlUjSQQOkjLhaJ_HFFDDBB@@>Z=XW:U8MR543HM0..CHG)E\n>'<%##!!};|zz165u3,s*qoom+ljj!&%$dzcxa_{z\\xqZotWUUjSQQOOMMKgJedGbE`YBA\\?ZY<::UTMR543H1F/--+G*(\n(=BA#?8!6}{9zxx/43s1*q(ommkkiiggeecca}`^^sx[vuXsVqpinQlONchgIedG\\EZ_B]\\[>YXWP9T7R5PO11LKJIBG*E\n('<%:#!!};|zz165u3,s*qoom+ljj!&%e#zcxa__]][[YYWWUqTRRglOjihKfedc\\aD_B]@[ZYXW99NSR5J3N1LK-IH+@)\n'CB$@9\"7<}{{2ywwuussqqoommkkiig%f#\"!xa`{^yx[YYnWVqTRRglkMibK`IGGEEC_^@\\U>SX;99N7553311//--++)E\n(CB%@#8!~;|98yww4-2sr/pnn%*kii~ge#\"b~w`uz][[pYWWUUSSQQOOMMKKIIGcFa`C^A\\UZ=<;PUTS5Q4IN1LK.I,GF?\n(C&A$?>~~;:927x5v3trr)pnnllj('g%|ezca}`^^sxwYunWlUSSQQOOMMKKIeHcbaD_^]V[>=X;VU866QPONG0/.C,AF)\n''<A@\">7~5|zzx6wuu,10p.'n%lj('g%|ezcaa__]][[YYWWUqTonQlOjihg`IHcFa`C^]\\>>SXW:O87R533HM0..C,A*(\n(&BA@\"8!6}{{y76v4-t+0qoo&mkkiiggeecca}`{z]xqZYtWrqTRRglONMbgJHH]ba`BXAV?==;;9UT6RK4IN1//D-++))\n''%%##!!};|98y6w.3t1r/p-,ll)\"i&g$eccx}|^zs\\qZXXVVTTRRPPNNLLJJHHFbE`_^A\\U>Y<;PU8SR44ONGL/J-H+))\n>'<A$\"\"7<}:98y65.3ts0q.-nll)('~gf#\"b~}`uzy[wpYnWUqpRngPeNLLJJHdGEEZ_^@\\U>S<::886644220L/JI,G*E\nDC<%$?\"=<}{{8765.3tsr).omm$)('g}f{dbb``^zyxZpYnWUqTRRglkMibK`IGGEa`B^W@UZ=;;P97755331M0KJ-H+FE\nDC<A$?\"!6}4{2yw543s+r).omm$kiigge#dbbw|{]yr[pYWWUUSSQQOOMiLgfe^GFaDBBW@U><<:VU7SL5JO200E.,,*FE\nD&<%:#!!}}{{yywwu3t10q.o&ml)j'&gee\"y~a`_ty\\ZZoXVVTTRnQOOdihJf_H]FDDBB@\\[=YR;PU866K42200..,H+FE\n(C&A:?\"=~}4987w/v-trrppnnl*)i'~g|ec!~`|u^sx[YYnWUUSSQQOOMiLgfeHcb[D_B]@[Z<<WVUNS6Q4ON0LK.C,**(\nD'%%:?>~<5|3zx65u3,s*/pnn%ljjh&%e#zcxa__]][[YYWsVqpoRmlkdiLgJeHcbDD_^]\\U>Y<W:88MRQ3ON1FK.,,AFE\n'C<%:#!!}}{98x6/v-trrppnnlljjhhf$e\"!~a|{zyr[ZuXsrUponPPejiLaJIH]F[DBB@\\[=YR;P9775QP2NG0EJ-++@)\n''%%##!!}}{9z76w4-ts0q.-nll#(ih%fddybw|{z\\r[pYWsrqSiRgPNjiKg`I^GEECCA]\\[=S<QV977L53311//-IHG)?\n(=B%##8!};|98y6w.3t1r/p-,ll)\"i&g$eccx}|^zy\\qZXXVVTpoQmfOdMKKIIGGEECCAA?[>YXW:UN76Q4ON1//JIBG*)\n(=&;$\">!}}498x6/v-trrppn,+k)\"i~geeccaa__]][wZutWrUpohmPONcLaJHHFbECCX]\\[=S<Q:886644220L/--BGFE\n'=&;$\">!}}4987w/v-tr0qoo&+*)i!h}fd\"c~}`{^yxwpYXsVqpSQQlkjibgJIdGEEZCAA??==;WV8TM6KP311F/-IHG)?\n(=B%##8!};:9y1x/4uss*qoommkki'h%$e\"c~}|{ty\\wZYnWlUSSQQOkjLhaJ_HFFDDBB@@>><<:V9TSRK4O21F/DI,GF(\n(=&A$?\"~~5:9y70w.ussq/.-m%l#jh&%e#zcx}`^^s\\ZZXXVVTTRRPPNjMhgfI^GFEZ_B]\\?==XQV9875QPO1G0E.,,**(\nD'%%:?>~<5|3zxxvvttrrppn,m*)j'h%|#dc~a|{^\\\\wvoXWrUSShQOOMMKgfHd]F[DBB@@>><<::886R5PO2M0KJC,+*?\nDC%A:#8=~||3zxxvvttrrp.-m+$k\"'hff{db~}_{t]rwZXXmVTTRRPPNjMhgJeHcbaZ_BA@UZ=XW:88SRQPI21LKJ,B+@)\n''%A@\">7~5:{yy0wuus10p.'n%*kii~ge#\"!aw`u^\\\\ZZXXVVTpSnmPkNihgf_HGbE`_B]\\[==RWV9N76QP2NM0E.,H+))\n>CB$@9\"7~||z8yww.32r0)p'nl*kii~%$d\"ybw`^^\\\\ZZXXVVTpSQQfkNihKf_HcFEZ_B]\\>>SX;V9T755JO2MLK.CH+F)\nDC%A@#8!6;|zz165u3,s*qoommk)jhh}$#c!xav_]][[YutVrkTinQOOdMKKIIGGEaD_^]@[T=<W:UT755POHM0/J-++@E\nD&BA$9\"~~|:{yy054t2+r)pnnlljjhhffddbb`|_]]rwZutWrUpohmPkNMbKIIGcbaCYBW@>Z=;;PUT6RK4I200..,,**(\n(&&$@#>=<}:981xw4u21rpp-,+*#(ih%$d\"!bw|_]]rwvXtmVkTRRPPNNLLJJHHFFDDBB@\\?ZY<W:UTSRKP32M0KJ-HGF(\n(=BA$9\"!<;{98y0wu32r0)p'nlljjh&%e#zcxa__]][[YYWWUqTonQleNiLK`eHcbDDYB]@?TY<::O86R533HML.JC,A*(\n(&&$@?>~6}49zxx/vttrrppnnllj(i&%$ezc~a`uz]xwYYtmrUpSnmOkdMbgJHH]FDDB^]\\>T=RW:88M6442N1//DIH*F?\n(=&$$\"\"~~||zzx6w432s0).on+l)(igg$#zcb}`^^sxwYutWlqTRRglkMibK`IGGEECCAA??==;;99775Q422GL/JI,G*E\nD=&%@#>=~||98705vut+0qoo&mk)jhh}$#c!xav_]yxwYoXmVTTRRPPNNLLJJHHFbE`_B]@[ZYRW:U8S6QP22MLKJC,G*)\n>'<%##!!}}{{yywwuussqqo-nll#(i&%$e\"!~}v_^]r[pYWsVTTinmOkdMbKIedFb[DYB@@>><<::8866442N1LK.IB+*E\n(CB%##8=~}:{yy054t21r)pnnl*kii~%$d\"ybw`^zy[wpYnWUUSSQQOOMMKKIeHcbE`CX]@?>SX;VU866QJ321/KJ,HA*?\n(&&$$\"\"~~||zzxxvvt2s0/p-n+$k(ih}$e\"!aa|{ty\\wZYWWUUSSQmlNjcLafIGG\\ECCA]\\>ZS<QV977L53311//-I,GFE\n(CB;@#\"=~;:{yy654-tsr)p',+k)\"i~geecca}|^zs\\qvYWWlUSSQQOOMMKKIIGcFa`C^A\\[ZS<W:9NS6QP22MLKJCH+F)\n(&&$$\"\"~~||z876v.u,1rpp'nlljjhhf$e\"!~a|{zyrwZYtWrqTonmOOdihK`IHcbD`_BW@>><X;99NSR4PI2G0..,H+))\n>CB$@9\"7~||zzxxvvttr0q.-n+$kj'h%$eccxa`_ty\\ZZoXVVTponPfOdMKKIedcE[DY^A??T=;;997755331M0KJ-H+@)\n(C&A@#!!<5:{zy0wu32r0)p',mkk\"iggeeccaa__]][[YYWsVqpSnQlejMhKfIdcEE`_XA\\?ZY;WV9N75Q422GLK-IB+@)\n''%%##!=<|:3z16wuu,sqqoommkki'hff{\"c~}|_zyr[ZuXsrUSSnmlejMLgJHH]baC_^AV?==;W:88MRQ3OH1F/--++))\n''%%##!!};|zz16w43t1r/.-&+l)ji~g|#\"!aw`uz][[pYWWUUSonPleNchKII^GEECCA]\\>ZS<QV977L53311//-I,GFE\n(CBA@9\"!<}:9z765uu,10q(onm$k\"ig%fddy~}_{t]r[YYWsVTTinmOkdMbKIedFb[DYB@@>><<::886R5PO2MF/J-,AFE\n'CB%:#8=~;:9z16wv32r0/p'nllj(igg|#\"b~w`u^\\x[YYnsrTpiRgPNNLLJJHHFFDDB^A\\[>Y<WP9T76KP3NM//JIBG*E\n('<A$\"\"7<;:z2y0wuussq/.-m%l#jh&%$dzcxa_{zy[qZoXVVTTRRPPNjMhgfIdc\\aDC^]?[Z=R;99775Q422GLK-IB+@)\n'CB$@9\"7<}{{2ywwuussqqoom+l)(i&g$#\"yb}`{^yxZZutsrkpSnQlOMMbgJHH]baC_XAV?=YXW9O8M64PON0F/DI,**?\n(&&$$\"\"~~||zzxxv4u210q.-,+$)ji&g$#d!~}__tyx[pYXWlUjonPleNchKII^GEECCA]@>>SXW9UN7L53ON0LE.C,**(\n(&&$$\"\"~<}:9z70wv3trr).-m+*k\"igge#dbbw|{]yr[pYWWUqpRngPeNLLJJHHFFDDB^A\\[>Y<Q:98M644220LK-IB+@)\n'CBA#9\"7~|:9y70w.3trr)pn,+k)\"i~%fddyb``^^\\\\ZvYtsVqTohmPOjMKK`I^GEa`B^W@U><<::8TS5QJ3HM0..C,**(\n(&&$$\"\"~<}:9z7x54-ts0q.-nll)('~%fedy~a|{^y\\wvunsVqToRmlNNihgf_HcFaDBBW\\?==RW:UTS6QPONG0/J-HG*E\nDC%%:?>!6}|9zxx/4uss*/.n,%l#jhhf$eccx}|^zs\\qZXtsUqjShQOOMMKKIIGGEEC_B]\\?ZS<W:U8SR44IN1L/J-++@)\n>'%%#?>=}5|3zx65u3,s*/pnn%ljjhhffddbb``^z]xwvYnsVUTinQlkNLLg`IHGEECCA]\\>ZS<Q:8TSR4J3HM0..C,**(\n(&&$$\"\"~<}:9z7x5.ut1r/.omm*)\"'hgf{db~}|^t]rwZXXmVTpoQmfOdiLJJ_HFFDDBB@@>><<::8T7RQ4O2MLEJ-H+F)\n''<%#?\"~~5:9y70w.us10p.'n%*kii~geeccaa_{z\\xqZotWUUjSQQOOMMKgJedcFa`_XA\\?>SX;VU77RQPOHM0K.-+G*(\n(=BA#?8!6}{98x6/v-2sqq(ommk)('g}f{\"caav_]][[YYWWUUSoRmlkNihgf_dGFaD_^A\\[Z<<QVU8M65P311FK.,,AFE\nD&<%:#!!}}{{y76v4-t+rppnnlljjhhf$e\"!b}v_z]\\qvYtsUUjSnQlOMMbgfHd]F[DBB@@>><<::8TSR4J3HM0..C,**(\n(&&$@#>=<}4{8yx/432r0q(-n+*)j'~%fe\"c~}`^^yxqZYtWUUjonPlkNcLJfIGG\\a`B^W@U><<:VU7SL5J311//--++))\n''%A$?>!<}:92yx5v32sqq.-,%*kj'hff{\"!a}|_tyxZvoXmVTTRRPPNNLLJJHHFFDDB^A\\[>Y<WVUNS6Q4O200E.CH+FE\nD'BA@?8!<}|3z1654t,s*/pnn%lj('&f|ez!b``u^\\\\ZZXXVVTTRRPPNNLhKfed]FE`C^]@>>SX;:U866KPO1ML/DI,**?\nD'BA$?\"7<}|{2ywwuus10p.'n%*kii~geec!~`|u^sx[YYnWUqpRngPejMKK`IGGEECCA]@[Z=X;VO87R5PO200KJCH+*)\n>'<%##!=~||387w5.u,sq/pnn%*)i'~g|ec!~`|u^s\\ZZXXVVTTRRPlOjiLgJed]bE`C^A\\[==XWVO8S6Q422G0E.,,**(\nDC%A:#8!}}{{yywwuussq/p-,+l)('~g$e\"!~`|_t][wvuWmVkTRRPPNNLhgIe^G\\aDBBW@>ZY;WP9NS644I200..,,*F)\nDCB%@?>=6;|9z765u3t+0/.n&m$)jhh}fd\"!~`v_t][wvuWmVkpSQQfOMMKKIIGGEECCAA?[>YXWP98S6QP311F/.I,**?\nD'%%:#8!}}{{y765u-t+rppnnlljjhhffd\"c~}`{^s\\wZYnsVqpRRmfkNiLgfHdcF[`CAAV[Z<XQ:O866442NM/KD-B+))\n''%%##!!}}{9z765v3,1r/po&+l)(hh%${d!b}`^^s\\qvYWWlqTonmPkjcLKJ_H]F[`C^]@>>YXWPU8764P311FKJ,HA*?\n(&BA@\"8!6}{{yywwuussqqoom+l)(i&g$#\"y~a|_^sx[vuWWrqpohQlOjiKg`I^GEECCA]@>>SXW9UN7L53311//--++))\n'C&A@?\"=<;:3z7xw.321q/p',m*)(!h%fez!~}_u^sx[YYnWUUSSQQOOMMKKIIGGEEC_B]\\[T=X;:O8MR5PO11FK.I,G*(\n(=B%@?>!6;|{8y65vtt1*qp-nll#('g%$ez!b``uz]xwZuXslUpSRgPeNchKfeGGbaZ_B]@[ZY;Q:OT755J311//--+G*(\n(=BA#?8!6}{{y76v4-t+0qoo&mkkiigge#d!~}`{zsx[ZYnWlUSoRPPejiKg`I^GEEC_^@\\U>S<::8866442200.J-HG*E\n(CBA:#>!~5|z8yww.32r0)p'nl*)(h~g|eccaa_{z\\xqZotWUUjSQQOOMMKKIeHcbaD_^]\\UZ=<W:UT7RQP22GLK.C,+F)\n''<A$\"\"7~||z87w5.u,1rpp'nl*)(h~g|#dbbw`^^\\\\ZZXXVVTTRnQlkNibKJedcEaDY^]\\>T=R;9UTS5K4I200.JI+G@)\n>C&$$9\"~~||zzxxvvttr0q.-n+l#j'hg|ez!b}|^^yrwZuXsVTTinmOkdMbKIIGGEECCAA??==;;997S644IN1LKJ-HAF)\nD'&;@#!!6}49z765v32+rqp',m*)jhh%$#z!ba`^^\\\\ZvuWslUjoRPPeNLhKII^cbD`YBW@>><<::88664P3NM0K.IHG@E\n(C&%:?\"=<||9876/v3t1rpp',+k)(i~%$d\"ybw`^^\\\\ZZXXVVTTRRPPNNLhKfedGba`_XA\\?Z=XWVUT66KPO2G0K.IH*FE\n(=&$@#!!6;:z81x/vttrrp.omm$)(h&}f{dbb``^^\\\\ZZXtWrqpiRmPkNihJJ_dGbEDYBW\\[=YR;P977553311//--++))\n''%A$?>=~5:{z7x54uss0)po,mkk\"'&f$#dy~a__ty\\wvYtWrkToRQfkNihJJed]bE`C^A??TYX:VU8MR5PON1LKDI,G*)\n>C&A@\"\"=<;4{8yxvvt2sqq(-,l*#j!hffd\"caav{z\\xqZoXVVTpoQmfOdiLJJ_HFFDDBB@\\?ZYX;VUTM6Q4O2ML..IHGF?\nD'B%@#!!6}49zxx/43s1*q(om+*j(!h}fddb~}_{t]rwZXXmVTTRRPPNNLLJJHdGba`C^]\\[TY<W:U8SRQPO11FKJ-B+F)\n(=BA@\"8!6}{987w/v-trrp.-,l$k\"'hff{dbb``^^\\\\ZZXXVrUpongPOjMhgJHH]FE`_A]\\?TY<WV9T7L543HM0KJ-++F?\nD'&%##!=~||387w5.u,sqqo-nll#('g%|ezcaa_{z\\xqZotWUUjSQQOOMMKgJedGbE`Y^A\\?Z=;;PUT6RK4I200.JIH*@)\n>'%A@\">7~5|zzxxvvttrrppn,m*)(i&%|edcx}`{z][[vutmrUTShmPNNchgfH^G\\ECCAA?[ZY;Q:O86R533HML.JC,A*(\n(&&$$\"\"~~|:{87x5v321*/po,mkk\"i~%$#cybw|_]]r[YuXVVkpoQmfOdMKgfHd]F[DBB@@>><<::88664P3NM0K.IHGF?\n('B%@?\"=<;{{276w.uts*qo-,+k#j!&geezcaa__]][[YYWWUUSSQmPkjMhaJIH]bECCXAV[>YX;V9NS654IN1LK.I,G@)\nD'B%@?!!<;49z7x5vtt+rppn,+k)\"i~%fddyb`|{z\\r[pYWsrqSiRgPNNLLJJHHFFD`C^]\\?ZYRW:98MR5PO2M0KJIB+F)\nD'BA##>=<;49z7x5vtt+r)pn,+*j\"i~%fddyb``^^\\xwYunWlqTRRgPNNLLJJHHFFD`C^]\\?ZYXWPU87RQ3ON1F/DIHG)?\n(=&$$\">=<|4{2yw54t2+r)pnnlljjhhffddb~a|{^yr[vYtWUUjoRPPejMhgfI^GFaD_^A??ZSX;:UT6RQ4INM/KD-B+))\n'CB$@9\"7~|:{yy054t2+r)pnnlljjhhffddb~a|{^y\\wpuXWrUSShmPNNchKfeHcFa`YB]@[><<QV9TS55PONGL/J-,A*(\n(&BA#?8!6;|zz1xv432r*q(ommkkiiggeecca}`{zy\\wvunsVqToRPPejMKK`eHcbaD_^]\\U>Y<W:UTSRQ33HML/D-H+*?\n(=&$$\"\"~~|:9y70w.ussqqoommkki'h%$#zcb}`{z][[puXWrUSShmPNNchKfeHcF[`CB]@>>SX;99NS6QP3N1LE.-H+FE\n(&&A@9>!~;|zz16wuu,1r/.o,m*)\"'hg$eccx}`^^sx[vuXsVqpohQPkNihKIIdcbaZ_BA\\?==RW:88MR5PO2M0KJIHAF)\nD'&;$9\"7<;:z2y0wu32r0)p',mkk\"ig%$#cybw|_]]r[YYWWUUSSQQOOMMKgJedc\\E`C^A??TY<WVUN76Q422GL/--BG*E\nD'B%:#\"=~;:{yy6/4ut1rpp',mkk\"'h%$e\"c~w|_^y\\ZZotWUUjoRmlOjMhg`IHcFa`CAA\\[ZSX;:U866KP311FK.IH+F)\nDCB;@#\"=~||38yww.3t10q.o,+*)\"i&g$#c!~av_t][[YYWsrqSiRglOMMbKIIGGEECCAA??=Y<WVUN76Q4ON1//DI,+F)\n''<A$\"\"7<}:9z7x/4ut1rpp',mkk\"'h%$e\"c~w`{^y\\wvXXsrkpSnQlkMihK`eHFF[`_A]V?T=;;9977553311//--++)E\n(CBA$?>7<}:{z1xv4uss*/.n,%l#jhhf$#c!xav{^\\\\qZXtsUqjShmPNNcLJJHHFFDDBB@\\?ZYX;VUTM65P3NM0..IHGF?\nD'&A$\"\"7<}{{27x54u2s0/.-&+lk(i&%f#\"!aav{z]r[ZuXVVkponPlOdihgI_H]FDDBB@\\[Z<R;P977553311//--+G*E\nD'B;$#>=};:{27xvv-21q/(o&mkki'&f${dyb``^^\\\\ZZXXVVTTRnQlkNiLaJIdGbaDBB]V[>=X;99NS644IN1LK.I,G@E\n(C&A$\"\"7<}{{27x543t10)po,m*)jhh%$#z!ba|_]]rwZXXmrUpoRmPkjibgJIdGEEZ_B@@UZ=XW:U8SRQPI2M0/D-B+)E\nDC%;$9\"~~||zzxxvvttrrppn,m*)(!hg$e\"!b``uz]\\wZXXmrUSShmPkjMhK`eHGbECCX]@>>SX;VU8S6QJ32M0KJ-++FE\n>C&%@#!!6;|zz16w43t1r/.',ml)jhh}$eccx}`{z]x[vutmVUpSnmPNNihgf_dGFaDBBW\\?==RW:UT7R5PONMFK.I,G*E\nDCBA##8=<}4{8y65u32s*qoom+*j(!h}$eccxa__]][[YYWWUUSSQmPNNchKfed]FE`CAAV[><<QV9TS6Q4I21L/JI,**E\n>C&%@#!!6;|zz16w43t1r/(-nm*kii~%fddy~a|{^y\\wvoXWrUpoRPPkjibgJIdGEEZ_B@@UZ=XW:U8SRQJO2M0K.,,A*(\n(&B%##8=<|:3z1xvvttrrppnnlljjh&g$#\"c~}|{t]x[vYtsrqpRRglkNcLgJI^G\\EC_B@@UZY;WP9N75Q422GLK-IB+@)\n'CB$@9\"7~||zzxxvvttrrp.o,+*#j'h%f#\"bbw|_z]\\qvuWslUjoRPPeNLhgfH^G\\ECCAA??==;;9977553O2MLK.CH+*)\n>C&A@#>!<5|{8y65vtt10).on+ljj!&geez!b}|_z]xwpuXsVUjonPleNchKII^GEEC_B@@UZYX:P9N7553ON0LE.CH+))\n>'%%##!!}}{{y7x543t10/(on+l)(igg$#\"!x}`_z][[puXVVkpSnmPkNihgf_dGbE`C^]\\[Z<<QVU8M6Q43H1FKJ,HA*?\nD'%%:#!!};|zz165u3,s*qo-,l*#j!hffddbb``^^\\\\ZvYtsrkToRQfkNLLafedF\\EZCA]@>>SXW9UN7L53311//--++))\n''%%#?\"=<;|3zy6w43trr/(-nm*kii~%fddy~a|{^y\\wpuXsVUjSQmlNjcLafIGG\\ECCA]\\[=S<QV977L53311//--++))\n'C&A@?\"=<5|9z7x54tt10/(-n+l)jhh}$#\"bxav_]][[YYWWUUSSQQOOMMKgJedcFa`_X]@?Z=;;PU866KP3NM0K.IHGF?\n(C&%:#8=~||387w5.u,sqqo-,l*#j!hffddbb``^^\\\\ZZXtWrqpiRQlOjiLJJ_dGFaDBBW\\?==RW:UT7R5JO2M0K.,,A*?\nDC%A:#8=~||3zxxvvttr0/o-&m$)jhh}fddbb``^^\\\\ZvYtsrUpiRQPejMhgJHHcb[`CB]\\[=S<Q:8866442NML.D-B+))\n''%%##!!};|98y6w43,1r/po&+*)i!h}fd\"!~`v_t][wvXtmVkTRnmOkdMbKIedFb[DY^A??T=;;997755331M0KJI,GFE\n>'&%:?\"=<}{{8765.3ts0/o-&m$kiiggeec!~}_u^s\\ZZXXVVTTRRPlOjiLgJedcb[`C^A\\?ZYXWV88MRQ4I2M0/D-B+))\n'CB$@9\"7<}{{2yw54t2+r)pnnlljjhhffddb~a|{zs\\[vYWWlqTRRglOjiLgJ_HGbE`_B@@[TY<;V977LQ422GL/JI,G*E\n>C&%@#!!6;|zz16w43t1r/.'nm*k('hff#\"!x}`_z][[puXVVkpSnmPkNihg`eHGbECCX]@>>SX;VU8S6QPONG0K.-BG*(\n(=&;@#!!6;:9y1x/vttrrp.-m+$k\"iggeeccaa__]][wZutslUToRmlOMMbgJIdGEEZ_B@@UZ=XW:U8MR54O200EJ-++@E\n(CB%@#>7~;|9z76vv32+0q.on%l#jh&geez!~`|u^s\\ZZXtsUqjShmPNNcLJfeGc\\EZ_B@@U><<::8866442N1LKJ-HG@E\n('B%##8=~||38y65v3t10/(on+l)(igg$#\"!x}`_z][[puXVVkpSnmPkNihgf_dGbEDYBW\\?==RWV8TM6K42NML.D-B+))\n''%%##!!}}{{yyw5v321*qp-nll#(igg|ez!b}|_zs\\[ZoXmVTponPfOdiLJJ_HFFD`CAAV[Z<XQ:O866442200..,,*F)\nDC&A$9\"!<}:9zxx5.3ts0qoo&+ljj!&g$#d!b}v{^y\\[putVrqTiRPPNNLLJfeGc\\EZ_B@@U><<::8866442N1LKJ-HG@)\nD'&;@#!!6}49z765v321*/pon%l#j!hffd\"caav{z\\xqZoXVrqpRhQfOMihJf_H]bECCXA?[Z<XQ:OT755J311//--++))\n(aBA@?>=<;:9876543210/.-,+*)54&%ed/.a=_^zy87YXts21}|nm,+j)hg&%qpbam_kj\\[>=ed:U87_^PO2MLXJI,+SR\nDP&AML>=}|Gz87wvA@21qp;n,+kj54&%e#/.>=_^zy[7YXts21}|nz,+wvhg&%q#baDCkj\\[>=edVU87_^4\\21YXJI,+F)\nDC&%ML>JI|GF87wvAts1qp;:,+kj5h&%ed/.>=_^zy87YXts2q}|nm,+wvht&%qpbaDCkj\\[>=edVU8S_^PO21YXJV,+SR\nDC&%M#>=}|GF8DC5A@21qp;nm+kj54&%ed\".>=_^zy8wv5ts21}|nm,kwvhg&%qpbaDCkj\\[>YXdVU87_^PO2MYXJI,+SR\nDC&%ML>=}|Gz87wvA@2>=p;:,+kj(43%$d/.>=_;]y[7YXts2~}o{m,+wv(t&rqpbaDCkj\\[>=edVU8SR5PO21YXJV,+SR\nDC&%ML>J}|GF87wvA@21qp;:,+7)54&%ed/.a=_^zy87YXts21}|nm,+j)hg&%qpbam_kj\\[>=ed:U87_^PO2MLXJI,+SR\nDP&AML>=}|Gz87wvA@21qp;n,+kj54&%e#/.>=_^zy[7YXts21}|nz,+wvhg&%q#baDCkj\\?Z=<dVU87_Q]ON1YXJI,+SE\nDC&%ML>JI|GF87wvAts1qp;:,+kj5h&%ed/.>=_^zy87YXts2q}|nm,+wvht&%qpbaDCkj\\[>=edVU8S_^PO21YXJV,+SR\nDC&%M#>=}|GF8DC5A@21qp;nm+kj54&%ed\".>=_^zy8wv5ts21}|nm,kwvhg&%qpbaDCkj\\[>YXdVU87_^PO2MYXJI,+SR\nDC&%ML>=}|Gz87wvA@2>=p;:,+kj5hg%ed/.>=_^:\\87YXts2qp|nm,+wvhg&%qpbaDCkj\\[>=edVU8SR5PO21YXJV,+SR\nDC&%ML>J}|GF87wvA@21qp;:,+7)54&%ed/.a=_^zy87YXts21}|nm,+j)hg&%qpbam_kj\\[>=ed:U87_^PO2MLXJI,+SR\nDP&AML>=}|Gz87wvA@21qp;n,+kj54&%e#/.>=_^zy[7YXts21}|nz,+wvhg&%q#baDCkj\\[>=edVU87_^4\\21YXJI,+F)\nDC&%ML>JI|GF87wvAts1qp;:,+kj5h&%ed/.>=_^zy87YXts2q}|nm,+w)h's%qpbaDl^]\\[>=ed:UTS_^PO21YXJVU+SR\nDC&A@LK=}|GF8x6v4@21qp.:9+kj54&%ed\".>=_^zy8wv5ts21}|nm,kwvhg&%qpbaDCkj\\[>YXdVU87_^PO2MYXJI,+SR\nDC&%ML>=}|Gz87wvA@2>=p;:,+kj5hg%$d/.>=_;]y87YXts210o{m,+wv(t&rqpbaDCkj\\[>=edVU8SR5PO21YXJV,+SR\nDC&%ML>J}|GF87wvA@21qp;:,+7)54&%ed/.a=_^zy87YXts21}|nm,+j)hg&%qpbam_kj\\[>=ed:U87_^PO2MLXWI,+SR\nD'&%ML>=}|:zEDCvA@21qp.n,+kj54&%e#/.>=_^z98ZvXts21}o.-l+wvhg&ed#baDCkj\\[>=XdVU87_Q]ON1YXJI,T*R\nDC&%ML>=<|GF87wvAts1qp;:,+kj5h&%ed/.>=_^zy87YXts2q}|nm,+wvht&%qpbaDCkj\\[>=edVU8S_^PO21YXJV,+SR\nDCO%ML\"=}|GFy7Cvu@21qp;-m+kj54&%ed\".>=_^zy8wv5ts21}|nm,kwvhg&%qpbaDCkj\\[>YXdVU87_^PO2MYXJI,+SR\nDCO%ML>=I;Gzy7wvA@2>qp;:,+kj5'&2ed/.>=_^:\\87YXts2qp|nm,+wvhg&%qpbaDCkj\\[>=edVU8SR5PO21YXJV,+SR\nDC&%ML>J}|GF87wvA@21qp;:,+7)54&%ed/.a=_^zy87YXts21}|nm,+j)hg&%qpbam_kj\\[>=ed:U87_^PO2MLXJI,+SR\nDP&AML>=}|Gz87wvA@21qp;n,+kj54&%e#/.>=_^zy[7YXts21}|nz,+wvhg&%q#baDCkj\\[>=edVU87_^4\\21YXJI,+F)\nDC&%ML>JI|GF87wvAts1qp;:,+kj5h&%ed/.>=_^zy87YXts2q}|nm,+wvht&%qpbaDCkj\\[>=edVU8S_^PO21YXJV,+SR\nDC&%M#>=}|GF8DC5A@21qp;nm+kj54&%ed\".>=_^zy8wv5ts21}|nm,kwvhg&%qpbaDCkj\\[>YXdVU87_^PO2MYXJI,+SR\nDC&%ML>=}|Gz87wvA@2>=p;:,+kj5hg%ed/.>=_^:\\87YXts2qp|nm,+wvhg&%qpbaDCkj\\[>=edVU8SR5PO21YXJV,+SR\nDC&%ML>J}|GF87wvA@21qp;:,+7)54&%ed/.a=_^zy87YXts21}|nm,+j)hg&%qpbam_Bj\\[>YXWc9T7_^4ON1Y/JI,+S)\n('OAML>=I|{zE76Bu3?r0<.:,+kj5hg2ed/.>=|^]yx7YuW3r~0onzlx*iu'frqp\"!`lB]i?ZfXWc9T`6QP\\NZ0KW-H+F)\nDC&%ML>JI|G9Ex6Bu@?>qp;:,87)(h&%ed\"b>}_^zy87Y543Uq0|nmy+*vhtfr$co!`l^j@?Zf<Wc9T`RQ]3NZ0KJIHT*E\nQ'B%@LK~<H{9Ex6B43?r0<onm8*6i'3f$d/!a=_^:\\8wv543r~0o{zlkwvhg&ed#b!DCkj@h>=Xdc9T`6Q]321YXJI,+SR\nDCON$?K~<HGFEx6Bu3?1qp.nm87)(h&210c!~`<;:\\87YX4srq}onm,+jv('&rdco!`lBA@?>f<Wc9T76^PO21Y/.I,TSR\nDCO%$LKJ<H{9ExCBut21qp;nm+*)54&%1#/ba=_^zy8wv5t321}|.ml+*)(g&%q#\"n`_Bj\\[g=<;:UT`6Q]3[Z0KWI,+SR\nDPBAM?K~<H{F8x6Bu3?r0p.:9l*6i'3f$0\"!~`<{]\\8w6Xts21}|{m,x*iu'feqcbaDC^j@?>fXWc9T`6^4\\[1YX.IH+*)\nDC&%@LKJ}HG9Ex6Buts1qp;:m+765'&f$0c!~=|;]y87vX4321}|nm,kjv('f%qp\"a`_Bj@[>=X;VU8S6Q]3NZ0XJIHT*E\nQ'BN@L>~<H{9EDwBA@21qp;-9l7j54g2ed/.>=_^z\\87YXt3r~0o{z,x*iu'fr$cbaDlB]i?Zf<W:9T`6Q]3[1LXJI,GSR\nDP&%ML\"J};Gzyx6Bu3?>0<o-9l*6ih&%$0c!~`<{]9[Z6uW3rq0|{-lx*iu'&%$pbaDCkj\\[gf<Wc9T`R^]3NZ0KWV,+SR\nDC&%ML>JIH{9Ex65u@21qp.:9+k6('3f$0c.>}|^zy8wY5W321}|.ml+*)(g&%q#bnDlBj\\[g=<;:UT`6Q]3NZY/JI,+SR\nDP&A@?K~<H{9yD6Bu3?r0p.:m87)(hg2ed\"!~`<{]y[ZYXtsU1pon-yx*iu'feqc\"!`lB]i[ZfXdVUa76^]O[1YXJIHT*R\n(C&%@#>JI;G9Ex6But21=p;:,8k65'3%ed\".~}<;zy87vXWsU~0o{-lx*)(gfr$co!`l^j\\?Zf<WcUaSRQ]3NZLKWV,+SR\n(CB%@?\"=}|Gz8xC5u@21=po:,876i'3f$d\"!~=_^zy8w6Xt3r~0o{z,xwvhg&eqco!DCkj@h>=XdcU87_54O[Z0XJIU+*R\nDC&N$?K~<|:zyx6Bu3?1=/o:,+7j('g210c!~`<;:9x7YXts2q0/n-lx*iut&r$co!`lBA\\hZf<Wc9T`6Q43NZ0KWVUG*R\nDC&AM?\"=}H{9Ex6543s1qp;nm8*)5'3f$0cba`_^zy8ZY5WVr~0o{-l+wi(g&%qcbaDlkj\\[>fedVba7_^P32MLXJI,+S)\nQ'BN@L>=}|GzEDwBu3?r0/.-9+kj5'&%10/.>=|;:\\x76XtsUqp|.z,x*iu'f%qcbaDC^j@?g=edVU8`_5]O[1YX.V,GS)\nQ'BN$?\"~<|G9Ex6Butsrqp;:,lkj(4&%ed/!>}<;]9xZ6uWsU~po{-lx*v(g&%qpb!D_kAi?Zf<WcU87RQ]3NZ0X.IH+SR\nDPBN$#K=}|Gz8xCvA3?r0<o:,l*6i'3f$d\"b>=_^z987vXt3r~0o{my+jiu'fr$pba`Ckj\\hZf<dcU87R54\\210XJI,GS)\n(PO%ML\"JI|Gzy7wvA@?r=p;:,+7)54g%$d/.>=<;]y87YX4V21p|{m,+wvu'feqpbamCBji[>=edVUT`R5P3NZ0KWIUT*R\nDC&N@#\"~}|GF87wvA@s1qp;-m87654&%1dc.>`_^zy87YXts21}|.z,kj)(g&%qpbamCkj\\[g=<dcUa7_^PONZYKWI,+FR\nQC&A$?K~<H{9yDC54ts>=p.:ml*6i'3fed\"!~`<{]\\8ZvuW3r~0|.mlx*iu'feqpo!`lB]i?ZfXWc9T`65P\\[1YXJI,+SE\nDC&%@#>=I|:F87w54@?1q<o-9l*)('3%ed\"ba}_^zy87Yu4Vrqpo{-lx*v(gf%qp\"aml^Ai[>=ed:98`R^PO2ZY/.-,+SR\nDCOA$?K=}|:zy7CB4@21qp;n,8k6i'3f$#/!~=_^:\\[wv54s21p|.-,kjvhg&ed#oaDlB]i?Z=eWV9T`6Q]O21YXJI,TS)\nDP&N$?K~<|Gzyx6Bu3?1=/o:,+k)i'32e0c!~`<^:yx7YXt321pon-lx*iugse$pbamC^]\\hZf<Wc9T7_^4O21YKJV,GSR\nDC&A$?K~}|GFyDC5u@s1qp;nm8*)5'3f$0cba`_{]9xZ6X4s21}|n-,kjvh'fr$coaDC^]i?Zf<d:UT7_^P\\NZ0/.I,+SR\nDP&AM?K~<H{F8xwvA@s>=/on9+kj(hg%1#\"!~`<{]y8Z6XtsU1ponz,x*iu'f%q#oaDC^A@hg=XdVU8SR5]\\2Z0KW-HGFE\n(C&%MLK=I;:F87w5u321=p;:,+76ih&f$0c!~}_{]y87YXtV2qp|nm,k*i(tsr$co!`_k]@?Zf<Wcb87_^PO[ML/WVU+SR\n(CON@L>~<H{9EDwvu@21=p.-m8*6i'3f10c!a=_^z98wvXts21}/{-lx*vhg&rq#\"!DCkj@hg=<d:U87_54ON1YKW-HT*)\n('&N$?K~<|Gz87wvA321=/;-9l*6ihg%10c!~`<^z\\x7YXtVr~0/.m,+wvhts%qco!`lBA\\?Z=edV98S_Q]O21YKJIUTFE\nQ'BN$#\"~<|GFy7CBAt?1qp;n,8kj(4&%e0/ba`|{]9xZvuW3U1}|n-,kwvhg&%q#o!`lBj\\[gYXd:Ua7_^P\\[M0XJ-HT*E\nQCONM?K~<H{zyDwvA@2rq/;:,l*6i'3%1#\"!~`<{]y[w6Xts2q0o{z,x*iu'f%qc\"aDCk]\\h>YedVU8S6Q]321YX.VUG*)\n(C&%ML>JI|G9Ex6Bu@sr0p;:,lk)5'3%ed\"ba}_^z9xZ6uWsUq0|nmy+ji(tf%qpba`CBA@[>=eWVUa`R^PO2ML/WI,T*E\nQ'BAM?\"~<H{9E7w5A@21q<;:m8k6i'3f$d\"ba`<{]9x7vXWs21}/{-l+wiu'fr$pb!DCkj\\[gY<;VU87_QPO[ZLXJI,+F)\nDC&N$?K~<;:9E7wvA@21=/;:,+k65h&f10c!~`<;:9[Z6uW3r1p/{m,+wihtsrqpbam_^Ai[Z=ed:baS_54O21LX.-U+FE\nQ'BN$#\"J<|GFy7CBAt21qp;:9+76(4&%e0/ba`|^zy87v5tVr1}|.zykjiug&%qponm_^j\\[gYX;:UT7_^P32MYKJI,+F)\n(CBA$L>=I;:z8D6vA@2>q<.n,l*6i'32e0/.>=_{zy8wYXtsU10|.-y+wvhg&e$#baDC^A\\h>=<dVU87_54321YX.IH+*)\nDC&%MLK~I|G9Ex6Bu@srqp;:,8kj('&%ed\"b>}_^zy87YXWVr1}|nmy+*vuts%qpbaDl^]i[>=XdcU8SR^PO2MY/WI,T*E\nQ'BAM?>=}|Gzy7wvu@21q<;n9+kj54&fe#cb>=_^z98wYXW3r~0o{m,k*vhg&rqp\"n`lB]i?Zfed:baSR54O[MLKW-HT*E\nDPON$?K~<|G9yx6Bu3?1=/.-9l*6i43f10c!~`<;:9[Z6uW3r1}o{-lx*iut&%d#\"nm_^A\\hgf<Wc9TSR^4O21YKJV,GSR\nDC&A$?K~}H{9Ex6vA@s1qp.:9+*j54&%e0/.>}_^zy87Y5t32~0o{-lkjih'fr$coaDCkj\\[>fe;:ba`6Q]3NMYK.I,+SR\nDP&AM?K~<H{F8x6Bu3?r0/.-9+kj5h3f$#\"!~`<{]\\8Z6uW3r~po{mlx*iu'feqpo!`lB]i?ZfXWc9T`65P\\[1YX.V,GS)\n('BN$?KJ}H:9Ex6B43?>0<o-9l*j5'g%ed\".~=<^zy87YXtVr~}|nmykw)htsr$co!`CkA\\[>=XdcUa`_^PO21Y/W-,+SR\n(P&AM#>~<H{9EDwv4@21q<.:9+kj54&%ed\".>=_^z9[w6X4s21p/nzykjvhgs%$ponDlB]i?ZYeWVU87R54\\NM0XJIUGF)\nDCO%ML\"=IHGFE7wvAt?rqp.:,+k654gf$T/RQ\n","language":"Malbolge"},{"code":"> StringTools:-Encode( \"The Quick Brown Fox Jumped Over The Lazy Dog!\", encoding = rot13 );\n \"Gur Dhvpx Oebja Sbk Whzcrq Bire Gur Ynml Qbt!\"\n","language":"Maple"},{"code":"Rot13[s_] := StringReplace[\n s,\n # -> RotateLeft[#, 13] & @* CharacterRange @@ # &[\n {\"a\", \"z\"}, {\"A\", \"Z\"}\n ] // Thread\n]\nRot13[\"Hello World!\"]\nRot13[%]\n","language":"Mathematica"},{"code":"function r=rot13(s)\n if ischar(s)\n r=s; % preallocation and copy of non-letters\n for i=1:size(s,1)\n for j=1:size(s,2)\n if isletter(s(i,j))\n if s(i,j)>=97 % lower case\n base = 97;\n else % upper case\n base = 65;\n end\n r(i,j)=char(mod(s(i,j)-base+13,26)+base);\n end\n end\n end\n else\n error('Argument must be a CHAR')\n end\nend\n","language":"MATLAB"},{"code":">> rot13('Hello World!')\n\nans =\n\nUryyb Jbeyq!\n","language":"MATLAB"},{"code":"function text = rot13(text)\n if ischar(text)\n\n selectedLetters = ( (text >= 'A') & (text <= 'Z') ); %Select upper case letters\n text(selectedLetters) = char( mod( text(selectedLetters)-'A'+13,26 )+'A' );\n\n selectedLetters = ( (text >= 'a') & (text <= 'z') ); %Select lower case letters\n text(selectedLetters) = char( mod( text(selectedLetters)-'a'+13,26 )+'a' );\n\n else\n error('Argument must be a string.')\n end\nend\n","language":"MATLAB"},{"code":">> plainText = char((64:123))\n\nplainText =\n\n@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{\n\n>> rot13(plainText)\n\nans =\n\n@NOPQRSTUVWXYZABCDEFGHIJKLM[\\]^_`nopqrstuvwxyzabcdefghijklm{\n","language":"MATLAB"},{"code":"rot13(a) := simplode(map(ascii, map(lambda([n],\n if (n >= 65 and n <= 77) or (n >= 97 and n <= 109) then n + 13\n elseif (n >= 78 and n <= 90) or (n >= 110 and n <= 122) then n - 13\n else n), map(cint, sexplode(a)))))$\n\nlowercase: \"abcdefghijklmnopqrstuvwxyz\"$\nuppercase: \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"$\n\nrot13(lowercase);\n\"nopqrstuvwxyzabcdefghijklm\"\n\nrot13(uppercase);\n\"NOPQRSTUVWXYZABCDEFGHIJKLM\"\n\nrot13(\"The quick brown fox jumps over the lazy dog\");\n\"Gur dhvpx oebja sbk whzcf bire gur ynml qbt\"\n\nrot13(%);\n\"The quick brown fox jumps over the lazy dog\"\n","language":"Maxima"},{"code":":- module rot13.\n\n:- interface.\n\n:- import_module io.\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\n\n:- import_module string, set, list, char, int.\n:- type transition == {character, character}.\n:- type transitions == set(transition).\n:- type rot_kind\n ---> encrypt\n ; decrypt.\n\n:- pred build_transition(int::in, rot_kind::in, int::in, int::in, character::in,\n transitions::in, transitions::out) is det.\nbuild_transition(Offset, Kd, Lb, Ub, Ch, St, Rs) :-\n (\n Kd = encrypt,\n Diff = to_int(Ch) + Offset\n ;\n Kd = decrypt,\n Diff = to_int(Ch) - Offset\n ),\n (if (Diff >= (Ub + 0x01))\n then Ct = {Ch, det_from_int(Lb + (Diff - Ub) - 0x01) `with_type` char}\n else if (Diff =< (Lb - 0x01))\n then Ct = {Ch, det_from_int(Ub - (Lb - Diff) + 0x01) `with_type` char}\n else Ct = {Ch, det_from_int(Diff) `with_type` char}),\n union(St, make_singleton_set(Ct), Rs).\n\n:- pred generate_alpha_transition(int::in, rot_kind::in, transitions::out) is det.\ngenerate_alpha_transition(N, Kd, Ts) :-\n Offset = N mod 0x1A,\n to_char_list(\"abcdefghijklmnopqrstuvwxyz\", Lower),\n to_char_list(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\", Upper),\n foldl(build_transition(Offset, Kd, 0x61, 0x7A), Lower, init, Ts0),\n foldl(build_transition(Offset, Kd, 0x41, 0x5A), Upper, Ts0, Ts).\n\n:- pred rot(transitions::in, string::in, string::out) is det.\nrot(Ts, Base, Result) :-\n to_char_list(Base, Fragment),\n map((pred(Ch::in, Rs::out) is det :-\n promise_equivalent_solutions [Rs]\n (if member({Ch, Nx}, Ts)\n then Rs = Nx\n else Rs = Ch)\n ), Fragment, Result0),\n from_char_list(Result0, Result).\n\n:- pred invoke_line(transitions::in, string::in, text_input_stream::in, io::di, io::uo) is det.\ninvoke_line(Ts, File, Stream, !IO) :-\n read_line_as_string(Stream, Line, !IO),\n (\n Line = ok(Base),\n rot(Ts, Base, Rot),\n write_string(Rot, !IO),\n invoke_line(Ts, File, Stream, !IO)\n ;\n Line = error(_),\n format(\"Can't read correctly the file %s.\\n\", [s(File)], !IO)\n ;\n Line = eof\n ).\n\n:- pred handle_files(transitions::in, list(string)::in, io::di, io::uo) is det.\nhandle_files(_, [], !IO).\nhandle_files(Ts, [Head|Tail], !IO) :-\n open_input(Head, Result, !IO),\n (\n Result = ok(Stream),\n invoke_line(Ts, Head, Stream, !IO),\n close_input(Stream, !IO)\n ;\n Result = error(_),\n format(\"Can't open the file %s.\\n\", [s(Head)], !IO)\n ),\n handle_files(Ts, Tail, !IO).\n\nmain(!IO) :-\n generate_alpha_transition(0x0D, encrypt, Table),\n command_line_arguments(Args, !IO),\n (\n Args = [_|_],\n handle_files(Table, Args, !IO)\n ;\n Args = [],\n invoke_line(Table, \"<stdin>\", stdin_stream, !IO)\n ).\n\n:- end_module rot13.\n","language":"Mercury"},{"code":"Sub Rot13\n EncodedString = \"\"\n For i = 1 To Text.GetLength(String)\n Code = Text.GetCharacterCode(Text.GetSubText(String, i, 1))\n If Code >= 65 And Code <= 90 Then\n EncodedCode = Code + 13\n If EncodedCode > 90 Then\n EncodedCode = 64 + EncodedCode - 90\n EndIf\n ElseIf Code >= 97 And Code <= 122 Then\n EncodedCode = Code + 13\n If EncodedCode > 122 Then\n EncodedCode = 96 + EncodedCode - 122\n EndIf\n Else\n EncodedCode = Code\n EndIf\n EncodedString = EncodedString + Text.GetCharacter(EncodedCode)\n EndFor\nEndSub\n\nString = \"Rosetta Code\"\nRot13()\nTextWindow.WriteLine(EncodedString)\n","language":"Microsoft-Small-Basic"},{"code":"(\n \"(?i)[A-M]|([N-Z])\"\n (-> '== (-13) (13) if nip swap ord + chr)\n replace-apply\n) ^rot13\n","language":"Min"},{"code":"rot13 = function(s)\n chars = s.values\n for i in chars.indexes\n c = chars[i]\n if c >= \"a\" and c <= \"z\" then chars[i] = char(97 + (code(c)-97+13)%26)\n if c >= \"A\" and c <= \"Z\" then chars[i] = char(65 + (code(c)-65+13)%26)\n end for\n return chars.join(\"\")\nend function\n\nprint rot13(\"Hello world!\")\nprint rot13(\"Uryyb jbeyq!\")\n","language":"MiniScript"},{"code":"def rot13 (value:string)\n result = \"\"\n d = ' '.toCharArray[0]\n value.toCharArray.each do |c|\n testChar = Character.toLowerCase(c)\n if testChar <= 'm'.toCharArray[0] && testChar >= 'a'.toCharArray[0] then\n d = char(c + 13)\n end\n if testChar <= 'z'.toCharArray[0] && testChar >= 'n'.toCharArray[0] then\n d = char(c - 13)\n end\n result += d\n end\n result\nend\n\n\nputs rot13(\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\")\n","language":"Mirah"},{"code":"fun readfile () = readfile []\n | x = let val ln = readln ()\n in if eof ln then\n rev x\n else\n readfile ` ln :: x\n end\n\nlocal\n\tval lower_z = ord #\"z\";\n\tval upper_z = ord #\"Z\";\n\tval lower_a = ord #\"a\";\n\tval upper_a = ord #\"A\";\n\t\n\tfun which\n\t\t\t(c_upper c) = (upper_a, upper_z)\n\t\t|\t_\t = (lower_a, lower_z)\n\t\t;\n\t\n\tfun scale\n\t\t\t(c, az) where (c > #1 az) = scale( (#0 az + (c - #1 az - 1)), az)\n\t\t|\t(c, az) \t\t = c\n\t\t\t\nin\n\tfun rot13\n\t\t\t([], t) \t\t\t = implode ` rev t\n\t\t|\t(x :: xs, t) where (c_alphabetic x) = rot13 (xs, (chr ` scale (ord x + 13, which x)) :: t)\n\t\t|\t(x :: xs, t) = rot13 (xs, x :: t)\n\t\t|\ts \t\t\t\t = rot13 (explode s, [])\nend;\n\nmap (println o rot13) ` readfile ();\n","language":"MLite"},{"code":"// main registers\np\tIS\t$255\t% text pointer\nc\tGREG\t\t% char\ncc\tGREG\t\t% uppercase copy of c\nu\tGREG\t\t% all purpose\n\n\tLOC\tData_Segment\n\tGREG\t@\nTest\tBYTE\t\"dit is een bericht voor de keizer\",#a,0\n\n\tLOC\t#100\nMain\tLDA\tp,Test\n\tTRAP\t0,Fputs,StdOut\t% show text to encrypt\n\tLDA\tp,Test\t\t% points to text to encrypt\n\tJMP\t4F\n// do in place text encryption\n\t\t\t\t% REPEAT\n2H\tADD\tcc,c,0\t\t% copy char\n\tSUB\tcc,cc,' '\t% make uppercase\n\tCMP\tu,cc,'A'\n\tBN\tu,3F\t\t% IF c < 'A' OR c > 'Z' THEN next char\n\tCMP\tu,cc,'Z'\n\tBP\tu,3F\n\tCMP\tu,cc,'N'\t% ELSE\n\tBN\tu,1F\t\t% IF c < 'N' THEN encrypt 'up'\n\tSUB\tc,c,26\t\t% ELSE char ready for encrypt 'down'\n1H\tINCL\tc,13\t\t% encrypt char\n\tSTBU\tc,p\t\t% replace char with encrypted char\n3H\tINCL\tp,1\t\t% move to next char\n4H\tLDBU\tc,p\t\t% get next char\n\tPBNZ\tc,2B\t\t% UNTIL EOT\n// print result\n\tLDA\tp,Test\n\tTRAP\t0,Fputs,StdOut\t% show encrypted text\n\tTRAP\t0,Halt,0\n","language":"MMIX"},{"code":"MODULE Rot13;\n\nFROM STextIO IMPORT\n ReadString, WriteString, WriteLn;\nFROM Strings IMPORT\n Length;\n\nTYPE\n MyString = ARRAY [0..80] OF CHAR;\n\nVAR\n S, T : MyString;\n\nPROCEDURE Rot13(S : ARRAY OF CHAR; VAR T : ARRAY OF CHAR);\nVAR\n I, J : CARDINAL;\nBEGIN\n FOR I := 0 TO Length(S) - 1\n DO\n J := ORD(S[I]);\n IF ((J >= 65) AND (J <= 90)) THEN\n J := (J - 52) % 26 + 65;\n IF ((J >= 97) AND (J <= 122)) THEN\n J := (J - 84) % 26 + 97;\n T[I] := CHR(J);\n END;\nEND Rot13;\n\nBEGIN\n WHILE NOT Eof\n DO\n ReadString(S);\n SkipLine;\n WriteLn;\n Rot13(S, T);\n WriteString(T);\n WriteLn;\n END;\nEND Rot13.\n","language":"Modula-2"},{"code":"MODULE Rot13 EXPORTS Main;\n\nIMPORT Stdio, Rd, Wr;\n\nVAR c: CHAR;\n\n<*FATAL ANY*>\n\nBEGIN\n WHILE NOT Rd.EOF(Stdio.stdin) DO\n c := Rd.GetChar(Stdio.stdin);\n IF c >= 'A' AND c <= 'M' OR c >= 'a' AND c <= 'm' THEN\n c := VAL(ORD((ORD(c) + 13)), CHAR);\n ELSIF c >= 'N' AND c <= 'Z' OR c >= 'n' AND c <= 'z' THEN\n c := VAL(ORD((ORD(c) - 13)), CHAR);\n END;\n Wr.PutChar(Stdio.stdout, c);\n END;\nEND Rot13.\n","language":"Modula-3"},{"code":"100 REM ROT-13\n110 CLS : REM 110 HOME for Applesoft BASIC\n120 INPUT \"Enter a string: \";a$\n130 GOSUB 160\n140 PRINT b$\n150 END\n160 REM FUNCTION rot13\n170 FOR i = 1 TO LEN(a$)\n180 n = ASC(MID$(a$,i,1))\n190 e = 255\n200 IF n > 64 AND n < 91 THEN e = 90 : REM uppercase\n210 IF n > 96 AND n < 123 THEN e = 122 : REM lowercase\n220 IF e < 255 THEN n = n+13\n230 IF n > e THEN n = n-26\n240 b$ = b$+CHR$(n)\n250 NEXT\n260 RETURN\n","language":"MSX-Basic"},{"code":"Rot13(in)\tNew low,rot,up\n\tSet up=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n\tSet low=\"abcdefghijklmnopqrstuvwxyz\"\n\tSet rot=$Extract(up,14,26)_$Extract(up,1,13)\n\tSet rot=rot_$Extract(low,14,26)_$Extract(low,1,13)\n\tQuit $Translate(in,up_low,rot)\n\nWrite $$Rot13(\"Hello World!\") ; Uryyb Jbeyq!\nWrite $$Rot13(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\") ; NOPQRSTUVWXYZABCDEFGHIJKLM\n","language":"MUMPS"},{"code":"def rot13(plaintext)\n\tuppercase = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n\tlowercase = \"abcdefghijklmnopqrstuvwxyz\"\n\n\tcypher = \"\"\n\tfor char in plaintext\n\t\tif uppercase .contains. char\n\t\t\tcypher += uppercase[uppercase[char] - 13]\n\t\telse if lowercase .contains. char\n\t\t\tcypher += lowercase[lowercase[char] - 13]\n\t\telse\n\t\t\tcypher += char\n\t\tend\n\tend\n\n\treturn cypher\nend\n","language":"Nanoquery"},{"code":"/*\n ROT-13 in Neko\n*/\n\n/* Assume ASCII encoding */\nvar rotate13 = function(c) {\n if (c >= 65 && c <= 77) || (c >= 97 && c <= 109)\n c += 13\n else\n if (c >= 78 && c <= 90) || (c >= 110 && c <= 122)\n c -= 13\n return c\n}\n\nvar rot13 = function(s) {\n var r = $scopy(s)\n var len = $ssize(r)\n var pos = 0\n while pos < len {\n $sset(r, pos, rotate13($sget(r, pos)))\n pos += 1\n }\n return r\n}\n\nvar msg = $loader.args[0]\nif msg == null {\n var testing = \"[abcdefghijklmnopqrstuvwxyz 0123456789 ABCDEFGHIJKLMNOPQRSTUVWXYZ]\"\n $print(testing, \"\\n\", replaced = rot13(testing), \"\\n\")\n $print(rot13(replaced), \"\\n\")\n $print(\"\\n\")\n msg = \"The secret message said \\\"Open Sesame!\\\"\"\n}\n$print(msg, \"\\n\", replaced = rot13(msg), \"\\n\")\n$print(rot13(replaced), \"\\n\")\n","language":"Neko"},{"code":"/* NetRexx */\noptions replace format comments java crossref savelog symbols nobinary\n\nparse arg fileNames\n\nrdr = BufferedReader\n\ndo\n if fileNames.length > 0 then do\n loop n_ = 1 for fileNames.words\n fileName = fileNames.word(n_)\n rdr = BufferedReader(FileReader(File(fileName)))\n encipher(rdr)\n end n_\n end\n else do\n rdr = BufferedReader(InputStreamReader(System.in))\n encipher(rdr)\n end\ncatch ex = IOException\n ex.printStackTrace\nend\n\nreturn\n\nmethod encipher(rdr = BufferedReader) public static signals IOException\n\n loop label l_ forever\n line = rdr.readLine\n if line = null then leave l_\n say rot13(line)\n end l_\n return\n\nmethod rot13(input) public static signals IllegalArgumentException\n\n return caesar(input, 13, isFalse)\n\nmethod caesar(input = Rexx, idx = int, caps = boolean) public static signals IllegalArgumentException\n\n if idx < 1 | idx > 25 then signal IllegalArgumentException()\n\n -- 12345678901234567890123456\n itab = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\n shift = itab.length - idx\n parse itab tl +(shift) tr\n otab = tr || tl\n\n if caps then input = input.upper\n\n cipher = input.translate(itab || itab.lower, otab || otab.lower)\n\n return cipher\n\nmethod caesar_encipher(input = Rexx, idx = int, caps = boolean) public static signals IllegalArgumentException\n\n return caesar(input, idx, caps)\n\nmethod caesar_decipher(input = Rexx, idx = int, caps = boolean) public static signals IllegalArgumentException\n\n return caesar(input, int(26) - idx, isFalse)\n\nmethod caesar_encipher(input = Rexx, idx = int) public static signals IllegalArgumentException\n\n return caesar(input, idx, isFalse)\n\nmethod caesar_decipher(input = Rexx, idx = int) public static signals IllegalArgumentException\n\n return caesar(input, int(26) - idx, isFalse)\n\nmethod caesar_encipher(input = Rexx, idx = int, opt = Rexx) public static signals IllegalArgumentException\n\n return caesar(input, idx, opt)\n\nmethod caesar_decipher(input = Rexx, idx = int, opt = Rexx) public static signals IllegalArgumentException\n\n return caesar(input, int(26) - idx, opt)\n\nmethod caesar(input = Rexx, idx = int, opt = Rexx) public static signals IllegalArgumentException\n\n if opt.upper.abbrev('U') >= 1 then caps = isTrue\n else caps = isFalse\n\n return caesar(input, idx, caps)\n\nmethod caesar(input = Rexx, idx = int) public static signals IllegalArgumentException\n\n return caesar(input, idx, isFalse)\n\nmethod isTrue public static returns boolean\n return (1 == 1)\n\nmethod isFalse public static returns boolean\n return \\isTrue\n","language":"NetRexx"},{"code":"(define (rot13 str)\n (join\n (map\n (fn(c)\n (cond\n ((<= \"A\" (upper-case c) \"M\") (char (+ (char c) 13)))\n ((<= \"N\" (upper-case c) \"Z\") (char (- (char c) 13)))\n (true c)))\n (explode str))))\n","language":"NewLISP"},{"code":"import strutils\n\nproc rot13(c: char): char =\n case toLowerAscii(c)\n of 'a'..'m': chr(ord(c) + 13)\n of 'n'..'z': chr(ord(c) - 13)\n else: c\n\nfor line in stdin.lines:\n for c in line:\n stdout.write rot13(c)\n stdout.write \"\\n\"\n","language":"Nim"},{"code":"bundle Default {\n class Rot13 {\n function : Main(args : String[]) ~ Nil {\n Rot13(\"nowhere ABJURER\")->PrintLine();\n }\n\n function : native : Rot13(text : String) ~ String {\n rot := \"\";\n each(i : text) {\n c := text->Get(i);\n if(c >= 'a' & c <= 'm' | c >= 'A' & c <= 'M') {\n rot->Append(c + 13);\n }\n else if(c >= 'n' & c <= 'z' | c >= 'N' & c <= 'Z') {\n rot->Append(c - 13);\n }\n else {\n rot->Append(c);\n };\n };\n\n return rot;\n }\n }\n}\n","language":"Objeck"},{"code":"let rot13 c = match c with\n | 'A'..'M' | 'a'..'m' -> char_of_int (int_of_char c + 13)\n | 'N'..'Z' | 'n'..'z' -> char_of_int (int_of_char c - 13)\n | _ -> c\n","language":"OCaml"},{"code":"let rot13_str s =\n let len = String.length s in\n let result = String.create len in\n for i = 0 to len - 1 do\n result.[i] <- rot13 s.[i]\n done;\n result\n\n(* or in OCaml 4.00+:\n let rot13_str = String.map rot13\n*)\n","language":"OCaml"},{"code":"let () =\n try while true do\n String.iter (fun c -> print_char (rot13 c)) (read_line());\n print_newline()\n done with End_of_file -> ()\n","language":"OCaml"},{"code":": encryptRot13(c)\n c dup isLetter ifFalse: [ return ]\n isUpper ifTrue: [ 'A' ] else: [ 'a' ] c 13 + over - 26 mod + ;\n\n: rot13 map(#encryptRot13) charsAsString ;\n","language":"Oforth"},{"code":"(import (scheme char))\n\n(define (rot13 str)\n (runes->string (map (lambda (ch)\n (+ ch (cond\n ((char-ci<=? #\\a ch #\\m)\n 13)\n ((char-ci<=? #\\n ch #\\z)\n -13)\n (else 0))))\n (string->runes str))))\n\n(define str \"`What a curious feeling!' said Alice; `I must be shutting up like a telescope.'\")\n(print (rot13 str))\n(print (rot13 (rot13 str)))\n","language":"Ol"},{"code":"declare\n fun {RotChar C}\n if C >= &A andthen C =< &Z then &A + (C - &A + 13) mod 26\n elseif C >= &a andthen C =< &z then &a + (C - &a + 13) mod 26\n else C\n end\n end\n\n fun {Rot13 S}\n {Map S RotChar}\n end\nin\n {System.showInfo {Rot13 \"NOWHERE Abjurer 42\"}}\n {System.showInfo {Rot13 {Rot13 \"NOWHERE Abjurer 42\"}}}\n","language":"Oz"},{"code":"rot13(s)={\n s=Vecsmall(s);\n for(i=1,#s,\n if(s[i]>109&s[i]<123,s[i]-=13,if(s[i]<110&s[i]>96,s[i]+=13,if(s[i]>77&s[i]<91,s[i]-=13,if(s[i]<78&s[i]>64,s[i]+=13))))\n );\n Strchr(s)\n};\n","language":"PARI-GP"},{"code":"program rot13;\n\nvar\n line: string;\n\n function rot13(someText: string): string;\n\n var\n i: integer;\n ch: char;\n result: string;\n\n begin\n result := '';\n for i := 1 to Length(someText) do\n begin\n ch := someText[i];\n case ch of\n 'A' .. 'M', 'a' .. 'm':\n ch := chr(ord(ch)+13);\n 'N' .. 'Z', 'n' .. 'z':\n ch := chr(ord(ch)-13);\n end;\n result := result + ch;\n end;\n rot13 := result;\n end;\n\nbegin\n while not eof(input) do\n begin\n readln(line);\n writeln(rot13(line));\n end;\nend.\n","language":"Pascal"},{"code":"sub rot13 {\n shift =~ tr/A-Za-z/N-ZA-Mn-za-m/r;\n}\n\nprint rot13($_) while (<>);\n","language":"Perl"},{"code":"perl -pe 'tr/A-Za-z/N-ZA-Mn-za-m/'\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">rot13</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">ch</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">upper</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #008000;\">'A'</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #008000;\">'Z'</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #008000;\">'M'</span><span style=\"color: #0000FF;\">,+</span><span style=\"color: #000000;\">13</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">13</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">s</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">rot13</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"abjurer NOWHERE.\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"echo str_rot13('foo'), \"\\n\";\n","language":"PHP"},{"code":"<?php\nfunction rot13($s) {\n return strtr($s, 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz',\n 'NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm');\n}\n\necho rot13('foo'), \"\\n\";\n?>\n","language":"PHP"},{"code":"go =>\n S = \"Big fjords vex quick waltz nymph!\",\n println(S),\n println(rot13(S)),\n println(rot13(rot13(S))),\n nl.\n\n% Rot 13 using a map\nrot13(S) = S2 =>\n lower(Lower),\n upper(Upper),\n M = create_map(Lower, Upper),\n % If a char is not in a..zA..z then show it as it is.\n S2 := [M.get(C,C) : C in S].\n\ncreate_map(Lower, Upper) = M =>\n M = new_map(),\n Len = Lower.length,\n LDiv := Lower.length div 2,\n foreach(I in 1..Len)\n II = (LDiv+I) mod Len,\n if II == 0 then II := Len end,\n M.put(Upper[I],Upper[II]),\n M.put(Lower[I],Lower[II])\n end.\n\nlower(\"abcdefghijklmnopqrstuvwxyz\").\nupper(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\").\n","language":"Picat"},{"code":"(de rot13-Ch (C)\n (if\n (or\n (member C '`(apply circ (chop \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")))\n (member C '`(apply circ (chop \"abcdefghijklmnopqrstuvwxyz\"))) )\n (get @ 14)\n C ) )\n","language":"PicoLisp"},{"code":"(de rot13-Ch (C)\n (cond\n ((>= \"M\" (uppc C) \"A\")\n (char (+ (char C) 13)) )\n ((>= \"Z\" (uppc C) \"N\")\n (char (- (char C) 13)) )\n (T C) ) )\n","language":"PicoLisp"},{"code":"(de rot13-stdIn ()\n (while (line)\n (prinl (mapcar rot13-Ch @)) ) )\n","language":"PicoLisp"},{"code":"import Crypto;\n\nint main(){\n string r = rot13(\"Hello, World\");\n write(r + \"\\n\");\n}\n","language":"Pike"},{"code":"rotate: procedure (in) options (main); /* 2 March 2011 */\n declare in character (100) varying;\n declare line character (500) varying;\n declare input file;\n\n open file (input) title ('/' || in || ',type(text),recsize(500)' );\n\n on endfile (input) stop;\n\n do forever;\n get file (input) edit (line) (L);\n line = translate (\n line, 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz',\n 'NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm');\n put edit (line) (a); put skip;\n end;\nend;\n","language":"PL-I"},{"code":"rot13_test:\n procedure options(main);\n\n %replace\n true by '1'b,\n false by '0'b;\n\n dcl (plain, encoded) char(127) varying;\n\n plain = 'The quick brown fox jumps over the lazy red dog.';\n put skip list ('Plain text:', plain);\n encoded = rot13(plain);\n put skip list ('Encoded :', encoded);\n put skip list ('Restored :', rot13(encoded));\n\n stop;\n\nrot13:\n procedure (s) returns (char(127) varying);\n dcl\n s char(127) varying,\n ch char(1),\n i fixed bin(15);\n do i = 1 to length(s);\n ch = substr(s,i,1);\n if (isalpha(ch)) then\n do;\n if (toupper(ch) > 'M') then\n ch = ascii(rank(ch) - 13);\n else\n ch = ascii(rank(ch) + 13);\n end;\n substr(s,i,1) = ch;\n end;\n return (s);\n end rot13;\n\ntoupper:\n procedure (ch) returns (char(1));\n dcl ch char(1);\n dcl cout char(1);\n if ((ch >= 'a') & (ch <= 'z')) then\n cout = ascii(rank(ch) - 32);\n else\n cout = ch;\n return (cout);\n end toupper;\n\nisalpha:\n procedure (ch) returns (bit(1));\n dcl ch char(1);\n if (((ch >= 'A') & (ch <= 'Z')) |\n ((ch >= 'a') & (ch <= 'z'))) then\n return (true);\n else\n return (false);\n end isalpha;\n\n\nend rot13_test;\n","language":"PL-I-80"},{"code":"-- Works for VARCHAR2 (up to 32k chars)\nCREATE OR REPLACE FUNCTION fn_rot13_native(p_text VARCHAR2) RETURN VARCHAR2 IS\n c_source CONSTANT VARCHAR2(52) := 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz';\n c_target CONSTANT VARCHAR2(52) := 'NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm';\nBEGIN\n RETURN TRANSLATE(p_text, c_source, c_target);\nEND;\n/\n\n-- For CLOBs (translate only works with VARCHAR2, so do it in chunks)\nCREATE OR REPLACE FUNCTION fn_rot13_clob(p_text CLOB) RETURN CLOB IS\n c_source CONSTANT VARCHAR2(52) := 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz';\n c_target CONSTANT VARCHAR2(52) := 'NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm';\n c_chunk_size CONSTANT PLS_INTEGER := 4000;\n v_result CLOB := NULL;\nBEGIN\n FOR i IN 0..TRUNC(LENGTH(p_text) / c_chunk_size) LOOP\n v_result := v_result ||\n TRANSLATE(dbms_lob.substr(p_text, c_chunk_size, i * c_chunk_size + 1), c_source, c_target);\n END LOOP;\n RETURN v_result;\nEND;\n/\n\n-- The full algorithm (Slower. And MUCH slower if using CLOB!)\nCREATE OR REPLACE FUNCTION fn_rot13_algorithm(p_text VARCHAR2) RETURN CLOB IS\n c_upper_a CONSTANT PLS_INTEGER := ASCII('A');\n c_lower_a CONSTANT PLS_INTEGER := ASCII('a');\n v_rot VARCHAR2(32000);\n v_char VARCHAR2(1);\nBEGIN\n FOR i IN 1..LENGTH(p_text) LOOP\n v_char := SUBSTR(p_text, i, 1);\n IF v_char BETWEEN 'A' AND 'Z' THEN\n v_rot := v_rot || CHR(MOD(ASCII(v_char) - c_upper_a + 13, 26) + c_upper_a);\n ELSIF v_char BETWEEN 'a' AND 'z' THEN\n v_rot := v_rot || CHR(MOD(ASCII(v_char) - c_lower_a + 13, 26) + c_lower_a);\n ELSE\n v_rot := v_rot || v_char;\n END IF;\n END LOOP;\n RETURN v_rot;\nEND;\n/\n","language":"PL-SQL"},{"code":"define rot13(s);\n lvars j, c;\n for j from 1 to length(s) do\n s(j) -> c;\n if `A` <= c and c <= `M` or `a` <= c and c <= `m` then\n c + 13 -> s(j);\n elseif `N` <= c and c <= `Z` or `n` <= c and c <= `z` then\n c - 13 -> s(j);\n endif;\n endfor;\n s;\nenddefine;\n\nrot13('NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm') =>\n","language":"Pop11"},{"code":"/r13 {\n4 dict begin\n /rotc {\n {\n {{{64 gt} {91 lt}} all?} {65 - 13 + 26 mod 65 +} is?\n {{{95 gt} {123 lt}} all?} {97 - 13 + 26 mod 97 +} is?\n } cond\n }.\n {rotc} map cvstr\nend}.\n","language":"PostScript"},{"code":"#COMPILE EXE\n#COMPILER PBWIN 9.05\n#DIM ALL\n\nFUNCTION ROT13(BYVAL a AS STRING) AS STRING\n LOCAL p AS BYTE PTR\n LOCAL n AS BYTE, e AS BYTE\n LOCAL res AS STRING\n\n res = a\n p = STRPTR(res)\n n = @p\n DO WHILE n\n SELECT CASE n\n CASE 65 TO 90\n e = 90\n n += 13\n CASE 97 TO 122\n e = 122\n n += 13\n CASE ELSE\n e = 255\n END SELECT\n\n IF n > e THEN\n n -= 26\n END IF\n @p = n\n INCR p\n n = @p\n LOOP\nFUNCTION = res\nEND FUNCTION\n\n'testing:\n\nFUNCTION PBMAIN () AS LONG\n#DEBUG PRINT ROT13(\"abc\")\n#DEBUG PRINT ROT13(\"nop\")\nEND FUNCTION\n","language":"PowerBASIC"},{"code":"$e = \"This is a test Guvf vf n grfg\"\n\n[char[]](0..64+78..90+65..77+91..96+110..122+97..109+123..255)[[char[]]$e] -join \"\"\n","language":"PowerShell"},{"code":"function Invoke-Rot13 {\n param(\n [char[]]$message\n )\n begin {\n $outString = New-Object System.Collections.ArrayList\n $alpha = 'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'\n $alphaL = $alpha + $alpha\n $alphaU = $alphaL.toUpper()\n $int = 13\n }\n process{\n $message | ForEach-Object {\n # test if char is special\n if ($_ -match '[^\\p{L}\\p{Nd}]') {\n $outString += $_\n }\n # test if char is digit\n elseif ($_ -match '\\d') {\n $outString += $_\n }\n # test if char is upperCase\n elseif ($_ -ceq $_.ToString().ToUpper()) {\n $charIndex = $alphaU.IndexOf($_.tostring())\n $outString += $alphaU[$charIndex+$int]\n }\n # test if char is lowerCase\n elseif ($_ -ceq $_.ToString().ToLower()) {\n $charIndex = $alphaL.IndexOf($_.tostring())\n $outString += $alphaL[$charIndex+$int]\n }\n else {\n $outString += $_\n }\n } # end foreach\n } # end process\n end {\n # output string and join all chars\n $outString -join \"\"\n }\n} # end function\n","language":"PowerShell"},{"code":"PS> $message = '{!This is /A\\ Test123}'\nPS> $messageE = Invoke-Rot13 -message $message\nPS> $messageE\nPS> Invoke-Rot13 -message $messageE\n{!Guvf vf /N\\ Grfg123}\n{!This is /A\\ Test123}\n","language":"PowerShell"},{"code":":- use_module(library(ctypes)).\n\nruntime_entry(start) :-\n\tprompt(_, ''),\n\trot13.\n\nrot13 :-\n\tget0(Ch),\n\t( is_endfile(Ch) ->\n\t\ttrue\n\t; rot13_char(Ch, Rot),\n\t put(Rot),\n\t rot13\n\t).\n\nrot13_char(Ch, Rot) :-\n\t( is_alpha(Ch) ->\n\t\tto_upper(Ch, Up),\n\t\tLetter is Up - 0'A,\n\t\tRot is Ch + ((Letter + 13) mod 26) - Letter\n\t; Rot = Ch\n\t).\n","language":"Prolog"},{"code":"rot13(Str, SR) :-\n\tmaplist(rot, Str, Str1),\n\tstring_to_list(SR, Str1).\n\nrot(C, C1) :-\n\t( member(C, \"abcdefghijklmABCDEFGHIJKLM\") -> C1 is C+13;\n\t (\tmember(C, \"nopqrstuvwxyzNOPQRSTUVWXYZ\") -> C1 is C-13; C1 = C)).\n","language":"Prolog"},{"code":" ?- rot13(\"The Quick Brown Fox Jumped Over The Lazy Dog!\", SR).\nSR = \"Gur Dhvpx Oebja Sbk Whzcrq Bire Gur Ynml Qbt!\".\n","language":"Prolog"},{"code":"Declare.s Rot13(text_to_code.s)\n\nIf OpenConsole()\n Define txt$\n\n Print(\"Enter a string to encode: \"): txt$=Input()\n\n PrintN(\"Coded : \"+Rot13(txt$))\n PrintN(\"Decoded: \"+Rot13(Rot13(txt$)))\n\n Print(\"Press ENTER to quit.\"): Input()\n CloseConsole()\nEndIf\n\nProcedure.s Rot13(s.s)\n Protected.i i\n Protected.s t, u\n For i=1 To Len(s)\n t=Mid(s,i,1)\n Select Asc(t)\n Case Asc(\"a\") To Asc(\"m\"), Asc(\"A\") To Asc(\"M\")\n t=chr(Asc(t)+13)\n Case Asc(\"n\") To Asc(\"z\"), Asc(\"N\") To Asc(\"Z\")\n t=chr(Asc(t)-13)\n EndSelect\n u+t\n Next\n ProcedureReturn u\nEndProcedure\n","language":"PureBasic"},{"code":">>> u'foo'.encode('rot13')\n'sbb'\n>>> 'sbb'.decode('rot13')\nu'foo'\n","language":"Python"},{"code":">>> import codecs\n>>> codecs.encode(\"The quick brown fox jumps over the lazy dog\", \"rot13\")\n'Gur dhvpx oebja sbk whzcf bire gur ynml qbt'\n>>> codecs.decode(_, \"rot13\")\n'The quick brown fox jumps over the lazy dog'\n","language":"Python"},{"code":"#!/usr/bin/env python\nimport string\n\nTRANSLATION_TABLE = str.maketrans(\n string.ascii_uppercase + string.ascii_lowercase,\n string.ascii_uppercase[13:] + string.ascii_uppercase[:13] +\n string.ascii_lowercase[13:] + string.ascii_lowercase[:13]\n)\n\n\ndef rot13(s):\n \"\"\"Return the rot-13 encoding of s.\"\"\"\n return s.translate(TRANSLATION_TABLE)\n\n\nif __name__ == \"__main__\":\n \"\"\"rot-13 encode the input files, or stdin if no files are provided.\"\"\"\n import fileinput\n for line in fileinput.input():\n print(rot13(line), end=\"\")\n","language":"Python"},{"code":"#!/usr/bin/env python\nfrom __future__ import print_function\nimport string\nlets = string.ascii_lowercase\nkey = {x:y for (x,y) in zip(lets[13:]+lets[:14], lets)}\nkey.update({x.upper():key[x].upper() for x in key.keys()})\nencode = lambda x: ''.join((key.get(c,c) for c in x))\nif __name__ == '__main__':\n \"\"\"Peform line-by-line rot-13 encoding on any files listed on our\n command line or act as a standard UNIX filter (if no arguments\n specified).\n \"\"\"\n import fileinput\n for line in fileinput.input():\n print(encode(line), end=\"\")\n","language":"Python"},{"code":"INPUT \"Enter a string: \", a$\nPRINT rot13$(a$)\nFUNCTION rot13$ (stg$)\n inlist$ = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\"\n outlist$ = \"NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm\"\n FOR n = 1 TO LEN(stg$)\n letter$ = MID$(stg$, n, 1)\n letpos = INSTR(inlist$, letter$)\n IF letpos = 0 THEN\n rotated$ = letter$\n ELSE\n rotated$ = MID$(outlist$, letpos, 1)\n END IF\n rot13$ = rot13$ + rotated$\n NEXT\nEND FUNCTION\n","language":"QB64"},{"code":"[ $ \"\" swap\n witheach\n [ dup char A char M 1+ within\n over char a char m 1+ within or\n iff [ 13 + ]\n else\n [ dup char N char Z 1+ within\n over char n char z 1+ within or\n if [ 13 - ] ]\n join ] ] is rot-13 ( $ --> $ )\n","language":"Quackery"},{"code":"rot13 <- function(x)\n{\n old <- paste(letters, LETTERS, collapse=\"\", sep=\"\")\n new <- paste(substr(old, 27, 52), substr(old, 1, 26), sep=\"\")\n chartr(old, new, x)\n}\nx <- \"The Quick Brown Fox Jumps Over The Lazy Dog!.,:;'#~[]{}\"\nrot13(x) # \"Gur Dhvpx Oebja Sbk Whzcf Bire Gur Ynml Qbt!.,:;'#~[]{}\"\nx2 <- paste(letters, LETTERS, collapse=\"\", sep=\"\")\nrot13(x2) # \"nNoOpPqQrRsStTuUvVwWxXyYzZaAbBcCdDeEfFgGhHiIjJkKlLmM\"\n","language":"R"},{"code":"#!/usr/bin/env racket\n#lang racket/base\n\n(define (run i o)\n (for ([ch (in-producer regexp-match #f #rx#\"[a-zA-Z]\" i 0 #f o)])\n (define b (bytes-ref (car ch) 0))\n (define a (if (< b 96) 65 97))\n (write-byte (+ (modulo (+ 13 (- b a)) 26) a))))\n\n(require racket/cmdline)\n(command-line\n #:help-labels \"(\\\"-\\\" specifies standard input)\"\n #:args files\n (for ([f (if (null? files) '(\"-\") files)])\n (if (equal? f \"-\")\n (run (current-input-port) (current-output-port))\n (call-with-input-file f (λ(i) (run i (current-output-port)))))))\n","language":"Racket"},{"code":"my @abc = 'a'..'z';\nmy $abc = [@abc».uc, @abc];\nput .trans: $abc => $abc».rotate(13) for lines\n","language":"Raku"},{"code":"$ raku -pe '.=trans: {$_ => $_».rotate(13)}({[$_».uc, @$_]}(\"a\"..\"z\"))'\n","language":"Raku"},{"code":"function ROT13 (InputTxt as string) as string\n dim i as integer, ascVal as byte\n Result = \"\"\n\n for i = 1 to len(InputTxt)\n ascVal = asc(InputTxt[i])\n\n select case ascVal\n case 65 to 77, 97 to 109\n Result = Result + chr$(ascVal + 13)\n case 78 to 90, 110 to 122\n Result = Result + chr$(ascVal - 13)\n case else\n Result = Result + chr$(ascVal)\n end select\n next\nend function\n\nInput \"Text to encode: \"; a$\nPrint ROT13(a$)\nInput \"Press a key to end...\"; a$\n","language":"RapidQ"},{"code":"define rot13 use $str\n $str each chr\n dup m/[A-Ma-m]/ if\n ord 13 + chr\n else\n dup m/[N-Zn-z]/ if\n ord 13 - chr\n $str length list \"\" join\n\n\"12!ABJURER nowhere\"\ndup print \"\\nas rot13 is\\n\" print\nrot13\nprint \"\\n\" print\n","language":"Raven"},{"code":"REBOL [\n Title: \"Rot-13\"\n URL: http://rosettacode.org/wiki/Rot-13\n]\n\n; Test data has upper and lower case characters as well as characters\n; that should not be transformed, like numbers, spaces and symbols.\n\ntext: \"This is a 28-character test!\"\n\nprint \"Using cipher table:\"\n\n; I build a set of correspondence lists here. 'x' is the letters from\n; A-Z, in both upper and lowercase form. Note that REBOL can iterate\n; directly over the alphabetic character sequence in the for loop. 'y'\n; is the cipher form, 'x' rotated by 26 characters (remember, I have\n; the lower and uppercase forms together). 'r' holds the final result,\n; built as I iterate across the 'text' string. I search for the\n; current character in the plaintext list ('x'), if I find it, I get\n; the corresponding character from the ciphertext list\n; ('y'). Otherwise, I pass the character through untransformed, then\n; return the final string.\n\nrot-13: func [\n\t\"Encrypt or decrypt rot-13 with tables.\"\n\ttext [string!] \"Text to en/decrypt.\"\n\t/local x y r i c\n] [\n\tx: copy \"\" for i #\"a\" #\"z\" 1 [append x rejoin [i uppercase i]]\n\ty: rejoin [copy skip x 26 copy/part x 26]\n\tr: copy \"\"\n\n\trepeat i text [append r either c: find/case x i [y/(index? c)][i]]\n\tr\n]\n\n; Note that I am setting the 'text' variable to the result of rot-13\n; so I can reuse it again on the next call. The rot-13 algorithm is\n; reversible, so I can just run it again without modification to decrypt.\n\nprint [\" Encrypted:\" text: rot-13 text]\nprint [\" Decrypted:\" text: rot-13 text]\n\n\nprint \"Using parse:\"\n\nclamp: func [\n\t\"Contain a value within two enclosing values. Wraps if necessary.\"\n\tx v y\n][\n\tx: to-integer x v: to-integer v y: to-integer y\n\tcase [v < x [y - v] v > y [v - y + x - 1] true v]\n]\n\n; I'm using REBOL's 'parse' word here. I set up character sets for\n; upper and lower-case letters, then let parse walk across the\n; text. It looks for matches to upper-case letters, then lower-case,\n; then skips to the next one if it can't find either. If a matching\n; character is found, it's mathematically incremented by 13 and\n; clamped to the appropriate character range. parse changes the\n; character in place in the string, hence this is a destructive\n; operation.\n\nrot-13: func [\n\t\"Encrypt or decrypt rot-13 with parse.\"\n\ttext [string!] \"Text to en/decrypt. Note: Destructive!\"\n] [\n\tu: charset [#\"A\" - #\"Z\"]\n\tl: charset [#\"a\" - #\"z\"]\n\n\tparse text [some [\n\t\t\ti: ; Current position.\n\t\t\tu (i/1: to-char clamp #\"A\" i/1 + 13 #\"Z\") | ; Upper case.\n\t\t\tl (i/1: to-char clamp #\"a\" i/1 + 13 #\"z\") | ; Lower case.\n\t\t\tskip]] ; Ignore others.\n\ttext\n]\n\n; As you see, I don't need to re-assign 'text' anymore.\n\nprint [\" Encrypted:\" rot-13 text]\nprint [\" Decrypted:\" rot-13 text]\n","language":"REBOL"},{"code":"{{\n : rotate ( cb-c ) tuck - 13 + 26 mod + ;\n : rotate? ( c-c )\n dup 'a 'z within [ 'a rotate ] ifTrue\n dup 'A 'Z within [ 'A rotate ] ifTrue ;\n---reveal---\n : rot13 ( s-s ) dup [ [ @ rotate? ] sip ! ] ^types'STRING each@ ;\n}}\n\n\"abcdef123GHIJKL\" rot13 dup puts cr rot13 puts\n\"abjurer NOWHERE\" rot13 puts\n","language":"Retro"},{"code":"/*REXX program encodes several example text strings using the ROT-13 algorithm. */\n$='foo' ; say \"simple text=\" $; say 'rot-13 text=' rot13($); say\n$='bar' ; say \"simple text=\" $; say 'rot-13 text=' rot13($); say\n$=\"Noyr jnf V, 'rer V fnj Ryon.\"; say \"simple text=\" $; say 'rot-13 text=' rot13($); say\n$='abc? ABC!' ; say \"simple text=\" $; say 'rot-13 text=' rot13($); say\n$='abjurer NOWHERE' ; say \"simple text=\" $; say 'rot-13 text=' rot13($); say\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nrot13: return translate( arg(1), 'abcdefghijklmABCDEFGHIJKLMnopqrstuvwxyzNOPQRSTUVWXYZ',,\n \"nopqrstuvwxyzNOPQRSTUVWXYZabcdefghijklmABCDEFGHIJKLM\")\n","language":"REXX"},{"code":"see \"enter a string : \" give s\nans = \"\"\nfor a = 1 to len(s)\n letter = substr(s, a, 1)\n if letter >= \"a\" and letter <= \"z\"\n char = char(ascii(letter) + 13)\n if char > \"z\" char = chr(asc(char) - 26) ok\n else\n if letter >= \"a\" and letter <= \"z\" char = char(ascii(letter) + 13) ok\n if char > \"z\" char = char(ascii(char) - 26) else char = letter ok\n ok\n ans = ans + char\nnext\nsee ans + nl\n","language":"Ring"},{"code":"# Returns a copy of _s_ with rot13 encoding.\ndef rot13(s)\n s.tr('A-Za-z', 'N-ZA-Mn-za-m')\nend\n\n# Perform rot13 on files from command line, or standard input.\nwhile line = ARGF.gets\n print rot13(line)\nend\n","language":"Ruby"},{"code":"INPUT \"Enter a string: \"; s$\nans$ = \"\"\nFOR a = 1 TO LEN(s$)\n letter$ = MID$(s$, a, 1)\n IF letter$ >= \"A\" AND letter$ <= \"Z\" THEN\n char$ = CHR$(ASC(letter$) + 13)\n IF char$ > \"Z\" THEN char$ = CHR$(ASC(char$) - 26)\n else\n if letter$ >= \"a\" AND letter$ <= \"z\" THEN char$ = CHR$(ASC(letter$) + 13)\n IF char$ > \"z\" THEN char$ = CHR$(ASC(char$) - 26) ELSE char$ = letter$\n END IF\n ans$ = ans$ + char$\nNEXT a\nPRINT ans$\n","language":"Run-BASIC"},{"code":"fn rot13(string: &str) -> String {\n string.chars().map(|c| {\n match c {\n 'a'..='m' | 'A'..='M' => ((c as u8) + 13) as char,\n 'n'..='z' | 'N'..='Z' => ((c as u8) - 13) as char,\n _ => c\n }\n }).collect()\n}\n\nfn main () {\n assert_eq!(rot13(\"abc\"), \"nop\");\n}\n","language":"Rust"},{"code":"comment\n Return the rot13 transformation of s, preserving case and\n passing non-alphabetic characters without change\nend\n\nfunction rot13(s = string) = string\n var i, k = integer\n var ch = char\n var normal, rotated = string\n normal = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\"\n rotated = \"NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm\"\n for i = 1 to len(s)\n ch = mid(s,i,1)\n k = instr(1,normal,ch)\n if k <> 0 then ch = mid(rotated,k,1)\n mid(s,i,1) = ch\n next i\nend = s\n\nrem - exercise the function\n\nvar plain, encoded = string\n\nplain = \"The quick brown fox jumps over the lazy red dog.\"\nencoded = rot13(plain)\nprint \"Plain text: \"; plain\nprint \"Encoded : \"; encoded\nprint \"Decoded : \"; rot13(encoded)\n\nend\n","language":"S-BASIC"},{"code":"variable old = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\";\nvariable new = \"NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm\";\n\ndefine rot13(s) {\n s = strtrans(s, old, new);\n return s;\n}\n\ndefine rot13_stream(s) {\n variable ln;\n while (-1 != fgets(&ln, s))\n fputs(rot13(ln), stdout);\n}\n\nif (__argc > 1) {\n variable arg, fp;\n foreach arg (__argv[[1:]]) {\n fp = fopen(arg, \"r\");\n rot13_stream(fp);\n }\n}\nelse\n rot13_stream(stdin);\n","language":"S-lang"},{"code":"scala> def rot13(s: String) = s map {\n | case c if 'a' <= c.toLower && c.toLower <= 'm' => c + 13 toChar\n | case c if 'n' <= c.toLower && c.toLower <= 'z' => c - 13 toChar\n | case c => c\n | }\nrot13: (s: String)String\n\nscala> rot13(\"7 Cities of Gold.\")\nres61: String = 7 Pvgvrf bs Tbyq.\n\nscala> rot13(res61)\nres62: String = 7 Cities of Gold.\n","language":"Scala"},{"code":"(define (rot13 str)\n (define (rot13-char c)\n (integer->char (+ (char->integer c)\n (cond ((and (char>=? c #\\a) (char<? c #\\n))\n 13)\n ((and (char>=? c #\\A) (char<? c #\\N))\n 13)\n ((and (char>=? c #\\n) (char<=? c #\\z))\n -13)\n ((and (char>=? c #\\N) (char<=? c #\\Z))\n -13)\n (else\n 0)))))\n (list->string (map rot13-char (string->list str))))\n","language":"Scheme"},{"code":";; Works with: chibi, csi, gosh, gsi, guile\n(cond-expand\n (r7rs (import (scheme base)\n (scheme write)))\n (gambit)\n (chicken (import (r7rs))))\n\n(define char-rot13\n (let* ((A (char->integer #\\A))\n (N (char->integer #\\N))\n (Z (char->integer #\\Z))\n (a (char->integer #\\a))\n (n (char->integer #\\n))\n (z (char->integer #\\z))\n (inc 13)\n (dec (- inc))\n (rot (lambda (c direction)\n (integer->char (+ c direction)))))\n (lambda (ch)\n (let ((c (char->integer ch)))\n (if (>= c A)\n (if (< c N)\n (rot c inc)\n (if (<= c Z)\n (rot c dec)\n (if (>= c a)\n (if (< c n)\n (rot c inc)\n (if (<= c z)\n (rot c dec)\n ch))))))))))\n\n(define (string-rot13 str)\n (string-map char-rot13 str))\n\n(if (not (and (string=? (string-rot13 \"abcdefghijklmnopqrstuvwxyz\")\n \"nopqrstuvwxyzabcdefghijklm\")\n (string=? (string-rot13 \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")\n \"NOPQRSTUVWXYZABCDEFGHIJKLM\")))\n (error \"Test failed.\"))\n\n(let loop ((line (read-line)))\n (if (string? line)\n (begin\n (display (string-rot13 line))\n (newline)\n (loop (read-line)))))\n","language":"Scheme"},{"code":"y/abcdefghijklmnopqrstuvwxyz/nopqrstuvwxyzabcdefghijklm/\ny/ABCDEFGHIJKLMNOPQRSTUVWXYZ/NOPQRSTUVWXYZABCDEFGHIJKLM/\n","language":"Sed"},{"code":"$ include \"seed7_05.s7i\";\n\nconst proc: main is func\n local\n var char: ch is ' ';\n begin\n ch := getc(IN);\n while not eof(IN) do\n if (ch >= 'a' and ch <= 'm') or (ch >= 'A' and ch <= 'M') then\n ch := chr(ord(ch) + 13);\n elsif (ch >= 'n' and ch <= 'z') or (ch >= 'N' and ch <= 'Z') then\n ch := chr(ord(ch) - 13);\n end if;\n write(ch);\n ch := getc(IN);\n end while;\n end func;\n","language":"Seed7"},{"code":"# Returns a copy of 's' with rot13 encoding.\nfunc rot13(s) {\n s.tr('A-Za-z', 'N-ZA-Mn-za-m')\n}\n\n# Perform rot13 on standard input.\nSTDIN.each { |line| say rot13(line) }\n","language":"Sidef"},{"code":" TEXT PROCEDURE ROT13(INP); TEXT INP;\n BEGIN\n\n CHARACTER PROCEDURE ROT13CHAR(C); CHARACTER C;\n ROT13CHAR :=\n CHAR(\n RANK(C) +\n (IF C >= 'A' AND C <= 'M' THEN 13 ELSE\n IF C >= 'a' AND C <= 'm' THEN 13 ELSE\n IF C >= 'N' AND C <= 'Z' THEN -13 ELSE\n IF C >= 'n' AND C <= 'z' THEN -13 ELSE 0));\n\n TEXT OUTP;\n OUTP :- BLANKS(INP.LENGTH);\n\n INP.SETPOS(1);\n WHILE INP.MORE DO\n OUTP.PUTCHAR(ROT13CHAR(INP.GETCHAR));\n\n ROT13 :- OUTP;\n END ROT13;\n","language":"Simula"},{"code":"#!/usr/local/bin/slate\n\nch@(String Character traits) rot13\n[| value |\n upper ::= ch isUppercase.\n value := ch toLowercase as: Integer.\n (value >= 97) /\\ [value < 110]\n ifTrue: [value += 13]\n ifFalse: [(value > 109) /\\ [value <= 122]\n ifTrue: [value -= 13]].\n upper\n ifTrue: [(value as: String Character) toUppercase]\n ifFalse: [value as: String Character]\n].\n\nlobby define: #Rot13Encoder &parents: {Encoder}.\n\nc@(Rot13Encoder traits) convert\n[\n [c in isAtEnd] whileFalse: [c out nextPut: c in next rot13].\n].\n\n(Rot13Encoder newFrom: Console reader to: Console writer) convert.\n","language":"Slate"},{"code":"ch@(String Character traits) rot13\n[| value |\n upper ::= ch isUppercase.\n value := ch toLowercase as: Integer.\n (value >= 97) /\\ [value < 110]\n ifTrue: [value += 13]\n ifFalse: [(value > 109) /\\ [value <= 122]\n ifTrue: [value -= 13]].\n upper\n ifTrue: [(value as: String Character) toUppercase]\n ifFalse: [value as: String Character]\n].\n\ns@(String traits) rot13\n[\n result ::= s newSameSize.\n s doWithIndex: [| :each :index | result at: index put: each rot13].\n result\n].\n\nslate[37]> 'abc123' rot13.\n'nop123'\n","language":"Slate"},{"code":"(define rot-char-13 (lambda (ch)\n (set! ch (string->rune ch))\n (cond\n (\n (or\n (and (>= ch (string->rune \"a\")) (<= ch (string->rune \"m\")))\n (and (>= ch (string->rune \"A\")) (<= ch (string->rune \"M\"))))\n (rune->string (+ ch 13)))\n (\n (or\n (and (>= ch (string->rune \"n\")) (<= ch (string->rune \"z\")))\n (and (>= ch (string->rune \"N\")) (<= ch (string->rune \"Z\"))))\n (rune->string (- ch 13)))\n (else (rune->string ch)))))\n\n(display (list->string (map rot-char-13 (string->list \"nowhere->ABJURER!\"))))\n","language":"Slope"},{"code":"\"1. simple approach\"\nrot13 := [ :string |\n string collect: [ :each | | index |\n index := 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'\n indexOf: each ifAbsent: [ 0 ]. \"Smalltalk uses 1-based indexing\"\n index isZero\n ifTrue: [ each ]\n ifFalse: [ 'nopqrstuvwxyzabcdefghijklmNOPQRSTUVWXYZABCDEFGHIJKLM' at:\n index ] ] ].\n\n(rot13 value: 'Test123') printNl \"gives 'Grfg123'\"\n\n\"2. extending built-in classes\"\nCharacter extend [\n + inc [\n (inc isKindOf: Character)\n ifTrue: [\n ^ ( Character value: ((self asInteger) + (inc asInteger)) )\n ] ifFalse: [\n ^ ( Character value: ((self asInteger) + inc) )\n ]\n ]\n - inc [\n ^ ( self + (inc asInteger negated) )\n ]\n trFrom: map1 to: map2 [\n (map1 includes: self) ifTrue: [\n ^ map2 at: (map1 indexOf: self)\n ] ifFalse: [ ^self ]\n ]\n].\n\nString extend [\n rot: num [ |s|\n s := String new.\n self do: [ :c |\n ((c asLowercase) between: $a and: $z)\n\t ifTrue: [ |c1|\n c1 := ( $a + ((((c asLowercase) - $a + num) asInteger) rem:26)).\n (c isLowercase) ifFalse: [ c1 := c1 asUppercase ].\n s := s, (c1 asString)\n ]\n ifFalse: [\n\t s := s, (c asString)\n ]\n ].\n ^s\n ]\n].\n\n('abcdefghijklmnopqrstuvwxyz123!' rot: 13) displayNl.\n(('abcdefghijklmnopqrstuvwxyz123!' rot: 13) rot: 13) displayNl.\n\n\n\n\"2. using a 'translation'. Not very idiomatic Smalltalk code\"\nrotThirteen := [ :s | |m1 m2 r|\n r := String new.\n m1 := OrderedCollection new.\n 0 to: 25 do: [ :i | m1 add: ($a + i) ].\n m2 := OrderedCollection new.\n 0 to: 25 do: [ :i | m2 add: ($a + ((i+13) rem: 26)) ].\n s do: [ :c |\n (c between: $a and: $z) | (c between: $A and: $Z)\n ifTrue: [ | a |\n a := (c asLowercase) trFrom: m1 to: m2.\n (c isUppercase) ifTrue: [ a := a asUppercase ].\n r := r, (a asString)]\n ifFalse: [ r := r, (c asString) ]\n ].\n r\n].\n\n(rotThirteen value: 'abcdefghijklmnopqrstuvwxyz123!') displayNl.\n","language":"Smalltalk"},{"code":"* # Function using replace( )\n define('rot13(s)u1,u2,l1,l2') :(rot13_end)\nrot13 &ucase len(13) . u1 rem . u2\n &lcase len(13) . l1 rem . l2\n rot13 = replace(s,&ucase &lcase,u2 u1 l2 l1) :(return)\nrot13_end\n\n* # Function using pattern\n define('rot13s(s)c')\n alfa = &ucase &ucase &lcase &lcase :(rot13s_end)\nrot13s s len(1) . c = :f(return)\n alfa break(c) len(13) len(1) . c\n rot13s = rot13s c :(rot13s)\nrot13s_end\n\n* # Test and display both\n str = rot13(\"I abjure the $19.99 trinket!\")\n output = str; output = rot13(str)\n str = rot13s(\"He's a real Nowhere Man.\")\n output = str; output = rot13s(str)\nend\n","language":"SNOBOL4"},{"code":"#!/usr/local/bin/spar\npragma annotate( summary, \"rot13\" );\npragma annotate( description, \"Implement a 'rot-13' function (or procedure, class,\" );\npragma annotate( description, \"subroutine, or other 'callable' object as appropriate\" );\npragma annotate( description, \"to your programming environment). The definition of the\" );\npragma annotate( description, \"rot-13 function is to simply replace every letter of the\" );\npragma annotate( description, \"ASCII alphabet with the letter which is 'rotated' 13\" );\npragma annotate( description, \"characters 'around' the 26 letter alphabet from its\" );\npragma annotate( description, \"normal cardinal position (wrapping around from 'z' to\" );\npragma annotate( description, \"'a' as necessary). Thus the letters 'abc' become 'nop'\" );\npragma annotate( description, \"and so on. Technically rot-13 is a 'monoalphabetic\" );\npragma annotate( description, \"substitution cipher' with a trivial 'key'. A proper\" );\npragma annotate( description, \"implementation should work on upper and lower case\" );\npragma annotate( description, \"letters, preserve case, and pass all non-alphabetic\" );\npragma annotate( description, \"characters in the input stream through without\" );\npragma annotate( description, \"alteration.\" );\npragma annotate( see_also, \"http://rosettacode.org/wiki/Rot-13\" );\npragma annotate( author, \"Ken O. Burtch\" );\npragma license( unrestricted );\n\npragma restriction( no_external_commands );\n\nprocedure rot13 is\n\n function to_rot13( s : string ) return string is\n ch : character;\n result : string;\n begin\n for i in 1..strings.length( s ) loop\n ch := strings.element( s, i );\n if strings.is_letter( ch ) then\n if (ch in 'A'..'M') or (ch in 'a'..'m' ) then\n ch := strings.val( numerics.pos( ch ) + 13 );\n else\n ch := strings.val( numerics.pos( ch ) - 13 );\n end if;\n end if;\n result := @ & ch;\n end loop;\n return result;\n end to_rot13;\n\nbegin\n ? to_rot13( \"Big fjords vex quick waltz nymph!\" );\nend rot13;\n","language":"SparForte"},{"code":"select translate(\n 'The quick brown fox jumps over the lazy dog.',\n 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz',\n 'NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm'\n )\n from dual;\n","language":"SQL"},{"code":"with cte(num) as\n(\n select 1\n union all\n select num+1\n from cte\n)\nselect cast((\nselect char(ascii(chr) +\n\t\tcase\n\t\t\twhen ascii(chr) between ascii('a') and ascii('m') or\n\t\t\t\tascii(chr) between ascii('A') and ascii('M') then 13\n\t\t\twhen ascii(chr) between ascii('n') and ascii('z') or\n\t\t\t\tascii(chr) between ascii('N') and ascii('Z') then -13\n\t\t\telse 0\n\t\tend)\nfrom\n(\nselect top(1000) num,\n\t\t -- your string to be converted to ROT13\n substring('The Quick Brown Fox Jumps Over The Lazy Dog',num,1) chr\nfrom cte\n) tmp\nFor XML PATH ('')) as xml).value('.', 'VARCHAR(max)') rot13\noption (maxrecursion 0)\n","language":"SQL"},{"code":"fun rot13char c =\n if c >= #\"a\" andalso c <= #\"m\" orelse c >= #\"A\" andalso c <= #\"M\" then\n chr (ord c + 13)\n else if c >= #\"n\" andalso c <= #\"z\" orelse c >= #\"N\" andalso c <= #\"Z\" then\n chr (ord c - 13)\n else\n c\n\nval rot13 = String.map rot13char\n","language":"Standard-ML"},{"code":"fun rot13stdin () =\n case (TextIO.inputLine TextIO.stdIn)\n of NONE => ()\n | SOME(s) => (print (rot13 s); rot13stdin ());\n","language":"Standard-ML"},{"code":"function rot13(s) {\n\tu = ascii(s)\n\ti = selectindex(u:>64 :& u:<91)\n\tif (length(i)>0) u[i] = mod(u[i]:-52, 26):+65\n\ti = selectindex(u:>96 :& u:<123)\n\tif (length(i)>0) u[i] = mod(u[i]:-84, 26):+97\n\treturn(char(u))\n}\n\nrot13(\"Shall Not Perish\")\n Funyy Abg Crevfu\n","language":"Stata"},{"code":"a \"The quick brown fox jumps over the lazy dog.\"\nb \"AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsTtUuVvWwXxYyZz\"\nc b\n#@c 78\n#\\c 52\n#a\nb %.a d \" \" b\nb %.a #d .a\nb %.a e c\nb %.a #e #d\nb %.a a .\\e :a\nf f .a\na :a\n#a\n$ f\n","language":"Stringle"},{"code":"func rot13char(c: UnicodeScalar) -> UnicodeScalar {\n switch c {\n case \"A\"...\"M\", \"a\"...\"m\":\n return UnicodeScalar(UInt32(c) + 13)\n case \"N\"...\"Z\", \"n\"...\"z\":\n return UnicodeScalar(UInt32(c) - 13)\n default:\n return c\n }\n}\n\nfunc rot13(str: String) -> String {\n return String(map(str.unicodeScalars){ c in Character(rot13char(c)) })\n}\n\nprintln(rot13(\"The quick brown fox jumps over the lazy dog\"))\n","language":"Swift"},{"code":"proc rot13 line {\n string map {\n a n b o c p d q e r f s g t h u i v j w k x l y m z\n n a o b p c q d r e s f t g u h v i w j x k y l z m\n A N B O C P D Q E R F S G T H U I V J W K X L Y M Z\n N A O B P C Q D R E S F T G U H V I W J X K Y L Z M\n } $line\n}\nset tx \"Hello, World !\"\nputs \"$tx : [rot13 $tx]\"\n","language":"Tcl"},{"code":"package require Tclx\nproc rot13 str {\n translit \"A-Za-z\" \"N-ZA-Mn-za-m\" $str\n}\n","language":"Tcl"},{"code":":\"ABCDEFGHIJKLMNOPQRSTUVWXYZ→Str0\n:\".→Str2\n:For(N,1,length(Str1\n:If inString(Str0,sub(Str1,N,1\n:Then\n:inString(Str0,sub(Str1,N,1\n:Ans+13-26(Ans>13\n:Str2+sub(Str0,Ans,1→Str2\n:Else\n:Str2+sub(Str1,N,1→Str2\n:End\n:End\n:sub(Str2,2,length(Str2)-1→Str1\n","language":"TI-83-BASIC"},{"code":"function rot13(%string)\n{\n\t%alph = \"abcdefghijklmnopqrstuvwxyz\";\n\t%len = strLen(%string);\n\t\n\tfor(%a = 0; %a < %len; %a++)\n\t{\n\t\t%char = getSubStr(%string,%a,1);\n\t\t%pos = striPos(%alph, %char);\n\n\t\tif(%pos < 0)\n\t\t\t%out = %out @ %char;\n\t\telse\n\t\t{\n\t\t\tif(strPos(%alph, %char) < 0)\n\t\t\t\t%out = %out @ strUpr(getSubStr(%alph, (%pos + 13) % 26));\n\t\t\telse\n\t\t\t\t%out = %out @ getSubStr(%alph, (%pos + 13) % 26);\n\t\t}\n\t}\n\treturn %out;\n}\n","language":"TorqueScript"},{"code":"FUNCTION rot13$(s$)\n LET ans$ = \"\"\n FOR a = 1 to len(s$)\n LET letter$ = (s$)[a:a+1-1]\n IF letter$ >= \"A\" and letter$ <= \"Z\" then\n LET char$ = chr$(ord(letter$[1:1])+13)\n IF char$ > \"Z\" then LET char$ = chr$(ord(char$[1:1])-26)\n ELSEIF letter$ >= \"a\" and letter$ <= \"z\" then\n LET char$ = chr$(ord(letter$[1:1])+13)\n IF char$ > \"z\" then LET char$ = chr$(ord(char$[1:1])-26)\n ELSE\n LET char$ = letter$\n END IF\n LET ans$ = ans$ & char$\n NEXT a\n LET s$ = ans$\n LET rot13$ = s$\nEND FUNCTION\n\nINPUT prompt \"Enter a string: \": s$\nPRINT \"Before encoding : \"; s$\nPRINT \"After encoding : \"; rot13$(s$)\nLET s$ = rot13$(s$)\nPRINT \"After decoding : \"; rot13$(s$)\nEND\n","language":"True-BASIC"},{"code":"@(deffilter rot13\n (\"a\" \"n\") (\"b\" \"o\") (\"c\" \"p\") (\"d\" \"q\") (\"e\" \"r\") (\"f\" \"s\") (\"g\" \"t\")\n (\"h\" \"u\") (\"i\" \"v\") (\"j\" \"w\") (\"k\" \"x\") (\"l\" \"y\") (\"m\" \"z\") (\"n\" \"a\")\n (\"o\" \"b\") (\"p\" \"c\") (\"q\" \"d\") (\"r\" \"e\") (\"s\" \"f\") (\"t\" \"g\") (\"u\" \"h\")\n (\"v\" \"i\") (\"w\" \"j\") (\"x\" \"k\") (\"y\" \"l\") (\"z\" \"m\")\n (\"A\" \"N\") (\"B\" \"O\") (\"C\" \"P\") (\"D\" \"Q\") (\"E\" \"R\") (\"F\" \"S\") (\"G\" \"T\")\n (\"H\" \"U\") (\"I\" \"V\") (\"J\" \"W\") (\"K\" \"X\") (\"L\" \"Y\") (\"M\" \"Z\") (\"N\" \"A\")\n (\"O\" \"B\") (\"P\" \"C\") (\"Q\" \"D\") (\"R\" \"E\") (\"S\" \"F\") (\"T\" \"G\") (\"U\" \"H\")\n (\"V\" \"I\") (\"W\" \"J\") (\"X\" \"K\") (\"Y\" \"L\") (\"Z\" \"M\"))\n@(repeat)\n@line\n@ (output :filter rot13)\n@line\n@ (end)\n@(end)\n","language":"TXR"},{"code":"(defun rot13 (ch)\n (cond\n ((<= #\\A ch #\\Z) (wrap #\\A #\\Z (+ ch 13)))\n ((<= #\\a ch #\\z) (wrap #\\a #\\z (+ ch 13)))\n (t ch)))\n\n (whilet ((ch (get-char)))\n (put-char (rot13 ch)))\n","language":"TXR"},{"code":"tr \\\n'NOWHERE AZ clerk IRAQ faber gnat ABJURER NM pyrex VEND snore tang'\\\n'abjurer nm PYREX vend SNORE TANG nowhere az CLERK iraq FABER GNAT' \\\n'ABJURER NM pyrex VEND snore tang NOWHERE AZ clerk IRAQ faber gnat'\\\n'nowhere az CLERK iraq FABER GNAT abjurer nm PYREX vend SNORE TANG'\n","language":"UNIX-Shell"},{"code":"#!/bin/sh\nrot13() {\n tr '[a-m][n-z][A-M][N-Z]' '[n-z][a-m][N-Z][A-M]'\n}\n\ncat ${1+\"$@\"} | rot13\n","language":"UNIX-Shell"},{"code":"``ci`d``@i`c``s`d```?aic.n``s`d```?bic.o``s`d```?cic.p``s`d```?dic.q``s`d```?eic\n.r``s`d```?fic.s``s`d```?gic.t``s`d```?hic.u``s`d```?iic.v``s`d```?jic.w``s`d```\n?kic.x``s`d```?lic.y``s`d```?mic.z``s`d```?nic.a``s`d```?oic.b``s`d```?pic.c``s`\nd```?qic.d``s`d```?ric.e``s`d```?sic.f``s`d```?tic.g``s`d```?uic.h``s`d```?vic.i\n``s`d```?wic.j``s`d```?xic.k``s`d```?yic.l``s`d```?zic.m``s`d```?Nic.A``s`d```?O\nic.B``s`d```?Pic.C``s`d```?Qic.D``s`d```?Ric.E``s`d```?Sic.F``s`d```?Tic.G``s`d`\n``?Uic.H``s`d```?Vic.I``s`d```?Wic.J``s`d```?Xic.K``s`d```?Yic.L``s`d```?Zic.M``\ns`d```?Aic.N``s`d```?Bic.O``s`d```?Cic.P``s`d```?Dic.Q``s`d```?Eic.R``s`d```?Fic\n.S``s`d```?Gic.T``s`d```?Hic.U``s`d```?Iic.V``s`d```?Jic.W``s`d```?Kic.X``s`d```\n?Lic.Y``s`d```?Mic.Z`d`|c\n","language":"Unlambda"},{"code":"#import std\n\n#executable (<'parameterized','default-to-stdin'>,<>)\n\nrot = ~command.files; * contents:= ~contents; * * -:~& -- ^p(~&,rep13~&zyC)~~ ~=`A-~ letters\n","language":"Ursala"},{"code":"( in-place rot13, null terminated string )\n@rot13 ( addr* -: addr* )\n DUP2\n &loop\n LDAk ?{ POP2 JMP2r } STH2k\n LDAk #df AND DUP #41 LTH SWP #5a GTH ORA\n STH LDAk STHr\n ?{\n DUP #df AND\n #0d ADD\n DUP #5a GTH #1a MUL SUB\n SWP #20 AND ORA\n }\n STH2r STA INC2\n !&loop\n","language":"Uxntal"},{"code":"fn main() {\n\tprintln(rot13('nowhere ABJURER'))\n\tprintln(rot13('abjurer NOWHERE'))\n}\n\nfn rot13char(chr u8) u8 {\n\tif (chr >= u8(97) && chr <= u8(109)) || (chr >= u8(65) && chr <= u8(77)) {\n\t\treturn chr + 13\n\t}\n\tif (chr >= u8(110) && chr <= u8(122)) || (chr >= u8(78) && chr <= u8(90)) {\n\t\treturn chr - 13\n\t}\n\treturn chr\n}\n\nfn rot13(str string) string {\n\tmut chr_arr := []u8{}\n\tfor elem in str.split('') {\n\t\tchr_arr << rot13char(elem.str)\n\t}\n\treturn chr_arr.bytestr()\n}\n","language":"V-(Vlang)"},{"code":"string rot13(string s) {\n const string lcalph = \"abcdefghijklmnopqrstuvwxyz\";\n const string ucalph = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n string result = \"\";\n int pos;\n unichar c;\n\n for (int i = 0; s.get_next_char (ref i, out c);) {\n if ((pos = lcalph.index_of_char(c)) != -1)\n result += lcalph[(pos + 13) % 26].to_string();\n else if ((pos = ucalph.index_of_char(c)) != -1)\n result += ucalph[(pos + 13) % 26].to_string();\n else\n result += c.to_string();\n }\n\n return result;\n}\n\nvoid main() {\n print(rot13(\"The Quick Brown Fox Jumped Over the Lazy Dog!\"));\n}\n","language":"Vala"},{"code":"option explicit\n\nfunction rot13(a)\n dim b,n1,n,i\n b=\"\"\n for i=1 to len(a)\n n=asc(mid(a,i,1))\n if n>=65 and n<= 91 then\n n1=(((n-65)+13)mod 26)+65\n elseif n>=97 and n<= 123 then\n n1=(((n-97)+13)mod 26)+97\n else\n n1=n\n end if\n b=b & chr(n1)\n next\n rot13=b\nend function\n\nconst a=\"The quick brown fox jumps over the lazy dog.\"\ndim b,c\nwscript.echo a\nb=rot13(a)\nwscript.echo b\nc=rot13(b)\nwscript.echo c\n","language":"VBScript"},{"code":"Translate_Load(\"ROT13.TBL\")\nTranslate_Block(0, File_Size)\n","language":"Vedit-macro-language"},{"code":"Function ROT13(ByVal a As String) As String\n Dim i As Long\n Dim n As Integer, e As Integer\n\n ROT13 = a\n For i = 1 To Len(a)\n n = Asc(Mid$(a, i, 1))\n Select Case n\n Case 65 To 90\n e = 90\n n = n + 13\n Case 97 To 122\n e = 122\n n = n + 13\n Case Else\n e = 255\n End Select\n\n If n > e Then\n n = n - 26\n End If\n Mid$(ROT13, i, 1) = Chr$(n)\n Next i\nEnd Function\n","language":"Visual-Basic"},{"code":"Sub Main()\n Debug.Assert ROT13(\"abc\") = \"nop\"\n Debug.Assert ROT13(\"nop\") = \"abc\"\nEnd Sub\n","language":"Visual-Basic"},{"code":"Module Module1\n\n Private Function rot13(ByVal str As String) As String\n Dim newChars As Char(), i, j As Integer, original, replacement As String\n\n original = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\"\n replacement = \"NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm\"\n\n newChars = str.ToCharArray()\n\n For i = 0 To newChars.Length - 1\n For j = 0 To 51\n If newChars(i) = original(j) Then\n newChars(i) = replacement(j)\n Exit For\n End If\n Next\n Next\n\n Return New String(newChars)\n End Function\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"def (rot13 s)\n (as string\n (map rot13\n (as list s)))\n\nAlphabet <- \"abcdefghijklmnopqrstuvwxyz\"\ndef (rot13 c) :case (and string?.c len.c=1)\n if (\"a\" <= c <= \"z\")\n let idx (pos c Alphabet)\n Alphabet (idx+13 % 26)\n (\"A\" <= c <= \"Z\")\n (downcase.c -> rot13 -> upcase)\n :else\n c\n","language":"Wart"},{"code":"(rot13 \"Moron\")\n=> \"Zbeba\"\n","language":"Wart"},{"code":"1 2#read()-N(2);\n2 2;\n3 defer(1 || N(2) > 90 || N(2) < 65) 5#65-N(5);\n4 defer(1 || N(2) > 122 || N(2) < 97) 5#97-N(5);\n5 5;\n6 defer(3 && 4) put(U(((N(2) - N(5) + 13) % 26) + N(5)));\n7 defer(1 || N(2) > 64 || N(2) == 0) put(U(N(2)));\n8 again(8) defer(6 && 7) 1,-6#N(6)-1,-7#N(7)-1,-3#N(3)-1,-4#N(4)-1;\n9 defer(1 || N(2) != 0) -3,-4,-5#N(5),-6,-7,-8;\n10 defer(1 || 9) put(\"\\n\");\n","language":"Whenever"},{"code":"","language":"Whitespace"},{"code":"var rot13 = Fn.new { |s|\n var bytes = s.bytes.toList\n for (i in 0...bytes.count) {\n var c = bytes[i]\n if ((c >= 65 && c <= 77) || (c >= 97 && c <= 109)) {\n bytes[i] = c + 13\n } else if ((c >= 78 && c <= 90) || (c >= 110 && c <= 122)) {\n bytes[i] = c - 13\n }\n }\n return bytes.map { |b| String.fromByte(b) }.join()\n}\n\nSystem.print(rot13.call(\"nowhere ABJURER\"))\n","language":"Wren"},{"code":"format \tELF \texecutable 3\nentry \tstart\n\t\nsegment\treadable writeable\nbuf\trb\t1\n\t\nsegment\treadable executable\nstart:\tmov\teax, 3\t\t; syscall \"read\"\n\tmov\tebx, 0\t\t; stdin\n\tmov\tecx, buf\t; buffer for read byte\n\tmov\tedx, 1\t\t; len (read one byte)\n\tint\t80h\n\n\tcmp\teax, 0\t\t; EOF?\n\tjz\texit\n\n\txor \teax, eax\t; load read char to eax\n\tmov\tal, [buf]\n\tcmp\teax, \"A\"\t; see if it is in ascii a-z or A-Z\n\tjl\tprint\n\tcmp\teax, \"z\"\n\tjg\tprint\n\tcmp\teax, \"Z\"\n\tjle\trotup\n\tcmp\teax, \"a\"\n\tjge\trotlow\n\tjmp\tprint\n\nrotup:\tsub\teax, \"A\"-13\t; do rot 13 for A-Z\n\tcdq\n\tmov\tebx, 26\n\tdiv\tebx\n\tadd\tedx, \"A\"\n\tjmp\trotend\n\t\nrotlow:\tsub\teax, \"a\"-13\t; do rot 13 for a-z\n\tcdq\n\tmov\tebx, 26\n\tdiv\tebx\n\tadd\tedx, \"a\"\n\nrotend:\tmov\t[buf], dl\n\t\nprint: \tmov\teax, 4\t\t; syscall write\n\tmov\tebx, 1\t\t; stdout\n\tmov\tecx, buf\t; *char\n\tmov\tedx, 1\t\t; string length\n\tint\t80h\n\n\tjmp\tstart\n\nexit: \tmov eax,1\t\t; syscall exit\n\txor ebx,ebx\t\t; exit code\n\tint 80h\n","language":"X86-Assembly"},{"code":"PROGRAM \"Rot-13\"\nVERSION \"0.0000\"\n\nDECLARE FUNCTION Entry ()\n\nFUNCTION Entry ()\n\tdec$ = \"\"\n\tTYPE$ = \"cleartext \"\n\tctext$ = \"\"\n\tiOffset = 13 'offset assumed to be 13 - uncomment line 11 to change\n\n\tPRINT \"For decrypt enter \" + \"<d> \" + \" -- else press enter > \";\n\tdec$ = INLINE$(\"\")\n\tPRINT\n\n\tIF LCASE$(dec$) = \"d\" THEN\n\t\tiOffset = 26 - iOffset\n\t\tTYPE$ = \"ciphertext \"\n\tEND IF\n\n\tPRINT \"Enter \" + TYPE$; '' + \"> \";\n\tcad$ = UCASE$(INLINE$(\"> \"))\n\n\tFOR i = 1 TO LEN(cad$)\n\t\tiTemp = ASC(MID$(cad$,i,1))\n\t\tIF iTemp > 64 AND iTemp < 91 THEN\n\t\t\tiTemp = ((iTemp - 65) + iOffset) MOD 26\n\t\t\tPRINT CHR$(iTemp + 65);\n\t\tEND IF\n\tNEXT i\nEND FUNCTION\nEND PROGRAM\n","language":"XBasic"},{"code":"code ChIn=7, ChOut=8;\nint C, CC;\nrepeat C:= ChIn(1); CC:= C&~$20; \\CC handles lowercase too\n ChOut(0, C + (if CC>=^A & CC<=^M then +13\n else if CC>=^N & CC<=^Z then -13\n else 0));\nuntil C = $1A; \\EOF\n","language":"XPL0"},{"code":"<xsl:stylesheet version=\"1.0\" xmlns:xsl=\"http://www.w3.org/1999/XSL/Transform\">\n <xsl:output method=\"text\" />\n <xsl:variable name=\"alpha\">ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz</xsl:variable>\n <xsl:variable name=\"rot13\">NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm</xsl:variable>\n <xsl:template match=\"body\">\n <xsl:apply-templates/>\n </xsl:template>\n <xsl:template match=\"rot13\">\n <xsl:value-of select=\"translate(.,$alpha,$rot13)\"/>\n </xsl:template>\n</xsl:stylesheet>\n","language":"XSLT"},{"code":"s$ = \"nowhere ABJURER\"\nprint \" Cadena original : \", s$\nprint \" Tras codificar : \", Rot13$(s$)\nprint \"Tras decodificar : \", Rot13$(Rot13$(s$))\nend\n\nsub Rot13$ (s$)\n local cad$\n cad$ = \"\"\n\n for i = 1 to len(s$)\n temp = asc(mid$(s$, i, 1))\n\n if temp >= 65 and temp <= 90 then // A to Z\n temp = (mod((temp - 52), 26)) + 65\n elsif temp >= 97 And temp <= 122 then // a to z\n temp = (mod((temp - 84), 26)) + 97\n end if\n cad$ = cad$ + chr$(temp)\n next i\n return cad$\nend sub\n","language":"Yabasic"},{"code":"!yamlscript/v0\n\ns =: set(nil).into('abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ')\nm =: drop(26 s).concat(take(26 s)).zipmap(s _)\n\ndefn main(s):\n say: map(\\(m %1 %1) s).apply(str _)\n","language":"YAMLScript"},{"code":"const std = @import(\"std\");\n\npub const Rot13 = struct {\n pub fn char(ch: u8) u8 {\n return switch (ch) {\n 'a'...'m', 'A'...'M' => |c| c + 13,\n 'n'...'z', 'N'...'Z' => |c| c - 13,\n else => |c| c,\n };\n }\n\n /// Caller owns returned memory.\n pub fn slice(allocator: std.mem.Allocator, input: []const u8) error{OutOfMemory}![]u8 {\n const output = try allocator.alloc(u8, input.len);\n errdefer allocator.free(output);\n\n for (input, output) |input_ch, *output_ch| {\n output_ch.* = char(input_ch);\n }\n\n return output;\n }\n};\n\npub fn main() error{OutOfMemory}!void {\n var gpa: std.heap.GeneralPurposeAllocator(.{}) = .{};\n defer _ = gpa.deinit();\n const allocator = gpa.allocator();\n\n const message_input =\n \\\\@@@111@@@ Lbh xabj vg vf tbvat gb or n onq qnl\n \\\\ jura gur yrggref va lbhe nycunorg fbhc\n \\\\ fcryy Q-V-F-N-F-G-R-E.\n ;\n const message_decoded = try Rot13.slice(allocator, message_input);\n defer allocator.free(message_decoded);\n\n std.debug.print(\n \\\\{s}\n \\\\=== Decoded to ===\n \\\\{s}\n \\\\\n , .{\n message_input,\n message_decoded,\n });\n\n std.debug.print(\"\\n\", .{});\n\n const message_encoded = try Rot13.slice(allocator, message_decoded);\n defer allocator.free(message_encoded);\n\n std.debug.print(\n \\\\{s}\n \\\\=== Encoded to ===\n \\\\{s}\n \\\\\n , .{\n message_decoded,\n message_encoded,\n });\n}\n","language":"Zig"},{"code":"#!/home/craigd/Bin/zkl\nfcn rot13(text){\n text.translate(\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\",\n \t\t \"nopqrstuvwxyzabcdefghijklmNOPQRSTUVWXYZABCDEFGHIJKLM\");\n}\ntext:=(vm.arglist or File.stdin); // command line or pipe\ntext.pump(File.stdout,rot13); // rotate each word and print it\nif(text.isType(List)) File.stdout.writeln();\t// command line gets ending newline\n","language":"Zkl"},{"code":"program: rot13\n case: 1\n input: abc\n output: nop\n case: 2\n input: nop\n output: abc\n case: 3\n input: 'ABC'\n output: 'NOP'\n case: 4\n input: 'NOP'\n output: 'ABC'\n","language":"Zoea"},{"code":"10 CLS\n20 INPUT \"Enter a string: \", s$\n30 LET a$ = \"\": REM a$ is the encoded string\n40 FOR l = 1 TO LEN(s$)\n50 LET i$ = s$(l): REM i$ is the letter being worked on\n60 IF i$ < \"A\" OR i$ > \"Z\" THEN GO TO 100\n70 LET c$ = CHR$(CODE(i$) + 13): REM c$ is the encoded letter\n80 IF c$ > \"Z\" THEN LET c$ = CHR$(CODE(c$) - 26)\n90 GO TO 300\n100 IF i$ < \"a\" OR i$ > \"z\" THEN GO TO 200\n110 LET c$ = CHR$(CODE(i$) + 13)\n120 IF c$ > \"z\" THEN LET c$ = CHR$(CODE(c$) - 26)\n130 GO TO 300\n200 LET c$ = i$\n300 LET a$ = a$ + c$\n310 NEXT l\n320 PRINT a$\n","language":"ZX-Spectrum-Basic"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- String_manipulation\\nfrom: http://rosettacode.org/wiki/Rot-13\\nnote: Encryption\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nImplement a '''rot-13''' function (or procedure, class, subroutine, or other \\\"callable\\\" object as appropriate to your programming environment). \\n\\nOptionally wrap this function in a utility program (like [[:Category:Tr|tr]], which acts like a common [[UNIX]] utility, performing a line-by-line rot-13 encoding of every line of input contained in each file listed on its command line, or (if no filenames are passed thereon) acting as a filter on its \\\"standard input.\\\" \\n\\n\\n(A number of UNIX scripting languages and utilities, such as ''awk'' and ''sed'' either default to processing files in this way or have command line switches or modules to easily implement these wrapper semantics, e.g., [[Perl]] and [[Python]]).\\n\\nThe '''rot-13''' encoding is commonly known from the early days of Usenet \\\"Netnews\\\" as a way of obfuscating text to prevent casual reading of [[wp:Spoiler (media)|spoiler]] or potentially offensive material. \\n\\nMany news reader and mail user agent programs have built-in '''rot-13''' encoder/decoders or have the ability to feed a message through any external utility script for performing this (or other) actions.\\n\\nThe definition of the rot-13 function is to simply replace every letter of the ASCII alphabet with the letter which is \\\"rotated\\\" 13 characters \\\"around\\\" the 26 letter alphabet from its normal cardinal position (wrapping around from '''z''' to '''a''' as necessary). \\n\\nThus the letters '''abc''' become '''nop''' and so on. \\n\\nTechnically '''rot-13''' is a \\\"mono-alphabetic substitution cipher\\\" with a trivial \\\"key\\\". \\n\\nA proper implementation should work on upper and lower case letters, preserve case, and pass all non-alphabetic characters \\nin the input stream through without alteration.\\n\\n\\n;Related tasks:\\n* [[Caesar cipher]]\\n* [[Substitution Cipher]]\\n* [[Vigenère Cipher/Cryptanalysis]]\\n\\n\\n{{Template:Strings}}\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F rot13(string)\\n V r = ‘ ’ * string.len\\n L(c) string\\n r[L.index] = S c\\n ‘a’..‘z’\\n Char(code' (c.code - ‘a’.code + 13) % 26 + ‘a’.code)\\n ‘A’..‘Z’\\n Char(code' (c.code - ‘A’.code + 13) % 26 + ‘A’.code)\\n E\\n c\\n R r\\n\\nprint(rot13(‘foo’))\\nprint(rot13(‘sbb’))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"ROT13 CSECT\\n USING ROT13,R15 use calling register\\n XPRNT CC,L'CC\\n TR CC,TABLE translate\\n XPRNT CC,L'CC\\n TR CC,TABLE translate\\n XPRNT CC,L'CC\\n BR R14 return to caller\\nCC DC CL10'{NOWHERE!}'\\nTABLE DC CL64' '\\n* 0123456789ABCDEF\\n DC CL16' .<(+|' X'4.'\\n DC CL16' !$*);^' X'5.'\\n DC CL16'&& ,%_>?' X'6.'\\n DC CL16'-/ `:#@''=\\\"' X'7.'\\n DC CL16' nopqrstuv ' X'8.'\\n DC CL16' wxyzabcde ' X'9.'\\n DC CL16' ~fghijklm [ ' X'A.'\\n DC CL16' ] ' X'B.'\\n DC CL16'{NOPQRSTUV ' X'C.'\\n DC CL16'}WXYZABCDE ' X'D.'\\n DC CL16'\\\\ FGHIJKLM ' X'E.'\\n DC CL16'0123456789 ' X'F.'\\n* 0123456789ABCDEF\\n YREGS\\n END ROT13\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"buffer = $fa ; or anywhere in zero page that's good\\nmaxpage = $95 ; if non-terminated that's bad\\n\\norg $1900\\n.rot13\\n stx buffer\\n sty buffer+1\\n ldy #0\\n beq readit\\n.loop cmp #$7b ; high range\\n bcs next ; >= {\\n cmp #$41 ; low range\\n bcc next ; < A\\n cmp #$4e\\n bcc add13 ; < N\\n cmp #$5b\\n bcc sub13set ; < [\\n cmp #$61\\n bcc next ; < a\\n cmp #$6e\\n bcs sub13 ; >= n\\n.add13 adc #13 ; we only get here via bcc; so clc not needed\\n bne storeit\\n.sub13set sec ; because we got here via bcc; so sec is needed\\n.sub13 sbc #13 ; we can get here via bcs; so sec not needed\\n.storeit sta (buffer),y\\n.next iny\\n bne readit\\n ldx buffer+1\\n cpx maxpage\\n beq done\\n inx\\n stx buffer+1\\n.readit lda (buffer),y ; quit on ascii 0\\n bne loop\\n.done rts\\n.end\\nsave \\\"rot-13\\\", rot13, end\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"/* ARM assembly AARCH64 Raspberry PI 3B */\\n/* program rot1364.s */\\n/************************************/\\n/* Constantes */\\n/************************************/\\n/* for this file see task include a file in language AArch64 assembly*/\\n.include \\\"../includeConstantesARM64.inc\\\"\\n\\n.equ STRINGSIZE, 500\\n\\n//.include \\\"../../ficmacros64.inc\\\"\\n/************************************/\\n/* Initialized data */\\n/************************************/\\n.data\\nszMessString: .asciz \\\"String :\\\\n\\\"\\nszMessEncrip: .asciz \\\"\\\\nEncrypted :\\\\n\\\"\\nszMessDecrip: .asciz \\\"\\\\nDecrypted :\\\\n\\\"\\nszString1: .asciz \\\"{NOWHERE! abcd xyz 1234}\\\"\\n\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\n/************************************/\\n/* UnInitialized data */\\n/************************************/\\n.bss\\nszString2: .skip STRINGSIZE\\nszString3: .skip STRINGSIZE\\n/************************************/\\n/* code section */\\n/************************************/\\n.text\\n.global main\\nmain:\\n\\n ldr x0,qAdrszMessString // display message\\n bl affichageMess\\n ldr x0,qAdrszString1 // display string\\n bl affichageMess\\n ldr x0,qAdrszString1\\n ldr x1,qAdrszString2\\n bl encryptRot13\\n ldr x0,qAdrszMessEncrip\\n bl affichageMess\\n ldr x0,qAdrszString2 // display string\\n bl affichageMess\\n ldr x0,qAdrszString2\\n ldr x1,qAdrszString3\\n bl decryptRot13\\n ldr x0,qAdrszMessDecrip\\n bl affichageMess\\n ldr x0,qAdrszString3 // display string\\n bl affichageMess\\n ldr x0,qAdrszCarriageReturn\\n bl affichageMess\\n100: // standard end of the program\\n mov x0, #0 // return code\\n mov x8,EXIT\\n svc 0 // perform system call\\nqAdrszMessString: .quad szMessString\\nqAdrszMessDecrip: .quad szMessDecrip\\nqAdrszMessEncrip: .quad szMessEncrip\\nqAdrszString1: .quad szString1\\nqAdrszString2: .quad szString2\\nqAdrszString3: .quad szString3\\nqAdrszCarriageReturn: .quad szCarriageReturn\\n/******************************************************************/\\n/* encrypt strings */\\n/******************************************************************/\\n/* x0 contains the address of the string1 */\\n/* x1 contains the address of the encrypted string */\\nencryptRot13:\\n stp x3,lr,[sp,-16]! // save registers\\n stp x4,x5,[sp,-16]! // save registers\\n mov x3,#0 // counter byte string 1\\n mov x2,#13 // rot characters number\\n1:\\n ldrb w4,[x0,x3] // load byte string 1\\n cmp w4,#0 // zero final ?\\n bne 2f\\n strb w4,[x1,x3]\\n mov x0,x3\\n b 100f\\n2:\\n cmp w4,#65 // < A ?\\n bge 3f\\n strb w4,[x1,x3]\\n add x3,x3,#1\\n b 1b // and loop\\n3:\\n cmp x4,#90 // > Z\\n bgt 4f\\n add x4,x4,x2 // add key\\n cmp x4,#90 // > Z\\n sub x5,x4,26\\n csel x4,x5,x4,gt\\n strb w4,[x1,x3]\\n add x3,x3,#1\\n b 1b\\n4:\\n cmp x4,#97 // < a ?\\n bge 5f\\n strb w4,[x1,x3]\\n add x3,x3,#1\\n b 1b\\n5:\\n cmp x4,#122 //> z\\n ble 6f\\n strb w4,[x1,x3]\\n add x3,x3,#1\\n b 1b\\n6:\\n add x4,x4,x2\\n cmp x4,#122\\n sub x5,x4,26\\n csel x4,x5,x4,gt\\n strb w4,[x1,x3]\\n add x3,x3,#1\\n b 1b\\n\\n100:\\n ldp x4,x5,[sp],16 // restaur registers\\n ldp x3,lr,[sp],16 // restaur registers\\n ret\\n/******************************************************************/\\n/* decrypt strings */\\n/******************************************************************/\\n/* x0 contains the address of the encrypted string1 */\\n/* x1 contains the address of the decrypted string */\\ndecryptRot13:\\n stp x3,lr,[sp,-16]! // save registers\\n stp x4,x5,[sp,-16]! // save registers\\n mov x3,#0 // counter byte string 1\\n mov x2,#13 // rot characters number\\n1:\\n ldrb w4,[x0,x3] // load byte string 1\\n cmp w4,#0 // zero final ?\\n bne 2f\\n strb w4,[x1,x3]\\n mov x0,x3\\n b 100f\\n2:\\n cmp x4,#65 // < A ?\\n bge 3f\\n strb w4,[x1,x3]\\n add x3,x3,#1\\n b 1b // and loop\\n3:\\n cmp x4,#90 // > Z\\n bgt 4f\\n sub x4,x4,x2 // substract key\\n cmp x4,#65 // < A\\n add x5,x4,26\\n csel x4,x5,x4,lt\\n strb w4,[x1,x3]\\n add x3,x3,#1\\n b 1b\\n4:\\n cmp x4,#97 // < a ?\\n bge 5f\\n strb w4,[x1,x3]\\n add x3,x3,#1\\n b 1b\\n5:\\n cmp x4,#122 // > z\\n ble 6f\\n strb w4,[x1,x3]\\n add x3,x3,#1\\n b 1b\\n6:\\n sub x4,x4,x2 // substract key\\n cmp x4,#97 // < a\\n add x5,x4,26\\n csel x4,x5,x4,lt\\n strb w4,[x1,x3]\\n add x3,x3,#1\\n b 1b\\n\\n100:\\n ldp x4,x5,[sp],16 // restaur registers\\n ldp x3,lr,[sp],16 // restaur registers\\n ret\\n/***************************************************/\\n/* ROUTINES INCLUDE */\\n/***************************************************/\\n/* for this file see task include a file in language AArch64 assembly*/\\n.include \\\"../includeARM64.inc\\\"\\n\",\n \"language\": \"AArch64-Assembly\"\n },\n {\n \"code\": \"(include-book \\\"arithmetic-3/top\\\" :dir :system)\\n\\n(defun char-btn (c low high)\\n (and (char>= c low)\\n (char<= c high)))\\n\\n(defun rot-13-cs (cs)\\n (cond ((endp cs) nil)\\n ((or (char-btn (first cs) #\\\\a #\\\\m)\\n (char-btn (first cs) #\\\\A #\\\\M))\\n (cons (code-char (+ (char-code (first cs)) 13))\\n (rot-13-cs (rest cs))))\\n ((or (char-btn (first cs) #\\\\n #\\\\z)\\n (char-btn (first cs) #\\\\N #\\\\Z))\\n (cons (code-char (- (char-code (first cs)) 13))\\n (rot-13-cs (rest cs))))\\n (t (cons (first cs) (rot-13-cs (rest cs))))))\\n\\n(defun rot-13 (s)\\n (coerce (rot-13-cs (coerce s 'list)) 'string))\\n\",\n \"language\": \"ACL2\"\n },\n {\n \"code\": \"with Ada.Text_IO.Text_Streams; use Ada.Text_IO.Text_Streams;\\nwith Ada.Strings.Maps; use Ada.Strings.Maps;\\nwith Ada.Command_Line; use Ada.Command_Line;\\n\\nprocedure Rot_13 is\\n\\n From_Sequence : Character_Sequence := \\\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\n Result_Sequence : Character_Sequence := \\\"nopqrstuvwxyzabcdefghijklmNOPQRSTUVWXYZABCDEFGHIJKLM\\\";\\n Rot_13_Mapping : Character_Mapping := To_Mapping(From_Sequence, Result_Sequence);\\n\\n In_Char : Character;\\n Stdio : Stream_Access := Stream(Ada.Text_IO.Standard_Input);\\n Stdout : Stream_Access := Stream(Ada.Text_Io.Standard_Output);\\n Input : Ada.Text_Io.File_Type;\\n\\nbegin\\n if Argument_Count > 0 then\\n for I in 1..Argument_Count loop\\n begin\\n Ada.Text_Io.Open(File => Input, Mode => Ada.Text_Io.In_File, Name => Argument(I));\\n Stdio := Stream(Input);\\n while not Ada.Text_Io.End_Of_File(Input) loop\\n In_Char :=Character'Input(Stdio);\\n Character'Output(Stdout, Value(Rot_13_Mapping, In_Char));\\n end loop;\\n Ada.Text_IO.Close(Input);\\n exception\\n when Ada.Text_IO.Name_Error =>\\n Ada.Text_Io.Put_Line(File => Ada.Text_Io.Standard_Error, Item => \\\"File \\\" & Argument(I) & \\\" is not a file.\\\");\\n when Ada.Text_Io.Status_Error =>\\n Ada.Text_Io.Put_Line(File => Ada.Text_Io.Standard_Error, Item => \\\"File \\\" & Argument(I) & \\\" is already opened.\\\");\\n end;\\n end loop;\\n else\\n while not Ada.Text_Io.End_Of_File loop\\n In_Char :=Character'Input(Stdio);\\n Character'Output(Stdout, Value(Rot_13_Mapping, In_Char));\\n end loop;\\n end if;\\nend Rot_13;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"BEGIN\\n CHAR c;\\n on logical file end(stand in, (REF FILE f)BOOL: (stop; SKIP));\\n on line end(stand in, (REF FILE f)BOOL: (print(new line); FALSE));\\n DO\\n read(c);\\n IF c >= \\\"A\\\" AND c <= \\\"M\\\" OR c >= \\\"a\\\" AND c <= \\\"m\\\" THEN\\n c := REPR(ABS c + 13)\\n ELIF c >= \\\"N\\\" AND c <= \\\"Z\\\" OR c >= \\\"n\\\" AND c <= \\\"z\\\" THEN\\n c := REPR(ABS c - 13)\\n FI;\\n print(c)\\n OD\\nEND # rot13 #\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"r1 ← ⎕UCS ∘ {+/⍵,13×(⍵≥65)∧(⍵<78),(-(⍵≥78)∧(⍵≤90)),(⍵≥97)∧(⍵<110),(-(⍵≥110)∧(⍵≤122))} ∘ ⎕UCS\\nrot13 ← { r1 ¨ ⍵ }\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"r1 ← { ⎕UCS {+/⍵,13×(⍵≥65)∧(⍵<78),(-(⍵≥78)∧(⍵≤90)),(⍵≥97)∧(⍵<110),(-(⍵≥110)∧(⍵≤122))} ⎕UCS ⍵ }\\nrot13 ← { r1 ¨ ⍵ }\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"⍝ 2023-03-03\\n\\nk←'AaBbCcDdEeFfGgHhIiJjKkLlMmzZyYxXwWvVuUtTsSrRqQpPoOnN'\\nrot←{⍵∊k:[53-k⍳⍵]⋄⍵}¨\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"to rot13(textString)\\n do shell script \\\"tr a-zA-Z n-za-mN-ZA-M <<<\\\" & quoted form of textString\\nend rot13\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"to rot13(textString)\\n set theIDs to id of textString\\n repeat with thisID in theIDs\\n if (((thisID < 123) and (thisID > 96)) or ((thisID < 91) and (thisID > 64))) then ¬\\n tell (thisID mod 32) to set thisID's contents to thisID - it + (it + 12) mod 26 + 1\\n end repeat\\n\\n return string id theIDs\\nend rot13\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"rot13(\\\"nowhere ABJURER\\\")\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"-- ROT 13 --------------------------------------------------------------------\\n\\n-- rot13 :: String -> String\\non rot13(str)\\n script rt13\\n on |λ|(x)\\n if (x ≥ \\\"a\\\" and x ≤ \\\"m\\\") or (x ≥ \\\"A\\\" and x ≤ \\\"M\\\") then\\n character id ((id of x) + 13)\\n else if (x ≥ \\\"n\\\" and x ≤ \\\"z\\\") or (x ≥ \\\"N\\\" and x ≤ \\\"Z\\\") then\\n character id ((id of x) - 13)\\n else\\n x\\n end if\\n end |λ|\\n end script\\n\\n intercalate(\\\"\\\", map(rt13, characters of str))\\nend rot13\\n\\n\\n-- TEST ----------------------------------------------------------------------\\non run\\n rot13(\\\"nowhere ABJURER\\\")\\n\\n --> \\\"abjurer NOWHERE\\\"\\nend run\\n\\n\\n-- GENERIC FUNCTIONS ---------------------------------------------------------\\n\\n-- map :: (a -> b) -> [a] -> [b]\\non map(f, xs)\\n tell mReturn(f)\\n set lng to length of xs\\n set lst to {}\\n repeat with i from 1 to lng\\n set end of lst to |λ|(item i of xs, i, xs)\\n end repeat\\n return lst\\n end tell\\nend map\\n\\n-- intercalate :: Text -> [Text] -> Text\\non intercalate(strText, lstText)\\n set {dlm, my text item delimiters} to {my text item delimiters, strText}\\n set strJoined to lstText as text\\n set my text item delimiters to dlm\\n return strJoined\\nend intercalate\\n\\n-- Lift 2nd class handler function into 1st class script wrapper\\n-- mReturn :: Handler -> Script\\non mReturn(f)\\n if class of f is script then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"100HOME:INPUT\\\"ENTER A STRING:\\\";S$:FORL=1TOLEN(S$):I$=MID$(S$,L,1):LC=(ASC(I$)>95)*32:C$=CHR$(ASC(I$)-LC):IFC$>=\\\"A\\\"ANDC$<=\\\"Z\\\"THENC$=CHR$(ASC(C$)+13):C$=CHR$(ASC(C$)-26*(C$>\\\"Z\\\")):I$=CHR$(ASC(C$)+LC)\\n110A$=A$+I$:NEXT:PRINTA$\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"/* ARM assembly Raspberry PI */\\n/* program rot13.s */\\n/* for constantes see task include a file in arm assembly */\\n/************************************/\\n/* Constantes */\\n/************************************/\\n.include \\\"../constantes.inc\\\"\\n\\n.equ STRINGSIZE, 500\\n/************************************/\\n/* Initialized data */\\n/************************************/\\n.data\\nszMessString: .asciz \\\"String :\\\\n\\\"\\nszMessEncrip: .asciz \\\"\\\\nEncrypted :\\\\n\\\"\\nszMessDecrip: .asciz \\\"\\\\nDecrypted :\\\\n\\\"\\nszString1: .asciz \\\"{NOWHERE! abcd xyz 1234}\\\"\\n\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\n/************************************/\\n/* UnInitialized data */\\n/************************************/\\n.bss\\nszString2: .skip STRINGSIZE\\nszString3: .skip STRINGSIZE\\n/************************************/\\n/* code section */\\n/************************************/\\n.text\\n.global main\\nmain:\\n\\n ldr r0,iAdrszMessString @ display message\\n bl affichageMess\\n ldr r0,iAdrszString1 @ display string\\n bl affichageMess\\n ldr r0,iAdrszString1\\n ldr r1,iAdrszString2\\n bl encryptRot13\\n ldr r0,iAdrszMessEncrip\\n bl affichageMess\\n ldr r0,iAdrszString2 @ display string\\n bl affichageMess\\n ldr r0,iAdrszString2\\n ldr r1,iAdrszString3\\n bl decryptRot13\\n ldr r0,iAdrszMessDecrip\\n bl affichageMess\\n ldr r0,iAdrszString3 @ display string\\n bl affichageMess\\n ldr r0,iAdrszCarriageReturn\\n bl affichageMess\\n100: @ standard end of the program\\n mov r0, #0 @ return code\\n mov r7, #EXIT @ request to exit program\\n svc 0 @ perform system call\\niAdrszMessString: .int szMessString\\niAdrszMessDecrip: .int szMessDecrip\\niAdrszMessEncrip: .int szMessEncrip\\niAdrszString1: .int szString1\\niAdrszString2: .int szString2\\niAdrszString3: .int szString3\\niAdrszCarriageReturn: .int szCarriageReturn\\n/******************************************************************/\\n/* encrypt strings */\\n/******************************************************************/\\n/* r0 contains the address of the string1 */\\n/* r1 contains the address of the encrypted string */\\nencryptRot13:\\n push {r3,r4,lr} @ save registers\\n mov r3,#0 @ counter byte string 1\\n mov r2,#13 @ rot characters number\\n1:\\n ldrb r4,[r0,r3] @ load byte string 1\\n cmp r4,#0 @ zero final ?\\n streqb r4,[r1,r3]\\n moveq r0,r3\\n beq 100f\\n cmp r4,#65 @ < A ?\\n strltb r4,[r1,r3]\\n addlt r3,#1\\n blt 1b\\n cmp r4,#90 @ > Z\\n bgt 2f\\n add r4,r2 @ add key\\n cmp r4,#90 @ > Z\\n subgt r4,#26\\n strb r4,[r1,r3]\\n add r3,#1\\n b 1b\\n2:\\n cmp r4,#97 @ < a ?\\n strltb r4,[r1,r3]\\n addlt r3,#1\\n blt 1b\\n cmp r4,#122 @> z\\n strgtb r4,[r1,r3]\\n addgt r3,#1\\n bgt 1b\\n add r4,r2\\n cmp r4,#122\\n subgt r4,#26\\n strb r4,[r1,r3]\\n add r3,#1\\n b 1b\\n\\n100:\\n pop {r3,r4,lr} @ restaur registers\\n bx lr @ return\\n/******************************************************************/\\n/* decrypt strings */\\n/******************************************************************/\\n/* r0 contains the address of the encrypted string1 */\\n/* r1 contains the address of the decrypted string */\\ndecryptRot13:\\n push {r3,r4,lr} @ save registers\\n mov r3,#0 @ counter byte string 1\\n mov r2,#13 @ rot characters number\\n1:\\n ldrb r4,[r0,r3] @ load byte string 1\\n cmp r4,#0 @ zero final ?\\n streqb r4,[r1,r3]\\n moveq r0,r3\\n beq 100f\\n cmp r4,#65 @ < A ?\\n strltb r4,[r1,r3]\\n addlt r3,#1\\n blt 1b\\n cmp r4,#90 @ > Z\\n bgt 2f\\n sub r4,r2 @ substract key\\n cmp r4,#65 @ < A\\n addlt r4,#26\\n strb r4,[r1,r3]\\n add r3,#1\\n b 1b\\n2:\\n cmp r4,#97 @ < a ?\\n strltb r4,[r1,r3]\\n addlt r3,#1\\n blt 1b\\n cmp r4,#122 @ > z\\n strgtb r4,[r1,r3]\\n addgt r3,#1\\n bgt 1b\\n sub r4,r2 @ substract key\\n cmp r4,#97 @ < a\\n addlt r4,#26\\n strb r4,[r1,r3]\\n add r3,#1\\n b 1b\\n\\n100:\\n pop {r3,r4,lr} @ restaur registers\\n bx lr @ return\\n/***************************************************/\\n/* ROUTINES INCLUDE */\\n/***************************************************/\\n/* for this file see task include a file in language ARM assembly*/\\n.include \\\"../affichage.inc\\\"\\n\",\n \"language\": \"ARM-Assembly\"\n },\n {\n \"code\": \"rot13: function [c][\\n case [in? lower c]\\n when? -> `a`..`m` -> return to :char (to :integer c) + 13\\n when? -> `n`..`z` -> return to :char (to :integer c) - 13\\n else -> return c\\n]\\n\\nloop \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\" 'ch\\n -> prints rot13 ch\\n\\nprint \\\"\\\"\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"ROT13(string) ; by Raccoon July-2009\\n{\\n Static a := \\\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ \\\"\\n Static b := \\\"nopqrstuvwxyzabcdefghijklmNOPQRSTUVWXYZABCDEFGHIJKLM \\\"\\n s=\\n Loop, Parse, string\\n {\\n c := substr(b,instr(a,A_LoopField,True),1)\\n if (c != \\\" \\\")\\n s .= c\\n else\\n s .= A_LoopField\\n }\\n Return s\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"ROT13(string) ; by Raccoon July-2009\\n{\\n s=\\n Loop, Parse, string\\n {\\n c := asc(A_LoopField)\\n if (c >= 97) && (c <= 109) || (c >= 65) && (c <= 77)\\n c += 13\\n else if (c >= 110) && (c <= 122) || (c >= 78) && (c <= 90)\\n c -= 13\\n s .= chr(c)\\n }\\n Return s\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"Str0=Hello, This is a sample text with 1 2 3 or other digits!@#$^&*()-_=\\nStr1 := Rot13(Str0)\\nStr2 := Rot13(Str1)\\nMsgBox % Str0 \\\"`n\\\" Str1 \\\"`n\\\" Str2\\n\\nRot13(string)\\n{\\n Loop Parse, string\\n {\\n char := Asc(A_LoopField)\\n ; o is 'A' code if it is an uppercase letter, and 'a' code if it is a lowercase letter\\n o := Asc(\\\"A\\\") * (Asc(\\\"A\\\") <= char && char <= Asc(\\\"Z\\\")) + Asc(\\\"a\\\") * (Asc(\\\"a\\\") <= char && char <= Asc(\\\"z\\\"))\\n If (o > 0)\\n {\\n ; Set between 0 and 25, add rotation factor, modulus alphabet size\\n char := Mod(char - o + 13, 26)\\n ; Transform back to char, upper or lower\\n char := Chr(char + o)\\n }\\n Else\\n {\\n ; Non alphabetic, unchanged\\n char := A_LoopField\\n }\\n rStr .= char\\n }\\n Return rStr\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"Rot13(string) {\\n Output := \\\"\\\"\\n Loop, Parse, string\\n {\\n a := ~Asc(A_LoopField)\\n Output .= Chr(~a-1//(~(a|32)//13*2-11)*13)\\n }\\n return Output\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# usage: awk -f rot13.awk\\nBEGIN {\\n for(i=0; i < 256; i++) {\\n amap[sprintf(\\\"%c\\\", i)] = i\\n }\\n for(l=amap[\\\"a\\\"]; l <= amap[\\\"z\\\"]; l++) {\\n rot13[l] = sprintf(\\\"%c\\\", (((l-amap[\\\"a\\\"])+13) % 26 ) + amap[\\\"a\\\"])\\n }\\n FS = \\\"\\\"\\n}\\n{\\n o = \\\"\\\"\\n for(i=1; i <= NF; i++) {\\n if ( amap[tolower($i)] in rot13 ) {\\n c = rot13[amap[tolower($i)]]\\n if ( tolower($i) != $i ) c = toupper(c)\\n o = o c\\n } else {\\n o = o $i\\n }\\n }\\n print o\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"INPUT \\\"String: \\\", s$\\nPRINT \\\"Output: \\\", REPLACE$(s$, \\\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\\\", \\\"nopqrstuvwxyzabcdefghijklmNOPQRSTUVWXYZABCDEFGHIJKLM\\\", 2)\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"CLS\\nINPUT \\\"Enter a string: \\\", s$\\nans$ = \\\"\\\"\\nFOR a = 1 TO LEN(s$)\\n letter$ = MID$(s$, a, 1)\\n IF letter$ >= \\\"A\\\" AND letter$ <= \\\"Z\\\" THEN\\n char$ = CHR$(ASC(letter$) + 13)\\n IF char$ > \\\"Z\\\" THEN char$ = CHR$(ASC(char$) - 26)\\n ELSEIF letter$ >= \\\"a\\\" AND letter$ <= \\\"z\\\" THEN\\n char$ = CHR$(ASC(letter$) + 13)\\n IF char$ > \\\"z\\\" THEN char$ = CHR$(ASC(char$) - 26)\\n ELSE\\n char$ = letter$\\n END IF\\n ans$ = ans$ + char$\\nNEXT a\\nPRINT ans$\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"INPUT \\\"Enter a string \\\"; Text$\\nFOR c% = 1 TO LEN(Text$)\\n SELECT CASE ASC(MID$(Text$, c%, 1))\\n CASE 65 TO 90\\n MID$(Text$, c%, 1) = CHR$(65 + ((ASC(MID$(Text$, c%, 1)) - 65 + 13) MOD 26))\\n CASE 97 TO 122\\n MID$(Text$, c%, 1) = CHR$(97 + ((ASC(MID$(Text$, c%, 1)) - 97 + 13) MOD 26))\\n END SELECT\\nNEXT c%\\nPRINT \\\"Converted......: \\\"; Text$\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"# rot13 Cipher v2.0\\n# basic256 1.1.4.0\\n# 2101031238\\n\\ndec$ = \\\"\\\"\\ntype$ = \\\"cleartext \\\"\\nctext$ = \\\"\\\"\\nsp = 0\\niOffset = 13 #offset assumed to be 13 - uncomment line 11 to change\\n\\ninput \\\"For decrypt enter \\\" + \\\"<d> \\\" + \\\" -- else press enter > \\\",dec$\\n# input \\\"Enter offset > \\\", iOffset\\n\\nif dec$ = \\\"d\\\" OR dec$ = \\\"D\\\" then\\n iOffset = 26 - iOffset\\n type$ = \\\"ciphertext \\\"\\nend if\\n\\ninput \\\"Enter \\\" + type$ + \\\"> \\\", str$\\nstr$ = upper(str$)\\n\\nfor i = 1 to length(str$)\\n iTemp = asc(mid(str$,i,1))\\n if iTemp > 64 AND iTemp < 91 then\\n iTemp = ((iTemp - 65) + iOffset) % 26\\n print chr(iTemp + 65);\\n sp = sp + 1\\n if sp = 5 then\\n print(' ');\\n sp = 0\\n endif\\n endif\\nnext i\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off & setlocal enabledelayedexpansion\\n\\n:: ROT13 obfuscator Michael Sanders - 2017\\n::\\n:: example: rot13.cmd Rire abgvpr cflpuvpf arire jva gur ybggrel?\\n\\n:setup\\n\\n set str=%*\\n set buf=%str%\\n set len=0\\n\\n:getlength\\n\\n if not defined buf goto :start\\n set buf=%buf:~1%\\n set /a len+=1\\n goto :getlength\\n\\n:start\\n\\n if %len% leq 0 (echo rot13: zero length string & exit /b 1)\\n set abc=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\n set nop=NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm\\n set r13=\\n set num=0\\n set /a len-=1\\n\\n:rot13\\n\\n for /l %%x in (!num!,1,%len%) do (\\n set log=0\\n for /l %%y in (0,1,51) do (\\n if \\\"!str:~%%x,1!\\\"==\\\"!abc:~%%y,1!\\\" (\\n call set r13=!r13!!nop:~%%y,1!\\n set /a num=%%x+1\\n set /a log+=1\\n if !num! lss %len% goto :rot13\\n )\\n )\\n if !log!==0 call set r13=!r13!!str:~%%x,1!\\n )\\n\\n:done\\n\\n echo !r13!\\n endlocal & exit /b 0\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" REPEAT\\n INPUT A$\\n PRINT FNrot13(A$)\\n UNTIL FALSE\\n END\\n\\n DEF FNrot13(A$)\\n LOCAL A%,B$,C$\\n IF A$=\\\"\\\" THEN =\\\"\\\"\\n FOR A%=1 TO LEN A$\\n C$=MID$(A$,A%,1)\\n IF C$<\\\"A\\\" OR (C$>\\\"Z\\\" AND C$<\\\"a\\\") OR C$>\\\"z\\\" THEN\\n B$=B$+C$\\n ELSE\\n IF (ASC(C$) AND &DF)<ASC(\\\"N\\\") THEN\\n B$=B$+CHR$(ASC(C$)+13)\\n ELSE\\n B$=B$+CHR$(ASC(C$)-13)\\n ENDIF\\n ENDIF\\n NEXT A%\\n =B$\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\nlet rot13(x) =\\n 'A' <= x <= 'Z' -> (x - 'A' + 13) rem 26 + 'A',\\n 'a' <= x <= 'z' -> (x - 'a' + 13) rem 26 + 'a',\\n x\\n\\nlet start() be\\n$( let ch = rdch()\\n if ch = endstreamch then break\\n wrch(rot13(ch))\\n$) repeat\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"~:\\\"z\\\"`#v_:\\\"m\\\"`#v_:\\\"`\\\"` |>\\n :\\\"Z\\\"`#v_:\\\"M\\\"`#v_:\\\"@\\\"`|>\\n : 0 `#v_@v-6-7< >\\n, < <+6+7 <<v\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \"chars ← ⥊ \\\"AaNn\\\" +⌜ ↕13\\n\\nRot13 ← {𝕨 ⊣⌾((𝕩=52)⊸/) ⊏⟜chars 52|26+𝕩}⟜(chars⊸⊐)\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"Rot13 \\\"Abcdefghijklm:Nopqrstuvwxyz_123 aBCDEFGHIJKLM-nOPQRSTUVWXYZ.\\\"\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"blsq ) \\\"HELLO WORLD\\\"{{'A'Zr\\\\\\\\/Fi}m[13?+26.%'A'Zr\\\\\\\\/si}ww\\n\\\"URYYB JBEYQ\\\"\\nblsq ) \\\"URYYB JBEYQ\\\"{{'A'Zr\\\\\\\\/Fi}m[13?+26.%'A'Zr\\\\\\\\/si}ww\\n\\\"HELLO WORLD\\\"\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"#include <ctype.h>\\n#include <limits.h>\\n#include <stdio.h>\\n#include <stdlib.h>\\n\\nstatic char rot13_table[UCHAR_MAX + 1];\\n\\nstatic void init_rot13_table(void) {\\n\\tstatic const unsigned char upper[] = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\n\\tstatic const unsigned char lower[] = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\n\\n\\tfor (int ch = '\\\\0'; ch <= UCHAR_MAX; ch++) {\\n\\t\\trot13_table[ch] = ch;\\n\\t}\\n\\tfor (const unsigned char *p = upper; p[13] != '\\\\0'; p++) {\\n\\t\\trot13_table[p[0]] = p[13];\\n\\t\\trot13_table[p[13]] = p[0];\\n\\t}\\n\\tfor (const unsigned char *p = lower; p[13] != '\\\\0'; p++) {\\n\\t\\trot13_table[p[0]] = p[13];\\n\\t\\trot13_table[p[13]] = p[0];\\n\\t}\\n}\\n\\nstatic void rot13_file(FILE *fp)\\n{\\n\\tint ch;\\n\\twhile ((ch = fgetc(fp)) != EOF) {\\n\\t\\tfputc(rot13_table[ch], stdout);\\n\\t}\\n}\\n\\nint main(int argc, char *argv[])\\n{\\n\\tinit_rot13_table();\\n\\n\\tif (argc > 1) {\\n\\t\\tfor (int i = 1; i < argc; i++) {\\n\\t\\t\\tFILE *fp = fopen(argv[i], \\\"r\\\");\\n\\t\\t\\tif (fp == NULL) {\\n\\t\\t\\t\\tperror(argv[i]);\\n\\t\\t\\t\\treturn EXIT_FAILURE;\\n\\t\\t\\t}\\n\\t\\t\\trot13_file(fp);\\n\\t\\t\\tfclose(fp);\\n\\t\\t}\\n\\t} else {\\n\\t\\trot13_file(stdin);\\n\\t}\\n\\treturn EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <istream>\\n#include <ostream>\\n#include <fstream>\\n#include <cstdlib>\\n#include <string>\\n\\n// the rot13 function\\nstd::string rot13(std::string s)\\n{\\n static std::string const\\n lcalph = \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n ucalph = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\n\\n std::string result;\\n std::string::size_type pos;\\n\\n result.reserve(s.length());\\n\\n for (std::string::iterator it = s.begin(); it != s.end(); ++it)\\n {\\n if ( (pos = lcalph.find(*it)) != std::string::npos )\\n result.push_back(lcalph[(pos+13) % 26]);\\n else if ( (pos = ucalph.find(*it)) != std::string::npos )\\n result.push_back(ucalph[(pos+13) % 26]);\\n else\\n result.push_back(*it);\\n }\\n\\n return result;\\n}\\n\\n// function to output the rot13 of a file on std::cout\\n// returns false if an error occurred processing the file, true otherwise\\n// on entry, the argument is must be open for reading\\nint rot13_stream(std::istream& is)\\n{\\n std::string line;\\n while (std::getline(is, line))\\n {\\n if (!(std::cout << rot13(line) << \\\"\\\\n\\\"))\\n return false;\\n }\\n return is.eof();\\n}\\n\\n// the main program\\nint main(int argc, char* argv[])\\n{\\n if (argc == 1) // no arguments given\\n return rot13_stream(std::cin)? EXIT_SUCCESS : EXIT_FAILURE;\\n\\n std::ifstream file;\\n for (int i = 1; i < argc; ++i)\\n {\\n file.open(argv[i], std::ios::in);\\n if (!file)\\n {\\n std::cerr << argv[0] << \\\": could not open for reading: \\\" << argv[i] << \\\"\\\\n\\\";\\n return EXIT_FAILURE;\\n }\\n if (!rot13_stream(file))\\n {\\n if (file.eof())\\n // no error occurred for file, so the error must have been in output\\n std::cerr << argv[0] << \\\": error writing to stdout\\\\n\\\";\\n else\\n std::cerr << argv[0] << \\\": error reading from \\\" << argv[i] << \\\"\\\\n\\\";\\n return EXIT_FAILURE;\\n }\\n file.clear();\\n file.close();\\n if (!file)\\n std::cerr << argv[0] << \\\": warning: closing failed for \\\" << argv[i] << \\\"\\\\n\\\";\\n }\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <string>\\n#include <boost/iostreams/concepts.hpp> // output_filter\\n#include <boost/iostreams/operations.hpp> // put\\n#include <boost/iostreams/filtering_stream.hpp>\\n#include <fstream>\\nnamespace io = boost::iostreams;\\n\\nclass rot_output_filter : public io::output_filter\\n{\\npublic:\\n explicit rot_output_filter(int r=13):rotby(r),negrot(alphlen-r){};\\n\\n template<typename Sink>\\n bool put(Sink& dest, int c){\\n char uc = toupper(c);\\n\\n if(('A' <= uc) && (uc <= ('Z'-rotby)))\\n c = c + rotby;\\n else if ((('Z'-rotby) <= uc) && (uc <= 'Z'))\\n c = c - negrot;\\n return boost::iostreams::put(dest, c);\\n };\\nprivate:\\n static const int alphlen = 26;\\n const int rotby;\\n const int negrot;\\n};\\n\\nint main(int argc, char *argv[])\\n{\\n io::filtering_ostream out;\\n out.push(rot_output_filter(13));\\n out.push(std::cout);\\n\\n if (argc == 1) out << std::cin.rdbuf();\\n else for(int i = 1; i < argc; ++i){\\n std::ifstream in(argv[i]);\\n out << in.rdbuf();\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <string>\\n#include <iostream>\\n#include <fstream>\\n\\nchar rot13(const char c){\\n\\tif (c >= 'a' && c <= 'z')\\n\\t\\treturn (c - 'a' + 13) % 26 + 'a';\\n\\telse if (c >= 'A' && c <= 'Z')\\n\\t\\treturn (c - 'A' + 13) % 26 + 'A';\\n\\treturn c;\\n}\\n\\nstd::string &rot13(std::string &s){\\n\\tfor (auto &c : s) //range based for is the only used C++11 feature\\n\\t\\tc = rot13(c);\\n\\treturn s;\\n}\\n\\nvoid rot13(std::istream &in, std::ostream &out){\\n\\tstd::string s;\\n\\twhile (std::getline(in, s))\\n\\t\\tout << rot13(s) << '\\\\n';\\n}\\n\\nint main(int argc, char *argv[]){\\n\\tif (argc == 1)\\n\\t\\trot13(std::cin, std::cout);\\n\\tfor (int arg = 1; arg < argc; ++arg){\\n\\t\\tstd::ifstream f(argv[arg]);\\n\\t\\tif (!f)\\n\\t\\t\\treturn EXIT_FAILURE;\\n\\t\\trot13(f, std::cout);\\n\\t}\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System;\\nusing System.IO;\\nusing System.Linq;\\nusing System.Text;\\n\\n\\nclass Program {\\n private static char shift(char c) {\\n\\t\\treturn c.ToString().ToLower().First() switch {\\n\\t\\t\\t>= 'a' and <= 'm' => (char)(c + 13),\\n\\t\\t\\t>= 'n' and <= 'z' => (char)(c - 13),\\n\\t\\t\\tvar _ => c\\n\\t\\t};\\n }\\n\\n static string Rot13(string s) => new string(s.Select(c => shift(c)).ToArray());\\n\\n\\n static void Main(string[] args) {\\n foreach (var file in args.Where(file => File.Exists(file))) {\\n Console.WriteLine(Rot13(File.ReadAllText(file)));\\n }\\n if (!args.Any()) {\\n Console.WriteLine(Rot13(Console.In.ReadToEnd()));\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"100 rem ROT-13\\n110 cls : rem 110 HOME for Applesoft BASIC\\n120 input \\\"Enter a string: \\\";a$\\n130 gosub 160\\n140 print b$\\n150 end\\n160 rem FUNCTION rot13\\n170 for i = 1 to len(a$)\\n180 n = asc(mid$(a$,i,1))\\n190 e = 255\\n200 if n > 64 and n < 91 then e = 90 : rem uppercase\\n210 if n > 96 and n < 123 then e = 122 : rem lowercase\\n220 if e < 255 then n = n+13\\n230 if n > e then n = n-26\\n240 b$ = b$+chr$(n)\\n250 next\\n260 return\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"(ns rosettacode.rot-13)\\n\\n(let [a (int \\\\a) m (int \\\\m) A (int \\\\A) M (int \\\\M)\\n n (int \\\\n) z (int \\\\z) N (int \\\\N) Z (int \\\\Z)]\\n (defn rot-13 [^Character c]\\n (char (let [i (int c)]\\n (cond-> i\\n (or (<= a i m) (<= A i M)) (+ 13)\\n (or (<= n i z) (<= N i Z)) (- 13))))))\\n\\n(apply str (map rot-13 \\\"The Quick Brown Fox Jumped Over The Lazy Dog!\\\"))\\n\\n; An alternative implementation using a map:\\n(let [A (into #{} \\\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\\\")\\n Am (->> (cycle A) (drop 26) (take 52) (zipmap A))]\\n (defn rot13 [^String in]\\n (apply str (map #(Am % %) in))))\\n\\n(rot13 \\\"The Quick Brown Fox Jumped Over The Lazy Dog!\\\")\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"rot13 = proc (c: char) returns (char)\\n base: int\\n letter: bool := false\\n if c>='A' & c<='Z' then\\n base := char$c2i('A')\\n letter := true\\n elseif c>='a' & c<='z' then\\n base := char$c2i('a')\\n letter := true\\n end\\n if ~letter then return(c) end\\n return(char$i2c((char$c2i(c)-base+13)//26+base))\\nend rot13\\n\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n pi: stream := stream$primary_input()\\n while true do\\n stream$putc(po,rot13(stream$getc(pi)))\\n except when end_of_file: break end\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \"FORMAT IDENTIFICATION DIVISION.\\n PROGRAM-ID. rot-13.\\n\\n DATA DIVISION.\\n LINKAGE SECTION.\\n 77 in-str PIC X(100).\\n 77 out-str PIC X(100).\\n\\n PROCEDURE DIVISION USING BY REFERENCE in-str, out-str.\\n MOVE in-str TO out-str\\n INSPECT out-str\\n CONVERTING \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n TO \\\"nopqrstuvwxyzabcdefghijklm\\\"\\n INSPECT out-str\\n CONVERTING \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n TO \\\"NOPQRSTUVWXYZABCDEFGHIJKLM\\\"\\n EXIT PROGRAM.\\n\\n END PROGRAM rot-13.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"IDENTIFICATION DIVISION.\\nFUNCTION-ID. rot-13.\\n\\nDATA DIVISION.\\nLOCAL-STORAGE SECTION.\\n01 STR-LENGTH CONSTANT AS 100.\\n01 normal-lower CONSTANT AS \\\"abcdefghijklmnopqrstuvwxyz\\\".\\n01 rot13-lower CONSTANT AS \\\"nopqrstuvwxyzabcdefghijklm\\\".\\n01 normal-upper CONSTANT AS \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\".\\n01 rot13-upper CONSTANT AS \\\"NOPQRSTUVWXYZABCDEFGHIJKLM\\\".\\nLINKAGE SECTION.\\n77 in-str PICTURE IS X(STR-LENGTH).\\n77 out-str PICTURE IS X(STR-LENGTH).\\n\\nPROCEDURE DIVISION USING in-str, RETURNING out-str.\\n MOVE in-str TO out-str\\n INSPECT out-str CONVERTING normal-lower TO rot13-lower\\n INSPECT out-str CONVERTING normal-upper TO rot13-upper\\n GOBACK.\\n\\nEND FUNCTION rot-13.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"1 rem rot-13 cipher\\n2 rem rosetta code\\n10 print chr$(147);chr$(14);\\n25 gosub 1000\\n30 print chr$(147);\\\"Enter a message to translate.\\\"\\n35 print:print \\\"Press CTRL-Z when finished.\\\":print\\n40 mg$=\\\"\\\":gosub 2000\\n45 print chr$(147);\\\"Processing...\\\":gosub 3000\\n50 print chr$(147);\\\"The translated message is:\\\"\\n55 print:print cm$\\n100 print:print \\\"Do another one? \\\";\\n110 get k$:if k$<>\\\"y\\\" and k$<>\\\"n\\\" then 110\\n120 print k$:if k$=\\\"y\\\" then goto 10\\n130 end\\n\\n1000 rem generate encoding table\\n1010 ec$=\\\"mnopqrstuvwxyzabcdefghijklMNOPQRSTUVWXYZABCDEFGHIJKL\\\"\\n1099 return\\n\\n2000 rem get user input routine\\n2005 print chr$(18);\\\" \\\";chr$(146);chr$(157);\\n2010 get k$:if k$=\\\"\\\" then 2010\\n2012 if k$=chr$(13) then print \\\" \\\";chr$(157);\\n2015 print k$;\\n2020 if k$=chr$(20) then mg$=left$(mg$,len(mg$)-1):goto 2040\\n2025 if len(mg$)=255 or k$=chr$(26) then return\\n2030 mg$=mg$+k$\\n2040 goto 2005\\n\\n3000 rem translate message\\n3005 cm$=\\\"\\\"\\n3010 for i=1 to len(mg$)\\n3015 c=asc(mid$(mg$,i,1))\\n3020 if c<65 or (c>90 and c<193) or c>218 then cm$=cm$+chr$(c):goto 3030\\n3025 if c>=65 and c<=90 then c=c-64\\n3030 if c>=193 and c<=218 then c=(c-192)+26\\n3035 cm$=cm$+mid$(ec$,c,1)\\n3040 next i\\n3050 return\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"(defconstant +alphabet+\\n'(#\\\\A #\\\\B #\\\\C #\\\\D #\\\\E #\\\\F #\\\\G #\\\\H #\\\\I #\\\\J #\\\\K #\\\\L #\\\\M #\\\\N #\\\\O #\\\\P\\n #\\\\Q #\\\\R #\\\\S #\\\\T #\\\\U #\\\\V #\\\\W #\\\\X #\\\\Y #\\\\Z))\\n\\n(defun rot13 (s)\\n (map 'string\\n (lambda (c &aux (n (position (char-upcase c) +alphabet+)))\\n (if n\\n (funcall\\n (if (lower-case-p c) #'char-downcase #'identity)\\n (nth (mod (+ 13 n) 26) +alphabet+))\\n c))\\n s))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defun rot13 (string)\\n (map 'string\\n (lambda (char &aux (code (char-code char)))\\n (if (alpha-char-p char)\\n (if (> (- code (char-code (if (upper-case-p char)\\n #\\\\A #\\\\a))) 12)\\n (code-char (- code 13))\\n (code-char (+ code 13)))\\n char))\\n string))\\n\\n(rot13 \\\"Moron\\\") ; -> \\\"Zbeba\\\"\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defconstant +a+ \\\"AaBbCcDdEeFfGgHhIiJjKkLlMmzZyYxXwWvVuUtTsSrRqQpPoOnN\\\")\\n\\n(defun rot (txt)\\n (map 'string\\n #'(lambda (x)\\n (if (find x +a+)\\n (char +a+ (- 51 (position x +a+)))\\n x))\\n txt))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"alias rot13 [\\n\\tpush alpha [\\n\\t\\t\\\"A B C D E F G H I J K L M N O P Q R S T U V W X Y Z\\\"\\n\\t\\t\\\"a b c d e f g h i j k l m n o p q r s t u v w x y z\\\"\\n\\t] [ push chars [] [\\n\\t\\tloop i (strlen $arg1) [\\n\\t\\t\\tlooplist n $alpha [\\n\\t\\t\\t\\tif (! (listlen $chars)) [\\n\\t\\t\\t\\t\\talias chars (? (> (listindex $n (substr $arg1 $i 1)) -1) $n [])\\n\\t\\t\\t\\t]\\n\\t\\t\\t]\\n\\t\\t\\talias arg1 (\\n\\t\\t\\t\\tconcatword (substr $arg1 0 $i) (\\n\\t\\t\\t\\t\\t? (listlen $chars) (\\n\\t\\t\\t\\t\\t\\tat $chars (\\n\\t\\t\\t\\t\\t\\t\\tmod (+ (\\n\\t\\t\\t\\t\\t\\t\\t\\tlistindex $chars (substr $arg1 $i 1)\\n\\t\\t\\t\\t\\t\\t\\t) 13 ) (listlen $chars)\\n\\t\\t\\t\\t\\t\\t)\\n\\t\\t\\t\\t\\t) (substr $arg1 $i 1)\\n\\t\\t\\t\\t) (substr $arg1 (+ $i 1) (strlen $arg1))\\n\\t\\t\\t)\\n\\t\\t\\talias chars []\\n\\t\\t]\\n\\t] ]\\n\\tresult $arg1\\n]\\n\",\n \"language\": \"Cubescript\"\n },\n {\n \"code\": \">>> rot13 \\\"Hello World\\\"\\n> Uryyb Jbeyq\\n>>> rot13 \\\"Gur Dhvpx Oebja Sbk Whzcf Bire Gur Ynml Qbt!\\\"\\n> The Quick Brown Fox Jumps Over The Lazy Dog!\\n\",\n \"language\": \"Cubescript\"\n },\n {\n \"code\": \"import std.stdio;\\nimport std.ascii: letters, U = uppercase, L = lowercase;\\nimport std.string: makeTrans, translate;\\n\\nimmutable r13 = makeTrans(letters,\\n //U[13 .. $] ~ U[0 .. 13] ~\\n U[13 .. U.length] ~ U[0 .. 13] ~\\n L[13 .. L.length] ~ L[0 .. 13]);\\n\\nvoid main() {\\n writeln(\\\"This is the 1st test!\\\".translate(r13, null));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, std.string, std.traits;\\n\\npure S rot13(S)(in S s) if (isSomeString!S) {\\n return rot(s, 13);\\n}\\n\\npure S rot(S)(in S s, in int key) if (isSomeString!S) {\\n auto r = s.dup;\\n\\n foreach (i, ref c; r) {\\n if ('a' <= c && c <= 'z')\\n c = ((c - 'a' + key) % 26 + 'a');\\n else if ('A' <= c && c <= 'Z')\\n c = ((c - 'A' + key) % 26 + 'A');\\n }\\n return cast(S) r;\\n}\\n\\nvoid main() {\\n \\\"Gur Dhvpx Oebja Sbk Whzcf Bire Gur Ynml Qbt!\\\".rot13().writeln();\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"String rot13char(int charCode) {\\n if ((charCode >= 'A'.codeUnitAt(0) && charCode <= 'M'.codeUnitAt(0)) ||\\n (charCode >= 'a'.codeUnitAt(0) && charCode <= 'm'.codeUnitAt(0))) {\\n return String.fromCharCode(charCode + 13);\\n } else if ((charCode >= 'N'.codeUnitAt(0) && charCode <= 'Z'.codeUnitAt(0)) ||\\n (charCode >= 'n'.codeUnitAt(0) && charCode <= 'z'.codeUnitAt(0))) {\\n return String.fromCharCode(charCode - 13);\\n } else {\\n return String.fromCharCode(charCode);\\n }\\n}\\n\\nString rot13(String str) {\\n return String.fromCharCodes(str.runes.map((rune) {\\n return rot13char(rune).codeUnitAt(0);\\n }));\\n}\\n\\nvoid main() {\\n print(rot13(\\\"The quick brown fox jumps over the lazy dog\\\"));\\n}\\n\",\n \"language\": \"Dart\"\n },\n {\n \"code\": \"program Rot13;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils;\\n\\nfunction Rot13char(c: AnsiChar): AnsiChar;\\nbegin\\n Result := c;\\n if c in ['a'..'m', 'A'..'M'] then\\n Result := AnsiChar(ord(c) + 13)\\n else if c in ['n'..'z', 'N'..'Z'] then\\n Result := AnsiChar(ord(c) - 13);\\nend;\\n\\nfunction Rot13Fn(s: ansistring): ansistring;\\nvar i: Integer;\\nbegin\\n SetLength(result, length(s));\\n for i := 1 to length(s) do\\n Result[i] := Rot13char(s[i]);\\nend;\\n\\nbegin\\n writeln(Rot13Fn('nowhere ABJURER'));\\n readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"func Char.Rot13() {\\n return Char(this.Order() + 13)\\n when this is >= 'a' and <= 'm' or >= 'A' and <= 'M'\\n return Char(this.Order() - 13)\\n when this is >= 'n' and <= 'z' or >= 'N' and <= 'Z'\\n return this\\n}\\n\\nfunc String.Rot13() {\\n var cs = []\\n for c in this {\\n cs.Add(c.Rot13())\\n }\\n String.Concat(values: cs)\\n}\\n\\n\\\"ABJURER nowhere\\\".Rot13()\\n\",\n \"language\": \"Dyalect\"\n },\n {\n \"code\": \"pragma.enable(\\\"accumulator\\\")\\n\\nvar rot13Map := [].asMap()\\nfor a in ['a', 'A'] {\\n for i in 0..!26 {\\n rot13Map with= (a + i, E.toString(a + (i + 13) % 26))\\n }\\n}\\n\\ndef rot13(s :String) {\\n return accum \\\"\\\" for c in s { _ + rot13Map.fetch(c, fn{ c }) }\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"func$ rot13 str$ .\\n for c$ in strchars str$\\n c = strcode c$\\n if c >= 65 and c <= 90\\n c = (c + 13 - 65) mod 26 + 65\\n elif c >= 97 and c <= 122\\n c = (c + 13 - 97) mod 26 + 97\\n .\\n enc$ &= strchar c\\n .\\n return enc$\\n.\\nenc$ = rot13 \\\"Rosetta Code\\\"\\nprint enc$\\nprint rot13 enc$\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"import system'routines;\\nimport extensions;\\nimport extensions'text;\\n\\nsingleton rotConvertor\\n{\\n char convert(char ch)\\n {\\n if (($97 <= ch && ch <= $109) || ($65 <= ch && ch <= $77))\\n {\\n ^ (ch.toInt() + 13).toChar()\\n };\\n if (($110 <= ch && ch <= $122) || ($78 <= ch && ch <= $90))\\n {\\n ^ (ch.toInt() - 13).toChar()\\n };\\n\\n ^ ch\\n }\\n\\n string convert(string s)\\n = s.selectBy::(ch => rotConvertor.convert(ch)).summarize(new StringWriter());\\n}\\n\\npublic program()\\n{\\n if (program_arguments.Length > 1)\\n {\\n console.printLine(rotConvertor.convert(program_arguments[1]))\\n }\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"defmodule RC do\\n def rot13(clist) do\\n f = fn(c) when (?A <= c and c <= ?M) or (?a <= c and c <= ?m) -> c + 13\\n (c) when (?N <= c and c <= ?Z) or (?n <= c and c <= ?z) -> c - 13\\n (c) -> c\\n end\\n Enum.map(clist, f)\\n end\\nend\\n\\nIO.inspect encode = RC.rot13('Rosetta Code')\\nIO.inspect RC.rot13(encode)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"defmodule Rot13 do\\n @moduledoc \\\"\\\"\\\"\\n ROT13 encoding program. Takes user input and outputs encoded text.\\n \\\"\\\"\\\"\\n\\n @spec sign(integer | float) :: -1 | 1\\n def sign(int) do\\n if int >= 0 do 1\\n else -1\\n end\\n end\\n\\n @spec rotate(charlist) :: charlist\\n def rotate(string_chars) do\\n string_chars\\n |> Enum.map(\\n fn char ->\\n char_up = << char :: utf8 >>\\n |> String.upcase()\\n |> String.to_charlist()\\n |> Enum.at(0)\\n if ?A <= char_up and char_up <= ?Z do\\n <<\\n char + (-13 * trunc(sign(char_up - 77.5))) :: utf8\\n >>\\n else\\n << char :: utf8 >>\\n end\\n end)\\n end\\n\\n @spec start(any, any) :: {:ok, pid}\\n def start(_type, _args) do\\n IO.puts(\\\"Enter string to encode:\\\")\\n IO.puts(\\n [\\n \\\"Encoded string:\\\\n\\\",\\n IO.read(:line)\\n |> String.trim()\\n |> String.to_charlist()\\n |> rotate()\\n ]\\n )\\n Task.start(fn -> :timer.sleep(1000) end)\\n end\\nend\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"(rot13-string \\\"abc\\\") ;=> \\\"nop\\\"\\n(with-temp-buffer\\n (insert \\\"abc\\\")\\n (rot13-region (point-min) (point-max))\\n (buffer-string)) ;=> \\\"nop\\\"\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"(defun rot-13 (string)\\n (let* ((len (length string))\\n (output (make-string len ?\\\\s)))\\n (dotimes (i len)\\n (let ((char (aref string i)))\\n (cond\\n ((or (and (>= char ?n) (<= char ?z))\\n (and (>= char ?N) (<= char ?Z)))\\n (aset output i (- char 13)))\\n ((or (and (>= char ?a) (<= char ?m))\\n (and (>= char ?A) (<= char ?M)))\\n (aset output i (+ char 13)))\\n (t\\n (aset output i char)))))\\n output))\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"rot13(Str) ->\\n F = fun(C) when (C >= $A andalso C =< $M); (C >= $a andalso C =< $m) -> C + 13;\\n (C) when (C >= $N andalso C =< $Z); (C >= $n andalso C =< $z) -> C - 13;\\n (C) -> C\\n end,\\n lists:map(F, Str).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"PROGRAM ROT13\\n\\nBEGIN\\nINPUT(\\\"Enter a string \\\",TEXT$)\\nFOR C%=1 TO LEN(TEXT$) DO\\n A%=ASC(MID$(TEXT$,C%,1))\\n CASE A% OF\\n 65..90->\\n MID$(TEXT$,C%,1)=CHR$(65+(A%-65+13) MOD 26)\\n END ->\\n 97..122->\\n MID$(TEXT$,C%,1)=CHR$(97+(A%-97+13) MOD 26)\\n END ->\\n END CASE\\nEND FOR\\nPRINT(\\\"Converted: \\\";TEXT$)\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"include std/types.e\\ninclude std/text.e\\n\\natom FALSE = 0\\natom TRUE = not FALSE\\n\\nfunction Rot13( object oStuff )\\n\\tinteger iOffset\\n\\tinteger bIsUpper\\n\\tobject oResult\\n\\tsequence sAlphabet = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\tif sequence(oStuff) then\\n\\t\\toResult = repeat( 0, length( oStuff ) )\\n\\t\\tfor i = 1 to length( oStuff ) do\\n\\t\\t\\toResult[ i ] = Rot13( oStuff[ i ] )\\n\\t\\tend for\\n\\telse\\n\\t\\tbIsUpper = FALSE\\n\\t\\tif t_upper( oStuff ) then\\n\\t\\t\\tbIsUpper = TRUE\\n\\t\\t\\toStuff = lower( oStuff )\\n\\t\\tend if\\n\\t\\tiOffset = find( oStuff, sAlphabet )\\n\\t\\tif iOffset != 0 then\\n\\t\\t\\tiOffset += 13\\n\\t\\t\\tiOffset = remainder( iOffset, 26 )\\n\\t\\t\\tif iOffset = 0 then iOffset = 1 end if\\n\\t\\t\\toResult = sAlphabet[iOffset]\\n\\t\\t\\tif bIsUpper then\\n\\t\\t\\t\\toResult = upper(oResult)\\n\\t\\t\\tend if\\n\\t\\telse\\n\\t\\t\\toResult = oStuff --sprintf( \\\"%s\\\", oStuff )\\n\\t\\tend if\\n\\tend if\\n\\treturn oResult\\nend function\\n\\nputs( 1, Rot13( \\\"abjurer NOWHERE.\\\" ) & \\\"\\\\n\\\" )\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"let rot13 (s : string) =\\n let rot c =\\n match c with\\n | c when c > 64 && c < 91 -> ((c - 65 + 13) % 26) + 65\\n | c when c > 96 && c < 123 -> ((c - 97 + 13) % 26) + 97\\n | _ -> c\\n s |> Array.of_seq\\n |> Array.map(int >> rot >> char)\\n |> (fun seq -> new string(seq))\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"#! /usr/bin/env factor\\n\\nUSING: kernel io ascii math combinators sequences ;\\nIN: rot13\\n\\n: rot-base ( ch ch -- ch ) [ - 13 + 26 mod ] keep + ;\\n\\n: rot13-ch ( ch -- ch )\\n {\\n { [ dup letter? ] [ CHAR: a rot-base ] }\\n { [ dup LETTER? ] [ CHAR: A rot-base ] }\\n [ ]\\n }\\n cond ;\\n\\n: rot13 ( str -- str ) [ rot13-ch ] map ;\\n\\n: main ( -- )\\n [ readln dup ]\\n [ rot13 print flush ]\\n while\\n drop ;\\n\\nMAIN: main\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"[^$1+][$32|$$'z>'a@>|$[\\\\%]?~[13\\\\'m>[_]?+]?,]#%\\n\",\n \"language\": \"FALSE\"\n },\n {\n \"code\": \"class Rot13\\n{\\n static Str rot13 (Str input)\\n {\\n Str result := \\\"\\\"\\n input.each |Int c|\\n {\\n if ((c.lower >= 'a') && (c.lower <= 'm'))\\n result += (c+13).toChar\\n else if ((c.lower >= 'n') && (c.lower <= 'z'))\\n result += (c-13).toChar\\n else\\n result += c.toChar\\n }\\n return result\\n }\\n\\n public static Void main (Str[] args)\\n {\\n if (args.size == 1)\\n { // process each line of given file\\n Str filename := args[0]\\n File(filename.toUri).eachLine |Str line|\\n {\\n echo (rot13(line))\\n }\\n }\\n else\\n {\\n echo (\\\"Test:\\\")\\n Str text := \\\"abcstuABCSTU123!+-\\\"\\n echo (\\\"Text $text becomes ${rot13(text)}\\\")\\n }\\n }\\n}\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \"#APPTYPE CONSOLE\\n\\nREM Create a CircularQueue object\\nREM CQ.Store item\\nREM CQ.Find items\\nREM CQ.Forward nItems\\nREM CQ.Recall\\n\\nREM SO CQ init WITH \\\"A\\\"... \\\"Z\\\"\\nREM CQ.Find \\\"B\\\"\\nREM QC.Forward 13\\nREM QC.Recall\\n\\nCLASS CircularQueue\\n\\titems[]\\n\\thead\\n\\ttail\\n\\there\\n\\t\\n\\tSUB INITIALIZE(dArray)\\n\\t\\thead = 0\\n\\t\\ttail = 0\\n\\t\\there = 0\\n\\t\\tFOR DIM i = LBOUND(dArray) TO UBOUND(dArray)\\n\\t\\t\\titems[tail] = dArray[i]\\n\\t\\t\\ttail = tail + 1\\n\\t\\tNEXT\\n\\tEND SUB\\n\\t\\n\\tSUB TERMINATE()\\n\\t\\tREM\\n\\tEND SUB\\n\\t\\n\\tMETHOD Put(s AS STRING)\\n\\t\\titems[tail] = s\\n\\t\\ttail = tail + 1\\n\\tEND METHOD\\n\\t\\n\\tMETHOD Find(s AS STRING)\\n\\t\\tFOR DIM i = head TO tail - 1\\n\\t\\t\\tIF items[i] = s THEN\\n\\t\\t\\t\\there = i\\n\\t\\t\\t\\tRETURN TRUE\\n\\t\\t\\tEND IF\\n\\t\\tNEXT\\n\\t\\tRETURN FALSE\\n\\tEND METHOD\\n\\t\\n\\tMETHOD Move(n AS INTEGER)\\n\\t\\tDIM bound AS INTEGER = UBOUND(items) + 1\\n\\t\\there = (here + n) MOD bound\\n\\tEND METHOD\\n\\t\\n\\tMETHOD Recall()\\n\\t\\tRETURN items[here]\\n\\tEND METHOD\\n\\t\\n\\tPROPERTY Size()\\n\\t\\tRETURN COUNT(items)\\n\\tEND PROPERTY\\nEND CLASS\\n\\nDIM CQ AS NEW CircularQueue({\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"D\\\", \\\"E\\\", \\\"F\\\", \\\"G\\\", \\\"H\\\", \\\"I\\\", \\\"J\\\", \\\"K\\\", \\\"L\\\", \\\"M\\\", \\\"N\\\", \\\"O\\\", \\\"P\\\", \\\"Q\\\", \\\"R\\\", \\\"S\\\", \\\"T\\\", \\\"U\\\", \\\"V\\\", \\\"W\\\", \\\"X\\\", \\\"Y\\\", \\\"Z\\\"})\\n\\nDIM c AS STRING\\nDIM isUppercase AS INTEGER\\nDIM s AS STRING = \\\"nowhere ABJURER\\\"\\n\\nFOR DIM i = 1 TO LEN(s)\\n\\tc = MID(s, i, 1)\\n\\tisUppercase = lstrcmp(LCASE(c), c)\\n\\tIF CQ.Find(UCASE(c)) THEN\\n\\t\\tCQ.Move(13)\\n\\t\\tPRINT IIF(isUppercase, UCASE(CQ.Recall()), LCASE(CQ.Recall())) ;\\n\\tELSE\\n\\t\\tPRINT c;\\n\\tEND IF\\nNEXT\\n\\nPAUSE\\n\",\n \"language\": \"FBSL\"\n },\n {\n \"code\": \"(fn rot13 [s]\\n (let [a :ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\n b :NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm]\\n (s:gsub :%a #(b:sub (a:find $)))))\\n\",\n \"language\": \"Fennel\"\n },\n {\n \"code\": \": r13 ( c -- o )\\n dup 32 or \\\\ tolower\\n dup [char] a [char] z 1+ within if\\n [char] m > if -13 else 13 then +\\n else drop then ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": ,chars ( end start -- )\\n do i c, loop ;\\n\\n: xlate create does> ( c -- c' ) + c@ ;\\n\\nxlate rot13\\n char A 0 ,chars\\n char Z 1+ char N ,chars\\n char N char A ,chars\\n char a char Z 1+ ,chars\\n char z 1+ char n ,chars\\n char n char a ,chars\\n 256 char z 1+ ,chars\\n\\n: rot13-string ( addr len -- )\\n over + swap do i c@ rot13 i c! loop ;\\n\\n: .rot13\\\" ( string -- )\\n [char] \\\" parse 2dup rot13-string type ;\\n\\n.rot13\\\" abjurer NOWHERE\\\" \\\\ nowhere ABJURER\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"program test_rot_13\\n\\n implicit none\\n integer, parameter :: len_max = 256\\n integer, parameter :: unit = 10\\n character (len_max) :: file\\n character (len_max) :: fmt\\n character (len_max) :: line\\n integer :: arg\\n integer :: arg_max\\n integer :: iostat\\n\\n write (fmt, '(a, i0, a)') '(a', len_max, ')'\\n arg_max = iargc ()\\n if (arg_max > 0) then\\n! Encode all files listed on the command line.\\n do arg = 1, arg_max\\n call getarg (arg, file)\\n open (unit, file = file, iostat = iostat)\\n if (iostat /= 0) cycle\\n do\\n read (unit, fmt = fmt, iostat = iostat) line\\n if (iostat /= 0) exit\\n write (*, '(a)') trim (rot_13 (line))\\n end do\\n close (unit)\\n end do\\n else\\n! Encode standard input.\\n do\\n read (*, fmt = fmt, iostat = iostat) line\\n if (iostat /= 0) exit\\n write (*, '(a)') trim (rot_13 (line))\\n end do\\n end if\\n\\ncontains\\n\\n function rot_13 (input) result (output)\\n\\n implicit none\\n character (len_max), intent (in) :: input\\n character (len_max) :: output\\n integer :: i\\n\\n output = input\\n do i = 1, len_trim (output)\\n select case (output (i : i))\\n case ('A' : 'M', 'a' : 'm')\\n output (i : i) = char (ichar (output (i : i)) + 13)\\n case ('N' : 'Z', 'n' : 'z')\\n output (i : i) = char (ichar (output (i : i)) - 13)\\n end select\\n end do\\n\\n end function rot_13\\n\\nend program test_rot_13\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"> cat foo.txt\\nfoo\\n> cat bar.txt\\nbar\\n> ./rot_13 foo.txt bar.txt\\nsbb\\none\\n> ./rot_13 < foo.txt\\nsbb\\n> cat foo.txt bar.txt | ./rot_13\\nsbb\\none\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\n' uses in place encoding/decoding\\nSub rot13(ByRef s As String)\\n If s = \\\"\\\" Then Exit Sub\\n Dim code As Integer\\n For i As Integer = 0 To Len(s) - 1\\n Select Case As Const s[i]\\n Case 65 To 90 '' A to Z\\n code = s[i] + 13\\n If code > 90 Then code -= 26\\n s[i] = code\\n Case 97 To 122 '' a to z\\n code = s[i] + 13\\n If code > 122 Then code -= 26\\n s[i] = code\\n End Select\\n Next\\nEnd Sub\\n\\nDim s As String = \\\"nowhere ABJURER\\\"\\nPrint \\\"Before encoding : \\\"; s\\nrot13(s)\\nPrint \\\"After encoding : \\\"; s\\nrot13(s)\\nPrint \\\"After decoding : \\\"; s\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"import io.{lines, stdin}\\n\\ndef rot13( s ) =\\n buf = StringBuilder()\\n\\n for c <- s\\n if isalpha( c )\\n n = ((ord(c) and 0x1F) - 1 + 13)%26 + 1\\n\\n buf.append( chr(n or (if isupper(c) then 64 else 96)) )\\n else\\n buf.append( c )\\n\\n buf.toString()\\n\\ndef rot13lines( ls ) =\\n for l <- ls\\n println( rot13(l) )\\n\\nif _name_ == '-main-'\\n if args.isEmpty()\\n rot13lines( stdin() )\\n else\\n for f <- args\\n rot13lines( lines(f) )\\n\",\n \"language\": \"FunL\"\n },\n {\n \"code\": \"rot13 := function(s)\\n local upper, lower, c, n, t;\\n upper := \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\n lower := \\\"abcdefghijklmnopqrstuvwxyz\\\";\\n t := [ ];\\n for c in s do\\n n := Position(upper, c);\\n if n <> fail then\\n Add(t, upper[((n+12) mod 26) + 1]);\\n else\\n n := Position(lower, c);\\n if n <> fail then\\n Add(t, lower[((n+12) mod 26) + 1]);\\n else\\n Add(t, c);\\n fi;\\n fi;\\n od;\\n return t;\\nend;\\n\\na := \\\"England expects that every man will do his duty\\\";\\n# \\\"England expects that every man will do his duty\\\"\\nb := rot13(a);\\n# \\\"Ratynaq rkcrpgf gung rirel zna jvyy qb uvf qhgl\\\"\\nc := rot13(b);\\n# \\\"England expects that every man will do his duty\\\"\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"/[a-mA-M]/=@int-char{@add{@char-int{$1};13}}\\n/[n-zN-Z]/=@int-char{@sub{@char-int{$1};13}}\\n\",\n \"language\": \"Gema\"\n },\n {\n \"code\": \"#define rot13\\nvar in, out, i, working;\\nin = argument0;\\nout = \\\"\\\";\\nfor (i = 1; i <= string_length(in); i += 1)\\n {\\n working = ord(string_char_at(in, i));\\n if ((working > 64) && (working < 91))\\n {\\n working += 13;\\n if (working > 90)\\n {\\n working -= 26;\\n }\\n }\\n else if ((working > 96) && (working < 123))\\n {\\n working += 13;\\n if (working > 122) working -= 26;\\n }\\n out += chr(working);\\n }\\nreturn out;\\n\",\n \"language\": \"GML\"\n },\n {\n \"code\": \"show_message(rot13(\\\"My dog has fleas!\\\"));\\n\",\n \"language\": \"GML\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"strings\\\"\\n)\\n\\nfunc rot13char(c rune) rune {\\n if c >= 'a' && c <= 'm' || c >= 'A' && c <= 'M' {\\n return c + 13\\n } else if c >= 'n' && c <= 'z' || c >= 'N' && c <= 'Z' {\\n return c - 13\\n }\\n return c\\n}\\n\\nfunc rot13(s string) string {\\n return strings.Map(rot13char, s)\\n}\\n\\nfunc main() {\\n fmt.Println(rot13(\\\"nowhere ABJURER\\\"))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"#!/usr/bin/env golosh\\n----\\nThis module encrypts strings by rotating each character by 13.\\n----\\nmodule Rot13\\n\\naugment java.lang.Character {\\n\\n function rot13 = |this| -> match {\\n when this >= 'a' and this <= 'z' then charValue((this - 'a' + 13) % 26 + 'a')\\n when this >= 'A' and this <= 'Z' then charValue((this - 'A' + 13) % 26 + 'A')\\n otherwise this\\n }\\n}\\n\\naugment java.lang.String {\\n\\n function rot13 = |this| -> vector[this: charAt(i): rot13() foreach i in [0..this: length()]]: join(\\\"\\\")\\n}\\n\\nfunction main = |args| {\\n\\n require('A': rot13() == 'N', \\\"A is not N\\\")\\n require(\\\"n\\\": rot13() == \\\"a\\\", \\\"n is not a\\\")\\n require(\\\"nowhere ABJURER\\\": rot13() == \\\"abjurer NOWHERE\\\", \\\"nowhere is not abjurer\\\")\\n\\n foreach string in args {\\n print(string: rot13())\\n print(\\\" \\\")\\n }\\n println(\\\"\\\")\\n}\\n\",\n \"language\": \"Golo\"\n },\n {\n \"code\": \"def rot13 = { String s ->\\n (s as List).collect { ch ->\\n switch (ch) {\\n case ('a'..'m') + ('A'..'M'):\\n return (((ch as char) + 13) as char)\\n case ('n'..'z') + ('N'..'Z'):\\n return (((ch as char) - 13) as char)\\n default:\\n return ch\\n }\\n }.inject (\\\"\\\") { string, ch -> string += ch}\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"println rot13(\\\"Noyr jnf V, 'rer V fnj Ryon.\\\")\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"10 INPUT \\\"Enter a string: \\\",A$\\n20 GOSUB 50\\n30 PRINT B$\\n40 END\\n50 FOR I=1 TO LEN(A$)\\n60 N=ASC(MID$(A$,I,1))\\n70 E=255\\n80 IF N>64 AND N<91 THEN E=90 ' uppercase\\n90 IF N>96 AND N<123 THEN E=122 ' lowercase\\n100 IF E<255 THEN N=N+13\\n110 IF N>E THEN N=N-26\\n120 B$=B$+CHR$(N)\\n130 NEXT\\n140 RETURN\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \"import Data.Char (chr, isAlpha, ord, toLower)\\nimport Data.Bool (bool)\\n\\nrot13 :: Char -> Char\\nrot13 c\\n | isAlpha c = chr $ bool (-) (+) ('m' >= toLower c) (ord c) 13\\n | otherwise = c\\n\\n-- Simple test\\nmain :: IO ()\\nmain = print $ rot13 <$> \\\"Abjurer nowhere\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Char (chr, isAlpha, ord, toLower)\\nimport Data.Bool (bool)\\n\\nrot13 :: Char -> Char\\nrot13 =\\n let rot = flip ((bool (-) (+) . ('m' >=) . toLower) <*> ord)\\n in (bool <*> chr . rot 13) <*> isAlpha\\n\\n-- Simple test\\nmain :: IO ()\\nmain = print $ rot13 <$> \\\"Abjurer nowhere\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import System.Environment\\nimport System.IO\\nimport System.Directory\\nimport Control.Monad\\n\\nhInteract :: (String -> String) -> Handle -> Handle -> IO ()\\nhInteract f hIn hOut =\\n hGetContents hIn >>= hPutStr hOut . f\\n\\nprocessByTemp :: (Handle -> Handle -> IO ()) -> String -> IO ()\\nprocessByTemp f name = do\\n hIn <- openFile name ReadMode\\n let tmp = name ++ \\\"$\\\"\\n hOut <- openFile tmp WriteMode\\n f hIn hOut\\n hClose hIn\\n hClose hOut\\n removeFile name\\n renameFile tmp name\\n\\nprocess :: (Handle -> Handle -> IO ()) -> [String] -> IO ()\\nprocess f [] = f stdin stdout\\nprocess f ns = mapM_ (processByTemp f) ns\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"main = do\\n names <- getArgs\\n process (hInteract (map rot13)) names\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"public static function rot13(input: String): String {\\n\\tvar buf = new StringBuf();\\n\\tfor (charInt in new haxe.iterators.StringIterator(input)) {\\n\\t\\tif (charInt >= 0x41 && charInt <= 0x4d || charInt >= 0x61 && charInt <= 0x6d)\\n\\t\\t\\tcharInt += 13;\\n\\t\\telse if (charInt >= 0x4e && charInt <= 0x5a || charInt >= 0x6e && charInt <= 0x7a)\\n\\t\\t\\tcharInt -= 13;\\n\\t\\tbuf.addChar(charInt);\\n\\t}\\n\\treturn buf.toString();\\n}\\n\",\n \"language\": \"Haxe\"\n },\n {\n \"code\": \"CHARACTER c, txt='abc? XYZ!', cod*100\\n\\n DO i = 1, LEN_TRIM(txt)\\n c = txt(i)\\n n = ICHAR(txt(i))\\n IF( (c >= 'a') * (c <= 'm') + (c >= 'A') * (c <= 'M') ) THEN\\n c = CHAR( ICHAR(c) + 13 )\\n ELSEIF( (c >= 'n') * (c <= 'z') + (c >= 'N') * (c <= 'Z') ) THEN\\n c = CHAR( ICHAR(c) - 13 )\\n ENDIF\\n\\n cod(i) = c\\n ENDDO\\n\\n WRITE(ClipBoard, Name) txt, cod ! txt=abc? XYZ!; cod=nop? KLM!;\\nEND\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"#!/usr/bin/env hy\\n(require hyrule [defmain])\\n\\n(setv lowers (lfor *x* (range 26)\\n (chr (+ *x* (ord \\\"a\\\"))))) ; generate latin lower 26 chars\\n(setv uppers (list (map str.upper lowers))) ; and the upper case\\n(setv lowers (list (map ord lowers))) ; convert to unicode codepoints\\n(setv uppers (list (map ord uppers)))\\n(setv translations ; a dictionary with from->to\\n (dict (zip ; codepoint mapping\\n (+ lowers uppers)\\n (+ (cut lowers 13 None)\\n (cut lowers 0 13)\\n (cut uppers 13 None)\\n (cut uppers 0 13)))))\\n\\n(defn rot13 [string]\\n (return (.translate string translations)))\\n\\n(defmain []\\n (import fileinput)\\n (for [*line* (fileinput.input)]\\n (print (rot13 *line*) :end \\\"\\\")))\\n\",\n \"language\": \"Hy\"\n },\n {\n \"code\": \"procedure main(arglist)\\n file := open(arglist[1],\\\"r\\\") | &input\\n every write(rot13(|read(file)))\\nend\\n\\nprocedure rot13(s) #: returns rot13(string)\\nstatic a,n\\ninitial {\\n a := &lcase || &ucase\\n (&lcase || &lcase) ? n := ( move(13), move(*&lcase) )\\n (&ucase || &ucase) ? n ||:= ( move(13), move(*&ucase) )\\n }\\nreturn map(s,a,n)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"(function ROT-13-char ch\\n (let x (char-code ch)\\n x- (or (< 109 x 123) (< 77 x 91)))\\n (if (or (< 96 x 123) (< 64 x 91))\\n (char-code ((x- - +) x 13))\\n ch))\\n\\n(function ROT-13 text\\n (.. str (map ROT-13-char text)))\\n\\n(ROT-13 \\\"The Quick Brown Fox Jumps Over The Lazy Dog!\\\")\\n;returns \\\"Gur Dhvpx Oebja Sbk Whzcf Bire Gur Ynml Qbt!\\\"\\n\",\n \"language\": \"Insitux\"\n },\n {\n \"code\": \"100 PROGRAM \\\"Rot13.bas\\\"\\n110 DO\\n120 LINE INPUT PROMPT \\\"Line: \\\":LINE$\\n130 PRINT ROT13$(LINE$)\\n140 LOOP UNTIL LINE$=\\\"\\\"\\n150 DEF ROT13$(TEXT$)\\n160 LET RESULT$=\\\"\\\"\\n170 FOR I=1 TO LEN(TEXT$)\\n180 LET CH$=TEXT$(I)\\n190 SELECT CASE CH$\\n200 CASE \\\"A\\\" TO \\\"M\\\",\\\"a\\\" TO \\\"m\\\"\\n210 LET CH$=CHR$(ORD(CH$)+13)\\n220 CASE \\\"N\\\" TO \\\"Z\\\",\\\"n\\\" TO \\\"z\\\"\\n230 LET CH$=CHR$(ORD(CH$)-13)\\n240 CASE ELSE\\n250 END SELECT\\n260 LET RESULT$=RESULT$&CH$\\n270 NEXT\\n280 LET ROT13$=RESULT$\\n290 END DEF\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \"rot13=: {&((65 97+/~i.2 13) |.@[} i.256)&.(a.&i.)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"fn rot_13(anon string: String) throws -> String {\\n mut builder = StringBuilder::create()\\n for code_point in string.code_points() {\\n builder.append(match code_point {\\n 'a'..'n' => code_point + 13\\n 'n'..('z' + 1) => code_point - 13\\n 'A'..'N' => code_point + 13\\n 'N'..('Z' + 1) => code_point - 13\\n else => code_point\\n })\\n }\\n return builder.to_string()\\n}\\n\\n\\nfn main() {\\n println(\\\"{}\\\", rot_13(\\\"The quick brown fox jumps over the lazy dog.\\\"))\\n}\\n\",\n \"language\": \"Jakt\"\n },\n {\n \"code\": \"import java.io.*;\\n\\npublic class Rot13 {\\n\\n public static void main(String[] args) throws IOException {\\n if (args.length >= 1) {\\n for (String file : args) {\\n try (InputStream in = new BufferedInputStream(new FileInputStream(file))) {\\n rot13(in, System.out);\\n }\\n }\\n } else {\\n rot13(System.in, System.out);\\n }\\n }\\n\\n private static void rot13(InputStream in, OutputStream out) throws IOException {\\n int ch;\\n while ((ch = in.read()) != -1) {\\n out.write(rot13((char) ch));\\n }\\n }\\n\\n private static char rot13(char ch) {\\n if (ch >= 'A' && ch <= 'Z') {\\n return (char) (((ch - 'A') + 13) % 26 + 'A');\\n }\\n if (ch >= 'a' && ch <= 'z') {\\n return (char) (((ch - 'a') + 13) % 26 + 'a');\\n }\\n return ch;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function rot13(c) {\\n return c.replace(/([a-m])|([n-z])/ig, function($0,$1,$2) {\\n return String.fromCharCode($1 ? $1.charCodeAt(0) + 13 : $2 ? $2.charCodeAt(0) - 13 : 0) || $0;\\n });\\n}\\nrot13(\\\"ABJURER nowhere\\\") // NOWHERE abjurer\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"function rot13(value){\\n if (!value)\\n return \\\"\\\";\\n\\n function singleChar(c) {\\n if (c.toUpperCase() < \\\"A\\\" || c.toUpperCase() > \\\"Z\\\")\\n return c;\\n\\n if (c.toUpperCase() <= \\\"M\\\")\\n return String.fromCharCode(c.charCodeAt(0) + 13);\\n\\n return String.fromCharCode(c.charCodeAt(0) - 13);\\n }\\n\\n return _.map(value.split(\\\"\\\"), singleChar).join(\\\"\\\");\\n}\\n\\ndescribe(\\\"Rot-13\\\", function() {\\n it(\\\"Given nothing will return nothing\\\", function() {\\n expect(rot13()).toBe(\\\"\\\");\\n });\\n\\n it(\\\"Given empty string will return empty string\\\", function() {\\n expect(rot13(\\\"\\\")).toBe(\\\"\\\");\\n });\\n\\n it(\\\"Given A will return N\\\", function() {\\n expect(rot13(\\\"A\\\")).toBe(\\\"N\\\");\\n });\\n\\n it(\\\"Given B will return O\\\", function() {\\n expect(rot13(\\\"B\\\")).toBe(\\\"O\\\");\\n });\\n\\n it(\\\"Given N will return A\\\", function() {\\n expect(rot13(\\\"N\\\")).toBe(\\\"A\\\");\\n });\\n\\n it(\\\"Given Z will return M\\\", function() {\\n expect(rot13(\\\"Z\\\")).toBe(\\\"M\\\");\\n });\\n\\n it(\\\"Given ZA will return MN\\\", function() {\\n expect(rot13(\\\"ZA\\\")).toBe(\\\"MN\\\");\\n });\\n\\n it(\\\"Given HELLO will return URYYB\\\", function() {\\n expect(rot13(\\\"HELLO\\\")).toBe(\\\"URYYB\\\");\\n });\\n\\n it(\\\"Given hello will return uryyb\\\", function() {\\n expect(rot13(\\\"hello\\\")).toBe(\\\"uryyb\\\");\\n });\\n\\n\\n it(\\\"Given hello1 will return uryyb1\\\", function() {\\n expect(rot13(\\\"hello1\\\")).toBe(\\\"uryyb1\\\");\\n });\\n});\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"#!/usr/bin/env jq -M -R -r -f\\n# or perhaps:\\n#!/usr/local/bin/jq -M -R -r -f\\n\\n# If your operating system does not allow more than one option\\n# to be specified on the command line,\\n# then consider using a version of jq that allows\\n# command-line options to be squished together (-MRrf),\\n# or see the following subsection.\\n\\ndef rot13:\\n explode\\n | map( if 65 <= . and . <= 90 then ((. - 52) % 26) + 65\\n elif 97 <= . and . <= 122 then (. - 84) % 26 + 97\\n else .\\n end)\\n | implode;\\n\\nrot13\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"#!/bin/bash\\n\\njq -M -R -r '\\n\\ndef rot13:\\n explode\\n | map( if 65 <= . and . <= 90 then ((. - 52) % 26) + 65\\n elif 97 <= . and . <= 122 then (. - 84) % 26 + 97\\n else .\\n end)\\n | implode;\\n\\nrot13'\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"#!/usr/local/bin/jsish\\n/* ROT-13 in Jsish */\\nfunction rot13(msg:string) {\\n return msg.replace(/([a-m])|([n-z])/ig, function(m,p1,p2,ofs,str) {\\n return String.fromCharCode(\\n p1 ? p1.charCodeAt(0) + 13 : p2 ? p2.charCodeAt(0) - 13 : 0) || m;\\n });\\n}\\nprovide('rot13', Util.verConvert(\\\"1.0\\\"));\\n\\n/* rot13 command line utility */\\nif (isMain()) {\\n /* Unit testing */\\n if (Interp.conf('unitTest') > 0) {\\n; rot13('ABJURER nowhere 123!');\\n; rot13(rot13('Same old same old'));\\n return;\\n }\\n\\n /* rot-13 of data lines from given filenames or stdin, to stdout */\\n function processFile(fname:string) {\\n var str;\\n if (fname == \\\"stdin\\\") fname = \\\"./stdin\\\";\\n if (fname == \\\"-\\\") fname = \\\"stdin\\\";\\n var fin = new Channel(fname, 'r');\\n while (str = fin.gets()) puts(rot13(str));\\n fin.close();\\n }\\n\\n if (console.args.length == 0) console.args.push('-');\\n for (var fn of console.args) {\\n try { processFile(fn); } catch(err) { puts(err, \\\"processing\\\", fn); }\\n }\\n}\\n\\n/*\\n=!EXPECTSTART!=\\nrot13('ABJURER nowhere 123!') ==> NOWHERE abjurer 123!\\nrot13(rot13('Same old same old')) ==> Same old same old\\n=!EXPECTEND!=\\n*/\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"# Julia 1.0\\nfunction rot13(c::Char)\\n shft = islowercase(c) ? 'a' : 'A'\\n isletter(c) ? c = shft + (c - shft + 13) % 26 : c\\nend\\n\\nrot13(str::AbstractString) = map(rot13, str)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"replace(\\\"nowhere ABJURER\\\", r\\\"[A-Za-z]\\\" => s -> map(c -> c + (uppercase(c) < 'N' ? 13 : -13), s))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \" rot13: {a:+65 97+\\\\:2 13#!26;_ci@[!256;a;:;|a]_ic x}\\n\\n rot13 \\\"Testing! 1 2 3\\\"\\n\\\"Grfgvat! 1 2 3\\\"\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"import java.io.*\\n\\nfun String.rot13() = map {\\n when {\\n it.isUpperCase() -> { val x = it + 13; if (x > 'Z') x - 26 else x }\\n it.isLowerCase() -> { val x = it + 13; if (x > 'z') x - 26 else x }\\n else -> it\\n } }.toCharArray()\\n\\nfun InputStreamReader.println() =\\n try { BufferedReader(this).forEachLine { println(it.rot13()) } }\\n catch (e: IOException) { e.printStackTrace() }\\n\\nfun main(args: Array<String>) {\\n if (args.any())\\n args.forEach { FileReader(it).println() }\\n else\\n InputStreamReader(System.`in`).println()\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"#!/bin/ksh\\n\\n# rot-13 function\\n\\n#\\t# Variables:\\n#\\ninteger ROT_NUM=13\\t\\t\\t# Generalize to any ROT\\n\\nstring1=\\\"A2p\\\"\\t\\t\\t\\t# Default \\\"test\\\"\\nstring=${1:-${string1}}\\t\\t# Allow command line input\\n\\ntypeset -a lcalph=( a b c d e f g h i j k l m n o p q r s t u v w x y z )\\ntypeset -a ucalph=( A B C D E F G H I J K L M N O P Q R S T U V W X Y Z )\\n\\n#\\t# Functions:\\n#\\n#\\t# Function _rotN(char) - return the \\\"rotated\\\" N letter to char\\n# Needs: $ROT_NUM defined\\n#\\nfunction _rotN {\\n\\ttypeset _char ; _char=\\\"$1\\\"\\n\\ttypeset _casechk _alpha _oldIFS _buff _indx\\n\\n\\t[[ ${_char} != @(\\\\w) || ${_char} == @(\\\\d) ]] && echo \\\"${_char}\\\" && return\\t# Non-alpha\\n\\n\\ttypeset -l _casechk=\\\"${_char}\\\"\\n\\t[[ ${_casechk} == \\\"${_char}\\\" ]] && nameref _aplha=lcalph || nameref _aplha=ucalph\\n\\n\\t_oldIFS=\\\"$IFS\\\" ; IFS='' ; _buff=\\\"${_aplha[*]}\\\" ; IFS=\\\"${oldIFS}\\\"\\n\\t_indx=${_buff%${_char}*}\\n\\techo ${_aplha[$(( (${#_indx}+ROT_NUM) % (ROT_NUM * 2) ))]}\\n\\ttypeset +n _aplha\\n\\treturn\\n}\\n\\n ######\\n# main #\\n ######\\n\\nfor ((i=0; i<${#string}; i++)); do\\n\\tbuff+=$(_rotN \\\"${string:${i}:1}\\\")\\ndone\\n\\nprint \\\"${string}\\\"\\nprint \\\"${buff}\\\"\\n\",\n \"language\": \"Ksh\"\n },\n {\n \"code\": \"abcdefghijklomnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXZ.\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"{def rot13\\n\\n {def rot13.alphabet {A.split\\n abcdefghijklomnopqrstuvwxyz0123456789ABCDEFGHIJKLMNOPQRSTUVWXZ_.}}\\n\\n {def rot13.delta\\n {lambda {:i :a}\\n {A.get {% {+ {A.in? {A.get :i :a} {rot13.alphabet}}\\n 32} 64} {rot13.alphabet}}}}\\n {def rot13.r\\n {lambda {:a :b :n :i}\\n {if {> :i :n}\\n then :b\\n else {rot13.r :a\\n {A.set! :i {rot13.delta :i :a} :b}\\n :n {+ :i 1}} }}}\\n\\n {lambda {:txt}\\n {let { {:t {S.replace \\\\s by _ in :txt}} }\\n {S.replace _ by space in\\n {A.join {rot13.r {A.split :t}\\n {A.new}\\n {- {W.length :t} 1}\\n 0 }}}}}}\\n-> rot13\\n\\n1) encoding:\\n\\n{rot13 abcdefghijklomnopqrstuvwxyz\\n 0123456789\\n ABCDEFGHIJKLMNOPQRSTUVWXZ.}\\n-> 56789ABCDEFGKIJKLMNOPQRSTUV3WXZ .abcde3fghijklomnopqrstuvwxyz0124\\n\\n2) decoding:\\n\\n{rot13 56789ABCDEFGKIJKLMNOPQRSTUV3WXZ .abcde3fghijklomnopqrstuvwxyz0124}\\n-> abcdefghijklomnopqrstuvwxyz 0123456789 ABCDEFGKIJKLMNOPQRSTUVWXZ.\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"// Extend the string type\\n\\ndefine string->rot13 => {\\n local(\\n rot13 = bytes,\\n i, a, b\\n )\\n\\n with char in .eachCharacter\\n let int = #char->integer\\n do {\\n // We only modify these ranges, set range if we should modify\\n #int >= 65 and #int < 91 ? local(a=65,b=91) |\\n #int >= 97 and #int < 123 ? local(a=97,b=123) | local(a=0,b=0)\\n\\n if(#a && #b) => {\\n #i = (#int+13) % #b // loop back if past ceiling (#b)\\n #i += #a * (1 - #i / #a) // offset if below floor (#a)\\n #rot13->import8bits(#i) // import the new character\\n else\\n #rot13->append(#char) // just append the character\\n }\\n }\\n\\n return #rot13->asstring\\n}\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"define rot13(p::string) => {\\n local(\\n rot13 = bytes,\\n a = bytes('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'),\\n b = bytes('NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm'),\\n i\\n )\\n\\n with char in #p->eachCharacter\\n let c = bytes(#char) do {\\n #i = #a->find(#b)\\n #i ? #rot13->import8bits(#b->get(#i)) | #rot13->append(#c)\\n }\\n\\n return #rot13->asString\\n}\\n\\nrot13('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz')\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"input \\\"Type some text to be encoded, then ENTER. \\\";tx$\\n\\ntex$ = Rot13$(tx$)\\nprint tex$\\n'check\\nprint Rot13$(tex$)\\n\\nwait\\n\\nFunction Rot13$(t$)\\n if t$=\\\"\\\" then\\n Rot13$=\\\"\\\"\\n exit function\\n end if\\n for i = 1 to len(t$)\\n c$=mid$(t$,i,1)\\n ch$=c$\\n if (asc(c$)>=asc(\\\"A\\\")) and (asc(c$)<=asc(\\\"Z\\\")) then\\n ch$=chr$(asc(c$)+13)\\n if (asc(ch$)>asc(\\\"Z\\\")) then ch$=chr$(asc(ch$)-26)\\n end if\\n if (asc(c$)>=asc(\\\"a\\\")) and (asc(c$)<=asc(\\\"z\\\")) then\\n ch$=chr$(asc(c$)+13)\\n if (asc(ch$)>asc(\\\"z\\\")) then ch$=chr$(asc(ch$)-26)\\n end if\\n rot$=rot$+ch$\\n next\\n Rot13$=rot$\\n end function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"Function Rot13$(t$)\\n for i = 1 to len(t$)\\n ch$=mid$(t$,i,1)\\n if (asc(ch$)>=asc(\\\"A\\\")) and (asc(ch$)<=asc(\\\"Z\\\")) then\\n ch$=chr$(asc(\\\"A\\\")+ (asc(ch$)-asc(\\\"A\\\")+13) mod 26)\\n end if\\n if (asc(ch$)>=asc(\\\"a\\\")) and (asc(ch$)<=asc(\\\"z\\\")) then\\n ch$=chr$(asc(\\\"a\\\")+ (asc(ch$)-asc(\\\"a\\\")+13) mod 26)\\n end if\\n Rot13$=Rot13$+ch$\\n next\\n end function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"implement Rot13;\\n\\ninclude \\\"sys.m\\\"; sys: Sys;\\ninclude \\\"draw.m\\\";\\n\\nRot13: module\\n{\\n\\tinit:\\tfn(ctxt: ref Draw->Context, argv: list of string);\\n};\\n\\nstdout: ref Sys->FD;\\ntab: array of int;\\n\\ninit(nil: ref Draw->Context, args: list of string)\\n{\\n\\tsys = load Sys Sys->PATH;\\n\\tstdout = sys->fildes(1);\\n\\tinittab();\\n\\targs = tl args;\\n\\tif(args == nil)\\n\\t\\targs = \\\"-\\\" :: nil;\\n\\tfor(; args != nil; args = tl args){\\n\\t\\tfile := hd args;\\n\\t\\tif(file != \\\"-\\\"){\\n\\t\\t\\tfd := sys->open(file, Sys->OREAD);\\n\\t\\t\\tif(fd == nil){\\n\\t\\t\\t\\tsys->fprint(sys->fildes(2), \\\"rot13: cannot open %s: %r\\\\n\\\", file);\\n\\t\\t\\t\\traise \\\"fail:bad open\\\";\\n\\t\\t\\t}\\n\\t\\t\\trot13cat(fd, file);\\n\\t\\t}else\\n\\t\\t\\trot13cat(sys->fildes(0), \\\"<stdin>\\\");\\n\\t}\\n}\\n\\ninittab()\\n{\\n\\ttab = array[256] of int;\\n\\tfor(i := 0; i < 256; i++)\\n\\t\\ttab[i] = i;\\n\\n\\tfor(i = 'a'; i <= 'z'; i++)\\n\\t\\ttab[i] = (((i - 'a') + 13) % 26) + 'a';\\n\\tfor(i = 'A'; i <= 'Z'; i++)\\n\\t\\ttab[i] = (((i - 'A') + 13) % 26) + 'A';\\n}\\n\\n\\nrot13(s: string): string\\n{\\n\\tfor(i := 0; i < len s; i++) {\\n\\t\\tif(s[i] < 256)\\n\\t\\t\\ts[i] = tab[s[i]];\\n\\t}\\n\\treturn s;\\n}\\n\\nrot13cat(fd: ref Sys->FD, file: string)\\n{\\n\\tbuf := array[Sys->ATOMICIO] of byte;\\n\\n\\twhile((n := sys->read(fd, buf, len buf)) > 0) {\\n\\t\\tobuf := array of byte (rot13(string buf));\\n\\t\\tif(sys->write(stdout, obuf, n) < n) {\\n\\t\\t\\tsys->fprint(sys->fildes(2), \\\"rot13: write error: %r\\\\n\\\");\\n\\t\\t\\traise \\\"fail:write error\\\";\\n\\t\\t}\\n\\t}\\n\\tif(n < 0) {\\n\\t\\tsys->fprint(sys->fildes(2), \\\"rot13: error reading %s: %r\\\\n\\\", file);\\n\\t\\traise \\\"fail:read error\\\";\\n\\t}\\n}\\n\",\n \"language\": \"Limbo\"\n },\n {\n \"code\": \"function rot13 S\\n repeat with i = 1 to length(S)\\n get chartonum(char i of S)\\n if it < 65 or it > 122 or (it > 90 and it < 97) then next repeat\\n put char it - 64 of \\\"NOPQRSTUVWXYZABCDEFGHIJKLM nopqrstuvwxyzabcdefghijklm\\\" into char i of S\\n end repeat\\n return S\\nend rot13\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"10 INPUT \\\"Enter a string: \\\",a$\\n20 GOSUB 50\\n30 PRINT b$\\n40 END\\n50 FOR i=1 TO LEN(a$)\\n60 n=ASC(MID$(a$,i,1))\\n70 e=255\\n80 IF n>64 AND n<91 THEN e=90 ' uppercase\\n90 IF n>96 AND n<123 THEN e=122 ' lowercase\\n100 IF e<255 THEN n=n+13\\n110 IF n>e THEN n=n-26\\n120 b$=b$+CHR$(n)\\n130 NEXT\\n140 RETURN\\n\",\n \"language\": \"Locomotive-Basic\"\n },\n {\n \"code\": \"to rot13 :c\\n make \\\"a difference ascii lowercase :c ascii \\\"a\\n if or :a < 0 :a > 25 [output :c]\\n make \\\"delta ifelse :a < 13 [13] [-13]\\n output char sum :delta ascii :c\\nend\\n\\nprint map \\\"rot13 \\\"|abjurer NOWHERE|\\nnowhere ABJURER\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"function rot13(s)\\n\\tlocal a = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\"\\n\\tlocal b = \\\"NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm\\\"\\n\\treturn (s:gsub(\\\"%a\\\", function(c) return b:sub(a:find(c)) end))\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"function rot13(s)\\n return (s:gsub(\\\"%a\\\", function(c) c=c:byte() return string.char(c+(c%32<14 and 13 or -13)) end))\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"CLS\\nINPUT \\\"Enter a string: \\\", s$\\nans$ = \\\"\\\"\\nFOR a = 1 TO LEN(s$)\\n letter$ = MID$(s$, a, 1)\\n IF letter$ >= \\\"A\\\" AND letter$ <= \\\"Z\\\" THEN\\n char$ = CHR$(ASC(letter$) + 13)\\n IF char$ > \\\"Z\\\" THEN char$ = CHR$(ASC(char$) - 26)\\n ELSE.IF letter$ >= \\\"a\\\" AND letter$ <= \\\"z\\\" THEN\\n char$ = CHR$(ASC(letter$) + 13)\\n IF char$ > \\\"z\\\" THEN char$ = CHR$(ASC(char$) - 26)\\n ELSE\\n char$ = letter$\\n END IF\\n ans$ = ans$ + char$\\nNEXT a\\nPRINT ans$\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"b'BA@?>=<;:9876543210/.-,+*)('&%$#\\\"!Q=+^:('&Y$#m!1So.QOO=v('98$65a`_^]\\\\[ZYXWVUTSRQ#I2MLKJIHGFE\\nDCBA@#!7~|4{y1xv.us+rp(om%lj\\\"ig}fd\\\"cx``uz]rwvYnslkTonPfOjiKgJeG]\\\\EC_X]@[Z<R;VU7S6QP2N1LK-I,GF(\\nD'BA#?>7~;:9y16w43s10)p-,l*#(i&%e#d!~``{tyxZpuXsrTTongOkdMhg`Hd]ba`_^W@[ZYXW9UNSRQPOHMLKJ-++FE\\n''<A$?>=<;:387xw43s10/(-&m*)('&}${d!~}|^zyxwvutmVqpiRQlkjiKafedc\\\\E`_^@\\\\[ZYX;V9NMRQ42NGLK.IH*F?\\nDCBA$#>7~;{{8xx5uu2rr/oo,ll)ii&f|e\\\"!aw`{z\\\\r[vXnmVTpongPkNihgJ_dcFa`B^]\\\\UZ=RWV8TSLQ4ON0LE.IHA)E\\n>'BA:?!7~5|38y6/v321q).-&m*)i'&%|{d!~}_{zs\\\\wvutsUqTonPlOjiKgJedFbE`_A]@[Z<X;VU7S6QP22GL/JIB+FE\\nDC%;@?>7~;:987w5v32r0)p-,+k)('~g$#\\\"b~w|uz]xwvutsrqTinQlOjLhgfeH]bE`CB]\\\\>ZSXWVUTSRQPON1LE.I,+*(\\n(&&$$\\\"\\\"~~||zzxxv4u210/(-n+l)ji~g|eccaa_{zy[qZoXVVTponPfOdiLJJ_HFba`BXAV?==;;9977pQPONMLKJIHGFE\\nDCBA@?>=<;:9876543210/.-,+*)('&%$#\\\"!~}|{zyxwvutsrqponmlkjihgfedcF!`_^]\\\\[ZYXWVUTSRQPONMLKJIHGFE\\nDCBA@?>=<;:9876543210/.-JI*)FE&%$#\\\"!~}|{zyxwvutsrqponmlkjihgJ%dcF!`_^]\\\\[ZYXWVUTSRQPO2kLKJIHGF)\\nbCBA@?>=<;:9876543210/.-JI*)FE3%$#\\\"!~}|{zyxwvutsrqponmlkjihgJ%dcF!`_B{\\\\[>wXWVUTSRQPO2kLKJIHGF)\\nbCBA@?>=<;:9876543210/.-JI*)FE&%$#\\\"!~}|{zyxwvutsrqponmlkjihgJ%dcF!`_B{\\\\[ZYX;VUTS6Q4O200EJIH*@)\\n>'%A@?!7~5|zzx65u3,s*qoommk)(h&}f{dbb``^^\\\\xwYutWVkToRmlkjMLgfHdcF[DBB@\\\\?==RWV8TM6K4220LK-IB+@E\\n(&&;$\\\"\\\"~~||zzxxv4u21r/.o,mlk\\\"i&g$#\\\"!b}`{^\\\\\\\\qvYWWlUSSQQOkjiKaJ_HFFD`_A]V?T=;;997SRQ3I2G0.JIH*@)\\n>'%A@\\\">=~}4{8y6wv3trr).omm$)j'&g$#d!ba`u^y\\\\wZYtWrqTonmOOdihK`IHG\\\\a`_AW@U><XWV8N7LQ422G0.JI+G@)\\n>C&$$9\\\"~~||z87w5.u,sqqoommkki'h%$e\\\"yb}`_t][wvXtmVkpSQQfOMihgI_H]FD`_A]V?T=;;99775QPO1G0E.,HG)E\\n>'<A$\\\"\\\"7~||z8y654u,s0qp',m*)ii&}$e\\\"cb``^z][[putVrkTiRPPNjMKK`edFb[DYB@\\\\?==RWVU7M6K42200..,,*F)\\nDCB%@9>!~;|zz165u32s*qoommkki'&f${dy~a__t][[YutVrkTinQOOdMKKIIGGEaD_^A\\\\?ZYR;:U8SR533NMLEJ-,G*(\\n(=B%##8=<|:3z1xvvttr0/o-&m$)jhh}fd\\\"!~`v_t][wvXtmVkpSQQfOMMKKIIGGEaD_^A\\\\?ZYXQV9T7R5PO11LKJIB+F)\\nD'%%:#!!};:z81x/vttrrppnnlljjhhf$e\\\"!~a|{zyr[vYXmrqpRnQfkjiKaJ_HFFDDBB@@>><<::88664P3NMLE.I,+@)\\n'CBA#9\\\"7<}{{2ywwuussqqoommkkiig%f#\\\"!xa`{^yx[YYnsVUpSQQfOMMKgfHd]F[`CAAV?=YX:VO8M6442200..,,**(\\nD'BA$?\\\"7<}:{z16w43ss0)p-n+*j('h}fddb~a__tyxZvoXmVTpoQmfOdMKKIIGGEECCAA?[>YXW:UN76Q4ON1//JIBG*)\\nDC%A@#8!}}{{yyw5vtt+0/o-&m$kiiggeeccaa_{^\\\\\\\\qvYtsVqTonglOjMLafIdcEE`_^W@[>=;W:88MRQ3OH1F/-IH*F?\\n(=&$@?>~6}4{yywwu32r0)p',mkk\\\"iggeecca}`{zy\\\\wvunWrUpSnmOOjihg`eHcFaDBBW@U><<:V977LQP2NG0E.,,**(\\nDC%A:#8!}}{{yywwu3t10/p-,+*#(ih%fddybw|{z\\\\r[puXVVkTRRPPNNLhgIe^G\\\\ECCAA??==;;9U8SR5PI21L/JI,**?\\n('&;$9\\\"~~|:{yy054t2+r)pnnl*kii~%$d\\\"ybw`^^\\\\xwYunWlqTRRgPNNLLJJHdGbaD_BW@[>=R;PU8SR44OHM0K.-+G*(\\n(=BA#?8!6}{98x6/v-trrppnnlljjhhffd\\\"c~}|_zsx[vYtWrqSSnmfOjMhgIedG\\\\a`B^W@U><<::8TS5QJ3H1//-I,**?\\nDC%A:#8!}}{{yywwu3t10/p-,%l)ji~%$#c!bw|_zyx[vutmrUpSnQlkMMhgfe^GbEDYBW\\\\[=YR;P9775QP2NG0EJ-++@)\\n'CB$@9\\\"7<}{{2ywwuussqqoommk)j'&%f#\\\"!~w`{^y\\\\wvutsUUjonQfOjMLaJ_HFFDDB^]?[T=RW:88M64PO1MF/DI,**?\\n(&BA#?8!6}{{yywwuus1r/.-&ml)j'&geez!ba|_]]rwZXXmrqSohQfkNLLaJHHFFDDBB@@>><<::886R5PO2M0EJ-,G*E\\nD'%%@9\\\"!~5|3zxxv4uss*/.n,%l#jh&geez!~`|u^s\\\\ZZXXVVTTRRPPNjMKK`eHcbE`C^W@?Z=XW:88SRKP32M0..CHG)E\\n>'<%#?>~<5|38yww.ussq/.n,%l#(igg|eccaa__]][[YYWsVqpSnQlkdiLgJeHcbDD_^]V?Z=X;99NS644I2GL/--BG*E\\nDC&A@?8!~}49z76wuu210/(-nm*)i'&g|eccaa_{z\\\\xqZoXVVTTRRPPNNLLJfIdcFaD_^]\\\\UZ=X;:O8MRQP2H1F/-IH*F?\\n(=B%##8!}}{{yywwuussqqoom+l)('~g$e\\\"caav{^yxwpYtWVkpSnmOOdMhKfIGG\\\\EZ_B@@UZ=XWV9N765JO2ML/--HAF)\\n(C&$$9\\\"7~||zzx6wuu,10p.'n%lj('g%|ez!b``u^\\\\\\\\ZvuWslUjoRPPeNLLJJHHFbE`_B]@[TY<W:U8SR44ONG0K.IH*FE\\n(=&$@#!!6;:z81x/vttrrppnnlljjhhffd\\\"c~}|_zyr[ZYnsVqpSQQlkjchKJedFbaDY^A??TYX:VO8M6442200..,,*FE\\n'C<%:#!!}}{{y7x54u2s0/.',m*k(i&%ee\\\"!~}v_z]x[YYnWUqpRngPeNLhgIe^G\\\\aDBBW@>ZY;WP9N7553ON0LE.C,**(\\n(&&$$\\\">!<;:{8765.u2sr).-,l*k\\\"'&%e{dy~a__t][wvuWmVkTRRPPNNLLJJHHFFDDB^A\\\\[ZS<;V9TS644IN10K.,,AF)\\n''<A@\\\">7~5:{yy0wuussqqoommkkiiggeec!b}|_z]rwZYtWrqTRRmfONMbK`edFb[DYB@\\\\[=YR;PU866K42NM/KD-BG*(\\n(=&$$\\\"\\\"~~||zzxxvvt2s0/p-n+$k(i&geezcx}`{zy\\\\wvotWVqTonQOOjihaJIdGEEZ_^@\\\\[>SX;99NS6QP3N1LKJC,G*E\\nDC%A$9\\\"~~||zzxxvvttr0/.n&m$)jhh}fd\\\"!~`v_ty\\\\ZZoXVrqpRhQfOMiLgfeHcba`Y^A@?T=R;PU8SR5PI210EJIH*@)\\n>C&$$9\\\"~~||zzxxvvttrrppnnl*k('h%|ed!~}_{^s\\\\qZXtWUUjonPleNcLJJHHFbaC_XAV[><<Q:8TS5QJ3H1//--++))\\n'C&A@#>!6}:{z16w43ss0).o,ml#(igg|#\\\"!aw`u^\\\\\\\\ZZXtsrTjShQOkjiKaJ_HFba`BXAV?==;;99775Q4ONM0KDI,G*E\\n(&&;$9>!}}4987w/v-trrppn,+k)\\\"i~%fddyb``^zy[wpYnWUUSSQQOOMiLgfeHcb[D_B]\\\\[=Y<Q:8866442NML.D-B+))\\n'CB$@9\\\"7<}{{2ywwuussq/p-,+l)('~%f#dcx}`{z\\\\\\\\wvutmVqTonPleNchKII^GEEC_B@@UZY;WP9N75QPO1G0E.,,**(\\nDCB$:#8=~||3zxxvvttr0q.-,m*)('~g$edybw`^zyxZpYnWUqpoQgPeNLLJJHdcEaZCXA??==;;997S6QPOH1L/J-HG))\\n>C&A$?>~<;|3zx6wuu,10p.'n%ljjh&geez!~`|u^s\\\\ZZXXVVTTRRPPNjMKK`eHcbaDY^A\\\\?>SX;VU77RK4O21//-I,**?\\nDC%A:#8!}}{9zxx/43s1*q(ommk)(h&}f{\\\"caav_]][[YYWsVqpoRmfONMbK`eHcbECC^]V[>=XW9UN7L53311/KJ,HA*?\\nD'%%:#!!}}{{yywwuus1r/.o,m*)\\\"'h%fez!~}_{^sxwvXnWlqTRRgPNjihJ`I^cFDDYB@@>><XWV8N7L53311//--++)E\\n(CBA$?>=6}|{27x54uss0/.-&+lk('g%|ez!b``u^\\\\\\\\ZZXtsrTjShQOkjLhaJ_HFFDDBB@@>><X;VU8S6QPONGL/.I,GF)\\nDCB$$9>=~5|{z1x/4uss*/.n,%l#jhhffddb~}_{t]rwZXXmVTpoQmfOdMKKIIGGEEC_B]\\\\?ZS<;V9TS644I210E.C,*F)\\n''<A@\\\">7~5|z87w5.u,1rpp'nllj(igg|#\\\"b~w`u^\\\\\\\\ZvuWslUjoRPPeNLLJJHHFbE`_B]@U>Y<W:UT66QJO2M0K.,,AF)\\n''<%#?\\\"~~5:9y70w.ussq/.-m%l#(igg|eccaa__]][[YYWsVqpoRmfkNiLgJedFFa`YB]@[Z<XW:OTS5QJ3HM0..C,**(\\nD'%%:?>~<5|3zxxvvt21q/(o&mkkiiggeec!b}|{^yxqZuXsVqpRRmlkdiLgJedFbaDYB@@>ZY;WP9NS644I200..,H+))\\n>CB$@9\\\"7~||zzxxvvt2s0/.o,+*#(ih%fddy~}|^z]rwvXtmVkpSQQfOMMKgfeG]F[DBB@@>><<::88664P3NM0K.IHGF?\\n(C&A$?>=<;{{276w.u2s0/o-,m$)jhh}$#c!xav_]][[YYWWUqTRRglkMibK`IGGEECCAA?[>YXWP9T7R5PO11FK.I,+@E\\n(&&;@?!=6}49zxx/vttr0/.n&m$kiiggeeccaa__]][wZutsVkpSRQfkjLhaJ_dGEEZCAA?[Z<XQ:O866442200..,,**(\\nD'BA$?\\\"=6}|9zxx/4u21rpp-,%*kji~ge#\\\"!aw`u^\\\\\\\\ZvutVlUjSQQOkjiKaJ_HFFDDBB@@>Z=XW:U8SRKP32M0KJ-++FE\\nD=&%$9\\\"7<}{{276v4-t+rppn,mkk\\\"'&f${dyb`|{]yr[pYWWUUSSQQOOMMKgJedGbE`_^W@?Z=XW:88SRQPIN10/D-B+)E\\n(&&;@?!=6}4{y7xvv-21q/(o&mkki'hff{\\\"!a}v_t][[YYWWUUSSQmPNNchKfeHcFa`_^W\\\\?Z=X;VUTSR44INM0E.I,G*(\\n(=B%##8!};:9y1x/vttr0/.n&m$kiiggeeccaa__]y\\\\wvunWVqTonQOOdMLgJHH]baC_XAV?==;;997S644INM/KD-B+))\\n''%%##!!};|98y6w.uts*/pnn%l#(i&%f#d!x}`_z]xwZXXsrkTSnQOOdMKgfHd]F[`CAAV?=YX:VO8MR533H1//--++))\\n''%%##!=~;:{8y65.ut1r/.omm*)(!&gfez!b``uz][[putVrkTiRPPNNLLJfIGG\\\\a`B^W@U><<:VU7SL5JO200E.,,**(\\n(&B%@?\\\"=~;:927x5v3t10pp-,+*#j'h%fddy~a__ty\\\\wvuXsrqpiRmPkNLLafeGcbEZCX]\\\\[=S<Q:8TSR4J3H1/KJ,HA*?\\n(&&$$\\\"\\\"~~||zzxxv4u210)po,m*)jhh}$edcxav_]][[YutVrkTiRPPNNLLJJHHFFD`C^]@[>SX;V9T7RQ33NG0K.I,**?\\n(=&$@?>~6}4{y76v4-t+0qoo&mkkiiggeeccaa__]y\\\\wvuXslUTShmPkjMKKfe^cFE`_A]V?T=;;9UT6RK4I20LKJ,B+@)\\n''%%##!!}}{{y7x54u2s0/(-nml#('&f|ezcaa_{zy[qZoXVVTTRRPPNNLLJJHdGbaD_B]\\\\[T=X;V9TS55PONMFK.I,G*(\\n(=BA#?>!6;|zz16w432s0/.-&+l)j'h%$#\\\"!aav{z]r[vYXmVTponPfOdMKKIeHFF[`_A]V?T=;;9UT6RK4I200..,,**(\\nD'BA@9\\\"!~5|38y65vtt+rq.-,l$k\\\"igge#\\\"b~w`uz][[pYWWUUSSQQOOMMKKIeHcbE`CXA\\\\?Z=XW99TMR5P3N1//DI,**?\\nDC%A:#8!}}{{yyw54t2+r)pn,+*j\\\"i~%fddyb``^^\\\\\\\\ZZXtWrqpSnglOjMLaJ_dcbDZCX]@>>S<:VUT6L5J311//--++))\\n'CBA#9\\\"7<}{{2yw543s+r).omm$ki'&%e{dyb`|_zyx[vunWrUpSnmOOjihafIdGbECCXAV?==;;9U866KPO1MF/D-++)E\\nD&B;$9\\\"~~||zzxxv4u210q.-,%*kj'h%$ecc~}|{t]\\\\wvXtsVkpSnmPkNihgf_HcFaD_^]\\\\[==RWV9N7R5P311FK.,,AF)\\nDCB;$#\\\"7<}{{2y0wuussq/.n,%l#(igg|eccaa_{z\\\\xqZotWUUjSQQOOMMKgJedGbEZ_B]@[>YX::UN7R54I20LKJ,B+@)\\n''%A@?!7~5|zzxxvvttrrppn,m*)(i&}fedy~a|{^\\\\\\\\wvotWVqpRnmPeNLLJfeGc\\\\EZ_B@@U><<::8T755JON0LE.C,*F)\\n''<A@\\\">7~5|zzxxvvt2s0/p-n+*#(i&gf{dbb``^zy[wpYnsVTTiRPPNNLhgIe^G\\\\aDBBW@>><<::8T7RQP3NMLE.-,A*?\\nD'BA$?\\\"=<;:38y6w4u210/.nn%*)j!h%f#dbbw|{]yr[puXVVkTRRPPNNLLJJHdcbDZCX]@>>S<::88664P3NMLE.-,AF)\\nDC&$$9\\\"!<;{92y05vtt+rppnnlljjh&%$dzcx}`^^s\\\\ZZXXVVTTRnQlkNiLaJeHG\\\\a`_A]@UZ=XWV9TMR54O2ML/--HG@)\\n(C&$$9>=};:{2ywwuus10p.'n%ljjhhffddbb``^z]xwZuXsrkToRmPkjLLgfe^cFaDCXAV?=YX:VO8MR533H1//--+GF(\\nD=&;$\\\"\\\"~~||zzxxv4u210q.-,%*k(i&g$#cc~}|{t]x[vuWsrUjSQQOkNLLafeGc\\\\EZCAA??==;W:88MRQ3OH1F/--++))\\n'C&$$9>!<;:{8765.u2sr)p'nlljjhhffddb~}_{t]r[YYWWUUSoRmlkdMhKJ_dcbDZCX]@>>S<::8866442200..,,**(\\nD'BA@9\\\"=~}4{27x54tt+0q.onlljjhhf$#c!xav_]][[YYWWUUSoRmlkNchKJeHcbECC^W@?Z=;;PUT6RK4I200..,,**(\\n(&&$$\\\"\\\"~~|:{87x5v3,s0q.o,+kk('~%f#d!b``uz][[pYnsVTTinQlkjMhg`eHGF[`C^]@>>YXWP98SR4PO2G0..,,*FE\\n'C<%:#!!}}{{yywwuus1r/.o,m*)(!h%f#d!~``{zyxqvYtWVkTinQOOdihJf_H]FD`CAAV[Z<XQ:O8664PO1MF/D-++))\\n''%%##!!};|987x5432+0q.o,mkk\\\"'&f$#dybw|_zyxqZuXWlqTonmfOjMhKfeGG\\\\E`C^A??T=R;997S644INM/KD-B+)E\\nD&B;$9\\\"~~||zzxxvvttr0q.-,m$kji~%f#\\\"caa|uz]\\\\wZXXmrqSonQfOMihJf_H]FDDBB@\\\\[=YR;PU866K4220LK-IB+@E\\n(&&;$\\\"\\\"~~||z8y65v3t1*/p-n+l)(hh%${d!bav{^\\\\\\\\qZXtWUUjonPleNcLJJHdcbDZCXA??==;;9977553O2MLK.IHA*)\\nD'BA$\\\"\\\"=<;49zyx/v-trrppnnl*)i'~g|eccaa__]][[YuXsrUpSnmlejMLgJedGEE`_^]V?>YX:VU8MRQ3OH1FK.,,A*(\\nD'%%:?>~<5|3zx6wuu,10p.'n%ljjhhffd\\\"caav{z\\\\xqZoXVVTTRRPlOMMbgJedGbE`_^]V?Z=X;VUTSR44INM0E.I,+@E\\n(&&;@?>~6}4{y765u-t+rppnnllj('g%|ezcaa__]][[YuXsrqjSRmPkjMKK`eHGbECCXAV?==;W:88MRQ3OH1F/-I,**?\\nDC%A:#8!};:9y1x/vttrrppnnllj(i&%f#dy~a`{zy[wZoXmVTTRRPlkMibK`eHFF[DBB@\\\\[=YR;PU866K42NM/KD-BG*(\\n(=&$$\\\"\\\"~~|:{87x5v3,sr/p-,mkk('~%fedybw`^zy[wpYnsVTTiRPPNNLLJfeGc\\\\EZCAA??==;;9U8SR5P3NMFK.I,+@E\\n(CB$$?>=6}:{zxxv432r*q(ommkki'&%e{dy~a__t][[YYWWUUSoRmlkNihg`IdGbE`_AA\\\\[ZYRW:U87LQ422G0.JIH*@)\\n>'%%##!!}}{{yywwuus1r/.-n+*)(!&gf#d!~a|{z\\\\\\\\qvuXmVUpSQQfOMihgI_H]bECCXA??=YX:VO8M6442200..,,**(\\nD'BA$?8!~}49z76wuu,sr/pnn%l#(igg|#d!~a|_t]x[ZotWrqSSnglOjMhgIedG\\\\ECCA]@>>SXW9UN7L53311//--++))\\n''%A$\\\"\\\"7<}:98y6/4uts*q(o&+l)(igg$#zcb}`^^sxwYunWlUSSQQOOMiLJJ_dcEaZCXA??=YX:VO8MR533H1//--++)E\\n(CB%@#>=6}:{8y65uu210).o,m*kii~%fddy~}_{t]r[YYWWUUSSQmlNjcLaJHHFFDDBB@\\\\?ZYX;VUTMR543HM0KJ-++FE\\nDC<%$#!!};:z81x/4uss*qoommk)('g}f{dbb``^^\\\\\\\\ZvYtsVqTonmleNiLgJedcbaCCX]\\\\?T=X;:O86RQP2H1FK.,,A*(\\nDCB$:#8!};:z81x/vttrrppnnlljjh&g$#\\\"yba`u^sx[vuXVVkpSRmlNjcLaJHHFFDDBB@@>><<::886R5PO2M0EJ-,+@E\\n(CB%##>7~}:98x0w.ussq/.n,%l#(igg|ec!~`|u^sx[YYnWUqpoQgPejMKK`IGGEECCAA??=Y<WV9T7RK4O21FK.IH**E\\nD=B%@#>=};:{27xvv-2s0/.o,+$)j'h%f#\\\"bb}|{t]x[vYWWlUSSQQOkjLhaJ_HFFDDBB@@>><<:V9TSR5PONG0K.I,GF(\\n(CBA@9>!<}|38yww.us10/o'n%ljjh&%$dzcxa_{^\\\\\\\\qvuWslUjSQQOkjLhaJ_dGEEZCAA??==;W:UTS6QPONGL/.I,GF)\\nDCB$$9>=~5|{8yww.ussqqo-,l*#j!&geezcaa_{z\\\\xqZoXVVTTRRPPNjMhgJe^GbEDY^A\\\\[==R;V9866442N1//DIH*F?\\n(=&$$\\\">=<|4{2ywwuussqqo-n+*)j!hg$e\\\"!b``{ty\\\\[vYWWlqpRnmPeNLLJJHHFFD`_A]V?T=;;9977553O2ML/J-HAF)\\n(C&A@#!!<;4{z7xvv-2sqq(o&+*)i!h}fd\\\"!a}v_ty\\\\ZZoXVVTpoQmfOdiLJJ_HFFDDBB@@>><<:V9TS6Q4ONG0/J-++@E\\n(&&;$9\\\"~~||zzxxv43s1*q(-nll#jh&%e#zcx}`^^s\\\\ZZXXVVTpSnmPkNihg`eHGF[`C^]@>>YXWVO8764PON0F/DI,**?\\n(&&$@?>~6}4{yywwu321q)p',mkk\\\"iggeecca}`{z]x[vutslUToRmlOjihJJ_dcF[DCBW@U><<:V977LQP2NG0E.,,**(\\nDC%A:#8!}}{{yywwu3t10q.'n+l)j'&ff{\\\"c~a|_]]rwvXtmVkpSQQfOMMKKIedcE[DYB@@>><<::88664P3NML/DI,+F)\\nDC&$$?8!~}4{276v4-t+rppnnl*)i'~g|#dbbw`^^\\\\\\\\ZZXXVVTTRnQlkNiLg`IdGbE`_AA\\\\[TY<W:U866KP311FK.IHG*E\\nD=B%@#\\\"7<}{{2765u-t+rp.omm$)(h&}f{dbb`|_]]rwvXtmVkTRnmOkdMbgJHH]FDDBB@@>><<:V9TSR5PONG0/J-HG*(\\n(CBA@9>!~;|zz1xvvt21q/(o&mkkiiggeeccaa__]y\\\\wvYtWrqpohmPkNihgIeH]ba`BXAV?==;;9UT6RK4I200..,,**(\\n(&&$@#>=<5|9zy0w.u,1r/.-n%lk(i&%fdd!x}`_^sxwvXnWlUSoRPPejiKg`I^GEa`_AW@U><<::8866442200.J-HG*E\\n(C<A$#>!<;|zz76/vu2sqq(-,l*)j!&%e#zcxa__]][[YYWWUUSSQQOOMiLgfIdGbaZC^A\\\\?==R;PU8SRQ4ONMFK.-H+FE\\n(&&A@?>7~}:{yy054t21r).omm$)j'&g$e\\\"!~}v_z]\\\\qZoXmrqpRhQfOMihJf_H]bECCXA??==;;9977553311/K.IHG@)\\n(C&A@#!!6;|{z16wuu,1rpp',+k)\\\"i~geeccaa_{^\\\\\\\\qvuWslUjSQQOkjLhaJ_dGEEZCAA??==;W:UT7R5JO2M0/DI,GF(\\n(C<%@#>=};:{2ywwuus10p.'n%*kii~geec!~`|u^s\\\\ZZXXVVTTRnQlkjMhaJIH]bE`_B@@[ZSX;:U866KPO1ML/D-++))\\n''%%##!=<|:3z16wuu,sqqoommk)j'&g$e\\\"!x}`{^y\\\\wvXXsrqjSnQlOMMbgJHH]FDDB^A??TYX:VO8M6442200..,,**(\\n(&B%@?>!<;:3z7x5v32rr/.-,%*k(i&geez!b``u^s\\\\ZvuWslUjSQmlNjcLafIGG\\\\EC_^@\\\\U>SX;99N7553311//--++)E\\n(CBA$?>=<5:{8yx/432r0q(-n+*)\\\"i&gf{\\\"!~`v_ty\\\\ZZoXVVTTRRPPNNLLJJHHFFD`C^]\\\\U>=X;VU866K43N1//D-+GF(\\nD=&;@#!!6}{98x6/v-trrppnnlljjhhffd\\\"c~}`{^s\\\\wZuXsrTTohmPkNiLJJ_H]FD`_A]V?T=;;9UT6RK4IN1//D-++))\\n''%%##!!};|987x5.3t1rq(-nll#j!&g$#\\\"c~}v_^]rwZutWUUponglONMKKIeHFF[`_A]V?T=;WV8TM6K42N1//DIH*F?\\n(=&$$\\\"\\\"~~||zzx6w43t1r/.-&+l)ji~%f#\\\"bb}|{zs\\\\wZuXVVkpoQmlOdihJf_H]FDDBB@@>><<::8866442N1LKJ-HGFE\\n>'&A$?>!<;:zz165v-ts0/o-,m$)jhh}$#c!xav_]][[YYWsrTpiRglOMMbKIIGGEECCAA?[>YX;VO876K4IN1LK.,,AF)\\n(C&$$9>=};:{27x54u2s*/p-nm$k\\\"'h%$dd!xa|_z][[putVrqTinQlkjMhaJIH]bE`_B@@[ZSX;:9N7553ONM/E.C,*FE\\n'C<%:#!!}}{{yywwuus1r/.o,m*)\\\"'hgf{\\\"c~}`^^yxwpYXsVTTiRglOMMbgJedGbE`_^W@[>=RW:UT66QPONGL/J-,**(\\n(&BA#?8!6}{{yywwuussqqo-n+*)j'&%${\\\"cb}`{z]xwvXXmrqTiRQPejiKg`I^cFDDYB@@>ZY;WP9NS644I20LK-IB+@E\\n(&&;$\\\">=};4{27xvv-trrppnnlljjh&g$#d!xa`_ty\\\\wvYWWlUTonPleNchKII^GEECCA]\\\\>ZS<Q:8866442200..,H+FE\\n(C&;$#>=<|:{2765u-t+rppnnlljjh&%e#zcx}`^^s\\\\ZvuWslUjoRPPeNLLJJHHFbE`_B]@[TY<;:OT7RQ422MLE.-H+))\\n>CB$@9\\\"7~|:{yy054t2+r)pn,+k)\\\"i~geeccaa_{zy[qZotWUUjSQQOOMMKgJedGbE`_XA@[>YX;99TSRKP32M0..CH+))\\n>'<%#?>=}5|3zx65u3,s*/pnn%ljjhhffddbb``^^\\\\x[vuXsVqpohmPkNMbgJedFFa`_^W@[>YX:VU8MR533HM0KJI,GFE\\nD=&A$?\\\"=<;:9yy054u,s0qp'n%lj(igg|#\\\"b~w`u^\\\\xwYunWlUSonPleNchKII^GEa`B^W@UZ=;;P977553311//-I,GFE\\n>'&A$?>!}}49zy6wuu,10p.-n%*kii~%f#\\\"c~av{^]\\\\qvYtsVTTohQPkNLLafeGc\\\\EZCAA?[><<QVU7SL5J31ML.JC,A*(\\n(&&$$\\\"\\\"~~||z8y65v3t1*qp-n+*kii&%|#dcbw|_]]r[YuXVVkpoQmfOdMKKIIGGEa`B^W@U><<::88664P3NM0K.IHAF)\\n('<A$\\\"\\\"7~5:{87x5v321*qpo&+l)(i&g$#\\\"!x}`{^y\\\\wvutsUUjonQfOjMhKII^cbD`YBW@>Z=;;PUT6RK4I200..,,**(\\n(&&$$\\\"\\\"~<}:981xw4uss*q(-n+*k(i~gfez!b}|_]]xqvYXsrTpiRglOMMbKIIGcFDDY^]?[T=R;9UT6RK4I200..,,**(\\n(&&$@#>=~;|927x5v3t10pp-,%l)j'hff{\\\"!~`v_t][[YYWsrTpiRgPNNLLJfeGc\\\\EZ_B@@U><<::886R5PON1LKD-,+@E\\n(CB%##>=<5:{z765u-t+rp.omm$)(h&}f{db~}|^t]r[YYWWUUSSQQOOMMKgJedGbE`_^W\\\\?Z=<Q:OT7RQ33NMLKD-H+F)\\n''<A@?!7~5|zzxxv43s1*q(ommkkiiggeecca}`{zy\\\\wvutmVUTiRglkjLbK`IGGEECCAA??==;;99775Q4ON1LE.-,AF)\\nDC&$$9>!~;:z87x/4uss*/p-,m*k\\\"'h%f#d!~``{t]x[vYWWlUSonmOeNcLJJHHFFDDBB@@>><<:V9TSR5PI2M0/DI,**?\\n(=B%@?>!<;49z7xw.3t10/p-,+$k(ih}$e\\\"!~a|{zyrwZYXmVkTinQOOdiLgfId]FEDY^]\\\\>T=RW:88M6442200..,,**(\\n(&&$$\\\">!<;|92y6w4uss*q(-n+*)j!h%fez!b}|^^yrwZuXsVTTinmOkdMbKIIGcFDDY^]?[T=R;9UT6RK4I200..,,**(\\n(&&$@#>=<}:38yxw.u,sqqoom+ljj!&%e#zcxa_{zy[qZoXVVTTRRPPNNLhKfeHcFa`YBA\\\\?ZY<::UTSLQ43N1//DI,**?\\n(&&$$\\\"\\\"~<;{92y0wuus10p.'n%*kii~geeccaa_{^yx[vYtsrkpSnQlOjiKKfedc\\\\E`C^]?[Z=RWV8TM6KP311F/--++))\\n''%%##!!}}{{y7x543t10/.'n+l)j'&%$#ccx}|_t]x[vYWWlUSonPleNcLJJHdcEaZCX]@>>S<:VU7SL5JO200E.,,**(\\n(&&$$\\\">!<;:3zy6w43trr).on+ljj!&geez!~`|u^sx[YYnWUUSSQQOOMMKKIIGGEEC_B]\\\\?Z=RW:9T755JONM/E.C,**(\\nDCB$:#8!};:z81x/vttr0/o-&m$)jhh}fddbb``^^\\\\x[vuXsVqjSRmPNNchKfeHFFa`Y^A@?TYX:VO8MR533H1/KJ,HA*?\\nD'%%:#!!}}{{yywwuussqqo-nll#(i&%f#d!~w|_z]\\\\qZXtWUUjonmOeNcLJfedF\\\\EZCAA??=YX:VO8M6442200..,H+FE\\nD'BA@9\\\"!<}:9zxx5432+0qp-nll#jh&%e#zcx}`^^s\\\\ZZXtsrTjShQOkjiKaJ_HFba`BXAV?==;;99775Q4ON1L/JIHG@E\\n('BA@\\\">!6}{987w/v-trrppn,mkk\\\"'&f${dyb``^^\\\\\\\\ZZXXVrUpoRmfONihJfeH]bECCX]\\\\>ZS<Q:886R533HML.JC,A*(\\n(&&$$\\\"\\\"~~||zzx6wuu,1r/.o,m$kj'h%$ecc~w|_^y\\\\ZZotsUqjShmPNNcLJJHHFFDDBB@\\\\[=YR;PU866K42200..,H+FE\\n(C&A:?\\\"=~}498x65v-t+rppnnllj('&f|ezca}|{]s\\\\qvYWWlUSSQQOOMMKgJedcFa`YB]@?TY<WV88SRQJO2M0/--+GFE\\n'=&;$\\\"\\\"~~||zzxxvvttr0q.-,m*)(!&gf#d!~a__zyxwpYXsVTTiRPlkMibK`eHFF[DB^]?[T=R;9977553311//--+G*E\\nD'B%@?>=6}|9z76w432rr).-n%lk(igg|ec!~`|u^s\\\\ZZXtsUqjShQOOMMKgfeG]F[`CAAV?==;;997S6QP3NG0K.I,GF(\\n(=B%@#>=};:{2ywwuus10p.'n%*kii~geeccaa__]][[YuXsrqTinQPkjLhgJ_H]FDDB^]\\\\>T=R;9977553311//--+G*E\\nD'B%@9\\\"!~5:{yy0w.3t10q.o,+$)j'h%f#\\\"bb}|{t]x[vYWWlqTRRglOMMbgfHd]F[DBB@@>><<::886644220L/JIH+FE\\nD=&%$9>!<;|zz7654-2sr/pnn%*)i'&g|#\\\"b~w`u^\\\\\\\\ZZXXVVTTRRPPNNLLJfIdcFaD_^]\\\\UZ=<;P9N75QPO1G0E.,HGF(\\n>'<A$\\\"\\\"7~||z876v.u,1rpp'nlljjhhffddb~a|{^yr[ZYnsrTpoRgPNjMKK`edFb[DYB@@>Z=;;PUT6RK4I200..,,**(\\n(&&$@#!!6;|98y6w.u2s0q.-mm*#(i&g$eccx}|^zy\\\\qvYWWlqTonmPkdiLgJeHcbDD_^W@[>YX:VU8MRQ3OH1FK.,,A*(\\n(&&$@?!=6}49zxx/vttrrppnnlljjh&g$#\\\"c~}v_^]rwZutWUUponglONMKKIIGcbD`YBW@>ZY;WP9N75QP2NG0EJ-++@)\\n'CB$@9\\\"7<}{{2ywwuussq/p-,m*k('&}$e\\\"cbw`u^s\\\\ZZXXVVTTRRPPNjihJ`I^cFDDYB@\\\\[Z<R;PU866K42NML.D-B+)E\\n(CBA$?>=<5|{8y65v321qq(-,m$kji~g|#dbbw|{]yr[pYWWUUSonPleNcLJfeGc\\\\EZ_B@@U><<::8866442N1LK.IB+*E\\n(CB%##8=~}|3876v.u,sq/.n,%l#jh&%e#zcx}`^^s\\\\ZvutVlUjSQQOkjLhaJ_HFFDDBB@@>Z=XW:U8MR543HM0..CHG)E\\n>'<%##!!};|zz165u3,s*qoom+ljj!&%$dzcxa_{z\\\\xqZotWUUjSQQOOMMKgJedGbE`YBA\\\\?ZY<::UTMR543H1F/--+G*(\\n(=BA#?8!6}{9zxx/43s1*q(ommkkiiggeecca}`^^sx[vuXsVqpinQlONchgIedG\\\\EZ_B]\\\\[>YXWP9T7R5PO11LKJIBG*E\\n('<%:#!!};|zz165u3,s*qoom+ljj!&%e#zcxa__]][[YYWWUqTRRglOjihKfedc\\\\aD_B]@[ZYXW99NSR5J3N1LK-IH+@)\\n'CB$@9\\\"7<}{{2ywwuussqqoommkkiig%f#\\\"!xa`{^yx[YYnWVqTRRglkMibK`IGGEEC_^@\\\\U>SX;99N7553311//--++)E\\n(CB%@#8!~;|98yww4-2sr/pnn%*kii~ge#\\\"b~w`uz][[pYWWUUSSQQOOMMKKIIGcFa`C^A\\\\UZ=<;PUTS5Q4IN1LK.I,GF?\\n(C&A$?>~~;:927x5v3trr)pnnllj('g%|ezca}`^^sxwYunWlUSSQQOOMMKKIeHcbaD_^]V[>=X;VU866QPONG0/.C,AF)\\n''<A@\\\">7~5|zzx6wuu,10p.'n%lj('g%|ezcaa__]][[YYWWUqTonQlOjihg`IHcFa`C^]\\\\>>SXW:O87R533HM0..C,A*(\\n(&BA@\\\"8!6}{{y76v4-t+0qoo&mkkiiggeecca}`{z]xqZYtWrqTRRglONMbgJHH]ba`BXAV?==;;9UT6RK4IN1//D-++))\\n''%%##!!};|98y6w.3t1r/p-,ll)\\\"i&g$eccx}|^zs\\\\qZXXVVTTRRPPNNLLJJHHFbE`_^A\\\\U>Y<;PU8SR44ONGL/J-H+))\\n>'<A$\\\"\\\"7<}:98y65.3ts0q.-nll)('~gf#\\\"b~}`uzy[wpYnWUqpRngPeNLLJJHdGEEZ_^@\\\\U>S<::886644220L/JI,G*E\\nDC<%$?\\\"=<}{{8765.3tsr).omm$)('g}f{dbb``^zyxZpYnWUqTRRglkMibK`IGGEa`B^W@UZ=;;P97755331M0KJ-H+FE\\nDC<A$?\\\"!6}4{2yw543s+r).omm$kiigge#dbbw|{]yr[pYWWUUSSQQOOMiLgfe^GFaDBBW@U><<:VU7SL5JO200E.,,*FE\\nD&<%:#!!}}{{yywwu3t10q.o&ml)j'&gee\\\"y~a`_ty\\\\ZZoXVVTTRnQOOdihJf_H]FDDBB@\\\\[=YR;PU866K42200..,H+FE\\n(C&A:?\\\"=~}4987w/v-trrppnnl*)i'~g|ec!~`|u^sx[YYnWUUSSQQOOMiLgfeHcb[D_B]@[Z<<WVUNS6Q4ON0LK.C,**(\\nD'%%:?>~<5|3zx65u3,s*/pnn%ljjh&%e#zcxa__]][[YYWsVqpoRmlkdiLgJeHcbDD_^]\\\\U>Y<W:88MRQ3ON1FK.,,AFE\\n'C<%:#!!}}{98x6/v-trrppnnlljjhhf$e\\\"!~a|{zyr[ZuXsrUponPPejiLaJIH]F[DBB@\\\\[=YR;P9775QP2NG0EJ-++@)\\n''%%##!!}}{9z76w4-ts0q.-nll#(ih%fddybw|{z\\\\r[pYWsrqSiRgPNjiKg`I^GEECCA]\\\\[=S<QV977L53311//-IHG)?\\n(=B%##8!};|98y6w.3t1r/p-,ll)\\\"i&g$eccx}|^zy\\\\qZXXVVTpoQmfOdMKKIIGGEECCAA?[>YXW:UN76Q4ON1//JIBG*)\\n(=&;$\\\">!}}498x6/v-trrppn,+k)\\\"i~geeccaa__]][wZutWrUpohmPONcLaJHHFbECCX]\\\\[=S<Q:886644220L/--BGFE\\n'=&;$\\\">!}}4987w/v-tr0qoo&+*)i!h}fd\\\"c~}`{^yxwpYXsVqpSQQlkjibgJIdGEEZCAA??==;WV8TM6KP311F/-IHG)?\\n(=B%##8!};:9y1x/4uss*qoommkki'h%$e\\\"c~}|{ty\\\\wZYnWlUSSQQOkjLhaJ_HFFDDBB@@>><<:V9TSRK4O21F/DI,GF(\\n(=&A$?\\\"~~5:9y70w.ussq/.-m%l#jh&%e#zcx}`^^s\\\\ZZXXVVTTRRPPNjMhgfI^GFEZ_B]\\\\?==XQV9875QPO1G0E.,,**(\\nD'%%:?>~<5|3zxxvvttrrppn,m*)j'h%|#dc~a|{^\\\\\\\\wvoXWrUSShQOOMMKgfHd]F[DBB@@>><<::886R5PO2M0KJC,+*?\\nDC%A:#8=~||3zxxvvttrrp.-m+$k\\\"'hff{db~}_{t]rwZXXmVTTRRPPNjMhgJeHcbaZ_BA@UZ=XW:88SRQPI21LKJ,B+@)\\n''%A@\\\">7~5:{yy0wuus10p.'n%*kii~ge#\\\"!aw`u^\\\\\\\\ZZXXVVTpSnmPkNihgf_HGbE`_B]\\\\[==RWV9N76QP2NM0E.,H+))\\n>CB$@9\\\"7~||z8yww.32r0)p'nl*kii~%$d\\\"ybw`^^\\\\\\\\ZZXXVVTpSQQfkNihKf_HcFEZ_B]\\\\>>SX;V9T755JO2MLK.CH+F)\\nDC%A@#8!6;|zz165u3,s*qoommk)jhh}$#c!xav_]][[YutVrkTinQOOdMKKIIGGEaD_^]@[T=<W:UT755POHM0/J-++@E\\nD&BA$9\\\"~~|:{yy054t2+r)pnnlljjhhffddbb`|_]]rwZutWrUpohmPkNMbKIIGcbaCYBW@>Z=;;PUT6RK4I200..,,**(\\n(&&$@#>=<}:981xw4u21rpp-,+*#(ih%$d\\\"!bw|_]]rwvXtmVkTRRPPNNLLJJHHFFDDBB@\\\\?ZY<W:UTSRKP32M0KJ-HGF(\\n(=BA$9\\\"!<;{98y0wu32r0)p'nlljjh&%e#zcxa__]][[YYWWUqTonQleNiLK`eHcbDDYB]@?TY<::O86R533HML.JC,A*(\\n(&&$@?>~6}49zxx/vttrrppnnllj(i&%$ezc~a`uz]xwYYtmrUpSnmOkdMbgJHH]FDDB^]\\\\>T=RW:88M6442N1//DIH*F?\\n(=&$$\\\"\\\"~~||zzx6w432s0).on+l)(igg$#zcb}`^^sxwYutWlqTRRglkMibK`IGGEECCAA??==;;99775Q422GL/JI,G*E\\nD=&%@#>=~||98705vut+0qoo&mk)jhh}$#c!xav_]yxwYoXmVTTRRPPNNLLJJHHFbE`_B]@[ZYRW:U8S6QP22MLKJC,G*)\\n>'<%##!!}}{{yywwuussqqo-nll#(i&%$e\\\"!~}v_^]r[pYWsVTTinmOkdMbKIedFb[DYB@@>><<::8866442N1LK.IB+*E\\n(CB%##8=~}:{yy054t21r)pnnl*kii~%$d\\\"ybw`^zy[wpYnWUUSSQQOOMMKKIeHcbE`CX]@?>SX;VU866QJ321/KJ,HA*?\\n(&&$$\\\"\\\"~~||zzxxvvt2s0/p-n+$k(ih}$e\\\"!aa|{ty\\\\wZYWWUUSSQmlNjcLafIGG\\\\ECCA]\\\\>ZS<QV977L53311//-I,GFE\\n(CB;@#\\\"=~;:{yy654-tsr)p',+k)\\\"i~geecca}|^zs\\\\qvYWWlUSSQQOOMMKKIIGcFa`C^A\\\\[ZS<W:9NS6QP22MLKJCH+F)\\n(&&$$\\\"\\\"~~||z876v.u,1rpp'nlljjhhf$e\\\"!~a|{zyrwZYtWrqTonmOOdihK`IHcbD`_BW@>><X;99NSR4PI2G0..,H+))\\n>CB$@9\\\"7~||zzxxvvttr0q.-n+$kj'h%$eccxa`_ty\\\\ZZoXVVTponPfOdMKKIedcE[DY^A??T=;;997755331M0KJ-H+@)\\n(C&A@#!!<5:{zy0wu32r0)p',mkk\\\"iggeeccaa__]][[YYWsVqpSnQlejMhKfIdcEE`_XA\\\\?ZY;WV9N75Q422GLK-IB+@)\\n''%%##!=<|:3z16wuu,sqqoommkki'hff{\\\"c~}|_zyr[ZuXsrUSSnmlejMLgJHH]baC_^AV?==;W:88MRQ3OH1F/--++))\\n''%%##!!};|zz16w43t1r/.-&+l)ji~g|#\\\"!aw`uz][[pYWWUUSonPleNchKII^GEECCA]\\\\>ZS<QV977L53311//-I,GFE\\n(CBA@9\\\"!<}:9z765uu,10q(onm$k\\\"ig%fddy~}_{t]r[YYWsVTTinmOkdMbKIedFb[DYB@@>><<::886R5PO2MF/J-,AFE\\n'CB%:#8=~;:9z16wv32r0/p'nllj(igg|#\\\"b~w`u^\\\\x[YYnsrTpiRgPNNLLJJHHFFDDB^A\\\\[>Y<WP9T76KP3NM//JIBG*E\\n('<A$\\\"\\\"7<;:z2y0wuussq/.-m%l#jh&%$dzcxa_{zy[qZoXVVTTRRPPNjMhgfIdc\\\\aDC^]?[Z=R;99775Q422GLK-IB+@)\\n'CB$@9\\\"7<}{{2ywwuussqqoom+l)(i&g$#\\\"yb}`{^yxZZutsrkpSnQlOMMbgJHH]baC_XAV?=YXW9O8M64PON0F/DI,**?\\n(&&$$\\\"\\\"~~||zzxxv4u210q.-,+$)ji&g$#d!~}__tyx[pYXWlUjonPleNchKII^GEECCA]@>>SXW9UN7L53ON0LE.C,**(\\n(&&$$\\\"\\\"~<}:9z70wv3trr).-m+*k\\\"igge#dbbw|{]yr[pYWWUqpRngPeNLLJJHHFFDDB^A\\\\[>Y<Q:98M644220LK-IB+@)\\n'CBA#9\\\"7~|:9y70w.3trr)pn,+k)\\\"i~%fddyb``^^\\\\\\\\ZvYtsVqTohmPOjMKK`I^GEa`B^W@U><<::8TS5QJ3HM0..C,**(\\n(&&$$\\\"\\\"~<}:9z7x54-ts0q.-nll)('~%fedy~a|{^y\\\\wvunsVqToRmlNNihgf_HcFaDBBW\\\\?==RW:UTS6QPONG0/J-HG*E\\nDC%%:?>!6}|9zxx/4uss*/.n,%l#jhhf$eccx}|^zs\\\\qZXtsUqjShQOOMMKKIIGGEEC_B]\\\\?ZS<W:U8SR44IN1L/J-++@)\\n>'%%#?>=}5|3zx65u3,s*/pnn%ljjhhffddbb``^z]xwvYnsVUTinQlkNLLg`IHGEECCA]\\\\>ZS<Q:8TSR4J3HM0..C,**(\\n(&&$$\\\"\\\"~<}:9z7x5.ut1r/.omm*)\\\"'hgf{db~}|^t]rwZXXmVTpoQmfOdiLJJ_HFFDDBB@@>><<::8T7RQ4O2MLEJ-H+F)\\n''<%#?\\\"~~5:9y70w.us10p.'n%*kii~geeccaa_{z\\\\xqZotWUUjSQQOOMMKgJedcFa`_XA\\\\?>SX;VU77RQPOHM0K.-+G*(\\n(=BA#?8!6}{98x6/v-2sqq(ommk)('g}f{\\\"caav_]][[YYWWUUSoRmlkNihgf_dGFaD_^A\\\\[Z<<QVU8M65P311FK.,,AFE\\nD&<%:#!!}}{{y76v4-t+rppnnlljjhhf$e\\\"!b}v_z]\\\\qvYtsUUjSnQlOMMbgfHd]F[DBB@@>><<::8TSR4J3HM0..C,**(\\n(&&$@#>=<}4{8yx/432r0q(-n+*)j'~%fe\\\"c~}`^^yxqZYtWUUjonPlkNcLJfIGG\\\\a`B^W@U><<:VU7SL5J311//--++))\\n''%A$?>!<}:92yx5v32sqq.-,%*kj'hff{\\\"!a}|_tyxZvoXmVTTRRPPNNLLJJHHFFDDB^A\\\\[>Y<WVUNS6Q4O200E.CH+FE\\nD'BA@?8!<}|3z1654t,s*/pnn%lj('&f|ez!b``u^\\\\\\\\ZZXXVVTTRRPPNNLhKfed]FE`C^]@>>SX;:U866KPO1ML/DI,**?\\nD'BA$?\\\"7<}|{2ywwuus10p.'n%*kii~geec!~`|u^sx[YYnWUqpRngPejMKK`IGGEECCA]@[Z=X;VO87R5PO200KJCH+*)\\n>'<%##!=~||387w5.u,sq/pnn%*)i'~g|ec!~`|u^s\\\\ZZXXVVTTRRPlOjiLgJed]bE`C^A\\\\[==XWVO8S6Q422G0E.,,**(\\nDC%A:#8!}}{{yywwuussq/p-,+l)('~g$e\\\"!~`|_t][wvuWmVkTRRPPNNLhgIe^G\\\\aDBBW@>ZY;WP9NS644I200..,,*F)\\nDCB%@?>=6;|9z765u3t+0/.n&m$)jhh}fd\\\"!~`v_t][wvuWmVkpSQQfOMMKKIIGGEECCAA?[>YXWP98S6QP311F/.I,**?\\nD'%%:#8!}}{{y765u-t+rppnnlljjhhffd\\\"c~}`{^s\\\\wZYnsVqpRRmfkNiLgfHdcF[`CAAV[Z<XQ:O866442NM/KD-B+))\\n''%%##!!}}{9z765v3,1r/po&+l)(hh%${d!b}`^^s\\\\qvYWWlqTonmPkjcLKJ_H]F[`C^]@>>YXWPU8764P311FKJ,HA*?\\n(&BA@\\\"8!6}{{yywwuussqqoom+l)(i&g$#\\\"y~a|_^sx[vuWWrqpohQlOjiKg`I^GEECCA]@>>SXW9UN7L53311//--++))\\n'C&A@?\\\"=<;:3z7xw.321q/p',m*)(!h%fez!~}_u^sx[YYnWUUSSQQOOMMKKIIGGEEC_B]\\\\[T=X;:O8MR5PO11FK.I,G*(\\n(=B%@?>!6;|{8y65vtt1*qp-nll#('g%$ez!b``uz]xwZuXslUpSRgPeNchKfeGGbaZ_B]@[ZY;Q:OT755J311//--+G*(\\n(=BA#?8!6}{{y76v4-t+0qoo&mkkiigge#d!~}`{zsx[ZYnWlUSoRPPejiKg`I^GEEC_^@\\\\U>S<::8866442200.J-HG*E\\n(CBA:#>!~5|z8yww.32r0)p'nl*)(h~g|eccaa_{z\\\\xqZotWUUjSQQOOMMKKIeHcbaD_^]\\\\UZ=<W:UT7RQP22GLK.C,+F)\\n''<A$\\\"\\\"7~||z87w5.u,1rpp'nl*)(h~g|#dbbw`^^\\\\\\\\ZZXXVVTTRnQlkNibKJedcEaDY^]\\\\>T=R;9UTS5K4I200.JI+G@)\\n>C&$$9\\\"~~||zzxxvvttr0q.-n+l#j'hg|ez!b}|^^yrwZuXsVTTinmOkdMbKIIGGEECCAA??==;;997S644IN1LKJ-HAF)\\nD'&;@#!!6}49z765v32+rqp',m*)jhh%$#z!ba`^^\\\\\\\\ZvuWslUjoRPPeNLhKII^cbD`YBW@>><<::88664P3NM0K.IHG@E\\n(C&%:?\\\"=<||9876/v3t1rpp',+k)(i~%$d\\\"ybw`^^\\\\\\\\ZZXXVVTTRRPPNNLhKfedGba`_XA\\\\?Z=XWVUT66KPO2G0K.IH*FE\\n(=&$@#!!6;:z81x/vttrrp.omm$)(h&}f{dbb``^^\\\\\\\\ZZXtWrqpiRmPkNihJJ_dGbEDYBW\\\\[=YR;P977553311//--++))\\n''%A$?>=~5:{z7x54uss0)po,mkk\\\"'&f$#dy~a__ty\\\\wvYtWrkToRQfkNihJJed]bE`C^A??TYX:VU8MR5PON1LKDI,G*)\\n>C&A@\\\"\\\"=<;4{8yxvvt2sqq(-,l*#j!hffd\\\"caav{z\\\\xqZoXVVTpoQmfOdiLJJ_HFFDDBB@\\\\?ZYX;VUTM6Q4O2ML..IHGF?\\nD'B%@#!!6}49zxx/43s1*q(om+*j(!h}fddb~}_{t]rwZXXmVTTRRPPNNLLJJHdGba`C^]\\\\[TY<W:U8SRQPO11FKJ-B+F)\\n(=BA@\\\"8!6}{987w/v-trrp.-,l$k\\\"'hff{dbb``^^\\\\\\\\ZZXXVrUpongPOjMhgJHH]FE`_A]\\\\?TY<WV9T7L543HM0KJ-++F?\\nD'&%##!=~||387w5.u,sqqo-nll#('g%|ezcaa_{z\\\\xqZotWUUjSQQOOMMKgJedGbE`Y^A\\\\?Z=;;PUT6RK4I200.JIH*@)\\n>'%A@\\\">7~5|zzxxvvttrrppn,m*)(i&%|edcx}`{z][[vutmrUTShmPNNchgfH^G\\\\ECCAA?[ZY;Q:O86R533HML.JC,A*(\\n(&&$$\\\"\\\"~~|:{87x5v321*/po,mkk\\\"i~%$#cybw|_]]r[YuXVVkpoQmfOdMKgfHd]F[DBB@@>><<::88664P3NM0K.IHGF?\\n('B%@?\\\"=<;{{276w.uts*qo-,+k#j!&geezcaa__]][[YYWWUUSSQmPkjMhaJIH]bECCXAV[>YX;V9NS654IN1LK.I,G@)\\nD'B%@?!!<;49z7x5vtt+rppn,+k)\\\"i~%fddyb`|{z\\\\r[pYWsrqSiRgPNNLLJJHHFFD`C^]\\\\?ZYRW:98MR5PO2M0KJIB+F)\\nD'BA##>=<;49z7x5vtt+r)pn,+*j\\\"i~%fddyb``^^\\\\xwYunWlqTRRgPNNLLJJHHFFD`C^]\\\\?ZYXWPU87RQ3ON1F/DIHG)?\\n(=&$$\\\">=<|4{2yw54t2+r)pnnlljjhhffddb~a|{^yr[vYtWUUjoRPPejMhgfI^GFaD_^A??ZSX;:UT6RQ4INM/KD-B+))\\n'CB$@9\\\"7~|:{yy054t2+r)pnnlljjhhffddb~a|{^y\\\\wpuXWrUSShmPNNchKfeHcFa`YB]@[><<QV9TS55PONGL/J-,A*(\\n(&BA#?8!6;|zz1xv432r*q(ommkkiiggeecca}`{zy\\\\wvunsVqToRPPejMKK`eHcbaD_^]\\\\U>Y<W:UTSRQ33HML/D-H+*?\\n(=&$$\\\"\\\"~~|:9y70w.ussqqoommkki'h%$#zcb}`{z][[puXWrUSShmPNNchKfeHcF[`CB]@>>SX;99NS6QP3N1LE.-H+FE\\n(&&A@9>!~;|zz16wuu,1r/.o,m*)\\\"'hg$eccx}`^^sx[vuXsVqpohQPkNihKIIdcbaZ_BA\\\\?==RW:88MR5PO2M0KJIHAF)\\nD'&;$9\\\"7<;:z2y0wu32r0)p',mkk\\\"ig%$#cybw|_]]r[YYWWUUSSQQOOMMKgJedc\\\\E`C^A??TY<WVUN76Q422GL/--BG*E\\nD'B%:#\\\"=~;:{yy6/4ut1rpp',mkk\\\"'h%$e\\\"c~w|_^y\\\\ZZotWUUjoRmlOjMhg`IHcFa`CAA\\\\[ZSX;:U866KP311FK.IH+F)\\nDCB;@#\\\"=~||38yww.3t10q.o,+*)\\\"i&g$#c!~av_t][[YYWsrqSiRglOMMbKIIGGEECCAA??=Y<WVUN76Q4ON1//DI,+F)\\n''<A$\\\"\\\"7<}:9z7x/4ut1rpp',mkk\\\"'h%$e\\\"c~w`{^y\\\\wvXXsrkpSnQlkMihK`eHFF[`_A]V?T=;;9977553311//--++)E\\n(CBA$?>7<}:{z1xv4uss*/.n,%l#jhhf$#c!xav{^\\\\\\\\qZXtsUqjShmPNNcLJJHHFFDDBB@\\\\?ZYX;VUTM65P3NM0..IHGF?\\nD'&A$\\\"\\\"7<}{{27x54u2s0/.-&+lk(i&%f#\\\"!aav{z]r[ZuXVVkponPlOdihgI_H]FDDBB@\\\\[Z<R;P977553311//--+G*E\\nD'B;$#>=};:{27xvv-21q/(o&mkki'&f${dyb``^^\\\\\\\\ZZXXVVTTRnQlkNiLaJIdGbaDBB]V[>=X;99NS644IN1LK.I,G@E\\n(C&A$\\\"\\\"7<}{{27x543t10)po,m*)jhh%$#z!ba|_]]rwZXXmrUpoRmPkjibgJIdGEEZ_B@@UZ=XW:U8SRQPI2M0/D-B+)E\\nDC%;$9\\\"~~||zzxxvvttrrppn,m*)(!hg$e\\\"!b``uz]\\\\wZXXmrUSShmPkjMhK`eHGbECCX]@>>SX;VU8S6QJ32M0KJ-++FE\\n>C&%@#!!6;|zz16w43t1r/.',ml)jhh}$eccx}`{z]x[vutmVUpSnmPNNihgf_dGFaDBBW\\\\?==RW:UT7R5PONMFK.I,G*E\\nDCBA##8=<}4{8y65u32s*qoom+*j(!h}$eccxa__]][[YYWWUUSSQmPNNchKfed]FE`CAAV[><<QV9TS6Q4I21L/JI,**E\\n>C&%@#!!6;|zz16w43t1r/(-nm*kii~%fddy~a|{^y\\\\wvoXWrUpoRPPkjibgJIdGEEZ_B@@UZ=XW:U8SRQJO2M0K.,,A*(\\n(&B%##8=<|:3z1xvvttrrppnnlljjh&g$#\\\"c~}|{t]x[vYtsrqpRRglkNcLgJI^G\\\\EC_B@@UZY;WP9N75Q422GLK-IB+@)\\n'CB$@9\\\"7~||zzxxvvttrrp.o,+*#j'h%f#\\\"bbw|_z]\\\\qvuWslUjoRPPeNLhgfH^G\\\\ECCAA??==;;9977553O2MLK.CH+*)\\n>C&A@#>!<5|{8y65vtt10).on+ljj!&geez!b}|_z]xwpuXsVUjonPleNchKII^GEEC_B@@UZYX:P9N7553ON0LE.CH+))\\n>'%%##!!}}{{y7x543t10/(on+l)(igg$#\\\"!x}`_z][[puXVVkpSnmPkNihgf_dGbE`C^]\\\\[Z<<QVU8M6Q43H1FKJ,HA*?\\nD'%%:#!!};|zz165u3,s*qo-,l*#j!hffddbb``^^\\\\\\\\ZvYtsrkToRQfkNLLafedF\\\\EZCA]@>>SXW9UN7L53311//--++))\\n''%%#?\\\"=<;|3zy6w43trr/(-nm*kii~%fddy~a|{^y\\\\wpuXsVUjSQmlNjcLafIGG\\\\ECCA]\\\\[=S<QV977L53311//--++))\\n'C&A@?\\\"=<5|9z7x54tt10/(-n+l)jhh}$#\\\"bxav_]][[YYWWUUSSQQOOMMKgJedcFa`_X]@?Z=;;PU866KP3NM0K.IHGF?\\n(C&%:#8=~||387w5.u,sqqo-,l*#j!hffddbb``^^\\\\\\\\ZZXtWrqpiRQlOjiLJJ_dGFaDBBW\\\\?==RW:UT7R5JO2M0K.,,A*?\\nDC%A:#8=~||3zxxvvttr0/o-&m$)jhh}fddbb``^^\\\\\\\\ZvYtsrUpiRQPejMhgJHHcb[`CB]\\\\[=S<Q:8866442NML.D-B+))\\n''%%##!!};|98y6w43,1r/po&+*)i!h}fd\\\"!~`v_t][wvXtmVkTRnmOkdMbKIedFb[DY^A??T=;;997755331M0KJI,GFE\\n>'&%:?\\\"=<}{{8765.3ts0/o-&m$kiiggeec!~}_u^s\\\\ZZXXVVTTRRPlOjiLgJedcb[`C^A\\\\?ZYXWV88MRQ4I2M0/D-B+))\\n'CB$@9\\\"7<}{{2yw54t2+r)pnnlljjhhffddb~a|{zs\\\\[vYWWlqTRRglOjiLgJ_HGbE`_B@@[TY<;V977LQ422GL/JI,G*E\\n>C&%@#!!6;|zz16w43t1r/.'nm*k('hff#\\\"!x}`_z][[puXVVkpSnmPkNihg`eHGbECCX]@>>SX;VU8S6QPONG0K.-BG*(\\n(=&;@#!!6;:9y1x/vttrrp.-m+$k\\\"iggeeccaa__]][wZutslUToRmlOMMbgJIdGEEZ_B@@UZ=XW:U8MR54O200EJ-++@E\\n(CB%@#>7~;|9z76vv32+0q.on%l#jh&geez!~`|u^s\\\\ZZXtsUqjShmPNNcLJfeGc\\\\EZ_B@@U><<::8866442N1LKJ-HG@E\\n('B%##8=~||38y65v3t10/(on+l)(igg$#\\\"!x}`_z][[puXVVkpSnmPkNihgf_dGbEDYBW\\\\?==RWV8TM6K42NML.D-B+))\\n''%%##!!}}{{yyw5v321*qp-nll#(igg|ez!b}|_zs\\\\[ZoXmVTponPfOdiLJJ_HFFD`CAAV[Z<XQ:O866442200..,,*F)\\nDC&A$9\\\"!<}:9zxx5.3ts0qoo&+ljj!&g$#d!b}v{^y\\\\[putVrqTiRPPNNLLJfeGc\\\\EZ_B@@U><<::8866442N1LKJ-HG@)\\nD'&;@#!!6}49z765v321*/pon%l#j!hffd\\\"caav{z\\\\xqZoXVrqpRhQfOMihJf_H]bECCXA?[Z<XQ:OT755J311//--++))\\n(aBA@?>=<;:9876543210/.-,+*)54&%ed/.a=_^zy87YXts21}|nm,+j)hg&%qpbam_kj\\\\[>=ed:U87_^PO2MLXJI,+SR\\nDP&AML>=}|Gz87wvA@21qp;n,+kj54&%e#/.>=_^zy[7YXts21}|nz,+wvhg&%q#baDCkj\\\\[>=edVU87_^4\\\\21YXJI,+F)\\nDC&%ML>JI|GF87wvAts1qp;:,+kj5h&%ed/.>=_^zy87YXts2q}|nm,+wvht&%qpbaDCkj\\\\[>=edVU8S_^PO21YXJV,+SR\\nDC&%M#>=}|GF8DC5A@21qp;nm+kj54&%ed\\\".>=_^zy8wv5ts21}|nm,kwvhg&%qpbaDCkj\\\\[>YXdVU87_^PO2MYXJI,+SR\\nDC&%ML>=}|Gz87wvA@2>=p;:,+kj(43%$d/.>=_;]y[7YXts2~}o{m,+wv(t&rqpbaDCkj\\\\[>=edVU8SR5PO21YXJV,+SR\\nDC&%ML>J}|GF87wvA@21qp;:,+7)54&%ed/.a=_^zy87YXts21}|nm,+j)hg&%qpbam_kj\\\\[>=ed:U87_^PO2MLXJI,+SR\\nDP&AML>=}|Gz87wvA@21qp;n,+kj54&%e#/.>=_^zy[7YXts21}|nz,+wvhg&%q#baDCkj\\\\?Z=<dVU87_Q]ON1YXJI,+SE\\nDC&%ML>JI|GF87wvAts1qp;:,+kj5h&%ed/.>=_^zy87YXts2q}|nm,+wvht&%qpbaDCkj\\\\[>=edVU8S_^PO21YXJV,+SR\\nDC&%M#>=}|GF8DC5A@21qp;nm+kj54&%ed\\\".>=_^zy8wv5ts21}|nm,kwvhg&%qpbaDCkj\\\\[>YXdVU87_^PO2MYXJI,+SR\\nDC&%ML>=}|Gz87wvA@2>=p;:,+kj5hg%ed/.>=_^:\\\\87YXts2qp|nm,+wvhg&%qpbaDCkj\\\\[>=edVU8SR5PO21YXJV,+SR\\nDC&%ML>J}|GF87wvA@21qp;:,+7)54&%ed/.a=_^zy87YXts21}|nm,+j)hg&%qpbam_kj\\\\[>=ed:U87_^PO2MLXJI,+SR\\nDP&AML>=}|Gz87wvA@21qp;n,+kj54&%e#/.>=_^zy[7YXts21}|nz,+wvhg&%q#baDCkj\\\\[>=edVU87_^4\\\\21YXJI,+F)\\nDC&%ML>JI|GF87wvAts1qp;:,+kj5h&%ed/.>=_^zy87YXts2q}|nm,+w)h's%qpbaDl^]\\\\[>=ed:UTS_^PO21YXJVU+SR\\nDC&A@LK=}|GF8x6v4@21qp.:9+kj54&%ed\\\".>=_^zy8wv5ts21}|nm,kwvhg&%qpbaDCkj\\\\[>YXdVU87_^PO2MYXJI,+SR\\nDC&%ML>=}|Gz87wvA@2>=p;:,+kj5hg%$d/.>=_;]y87YXts210o{m,+wv(t&rqpbaDCkj\\\\[>=edVU8SR5PO21YXJV,+SR\\nDC&%ML>J}|GF87wvA@21qp;:,+7)54&%ed/.a=_^zy87YXts21}|nm,+j)hg&%qpbam_kj\\\\[>=ed:U87_^PO2MLXWI,+SR\\nD'&%ML>=}|:zEDCvA@21qp.n,+kj54&%e#/.>=_^z98ZvXts21}o.-l+wvhg&ed#baDCkj\\\\[>=XdVU87_Q]ON1YXJI,T*R\\nDC&%ML>=<|GF87wvAts1qp;:,+kj5h&%ed/.>=_^zy87YXts2q}|nm,+wvht&%qpbaDCkj\\\\[>=edVU8S_^PO21YXJV,+SR\\nDCO%ML\\\"=}|GFy7Cvu@21qp;-m+kj54&%ed\\\".>=_^zy8wv5ts21}|nm,kwvhg&%qpbaDCkj\\\\[>YXdVU87_^PO2MYXJI,+SR\\nDCO%ML>=I;Gzy7wvA@2>qp;:,+kj5'&2ed/.>=_^:\\\\87YXts2qp|nm,+wvhg&%qpbaDCkj\\\\[>=edVU8SR5PO21YXJV,+SR\\nDC&%ML>J}|GF87wvA@21qp;:,+7)54&%ed/.a=_^zy87YXts21}|nm,+j)hg&%qpbam_kj\\\\[>=ed:U87_^PO2MLXJI,+SR\\nDP&AML>=}|Gz87wvA@21qp;n,+kj54&%e#/.>=_^zy[7YXts21}|nz,+wvhg&%q#baDCkj\\\\[>=edVU87_^4\\\\21YXJI,+F)\\nDC&%ML>JI|GF87wvAts1qp;:,+kj5h&%ed/.>=_^zy87YXts2q}|nm,+wvht&%qpbaDCkj\\\\[>=edVU8S_^PO21YXJV,+SR\\nDC&%M#>=}|GF8DC5A@21qp;nm+kj54&%ed\\\".>=_^zy8wv5ts21}|nm,kwvhg&%qpbaDCkj\\\\[>YXdVU87_^PO2MYXJI,+SR\\nDC&%ML>=}|Gz87wvA@2>=p;:,+kj5hg%ed/.>=_^:\\\\87YXts2qp|nm,+wvhg&%qpbaDCkj\\\\[>=edVU8SR5PO21YXJV,+SR\\nDC&%ML>J}|GF87wvA@21qp;:,+7)54&%ed/.a=_^zy87YXts21}|nm,+j)hg&%qpbam_Bj\\\\[>YXWc9T7_^4ON1Y/JI,+S)\\n('OAML>=I|{zE76Bu3?r0<.:,+kj5hg2ed/.>=|^]yx7YuW3r~0onzlx*iu'frqp\\\"!`lB]i?ZfXWc9T`6QP\\\\NZ0KW-H+F)\\nDC&%ML>JI|G9Ex6Bu@?>qp;:,87)(h&%ed\\\"b>}_^zy87Y543Uq0|nmy+*vhtfr$co!`l^j@?Zf<Wc9T`RQ]3NZ0KJIHT*E\\nQ'B%@LK~<H{9Ex6B43?r0<onm8*6i'3f$d/!a=_^:\\\\8wv543r~0o{zlkwvhg&ed#b!DCkj@h>=Xdc9T`6Q]321YXJI,+SR\\nDCON$?K~<HGFEx6Bu3?1qp.nm87)(h&210c!~`<;:\\\\87YX4srq}onm,+jv('&rdco!`lBA@?>f<Wc9T76^PO21Y/.I,TSR\\nDCO%$LKJ<H{9ExCBut21qp;nm+*)54&%1#/ba=_^zy8wv5t321}|.ml+*)(g&%q#\\\"n`_Bj\\\\[g=<;:UT`6Q]3[Z0KWI,+SR\\nDPBAM?K~<H{F8x6Bu3?r0p.:9l*6i'3f$0\\\"!~`<{]\\\\8w6Xts21}|{m,x*iu'feqcbaDC^j@?>fXWc9T`6^4\\\\[1YX.IH+*)\\nDC&%@LKJ}HG9Ex6Buts1qp;:m+765'&f$0c!~=|;]y87vX4321}|nm,kjv('f%qp\\\"a`_Bj@[>=X;VU8S6Q]3NZ0XJIHT*E\\nQ'BN@L>~<H{9EDwBA@21qp;-9l7j54g2ed/.>=_^z\\\\87YXt3r~0o{z,x*iu'fr$cbaDlB]i?Zf<W:9T`6Q]3[1LXJI,GSR\\nDP&%ML\\\"J};Gzyx6Bu3?>0<o-9l*6ih&%$0c!~`<{]9[Z6uW3rq0|{-lx*iu'&%$pbaDCkj\\\\[gf<Wc9T`R^]3NZ0KWV,+SR\\nDC&%ML>JIH{9Ex65u@21qp.:9+k6('3f$0c.>}|^zy8wY5W321}|.ml+*)(g&%q#bnDlBj\\\\[g=<;:UT`6Q]3NZY/JI,+SR\\nDP&A@?K~<H{9yD6Bu3?r0p.:m87)(hg2ed\\\"!~`<{]y[ZYXtsU1pon-yx*iu'feqc\\\"!`lB]i[ZfXdVUa76^]O[1YXJIHT*R\\n(C&%@#>JI;G9Ex6But21=p;:,8k65'3%ed\\\".~}<;zy87vXWsU~0o{-lx*)(gfr$co!`l^j\\\\?Zf<WcUaSRQ]3NZLKWV,+SR\\n(CB%@?\\\"=}|Gz8xC5u@21=po:,876i'3f$d\\\"!~=_^zy8w6Xt3r~0o{z,xwvhg&eqco!DCkj@h>=XdcU87_54O[Z0XJIU+*R\\nDC&N$?K~<|:zyx6Bu3?1=/o:,+7j('g210c!~`<;:9x7YXts2q0/n-lx*iut&r$co!`lBA\\\\hZf<Wc9T`6Q43NZ0KWVUG*R\\nDC&AM?\\\"=}H{9Ex6543s1qp;nm8*)5'3f$0cba`_^zy8ZY5WVr~0o{-l+wi(g&%qcbaDlkj\\\\[>fedVba7_^P32MLXJI,+S)\\nQ'BN@L>=}|GzEDwBu3?r0/.-9+kj5'&%10/.>=|;:\\\\x76XtsUqp|.z,x*iu'f%qcbaDC^j@?g=edVU8`_5]O[1YX.V,GS)\\nQ'BN$?\\\"~<|G9Ex6Butsrqp;:,lkj(4&%ed/!>}<;]9xZ6uWsU~po{-lx*v(g&%qpb!D_kAi?Zf<WcU87RQ]3NZ0X.IH+SR\\nDPBN$#K=}|Gz8xCvA3?r0<o:,l*6i'3f$d\\\"b>=_^z987vXt3r~0o{my+jiu'fr$pba`Ckj\\\\hZf<dcU87R54\\\\210XJI,GS)\\n(PO%ML\\\"JI|Gzy7wvA@?r=p;:,+7)54g%$d/.>=<;]y87YX4V21p|{m,+wvu'feqpbamCBji[>=edVUT`R5P3NZ0KWIUT*R\\nDC&N@#\\\"~}|GF87wvA@s1qp;-m87654&%1dc.>`_^zy87YXts21}|.z,kj)(g&%qpbamCkj\\\\[g=<dcUa7_^PONZYKWI,+FR\\nQC&A$?K~<H{9yDC54ts>=p.:ml*6i'3fed\\\"!~`<{]\\\\8ZvuW3r~0|.mlx*iu'feqpo!`lB]i?ZfXWc9T`65P\\\\[1YXJI,+SE\\nDC&%@#>=I|:F87w54@?1q<o-9l*)('3%ed\\\"ba}_^zy87Yu4Vrqpo{-lx*v(gf%qp\\\"aml^Ai[>=ed:98`R^PO2ZY/.-,+SR\\nDCOA$?K=}|:zy7CB4@21qp;n,8k6i'3f$#/!~=_^:\\\\[wv54s21p|.-,kjvhg&ed#oaDlB]i?Z=eWV9T`6Q]O21YXJI,TS)\\nDP&N$?K~<|Gzyx6Bu3?1=/o:,+k)i'32e0c!~`<^:yx7YXt321pon-lx*iugse$pbamC^]\\\\hZf<Wc9T7_^4O21YKJV,GSR\\nDC&A$?K~}|GFyDC5u@s1qp;nm8*)5'3f$0cba`_{]9xZ6X4s21}|n-,kjvh'fr$coaDC^]i?Zf<d:UT7_^P\\\\NZ0/.I,+SR\\nDP&AM?K~<H{F8xwvA@s>=/on9+kj(hg%1#\\\"!~`<{]y8Z6XtsU1ponz,x*iu'f%q#oaDC^A@hg=XdVU8SR5]\\\\2Z0KW-HGFE\\n(C&%MLK=I;:F87w5u321=p;:,+76ih&f$0c!~}_{]y87YXtV2qp|nm,k*i(tsr$co!`_k]@?Zf<Wcb87_^PO[ML/WVU+SR\\n(CON@L>~<H{9EDwvu@21=p.-m8*6i'3f10c!a=_^z98wvXts21}/{-lx*vhg&rq#\\\"!DCkj@hg=<d:U87_54ON1YKW-HT*)\\n('&N$?K~<|Gz87wvA321=/;-9l*6ihg%10c!~`<^z\\\\x7YXtVr~0/.m,+wvhts%qco!`lBA\\\\?Z=edV98S_Q]O21YKJIUTFE\\nQ'BN$#\\\"~<|GFy7CBAt?1qp;n,8kj(4&%e0/ba`|{]9xZvuW3U1}|n-,kwvhg&%q#o!`lBj\\\\[gYXd:Ua7_^P\\\\[M0XJ-HT*E\\nQCONM?K~<H{zyDwvA@2rq/;:,l*6i'3%1#\\\"!~`<{]y[w6Xts2q0o{z,x*iu'f%qc\\\"aDCk]\\\\h>YedVU8S6Q]321YX.VUG*)\\n(C&%ML>JI|G9Ex6Bu@sr0p;:,lk)5'3%ed\\\"ba}_^z9xZ6uWsUq0|nmy+ji(tf%qpba`CBA@[>=eWVUa`R^PO2ML/WI,T*E\\nQ'BAM?\\\"~<H{9E7w5A@21q<;:m8k6i'3f$d\\\"ba`<{]9x7vXWs21}/{-l+wiu'fr$pb!DCkj\\\\[gY<;VU87_QPO[ZLXJI,+F)\\nDC&N$?K~<;:9E7wvA@21=/;:,+k65h&f10c!~`<;:9[Z6uW3r1p/{m,+wihtsrqpbam_^Ai[Z=ed:baS_54O21LX.-U+FE\\nQ'BN$#\\\"J<|GFy7CBAt21qp;:9+76(4&%e0/ba`|^zy87v5tVr1}|.zykjiug&%qponm_^j\\\\[gYX;:UT7_^P32MYKJI,+F)\\n(CBA$L>=I;:z8D6vA@2>q<.n,l*6i'32e0/.>=_{zy8wYXtsU10|.-y+wvhg&e$#baDC^A\\\\h>=<dVU87_54321YX.IH+*)\\nDC&%MLK~I|G9Ex6Bu@srqp;:,8kj('&%ed\\\"b>}_^zy87YXWVr1}|nmy+*vuts%qpbaDl^]i[>=XdcU8SR^PO2MY/WI,T*E\\nQ'BAM?>=}|Gzy7wvu@21q<;n9+kj54&fe#cb>=_^z98wYXW3r~0o{m,k*vhg&rqp\\\"n`lB]i?Zfed:baSR54O[MLKW-HT*E\\nDPON$?K~<|G9yx6Bu3?1=/.-9l*6i43f10c!~`<;:9[Z6uW3r1}o{-lx*iut&%d#\\\"nm_^A\\\\hgf<Wc9TSR^4O21YKJV,GSR\\nDC&A$?K~}H{9Ex6vA@s1qp.:9+*j54&%e0/.>}_^zy87Y5t32~0o{-lkjih'fr$coaDCkj\\\\[>fe;:ba`6Q]3NMYK.I,+SR\\nDP&AM?K~<H{F8x6Bu3?r0/.-9+kj5h3f$#\\\"!~`<{]\\\\8Z6uW3r~po{mlx*iu'feqpo!`lB]i?ZfXWc9T`65P\\\\[1YX.V,GS)\\n('BN$?KJ}H:9Ex6B43?>0<o-9l*j5'g%ed\\\".~=<^zy87YXtVr~}|nmykw)htsr$co!`CkA\\\\[>=XdcUa`_^PO21Y/W-,+SR\\n(P&AM#>~<H{9EDwv4@21q<.:9+kj54&%ed\\\".>=_^z9[w6X4s21p/nzykjvhgs%$ponDlB]i?ZYeWVU87R54\\\\NM0XJIUGF)\\nDCO%ML\\\"=IHGFE7wvAt?rqp.:,+k654gf$T/RQ\\n\",\n \"language\": \"Malbolge\"\n },\n {\n \"code\": \"> StringTools:-Encode( \\\"The Quick Brown Fox Jumped Over The Lazy Dog!\\\", encoding = rot13 );\\n \\\"Gur Dhvpx Oebja Sbk Whzcrq Bire Gur Ynml Qbt!\\\"\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"Rot13[s_] := StringReplace[\\n s,\\n # -> RotateLeft[#, 13] & @* CharacterRange @@ # &[\\n {\\\"a\\\", \\\"z\\\"}, {\\\"A\\\", \\\"Z\\\"}\\n ] // Thread\\n]\\nRot13[\\\"Hello World!\\\"]\\nRot13[%]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function r=rot13(s)\\n if ischar(s)\\n r=s; % preallocation and copy of non-letters\\n for i=1:size(s,1)\\n for j=1:size(s,2)\\n if isletter(s(i,j))\\n if s(i,j)>=97 % lower case\\n base = 97;\\n else % upper case\\n base = 65;\\n end\\n r(i,j)=char(mod(s(i,j)-base+13,26)+base);\\n end\\n end\\n end\\n else\\n error('Argument must be a CHAR')\\n end\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \">> rot13('Hello World!')\\n\\nans =\\n\\nUryyb Jbeyq!\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"function text = rot13(text)\\n if ischar(text)\\n\\n selectedLetters = ( (text >= 'A') & (text <= 'Z') ); %Select upper case letters\\n text(selectedLetters) = char( mod( text(selectedLetters)-'A'+13,26 )+'A' );\\n\\n selectedLetters = ( (text >= 'a') & (text <= 'z') ); %Select lower case letters\\n text(selectedLetters) = char( mod( text(selectedLetters)-'a'+13,26 )+'a' );\\n\\n else\\n error('Argument must be a string.')\\n end\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \">> plainText = char((64:123))\\n\\nplainText =\\n\\n@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{\\n\\n>> rot13(plainText)\\n\\nans =\\n\\n@NOPQRSTUVWXYZABCDEFGHIJKLM[\\\\]^_`nopqrstuvwxyzabcdefghijklm{\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"rot13(a) := simplode(map(ascii, map(lambda([n],\\n if (n >= 65 and n <= 77) or (n >= 97 and n <= 109) then n + 13\\n elseif (n >= 78 and n <= 90) or (n >= 110 and n <= 122) then n - 13\\n else n), map(cint, sexplode(a)))))$\\n\\nlowercase: \\\"abcdefghijklmnopqrstuvwxyz\\\"$\\nuppercase: \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"$\\n\\nrot13(lowercase);\\n\\\"nopqrstuvwxyzabcdefghijklm\\\"\\n\\nrot13(uppercase);\\n\\\"NOPQRSTUVWXYZABCDEFGHIJKLM\\\"\\n\\nrot13(\\\"The quick brown fox jumps over the lazy dog\\\");\\n\\\"Gur dhvpx oebja sbk whzcf bire gur ynml qbt\\\"\\n\\nrot13(%);\\n\\\"The quick brown fox jumps over the lazy dog\\\"\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \":- module rot13.\\n\\n:- interface.\\n\\n:- import_module io.\\n:- pred main(io::di, io::uo) is det.\\n\\n:- implementation.\\n\\n:- import_module string, set, list, char, int.\\n:- type transition == {character, character}.\\n:- type transitions == set(transition).\\n:- type rot_kind\\n ---> encrypt\\n ; decrypt.\\n\\n:- pred build_transition(int::in, rot_kind::in, int::in, int::in, character::in,\\n transitions::in, transitions::out) is det.\\nbuild_transition(Offset, Kd, Lb, Ub, Ch, St, Rs) :-\\n (\\n Kd = encrypt,\\n Diff = to_int(Ch) + Offset\\n ;\\n Kd = decrypt,\\n Diff = to_int(Ch) - Offset\\n ),\\n (if (Diff >= (Ub + 0x01))\\n then Ct = {Ch, det_from_int(Lb + (Diff - Ub) - 0x01) `with_type` char}\\n else if (Diff =< (Lb - 0x01))\\n then Ct = {Ch, det_from_int(Ub - (Lb - Diff) + 0x01) `with_type` char}\\n else Ct = {Ch, det_from_int(Diff) `with_type` char}),\\n union(St, make_singleton_set(Ct), Rs).\\n\\n:- pred generate_alpha_transition(int::in, rot_kind::in, transitions::out) is det.\\ngenerate_alpha_transition(N, Kd, Ts) :-\\n Offset = N mod 0x1A,\\n to_char_list(\\\"abcdefghijklmnopqrstuvwxyz\\\", Lower),\\n to_char_list(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\", Upper),\\n foldl(build_transition(Offset, Kd, 0x61, 0x7A), Lower, init, Ts0),\\n foldl(build_transition(Offset, Kd, 0x41, 0x5A), Upper, Ts0, Ts).\\n\\n:- pred rot(transitions::in, string::in, string::out) is det.\\nrot(Ts, Base, Result) :-\\n to_char_list(Base, Fragment),\\n map((pred(Ch::in, Rs::out) is det :-\\n promise_equivalent_solutions [Rs]\\n (if member({Ch, Nx}, Ts)\\n then Rs = Nx\\n else Rs = Ch)\\n ), Fragment, Result0),\\n from_char_list(Result0, Result).\\n\\n:- pred invoke_line(transitions::in, string::in, text_input_stream::in, io::di, io::uo) is det.\\ninvoke_line(Ts, File, Stream, !IO) :-\\n read_line_as_string(Stream, Line, !IO),\\n (\\n Line = ok(Base),\\n rot(Ts, Base, Rot),\\n write_string(Rot, !IO),\\n invoke_line(Ts, File, Stream, !IO)\\n ;\\n Line = error(_),\\n format(\\\"Can't read correctly the file %s.\\\\n\\\", [s(File)], !IO)\\n ;\\n Line = eof\\n ).\\n\\n:- pred handle_files(transitions::in, list(string)::in, io::di, io::uo) is det.\\nhandle_files(_, [], !IO).\\nhandle_files(Ts, [Head|Tail], !IO) :-\\n open_input(Head, Result, !IO),\\n (\\n Result = ok(Stream),\\n invoke_line(Ts, Head, Stream, !IO),\\n close_input(Stream, !IO)\\n ;\\n Result = error(_),\\n format(\\\"Can't open the file %s.\\\\n\\\", [s(Head)], !IO)\\n ),\\n handle_files(Ts, Tail, !IO).\\n\\nmain(!IO) :-\\n generate_alpha_transition(0x0D, encrypt, Table),\\n command_line_arguments(Args, !IO),\\n (\\n Args = [_|_],\\n handle_files(Table, Args, !IO)\\n ;\\n Args = [],\\n invoke_line(Table, \\\"<stdin>\\\", stdin_stream, !IO)\\n ).\\n\\n:- end_module rot13.\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"Sub Rot13\\n EncodedString = \\\"\\\"\\n For i = 1 To Text.GetLength(String)\\n Code = Text.GetCharacterCode(Text.GetSubText(String, i, 1))\\n If Code >= 65 And Code <= 90 Then\\n EncodedCode = Code + 13\\n If EncodedCode > 90 Then\\n EncodedCode = 64 + EncodedCode - 90\\n EndIf\\n ElseIf Code >= 97 And Code <= 122 Then\\n EncodedCode = Code + 13\\n If EncodedCode > 122 Then\\n EncodedCode = 96 + EncodedCode - 122\\n EndIf\\n Else\\n EncodedCode = Code\\n EndIf\\n EncodedString = EncodedString + Text.GetCharacter(EncodedCode)\\n EndFor\\nEndSub\\n\\nString = \\\"Rosetta Code\\\"\\nRot13()\\nTextWindow.WriteLine(EncodedString)\\n\",\n \"language\": \"Microsoft-Small-Basic\"\n },\n {\n \"code\": \"(\\n \\\"(?i)[A-M]|([N-Z])\\\"\\n (-> '== (-13) (13) if nip swap ord + chr)\\n replace-apply\\n) ^rot13\\n\",\n \"language\": \"Min\"\n },\n {\n \"code\": \"rot13 = function(s)\\n chars = s.values\\n for i in chars.indexes\\n c = chars[i]\\n if c >= \\\"a\\\" and c <= \\\"z\\\" then chars[i] = char(97 + (code(c)-97+13)%26)\\n if c >= \\\"A\\\" and c <= \\\"Z\\\" then chars[i] = char(65 + (code(c)-65+13)%26)\\n end for\\n return chars.join(\\\"\\\")\\nend function\\n\\nprint rot13(\\\"Hello world!\\\")\\nprint rot13(\\\"Uryyb jbeyq!\\\")\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"def rot13 (value:string)\\n result = \\\"\\\"\\n d = ' '.toCharArray[0]\\n value.toCharArray.each do |c|\\n testChar = Character.toLowerCase(c)\\n if testChar <= 'm'.toCharArray[0] && testChar >= 'a'.toCharArray[0] then\\n d = char(c + 13)\\n end\\n if testChar <= 'z'.toCharArray[0] && testChar >= 'n'.toCharArray[0] then\\n d = char(c - 13)\\n end\\n result += d\\n end\\n result\\nend\\n\\n\\nputs rot13(\\\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\\\")\\n\",\n \"language\": \"Mirah\"\n },\n {\n \"code\": \"fun readfile () = readfile []\\n | x = let val ln = readln ()\\n in if eof ln then\\n rev x\\n else\\n readfile ` ln :: x\\n end\\n\\nlocal\\n\\tval lower_z = ord #\\\"z\\\";\\n\\tval upper_z = ord #\\\"Z\\\";\\n\\tval lower_a = ord #\\\"a\\\";\\n\\tval upper_a = ord #\\\"A\\\";\\n\\t\\n\\tfun which\\n\\t\\t\\t(c_upper c) = (upper_a, upper_z)\\n\\t\\t|\\t_\\t = (lower_a, lower_z)\\n\\t\\t;\\n\\t\\n\\tfun scale\\n\\t\\t\\t(c, az) where (c > #1 az) = scale( (#0 az + (c - #1 az - 1)), az)\\n\\t\\t|\\t(c, az) \\t\\t = c\\n\\t\\t\\t\\nin\\n\\tfun rot13\\n\\t\\t\\t([], t) \\t\\t\\t = implode ` rev t\\n\\t\\t|\\t(x :: xs, t) where (c_alphabetic x) = rot13 (xs, (chr ` scale (ord x + 13, which x)) :: t)\\n\\t\\t|\\t(x :: xs, t) = rot13 (xs, x :: t)\\n\\t\\t|\\ts \\t\\t\\t\\t = rot13 (explode s, [])\\nend;\\n\\nmap (println o rot13) ` readfile ();\\n\",\n \"language\": \"MLite\"\n },\n {\n \"code\": \"// main registers\\np\\tIS\\t$255\\t% text pointer\\nc\\tGREG\\t\\t% char\\ncc\\tGREG\\t\\t% uppercase copy of c\\nu\\tGREG\\t\\t% all purpose\\n\\n\\tLOC\\tData_Segment\\n\\tGREG\\t@\\nTest\\tBYTE\\t\\\"dit is een bericht voor de keizer\\\",#a,0\\n\\n\\tLOC\\t#100\\nMain\\tLDA\\tp,Test\\n\\tTRAP\\t0,Fputs,StdOut\\t% show text to encrypt\\n\\tLDA\\tp,Test\\t\\t% points to text to encrypt\\n\\tJMP\\t4F\\n// do in place text encryption\\n\\t\\t\\t\\t% REPEAT\\n2H\\tADD\\tcc,c,0\\t\\t% copy char\\n\\tSUB\\tcc,cc,' '\\t% make uppercase\\n\\tCMP\\tu,cc,'A'\\n\\tBN\\tu,3F\\t\\t% IF c < 'A' OR c > 'Z' THEN next char\\n\\tCMP\\tu,cc,'Z'\\n\\tBP\\tu,3F\\n\\tCMP\\tu,cc,'N'\\t% ELSE\\n\\tBN\\tu,1F\\t\\t% IF c < 'N' THEN encrypt 'up'\\n\\tSUB\\tc,c,26\\t\\t% ELSE char ready for encrypt 'down'\\n1H\\tINCL\\tc,13\\t\\t% encrypt char\\n\\tSTBU\\tc,p\\t\\t% replace char with encrypted char\\n3H\\tINCL\\tp,1\\t\\t% move to next char\\n4H\\tLDBU\\tc,p\\t\\t% get next char\\n\\tPBNZ\\tc,2B\\t\\t% UNTIL EOT\\n// print result\\n\\tLDA\\tp,Test\\n\\tTRAP\\t0,Fputs,StdOut\\t% show encrypted text\\n\\tTRAP\\t0,Halt,0\\n\",\n \"language\": \"MMIX\"\n },\n {\n \"code\": \"MODULE Rot13;\\n\\nFROM STextIO IMPORT\\n ReadString, WriteString, WriteLn;\\nFROM Strings IMPORT\\n Length;\\n\\nTYPE\\n MyString = ARRAY [0..80] OF CHAR;\\n\\nVAR\\n S, T : MyString;\\n\\nPROCEDURE Rot13(S : ARRAY OF CHAR; VAR T : ARRAY OF CHAR);\\nVAR\\n I, J : CARDINAL;\\nBEGIN\\n FOR I := 0 TO Length(S) - 1\\n DO\\n J := ORD(S[I]);\\n IF ((J >= 65) AND (J <= 90)) THEN\\n J := (J - 52) % 26 + 65;\\n IF ((J >= 97) AND (J <= 122)) THEN\\n J := (J - 84) % 26 + 97;\\n T[I] := CHR(J);\\n END;\\nEND Rot13;\\n\\nBEGIN\\n WHILE NOT Eof\\n DO\\n ReadString(S);\\n SkipLine;\\n WriteLn;\\n Rot13(S, T);\\n WriteString(T);\\n WriteLn;\\n END;\\nEND Rot13.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"MODULE Rot13 EXPORTS Main;\\n\\nIMPORT Stdio, Rd, Wr;\\n\\nVAR c: CHAR;\\n\\n<*FATAL ANY*>\\n\\nBEGIN\\n WHILE NOT Rd.EOF(Stdio.stdin) DO\\n c := Rd.GetChar(Stdio.stdin);\\n IF c >= 'A' AND c <= 'M' OR c >= 'a' AND c <= 'm' THEN\\n c := VAL(ORD((ORD(c) + 13)), CHAR);\\n ELSIF c >= 'N' AND c <= 'Z' OR c >= 'n' AND c <= 'z' THEN\\n c := VAL(ORD((ORD(c) - 13)), CHAR);\\n END;\\n Wr.PutChar(Stdio.stdout, c);\\n END;\\nEND Rot13.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"100 REM ROT-13\\n110 CLS : REM 110 HOME for Applesoft BASIC\\n120 INPUT \\\"Enter a string: \\\";a$\\n130 GOSUB 160\\n140 PRINT b$\\n150 END\\n160 REM FUNCTION rot13\\n170 FOR i = 1 TO LEN(a$)\\n180 n = ASC(MID$(a$,i,1))\\n190 e = 255\\n200 IF n > 64 AND n < 91 THEN e = 90 : REM uppercase\\n210 IF n > 96 AND n < 123 THEN e = 122 : REM lowercase\\n220 IF e < 255 THEN n = n+13\\n230 IF n > e THEN n = n-26\\n240 b$ = b$+CHR$(n)\\n250 NEXT\\n260 RETURN\\n\",\n \"language\": \"MSX-Basic\"\n },\n {\n \"code\": \"Rot13(in)\\tNew low,rot,up\\n\\tSet up=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n\\tSet low=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\tSet rot=$Extract(up,14,26)_$Extract(up,1,13)\\n\\tSet rot=rot_$Extract(low,14,26)_$Extract(low,1,13)\\n\\tQuit $Translate(in,up_low,rot)\\n\\nWrite $$Rot13(\\\"Hello World!\\\") ; Uryyb Jbeyq!\\nWrite $$Rot13(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\") ; NOPQRSTUVWXYZABCDEFGHIJKLM\\n\",\n \"language\": \"MUMPS\"\n },\n {\n \"code\": \"def rot13(plaintext)\\n\\tuppercase = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n\\tlowercase = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\n\\tcypher = \\\"\\\"\\n\\tfor char in plaintext\\n\\t\\tif uppercase .contains. char\\n\\t\\t\\tcypher += uppercase[uppercase[char] - 13]\\n\\t\\telse if lowercase .contains. char\\n\\t\\t\\tcypher += lowercase[lowercase[char] - 13]\\n\\t\\telse\\n\\t\\t\\tcypher += char\\n\\t\\tend\\n\\tend\\n\\n\\treturn cypher\\nend\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"/*\\n ROT-13 in Neko\\n*/\\n\\n/* Assume ASCII encoding */\\nvar rotate13 = function(c) {\\n if (c >= 65 && c <= 77) || (c >= 97 && c <= 109)\\n c += 13\\n else\\n if (c >= 78 && c <= 90) || (c >= 110 && c <= 122)\\n c -= 13\\n return c\\n}\\n\\nvar rot13 = function(s) {\\n var r = $scopy(s)\\n var len = $ssize(r)\\n var pos = 0\\n while pos < len {\\n $sset(r, pos, rotate13($sget(r, pos)))\\n pos += 1\\n }\\n return r\\n}\\n\\nvar msg = $loader.args[0]\\nif msg == null {\\n var testing = \\\"[abcdefghijklmnopqrstuvwxyz 0123456789 ABCDEFGHIJKLMNOPQRSTUVWXYZ]\\\"\\n $print(testing, \\\"\\\\n\\\", replaced = rot13(testing), \\\"\\\\n\\\")\\n $print(rot13(replaced), \\\"\\\\n\\\")\\n $print(\\\"\\\\n\\\")\\n msg = \\\"The secret message said \\\\\\\"Open Sesame!\\\\\\\"\\\"\\n}\\n$print(msg, \\\"\\\\n\\\", replaced = rot13(msg), \\\"\\\\n\\\")\\n$print(rot13(replaced), \\\"\\\\n\\\")\\n\",\n \"language\": \"Neko\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref savelog symbols nobinary\\n\\nparse arg fileNames\\n\\nrdr = BufferedReader\\n\\ndo\\n if fileNames.length > 0 then do\\n loop n_ = 1 for fileNames.words\\n fileName = fileNames.word(n_)\\n rdr = BufferedReader(FileReader(File(fileName)))\\n encipher(rdr)\\n end n_\\n end\\n else do\\n rdr = BufferedReader(InputStreamReader(System.in))\\n encipher(rdr)\\n end\\ncatch ex = IOException\\n ex.printStackTrace\\nend\\n\\nreturn\\n\\nmethod encipher(rdr = BufferedReader) public static signals IOException\\n\\n loop label l_ forever\\n line = rdr.readLine\\n if line = null then leave l_\\n say rot13(line)\\n end l_\\n return\\n\\nmethod rot13(input) public static signals IllegalArgumentException\\n\\n return caesar(input, 13, isFalse)\\n\\nmethod caesar(input = Rexx, idx = int, caps = boolean) public static signals IllegalArgumentException\\n\\n if idx < 1 | idx > 25 then signal IllegalArgumentException()\\n\\n -- 12345678901234567890123456\\n itab = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\\n shift = itab.length - idx\\n parse itab tl +(shift) tr\\n otab = tr || tl\\n\\n if caps then input = input.upper\\n\\n cipher = input.translate(itab || itab.lower, otab || otab.lower)\\n\\n return cipher\\n\\nmethod caesar_encipher(input = Rexx, idx = int, caps = boolean) public static signals IllegalArgumentException\\n\\n return caesar(input, idx, caps)\\n\\nmethod caesar_decipher(input = Rexx, idx = int, caps = boolean) public static signals IllegalArgumentException\\n\\n return caesar(input, int(26) - idx, isFalse)\\n\\nmethod caesar_encipher(input = Rexx, idx = int) public static signals IllegalArgumentException\\n\\n return caesar(input, idx, isFalse)\\n\\nmethod caesar_decipher(input = Rexx, idx = int) public static signals IllegalArgumentException\\n\\n return caesar(input, int(26) - idx, isFalse)\\n\\nmethod caesar_encipher(input = Rexx, idx = int, opt = Rexx) public static signals IllegalArgumentException\\n\\n return caesar(input, idx, opt)\\n\\nmethod caesar_decipher(input = Rexx, idx = int, opt = Rexx) public static signals IllegalArgumentException\\n\\n return caesar(input, int(26) - idx, opt)\\n\\nmethod caesar(input = Rexx, idx = int, opt = Rexx) public static signals IllegalArgumentException\\n\\n if opt.upper.abbrev('U') >= 1 then caps = isTrue\\n else caps = isFalse\\n\\n return caesar(input, idx, caps)\\n\\nmethod caesar(input = Rexx, idx = int) public static signals IllegalArgumentException\\n\\n return caesar(input, idx, isFalse)\\n\\nmethod isTrue public static returns boolean\\n return (1 == 1)\\n\\nmethod isFalse public static returns boolean\\n return \\\\isTrue\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"(define (rot13 str)\\n (join\\n (map\\n (fn(c)\\n (cond\\n ((<= \\\"A\\\" (upper-case c) \\\"M\\\") (char (+ (char c) 13)))\\n ((<= \\\"N\\\" (upper-case c) \\\"Z\\\") (char (- (char c) 13)))\\n (true c)))\\n (explode str))))\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"import strutils\\n\\nproc rot13(c: char): char =\\n case toLowerAscii(c)\\n of 'a'..'m': chr(ord(c) + 13)\\n of 'n'..'z': chr(ord(c) - 13)\\n else: c\\n\\nfor line in stdin.lines:\\n for c in line:\\n stdout.write rot13(c)\\n stdout.write \\\"\\\\n\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"bundle Default {\\n class Rot13 {\\n function : Main(args : String[]) ~ Nil {\\n Rot13(\\\"nowhere ABJURER\\\")->PrintLine();\\n }\\n\\n function : native : Rot13(text : String) ~ String {\\n rot := \\\"\\\";\\n each(i : text) {\\n c := text->Get(i);\\n if(c >= 'a' & c <= 'm' | c >= 'A' & c <= 'M') {\\n rot->Append(c + 13);\\n }\\n else if(c >= 'n' & c <= 'z' | c >= 'N' & c <= 'Z') {\\n rot->Append(c - 13);\\n }\\n else {\\n rot->Append(c);\\n };\\n };\\n\\n return rot;\\n }\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"let rot13 c = match c with\\n | 'A'..'M' | 'a'..'m' -> char_of_int (int_of_char c + 13)\\n | 'N'..'Z' | 'n'..'z' -> char_of_int (int_of_char c - 13)\\n | _ -> c\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let rot13_str s =\\n let len = String.length s in\\n let result = String.create len in\\n for i = 0 to len - 1 do\\n result.[i] <- rot13 s.[i]\\n done;\\n result\\n\\n(* or in OCaml 4.00+:\\n let rot13_str = String.map rot13\\n*)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let () =\\n try while true do\\n String.iter (fun c -> print_char (rot13 c)) (read_line());\\n print_newline()\\n done with End_of_file -> ()\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \": encryptRot13(c)\\n c dup isLetter ifFalse: [ return ]\\n isUpper ifTrue: [ 'A' ] else: [ 'a' ] c 13 + over - 26 mod + ;\\n\\n: rot13 map(#encryptRot13) charsAsString ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"(import (scheme char))\\n\\n(define (rot13 str)\\n (runes->string (map (lambda (ch)\\n (+ ch (cond\\n ((char-ci<=? #\\\\a ch #\\\\m)\\n 13)\\n ((char-ci<=? #\\\\n ch #\\\\z)\\n -13)\\n (else 0))))\\n (string->runes str))))\\n\\n(define str \\\"`What a curious feeling!' said Alice; `I must be shutting up like a telescope.'\\\")\\n(print (rot13 str))\\n(print (rot13 (rot13 str)))\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"declare\\n fun {RotChar C}\\n if C >= &A andthen C =< &Z then &A + (C - &A + 13) mod 26\\n elseif C >= &a andthen C =< &z then &a + (C - &a + 13) mod 26\\n else C\\n end\\n end\\n\\n fun {Rot13 S}\\n {Map S RotChar}\\n end\\nin\\n {System.showInfo {Rot13 \\\"NOWHERE Abjurer 42\\\"}}\\n {System.showInfo {Rot13 {Rot13 \\\"NOWHERE Abjurer 42\\\"}}}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"rot13(s)={\\n s=Vecsmall(s);\\n for(i=1,#s,\\n if(s[i]>109&s[i]<123,s[i]-=13,if(s[i]<110&s[i]>96,s[i]+=13,if(s[i]>77&s[i]<91,s[i]-=13,if(s[i]<78&s[i]>64,s[i]+=13))))\\n );\\n Strchr(s)\\n};\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"program rot13;\\n\\nvar\\n line: string;\\n\\n function rot13(someText: string): string;\\n\\n var\\n i: integer;\\n ch: char;\\n result: string;\\n\\n begin\\n result := '';\\n for i := 1 to Length(someText) do\\n begin\\n ch := someText[i];\\n case ch of\\n 'A' .. 'M', 'a' .. 'm':\\n ch := chr(ord(ch)+13);\\n 'N' .. 'Z', 'n' .. 'z':\\n ch := chr(ord(ch)-13);\\n end;\\n result := result + ch;\\n end;\\n rot13 := result;\\n end;\\n\\nbegin\\n while not eof(input) do\\n begin\\n readln(line);\\n writeln(rot13(line));\\n end;\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"sub rot13 {\\n shift =~ tr/A-Za-z/N-ZA-Mn-za-m/r;\\n}\\n\\nprint rot13($_) while (<>);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"perl -pe 'tr/A-Za-z/N-ZA-Mn-za-m/'\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">rot13</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">ch</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">upper</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #008000;\\\">'A'</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #008000;\\\">'Z'</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #008000;\\\">'M'</span><span style=\\\"color: #0000FF;\\\">,+</span><span style=\\\"color: #000000;\\\">13</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">13</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">s</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">rot13</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"abjurer NOWHERE.\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"echo str_rot13('foo'), \\\"\\\\n\\\";\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"<?php\\nfunction rot13($s) {\\n return strtr($s, 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz',\\n 'NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm');\\n}\\n\\necho rot13('foo'), \\\"\\\\n\\\";\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"go =>\\n S = \\\"Big fjords vex quick waltz nymph!\\\",\\n println(S),\\n println(rot13(S)),\\n println(rot13(rot13(S))),\\n nl.\\n\\n% Rot 13 using a map\\nrot13(S) = S2 =>\\n lower(Lower),\\n upper(Upper),\\n M = create_map(Lower, Upper),\\n % If a char is not in a..zA..z then show it as it is.\\n S2 := [M.get(C,C) : C in S].\\n\\ncreate_map(Lower, Upper) = M =>\\n M = new_map(),\\n Len = Lower.length,\\n LDiv := Lower.length div 2,\\n foreach(I in 1..Len)\\n II = (LDiv+I) mod Len,\\n if II == 0 then II := Len end,\\n M.put(Upper[I],Upper[II]),\\n M.put(Lower[I],Lower[II])\\n end.\\n\\nlower(\\\"abcdefghijklmnopqrstuvwxyz\\\").\\nupper(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\").\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de rot13-Ch (C)\\n (if\\n (or\\n (member C '`(apply circ (chop \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\")))\\n (member C '`(apply circ (chop \\\"abcdefghijklmnopqrstuvwxyz\\\"))) )\\n (get @ 14)\\n C ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"(de rot13-Ch (C)\\n (cond\\n ((>= \\\"M\\\" (uppc C) \\\"A\\\")\\n (char (+ (char C) 13)) )\\n ((>= \\\"Z\\\" (uppc C) \\\"N\\\")\\n (char (- (char C) 13)) )\\n (T C) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"(de rot13-stdIn ()\\n (while (line)\\n (prinl (mapcar rot13-Ch @)) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"import Crypto;\\n\\nint main(){\\n string r = rot13(\\\"Hello, World\\\");\\n write(r + \\\"\\\\n\\\");\\n}\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"rotate: procedure (in) options (main); /* 2 March 2011 */\\n declare in character (100) varying;\\n declare line character (500) varying;\\n declare input file;\\n\\n open file (input) title ('/' || in || ',type(text),recsize(500)' );\\n\\n on endfile (input) stop;\\n\\n do forever;\\n get file (input) edit (line) (L);\\n line = translate (\\n line, 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz',\\n 'NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm');\\n put edit (line) (a); put skip;\\n end;\\nend;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"rot13_test:\\n procedure options(main);\\n\\n %replace\\n true by '1'b,\\n false by '0'b;\\n\\n dcl (plain, encoded) char(127) varying;\\n\\n plain = 'The quick brown fox jumps over the lazy red dog.';\\n put skip list ('Plain text:', plain);\\n encoded = rot13(plain);\\n put skip list ('Encoded :', encoded);\\n put skip list ('Restored :', rot13(encoded));\\n\\n stop;\\n\\nrot13:\\n procedure (s) returns (char(127) varying);\\n dcl\\n s char(127) varying,\\n ch char(1),\\n i fixed bin(15);\\n do i = 1 to length(s);\\n ch = substr(s,i,1);\\n if (isalpha(ch)) then\\n do;\\n if (toupper(ch) > 'M') then\\n ch = ascii(rank(ch) - 13);\\n else\\n ch = ascii(rank(ch) + 13);\\n end;\\n substr(s,i,1) = ch;\\n end;\\n return (s);\\n end rot13;\\n\\ntoupper:\\n procedure (ch) returns (char(1));\\n dcl ch char(1);\\n dcl cout char(1);\\n if ((ch >= 'a') & (ch <= 'z')) then\\n cout = ascii(rank(ch) - 32);\\n else\\n cout = ch;\\n return (cout);\\n end toupper;\\n\\nisalpha:\\n procedure (ch) returns (bit(1));\\n dcl ch char(1);\\n if (((ch >= 'A') & (ch <= 'Z')) |\\n ((ch >= 'a') & (ch <= 'z'))) then\\n return (true);\\n else\\n return (false);\\n end isalpha;\\n\\n\\nend rot13_test;\\n\",\n \"language\": \"PL-I-80\"\n },\n {\n \"code\": \"-- Works for VARCHAR2 (up to 32k chars)\\nCREATE OR REPLACE FUNCTION fn_rot13_native(p_text VARCHAR2) RETURN VARCHAR2 IS\\n c_source CONSTANT VARCHAR2(52) := 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz';\\n c_target CONSTANT VARCHAR2(52) := 'NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm';\\nBEGIN\\n RETURN TRANSLATE(p_text, c_source, c_target);\\nEND;\\n/\\n\\n-- For CLOBs (translate only works with VARCHAR2, so do it in chunks)\\nCREATE OR REPLACE FUNCTION fn_rot13_clob(p_text CLOB) RETURN CLOB IS\\n c_source CONSTANT VARCHAR2(52) := 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz';\\n c_target CONSTANT VARCHAR2(52) := 'NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm';\\n c_chunk_size CONSTANT PLS_INTEGER := 4000;\\n v_result CLOB := NULL;\\nBEGIN\\n FOR i IN 0..TRUNC(LENGTH(p_text) / c_chunk_size) LOOP\\n v_result := v_result ||\\n TRANSLATE(dbms_lob.substr(p_text, c_chunk_size, i * c_chunk_size + 1), c_source, c_target);\\n END LOOP;\\n RETURN v_result;\\nEND;\\n/\\n\\n-- The full algorithm (Slower. And MUCH slower if using CLOB!)\\nCREATE OR REPLACE FUNCTION fn_rot13_algorithm(p_text VARCHAR2) RETURN CLOB IS\\n c_upper_a CONSTANT PLS_INTEGER := ASCII('A');\\n c_lower_a CONSTANT PLS_INTEGER := ASCII('a');\\n v_rot VARCHAR2(32000);\\n v_char VARCHAR2(1);\\nBEGIN\\n FOR i IN 1..LENGTH(p_text) LOOP\\n v_char := SUBSTR(p_text, i, 1);\\n IF v_char BETWEEN 'A' AND 'Z' THEN\\n v_rot := v_rot || CHR(MOD(ASCII(v_char) - c_upper_a + 13, 26) + c_upper_a);\\n ELSIF v_char BETWEEN 'a' AND 'z' THEN\\n v_rot := v_rot || CHR(MOD(ASCII(v_char) - c_lower_a + 13, 26) + c_lower_a);\\n ELSE\\n v_rot := v_rot || v_char;\\n END IF;\\n END LOOP;\\n RETURN v_rot;\\nEND;\\n/\\n\",\n \"language\": \"PL-SQL\"\n },\n {\n \"code\": \"define rot13(s);\\n lvars j, c;\\n for j from 1 to length(s) do\\n s(j) -> c;\\n if `A` <= c and c <= `M` or `a` <= c and c <= `m` then\\n c + 13 -> s(j);\\n elseif `N` <= c and c <= `Z` or `n` <= c and c <= `z` then\\n c - 13 -> s(j);\\n endif;\\n endfor;\\n s;\\nenddefine;\\n\\nrot13('NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm') =>\\n\",\n \"language\": \"Pop11\"\n },\n {\n \"code\": \"/r13 {\\n4 dict begin\\n /rotc {\\n {\\n {{{64 gt} {91 lt}} all?} {65 - 13 + 26 mod 65 +} is?\\n {{{95 gt} {123 lt}} all?} {97 - 13 + 26 mod 97 +} is?\\n } cond\\n }.\\n {rotc} map cvstr\\nend}.\\n\",\n \"language\": \"PostScript\"\n },\n {\n \"code\": \"#COMPILE EXE\\n#COMPILER PBWIN 9.05\\n#DIM ALL\\n\\nFUNCTION ROT13(BYVAL a AS STRING) AS STRING\\n LOCAL p AS BYTE PTR\\n LOCAL n AS BYTE, e AS BYTE\\n LOCAL res AS STRING\\n\\n res = a\\n p = STRPTR(res)\\n n = @p\\n DO WHILE n\\n SELECT CASE n\\n CASE 65 TO 90\\n e = 90\\n n += 13\\n CASE 97 TO 122\\n e = 122\\n n += 13\\n CASE ELSE\\n e = 255\\n END SELECT\\n\\n IF n > e THEN\\n n -= 26\\n END IF\\n @p = n\\n INCR p\\n n = @p\\n LOOP\\nFUNCTION = res\\nEND FUNCTION\\n\\n'testing:\\n\\nFUNCTION PBMAIN () AS LONG\\n#DEBUG PRINT ROT13(\\\"abc\\\")\\n#DEBUG PRINT ROT13(\\\"nop\\\")\\nEND FUNCTION\\n\",\n \"language\": \"PowerBASIC\"\n },\n {\n \"code\": \"$e = \\\"This is a test Guvf vf n grfg\\\"\\n\\n[char[]](0..64+78..90+65..77+91..96+110..122+97..109+123..255)[[char[]]$e] -join \\\"\\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"function Invoke-Rot13 {\\n param(\\n [char[]]$message\\n )\\n begin {\\n $outString = New-Object System.Collections.ArrayList\\n $alpha = 'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'\\n $alphaL = $alpha + $alpha\\n $alphaU = $alphaL.toUpper()\\n $int = 13\\n }\\n process{\\n $message | ForEach-Object {\\n # test if char is special\\n if ($_ -match '[^\\\\p{L}\\\\p{Nd}]') {\\n $outString += $_\\n }\\n # test if char is digit\\n elseif ($_ -match '\\\\d') {\\n $outString += $_\\n }\\n # test if char is upperCase\\n elseif ($_ -ceq $_.ToString().ToUpper()) {\\n $charIndex = $alphaU.IndexOf($_.tostring())\\n $outString += $alphaU[$charIndex+$int]\\n }\\n # test if char is lowerCase\\n elseif ($_ -ceq $_.ToString().ToLower()) {\\n $charIndex = $alphaL.IndexOf($_.tostring())\\n $outString += $alphaL[$charIndex+$int]\\n }\\n else {\\n $outString += $_\\n }\\n } # end foreach\\n } # end process\\n end {\\n # output string and join all chars\\n $outString -join \\\"\\\"\\n }\\n} # end function\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"PS> $message = '{!This is /A\\\\ Test123}'\\nPS> $messageE = Invoke-Rot13 -message $message\\nPS> $messageE\\nPS> Invoke-Rot13 -message $messageE\\n{!Guvf vf /N\\\\ Grfg123}\\n{!This is /A\\\\ Test123}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \":- use_module(library(ctypes)).\\n\\nruntime_entry(start) :-\\n\\tprompt(_, ''),\\n\\trot13.\\n\\nrot13 :-\\n\\tget0(Ch),\\n\\t( is_endfile(Ch) ->\\n\\t\\ttrue\\n\\t; rot13_char(Ch, Rot),\\n\\t put(Rot),\\n\\t rot13\\n\\t).\\n\\nrot13_char(Ch, Rot) :-\\n\\t( is_alpha(Ch) ->\\n\\t\\tto_upper(Ch, Up),\\n\\t\\tLetter is Up - 0'A,\\n\\t\\tRot is Ch + ((Letter + 13) mod 26) - Letter\\n\\t; Rot = Ch\\n\\t).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"rot13(Str, SR) :-\\n\\tmaplist(rot, Str, Str1),\\n\\tstring_to_list(SR, Str1).\\n\\nrot(C, C1) :-\\n\\t( member(C, \\\"abcdefghijklmABCDEFGHIJKLM\\\") -> C1 is C+13;\\n\\t (\\tmember(C, \\\"nopqrstuvwxyzNOPQRSTUVWXYZ\\\") -> C1 is C-13; C1 = C)).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \" ?- rot13(\\\"The Quick Brown Fox Jumped Over The Lazy Dog!\\\", SR).\\nSR = \\\"Gur Dhvpx Oebja Sbk Whzcrq Bire Gur Ynml Qbt!\\\".\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Declare.s Rot13(text_to_code.s)\\n\\nIf OpenConsole()\\n Define txt$\\n\\n Print(\\\"Enter a string to encode: \\\"): txt$=Input()\\n\\n PrintN(\\\"Coded : \\\"+Rot13(txt$))\\n PrintN(\\\"Decoded: \\\"+Rot13(Rot13(txt$)))\\n\\n Print(\\\"Press ENTER to quit.\\\"): Input()\\n CloseConsole()\\nEndIf\\n\\nProcedure.s Rot13(s.s)\\n Protected.i i\\n Protected.s t, u\\n For i=1 To Len(s)\\n t=Mid(s,i,1)\\n Select Asc(t)\\n Case Asc(\\\"a\\\") To Asc(\\\"m\\\"), Asc(\\\"A\\\") To Asc(\\\"M\\\")\\n t=chr(Asc(t)+13)\\n Case Asc(\\\"n\\\") To Asc(\\\"z\\\"), Asc(\\\"N\\\") To Asc(\\\"Z\\\")\\n t=chr(Asc(t)-13)\\n EndSelect\\n u+t\\n Next\\n ProcedureReturn u\\nEndProcedure\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \">>> u'foo'.encode('rot13')\\n'sbb'\\n>>> 'sbb'.decode('rot13')\\nu'foo'\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \">>> import codecs\\n>>> codecs.encode(\\\"The quick brown fox jumps over the lazy dog\\\", \\\"rot13\\\")\\n'Gur dhvpx oebja sbk whzcf bire gur ynml qbt'\\n>>> codecs.decode(_, \\\"rot13\\\")\\n'The quick brown fox jumps over the lazy dog'\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#!/usr/bin/env python\\nimport string\\n\\nTRANSLATION_TABLE = str.maketrans(\\n string.ascii_uppercase + string.ascii_lowercase,\\n string.ascii_uppercase[13:] + string.ascii_uppercase[:13] +\\n string.ascii_lowercase[13:] + string.ascii_lowercase[:13]\\n)\\n\\n\\ndef rot13(s):\\n \\\"\\\"\\\"Return the rot-13 encoding of s.\\\"\\\"\\\"\\n return s.translate(TRANSLATION_TABLE)\\n\\n\\nif __name__ == \\\"__main__\\\":\\n \\\"\\\"\\\"rot-13 encode the input files, or stdin if no files are provided.\\\"\\\"\\\"\\n import fileinput\\n for line in fileinput.input():\\n print(rot13(line), end=\\\"\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#!/usr/bin/env python\\nfrom __future__ import print_function\\nimport string\\nlets = string.ascii_lowercase\\nkey = {x:y for (x,y) in zip(lets[13:]+lets[:14], lets)}\\nkey.update({x.upper():key[x].upper() for x in key.keys()})\\nencode = lambda x: ''.join((key.get(c,c) for c in x))\\nif __name__ == '__main__':\\n \\\"\\\"\\\"Peform line-by-line rot-13 encoding on any files listed on our\\n command line or act as a standard UNIX filter (if no arguments\\n specified).\\n \\\"\\\"\\\"\\n import fileinput\\n for line in fileinput.input():\\n print(encode(line), end=\\\"\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"INPUT \\\"Enter a string: \\\", a$\\nPRINT rot13$(a$)\\nFUNCTION rot13$ (stg$)\\n inlist$ = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\"\\n outlist$ = \\\"NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm\\\"\\n FOR n = 1 TO LEN(stg$)\\n letter$ = MID$(stg$, n, 1)\\n letpos = INSTR(inlist$, letter$)\\n IF letpos = 0 THEN\\n rotated$ = letter$\\n ELSE\\n rotated$ = MID$(outlist$, letpos, 1)\\n END IF\\n rot13$ = rot13$ + rotated$\\n NEXT\\nEND FUNCTION\\n\",\n \"language\": \"QB64\"\n },\n {\n \"code\": \"[ $ \\\"\\\" swap\\n witheach\\n [ dup char A char M 1+ within\\n over char a char m 1+ within or\\n iff [ 13 + ]\\n else\\n [ dup char N char Z 1+ within\\n over char n char z 1+ within or\\n if [ 13 - ] ]\\n join ] ] is rot-13 ( $ --> $ )\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"rot13 <- function(x)\\n{\\n old <- paste(letters, LETTERS, collapse=\\\"\\\", sep=\\\"\\\")\\n new <- paste(substr(old, 27, 52), substr(old, 1, 26), sep=\\\"\\\")\\n chartr(old, new, x)\\n}\\nx <- \\\"The Quick Brown Fox Jumps Over The Lazy Dog!.,:;'#~[]{}\\\"\\nrot13(x) # \\\"Gur Dhvpx Oebja Sbk Whzcf Bire Gur Ynml Qbt!.,:;'#~[]{}\\\"\\nx2 <- paste(letters, LETTERS, collapse=\\\"\\\", sep=\\\"\\\")\\nrot13(x2) # \\\"nNoOpPqQrRsStTuUvVwWxXyYzZaAbBcCdDeEfFgGhHiIjJkKlLmM\\\"\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#!/usr/bin/env racket\\n#lang racket/base\\n\\n(define (run i o)\\n (for ([ch (in-producer regexp-match #f #rx#\\\"[a-zA-Z]\\\" i 0 #f o)])\\n (define b (bytes-ref (car ch) 0))\\n (define a (if (< b 96) 65 97))\\n (write-byte (+ (modulo (+ 13 (- b a)) 26) a))))\\n\\n(require racket/cmdline)\\n(command-line\\n #:help-labels \\\"(\\\\\\\"-\\\\\\\" specifies standard input)\\\"\\n #:args files\\n (for ([f (if (null? files) '(\\\"-\\\") files)])\\n (if (equal? f \\\"-\\\")\\n (run (current-input-port) (current-output-port))\\n (call-with-input-file f (λ(i) (run i (current-output-port)))))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my @abc = 'a'..'z';\\nmy $abc = [@abc».uc, @abc];\\nput .trans: $abc => $abc».rotate(13) for lines\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"$ raku -pe '.=trans: {$_ => $_».rotate(13)}({[$_».uc, @$_]}(\\\"a\\\"..\\\"z\\\"))'\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"function ROT13 (InputTxt as string) as string\\n dim i as integer, ascVal as byte\\n Result = \\\"\\\"\\n\\n for i = 1 to len(InputTxt)\\n ascVal = asc(InputTxt[i])\\n\\n select case ascVal\\n case 65 to 77, 97 to 109\\n Result = Result + chr$(ascVal + 13)\\n case 78 to 90, 110 to 122\\n Result = Result + chr$(ascVal - 13)\\n case else\\n Result = Result + chr$(ascVal)\\n end select\\n next\\nend function\\n\\nInput \\\"Text to encode: \\\"; a$\\nPrint ROT13(a$)\\nInput \\\"Press a key to end...\\\"; a$\\n\",\n \"language\": \"RapidQ\"\n },\n {\n \"code\": \"define rot13 use $str\\n $str each chr\\n dup m/[A-Ma-m]/ if\\n ord 13 + chr\\n else\\n dup m/[N-Zn-z]/ if\\n ord 13 - chr\\n $str length list \\\"\\\" join\\n\\n\\\"12!ABJURER nowhere\\\"\\ndup print \\\"\\\\nas rot13 is\\\\n\\\" print\\nrot13\\nprint \\\"\\\\n\\\" print\\n\",\n \"language\": \"Raven\"\n },\n {\n \"code\": \"REBOL [\\n Title: \\\"Rot-13\\\"\\n URL: http://rosettacode.org/wiki/Rot-13\\n]\\n\\n; Test data has upper and lower case characters as well as characters\\n; that should not be transformed, like numbers, spaces and symbols.\\n\\ntext: \\\"This is a 28-character test!\\\"\\n\\nprint \\\"Using cipher table:\\\"\\n\\n; I build a set of correspondence lists here. 'x' is the letters from\\n; A-Z, in both upper and lowercase form. Note that REBOL can iterate\\n; directly over the alphabetic character sequence in the for loop. 'y'\\n; is the cipher form, 'x' rotated by 26 characters (remember, I have\\n; the lower and uppercase forms together). 'r' holds the final result,\\n; built as I iterate across the 'text' string. I search for the\\n; current character in the plaintext list ('x'), if I find it, I get\\n; the corresponding character from the ciphertext list\\n; ('y'). Otherwise, I pass the character through untransformed, then\\n; return the final string.\\n\\nrot-13: func [\\n\\t\\\"Encrypt or decrypt rot-13 with tables.\\\"\\n\\ttext [string!] \\\"Text to en/decrypt.\\\"\\n\\t/local x y r i c\\n] [\\n\\tx: copy \\\"\\\" for i #\\\"a\\\" #\\\"z\\\" 1 [append x rejoin [i uppercase i]]\\n\\ty: rejoin [copy skip x 26 copy/part x 26]\\n\\tr: copy \\\"\\\"\\n\\n\\trepeat i text [append r either c: find/case x i [y/(index? c)][i]]\\n\\tr\\n]\\n\\n; Note that I am setting the 'text' variable to the result of rot-13\\n; so I can reuse it again on the next call. The rot-13 algorithm is\\n; reversible, so I can just run it again without modification to decrypt.\\n\\nprint [\\\" Encrypted:\\\" text: rot-13 text]\\nprint [\\\" Decrypted:\\\" text: rot-13 text]\\n\\n\\nprint \\\"Using parse:\\\"\\n\\nclamp: func [\\n\\t\\\"Contain a value within two enclosing values. Wraps if necessary.\\\"\\n\\tx v y\\n][\\n\\tx: to-integer x v: to-integer v y: to-integer y\\n\\tcase [v < x [y - v] v > y [v - y + x - 1] true v]\\n]\\n\\n; I'm using REBOL's 'parse' word here. I set up character sets for\\n; upper and lower-case letters, then let parse walk across the\\n; text. It looks for matches to upper-case letters, then lower-case,\\n; then skips to the next one if it can't find either. If a matching\\n; character is found, it's mathematically incremented by 13 and\\n; clamped to the appropriate character range. parse changes the\\n; character in place in the string, hence this is a destructive\\n; operation.\\n\\nrot-13: func [\\n\\t\\\"Encrypt or decrypt rot-13 with parse.\\\"\\n\\ttext [string!] \\\"Text to en/decrypt. Note: Destructive!\\\"\\n] [\\n\\tu: charset [#\\\"A\\\" - #\\\"Z\\\"]\\n\\tl: charset [#\\\"a\\\" - #\\\"z\\\"]\\n\\n\\tparse text [some [\\n\\t\\t\\ti: ; Current position.\\n\\t\\t\\tu (i/1: to-char clamp #\\\"A\\\" i/1 + 13 #\\\"Z\\\") | ; Upper case.\\n\\t\\t\\tl (i/1: to-char clamp #\\\"a\\\" i/1 + 13 #\\\"z\\\") | ; Lower case.\\n\\t\\t\\tskip]] ; Ignore others.\\n\\ttext\\n]\\n\\n; As you see, I don't need to re-assign 'text' anymore.\\n\\nprint [\\\" Encrypted:\\\" rot-13 text]\\nprint [\\\" Decrypted:\\\" rot-13 text]\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \"{{\\n : rotate ( cb-c ) tuck - 13 + 26 mod + ;\\n : rotate? ( c-c )\\n dup 'a 'z within [ 'a rotate ] ifTrue\\n dup 'A 'Z within [ 'A rotate ] ifTrue ;\\n---reveal---\\n : rot13 ( s-s ) dup [ [ @ rotate? ] sip ! ] ^types'STRING each@ ;\\n}}\\n\\n\\\"abcdef123GHIJKL\\\" rot13 dup puts cr rot13 puts\\n\\\"abjurer NOWHERE\\\" rot13 puts\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"/*REXX program encodes several example text strings using the ROT-13 algorithm. */\\n$='foo' ; say \\\"simple text=\\\" $; say 'rot-13 text=' rot13($); say\\n$='bar' ; say \\\"simple text=\\\" $; say 'rot-13 text=' rot13($); say\\n$=\\\"Noyr jnf V, 'rer V fnj Ryon.\\\"; say \\\"simple text=\\\" $; say 'rot-13 text=' rot13($); say\\n$='abc? ABC!' ; say \\\"simple text=\\\" $; say 'rot-13 text=' rot13($); say\\n$='abjurer NOWHERE' ; say \\\"simple text=\\\" $; say 'rot-13 text=' rot13($); say\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nrot13: return translate( arg(1), 'abcdefghijklmABCDEFGHIJKLMnopqrstuvwxyzNOPQRSTUVWXYZ',,\\n \\\"nopqrstuvwxyzNOPQRSTUVWXYZabcdefghijklmABCDEFGHIJKLM\\\")\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"see \\\"enter a string : \\\" give s\\nans = \\\"\\\"\\nfor a = 1 to len(s)\\n letter = substr(s, a, 1)\\n if letter >= \\\"a\\\" and letter <= \\\"z\\\"\\n char = char(ascii(letter) + 13)\\n if char > \\\"z\\\" char = chr(asc(char) - 26) ok\\n else\\n if letter >= \\\"a\\\" and letter <= \\\"z\\\" char = char(ascii(letter) + 13) ok\\n if char > \\\"z\\\" char = char(ascii(char) - 26) else char = letter ok\\n ok\\n ans = ans + char\\nnext\\nsee ans + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"# Returns a copy of _s_ with rot13 encoding.\\ndef rot13(s)\\n s.tr('A-Za-z', 'N-ZA-Mn-za-m')\\nend\\n\\n# Perform rot13 on files from command line, or standard input.\\nwhile line = ARGF.gets\\n print rot13(line)\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"INPUT \\\"Enter a string: \\\"; s$\\nans$ = \\\"\\\"\\nFOR a = 1 TO LEN(s$)\\n letter$ = MID$(s$, a, 1)\\n IF letter$ >= \\\"A\\\" AND letter$ <= \\\"Z\\\" THEN\\n char$ = CHR$(ASC(letter$) + 13)\\n IF char$ > \\\"Z\\\" THEN char$ = CHR$(ASC(char$) - 26)\\n else\\n if letter$ >= \\\"a\\\" AND letter$ <= \\\"z\\\" THEN char$ = CHR$(ASC(letter$) + 13)\\n IF char$ > \\\"z\\\" THEN char$ = CHR$(ASC(char$) - 26) ELSE char$ = letter$\\n END IF\\n ans$ = ans$ + char$\\nNEXT a\\nPRINT ans$\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"fn rot13(string: &str) -> String {\\n string.chars().map(|c| {\\n match c {\\n 'a'..='m' | 'A'..='M' => ((c as u8) + 13) as char,\\n 'n'..='z' | 'N'..='Z' => ((c as u8) - 13) as char,\\n _ => c\\n }\\n }).collect()\\n}\\n\\nfn main () {\\n assert_eq!(rot13(\\\"abc\\\"), \\\"nop\\\");\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"comment\\n Return the rot13 transformation of s, preserving case and\\n passing non-alphabetic characters without change\\nend\\n\\nfunction rot13(s = string) = string\\n var i, k = integer\\n var ch = char\\n var normal, rotated = string\\n normal = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\"\\n rotated = \\\"NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm\\\"\\n for i = 1 to len(s)\\n ch = mid(s,i,1)\\n k = instr(1,normal,ch)\\n if k <> 0 then ch = mid(rotated,k,1)\\n mid(s,i,1) = ch\\n next i\\nend = s\\n\\nrem - exercise the function\\n\\nvar plain, encoded = string\\n\\nplain = \\\"The quick brown fox jumps over the lazy red dog.\\\"\\nencoded = rot13(plain)\\nprint \\\"Plain text: \\\"; plain\\nprint \\\"Encoded : \\\"; encoded\\nprint \\\"Decoded : \\\"; rot13(encoded)\\n\\nend\\n\",\n \"language\": \"S-BASIC\"\n },\n {\n \"code\": \"variable old = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\";\\nvariable new = \\\"NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm\\\";\\n\\ndefine rot13(s) {\\n s = strtrans(s, old, new);\\n return s;\\n}\\n\\ndefine rot13_stream(s) {\\n variable ln;\\n while (-1 != fgets(&ln, s))\\n fputs(rot13(ln), stdout);\\n}\\n\\nif (__argc > 1) {\\n variable arg, fp;\\n foreach arg (__argv[[1:]]) {\\n fp = fopen(arg, \\\"r\\\");\\n rot13_stream(fp);\\n }\\n}\\nelse\\n rot13_stream(stdin);\\n\",\n \"language\": \"S-lang\"\n },\n {\n \"code\": \"scala> def rot13(s: String) = s map {\\n | case c if 'a' <= c.toLower && c.toLower <= 'm' => c + 13 toChar\\n | case c if 'n' <= c.toLower && c.toLower <= 'z' => c - 13 toChar\\n | case c => c\\n | }\\nrot13: (s: String)String\\n\\nscala> rot13(\\\"7 Cities of Gold.\\\")\\nres61: String = 7 Pvgvrf bs Tbyq.\\n\\nscala> rot13(res61)\\nres62: String = 7 Cities of Gold.\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (rot13 str)\\n (define (rot13-char c)\\n (integer->char (+ (char->integer c)\\n (cond ((and (char>=? c #\\\\a) (char<? c #\\\\n))\\n 13)\\n ((and (char>=? c #\\\\A) (char<? c #\\\\N))\\n 13)\\n ((and (char>=? c #\\\\n) (char<=? c #\\\\z))\\n -13)\\n ((and (char>=? c #\\\\N) (char<=? c #\\\\Z))\\n -13)\\n (else\\n 0)))))\\n (list->string (map rot13-char (string->list str))))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \";; Works with: chibi, csi, gosh, gsi, guile\\n(cond-expand\\n (r7rs (import (scheme base)\\n (scheme write)))\\n (gambit)\\n (chicken (import (r7rs))))\\n\\n(define char-rot13\\n (let* ((A (char->integer #\\\\A))\\n (N (char->integer #\\\\N))\\n (Z (char->integer #\\\\Z))\\n (a (char->integer #\\\\a))\\n (n (char->integer #\\\\n))\\n (z (char->integer #\\\\z))\\n (inc 13)\\n (dec (- inc))\\n (rot (lambda (c direction)\\n (integer->char (+ c direction)))))\\n (lambda (ch)\\n (let ((c (char->integer ch)))\\n (if (>= c A)\\n (if (< c N)\\n (rot c inc)\\n (if (<= c Z)\\n (rot c dec)\\n (if (>= c a)\\n (if (< c n)\\n (rot c inc)\\n (if (<= c z)\\n (rot c dec)\\n ch))))))))))\\n\\n(define (string-rot13 str)\\n (string-map char-rot13 str))\\n\\n(if (not (and (string=? (string-rot13 \\\"abcdefghijklmnopqrstuvwxyz\\\")\\n \\\"nopqrstuvwxyzabcdefghijklm\\\")\\n (string=? (string-rot13 \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\")\\n \\\"NOPQRSTUVWXYZABCDEFGHIJKLM\\\")))\\n (error \\\"Test failed.\\\"))\\n\\n(let loop ((line (read-line)))\\n (if (string? line)\\n (begin\\n (display (string-rot13 line))\\n (newline)\\n (loop (read-line)))))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"y/abcdefghijklmnopqrstuvwxyz/nopqrstuvwxyzabcdefghijklm/\\ny/ABCDEFGHIJKLMNOPQRSTUVWXYZ/NOPQRSTUVWXYZABCDEFGHIJKLM/\\n\",\n \"language\": \"Sed\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst proc: main is func\\n local\\n var char: ch is ' ';\\n begin\\n ch := getc(IN);\\n while not eof(IN) do\\n if (ch >= 'a' and ch <= 'm') or (ch >= 'A' and ch <= 'M') then\\n ch := chr(ord(ch) + 13);\\n elsif (ch >= 'n' and ch <= 'z') or (ch >= 'N' and ch <= 'Z') then\\n ch := chr(ord(ch) - 13);\\n end if;\\n write(ch);\\n ch := getc(IN);\\n end while;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"# Returns a copy of 's' with rot13 encoding.\\nfunc rot13(s) {\\n s.tr('A-Za-z', 'N-ZA-Mn-za-m')\\n}\\n\\n# Perform rot13 on standard input.\\nSTDIN.each { |line| say rot13(line) }\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \" TEXT PROCEDURE ROT13(INP); TEXT INP;\\n BEGIN\\n\\n CHARACTER PROCEDURE ROT13CHAR(C); CHARACTER C;\\n ROT13CHAR :=\\n CHAR(\\n RANK(C) +\\n (IF C >= 'A' AND C <= 'M' THEN 13 ELSE\\n IF C >= 'a' AND C <= 'm' THEN 13 ELSE\\n IF C >= 'N' AND C <= 'Z' THEN -13 ELSE\\n IF C >= 'n' AND C <= 'z' THEN -13 ELSE 0));\\n\\n TEXT OUTP;\\n OUTP :- BLANKS(INP.LENGTH);\\n\\n INP.SETPOS(1);\\n WHILE INP.MORE DO\\n OUTP.PUTCHAR(ROT13CHAR(INP.GETCHAR));\\n\\n ROT13 :- OUTP;\\n END ROT13;\\n\",\n \"language\": \"Simula\"\n },\n {\n \"code\": \"#!/usr/local/bin/slate\\n\\nch@(String Character traits) rot13\\n[| value |\\n upper ::= ch isUppercase.\\n value := ch toLowercase as: Integer.\\n (value >= 97) /\\\\ [value < 110]\\n ifTrue: [value += 13]\\n ifFalse: [(value > 109) /\\\\ [value <= 122]\\n ifTrue: [value -= 13]].\\n upper\\n ifTrue: [(value as: String Character) toUppercase]\\n ifFalse: [value as: String Character]\\n].\\n\\nlobby define: #Rot13Encoder &parents: {Encoder}.\\n\\nc@(Rot13Encoder traits) convert\\n[\\n [c in isAtEnd] whileFalse: [c out nextPut: c in next rot13].\\n].\\n\\n(Rot13Encoder newFrom: Console reader to: Console writer) convert.\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"ch@(String Character traits) rot13\\n[| value |\\n upper ::= ch isUppercase.\\n value := ch toLowercase as: Integer.\\n (value >= 97) /\\\\ [value < 110]\\n ifTrue: [value += 13]\\n ifFalse: [(value > 109) /\\\\ [value <= 122]\\n ifTrue: [value -= 13]].\\n upper\\n ifTrue: [(value as: String Character) toUppercase]\\n ifFalse: [value as: String Character]\\n].\\n\\ns@(String traits) rot13\\n[\\n result ::= s newSameSize.\\n s doWithIndex: [| :each :index | result at: index put: each rot13].\\n result\\n].\\n\\nslate[37]> 'abc123' rot13.\\n'nop123'\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"(define rot-char-13 (lambda (ch)\\n (set! ch (string->rune ch))\\n (cond\\n (\\n (or\\n (and (>= ch (string->rune \\\"a\\\")) (<= ch (string->rune \\\"m\\\")))\\n (and (>= ch (string->rune \\\"A\\\")) (<= ch (string->rune \\\"M\\\"))))\\n (rune->string (+ ch 13)))\\n (\\n (or\\n (and (>= ch (string->rune \\\"n\\\")) (<= ch (string->rune \\\"z\\\")))\\n (and (>= ch (string->rune \\\"N\\\")) (<= ch (string->rune \\\"Z\\\"))))\\n (rune->string (- ch 13)))\\n (else (rune->string ch)))))\\n\\n(display (list->string (map rot-char-13 (string->list \\\"nowhere->ABJURER!\\\"))))\\n\",\n \"language\": \"Slope\"\n },\n {\n \"code\": \"\\\"1. simple approach\\\"\\nrot13 := [ :string |\\n string collect: [ :each | | index |\\n index := 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'\\n indexOf: each ifAbsent: [ 0 ]. \\\"Smalltalk uses 1-based indexing\\\"\\n index isZero\\n ifTrue: [ each ]\\n ifFalse: [ 'nopqrstuvwxyzabcdefghijklmNOPQRSTUVWXYZABCDEFGHIJKLM' at:\\n index ] ] ].\\n\\n(rot13 value: 'Test123') printNl \\\"gives 'Grfg123'\\\"\\n\\n\\\"2. extending built-in classes\\\"\\nCharacter extend [\\n + inc [\\n (inc isKindOf: Character)\\n ifTrue: [\\n ^ ( Character value: ((self asInteger) + (inc asInteger)) )\\n ] ifFalse: [\\n ^ ( Character value: ((self asInteger) + inc) )\\n ]\\n ]\\n - inc [\\n ^ ( self + (inc asInteger negated) )\\n ]\\n trFrom: map1 to: map2 [\\n (map1 includes: self) ifTrue: [\\n ^ map2 at: (map1 indexOf: self)\\n ] ifFalse: [ ^self ]\\n ]\\n].\\n\\nString extend [\\n rot: num [ |s|\\n s := String new.\\n self do: [ :c |\\n ((c asLowercase) between: $a and: $z)\\n\\t ifTrue: [ |c1|\\n c1 := ( $a + ((((c asLowercase) - $a + num) asInteger) rem:26)).\\n (c isLowercase) ifFalse: [ c1 := c1 asUppercase ].\\n s := s, (c1 asString)\\n ]\\n ifFalse: [\\n\\t s := s, (c asString)\\n ]\\n ].\\n ^s\\n ]\\n].\\n\\n('abcdefghijklmnopqrstuvwxyz123!' rot: 13) displayNl.\\n(('abcdefghijklmnopqrstuvwxyz123!' rot: 13) rot: 13) displayNl.\\n\\n\\n\\n\\\"2. using a 'translation'. Not very idiomatic Smalltalk code\\\"\\nrotThirteen := [ :s | |m1 m2 r|\\n r := String new.\\n m1 := OrderedCollection new.\\n 0 to: 25 do: [ :i | m1 add: ($a + i) ].\\n m2 := OrderedCollection new.\\n 0 to: 25 do: [ :i | m2 add: ($a + ((i+13) rem: 26)) ].\\n s do: [ :c |\\n (c between: $a and: $z) | (c between: $A and: $Z)\\n ifTrue: [ | a |\\n a := (c asLowercase) trFrom: m1 to: m2.\\n (c isUppercase) ifTrue: [ a := a asUppercase ].\\n r := r, (a asString)]\\n ifFalse: [ r := r, (c asString) ]\\n ].\\n r\\n].\\n\\n(rotThirteen value: 'abcdefghijklmnopqrstuvwxyz123!') displayNl.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"* # Function using replace( )\\n define('rot13(s)u1,u2,l1,l2') :(rot13_end)\\nrot13 &ucase len(13) . u1 rem . u2\\n &lcase len(13) . l1 rem . l2\\n rot13 = replace(s,&ucase &lcase,u2 u1 l2 l1) :(return)\\nrot13_end\\n\\n* # Function using pattern\\n define('rot13s(s)c')\\n alfa = &ucase &ucase &lcase &lcase :(rot13s_end)\\nrot13s s len(1) . c = :f(return)\\n alfa break(c) len(13) len(1) . c\\n rot13s = rot13s c :(rot13s)\\nrot13s_end\\n\\n* # Test and display both\\n str = rot13(\\\"I abjure the $19.99 trinket!\\\")\\n output = str; output = rot13(str)\\n str = rot13s(\\\"He's a real Nowhere Man.\\\")\\n output = str; output = rot13s(str)\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"#!/usr/local/bin/spar\\npragma annotate( summary, \\\"rot13\\\" );\\npragma annotate( description, \\\"Implement a 'rot-13' function (or procedure, class,\\\" );\\npragma annotate( description, \\\"subroutine, or other 'callable' object as appropriate\\\" );\\npragma annotate( description, \\\"to your programming environment). The definition of the\\\" );\\npragma annotate( description, \\\"rot-13 function is to simply replace every letter of the\\\" );\\npragma annotate( description, \\\"ASCII alphabet with the letter which is 'rotated' 13\\\" );\\npragma annotate( description, \\\"characters 'around' the 26 letter alphabet from its\\\" );\\npragma annotate( description, \\\"normal cardinal position (wrapping around from 'z' to\\\" );\\npragma annotate( description, \\\"'a' as necessary). Thus the letters 'abc' become 'nop'\\\" );\\npragma annotate( description, \\\"and so on. Technically rot-13 is a 'monoalphabetic\\\" );\\npragma annotate( description, \\\"substitution cipher' with a trivial 'key'. A proper\\\" );\\npragma annotate( description, \\\"implementation should work on upper and lower case\\\" );\\npragma annotate( description, \\\"letters, preserve case, and pass all non-alphabetic\\\" );\\npragma annotate( description, \\\"characters in the input stream through without\\\" );\\npragma annotate( description, \\\"alteration.\\\" );\\npragma annotate( see_also, \\\"http://rosettacode.org/wiki/Rot-13\\\" );\\npragma annotate( author, \\\"Ken O. Burtch\\\" );\\npragma license( unrestricted );\\n\\npragma restriction( no_external_commands );\\n\\nprocedure rot13 is\\n\\n function to_rot13( s : string ) return string is\\n ch : character;\\n result : string;\\n begin\\n for i in 1..strings.length( s ) loop\\n ch := strings.element( s, i );\\n if strings.is_letter( ch ) then\\n if (ch in 'A'..'M') or (ch in 'a'..'m' ) then\\n ch := strings.val( numerics.pos( ch ) + 13 );\\n else\\n ch := strings.val( numerics.pos( ch ) - 13 );\\n end if;\\n end if;\\n result := @ & ch;\\n end loop;\\n return result;\\n end to_rot13;\\n\\nbegin\\n ? to_rot13( \\\"Big fjords vex quick waltz nymph!\\\" );\\nend rot13;\\n\",\n \"language\": \"SparForte\"\n },\n {\n \"code\": \"select translate(\\n 'The quick brown fox jumps over the lazy dog.',\\n 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz',\\n 'NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm'\\n )\\n from dual;\\n\",\n \"language\": \"SQL\"\n },\n {\n \"code\": \"with cte(num) as\\n(\\n select 1\\n union all\\n select num+1\\n from cte\\n)\\nselect cast((\\nselect char(ascii(chr) +\\n\\t\\tcase\\n\\t\\t\\twhen ascii(chr) between ascii('a') and ascii('m') or\\n\\t\\t\\t\\tascii(chr) between ascii('A') and ascii('M') then 13\\n\\t\\t\\twhen ascii(chr) between ascii('n') and ascii('z') or\\n\\t\\t\\t\\tascii(chr) between ascii('N') and ascii('Z') then -13\\n\\t\\t\\telse 0\\n\\t\\tend)\\nfrom\\n(\\nselect top(1000) num,\\n\\t\\t -- your string to be converted to ROT13\\n substring('The Quick Brown Fox Jumps Over The Lazy Dog',num,1) chr\\nfrom cte\\n) tmp\\nFor XML PATH ('')) as xml).value('.', 'VARCHAR(max)') rot13\\noption (maxrecursion 0)\\n\",\n \"language\": \"SQL\"\n },\n {\n \"code\": \"fun rot13char c =\\n if c >= #\\\"a\\\" andalso c <= #\\\"m\\\" orelse c >= #\\\"A\\\" andalso c <= #\\\"M\\\" then\\n chr (ord c + 13)\\n else if c >= #\\\"n\\\" andalso c <= #\\\"z\\\" orelse c >= #\\\"N\\\" andalso c <= #\\\"Z\\\" then\\n chr (ord c - 13)\\n else\\n c\\n\\nval rot13 = String.map rot13char\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"fun rot13stdin () =\\n case (TextIO.inputLine TextIO.stdIn)\\n of NONE => ()\\n | SOME(s) => (print (rot13 s); rot13stdin ());\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"function rot13(s) {\\n\\tu = ascii(s)\\n\\ti = selectindex(u:>64 :& u:<91)\\n\\tif (length(i)>0) u[i] = mod(u[i]:-52, 26):+65\\n\\ti = selectindex(u:>96 :& u:<123)\\n\\tif (length(i)>0) u[i] = mod(u[i]:-84, 26):+97\\n\\treturn(char(u))\\n}\\n\\nrot13(\\\"Shall Not Perish\\\")\\n Funyy Abg Crevfu\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"a \\\"The quick brown fox jumps over the lazy dog.\\\"\\nb \\\"AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsTtUuVvWwXxYyZz\\\"\\nc b\\n#@c 78\\n#\\\\c 52\\n#a\\nb %.a d \\\" \\\" b\\nb %.a #d .a\\nb %.a e c\\nb %.a #e #d\\nb %.a a .\\\\e :a\\nf f .a\\na :a\\n#a\\n$ f\\n\",\n \"language\": \"Stringle\"\n },\n {\n \"code\": \"func rot13char(c: UnicodeScalar) -> UnicodeScalar {\\n switch c {\\n case \\\"A\\\"...\\\"M\\\", \\\"a\\\"...\\\"m\\\":\\n return UnicodeScalar(UInt32(c) + 13)\\n case \\\"N\\\"...\\\"Z\\\", \\\"n\\\"...\\\"z\\\":\\n return UnicodeScalar(UInt32(c) - 13)\\n default:\\n return c\\n }\\n}\\n\\nfunc rot13(str: String) -> String {\\n return String(map(str.unicodeScalars){ c in Character(rot13char(c)) })\\n}\\n\\nprintln(rot13(\\\"The quick brown fox jumps over the lazy dog\\\"))\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"proc rot13 line {\\n string map {\\n a n b o c p d q e r f s g t h u i v j w k x l y m z\\n n a o b p c q d r e s f t g u h v i w j x k y l z m\\n A N B O C P D Q E R F S G T H U I V J W K X L Y M Z\\n N A O B P C Q D R E S F T G U H V I W J X K Y L Z M\\n } $line\\n}\\nset tx \\\"Hello, World !\\\"\\nputs \\\"$tx : [rot13 $tx]\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"package require Tclx\\nproc rot13 str {\\n translit \\\"A-Za-z\\\" \\\"N-ZA-Mn-za-m\\\" $str\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \":\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ→Str0\\n:\\\".→Str2\\n:For(N,1,length(Str1\\n:If inString(Str0,sub(Str1,N,1\\n:Then\\n:inString(Str0,sub(Str1,N,1\\n:Ans+13-26(Ans>13\\n:Str2+sub(Str0,Ans,1→Str2\\n:Else\\n:Str2+sub(Str1,N,1→Str2\\n:End\\n:End\\n:sub(Str2,2,length(Str2)-1→Str1\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"function rot13(%string)\\n{\\n\\t%alph = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\n\\t%len = strLen(%string);\\n\\t\\n\\tfor(%a = 0; %a < %len; %a++)\\n\\t{\\n\\t\\t%char = getSubStr(%string,%a,1);\\n\\t\\t%pos = striPos(%alph, %char);\\n\\n\\t\\tif(%pos < 0)\\n\\t\\t\\t%out = %out @ %char;\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tif(strPos(%alph, %char) < 0)\\n\\t\\t\\t\\t%out = %out @ strUpr(getSubStr(%alph, (%pos + 13) % 26));\\n\\t\\t\\telse\\n\\t\\t\\t\\t%out = %out @ getSubStr(%alph, (%pos + 13) % 26);\\n\\t\\t}\\n\\t}\\n\\treturn %out;\\n}\\n\",\n \"language\": \"TorqueScript\"\n },\n {\n \"code\": \"FUNCTION rot13$(s$)\\n LET ans$ = \\\"\\\"\\n FOR a = 1 to len(s$)\\n LET letter$ = (s$)[a:a+1-1]\\n IF letter$ >= \\\"A\\\" and letter$ <= \\\"Z\\\" then\\n LET char$ = chr$(ord(letter$[1:1])+13)\\n IF char$ > \\\"Z\\\" then LET char$ = chr$(ord(char$[1:1])-26)\\n ELSEIF letter$ >= \\\"a\\\" and letter$ <= \\\"z\\\" then\\n LET char$ = chr$(ord(letter$[1:1])+13)\\n IF char$ > \\\"z\\\" then LET char$ = chr$(ord(char$[1:1])-26)\\n ELSE\\n LET char$ = letter$\\n END IF\\n LET ans$ = ans$ & char$\\n NEXT a\\n LET s$ = ans$\\n LET rot13$ = s$\\nEND FUNCTION\\n\\nINPUT prompt \\\"Enter a string: \\\": s$\\nPRINT \\\"Before encoding : \\\"; s$\\nPRINT \\\"After encoding : \\\"; rot13$(s$)\\nLET s$ = rot13$(s$)\\nPRINT \\\"After decoding : \\\"; rot13$(s$)\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"@(deffilter rot13\\n (\\\"a\\\" \\\"n\\\") (\\\"b\\\" \\\"o\\\") (\\\"c\\\" \\\"p\\\") (\\\"d\\\" \\\"q\\\") (\\\"e\\\" \\\"r\\\") (\\\"f\\\" \\\"s\\\") (\\\"g\\\" \\\"t\\\")\\n (\\\"h\\\" \\\"u\\\") (\\\"i\\\" \\\"v\\\") (\\\"j\\\" \\\"w\\\") (\\\"k\\\" \\\"x\\\") (\\\"l\\\" \\\"y\\\") (\\\"m\\\" \\\"z\\\") (\\\"n\\\" \\\"a\\\")\\n (\\\"o\\\" \\\"b\\\") (\\\"p\\\" \\\"c\\\") (\\\"q\\\" \\\"d\\\") (\\\"r\\\" \\\"e\\\") (\\\"s\\\" \\\"f\\\") (\\\"t\\\" \\\"g\\\") (\\\"u\\\" \\\"h\\\")\\n (\\\"v\\\" \\\"i\\\") (\\\"w\\\" \\\"j\\\") (\\\"x\\\" \\\"k\\\") (\\\"y\\\" \\\"l\\\") (\\\"z\\\" \\\"m\\\")\\n (\\\"A\\\" \\\"N\\\") (\\\"B\\\" \\\"O\\\") (\\\"C\\\" \\\"P\\\") (\\\"D\\\" \\\"Q\\\") (\\\"E\\\" \\\"R\\\") (\\\"F\\\" \\\"S\\\") (\\\"G\\\" \\\"T\\\")\\n (\\\"H\\\" \\\"U\\\") (\\\"I\\\" \\\"V\\\") (\\\"J\\\" \\\"W\\\") (\\\"K\\\" \\\"X\\\") (\\\"L\\\" \\\"Y\\\") (\\\"M\\\" \\\"Z\\\") (\\\"N\\\" \\\"A\\\")\\n (\\\"O\\\" \\\"B\\\") (\\\"P\\\" \\\"C\\\") (\\\"Q\\\" \\\"D\\\") (\\\"R\\\" \\\"E\\\") (\\\"S\\\" \\\"F\\\") (\\\"T\\\" \\\"G\\\") (\\\"U\\\" \\\"H\\\")\\n (\\\"V\\\" \\\"I\\\") (\\\"W\\\" \\\"J\\\") (\\\"X\\\" \\\"K\\\") (\\\"Y\\\" \\\"L\\\") (\\\"Z\\\" \\\"M\\\"))\\n@(repeat)\\n@line\\n@ (output :filter rot13)\\n@line\\n@ (end)\\n@(end)\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"(defun rot13 (ch)\\n (cond\\n ((<= #\\\\A ch #\\\\Z) (wrap #\\\\A #\\\\Z (+ ch 13)))\\n ((<= #\\\\a ch #\\\\z) (wrap #\\\\a #\\\\z (+ ch 13)))\\n (t ch)))\\n\\n (whilet ((ch (get-char)))\\n (put-char (rot13 ch)))\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"tr \\\\\\n'NOWHERE AZ clerk IRAQ faber gnat ABJURER NM pyrex VEND snore tang'\\\\\\n'abjurer nm PYREX vend SNORE TANG nowhere az CLERK iraq FABER GNAT' \\\\\\n'ABJURER NM pyrex VEND snore tang NOWHERE AZ clerk IRAQ faber gnat'\\\\\\n'nowhere az CLERK iraq FABER GNAT abjurer nm PYREX vend SNORE TANG'\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#!/bin/sh\\nrot13() {\\n tr '[a-m][n-z][A-M][N-Z]' '[n-z][a-m][N-Z][A-M]'\\n}\\n\\ncat ${1+\\\"$@\\\"} | rot13\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"``ci`d``@i`c``s`d```?aic.n``s`d```?bic.o``s`d```?cic.p``s`d```?dic.q``s`d```?eic\\n.r``s`d```?fic.s``s`d```?gic.t``s`d```?hic.u``s`d```?iic.v``s`d```?jic.w``s`d```\\n?kic.x``s`d```?lic.y``s`d```?mic.z``s`d```?nic.a``s`d```?oic.b``s`d```?pic.c``s`\\nd```?qic.d``s`d```?ric.e``s`d```?sic.f``s`d```?tic.g``s`d```?uic.h``s`d```?vic.i\\n``s`d```?wic.j``s`d```?xic.k``s`d```?yic.l``s`d```?zic.m``s`d```?Nic.A``s`d```?O\\nic.B``s`d```?Pic.C``s`d```?Qic.D``s`d```?Ric.E``s`d```?Sic.F``s`d```?Tic.G``s`d`\\n``?Uic.H``s`d```?Vic.I``s`d```?Wic.J``s`d```?Xic.K``s`d```?Yic.L``s`d```?Zic.M``\\ns`d```?Aic.N``s`d```?Bic.O``s`d```?Cic.P``s`d```?Dic.Q``s`d```?Eic.R``s`d```?Fic\\n.S``s`d```?Gic.T``s`d```?Hic.U``s`d```?Iic.V``s`d```?Jic.W``s`d```?Kic.X``s`d```\\n?Lic.Y``s`d```?Mic.Z`d`|c\\n\",\n \"language\": \"Unlambda\"\n },\n {\n \"code\": \"#import std\\n\\n#executable (<'parameterized','default-to-stdin'>,<>)\\n\\nrot = ~command.files; * contents:= ~contents; * * -:~& -- ^p(~&,rep13~&zyC)~~ ~=`A-~ letters\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"( in-place rot13, null terminated string )\\n@rot13 ( addr* -: addr* )\\n DUP2\\n &loop\\n LDAk ?{ POP2 JMP2r } STH2k\\n LDAk #df AND DUP #41 LTH SWP #5a GTH ORA\\n STH LDAk STHr\\n ?{\\n DUP #df AND\\n #0d ADD\\n DUP #5a GTH #1a MUL SUB\\n SWP #20 AND ORA\\n }\\n STH2r STA INC2\\n !&loop\\n\",\n \"language\": \"Uxntal\"\n },\n {\n \"code\": \"fn main() {\\n\\tprintln(rot13('nowhere ABJURER'))\\n\\tprintln(rot13('abjurer NOWHERE'))\\n}\\n\\nfn rot13char(chr u8) u8 {\\n\\tif (chr >= u8(97) && chr <= u8(109)) || (chr >= u8(65) && chr <= u8(77)) {\\n\\t\\treturn chr + 13\\n\\t}\\n\\tif (chr >= u8(110) && chr <= u8(122)) || (chr >= u8(78) && chr <= u8(90)) {\\n\\t\\treturn chr - 13\\n\\t}\\n\\treturn chr\\n}\\n\\nfn rot13(str string) string {\\n\\tmut chr_arr := []u8{}\\n\\tfor elem in str.split('') {\\n\\t\\tchr_arr << rot13char(elem.str)\\n\\t}\\n\\treturn chr_arr.bytestr()\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"string rot13(string s) {\\n const string lcalph = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\n const string ucalph = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\n string result = \\\"\\\";\\n int pos;\\n unichar c;\\n\\n for (int i = 0; s.get_next_char (ref i, out c);) {\\n if ((pos = lcalph.index_of_char(c)) != -1)\\n result += lcalph[(pos + 13) % 26].to_string();\\n else if ((pos = ucalph.index_of_char(c)) != -1)\\n result += ucalph[(pos + 13) % 26].to_string();\\n else\\n result += c.to_string();\\n }\\n\\n return result;\\n}\\n\\nvoid main() {\\n print(rot13(\\\"The Quick Brown Fox Jumped Over the Lazy Dog!\\\"));\\n}\\n\",\n \"language\": \"Vala\"\n },\n {\n \"code\": \"option explicit\\n\\nfunction rot13(a)\\n dim b,n1,n,i\\n b=\\\"\\\"\\n for i=1 to len(a)\\n n=asc(mid(a,i,1))\\n if n>=65 and n<= 91 then\\n n1=(((n-65)+13)mod 26)+65\\n elseif n>=97 and n<= 123 then\\n n1=(((n-97)+13)mod 26)+97\\n else\\n n1=n\\n end if\\n b=b & chr(n1)\\n next\\n rot13=b\\nend function\\n\\nconst a=\\\"The quick brown fox jumps over the lazy dog.\\\"\\ndim b,c\\nwscript.echo a\\nb=rot13(a)\\nwscript.echo b\\nc=rot13(b)\\nwscript.echo c\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"Translate_Load(\\\"ROT13.TBL\\\")\\nTranslate_Block(0, File_Size)\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"Function ROT13(ByVal a As String) As String\\n Dim i As Long\\n Dim n As Integer, e As Integer\\n\\n ROT13 = a\\n For i = 1 To Len(a)\\n n = Asc(Mid$(a, i, 1))\\n Select Case n\\n Case 65 To 90\\n e = 90\\n n = n + 13\\n Case 97 To 122\\n e = 122\\n n = n + 13\\n Case Else\\n e = 255\\n End Select\\n\\n If n > e Then\\n n = n - 26\\n End If\\n Mid$(ROT13, i, 1) = Chr$(n)\\n Next i\\nEnd Function\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"Sub Main()\\n Debug.Assert ROT13(\\\"abc\\\") = \\\"nop\\\"\\n Debug.Assert ROT13(\\\"nop\\\") = \\\"abc\\\"\\nEnd Sub\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"Module Module1\\n\\n Private Function rot13(ByVal str As String) As String\\n Dim newChars As Char(), i, j As Integer, original, replacement As String\\n\\n original = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\"\\n replacement = \\\"NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm\\\"\\n\\n newChars = str.ToCharArray()\\n\\n For i = 0 To newChars.Length - 1\\n For j = 0 To 51\\n If newChars(i) = original(j) Then\\n newChars(i) = replacement(j)\\n Exit For\\n End If\\n Next\\n Next\\n\\n Return New String(newChars)\\n End Function\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"def (rot13 s)\\n (as string\\n (map rot13\\n (as list s)))\\n\\nAlphabet <- \\\"abcdefghijklmnopqrstuvwxyz\\\"\\ndef (rot13 c) :case (and string?.c len.c=1)\\n if (\\\"a\\\" <= c <= \\\"z\\\")\\n let idx (pos c Alphabet)\\n Alphabet (idx+13 % 26)\\n (\\\"A\\\" <= c <= \\\"Z\\\")\\n (downcase.c -> rot13 -> upcase)\\n :else\\n c\\n\",\n \"language\": \"Wart\"\n },\n {\n \"code\": \"(rot13 \\\"Moron\\\")\\n=> \\\"Zbeba\\\"\\n\",\n \"language\": \"Wart\"\n },\n {\n \"code\": \"1 2#read()-N(2);\\n2 2;\\n3 defer(1 || N(2) > 90 || N(2) < 65) 5#65-N(5);\\n4 defer(1 || N(2) > 122 || N(2) < 97) 5#97-N(5);\\n5 5;\\n6 defer(3 && 4) put(U(((N(2) - N(5) + 13) % 26) + N(5)));\\n7 defer(1 || N(2) > 64 || N(2) == 0) put(U(N(2)));\\n8 again(8) defer(6 && 7) 1,-6#N(6)-1,-7#N(7)-1,-3#N(3)-1,-4#N(4)-1;\\n9 defer(1 || N(2) != 0) -3,-4,-5#N(5),-6,-7,-8;\\n10 defer(1 || 9) put(\\\"\\\\n\\\");\\n\",\n \"language\": \"Whenever\"\n },\n {\n \"code\": \"\",\n \"language\": \"Whitespace\"\n },\n {\n \"code\": \"var rot13 = Fn.new { |s|\\n var bytes = s.bytes.toList\\n for (i in 0...bytes.count) {\\n var c = bytes[i]\\n if ((c >= 65 && c <= 77) || (c >= 97 && c <= 109)) {\\n bytes[i] = c + 13\\n } else if ((c >= 78 && c <= 90) || (c >= 110 && c <= 122)) {\\n bytes[i] = c - 13\\n }\\n }\\n return bytes.map { |b| String.fromByte(b) }.join()\\n}\\n\\nSystem.print(rot13.call(\\\"nowhere ABJURER\\\"))\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"format \\tELF \\texecutable 3\\nentry \\tstart\\n\\t\\nsegment\\treadable writeable\\nbuf\\trb\\t1\\n\\t\\nsegment\\treadable executable\\nstart:\\tmov\\teax, 3\\t\\t; syscall \\\"read\\\"\\n\\tmov\\tebx, 0\\t\\t; stdin\\n\\tmov\\tecx, buf\\t; buffer for read byte\\n\\tmov\\tedx, 1\\t\\t; len (read one byte)\\n\\tint\\t80h\\n\\n\\tcmp\\teax, 0\\t\\t; EOF?\\n\\tjz\\texit\\n\\n\\txor \\teax, eax\\t; load read char to eax\\n\\tmov\\tal, [buf]\\n\\tcmp\\teax, \\\"A\\\"\\t; see if it is in ascii a-z or A-Z\\n\\tjl\\tprint\\n\\tcmp\\teax, \\\"z\\\"\\n\\tjg\\tprint\\n\\tcmp\\teax, \\\"Z\\\"\\n\\tjle\\trotup\\n\\tcmp\\teax, \\\"a\\\"\\n\\tjge\\trotlow\\n\\tjmp\\tprint\\n\\nrotup:\\tsub\\teax, \\\"A\\\"-13\\t; do rot 13 for A-Z\\n\\tcdq\\n\\tmov\\tebx, 26\\n\\tdiv\\tebx\\n\\tadd\\tedx, \\\"A\\\"\\n\\tjmp\\trotend\\n\\t\\nrotlow:\\tsub\\teax, \\\"a\\\"-13\\t; do rot 13 for a-z\\n\\tcdq\\n\\tmov\\tebx, 26\\n\\tdiv\\tebx\\n\\tadd\\tedx, \\\"a\\\"\\n\\nrotend:\\tmov\\t[buf], dl\\n\\t\\nprint: \\tmov\\teax, 4\\t\\t; syscall write\\n\\tmov\\tebx, 1\\t\\t; stdout\\n\\tmov\\tecx, buf\\t; *char\\n\\tmov\\tedx, 1\\t\\t; string length\\n\\tint\\t80h\\n\\n\\tjmp\\tstart\\n\\nexit: \\tmov eax,1\\t\\t; syscall exit\\n\\txor ebx,ebx\\t\\t; exit code\\n\\tint 80h\\n\",\n \"language\": \"X86-Assembly\"\n },\n {\n \"code\": \"PROGRAM \\\"Rot-13\\\"\\nVERSION \\\"0.0000\\\"\\n\\nDECLARE FUNCTION Entry ()\\n\\nFUNCTION Entry ()\\n\\tdec$ = \\\"\\\"\\n\\tTYPE$ = \\\"cleartext \\\"\\n\\tctext$ = \\\"\\\"\\n\\tiOffset = 13 'offset assumed to be 13 - uncomment line 11 to change\\n\\n\\tPRINT \\\"For decrypt enter \\\" + \\\"<d> \\\" + \\\" -- else press enter > \\\";\\n\\tdec$ = INLINE$(\\\"\\\")\\n\\tPRINT\\n\\n\\tIF LCASE$(dec$) = \\\"d\\\" THEN\\n\\t\\tiOffset = 26 - iOffset\\n\\t\\tTYPE$ = \\\"ciphertext \\\"\\n\\tEND IF\\n\\n\\tPRINT \\\"Enter \\\" + TYPE$; '' + \\\"> \\\";\\n\\tcad$ = UCASE$(INLINE$(\\\"> \\\"))\\n\\n\\tFOR i = 1 TO LEN(cad$)\\n\\t\\tiTemp = ASC(MID$(cad$,i,1))\\n\\t\\tIF iTemp > 64 AND iTemp < 91 THEN\\n\\t\\t\\tiTemp = ((iTemp - 65) + iOffset) MOD 26\\n\\t\\t\\tPRINT CHR$(iTemp + 65);\\n\\t\\tEND IF\\n\\tNEXT i\\nEND FUNCTION\\nEND PROGRAM\\n\",\n \"language\": \"XBasic\"\n },\n {\n \"code\": \"code ChIn=7, ChOut=8;\\nint C, CC;\\nrepeat C:= ChIn(1); CC:= C&~$20; \\\\CC handles lowercase too\\n ChOut(0, C + (if CC>=^A & CC<=^M then +13\\n else if CC>=^N & CC<=^Z then -13\\n else 0));\\nuntil C = $1A; \\\\EOF\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"<xsl:stylesheet version=\\\"1.0\\\" xmlns:xsl=\\\"http://www.w3.org/1999/XSL/Transform\\\">\\n <xsl:output method=\\\"text\\\" />\\n <xsl:variable name=\\\"alpha\\\">ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz</xsl:variable>\\n <xsl:variable name=\\\"rot13\\\">NOPQRSTUVWXYZABCDEFGHIJKLMnopqrstuvwxyzabcdefghijklm</xsl:variable>\\n <xsl:template match=\\\"body\\\">\\n <xsl:apply-templates/>\\n </xsl:template>\\n <xsl:template match=\\\"rot13\\\">\\n <xsl:value-of select=\\\"translate(.,$alpha,$rot13)\\\"/>\\n </xsl:template>\\n</xsl:stylesheet>\\n\",\n \"language\": \"XSLT\"\n },\n {\n \"code\": \"s$ = \\\"nowhere ABJURER\\\"\\nprint \\\" Cadena original : \\\", s$\\nprint \\\" Tras codificar : \\\", Rot13$(s$)\\nprint \\\"Tras decodificar : \\\", Rot13$(Rot13$(s$))\\nend\\n\\nsub Rot13$ (s$)\\n local cad$\\n cad$ = \\\"\\\"\\n\\n for i = 1 to len(s$)\\n temp = asc(mid$(s$, i, 1))\\n\\n if temp >= 65 and temp <= 90 then // A to Z\\n temp = (mod((temp - 52), 26)) + 65\\n elsif temp >= 97 And temp <= 122 then // a to z\\n temp = (mod((temp - 84), 26)) + 97\\n end if\\n cad$ = cad$ + chr$(temp)\\n next i\\n return cad$\\nend sub\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"!yamlscript/v0\\n\\ns =: set(nil).into('abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ')\\nm =: drop(26 s).concat(take(26 s)).zipmap(s _)\\n\\ndefn main(s):\\n say: map(\\\\(m %1 %1) s).apply(str _)\\n\",\n \"language\": \"YAMLScript\"\n },\n {\n \"code\": \"const std = @import(\\\"std\\\");\\n\\npub const Rot13 = struct {\\n pub fn char(ch: u8) u8 {\\n return switch (ch) {\\n 'a'...'m', 'A'...'M' => |c| c + 13,\\n 'n'...'z', 'N'...'Z' => |c| c - 13,\\n else => |c| c,\\n };\\n }\\n\\n /// Caller owns returned memory.\\n pub fn slice(allocator: std.mem.Allocator, input: []const u8) error{OutOfMemory}![]u8 {\\n const output = try allocator.alloc(u8, input.len);\\n errdefer allocator.free(output);\\n\\n for (input, output) |input_ch, *output_ch| {\\n output_ch.* = char(input_ch);\\n }\\n\\n return output;\\n }\\n};\\n\\npub fn main() error{OutOfMemory}!void {\\n var gpa: std.heap.GeneralPurposeAllocator(.{}) = .{};\\n defer _ = gpa.deinit();\\n const allocator = gpa.allocator();\\n\\n const message_input =\\n \\\\\\\\@@@111@@@ Lbh xabj vg vf tbvat gb or n onq qnl\\n \\\\\\\\ jura gur yrggref va lbhe nycunorg fbhc\\n \\\\\\\\ fcryy Q-V-F-N-F-G-R-E.\\n ;\\n const message_decoded = try Rot13.slice(allocator, message_input);\\n defer allocator.free(message_decoded);\\n\\n std.debug.print(\\n \\\\\\\\{s}\\n \\\\\\\\=== Decoded to ===\\n \\\\\\\\{s}\\n \\\\\\\\\\n , .{\\n message_input,\\n message_decoded,\\n });\\n\\n std.debug.print(\\\"\\\\n\\\", .{});\\n\\n const message_encoded = try Rot13.slice(allocator, message_decoded);\\n defer allocator.free(message_encoded);\\n\\n std.debug.print(\\n \\\\\\\\{s}\\n \\\\\\\\=== Encoded to ===\\n \\\\\\\\{s}\\n \\\\\\\\\\n , .{\\n message_decoded,\\n message_encoded,\\n });\\n}\\n\",\n \"language\": \"Zig\"\n },\n {\n \"code\": \"#!/home/craigd/Bin/zkl\\nfcn rot13(text){\\n text.translate(\\\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",\\n \\t\\t \\\"nopqrstuvwxyzabcdefghijklmNOPQRSTUVWXYZABCDEFGHIJKLM\\\");\\n}\\ntext:=(vm.arglist or File.stdin); // command line or pipe\\ntext.pump(File.stdout,rot13); // rotate each word and print it\\nif(text.isType(List)) File.stdout.writeln();\\t// command line gets ending newline\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"program: rot13\\n case: 1\\n input: abc\\n output: nop\\n case: 2\\n input: nop\\n output: abc\\n case: 3\\n input: 'ABC'\\n output: 'NOP'\\n case: 4\\n input: 'NOP'\\n output: 'ABC'\\n\",\n \"language\": \"Zoea\"\n },\n {\n \"code\": \"10 CLS\\n20 INPUT \\\"Enter a string: \\\", s$\\n30 LET a$ = \\\"\\\": REM a$ is the encoded string\\n40 FOR l = 1 TO LEN(s$)\\n50 LET i$ = s$(l): REM i$ is the letter being worked on\\n60 IF i$ < \\\"A\\\" OR i$ > \\\"Z\\\" THEN GO TO 100\\n70 LET c$ = CHR$(CODE(i$) + 13): REM c$ is the encoded letter\\n80 IF c$ > \\\"Z\\\" THEN LET c$ = CHR$(CODE(c$) - 26)\\n90 GO TO 300\\n100 IF i$ < \\\"a\\\" OR i$ > \\\"z\\\" THEN GO TO 200\\n110 LET c$ = CHR$(CODE(i$) + 13)\\n120 IF c$ > \\\"z\\\" THEN LET c$ = CHR$(CODE(c$) - 26)\\n130 GO TO 300\\n200 LET c$ = i$\\n300 LET a$ = a$ + c$\\n310 NEXT l\\n320 PRINT a$\\n\",\n \"language\": \"ZX-Spectrum-Basic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Rot-13"}}},{"rowIdx":1596,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Simple\nfrom: http://rosettacode.org/wiki/RPG_attributes_generator\n","language":"00-META"},{"code":"'''RPG''' = <u>R</u>ole <u>P</u>laying <u>G</u>ame.\n\n\n\nYou're running a tabletop RPG, and your players are creating characters.\n\nEach character has six core attributes: strength, dexterity, constitution, intelligence, wisdom, and charisma.\n\nOne way of generating values for these attributes is to roll four, 6-sided dice (d6) and sum the three highest rolls, discarding the lowest roll.\n\nSome players like to assign values to their attributes in the order they're rolled.\n\nTo ensure generated characters don't put players at a disadvantage, the following requirements must be satisfied:\n\n* The total of all character attributes must be at least 75.\n* At least two of the attributes must be at least 15.\n<p></p>\nHowever, this can require a lot of manual dice rolling. A programatic solution would be much faster.\n\n\n;Task:\nWrite a program that:\n# Generates 4 random, whole values between 1 and 6.\n# Saves the sum of the 3 largest values.\n# Generates a total of 6 values this way.\n# Displays the total, and all 6 values once finished.\n<p></p>\n* The order in which each value was generated must be preserved.\n* The total of all 6 values must be at least 75.\n* At least 2 of the values must be 15 or more.\n<p></p>\n\n","language":"00-TASK"},{"code":"random:seed(Int(Time().unix_time()))\nV total = 0\nV count = 0\n\n[Int] attributes\nL total < 75 | count < 2\n attributes = (0..5).map(attribute -> (sum(sorted((0..3).map(roll -> random:(1 .. 6)))[1..])))\n\n L(attribute) attributes\n I attribute >= 15\n count++\n\n total = sum(attributes)\n\nprint(total‘ ’attributes)\n","language":"11l"},{"code":"\tbits\t16\n\tcpu\t8086\nputch:\tequ\t2h\ntime:\tequ\t2ch\n\torg\t100h\nsection\t.text\n\tmov\tah,time\t\t; Retrieve system time from MS-DOS\n\tint\t21h\n\tcall\trseed\t\t; Seed the RNG\nrolls:\txor\tah,ah\t\t; AH=0 (running total)\n\tmov\tdx,6\t\t; DH=0 (amount >=15), DL=6 (counter)\n\tmov\tdi,attrs\nattr:\tcall\troll4\t\t; Roll an attribute\n\tmov\tal,14\n\tcmp\tal,bh\t\t; Set carry if BH=15 or more\n\tmov\tal,bh\t\t; AL = roll\n\tsbb\tbh,bh\t\t; BH=0 if no carry, -1 if carry\n\tsub\tdh,bh\t\t; DH+=1 if >=15\n\tadd\tah,al\t\t; Add to running total\n\tmov\t[di],al\t\t; Save roll\n\tinc\tdi\t\t; Next memory address\n\tdec\tdl\t\t; One fewer roll left\n\tjnz\tattr\n\tcmp\tah,75\t\t; Rolling total < 75?\n\tjb\trolls\t\t; Then roll again.\n\tcmp\tdh,2\t\t; Fewer than 2 attrs < 15?\n\tjb\trolls\t\t; Then roll again.\n\t;;;\tPrint the attributes\n\tmov\tcx,6\t\t; 6 attributes\np2:\tmov\tbl,10\t\t; divide by 10 to get digits\n\tmov\tdi,attrs\nprint:\txor\tah,ah\t\t; AX = attribute\n\tmov\tal,[di]\n\tdiv\tbl\t\t; divide by 10\n\tadd\tax,3030h\t; add '0' to quotient (AH) and remainder (AL)\n\tmov\tdx,ax\n\tmov\tah,putch\t\n\tint\t21h\t\t; print quotient first\n\tmov\tdl,dh\t\t; then remainder\n\tint\t21h\n\tmov\tdl,' '\t\t; then a space\n\tint\t21h\n\tinc\tdi\t\t; Next attribute\n\tloop\tprint\n\tret\t\t\t; Back to DOS \t\n\t;;;\tDo 4 rolls, and get result of max 3\nroll4:\txor\tbx,bx\t\t; BH = running total\n\tdec\tbl\t\t; BL = lowest value\n\tmov\tcx,4\t\t; Four times\n.roll:\tcall\td6\t\t; Roll D6\n\tcmp \tal,bl\t\t; Lower than current lowest value?\n\tjnb\t.high\t\t; If so,\n\tmov\tbl,al\t\t; Set new lowest value\n.high:\tadd\tbh,al\t\t; Add to running total\n\tloop\t.roll\t\t; If not 4 rolls yet, loop back\n\tsub\tbh,bl\t\t; Subtract lowest value (giving sum of high 3)\n\tret\n\t;;;\tRoll a D6\nd6:\tcall\trand\t\t; Get random number\n\tand\tal,7\t\t; Between 0 and 7\n\tcmp\tal,6\t\t; If 6 or higher,\n\tjae\td6\t\t; Then get new random number\n\tinc\tal\t\t; [1..6] instead of [0..5]\n\tret\n\t;;;\tSeed the random number generator with 4 bytes\nrseed:\txor\t[rnddat],cx\n\txor\t[rnddat+2],dx\n\t;;;\t\"X ABC\" random number generator\n\t;;;\tGenerates 8-bit random number in AL\nrand:\tpush\tcx\t\t; Keep registers\n\tpush\tdx\n\tmov\tcx,[rnddat]\t; CL=X CH=A\n\tmov\tdx,[rnddat+2]\t; DL=B DH=C\n\txor\tch,dh\t\t; A ^= C\n\txor\tch,cl\t\t; A ^= X\n\tadd\tdl,ch\t\t; B += A\n\tmov\tal,dl\t\t; R = B\n\tshr\tal,1\t\t; R >>= 1\n\txor\tal,ch\t\t; R ^= A\n\tadd\tal,dh\t\t; R += C\n\tmov\tdh,al\t\t; C = R\n\tmov\t[rnddat],cx\t; Store new state\n\tmov\t[rnddat+2],dx\n\tpop\tdx\t\t; Restore registers\n\tpop\tcx\n\tret\nsection\t.bss\nrnddat:\tresb\t4\t\t; RNG state\nattrs:\tresb\t6\t\t; Rolled attributes\n","language":"8086-Assembly"},{"code":"/* ARM assembly AARCH64 Raspberry PI 3B */\n/* program rpg64.s */\n\n/*******************************************/\n/* Constantes file */\n/*******************************************/\n/* for this file see task include a file in language AArch64 assembly*/\n.include \"../includeConstantesARM64.inc\"\n\n.equ NBTIRAGES, 4\n.equ NBTIRAGESOK, 3\n.equ NBVALUES, 6\n.equ TOTALMIN, 75\n.equ MAXVALUE, 15\n.equ NBMAXVALUE, 2\n\n/*********************************/\n/* Initialized data */\n/*********************************/\n.data\nsMessResult: .asciz \"Value = @ \\n\"\nszCarriageReturn: .asciz \"\\n\"\nsMessResultT: .asciz \"Total = @ \\n\"\nsMessResultQ: .asciz \"Values above 15 = @ \\n\"\n\n\n.align 4\nqGraine: .quad 123456789\n\n/*********************************/\n/* UnInitialized data */\n/*********************************/\n.bss\ntqTirages: .skip 8 * NBTIRAGES\ntqValues: .skip 8 * NBVALUES\n\nsZoneConv: .skip 24\n/*********************************/\n/* code section */\n/*********************************/\n.text\n.global main\nmain: // entry of program\n\n1: // begin loop 1\n mov x2,0 // counter value >15\n mov x4,0 // loop indice\n mov x5,0 // total\n ldr x3,qAdrtqValues // table values address\n2:\n bl genValue // call generate value\n str x0,[x3,x4,lsl 3] // store in table\n add x5,x5,x0 // compute total\n cmp x0,MAXVALUE // count value >= 15\n add x6,x2,1\n csel x2,x6,x2,ge\n add x4,x4,1 // increment indice\n cmp x4,NBVALUES // end ?\n blt 2b\n cmp x5,TOTALMIN // compare 75\n blt 1b // < loop\n cmp x2,#NBMAXVALUE // compare value > 15\n blt 1b // < loop\n ldr x0,qAdrtqValues // display values\n bl displayTable\n mov x0,x5 // total\n\n ldr x1,qAdrsZoneConv // display value\n bl conversion10 // call conversion decimal\n ldr x0,qAdrsMessResultT\n ldr x1,qAdrsZoneConv\n bl strInsertAtCharInc // insert result at @ character\n bl affichageMess // display message\n\n mov x0,x2 // counter value > 15\n ldr x1,qAdrsZoneConv // display value\n bl conversion10 // call conversion decimal\n ldr x0,qAdrsMessResultQ\n ldr x1,qAdrsZoneConv\n bl strInsertAtCharInc // insert result at @ character\n bl affichageMess // display message\n\n100: // standard end of the program\n mov x0,0 // return code\n mov x8,EXIT // request to exit program\n svc 0 // perform the system call\n\nqAdrsZoneConv: .quad sZoneConv\nqAdrszCarriageReturn: .quad szCarriageReturn\nqAdrsMessResult: .quad sMessResult\nqAdrsMessResultT: .quad sMessResultT\nqAdrsMessResultQ: .quad sMessResultQ\nqAdrtqValues: .quad tqValues\n/******************************************************************/\n/* generate value */\n/******************************************************************/\n/* x0 returns the value */\ngenValue:\n stp x1,lr,[sp,-16]! // save registers\n stp x2,x3,[sp,-16]! // save registers\n mov x3,0 // indice loop\n ldr x1,qAdrtqTirages // table tirage address\n1:\n mov x0,6\n bl genereraleas // result 0 to 5\n add x0,x0,#1 // for 1 to 6\n str x0,[x1,x3,lsl 3] // store tirage\n add x3,x3,1 // increment indice\n cmp x3,NBTIRAGES // end ?\n blt 1b // no -> loop\n ldr x0,qAdrtqTirages // table tirage address\n mov x1,#0 // first item\n mov x2,#NBTIRAGES // number of tirages\n bl shellSort // sort table decreasing\n mov x3,#0 // raz indice loop\n mov x0,#0 // total\n ldr x1,qAdrtqTirages // table tirage address\n2:\n ldr x2,[x1,x3,lsl 3] // read tirage\n add x0,x0,x2 // compute sum\n add x3,x3,1 // increment indice\n cmp x3,NBTIRAGESOK // end ?\n blt 2b\n100:\n ldp x2,x3,[sp],16 // restaur 2 registers\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\nqAdrtqTirages: .quad tqTirages\n/***************************************************/\n/* shell Sort decreasing */\n/***************************************************/\n/* x0 contains the address of table */\n/* x1 contains the first element but not use !! */\n/* this routine use first element at index zero !!! */\n/* x2 contains the number of element */\nshellSort:\n stp x1,lr,[sp,-16]! // save registers\n stp x2,x3,[sp,-16]! // save registers\n stp x4,x5,[sp,-16]! // save registers\n stp x6,x7,[sp,-16]! // save registers\n stp x8,x9,[sp,-16]! // save registers\n sub x2,x2,1 // index last item\n mov x1,x2 // init gap = last item\n1: // start loop 1\n lsr x1,x1,1 // gap = gap / 2\n cbz x1,100f // if gap = 0 -> end\n mov x3,x1 // init loop indice 1\n2: // start loop 2\n ldr x4,[x0,x3,lsl 3] // load first value\n mov x5,x3 // init loop indice 2\n3: // start loop 3\n cmp x5,x1 // indice < gap\n blt 4f // yes -> end loop 2\n sub x6,x5,x1 // index = indice - gap\n ldr x8,[x0,x6,lsl 3] // load second value\n cmp x4,x8 // compare values\n ble 4f\n str x8,[x0,x5,lsl 3] // store if >\n sub x5,x5,x1 // indice = indice - gap\n b 3b // and loop\n4: // end loop 3\n str x4,[x0,x5,lsl 3] // store value 1 at indice 2\n add x3,x3,1 // increment indice 1\n cmp x3,x2 // end ?\n ble 2b // no -> loop 2\n b 1b // yes loop for new gap\n\n100: // end function\n ldp x8,x9,[sp],16 // restaur 2 registers\n ldp x6,x7,[sp],16 // restaur 2 registers\n ldp x4,x5,[sp],16 // restaur 2 registers\n ldp x2,x3,[sp],16 // restaur 2 registers\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\n\n/******************************************************************/\n/* Display table elements */\n/******************************************************************/\n/* x0 contains the address of table */\ndisplayTable:\n stp x1,lr,[sp,-16]! // save registers\n stp x2,x3,[sp,-16]! // save registers\n mov x2,x0 // table address\n mov x3,0\n1: // loop display table\n ldr x0,[x2,x3,lsl 3]\n ldr x1,qAdrsZoneConv // display value\n bl conversion10 // call function\n ldr x0,qAdrsMessResult\n ldr x1,qAdrsZoneConv\n bl strInsertAtCharInc // insert result at @ character\n bl affichageMess // display message\n add x3,x3,1\n cmp x3,NBVALUES - 1\n ble 1b\n ldr x0,qAdrszCarriageReturn\n bl affichageMess\n100:\n ldp x2,x3,[sp],16 // restaur 2 registers\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\n\n/***************************************************/\n/* Generation random number */\n/* algo xorshift (see wikipedia) */\n/***************************************************/\n/* x0 contains limit */\ngenereraleas:\n stp x1,lr,[sp,-16]! // save registers\n stp x2,x3,[sp,-16]! // save registers\n cbz x0,100f\n mov x3,x0 // maxi value\n ldr x0,qAdrqGraine // graine\n ldr x2,[x0]\n lsl x1,x2,13\n eor x2,x2,x1\n lsr x1,x2,7\n eor x2,x2,x1\n lsl x1,x2,17\n eor x1,x2,x1\n str x1,[x0] // sauver graine\n udiv x2,x1,x3 //\n msub x0,x2,x3,x1 // compute result modulo limit\n\n100: // end function\n ldp x2,x3,[sp],16 // restaur 2 registers\n ldp x1,lr,[sp],16 // restaur 2 registers\n ret // return to address lr x30\n/*****************************************************/\nqAdrqGraine: .quad qGraine\n/********************************************************/\n/* File Include fonctions */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"\n","language":"AArch64-Assembly"},{"code":"TYPE Result=[BYTE success,sum,highCount]\nBYTE FUNC GenerateAttrib()\n BYTE i,v,min,sum\n\n min=255 sum=0\n FOR i=0 TO 3\n DO\n v=Rand(6)+1\n IF v<min THEN\n min=v\n FI\n sum==+v\n OD\nRETURN (sum-min)\n\nPROC Generate(BYTE ARRAY a BYTE len Result POINTER res)\n BYTE i,v,count\n\n res.highCount=0 res.sum=0\n FOR i=0 TO len-1\n DO\n v=GenerateAttrib()\n IF v>=15 THEN\n res.highCount==+1\n FI\n res.sum==+v\n a(i)=v\n OD\n IF res.highCount<2 OR res.sum<75 THEN\n res.success=0\n ELSE\n res.success=1\n FI\nRETURN\n\nPROC Main()\n DEFINE count=\"6\"\n BYTE ARRAY a(count)\n Result res\n BYTE i\n\n res.success=0\n WHILE res.success=0\n DO\n Generate(a,count,res)\n Print(\"attribs: \")\n FOR i=0 TO count-1\n DO\n PrintB(a(i))\n IF i<count-1 THEN\n Put(',)\n FI\n OD\n PrintF(\" sum=%B highCount=%B \",res.sum,res.highCount)\n IF res.success THEN\n PrintE(\"success\")\n ELSE\n PrintE(\"failed\")\n FI\n OD\nRETURN\n","language":"Action-"},{"code":"BEGIN # RPG attributes generator #\n\n INT attrib count = 6;\n MODE RESULT = STRUCT( BOOL success, INT sum, high count, [ 1 : attrib count ]INT a );\n\n PROC generate attrib = INT:\n BEGIN\n INT min := 255, sum := 0;\n FOR i FROM 0 TO 3 DO\n INT v = ENTIER( next random * 6 ) + 1;\n IF v < min THEN\n min := v\n FI;\n sum +:= v\n OD;\n sum - min\n END # generate attrib #;\n\n PROC generate = ( REF RESULT res )VOID:\n BEGIN\n high count OF res := 0;\n sum OF res := 0;\n FOR i FROM LWB a OF res TO UPB a OF res DO\n INT v = generate attrib;\n IF v >= 15 THEN\n high count OF res +:= 1\n FI;\n sum OF res +:= v;\n ( a OF res )[ i ] := v\n OD;\n success OF res := ( high count OF res >= 2 AND sum OF res >= 75 )\n END # generate # ;\n\n RESULT res;\n success OF res := FALSE;\n WHILE NOT success OF res DO\n generate( res );\n print( ( \"attribs: \" ) );\n FOR i FROM LWB a OF res TO UPB a OF res DO\n print( ( whole( ( a OF res )[ i ], 0 ) ) );\n IF i < UPB a OF res THEN\n print( ( \" \" ) )\n FI\n OD;\n print( ( \" sum=\", whole( sum OF res, 0 )\n , \" highCount=\", whole( high count OF res, 0 )\n , \" \", IF success OF res THEN \"success\" ELSE \"failed\" FI\n , newline\n )\n )\n OD\n\nEND\n","language":"ALGOL-68"},{"code":"roll←{(+/-⌊/)¨?¨6/⊂4/6}⍣{(75≤+/⍺)∧2≤+/⍺≥15}\n","language":"APL"},{"code":"/* ARM assembly Raspberry PI */\n/* program rpg.s */\n\n/************************************/\n/* Constantes */\n/************************************/\n.equ STDOUT, 1 @ Linux output console\n.equ EXIT, 1 @ Linux syscall\n.equ WRITE, 4 @ Linux syscall\n\n.equ NBTIRAGES, 4\n.equ NBTIRAGESOK, 3\n.equ NBVALUES, 6\n.equ TOTALMIN, 75\n.equ MAXVALUE, 15\n.equ NBMAXVALUE, 2\n/*******************************************/\n/* Fichier des macros */\n/********************************************/\n.include \"../../ficmacros.s\"\n\n/*********************************/\n/* Initialized data */\n/*********************************/\n.data\nsMessResult: .ascii \"Value = \"\nsMessValeur: .fill 11, 1, ' ' @ size => 11\nszCarriageReturn: .asciz \"\\n\"\nsMessResultT: .ascii \"Total = \"\nsMessValeurT: .fill 11, 1, ' ' @ size => 11\n .asciz \"\\n\"\nsMessResultQ: .ascii \"Values above 15 = \"\nsMessValeurQ: .fill 11, 1, ' ' @ size => 11\n .asciz \"\\n\"\n\n.align 4\niGraine: .int 123456\n\n/*********************************/\n/* UnInitialized data */\n/*********************************/\n.bss\ntiTirages: .skip 4 * NBTIRAGES\ntiValues: .skip 4 * NBVALUES\n/*********************************/\n/* code section */\n/*********************************/\n.text\n.global main\nmain: @ entry of program\n\n1: @ begin loop 1\n mov r2,#0 @ counter value >15\n mov r4,#0 @ loop indice\n mov r5,#0 @ total\n ldr r3,iAdrtiValues @ table values address\n2:\n bl genValue @ call generate value\n str r0,[r3,r4,lsl #2] @ store in table\n add r5,r0 @ compute total\n cmp r0,#MAXVALUE @ count value > 15\n addge r2,#1\n add r4,#1 @ increment indice\n cmp r4,#NBVALUES @ end ?\n blt 2b\n cmp r5,#TOTALMIN @ compare 75\n blt 1b @ < loop\n cmp r2,#NBMAXVALUE @ compare value > 15\n blt 1b @ < loop\n ldr r0,iAdrtiValues @ display values\n bl displayTable\n mov r0,r5 @ total\n ldr r1,iAdrsMessValeurT @ display value\n bl conversion10 @ call conversion decimal\n ldr r0,iAdrsMessResultT\n bl affichageMess @ display message\n\n mov r0,r2 @ counter value > 15\n ldr r1,iAdrsMessValeurQ @ display value\n bl conversion10 @ call conversion decimal\n ldr r0,iAdrsMessResultQ\n bl affichageMess @ display message\n\n100: @ standard end of the program\n mov r0, #0 @ return code\n mov r7, #EXIT @ request to exit program\n svc #0 @ perform the system call\n\niAdrsMessValeur: .int sMessValeur\niAdrszCarriageReturn: .int szCarriageReturn\niAdrsMessResult: .int sMessResult\niAdrsMessValeurT: .int sMessValeurT\niAdrsMessResultT: .int sMessResultT\niAdrsMessValeurQ: .int sMessValeurQ\niAdrsMessResultQ: .int sMessResultQ\niAdrtiValues: .int tiValues\n/******************************************************************/\n/* generate value */\n/******************************************************************/\n/* r0 returns the value */\ngenValue:\n push {r1-r4,lr} @ save registers\n mov r4,#0 @ indice loop\n ldr r1,iAdrtiTirages @ table tirage address\n1:\n mov r0,#6\n bl genereraleas @ result 0 to 5\n add r0,#1 @ for 1 to 6\n str r0,[r1,r4,lsl #2] @ store tirage\n add r4,#1 @ increment indice\n cmp r4,#NBTIRAGES @ end ?\n blt 1b @ no -> loop\n ldr r0,iAdrtiTirages @ table tirage address\n mov r1,#0 @ first item\n mov r2,#NBTIRAGES @ number of tirages\n bl shellSort @ sort table decreasing\n mov r4,#0 @ raz indice loop\n mov r0,#0 @ total\n ldr r1,iAdrtiTirages @ table tirage address\n2:\n ldr r2,[r1,r4,lsl #2] @ read tirage\n add r0,r2 @ compute sum\n add r4,#1 @ inrement indice\n cmp r4,#NBTIRAGESOK @ end ?\n blt 2b\n100:\n pop {r1-r4,lr}\n bx lr @ return\niAdrtiTirages: .int tiTirages\n/***************************************************/\n/* shell Sort decreasing */\n/***************************************************/\n/* r0 contains the address of table */\n/* r1 contains the first element but not use !! */\n/* this routine use first element at index zero !!! */\n/* r2 contains the number of element */\nshellSort:\n push {r0-r7,lr} @save registers\n\n sub r2,#1 @ index last item\n mov r1,r2 @ init gap = last item\n1: @ start loop 1\n lsrs r1,#1 @ gap = gap / 2\n beq 100f @ if gap = 0 -> end\n mov r3,r1 @ init loop indice 1\n2: @ start loop 2\n ldr r4,[r0,r3,lsl #2] @ load first value\n mov r5,r3 @ init loop indice 2\n3: @ start loop 3\n cmp r5,r1 @ indice < gap\n blt 4f @ yes -> end loop 2\n sub r6,r5,r1 @ index = indice - gap\n ldr r7,[r0,r6,lsl #2] @ load second value\n cmp r4,r7 @ compare values\n strgt r7,[r0,r5,lsl #2] @ store if >\n subgt r5,r1 @ indice = indice - gap\n bgt 3b @ and loop\n4: @ end loop 3\n str r4,[r0,r5,lsl #2] @ store value 1 at indice 2\n add r3,#1 @ increment indice 1\n cmp r3,r2 @ end ?\n ble 2b @ no -> loop 2\n b 1b @ yes loop for new gap\n\n100: @ end function\n pop {r0-r7,lr} @ restaur registers\n bx lr @ return\n\n\n/******************************************************************/\n/* Display table elements */\n/******************************************************************/\n/* r0 contains the address of table */\ndisplayTable:\n push {r0-r3,lr} @ save registers\n mov r2,r0 @ table address\n mov r3,#0\n1: @ loop display table\n ldr r0,[r2,r3,lsl #2]\n ldr r1,iAdrsMessValeur @ display value\n bl conversion10 @ call function\n ldr r0,iAdrsMessResult\n bl affichageMess @ display message\n add r3,#1\n cmp r3,#NBVALUES - 1\n ble 1b\n ldr r0,iAdrszCarriageReturn\n bl affichageMess\n100:\n pop {r0-r3,lr}\n bx lr\n/******************************************************************/\n/* display text with size calculation */\n/******************************************************************/\n/* r0 contains the address of the message */\naffichageMess:\n push {r0,r1,r2,r7,lr} @ save registres\n mov r2,#0 @ counter length\n1: @ loop length calculation\n ldrb r1,[r0,r2] @ read octet start position + index\n cmp r1,#0 @ if 0 its over\n addne r2,r2,#1 @ else add 1 in the length\n bne 1b @ and loop\n @ so here r2 contains the length of the message\n mov r1,r0 @ address message in r1\n mov r0,#STDOUT @ code to write to the standard output Linux\n mov r7, #WRITE @ code call system \"write\"\n svc #0 @ call systeme\n pop {r0,r1,r2,r7,lr} @ restaur des 2 registres */\n bx lr @ return\n/******************************************************************/\n/* Converting a register to a decimal unsigned */\n/******************************************************************/\n/* r0 contains value and r1 address area */\n/* r0 return size of result (no zero final in area) */\n/* area size => 11 bytes */\n.equ LGZONECAL, 10\nconversion10:\n push {r1-r4,lr} @ save registers\n mov r3,r1\n mov r2,#LGZONECAL\n\n1: @ start loop\n bl divisionpar10U @ unsigned r0 <- dividende. quotient ->r0 reste -> r1\n add r1,#48 @ digit\n strb r1,[r3,r2] @ store digit on area\n cmp r0,#0 @ stop if quotient = 0\n subne r2,#1 @ else previous position\n bne 1b @ and loop\n @ and move digit from left of area\n mov r4,#0\n2:\n ldrb r1,[r3,r2]\n strb r1,[r3,r4]\n add r2,#1\n add r4,#1\n cmp r2,#LGZONECAL\n ble 2b\n @ and move spaces in end on area\n mov r0,r4 @ result length\n mov r1,#' ' @ space\n3:\n strb r1,[r3,r4] @ store space in area\n add r4,#1 @ next position\n cmp r4,#LGZONECAL\n ble 3b @ loop if r4 <= area size\n\n100:\n pop {r1-r4,lr} @ restaur registres\n bx lr @return\n\n/***************************************************/\n/* division par 10 unsigned */\n/***************************************************/\n/* r0 dividende */\n/* r0 quotient */\t\n/* r1 remainder */\ndivisionpar10U:\n push {r2,r3,r4, lr}\n mov r4,r0 @ save value\n //mov r3,#0xCCCD @ r3 <- magic_number lower raspberry 3\n //movt r3,#0xCCCC @ r3 <- magic_number higter raspberry 3\n ldr r3,iMagicNumber @ r3 <- magic_number raspberry 1 2\n umull r1, r2, r3, r0 @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0)\n mov r0, r2, LSR #3 @ r2 <- r2 >> shift 3\n add r2,r0,r0, lsl #2 @ r2 <- r0 * 5\n sub r1,r4,r2, lsl #1 @ r1 <- r4 - (r2 * 2) = r4 - (r0 * 10)\n pop {r2,r3,r4,lr}\n bx lr @ leave function\niMagicNumber: \t.int 0xCCCCCCCD\n/***************************************************/\n/* Generation random number */\n/***************************************************/\n/* r0 contains limit */\ngenereraleas:\n push {r1-r4,lr} @ save registers\n ldr r4,iAdriGraine\n ldr r2,[r4]\n ldr r3,iNbDep1\n mul r2,r3,r2\n ldr r3,iNbDep1\n add r2,r2,r3\n str r2,[r4] @ maj de la graine pour appel suivant\n cmp r0,#0\n beq 100f\n mov r1,r0 @ divisor\n mov r0,r2 @ dividende\n bl division\n mov r0,r3 @ résult = remainder\n\n100: @ end function\n pop {r1-r4,lr} @ restaur registers\n bx lr @ return\n/*****************************************************/\niAdriGraine: .int iGraine\niNbDep1: .int 0x343FD\niNbDep2: .int 0x269EC3\n/***************************************************/\n/* integer division unsigned */\n/***************************************************/\ndivision:\n /* r0 contains dividend */\n /* r1 contains divisor */\n /* r2 returns quotient */\n /* r3 returns remainder */\n push {r4, lr}\n mov r2, #0 @ init quotient\n mov r3, #0 @ init remainder\n mov r4, #32 @ init counter bits\n b 2f\n1: @ loop\n movs r0, r0, LSL #1 @ r0 <- r0 << 1 updating cpsr (sets C if 31st bit of r0 was 1)\n adc r3, r3, r3 @ r3 <- r3 + r3 + C. This is equivalent to r3 ? (r3 << 1) + C\n cmp r3, r1 @ compute r3 - r1 and update cpsr\n subhs r3, r3, r1 @ if r3 >= r1 (C=1) then r3 <- r3 - r1\n adc r2, r2, r2 @ r2 <- r2 + r2 + C. This is equivalent to r2 <- (r2 << 1) + C\n2:\n subs r4, r4, #1 @ r4 <- r4 - 1\n bpl 1b @ if r4 >= 0 (N=0) then loop\n pop {r4, lr}\n bx lr\n","language":"ARM-Assembly"},{"code":"vals: []\n\nwhile [or? 75 > sum vals\n 2 > size select vals => [&>=15]] [\n vals: new []\n\n while [6 > size vals][\n rands: new map 1..4 => [random 1 6]\n remove 'rands .once (min rands)\n 'vals ++ sum rands\n ]\n]\n\nprint [\"values:\" vals ]\nprint [\"with sum:\" sum vals]\n","language":"Arturo"},{"code":"100 REM RPG character generator\n110 DIM AT(5)\n120 DIM AT$(18)\n130 AT$=\"StrDexConIntWisCha\"\n140 PT=0:SA=0\n150 PRINT CHR$(125);CHR$(29);CHR$(31);\"Rolling...\"\n160 FOR AI=0 TO 5\n170 DT=0:MI=6:REM dice total, min die\n180 FOR I=0 TO 3\n190 D=INT(RND(1)*6)+1\n200 DT=DT+D\n210 IF D<MI THEN MI=D\n220 NEXT I\n230 DT=DT-MI\n240 AT(AI)=DT\n250 PT=PT+DT\n260 IF DT>=15 THEN SA=SA+1\n270 NEXT AI\n280 IF PT<75 OR SA<2 THEN 140\n290 PRINT CHR$(125);\"Character Attributes:\"\n300 PRINT\n310 FOR AI=0 TO 5\n315 POSITION 10,AI+2\n320 PRINT AT$(AI*3+1,AI*3+3);\":\";\n330 POSITION 16-INT(AT(AI)/10),AI+2\n340 PRINT AT(AI)\n350 NEXT AI\n360 POSITION 8,9\n370 PRINT \"Total: \";PT\n380 PRINT\n390 PRINT \"Do you accept? \";\n400 OPEN #1,4,0,\"K:\"\n410 GET #1,K\n420 IF K<>78 AND K<>89 THEN 410\n430 PRINT CHR$(K)\n440 CLOSE #1\n450 IF K=78 THEN 140\n460 POSITION 0,13\n470 PRINT \"Excellent. Good luck on your adventure!\"\n","language":"Atari-BASIC"},{"code":"function min(a, b)\n\tif a < b then return a else return b\nend function\n\nfunction d6()\n\t#simulates a marked regular hexahedron coming to rest on a plane\n\treturn 1 + int(rand * 6)\nend function\n\nfunction roll_stat()\n\t#rolls four dice, returns the sum of the three highest\n\ta = d6() : b = d6() : c = d6() : d = d6()\n\treturn a + b + c + d - min(min(a, b), min(c, d))\nend function\n\narraybase 1\ndim statnames$ = {\"STR\", \"CON\", \"DEX\", \"INT\", \"WIS\", \"CHA\"}\ndim stat(6)\nacceptable = false\n\ndo\n\tsum = 0 : n15 = 0\n\tfor i = 1 to 6\n\t\tstat[i] = roll_stat()\n\t\tsum += stat[i]\n\t\tif stat[i] >= 15 then n15 += 1\n\tnext i\n\tif sum >= 75 and n15 >= 2 then acceptable = true\nuntil acceptable\n\nfor i = 1 to 6\n\tprint statnames$[i]; \": \"; stat[i]\nnext i\nprint \"-------\"\nprint \"TOT: \"; sum\nend\n","language":"BASIC256"},{"code":" _while_←{𝔽⍟𝔾∘𝔽_𝕣_𝔾∘𝔽⍟𝔾𝕩}\n(2-modifier block)\n Roll←{𝕊:{𝕊:((+´-⌊´)1+4⊸•rand.Range)¨6⥊6}_while_{(75>+´𝕩)∨2>+´15≤𝕩}⟨⟩}\n(function block)\n Roll@\n⟨ 11 16 12 10 16 13 ⟩\n","language":"BQN"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n\nint compareInts(const void *i1, const void *i2) {\n int a = *((int *)i1);\n int b = *((int *)i2);\n return a - b;\n}\n\nint main() {\n int i, j, nsum, vsum, vcount, values[6], numbers[4];\n srand(time(NULL));\n for (;;) {\n vsum = 0;\n for (i = 0; i < 6; ++i) {\n for (j = 0; j < 4; ++j) {\n numbers[j] = 1 + rand() % 6;\n }\n qsort(numbers, 4, sizeof(int), compareInts);\n nsum = 0;\n for (j = 1; j < 4; ++j) {\n nsum += numbers[j];\n }\n values[i] = nsum;\n vsum += values[i];\n }\n if (vsum < 75) continue;\n vcount = 0;\n for (j = 0; j < 6; ++j) {\n if (values[j] >= 15) vcount++;\n }\n if (vcount < 2) continue;\n printf(\"The 6 random numbers generated are:\\n\");\n printf(\"[\");\n for (j = 0; j < 6; ++j) printf(\"%d \", values[j]);\n printf(\"\\b]\\n\");\n printf(\"\\nTheir sum is %d and %d of them are >= 15\\n\", vsum, vcount);\n break;\n }\n return 0;\n}\n","language":"C"},{"code":"#include <algorithm>\n#include <ctime>\n#include <iostream>\n#include <cstdlib>\n#include <string>\n\nusing namespace std;\n\nint main()\n{\n srand(time(0));\n\n unsigned int attributes_total = 0;\n unsigned int count = 0;\n int attributes[6] = {};\n int rolls[4] = {};\n\n while(attributes_total < 75 || count < 2)\n {\n attributes_total = 0;\n count = 0;\n\n for(int attrib = 0; attrib < 6; attrib++)\n {\n for(int roll = 0; roll < 4; roll++)\n {\n rolls[roll] = 1 + (rand() % 6);\n }\n\n sort(rolls, rolls + 4);\n int roll_total = rolls[1] + rolls[2] + rolls[3];\n\n attributes[attrib] = roll_total;\n attributes_total += roll_total;\n\n if(roll_total >= 15) count++;\n }\n }\n\n cout << \"Attributes generated : [\";\n cout << attributes[0] << \", \";\n cout << attributes[1] << \", \";\n cout << attributes[2] << \", \";\n cout << attributes[3] << \", \";\n cout << attributes[4] << \", \";\n cout << attributes[5];\n\n cout << \"]\\nTotal: \" << attributes_total;\n cout << \", Values above 15 : \" << count;\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nstatic class Module1\n{\n static Random r = new Random();\n\n static List<int> getThree(int n)\n {\n List<int> g3 = new List<int>();\n for (int i = 0; i < 4; i++) g3.Add(r.Next(n) + 1);\n g3.Sort(); g3.RemoveAt(0); return g3;\n }\n\n static List<int> getSix()\n {\n List<int> g6 = new List<int>();\n for (int i = 0; i < 6; i++) g6.Add(getThree(6).Sum());\n return g6;\n }\n\n static void Main(string[] args)\n {\n bool good = false; do {\n List<int> gs = getSix(); int gss = gs.Sum(); int hvc = gs.FindAll(x => x > 14).Count;\n Console.Write(\"attribs: {0}, sum={1}, ({2} sum, high vals={3})\",\n string.Join(\", \", gs), gss, gss >= 75 ? \"good\" : \"low\", hvc);\n Console.WriteLine(\" - {0}\", (good = gs.Sum() >= 75 && hvc > 1) ? \"success\" : \"failure\");\n } while (!good);\n }\n}\n","language":"C-sharp"},{"code":"% This program needs to be merged with PCLU's \"misc\" library\n% to use the random number generator.\n%\n% pclu -merge $CLUHOME/lib/misc.lib -compile rpg_gen.clu\n\n% Seed the random number generator with the current time\ninit_rng = proc ()\n d: date := now()\n seed: int := ((d.hour*60) + d.minute)*60 + d.second\n random$seed(seed)\nend init_rng\n\ncharacter = cluster is generate\n rep = null\n\n % Roll a die\n roll_die = proc () returns (int)\n return (1 + random$next(6))\n end roll_die\n\n % Roll four dice and get the sum of the highest three rolls\n roll_four_times = proc () returns (int)\n lowest: int := 7 % higher than any dice roll\n sum: int := 0\n for i: int in int$from_to(1,4) do\n roll: int := roll_die()\n sum := sum + roll\n if roll < lowest then lowest := roll end\n end\n return (sum - lowest)\n end roll_four_times\n\n % Try to generate a character by rolling six values\n try_generate = proc () returns (sequence[int])\n rolls: sequence[int] := sequence[int]$[]\n for i: int in int$from_to(1,6) do\n rolls := sequence[int]$addh(rolls, roll_four_times())\n end\n return (rolls)\n end try_generate\n\n % See if a character is valid\n valid = proc (c: sequence[int]) returns (bool)\n total: int := 0\n at_least_15: int := 0\n for i: int in sequence[int]$elements(c) do\n total := total + i\n if i >= 15 then at_least_15 := at_least_15 + 1 end\n end\n return (total >= 75 & at_least_15 >= 2)\n end valid\n\n % Generate a character\n generate = proc () returns (sequence[int])\n while true do\n c: sequence[int] := try_generate()\n if valid(c) then return(c) end\n end\n end generate\nend character\n\n% Generate a character and display the six values\nstart_up = proc ()\n po: stream := stream$primary_output()\n init_rng()\n hero: sequence[int] := character$generate()\n for stat: int in sequence[int]$elements(hero) do\n stream$putright(po, int$unparse(stat), 4)\n end\nend start_up\n","language":"CLU"},{"code":"100 rem rpg character roller\n110 rem rosetta code - commodore basic\n120 dim di(3):rem dice\n130 dim at(5),at$(5):rem attributes as follows:\n140 at$(0)=\"Strength\"\n150 at$(1)=\"Dexterity\"\n160 at$(2)=\"Constitution\"\n170 at$(3)=\"Intelligence\"\n180 at$(4)=\"Wisdom\"\n190 at$(5)=\"Charisma\"\n200 pt=0:sa=0:rem points total and number of strong attributes (15+)\n210 print chr$(147);chr$(14);chr$(29);chr$(17);\"Rolling...\"\n220 for ai=0 to 5:rem attribute index\n230 for i=0 to 3:di(i)=int(rnd(.)*6)+1:next i\n240 gosub 450\n250 dt=0:rem dice total\n260 for i=0 to 2:dt=dt+di(i):next i:rem take top 3\n270 at(ai)=dt:pt=pt+dt\n280 if dt>=15 then sa=sa+1\n290 next ai\n300 if pt<75 or sa<2 then goto 200\n310 print chr$(147);\"Character Attributes:\"\n320 print\n330 for ai=0 to 5\n340 print spc(13-len(at$(ai)));at$(ai);\":\";tab(14);at(ai)\n350 next ai\n360 print\n370 print \" Total:\";tab(14);pt\n380 print\n390 print \"Do you accept? \";\n400 get k$:if k$<>\"y\" and k$<>\"n\" then 400\n410 print k$\n420 if k$=\"n\" then goto 200\n430 print:print \"Excellent. Good luck on your adventure!\"\n440 end\n450 rem \"sort\" dice - really just put smallest one last\n460 for x=0 to 2\n470 if di(x)<di(x+1) then t=di(x):di(x)=di(x+1):di(x+1)=t\n480 next x\n490 return\n","language":"Commodore-BASIC"},{"code":"(defpackage :rpg-generator\n (:use :cl)\n (:export :generate))\n(in-package :rpg-generator)\n(defun sufficient-scores-p (scores)\n (and (>= (apply #'+ scores) 75)\n (>= (count-if #'(lambda (n) (>= n 15)) scores) 2)))\n\n(defun gen-score ()\n (apply #'+ (rest (sort (loop repeat 4 collect (1+ (random 6))) #'<))))\n\n(defun generate ()\n (loop for scores = (loop repeat 6 collect (gen-score))\n until (sufficient-scores-p scores)\n finally (format t \"Scores: ~A~%\" scores)\n (format t \"Total: ~A~%\" (apply #'+ scores))\n (format t \">= 15: ~A~%\" (count-if (lambda (n) (>= n 15)) scores))\n (return scores)))\n","language":"Common-Lisp"},{"code":";; 22.11.07 Draft\n\n(defun score-jet-des ()\n (loop :for resultat = (+ (random 6) 1)\n :repeat 4\n :sum resultat :into total\n :minimize resultat :into minimum\n :finally (return (- total minimum))))\n\n(defun calcule-attributs-personnage ()\n (loop named a\n :do (loop :for score = (score-jet-des)\n :repeat 6\n :collect score :into scores\n :sum score :into total\n :count (>= score 15) :into frequence\n :finally (when (and (>= total 75) (>= frequence 2))\n (return-from a (values scores total))))))\n","language":"Common-Lisp"},{"code":"include \"cowgol.coh\";\ninclude \"argv.coh\";\n\n# There is no random number generator in the standard library (yet?)\n# There is also no canonical source of randomness, and indeed,\n# on some target platforms (like CP/M) there is no guaranteed\n# source of randomness at all. Therefore, I implement the \"X ABC\"\n# random number generator, and ask for a seed on the command line.\n\nrecord RandState is\n x @at(0): uint8;\n a @at(1): uint8;\n b @at(2): uint8;\n c @at(3): uint8;\nend record;\n\nsub RandByte(s: [RandState]): (r: uint8) is\n s.x := s.x + 1;\n s.a := s.a ^ s.c ^ s.x;\n s.b := s.b + s.a;\n s.c := s.c + (s.b >> 1) ^ s.a;\n r := s.c;\nend sub;\n\n# Roll a d6\ntypedef D6 is int(1, 6);\nsub Roll(s: [RandState]): (r: D6) is\n var x: uint8;\n loop\n x := RandByte(s) & 7;\n if x < 6 then break; end if;\n end loop;\n r := x + 1;\nend sub;\n\n# Roll 4 D6es and get the sum of the 3 highest\nsub Roll4(s: [RandState]): (r: uint8) is\n r := 0;\n var lowest: uint8 := 0;\n var n: uint8 := 4;\n while n > 0 loop\n var roll := Roll(s);\n r := r + roll;\n if lowest > roll then\n lowest := roll;\n end if;\n n := n - 1;\n end loop;\n r := r - lowest;\nend sub;\n\n# Read random seed from command line\nvar randState: RandState;\n\nArgvInit();\nvar argmt := ArgvNext();\nif argmt == (0 as [uint8]) then\n print(\"Please give random seed on command line.\\n\");\n ExitWithError();\nend if;\n([&randState as [int32]], argmt) := AToI(argmt);\n\nvar total: uint8;\nvar attrs: uint8[6];\nvar i: @indexof attrs;\nloop\n var at15: uint8 := 0;\n i := 0;\n total := 0;\n\n # generate 6 attributes\n while i < 6 loop\n attrs[i] := Roll4(&randState);\n total := total + attrs[i];\n # count how many are higher than or equal to 15\n if attrs[i] >= 15 then\n at15 := at15 + 1;\n end if;\n i := i + 1;\n end loop;\n\n # if the requirements are met, then stop\n if total >= 75 and at15 >= 2 then\n break;\n end if;\nend loop;\n\n# Show the generated values\nprint(\"Attributes: \");\ni := 0;\nwhile i < 6 loop\n print_i8(attrs[i]);\n print_char(' ');\n i := i + 1;\nend loop;\nprint(\"\\nTotal: \");\nprint_i8(total);\nprint_nl();\n","language":"Cowgol"},{"code":"def roll_stat\n dices = Array(Int32).new(4) { rand(1..6) }\n dices.sum - dices.min\nend\n\ndef roll_character\n loop do\n stats = Array(Int32).new(6) { roll_stat }\n return stats if stats.sum >= 75 && stats.count(&.>=(15)) >= 2\n end\nend\n\n10.times do\n stats = roll_character\n puts \"stats: #{stats}, sum is #{stats.sum}\"\nend\n","language":"Crystal"},{"code":"program RPG_Attributes_Generator;\n\n{$APPTYPE CONSOLE}\n\n{$R *.res}\n\nuses\n System.SysUtils,\n System.Generics.Collections;\n\ntype\n TListOfInt = class(TList<Integer>)\n public\n function Sum: Integer;\n function FindAll(func: Tfunc<Integer, Boolean>): TListOfInt;\n function Join(const sep: string): string;\n end;\n\n{ TListOfInt }\n\nfunction TListOfInt.FindAll(func: Tfunc<Integer, Boolean>): TListOfInt;\nvar\n Item: Integer;\nbegin\n Result := TListOfInt.Create;\n if Assigned(func) then\n for Item in self do\n if func(Item) then\n Result.Add(Item);\nend;\n\nfunction TListOfInt.Join(const sep: string): string;\nvar\n Item: Integer;\nbegin\n Result := '';\n for Item in self do\n if Result.IsEmpty then\n Result := Item.ToString\n else\n Result := Result + sep + Item.ToString;\nend;\n\nfunction TListOfInt.Sum: Integer;\nvar\n Item: Integer;\nbegin\n Result := 0;\n for Item in self do\n Inc(Result, Item);\nend;\n\nfunction GetThree(n: integer): TListOfInt;\nvar\n i: Integer;\nbegin\n Randomize;\n Result := TListOfInt.Create;\n for i := 0 to 3 do\n Result.Add(Random(n) + 1);\n Result.Sort;\n Result.Delete(0);\nend;\n\nfunction GetSix(): TListOfInt;\nvar\n i: Integer;\n tmp: TListOfInt;\nbegin\n Result := TListOfInt.Create;\n for i := 0 to 5 do\n begin\n tmp := GetThree(6);\n Result.Add(tmp.Sum);\n tmp.Free;\n end;\nend;\n\nconst\n GOOD_STR: array[Boolean] of string = ('low', 'good');\n SUCCESS_STR: array[Boolean] of string = ('failure', 'success');\n\nvar\n good: Boolean;\n gs, hvcList: TListOfInt;\n gss, hvc: Integer;\n\nbegin\n good := false;\n repeat\n gs := GetSix();\n gss := gs.Sum;\n\n hvcList := gs.FindAll(\n function(x: Integer): Boolean\n begin\n result := x > 14;\n end);\n hvc := hvcList.Count;\n hvcList.Free;\n\n Write(Format('Attribs: %s, sum=%d, (%s sum, high vals=%d)', [gs.Join(', '),\n gss, GOOD_STR[gss >= 75], hvc]));\n\n good := (gss >= 75) and (hvc > 1);\n\n Writeln(' - ', SUCCESS_STR[good]);\n\n gs.Free;\n until good;\n Readln;\nend.\n","language":"Delphi"},{"code":"func getThree(n) {\n var g3 = []\n for i in 0..33 {\n g3.Add(rnd(max: n) + 1)\n }\n g3.Sort()\n g3.RemoveAt(0)\n g3\n}\n\nfunc getSix() {\n var g6 = []\n for i in 0..5 {\n g6.Add(getThree(6).Sum())\n }\n g6\n}\n\nfunc Array.Sum() {\n var acc = 0\n for x in this {\n acc += x\n }\n acc\n}\n\nfunc Array.FindAll(pred) {\n for x in this when pred(x) {\n yield x\n }\n}\n\nvar good = false\n\nwhile !good {\n var gs = getSix()\n var gss = gs.Sum()\n var hvc = gs.FindAll(x => x > 14).Length()\n print(\"attribs: \\(gs), sum=\\(gss), \", terminator: \"\")\n let gl = gss >= 75 ? \"good\" : \"low\"\n print(\"(\\(gl) sum, high vals=\\(hvc))\", terminator: \"\")\n good = gs.Sum() >= 75 && hvc > 1\n print(\" - \" + (good ? \"success\" : \"failure\"))\n}\n","language":"Dyalect"},{"code":"func rollstat .\n for i to 4\n h = randint 6\n s += h\n min = lower min h\n .\n return s - min\n.\nstate$[] = [ \"STR\" \"CON\" \"DEX\" \"INT\" \"WIS\" \"CHA\" ]\nlen stat[] 6\nrepeat\n sum = 0\n n15 = 0\n for i to 6\n stat[i] = rollstat\n sum += stat[i]\n if stat[i] >= 15\n n15 += 1\n .\n .\n until sum >= 75 and n15 >= 2\n.\nfor i to 6\n print state$[i] & \": \" & stat[i]\n.\nprint \"-------\"\nprint \"TOT: \" & sum\n","language":"EasyLang"},{"code":"USING: combinators.short-circuit dice formatting io kernel math\nmath.statistics qw sequences ;\nIN: rosetta-code.rpg-attributes-generator\n\nCONSTANT: stat-names qw{ Str Dex Con Int Wis Cha }\n\n: attribute ( -- n )\n 4 [ ROLL: 1d6 ] replicate 3 <iota> kth-largests sum ;\n\n: stats ( -- seq ) 6 [ attribute ] replicate ;\n\n: valid-stats? ( seq -- ? )\n { [ [ 15 >= ] count 2 >= ] [ sum 75 >= ] } 1&& ;\n\n: generate-valid-stats ( -- seq )\n stats [ dup valid-stats? ] [ drop stats ] until ;\n\n: stats-info ( seq -- )\n [ sum ] [ [ 15 >= ] count ] bi\n \"Total: %d\\n# of attributes >= 15: %d\\n\" printf ;\n\n: main ( -- )\n generate-valid-stats dup stat-names swap\n [ \"%s: %d\\n\" printf ] 2each nl stats-info ;\n\nMAIN: main\n","language":"Factor"},{"code":"01.10 S T=0\n01.20 F X=1,6;D 4;S AT(X)=S3;S T=T+S3\n01.30 I (T-75)1.1\n01.40 S K=0;F X=1,6;D 2\n01.50 I (K-2)1.1\n01.55 T \"STR DEX CON INT WIS CHA TOTAL\",!\n01.60 F X=1,6;T %2,AT(X),\" \"\n01.70 T T,!\n01.80 Q\n\n02.10 I (AT(X)-15)2.3,2.2,2.2\n02.20 S K=K+1\n02.30 R\n\n04.01 C--ROLL 4 D6ES AND GIVE SUM OF LARGEST 3\n04.10 S XS=7;S S3=0;S XN=4\n04.20 D 6;S S3=S3+A;I (XS-A)4.4,4.4,4.3\n04.30 S XS=A\n04.40 S XN=XN-1;I (XN),4.5,4.2\n04.50 S S3=S3-XS\n\n06.01 C--ROLL A D6\n06.10 S A=FRAN()*10;S A=A-FITR(A)\n06.20 S A=1+FITR(A*6)\n","language":"FOCAL"},{"code":"require random.fs\n: d6 ( -- roll ) 6 random 1 + ;\n\nvariable smallest\n: genstat ( -- stat )\n d6 dup smallest !\n 3 0 do\n d6 dup smallest @ < if dup smallest ! then +\n loop\n smallest @ -\n;\n\nvariable strong\nvariable total\n: genstats ( -- cha wis int con dex str )\n 0 strong !\n 0 total !\n 6 0 do\n genstat\n dup 15 >= if strong @ 1 + strong ! then\n dup total @ + total !\n loop\n total @ 75 < strong @ 2 < or if\n drop drop drop drop drop drop\n recurse\n then\n;\n\n: roll ( -- )\n genstats\n .\" str:\" . .\" dex:\" . .\" con:\" .\n .\" int:\" . .\" wis:\" . .\" cha:\" .\n .\" (total:\" total @ . 8 emit .\" )\"\n;\n\nutime drop seed !\n","language":"Forth"},{"code":"#define min(a, b) iif(a < b, a, b)\n\nfunction d6() as integer\n 'simulates a marked regular hexahedron coming to rest on a plane\n return 1+int(rnd*6)\nend function\n\nfunction roll_stat() as integer\n 'rolls four dice, returns the sum of the three highest\n dim as integer a=d6(), b=d6(), c=d6(), d=d6()\n return a + b + c + d - min( min(a, b), min(c, d) )\nend function\n\ndim as string*3 statnames(1 to 6) = {\"STR\", \"CON\", \"DEX\", \"INT\", \"WIS\", \"CHA\"}\ndim as integer stat(1 to 6), n15, sum\ndim as boolean acceptable = false\n\nrandomize timer\ndo\n sum = 0\n n15 = 0\n for i as integer = 1 to 6\n stat(i) = roll_stat()\n sum = sum + stat(i)\n if stat(i)>=15 then n15 += 1\n next i\n if sum>=75 and n15 >=2 then acceptable = true\nloop until acceptable\n\nfor i as integer = 1 to 6\n print using \"&: ##\";statnames(i);stat(i)\nnext i\nprint \"--------\"\nprint using \"TOT: ##\";sum\n","language":"FreeBASIC"},{"code":"_elements = 6\n\nlocal fn min( a as long, b as long ) as long\n long result\n if ( a < b )\n result = a : exit fn\n else\n result = b : exit fn\n end if\nend fn = result\n\nlocal fn d6 as long\n long result\n result = 1 + int( rnd(_elements) )\nend fn = result\n\nlocal fn roll_stat as long\n long result\n long a = fn d6, b = fn d6, c = fn d6, d = fn d6\n result = a + b + c + d - fn min( fn min( a, b ), fn min( c, d ) )\nend fn = result\n\nlocal fn DoIt\n CFArrayRef statnames = @[@\"Strength\",@\"Constitution\",@\"Dexterity\",@\"Intelligence\",@\"Wisdom\",@\"Charisma\"]\n long stat(_elements), n15, sum, i\n BOOL acceptable = NO\n\n randomize\n do\n sum = 0\n n15 = 0\n for i = 1 to _elements\n stat(i) = fn roll_stat\n sum = sum + stat(i)\n if stat(i) >= 15 then n15++\n next\n if sum >= 75 and n15 >= 2 then acceptable = YES\n until ( acceptable = YES )\n\n for i = 1 to _elements\n printf @\"%12s %3ld\", fn StringUTF8String( statnames[i -1] ), stat(i)\n next\n printf @\"------------\"\n printf @\"%13s %3ld\", \"Total:\", sum\nend fn\n\nfn DoIt\n\nHandleEvents\n","language":"FutureBasic"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/rand\"\n \"sort\"\n \"time\"\n)\n\nfunc main() {\n s := rand.NewSource(time.Now().UnixNano())\n r := rand.New(s)\n for {\n var values [6]int\n vsum := 0\n for i := range values {\n var numbers [4]int\n for j := range numbers {\n numbers[j] = 1 + r.Intn(6)\n }\n sort.Ints(numbers[:])\n nsum := 0\n for _, n := range numbers[1:] {\n nsum += n\n }\n values[i] = nsum\n vsum += values[i]\n }\n if vsum < 75 {\n continue\n }\n vcount := 0\n for _, v := range values {\n if v >= 15 {\n vcount++\n }\n }\n if vcount < 2 {\n continue\n }\n fmt.Println(\"The 6 random numbers generated are:\")\n fmt.Println(values)\n fmt.Println(\"\\nTheir sum is\", vsum, \"and\", vcount, \"of them are >= 15\")\n break\n }\n}\n","language":"Go"},{"code":"import Control.Monad (replicateM)\nimport System.Random (randomRIO)\nimport Data.Bool (bool)\nimport Data.List (sort)\n\ncharacter :: IO [Int]\ncharacter =\n discardUntil\n (((&&) . (75 <) . sum) <*> ((2 <=) . length . filter (15 <=)))\n (replicateM 6 $ sum . tail . sort <$> replicateM 4 (randomRIO (1, 6 :: Int)))\n\ndiscardUntil :: ([Int] -> Bool) -> IO [Int] -> IO [Int]\ndiscardUntil p throw = go\n where\n go = throw >>= (<*>) (bool go . return) p\n\n-------------------------- TEST ---------------------------\nmain :: IO ()\nmain = replicateM 10 character >>= mapM_ (print . (sum >>= (,)))\n","language":"Haskell"},{"code":"roll=: 1 + 4 6 ?@:$ 6:\nmassage=: +/ - <./\ngenerate_attributes=: massage@:roll\naccept=: (75 <: +/) *. (2 <: [: +/ 15&<:)\nUntil=: conjunction def 'u^:(0-:v)^:_'\n\nNB. show displays discarded attribute sets\nNB. and since roll ignores arguments, echo would suffice in place of show\nshow=: [ echo\n\nNB. use: generate_character 'name'\ngenerate_character=: (; (+/ ; ])@:([: generate_attributes@:show Until accept 0:))&>@:boxopen\n","language":"J"},{"code":"import java.util.List;\nimport java.util.Random;\nimport java.util.stream.Stream;\n\nimport static java.util.stream.Collectors.toList;\n\npublic class Rpg {\n\n private static final Random random = new Random();\n\n public static int genAttribute() {\n return random.ints(1, 6 + 1) // Throw dices between 1 and 6\n .limit(4) // Do 5 throws\n .sorted() // Sort them\n .limit(3) // Take the top 3\n .sum(); // Sum them\n }\n\n public static void main(String[] args) {\n while (true) {\n List<Integer> stats =\n Stream.generate(Rpg::genAttribute) // Generate some stats\n .limit(6) // Take 6\n .collect(toList()); // Save them in an array\n int sum = stats.stream().mapToInt(Integer::intValue).sum();\n long count = stats.stream().filter(v -> v >= 15).count();\n if (count >= 2 && sum >= 75) {\n System.out.printf(\"The 6 random numbers generated are: %s\\n\", stats);\n System.out.printf(\"Their sum is %s and %s of them are >= 15\\n\", sum, count);\n return;\n }\n }\n }\n}\n","language":"Java"},{"code":"function roll() {\n const stats = {\n total: 0,\n rolls: []\n }\n let count = 0;\n\n for(let i=0;i<=5;i++) {\n let d6s = [];\n\n for(let j=0;j<=3;j++) {\n d6s.push(Math.ceil(Math.random() * 6))\n }\n\n d6s.sort().splice(0, 1);\n rollTotal = d6s.reduce((a, b) => a+b, 0);\n\n stats.rolls.push(rollTotal);\n stats.total += rollTotal;\n }\n\n return stats;\n}\n\nlet rolledCharacter = roll();\n\nwhile(rolledCharacter.total < 75 || rolledCharacter.rolls.filter(a => a >= 15).length < 2){\n rolledCharacter = roll();\n}\n\nconsole.log(`The 6 random numbers generated are:\n${rolledCharacter.rolls.join(', ')}\n\nTheir sum is ${rolledCharacter.total} and ${rolledCharacter.rolls.filter(a => a >= 15).length} of them are >= 15`);\n","language":"JavaScript"},{"code":"(() => {\n 'use strict';\n\n // main :: IO ()\n const main = () =>\n // 10 random heroes drawn from\n // a non-finite series.\n unlines(map(\n xs => show(sum(xs)) +\n ' -> [' + show(xs) + ']',\n\n take(10, heroes(\n seventyFivePlusWithTwo15s\n ))\n ));\n\n // seventyFivePlusWithTwo15s :: [Int] -> Bool\n const seventyFivePlusWithTwo15s = xs =>\n // Total score over 75,\n // with two or more qualities scoring 15.\n 75 < sum(xs) && 1 < length(filter(\n x => 15 === x, xs\n ));\n\n // heroes :: Gen IO [(Int, Int, Int, Int, Int, Int)]\n function* heroes(p) {\n // Non-finite list of heroes matching\n // the requirements of predicate p.\n while (true) {\n yield hero(p)\n }\n }\n\n // hero :: (Int -> Bool) -> IO (Int, Int, Int, Int, Int, Int)\n const hero = p =>\n // A random character matching the\n // requirements of predicate p.\n until(p, character, []);\n\n // character :: () -> IO [Int]\n const character = () =>\n // A random character with six\n // integral attributes.\n map(() => sum(tail(sort(map(\n randomRInt(1, 6),\n enumFromTo(1, 4)\n )))),\n enumFromTo(1, 6)\n );\n\n\n // GENERIC FUNCTIONS ----------------------------------\n\n // enumFromTo :: (Int, Int) -> [Int]\n const enumFromTo = (m, n) =>\n Array.from({\n length: 1 + n - m\n }, (_, i) => m + i);\n\n // filter :: (a -> Bool) -> [a] -> [a]\n const filter = (f, xs) => xs.filter(f);\n\n // Returns Infinity over objects without finite length.\n // This enables zip and zipWith to choose the shorter\n // argument when one is non-finite, like cycle, repeat etc\n\n // length :: [a] -> Int\n const length = xs =>\n (Array.isArray(xs) || 'string' === typeof xs) ? (\n xs.length\n ) : Infinity;\n\n // map :: (a -> b) -> [a] -> [b]\n const map = (f, xs) =>\n (Array.isArray(xs) ? (\n xs\n ) : xs.split('')).map(f);\n\n // e.g. map(randomRInt(1, 10), enumFromTo(1, 20))\n\n // randomRInt :: Int -> Int -> IO () -> Int\n const randomRInt = (low, high) => () =>\n low + Math.floor(\n (Math.random() * ((high - low) + 1))\n );\n\n // show :: a -> String\n const show = x => x.toString()\n\n // sort :: Ord a => [a] -> [a]\n const sort = xs => xs.slice()\n .sort((a, b) => a < b ? -1 : (a > b ? 1 : 0));\n\n // sum :: [Num] -> Num\n const sum = xs => xs.reduce((a, x) => a + x, 0);\n\n // tail :: [a] -> [a]\n const tail = xs => 0 < xs.length ? xs.slice(1) : [];\n\n // take :: Int -> [a] -> [a]\n // take :: Int -> String -> String\n const take = (n, xs) =>\n 'GeneratorFunction' !== xs.constructor.constructor.name ? (\n xs.slice(0, n)\n ) : [].concat.apply([], Array.from({\n length: n\n }, () => {\n const x = xs.next();\n return x.done ? [] : [x.value];\n }));\n\n // unlines :: [String] -> String\n const unlines = xs => xs.join('\\n');\n\n // until :: (a -> Bool) -> (a -> a) -> a -> a\n const until = (p, f, x) => {\n let v = x;\n while (!p(v)) v = f(v);\n return v;\n };\n\n // MAIN ---\n return main();\n})();\n","language":"JavaScript"},{"code":"def count(s): reduce s as $x (0; .+1);\n\n# Output: a PRN in range(0;$n) where $n is .\ndef prn:\n if . == 1 then 0\n else . as $n\n | (($n-1)|tostring|length) as $w\n | [limit($w; inputs)] | join(\"\") | tonumber\n | if . < $n then . else ($n | prn) end\n end;\n\n# Output: [$four, $sum]\n# where $four is an array of 4 pseudo-random integers between 1 and 6 inclusive,\n# and $sum records the sum of the 3 largest values.\ndef generate_RPG:\n [range(0; 4) | (1 + (7|prn) )] as $four\n | [$four, ($four|sort|.[-3:]|add)];\n\n# Input: $six as produced by [range(0;6) | generate_RPG]\n# Determine if the following conditions are met:\n# - the total of all 6 of the values at .[-1] is at least 75;\n# - at least 2 of these values must be 15 or more.\ndef ok:\n ([.[][-1]] | add) as $sum\n | $sum >= 75 and\n count( (.[][1] >= 15) // empty) >= 2;\n\n# First show [range(0;6) | generate_RPG]\n# and then determine if it meets the \"ok\" condition;\n# if not, repeat until a solution has been found.\ndef task:\n [range(0;6) | generate_RPG] as $six\n | ([$six[][-1]] | add) as $sum\n | $six[], \"Sum: \\($sum)\",\n if $six | ok then \"All done.\"\n else \"continuing search ...\",\n ({}\n | until(.emit;\n [range(0;6) | generate_RPG] as $six\n | ([$six[][-1]] | add) as $sum\n | if $six | ok\n then .emit = {$six, $sum}\n else .\n end).emit\n | (.six[], \"Sum: \\(.sum)\" ) )\n end;\n\ntask\n","language":"Jq"},{"code":"roll_skip_lowest(dice, sides) = (r = rand(collect(1:sides), dice); sum(r) - minimum(r))\n\nfunction rollRPGtoon()\n attributes = zeros(Int, 6)\n attsum = 0\n gte15 = 0\n\n while attsum < 75 || gte15 < 2\n for i in 1:6\n attributes[i] = roll_skip_lowest(4, 6)\n end\n attsum = sum(attributes)\n gte15 = mapreduce(x -> x >= 15, +, attributes)\n end\n\n println(\"New RPG character roll: $attributes. Sum is $attsum, and $gte15 are >= 15.\")\nend\n\nrollRPGtoon()\nrollRPGtoon()\nrollRPGtoon()\n","language":"Julia"},{"code":"import kotlin.random.Random\n\nfun main() {\n while (true) {\n val values = List(6) {\n val rolls = generateSequence { 1 + Random.nextInt(6) }.take(4)\n rolls.sorted().take(3).sum()\n }\n val vsum = values.sum()\n val vcount = values.count { it >= 15 }\n if (vsum < 75 || vcount < 2) continue\n println(\"The 6 random numbers generated are: $values\")\n println(\"Their sum is $vsum and $vcount of them are >= 15\")\n break\n }\n}\n","language":"Kotlin"},{"code":"#!/bin/ksh\n\n# RPG attributes generator\n\n#\t# Variables:\n#\ntypeset -a attribs=( strength dexterity constitution intelligence wisdom charisma )\ninteger MINTOT=75 MIN15S=2\n\n#\t# Functions:\n#\n# # Function _diceroll(sides, number, reportAs) - roll number of side-sided\n# # dice, report (s)sum or (a)array (pseudo) of results\n#\nfunction _diceroll {\n typeset _sides ; integer _sides=$1 # Number of sides of dice\n typeset _numDice ; integer _numDice=$2 # Number of dice to roll\n typeset _rep ; typeset -l -L1 _rep=\"$3\" # Report type: (sum || array)\n\n typeset _seed ; (( _seed = SECONDS / $$ )) ; _seed=${_seed#*\\.}\n typeset _i _sum ; integer _i _sum=0\n typeset _arr ; typeset -a _arr\n\n RANDOM=${_seed}\n for (( _i=0; _i<_numDice; _i++ )); do\n (( _arr[_i] = (RANDOM % _sides) + 1 ))\n [[ ${_rep} == s ]] && (( _sum += _arr[_i] ))\n done\n\n if [[ ${_rep} == s ]]; then\n echo ${_sum}\n else\n echo \"${_arr[@]}\"\n fi\n}\n\n#\t# Function _sumarr(n arr) - Return the sum of the first n arr elements\n#\nfunction _sumarr {\n\ttypeset _n ; integer _n=$1\n\ttypeset _arr ; nameref _arr=\"$2\"\n\ttypeset _i _sum ; integer _i _sum\n\n\tfor ((_i=0; _i<_n; _i++)); do\n\t\t(( _sum+=_arr[_i] ))\n\tdone\n\techo ${_sum}\n}\n\n ######\n# main #\n ######\n\nuntil (( total >= MINTOT )) && (( cnt15 >= MIN15S )); do\n\tinteger total=0 cnt15=0\n\tunset attrval ; typeset -A attrval\n\tfor attr in ${attribs[*]}; do\n\t\tunset darr ; typeset -a darr=( $(_diceroll 6 4 a) )\n\t\tset -sK:nr -A darr\n\t\tattrval[${attr}]=$(_sumarr 3 darr)\n\t\t(( total += attrval[${attr}] ))\n\t\t(( attrval[${attr}] > 14 )) && (( cnt15++ ))\n\tdone\ndone\n\nfor attr in ${attribs[*]}; do\n\tprintf \"%12s: %2d\\n\" ${attr} ${attrval[${attr}]}\ndone\nprint \"Attribute value total: ${total}\"\nprint \"Attribule count >= 15: ${cnt15}\"\n","language":"Ksh"},{"code":"data:\nattributes is number list\ni is number\nattr is number\nsum is number\ncount is number\n\nprocedure:\nsub attribute\n parameters:\n result is number\n local data:\n min is number\n n is number\n i is number\n procedure:\n store 6 in min\n for i from 0 to 4 step 1 do\n get random in n\n in n solve 6 * n + 1\n floor n\n add n and result in result\n if n is less than min then\n store n in min\n end if\n repeat\n subtract min from result in result\nend sub\ncreate statement \"get attribute in $\" executing attribute\n\nlabel generate-attributes\nfor i from 0 to 6 step 1 do\n get attribute in attr\n add attr and sum in sum\n if attr is greater than 14 then\n add count and 1 in count\n end if\n push attr to attributes\n store 0 in attr\nrepeat\n\nif sum is less than 75 or count is less than 2 then\n display \"Failed...\" lf\n store 0 in sum\n store 0 in count\n clear attributes\n goto generate-attributes\nend if\n\nfor each attr in attributes do\n display attr \" \"\nrepeat\ndisplay lf \"Sum: \" sum lf \">14: \" count lf\n","language":"LDPL"},{"code":"valid = False;\nWhile[! valid,\n try = Map[Total[TakeLargest[#, 3]] &,\n RandomInteger[{1, 6}, {6, 4}]];\n If[Total[try] > 75 && Count[try, _?(GreaterEqualThan[15])] >= 2,\n valid = True;\n ]\n ]\n{Total[try], try}\n","language":"Mathematica"},{"code":"randomize ; Seed the rng with current timestamp.\n\n; Implement some general operators we'll need that aren't in the library.\n(() 0 shorten) :new\n((new (over -> swons)) dip times nip) :replicate\n(('' '' '') => spread if) :if?\n((1 0 if?) concat map sum) :count\n\n(5 random succ) :d6 ; Roll a 1d6.\n('d6 4 replicate '< sort 3 take sum) :attr ; Roll an attribute.\n('attr 6 replicate) :attrs ; Roll 6 attributes.\n(sum 75 >=) :big? ; Is a set of attributes \"big?\"\n(attrs (dup big?) () (pop attrs) () linrec) :big ; Roll a set of big attributes.\n((15 >=) count 2 >=) :special? ; Is a set of atributes \"special?\"\n(big (dup special?) () (pop big) () linrec) :stats ; Roll a set of big and special attributes.\n\nstats puts \"Total: \" print! sum puts!\n","language":"Min"},{"code":"roll = function()\n results = []\n for i in range(0,3)\n results.push ceil(rnd * 6)\n end for\n results.sort\n results.remove 0\n return results.sum\nend function\n\nwhile true\n attributes = []\n gt15 = 0 // (how many attributes > 15)\n for i in range(0,5)\n attributes.push roll\n if attributes[i] > 15 then gt15 = gt15 + 1\n end for\n\n print \"Attribute values: \" + attributes.join(\", \")\n print \"Attributes total: \" + attributes.sum\n\n if attributes.sum >= 75 and gt15 >= 2 then break\n print \"Attributes failed, rerolling\"\n print\nend while\nprint \"Success!\"\n","language":"MiniScript"},{"code":"# Import \"random\" to get random numbers and \"algorithm\" to get sorting functions for arrays.\nimport random, algorithm\n\nrandomize()\n\nproc diceFourRolls(): array[4, int] =\n ## Generates 4 random values between 1 and 6.\n for i in 0 .. 3:\n result[i] = rand(1..6)\n\nproc sumRolls(rolls: array[4, int]): int =\n ## Save the sum of the 3 highest values rolled.\n var sorted = rolls\n sorted.sort()\n # By sorting first and then starting the iteration on 1 instead of 0, the lowest number is discarded even if it is repeated.\n for i in 1 .. 3:\n result += sorted[i]\n\nfunc twoFifteens(attr: var array[6, int]): bool =\n attr.sort()\n # Sorting implies than the second to last number is lesser than or equal to the last.\n if attr[4] < 15: false else: true\n\nvar sixAttr: array[6, int]\n\nwhile true:\n var sumAttr = 0\n for i in 0 .. 5:\n sixAttr[i] = sumRolls(diceFourRolls())\n sumAttr += sixAttr[i]\n echo \"The roll sums are, in order: \", sixAttr, \", which adds to \", sumAttr\n if not twoFifteens(sixAttr) or sumAttr < 75: echo \"Not good enough. Rerolling...\"\n else: break\n","language":"Nim"},{"code":"(* Task : RPG_attributes_generator *)\n\n(*\n\tA programmatic solution to generating character attributes for an RPG\n*)\n\n(* Generates random whole values between 1 and 6. *)\nlet rand_die () : int = Random.int 6\n\n(* Generates 4 random values and saves the sum of the 3 largest *)\nlet rand_attr () : int =\n\tlet four_rolls = [rand_die (); rand_die (); rand_die (); rand_die ()]\n\t\t|> List.sort compare in\n\tlet three_best = List.tl four_rolls in\n\tList.fold_left (+) 0 three_best\n\n(* Generates a total of 6 values this way. *)\nlet rand_set () : int list=\n\t[rand_attr (); rand_attr (); rand_attr ();\n\trand_attr (); rand_attr (); rand_attr ()]\n\n(* Verifies conditions: total >= 75, at least 2 >= 15 *)\nlet rec valid_set () : int list=\n\tlet s = rand_set () in\n\tlet above_15 = List.fold_left (fun acc el -> if el >= 15 then acc + 1 else acc) 0 s in\n\tlet total = List.fold_left (+) 0 s in\n\tif above_15 >= 2 && total >= 75\n\tthen s\n\telse valid_set ()\n\n(*** Output ***)\n\nlet _ =\n\tlet s = valid_set () in\n\tList.iter (fun i -> print_int i; print_string \", \") s\n","language":"OCaml"},{"code":"program attributes;\n\nvar\n total, roll,score, count: integer;\n atribs : array [1..6] of integer;\n\nbegin\n randomize; {Initalise the random number genertor}\n repeat\n count:=0;\n total:=0;\n for score :=1 to 6 do begin\n {roll:=random(18)+1; produce a number up to 18, pretty much the same results}\n for diceroll:=1 to 4 do dice[diceroll]:=random(6)+1; {roll 4 six sided die}\n\n {find lowest rolled dice. If we roll two or more equal low rolls then we\n\t eliminate the first of them, change '<' to '<=' to eliminate last low die}\n lowroll:=7;\n\t lowdie:=0;\n\t for diceroll:=1 to 4 do if (dice[diceroll] < lowroll) then begin\n\t lowroll := dice[diceroll];\n\t lowdie := diceroll;\n\t end;\n {add up higest three dice}\n\t roll:=0;\n\t for diceroll:=1 to 4 do if (diceroll <> lowdie) then roll := roll + dice[diceroll];\n atribs[score]:=roll;\n total := total + roll;\n if (roll>15) then count:=count+1;\n end;\n until ((total>74) and (count>1)); {this evens out different rolling methods }\n { Prettily print the attributes out }\n writeln('Attributes :');\n for count:=1 to 6 do\n writeln(count,'.......',atribs[count]:2);\n writeln(' ---');\n writeln('Total ',total:3);\n writeln(' ---');\nend.\n","language":"Pascal"},{"code":"use strict;\nuse List::Util 'sum';\n\nmy ($min_sum, $hero_attr_min, $hero_count_min) = <75 15 3>;\nmy @attr_names = <Str Int Wis Dex Con Cha>;\n\nsub heroic { scalar grep { $_ >= $hero_attr_min } @_ }\n\nsub roll_skip_lowest {\n my($dice, $sides) = @_;\n sum( (sort map { 1 + int rand($sides) } 1..$dice)[1..$dice-1] );\n}\n\nmy @attr;\ndo {\n @attr = map { roll_skip_lowest(6,4) } @attr_names;\n} until sum(@attr) >= $min_sum and heroic(@attr) >= $hero_count_min;\n\nprintf \"%s = %2d\\n\", $attr_names[$_], $attr[$_] for 0..$#attr;\nprintf \"Sum = %d, with %d attributes >= $hero_attr_min\\n\", sum(@attr), heroic(@attr);\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">numbers</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">numbers</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">ni</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sq_rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">numbers</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ni</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ni</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">numbers</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_ge</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">numbers</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">15</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">75</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"re-rolling...\"</span> <span style=\"color: #000080;font-style:italic;\">-- (occasionally >20)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"The 6 attributes generated are:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"strength %d, dexterity %d, constitution %d, \"</span><span style=\"color: #0000FF;\">&</span>\n <span style=\"color: #008000;\">\"intelligence %d, wisdom %d, and charisma %d.\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">numbers</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\nTheir sum is %d and %d of them are >=15\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">})</span>\n<!--\n","language":"Phix"},{"code":"/# Rosetta Code problem: https://rosettacode.org/wiki/RPG_attributes_generator\nby Galileo, 11/2022 #/\n\ninclude ..\\Utilitys.pmt\n\ndef d6 rand 6 * int 1 + enddef\n\n( \"STR\" \"CON\" \"DEX\" \"INT\" \"WIS\" \"CHA\" )\n\ntrue while\n 0 0\n 6 for drop 0 >ps\n ( d6 d6 d6 d6 ) len for get ps> + >ps endfor\n min ps> swap -\n dup >ps +\n tps 15 > if swap 1 + swap endif\n endfor\n 75 >= swap 2 >= and not\nendwhile\n\n0 swap\n6 for\n get print \": \" print swap tps + swap ps> ?\nendfor\n\ndrop \"-------\" ? \"TOT: \" print ?\n","language":"Phixmonti"},{"code":"<?php\n\n$attributesTotal = 0;\n$count = 0;\n\nwhile($attributesTotal < 75 || $count < 2) {\n $attributes = [];\n\n foreach(range(0, 5) as $attribute) {\n $rolls = [];\n\n foreach(range(0, 3) as $roll) {\n $rolls[] = rand(1, 6);\n }\n\n sort($rolls);\n array_shift($rolls);\n\n $total = array_sum($rolls);\n\n if($total >= 15) {\n $count += 1;\n }\n\n $attributes[] = $total;\n }\n\n $attributesTotal = array_sum($attributes);\n}\n\nprint_r($attributes);\n","language":"PHP"},{"code":"<?php\n\nclass CharacterGenerator {\n public static function roll(): array\n {\n $attributes = array_map(fn($stat) => self::rollStat(), range(1, 6));\n\n if (!self::meetsRequirements($attributes)) {\n return self::roll();\n }\n\n return $attributes;\n }\n\n private static function rollStat(): int\n {\n $rolls = d(6, 4);\n return array_sum($rolls) - min($rolls);\n }\n\n private static function meetsRequirements(array $attributes): bool\n {\n $twoOrMoreOverFifteen = array_reduce($attributes, fn($n, $stat) => $n + ($stat > 15)) >= 2;\n $sumOfAttributesMeetsMinimum = array_sum($attributes) >= 75;\n\n return $sumOfAttributesMeetsMinimum && $twoOrMoreOverFifteen;\n }\n}\n\nfunction d(int $d, int $numberToRoll): array\n{\n return array_map(fn($roll) => rand(1, $d), range(1, $numberToRoll));\n}\n\n$characterAttributes = CharacterGenerator::roll();\n$attributesString = implode(', ', $characterAttributes);\n$attributesTotal = array_sum($characterAttributes);\n\nprint \"Attribute Total: $attributesTotal\\n\";\nprint \"Attributes: $attributesString\";\n","language":"PHP"},{"code":"To add an attribute to some stats:\nAllocate memory for an entry.\nPut the attribute into the entry's attribute.\nAppend the entry to the stats.\n\nAn attribute is a number.\n\nAn entry is a thing with an attribute.\n\nTo find a count of attributes greater than fourteen in some stats:\nPut 0 into the count.\nGet an entry from the stats.\nLoop.\nIf the entry is nil, exit.\nIf the entry's attribute is greater than 14, bump the count.\nPut the entry's next into the entry.\nRepeat.\n\nTo find a sum of some stats:\nPut 0 into the sum.\nGet an entry from the stats.\nLoop.\nIf the entry is nil, exit.\nAdd the entry's attribute to the sum.\nPut the entry's next into the entry.\nRepeat.\n\nTo generate an attribute:\nPut 0 into the attribute.\nPut 6 into a minimum number.\nLoop.\nIf a counter is past 4, break.\nPick a number between 1 and 6.\nAdd the number to the attribute.\nIf the number is less than the minimum, put the number into the minimum.\nRepeat.\nSubtract the minimum from the attribute.\n\nTo generate some stats (raw):\nIf a counter is past 6, exit.\nGenerate an attribute.\nAdd the attribute to the stats.\nRepeat.\n\nTo generate some stats (valid):\nGenerate some raw stats (raw).\nFind a sum of the raw stats.\nIf the sum is less than 75, destroy the raw stats; repeat.\nFind a count of attributes greater than fourteen in the raw stats.\nIf the count is less than 2, destroy the raw stats; repeat.\nPut the raw stats into the stats.\n\nTo run:\nStart up.\nShow some RPG attributes.\nWait for the escape key.\nShut down.\n\nTo show some RPG attributes:\nGenerate some stats (valid).\nFind a sum of the stats.\nFind a count of attributes greater than fourteen in the stats.\nWrite the stats on the console.\nDestroy the stats.\nWrite \"Total: \" then the sum on the console.\nWrite \"Number of stats greater than fourteen: \" then the count on the console.\n\nSome stats are some entries.\n\nA sum is a number.\n\nTo write some stats on the console:\nGet an entry from the stats.\nLoop.\nIf the entry is nil, write \"\" on the console; exit.\nConvert the entry's attribute to a string.\nWrite the string on the console without advancing.\nIf the entry's next is not nil, write \", \" on the console without advancing.\nPut the entry's next into the entry.\nRepeat.\n","language":"Plain-English"},{"code":"#heroicAttributeMinimum = 15\n#heroicAttributeCountMinimum = 2\n#attributeSumMinimum = 75\n#attributeCount = 6\n\nProcedure roll_attribute()\n Protected i, sum\n Dim rolls(3)\n\n For i = 0 To 3\n rolls(i) = Random(6, 1)\n Next i\n\n ;sum the highest three rolls\n SortArray(rolls(), #PB_Sort_Descending)\n For i = 0 To 2\n sum + rolls(i)\n Next\n ProcedureReturn sum\nEndProcedure\n\nProcedure displayAttributes(List attributes(), sum, heroicCount)\n Protected output$\n\n output$ = \"Attributes generated: [\"\n ForEach attributes()\n output$ + attributes()\n If ListIndex(attributes()) <> #attributeCount - 1: output$ + \", \": EndIf\n Next\n output$ + \"]\"\n PrintN(output$)\n PrintN(\"Total: \" + sum + \", Values \" + #heroicAttributeMinimum + \" or above: \" + heroicCount)\nEndProcedure\n\nProcedure Gen_attributes()\n Protected i, attributesSum, heroicAttributesCount\n\n NewList attributes()\n Repeat\n ClearList(attributes())\n attributesSum = 0: heroicAttributesCount = 0\n For i = 1 To #attributeCount\n AddElement(attributes())\n attributes() = roll_attribute()\n attributesSum + attributes()\n heroicAttributesCount + Bool(attributes() >= #heroicAttributeMinimum)\n Next\n Until attributesSum >= #attributeSumMinimum And heroicAttributesCount >= #heroicAttributeCountMinimum\n\n displayAttributes(attributes(), attributesSum, heroicAttributesCount)\nEndProcedure\n\nIf OpenConsole(\"RPG Attributes Generator\")\n Gen_attributes()\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\"): Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"import random\nrandom.seed()\nattributes_total = 0\ncount = 0\n\nwhile attributes_total < 75 or count < 2:\n attributes = []\n\n for attribute in range(0, 6):\n rolls = []\n\n for roll in range(0, 4):\n result = random.randint(1, 6)\n rolls.append(result)\n\n sorted_rolls = sorted(rolls)\n largest_3 = sorted_rolls[1:]\n rolls_total = sum(largest_3)\n\n if rolls_total >= 15:\n count += 1\n\n attributes.append(rolls_total)\n\n attributes_total = sum(attributes)\n\nprint(attributes_total, attributes)\n","language":"Python"},{"code":"import random\nrandom.seed()\ntotal = 0\ncount = 0\n\nwhile total < 75 or count < 2:\n attributes = [(sum(sorted([random.randint(1, 6) for roll in range(0, 4)])[1:])) for attribute in range(0, 6)]\n\n for attribute in attributes:\n if attribute >= 15:\n count += 1\n\n total = sum(attributes)\n\nprint(total, attributes)\n","language":"Python"},{"code":"import random\n\ndef compute():\n values = []\n while (sum(values) < 75 # Total must be >= 75\n or sum(1 for v in values if v >= 15) < 2): # Two must be >= 15\n values = [sum(sorted(random.randint(1, 6) for _ in range(4))[1:]) for _ in range(6)]\n return sum(values), values\n\nfor i in range(3):\n print(*compute())\n","language":"Python"},{"code":"'''RPG Attributes Generator'''\n\nfrom itertools import islice\nfrom random import randint\nfrom operator import eq\n\n\n# heroes :: Gen IO [(Int, Int, Int, Int, Int, Int)]\ndef heroes(p):\n '''Non-finite list of heroes matching\n the requirements of predicate p.\n '''\n while True:\n yield tuple(\n until(p)(character)([])\n )\n\n\n# character :: () -> IO [Int]\ndef character(_):\n '''A random character with six\n integral attributes.\n '''\n return [\n sum(sorted(map(\n randomRInt(1)(6),\n enumFromTo(1)(4)\n ))[1:])\n for _ in enumFromTo(1)(6)\n ]\n\n\n# ------------------------- TEST --------------------------\n# main :: IO ()\ndef main():\n '''Test :: Sample of 10'''\n\n # seventyFivePlusWithTwo15s :: [Int] -> Bool\n def seventyFivePlusIncTwo15s(xs):\n '''Sums to 75 or more,\n and includes at least two 15s.\n '''\n return 75 <= sum(xs) and (\n 1 < len(list(filter(curry(eq)(15), xs)))\n )\n\n print('A sample of 10:\\n')\n print(unlines(\n str(sum(x)) + ' -> ' + str(x) for x\n in take(10)(heroes(\n seventyFivePlusIncTwo15s\n ))\n ))\n\n\n# ------------------------- GENERIC -------------------------\n\n# curry :: ((a, b) -> c) -> a -> b -> c\ndef curry(f):\n '''A curried function derived\n from an uncurried function.\n '''\n return lambda x: lambda y: f(x, y)\n\n\n# enumFromTo :: Int -> Int -> [Int]\ndef enumFromTo(m):\n '''Enumeration of integer values [m..n]'''\n return lambda n: range(m, 1 + n)\n\n\n# randomRInt :: Int -> Int -> IO () -> Int\ndef randomRInt(m):\n '''The return value of randomRInt is itself\n a function. The returned function, whenever\n called, yields a a new pseudo-random integer\n in the range [m..n].\n '''\n return lambda n: lambda _: randint(m, n)\n\n\n# take :: Int -> [a] -> [a]\n# take :: Int -> String -> String\ndef take(n):\n '''The prefix of xs of length n,\n or xs itself if n > length xs.\n '''\n return lambda xs: (\n xs[0:n]\n if isinstance(xs, (list, tuple))\n else list(islice(xs, n))\n )\n\n\n# unlines :: [String] -> String\ndef unlines(xs):\n '''A single string formed by the intercalation\n of a list of strings with the newline character.\n '''\n return '\\n'.join(xs)\n\n\n# until :: (a -> Bool) -> (a -> a) -> a -> a\ndef until(p):\n '''The result of repeatedly applying f until p holds.\n The initial seed value is x.\n '''\n def go(f, x):\n v = x\n while not p(v):\n v = f(v)\n return v\n return lambda f: lambda x: go(f, x)\n\n\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"import random; print((lambda attr: f\"Attributes: {attr}\\nTotal: {sum(attr)}\")((lambda func, roll_func: func(func, roll_func, roll_func()))((lambda func, roll_func, rolls: rolls if sum(rolls) >= 75 and rolls.count(15) >= 2 else func(func, roll_func, roll_func())), lambda: [sum(sorted(random.randint(1, 6) for _ in range(4))[1:]) for _ in range(6)])))\n","language":"Python"},{"code":"[ 0 swap witheach + ] is sum ( [ --> n )\n\n[ 0 ]'[ rot witheach\n [ over do swap dip + ] drop ] is count ( [ --> n )\n\n[ [] 4 times\n [ 6 random 1+ join ]\n sort behead drop sum ] is attribute ( --> n )\n\n[ [] 6 times\n [ attribute join ] ] is raw ( --> [ )\n\n[ dup sum 74 > not iff\n [ drop false ] done\n count [ 14 > ] 1 > ] is valid ( [ --> b )\n\n[ raw dup valid if\n done\n drop again ] is stats ( --> [ )\n\nrandomise\nstats dup echo cr cr\nsay 'Sum: ' dup sum echo cr\nsay '# of attributes > 14: '\ncount [ 14 > ] echo\n","language":"Quackery"},{"code":"genStats <- function()\n{\n stats <- c(STR = 0, DEX = 0, CON = 0, INT = 0, WIS = 0, CHA = 0)\n for(i in seq_along(stats))\n {\n results <- sample(6, 4, replace = TRUE)\n stats[i] <- sum(results[-which.min(results)])\n }\n if(sum(stats >= 15) < 2 || (stats[\"TOT\"] <- sum(stats)) < 75) Recall() else stats\n}\nprint(genStats())\n","language":"R"},{"code":"#lang racket\n\n(define (d6 . _)\n (+ (random 6) 1))\n\n(define (best-3-of-4d6 . _)\n (apply + (rest (sort (build-list 4 d6) <))))\n\n(define (generate-character)\n (let* ((rolls (build-list 6 best-3-of-4d6))\n (total (apply + rolls)))\n (if (or (< total 75) (< (length (filter (curryr >= 15) rolls)) 2))\n (generate-character)\n (values rolls total))))\n\n(module+ main\n (define-values (rolled-stats total) (generate-character))\n (printf \"Rolls:\\t~a~%Total:\\t~a\" rolled-stats total))\n","language":"Racket"},{"code":"my ( $min_sum, $hero_attr_min, $hero_count_min ) = 75, 15, 2;\nmy @attr-names = <Str Int Wis Dex Con Cha>;\n\nsub heroic { + @^a.grep: * >= $hero_attr_min }\n\nmy @attr;\nrepeat until @attr.sum >= $min_sum\n and heroic(@attr) >= $hero_count_min {\n\n @attr = @attr-names.map: { (1..6).roll(4).sort(+*).skip(1).sum };\n}\n\nsay @attr-names Z=> @attr;\nsay \"Sum: {@attr.sum}, with {heroic(@attr)} attributes >= $hero_attr_min\";\n","language":"Raku"},{"code":"Red [\"RPG attributes generator\"]\n\nraw-attribute: does [\n sum next sort collect [\n loop 4 [keep random/only 6]\n ]\n]\n\nraw-attributes: does [\n collect [\n loop 6 [keep raw-attribute]\n ]\n]\n\nvalid-attributes?: func [b][\n n: 0\n foreach attr b [\n if attr > 14 [n: n + 1]\n ]\n all [\n n > 1\n greater? sum b 74\n ]\n]\n\nattributes: does [\n until [\n valid-attributes? a: raw-attributes\n ]\n a\n]\n\nshow-attributes: function [a][\n i: 1\n foreach stat-name [\n \"Strength\"\n \"Dexterity\"\n \"Constitution\"\n \"Intelligence\"\n \"Wisdom\"\n \"Charisma\"\n ][\n print [rejoin [stat-name \":\"] a/:i]\n i: i + 1\n ]\n print \"-----------------\"\n print [\"Sum:\" sum a]\n print [n \"attributes > 14\"]\n]\n\nshow-attributes attributes\n","language":"Red"},{"code":"/* REXX\nGenerates 4 random, whole values between 1 and 6.\nSaves the sum of the 3 largest values.\nGenerates a total of 6 values this way.\nDisplays the total, and all 6 values once finished.\n*/\nDo try=1 By 1\n ge15=0\n sum=0\n ol=''\n Do i=1 To 6\n rl=''\n Do j=1 To 4\n rl=rl (random(5)+1)\n End\n rl=wordsort(rl)\n rsum.i=maxsum()\n If rsum.i>=15 Then ge15=ge15+1\n sum=sum+rsum.i\n ol=ol right(rsum.i,2)\n End\n Say ol '->' ge15 sum\n If ge15>=2 & sum>=75 Then Leave\n End\nSay try 'iterations'\nSay ol '=>' sum\nExit\n\nmaxsum: procedure Expose rl\n/**********************************************************************\n* Comute the sum of the 3 largest values\n**********************************************************************/\n m=0\n Do i=2 To 4\n m=m+word(rl,i)\n End\n Return m\n\nwordsort: Procedure\n/**********************************************************************\n* Sort the list of words supplied as argument. Return the sorted list\n**********************************************************************/\n Parse Arg wl\n wa.=''\n wa.0=0\n Do While wl<>''\n Parse Var wl w wl\n Do i=1 To wa.0\n If wa.i>w Then Leave\n End\n If i<=wa.0 Then Do\n Do j=wa.0 To i By -1\n ii=j+1\n wa.ii=wa.j\n End\n End\n wa.i=w\n wa.0=wa.0+1\n End\n swl=''\n Do i=1 To wa.0\n swl=swl wa.i\n End\n Return strip(swl)\n","language":"REXX"},{"code":"/*REXX program generates values for six core attributes for a RPG (Role Playing Game).*/\n do until m>=2 & $$>=75; $$= 0; list= /*do rolls until requirements are met. */\n m= 0 /*the number of values ≥ 15 (so far).*/\n do 6; $= 0 /*6 values (meet criteria); attrib. sum*/\n do d=1 for 4; @.d= random(1, 6) /*roll four random dice (six sided die)*/\n $= $ + @.d /*also obtain their sum (of die pips).*/\n end /*d*/ /* [↓] use of MIN BIF avoids sorting.*/\n $= $ - min(@.1, @.2, @.3, @.4) /*obtain the sum of the highest 3 rolls*/\n list= list $; $$= $$ + $ /*append $──►list; add $ to overall $$.*/\n $$= $$ + $ /*add the $ sum to the overall sum. */\n m= m + ($>=15) /*get # of rolls that meet the minimum.*/\n end /*do 6*/ /* [↑] gen six core attribute values. */\n end /*until*/ /*stick a fork in it, we're all done. */\nsay 'The total for ' list \" is ──► \" $$', ' m \" entries are ≥ 15.\"\n","language":"REXX"},{"code":"/*REXX program generates values for six core attributes for an RPG (Role Playing Game).*/\nDo n=1 By 1 until m>=2 & tot>=75;\n slist=''\n tot=0\n m=0\n Do 6\n sum=0\n Do d=1 To 4;\n cast.d=random(1,6)\n sum=sum+cast.d\n End\n min=min(cast.1,cast.2,cast.3,cast.4)\n sum=sum-min\n slist=slist sum\n tot=tot+sum\n m=m+(sum>=15)\n end\n Say 'the total for' space(slist) 'is -->' tot', 'm' entries are >= 15.'\n end\nSay 'Solution found with' n 'iterations'\n","language":"REXX"},{"code":"# Project : RPG Attributes Generator\n\nload \"stdlib.ring\"\nattributestotal = 0\ncount = 0\nwhile attributestotal < 75 or count < 2\n attributes = []\n for attribute = 0 to 6\n rolls = []\n largest3 = []\n for roll = 0 to 4\n result = random(5)+1\n add(rolls,result)\n next\n sortedrolls = sort(rolls)\n sortedrolls = reverse(sortedrolls)\n for n = 1 to 3\n add(largest3,sortedrolls[n])\n next\n rollstotal = sum(largest3)\n if rollstotal >= 15\n count = count + 1\n ok\n add(attributes,rollstotal)\n next\n attributestotal = sum(attributes)\nend\nshowline()\n\nfunc sum(aList)\n num = 0\n for n = 1 to len(aList)\n num = num + aList[n]\n next\n return num\n\nfunc showline()\n line = \"(\" + attributestotal + \", [\"\n for n = 1 to len(attributes)\n line = line + attributes[n] + \", \"\n next\n line = left(line,len(line)-2)\n line = line + \"])\"\n see line + nl\n","language":"Ring"},{"code":"res = []\nuntil res.sum >= 75 && res.count{|n| n >= 15} >= 2 do\n res = Array.new(6) do\n a = Array.new(4){rand(1..6)}\n a.sum - a.min\n end\nend\n\np res\nputs \"sum: #{res.sum}\"\n","language":"Ruby"},{"code":"dim statnames$(6)\ndata \"STR\", \"CON\", \"DEX\", \"INT\", \"WIS\", \"CHA\"\nfor i = 1 to 6\n read statnames$(i)\nnext i\ndim stat(6)\nacceptable = false\n\nwhile 1\n sum = 0 : n15 = 0\n for i = 1 to 6\n stat(i) = rollstat()\n sum = sum + stat(i)\n\tif stat(i) >= 15 then n15 = n15 + 1\n next i\n if sum >= 75 and n15 >= 2 then exit while\nwend\n\nfor i = 1 to 6\n print statnames$(i); \": \"; stat(i)\nnext i\nprint \"-------\"\nprint \"TOT: \"; sum\nend\n\nfunction d6()\n d6 = 1 + int(rnd(1) * 6)\nend function\n\nfunction rollstat()\n a = d6() : b = d6() : c = d6() : d = d6()\n rollstat = a + b + c + d - min(min(a, b), min(c, d))\nend function\n","language":"Run-BASIC"},{"code":"use rand::distributions::Uniform;\nuse rand::prelude::{thread_rng, ThreadRng};\nuse rand::Rng;\n\nfn main() {\n for _ in 0..=10 {\n attributes_engine();\n }\n}\n\n#[derive(Copy, Clone, Debug)]\npub struct Dice {\n amount: i32,\n range: Uniform<i32>,\n rng: ThreadRng,\n}\n\nimpl Dice {\n // Modeled after d20 polyhederal dice use and notation.\n // roll_pool() - returns Vec<i32> with length of vector determined by dice amount.\n // attribute_out() - returns i32, by sorting a dice pool of 4d6, dropping the lowest integer, and summing all elements.\n pub fn new(amount: i32, size: i32) -> Self {\n Self {\n amount,\n range: Uniform::new(1, size + 1),\n rng: thread_rng(),\n }\n }\n\n fn roll_pool(mut self) -> Vec<i32> {\n (0..self.amount)\n .map(|_| self.rng.sample(self.range))\n .collect()\n }\n\n fn attribute_out(&self) -> i32 {\n // Sort dice pool lowest to high and drain all results to exclude the lowest before summing.\n let mut attribute_array: Vec<i32> = self.roll_pool();\n attribute_array.sort();\n attribute_array.drain(1..=3).sum()\n }\n}\n\nfn attributes_finalizer() -> (Vec<i32>, i32, bool) {\n let die: Dice = Dice::new(4, 6);\n let mut attributes: Vec<i32> = Vec::new();\n\n for _ in 0..6 {\n attributes.push(die.attribute_out())\n }\n\n let attributes_total: i32 = attributes.iter().sum();\n\n let numerical_condition: bool = attributes\n .iter()\n .filter(|attribute| **attribute >= 15)\n .count()\n >= 2;\n\n (attributes, attributes_total, numerical_condition)\n}\n\nfn attributes_engine() {\n loop {\n let (attributes, attributes_total, numerical_condition) = attributes_finalizer();\n if (attributes_total >= 75) && (numerical_condition) {\n println!(\n \"{:?} | sum: {:?}\",\n attributes, attributes_total\n );\n break;\n } else {\n continue;\n }\n }\n}\n","language":"Rust"},{"code":"import scala.util.Random\nRandom.setSeed(1)\n\ndef rollDice():Int = {\n val v4 = Stream.continually(Random.nextInt(6)+1).take(4)\n v4.sum - v4.min\n}\n\ndef getAttributes():Seq[Int] = Stream.continually(rollDice()).take(6)\n\ndef getCharacter():Seq[Int] = {\n val attrs = getAttributes()\n println(\"generated => \" + attrs.mkString(\"[\",\",\", \"]\"))\n (attrs.sum, attrs.filter(_>15).size) match {\n case (a, b) if (a < 75 || b < 2) => getCharacter\n case _ => attrs\n }\n}\n\nprintln(\"picked => \" + getCharacter.mkString(\"[\", \",\", \"]\"))\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n\nconst proc: main is func\n local\n var integer: count is 0;\n var integer: total is 0;\n var integer: attribIdx is 0;\n var integer: diceroll is 0;\n var integer: sumOfRolls is 0;\n var array integer: attribute is 6 times 0;\n var array integer: dice is 4 times 0;\n begin\n repeat\n count := 0;\n total := 0;\n for key attribIdx range attribute do\n for key diceroll range dice do\n dice[diceroll] := rand(1, 6);\n end for;\n dice := sort(dice);\n sumOfRolls := 0;\n for diceroll range 2 to maxIdx(dice) do # Discard the lowest roll\n sumOfRolls +:= dice[diceroll];\n end for;\n attribute[attribIdx] := sumOfRolls;\n total +:= sumOfRolls;\n if sumOfRolls >= 15 then\n incr(count);\n end if;\n end for;\n until total >= 75 and count >= 2;\n writeln(\"Attributes:\");\n for key attribIdx range attribute do\n writeln(attribIdx <& \" ..... \" <& attribute[attribIdx] lpad 2);\n end for;\n writeln(\" ----\");\n writeln(\"Total \" <& total lpad 3);\n end func;\n","language":"Seed7"},{"code":"FUNCTION min(a, b)\n IF a < b THEN LET min = a ELSE LET min = b\nEND FUNCTION\n\nFUNCTION d6\n LET d6 = 1 + INT(RND * 6)\nEND FUNCTION\n\nFUNCTION rollstat\n LET a = d6\n LET b = d6\n LET c = d6\n LET d = d6\n LET rollstat = a + b + c + d - min(min(a, b), min(c, d))\nEND FUNCTION\n\nDIM statnames$(6)\nDATA \"STR\", \"CON\", \"DEX\", \"INT\", \"WIS\", \"CHA\"\nFOR i = 1 TO 6\n READ statnames$(i)\nNEXT i\nDIM stat(6)\nLET acceptable = 0\n\nRANDOMIZE ! RANDOMIZE TIMER en QBasic\nDO\n LET sum = 0\n LET n15 = 0\n FOR i = 1 to 6\n LET stat(i) = rollstat\n LET sum = sum + stat(i)\n IF stat(i) >= 15 THEN LET n15 = n15 + 1\n NEXT i\n IF sum >= 75 AND n15 >= 2 THEN LET acceptable = 1\nLOOP UNTIL acceptable = 1\n\nFOR i = 1 to 6\n PRINT statnames$(i); \": \"; stat(i)\nNEXT i\nPRINT \"--------\"\nPRINT \"TOT: \"; sum\nEND\n","language":"True-BASIC"},{"code":"function main {\n typeset attrs=(str dex con int wis cha)\n typeset -A values\n typeset attr\n typeset -i value total fifteens\n while true; do\n fifteens=0\n total=0\n for attr in \"${attrs[@]}\"; do\n # \"random\" values repeat in zsh if run in a subshell\n r4d6drop >/tmp/$$\n read value </tmp/$$\n values[$attr]=$value\n (( total += value ))\n if (( value >= 15 )); then\n (( fifteens += 1 ))\n fi\n done\n if (( total >= 75 && fifteens >= 2 )); then\n break\n fi\n done\n rm -f /tmp/$$\n for attr in \"${attrs[@]}\"; do\n printf '%s: %d\\n' \"$attr\" \"${values[$attr]}\"\n done\n}\n\nfunction r4d6drop {\n typeset -i d1=RANDOM%6+1 d2=RANDOM%6+1 d3=RANDOM%6+1 d4=RANDOM%6+1\n typeset e=$(printf '%s\\n' $d1 $d2 $d3 $d4 |\n sort -n | tail -n +2 | tr $'\\n' +)\n printf '%d\\n' $(( ${e%+} ))\n}\n\nmain \"$@\"\n","language":"UNIX-Shell"},{"code":"Module Module1\n\n Dim r As New Random\n\n Function getThree(n As Integer) As List(Of Integer)\n getThree = New List(Of Integer)\n For i As Integer = 1 To 4 : getThree.Add(r.Next(n) + 1) : Next\n getThree.Sort() : getThree.RemoveAt(0)\n End Function\n\n Function getSix() As List(Of Integer)\n getSix = New List(Of Integer)\n For i As Integer = 1 To 6 : getSix.Add(getThree(6).Sum) : Next\n End Function\n\n Sub Main(args As String())\n Dim good As Boolean = False : Do\n Dim gs As List(Of Integer) = getSix(), gss As Integer = gs.Sum,\n hvc As Integer = gs.FindAll(Function(x) x > 14).Count\n Console.Write(\"attribs: {0}, sum={1}, ({2} sum, high vals={3})\",\n String.Join(\", \", gs), gss, If(gss >= 75, \"good\", \"low\"), hvc)\n good = gs.Sum >= 75 AndAlso hvc > 1\n Console.WriteLine(\" - {0}\", If(good, \"success\", \"failure\"))\n Loop Until good\n End Sub\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"random\" for Random\nimport \"./sort\" for Sort\n\nvar rand = Random.new()\nvar vals = List.filled(6, 0)\nwhile (true) {\n for (i in 0..5) {\n var rns = List.filled(4, 0)\n for (j in 0..3) rns[j] = rand.int(1, 7)\n var sum = rns.reduce { |acc, n| acc + n }\n Sort.insertion(rns)\n vals[i] = sum - rns[0]\n }\n var total = vals.reduce { |acc, n| acc + n }\n if (total >= 75) {\n var fifteens = vals.count { |n| n >= 15 }\n if (fifteens >= 2) {\n System.print(\"The six values are: %(vals)\")\n System.print(\"Their total is: %(total)\")\n break\n }\n }\n}\n","language":"Wren"},{"code":"func Gen; \\Return sum of the three largest of four random values\nint I, R, Min, SI, Sum, Die(4);\n[Min:= 7; Sum:= 0;\nfor I:= 0 to 4-1 do\n [R:= Ran(6)+1; \\R = 1..6\n if R < Min then\n [Min:= R; SI:= I];\n Sum:= Sum+R;\n Die(I):= R;\n ];\nreturn Sum - Die(SI);\n];\n\nint Total, Count, J, Value(6);\n[repeat Total:= 0; Count:= 0;\n for J:= 0 to 6-1 do\n [Value(J):= Gen;\n if Value(J) >= 15 then Count:= Count+1;\n Total:= Total + Value(J);\n ];\nuntil Total >= 75 and Count >= 2;\nText(0, \"Total: \"); IntOut(0, Total); CrLf(0);\nfor J:= 0 to 6-1 do\n [IntOut(0, Value(J)); ChOut(0, ^ )];\nCrLf(0);\n]\n","language":"XPL0"},{"code":"sub d6()\n //simulates a marked regular hexahedron coming to rest on a plane\n return 1 + int(ran(6))\nend sub\n\nsub roll_stat()\n //rolls four dice, returns the sum of the three highest\n a = d6() : b = d6(): c = d6(): d = d6()\n return a + b + c + d - min(min(a, b), min(c, d))\nend sub\n\ndim statnames$(6)\nstatnames$(1) = \"STR\"\nstatnames$(2) = \"CON\"\nstatnames$(3) = \"DEX\"\nstatnames$(4) = \"INT\"\nstatnames$(5) = \"WIS\"\nstatnames$(6) = \"CHA\"\n\ndim stat(6)\nacceptable = false\n\nrepeat\n sum = 0\n n15 = 0\n for i = 1 to 6\n stat(i) = roll_stat()\n sum = sum + stat(i)\n if stat(i) >= 15 then n15 = n15 + 1 : fi\n next i\n if sum >= 75 and n15 >= 2 then acceptable = true : fi\nuntil acceptable\n\nfor i = 1 to 6\n print statnames$(i), \": \", stat(i) using \"##\"\nnext i\nprint \"-------\\nTOT: \", sum\nend\n","language":"Yabasic"},{"code":"const std = @import(\"std\");\n\nconst dice = 6;\nconst rolls = 4;\nconst stat_count = 6;\n\n// requirements\nconst min_stat_sum = 75;\nconst min_high_stat_count = 2;\nconst high_stat_threshold = 15;\n\nconst RollResult = struct { stats: [stat_count]u16, total: u16 };\n\nfn roll_attribute(rand: std.rand.Random) u16 {\n var min_roll: u16 = dice;\n var total: u16 = 0;\n\n for (0..rolls) |_| {\n const roll = rand.uintAtMost(u16, dice - 1) + 1;\n if (min_roll > roll) {\n min_roll = roll;\n }\n total += roll;\n }\n\n return total - min_roll;\n}\n\nfn roll_stats(rand: std.rand.Random) RollResult {\n var result: RollResult = RollResult{\n .stats = undefined,\n .total = 0,\n };\n var high_stat_count: u16 = 0;\n\n var i: u16 = 0;\n while (i < stat_count) {\n // roll a stat\n result.stats[i] = roll_attribute(rand);\n result.total += result.stats[i];\n if (result.stats[i] >= high_stat_threshold) high_stat_count += 1;\n\n // find the maximum possible total\n const stats_remain = stat_count - i - 1;\n const max_possible_total = result.total + dice * (rolls - 1) * stats_remain;\n\n // if it is below the minimum or there are not enough stats over 15 reset\n if (max_possible_total < min_stat_sum or high_stat_count + stats_remain < 2) {\n i = 0;\n result.total = 0;\n high_stat_count = 0;\n } else {\n i += 1;\n }\n }\n\n return result;\n}\n\npub fn main() !void {\n // Create random generator\n var prng = std.rand.DefaultPrng.init(blk: {\n var seed: u64 = undefined;\n try std.os.getrandom(std.mem.asBytes(&seed));\n break :blk seed;\n });\n const rand = prng.random();\n\n const stats = roll_stats(rand);\n const stdout = std.io.getStdOut().writer();\n\n try stdout.print(\"Total: {}\\n\", .{stats.total});\n try stdout.print(\"Stats: [ \", .{});\n for (stats.stats) |stat| {\n try stdout.print(\"{} \", .{stat});\n }\n try stdout.print(\"]\\n\", .{});\n}\n","language":"Zig"},{"code":"reg attrs=List(), S,N;\ndo{\n attrs.clear();\n do(6){\n abcd:=(4).pump(List,(0).random.fp(1,7)); // list of 4 [1..6] randoms\n attrs.append(abcd.sum(0) - (0).min(abcd)); // sum and substract min\n }\n}while((S=attrs.sum(0))<75 or (N=attrs.filter('>=(15)).len())<2);\nprintln(\"Random numbers: %s\\nSums to %d, with %d >= 15\"\n .fmt(attrs.concat(\",\"),S,N));\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Simple\\nfrom: http://rosettacode.org/wiki/RPG_attributes_generator\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"'''RPG''' = <u>R</u>ole <u>P</u>laying <u>G</u>ame.\\n\\n\\n\\nYou're running a tabletop RPG, and your players are creating characters.\\n\\nEach character has six core attributes: strength, dexterity, constitution, intelligence, wisdom, and charisma.\\n\\nOne way of generating values for these attributes is to roll four, 6-sided dice (d6) and sum the three highest rolls, discarding the lowest roll.\\n\\nSome players like to assign values to their attributes in the order they're rolled.\\n\\nTo ensure generated characters don't put players at a disadvantage, the following requirements must be satisfied:\\n\\n* The total of all character attributes must be at least 75.\\n* At least two of the attributes must be at least 15.\\n<p></p>\\nHowever, this can require a lot of manual dice rolling. A programatic solution would be much faster.\\n\\n\\n;Task:\\nWrite a program that:\\n# Generates 4 random, whole values between 1 and 6.\\n# Saves the sum of the 3 largest values.\\n# Generates a total of 6 values this way.\\n# Displays the total, and all 6 values once finished.\\n<p></p>\\n* The order in which each value was generated must be preserved.\\n* The total of all 6 values must be at least 75.\\n* At least 2 of the values must be 15 or more.\\n<p></p>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"random:seed(Int(Time().unix_time()))\\nV total = 0\\nV count = 0\\n\\n[Int] attributes\\nL total < 75 | count < 2\\n attributes = (0..5).map(attribute -> (sum(sorted((0..3).map(roll -> random:(1 .. 6)))[1..])))\\n\\n L(attribute) attributes\\n I attribute >= 15\\n count++\\n\\n total = sum(attributes)\\n\\nprint(total‘ ’attributes)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"\\tbits\\t16\\n\\tcpu\\t8086\\nputch:\\tequ\\t2h\\ntime:\\tequ\\t2ch\\n\\torg\\t100h\\nsection\\t.text\\n\\tmov\\tah,time\\t\\t; Retrieve system time from MS-DOS\\n\\tint\\t21h\\n\\tcall\\trseed\\t\\t; Seed the RNG\\nrolls:\\txor\\tah,ah\\t\\t; AH=0 (running total)\\n\\tmov\\tdx,6\\t\\t; DH=0 (amount >=15), DL=6 (counter)\\n\\tmov\\tdi,attrs\\nattr:\\tcall\\troll4\\t\\t; Roll an attribute\\n\\tmov\\tal,14\\n\\tcmp\\tal,bh\\t\\t; Set carry if BH=15 or more\\n\\tmov\\tal,bh\\t\\t; AL = roll\\n\\tsbb\\tbh,bh\\t\\t; BH=0 if no carry, -1 if carry\\n\\tsub\\tdh,bh\\t\\t; DH+=1 if >=15\\n\\tadd\\tah,al\\t\\t; Add to running total\\n\\tmov\\t[di],al\\t\\t; Save roll\\n\\tinc\\tdi\\t\\t; Next memory address\\n\\tdec\\tdl\\t\\t; One fewer roll left\\n\\tjnz\\tattr\\n\\tcmp\\tah,75\\t\\t; Rolling total < 75?\\n\\tjb\\trolls\\t\\t; Then roll again.\\n\\tcmp\\tdh,2\\t\\t; Fewer than 2 attrs < 15?\\n\\tjb\\trolls\\t\\t; Then roll again.\\n\\t;;;\\tPrint the attributes\\n\\tmov\\tcx,6\\t\\t; 6 attributes\\np2:\\tmov\\tbl,10\\t\\t; divide by 10 to get digits\\n\\tmov\\tdi,attrs\\nprint:\\txor\\tah,ah\\t\\t; AX = attribute\\n\\tmov\\tal,[di]\\n\\tdiv\\tbl\\t\\t; divide by 10\\n\\tadd\\tax,3030h\\t; add '0' to quotient (AH) and remainder (AL)\\n\\tmov\\tdx,ax\\n\\tmov\\tah,putch\\t\\n\\tint\\t21h\\t\\t; print quotient first\\n\\tmov\\tdl,dh\\t\\t; then remainder\\n\\tint\\t21h\\n\\tmov\\tdl,' '\\t\\t; then a space\\n\\tint\\t21h\\n\\tinc\\tdi\\t\\t; Next attribute\\n\\tloop\\tprint\\n\\tret\\t\\t\\t; Back to DOS \\t\\n\\t;;;\\tDo 4 rolls, and get result of max 3\\nroll4:\\txor\\tbx,bx\\t\\t; BH = running total\\n\\tdec\\tbl\\t\\t; BL = lowest value\\n\\tmov\\tcx,4\\t\\t; Four times\\n.roll:\\tcall\\td6\\t\\t; Roll D6\\n\\tcmp \\tal,bl\\t\\t; Lower than current lowest value?\\n\\tjnb\\t.high\\t\\t; If so,\\n\\tmov\\tbl,al\\t\\t; Set new lowest value\\n.high:\\tadd\\tbh,al\\t\\t; Add to running total\\n\\tloop\\t.roll\\t\\t; If not 4 rolls yet, loop back\\n\\tsub\\tbh,bl\\t\\t; Subtract lowest value (giving sum of high 3)\\n\\tret\\n\\t;;;\\tRoll a D6\\nd6:\\tcall\\trand\\t\\t; Get random number\\n\\tand\\tal,7\\t\\t; Between 0 and 7\\n\\tcmp\\tal,6\\t\\t; If 6 or higher,\\n\\tjae\\td6\\t\\t; Then get new random number\\n\\tinc\\tal\\t\\t; [1..6] instead of [0..5]\\n\\tret\\n\\t;;;\\tSeed the random number generator with 4 bytes\\nrseed:\\txor\\t[rnddat],cx\\n\\txor\\t[rnddat+2],dx\\n\\t;;;\\t\\\"X ABC\\\" random number generator\\n\\t;;;\\tGenerates 8-bit random number in AL\\nrand:\\tpush\\tcx\\t\\t; Keep registers\\n\\tpush\\tdx\\n\\tmov\\tcx,[rnddat]\\t; CL=X CH=A\\n\\tmov\\tdx,[rnddat+2]\\t; DL=B DH=C\\n\\txor\\tch,dh\\t\\t; A ^= C\\n\\txor\\tch,cl\\t\\t; A ^= X\\n\\tadd\\tdl,ch\\t\\t; B += A\\n\\tmov\\tal,dl\\t\\t; R = B\\n\\tshr\\tal,1\\t\\t; R >>= 1\\n\\txor\\tal,ch\\t\\t; R ^= A\\n\\tadd\\tal,dh\\t\\t; R += C\\n\\tmov\\tdh,al\\t\\t; C = R\\n\\tmov\\t[rnddat],cx\\t; Store new state\\n\\tmov\\t[rnddat+2],dx\\n\\tpop\\tdx\\t\\t; Restore registers\\n\\tpop\\tcx\\n\\tret\\nsection\\t.bss\\nrnddat:\\tresb\\t4\\t\\t; RNG state\\nattrs:\\tresb\\t6\\t\\t; Rolled attributes\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \"/* ARM assembly AARCH64 Raspberry PI 3B */\\n/* program rpg64.s */\\n\\n/*******************************************/\\n/* Constantes file */\\n/*******************************************/\\n/* for this file see task include a file in language AArch64 assembly*/\\n.include \\\"../includeConstantesARM64.inc\\\"\\n\\n.equ NBTIRAGES, 4\\n.equ NBTIRAGESOK, 3\\n.equ NBVALUES, 6\\n.equ TOTALMIN, 75\\n.equ MAXVALUE, 15\\n.equ NBMAXVALUE, 2\\n\\n/*********************************/\\n/* Initialized data */\\n/*********************************/\\n.data\\nsMessResult: .asciz \\\"Value = @ \\\\n\\\"\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\nsMessResultT: .asciz \\\"Total = @ \\\\n\\\"\\nsMessResultQ: .asciz \\\"Values above 15 = @ \\\\n\\\"\\n\\n\\n.align 4\\nqGraine: .quad 123456789\\n\\n/*********************************/\\n/* UnInitialized data */\\n/*********************************/\\n.bss\\ntqTirages: .skip 8 * NBTIRAGES\\ntqValues: .skip 8 * NBVALUES\\n\\nsZoneConv: .skip 24\\n/*********************************/\\n/* code section */\\n/*********************************/\\n.text\\n.global main\\nmain: // entry of program\\n\\n1: // begin loop 1\\n mov x2,0 // counter value >15\\n mov x4,0 // loop indice\\n mov x5,0 // total\\n ldr x3,qAdrtqValues // table values address\\n2:\\n bl genValue // call generate value\\n str x0,[x3,x4,lsl 3] // store in table\\n add x5,x5,x0 // compute total\\n cmp x0,MAXVALUE // count value >= 15\\n add x6,x2,1\\n csel x2,x6,x2,ge\\n add x4,x4,1 // increment indice\\n cmp x4,NBVALUES // end ?\\n blt 2b\\n cmp x5,TOTALMIN // compare 75\\n blt 1b // < loop\\n cmp x2,#NBMAXVALUE // compare value > 15\\n blt 1b // < loop\\n ldr x0,qAdrtqValues // display values\\n bl displayTable\\n mov x0,x5 // total\\n\\n ldr x1,qAdrsZoneConv // display value\\n bl conversion10 // call conversion decimal\\n ldr x0,qAdrsMessResultT\\n ldr x1,qAdrsZoneConv\\n bl strInsertAtCharInc // insert result at @ character\\n bl affichageMess // display message\\n\\n mov x0,x2 // counter value > 15\\n ldr x1,qAdrsZoneConv // display value\\n bl conversion10 // call conversion decimal\\n ldr x0,qAdrsMessResultQ\\n ldr x1,qAdrsZoneConv\\n bl strInsertAtCharInc // insert result at @ character\\n bl affichageMess // display message\\n\\n100: // standard end of the program\\n mov x0,0 // return code\\n mov x8,EXIT // request to exit program\\n svc 0 // perform the system call\\n\\nqAdrsZoneConv: .quad sZoneConv\\nqAdrszCarriageReturn: .quad szCarriageReturn\\nqAdrsMessResult: .quad sMessResult\\nqAdrsMessResultT: .quad sMessResultT\\nqAdrsMessResultQ: .quad sMessResultQ\\nqAdrtqValues: .quad tqValues\\n/******************************************************************/\\n/* generate value */\\n/******************************************************************/\\n/* x0 returns the value */\\ngenValue:\\n stp x1,lr,[sp,-16]! // save registers\\n stp x2,x3,[sp,-16]! // save registers\\n mov x3,0 // indice loop\\n ldr x1,qAdrtqTirages // table tirage address\\n1:\\n mov x0,6\\n bl genereraleas // result 0 to 5\\n add x0,x0,#1 // for 1 to 6\\n str x0,[x1,x3,lsl 3] // store tirage\\n add x3,x3,1 // increment indice\\n cmp x3,NBTIRAGES // end ?\\n blt 1b // no -> loop\\n ldr x0,qAdrtqTirages // table tirage address\\n mov x1,#0 // first item\\n mov x2,#NBTIRAGES // number of tirages\\n bl shellSort // sort table decreasing\\n mov x3,#0 // raz indice loop\\n mov x0,#0 // total\\n ldr x1,qAdrtqTirages // table tirage address\\n2:\\n ldr x2,[x1,x3,lsl 3] // read tirage\\n add x0,x0,x2 // compute sum\\n add x3,x3,1 // increment indice\\n cmp x3,NBTIRAGESOK // end ?\\n blt 2b\\n100:\\n ldp x2,x3,[sp],16 // restaur 2 registers\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\nqAdrtqTirages: .quad tqTirages\\n/***************************************************/\\n/* shell Sort decreasing */\\n/***************************************************/\\n/* x0 contains the address of table */\\n/* x1 contains the first element but not use !! */\\n/* this routine use first element at index zero !!! */\\n/* x2 contains the number of element */\\nshellSort:\\n stp x1,lr,[sp,-16]! // save registers\\n stp x2,x3,[sp,-16]! // save registers\\n stp x4,x5,[sp,-16]! // save registers\\n stp x6,x7,[sp,-16]! // save registers\\n stp x8,x9,[sp,-16]! // save registers\\n sub x2,x2,1 // index last item\\n mov x1,x2 // init gap = last item\\n1: // start loop 1\\n lsr x1,x1,1 // gap = gap / 2\\n cbz x1,100f // if gap = 0 -> end\\n mov x3,x1 // init loop indice 1\\n2: // start loop 2\\n ldr x4,[x0,x3,lsl 3] // load first value\\n mov x5,x3 // init loop indice 2\\n3: // start loop 3\\n cmp x5,x1 // indice < gap\\n blt 4f // yes -> end loop 2\\n sub x6,x5,x1 // index = indice - gap\\n ldr x8,[x0,x6,lsl 3] // load second value\\n cmp x4,x8 // compare values\\n ble 4f\\n str x8,[x0,x5,lsl 3] // store if >\\n sub x5,x5,x1 // indice = indice - gap\\n b 3b // and loop\\n4: // end loop 3\\n str x4,[x0,x5,lsl 3] // store value 1 at indice 2\\n add x3,x3,1 // increment indice 1\\n cmp x3,x2 // end ?\\n ble 2b // no -> loop 2\\n b 1b // yes loop for new gap\\n\\n100: // end function\\n ldp x8,x9,[sp],16 // restaur 2 registers\\n ldp x6,x7,[sp],16 // restaur 2 registers\\n ldp x4,x5,[sp],16 // restaur 2 registers\\n ldp x2,x3,[sp],16 // restaur 2 registers\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\n\\n/******************************************************************/\\n/* Display table elements */\\n/******************************************************************/\\n/* x0 contains the address of table */\\ndisplayTable:\\n stp x1,lr,[sp,-16]! // save registers\\n stp x2,x3,[sp,-16]! // save registers\\n mov x2,x0 // table address\\n mov x3,0\\n1: // loop display table\\n ldr x0,[x2,x3,lsl 3]\\n ldr x1,qAdrsZoneConv // display value\\n bl conversion10 // call function\\n ldr x0,qAdrsMessResult\\n ldr x1,qAdrsZoneConv\\n bl strInsertAtCharInc // insert result at @ character\\n bl affichageMess // display message\\n add x3,x3,1\\n cmp x3,NBVALUES - 1\\n ble 1b\\n ldr x0,qAdrszCarriageReturn\\n bl affichageMess\\n100:\\n ldp x2,x3,[sp],16 // restaur 2 registers\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\n\\n/***************************************************/\\n/* Generation random number */\\n/* algo xorshift (see wikipedia) */\\n/***************************************************/\\n/* x0 contains limit */\\ngenereraleas:\\n stp x1,lr,[sp,-16]! // save registers\\n stp x2,x3,[sp,-16]! // save registers\\n cbz x0,100f\\n mov x3,x0 // maxi value\\n ldr x0,qAdrqGraine // graine\\n ldr x2,[x0]\\n lsl x1,x2,13\\n eor x2,x2,x1\\n lsr x1,x2,7\\n eor x2,x2,x1\\n lsl x1,x2,17\\n eor x1,x2,x1\\n str x1,[x0] // sauver graine\\n udiv x2,x1,x3 //\\n msub x0,x2,x3,x1 // compute result modulo limit\\n\\n100: // end function\\n ldp x2,x3,[sp],16 // restaur 2 registers\\n ldp x1,lr,[sp],16 // restaur 2 registers\\n ret // return to address lr x30\\n/*****************************************************/\\nqAdrqGraine: .quad qGraine\\n/********************************************************/\\n/* File Include fonctions */\\n/********************************************************/\\n/* for this file see task include a file in language AArch64 assembly */\\n.include \\\"../includeARM64.inc\\\"\\n\",\n \"language\": \"AArch64-Assembly\"\n },\n {\n \"code\": \"TYPE Result=[BYTE success,sum,highCount]\\nBYTE FUNC GenerateAttrib()\\n BYTE i,v,min,sum\\n\\n min=255 sum=0\\n FOR i=0 TO 3\\n DO\\n v=Rand(6)+1\\n IF v<min THEN\\n min=v\\n FI\\n sum==+v\\n OD\\nRETURN (sum-min)\\n\\nPROC Generate(BYTE ARRAY a BYTE len Result POINTER res)\\n BYTE i,v,count\\n\\n res.highCount=0 res.sum=0\\n FOR i=0 TO len-1\\n DO\\n v=GenerateAttrib()\\n IF v>=15 THEN\\n res.highCount==+1\\n FI\\n res.sum==+v\\n a(i)=v\\n OD\\n IF res.highCount<2 OR res.sum<75 THEN\\n res.success=0\\n ELSE\\n res.success=1\\n FI\\nRETURN\\n\\nPROC Main()\\n DEFINE count=\\\"6\\\"\\n BYTE ARRAY a(count)\\n Result res\\n BYTE i\\n\\n res.success=0\\n WHILE res.success=0\\n DO\\n Generate(a,count,res)\\n Print(\\\"attribs: \\\")\\n FOR i=0 TO count-1\\n DO\\n PrintB(a(i))\\n IF i<count-1 THEN\\n Put(',)\\n FI\\n OD\\n PrintF(\\\" sum=%B highCount=%B \\\",res.sum,res.highCount)\\n IF res.success THEN\\n PrintE(\\\"success\\\")\\n ELSE\\n PrintE(\\\"failed\\\")\\n FI\\n OD\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"BEGIN # RPG attributes generator #\\n\\n INT attrib count = 6;\\n MODE RESULT = STRUCT( BOOL success, INT sum, high count, [ 1 : attrib count ]INT a );\\n\\n PROC generate attrib = INT:\\n BEGIN\\n INT min := 255, sum := 0;\\n FOR i FROM 0 TO 3 DO\\n INT v = ENTIER( next random * 6 ) + 1;\\n IF v < min THEN\\n min := v\\n FI;\\n sum +:= v\\n OD;\\n sum - min\\n END # generate attrib #;\\n\\n PROC generate = ( REF RESULT res )VOID:\\n BEGIN\\n high count OF res := 0;\\n sum OF res := 0;\\n FOR i FROM LWB a OF res TO UPB a OF res DO\\n INT v = generate attrib;\\n IF v >= 15 THEN\\n high count OF res +:= 1\\n FI;\\n sum OF res +:= v;\\n ( a OF res )[ i ] := v\\n OD;\\n success OF res := ( high count OF res >= 2 AND sum OF res >= 75 )\\n END # generate # ;\\n\\n RESULT res;\\n success OF res := FALSE;\\n WHILE NOT success OF res DO\\n generate( res );\\n print( ( \\\"attribs: \\\" ) );\\n FOR i FROM LWB a OF res TO UPB a OF res DO\\n print( ( whole( ( a OF res )[ i ], 0 ) ) );\\n IF i < UPB a OF res THEN\\n print( ( \\\" \\\" ) )\\n FI\\n OD;\\n print( ( \\\" sum=\\\", whole( sum OF res, 0 )\\n , \\\" highCount=\\\", whole( high count OF res, 0 )\\n , \\\" \\\", IF success OF res THEN \\\"success\\\" ELSE \\\"failed\\\" FI\\n , newline\\n )\\n )\\n OD\\n\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"roll←{(+/-⌊/)¨?¨6/⊂4/6}⍣{(75≤+/⍺)∧2≤+/⍺≥15}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"/* ARM assembly Raspberry PI */\\n/* program rpg.s */\\n\\n/************************************/\\n/* Constantes */\\n/************************************/\\n.equ STDOUT, 1 @ Linux output console\\n.equ EXIT, 1 @ Linux syscall\\n.equ WRITE, 4 @ Linux syscall\\n\\n.equ NBTIRAGES, 4\\n.equ NBTIRAGESOK, 3\\n.equ NBVALUES, 6\\n.equ TOTALMIN, 75\\n.equ MAXVALUE, 15\\n.equ NBMAXVALUE, 2\\n/*******************************************/\\n/* Fichier des macros */\\n/********************************************/\\n.include \\\"../../ficmacros.s\\\"\\n\\n/*********************************/\\n/* Initialized data */\\n/*********************************/\\n.data\\nsMessResult: .ascii \\\"Value = \\\"\\nsMessValeur: .fill 11, 1, ' ' @ size => 11\\nszCarriageReturn: .asciz \\\"\\\\n\\\"\\nsMessResultT: .ascii \\\"Total = \\\"\\nsMessValeurT: .fill 11, 1, ' ' @ size => 11\\n .asciz \\\"\\\\n\\\"\\nsMessResultQ: .ascii \\\"Values above 15 = \\\"\\nsMessValeurQ: .fill 11, 1, ' ' @ size => 11\\n .asciz \\\"\\\\n\\\"\\n\\n.align 4\\niGraine: .int 123456\\n\\n/*********************************/\\n/* UnInitialized data */\\n/*********************************/\\n.bss\\ntiTirages: .skip 4 * NBTIRAGES\\ntiValues: .skip 4 * NBVALUES\\n/*********************************/\\n/* code section */\\n/*********************************/\\n.text\\n.global main\\nmain: @ entry of program\\n\\n1: @ begin loop 1\\n mov r2,#0 @ counter value >15\\n mov r4,#0 @ loop indice\\n mov r5,#0 @ total\\n ldr r3,iAdrtiValues @ table values address\\n2:\\n bl genValue @ call generate value\\n str r0,[r3,r4,lsl #2] @ store in table\\n add r5,r0 @ compute total\\n cmp r0,#MAXVALUE @ count value > 15\\n addge r2,#1\\n add r4,#1 @ increment indice\\n cmp r4,#NBVALUES @ end ?\\n blt 2b\\n cmp r5,#TOTALMIN @ compare 75\\n blt 1b @ < loop\\n cmp r2,#NBMAXVALUE @ compare value > 15\\n blt 1b @ < loop\\n ldr r0,iAdrtiValues @ display values\\n bl displayTable\\n mov r0,r5 @ total\\n ldr r1,iAdrsMessValeurT @ display value\\n bl conversion10 @ call conversion decimal\\n ldr r0,iAdrsMessResultT\\n bl affichageMess @ display message\\n\\n mov r0,r2 @ counter value > 15\\n ldr r1,iAdrsMessValeurQ @ display value\\n bl conversion10 @ call conversion decimal\\n ldr r0,iAdrsMessResultQ\\n bl affichageMess @ display message\\n\\n100: @ standard end of the program\\n mov r0, #0 @ return code\\n mov r7, #EXIT @ request to exit program\\n svc #0 @ perform the system call\\n\\niAdrsMessValeur: .int sMessValeur\\niAdrszCarriageReturn: .int szCarriageReturn\\niAdrsMessResult: .int sMessResult\\niAdrsMessValeurT: .int sMessValeurT\\niAdrsMessResultT: .int sMessResultT\\niAdrsMessValeurQ: .int sMessValeurQ\\niAdrsMessResultQ: .int sMessResultQ\\niAdrtiValues: .int tiValues\\n/******************************************************************/\\n/* generate value */\\n/******************************************************************/\\n/* r0 returns the value */\\ngenValue:\\n push {r1-r4,lr} @ save registers\\n mov r4,#0 @ indice loop\\n ldr r1,iAdrtiTirages @ table tirage address\\n1:\\n mov r0,#6\\n bl genereraleas @ result 0 to 5\\n add r0,#1 @ for 1 to 6\\n str r0,[r1,r4,lsl #2] @ store tirage\\n add r4,#1 @ increment indice\\n cmp r4,#NBTIRAGES @ end ?\\n blt 1b @ no -> loop\\n ldr r0,iAdrtiTirages @ table tirage address\\n mov r1,#0 @ first item\\n mov r2,#NBTIRAGES @ number of tirages\\n bl shellSort @ sort table decreasing\\n mov r4,#0 @ raz indice loop\\n mov r0,#0 @ total\\n ldr r1,iAdrtiTirages @ table tirage address\\n2:\\n ldr r2,[r1,r4,lsl #2] @ read tirage\\n add r0,r2 @ compute sum\\n add r4,#1 @ inrement indice\\n cmp r4,#NBTIRAGESOK @ end ?\\n blt 2b\\n100:\\n pop {r1-r4,lr}\\n bx lr @ return\\niAdrtiTirages: .int tiTirages\\n/***************************************************/\\n/* shell Sort decreasing */\\n/***************************************************/\\n/* r0 contains the address of table */\\n/* r1 contains the first element but not use !! */\\n/* this routine use first element at index zero !!! */\\n/* r2 contains the number of element */\\nshellSort:\\n push {r0-r7,lr} @save registers\\n\\n sub r2,#1 @ index last item\\n mov r1,r2 @ init gap = last item\\n1: @ start loop 1\\n lsrs r1,#1 @ gap = gap / 2\\n beq 100f @ if gap = 0 -> end\\n mov r3,r1 @ init loop indice 1\\n2: @ start loop 2\\n ldr r4,[r0,r3,lsl #2] @ load first value\\n mov r5,r3 @ init loop indice 2\\n3: @ start loop 3\\n cmp r5,r1 @ indice < gap\\n blt 4f @ yes -> end loop 2\\n sub r6,r5,r1 @ index = indice - gap\\n ldr r7,[r0,r6,lsl #2] @ load second value\\n cmp r4,r7 @ compare values\\n strgt r7,[r0,r5,lsl #2] @ store if >\\n subgt r5,r1 @ indice = indice - gap\\n bgt 3b @ and loop\\n4: @ end loop 3\\n str r4,[r0,r5,lsl #2] @ store value 1 at indice 2\\n add r3,#1 @ increment indice 1\\n cmp r3,r2 @ end ?\\n ble 2b @ no -> loop 2\\n b 1b @ yes loop for new gap\\n\\n100: @ end function\\n pop {r0-r7,lr} @ restaur registers\\n bx lr @ return\\n\\n\\n/******************************************************************/\\n/* Display table elements */\\n/******************************************************************/\\n/* r0 contains the address of table */\\ndisplayTable:\\n push {r0-r3,lr} @ save registers\\n mov r2,r0 @ table address\\n mov r3,#0\\n1: @ loop display table\\n ldr r0,[r2,r3,lsl #2]\\n ldr r1,iAdrsMessValeur @ display value\\n bl conversion10 @ call function\\n ldr r0,iAdrsMessResult\\n bl affichageMess @ display message\\n add r3,#1\\n cmp r3,#NBVALUES - 1\\n ble 1b\\n ldr r0,iAdrszCarriageReturn\\n bl affichageMess\\n100:\\n pop {r0-r3,lr}\\n bx lr\\n/******************************************************************/\\n/* display text with size calculation */\\n/******************************************************************/\\n/* r0 contains the address of the message */\\naffichageMess:\\n push {r0,r1,r2,r7,lr} @ save registres\\n mov r2,#0 @ counter length\\n1: @ loop length calculation\\n ldrb r1,[r0,r2] @ read octet start position + index\\n cmp r1,#0 @ if 0 its over\\n addne r2,r2,#1 @ else add 1 in the length\\n bne 1b @ and loop\\n @ so here r2 contains the length of the message\\n mov r1,r0 @ address message in r1\\n mov r0,#STDOUT @ code to write to the standard output Linux\\n mov r7, #WRITE @ code call system \\\"write\\\"\\n svc #0 @ call systeme\\n pop {r0,r1,r2,r7,lr} @ restaur des 2 registres */\\n bx lr @ return\\n/******************************************************************/\\n/* Converting a register to a decimal unsigned */\\n/******************************************************************/\\n/* r0 contains value and r1 address area */\\n/* r0 return size of result (no zero final in area) */\\n/* area size => 11 bytes */\\n.equ LGZONECAL, 10\\nconversion10:\\n push {r1-r4,lr} @ save registers\\n mov r3,r1\\n mov r2,#LGZONECAL\\n\\n1: @ start loop\\n bl divisionpar10U @ unsigned r0 <- dividende. quotient ->r0 reste -> r1\\n add r1,#48 @ digit\\n strb r1,[r3,r2] @ store digit on area\\n cmp r0,#0 @ stop if quotient = 0\\n subne r2,#1 @ else previous position\\n bne 1b @ and loop\\n @ and move digit from left of area\\n mov r4,#0\\n2:\\n ldrb r1,[r3,r2]\\n strb r1,[r3,r4]\\n add r2,#1\\n add r4,#1\\n cmp r2,#LGZONECAL\\n ble 2b\\n @ and move spaces in end on area\\n mov r0,r4 @ result length\\n mov r1,#' ' @ space\\n3:\\n strb r1,[r3,r4] @ store space in area\\n add r4,#1 @ next position\\n cmp r4,#LGZONECAL\\n ble 3b @ loop if r4 <= area size\\n\\n100:\\n pop {r1-r4,lr} @ restaur registres\\n bx lr @return\\n\\n/***************************************************/\\n/* division par 10 unsigned */\\n/***************************************************/\\n/* r0 dividende */\\n/* r0 quotient */\\t\\n/* r1 remainder */\\ndivisionpar10U:\\n push {r2,r3,r4, lr}\\n mov r4,r0 @ save value\\n //mov r3,#0xCCCD @ r3 <- magic_number lower raspberry 3\\n //movt r3,#0xCCCC @ r3 <- magic_number higter raspberry 3\\n ldr r3,iMagicNumber @ r3 <- magic_number raspberry 1 2\\n umull r1, r2, r3, r0 @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0)\\n mov r0, r2, LSR #3 @ r2 <- r2 >> shift 3\\n add r2,r0,r0, lsl #2 @ r2 <- r0 * 5\\n sub r1,r4,r2, lsl #1 @ r1 <- r4 - (r2 * 2) = r4 - (r0 * 10)\\n pop {r2,r3,r4,lr}\\n bx lr @ leave function\\niMagicNumber: \\t.int 0xCCCCCCCD\\n/***************************************************/\\n/* Generation random number */\\n/***************************************************/\\n/* r0 contains limit */\\ngenereraleas:\\n push {r1-r4,lr} @ save registers\\n ldr r4,iAdriGraine\\n ldr r2,[r4]\\n ldr r3,iNbDep1\\n mul r2,r3,r2\\n ldr r3,iNbDep1\\n add r2,r2,r3\\n str r2,[r4] @ maj de la graine pour appel suivant\\n cmp r0,#0\\n beq 100f\\n mov r1,r0 @ divisor\\n mov r0,r2 @ dividende\\n bl division\\n mov r0,r3 @ résult = remainder\\n\\n100: @ end function\\n pop {r1-r4,lr} @ restaur registers\\n bx lr @ return\\n/*****************************************************/\\niAdriGraine: .int iGraine\\niNbDep1: .int 0x343FD\\niNbDep2: .int 0x269EC3\\n/***************************************************/\\n/* integer division unsigned */\\n/***************************************************/\\ndivision:\\n /* r0 contains dividend */\\n /* r1 contains divisor */\\n /* r2 returns quotient */\\n /* r3 returns remainder */\\n push {r4, lr}\\n mov r2, #0 @ init quotient\\n mov r3, #0 @ init remainder\\n mov r4, #32 @ init counter bits\\n b 2f\\n1: @ loop\\n movs r0, r0, LSL #1 @ r0 <- r0 << 1 updating cpsr (sets C if 31st bit of r0 was 1)\\n adc r3, r3, r3 @ r3 <- r3 + r3 + C. This is equivalent to r3 ? (r3 << 1) + C\\n cmp r3, r1 @ compute r3 - r1 and update cpsr\\n subhs r3, r3, r1 @ if r3 >= r1 (C=1) then r3 <- r3 - r1\\n adc r2, r2, r2 @ r2 <- r2 + r2 + C. This is equivalent to r2 <- (r2 << 1) + C\\n2:\\n subs r4, r4, #1 @ r4 <- r4 - 1\\n bpl 1b @ if r4 >= 0 (N=0) then loop\\n pop {r4, lr}\\n bx lr\\n\",\n \"language\": \"ARM-Assembly\"\n },\n {\n \"code\": \"vals: []\\n\\nwhile [or? 75 > sum vals\\n 2 > size select vals => [&>=15]] [\\n vals: new []\\n\\n while [6 > size vals][\\n rands: new map 1..4 => [random 1 6]\\n remove 'rands .once (min rands)\\n 'vals ++ sum rands\\n ]\\n]\\n\\nprint [\\\"values:\\\" vals ]\\nprint [\\\"with sum:\\\" sum vals]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"100 REM RPG character generator\\n110 DIM AT(5)\\n120 DIM AT$(18)\\n130 AT$=\\\"StrDexConIntWisCha\\\"\\n140 PT=0:SA=0\\n150 PRINT CHR$(125);CHR$(29);CHR$(31);\\\"Rolling...\\\"\\n160 FOR AI=0 TO 5\\n170 DT=0:MI=6:REM dice total, min die\\n180 FOR I=0 TO 3\\n190 D=INT(RND(1)*6)+1\\n200 DT=DT+D\\n210 IF D<MI THEN MI=D\\n220 NEXT I\\n230 DT=DT-MI\\n240 AT(AI)=DT\\n250 PT=PT+DT\\n260 IF DT>=15 THEN SA=SA+1\\n270 NEXT AI\\n280 IF PT<75 OR SA<2 THEN 140\\n290 PRINT CHR$(125);\\\"Character Attributes:\\\"\\n300 PRINT\\n310 FOR AI=0 TO 5\\n315 POSITION 10,AI+2\\n320 PRINT AT$(AI*3+1,AI*3+3);\\\":\\\";\\n330 POSITION 16-INT(AT(AI)/10),AI+2\\n340 PRINT AT(AI)\\n350 NEXT AI\\n360 POSITION 8,9\\n370 PRINT \\\"Total: \\\";PT\\n380 PRINT\\n390 PRINT \\\"Do you accept? \\\";\\n400 OPEN #1,4,0,\\\"K:\\\"\\n410 GET #1,K\\n420 IF K<>78 AND K<>89 THEN 410\\n430 PRINT CHR$(K)\\n440 CLOSE #1\\n450 IF K=78 THEN 140\\n460 POSITION 0,13\\n470 PRINT \\\"Excellent. Good luck on your adventure!\\\"\\n\",\n \"language\": \"Atari-BASIC\"\n },\n {\n \"code\": \"function min(a, b)\\n\\tif a < b then return a else return b\\nend function\\n\\nfunction d6()\\n\\t#simulates a marked regular hexahedron coming to rest on a plane\\n\\treturn 1 + int(rand * 6)\\nend function\\n\\nfunction roll_stat()\\n\\t#rolls four dice, returns the sum of the three highest\\n\\ta = d6() : b = d6() : c = d6() : d = d6()\\n\\treturn a + b + c + d - min(min(a, b), min(c, d))\\nend function\\n\\narraybase 1\\ndim statnames$ = {\\\"STR\\\", \\\"CON\\\", \\\"DEX\\\", \\\"INT\\\", \\\"WIS\\\", \\\"CHA\\\"}\\ndim stat(6)\\nacceptable = false\\n\\ndo\\n\\tsum = 0 : n15 = 0\\n\\tfor i = 1 to 6\\n\\t\\tstat[i] = roll_stat()\\n\\t\\tsum += stat[i]\\n\\t\\tif stat[i] >= 15 then n15 += 1\\n\\tnext i\\n\\tif sum >= 75 and n15 >= 2 then acceptable = true\\nuntil acceptable\\n\\nfor i = 1 to 6\\n\\tprint statnames$[i]; \\\": \\\"; stat[i]\\nnext i\\nprint \\\"-------\\\"\\nprint \\\"TOT: \\\"; sum\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \" _while_←{𝔽⍟𝔾∘𝔽_𝕣_𝔾∘𝔽⍟𝔾𝕩}\\n(2-modifier block)\\n Roll←{𝕊:{𝕊:((+´-⌊´)1+4⊸•rand.Range)¨6⥊6}_while_{(75>+´𝕩)∨2>+´15≤𝕩}⟨⟩}\\n(function block)\\n Roll@\\n⟨ 11 16 12 10 16 13 ⟩\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <time.h>\\n\\nint compareInts(const void *i1, const void *i2) {\\n int a = *((int *)i1);\\n int b = *((int *)i2);\\n return a - b;\\n}\\n\\nint main() {\\n int i, j, nsum, vsum, vcount, values[6], numbers[4];\\n srand(time(NULL));\\n for (;;) {\\n vsum = 0;\\n for (i = 0; i < 6; ++i) {\\n for (j = 0; j < 4; ++j) {\\n numbers[j] = 1 + rand() % 6;\\n }\\n qsort(numbers, 4, sizeof(int), compareInts);\\n nsum = 0;\\n for (j = 1; j < 4; ++j) {\\n nsum += numbers[j];\\n }\\n values[i] = nsum;\\n vsum += values[i];\\n }\\n if (vsum < 75) continue;\\n vcount = 0;\\n for (j = 0; j < 6; ++j) {\\n if (values[j] >= 15) vcount++;\\n }\\n if (vcount < 2) continue;\\n printf(\\\"The 6 random numbers generated are:\\\\n\\\");\\n printf(\\\"[\\\");\\n for (j = 0; j < 6; ++j) printf(\\\"%d \\\", values[j]);\\n printf(\\\"\\\\b]\\\\n\\\");\\n printf(\\\"\\\\nTheir sum is %d and %d of them are >= 15\\\\n\\\", vsum, vcount);\\n break;\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <ctime>\\n#include <iostream>\\n#include <cstdlib>\\n#include <string>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n srand(time(0));\\n\\n unsigned int attributes_total = 0;\\n unsigned int count = 0;\\n int attributes[6] = {};\\n int rolls[4] = {};\\n\\n while(attributes_total < 75 || count < 2)\\n {\\n attributes_total = 0;\\n count = 0;\\n\\n for(int attrib = 0; attrib < 6; attrib++)\\n {\\n for(int roll = 0; roll < 4; roll++)\\n {\\n rolls[roll] = 1 + (rand() % 6);\\n }\\n\\n sort(rolls, rolls + 4);\\n int roll_total = rolls[1] + rolls[2] + rolls[3];\\n\\n attributes[attrib] = roll_total;\\n attributes_total += roll_total;\\n\\n if(roll_total >= 15) count++;\\n }\\n }\\n\\n cout << \\\"Attributes generated : [\\\";\\n cout << attributes[0] << \\\", \\\";\\n cout << attributes[1] << \\\", \\\";\\n cout << attributes[2] << \\\", \\\";\\n cout << attributes[3] << \\\", \\\";\\n cout << attributes[4] << \\\", \\\";\\n cout << attributes[5];\\n\\n cout << \\\"]\\\\nTotal: \\\" << attributes_total;\\n cout << \\\", Values above 15 : \\\" << count;\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\nstatic class Module1\\n{\\n static Random r = new Random();\\n\\n static List<int> getThree(int n)\\n {\\n List<int> g3 = new List<int>();\\n for (int i = 0; i < 4; i++) g3.Add(r.Next(n) + 1);\\n g3.Sort(); g3.RemoveAt(0); return g3;\\n }\\n\\n static List<int> getSix()\\n {\\n List<int> g6 = new List<int>();\\n for (int i = 0; i < 6; i++) g6.Add(getThree(6).Sum());\\n return g6;\\n }\\n\\n static void Main(string[] args)\\n {\\n bool good = false; do {\\n List<int> gs = getSix(); int gss = gs.Sum(); int hvc = gs.FindAll(x => x > 14).Count;\\n Console.Write(\\\"attribs: {0}, sum={1}, ({2} sum, high vals={3})\\\",\\n string.Join(\\\", \\\", gs), gss, gss >= 75 ? \\\"good\\\" : \\\"low\\\", hvc);\\n Console.WriteLine(\\\" - {0}\\\", (good = gs.Sum() >= 75 && hvc > 1) ? \\\"success\\\" : \\\"failure\\\");\\n } while (!good);\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"% This program needs to be merged with PCLU's \\\"misc\\\" library\\n% to use the random number generator.\\n%\\n% pclu -merge $CLUHOME/lib/misc.lib -compile rpg_gen.clu\\n\\n% Seed the random number generator with the current time\\ninit_rng = proc ()\\n d: date := now()\\n seed: int := ((d.hour*60) + d.minute)*60 + d.second\\n random$seed(seed)\\nend init_rng\\n\\ncharacter = cluster is generate\\n rep = null\\n\\n % Roll a die\\n roll_die = proc () returns (int)\\n return (1 + random$next(6))\\n end roll_die\\n\\n % Roll four dice and get the sum of the highest three rolls\\n roll_four_times = proc () returns (int)\\n lowest: int := 7 % higher than any dice roll\\n sum: int := 0\\n for i: int in int$from_to(1,4) do\\n roll: int := roll_die()\\n sum := sum + roll\\n if roll < lowest then lowest := roll end\\n end\\n return (sum - lowest)\\n end roll_four_times\\n\\n % Try to generate a character by rolling six values\\n try_generate = proc () returns (sequence[int])\\n rolls: sequence[int] := sequence[int]$[]\\n for i: int in int$from_to(1,6) do\\n rolls := sequence[int]$addh(rolls, roll_four_times())\\n end\\n return (rolls)\\n end try_generate\\n\\n % See if a character is valid\\n valid = proc (c: sequence[int]) returns (bool)\\n total: int := 0\\n at_least_15: int := 0\\n for i: int in sequence[int]$elements(c) do\\n total := total + i\\n if i >= 15 then at_least_15 := at_least_15 + 1 end\\n end\\n return (total >= 75 & at_least_15 >= 2)\\n end valid\\n\\n % Generate a character\\n generate = proc () returns (sequence[int])\\n while true do\\n c: sequence[int] := try_generate()\\n if valid(c) then return(c) end\\n end\\n end generate\\nend character\\n\\n% Generate a character and display the six values\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n init_rng()\\n hero: sequence[int] := character$generate()\\n for stat: int in sequence[int]$elements(hero) do\\n stream$putright(po, int$unparse(stat), 4)\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \"100 rem rpg character roller\\n110 rem rosetta code - commodore basic\\n120 dim di(3):rem dice\\n130 dim at(5),at$(5):rem attributes as follows:\\n140 at$(0)=\\\"Strength\\\"\\n150 at$(1)=\\\"Dexterity\\\"\\n160 at$(2)=\\\"Constitution\\\"\\n170 at$(3)=\\\"Intelligence\\\"\\n180 at$(4)=\\\"Wisdom\\\"\\n190 at$(5)=\\\"Charisma\\\"\\n200 pt=0:sa=0:rem points total and number of strong attributes (15+)\\n210 print chr$(147);chr$(14);chr$(29);chr$(17);\\\"Rolling...\\\"\\n220 for ai=0 to 5:rem attribute index\\n230 for i=0 to 3:di(i)=int(rnd(.)*6)+1:next i\\n240 gosub 450\\n250 dt=0:rem dice total\\n260 for i=0 to 2:dt=dt+di(i):next i:rem take top 3\\n270 at(ai)=dt:pt=pt+dt\\n280 if dt>=15 then sa=sa+1\\n290 next ai\\n300 if pt<75 or sa<2 then goto 200\\n310 print chr$(147);\\\"Character Attributes:\\\"\\n320 print\\n330 for ai=0 to 5\\n340 print spc(13-len(at$(ai)));at$(ai);\\\":\\\";tab(14);at(ai)\\n350 next ai\\n360 print\\n370 print \\\" Total:\\\";tab(14);pt\\n380 print\\n390 print \\\"Do you accept? \\\";\\n400 get k$:if k$<>\\\"y\\\" and k$<>\\\"n\\\" then 400\\n410 print k$\\n420 if k$=\\\"n\\\" then goto 200\\n430 print:print \\\"Excellent. Good luck on your adventure!\\\"\\n440 end\\n450 rem \\\"sort\\\" dice - really just put smallest one last\\n460 for x=0 to 2\\n470 if di(x)<di(x+1) then t=di(x):di(x)=di(x+1):di(x+1)=t\\n480 next x\\n490 return\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"(defpackage :rpg-generator\\n (:use :cl)\\n (:export :generate))\\n(in-package :rpg-generator)\\n(defun sufficient-scores-p (scores)\\n (and (>= (apply #'+ scores) 75)\\n (>= (count-if #'(lambda (n) (>= n 15)) scores) 2)))\\n\\n(defun gen-score ()\\n (apply #'+ (rest (sort (loop repeat 4 collect (1+ (random 6))) #'<))))\\n\\n(defun generate ()\\n (loop for scores = (loop repeat 6 collect (gen-score))\\n until (sufficient-scores-p scores)\\n finally (format t \\\"Scores: ~A~%\\\" scores)\\n (format t \\\"Total: ~A~%\\\" (apply #'+ scores))\\n (format t \\\">= 15: ~A~%\\\" (count-if (lambda (n) (>= n 15)) scores))\\n (return scores)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \";; 22.11.07 Draft\\n\\n(defun score-jet-des ()\\n (loop :for resultat = (+ (random 6) 1)\\n :repeat 4\\n :sum resultat :into total\\n :minimize resultat :into minimum\\n :finally (return (- total minimum))))\\n\\n(defun calcule-attributs-personnage ()\\n (loop named a\\n :do (loop :for score = (score-jet-des)\\n :repeat 6\\n :collect score :into scores\\n :sum score :into total\\n :count (>= score 15) :into frequence\\n :finally (when (and (>= total 75) (>= frequence 2))\\n (return-from a (values scores total))))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\ninclude \\\"argv.coh\\\";\\n\\n# There is no random number generator in the standard library (yet?)\\n# There is also no canonical source of randomness, and indeed,\\n# on some target platforms (like CP/M) there is no guaranteed\\n# source of randomness at all. Therefore, I implement the \\\"X ABC\\\"\\n# random number generator, and ask for a seed on the command line.\\n\\nrecord RandState is\\n x @at(0): uint8;\\n a @at(1): uint8;\\n b @at(2): uint8;\\n c @at(3): uint8;\\nend record;\\n\\nsub RandByte(s: [RandState]): (r: uint8) is\\n s.x := s.x + 1;\\n s.a := s.a ^ s.c ^ s.x;\\n s.b := s.b + s.a;\\n s.c := s.c + (s.b >> 1) ^ s.a;\\n r := s.c;\\nend sub;\\n\\n# Roll a d6\\ntypedef D6 is int(1, 6);\\nsub Roll(s: [RandState]): (r: D6) is\\n var x: uint8;\\n loop\\n x := RandByte(s) & 7;\\n if x < 6 then break; end if;\\n end loop;\\n r := x + 1;\\nend sub;\\n\\n# Roll 4 D6es and get the sum of the 3 highest\\nsub Roll4(s: [RandState]): (r: uint8) is\\n r := 0;\\n var lowest: uint8 := 0;\\n var n: uint8 := 4;\\n while n > 0 loop\\n var roll := Roll(s);\\n r := r + roll;\\n if lowest > roll then\\n lowest := roll;\\n end if;\\n n := n - 1;\\n end loop;\\n r := r - lowest;\\nend sub;\\n\\n# Read random seed from command line\\nvar randState: RandState;\\n\\nArgvInit();\\nvar argmt := ArgvNext();\\nif argmt == (0 as [uint8]) then\\n print(\\\"Please give random seed on command line.\\\\n\\\");\\n ExitWithError();\\nend if;\\n([&randState as [int32]], argmt) := AToI(argmt);\\n\\nvar total: uint8;\\nvar attrs: uint8[6];\\nvar i: @indexof attrs;\\nloop\\n var at15: uint8 := 0;\\n i := 0;\\n total := 0;\\n\\n # generate 6 attributes\\n while i < 6 loop\\n attrs[i] := Roll4(&randState);\\n total := total + attrs[i];\\n # count how many are higher than or equal to 15\\n if attrs[i] >= 15 then\\n at15 := at15 + 1;\\n end if;\\n i := i + 1;\\n end loop;\\n\\n # if the requirements are met, then stop\\n if total >= 75 and at15 >= 2 then\\n break;\\n end if;\\nend loop;\\n\\n# Show the generated values\\nprint(\\\"Attributes: \\\");\\ni := 0;\\nwhile i < 6 loop\\n print_i8(attrs[i]);\\n print_char(' ');\\n i := i + 1;\\nend loop;\\nprint(\\\"\\\\nTotal: \\\");\\nprint_i8(total);\\nprint_nl();\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"def roll_stat\\n dices = Array(Int32).new(4) { rand(1..6) }\\n dices.sum - dices.min\\nend\\n\\ndef roll_character\\n loop do\\n stats = Array(Int32).new(6) { roll_stat }\\n return stats if stats.sum >= 75 && stats.count(&.>=(15)) >= 2\\n end\\nend\\n\\n10.times do\\n stats = roll_character\\n puts \\\"stats: #{stats}, sum is #{stats.sum}\\\"\\nend\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"program RPG_Attributes_Generator;\\n\\n{$APPTYPE CONSOLE}\\n\\n{$R *.res}\\n\\nuses\\n System.SysUtils,\\n System.Generics.Collections;\\n\\ntype\\n TListOfInt = class(TList<Integer>)\\n public\\n function Sum: Integer;\\n function FindAll(func: Tfunc<Integer, Boolean>): TListOfInt;\\n function Join(const sep: string): string;\\n end;\\n\\n{ TListOfInt }\\n\\nfunction TListOfInt.FindAll(func: Tfunc<Integer, Boolean>): TListOfInt;\\nvar\\n Item: Integer;\\nbegin\\n Result := TListOfInt.Create;\\n if Assigned(func) then\\n for Item in self do\\n if func(Item) then\\n Result.Add(Item);\\nend;\\n\\nfunction TListOfInt.Join(const sep: string): string;\\nvar\\n Item: Integer;\\nbegin\\n Result := '';\\n for Item in self do\\n if Result.IsEmpty then\\n Result := Item.ToString\\n else\\n Result := Result + sep + Item.ToString;\\nend;\\n\\nfunction TListOfInt.Sum: Integer;\\nvar\\n Item: Integer;\\nbegin\\n Result := 0;\\n for Item in self do\\n Inc(Result, Item);\\nend;\\n\\nfunction GetThree(n: integer): TListOfInt;\\nvar\\n i: Integer;\\nbegin\\n Randomize;\\n Result := TListOfInt.Create;\\n for i := 0 to 3 do\\n Result.Add(Random(n) + 1);\\n Result.Sort;\\n Result.Delete(0);\\nend;\\n\\nfunction GetSix(): TListOfInt;\\nvar\\n i: Integer;\\n tmp: TListOfInt;\\nbegin\\n Result := TListOfInt.Create;\\n for i := 0 to 5 do\\n begin\\n tmp := GetThree(6);\\n Result.Add(tmp.Sum);\\n tmp.Free;\\n end;\\nend;\\n\\nconst\\n GOOD_STR: array[Boolean] of string = ('low', 'good');\\n SUCCESS_STR: array[Boolean] of string = ('failure', 'success');\\n\\nvar\\n good: Boolean;\\n gs, hvcList: TListOfInt;\\n gss, hvc: Integer;\\n\\nbegin\\n good := false;\\n repeat\\n gs := GetSix();\\n gss := gs.Sum;\\n\\n hvcList := gs.FindAll(\\n function(x: Integer): Boolean\\n begin\\n result := x > 14;\\n end);\\n hvc := hvcList.Count;\\n hvcList.Free;\\n\\n Write(Format('Attribs: %s, sum=%d, (%s sum, high vals=%d)', [gs.Join(', '),\\n gss, GOOD_STR[gss >= 75], hvc]));\\n\\n good := (gss >= 75) and (hvc > 1);\\n\\n Writeln(' - ', SUCCESS_STR[good]);\\n\\n gs.Free;\\n until good;\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"func getThree(n) {\\n var g3 = []\\n for i in 0..33 {\\n g3.Add(rnd(max: n) + 1)\\n }\\n g3.Sort()\\n g3.RemoveAt(0)\\n g3\\n}\\n\\nfunc getSix() {\\n var g6 = []\\n for i in 0..5 {\\n g6.Add(getThree(6).Sum())\\n }\\n g6\\n}\\n\\nfunc Array.Sum() {\\n var acc = 0\\n for x in this {\\n acc += x\\n }\\n acc\\n}\\n\\nfunc Array.FindAll(pred) {\\n for x in this when pred(x) {\\n yield x\\n }\\n}\\n\\nvar good = false\\n\\nwhile !good {\\n var gs = getSix()\\n var gss = gs.Sum()\\n var hvc = gs.FindAll(x => x > 14).Length()\\n print(\\\"attribs: \\\\(gs), sum=\\\\(gss), \\\", terminator: \\\"\\\")\\n let gl = gss >= 75 ? \\\"good\\\" : \\\"low\\\"\\n print(\\\"(\\\\(gl) sum, high vals=\\\\(hvc))\\\", terminator: \\\"\\\")\\n good = gs.Sum() >= 75 && hvc > 1\\n print(\\\" - \\\" + (good ? \\\"success\\\" : \\\"failure\\\"))\\n}\\n\",\n \"language\": \"Dyalect\"\n },\n {\n \"code\": \"func rollstat .\\n for i to 4\\n h = randint 6\\n s += h\\n min = lower min h\\n .\\n return s - min\\n.\\nstate$[] = [ \\\"STR\\\" \\\"CON\\\" \\\"DEX\\\" \\\"INT\\\" \\\"WIS\\\" \\\"CHA\\\" ]\\nlen stat[] 6\\nrepeat\\n sum = 0\\n n15 = 0\\n for i to 6\\n stat[i] = rollstat\\n sum += stat[i]\\n if stat[i] >= 15\\n n15 += 1\\n .\\n .\\n until sum >= 75 and n15 >= 2\\n.\\nfor i to 6\\n print state$[i] & \\\": \\\" & stat[i]\\n.\\nprint \\\"-------\\\"\\nprint \\\"TOT: \\\" & sum\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"USING: combinators.short-circuit dice formatting io kernel math\\nmath.statistics qw sequences ;\\nIN: rosetta-code.rpg-attributes-generator\\n\\nCONSTANT: stat-names qw{ Str Dex Con Int Wis Cha }\\n\\n: attribute ( -- n )\\n 4 [ ROLL: 1d6 ] replicate 3 <iota> kth-largests sum ;\\n\\n: stats ( -- seq ) 6 [ attribute ] replicate ;\\n\\n: valid-stats? ( seq -- ? )\\n { [ [ 15 >= ] count 2 >= ] [ sum 75 >= ] } 1&& ;\\n\\n: generate-valid-stats ( -- seq )\\n stats [ dup valid-stats? ] [ drop stats ] until ;\\n\\n: stats-info ( seq -- )\\n [ sum ] [ [ 15 >= ] count ] bi\\n \\\"Total: %d\\\\n# of attributes >= 15: %d\\\\n\\\" printf ;\\n\\n: main ( -- )\\n generate-valid-stats dup stat-names swap\\n [ \\\"%s: %d\\\\n\\\" printf ] 2each nl stats-info ;\\n\\nMAIN: main\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"01.10 S T=0\\n01.20 F X=1,6;D 4;S AT(X)=S3;S T=T+S3\\n01.30 I (T-75)1.1\\n01.40 S K=0;F X=1,6;D 2\\n01.50 I (K-2)1.1\\n01.55 T \\\"STR DEX CON INT WIS CHA TOTAL\\\",!\\n01.60 F X=1,6;T %2,AT(X),\\\" \\\"\\n01.70 T T,!\\n01.80 Q\\n\\n02.10 I (AT(X)-15)2.3,2.2,2.2\\n02.20 S K=K+1\\n02.30 R\\n\\n04.01 C--ROLL 4 D6ES AND GIVE SUM OF LARGEST 3\\n04.10 S XS=7;S S3=0;S XN=4\\n04.20 D 6;S S3=S3+A;I (XS-A)4.4,4.4,4.3\\n04.30 S XS=A\\n04.40 S XN=XN-1;I (XN),4.5,4.2\\n04.50 S S3=S3-XS\\n\\n06.01 C--ROLL A D6\\n06.10 S A=FRAN()*10;S A=A-FITR(A)\\n06.20 S A=1+FITR(A*6)\\n\",\n \"language\": \"FOCAL\"\n },\n {\n \"code\": \"require random.fs\\n: d6 ( -- roll ) 6 random 1 + ;\\n\\nvariable smallest\\n: genstat ( -- stat )\\n d6 dup smallest !\\n 3 0 do\\n d6 dup smallest @ < if dup smallest ! then +\\n loop\\n smallest @ -\\n;\\n\\nvariable strong\\nvariable total\\n: genstats ( -- cha wis int con dex str )\\n 0 strong !\\n 0 total !\\n 6 0 do\\n genstat\\n dup 15 >= if strong @ 1 + strong ! then\\n dup total @ + total !\\n loop\\n total @ 75 < strong @ 2 < or if\\n drop drop drop drop drop drop\\n recurse\\n then\\n;\\n\\n: roll ( -- )\\n genstats\\n .\\\" str:\\\" . .\\\" dex:\\\" . .\\\" con:\\\" .\\n .\\\" int:\\\" . .\\\" wis:\\\" . .\\\" cha:\\\" .\\n .\\\" (total:\\\" total @ . 8 emit .\\\" )\\\"\\n;\\n\\nutime drop seed !\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"#define min(a, b) iif(a < b, a, b)\\n\\nfunction d6() as integer\\n 'simulates a marked regular hexahedron coming to rest on a plane\\n return 1+int(rnd*6)\\nend function\\n\\nfunction roll_stat() as integer\\n 'rolls four dice, returns the sum of the three highest\\n dim as integer a=d6(), b=d6(), c=d6(), d=d6()\\n return a + b + c + d - min( min(a, b), min(c, d) )\\nend function\\n\\ndim as string*3 statnames(1 to 6) = {\\\"STR\\\", \\\"CON\\\", \\\"DEX\\\", \\\"INT\\\", \\\"WIS\\\", \\\"CHA\\\"}\\ndim as integer stat(1 to 6), n15, sum\\ndim as boolean acceptable = false\\n\\nrandomize timer\\ndo\\n sum = 0\\n n15 = 0\\n for i as integer = 1 to 6\\n stat(i) = roll_stat()\\n sum = sum + stat(i)\\n if stat(i)>=15 then n15 += 1\\n next i\\n if sum>=75 and n15 >=2 then acceptable = true\\nloop until acceptable\\n\\nfor i as integer = 1 to 6\\n print using \\\"&: ##\\\";statnames(i);stat(i)\\nnext i\\nprint \\\"--------\\\"\\nprint using \\\"TOT: ##\\\";sum\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"_elements = 6\\n\\nlocal fn min( a as long, b as long ) as long\\n long result\\n if ( a < b )\\n result = a : exit fn\\n else\\n result = b : exit fn\\n end if\\nend fn = result\\n\\nlocal fn d6 as long\\n long result\\n result = 1 + int( rnd(_elements) )\\nend fn = result\\n\\nlocal fn roll_stat as long\\n long result\\n long a = fn d6, b = fn d6, c = fn d6, d = fn d6\\n result = a + b + c + d - fn min( fn min( a, b ), fn min( c, d ) )\\nend fn = result\\n\\nlocal fn DoIt\\n CFArrayRef statnames = @[@\\\"Strength\\\",@\\\"Constitution\\\",@\\\"Dexterity\\\",@\\\"Intelligence\\\",@\\\"Wisdom\\\",@\\\"Charisma\\\"]\\n long stat(_elements), n15, sum, i\\n BOOL acceptable = NO\\n\\n randomize\\n do\\n sum = 0\\n n15 = 0\\n for i = 1 to _elements\\n stat(i) = fn roll_stat\\n sum = sum + stat(i)\\n if stat(i) >= 15 then n15++\\n next\\n if sum >= 75 and n15 >= 2 then acceptable = YES\\n until ( acceptable = YES )\\n\\n for i = 1 to _elements\\n printf @\\\"%12s %3ld\\\", fn StringUTF8String( statnames[i -1] ), stat(i)\\n next\\n printf @\\\"------------\\\"\\n printf @\\\"%13s %3ld\\\", \\\"Total:\\\", sum\\nend fn\\n\\nfn DoIt\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/rand\\\"\\n \\\"sort\\\"\\n \\\"time\\\"\\n)\\n\\nfunc main() {\\n s := rand.NewSource(time.Now().UnixNano())\\n r := rand.New(s)\\n for {\\n var values [6]int\\n vsum := 0\\n for i := range values {\\n var numbers [4]int\\n for j := range numbers {\\n numbers[j] = 1 + r.Intn(6)\\n }\\n sort.Ints(numbers[:])\\n nsum := 0\\n for _, n := range numbers[1:] {\\n nsum += n\\n }\\n values[i] = nsum\\n vsum += values[i]\\n }\\n if vsum < 75 {\\n continue\\n }\\n vcount := 0\\n for _, v := range values {\\n if v >= 15 {\\n vcount++\\n }\\n }\\n if vcount < 2 {\\n continue\\n }\\n fmt.Println(\\\"The 6 random numbers generated are:\\\")\\n fmt.Println(values)\\n fmt.Println(\\\"\\\\nTheir sum is\\\", vsum, \\\"and\\\", vcount, \\\"of them are >= 15\\\")\\n break\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Control.Monad (replicateM)\\nimport System.Random (randomRIO)\\nimport Data.Bool (bool)\\nimport Data.List (sort)\\n\\ncharacter :: IO [Int]\\ncharacter =\\n discardUntil\\n (((&&) . (75 <) . sum) <*> ((2 <=) . length . filter (15 <=)))\\n (replicateM 6 $ sum . tail . sort <$> replicateM 4 (randomRIO (1, 6 :: Int)))\\n\\ndiscardUntil :: ([Int] -> Bool) -> IO [Int] -> IO [Int]\\ndiscardUntil p throw = go\\n where\\n go = throw >>= (<*>) (bool go . return) p\\n\\n-------------------------- TEST ---------------------------\\nmain :: IO ()\\nmain = replicateM 10 character >>= mapM_ (print . (sum >>= (,)))\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"roll=: 1 + 4 6 ?@:$ 6:\\nmassage=: +/ - <./\\ngenerate_attributes=: massage@:roll\\naccept=: (75 <: +/) *. (2 <: [: +/ 15&<:)\\nUntil=: conjunction def 'u^:(0-:v)^:_'\\n\\nNB. show displays discarded attribute sets\\nNB. and since roll ignores arguments, echo would suffice in place of show\\nshow=: [ echo\\n\\nNB. use: generate_character 'name'\\ngenerate_character=: (; (+/ ; ])@:([: generate_attributes@:show Until accept 0:))&>@:boxopen\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.List;\\nimport java.util.Random;\\nimport java.util.stream.Stream;\\n\\nimport static java.util.stream.Collectors.toList;\\n\\npublic class Rpg {\\n\\n private static final Random random = new Random();\\n\\n public static int genAttribute() {\\n return random.ints(1, 6 + 1) // Throw dices between 1 and 6\\n .limit(4) // Do 5 throws\\n .sorted() // Sort them\\n .limit(3) // Take the top 3\\n .sum(); // Sum them\\n }\\n\\n public static void main(String[] args) {\\n while (true) {\\n List<Integer> stats =\\n Stream.generate(Rpg::genAttribute) // Generate some stats\\n .limit(6) // Take 6\\n .collect(toList()); // Save them in an array\\n int sum = stats.stream().mapToInt(Integer::intValue).sum();\\n long count = stats.stream().filter(v -> v >= 15).count();\\n if (count >= 2 && sum >= 75) {\\n System.out.printf(\\\"The 6 random numbers generated are: %s\\\\n\\\", stats);\\n System.out.printf(\\\"Their sum is %s and %s of them are >= 15\\\\n\\\", sum, count);\\n return;\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function roll() {\\n const stats = {\\n total: 0,\\n rolls: []\\n }\\n let count = 0;\\n\\n for(let i=0;i<=5;i++) {\\n let d6s = [];\\n\\n for(let j=0;j<=3;j++) {\\n d6s.push(Math.ceil(Math.random() * 6))\\n }\\n\\n d6s.sort().splice(0, 1);\\n rollTotal = d6s.reduce((a, b) => a+b, 0);\\n\\n stats.rolls.push(rollTotal);\\n stats.total += rollTotal;\\n }\\n\\n return stats;\\n}\\n\\nlet rolledCharacter = roll();\\n\\nwhile(rolledCharacter.total < 75 || rolledCharacter.rolls.filter(a => a >= 15).length < 2){\\n rolledCharacter = roll();\\n}\\n\\nconsole.log(`The 6 random numbers generated are:\\n${rolledCharacter.rolls.join(', ')}\\n\\nTheir sum is ${rolledCharacter.total} and ${rolledCharacter.rolls.filter(a => a >= 15).length} of them are >= 15`);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n 'use strict';\\n\\n // main :: IO ()\\n const main = () =>\\n // 10 random heroes drawn from\\n // a non-finite series.\\n unlines(map(\\n xs => show(sum(xs)) +\\n ' -> [' + show(xs) + ']',\\n\\n take(10, heroes(\\n seventyFivePlusWithTwo15s\\n ))\\n ));\\n\\n // seventyFivePlusWithTwo15s :: [Int] -> Bool\\n const seventyFivePlusWithTwo15s = xs =>\\n // Total score over 75,\\n // with two or more qualities scoring 15.\\n 75 < sum(xs) && 1 < length(filter(\\n x => 15 === x, xs\\n ));\\n\\n // heroes :: Gen IO [(Int, Int, Int, Int, Int, Int)]\\n function* heroes(p) {\\n // Non-finite list of heroes matching\\n // the requirements of predicate p.\\n while (true) {\\n yield hero(p)\\n }\\n }\\n\\n // hero :: (Int -> Bool) -> IO (Int, Int, Int, Int, Int, Int)\\n const hero = p =>\\n // A random character matching the\\n // requirements of predicate p.\\n until(p, character, []);\\n\\n // character :: () -> IO [Int]\\n const character = () =>\\n // A random character with six\\n // integral attributes.\\n map(() => sum(tail(sort(map(\\n randomRInt(1, 6),\\n enumFromTo(1, 4)\\n )))),\\n enumFromTo(1, 6)\\n );\\n\\n\\n // GENERIC FUNCTIONS ----------------------------------\\n\\n // enumFromTo :: (Int, Int) -> [Int]\\n const enumFromTo = (m, n) =>\\n Array.from({\\n length: 1 + n - m\\n }, (_, i) => m + i);\\n\\n // filter :: (a -> Bool) -> [a] -> [a]\\n const filter = (f, xs) => xs.filter(f);\\n\\n // Returns Infinity over objects without finite length.\\n // This enables zip and zipWith to choose the shorter\\n // argument when one is non-finite, like cycle, repeat etc\\n\\n // length :: [a] -> Int\\n const length = xs =>\\n (Array.isArray(xs) || 'string' === typeof xs) ? (\\n xs.length\\n ) : Infinity;\\n\\n // map :: (a -> b) -> [a] -> [b]\\n const map = (f, xs) =>\\n (Array.isArray(xs) ? (\\n xs\\n ) : xs.split('')).map(f);\\n\\n // e.g. map(randomRInt(1, 10), enumFromTo(1, 20))\\n\\n // randomRInt :: Int -> Int -> IO () -> Int\\n const randomRInt = (low, high) => () =>\\n low + Math.floor(\\n (Math.random() * ((high - low) + 1))\\n );\\n\\n // show :: a -> String\\n const show = x => x.toString()\\n\\n // sort :: Ord a => [a] -> [a]\\n const sort = xs => xs.slice()\\n .sort((a, b) => a < b ? -1 : (a > b ? 1 : 0));\\n\\n // sum :: [Num] -> Num\\n const sum = xs => xs.reduce((a, x) => a + x, 0);\\n\\n // tail :: [a] -> [a]\\n const tail = xs => 0 < xs.length ? xs.slice(1) : [];\\n\\n // take :: Int -> [a] -> [a]\\n // take :: Int -> String -> String\\n const take = (n, xs) =>\\n 'GeneratorFunction' !== xs.constructor.constructor.name ? (\\n xs.slice(0, n)\\n ) : [].concat.apply([], Array.from({\\n length: n\\n }, () => {\\n const x = xs.next();\\n return x.done ? [] : [x.value];\\n }));\\n\\n // unlines :: [String] -> String\\n const unlines = xs => xs.join('\\\\n');\\n\\n // until :: (a -> Bool) -> (a -> a) -> a -> a\\n const until = (p, f, x) => {\\n let v = x;\\n while (!p(v)) v = f(v);\\n return v;\\n };\\n\\n // MAIN ---\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def count(s): reduce s as $x (0; .+1);\\n\\n# Output: a PRN in range(0;$n) where $n is .\\ndef prn:\\n if . == 1 then 0\\n else . as $n\\n | (($n-1)|tostring|length) as $w\\n | [limit($w; inputs)] | join(\\\"\\\") | tonumber\\n | if . < $n then . else ($n | prn) end\\n end;\\n\\n# Output: [$four, $sum]\\n# where $four is an array of 4 pseudo-random integers between 1 and 6 inclusive,\\n# and $sum records the sum of the 3 largest values.\\ndef generate_RPG:\\n [range(0; 4) | (1 + (7|prn) )] as $four\\n | [$four, ($four|sort|.[-3:]|add)];\\n\\n# Input: $six as produced by [range(0;6) | generate_RPG]\\n# Determine if the following conditions are met:\\n# - the total of all 6 of the values at .[-1] is at least 75;\\n# - at least 2 of these values must be 15 or more.\\ndef ok:\\n ([.[][-1]] | add) as $sum\\n | $sum >= 75 and\\n count( (.[][1] >= 15) // empty) >= 2;\\n\\n# First show [range(0;6) | generate_RPG]\\n# and then determine if it meets the \\\"ok\\\" condition;\\n# if not, repeat until a solution has been found.\\ndef task:\\n [range(0;6) | generate_RPG] as $six\\n | ([$six[][-1]] | add) as $sum\\n | $six[], \\\"Sum: \\\\($sum)\\\",\\n if $six | ok then \\\"All done.\\\"\\n else \\\"continuing search ...\\\",\\n ({}\\n | until(.emit;\\n [range(0;6) | generate_RPG] as $six\\n | ([$six[][-1]] | add) as $sum\\n | if $six | ok\\n then .emit = {$six, $sum}\\n else .\\n end).emit\\n | (.six[], \\\"Sum: \\\\(.sum)\\\" ) )\\n end;\\n\\ntask\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"roll_skip_lowest(dice, sides) = (r = rand(collect(1:sides), dice); sum(r) - minimum(r))\\n\\nfunction rollRPGtoon()\\n attributes = zeros(Int, 6)\\n attsum = 0\\n gte15 = 0\\n\\n while attsum < 75 || gte15 < 2\\n for i in 1:6\\n attributes[i] = roll_skip_lowest(4, 6)\\n end\\n attsum = sum(attributes)\\n gte15 = mapreduce(x -> x >= 15, +, attributes)\\n end\\n\\n println(\\\"New RPG character roll: $attributes. Sum is $attsum, and $gte15 are >= 15.\\\")\\nend\\n\\nrollRPGtoon()\\nrollRPGtoon()\\nrollRPGtoon()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import kotlin.random.Random\\n\\nfun main() {\\n while (true) {\\n val values = List(6) {\\n val rolls = generateSequence { 1 + Random.nextInt(6) }.take(4)\\n rolls.sorted().take(3).sum()\\n }\\n val vsum = values.sum()\\n val vcount = values.count { it >= 15 }\\n if (vsum < 75 || vcount < 2) continue\\n println(\\\"The 6 random numbers generated are: $values\\\")\\n println(\\\"Their sum is $vsum and $vcount of them are >= 15\\\")\\n break\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"#!/bin/ksh\\n\\n# RPG attributes generator\\n\\n#\\t# Variables:\\n#\\ntypeset -a attribs=( strength dexterity constitution intelligence wisdom charisma )\\ninteger MINTOT=75 MIN15S=2\\n\\n#\\t# Functions:\\n#\\n# # Function _diceroll(sides, number, reportAs) - roll number of side-sided\\n# # dice, report (s)sum or (a)array (pseudo) of results\\n#\\nfunction _diceroll {\\n typeset _sides ; integer _sides=$1 # Number of sides of dice\\n typeset _numDice ; integer _numDice=$2 # Number of dice to roll\\n typeset _rep ; typeset -l -L1 _rep=\\\"$3\\\" # Report type: (sum || array)\\n\\n typeset _seed ; (( _seed = SECONDS / $$ )) ; _seed=${_seed#*\\\\.}\\n typeset _i _sum ; integer _i _sum=0\\n typeset _arr ; typeset -a _arr\\n\\n RANDOM=${_seed}\\n for (( _i=0; _i<_numDice; _i++ )); do\\n (( _arr[_i] = (RANDOM % _sides) + 1 ))\\n [[ ${_rep} == s ]] && (( _sum += _arr[_i] ))\\n done\\n\\n if [[ ${_rep} == s ]]; then\\n echo ${_sum}\\n else\\n echo \\\"${_arr[@]}\\\"\\n fi\\n}\\n\\n#\\t# Function _sumarr(n arr) - Return the sum of the first n arr elements\\n#\\nfunction _sumarr {\\n\\ttypeset _n ; integer _n=$1\\n\\ttypeset _arr ; nameref _arr=\\\"$2\\\"\\n\\ttypeset _i _sum ; integer _i _sum\\n\\n\\tfor ((_i=0; _i<_n; _i++)); do\\n\\t\\t(( _sum+=_arr[_i] ))\\n\\tdone\\n\\techo ${_sum}\\n}\\n\\n ######\\n# main #\\n ######\\n\\nuntil (( total >= MINTOT )) && (( cnt15 >= MIN15S )); do\\n\\tinteger total=0 cnt15=0\\n\\tunset attrval ; typeset -A attrval\\n\\tfor attr in ${attribs[*]}; do\\n\\t\\tunset darr ; typeset -a darr=( $(_diceroll 6 4 a) )\\n\\t\\tset -sK:nr -A darr\\n\\t\\tattrval[${attr}]=$(_sumarr 3 darr)\\n\\t\\t(( total += attrval[${attr}] ))\\n\\t\\t(( attrval[${attr}] > 14 )) && (( cnt15++ ))\\n\\tdone\\ndone\\n\\nfor attr in ${attribs[*]}; do\\n\\tprintf \\\"%12s: %2d\\\\n\\\" ${attr} ${attrval[${attr}]}\\ndone\\nprint \\\"Attribute value total: ${total}\\\"\\nprint \\\"Attribule count >= 15: ${cnt15}\\\"\\n\",\n \"language\": \"Ksh\"\n },\n {\n \"code\": \"data:\\nattributes is number list\\ni is number\\nattr is number\\nsum is number\\ncount is number\\n\\nprocedure:\\nsub attribute\\n parameters:\\n result is number\\n local data:\\n min is number\\n n is number\\n i is number\\n procedure:\\n store 6 in min\\n for i from 0 to 4 step 1 do\\n get random in n\\n in n solve 6 * n + 1\\n floor n\\n add n and result in result\\n if n is less than min then\\n store n in min\\n end if\\n repeat\\n subtract min from result in result\\nend sub\\ncreate statement \\\"get attribute in $\\\" executing attribute\\n\\nlabel generate-attributes\\nfor i from 0 to 6 step 1 do\\n get attribute in attr\\n add attr and sum in sum\\n if attr is greater than 14 then\\n add count and 1 in count\\n end if\\n push attr to attributes\\n store 0 in attr\\nrepeat\\n\\nif sum is less than 75 or count is less than 2 then\\n display \\\"Failed...\\\" lf\\n store 0 in sum\\n store 0 in count\\n clear attributes\\n goto generate-attributes\\nend if\\n\\nfor each attr in attributes do\\n display attr \\\" \\\"\\nrepeat\\ndisplay lf \\\"Sum: \\\" sum lf \\\">14: \\\" count lf\\n\",\n \"language\": \"LDPL\"\n },\n {\n \"code\": \"valid = False;\\nWhile[! valid,\\n try = Map[Total[TakeLargest[#, 3]] &,\\n RandomInteger[{1, 6}, {6, 4}]];\\n If[Total[try] > 75 && Count[try, _?(GreaterEqualThan[15])] >= 2,\\n valid = True;\\n ]\\n ]\\n{Total[try], try}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"randomize ; Seed the rng with current timestamp.\\n\\n; Implement some general operators we'll need that aren't in the library.\\n(() 0 shorten) :new\\n((new (over -> swons)) dip times nip) :replicate\\n(('' '' '') => spread if) :if?\\n((1 0 if?) concat map sum) :count\\n\\n(5 random succ) :d6 ; Roll a 1d6.\\n('d6 4 replicate '< sort 3 take sum) :attr ; Roll an attribute.\\n('attr 6 replicate) :attrs ; Roll 6 attributes.\\n(sum 75 >=) :big? ; Is a set of attributes \\\"big?\\\"\\n(attrs (dup big?) () (pop attrs) () linrec) :big ; Roll a set of big attributes.\\n((15 >=) count 2 >=) :special? ; Is a set of atributes \\\"special?\\\"\\n(big (dup special?) () (pop big) () linrec) :stats ; Roll a set of big and special attributes.\\n\\nstats puts \\\"Total: \\\" print! sum puts!\\n\",\n \"language\": \"Min\"\n },\n {\n \"code\": \"roll = function()\\n results = []\\n for i in range(0,3)\\n results.push ceil(rnd * 6)\\n end for\\n results.sort\\n results.remove 0\\n return results.sum\\nend function\\n\\nwhile true\\n attributes = []\\n gt15 = 0 // (how many attributes > 15)\\n for i in range(0,5)\\n attributes.push roll\\n if attributes[i] > 15 then gt15 = gt15 + 1\\n end for\\n\\n print \\\"Attribute values: \\\" + attributes.join(\\\", \\\")\\n print \\\"Attributes total: \\\" + attributes.sum\\n\\n if attributes.sum >= 75 and gt15 >= 2 then break\\n print \\\"Attributes failed, rerolling\\\"\\n print\\nend while\\nprint \\\"Success!\\\"\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"# Import \\\"random\\\" to get random numbers and \\\"algorithm\\\" to get sorting functions for arrays.\\nimport random, algorithm\\n\\nrandomize()\\n\\nproc diceFourRolls(): array[4, int] =\\n ## Generates 4 random values between 1 and 6.\\n for i in 0 .. 3:\\n result[i] = rand(1..6)\\n\\nproc sumRolls(rolls: array[4, int]): int =\\n ## Save the sum of the 3 highest values rolled.\\n var sorted = rolls\\n sorted.sort()\\n # By sorting first and then starting the iteration on 1 instead of 0, the lowest number is discarded even if it is repeated.\\n for i in 1 .. 3:\\n result += sorted[i]\\n\\nfunc twoFifteens(attr: var array[6, int]): bool =\\n attr.sort()\\n # Sorting implies than the second to last number is lesser than or equal to the last.\\n if attr[4] < 15: false else: true\\n\\nvar sixAttr: array[6, int]\\n\\nwhile true:\\n var sumAttr = 0\\n for i in 0 .. 5:\\n sixAttr[i] = sumRolls(diceFourRolls())\\n sumAttr += sixAttr[i]\\n echo \\\"The roll sums are, in order: \\\", sixAttr, \\\", which adds to \\\", sumAttr\\n if not twoFifteens(sixAttr) or sumAttr < 75: echo \\\"Not good enough. Rerolling...\\\"\\n else: break\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"(* Task : RPG_attributes_generator *)\\n\\n(*\\n\\tA programmatic solution to generating character attributes for an RPG\\n*)\\n\\n(* Generates random whole values between 1 and 6. *)\\nlet rand_die () : int = Random.int 6\\n\\n(* Generates 4 random values and saves the sum of the 3 largest *)\\nlet rand_attr () : int =\\n\\tlet four_rolls = [rand_die (); rand_die (); rand_die (); rand_die ()]\\n\\t\\t|> List.sort compare in\\n\\tlet three_best = List.tl four_rolls in\\n\\tList.fold_left (+) 0 three_best\\n\\n(* Generates a total of 6 values this way. *)\\nlet rand_set () : int list=\\n\\t[rand_attr (); rand_attr (); rand_attr ();\\n\\trand_attr (); rand_attr (); rand_attr ()]\\n\\n(* Verifies conditions: total >= 75, at least 2 >= 15 *)\\nlet rec valid_set () : int list=\\n\\tlet s = rand_set () in\\n\\tlet above_15 = List.fold_left (fun acc el -> if el >= 15 then acc + 1 else acc) 0 s in\\n\\tlet total = List.fold_left (+) 0 s in\\n\\tif above_15 >= 2 && total >= 75\\n\\tthen s\\n\\telse valid_set ()\\n\\n(*** Output ***)\\n\\nlet _ =\\n\\tlet s = valid_set () in\\n\\tList.iter (fun i -> print_int i; print_string \\\", \\\") s\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"program attributes;\\n\\nvar\\n total, roll,score, count: integer;\\n atribs : array [1..6] of integer;\\n\\nbegin\\n randomize; {Initalise the random number genertor}\\n repeat\\n count:=0;\\n total:=0;\\n for score :=1 to 6 do begin\\n {roll:=random(18)+1; produce a number up to 18, pretty much the same results}\\n for diceroll:=1 to 4 do dice[diceroll]:=random(6)+1; {roll 4 six sided die}\\n\\n {find lowest rolled dice. If we roll two or more equal low rolls then we\\n\\t eliminate the first of them, change '<' to '<=' to eliminate last low die}\\n lowroll:=7;\\n\\t lowdie:=0;\\n\\t for diceroll:=1 to 4 do if (dice[diceroll] < lowroll) then begin\\n\\t lowroll := dice[diceroll];\\n\\t lowdie := diceroll;\\n\\t end;\\n {add up higest three dice}\\n\\t roll:=0;\\n\\t for diceroll:=1 to 4 do if (diceroll <> lowdie) then roll := roll + dice[diceroll];\\n atribs[score]:=roll;\\n total := total + roll;\\n if (roll>15) then count:=count+1;\\n end;\\n until ((total>74) and (count>1)); {this evens out different rolling methods }\\n { Prettily print the attributes out }\\n writeln('Attributes :');\\n for count:=1 to 6 do\\n writeln(count,'.......',atribs[count]:2);\\n writeln(' ---');\\n writeln('Total ',total:3);\\n writeln(' ---');\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use strict;\\nuse List::Util 'sum';\\n\\nmy ($min_sum, $hero_attr_min, $hero_count_min) = <75 15 3>;\\nmy @attr_names = <Str Int Wis Dex Con Cha>;\\n\\nsub heroic { scalar grep { $_ >= $hero_attr_min } @_ }\\n\\nsub roll_skip_lowest {\\n my($dice, $sides) = @_;\\n sum( (sort map { 1 + int rand($sides) } 1..$dice)[1..$dice-1] );\\n}\\n\\nmy @attr;\\ndo {\\n @attr = map { roll_skip_lowest(6,4) } @attr_names;\\n} until sum(@attr) >= $min_sum and heroic(@attr) >= $hero_count_min;\\n\\nprintf \\\"%s = %2d\\\\n\\\", $attr_names[$_], $attr[$_] for 0..$#attr;\\nprintf \\\"Sum = %d, with %d attributes >= $hero_attr_min\\\\n\\\", sum(@attr), heroic(@attr);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">numbers</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">numbers</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">ni</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sq_rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">numbers</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ni</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ni</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">numbers</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_ge</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">numbers</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">15</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">75</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"re-rolling...\\\"</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (occasionally >20)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"The 6 attributes generated are:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"strength %d, dexterity %d, constitution %d, \\\"</span><span style=\\\"color: #0000FF;\\\">&</span>\\n <span style=\\\"color: #008000;\\\">\\\"intelligence %d, wisdom %d, and charisma %d.\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">numbers</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\nTheir sum is %d and %d of them are >=15\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"/# Rosetta Code problem: https://rosettacode.org/wiki/RPG_attributes_generator\\nby Galileo, 11/2022 #/\\n\\ninclude ..\\\\Utilitys.pmt\\n\\ndef d6 rand 6 * int 1 + enddef\\n\\n( \\\"STR\\\" \\\"CON\\\" \\\"DEX\\\" \\\"INT\\\" \\\"WIS\\\" \\\"CHA\\\" )\\n\\ntrue while\\n 0 0\\n 6 for drop 0 >ps\\n ( d6 d6 d6 d6 ) len for get ps> + >ps endfor\\n min ps> swap -\\n dup >ps +\\n tps 15 > if swap 1 + swap endif\\n endfor\\n 75 >= swap 2 >= and not\\nendwhile\\n\\n0 swap\\n6 for\\n get print \\\": \\\" print swap tps + swap ps> ?\\nendfor\\n\\ndrop \\\"-------\\\" ? \\\"TOT: \\\" print ?\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"<?php\\n\\n$attributesTotal = 0;\\n$count = 0;\\n\\nwhile($attributesTotal < 75 || $count < 2) {\\n $attributes = [];\\n\\n foreach(range(0, 5) as $attribute) {\\n $rolls = [];\\n\\n foreach(range(0, 3) as $roll) {\\n $rolls[] = rand(1, 6);\\n }\\n\\n sort($rolls);\\n array_shift($rolls);\\n\\n $total = array_sum($rolls);\\n\\n if($total >= 15) {\\n $count += 1;\\n }\\n\\n $attributes[] = $total;\\n }\\n\\n $attributesTotal = array_sum($attributes);\\n}\\n\\nprint_r($attributes);\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"<?php\\n\\nclass CharacterGenerator {\\n public static function roll(): array\\n {\\n $attributes = array_map(fn($stat) => self::rollStat(), range(1, 6));\\n\\n if (!self::meetsRequirements($attributes)) {\\n return self::roll();\\n }\\n\\n return $attributes;\\n }\\n\\n private static function rollStat(): int\\n {\\n $rolls = d(6, 4);\\n return array_sum($rolls) - min($rolls);\\n }\\n\\n private static function meetsRequirements(array $attributes): bool\\n {\\n $twoOrMoreOverFifteen = array_reduce($attributes, fn($n, $stat) => $n + ($stat > 15)) >= 2;\\n $sumOfAttributesMeetsMinimum = array_sum($attributes) >= 75;\\n\\n return $sumOfAttributesMeetsMinimum && $twoOrMoreOverFifteen;\\n }\\n}\\n\\nfunction d(int $d, int $numberToRoll): array\\n{\\n return array_map(fn($roll) => rand(1, $d), range(1, $numberToRoll));\\n}\\n\\n$characterAttributes = CharacterGenerator::roll();\\n$attributesString = implode(', ', $characterAttributes);\\n$attributesTotal = array_sum($characterAttributes);\\n\\nprint \\\"Attribute Total: $attributesTotal\\\\n\\\";\\nprint \\\"Attributes: $attributesString\\\";\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"To add an attribute to some stats:\\nAllocate memory for an entry.\\nPut the attribute into the entry's attribute.\\nAppend the entry to the stats.\\n\\nAn attribute is a number.\\n\\nAn entry is a thing with an attribute.\\n\\nTo find a count of attributes greater than fourteen in some stats:\\nPut 0 into the count.\\nGet an entry from the stats.\\nLoop.\\nIf the entry is nil, exit.\\nIf the entry's attribute is greater than 14, bump the count.\\nPut the entry's next into the entry.\\nRepeat.\\n\\nTo find a sum of some stats:\\nPut 0 into the sum.\\nGet an entry from the stats.\\nLoop.\\nIf the entry is nil, exit.\\nAdd the entry's attribute to the sum.\\nPut the entry's next into the entry.\\nRepeat.\\n\\nTo generate an attribute:\\nPut 0 into the attribute.\\nPut 6 into a minimum number.\\nLoop.\\nIf a counter is past 4, break.\\nPick a number between 1 and 6.\\nAdd the number to the attribute.\\nIf the number is less than the minimum, put the number into the minimum.\\nRepeat.\\nSubtract the minimum from the attribute.\\n\\nTo generate some stats (raw):\\nIf a counter is past 6, exit.\\nGenerate an attribute.\\nAdd the attribute to the stats.\\nRepeat.\\n\\nTo generate some stats (valid):\\nGenerate some raw stats (raw).\\nFind a sum of the raw stats.\\nIf the sum is less than 75, destroy the raw stats; repeat.\\nFind a count of attributes greater than fourteen in the raw stats.\\nIf the count is less than 2, destroy the raw stats; repeat.\\nPut the raw stats into the stats.\\n\\nTo run:\\nStart up.\\nShow some RPG attributes.\\nWait for the escape key.\\nShut down.\\n\\nTo show some RPG attributes:\\nGenerate some stats (valid).\\nFind a sum of the stats.\\nFind a count of attributes greater than fourteen in the stats.\\nWrite the stats on the console.\\nDestroy the stats.\\nWrite \\\"Total: \\\" then the sum on the console.\\nWrite \\\"Number of stats greater than fourteen: \\\" then the count on the console.\\n\\nSome stats are some entries.\\n\\nA sum is a number.\\n\\nTo write some stats on the console:\\nGet an entry from the stats.\\nLoop.\\nIf the entry is nil, write \\\"\\\" on the console; exit.\\nConvert the entry's attribute to a string.\\nWrite the string on the console without advancing.\\nIf the entry's next is not nil, write \\\", \\\" on the console without advancing.\\nPut the entry's next into the entry.\\nRepeat.\\n\",\n \"language\": \"Plain-English\"\n },\n {\n \"code\": \"#heroicAttributeMinimum = 15\\n#heroicAttributeCountMinimum = 2\\n#attributeSumMinimum = 75\\n#attributeCount = 6\\n\\nProcedure roll_attribute()\\n Protected i, sum\\n Dim rolls(3)\\n\\n For i = 0 To 3\\n rolls(i) = Random(6, 1)\\n Next i\\n\\n ;sum the highest three rolls\\n SortArray(rolls(), #PB_Sort_Descending)\\n For i = 0 To 2\\n sum + rolls(i)\\n Next\\n ProcedureReturn sum\\nEndProcedure\\n\\nProcedure displayAttributes(List attributes(), sum, heroicCount)\\n Protected output$\\n\\n output$ = \\\"Attributes generated: [\\\"\\n ForEach attributes()\\n output$ + attributes()\\n If ListIndex(attributes()) <> #attributeCount - 1: output$ + \\\", \\\": EndIf\\n Next\\n output$ + \\\"]\\\"\\n PrintN(output$)\\n PrintN(\\\"Total: \\\" + sum + \\\", Values \\\" + #heroicAttributeMinimum + \\\" or above: \\\" + heroicCount)\\nEndProcedure\\n\\nProcedure Gen_attributes()\\n Protected i, attributesSum, heroicAttributesCount\\n\\n NewList attributes()\\n Repeat\\n ClearList(attributes())\\n attributesSum = 0: heroicAttributesCount = 0\\n For i = 1 To #attributeCount\\n AddElement(attributes())\\n attributes() = roll_attribute()\\n attributesSum + attributes()\\n heroicAttributesCount + Bool(attributes() >= #heroicAttributeMinimum)\\n Next\\n Until attributesSum >= #attributeSumMinimum And heroicAttributesCount >= #heroicAttributeCountMinimum\\n\\n displayAttributes(attributes(), attributesSum, heroicAttributesCount)\\nEndProcedure\\n\\nIf OpenConsole(\\\"RPG Attributes Generator\\\")\\n Gen_attributes()\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\"): Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import random\\nrandom.seed()\\nattributes_total = 0\\ncount = 0\\n\\nwhile attributes_total < 75 or count < 2:\\n attributes = []\\n\\n for attribute in range(0, 6):\\n rolls = []\\n\\n for roll in range(0, 4):\\n result = random.randint(1, 6)\\n rolls.append(result)\\n\\n sorted_rolls = sorted(rolls)\\n largest_3 = sorted_rolls[1:]\\n rolls_total = sum(largest_3)\\n\\n if rolls_total >= 15:\\n count += 1\\n\\n attributes.append(rolls_total)\\n\\n attributes_total = sum(attributes)\\n\\nprint(attributes_total, attributes)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import random\\nrandom.seed()\\ntotal = 0\\ncount = 0\\n\\nwhile total < 75 or count < 2:\\n attributes = [(sum(sorted([random.randint(1, 6) for roll in range(0, 4)])[1:])) for attribute in range(0, 6)]\\n\\n for attribute in attributes:\\n if attribute >= 15:\\n count += 1\\n\\n total = sum(attributes)\\n\\nprint(total, attributes)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import random\\n\\ndef compute():\\n values = []\\n while (sum(values) < 75 # Total must be >= 75\\n or sum(1 for v in values if v >= 15) < 2): # Two must be >= 15\\n values = [sum(sorted(random.randint(1, 6) for _ in range(4))[1:]) for _ in range(6)]\\n return sum(values), values\\n\\nfor i in range(3):\\n print(*compute())\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''RPG Attributes Generator'''\\n\\nfrom itertools import islice\\nfrom random import randint\\nfrom operator import eq\\n\\n\\n# heroes :: Gen IO [(Int, Int, Int, Int, Int, Int)]\\ndef heroes(p):\\n '''Non-finite list of heroes matching\\n the requirements of predicate p.\\n '''\\n while True:\\n yield tuple(\\n until(p)(character)([])\\n )\\n\\n\\n# character :: () -> IO [Int]\\ndef character(_):\\n '''A random character with six\\n integral attributes.\\n '''\\n return [\\n sum(sorted(map(\\n randomRInt(1)(6),\\n enumFromTo(1)(4)\\n ))[1:])\\n for _ in enumFromTo(1)(6)\\n ]\\n\\n\\n# ------------------------- TEST --------------------------\\n# main :: IO ()\\ndef main():\\n '''Test :: Sample of 10'''\\n\\n # seventyFivePlusWithTwo15s :: [Int] -> Bool\\n def seventyFivePlusIncTwo15s(xs):\\n '''Sums to 75 or more,\\n and includes at least two 15s.\\n '''\\n return 75 <= sum(xs) and (\\n 1 < len(list(filter(curry(eq)(15), xs)))\\n )\\n\\n print('A sample of 10:\\\\n')\\n print(unlines(\\n str(sum(x)) + ' -> ' + str(x) for x\\n in take(10)(heroes(\\n seventyFivePlusIncTwo15s\\n ))\\n ))\\n\\n\\n# ------------------------- GENERIC -------------------------\\n\\n# curry :: ((a, b) -> c) -> a -> b -> c\\ndef curry(f):\\n '''A curried function derived\\n from an uncurried function.\\n '''\\n return lambda x: lambda y: f(x, y)\\n\\n\\n# enumFromTo :: Int -> Int -> [Int]\\ndef enumFromTo(m):\\n '''Enumeration of integer values [m..n]'''\\n return lambda n: range(m, 1 + n)\\n\\n\\n# randomRInt :: Int -> Int -> IO () -> Int\\ndef randomRInt(m):\\n '''The return value of randomRInt is itself\\n a function. The returned function, whenever\\n called, yields a a new pseudo-random integer\\n in the range [m..n].\\n '''\\n return lambda n: lambda _: randint(m, n)\\n\\n\\n# take :: Int -> [a] -> [a]\\n# take :: Int -> String -> String\\ndef take(n):\\n '''The prefix of xs of length n,\\n or xs itself if n > length xs.\\n '''\\n return lambda xs: (\\n xs[0:n]\\n if isinstance(xs, (list, tuple))\\n else list(islice(xs, n))\\n )\\n\\n\\n# unlines :: [String] -> String\\ndef unlines(xs):\\n '''A single string formed by the intercalation\\n of a list of strings with the newline character.\\n '''\\n return '\\\\n'.join(xs)\\n\\n\\n# until :: (a -> Bool) -> (a -> a) -> a -> a\\ndef until(p):\\n '''The result of repeatedly applying f until p holds.\\n The initial seed value is x.\\n '''\\n def go(f, x):\\n v = x\\n while not p(v):\\n v = f(v)\\n return v\\n return lambda f: lambda x: go(f, x)\\n\\n\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import random; print((lambda attr: f\\\"Attributes: {attr}\\\\nTotal: {sum(attr)}\\\")((lambda func, roll_func: func(func, roll_func, roll_func()))((lambda func, roll_func, rolls: rolls if sum(rolls) >= 75 and rolls.count(15) >= 2 else func(func, roll_func, roll_func())), lambda: [sum(sorted(random.randint(1, 6) for _ in range(4))[1:]) for _ in range(6)])))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"[ 0 swap witheach + ] is sum ( [ --> n )\\n\\n[ 0 ]'[ rot witheach\\n [ over do swap dip + ] drop ] is count ( [ --> n )\\n\\n[ [] 4 times\\n [ 6 random 1+ join ]\\n sort behead drop sum ] is attribute ( --> n )\\n\\n[ [] 6 times\\n [ attribute join ] ] is raw ( --> [ )\\n\\n[ dup sum 74 > not iff\\n [ drop false ] done\\n count [ 14 > ] 1 > ] is valid ( [ --> b )\\n\\n[ raw dup valid if\\n done\\n drop again ] is stats ( --> [ )\\n\\nrandomise\\nstats dup echo cr cr\\nsay 'Sum: ' dup sum echo cr\\nsay '# of attributes > 14: '\\ncount [ 14 > ] echo\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"genStats <- function()\\n{\\n stats <- c(STR = 0, DEX = 0, CON = 0, INT = 0, WIS = 0, CHA = 0)\\n for(i in seq_along(stats))\\n {\\n results <- sample(6, 4, replace = TRUE)\\n stats[i] <- sum(results[-which.min(results)])\\n }\\n if(sum(stats >= 15) < 2 || (stats[\\\"TOT\\\"] <- sum(stats)) < 75) Recall() else stats\\n}\\nprint(genStats())\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (d6 . _)\\n (+ (random 6) 1))\\n\\n(define (best-3-of-4d6 . _)\\n (apply + (rest (sort (build-list 4 d6) <))))\\n\\n(define (generate-character)\\n (let* ((rolls (build-list 6 best-3-of-4d6))\\n (total (apply + rolls)))\\n (if (or (< total 75) (< (length (filter (curryr >= 15) rolls)) 2))\\n (generate-character)\\n (values rolls total))))\\n\\n(module+ main\\n (define-values (rolled-stats total) (generate-character))\\n (printf \\\"Rolls:\\\\t~a~%Total:\\\\t~a\\\" rolled-stats total))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my ( $min_sum, $hero_attr_min, $hero_count_min ) = 75, 15, 2;\\nmy @attr-names = <Str Int Wis Dex Con Cha>;\\n\\nsub heroic { + @^a.grep: * >= $hero_attr_min }\\n\\nmy @attr;\\nrepeat until @attr.sum >= $min_sum\\n and heroic(@attr) >= $hero_count_min {\\n\\n @attr = @attr-names.map: { (1..6).roll(4).sort(+*).skip(1).sum };\\n}\\n\\nsay @attr-names Z=> @attr;\\nsay \\\"Sum: {@attr.sum}, with {heroic(@attr)} attributes >= $hero_attr_min\\\";\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"Red [\\\"RPG attributes generator\\\"]\\n\\nraw-attribute: does [\\n sum next sort collect [\\n loop 4 [keep random/only 6]\\n ]\\n]\\n\\nraw-attributes: does [\\n collect [\\n loop 6 [keep raw-attribute]\\n ]\\n]\\n\\nvalid-attributes?: func [b][\\n n: 0\\n foreach attr b [\\n if attr > 14 [n: n + 1]\\n ]\\n all [\\n n > 1\\n greater? sum b 74\\n ]\\n]\\n\\nattributes: does [\\n until [\\n valid-attributes? a: raw-attributes\\n ]\\n a\\n]\\n\\nshow-attributes: function [a][\\n i: 1\\n foreach stat-name [\\n \\\"Strength\\\"\\n \\\"Dexterity\\\"\\n \\\"Constitution\\\"\\n \\\"Intelligence\\\"\\n \\\"Wisdom\\\"\\n \\\"Charisma\\\"\\n ][\\n print [rejoin [stat-name \\\":\\\"] a/:i]\\n i: i + 1\\n ]\\n print \\\"-----------------\\\"\\n print [\\\"Sum:\\\" sum a]\\n print [n \\\"attributes > 14\\\"]\\n]\\n\\nshow-attributes attributes\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"/* REXX\\nGenerates 4 random, whole values between 1 and 6.\\nSaves the sum of the 3 largest values.\\nGenerates a total of 6 values this way.\\nDisplays the total, and all 6 values once finished.\\n*/\\nDo try=1 By 1\\n ge15=0\\n sum=0\\n ol=''\\n Do i=1 To 6\\n rl=''\\n Do j=1 To 4\\n rl=rl (random(5)+1)\\n End\\n rl=wordsort(rl)\\n rsum.i=maxsum()\\n If rsum.i>=15 Then ge15=ge15+1\\n sum=sum+rsum.i\\n ol=ol right(rsum.i,2)\\n End\\n Say ol '->' ge15 sum\\n If ge15>=2 & sum>=75 Then Leave\\n End\\nSay try 'iterations'\\nSay ol '=>' sum\\nExit\\n\\nmaxsum: procedure Expose rl\\n/**********************************************************************\\n* Comute the sum of the 3 largest values\\n**********************************************************************/\\n m=0\\n Do i=2 To 4\\n m=m+word(rl,i)\\n End\\n Return m\\n\\nwordsort: Procedure\\n/**********************************************************************\\n* Sort the list of words supplied as argument. Return the sorted list\\n**********************************************************************/\\n Parse Arg wl\\n wa.=''\\n wa.0=0\\n Do While wl<>''\\n Parse Var wl w wl\\n Do i=1 To wa.0\\n If wa.i>w Then Leave\\n End\\n If i<=wa.0 Then Do\\n Do j=wa.0 To i By -1\\n ii=j+1\\n wa.ii=wa.j\\n End\\n End\\n wa.i=w\\n wa.0=wa.0+1\\n End\\n swl=''\\n Do i=1 To wa.0\\n swl=swl wa.i\\n End\\n Return strip(swl)\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program generates values for six core attributes for a RPG (Role Playing Game).*/\\n do until m>=2 & $$>=75; $$= 0; list= /*do rolls until requirements are met. */\\n m= 0 /*the number of values ≥ 15 (so far).*/\\n do 6; $= 0 /*6 values (meet criteria); attrib. sum*/\\n do d=1 for 4; @.d= random(1, 6) /*roll four random dice (six sided die)*/\\n $= $ + @.d /*also obtain their sum (of die pips).*/\\n end /*d*/ /* [↓] use of MIN BIF avoids sorting.*/\\n $= $ - min(@.1, @.2, @.3, @.4) /*obtain the sum of the highest 3 rolls*/\\n list= list $; $$= $$ + $ /*append $──►list; add $ to overall $$.*/\\n $$= $$ + $ /*add the $ sum to the overall sum. */\\n m= m + ($>=15) /*get # of rolls that meet the minimum.*/\\n end /*do 6*/ /* [↑] gen six core attribute values. */\\n end /*until*/ /*stick a fork in it, we're all done. */\\nsay 'The total for ' list \\\" is ──► \\\" $$', ' m \\\" entries are ≥ 15.\\\"\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program generates values for six core attributes for an RPG (Role Playing Game).*/\\nDo n=1 By 1 until m>=2 & tot>=75;\\n slist=''\\n tot=0\\n m=0\\n Do 6\\n sum=0\\n Do d=1 To 4;\\n cast.d=random(1,6)\\n sum=sum+cast.d\\n End\\n min=min(cast.1,cast.2,cast.3,cast.4)\\n sum=sum-min\\n slist=slist sum\\n tot=tot+sum\\n m=m+(sum>=15)\\n end\\n Say 'the total for' space(slist) 'is -->' tot', 'm' entries are >= 15.'\\n end\\nSay 'Solution found with' n 'iterations'\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : RPG Attributes Generator\\n\\nload \\\"stdlib.ring\\\"\\nattributestotal = 0\\ncount = 0\\nwhile attributestotal < 75 or count < 2\\n attributes = []\\n for attribute = 0 to 6\\n rolls = []\\n largest3 = []\\n for roll = 0 to 4\\n result = random(5)+1\\n add(rolls,result)\\n next\\n sortedrolls = sort(rolls)\\n sortedrolls = reverse(sortedrolls)\\n for n = 1 to 3\\n add(largest3,sortedrolls[n])\\n next\\n rollstotal = sum(largest3)\\n if rollstotal >= 15\\n count = count + 1\\n ok\\n add(attributes,rollstotal)\\n next\\n attributestotal = sum(attributes)\\nend\\nshowline()\\n\\nfunc sum(aList)\\n num = 0\\n for n = 1 to len(aList)\\n num = num + aList[n]\\n next\\n return num\\n\\nfunc showline()\\n line = \\\"(\\\" + attributestotal + \\\", [\\\"\\n for n = 1 to len(attributes)\\n line = line + attributes[n] + \\\", \\\"\\n next\\n line = left(line,len(line)-2)\\n line = line + \\\"])\\\"\\n see line + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"res = []\\nuntil res.sum >= 75 && res.count{|n| n >= 15} >= 2 do\\n res = Array.new(6) do\\n a = Array.new(4){rand(1..6)}\\n a.sum - a.min\\n end\\nend\\n\\np res\\nputs \\\"sum: #{res.sum}\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"dim statnames$(6)\\ndata \\\"STR\\\", \\\"CON\\\", \\\"DEX\\\", \\\"INT\\\", \\\"WIS\\\", \\\"CHA\\\"\\nfor i = 1 to 6\\n read statnames$(i)\\nnext i\\ndim stat(6)\\nacceptable = false\\n\\nwhile 1\\n sum = 0 : n15 = 0\\n for i = 1 to 6\\n stat(i) = rollstat()\\n sum = sum + stat(i)\\n\\tif stat(i) >= 15 then n15 = n15 + 1\\n next i\\n if sum >= 75 and n15 >= 2 then exit while\\nwend\\n\\nfor i = 1 to 6\\n print statnames$(i); \\\": \\\"; stat(i)\\nnext i\\nprint \\\"-------\\\"\\nprint \\\"TOT: \\\"; sum\\nend\\n\\nfunction d6()\\n d6 = 1 + int(rnd(1) * 6)\\nend function\\n\\nfunction rollstat()\\n a = d6() : b = d6() : c = d6() : d = d6()\\n rollstat = a + b + c + d - min(min(a, b), min(c, d))\\nend function\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use rand::distributions::Uniform;\\nuse rand::prelude::{thread_rng, ThreadRng};\\nuse rand::Rng;\\n\\nfn main() {\\n for _ in 0..=10 {\\n attributes_engine();\\n }\\n}\\n\\n#[derive(Copy, Clone, Debug)]\\npub struct Dice {\\n amount: i32,\\n range: Uniform<i32>,\\n rng: ThreadRng,\\n}\\n\\nimpl Dice {\\n // Modeled after d20 polyhederal dice use and notation.\\n // roll_pool() - returns Vec<i32> with length of vector determined by dice amount.\\n // attribute_out() - returns i32, by sorting a dice pool of 4d6, dropping the lowest integer, and summing all elements.\\n pub fn new(amount: i32, size: i32) -> Self {\\n Self {\\n amount,\\n range: Uniform::new(1, size + 1),\\n rng: thread_rng(),\\n }\\n }\\n\\n fn roll_pool(mut self) -> Vec<i32> {\\n (0..self.amount)\\n .map(|_| self.rng.sample(self.range))\\n .collect()\\n }\\n\\n fn attribute_out(&self) -> i32 {\\n // Sort dice pool lowest to high and drain all results to exclude the lowest before summing.\\n let mut attribute_array: Vec<i32> = self.roll_pool();\\n attribute_array.sort();\\n attribute_array.drain(1..=3).sum()\\n }\\n}\\n\\nfn attributes_finalizer() -> (Vec<i32>, i32, bool) {\\n let die: Dice = Dice::new(4, 6);\\n let mut attributes: Vec<i32> = Vec::new();\\n\\n for _ in 0..6 {\\n attributes.push(die.attribute_out())\\n }\\n\\n let attributes_total: i32 = attributes.iter().sum();\\n\\n let numerical_condition: bool = attributes\\n .iter()\\n .filter(|attribute| **attribute >= 15)\\n .count()\\n >= 2;\\n\\n (attributes, attributes_total, numerical_condition)\\n}\\n\\nfn attributes_engine() {\\n loop {\\n let (attributes, attributes_total, numerical_condition) = attributes_finalizer();\\n if (attributes_total >= 75) && (numerical_condition) {\\n println!(\\n \\\"{:?} | sum: {:?}\\\",\\n attributes, attributes_total\\n );\\n break;\\n } else {\\n continue;\\n }\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import scala.util.Random\\nRandom.setSeed(1)\\n\\ndef rollDice():Int = {\\n val v4 = Stream.continually(Random.nextInt(6)+1).take(4)\\n v4.sum - v4.min\\n}\\n\\ndef getAttributes():Seq[Int] = Stream.continually(rollDice()).take(6)\\n\\ndef getCharacter():Seq[Int] = {\\n val attrs = getAttributes()\\n println(\\\"generated => \\\" + attrs.mkString(\\\"[\\\",\\\",\\\", \\\"]\\\"))\\n (attrs.sum, attrs.filter(_>15).size) match {\\n case (a, b) if (a < 75 || b < 2) => getCharacter\\n case _ => attrs\\n }\\n}\\n\\nprintln(\\\"picked => \\\" + getCharacter.mkString(\\\"[\\\", \\\",\\\", \\\"]\\\"))\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst proc: main is func\\n local\\n var integer: count is 0;\\n var integer: total is 0;\\n var integer: attribIdx is 0;\\n var integer: diceroll is 0;\\n var integer: sumOfRolls is 0;\\n var array integer: attribute is 6 times 0;\\n var array integer: dice is 4 times 0;\\n begin\\n repeat\\n count := 0;\\n total := 0;\\n for key attribIdx range attribute do\\n for key diceroll range dice do\\n dice[diceroll] := rand(1, 6);\\n end for;\\n dice := sort(dice);\\n sumOfRolls := 0;\\n for diceroll range 2 to maxIdx(dice) do # Discard the lowest roll\\n sumOfRolls +:= dice[diceroll];\\n end for;\\n attribute[attribIdx] := sumOfRolls;\\n total +:= sumOfRolls;\\n if sumOfRolls >= 15 then\\n incr(count);\\n end if;\\n end for;\\n until total >= 75 and count >= 2;\\n writeln(\\\"Attributes:\\\");\\n for key attribIdx range attribute do\\n writeln(attribIdx <& \\\" ..... \\\" <& attribute[attribIdx] lpad 2);\\n end for;\\n writeln(\\\" ----\\\");\\n writeln(\\\"Total \\\" <& total lpad 3);\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"FUNCTION min(a, b)\\n IF a < b THEN LET min = a ELSE LET min = b\\nEND FUNCTION\\n\\nFUNCTION d6\\n LET d6 = 1 + INT(RND * 6)\\nEND FUNCTION\\n\\nFUNCTION rollstat\\n LET a = d6\\n LET b = d6\\n LET c = d6\\n LET d = d6\\n LET rollstat = a + b + c + d - min(min(a, b), min(c, d))\\nEND FUNCTION\\n\\nDIM statnames$(6)\\nDATA \\\"STR\\\", \\\"CON\\\", \\\"DEX\\\", \\\"INT\\\", \\\"WIS\\\", \\\"CHA\\\"\\nFOR i = 1 TO 6\\n READ statnames$(i)\\nNEXT i\\nDIM stat(6)\\nLET acceptable = 0\\n\\nRANDOMIZE ! RANDOMIZE TIMER en QBasic\\nDO\\n LET sum = 0\\n LET n15 = 0\\n FOR i = 1 to 6\\n LET stat(i) = rollstat\\n LET sum = sum + stat(i)\\n IF stat(i) >= 15 THEN LET n15 = n15 + 1\\n NEXT i\\n IF sum >= 75 AND n15 >= 2 THEN LET acceptable = 1\\nLOOP UNTIL acceptable = 1\\n\\nFOR i = 1 to 6\\n PRINT statnames$(i); \\\": \\\"; stat(i)\\nNEXT i\\nPRINT \\\"--------\\\"\\nPRINT \\\"TOT: \\\"; sum\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"function main {\\n typeset attrs=(str dex con int wis cha)\\n typeset -A values\\n typeset attr\\n typeset -i value total fifteens\\n while true; do\\n fifteens=0\\n total=0\\n for attr in \\\"${attrs[@]}\\\"; do\\n # \\\"random\\\" values repeat in zsh if run in a subshell\\n r4d6drop >/tmp/$$\\n read value </tmp/$$\\n values[$attr]=$value\\n (( total += value ))\\n if (( value >= 15 )); then\\n (( fifteens += 1 ))\\n fi\\n done\\n if (( total >= 75 && fifteens >= 2 )); then\\n break\\n fi\\n done\\n rm -f /tmp/$$\\n for attr in \\\"${attrs[@]}\\\"; do\\n printf '%s: %d\\\\n' \\\"$attr\\\" \\\"${values[$attr]}\\\"\\n done\\n}\\n\\nfunction r4d6drop {\\n typeset -i d1=RANDOM%6+1 d2=RANDOM%6+1 d3=RANDOM%6+1 d4=RANDOM%6+1\\n typeset e=$(printf '%s\\\\n' $d1 $d2 $d3 $d4 |\\n sort -n | tail -n +2 | tr $'\\\\n' +)\\n printf '%d\\\\n' $(( ${e%+} ))\\n}\\n\\nmain \\\"$@\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"Module Module1\\n\\n Dim r As New Random\\n\\n Function getThree(n As Integer) As List(Of Integer)\\n getThree = New List(Of Integer)\\n For i As Integer = 1 To 4 : getThree.Add(r.Next(n) + 1) : Next\\n getThree.Sort() : getThree.RemoveAt(0)\\n End Function\\n\\n Function getSix() As List(Of Integer)\\n getSix = New List(Of Integer)\\n For i As Integer = 1 To 6 : getSix.Add(getThree(6).Sum) : Next\\n End Function\\n\\n Sub Main(args As String())\\n Dim good As Boolean = False : Do\\n Dim gs As List(Of Integer) = getSix(), gss As Integer = gs.Sum,\\n hvc As Integer = gs.FindAll(Function(x) x > 14).Count\\n Console.Write(\\\"attribs: {0}, sum={1}, ({2} sum, high vals={3})\\\",\\n String.Join(\\\", \\\", gs), gss, If(gss >= 75, \\\"good\\\", \\\"low\\\"), hvc)\\n good = gs.Sum >= 75 AndAlso hvc > 1\\n Console.WriteLine(\\\" - {0}\\\", If(good, \\\"success\\\", \\\"failure\\\"))\\n Loop Until good\\n End Sub\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"random\\\" for Random\\nimport \\\"./sort\\\" for Sort\\n\\nvar rand = Random.new()\\nvar vals = List.filled(6, 0)\\nwhile (true) {\\n for (i in 0..5) {\\n var rns = List.filled(4, 0)\\n for (j in 0..3) rns[j] = rand.int(1, 7)\\n var sum = rns.reduce { |acc, n| acc + n }\\n Sort.insertion(rns)\\n vals[i] = sum - rns[0]\\n }\\n var total = vals.reduce { |acc, n| acc + n }\\n if (total >= 75) {\\n var fifteens = vals.count { |n| n >= 15 }\\n if (fifteens >= 2) {\\n System.print(\\\"The six values are: %(vals)\\\")\\n System.print(\\\"Their total is: %(total)\\\")\\n break\\n }\\n }\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func Gen; \\\\Return sum of the three largest of four random values\\nint I, R, Min, SI, Sum, Die(4);\\n[Min:= 7; Sum:= 0;\\nfor I:= 0 to 4-1 do\\n [R:= Ran(6)+1; \\\\R = 1..6\\n if R < Min then\\n [Min:= R; SI:= I];\\n Sum:= Sum+R;\\n Die(I):= R;\\n ];\\nreturn Sum - Die(SI);\\n];\\n\\nint Total, Count, J, Value(6);\\n[repeat Total:= 0; Count:= 0;\\n for J:= 0 to 6-1 do\\n [Value(J):= Gen;\\n if Value(J) >= 15 then Count:= Count+1;\\n Total:= Total + Value(J);\\n ];\\nuntil Total >= 75 and Count >= 2;\\nText(0, \\\"Total: \\\"); IntOut(0, Total); CrLf(0);\\nfor J:= 0 to 6-1 do\\n [IntOut(0, Value(J)); ChOut(0, ^ )];\\nCrLf(0);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"sub d6()\\n //simulates a marked regular hexahedron coming to rest on a plane\\n return 1 + int(ran(6))\\nend sub\\n\\nsub roll_stat()\\n //rolls four dice, returns the sum of the three highest\\n a = d6() : b = d6(): c = d6(): d = d6()\\n return a + b + c + d - min(min(a, b), min(c, d))\\nend sub\\n\\ndim statnames$(6)\\nstatnames$(1) = \\\"STR\\\"\\nstatnames$(2) = \\\"CON\\\"\\nstatnames$(3) = \\\"DEX\\\"\\nstatnames$(4) = \\\"INT\\\"\\nstatnames$(5) = \\\"WIS\\\"\\nstatnames$(6) = \\\"CHA\\\"\\n\\ndim stat(6)\\nacceptable = false\\n\\nrepeat\\n sum = 0\\n n15 = 0\\n for i = 1 to 6\\n stat(i) = roll_stat()\\n sum = sum + stat(i)\\n if stat(i) >= 15 then n15 = n15 + 1 : fi\\n next i\\n if sum >= 75 and n15 >= 2 then acceptable = true : fi\\nuntil acceptable\\n\\nfor i = 1 to 6\\n print statnames$(i), \\\": \\\", stat(i) using \\\"##\\\"\\nnext i\\nprint \\\"-------\\\\nTOT: \\\", sum\\nend\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"const std = @import(\\\"std\\\");\\n\\nconst dice = 6;\\nconst rolls = 4;\\nconst stat_count = 6;\\n\\n// requirements\\nconst min_stat_sum = 75;\\nconst min_high_stat_count = 2;\\nconst high_stat_threshold = 15;\\n\\nconst RollResult = struct { stats: [stat_count]u16, total: u16 };\\n\\nfn roll_attribute(rand: std.rand.Random) u16 {\\n var min_roll: u16 = dice;\\n var total: u16 = 0;\\n\\n for (0..rolls) |_| {\\n const roll = rand.uintAtMost(u16, dice - 1) + 1;\\n if (min_roll > roll) {\\n min_roll = roll;\\n }\\n total += roll;\\n }\\n\\n return total - min_roll;\\n}\\n\\nfn roll_stats(rand: std.rand.Random) RollResult {\\n var result: RollResult = RollResult{\\n .stats = undefined,\\n .total = 0,\\n };\\n var high_stat_count: u16 = 0;\\n\\n var i: u16 = 0;\\n while (i < stat_count) {\\n // roll a stat\\n result.stats[i] = roll_attribute(rand);\\n result.total += result.stats[i];\\n if (result.stats[i] >= high_stat_threshold) high_stat_count += 1;\\n\\n // find the maximum possible total\\n const stats_remain = stat_count - i - 1;\\n const max_possible_total = result.total + dice * (rolls - 1) * stats_remain;\\n\\n // if it is below the minimum or there are not enough stats over 15 reset\\n if (max_possible_total < min_stat_sum or high_stat_count + stats_remain < 2) {\\n i = 0;\\n result.total = 0;\\n high_stat_count = 0;\\n } else {\\n i += 1;\\n }\\n }\\n\\n return result;\\n}\\n\\npub fn main() !void {\\n // Create random generator\\n var prng = std.rand.DefaultPrng.init(blk: {\\n var seed: u64 = undefined;\\n try std.os.getrandom(std.mem.asBytes(&seed));\\n break :blk seed;\\n });\\n const rand = prng.random();\\n\\n const stats = roll_stats(rand);\\n const stdout = std.io.getStdOut().writer();\\n\\n try stdout.print(\\\"Total: {}\\\\n\\\", .{stats.total});\\n try stdout.print(\\\"Stats: [ \\\", .{});\\n for (stats.stats) |stat| {\\n try stdout.print(\\\"{} \\\", .{stat});\\n }\\n try stdout.print(\\\"]\\\\n\\\", .{});\\n}\\n\",\n \"language\": \"Zig\"\n },\n {\n \"code\": \"reg attrs=List(), S,N;\\ndo{\\n attrs.clear();\\n do(6){\\n abcd:=(4).pump(List,(0).random.fp(1,7)); // list of 4 [1..6] randoms\\n attrs.append(abcd.sum(0) - (0).min(abcd)); // sum and substract min\\n }\\n}while((S=attrs.sum(0))<75 or (N=attrs.filter('>=(15)).len())<2);\\nprintln(\\\"Random numbers: %s\\\\nSums to %d, with %d >= 15\\\"\\n .fmt(attrs.concat(\\\",\\\"),S,N));\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"RPG-attributes-generator"}}},{"rowIdx":1597,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/RSA_code\nnote: Encryption\n","language":"00-META"},{"code":"Given an [[wp:RSA|RSA]] key (n,e,d), construct a program to encrypt and decrypt plaintext messages strings. \n\n'''Background'''\n\nRSA code is used to encode secret messages. It is named after Ron Rivest, Adi Shamir, and Leonard Adleman who published it at MIT in 1977. The advantage of this type of encryption is that you can distribute the number “<math>n</math>” and “<math>e</math>” (which makes up the Public Key used for encryption) to everyone. The Private Key used for decryption “<math>d</math>” is kept secret, so that only the recipient can read the encrypted plaintext. \n\nThe process by which this is done is that a message, for example “Hello World” is encoded as numbers (This could be encoding as ASCII or as a subset of characters <math>a=01,b=02,...,z=26</math>). This yields a string of numbers, generally referred to as \"numerical plaintext\", “<math>P</math>”. For example, “Hello World” encoded with a=1,...,z=26 by hundreds would yield <math>0805 1212 1523 1518 1204</math>. \n\nThe plaintext must also be split into blocks so that the numerical plaintext is smaller than <math>n</math> otherwise the decryption will fail. \n\nThe ciphertext, <math>C</math>, is then computed by taking each block of <math>P</math>, and computing\n: <math>C \\equiv P^e \\mod n</math>\nSimilarly, to decode, one computes\n: <math>P \\equiv C^d \\mod n</math> \n\nTo generate a key, one finds 2 (ideally large) primes <math>p</math> and <math>q</math>. the value “<math>n</math>” is simply: <math>n = p \\times q</math>. \nOne must then choose an “<math>e</math>” such that <math>\\gcd(e, (p-1)\\times(q-1) ) = 1</math>. That is to say, <math>e</math> and <math>(p-1)\\times(q-1)</math> are relatively prime to each other. \n\nThe decryption value <math>d</math> is then found by solving\n: <math>d\\times e \\equiv 1 \\mod (p-1)\\times(q-1)</math>\n\nThe security of the code is based on the secrecy of the Private Key (decryption exponent) “<math>d</math>” and the difficulty in factoring “<math>n</math>”. Research into RSA facilitated advances in factoring and a number of [http://www.rsa.com/rsalabs/node.asp?id=2092 factoring challenges]. Keys of 829 bits have been successfully factored, and NIST now recommends 2048 bit keys going forward (see [[wp:Key_size#Asymmetric_algorithm_key_lengths|Asymmetric algorithm key lengths]]).\n\n'''Summary of the task requirements:'''\n\n* Encrypt and Decrypt a short message or two using RSA with a demonstration key. \n* Implement RSA do not call a library.\n* Encode and decode the message using any reversible method of your choice (ASCII or a=1,..,z=26 are equally fine). \n* Either support blocking or give an error if the message would require blocking)\n* Demonstrate that your solution could support real keys by using a non-trivial key that requires large integer support (built-in or libraries). There is no need to include library code but it must be referenced unless it is built into the language. The following keys will be meet this requirement;however, they are NOT long enough to be considered secure:\n:: n = 9516311845790656153499716760847001433441357\n:: e = 65537\n:: d = 5617843187844953170308463622230283376298685\n* Messages can be hard-coded into the program, there is no need for elaborate input coding.\n* Demonstrate that your implementation works by showing plaintext, intermediate results, encrypted text, and decrypted text.\n\n{{alertbox|#ffff70|'''<big>Warning</big>'''<br/>Rosetta Code is '''not''' a place you should rely on for examples of code in critical roles, including security.<br/>Cryptographic routines should be validated before being used.<br/>For a discussion of limitations and please refer to [[Talk:RSA_code#Difference_from_practical_cryptographical_version]].}}\n\n","language":"00-TASK"},{"code":"V n = BigInt(‘9516311845790656153499716760847001433441357’)\nV e = BigInt(65537)\nV d = BigInt(‘5617843187844953170308463622230283376298685’)\n\nV txt = ‘Rosetta Code’\n\nprint(‘Plain text: ’txt)\n\nV txtN = txt.reduce(BigInt(0), (a, b) -> a * 256 + b.code)\nprint(‘Plain text as a number: ’txtN)\n\nV enc = pow(txtN, e, n)\nprint(‘Encoded: ’enc)\n\nV dec = pow(enc, d, n)\nprint(‘Decoded: ’dec)\n\nV decTxt = ‘’\nL dec != 0\n decTxt ‘’= Char(code' dec % 256)\n dec I/= 256\n\nprint(‘Decoded number as text: ’reversed(decTxt))\n","language":"11l"},{"code":"WITH GMP, GMP.Integers, Ada.Text_IO, GMP.Integers.Aliased_Internal_Value, Interfaces.C;\nUSE GMP, Gmp.Integers, Ada.Text_IO, Interfaces.C;\n\nPROCEDURE Main IS\n FUNCTION \"+\" (U : Unbounded_Integer) RETURN Mpz_T IS (Aliased_Internal_Value (U));\n FUNCTION \"+\" (S : String) RETURN Unbounded_Integer IS (To_Unbounded_Integer (S));\n FUNCTION Image_Cleared (M : Mpz_T) RETURN String IS (Image (To_Unbounded_Integer (M)));\n N : Unbounded_Integer := +\"9516311845790656153499716760847001433441357\";\n E : Unbounded_Integer := +\"65537\";\n D : Unbounded_Integer := +\"5617843187844953170308463622230283376298685\";\n Plain_Text : CONSTANT String := \"Rosetta Code\";\n M, M_C, M_D : Mpz_T;\n-- We import two C functions from the GMP library which are not in the specs of the gmp package\n PROCEDURE Mpz_Import\n (Rop : Mpz_T; Count : Size_T; Order : Int; Size : Size_T; Endian : Int;\n Nails : Size_T; Op : Char_Array);\n PRAGMA Import (C, Mpz_Import, \"__gmpz_import\");\n\n PROCEDURE Mpz_Export\n (Rop : OUT Char_Array; Count : ACCESS Size_T; Order : Int; Size : Size_T;\n Endian : Int; Nails : Size_T; Op : Mpz_T);\n PRAGMA Import (C, Mpz_Export, \"__gmpz_export\");\nBEGIN\n Mpz_Init (M);\n Mpz_Init (M_C);\n Mpz_Init (M_D);\n Mpz_Import (M, Plain_Text'Length + 1, 1, 1, 0, 0, To_C (Plain_Text));\n Mpz_Powm (M_C, M, +E, +N);\n Mpz_Powm (M_D, M_C, +D, +N);\n Put_Line (\"Encoded plain text: \" & Image_Cleared (M));\n DECLARE Decrypted : Char_Array (1 .. Mpz_Sizeinbase (M_C, 256));\n BEGIN\n Put_Line (\"Encryption of this encoding: \" & Image_Cleared (M_C));\n Mpz_Export (Decrypted, NULL, 1, 1, 0, 0, M_D);\n Put_Line (\"Decryption of the encoding: \" & Image_Cleared (M_D));\n Put_Line (\"Final decryption: \" & To_Ada (Decrypted));\n END;\nEND Main;\n","language":"Ada"},{"code":"COMMENT\n First cut. Doesn't yet do blocking and deblocking. Also, as\n encryption and decryption are identical operations but for the\n reciprocal exponents used, only one has been implemented below.\n\n A later release will address these issues.\nCOMMENT\n\nBEGIN\n PR precision=1000 PR\n MODE LLI = LONG LONG INT; CO For brevity CO\n PROC mod power = (LLI base, exponent, modulus) LLI :\n BEGIN\n LLI result := 1, b := base, e := exponent;\n IF exponent < 0\n THEN\n\t put (stand error, ((\"Negative exponent\", exponent, newline)))\n ELSE\n\t WHILE e > 0\n\t DO\n\t (ODD e | result := (result * b) MOD modulus);\n\t e OVERAB 2; b := (b * b) MOD modulus\n\t OD\n FI;\n result\n END;\n PROC modular inverse = (LLI a, m) LLI :\n BEGIN\n PROC extended gcd = (LLI x, y) []LLI :\n BEGIN\n\t LLI v := 1, a := 1, u := 0, b := 0, g := x, w := y;\n\t WHILE w>0\n\t DO\n\t LLI q := g % w, t := a - q * u;\n\t a := u; u := t;\n\t t := b - q * v;\n\t b := v; v := t;\n\t t := g - q * w;\n\t g := w; w := t\n\t OD;\n\t a PLUSAB (a < 0 | u | 0);\n\t (a, b, g)\n END;\n [] LLI egcd = extended gcd (a, m);\n (egcd[3] > 1 | 0 | egcd[1] MOD m)\n END;\n PROC number to string = (LLI number) STRING :\n BEGIN\n [] CHAR map = (blank + \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")[@0];\n LLI local number := number;\n INT length := SHORTEN SHORTEN ENTIER long long log(number) + 1;\n (ODD length | length PLUSAB 1);\n [length % 2] CHAR text;\n FOR i FROM length % 2 BY -1 TO 1\n DO\n\t INT index = SHORTEN SHORTEN (local number MOD 100);\n\t text[i] := (index > 26 | \"?\" | map[index]);\n\t local number := local number % 100\n OD;\n text\n END;\nCO The parameters of a particular RSA cryptosystem CO\n LLI p = 3490529510847650949147849619903898133417764638493387843990820577;\n LLI q = 32769132993266709549961988190834461413177642967992942539798288533;\n LLI n = p * q;\n LLI phi n = (p-1) * (q-1);\n LLI e = 9007;\n LLI d = modular inverse (e, phi n);\nCO A ciphertext CO\n LLI cipher text = 96869613754622061477140922254355882905759991124574319874695120930816298225145708356931476622883989628013391990551829945157815154;\nCO Print out the corresponding plain text CO\n print (number to string (mod power (ciphertext, d, n)))\nEND\n","language":"ALGOL-68"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <gmp.h>\n\nint main(void)\n{\n mpz_t n, d, e, pt, ct;\n\n mpz_init(pt);\n mpz_init(ct);\n mpz_init_set_str(n, \"9516311845790656153499716760847001433441357\", 10);\n mpz_init_set_str(e, \"65537\", 10);\n mpz_init_set_str(d, \"5617843187844953170308463622230283376298685\", 10);\n\n const char *plaintext = \"Rossetta Code\";\n mpz_import(pt, strlen(plaintext), 1, 1, 0, 0, plaintext);\n\n if (mpz_cmp(pt, n) > 0)\n abort();\n\n mpz_powm(ct, pt, e, n);\n gmp_printf(\"Encoded: %Zd\\n\", ct);\n\n mpz_powm(pt, ct, d, n);\n gmp_printf(\"Decoded: %Zd\\n\", pt);\n\n char buffer[64];\n mpz_export(buffer, NULL, 1, 1, 0, 0, pt);\n printf(\"As String: %s\\n\", buffer);\n\n mpz_clears(pt, ct, n, e, d, NULL);\n return 0;\n}\n","language":"C"},{"code":"using System;\nusing System.Numerics;\nusing System.Text;\n\nclass Program\n{\n static void Main(string[] args)\n {\n BigInteger n = BigInteger.Parse(\"9516311845790656153499716760847001433441357\");\n BigInteger e = 65537;\n BigInteger d = BigInteger.Parse(\"5617843187844953170308463622230283376298685\");\n\n const string plaintextstring = \"Hello, Rosetta!\";\n byte[] plaintext = ASCIIEncoding.ASCII.GetBytes(plaintextstring);\n BigInteger pt = new BigInteger(plaintext);\n if (pt > n)\n throw new Exception();\n\n BigInteger ct = BigInteger.ModPow(pt, e, n);\n Console.WriteLine(\"Encoded: \" + ct);\n\n BigInteger dc = BigInteger.ModPow(ct, d, n);\n Console.WriteLine(\"Decoded: \" + dc);\n\n string decoded = ASCIIEncoding.ASCII.GetString(dc.ToByteArray());\n Console.WriteLine(\"As ASCII: \" + decoded);\n }\n}\n","language":"C-sharp"},{"code":"(defparameter *n* 9516311845790656153499716760847001433441357)\n(defparameter *e* 65537)\n(defparameter *d* 5617843187844953170308463622230283376298685)\n\n;; magic\n(defun encode-string (message)\n (parse-integer (reduce #'(lambda (x y) (concatenate 'string x y))\n (loop for c across message collect (format nil \"~2,'0d\" (- (char-code c) 32))))))\n\n;; sorcery\n(defun decode-string (message) (coerce (loop for (a b) on\n (loop for char across (write-to-string message) collect char)\n by #'cddr collect (code-char (+ (parse-integer (coerce (list a b) 'string)) 32))) 'string))\n\n;; ACTUAL RSA ALGORITHM STARTS HERE ;;\n\n;; fast modular exponentiation: runs in O(log exponent)\n;; acc is initially 1 and contains the result by the end\n(defun mod-exp (base exponent modulus acc)\n (if (= exponent 0) acc\n (mod-exp (mod (* base base) modulus) (ash exponent -1) modulus\n\t (if (= (mod exponent 2) 1) (mod (* acc base) modulus) acc))))\n\n;; to encode a message, we first convert it to its integer form.\n;; then, we raise it to the *e* power, modulo *n*\n(defun encode-rsa (message)\n (mod-exp (encode-string message) *e* *n* 1))\n\n;; to decode a message, we raise it to *d* power, modulo *n*\n;; and then convert it back into a string\n(defun decode-rsa (message)\n (decode-string (mod-exp message *d* *n* 1)))\n","language":"Common-Lisp"},{"code":"void main() {\n import std.stdio, std.bigint, std.algorithm, std.string, std.range,\n modular_exponentiation;\n\n immutable txt = \"Rosetta Code\";\n writeln(\"Plain text: \", txt);\n\n // A key set big enough to hold 16 bytes of plain text in\n // a single block (to simplify the example) and also big enough\n // to demonstrate efficiency of modular exponentiation.\n immutable BigInt n = \"2463574872878749457479\".BigInt *\n \"3862806018422572001483\".BigInt;\n immutable BigInt e = 2 ^^ 16 + 1;\n immutable BigInt d = \"5617843187844953170308463622230283376298685\";\n\n // Convert plain text to a number.\n immutable txtN = reduce!q{ (a << 8) | uint(b) }(0.BigInt, txt);\n if (txtN >= n)\n return writeln(\"Plain text message too long.\");\n writeln(\"Plain text as a number: \", txtN);\n\n // Encode a single number.\n immutable enc = txtN.powMod(e, n);\n writeln(\"Encoded: \", enc);\n\n // Decode a single number.\n auto dec = enc.powMod(d, n);\n writeln(\"Decoded: \", dec);\n\n // Convert number to text.\n char[] decTxt;\n for (; dec; dec >>= 8)\n decTxt ~= (dec & 0xff).toInt;\n writeln(\"Decoded number as text: \", decTxt.retro);\n}\n","language":"D"},{"code":"program RSA_code;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils,\n Velthuis.BigIntegers;\n\ntype\n TRSA = record\n private\n n, e, d: BigInteger;\n class function PlainTextAsNumber(data: AnsiString): BigInteger; static;\n class function NumberAsPlainText(Num: BigInteger): AnsiString; static;\n public\n constructor Create(n, e, d: string);\n function Encode(data: AnsiString): string;\n function Decode(code: string): AnsiString;\n end;\n\nfunction EncodeRSA(data: AnsiString): string;\nvar\n n, e, d, bb, ptn, etn, dtn: BigInteger;\nbegin\n // a key set big enough to hold 16 bytes of plain text in\n // a single block (to simplify the example) and also big enough\n // to demonstrate efficiency of modular exponentiation.\n n := '9516311845790656153499716760847001433441357';\n e := '65537';\n d := '5617843187844953170308463622230283376298685';\n\n for var c in data do\n begin\n bb := ord(c);\n ptn := (ptn shl 8) or bb;\n end;\n\n if BigInteger.Compare(ptn, n) >= 0 then\n begin\n Writeln('Plain text message too long');\n exit;\n end;\n writeln('Plain text as a number:', ptn.ToString);\n writeln(ptn.ToString);\n\n // encode a single number\n etn := BigInteger.ModPow(ptn, e, n);\n Writeln('Encoded: ', etn.ToString);\n\n // decode a single number\n dtn := BigInteger.ModPow(etn, d, n);\n Writeln('Decoded: ', dtn.ToString);\n\n // convert number to text\n var db: AnsiString;\n var bff: BigInteger := $FF;\n while dtn.BitLength > 0 do\n begin\n db := ansichar((dtn and bff).AsInteger) + db;\n dtn := dtn shr 8;\n end;\n Write('Decoded number as text:\"', db, '\"');\nend;\n\nconst\n pt = 'Rosetta Code';\n\n{ TRSA }\n\nconstructor TRSA.Create(n, e, d: string);\nbegin\n self.n := n;\n self.e := e;\n self.d := d;\nend;\n\nfunction TRSA.Decode(code: string): AnsiString;\nvar\n etn, dtn: BigInteger;\nbegin\n // decode a single number\n etn := code;\n dtn := BigInteger.ModPow(etn, d, n);\n Result := NumberAsPlainText(dtn);\nend;\n\nfunction TRSA.Encode(data: AnsiString): string;\nvar\n ptn: BigInteger;\nbegin\n ptn := PlainTextAsNumber(data);\n\n // encode a single number\n Result := BigInteger.ModPow(ptn, e, n).ToString;\nend;\n\nclass function TRSA.NumberAsPlainText(Num: BigInteger): AnsiString;\nvar\n bff: BigInteger;\nbegin\n // convert number to text\n bff := $FF;\n Result := '';\n while Num.BitLength > 0 do\n begin\n Result := ansichar((Num and bff).AsInteger) + Result;\n Num := Num shr 8;\n end;\nend;\n\nclass function TRSA.PlainTextAsNumber(data: AnsiString): BigInteger;\nvar\n c: AnsiChar;\n bb, n: BigInteger;\nbegin\n Result := 0;\n n := '9516311845790656153499716760847001433441357';\n for c in data do\n begin\n bb := ord(c);\n Result := (Result shl 8) or bb;\n end;\n\n if BigInteger.Compare(Result, n) >= 0 then\n raise Exception.Create('Plain text message too long');\nend;\n\nvar\n RSA: TRSA;\n Encoded: string;\n\nconst\n n = '9516311845790656153499716760847001433441357';\n e = '65537';\n d = '5617843187844953170308463622230283376298685';\n TEST_WORD = 'Rosetta Code';\n\nbegin\n RSA := TRSA.Create(n, e, d);\n Encoded := RSA.Encode(TEST_WORD);\n writeln('Plain text: ', TEST_WORD);\n writeln('Encoded: ', Encoded);\n writeln('Decoded: ', RSA.Decode(Encoded));\n Readln;\nend.\n","language":"Delphi"},{"code":"%%% @author Tony Wallace <tony@tony.gen.nz>\n%%% @doc\n%%% For details of the algorithms used see\n%%% https://en.wikipedia.org/wiki/Modular_exponentiation\n%%% @end\n%%% Created : 21 Jul 2021 by Tony Wallace <tony@resurrection>\n\n-module mod.\n-export [mod_mult/3,mod_exp/3,binary_exp/2,test/0].\n\nmod_mult(I1,I2,Mod) when\n I1 > Mod,\n is_integer(I1), is_integer(I2), is_integer(Mod) ->\n mod_mult(I1 rem Mod,I2,Mod);\nmod_mult(I1,I2,Mod) when\n I2 > Mod,\n is_integer(I1), is_integer(I2), is_integer(Mod) ->\n mod_mult(I1,I2 rem Mod,Mod);\nmod_mult(I1,I2,Mod) when\n is_integer(I1), is_integer(I2), is_integer(Mod) ->\n (I1 * I2) rem Mod.\n\nmod_exp(Base,Exp,Mod) when\n is_integer(Base),\n is_integer(Exp),\n is_integer(Mod),\n Base > 0,\n Exp > 0,\n Mod > 0 ->\n binary_exp_mod(Base,Exp,Mod);\nmod_exp(_,0,_) -> 1.\n\n\nbinary_exp(Base,Exponent) when\n is_integer(Base),\n is_integer(Exponent),\n Base > 0,\n Exponent > 0 ->\n binary_exp(Base,Exponent,1);\nbinary_exp(_,0) ->\n 1.\n\nbinary_exp(_,0,Result) ->\n Result;\nbinary_exp(Base,Exponent,Acc) ->\n binary_exp(Base*Base,Exponent bsr 1,Acc * exp_factor(Base,Exponent)).\n\n\nbinary_exp_mod(Base,Exponent,Mod) ->\n binary_exp_mod(Base rem Mod,Exponent,Mod,1).\nbinary_exp_mod(_,0,_,Result) ->\n Result;\nbinary_exp_mod(Base,Exponent,Mod,Acc) ->\n binary_exp_mod((Base*Base) rem Mod,\n\t\t Exponent bsr 1,Mod,(Acc * exp_factor(Base,Exponent))rem Mod).\n\nexp_factor(_,0) ->\n 1;\nexp_factor(Base,1) ->\n Base;\nexp_factor(Base,Exponent) ->\n exp_factor(Base,Exponent band 1).\n\ntest() ->\n 445 = mod_exp(4,13,497),\n %% Rosetta code example:\n R = 1527229998585248450016808958343740453059 =\n\tmod_exp(2988348162058574136915891421498819466320163312926952423791023078876139,\n\t\t2351399303373464486466122544523690094744975233415544072992656881240319,\n\t\tbinary_exp(10,40)),\n R.\n\n%%%-------------------------------------------------------------------\n%%% @author Tony Wallace <tony@tony.gen.nz>\n%%% @doc\n%%% Blocking not implemented. Runtime exception if message too long\n%%% Not a practical issue as RSA usually limited to symmetric key exchange\n%%% However as a key exchange tool no advantage in compressing plaintext\n%%% so that is not done either.\n%%% @end\n%%% Created : 24 Jul 2021 by Tony Wallace <tony@resurrection>\n%%%-------------------------------------------------------------------\n\n-module rsa.\n-export([key_gen/2,encrypt/2,decrypt/2,test/0]).\n-type key() :: {integer(),integer()}.\nkey_gen({N,D},E) ->\n {{E,N},{D,N}}.\n-spec encrypt(key(),integer()) -> integer().\nencrypt({E,N},MessageInt)\n when MessageInt < N ->\n mod:mod_exp(MessageInt,E,N).\n-spec decrypt(key(),integer()) -> integer().\ndecrypt({D,N},Message) ->\n mod:mod_exp(Message,D,N).\ntest() ->\n PlainText=10722935,\n N = 9516311845790656153499716760847001433441357,\n E = 65537,\n D = 5617843187844953170308463622230283376298685,\n {PublicKey,PrivateKey} = key_gen({N,D},E),\n PlainText =:= decrypt(PrivateKey,\n\t\t\t encrypt(PublicKey,PlainText)).\n","language":"Erlang"},{"code":"//Nigel Galloway February 12th., 2018\nlet RSA n g l = bigint.ModPow(l,n,g)\nlet encrypt = RSA 65537I 9516311845790656153499716760847001433441357I\nlet m_in = System.Text.Encoding.ASCII.GetBytes \"The magic words are SQUEAMISH OSSIFRAGE\"|>Array.chunkBySize 16|>Array.map(Array.fold(fun n g ->(n*256I)+(bigint(int g))) 0I)\nlet n = Array.map encrypt m_in\nlet decrypt = RSA 5617843187844953170308463622230283376298685I 9516311845790656153499716760847001433441357I\nlet g = Array.map decrypt n\nlet m_out = Array.collect(fun n->Array.unfold(fun n->if n>0I then Some(byte(int (n%256I)),n/256I) else None) n|>Array.rev) g|>System.Text.Encoding.ASCII.GetString\nprintfn \"'The magic words are SQUEAMISH OSSIFRAGE' as numbers -> %A\\nEncrypted -> %A\\nDecrypted -> %A\\nAs text -> %A\" m_in n g m_out\n","language":"F-Sharp"},{"code":"' version 17-01-2017\n' compile with: fbc -s console\n\n#Include Once \"gmp.bi\"\n\nDim As Mpz_ptr e, d, n, pt, ct\n\ne = Allocate(Len(__mpz_struct))\nd = Allocate(Len(__mpz_struct))\nn = Allocate(Len(__mpz_struct))\npt = Allocate(Len(__mpz_struct)) : mpz_init(pt)\nct = Allocate(Len(__mpz_struct)) : mpz_init(ct)\n\nmpz_init_set_str(e, \"65537\", 10)\nmpz_init_set_str(d, \"5617843187844953170308463622230283376298685\", 10)\nmpz_init_set_str(n, \"9516311845790656153499716760847001433441357\", 10)\n\nDim As ZString Ptr plaintext : plaintext = Allocate(1000)\nDim As ZString Ptr text : text = Allocate(1000)\n*plaintext = \"Rosetta Code\"\n\nmpz_import(pt, Len(*plaintext), 1, 1, 0, 0, plaintext)\n\nIf mpz_cmp(pt, n) > 0 Then GoTo clean_up\n\nmpz_powm(ct, pt, e, n)\ngmp_printf(!\" Encoded: %Zd\\n\", ct)\n\nmpz_powm(pt, ct, d, n)\ngmp_printf(!\" Decoded: %Zd\\n\", pt)\n\nmpz_export(text, NULL, 1, 1, 0, 0, pt)\nPrint \"As string: \"; *text\n\nclean_up:\nDeAllocate(plaintext) : DeAllocate(text)\nmpz_clear(e) : mpz_clear(d) : mpz_clear(n)\nmpz_clear(pt) : mpz_clear(ct)\n\n' empty keyboard buffer\nWhile Inkey <> \"\" : Wend\nPrint : Print \"hit any key to end program\"\nSleep\nEnd\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/big\"\n)\n\nfunc main() {\n var n, e, d, bb, ptn, etn, dtn big.Int\n pt := \"Rosetta Code\"\n fmt.Println(\"Plain text: \", pt)\n\n // a key set big enough to hold 16 bytes of plain text in\n // a single block (to simplify the example) and also big enough\n // to demonstrate efficiency of modular exponentiation.\n n.SetString(\"9516311845790656153499716760847001433441357\", 10)\n e.SetString(\"65537\", 10)\n d.SetString(\"5617843187844953170308463622230283376298685\", 10)\n\n // convert plain text to a number\n for _, b := range []byte(pt) {\n ptn.Or(ptn.Lsh(&ptn, 8), bb.SetInt64(int64(b)))\n }\n if ptn.Cmp(&n) >= 0 {\n fmt.Println(\"Plain text message too long\")\n return\n }\n fmt.Println(\"Plain text as a number:\", &ptn)\n\n // encode a single number\n etn.Exp(&ptn, &e, &n)\n fmt.Println(\"Encoded: \", &etn)\n\n // decode a single number\n dtn.Exp(&etn, &d, &n)\n fmt.Println(\"Decoded: \", &dtn)\n\n // convert number to text\n var db [16]byte\n dx := 16\n bff := big.NewInt(0xff)\n for dtn.BitLen() > 0 {\n dx--\n db[dx] = byte(bb.And(&dtn, bff).Int64())\n dtn.Rsh(&dtn, 8)\n }\n fmt.Println(\"Decoded number as text:\", string(db[dx:]))\n}\n","language":"Go"},{"code":"module RSAMaker\n where\nimport Data.Char ( chr )\n\nencode :: String -> [Integer]\nencode s = map (toInteger . fromEnum ) s\n\nrsa_encode :: Integer -> Integer -> [Integer] -> [Integer]\nrsa_encode n e numbers = map (\\num -> mod ( num ^ e ) n ) numbers\n\nrsa_decode :: Integer -> Integer -> [Integer] -> [Integer]\nrsa_decode d n ciphers = map (\\c -> mod ( c ^ d ) n ) ciphers\n\ndecode :: [Integer] -> String\ndecode encoded = map ( chr . fromInteger ) encoded\n\ndivisors :: Integer -> [Integer]\ndivisors n = [m | m <- [1..n] , mod n m == 0 ]\n\nisPrime :: Integer -> Bool\nisPrime n = divisors n == [1,n]\n\ntotient :: Integer -> Integer -> Integer\ntotient prime1 prime2 = (prime1 - 1 ) * ( prime2 - 1 )\n\nmyE :: Integer -> Integer\nmyE tot = head [n | n <- [2..tot - 1] , gcd n tot == 1]\n\nmyD :: Integer -> Integer -> Integer -> Integer\nmyD e n phi = head [d | d <- [1..n] , mod ( d * e ) phi == 1]\n\nmain = do\n putStrLn \"Enter a test text!\"\n text <- getLine\n let primes = take 90 $ filter isPrime [1..]\n p1 = last primes\n p2 = last $ init primes\n tot = totient p1 p2\n e = myE tot\n n = p1 * p2\n rsa_encoded = rsa_encode n e $ encode text\n d = myD e n tot\n encrypted = concatMap show rsa_encoded\n decrypted = decode $ rsa_decode d n rsa_encoded\n putStrLn (\"Encrypted: \" ++ encrypted )\n putStrLn (\"And now decrypted: \" ++ decrypted )\n","language":"Haskell"},{"code":"procedure main() # rsa demonstration\n\n n := 9516311845790656153499716760847001433441357\n e := 65537\n d := 5617843187844953170308463622230283376298685\n b := 2^integer(log(n,2)) # for blocking\n write(\"RSA Demo using\\n n = \",n,\"\\n e = \",e,\"\\n d = \",d,\"\\n b = \",b)\n\n every m := ![\"Rosetta Code\", \"Hello Word!\",\n \"This message is too long.\", repl(\"x\",*decode(n+1))] do {\n write(\"\\nMessage = \",image(m))\n write( \"Encoded = \",m := encode(m))\n if m := rsa(m,e,n) then { # unblocked\n write( \"Encrypt = \",m)\n write( \"Decrypt = \",m := rsa(m,d,n))\n }\n else { # blocked\n every put(C := [], rsa(!block(m,b),e,n))\n writes(\"Encrypt = \") ; every writes(!C,\" \") ; write()\n every put(P := [], rsa(!C,d,n))\n writes(\"Decrypt = \") ; every writes(!P,\" \") ; write()\n write(\"Unblocked = \",m := unblock(P,b))\n }\n write( \"Decoded = \",image(decode(m)))\n }\nend\n\nprocedure mod_power(base, exponent, modulus) # fast modular exponentation\n result := 1\n while exponent > 0 do {\n if exponent % 2 = 1 then\n result := (result * base) % modulus\n exponent /:= 2\n base := base ^ 2 % modulus\n }\n return result\nend\n\nprocedure rsa(text,e,n) # return rsa encryption of numerically encoded message; fail if text < n\nreturn mod_power(text,e,text < n)\nend\n\nprocedure encode(text) # numerically encode ascii text as int\n every (message := 0) := ord(!text) + 256 * message\n return message\nend\n\nprocedure decode(message) # numerically decode int to ascii text\n text := \"\"\n while text ||:= char((0 < message) % 256) do\n message /:= 256\n return reverse(text)\nend\n\nprocedure block(m,b) # break lg int into blocks of size b\n M := []\n while push(M, x := (0 < m) % b) do\n m /:= b\n return M\nend\n\nprocedure unblock(M,b) # reassemble blocks of size b into lg int\n every (m := 0) := !M + b * m\n return m\nend\n","language":"Icon"},{"code":" N=: 9516311845790656153499716760847001433441357x\n E=: 65537x\n D=: 5617843187844953170308463622230283376298685x\n\n ] text=: 'Rosetta Code'\nRosetta Code\n ] num=: 256x #. a.i.text\n25512506514985639724585018469\n num >: N NB. check if blocking is necessary (0 means no)\n0\n ] enc=: N&|@^&E num\n916709442744356653386978770799029131264344\n ] dec=: N&|@^&D enc\n25512506514985639724585018469\n ] final=: a. {~ 256x #.inv dec\nRosetta Code\n","language":"J"},{"code":"public static void main(String[] args) {\n /*\n This is probably not the best method...or even the most optimized way...however it works since n and d are too big to be ints or longs\n This was also only tested with 'Rosetta Code' and 'Hello World'\n It's also pretty limited on plainText size (anything bigger than the above will fail)\n */\n BigInteger n = new BigInteger(\"9516311845790656153499716760847001433441357\");\n BigInteger e = new BigInteger(\"65537\");\n BigInteger d = new BigInteger(\"5617843187844953170308463622230283376298685\");\n Charset c = Charsets.UTF_8;\n String plainText = \"Rosetta Code\";\n System.out.println(\"PlainText : \" + plainText);\n byte[] bytes = plainText.getBytes();\n BigInteger plainNum = new BigInteger(bytes);\n System.out.println(\"As number : \" + plainNum);\n BigInteger Bytes = new BigInteger(bytes);\n if (Bytes.compareTo(n) == 1) {\n System.out.println(\"Plaintext is too long\");\n return;\n }\n BigInteger enc = plainNum.modPow(e, n);\n System.out.println(\"Encoded: \" + enc);\n BigInteger dec = enc.modPow(d, n);\n System.out.println(\"Decoded: \" + dec);\n String decText = new String(dec.toByteArray(), c);\n System.out.println(\"As text: \" + decText);\n}\n","language":"Java"},{"code":"import java.math.BigInteger;\nimport java.util.Random;\n\npublic class rsaCode {\n public static void main(String[]args){\n //Size of primes\n int BIT_LENGTH = 4096;\n Random rand = new Random();\n //Generate primes and other necessary values\n BigInteger p = BigInteger.probablePrime(BIT_LENGTH / 2, rand);\n BigInteger q = BigInteger.probablePrime(BIT_LENGTH / 2, rand);\n BigInteger n = p.multiply(q);\n BigInteger phi = p.subtract(BigInteger.valueOf(1)).multiply(q.subtract(BigInteger.valueOf(1)));\n BigInteger e;\n BigInteger d;\n do {\n e = new BigInteger(phi.bitLength(), rand);\n } while (e.compareTo(BigInteger.valueOf(1)) <= 0 || e.compareTo(phi) >= 0 || !e.gcd(phi).equals(BigInteger.valueOf(1)));\n d = e.modInverse(phi);\n //Convert message to byte array and then to a BigInteger\n BigInteger message = new BigInteger(\"Hello World! - From Rosetta Code\".getBytes());\n BigInteger cipherText = message.modPow(e, n);\n BigInteger decryptedText = cipherText.modPow(d, n);\n System.out.println(\"Message: \" + message);\n System.out.println(\"Prime 1: \" + p);\n System.out.println(\"Prime 2: \" + q);\n System.out.println(\"Phi p1 * p2: \" + phi);\n System.out.println(\"p1 * p2: \" + n);\n System.out.println(\"Public key: \" + e);\n System.out.println(\"Private key: \" + d);\n System.out.println(\"Ciphertext: \" + cipherText);\n System.out.println(\"Decrypted message(number form): \" + decryptedText);\n //Convert BigInteger to byte array then to String\n System.out.println(\"Decrypted message(string): \" + new String(decryptedText.toByteArray()));\n }\n}\n","language":"Java"},{"code":"# If $j is 0, then an error condition is raised;\n# otherwise, assuming infinite-precision integer arithmetic,\n# if the input and $j are integers, then the result will be an integer.\ndef idivide($j): (. - (. % $j)) / $j ;\n\n# shift left\ndef left8: 256 * .;\n\n# shift right\ndef right8: idivide(256);\n\ndef modPow($b; $e; $m):\n if ($m == 1) then 0\n else {b: ($b % $m), $e, r: 1}\n | until( .e <= 0 or .return;\n if .b == 0 then .return = 0\n else if .e % 2 == 1 then .r = (.r * .b) % $m else . end\n | .e |= idivide(2)\n | .b = (.b * .b) % $m\n end)\n | if .return then .return else .r end\n end;\n\n# Convert the input integer to a stream of 8-bit integers, most significant first\ndef bytes:\n def stream:\n recurse(if . >= 256 then ./256|floor else empty end) | . % 256 ;\n [stream] | reverse ;\n\n# convert ASCII plain text to a number\ndef ptn:\n reduce explode[] as $b (0; left8 + $b);\n\ndef n: 9516311845790656153499716760847001433441357;\ndef e: 65537;\ndef d: 5617843187844953170308463622230283376298685;\n\n# encode a single number\ndef etn: . as $ptn | modPow($ptn; e; n);\n\n# decode a single number\ndef dtn: . as $etn | modPow($etn; d; n);\n\ndef decode:\n [recurse(right8 | select(.>0)) % 256]\n | reverse\n | implode;\n\ndef task($pt):\n ($pt|ptn) as $ptn\n | if ($ptn >= n) then \"Plain text message too long\" | error else . end\n | ($ptn|etn) as $etn\n | ($etn|dtn) as $dtn\n | ($ptn|decode) as $text\n | \"Plain text: : \\($pt)\",\n \"Plain text as a number : \\($ptn)\",\n \"Encoded : \\($etn)\",\n \"Decoded : \\($dtn)\",\n \"Decoded number as text : \\($text)\"\n ;\n\ntask(\"Rosetta Code\"),\n\"\",\ntask(\"Hello, Rosetta!!!!\")\n","language":"Jq"},{"code":"function rsaencode(clearmsg::AbstractString, nmod::Integer, expub::Integer)\n bytes = parse(BigInt, \"0x\" * bytes2hex(collect(UInt8, clearmsg)))\n return powermod(bytes, expub, nmod)\nend\n\nfunction rsadecode(cryptmsg::Integer, nmod::Integer, dsecr::Integer)\n decoded = powermod(encoded, dsecr, nmod)\n return join(Char.(hex2bytes(hex(decoded))))\nend\n\nmsg = \"Rosetta Code.\"\nnmod = big\"9516311845790656153499716760847001433441357\"\nexpub = 65537\ndsecr = big\"5617843187844953170308463622230283376298685\"\n\nencoded = rsaencode(msg, nmod, expub)\ndecoded = rsadecode(encoded, nmod, dsecr)\nprintln(\"\\n# $msg\\n -> ENCODED: $encoded\\n -> DECODED: $decoded\")\n","language":"Julia"},{"code":"// version 1.1.4-3\n\nimport java.math.BigInteger\n\nfun main(args: Array<String>) {\n val n = BigInteger(\"9516311845790656153499716760847001433441357\")\n val e = BigInteger(\"65537\")\n val d = BigInteger(\"5617843187844953170308463622230283376298685\")\n val c = Charsets.UTF_8\n val plainText = \"Rosetta Code\"\n println(\"PlainText : $plainText\")\n val bytes = plainText.toByteArray(c)\n val plainNum = BigInteger(bytes)\n println(\"As number : $plainNum\")\n if (plainNum > n) {\n println(\"Plaintext is too long\")\n return\n }\n\n val enc = plainNum.modPow(e, n)\n println(\"Encoded : $enc\")\n\n val dec = enc.modPow(d, n)\n println(\"Decoded : $dec\")\n\n val decText = dec.toByteArray().toString(c)\n println(\"As text : $decText\")\n}\n","language":"Kotlin"},{"code":"toNumPlTxt[s_] := FromDigits[ToCharacterCode[s], 256];\nfromNumPlTxt[plTxt_] := FromCharacterCode[IntegerDigits[plTxt, 256]];\nenc::longmess = \"Message '``' is too long for n = ``.\";\nenc[n_, _, mess_] /;\n toNumPlTxt[mess] >= n := (Message[enc::longmess, mess, n]; $Failed);\nenc[n_, e_, mess_] := PowerMod[toNumPlTxt[mess], e, n];\ndec[n_, d_, en_] := fromNumPlTxt[PowerMod[en, d, n]];\ntext = \"The cake is a lie!\";\nn = 9516311845790656153499716760847001433441357;\ne = 65537;\nd = 5617843187844953170308463622230283376298685;\nen = enc[n, e, text];\nde = dec[n, d, en];\nPrint[\"Text: '\" <> text <> \"'\"];\nPrint[\"n = \" <> IntegerString[n]];\nPrint[\"e = \" <> IntegerString[e]];\nPrint[\"d = \" <> IntegerString[d]];\nPrint[\"Numeric plaintext: \" <> IntegerString[toNumPlTxt[text]]];\nPrint[\"Encoded: \" <> IntegerString[en]];\nPrint[\"Decoded: '\" <> de <> \"'\"];\n","language":"Mathematica"},{"code":"import strutils, streams, strformat\n# nimble install stint\nimport stint\n\nconst messages = [\"PPAP\", \"I have a pen, I have a apple\\nUh! Apple-pen!\",\n \"I have a pen, I have pineapple\\nUh! Pineapple-pen!\",\n \"Apple-pen, pineapple-pen\\nUh! Pen-pineapple-apple-pen\\nPen-pineapple-apple-pen\\nDance time!\", \"\\a\\0\"]\nconst\n n = u256(\"9516311845790656153499716760847001433441357\")\n e = u256(\"65537\")\n d = u256(\"5617843187844953170308463622230283376298685\")\nproc pcount(s: string, c: char): int{.inline.} =\n for ch in s:\n if ch != c:\n break\n result+=1\nfunc powmodHexStr(s: string, key, divisor: UInt256): string{.inline.} =\n toHex(powmod(UInt256.fromHex(s), key, divisor))\nproc translate(hexString: string, key, divisor: UInt256,\n encrypt = true): string =\n var\n strm = newStringStream(hexString)\n chunk, residue, tempChunk: string\n let chunkSize = len(toHex(divisor))\n while true:\n tempChunk = strm.peekStr(chunkSize-int(encrypt)*3)\n if len(chunk) > 0:\n if len(tempChunk) == 0:\n if encrypt:\n result&=powmodHexStr(pcount(chunk, '0').toHex(2)&align(chunk,\n chunkSize-3, '0'), key, divisor)\n else:\n tempChunk = align(powmodHexStr(chunk, key, divisor), chunkSize-1, '0')\n residue = tempChunk[2..^1].strip(trailing = false, chars = {'0'})\n result&=align(residue, fromHex[int](tempChunk[0..1])+len(residue), '0')\n break\n result&=align(powmodHexStr(chunk, key, divisor), chunkSize-3+int(\n encrypt)*3, '0')\n discard strm.readStr(chunkSize-int(encrypt)*3)\n chunk = tempChunk\n strm.close()\nfor message in messages:\n echo(&\"plaintext:\\n{message}\")\n var numPlaintext = message.toHex()\n echo(&\"numerical plaintext in hex:\\n{numPlaintext}\")\n var ciphertext = translate(numPlaintext, e, n)\n echo(&\"ciphertext is: \\n{ciphertext}\")\n var deciphertext = translate(ciphertext, d, n, false)\n echo(&\"deciphered numerical plaintext in hex is:\\n{deciphertext}\")\n echo(&\"deciphered plaintext is:\\n{parseHexStr(deciphertext)}\\n\\n\")\n","language":"Nim"},{"code":"stigid(V,b)=subst(Pol(V),'x,b);\t\t\\\\ inverse function digits(...)\n\nn = 9516311845790656153499716760847001433441357;\ne = 65537;\nd = 5617843187844953170308463622230283376298685;\n\ntext = \"Rosetta Code\"\n\ninttext = stigid(Vecsmall(text),256)\t\\\\ message as an integer\nencoded = lift(Mod(inttext, n) ^ e)\t\\\\ encrypted message\ndecoded = lift(Mod(encoded, n) ^ d)\t\\\\ decrypted message\nmessage = Strchr(digits(decoded, 256))\t\\\\ readable message\n","language":"PARI-GP"},{"code":"f = factor(n);\t\t\t\t\\\\ factorize public key 'n'\n\ncrack = Strchr(digits(lift(Mod(encoded,n) ^ lift(Mod(1,(f[1,1]-1)*(f[2,1]-1)) / e)),256))\n","language":"PARI-GP"},{"code":"use bigint;\n\n$n = 9516311845790656153499716760847001433441357;\n$e = 65537;\n$d = 5617843187844953170308463622230283376298685;\n\npackage Message {\n my @alphabet;\n push @alphabet, $_ for 'A' .. 'Z', ' ';\n my $rad = +@alphabet;\n $code{$alphabet[$_]} = $_ for 0..$rad-1;\n\n sub encode {\n my($t) = @_;\n my $cnt = my $sum = 0;\n for (split '', reverse $t) {\n $sum += $code{$_} * $rad**$cnt;\n $cnt++;\n }\n $sum;\n }\n\n sub decode {\n my($n) = @_;\n my(@i);\n while () {\n push @i, $n % $rad;\n last if $n < $rad;\n $n = int $n / $rad;\n }\n reverse join '', @alphabet[@i];\n }\n\n sub expmod {\n my($a, $b, $n) = @_;\n my $c = 1;\n do {\n ($c *= $a) %= $n if $b % 2;\n ($a *= $a) %= $n;\n } while ($b = int $b/2);\n $c;\n}\n\n}\n\nmy $secret_message = \"ROSETTA CODE\";\n\n$numeric_message = Message::encode $secret_message;\n$numeric_cipher = Message::expmod $numeric_message, $e, $n;\n$text_cipher = Message::decode $numeric_cipher;\n$numeric_cipher2 = Message::encode $text_cipher;\n$numeric_message2 = Message::expmod $numeric_cipher2, $d, $n;\n$secret_message2 = Message::decode $numeric_message2;\n\nprint <<\"EOT\";\nSecret message is $secret_message\nSecret message in integer form is $numeric_message\nAfter exponentiation with public exponent we get: $numeric_cipher\nThis turns into the string $text_cipher\nIf we re-encode it in integer form we get $numeric_cipher2\nAfter exponentiation with SECRET exponent we get: $numeric_message2\nThis turns into the string $secret_message2\nEOT\n","language":"Perl"},{"code":"(notonline)-->\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">builtins</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #004080;\">mpfr</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"9516311845790656153499716760847001433441357\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">e</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"65537\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"5617843187844953170308463622230283376298685\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">pt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(),</span>\n <span style=\"color: #000000;\">ct</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">()</span>\n\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">plaintext</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"Rossetta Code\"</span> <span style=\"color: #000080;font-style:italic;\">-- matches C/zkl\n -- \"Rosetta Code\" -- matches D/FreeBasic/Go/Icon/J/Kotlin/Seed7.</span>\n\n <span style=\"color: #000000;\">mpz_import</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pt</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">plaintext</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">plaintext</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">mpz_cmp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pt</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)></span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n\n <span style=\"color: #7060A8;\">mpz_powm</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ct</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pt</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">);</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Encoded: %s\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">mpz_get_str</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ct</span><span style=\"color: #0000FF;\">)})</span>\n\n <span style=\"color: #7060A8;\">mpz_powm</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pt</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ct</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">);</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Decoded: %s\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">mpz_get_str</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pt</span><span style=\"color: #0000FF;\">)})</span>\n\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">size</span> <span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">((</span><span style=\"color: #7060A8;\">mpz_sizeinbase</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)+</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">pMem</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">allocate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">mpz_export</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pMem</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pt</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">size</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"As String: %s\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">peek</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">pMem</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">})})</span>\n\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">pt</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ct</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_free</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">pt</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ct</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">})</span>\n<!--\n","language":"Phix"},{"code":"### This is a copy of \"lib/rsa.l\" ###\n\n# Generate long random number\n(de longRand (N)\n (use (R D)\n (while (=0 (setq R (abs (rand)))))\n (until (> R N)\n (unless (=0 (setq D (abs (rand))))\n (setq R (* R D)) ) )\n (% R N) ) )\n\n# X power Y modulus N\n(de **Mod (X Y N)\n (let M 1\n (loop\n (when (bit? 1 Y)\n (setq M (% (* M X) N)) )\n (T (=0 (setq Y (>> 1 Y)))\n M )\n (setq X (% (* X X) N)) ) ) )\n\n# Probabilistic prime check\n(de prime? (N)\n (and\n (> N 1)\n (bit? 1 N)\n (let (Q (dec N) K 0)\n (until (bit? 1 Q)\n (setq\n Q (>> 1 Q)\n K (inc K) ) )\n (do 50\n (NIL (_prim? N Q K))\n T ) ) ) )\n\n# (Knuth Vol.2, p.379)\n(de _prim? (N Q K)\n (use (X J Y)\n (while (> 2 (setq X (longRand N))))\n (setq\n J 0\n Y (**Mod X Q N) )\n (loop\n (T\n (or\n (and (=0 J) (= 1 Y))\n (= Y (dec N)) )\n T )\n (T\n (or\n (and (> J 0) (= 1 Y))\n (<= K (inc 'J)) )\n NIL )\n (setq Y (% (* Y Y) N)) ) ) )\n\n# Find a prime number with `Len' digits\n(de prime (Len)\n (let P (longRand (** 10 (*/ Len 2 3)))\n (unless (bit? 1 P)\n (inc 'P) )\n (until (prime? P) # P: Prime number of size 2/3 Len\n (inc 'P 2) )\n # R: Random number of size 1/3 Len\n (let (R (longRand (** 10 (/ Len 3))) K (+ R (% (- P R) 3)))\n (when (bit? 1 K)\n (inc 'K 3) )\n (until (prime? (setq R (inc (* K P))))\n (inc 'K 6) )\n R ) ) )\n\n# Generate RSA key\n(de rsaKey (N) #> (Encrypt . Decrypt)\n (let (P (prime (*/ N 5 10)) Q (prime (*/ N 6 10)))\n (cons\n (* P Q)\n (/\n (inc (* 2 (dec P) (dec Q)))\n 3 ) ) ) )\n\n# Encrypt a list of characters\n(de encrypt (Key Lst)\n (let Siz (>> 1 (size Key))\n (make\n (while Lst\n (let N (char (pop 'Lst))\n (while (> Siz (size N))\n (setq N (>> -16 N))\n (inc 'N (char (pop 'Lst))) )\n (link (**Mod N 3 Key)) ) ) ) ) )\n\n# Decrypt a list of numbers\n(de decrypt (Keys Lst)\n (mapcan\n '((N)\n (let Res NIL\n (setq N (**Mod N (cdr Keys) (car Keys)))\n (until (=0 N)\n (push 'Res (char (& `(dec (** 2 16)) N)))\n (setq N (>> 16 N)) )\n Res ) )\n Lst ) )\n### End of \"lib/rsa.l\" ###\n\n# Generate 100-digit keys (private . public)\n: (setq Keys (rsaKey 100))\n-> (14394597526321726957429995133376978449624406217727317004742182671030....\n\n# Encrypt\n: (setq CryptText\n (encrypt (car Keys)\n (chop \"The quick brown fox jumped over the lazy dog's back\") ) )\n-> (72521958974980041245760752728037044798830723189142175108602418861716...\n\n# Decrypt\n: (pack (decrypt Keys CryptText))\n-> \"The quick brown fox jumped over the lazy dog's back\"\n","language":"PicoLisp"},{"code":"$n = [BigInt]::Parse(\"9516311845790656153499716760847001433441357\")\n$e = [BigInt]::new(65537)\n$d = [BigInt]::Parse(\"5617843187844953170308463622230283376298685\")\n$plaintextstring = \"Hello, Rosetta!\"\n$plaintext = [Text.ASCIIEncoding]::ASCII.GetBytes($plaintextstring)\n[BigInt]$pt = [BigInt]::new($plaintext)\nif ($n -lt $pt) {throw \"`$n = $n < $pt = `$pt\"}\n$ct = [BigInt]::ModPow($pt, $e, $n)\n\"Encoded: $ct\"\n$dc = [BigInt]::ModPow($ct, $d, $n)\n\"Decoded: $dc\"\n$decoded = [Text.ASCIIEncoding]::ASCII.GetString($dc.ToByteArray())\n\"As ASCII: $decoded\"\n","language":"PowerShell"},{"code":"import binascii\n\nn = 9516311845790656153499716760847001433441357 # p*q = modulus\ne = 65537\nd = 5617843187844953170308463622230283376298685\n\nmessage='Rosetta Code!'\nprint('message ', message)\n\nhex_data = binascii.hexlify(message.encode())\nprint('hex data ', hex_data)\n\nplain_text = int(hex_data, 16)\nprint('plain text integer ', plain_text)\n\nif plain_text > n:\n raise Exception('plain text too large for key')\n\nencrypted_text = pow(plain_text, e, n)\nprint('encrypted text integer ', encrypted_text)\n\ndecrypted_text = pow(encrypted_text, d, n)\nprint('decrypted text integer ', decrypted_text)\n\nprint('message ', binascii.unhexlify(hex(decrypted_text)[2:]).decode()) # [2:] slicing, to strip the 0x part\n","language":"Python"},{"code":"#lang racket\n(require math/number-theory)\n(define-logger rsa)\n(current-logger rsa-logger)\n\n;; -| STRING TO NUMBER MAPPING |----------------------------------------------------------------------\n(define (bytes->number B) ; We'll need our data in numerical form ..\n (for/fold ((rv 0)) ((b B)) (+ b (* rv 256))))\n\n(define (number->bytes N) ; .. and back again\n (define (inr n b) (if (zero? n) b (inr (quotient n 256) (bytes-append (bytes (modulo n 256)) b))))\n (inr N (bytes)))\n\n;; -| RSA PUBLIC / PRIVATE FUNCTIONS |----------------------------------------------------------------\n;; The basic definitions... pretty well lifted from the text book!\n(define ((C e n) p)\n ;; Just do the arithmetic to demonstrate RSA...\n ;; breaking large messages into blocks is something for another day.\n (unless (< p n) (raise-argument-error 'C (format \"(and/c integer? (</c ~a))\" n) p))\n (modular-expt p e n))\n\n(define ((P d n) c)\n (modular-expt c d n))\n\n;; -| RSA KEY GENERATION |----------------------------------------------------------------------------\n;; Key generation\n;; Full description of the steps can be found on Wikipedia\n(define (RSA-keyset function-base-name)\n (log-info \"RSA-keyset: ~s\" function-base-name)\n (define max-k 4294967087)\n ;; I'm guessing this RNG is about as cryptographically strong as replacing spaces with tabs.\n (define (big-random n-rolls)\n (for/fold ((rv 1)) ((roll (in-range n-rolls 0 -1))) (+ (* rv (add1 max-k)) 1 (random max-k))))\n (define (big-random-prime)\n (define start-number (big-random (/ 1024 32)))\n (log-debug \"got large (possibly non-prime) number, finding next prime\")\n (next-prime (match start-number ((? odd? o) o) ((app add1 e) e))))\n\n ;; [1] Choose two distinct prime numbers p and q.\n (log-debug \"generating p\")\n (define p (big-random-prime))\n (log-debug \"p generated\")\n (log-debug \"generating q\")\n (define q (big-random-prime))\n (log-debug \"q generated\")\n (log-info \"primes generated\")\n\n ;; [2] Compute n = pq.\n (define n (* p q))\n\n ;; [3] Compute φ(n) = φ(p)φ(q) = (p − 1)(q − 1) = n - (p + q -1),\n ;; where φ is Euler's totient function.\n (define φ (- n (+ p q -1)))\n\n ;; [4] Choose an integer e such that 1 < e < φ(n) and gcd(e, φ(n)) = 1; i.e., e and φ(n) are\n ;; coprime. ... most commonly 2^16 + 1 = 65,537 ...\n (define e (+ (expt 2 16) 1))\n\n ;; [5] Determine d as d ≡ e−1 (mod φ(n)); i.e., d is the multiplicative inverse of e (modulo φ(n)).\n (log-debug \"generating d\")\n (define d (modular-inverse e φ))\n (log-info \"d generated\")\n (values n e d))\n\n;; -| GIVE A USABLE SET OF PRIVATE STUFF TO A USER |--------------------------------------------------\n;; six values: the public (encrypt) function (numeric)\n;; the private (decrypt) function (numeric)\n;; the public (encrypt) function (bytes)\n;; the private (decrypt) function (bytes)\n;; private (list n e d)\n;; public (list n e)\n(define (RSA-key-pack #:function-base-name function-base-name)\n (define (rnm-fn f s) (procedure-rename f (string->symbol (format \"~a-~a\" function-base-name s))))\n (define-values (n e d) (RSA-keyset function-base-name))\n (define my-C (rnm-fn (C e n) \"C\"))\n (define my-P (rnm-fn (P d n) \"P\"))\n (define my-encrypt (rnm-fn (compose number->bytes my-C bytes->number) \"encrypt\"))\n (define my-decrypt (rnm-fn (compose number->bytes my-P bytes->number) \"decrypt\"))\n (values my-C my-P my-encrypt my-decrypt (list n e d) (list n e)))\n\n;; -| HEREON IS JUST A LOAD OF CHATTY DEMOS |---------------------------------------------------------\n(define (narrated-encrypt-bytes C who plain-text)\n (define plain-n (bytes->number plain-text))\n (define cypher-n (C plain-n))\n (define cypher-text (number->bytes cypher-n))\n (printf #<<EOS\n~a wants to send plain text: ~s\n as number: ~s\n cyphered number: ~s\nsent by ~a over the public interwebs:\n~s\n...\n\n\nEOS\n who plain-text plain-n cypher-n who cypher-text)\n cypher-text)\n\n(define (narrated-decrypt-bytes P who cypher-text)\n (define cypher-n (bytes->number cypher-text))\n (define plain-n (P cypher-n))\n (define plain-text (number->bytes plain-n))\n (printf #<<EOS\n...\n~s\n received by ~a\n as number: ~s\n decyphered (with P) number: ~s\ndecyphered text:\n~s\n\n\nEOS\n cypher-text who cypher-n plain-n plain-text)\n plain-text)\n\n;; ENCRYPT AND DECRYPT A MESSAGE WITH THE e.g. KEYS\n(define-values (given-n given-e given-d)\n (values 9516311845790656153499716760847001433441357\n 65537\n 5617843187844953170308463622230283376298685))\n\n;; Get the keys specific RSA functions\n(for ((message-text (list #\"hello world\" #\"TOP SECRET!\")))\n (define Bobs-public-function (C given-e given-n))\n (define Bobs-private-function (P given-d given-n))\n (define cypher-text (narrated-encrypt-bytes Bobs-public-function \"Alice\" message-text))\n (define plain-text (narrated-decrypt-bytes Bobs-private-function \"Bob\" cypher-text))\n plain-text)\n\n;; Demonstrate with larger keys.\n;; (And include a free recap on digital signatures, too)\n(define-values (A-pub-C A-pvt-P A-pub-encrypt A-pvt-decrypt A-pvt-keys A-pub-keys)\n (RSA-key-pack #:function-base-name 'Alice))\n(define-values (B-pub-C B-pvt-P B-pub-encrypt B-pvt-decrypt B-pvt-keys B-pub-keys)\n (RSA-key-pack #:function-base-name 'Bob))\n\n;; Since p and q are random, it is possible that message' = \"message modulo {A,B}-key-n\" will be too\n;; big for \"message' modulo {B,A}-key-n\", if that happens then I run the program again until it\n;; works. Strictly, we need blocking of the signed message -- which is not yet implemented.\n(let* ((plain-A-to-B #\"Dear Bob, meet you in Lymm at 1200, Alice\")\n (signed-A-to-B (A-pvt-decrypt plain-A-to-B))\n (unsigned-A-to-B (A-pub-encrypt signed-A-to-B))\n (crypt-signed-A-to-B (B-pub-encrypt signed-A-to-B))\n (decrypt-signed-A-to-B (B-pvt-decrypt crypt-signed-A-to-B))\n (decrypt-verified-B (A-pub-encrypt decrypt-signed-A-to-B)))\n (printf\n #<<EOS\nAlice wants to send ~s to Bob.\nShe \"encrypts\" with her private \"decryption\" key.\n(A-prv msg) -> ~s\nOnly she could have done this (only she has the her private key data) -- so this is a signature on the\nmessage. Anyone can verify the signature by \"decrypting\" the message with the public \"encryption\" key.\n(A-pub (A-prv msg)) -> ~s\nBut anyone is able to do this, so there is no privacy here.\nEveryone knows that it can only be Alice at Lymm at noon, but this message is for Bob's eyes only.\nWe need to encrypt this with his public key:\n(B-pub (A-prv msg)) -> ~s\nWhich is what gets posted to alt.chat.secret-rendezvous\nBob decrypts this to get the signed message from Alice:\n(B-prv (B-pub (A-prv msg))) -> ~s\nAnd verifies Alice's signature:\n(A-pub (B-prv (B-pub (A-prv msg)))) -> ~s\nAlice genuinely sent the message.\nAnd nobody else (on a.c.s-r, at least) has read it.\n\nKEYS:\n Alice's full set: ~s\n Bob's full set: ~s\nEOS\n plain-A-to-B signed-A-to-B unsigned-A-to-B crypt-signed-A-to-B decrypt-signed-A-to-B\n decrypt-verified-B A-pvt-keys B-pvt-keys))\n","language":"Racket"},{"code":"class RSA-message {\n has ($.n, $.e, $.d); # the 3 elements that define an RSA key\n\n my @alphabet = |('A' .. 'Z'), ' ';\n my $rad = +@alphabet;\n my %code = @alphabet Z=> 0 .. *;\n subset Text of Str where /^^ @alphabet+ $$/;\n\n method encode(Text $t) {\n [+] %code{$t.flip.comb} Z× (1, $rad, $rad×$rad … *);\n }\n\n method decode(Int $n is copy) {\n @alphabet[\n gather loop {\n take $n % $rad;\n last if $n < $rad;\n $n div= $rad;\n }\n ].join.flip;\n }\n}\n\nconstant $n = 9516311845790656153499716760847001433441357;\nconstant $e = 65537;\nconstant $d = 5617843187844953170308463622230283376298685;\n\nmy $fmt = \"%48s %s\\n\";\n\nmy $message = 'ROSETTA CODE';\nprintf $fmt, 'Secret message is', $message;\n\nmy $rsa = RSA-message.new: n => $n, e => $e, d => $d;\nprintf $fmt, 'Secret message in integer form is',\n my $numeric-message = $rsa.encode: $message;\n\nprintf $fmt, 'After exponentiation with public exponent we get',\n my $numeric-cipher = expmod $numeric-message, $e, $n;\n\nprintf $fmt, 'This turns into the string',\n my $text-cipher = $rsa.decode: $numeric-cipher;\n\nprintf $fmt, 'If we re-encode it in integer form we get',\n my $numeric-cipher2 = $rsa.encode: $text-cipher;\n\nprintf $fmt, 'After exponentiation with SECRET exponent we get',\n my $numeric-message2 = expmod $numeric-cipher2, $d, $n;\n\nprintf $fmt, 'This turns into the string',\n my $message2 = $rsa.decode: $numeric-message2;\n","language":"Raku"},{"code":"#!/usr/bin/ruby\n\nrequire 'openssl' # for mod_exp only\nrequire 'prime'\n\ndef rsa_encode blocks, e, n\n blocks.map{|b| b.to_bn.mod_exp(e, n).to_i}\nend\n\ndef rsa_decode ciphers, d, n\n rsa_encode ciphers, d, n\nend\n\n# all numbers in blocks have to be < modulus, or information is lost\n# for secure encryption only use big modulus and blocksizes\ndef text_to_blocks text, blocksize=64 # 1 hex = 4 bit => default is 256bit\n text.each_byte.reduce(\"\"){|acc,b| acc << b.to_s(16).rjust(2, \"0\")} # convert text to hex (preserving leading 0 chars)\n .each_char.each_slice(blocksize).to_a # slice hexnumbers in pieces of blocksize\n .map{|a| a.join(\"\").to_i(16)} # convert each slice into internal number\nend\n\ndef blocks_to_text blocks\n blocks.map{|d| d.to_s(16)}.join(\"\") # join all blocks into one hex-string\n .each_char.each_slice(2).to_a # group into pairs\n\t.map{|s| s.join(\"\").to_i(16)} # number from 2 hexdigits is byte\n\t.flatten.pack(\"C*\") # pack bytes into ruby-string\n\t.force_encoding(Encoding::default_external) # reset encoding\nend\n\ndef generate_keys p1, p2\n n = p1 * p2\n t = (p1 - 1) * (p2 - 1)\n e = 2.step.each do |i|\n break i if i.gcd(t) == 1\n end\n d = 1.step.each do |i|\n break i if (i * e) % t == 1\n end\n return e, d, n\nend\n\np1, p2 = Prime.take(100).last(2)\npublic_key, private_key, modulus =\n generate_keys p1, p2\n\nprint \"Message: \"\nmessage = gets\nblocks = text_to_blocks message, 4 # very small primes\nprint \"Numbers: \"; p blocks\nencoded = rsa_encode(blocks, public_key, modulus)\nprint \"Encrypted as: \"; p encoded\ndecoded = rsa_decode(encoded, private_key, modulus)\nprint \"Decrypted to: \"; p decoded\nfinal = blocks_to_text(decoded)\nprint \"Decrypted Message: \"; puts final\n","language":"Ruby"},{"code":"extern crate num;\n\nuse num::bigint::BigUint;\nuse num::integer::Integer;\nuse num::traits::{One, Zero};\n\nfn mod_exp(b: &BigUint, e: &BigUint, n: &BigUint) -> Result<BigUint, &'static str> {\n if n.is_zero() {\n return Err(\"modulus is zero\");\n }\n if b >= n {\n // base is too large and should be split into blocks\n return Err(\"base is >= modulus\");\n }\n if b.gcd(n) != BigUint::one() {\n return Err(\"base and modulus are not relatively prime\");\n }\n\n let mut bb = b.clone();\n let mut ee = e.clone();\n let mut result = BigUint::one();\n while !ee.is_zero() {\n if ee.is_odd() {\n result = (result * &bb) % n;\n }\n ee >>= 1;\n bb = (&bb * &bb) % n;\n }\n Ok(result)\n}\n\nfn main() {\n let msg = \"Rosetta Code\";\n\n let n = \"9516311845790656153499716760847001433441357\"\n .parse()\n .unwrap();\n let e = \"65537\".parse().unwrap();\n let d = \"5617843187844953170308463622230283376298685\"\n .parse()\n .unwrap();\n\n let msg_int = BigUint::from_bytes_be(msg.as_bytes());\n let enc = mod_exp(&msg_int, &e, &n).unwrap();\n let dec = mod_exp(&enc, &d, &n).unwrap();\n let msg_dec = String::from_utf8(dec.to_bytes_be()).unwrap();\n\n println!(\"msg as txt: {}\", msg);\n println!(\"msg as num: {}\", msg_int);\n println!(\"enc as num: {}\", enc);\n println!(\"dec as num: {}\", dec);\n println!(\"dec as txt: {}\", msg_dec);\n}\n","language":"Rust"},{"code":"object RSA_saket{\n val d = BigInt(\"5617843187844953170308463622230283376298685\")\n val n = BigInt(\"9516311845790656153499716760847001433441357\")\n val e = 65537\n val text = \"Rosetta Code\"\n val encode = (msg:BigInt) => pow_mod(msg,e,n)\n val decode = (msg:BigInt) => pow_mod(msg,d,n)\n val getmsg = (txt:String) => BigInt(txt.map(x => \"%03d\".format(x.toInt)).reduceLeft(_+_))\n def pow_mod(p:BigInt, q:BigInt, n:BigInt):BigInt = {\n if(q==0) BigInt(1)\n else if(q==1) p\n else if(q%2 == 1) pow_mod(p,q-1,n)*p % n\n else pow_mod(p*p % n,q/2,n)\n }\n def gettxt(num:String) = {\n if(num.size%3==2)\n (\"0\" + num).grouped(3).toList.foldLeft(\"\")(_ + _.toInt.toChar)\n else\n num.grouped(3).toList.foldLeft(\"\")(_ + _.toInt.toChar)\n }\n def main(args: Array[String]): Unit = {\n println(f\"Original String \\t: \"+text)\n val msg = getmsg(text)\n println(f\"Converted Signal \\t: \"+msg)\n val enc_sig = encode(msg)\n println(\"Encoded Signal \\t\\t: \"+ enc_sig)\n val dec_sig = decode(enc_sig)\n println(\"Decoded String \\t\\t: \"+ dec_sig)\n val rec_msg = gettxt(dec_sig.toString)\n println(\"Retrieved Signal \\t: \"+rec_msg)\n }\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n include \"bigint.s7i\";\n include \"bytedata.s7i\";\n\nconst proc: main is func\n local\n const string: plainText is \"Rosetta Code\";\n # Use a key big enough to hold 16 bytes of plain text in a single block.\n const bigInteger: modulus is 9516311845790656153499716760847001433441357_;\n const bigInteger: encode is 65537_;\n const bigInteger: decode is 5617843187844953170308463622230283376298685_;\n var bigInteger: plainTextNumber is 0_;\n var bigInteger: encodedNumber is 0_;\n var bigInteger: decodedNumber is 0_;\n var string: decodedText is \"\";\n begin\n writeln(\"Plain text: \" <& plainText);\n plainTextNumber := bytes2BigInt(plainText, UNSIGNED, BE);\n if plainTextNumber >= modulus then\n writeln(\"Plain text message too long\");\n else\n writeln(\"Plain text as a number: \" <& plainTextNumber);\n encodedNumber := modPow(plainTextNumber, encode, modulus);\n writeln(\"Encoded: \" <& encodedNumber);\n decodedNumber := modPow(encodedNumber, decode, modulus);\n writeln(\"Decoded: \" <& decodedNumber);\n decodedText := bytes(decodedNumber, UNSIGNED, BE);\n writeln(\"Decoded number as text: \" <& decodedText);\n end if;\n end func;\n","language":"Seed7"},{"code":"const n = 9516311845790656153499716760847001433441357\nconst e = 65537\nconst d = 5617843187844953170308463622230283376298685\n\nmodule Message {\n var alphabet = [('A' .. 'Z')..., ' ']\n var rad = alphabet.len\n var code = Hash(^rad -> map {|i| (alphabet[i], i) }...)\n func encode(String t) {\n [code{t.reverse.chars...}] ~Z* t.len.range.map { |i| rad**i } -> sum(0)\n }\n func decode(Number n) {\n ''.join(alphabet[\n gather {\n loop {\n var (d, m) = n.divmod(rad)\n take(m)\n break if (n < rad)\n n = d\n }\n }...]\n ).reverse\n }\n}\n\nvar secret_message = \"ROSETTA CODE\"\nsay \"Secret message is #{secret_message}\"\n\nvar numeric_message = Message::encode(secret_message)\nsay \"Secret message in integer form is #{numeric_message}\"\n\nvar numeric_cipher = expmod(numeric_message, e, n)\nsay \"After exponentiation with public exponent we get: #{numeric_cipher}\"\n\nvar text_cipher = Message::decode(numeric_cipher)\nsay \"This turns into the string #{text_cipher}\"\n\nvar numeric_cipher2 = Message::encode(text_cipher)\nsay \"If we re-encode it in integer form we get #{numeric_cipher2}\"\n\nvar numeric_message2 = expmod(numeric_cipher2, d, n)\nsay \"After exponentiation with SECRET exponent we get: #{numeric_message2}\"\n\nvar secret_message2 = Message::decode(numeric_message2)\nsay \"This turns into the string #{secret_message2}\"\n","language":"Sidef"},{"code":"package require Tcl 8.5\n\n# This is a straight-forward square-and-multiply implementation that relies on\n# Tcl 8.5's bignum support (based on LibTomMath) for speed.\nproc modexp {b expAndMod} {\n lassign $expAndMod -> e n\n if {$b >= $n} {puts stderr \"WARNING: modulus too small\"}\n for {set r 1} {$e != 0} {set e [expr {$e >> 1}]} {\n\tif {$e & 1} {\n\t set r [expr {($r * $b) % $n}]\n\t}\n\tset b [expr {($b ** 2) % $n}]\n }\n return $r\n}\n\n# Assumes that messages are shorter than the modulus\nproc rsa_encrypt {message publicKey} {\n if {[lindex $publicKey 0] ne \"publicKey\"} {error \"key handling\"}\n set toEnc 0\n foreach char [split [encoding convertto utf-8 $message] \"\"] {\n\tset toEnc [expr {$toEnc * 256 + [scan $char \"%c\"]}]\n }\n return [modexp $toEnc $publicKey]\n}\n\nproc rsa_decrypt {encrypted privateKey} {\n if {[lindex $privateKey 0] ne \"privateKey\"} {error \"key handling\"}\n set toDec [modexp $encrypted $privateKey]\n for {set message \"\"} {$toDec > 0} {set toDec [expr {$toDec >> 8}]} {\n\tappend message [format \"%c\" [expr {$toDec & 255}]]\n }\n return [encoding convertfrom utf-8 [string reverse $message]]\n}\n\n# Assemble packaged public and private keys\nset e 65537\nset n 9516311845790656153499716760847001433441357\nset d 5617843187844953170308463622230283376298685\nset publicKey [list \"publicKey\" $e $n]\nset privateKey [list \"privateKey\" $d $n]\n\n# Test on some input strings\nforeach input {\"Rosetta Code\" \"UTF-8 \\u263a test\"} {\n set enc [rsa_encrypt $input $publicKey]\n set dec [rsa_decrypt $enc $privateKey]\n puts \"$input -> $enc -> $dec\"\n}\n","language":"Tcl"},{"code":"/*import math.big\nfn main() {\n //var bb, ptn, etn, dtn big.Int\n pt := \"Rosetta Code\"\n println(\"Plain text: $pt\")\n\n // a key set big enough to hold 16 bytes of plain text in\n // a single block (to simplify the example) and also big enough\n // to demonstrate efficiency of modular exponentiation.\n n := big.integer_from_string(\"9516311845790656153499716760847001433441357\")?\n e := big.integer_from_string(\"65537\")?\n d := big.integer_from_string(\"5617843187844953170308463622230283376298685\")?\n\n mut ptn := big.zero_int\n // convert plain text to a number\n for b in pt.bytes() {\n bb := big.integer_from_i64(i64(b))\n ptn = ptn.lshift(8).bitwise_or(bb)\n }\n if ptn >= n {\n println(\"Plain text message too long\")\n return\n }\n println(\"Plain text as a number:$ptn\")\n\n // encode a single number\n etn := ptn.big_mod_pow(e,n)\n println(\"Encoded: $etn\")\n\n // decode a single number\n mut dtn := etn.big_mod_pow(d,n)\n println(\"Decoded: $dtn\")\n\n // convert number to text\n mut db := [16]u8{}\n mut dx := 16\n bff := big.integer_from_int(0xff)\n for dtn.bit_len() > 0 {\n dx--\n bb := dtn.bitwise_and(bff)\n db[dx] = u8(i64(bb.int()))\n dtn = dtn.rshift(8)\n println('${db[0..].bytestr()} ${dtn.bit_len()}')\n }\n println(\"Decoded number as text: ${db[dx..].bytestr()}\")\n}*/\n\nimport math.big\nfn main() {\n //var bb, ptn, etn, dtn big.Int\n pt := \"Hello World\"\n println(\"Plain text: $pt\")\n\n // a key set big enough to hold 16 bytes of plain text in\n // a single block (to simplify the example) and also big enough\n // to demonstrate efficiency of modular exponentiation.\n n := big.integer_from_string(\"9516311845790656153499716760847001433441357\")?\n e := big.integer_from_string(\"65537\")?\n d := big.integer_from_string(\"5617843187844953170308463622230283376298685\")?\n\n mut ptn := big.zero_int\n // convert plain text to a number\n for b in pt.bytes() {\n bb := big.integer_from_i64(i64(b))\n ptn = ptn.lshift(8).bitwise_or(bb)\n }\n if ptn >= n {\n println(\"Plain text message too long\")\n return\n }\n println(\"Plain text as a number:$ptn\")\n\n // encode a single number\n etn := ptn.big_mod_pow(e,n)\n println(\"Encoded: $etn\")\n\n // decode a single number\n mut dtn := etn.big_mod_pow(d,n)\n println(\"Decoded: $dtn\")\n\n // convert number to text\n mut db := [16]u8{}\n mut dx := 16\n bff := big.integer_from_int(0xff)\n for dtn.bit_len() > 0 {\n dx--\n bb := dtn.bitwise_and(bff)\n db[dx] = u8(i64(bb.int()))\n dtn = dtn.rshift(8)\n }\n println(\"Decoded number as text: ${db[dx..].bytestr()}\")\n}\n","language":"V-(Vlang)"},{"code":"Imports System\nImports System.Numerics\nImports System.Text\n\nModule Module1\n Sub Main()\n Dim n As BigInteger = BigInteger.Parse(\"9516311845790656153499716760847001433441357\")\n Dim e As BigInteger = 65537\n Dim d As BigInteger = BigInteger.Parse(\"5617843187844953170308463622230283376298685\")\n Dim plainTextStr As String = \"Hello, Rosetta!\"\n Dim plainTextBA As Byte() = ASCIIEncoding.ASCII.GetBytes(plainTextStr)\n Dim pt As BigInteger = New BigInteger(plainTextBA)\n If pt > n Then Throw New Exception() ' Blocking not implemented\n Dim ct As BigInteger = BigInteger.ModPow(pt, e, n)\n Console.WriteLine(\" Encoded: \" & ct.ToString(\"X\"))\n Dim dc As BigInteger = BigInteger.ModPow(ct, d, n)\n Console.WriteLine(\" Decoded: \" & dc.ToString(\"X\"))\n Dim decoded As String = ASCIIEncoding.ASCII.GetString(dc.ToByteArray())\n Console.WriteLine(\"As ASCII: \" & decoded)\n End Sub\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"./big\" for BigInt\n\nvar pt = \"Rosetta Code\"\nSystem.print(\"Plain text: : %(pt)\")\nvar n = BigInt.new(\"9516311845790656153499716760847001433441357\")\nvar e = BigInt.new(\"65537\")\nvar d = BigInt.new(\"5617843187844953170308463622230283376298685\")\nvar ptn = BigInt.zero\n// convert plain text to a number\nfor (b in pt.bytes) {\n ptn = (ptn << 8) | BigInt.new(b)\n}\nif (ptn >= n) {\n System.print(\"Plain text message too long\")\n return\n}\nSystem.print(\"Plain text as a number : %(ptn)\")\n\n// encode a single number\nvar etn = ptn.modPow(e, n)\nSystem.print(\"Encoded : %(etn)\")\n\n// decode a single number\nvar dtn = etn.modPow(d, n)\nSystem.print(\"Decoded : %(dtn)\")\n\n// convert number to text\nvar db = List.filled(16, 0)\nvar dx = 16\nvar bff = BigInt.new(255)\nwhile (dtn.bitLength > 0) {\n dx = dx - 1\n db[dx] = (dtn & bff).toSmall\n dtn = dtn >> 8\n}\nvar s = \"\"\nfor (i in dx..15) s = s + String.fromByte(db[i])\nSystem.print(\"Decoded number as text : %(s)\")\n","language":"Wren"},{"code":"var BN=Import.lib(\"zklBigNum\");\n\nn:=BN(\"9516311845790656153499716760847001433441357\");\ne:=BN(\"65537\");\nd:=BN(\"5617843187844953170308463622230283376298685\");\n\nconst plaintext=\"Rossetta Code\";\npt:=BN(Data(Int,0,plaintext)); // convert string (as stream of bytes) to big int\nif(pt>n) throw(Exception.ValueError(\"Message is too large\"));\n\nprintln(\"Plain text: \",plaintext);\nprintln(\"As Int: \",pt);\nct:=pt.powm(e,n); println(\"Encoded: \",ct);\npt =ct.powm(d,n); println(\"Decoded: \",pt);\ntxt:=pt.toData().text; // convert big int to bytes, treat as string\nprintln(\"As String: \",txt);\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/RSA_code\\nnote: Encryption\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Given an [[wp:RSA|RSA]] key (n,e,d), construct a program to encrypt and decrypt plaintext messages strings. \\n\\n'''Background'''\\n\\nRSA code is used to encode secret messages. It is named after Ron Rivest, Adi Shamir, and Leonard Adleman who published it at MIT in 1977. The advantage of this type of encryption is that you can distribute the number “<math>n</math>” and “<math>e</math>” (which makes up the Public Key used for encryption) to everyone. The Private Key used for decryption “<math>d</math>” is kept secret, so that only the recipient can read the encrypted plaintext. \\n\\nThe process by which this is done is that a message, for example “Hello World” is encoded as numbers (This could be encoding as ASCII or as a subset of characters <math>a=01,b=02,...,z=26</math>). This yields a string of numbers, generally referred to as \\\"numerical plaintext\\\", “<math>P</math>”. For example, “Hello World” encoded with a=1,...,z=26 by hundreds would yield <math>0805 1212 1523 1518 1204</math>. \\n\\nThe plaintext must also be split into blocks so that the numerical plaintext is smaller than <math>n</math> otherwise the decryption will fail. \\n\\nThe ciphertext, <math>C</math>, is then computed by taking each block of <math>P</math>, and computing\\n: <math>C \\\\equiv P^e \\\\mod n</math>\\nSimilarly, to decode, one computes\\n: <math>P \\\\equiv C^d \\\\mod n</math> \\n\\nTo generate a key, one finds 2 (ideally large) primes <math>p</math> and <math>q</math>. the value “<math>n</math>” is simply: <math>n = p \\\\times q</math>. \\nOne must then choose an “<math>e</math>” such that <math>\\\\gcd(e, (p-1)\\\\times(q-1) ) = 1</math>. That is to say, <math>e</math> and <math>(p-1)\\\\times(q-1)</math> are relatively prime to each other. \\n\\nThe decryption value <math>d</math> is then found by solving\\n: <math>d\\\\times e \\\\equiv 1 \\\\mod (p-1)\\\\times(q-1)</math>\\n\\nThe security of the code is based on the secrecy of the Private Key (decryption exponent) “<math>d</math>” and the difficulty in factoring “<math>n</math>”. Research into RSA facilitated advances in factoring and a number of [http://www.rsa.com/rsalabs/node.asp?id=2092 factoring challenges]. Keys of 829 bits have been successfully factored, and NIST now recommends 2048 bit keys going forward (see [[wp:Key_size#Asymmetric_algorithm_key_lengths|Asymmetric algorithm key lengths]]).\\n\\n'''Summary of the task requirements:'''\\n\\n* Encrypt and Decrypt a short message or two using RSA with a demonstration key. \\n* Implement RSA do not call a library.\\n* Encode and decode the message using any reversible method of your choice (ASCII or a=1,..,z=26 are equally fine). \\n* Either support blocking or give an error if the message would require blocking)\\n* Demonstrate that your solution could support real keys by using a non-trivial key that requires large integer support (built-in or libraries). There is no need to include library code but it must be referenced unless it is built into the language. The following keys will be meet this requirement;however, they are NOT long enough to be considered secure:\\n:: n = 9516311845790656153499716760847001433441357\\n:: e = 65537\\n:: d = 5617843187844953170308463622230283376298685\\n* Messages can be hard-coded into the program, there is no need for elaborate input coding.\\n* Demonstrate that your implementation works by showing plaintext, intermediate results, encrypted text, and decrypted text.\\n\\n{{alertbox|#ffff70|'''<big>Warning</big>'''<br/>Rosetta Code is '''not''' a place you should rely on for examples of code in critical roles, including security.<br/>Cryptographic routines should be validated before being used.<br/>For a discussion of limitations and please refer to [[Talk:RSA_code#Difference_from_practical_cryptographical_version]].}}\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V n = BigInt(‘9516311845790656153499716760847001433441357’)\\nV e = BigInt(65537)\\nV d = BigInt(‘5617843187844953170308463622230283376298685’)\\n\\nV txt = ‘Rosetta Code’\\n\\nprint(‘Plain text: ’txt)\\n\\nV txtN = txt.reduce(BigInt(0), (a, b) -> a * 256 + b.code)\\nprint(‘Plain text as a number: ’txtN)\\n\\nV enc = pow(txtN, e, n)\\nprint(‘Encoded: ’enc)\\n\\nV dec = pow(enc, d, n)\\nprint(‘Decoded: ’dec)\\n\\nV decTxt = ‘’\\nL dec != 0\\n decTxt ‘’= Char(code' dec % 256)\\n dec I/= 256\\n\\nprint(‘Decoded number as text: ’reversed(decTxt))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"WITH GMP, GMP.Integers, Ada.Text_IO, GMP.Integers.Aliased_Internal_Value, Interfaces.C;\\nUSE GMP, Gmp.Integers, Ada.Text_IO, Interfaces.C;\\n\\nPROCEDURE Main IS\\n FUNCTION \\\"+\\\" (U : Unbounded_Integer) RETURN Mpz_T IS (Aliased_Internal_Value (U));\\n FUNCTION \\\"+\\\" (S : String) RETURN Unbounded_Integer IS (To_Unbounded_Integer (S));\\n FUNCTION Image_Cleared (M : Mpz_T) RETURN String IS (Image (To_Unbounded_Integer (M)));\\n N : Unbounded_Integer := +\\\"9516311845790656153499716760847001433441357\\\";\\n E : Unbounded_Integer := +\\\"65537\\\";\\n D : Unbounded_Integer := +\\\"5617843187844953170308463622230283376298685\\\";\\n Plain_Text : CONSTANT String := \\\"Rosetta Code\\\";\\n M, M_C, M_D : Mpz_T;\\n-- We import two C functions from the GMP library which are not in the specs of the gmp package\\n PROCEDURE Mpz_Import\\n (Rop : Mpz_T; Count : Size_T; Order : Int; Size : Size_T; Endian : Int;\\n Nails : Size_T; Op : Char_Array);\\n PRAGMA Import (C, Mpz_Import, \\\"__gmpz_import\\\");\\n\\n PROCEDURE Mpz_Export\\n (Rop : OUT Char_Array; Count : ACCESS Size_T; Order : Int; Size : Size_T;\\n Endian : Int; Nails : Size_T; Op : Mpz_T);\\n PRAGMA Import (C, Mpz_Export, \\\"__gmpz_export\\\");\\nBEGIN\\n Mpz_Init (M);\\n Mpz_Init (M_C);\\n Mpz_Init (M_D);\\n Mpz_Import (M, Plain_Text'Length + 1, 1, 1, 0, 0, To_C (Plain_Text));\\n Mpz_Powm (M_C, M, +E, +N);\\n Mpz_Powm (M_D, M_C, +D, +N);\\n Put_Line (\\\"Encoded plain text: \\\" & Image_Cleared (M));\\n DECLARE Decrypted : Char_Array (1 .. Mpz_Sizeinbase (M_C, 256));\\n BEGIN\\n Put_Line (\\\"Encryption of this encoding: \\\" & Image_Cleared (M_C));\\n Mpz_Export (Decrypted, NULL, 1, 1, 0, 0, M_D);\\n Put_Line (\\\"Decryption of the encoding: \\\" & Image_Cleared (M_D));\\n Put_Line (\\\"Final decryption: \\\" & To_Ada (Decrypted));\\n END;\\nEND Main;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"COMMENT\\n First cut. Doesn't yet do blocking and deblocking. Also, as\\n encryption and decryption are identical operations but for the\\n reciprocal exponents used, only one has been implemented below.\\n\\n A later release will address these issues.\\nCOMMENT\\n\\nBEGIN\\n PR precision=1000 PR\\n MODE LLI = LONG LONG INT; CO For brevity CO\\n PROC mod power = (LLI base, exponent, modulus) LLI :\\n BEGIN\\n LLI result := 1, b := base, e := exponent;\\n IF exponent < 0\\n THEN\\n\\t put (stand error, ((\\\"Negative exponent\\\", exponent, newline)))\\n ELSE\\n\\t WHILE e > 0\\n\\t DO\\n\\t (ODD e | result := (result * b) MOD modulus);\\n\\t e OVERAB 2; b := (b * b) MOD modulus\\n\\t OD\\n FI;\\n result\\n END;\\n PROC modular inverse = (LLI a, m) LLI :\\n BEGIN\\n PROC extended gcd = (LLI x, y) []LLI :\\n BEGIN\\n\\t LLI v := 1, a := 1, u := 0, b := 0, g := x, w := y;\\n\\t WHILE w>0\\n\\t DO\\n\\t LLI q := g % w, t := a - q * u;\\n\\t a := u; u := t;\\n\\t t := b - q * v;\\n\\t b := v; v := t;\\n\\t t := g - q * w;\\n\\t g := w; w := t\\n\\t OD;\\n\\t a PLUSAB (a < 0 | u | 0);\\n\\t (a, b, g)\\n END;\\n [] LLI egcd = extended gcd (a, m);\\n (egcd[3] > 1 | 0 | egcd[1] MOD m)\\n END;\\n PROC number to string = (LLI number) STRING :\\n BEGIN\\n [] CHAR map = (blank + \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\")[@0];\\n LLI local number := number;\\n INT length := SHORTEN SHORTEN ENTIER long long log(number) + 1;\\n (ODD length | length PLUSAB 1);\\n [length % 2] CHAR text;\\n FOR i FROM length % 2 BY -1 TO 1\\n DO\\n\\t INT index = SHORTEN SHORTEN (local number MOD 100);\\n\\t text[i] := (index > 26 | \\\"?\\\" | map[index]);\\n\\t local number := local number % 100\\n OD;\\n text\\n END;\\nCO The parameters of a particular RSA cryptosystem CO\\n LLI p = 3490529510847650949147849619903898133417764638493387843990820577;\\n LLI q = 32769132993266709549961988190834461413177642967992942539798288533;\\n LLI n = p * q;\\n LLI phi n = (p-1) * (q-1);\\n LLI e = 9007;\\n LLI d = modular inverse (e, phi n);\\nCO A ciphertext CO\\n LLI cipher text = 96869613754622061477140922254355882905759991124574319874695120930816298225145708356931476622883989628013391990551829945157815154;\\nCO Print out the corresponding plain text CO\\n print (number to string (mod power (ciphertext, d, n)))\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <gmp.h>\\n\\nint main(void)\\n{\\n mpz_t n, d, e, pt, ct;\\n\\n mpz_init(pt);\\n mpz_init(ct);\\n mpz_init_set_str(n, \\\"9516311845790656153499716760847001433441357\\\", 10);\\n mpz_init_set_str(e, \\\"65537\\\", 10);\\n mpz_init_set_str(d, \\\"5617843187844953170308463622230283376298685\\\", 10);\\n\\n const char *plaintext = \\\"Rossetta Code\\\";\\n mpz_import(pt, strlen(plaintext), 1, 1, 0, 0, plaintext);\\n\\n if (mpz_cmp(pt, n) > 0)\\n abort();\\n\\n mpz_powm(ct, pt, e, n);\\n gmp_printf(\\\"Encoded: %Zd\\\\n\\\", ct);\\n\\n mpz_powm(pt, ct, d, n);\\n gmp_printf(\\\"Decoded: %Zd\\\\n\\\", pt);\\n\\n char buffer[64];\\n mpz_export(buffer, NULL, 1, 1, 0, 0, pt);\\n printf(\\\"As String: %s\\\\n\\\", buffer);\\n\\n mpz_clears(pt, ct, n, e, d, NULL);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"using System;\\nusing System.Numerics;\\nusing System.Text;\\n\\nclass Program\\n{\\n static void Main(string[] args)\\n {\\n BigInteger n = BigInteger.Parse(\\\"9516311845790656153499716760847001433441357\\\");\\n BigInteger e = 65537;\\n BigInteger d = BigInteger.Parse(\\\"5617843187844953170308463622230283376298685\\\");\\n\\n const string plaintextstring = \\\"Hello, Rosetta!\\\";\\n byte[] plaintext = ASCIIEncoding.ASCII.GetBytes(plaintextstring);\\n BigInteger pt = new BigInteger(plaintext);\\n if (pt > n)\\n throw new Exception();\\n\\n BigInteger ct = BigInteger.ModPow(pt, e, n);\\n Console.WriteLine(\\\"Encoded: \\\" + ct);\\n\\n BigInteger dc = BigInteger.ModPow(ct, d, n);\\n Console.WriteLine(\\\"Decoded: \\\" + dc);\\n\\n string decoded = ASCIIEncoding.ASCII.GetString(dc.ToByteArray());\\n Console.WriteLine(\\\"As ASCII: \\\" + decoded);\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defparameter *n* 9516311845790656153499716760847001433441357)\\n(defparameter *e* 65537)\\n(defparameter *d* 5617843187844953170308463622230283376298685)\\n\\n;; magic\\n(defun encode-string (message)\\n (parse-integer (reduce #'(lambda (x y) (concatenate 'string x y))\\n (loop for c across message collect (format nil \\\"~2,'0d\\\" (- (char-code c) 32))))))\\n\\n;; sorcery\\n(defun decode-string (message) (coerce (loop for (a b) on\\n (loop for char across (write-to-string message) collect char)\\n by #'cddr collect (code-char (+ (parse-integer (coerce (list a b) 'string)) 32))) 'string))\\n\\n;; ACTUAL RSA ALGORITHM STARTS HERE ;;\\n\\n;; fast modular exponentiation: runs in O(log exponent)\\n;; acc is initially 1 and contains the result by the end\\n(defun mod-exp (base exponent modulus acc)\\n (if (= exponent 0) acc\\n (mod-exp (mod (* base base) modulus) (ash exponent -1) modulus\\n\\t (if (= (mod exponent 2) 1) (mod (* acc base) modulus) acc))))\\n\\n;; to encode a message, we first convert it to its integer form.\\n;; then, we raise it to the *e* power, modulo *n*\\n(defun encode-rsa (message)\\n (mod-exp (encode-string message) *e* *n* 1))\\n\\n;; to decode a message, we raise it to *d* power, modulo *n*\\n;; and then convert it back into a string\\n(defun decode-rsa (message)\\n (decode-string (mod-exp message *d* *n* 1)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.bigint, std.algorithm, std.string, std.range,\\n modular_exponentiation;\\n\\n immutable txt = \\\"Rosetta Code\\\";\\n writeln(\\\"Plain text: \\\", txt);\\n\\n // A key set big enough to hold 16 bytes of plain text in\\n // a single block (to simplify the example) and also big enough\\n // to demonstrate efficiency of modular exponentiation.\\n immutable BigInt n = \\\"2463574872878749457479\\\".BigInt *\\n \\\"3862806018422572001483\\\".BigInt;\\n immutable BigInt e = 2 ^^ 16 + 1;\\n immutable BigInt d = \\\"5617843187844953170308463622230283376298685\\\";\\n\\n // Convert plain text to a number.\\n immutable txtN = reduce!q{ (a << 8) | uint(b) }(0.BigInt, txt);\\n if (txtN >= n)\\n return writeln(\\\"Plain text message too long.\\\");\\n writeln(\\\"Plain text as a number: \\\", txtN);\\n\\n // Encode a single number.\\n immutable enc = txtN.powMod(e, n);\\n writeln(\\\"Encoded: \\\", enc);\\n\\n // Decode a single number.\\n auto dec = enc.powMod(d, n);\\n writeln(\\\"Decoded: \\\", dec);\\n\\n // Convert number to text.\\n char[] decTxt;\\n for (; dec; dec >>= 8)\\n decTxt ~= (dec & 0xff).toInt;\\n writeln(\\\"Decoded number as text: \\\", decTxt.retro);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program RSA_code;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils,\\n Velthuis.BigIntegers;\\n\\ntype\\n TRSA = record\\n private\\n n, e, d: BigInteger;\\n class function PlainTextAsNumber(data: AnsiString): BigInteger; static;\\n class function NumberAsPlainText(Num: BigInteger): AnsiString; static;\\n public\\n constructor Create(n, e, d: string);\\n function Encode(data: AnsiString): string;\\n function Decode(code: string): AnsiString;\\n end;\\n\\nfunction EncodeRSA(data: AnsiString): string;\\nvar\\n n, e, d, bb, ptn, etn, dtn: BigInteger;\\nbegin\\n // a key set big enough to hold 16 bytes of plain text in\\n // a single block (to simplify the example) and also big enough\\n // to demonstrate efficiency of modular exponentiation.\\n n := '9516311845790656153499716760847001433441357';\\n e := '65537';\\n d := '5617843187844953170308463622230283376298685';\\n\\n for var c in data do\\n begin\\n bb := ord(c);\\n ptn := (ptn shl 8) or bb;\\n end;\\n\\n if BigInteger.Compare(ptn, n) >= 0 then\\n begin\\n Writeln('Plain text message too long');\\n exit;\\n end;\\n writeln('Plain text as a number:', ptn.ToString);\\n writeln(ptn.ToString);\\n\\n // encode a single number\\n etn := BigInteger.ModPow(ptn, e, n);\\n Writeln('Encoded: ', etn.ToString);\\n\\n // decode a single number\\n dtn := BigInteger.ModPow(etn, d, n);\\n Writeln('Decoded: ', dtn.ToString);\\n\\n // convert number to text\\n var db: AnsiString;\\n var bff: BigInteger := $FF;\\n while dtn.BitLength > 0 do\\n begin\\n db := ansichar((dtn and bff).AsInteger) + db;\\n dtn := dtn shr 8;\\n end;\\n Write('Decoded number as text:\\\"', db, '\\\"');\\nend;\\n\\nconst\\n pt = 'Rosetta Code';\\n\\n{ TRSA }\\n\\nconstructor TRSA.Create(n, e, d: string);\\nbegin\\n self.n := n;\\n self.e := e;\\n self.d := d;\\nend;\\n\\nfunction TRSA.Decode(code: string): AnsiString;\\nvar\\n etn, dtn: BigInteger;\\nbegin\\n // decode a single number\\n etn := code;\\n dtn := BigInteger.ModPow(etn, d, n);\\n Result := NumberAsPlainText(dtn);\\nend;\\n\\nfunction TRSA.Encode(data: AnsiString): string;\\nvar\\n ptn: BigInteger;\\nbegin\\n ptn := PlainTextAsNumber(data);\\n\\n // encode a single number\\n Result := BigInteger.ModPow(ptn, e, n).ToString;\\nend;\\n\\nclass function TRSA.NumberAsPlainText(Num: BigInteger): AnsiString;\\nvar\\n bff: BigInteger;\\nbegin\\n // convert number to text\\n bff := $FF;\\n Result := '';\\n while Num.BitLength > 0 do\\n begin\\n Result := ansichar((Num and bff).AsInteger) + Result;\\n Num := Num shr 8;\\n end;\\nend;\\n\\nclass function TRSA.PlainTextAsNumber(data: AnsiString): BigInteger;\\nvar\\n c: AnsiChar;\\n bb, n: BigInteger;\\nbegin\\n Result := 0;\\n n := '9516311845790656153499716760847001433441357';\\n for c in data do\\n begin\\n bb := ord(c);\\n Result := (Result shl 8) or bb;\\n end;\\n\\n if BigInteger.Compare(Result, n) >= 0 then\\n raise Exception.Create('Plain text message too long');\\nend;\\n\\nvar\\n RSA: TRSA;\\n Encoded: string;\\n\\nconst\\n n = '9516311845790656153499716760847001433441357';\\n e = '65537';\\n d = '5617843187844953170308463622230283376298685';\\n TEST_WORD = 'Rosetta Code';\\n\\nbegin\\n RSA := TRSA.Create(n, e, d);\\n Encoded := RSA.Encode(TEST_WORD);\\n writeln('Plain text: ', TEST_WORD);\\n writeln('Encoded: ', Encoded);\\n writeln('Decoded: ', RSA.Decode(Encoded));\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"%%% @author Tony Wallace <tony@tony.gen.nz>\\n%%% @doc\\n%%% For details of the algorithms used see\\n%%% https://en.wikipedia.org/wiki/Modular_exponentiation\\n%%% @end\\n%%% Created : 21 Jul 2021 by Tony Wallace <tony@resurrection>\\n\\n-module mod.\\n-export [mod_mult/3,mod_exp/3,binary_exp/2,test/0].\\n\\nmod_mult(I1,I2,Mod) when\\n I1 > Mod,\\n is_integer(I1), is_integer(I2), is_integer(Mod) ->\\n mod_mult(I1 rem Mod,I2,Mod);\\nmod_mult(I1,I2,Mod) when\\n I2 > Mod,\\n is_integer(I1), is_integer(I2), is_integer(Mod) ->\\n mod_mult(I1,I2 rem Mod,Mod);\\nmod_mult(I1,I2,Mod) when\\n is_integer(I1), is_integer(I2), is_integer(Mod) ->\\n (I1 * I2) rem Mod.\\n\\nmod_exp(Base,Exp,Mod) when\\n is_integer(Base),\\n is_integer(Exp),\\n is_integer(Mod),\\n Base > 0,\\n Exp > 0,\\n Mod > 0 ->\\n binary_exp_mod(Base,Exp,Mod);\\nmod_exp(_,0,_) -> 1.\\n\\n\\nbinary_exp(Base,Exponent) when\\n is_integer(Base),\\n is_integer(Exponent),\\n Base > 0,\\n Exponent > 0 ->\\n binary_exp(Base,Exponent,1);\\nbinary_exp(_,0) ->\\n 1.\\n\\nbinary_exp(_,0,Result) ->\\n Result;\\nbinary_exp(Base,Exponent,Acc) ->\\n binary_exp(Base*Base,Exponent bsr 1,Acc * exp_factor(Base,Exponent)).\\n\\n\\nbinary_exp_mod(Base,Exponent,Mod) ->\\n binary_exp_mod(Base rem Mod,Exponent,Mod,1).\\nbinary_exp_mod(_,0,_,Result) ->\\n Result;\\nbinary_exp_mod(Base,Exponent,Mod,Acc) ->\\n binary_exp_mod((Base*Base) rem Mod,\\n\\t\\t Exponent bsr 1,Mod,(Acc * exp_factor(Base,Exponent))rem Mod).\\n\\nexp_factor(_,0) ->\\n 1;\\nexp_factor(Base,1) ->\\n Base;\\nexp_factor(Base,Exponent) ->\\n exp_factor(Base,Exponent band 1).\\n\\ntest() ->\\n 445 = mod_exp(4,13,497),\\n %% Rosetta code example:\\n R = 1527229998585248450016808958343740453059 =\\n\\tmod_exp(2988348162058574136915891421498819466320163312926952423791023078876139,\\n\\t\\t2351399303373464486466122544523690094744975233415544072992656881240319,\\n\\t\\tbinary_exp(10,40)),\\n R.\\n\\n%%%-------------------------------------------------------------------\\n%%% @author Tony Wallace <tony@tony.gen.nz>\\n%%% @doc\\n%%% Blocking not implemented. Runtime exception if message too long\\n%%% Not a practical issue as RSA usually limited to symmetric key exchange\\n%%% However as a key exchange tool no advantage in compressing plaintext\\n%%% so that is not done either.\\n%%% @end\\n%%% Created : 24 Jul 2021 by Tony Wallace <tony@resurrection>\\n%%%-------------------------------------------------------------------\\n\\n-module rsa.\\n-export([key_gen/2,encrypt/2,decrypt/2,test/0]).\\n-type key() :: {integer(),integer()}.\\nkey_gen({N,D},E) ->\\n {{E,N},{D,N}}.\\n-spec encrypt(key(),integer()) -> integer().\\nencrypt({E,N},MessageInt)\\n when MessageInt < N ->\\n mod:mod_exp(MessageInt,E,N).\\n-spec decrypt(key(),integer()) -> integer().\\ndecrypt({D,N},Message) ->\\n mod:mod_exp(Message,D,N).\\ntest() ->\\n PlainText=10722935,\\n N = 9516311845790656153499716760847001433441357,\\n E = 65537,\\n D = 5617843187844953170308463622230283376298685,\\n {PublicKey,PrivateKey} = key_gen({N,D},E),\\n PlainText =:= decrypt(PrivateKey,\\n\\t\\t\\t encrypt(PublicKey,PlainText)).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"//Nigel Galloway February 12th., 2018\\nlet RSA n g l = bigint.ModPow(l,n,g)\\nlet encrypt = RSA 65537I 9516311845790656153499716760847001433441357I\\nlet m_in = System.Text.Encoding.ASCII.GetBytes \\\"The magic words are SQUEAMISH OSSIFRAGE\\\"|>Array.chunkBySize 16|>Array.map(Array.fold(fun n g ->(n*256I)+(bigint(int g))) 0I)\\nlet n = Array.map encrypt m_in\\nlet decrypt = RSA 5617843187844953170308463622230283376298685I 9516311845790656153499716760847001433441357I\\nlet g = Array.map decrypt n\\nlet m_out = Array.collect(fun n->Array.unfold(fun n->if n>0I then Some(byte(int (n%256I)),n/256I) else None) n|>Array.rev) g|>System.Text.Encoding.ASCII.GetString\\nprintfn \\\"'The magic words are SQUEAMISH OSSIFRAGE' as numbers -> %A\\\\nEncrypted -> %A\\\\nDecrypted -> %A\\\\nAs text -> %A\\\" m_in n g m_out\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"' version 17-01-2017\\n' compile with: fbc -s console\\n\\n#Include Once \\\"gmp.bi\\\"\\n\\nDim As Mpz_ptr e, d, n, pt, ct\\n\\ne = Allocate(Len(__mpz_struct))\\nd = Allocate(Len(__mpz_struct))\\nn = Allocate(Len(__mpz_struct))\\npt = Allocate(Len(__mpz_struct)) : mpz_init(pt)\\nct = Allocate(Len(__mpz_struct)) : mpz_init(ct)\\n\\nmpz_init_set_str(e, \\\"65537\\\", 10)\\nmpz_init_set_str(d, \\\"5617843187844953170308463622230283376298685\\\", 10)\\nmpz_init_set_str(n, \\\"9516311845790656153499716760847001433441357\\\", 10)\\n\\nDim As ZString Ptr plaintext : plaintext = Allocate(1000)\\nDim As ZString Ptr text : text = Allocate(1000)\\n*plaintext = \\\"Rosetta Code\\\"\\n\\nmpz_import(pt, Len(*plaintext), 1, 1, 0, 0, plaintext)\\n\\nIf mpz_cmp(pt, n) > 0 Then GoTo clean_up\\n\\nmpz_powm(ct, pt, e, n)\\ngmp_printf(!\\\" Encoded: %Zd\\\\n\\\", ct)\\n\\nmpz_powm(pt, ct, d, n)\\ngmp_printf(!\\\" Decoded: %Zd\\\\n\\\", pt)\\n\\nmpz_export(text, NULL, 1, 1, 0, 0, pt)\\nPrint \\\"As string: \\\"; *text\\n\\nclean_up:\\nDeAllocate(plaintext) : DeAllocate(text)\\nmpz_clear(e) : mpz_clear(d) : mpz_clear(n)\\nmpz_clear(pt) : mpz_clear(ct)\\n\\n' empty keyboard buffer\\nWhile Inkey <> \\\"\\\" : Wend\\nPrint : Print \\\"hit any key to end program\\\"\\nSleep\\nEnd\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/big\\\"\\n)\\n\\nfunc main() {\\n var n, e, d, bb, ptn, etn, dtn big.Int\\n pt := \\\"Rosetta Code\\\"\\n fmt.Println(\\\"Plain text: \\\", pt)\\n\\n // a key set big enough to hold 16 bytes of plain text in\\n // a single block (to simplify the example) and also big enough\\n // to demonstrate efficiency of modular exponentiation.\\n n.SetString(\\\"9516311845790656153499716760847001433441357\\\", 10)\\n e.SetString(\\\"65537\\\", 10)\\n d.SetString(\\\"5617843187844953170308463622230283376298685\\\", 10)\\n\\n // convert plain text to a number\\n for _, b := range []byte(pt) {\\n ptn.Or(ptn.Lsh(&ptn, 8), bb.SetInt64(int64(b)))\\n }\\n if ptn.Cmp(&n) >= 0 {\\n fmt.Println(\\\"Plain text message too long\\\")\\n return\\n }\\n fmt.Println(\\\"Plain text as a number:\\\", &ptn)\\n\\n // encode a single number\\n etn.Exp(&ptn, &e, &n)\\n fmt.Println(\\\"Encoded: \\\", &etn)\\n\\n // decode a single number\\n dtn.Exp(&etn, &d, &n)\\n fmt.Println(\\\"Decoded: \\\", &dtn)\\n\\n // convert number to text\\n var db [16]byte\\n dx := 16\\n bff := big.NewInt(0xff)\\n for dtn.BitLen() > 0 {\\n dx--\\n db[dx] = byte(bb.And(&dtn, bff).Int64())\\n dtn.Rsh(&dtn, 8)\\n }\\n fmt.Println(\\\"Decoded number as text:\\\", string(db[dx:]))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"module RSAMaker\\n where\\nimport Data.Char ( chr )\\n\\nencode :: String -> [Integer]\\nencode s = map (toInteger . fromEnum ) s\\n\\nrsa_encode :: Integer -> Integer -> [Integer] -> [Integer]\\nrsa_encode n e numbers = map (\\\\num -> mod ( num ^ e ) n ) numbers\\n\\nrsa_decode :: Integer -> Integer -> [Integer] -> [Integer]\\nrsa_decode d n ciphers = map (\\\\c -> mod ( c ^ d ) n ) ciphers\\n\\ndecode :: [Integer] -> String\\ndecode encoded = map ( chr . fromInteger ) encoded\\n\\ndivisors :: Integer -> [Integer]\\ndivisors n = [m | m <- [1..n] , mod n m == 0 ]\\n\\nisPrime :: Integer -> Bool\\nisPrime n = divisors n == [1,n]\\n\\ntotient :: Integer -> Integer -> Integer\\ntotient prime1 prime2 = (prime1 - 1 ) * ( prime2 - 1 )\\n\\nmyE :: Integer -> Integer\\nmyE tot = head [n | n <- [2..tot - 1] , gcd n tot == 1]\\n\\nmyD :: Integer -> Integer -> Integer -> Integer\\nmyD e n phi = head [d | d <- [1..n] , mod ( d * e ) phi == 1]\\n\\nmain = do\\n putStrLn \\\"Enter a test text!\\\"\\n text <- getLine\\n let primes = take 90 $ filter isPrime [1..]\\n p1 = last primes\\n p2 = last $ init primes\\n tot = totient p1 p2\\n e = myE tot\\n n = p1 * p2\\n rsa_encoded = rsa_encode n e $ encode text\\n d = myD e n tot\\n encrypted = concatMap show rsa_encoded\\n decrypted = decode $ rsa_decode d n rsa_encoded\\n putStrLn (\\\"Encrypted: \\\" ++ encrypted )\\n putStrLn (\\\"And now decrypted: \\\" ++ decrypted )\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main() # rsa demonstration\\n\\n n := 9516311845790656153499716760847001433441357\\n e := 65537\\n d := 5617843187844953170308463622230283376298685\\n b := 2^integer(log(n,2)) # for blocking\\n write(\\\"RSA Demo using\\\\n n = \\\",n,\\\"\\\\n e = \\\",e,\\\"\\\\n d = \\\",d,\\\"\\\\n b = \\\",b)\\n\\n every m := ![\\\"Rosetta Code\\\", \\\"Hello Word!\\\",\\n \\\"This message is too long.\\\", repl(\\\"x\\\",*decode(n+1))] do {\\n write(\\\"\\\\nMessage = \\\",image(m))\\n write( \\\"Encoded = \\\",m := encode(m))\\n if m := rsa(m,e,n) then { # unblocked\\n write( \\\"Encrypt = \\\",m)\\n write( \\\"Decrypt = \\\",m := rsa(m,d,n))\\n }\\n else { # blocked\\n every put(C := [], rsa(!block(m,b),e,n))\\n writes(\\\"Encrypt = \\\") ; every writes(!C,\\\" \\\") ; write()\\n every put(P := [], rsa(!C,d,n))\\n writes(\\\"Decrypt = \\\") ; every writes(!P,\\\" \\\") ; write()\\n write(\\\"Unblocked = \\\",m := unblock(P,b))\\n }\\n write( \\\"Decoded = \\\",image(decode(m)))\\n }\\nend\\n\\nprocedure mod_power(base, exponent, modulus) # fast modular exponentation\\n result := 1\\n while exponent > 0 do {\\n if exponent % 2 = 1 then\\n result := (result * base) % modulus\\n exponent /:= 2\\n base := base ^ 2 % modulus\\n }\\n return result\\nend\\n\\nprocedure rsa(text,e,n) # return rsa encryption of numerically encoded message; fail if text < n\\nreturn mod_power(text,e,text < n)\\nend\\n\\nprocedure encode(text) # numerically encode ascii text as int\\n every (message := 0) := ord(!text) + 256 * message\\n return message\\nend\\n\\nprocedure decode(message) # numerically decode int to ascii text\\n text := \\\"\\\"\\n while text ||:= char((0 < message) % 256) do\\n message /:= 256\\n return reverse(text)\\nend\\n\\nprocedure block(m,b) # break lg int into blocks of size b\\n M := []\\n while push(M, x := (0 < m) % b) do\\n m /:= b\\n return M\\nend\\n\\nprocedure unblock(M,b) # reassemble blocks of size b into lg int\\n every (m := 0) := !M + b * m\\n return m\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \" N=: 9516311845790656153499716760847001433441357x\\n E=: 65537x\\n D=: 5617843187844953170308463622230283376298685x\\n\\n ] text=: 'Rosetta Code'\\nRosetta Code\\n ] num=: 256x #. a.i.text\\n25512506514985639724585018469\\n num >: N NB. check if blocking is necessary (0 means no)\\n0\\n ] enc=: N&|@^&E num\\n916709442744356653386978770799029131264344\\n ] dec=: N&|@^&D enc\\n25512506514985639724585018469\\n ] final=: a. {~ 256x #.inv dec\\nRosetta Code\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public static void main(String[] args) {\\n /*\\n This is probably not the best method...or even the most optimized way...however it works since n and d are too big to be ints or longs\\n This was also only tested with 'Rosetta Code' and 'Hello World'\\n It's also pretty limited on plainText size (anything bigger than the above will fail)\\n */\\n BigInteger n = new BigInteger(\\\"9516311845790656153499716760847001433441357\\\");\\n BigInteger e = new BigInteger(\\\"65537\\\");\\n BigInteger d = new BigInteger(\\\"5617843187844953170308463622230283376298685\\\");\\n Charset c = Charsets.UTF_8;\\n String plainText = \\\"Rosetta Code\\\";\\n System.out.println(\\\"PlainText : \\\" + plainText);\\n byte[] bytes = plainText.getBytes();\\n BigInteger plainNum = new BigInteger(bytes);\\n System.out.println(\\\"As number : \\\" + plainNum);\\n BigInteger Bytes = new BigInteger(bytes);\\n if (Bytes.compareTo(n) == 1) {\\n System.out.println(\\\"Plaintext is too long\\\");\\n return;\\n }\\n BigInteger enc = plainNum.modPow(e, n);\\n System.out.println(\\\"Encoded: \\\" + enc);\\n BigInteger dec = enc.modPow(d, n);\\n System.out.println(\\\"Decoded: \\\" + dec);\\n String decText = new String(dec.toByteArray(), c);\\n System.out.println(\\\"As text: \\\" + decText);\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.math.BigInteger;\\nimport java.util.Random;\\n\\npublic class rsaCode {\\n public static void main(String[]args){\\n //Size of primes\\n int BIT_LENGTH = 4096;\\n Random rand = new Random();\\n //Generate primes and other necessary values\\n BigInteger p = BigInteger.probablePrime(BIT_LENGTH / 2, rand);\\n BigInteger q = BigInteger.probablePrime(BIT_LENGTH / 2, rand);\\n BigInteger n = p.multiply(q);\\n BigInteger phi = p.subtract(BigInteger.valueOf(1)).multiply(q.subtract(BigInteger.valueOf(1)));\\n BigInteger e;\\n BigInteger d;\\n do {\\n e = new BigInteger(phi.bitLength(), rand);\\n } while (e.compareTo(BigInteger.valueOf(1)) <= 0 || e.compareTo(phi) >= 0 || !e.gcd(phi).equals(BigInteger.valueOf(1)));\\n d = e.modInverse(phi);\\n //Convert message to byte array and then to a BigInteger\\n BigInteger message = new BigInteger(\\\"Hello World! - From Rosetta Code\\\".getBytes());\\n BigInteger cipherText = message.modPow(e, n);\\n BigInteger decryptedText = cipherText.modPow(d, n);\\n System.out.println(\\\"Message: \\\" + message);\\n System.out.println(\\\"Prime 1: \\\" + p);\\n System.out.println(\\\"Prime 2: \\\" + q);\\n System.out.println(\\\"Phi p1 * p2: \\\" + phi);\\n System.out.println(\\\"p1 * p2: \\\" + n);\\n System.out.println(\\\"Public key: \\\" + e);\\n System.out.println(\\\"Private key: \\\" + d);\\n System.out.println(\\\"Ciphertext: \\\" + cipherText);\\n System.out.println(\\\"Decrypted message(number form): \\\" + decryptedText);\\n //Convert BigInteger to byte array then to String\\n System.out.println(\\\"Decrypted message(string): \\\" + new String(decryptedText.toByteArray()));\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# If $j is 0, then an error condition is raised;\\n# otherwise, assuming infinite-precision integer arithmetic,\\n# if the input and $j are integers, then the result will be an integer.\\ndef idivide($j): (. - (. % $j)) / $j ;\\n\\n# shift left\\ndef left8: 256 * .;\\n\\n# shift right\\ndef right8: idivide(256);\\n\\ndef modPow($b; $e; $m):\\n if ($m == 1) then 0\\n else {b: ($b % $m), $e, r: 1}\\n | until( .e <= 0 or .return;\\n if .b == 0 then .return = 0\\n else if .e % 2 == 1 then .r = (.r * .b) % $m else . end\\n | .e |= idivide(2)\\n | .b = (.b * .b) % $m\\n end)\\n | if .return then .return else .r end\\n end;\\n\\n# Convert the input integer to a stream of 8-bit integers, most significant first\\ndef bytes:\\n def stream:\\n recurse(if . >= 256 then ./256|floor else empty end) | . % 256 ;\\n [stream] | reverse ;\\n\\n# convert ASCII plain text to a number\\ndef ptn:\\n reduce explode[] as $b (0; left8 + $b);\\n\\ndef n: 9516311845790656153499716760847001433441357;\\ndef e: 65537;\\ndef d: 5617843187844953170308463622230283376298685;\\n\\n# encode a single number\\ndef etn: . as $ptn | modPow($ptn; e; n);\\n\\n# decode a single number\\ndef dtn: . as $etn | modPow($etn; d; n);\\n\\ndef decode:\\n [recurse(right8 | select(.>0)) % 256]\\n | reverse\\n | implode;\\n\\ndef task($pt):\\n ($pt|ptn) as $ptn\\n | if ($ptn >= n) then \\\"Plain text message too long\\\" | error else . end\\n | ($ptn|etn) as $etn\\n | ($etn|dtn) as $dtn\\n | ($ptn|decode) as $text\\n | \\\"Plain text: : \\\\($pt)\\\",\\n \\\"Plain text as a number : \\\\($ptn)\\\",\\n \\\"Encoded : \\\\($etn)\\\",\\n \\\"Decoded : \\\\($dtn)\\\",\\n \\\"Decoded number as text : \\\\($text)\\\"\\n ;\\n\\ntask(\\\"Rosetta Code\\\"),\\n\\\"\\\",\\ntask(\\\"Hello, Rosetta!!!!\\\")\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function rsaencode(clearmsg::AbstractString, nmod::Integer, expub::Integer)\\n bytes = parse(BigInt, \\\"0x\\\" * bytes2hex(collect(UInt8, clearmsg)))\\n return powermod(bytes, expub, nmod)\\nend\\n\\nfunction rsadecode(cryptmsg::Integer, nmod::Integer, dsecr::Integer)\\n decoded = powermod(encoded, dsecr, nmod)\\n return join(Char.(hex2bytes(hex(decoded))))\\nend\\n\\nmsg = \\\"Rosetta Code.\\\"\\nnmod = big\\\"9516311845790656153499716760847001433441357\\\"\\nexpub = 65537\\ndsecr = big\\\"5617843187844953170308463622230283376298685\\\"\\n\\nencoded = rsaencode(msg, nmod, expub)\\ndecoded = rsadecode(encoded, nmod, dsecr)\\nprintln(\\\"\\\\n# $msg\\\\n -> ENCODED: $encoded\\\\n -> DECODED: $decoded\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.4-3\\n\\nimport java.math.BigInteger\\n\\nfun main(args: Array<String>) {\\n val n = BigInteger(\\\"9516311845790656153499716760847001433441357\\\")\\n val e = BigInteger(\\\"65537\\\")\\n val d = BigInteger(\\\"5617843187844953170308463622230283376298685\\\")\\n val c = Charsets.UTF_8\\n val plainText = \\\"Rosetta Code\\\"\\n println(\\\"PlainText : $plainText\\\")\\n val bytes = plainText.toByteArray(c)\\n val plainNum = BigInteger(bytes)\\n println(\\\"As number : $plainNum\\\")\\n if (plainNum > n) {\\n println(\\\"Plaintext is too long\\\")\\n return\\n }\\n\\n val enc = plainNum.modPow(e, n)\\n println(\\\"Encoded : $enc\\\")\\n\\n val dec = enc.modPow(d, n)\\n println(\\\"Decoded : $dec\\\")\\n\\n val decText = dec.toByteArray().toString(c)\\n println(\\\"As text : $decText\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"toNumPlTxt[s_] := FromDigits[ToCharacterCode[s], 256];\\nfromNumPlTxt[plTxt_] := FromCharacterCode[IntegerDigits[plTxt, 256]];\\nenc::longmess = \\\"Message '``' is too long for n = ``.\\\";\\nenc[n_, _, mess_] /;\\n toNumPlTxt[mess] >= n := (Message[enc::longmess, mess, n]; $Failed);\\nenc[n_, e_, mess_] := PowerMod[toNumPlTxt[mess], e, n];\\ndec[n_, d_, en_] := fromNumPlTxt[PowerMod[en, d, n]];\\ntext = \\\"The cake is a lie!\\\";\\nn = 9516311845790656153499716760847001433441357;\\ne = 65537;\\nd = 5617843187844953170308463622230283376298685;\\nen = enc[n, e, text];\\nde = dec[n, d, en];\\nPrint[\\\"Text: '\\\" <> text <> \\\"'\\\"];\\nPrint[\\\"n = \\\" <> IntegerString[n]];\\nPrint[\\\"e = \\\" <> IntegerString[e]];\\nPrint[\\\"d = \\\" <> IntegerString[d]];\\nPrint[\\\"Numeric plaintext: \\\" <> IntegerString[toNumPlTxt[text]]];\\nPrint[\\\"Encoded: \\\" <> IntegerString[en]];\\nPrint[\\\"Decoded: '\\\" <> de <> \\\"'\\\"];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import strutils, streams, strformat\\n# nimble install stint\\nimport stint\\n\\nconst messages = [\\\"PPAP\\\", \\\"I have a pen, I have a apple\\\\nUh! Apple-pen!\\\",\\n \\\"I have a pen, I have pineapple\\\\nUh! Pineapple-pen!\\\",\\n \\\"Apple-pen, pineapple-pen\\\\nUh! Pen-pineapple-apple-pen\\\\nPen-pineapple-apple-pen\\\\nDance time!\\\", \\\"\\\\a\\\\0\\\"]\\nconst\\n n = u256(\\\"9516311845790656153499716760847001433441357\\\")\\n e = u256(\\\"65537\\\")\\n d = u256(\\\"5617843187844953170308463622230283376298685\\\")\\nproc pcount(s: string, c: char): int{.inline.} =\\n for ch in s:\\n if ch != c:\\n break\\n result+=1\\nfunc powmodHexStr(s: string, key, divisor: UInt256): string{.inline.} =\\n toHex(powmod(UInt256.fromHex(s), key, divisor))\\nproc translate(hexString: string, key, divisor: UInt256,\\n encrypt = true): string =\\n var\\n strm = newStringStream(hexString)\\n chunk, residue, tempChunk: string\\n let chunkSize = len(toHex(divisor))\\n while true:\\n tempChunk = strm.peekStr(chunkSize-int(encrypt)*3)\\n if len(chunk) > 0:\\n if len(tempChunk) == 0:\\n if encrypt:\\n result&=powmodHexStr(pcount(chunk, '0').toHex(2)&align(chunk,\\n chunkSize-3, '0'), key, divisor)\\n else:\\n tempChunk = align(powmodHexStr(chunk, key, divisor), chunkSize-1, '0')\\n residue = tempChunk[2..^1].strip(trailing = false, chars = {'0'})\\n result&=align(residue, fromHex[int](tempChunk[0..1])+len(residue), '0')\\n break\\n result&=align(powmodHexStr(chunk, key, divisor), chunkSize-3+int(\\n encrypt)*3, '0')\\n discard strm.readStr(chunkSize-int(encrypt)*3)\\n chunk = tempChunk\\n strm.close()\\nfor message in messages:\\n echo(&\\\"plaintext:\\\\n{message}\\\")\\n var numPlaintext = message.toHex()\\n echo(&\\\"numerical plaintext in hex:\\\\n{numPlaintext}\\\")\\n var ciphertext = translate(numPlaintext, e, n)\\n echo(&\\\"ciphertext is: \\\\n{ciphertext}\\\")\\n var deciphertext = translate(ciphertext, d, n, false)\\n echo(&\\\"deciphered numerical plaintext in hex is:\\\\n{deciphertext}\\\")\\n echo(&\\\"deciphered plaintext is:\\\\n{parseHexStr(deciphertext)}\\\\n\\\\n\\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"stigid(V,b)=subst(Pol(V),'x,b);\\t\\t\\\\\\\\ inverse function digits(...)\\n\\nn = 9516311845790656153499716760847001433441357;\\ne = 65537;\\nd = 5617843187844953170308463622230283376298685;\\n\\ntext = \\\"Rosetta Code\\\"\\n\\ninttext = stigid(Vecsmall(text),256)\\t\\\\\\\\ message as an integer\\nencoded = lift(Mod(inttext, n) ^ e)\\t\\\\\\\\ encrypted message\\ndecoded = lift(Mod(encoded, n) ^ d)\\t\\\\\\\\ decrypted message\\nmessage = Strchr(digits(decoded, 256))\\t\\\\\\\\ readable message\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"f = factor(n);\\t\\t\\t\\t\\\\\\\\ factorize public key 'n'\\n\\ncrack = Strchr(digits(lift(Mod(encoded,n) ^ lift(Mod(1,(f[1,1]-1)*(f[2,1]-1)) / e)),256))\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use bigint;\\n\\n$n = 9516311845790656153499716760847001433441357;\\n$e = 65537;\\n$d = 5617843187844953170308463622230283376298685;\\n\\npackage Message {\\n my @alphabet;\\n push @alphabet, $_ for 'A' .. 'Z', ' ';\\n my $rad = +@alphabet;\\n $code{$alphabet[$_]} = $_ for 0..$rad-1;\\n\\n sub encode {\\n my($t) = @_;\\n my $cnt = my $sum = 0;\\n for (split '', reverse $t) {\\n $sum += $code{$_} * $rad**$cnt;\\n $cnt++;\\n }\\n $sum;\\n }\\n\\n sub decode {\\n my($n) = @_;\\n my(@i);\\n while () {\\n push @i, $n % $rad;\\n last if $n < $rad;\\n $n = int $n / $rad;\\n }\\n reverse join '', @alphabet[@i];\\n }\\n\\n sub expmod {\\n my($a, $b, $n) = @_;\\n my $c = 1;\\n do {\\n ($c *= $a) %= $n if $b % 2;\\n ($a *= $a) %= $n;\\n } while ($b = int $b/2);\\n $c;\\n}\\n\\n}\\n\\nmy $secret_message = \\\"ROSETTA CODE\\\";\\n\\n$numeric_message = Message::encode $secret_message;\\n$numeric_cipher = Message::expmod $numeric_message, $e, $n;\\n$text_cipher = Message::decode $numeric_cipher;\\n$numeric_cipher2 = Message::encode $text_cipher;\\n$numeric_message2 = Message::expmod $numeric_cipher2, $d, $n;\\n$secret_message2 = Message::decode $numeric_message2;\\n\\nprint <<\\\"EOT\\\";\\nSecret message is $secret_message\\nSecret message in integer form is $numeric_message\\nAfter exponentiation with public exponent we get: $numeric_cipher\\nThis turns into the string $text_cipher\\nIf we re-encode it in integer form we get $numeric_cipher2\\nAfter exponentiation with SECRET exponent we get: $numeric_message2\\nThis turns into the string $secret_message2\\nEOT\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">builtins</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #004080;\\\">mpfr</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"9516311845790656153499716760847001433441357\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">e</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"65537\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"5617843187844953170308463622230283376298685\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">pt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(),</span>\\n <span style=\\\"color: #000000;\\\">ct</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">plaintext</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"Rossetta Code\\\"</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- matches C/zkl\\n -- \\\"Rosetta Code\\\" -- matches D/FreeBasic/Go/Icon/J/Kotlin/Seed7.</span>\\n\\n <span style=\\\"color: #000000;\\\">mpz_import</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pt</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">plaintext</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">plaintext</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">mpz_cmp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pt</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)></span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n\\n <span style=\\\"color: #7060A8;\\\">mpz_powm</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ct</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pt</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">);</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Encoded: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">mpz_get_str</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ct</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n\\n <span style=\\\"color: #7060A8;\\\">mpz_powm</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pt</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ct</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">);</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Decoded: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">mpz_get_str</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pt</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">size</span> <span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">((</span><span style=\\\"color: #7060A8;\\\">mpz_sizeinbase</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)+</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">pMem</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">allocate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">mpz_export</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pMem</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pt</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">size</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"As String: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">peek</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">pMem</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">})})</span>\\n\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">pt</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ct</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_free</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">pt</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ct</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"### This is a copy of \\\"lib/rsa.l\\\" ###\\n\\n# Generate long random number\\n(de longRand (N)\\n (use (R D)\\n (while (=0 (setq R (abs (rand)))))\\n (until (> R N)\\n (unless (=0 (setq D (abs (rand))))\\n (setq R (* R D)) ) )\\n (% R N) ) )\\n\\n# X power Y modulus N\\n(de **Mod (X Y N)\\n (let M 1\\n (loop\\n (when (bit? 1 Y)\\n (setq M (% (* M X) N)) )\\n (T (=0 (setq Y (>> 1 Y)))\\n M )\\n (setq X (% (* X X) N)) ) ) )\\n\\n# Probabilistic prime check\\n(de prime? (N)\\n (and\\n (> N 1)\\n (bit? 1 N)\\n (let (Q (dec N) K 0)\\n (until (bit? 1 Q)\\n (setq\\n Q (>> 1 Q)\\n K (inc K) ) )\\n (do 50\\n (NIL (_prim? N Q K))\\n T ) ) ) )\\n\\n# (Knuth Vol.2, p.379)\\n(de _prim? (N Q K)\\n (use (X J Y)\\n (while (> 2 (setq X (longRand N))))\\n (setq\\n J 0\\n Y (**Mod X Q N) )\\n (loop\\n (T\\n (or\\n (and (=0 J) (= 1 Y))\\n (= Y (dec N)) )\\n T )\\n (T\\n (or\\n (and (> J 0) (= 1 Y))\\n (<= K (inc 'J)) )\\n NIL )\\n (setq Y (% (* Y Y) N)) ) ) )\\n\\n# Find a prime number with `Len' digits\\n(de prime (Len)\\n (let P (longRand (** 10 (*/ Len 2 3)))\\n (unless (bit? 1 P)\\n (inc 'P) )\\n (until (prime? P) # P: Prime number of size 2/3 Len\\n (inc 'P 2) )\\n # R: Random number of size 1/3 Len\\n (let (R (longRand (** 10 (/ Len 3))) K (+ R (% (- P R) 3)))\\n (when (bit? 1 K)\\n (inc 'K 3) )\\n (until (prime? (setq R (inc (* K P))))\\n (inc 'K 6) )\\n R ) ) )\\n\\n# Generate RSA key\\n(de rsaKey (N) #> (Encrypt . Decrypt)\\n (let (P (prime (*/ N 5 10)) Q (prime (*/ N 6 10)))\\n (cons\\n (* P Q)\\n (/\\n (inc (* 2 (dec P) (dec Q)))\\n 3 ) ) ) )\\n\\n# Encrypt a list of characters\\n(de encrypt (Key Lst)\\n (let Siz (>> 1 (size Key))\\n (make\\n (while Lst\\n (let N (char (pop 'Lst))\\n (while (> Siz (size N))\\n (setq N (>> -16 N))\\n (inc 'N (char (pop 'Lst))) )\\n (link (**Mod N 3 Key)) ) ) ) ) )\\n\\n# Decrypt a list of numbers\\n(de decrypt (Keys Lst)\\n (mapcan\\n '((N)\\n (let Res NIL\\n (setq N (**Mod N (cdr Keys) (car Keys)))\\n (until (=0 N)\\n (push 'Res (char (& `(dec (** 2 16)) N)))\\n (setq N (>> 16 N)) )\\n Res ) )\\n Lst ) )\\n### End of \\\"lib/rsa.l\\\" ###\\n\\n# Generate 100-digit keys (private . public)\\n: (setq Keys (rsaKey 100))\\n-> (14394597526321726957429995133376978449624406217727317004742182671030....\\n\\n# Encrypt\\n: (setq CryptText\\n (encrypt (car Keys)\\n (chop \\\"The quick brown fox jumped over the lazy dog's back\\\") ) )\\n-> (72521958974980041245760752728037044798830723189142175108602418861716...\\n\\n# Decrypt\\n: (pack (decrypt Keys CryptText))\\n-> \\\"The quick brown fox jumped over the lazy dog's back\\\"\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"$n = [BigInt]::Parse(\\\"9516311845790656153499716760847001433441357\\\")\\n$e = [BigInt]::new(65537)\\n$d = [BigInt]::Parse(\\\"5617843187844953170308463622230283376298685\\\")\\n$plaintextstring = \\\"Hello, Rosetta!\\\"\\n$plaintext = [Text.ASCIIEncoding]::ASCII.GetBytes($plaintextstring)\\n[BigInt]$pt = [BigInt]::new($plaintext)\\nif ($n -lt $pt) {throw \\\"`$n = $n < $pt = `$pt\\\"}\\n$ct = [BigInt]::ModPow($pt, $e, $n)\\n\\\"Encoded: $ct\\\"\\n$dc = [BigInt]::ModPow($ct, $d, $n)\\n\\\"Decoded: $dc\\\"\\n$decoded = [Text.ASCIIEncoding]::ASCII.GetString($dc.ToByteArray())\\n\\\"As ASCII: $decoded\\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"import binascii\\n\\nn = 9516311845790656153499716760847001433441357 # p*q = modulus\\ne = 65537\\nd = 5617843187844953170308463622230283376298685\\n\\nmessage='Rosetta Code!'\\nprint('message ', message)\\n\\nhex_data = binascii.hexlify(message.encode())\\nprint('hex data ', hex_data)\\n\\nplain_text = int(hex_data, 16)\\nprint('plain text integer ', plain_text)\\n\\nif plain_text > n:\\n raise Exception('plain text too large for key')\\n\\nencrypted_text = pow(plain_text, e, n)\\nprint('encrypted text integer ', encrypted_text)\\n\\ndecrypted_text = pow(encrypted_text, d, n)\\nprint('decrypted text integer ', decrypted_text)\\n\\nprint('message ', binascii.unhexlify(hex(decrypted_text)[2:]).decode()) # [2:] slicing, to strip the 0x part\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n(require math/number-theory)\\n(define-logger rsa)\\n(current-logger rsa-logger)\\n\\n;; -| STRING TO NUMBER MAPPING |----------------------------------------------------------------------\\n(define (bytes->number B) ; We'll need our data in numerical form ..\\n (for/fold ((rv 0)) ((b B)) (+ b (* rv 256))))\\n\\n(define (number->bytes N) ; .. and back again\\n (define (inr n b) (if (zero? n) b (inr (quotient n 256) (bytes-append (bytes (modulo n 256)) b))))\\n (inr N (bytes)))\\n\\n;; -| RSA PUBLIC / PRIVATE FUNCTIONS |----------------------------------------------------------------\\n;; The basic definitions... pretty well lifted from the text book!\\n(define ((C e n) p)\\n ;; Just do the arithmetic to demonstrate RSA...\\n ;; breaking large messages into blocks is something for another day.\\n (unless (< p n) (raise-argument-error 'C (format \\\"(and/c integer? (</c ~a))\\\" n) p))\\n (modular-expt p e n))\\n\\n(define ((P d n) c)\\n (modular-expt c d n))\\n\\n;; -| RSA KEY GENERATION |----------------------------------------------------------------------------\\n;; Key generation\\n;; Full description of the steps can be found on Wikipedia\\n(define (RSA-keyset function-base-name)\\n (log-info \\\"RSA-keyset: ~s\\\" function-base-name)\\n (define max-k 4294967087)\\n ;; I'm guessing this RNG is about as cryptographically strong as replacing spaces with tabs.\\n (define (big-random n-rolls)\\n (for/fold ((rv 1)) ((roll (in-range n-rolls 0 -1))) (+ (* rv (add1 max-k)) 1 (random max-k))))\\n (define (big-random-prime)\\n (define start-number (big-random (/ 1024 32)))\\n (log-debug \\\"got large (possibly non-prime) number, finding next prime\\\")\\n (next-prime (match start-number ((? odd? o) o) ((app add1 e) e))))\\n\\n ;; [1] Choose two distinct prime numbers p and q.\\n (log-debug \\\"generating p\\\")\\n (define p (big-random-prime))\\n (log-debug \\\"p generated\\\")\\n (log-debug \\\"generating q\\\")\\n (define q (big-random-prime))\\n (log-debug \\\"q generated\\\")\\n (log-info \\\"primes generated\\\")\\n\\n ;; [2] Compute n = pq.\\n (define n (* p q))\\n\\n ;; [3] Compute φ(n) = φ(p)φ(q) = (p − 1)(q − 1) = n - (p + q -1),\\n ;; where φ is Euler's totient function.\\n (define φ (- n (+ p q -1)))\\n\\n ;; [4] Choose an integer e such that 1 < e < φ(n) and gcd(e, φ(n)) = 1; i.e., e and φ(n) are\\n ;; coprime. ... most commonly 2^16 + 1 = 65,537 ...\\n (define e (+ (expt 2 16) 1))\\n\\n ;; [5] Determine d as d ≡ e−1 (mod φ(n)); i.e., d is the multiplicative inverse of e (modulo φ(n)).\\n (log-debug \\\"generating d\\\")\\n (define d (modular-inverse e φ))\\n (log-info \\\"d generated\\\")\\n (values n e d))\\n\\n;; -| GIVE A USABLE SET OF PRIVATE STUFF TO A USER |--------------------------------------------------\\n;; six values: the public (encrypt) function (numeric)\\n;; the private (decrypt) function (numeric)\\n;; the public (encrypt) function (bytes)\\n;; the private (decrypt) function (bytes)\\n;; private (list n e d)\\n;; public (list n e)\\n(define (RSA-key-pack #:function-base-name function-base-name)\\n (define (rnm-fn f s) (procedure-rename f (string->symbol (format \\\"~a-~a\\\" function-base-name s))))\\n (define-values (n e d) (RSA-keyset function-base-name))\\n (define my-C (rnm-fn (C e n) \\\"C\\\"))\\n (define my-P (rnm-fn (P d n) \\\"P\\\"))\\n (define my-encrypt (rnm-fn (compose number->bytes my-C bytes->number) \\\"encrypt\\\"))\\n (define my-decrypt (rnm-fn (compose number->bytes my-P bytes->number) \\\"decrypt\\\"))\\n (values my-C my-P my-encrypt my-decrypt (list n e d) (list n e)))\\n\\n;; -| HEREON IS JUST A LOAD OF CHATTY DEMOS |---------------------------------------------------------\\n(define (narrated-encrypt-bytes C who plain-text)\\n (define plain-n (bytes->number plain-text))\\n (define cypher-n (C plain-n))\\n (define cypher-text (number->bytes cypher-n))\\n (printf #<<EOS\\n~a wants to send plain text: ~s\\n as number: ~s\\n cyphered number: ~s\\nsent by ~a over the public interwebs:\\n~s\\n...\\n\\n\\nEOS\\n who plain-text plain-n cypher-n who cypher-text)\\n cypher-text)\\n\\n(define (narrated-decrypt-bytes P who cypher-text)\\n (define cypher-n (bytes->number cypher-text))\\n (define plain-n (P cypher-n))\\n (define plain-text (number->bytes plain-n))\\n (printf #<<EOS\\n...\\n~s\\n received by ~a\\n as number: ~s\\n decyphered (with P) number: ~s\\ndecyphered text:\\n~s\\n\\n\\nEOS\\n cypher-text who cypher-n plain-n plain-text)\\n plain-text)\\n\\n;; ENCRYPT AND DECRYPT A MESSAGE WITH THE e.g. KEYS\\n(define-values (given-n given-e given-d)\\n (values 9516311845790656153499716760847001433441357\\n 65537\\n 5617843187844953170308463622230283376298685))\\n\\n;; Get the keys specific RSA functions\\n(for ((message-text (list #\\\"hello world\\\" #\\\"TOP SECRET!\\\")))\\n (define Bobs-public-function (C given-e given-n))\\n (define Bobs-private-function (P given-d given-n))\\n (define cypher-text (narrated-encrypt-bytes Bobs-public-function \\\"Alice\\\" message-text))\\n (define plain-text (narrated-decrypt-bytes Bobs-private-function \\\"Bob\\\" cypher-text))\\n plain-text)\\n\\n;; Demonstrate with larger keys.\\n;; (And include a free recap on digital signatures, too)\\n(define-values (A-pub-C A-pvt-P A-pub-encrypt A-pvt-decrypt A-pvt-keys A-pub-keys)\\n (RSA-key-pack #:function-base-name 'Alice))\\n(define-values (B-pub-C B-pvt-P B-pub-encrypt B-pvt-decrypt B-pvt-keys B-pub-keys)\\n (RSA-key-pack #:function-base-name 'Bob))\\n\\n;; Since p and q are random, it is possible that message' = \\\"message modulo {A,B}-key-n\\\" will be too\\n;; big for \\\"message' modulo {B,A}-key-n\\\", if that happens then I run the program again until it\\n;; works. Strictly, we need blocking of the signed message -- which is not yet implemented.\\n(let* ((plain-A-to-B #\\\"Dear Bob, meet you in Lymm at 1200, Alice\\\")\\n (signed-A-to-B (A-pvt-decrypt plain-A-to-B))\\n (unsigned-A-to-B (A-pub-encrypt signed-A-to-B))\\n (crypt-signed-A-to-B (B-pub-encrypt signed-A-to-B))\\n (decrypt-signed-A-to-B (B-pvt-decrypt crypt-signed-A-to-B))\\n (decrypt-verified-B (A-pub-encrypt decrypt-signed-A-to-B)))\\n (printf\\n #<<EOS\\nAlice wants to send ~s to Bob.\\nShe \\\"encrypts\\\" with her private \\\"decryption\\\" key.\\n(A-prv msg) -> ~s\\nOnly she could have done this (only she has the her private key data) -- so this is a signature on the\\nmessage. Anyone can verify the signature by \\\"decrypting\\\" the message with the public \\\"encryption\\\" key.\\n(A-pub (A-prv msg)) -> ~s\\nBut anyone is able to do this, so there is no privacy here.\\nEveryone knows that it can only be Alice at Lymm at noon, but this message is for Bob's eyes only.\\nWe need to encrypt this with his public key:\\n(B-pub (A-prv msg)) -> ~s\\nWhich is what gets posted to alt.chat.secret-rendezvous\\nBob decrypts this to get the signed message from Alice:\\n(B-prv (B-pub (A-prv msg))) -> ~s\\nAnd verifies Alice's signature:\\n(A-pub (B-prv (B-pub (A-prv msg)))) -> ~s\\nAlice genuinely sent the message.\\nAnd nobody else (on a.c.s-r, at least) has read it.\\n\\nKEYS:\\n Alice's full set: ~s\\n Bob's full set: ~s\\nEOS\\n plain-A-to-B signed-A-to-B unsigned-A-to-B crypt-signed-A-to-B decrypt-signed-A-to-B\\n decrypt-verified-B A-pvt-keys B-pvt-keys))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"class RSA-message {\\n has ($.n, $.e, $.d); # the 3 elements that define an RSA key\\n\\n my @alphabet = |('A' .. 'Z'), ' ';\\n my $rad = +@alphabet;\\n my %code = @alphabet Z=> 0 .. *;\\n subset Text of Str where /^^ @alphabet+ $$/;\\n\\n method encode(Text $t) {\\n [+] %code{$t.flip.comb} Z× (1, $rad, $rad×$rad … *);\\n }\\n\\n method decode(Int $n is copy) {\\n @alphabet[\\n gather loop {\\n take $n % $rad;\\n last if $n < $rad;\\n $n div= $rad;\\n }\\n ].join.flip;\\n }\\n}\\n\\nconstant $n = 9516311845790656153499716760847001433441357;\\nconstant $e = 65537;\\nconstant $d = 5617843187844953170308463622230283376298685;\\n\\nmy $fmt = \\\"%48s %s\\\\n\\\";\\n\\nmy $message = 'ROSETTA CODE';\\nprintf $fmt, 'Secret message is', $message;\\n\\nmy $rsa = RSA-message.new: n => $n, e => $e, d => $d;\\nprintf $fmt, 'Secret message in integer form is',\\n my $numeric-message = $rsa.encode: $message;\\n\\nprintf $fmt, 'After exponentiation with public exponent we get',\\n my $numeric-cipher = expmod $numeric-message, $e, $n;\\n\\nprintf $fmt, 'This turns into the string',\\n my $text-cipher = $rsa.decode: $numeric-cipher;\\n\\nprintf $fmt, 'If we re-encode it in integer form we get',\\n my $numeric-cipher2 = $rsa.encode: $text-cipher;\\n\\nprintf $fmt, 'After exponentiation with SECRET exponent we get',\\n my $numeric-message2 = expmod $numeric-cipher2, $d, $n;\\n\\nprintf $fmt, 'This turns into the string',\\n my $message2 = $rsa.decode: $numeric-message2;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"#!/usr/bin/ruby\\n\\nrequire 'openssl' # for mod_exp only\\nrequire 'prime'\\n\\ndef rsa_encode blocks, e, n\\n blocks.map{|b| b.to_bn.mod_exp(e, n).to_i}\\nend\\n\\ndef rsa_decode ciphers, d, n\\n rsa_encode ciphers, d, n\\nend\\n\\n# all numbers in blocks have to be < modulus, or information is lost\\n# for secure encryption only use big modulus and blocksizes\\ndef text_to_blocks text, blocksize=64 # 1 hex = 4 bit => default is 256bit\\n text.each_byte.reduce(\\\"\\\"){|acc,b| acc << b.to_s(16).rjust(2, \\\"0\\\")} # convert text to hex (preserving leading 0 chars)\\n .each_char.each_slice(blocksize).to_a # slice hexnumbers in pieces of blocksize\\n .map{|a| a.join(\\\"\\\").to_i(16)} # convert each slice into internal number\\nend\\n\\ndef blocks_to_text blocks\\n blocks.map{|d| d.to_s(16)}.join(\\\"\\\") # join all blocks into one hex-string\\n .each_char.each_slice(2).to_a # group into pairs\\n\\t.map{|s| s.join(\\\"\\\").to_i(16)} # number from 2 hexdigits is byte\\n\\t.flatten.pack(\\\"C*\\\") # pack bytes into ruby-string\\n\\t.force_encoding(Encoding::default_external) # reset encoding\\nend\\n\\ndef generate_keys p1, p2\\n n = p1 * p2\\n t = (p1 - 1) * (p2 - 1)\\n e = 2.step.each do |i|\\n break i if i.gcd(t) == 1\\n end\\n d = 1.step.each do |i|\\n break i if (i * e) % t == 1\\n end\\n return e, d, n\\nend\\n\\np1, p2 = Prime.take(100).last(2)\\npublic_key, private_key, modulus =\\n generate_keys p1, p2\\n\\nprint \\\"Message: \\\"\\nmessage = gets\\nblocks = text_to_blocks message, 4 # very small primes\\nprint \\\"Numbers: \\\"; p blocks\\nencoded = rsa_encode(blocks, public_key, modulus)\\nprint \\\"Encrypted as: \\\"; p encoded\\ndecoded = rsa_decode(encoded, private_key, modulus)\\nprint \\\"Decrypted to: \\\"; p decoded\\nfinal = blocks_to_text(decoded)\\nprint \\\"Decrypted Message: \\\"; puts final\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"extern crate num;\\n\\nuse num::bigint::BigUint;\\nuse num::integer::Integer;\\nuse num::traits::{One, Zero};\\n\\nfn mod_exp(b: &BigUint, e: &BigUint, n: &BigUint) -> Result<BigUint, &'static str> {\\n if n.is_zero() {\\n return Err(\\\"modulus is zero\\\");\\n }\\n if b >= n {\\n // base is too large and should be split into blocks\\n return Err(\\\"base is >= modulus\\\");\\n }\\n if b.gcd(n) != BigUint::one() {\\n return Err(\\\"base and modulus are not relatively prime\\\");\\n }\\n\\n let mut bb = b.clone();\\n let mut ee = e.clone();\\n let mut result = BigUint::one();\\n while !ee.is_zero() {\\n if ee.is_odd() {\\n result = (result * &bb) % n;\\n }\\n ee >>= 1;\\n bb = (&bb * &bb) % n;\\n }\\n Ok(result)\\n}\\n\\nfn main() {\\n let msg = \\\"Rosetta Code\\\";\\n\\n let n = \\\"9516311845790656153499716760847001433441357\\\"\\n .parse()\\n .unwrap();\\n let e = \\\"65537\\\".parse().unwrap();\\n let d = \\\"5617843187844953170308463622230283376298685\\\"\\n .parse()\\n .unwrap();\\n\\n let msg_int = BigUint::from_bytes_be(msg.as_bytes());\\n let enc = mod_exp(&msg_int, &e, &n).unwrap();\\n let dec = mod_exp(&enc, &d, &n).unwrap();\\n let msg_dec = String::from_utf8(dec.to_bytes_be()).unwrap();\\n\\n println!(\\\"msg as txt: {}\\\", msg);\\n println!(\\\"msg as num: {}\\\", msg_int);\\n println!(\\\"enc as num: {}\\\", enc);\\n println!(\\\"dec as num: {}\\\", dec);\\n println!(\\\"dec as txt: {}\\\", msg_dec);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object RSA_saket{\\n val d = BigInt(\\\"5617843187844953170308463622230283376298685\\\")\\n val n = BigInt(\\\"9516311845790656153499716760847001433441357\\\")\\n val e = 65537\\n val text = \\\"Rosetta Code\\\"\\n val encode = (msg:BigInt) => pow_mod(msg,e,n)\\n val decode = (msg:BigInt) => pow_mod(msg,d,n)\\n val getmsg = (txt:String) => BigInt(txt.map(x => \\\"%03d\\\".format(x.toInt)).reduceLeft(_+_))\\n def pow_mod(p:BigInt, q:BigInt, n:BigInt):BigInt = {\\n if(q==0) BigInt(1)\\n else if(q==1) p\\n else if(q%2 == 1) pow_mod(p,q-1,n)*p % n\\n else pow_mod(p*p % n,q/2,n)\\n }\\n def gettxt(num:String) = {\\n if(num.size%3==2)\\n (\\\"0\\\" + num).grouped(3).toList.foldLeft(\\\"\\\")(_ + _.toInt.toChar)\\n else\\n num.grouped(3).toList.foldLeft(\\\"\\\")(_ + _.toInt.toChar)\\n }\\n def main(args: Array[String]): Unit = {\\n println(f\\\"Original String \\\\t: \\\"+text)\\n val msg = getmsg(text)\\n println(f\\\"Converted Signal \\\\t: \\\"+msg)\\n val enc_sig = encode(msg)\\n println(\\\"Encoded Signal \\\\t\\\\t: \\\"+ enc_sig)\\n val dec_sig = decode(enc_sig)\\n println(\\\"Decoded String \\\\t\\\\t: \\\"+ dec_sig)\\n val rec_msg = gettxt(dec_sig.toString)\\n println(\\\"Retrieved Signal \\\\t: \\\"+rec_msg)\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"bigint.s7i\\\";\\n include \\\"bytedata.s7i\\\";\\n\\nconst proc: main is func\\n local\\n const string: plainText is \\\"Rosetta Code\\\";\\n # Use a key big enough to hold 16 bytes of plain text in a single block.\\n const bigInteger: modulus is 9516311845790656153499716760847001433441357_;\\n const bigInteger: encode is 65537_;\\n const bigInteger: decode is 5617843187844953170308463622230283376298685_;\\n var bigInteger: plainTextNumber is 0_;\\n var bigInteger: encodedNumber is 0_;\\n var bigInteger: decodedNumber is 0_;\\n var string: decodedText is \\\"\\\";\\n begin\\n writeln(\\\"Plain text: \\\" <& plainText);\\n plainTextNumber := bytes2BigInt(plainText, UNSIGNED, BE);\\n if plainTextNumber >= modulus then\\n writeln(\\\"Plain text message too long\\\");\\n else\\n writeln(\\\"Plain text as a number: \\\" <& plainTextNumber);\\n encodedNumber := modPow(plainTextNumber, encode, modulus);\\n writeln(\\\"Encoded: \\\" <& encodedNumber);\\n decodedNumber := modPow(encodedNumber, decode, modulus);\\n writeln(\\\"Decoded: \\\" <& decodedNumber);\\n decodedText := bytes(decodedNumber, UNSIGNED, BE);\\n writeln(\\\"Decoded number as text: \\\" <& decodedText);\\n end if;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"const n = 9516311845790656153499716760847001433441357\\nconst e = 65537\\nconst d = 5617843187844953170308463622230283376298685\\n\\nmodule Message {\\n var alphabet = [('A' .. 'Z')..., ' ']\\n var rad = alphabet.len\\n var code = Hash(^rad -> map {|i| (alphabet[i], i) }...)\\n func encode(String t) {\\n [code{t.reverse.chars...}] ~Z* t.len.range.map { |i| rad**i } -> sum(0)\\n }\\n func decode(Number n) {\\n ''.join(alphabet[\\n gather {\\n loop {\\n var (d, m) = n.divmod(rad)\\n take(m)\\n break if (n < rad)\\n n = d\\n }\\n }...]\\n ).reverse\\n }\\n}\\n\\nvar secret_message = \\\"ROSETTA CODE\\\"\\nsay \\\"Secret message is #{secret_message}\\\"\\n\\nvar numeric_message = Message::encode(secret_message)\\nsay \\\"Secret message in integer form is #{numeric_message}\\\"\\n\\nvar numeric_cipher = expmod(numeric_message, e, n)\\nsay \\\"After exponentiation with public exponent we get: #{numeric_cipher}\\\"\\n\\nvar text_cipher = Message::decode(numeric_cipher)\\nsay \\\"This turns into the string #{text_cipher}\\\"\\n\\nvar numeric_cipher2 = Message::encode(text_cipher)\\nsay \\\"If we re-encode it in integer form we get #{numeric_cipher2}\\\"\\n\\nvar numeric_message2 = expmod(numeric_cipher2, d, n)\\nsay \\\"After exponentiation with SECRET exponent we get: #{numeric_message2}\\\"\\n\\nvar secret_message2 = Message::decode(numeric_message2)\\nsay \\\"This turns into the string #{secret_message2}\\\"\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"package require Tcl 8.5\\n\\n# This is a straight-forward square-and-multiply implementation that relies on\\n# Tcl 8.5's bignum support (based on LibTomMath) for speed.\\nproc modexp {b expAndMod} {\\n lassign $expAndMod -> e n\\n if {$b >= $n} {puts stderr \\\"WARNING: modulus too small\\\"}\\n for {set r 1} {$e != 0} {set e [expr {$e >> 1}]} {\\n\\tif {$e & 1} {\\n\\t set r [expr {($r * $b) % $n}]\\n\\t}\\n\\tset b [expr {($b ** 2) % $n}]\\n }\\n return $r\\n}\\n\\n# Assumes that messages are shorter than the modulus\\nproc rsa_encrypt {message publicKey} {\\n if {[lindex $publicKey 0] ne \\\"publicKey\\\"} {error \\\"key handling\\\"}\\n set toEnc 0\\n foreach char [split [encoding convertto utf-8 $message] \\\"\\\"] {\\n\\tset toEnc [expr {$toEnc * 256 + [scan $char \\\"%c\\\"]}]\\n }\\n return [modexp $toEnc $publicKey]\\n}\\n\\nproc rsa_decrypt {encrypted privateKey} {\\n if {[lindex $privateKey 0] ne \\\"privateKey\\\"} {error \\\"key handling\\\"}\\n set toDec [modexp $encrypted $privateKey]\\n for {set message \\\"\\\"} {$toDec > 0} {set toDec [expr {$toDec >> 8}]} {\\n\\tappend message [format \\\"%c\\\" [expr {$toDec & 255}]]\\n }\\n return [encoding convertfrom utf-8 [string reverse $message]]\\n}\\n\\n# Assemble packaged public and private keys\\nset e 65537\\nset n 9516311845790656153499716760847001433441357\\nset d 5617843187844953170308463622230283376298685\\nset publicKey [list \\\"publicKey\\\" $e $n]\\nset privateKey [list \\\"privateKey\\\" $d $n]\\n\\n# Test on some input strings\\nforeach input {\\\"Rosetta Code\\\" \\\"UTF-8 \\\\u263a test\\\"} {\\n set enc [rsa_encrypt $input $publicKey]\\n set dec [rsa_decrypt $enc $privateKey]\\n puts \\\"$input -> $enc -> $dec\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"/*import math.big\\nfn main() {\\n //var bb, ptn, etn, dtn big.Int\\n pt := \\\"Rosetta Code\\\"\\n println(\\\"Plain text: $pt\\\")\\n\\n // a key set big enough to hold 16 bytes of plain text in\\n // a single block (to simplify the example) and also big enough\\n // to demonstrate efficiency of modular exponentiation.\\n n := big.integer_from_string(\\\"9516311845790656153499716760847001433441357\\\")?\\n e := big.integer_from_string(\\\"65537\\\")?\\n d := big.integer_from_string(\\\"5617843187844953170308463622230283376298685\\\")?\\n\\n mut ptn := big.zero_int\\n // convert plain text to a number\\n for b in pt.bytes() {\\n bb := big.integer_from_i64(i64(b))\\n ptn = ptn.lshift(8).bitwise_or(bb)\\n }\\n if ptn >= n {\\n println(\\\"Plain text message too long\\\")\\n return\\n }\\n println(\\\"Plain text as a number:$ptn\\\")\\n\\n // encode a single number\\n etn := ptn.big_mod_pow(e,n)\\n println(\\\"Encoded: $etn\\\")\\n\\n // decode a single number\\n mut dtn := etn.big_mod_pow(d,n)\\n println(\\\"Decoded: $dtn\\\")\\n\\n // convert number to text\\n mut db := [16]u8{}\\n mut dx := 16\\n bff := big.integer_from_int(0xff)\\n for dtn.bit_len() > 0 {\\n dx--\\n bb := dtn.bitwise_and(bff)\\n db[dx] = u8(i64(bb.int()))\\n dtn = dtn.rshift(8)\\n println('${db[0..].bytestr()} ${dtn.bit_len()}')\\n }\\n println(\\\"Decoded number as text: ${db[dx..].bytestr()}\\\")\\n}*/\\n\\nimport math.big\\nfn main() {\\n //var bb, ptn, etn, dtn big.Int\\n pt := \\\"Hello World\\\"\\n println(\\\"Plain text: $pt\\\")\\n\\n // a key set big enough to hold 16 bytes of plain text in\\n // a single block (to simplify the example) and also big enough\\n // to demonstrate efficiency of modular exponentiation.\\n n := big.integer_from_string(\\\"9516311845790656153499716760847001433441357\\\")?\\n e := big.integer_from_string(\\\"65537\\\")?\\n d := big.integer_from_string(\\\"5617843187844953170308463622230283376298685\\\")?\\n\\n mut ptn := big.zero_int\\n // convert plain text to a number\\n for b in pt.bytes() {\\n bb := big.integer_from_i64(i64(b))\\n ptn = ptn.lshift(8).bitwise_or(bb)\\n }\\n if ptn >= n {\\n println(\\\"Plain text message too long\\\")\\n return\\n }\\n println(\\\"Plain text as a number:$ptn\\\")\\n\\n // encode a single number\\n etn := ptn.big_mod_pow(e,n)\\n println(\\\"Encoded: $etn\\\")\\n\\n // decode a single number\\n mut dtn := etn.big_mod_pow(d,n)\\n println(\\\"Decoded: $dtn\\\")\\n\\n // convert number to text\\n mut db := [16]u8{}\\n mut dx := 16\\n bff := big.integer_from_int(0xff)\\n for dtn.bit_len() > 0 {\\n dx--\\n bb := dtn.bitwise_and(bff)\\n db[dx] = u8(i64(bb.int()))\\n dtn = dtn.rshift(8)\\n }\\n println(\\\"Decoded number as text: ${db[dx..].bytestr()}\\\")\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Imports System\\nImports System.Numerics\\nImports System.Text\\n\\nModule Module1\\n Sub Main()\\n Dim n As BigInteger = BigInteger.Parse(\\\"9516311845790656153499716760847001433441357\\\")\\n Dim e As BigInteger = 65537\\n Dim d As BigInteger = BigInteger.Parse(\\\"5617843187844953170308463622230283376298685\\\")\\n Dim plainTextStr As String = \\\"Hello, Rosetta!\\\"\\n Dim plainTextBA As Byte() = ASCIIEncoding.ASCII.GetBytes(plainTextStr)\\n Dim pt As BigInteger = New BigInteger(plainTextBA)\\n If pt > n Then Throw New Exception() ' Blocking not implemented\\n Dim ct As BigInteger = BigInteger.ModPow(pt, e, n)\\n Console.WriteLine(\\\" Encoded: \\\" & ct.ToString(\\\"X\\\"))\\n Dim dc As BigInteger = BigInteger.ModPow(ct, d, n)\\n Console.WriteLine(\\\" Decoded: \\\" & dc.ToString(\\\"X\\\"))\\n Dim decoded As String = ASCIIEncoding.ASCII.GetString(dc.ToByteArray())\\n Console.WriteLine(\\\"As ASCII: \\\" & decoded)\\n End Sub\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./big\\\" for BigInt\\n\\nvar pt = \\\"Rosetta Code\\\"\\nSystem.print(\\\"Plain text: : %(pt)\\\")\\nvar n = BigInt.new(\\\"9516311845790656153499716760847001433441357\\\")\\nvar e = BigInt.new(\\\"65537\\\")\\nvar d = BigInt.new(\\\"5617843187844953170308463622230283376298685\\\")\\nvar ptn = BigInt.zero\\n// convert plain text to a number\\nfor (b in pt.bytes) {\\n ptn = (ptn << 8) | BigInt.new(b)\\n}\\nif (ptn >= n) {\\n System.print(\\\"Plain text message too long\\\")\\n return\\n}\\nSystem.print(\\\"Plain text as a number : %(ptn)\\\")\\n\\n// encode a single number\\nvar etn = ptn.modPow(e, n)\\nSystem.print(\\\"Encoded : %(etn)\\\")\\n\\n// decode a single number\\nvar dtn = etn.modPow(d, n)\\nSystem.print(\\\"Decoded : %(dtn)\\\")\\n\\n// convert number to text\\nvar db = List.filled(16, 0)\\nvar dx = 16\\nvar bff = BigInt.new(255)\\nwhile (dtn.bitLength > 0) {\\n dx = dx - 1\\n db[dx] = (dtn & bff).toSmall\\n dtn = dtn >> 8\\n}\\nvar s = \\\"\\\"\\nfor (i in dx..15) s = s + String.fromByte(db[i])\\nSystem.print(\\\"Decoded number as text : %(s)\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"var BN=Import.lib(\\\"zklBigNum\\\");\\n\\nn:=BN(\\\"9516311845790656153499716760847001433441357\\\");\\ne:=BN(\\\"65537\\\");\\nd:=BN(\\\"5617843187844953170308463622230283376298685\\\");\\n\\nconst plaintext=\\\"Rossetta Code\\\";\\npt:=BN(Data(Int,0,plaintext)); // convert string (as stream of bytes) to big int\\nif(pt>n) throw(Exception.ValueError(\\\"Message is too large\\\"));\\n\\nprintln(\\\"Plain text: \\\",plaintext);\\nprintln(\\\"As Int: \\\",pt);\\nct:=pt.powm(e,n); println(\\\"Encoded: \\\",ct);\\npt =ct.powm(d,n); println(\\\"Decoded: \\\",pt);\\ntxt:=pt.toData().text; // convert big int to bytes, treat as string\\nprintln(\\\"As String: \\\",txt);\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"RSA-code"}}},{"rowIdx":1598,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Runge-Kutta_method\n","language":"00-META"},{"code":"Given the example Differential equation:\n:<math>y'(t) = t \\times \\sqrt {y(t)}</math>\nWith initial condition:\n:<math>t_0 = 0</math> and <math>y_0 = y(t_0) = y(0) = 1</math>\nThis equation has an exact solution:\n:<math>y(t) = \\tfrac{1}{16}(t^2 +4)^2</math>\n\n\n;Task\nDemonstrate the commonly used explicit [[wp:Runge–Kutta_methods#Common_fourth-order_Runge.E2.80.93Kutta_method|fourth-order Runge–Kutta method]] to solve the above differential equation.\n* Solve the given differential equation over the range <math>t = 0 \\ldots 10</math> with a step value of <math>\\delta t=0.1</math> (101 total points, the first being given)\n* Print the calculated values of <math>y</math> at whole numbered <math>t</math>'s (<math>0.0, 1.0, \\ldots 10.0</math>) along with error as compared to the exact solution.\n\n\n;Method summary\nStarting with a given <math>y_n</math> and <math>t_n</math> calculate:\n:<math>\\delta y_1 = \\delta t\\times y'(t_n, y_n)\\quad</math>\n:<math>\\delta y_2 = \\delta t\\times y'(t_n + \\tfrac{1}{2}\\delta t , y_n + \\tfrac{1}{2}\\delta y_1)</math>\n:<math>\\delta y_3 = \\delta t\\times y'(t_n + \\tfrac{1}{2}\\delta t , y_n + \\tfrac{1}{2}\\delta y_2)</math>\n:<math>\\delta y_4 = \\delta t\\times y'(t_n + \\delta t , y_n + \\delta y_3)\\quad</math>\nthen:\n:<math>y_{n+1} = y_n + \\tfrac{1}{6} (\\delta y_1 + 2\\delta y_2 + 2\\delta y_3 + \\delta y_4)</math>\n:<math>t_{n+1} = t_n + \\delta t\\quad</math>\n<br><br>\n\n","language":"00-TASK"},{"code":"F rk4(f, x0, y0, x1, n)\n V vx = [0.0] * (n + 1)\n V vy = [0.0] * (n + 1)\n V h = (x1 - x0) / Float(n)\n V x = x0\n V y = y0\n vx[0] = x\n vy[0] = y\n L(i) 1..n\n V k1 = h * f(x, y)\n V k2 = h * f(x + 0.5 * h, y + 0.5 * k1)\n V k3 = h * f(x + 0.5 * h, y + 0.5 * k2)\n V k4 = h * f(x + h, y + k3)\n vx[i] = x = x0 + i * h\n vy[i] = y = y + (k1 + k2 + k2 + k3 + k3 + k4) / 6\n R (vx, vy)\n\nF f(Float x, Float y) -> Float\n R x * sqrt(y)\n\nV (vx, vy) = rk4(f, 0.0, 1.0, 10.0, 100)\nL(x, y) zip(vx, vy)[(0..).step(10)]\n print(‘#2.1 #4.5 #2.8’.format(x, y, y - (4 + x * x) ^ 2 / 16))\n","language":"11l"},{"code":"INCLUDE \"D2:PRINTF.ACT\" ;from the Action! Tool Kit\nINCLUDE \"H6:REALMATH.ACT\"\n\nDEFINE PTR=\"CARD\"\n\nREAL one,two,four,six\n\nPROC Init()\n IntToReal(1,one)\n IntToReal(2,two)\n IntToReal(4,four)\n IntToReal(6,six)\nRETURN\n\nPROC Fun=*(REAL POINTER x,y,res)\n DEFINE JSR=\"$20\"\n DEFINE RTS=\"$60\"\n [JSR $00 $00 ;JSR to address set by SetFun\n RTS]\n\nPROC SetFun(PTR p)\n PTR addr\n\n addr=Fun+1 ;location of address of JSR\n PokeC(addr,p)\nRETURN\n\nPROC Rate(REAL POINTER x,y,res)\n REAL tmp\n\n Sqrt(y,tmp) ;tmp=sqrt(y)\n RealMult(x,tmp,res) ;res=x*sqrt(y)\nRETURN\n\nPROC RK4(PTR f REAL POINTER dx,x,y,res)\n REAL k1,k2,k3,k4,dx2,k12,k22,tmp1,tmp2,tmp3\n\n SetFun(f)\n Fun(x,y,tmp1) ;tmp1=f(x,y)\n RealMult(dx,tmp1,k1) ;k1=dx*f(x,y)\n\n RealDiv(dx,two,dx2) ;dx2=dx/2\n RealDiv(k1,two,k12) ;k12=k1/2\n RealAdd(x,dx2,tmp1) ;tmp1=x+dx/2\n RealAdd(y,k12,tmp2) ;tmp2=y+k1/2\n Fun(tmp1,tmp2,tmp3) ;tmp3=f(x+dx/2,y+k1/2)\n RealMult(dx,tmp3,k2) ;k2=dx*f(x+dx/2,y+k1/2)\n\n RealDiv(k2,two,k22) ;k22=k2/2\n RealAdd(y,k22,tmp2) ;tmp2=y+k2/2\n Fun(tmp1,tmp2,tmp3) ;tmp3=f(x+dx/2,y+k2/2)\n RealMult(dx,tmp3,k3) ;k3=dx*f(x+dx/2,y+k2/2)\n\n RealAdd(x,dx,tmp1) ;tmp1=x+dx\n RealAdd(y,k3,tmp2) ;tmp2=y+k3\n Fun(tmp1,tmp2,tmp3) ;tmp3=f(x+dx,y+k3)\n RealMult(dx,tmp3,k4) ;k4=dx*f(x+dx,y+k3)\n\n RealAdd(k2,k3,tmp1) ;tmp1=k2+k3\n RealMult(two,tmp1,tmp2) ;tmp2=2*k2+2*k3\n RealAdd(k1,tmp2,tmp1) ;tmp3=k1+2*k2+2*k3\n RealAdd(tmp1,k4,tmp2) ;tmp2=k1+2*k2+2*k3+k4\n RealDiv(tmp2,six,tmp1) ;tmp1=(k1+2*k2+2*k3+k4)/6\n RealAdd(y,tmp1,res) ;res=y+(k1+2*k2+2*k3+k4)/6\nRETURN\n\nPROC Calc(REAL POINTER x,res)\n REAL tmp1,tmp2\n\n RealMult(x,x,tmp1) ;tmp1=x*x\n RealDiv(tmp1,four,tmp2) ;tmp2=x*x/4\n RealAdd(tmp2,one,tmp1) ;tmp1=x*x/4+1\n Power(tmp1,two,res) ;res=(x*x/4+1)^2\nRETURN\n\nPROC RelError(REAL POINTER a,b,res)\n REAL tmp\n\n RealDiv(a,b,tmp) ;tmp=a/b\n RealSub(tmp,one,res) ;res=a/b-1\nRETURN\n\nPROC Main()\n REAL x0,x1,x,dx,y,y2,err,tmp1,tmp2\n CHAR ARRAY s(20)\n INT i,n\n\n Put(125) PutE() ;clear the screen\n MathInit()\n Init()\n PrintF(\"%-2S %-11S %-8S%E\",\"x\",\"y\",\"rel err\")\n\n IntToReal(0,x0)\n IntToReal(10,x1)\n ValR(\"0.1\",dx)\n\n RealSub(x1,x0,tmp1) ;tmp1=x1-x0\n RealDiv(tmp1,dx,tmp2) ;tmp2=(x1-x0)/dx\n n=RealToInt(tmp2) ;n=(x1-x0)/dx\n i=0\n IntToReal(1,y)\n DO\n IntToReal(i,tmp1) ;tmp1=i\n RealMult(dx,tmp1,tmp2) ;tmp2=i*dx\n RealAdd(x0,tmp2,x) ;x=x0+i*dx\n\n IF i MOD 10=0 THEN\n Calc(x,y2)\n RelError(y,y2,err)\n StrR(x,s) PrintF(\"%-2S \",s)\n StrR(y,s) PrintF(\"%-11S \",s)\n StrR(err,s) PrintF(\"%-8S%E\",s)\n FI\n\n i==+1\n IF i>n THEN EXIT FI\n\n RK4(rate,dx,x,y,tmp1) ;tmp1=rk4(rate,dx,x0+dx*(i-1),y)\n RealAssign(tmp1,y) ;y=rk4(rate,dx,x0+dx*(i-1),y)\n OD\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\nwith Ada.Numerics.Generic_Elementary_Functions;\nprocedure RungeKutta is\n type Floaty is digits 15;\n type Floaty_Array is array (Natural range <>) of Floaty;\n package FIO is new Ada.Text_IO.Float_IO(Floaty); use FIO;\n type Derivative is access function(t, y : Floaty) return Floaty;\n package Math is new Ada.Numerics.Generic_Elementary_Functions (Floaty);\n function calc_err (t, calc : Floaty) return Floaty;\n\n procedure Runge (yp_func : Derivative; t, y : in out Floaty_Array;\n dt : Floaty) is\n dy1, dy2, dy3, dy4 : Floaty;\n begin\n for n in t'First .. t'Last-1 loop\n dy1 := dt * yp_func(t(n), y(n));\n dy2 := dt * yp_func(t(n) + dt / 2.0, y(n) + dy1 / 2.0);\n dy3 := dt * yp_func(t(n) + dt / 2.0, y(n) + dy2 / 2.0);\n dy4 := dt * yp_func(t(n) + dt, y(n) + dy3);\n t(n+1) := t(n) + dt;\n y(n+1) := y(n) + (dy1 + 2.0 * (dy2 + dy3) + dy4) / 6.0;\n end loop;\n end Runge;\n\n procedure Print (t, y : Floaty_Array; modnum : Positive) is begin\n for i in t'Range loop\n if i mod modnum = 0 then\n Put(\"y(\"); Put (t(i), Exp=>0, Fore=>0, Aft=>1);\n Put(\") = \"); Put (y(i), Exp=>0, Fore=>0, Aft=>8);\n Put(\" Error:\"); Put (calc_err(t(i),y(i)), Aft=>5);\n New_Line;\n end if;\n end loop;\n end Print;\n\n function yprime (t, y : Floaty) return Floaty is begin\n return t * Math.Sqrt (y);\n end yprime;\n function calc_err (t, calc : Floaty) return Floaty is\n actual : constant Floaty := (t**2 + 4.0)**2 / 16.0;\n begin return abs(actual-calc);\n end calc_err;\n\n dt : constant Floaty := 0.10;\n N : constant Positive := 100;\n t_arr, y_arr : Floaty_Array(0 .. N);\nbegin\n t_arr(0) := 0.0;\n y_arr(0) := 1.0;\n Runge (yprime'Access, t_arr, y_arr, dt);\n Print (t_arr, y_arr, 10);\nend RungeKutta;\n","language":"Ada"},{"code":"BEGIN\n PROC rk4 = (PROC (REAL, REAL) REAL f, REAL y, x, dx) REAL :\n BEGIN CO Fourth-order Runge-Kutta method CO\n REAL dy1 = dx * f(x, y);\n REAL dy2 = dx * f(x + dx / 2.0, y + dy1 / 2.0);\n REAL dy3 = dx * f(x + dx / 2.0, y + dy2 / 2.0);\n REAL dy4 = dx * f(x + dx, y + dy3);\n y + (dy1 + 2.0 * dy2 + 2.0 * dy3 + dy4) / 6.0\n END;\n REAL x0 = 0, x1 = 10, y0 = 1.0;\t\t\tCO Boundary conditions. CO\n REAL dx = 0.1;\t\t\t\t\tCO Step size. CO\n INT num points = ENTIER ((x1 - x0) / dx + 0.5);\tCO Add 0.5 for rounding errors. CO\n [0:num points]REAL y; y[0] := y0;\t\t\tCO Grid and starting point.CO\n PROC dy by dx = (REAL x, y) REAL : x * sqrt(y);\tCO Differential equation. CO\n FOR i TO num points\n DO\n y[i] := rk4 (dy by dx, y[i-1], x0 + dx * (i - 1), dx)\n OD;\n print ((\" x true y calc y relative error\", newline));\n FOR i FROM 0 BY 10 TO num points\n DO\n REAL x = x0 + dx * i;\n REAL true y = (x * x + 4.0) ^ 2 / 16.0;\n printf (($3(-zzd.7dxxx), -d.4de-ddl$, x, true y, y[i], y[i] / true y - 1.0))\n OD\nEND\n","language":"ALGOL-68"},{"code":"begin\n real procedure rk4 ( real procedure f ; real value y, x, dx ) ;\n begin % Fourth-order Runge-Kutta method %\n real dy1, dy2, dy3, dy4;\n dy1 := dx * f(x, y);\n dy2 := dx * f(x + dx / 2.0, y + dy1 / 2.0);\n dy3 := dx * f(x + dx / 2.0, y + dy2 / 2.0);\n dy4 := dx * f(x + dx, y + dy3);\n y + (dy1 + 2.0 * dy2 + 2.0 * dy3 + dy4) / 6.0\n end rk4;\n real x0, x1, y0, dx;\n integer numPoints;\n x0 := 0; x1 := 10; y0 := 1.0; % Boundary conditions. %\n dx := 0.1; % Step size. %\n numPoints := entier ((x1 - x0) / dx + 0.5); % Add 0.5 for rounding errors. %\n begin\n real procedure dyByDx ( real value x, y ) ; x * sqrt(y); % Differential equation. %\n real array y ( 0 :: numPoints); y(0) := y0; % Grid and starting point. %\n for i := 1 until numPoints do y(i) := rk4 (dyByDx, y(i-1), x0 + dx * (i - 1), dx);\n write( \" x true y calc y relative error\" );\n for i := 0 step 10 until numPoints do begin\n real x, trueY;\n x := x0 + dx * i;\n trueY := (x * x + 4.0) ** 2 / 16.0;\n write( r_format := \"A\", r_w := 12, r_d := 7, s_w := 3, x, trueY, y( i )\n , r_format := \"S\", r_w := 12, y( i ) / trueY - 1\n )\n end for_i\n end\nend.\n","language":"ALGOL-W"},{"code":" ∇RK4[⎕]∇\n ∇\n[0] Z←R(Y¯ RK4)Y;T;YN;TN;∆T;∆Y1;∆Y2;∆Y3;∆Y4\n[1] (T R ∆T)←R\n[2] LOOP:→(R≤TN←¯1↑T)/EXIT\n[3] ∆Y1←∆T×TN Y¯ YN←¯1↑Y\n[4] ∆Y2←∆T×(TN+∆T÷2)Y¯ YN+∆Y1÷2\n[5] ∆Y3←∆T×(TN+∆T÷2)Y¯ YN+∆Y2÷2\n[6] ∆Y4←∆T×(TN+∆T)Y¯ YN+∆Y3\n[7] Y←Y,YN+(∆Y1+(2×∆Y2)+(2×∆Y3)+∆Y4)÷6\n[8] T←T,TN+∆T\n[9] →LOOP\n[10] EXIT:Z←T,[⎕IO+.5]Y\n ∇\n\n ∇PRINT[⎕]∇\n ∇\n[0] PRINT;TABLE\n[1] TABLE←0 10 .1({⍺×⍵*.5}RK4)1\n[2] ⎕←'T' 'RK4 Y' 'ERROR'⍪TABLE,TABLE[;2]-{((4+⍵*2)*2)÷16}TABLE[;1]\n ∇\n","language":"APL"},{"code":"# syntax: GAWK -f RUNGE-KUTTA_METHOD.AWK\n# converted from BBC BASIC\nBEGIN {\n print(\" t y error\")\n y = 1\n for (i=0; i<=100; i++) {\n t = i / 10\n if (t == int(t)) {\n actual = ((t^2+4)^2) / 16\n printf(\"%2d %12.7f %g\\n\",t,y,actual-y)\n }\n k1 = t * sqrt(y)\n k2 = (t + 0.05) * sqrt(y + 0.05 * k1)\n k3 = (t + 0.05) * sqrt(y + 0.05 * k2)\n k4 = (t + 0.10) * sqrt(y + 0.10 * k3)\n y += 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\n }\n exit(0)\n}\n","language":"AWK"},{"code":"y = 1\nfor i = 0 to 100\n t = i / 10\n\n if t = int(t) then\n\tactual = ((t ^ 2 + 4) ^ 2) / 16\n\tprint \"y(\"; int(t); \") = \"; left(string(y), 13), \"Error = \"; left(string(actual - y), 13)\n end if\n\n k1 = t * sqr(y)\n k2 = (t + 0.05) * sqr(y + 0.05 * k1)\n k3 = (t + 0.05) * sqr(y + 0.05 * k2)\n k4 = (t + 0.10) * sqr(y + 0.10 * k3)\n y = y + 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\nnext i\nend\n","language":"BASIC256"},{"code":" y = 1.0\n FOR i% = 0 TO 100\n t = i% / 10\n\n IF t = INT(t) THEN\n actual = ((t^2 + 4)^2) / 16\n PRINT \"y(\"; t \") = \"; y TAB(20) \"Error = \"; actual - y\n ENDIF\n\n k1 = t * SQR(y)\n k2 = (t + 0.05) * SQR(y + 0.05 * k1)\n k3 = (t + 0.05) * SQR(y + 0.05 * k2)\n k4 = (t + 0.10) * SQR(y + 0.10 * k3)\n y += 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\n NEXT i%\n","language":"BBC-BASIC"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\ndouble rk4(double(*f)(double, double), double dx, double x, double y)\n{\n\tdouble\tk1 = dx * f(x, y),\n\t\tk2 = dx * f(x + dx / 2, y + k1 / 2),\n\t\tk3 = dx * f(x + dx / 2, y + k2 / 2),\n\t\tk4 = dx * f(x + dx, y + k3);\n\treturn y + (k1 + 2 * k2 + 2 * k3 + k4) / 6;\n}\n\ndouble rate(double x, double y)\n{\n\treturn x * sqrt(y);\n}\n\nint main(void)\n{\n\tdouble *y, x, y2;\n\tdouble x0 = 0, x1 = 10, dx = .1;\n\tint i, n = 1 + (x1 - x0)/dx;\n\ty = (double *)malloc(sizeof(double) * n);\n\n\tfor (y[0] = 1, i = 1; i < n; i++)\n\t\ty[i] = rk4(rate, dx, x0 + dx * (i - 1), y[i-1]);\n\n\tprintf(\"x\\ty\\trel. err.\\n------------\\n\");\n\tfor (i = 0; i < n; i += 10) {\n\t\tx = x0 + dx * i;\n\t\ty2 = pow(x * x / 4 + 1, 2);\n\t\tprintf(\"%g\\t%g\\t%g\\n\", x, y[i], y[i]/y2 - 1);\n\t}\n\n\treturn 0;\n}\n","language":"C"},{"code":"/*\n * compiled with:\n * g++ (Debian 8.3.0-6) 8.3.0\n *\n * g++ -std=c++14 -o rk4 %\n *\n */\n# include <iostream>\n# include <math.h>\n\nauto rk4(double f(double, double))\n{\n return [f](double t, double y, double dt) -> double {\n double dy1 { dt * f( t , y ) },\n dy2 { dt * f( t+dt/2, y+dy1/2 ) },\n dy3 { dt * f( t+dt/2, y+dy2/2 ) },\n dy4 { dt * f( t+dt , y+dy3 ) };\n return ( dy1 + 2*dy2 + 2*dy3 + dy4 ) / 6;\n };\n}\n\nint main(void)\n{\n constexpr\n double TIME_MAXIMUM { 10.0 },\n T_START { 0.0 },\n Y_START { 1.0 },\n DT { 0.1 },\n WHOLE_TOLERANCE { 1e-12 };\n\n auto dy = rk4( [](double t, double y) -> double { return t*sqrt(y); } ) ;\n\n for (\n auto y { Y_START }, t { T_START };\n t <= TIME_MAXIMUM;\n y += dy(t,y,DT), t += DT\n )\n if (ceilf(t)-t < WHOLE_TOLERANCE)\n printf(\"y(%4.1f)\\t=%12.6f \\t error: %12.6e\\n\", t, y, std::fabs(y - pow(t*t+4,2)/16));\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\n\nnamespace RungeKutta\n{\n class Program\n {\n static void Main(string[] args)\n {\n //Incrementers to pass into the known solution\n double t = 0.0;\n double T = 10.0;\n double dt = 0.1;\n\n // Assign the number of elements needed for the arrays\n int n = (int)(((T - t) / dt)) + 1;\n\n // Initialize the arrays for the time index 's' and estimates 'y' at each index 'i'\n double[] y = new double[n];\n double[] s = new double[n];\n\n // RK4 Variables\n double dy1;\n double dy2;\n double dy3;\n double dy4;\n\n // RK4 Initializations\n int i = 0;\n s[i] = 0.0;\n y[i] = 1.0;\n\n Console.WriteLine(\" ===================================== \");\n Console.WriteLine(\" Beging 4th Order Runge Kutta Method \");\n Console.WriteLine(\" ===================================== \");\n\n Console.WriteLine();\n Console.WriteLine(\" Given the example Differential equation: \\n\");\n Console.WriteLine(\" y' = t*sqrt(y) \\n\");\n Console.WriteLine(\" With the initial conditions: \\n\");\n Console.WriteLine(\" t0 = 0\" + \", y(0) = 1.0 \\n\");\n Console.WriteLine(\" Whose exact solution is known to be: \\n\");\n Console.WriteLine(\" y(t) = 1/16*(t^2 + 4)^2 \\n\");\n Console.WriteLine(\" Solve the given equations over the range t = 0...10 with a step value dt = 0.1 \\n\");\n Console.WriteLine(\" Print the calculated values of y at whole numbered t's (0.0,1.0,...10.0) along with the error \\n\");\n Console.WriteLine();\n\n Console.WriteLine(\" y(t) \" +\"RK4\" + \" \".PadRight(18) + \"Absolute Error\");\n Console.WriteLine(\" -------------------------------------------------\");\n Console.WriteLine(\" y(0) \" + y[i] + \" \".PadRight(20) + (y[i] - solution(s[i])));\n\n // Iterate and implement the Rk4 Algorithm\n while (i < y.Length - 1)\n {\n\n dy1 = dt * equation(s[i], y[i]);\n dy2 = dt * equation(s[i] + dt / 2, y[i] + dy1 / 2);\n dy3 = dt * equation(s[i] + dt / 2, y[i] + dy2 / 2);\n dy4 = dt * equation(s[i] + dt, y[i] + dy3);\n\n s[i + 1] = s[i] + dt;\n y[i + 1] = y[i] + (dy1 + 2 * dy2 + 2 * dy3 + dy4) / 6;\n\n double error = Math.Abs(y[i + 1] - solution(s[i + 1]));\n double t_rounded = Math.Round(t + dt, 2);\n\n if (t_rounded % 1 == 0)\n {\n Console.WriteLine(\" y(\" + t_rounded + \")\" + \" \" + y[i + 1] + \" \".PadRight(5) + (error));\n }\n\n i++;\n t += dt;\n\n };//End Rk4\n\n Console.ReadLine();\n }\n\n // Differential Equation\n public static double equation(double t, double y)\n {\n double y_prime;\n return y_prime = t*Math.Sqrt(y);\n }\n\n // Exact Solution\n public static double solution(double t)\n {\n double actual;\n actual = Math.Pow((Math.Pow(t, 2) + 4), 2)/16;\n return actual;\n }\n }\n}\n","language":"C-sharp"},{"code":"(defun runge-kutta (f x y x-end n)\n (let ((h (float (/ (- x-end x) n) 1d0))\n k1 k2 k3 k4)\n (setf x (float x 1d0)\n y (float y 1d0))\n (cons (cons x y)\n (loop for i below n do\n (setf k1 (* h (funcall f x y))\n k2 (* h (funcall f (+ x (* 0.5d0 h)) (+ y (* 0.5d0 k1))))\n k3 (* h (funcall f (+ x (* 0.5d0 h)) (+ y (* 0.5d0 k2))))\n k4 (* h (funcall f (+ x h) (+ y k3)))\n x (+ x h)\n y (+ y (/ (+ k1 k2 k2 k3 k3 k4) 6)))\n collect (cons x y)))))\n\n(let ((sol (runge-kutta (lambda (x y) (* x (sqrt y))) 0 1 10 100)))\n (loop for n from 0\n for (x . y) in sol\n when (zerop (mod n 10))\n collect (list x y (- y (/ (expt (+ 4 (* x x)) 2) 16)))))\n\n((0.0d0 1.0d0 0.0d0)\n (0.9999999999999999d0 1.562499854278108d0 -1.4572189210859676d-7)\n (2.0000000000000004d0 3.9999990805207988d0 -9.194792029987298d-7)\n (3.0000000000000013d0 10.562497090437557d0 -2.9095624576314094d-6)\n (4.000000000000002d0 24.999993765090643d0 -6.234909392333066d-6)\n (4.999999999999998d0 52.56248918030259d0 -1.081969734428867d-5)\n (5.999999999999995d0 99.9999834054036d0 -1.659459609015812d-5)\n (6.999999999999991d0 175.56247648227117d0 -2.3517728038768837d-5)\n (7.999999999999988d0 288.9999684347983d0 -3.156520000402452d-5)\n (8.999999999999984d0 451.56245927683887d0 -4.072315812209126d-5)\n (9.99999999999998d0 675.9999490167083d0 -5.0983286655537086d-5))\n","language":"Common-Lisp"},{"code":"y, t = 1, 0\nwhile t <= 10\n k1\t= t * Math.sqrt(y)\n k2\t= (t + 0.05) * Math.sqrt(y + 0.05 * k1)\n k3\t= (t + 0.05) * Math.sqrt(y + 0.05 * k2)\n k4\t= (t + 0.1) * Math.sqrt(y + 0.1 * k3)\n\n printf(\"y(%4.1f)\\t= %12.6f \\t error: %12.6e\\n\", t, y, (((t**2 + 4)**2 / 16) - y )) if (t.round - t).abs < 1.0e-5\n y += 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\n t += 0.1\nend\n","language":"Crystal"},{"code":"import std.stdio, std.math, std.typecons;\n\nalias FP = real;\nalias FPs = Typedef!(FP[101]);\n\nvoid runge(in FP function(in FP, in FP)\n pure nothrow @safe @nogc yp_func,\n ref FPs t, ref FPs y, in FP dt) pure nothrow @safe @nogc {\n foreach (immutable n; 0 .. t.length - 1) {\n immutable FP\n dy1 = dt * yp_func(t[n], y[n]),\n dy2 = dt * yp_func(t[n] + dt / 2.0, y[n] + dy1 / 2.0),\n dy3 = dt * yp_func(t[n] + dt / 2.0, y[n] + dy2 / 2.0),\n dy4 = dt * yp_func(t[n] + dt, y[n] + dy3);\n t[n + 1] = t[n] + dt;\n y[n + 1] = y[n] + (dy1 + 2.0 * (dy2 + dy3) + dy4) / 6.0;\n }\n}\n\nFP calc_err(in FP t, in FP calc) pure nothrow @safe @nogc {\n immutable FP actual = (t ^^ 2 + 4.0) ^^ 2 / 16.0;\n return abs(actual - calc);\n}\n\nvoid main() {\n enum FP dt = 0.10;\n FPs t_arr, y_arr;\n\n t_arr[0] = 0.0;\n y_arr[0] = 1.0;\n runge((t, y) => t * y.sqrt, t_arr, y_arr, dt);\n\n foreach (immutable i; 0 .. t_arr.length)\n if (i % 10 == 0)\n writefln(\"y(%.1f) = %.8f Error: %.6g\",\n t_arr[i], y_arr[i],\n calc_err(t_arr[i], y_arr[i]));\n}\n","language":"D"},{"code":"import 'dart:math' as Math;\n\nnum RungeKutta4(Function f, num t, num y, num dt){\n num k1 = dt * f(t,y);\n num k2 = dt * f(t+0.5*dt, y + 0.5*k1);\n num k3 = dt * f(t+0.5*dt, y + 0.5*k2);\n num k4 = dt * f(t + dt, y + k3);\n return y + (1/6) * (k1 + 2*k2 + 2*k3 + k4);\n}\n\nvoid main(){\n num t = 0;\n num dt = 0.1;\n num tf = 10;\n num totalPoints = ((tf-t)/dt).floor()+1;\n num y = 1;\n Function f = (num t, num y) => t * Math.sqrt(y);\n Function actual = (num t) => (1/16) * (t*t+4)*(t*t+4);\n for (num i = 0; i <= totalPoints; i++){\n num relativeError = (actual(t) - y)/actual(t);\n if (i%10 == 0){\n print('y(${t.round().toStringAsPrecision(3)}) = ${y.toStringAsPrecision(11)} Error = ${relativeError.toStringAsPrecision(11)}');\n }\n y = RungeKutta4(f, t, y, dt);\n t += dt;\n }\n}\n","language":"Dart"},{"code":"numfmt 6 0\ny = 1\nfor i = 0 to 100\n t = i / 10\n if t = floor t\n h = t * t + 4\n actual = h * h / 16\n print \"y(\" & t & \") = \" & y & \" Error = \" & actual - y\n .\n k1 = t * sqrt y\n k2 = (t + 0.05) * sqrt (y + 0.05 * k1)\n k3 = (t + 0.05) * sqrt (y + 0.05 * k2)\n k4 = (t + 0.10) * sqrt (y + 0.10 * k3)\n y += 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\n.\n","language":"EasyLang"},{"code":" [Demo of EDSAC library subroutine G1: Runge-Kutta solution of differential equations.\n Full description is in Wilkes, Wheeler & Gill, 1951 edn, pages 32-34, 86-87, 132-134.\n\n Before using G1, we need to fix n, m, a, b, c, d, as defined in WWG pages 86-87:\n n = number of equations (2 for the Rosetta Code example).\n 2^m = multiplier for the hy', as large as possible without causing numeric overflow;\n with the scaling chosen here, m = 5.\n Variables y are stored in n consecutive long locations, the last of which is aD.\n Scaled derivatives (2^m)hy' in n consecutive long locations, the last of which is bD.\n G1 uses working variables in n consecutive long locations, the last of which is cD.\n d = address of user-supplied auxiliary subroutine, which calculates the (2^m)hy'.\n\n For convenience, keep G1 and its storage together. Start at (say) 400 and place:\n variables y at 400D, 402D;\n scaled derivatives at 404D, 406D;\n workspace for G1 at 408D, 410D;\n G1 itself at 412.\n If the base address is placed in location 51 at load time, all the above\n addresses can be accessed via the G parameter:]\n T 51 K\n P 400 F\n [Now set up the 6 preset parameters specified in WWG:]\n T 45 K\n P 2#G [H parameter: P a D]\n P 4 F [N parameter: P 2n F]\n P 4 F [M parameter: P (b-a) F, or V (2048-a+b) F if a > b]\n P 4 F [& parameter: P (c-b) F, or V (2048-b+c) F if b > c]\n P 8 F [L parameter: P 2^(m-2) F]\n P 300 F [X parameter: P d F]\n [For other addresses in the program we can optionally use some more parameters:]\n T 52 K\n P 120 F [A parameter: main routine]\n P 56 F [B parameter: print subroutine P1 from EDSAC library]\n P 350 F [C parameter: constants for Rosetta code example]\n P 78 F [V parameter: square root subroutine]\n\n [Library subroutine to read constants; runs at load time and is then overwritten.\n R5, for decimal fractions, seems to be unavailable (lost?), so the values are\n here read in as 35-bit integers (i.e. times 2^34) by R2.\n Values are: 0.001, initial value of y\n (2^23)/(10^7) and 25/(2^10) for use in calculations\n 0.5/(10^9) for rounding to 9 d.p. (print routine P1 doesn't do this)]\n GKT20FVDL8FA40DUDTFI40FA40FS39FG@S2FG23FA5@T5@E4@E13Z\n T#C\n 17179869F14411518808F419430400F9#\n TZ\n\n [Library subroutine M3; prints header at load time and is then overwritten.]\n PFGKIFAFRDLFUFOFE@A6FG@E8FEZPF\n *SCALED!FOR!EDSAC@&!!TIME!!!!!!!!!Y!VIA!RK!!!!!Y!DIRECT@&\n ....PK [end text with some blank tape]\n\n [Runge-Kutta: auxiliary subroutine to calculate (2^m)*h*(dy1/dt) and (2^m)*h*(dy2/dt)\n from y1, y2, where y1 is the function y in Rosetta Code (but scaled) and y2 = t.\n For the Rosetta code example we're using m = 5, h = 2^(-7)]\n E25K TX GK\n A3F T20@ [set up return as usual]\n H2#G V2#G TD [acc := t^2, temp store in 0D]\n H#G VD LD YF TD [y1 times t^2, shift left, round, temp store in 0D]\n H2#C VD YF T4D [times (2^23)/(10^7), round, to 4D for square root]\n [14] A14@ GV A4D T4#G [call square root, result in 4D, copy to (2^m)hy']\n A21@ T6#G [1/4, i.e. (2^m)h with m and h as above, to (2^m)ht']\n [20] ZF [overwritten by jump back to caller]\n [21] RF [constant 1/4]\n\n [Main routine, with two subroutines in the same address block as the main routine.]\n E25K TA GK\n [0] #F [figures shift on teleprinter]\n [1] MF [decimal point (in figures mode)]\n [2] !F @F &F [space, carriage return, line feed,]\n [5] K4096F [null char]\n [6] P100F [constant: nr of Runge-Kutta steps (in address field)]\n [7] PF [negative count of Runge-Kutta steps]\n [8] P10F [constant: number of steps between printed values]\n [9] PF [negative count of steps between printed values]\n [Enter with acc = 0]\n [10] O@ [set teleprinter to figures]\n S6@ T7@ [init negative count of R-K steps]\n S8@ T9@ [init negative count of print steps]\n [Before using library subroutine G1, clear its working registers (WWG page 33)]\n T8#G T10#G\n [Set up initial values of y1 and y2 (where y2 = t)]\n A#C T#G [load 0.001 from constants section, store in y1]\n T2#G [y2 = t = 0]\n [20] A20@ G40@ [call subroutine to print initial values]\n [Loop round Runge-Kutta steps]\n [22] TF A23@ G12G [clear accumulator, call G1 for Runge-Kutta step]\n A9@ A2F U9@ [update negative print count]\n G33@ [skip printing if not reached 0]\n S8@ T9@ [reset negative print count]\n A31@ G40@ [call subroutine to print values]\n [33] TF [clear accumulator]\n A7@ A2F U7@ [increment negative count of Runge-Kutta steps]\n G22@ [loop till count = 0]\n O5@ ZF [flush teleprinter buffer; stop]\n\n [Subroutine to print y1 as calculated (1) by Runge-Kutta (2) direct from formula]\n [40] A3F T71@ [set up return as usual]\n A2#G TD [latest t (= y2) from Runge-Kutta, to 0D for printing]\n [44] A44@ G72@ [call subroutine to print t]\n O2@ O2@ [followed by 2 spaces]\n A#G TD [latest y1 from Runge-Kutta, to 0D for printing]\n [50] A50@ G72@ [call subroutine to print y1]\n O2@ O2@ [followed by 2 spaces]\n A 4#C [load constant 25/(2^10)]\n H2#G V2#G TD [add t^2, temp store result in 0D]\n HD VD LD YF TD [square, shift 1 left, round, result to 0D]\n H2#C VD YF TD [times (2^23)/(10^7), round, to 0D for printing]\n [67] A67@ G72@ [call subroutine to print y]\n O3@ O4@ [print CR, LF]\n [71] ZF [overwritten by jump back to caller]\n\n [Second-level subroutine to print number in 0D to 9 decimal places]\n [72] A3F T82@ [set up return as usual]\n AD A6#C TD [load number, add decimal rounding, to 0D for printing]\n O81@ O1@ [print '0.' since P1 doesn't do so]\n A79@ GB [call library subroutine P1 for printing]\n [81] P9F [parameter for P1, 9 decimals]\n [82] ZF [overwritten by jump back to caller]\n\n [Library subroutine G1 for Runge-Kutta process. 66 locations, even address.]\n E25K T12G\n GKT4#ZH682DT6#ZPNT12#Z!1405DT14#ZTHT16#ZT2HTZA3FT61@A31@G63@&FT6ZPN\n T8ZMMO&H4@A20@E23@T14ZAHT16ZA2HT18ZH12#@S12#@T12#@E28@H4#@T4DUFS38@\n A25@T38@S6#@A16#@U46#@A8@U37@A9@U55@A24@T39@ZFR1057#@ZFYFU6DV6DRLYF\n UDZFZFADLDADLLS6DN4DYFZFA46#@S14#@G29@A65@S11@ZFA35@U65@GXZF\n\n [Replacement for library routine S2 (square root). 38 locations, even address.\n Advantages: More accurate for small values of the argument.\n Calculates sqrt(0) without going into an infinite loop.\n Disadvantages: Longer and slower than S2 (calculates one bit at a time).]\n E25K TV\n GKA3FT31@A4DG32@A33@T36#@T4DA33@RDU34#@RDS4DS33@A36#@G22@T36#@A4DS34#@\n T4DA36#@A33@G25@TFA36#@S33@A36#@T36#@A34#@RDYFG9@ZFZFK4096FPFPFPFPF\n\n [Library subroutine P1 - print a single positive number. 21 locations.\n Prints number in 0D to n places of decimals, where\n n is specified by 'P n F' pseudo-order after subroutine call.]\n E25K TB\n GKA18@U17@S20@T5@H19@PFT5@VDUFOFFFSFL4FTDA5@A2FG6@EFU3FJFM1F\n\n [Define entry point in main routine]\n E25K TA GK\n E10Z PF [enter at relative address 10 with accumulator = 0]\n","language":"EDSAC-order-code"},{"code":"PROGRAM RUNGE_KUTTA\n\nCONST DELTA_T=0.1\n\nFUNCTION Y1(T,Y)\n Y1=T*SQR(Y)\nEND FUNCTION\n\nBEGIN\n Y=1.0\n FOR I%=0 TO 100 DO\n T=I%*DELTA_T\n\n IF T=INT(T) THEN ! print every tenth\n ACTUAL=((T^2+4)^2)/16 ! exact solution\n PRINT(\"Y(\";T;\")=\";Y;TAB(20);\"Error=\";ACTUAL-Y)\n END IF\n\n K1=Y1(T,Y)\n K2=Y1(T+DELTA_T/2,Y+DELTA_T/2*K1)\n K3=Y1(T+DELTA_T/2,Y+DELTA_T/2*K2)\n K4=Y1(T+DELTA_T,Y+DELTA_T*K3)\n Y+=DELTA_T*(K1+2*(K2+K3)+K4)/6\n END FOR\nEND PROGRAM\n","language":"ERRE"},{"code":"//Worksheet formula to manage looping\n\n=LET(\n T₊, SEQUENCE(11, 1, 0, 1),\n T, DROP(T₊, -1),\n τ, SEQUENCE(1 / δt, 1, 0, δt),\n calculated, SCAN(1, T, LAMBDA(y₀, t, REDUCE(y₀, t + τ, RungaKutta4λ(Dλ)))),\n calcs, VSTACK(1, calculated),\n exact, f(T₊),\n HSTACK(T₊, calcs, exact, (exact - calcs) / exact)\n)\n\n//Lambda function passed to RungaKutta4λ to evaluate derivatives\n\nDλ(y,t)\n= LAMBDA(y,t, t * SQRT(y))\n\n//Curried Lambda function with derivative function D and y, t as parameters\n\nRungaKutta4λ(Dλ)\n= LAMBDA(D,\n LAMBDA(yᵣ, tᵣ,\n LET(\n δy₁, δt * D(yᵣ, tᵣ),\n δy₂, δt * D(yᵣ + δy₁ / 2, tᵣ + δt / 2),\n δy₃, δt * D(yᵣ + δy₂ / 2, tᵣ + δt / 2),\n δy₄, δt * D(yᵣ + δy₃, tᵣ + δt),\n yᵣ₊₁, yᵣ + (δy₁ + 2 * δy₂ + 2 * δy₃ + δy₄) / 6,\n yᵣ₊₁\n )\n )\n )\n\n//Lambda function returning the exact solution\n\nf(t)\n= LAMBDA(t, (1/16) * (t^2 + 4)^2 )\n","language":"Excel"},{"code":"open System\n\nlet y'(t,y) = t * sqrt(y)\n\nlet RungeKutta4 t0 y0 t_max dt =\n\n let dy1(t,y) = dt * y'(t,y)\n let dy2(t,y) = dt * y'(t+dt/2.0, y+dy1(t,y)/2.0)\n let dy3(t,y) = dt * y'(t+dt/2.0, y+dy2(t,y)/2.0)\n let dy4(t,y) = dt * y'(t+dt, y+dy3(t,y))\n\n (t0,y0) |> Seq.unfold (fun (t,y) ->\n if ( t <= t_max) then Some((t,y), (Math.Round(t+dt, 6), y + ( dy1(t,y) + 2.0*dy2(t,y) + 2.0*dy3(t,y) + dy4(t,y))/6.0))\n else None\n )\n\nlet y_exact t = (pown (pown t 2 + 4.0) 2)/16.0\n\nRungeKutta4 0.0 1.0 10.0 0.1\n |> Seq.filter (fun (t,y) -> t % 1.0 = 0.0 )\n |> Seq.iter (fun (t,y) -> Console.WriteLine(\"y({0})={1}\\t(relative error:{2})\", t, y, (y / y_exact(t))-1.0) )\n","language":"F-Sharp"},{"code":"program rungekutta\n implicit none\n integer, parameter :: dp = kind(1d0)\n real(dp) :: t, dt, tstart, tstop\n real(dp) :: y, k1, k2, k3, k4\n\n tstart = 0.0d0\n tstop = 10.0d0\n dt = 0.1d0\n y = 1.0d0\n t = tstart\n write (6, '(a,f4.1,a,f12.8,a,es13.6)') 'y(', t, ') = ', y, ' error = ', &\n abs(y-(t**2+4)**2/16)\n do while (t < tstop)\n k1 = dt*f(t, y)\n k2 = dt*f(t+dt/2, y+k1/2)\n k3 = dt*f(t+dt/2, y+k2/2)\n k4 = dt*f(t+dt, y+k3)\n y = y+(k1+2*(k2+k3)+k4)/6\n t = t+dt\n if (abs(nint(t)-t) <= 1d-12) then\n write (6, '(a,f4.1,a,f12.8,a,es13.6)') 'y(', t, ') = ', y, ' error = ', &\n abs(y-(t**2+4)**2/16)\n end if\n end do\ncontains\n function f(t,y)\n real(dp), intent(in) :: t, y\n real(dp) :: f\n\n f = t*sqrt(y)\n end function f\nend program rungekutta\n","language":"Fortran"},{"code":"' version 03-10-2015\n' compile with: fbc -s console\n' translation of BBC BASIC\n\nDim As Double y = 1, t, actual, k1, k2, k3, k4\n\nPrint\n\nFor i As Integer = 0 To 100\n\n t = i / 10\n\n If t = Int(t) Then\n actual = ((t ^ 2 + 4) ^ 2) / 16\n Print \"y(\"; Str(t); \") =\"; y ; Tab(27); \"Error = \"; actual - y\n End If\n\n k1 = t * Sqr(y)\n k2 = (t + 0.05) * Sqr(y + 0.05 * k1)\n k3 = (t + 0.05) * Sqr(y + 0.05 * k2)\n k4 = (t + 0.10) * Sqr(y + 0.10 * k3)\n y += 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\n\nNext i\n\n\n' empty keyboard buffer\nWhile Inkey <> \"\" : Wend\nPrint : Print \"hit any key to end program\"\nSleep\nEnd\n","language":"FreeBASIC"},{"code":"window 1\n\ndef fn dydx( x as double, y as double ) as double = x * sqr(y)\ndef fn exactY( x as long ) as double = ( x ^2 + 4 ) ^2 / 16\n\nlong i\ndouble h, k1, k2, k3, k4, x, y, result\n\nh = 0.1\ny = 1\nfor i = 0 to 100\n x = i * h\n if x == int(x)\n result = fn exactY( x )\n print \"y(\"; mid$( str$(x), 2, len$(str$(x) )); \") = \"; y, \"Error = \"; result - y\n end if\n\n k1 = h * fn dydx( x, y )\n k2 = h * fn dydx( x + h / 2, y + k1 / 2 )\n k3 = h * fn dydx( x + h / 2, y + k2 / 2 )\n k4 = h * fn dydx( x + h, y + k3 )\n\n y = y + 1 / 6 * ( k1 + 2 * k2 + 2 * k3 + k4 )\nnext\n\nHandleEvents\n","language":"FutureBasic"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n)\n\ntype ypFunc func(t, y float64) float64\ntype ypStepFunc func(t, y, dt float64) float64\n\n// newRKStep takes a function representing a differential equation\n// and returns a function that performs a single step of the forth-order\n// Runge-Kutta method.\nfunc newRK4Step(yp ypFunc) ypStepFunc {\n return func(t, y, dt float64) float64 {\n dy1 := dt * yp(t, y)\n dy2 := dt * yp(t+dt/2, y+dy1/2)\n dy3 := dt * yp(t+dt/2, y+dy2/2)\n dy4 := dt * yp(t+dt, y+dy3)\n return y + (dy1+2*(dy2+dy3)+dy4)/6\n }\n}\n\n// example differential equation\nfunc yprime(t, y float64) float64 {\n return t * math.Sqrt(y)\n}\n\n// exact solution of example\nfunc actual(t float64) float64 {\n t = t*t + 4\n return t * t / 16\n}\n\nfunc main() {\n t0, tFinal := 0, 10 // task specifies times as integers,\n dtPrint := 1 // and to print at whole numbers.\n y0 := 1. // initial y.\n dtStep := .1 // step value.\n\n t, y := float64(t0), y0\n ypStep := newRK4Step(yprime)\n for t1 := t0 + dtPrint; t1 <= tFinal; t1 += dtPrint {\n printErr(t, y) // print intermediate result\n for steps := int(float64(dtPrint)/dtStep + .5); steps > 1; steps-- {\n y = ypStep(t, y, dtStep)\n t += dtStep\n }\n y = ypStep(t, y, float64(t1)-t) // adjust step to integer time\n t = float64(t1)\n }\n printErr(t, y) // print final result\n}\n\nfunc printErr(t, y float64) {\n fmt.Printf(\"y(%.1f) = %f Error: %e\\n\", t, y, math.Abs(actual(t)-y))\n}\n","language":"Go"},{"code":"class Runge_Kutta{\nstatic void main(String[] args){\ndef y=1.0,t=0.0,counter=0;\ndef dy1,dy2,dy3,dy4;\ndef real;\nwhile(t<=10)\n{if(counter%10==0)\n{real=(t*t+4)*(t*t+4)/16;\nprintln(\"y(\"+t+\")=\"+ y+ \" Error:\"+ (real-y));\n}\n\ndy1=dy(dery(y,t));\ndy2=dy(dery(y+dy1/2,t+0.05));\ndy3=dy(dery(y+dy2/2,t+0.05));\ndy4=dy(dery(y+dy3,t+0.1));\n\ny=y+(dy1+2*dy2+2*dy3+dy4)/6;\nt=t+0.1;\ncounter++;\n}\n}\nstatic def dery(def y,def t){return t*(Math.sqrt(y));}\nstatic def dy(def x){return x*0.1;}\n}\n","language":"Groovy"},{"code":"use fmt;\nuse math;\n\nexport fn main() void = {\n\trk4_driver(&f, 0.0, 10.0, 1.0, 0.1);\n};\n\nfn rk4_driver(func: *fn(_: f64, _: f64) f64, t_init: f64, t_final: f64, y_init: f64, h: f64) void = {\n\tlet n = ((t_final - t_init) / h): int;\n\tlet tn: f64 = t_init;\n\tlet yn: f64 = y_init;\n\tlet i: int = 1;\n\n\tfmt::printfln(\"{: 2} {: 18} {: 21}\", \"t\", \"y(t)\", \"absolute error\")!;\n\tfmt::printfln(\"{: 2} {: 18} {: 21}\", tn, yn, math::absf64(exact(tn) - yn))!;\n\n\tfor (i <= n; i += 1) {\n\t\tyn = rk4(func, tn, yn, h);\n\t\ttn = t_init + (i: f64)*h;\n\n\t\tif (i % 10 == 0) {\n\t\t\tfmt::printfln(\"{: 2} {: 18} {: 21}\\t\", tn, yn, math::absf64(exact(tn) - yn))!;\n\t\t};\n\t};\n};\n\nfn rk4(func: *fn(_: f64, _: f64) f64, t: f64, y: f64, h: f64) f64 = {\n\tconst k1 = func(t, y);\n\tconst k2 = func(t + 0.5*h, y + 0.5*h*k1);\n\tconst k3 = func(t + 0.5*h, y + 0.5*h*k2);\n\tconst k4 = func(t + h, y + h*k3);\n\treturn y + h/6.0 * (k1 + 2.0*k2 + 2.0*k3 + k4);\n};\n\nfn f(t: f64, y: f64) f64 = {\n\treturn t * math::sqrtf64(y);\n};\n\nfn exact(t: f64) f64 = {\n\treturn 1.0/16.0 * math::powf64(t*t + 4.0, 2.0);\n};\n","language":"Hare"},{"code":"dv\n :: Floating a\n => a -> a -> a\ndv = (. sqrt) . (*)\n\nfy t = 1 / 16 * (4 + t ^ 2) ^ 2\n\nrk4\n :: (Enum a, Fractional a)\n => (a -> a -> a) -> a -> a -> a -> [(a, a)]\nrk4 fd y0 a h = zip ts $ scanl (flip fc) y0 ts\n where\n ts = [a,h ..]\n fc t y =\n sum . (y :) . zipWith (*) [1 / 6, 1 / 3, 1 / 3, 1 / 6] $\n scanl\n (\\k f -> h * fd (t + f * h) (y + f * k))\n (h * fd t y)\n [1 / 2, 1 / 2, 1]\n\ntask =\n mapM_\n (print . (\\(x, y) -> (truncate x, y, fy x - y)))\n (filter (\\(x, _) -> 0 == mod (truncate $ 10 * x) 10) $\n take 101 $ rk4 dv 1.0 0 0.1)\n","language":"Haskell"},{"code":"*Main> task\n(0,1.0,0.0)\n(1,1.5624998542781088,1.4572189122041834e-7)\n(2,3.9999990805208006,9.194792029987298e-7)\n(3,10.562497090437557,2.909562461184123e-6)\n(4,24.999993765090654,6.234909399438493e-6)\n(5,52.56248918030265,1.0819697635611192e-5)\n(6,99.99998340540378,1.6594596999652822e-5)\n(7,175.56247648227165,2.3517730085131916e-5)\n(8,288.99996843479926,3.1565204153594095e-5)\n(9,451.562459276841,4.0723166534917254e-5)\n(10,675.9999490167125,5.098330132113915e-5)\n","language":"Haskell"},{"code":"rk4 :: Double -> Double -> Double -> Double\nrk4 y x dx =\n let f x y = x * sqrt y\n k1 = dx * f x y\n k2 = dx * f (x + dx / 2.0) (y + k1 / 2.0)\n k3 = dx * f (x + dx / 2.0) (y + k2 / 2.0)\n k4 = dx * f (x + dx) (y + k3)\n in y + (k1 + 2.0 * k2 + 2.0 * k3 + k4) / 6.0\n\nactual :: Double -> Double\nactual x = (1 / 16) * (x * x + 4) * (x * x + 4)\n\nstep :: Double\nstep = 0.1\n\nixs :: [Int]\nixs = [0 .. 100]\n\nxys :: [(Double, Double)]\nxys =\n scanl\n (\\(x, y) _ -> (((x * 10) + (step * 10)) / 10, rk4 y x step))\n (0.0, 1.0)\n ixs\n\nsamples :: [(Double, Double, Double)]\nsamples =\n zip ixs xys >>=\n (\\(i, (x, y)) ->\n [ (x, y, actual x - y)\n | 0 == mod i 10 ])\n\nmain :: IO ()\nmain =\n (putStrLn . unlines) $\n (\\(x, y, v) ->\n unwords\n [ \"y\" ++ justifyRight 3 ' ' ('(' : show (round x)) ++ \") = \"\n , justifyLeft 19 ' ' (show y)\n , '±' : show v\n ]) <$>\n samples\n where\n justifyLeft n c s = take n (s ++ replicate n c)\n justifyRight n c s = drop (length s) (replicate n c ++ s)\n","language":"Haskell"},{"code":"100 PROGRAM \"Runge.bas\"\n110 LET Y=1\n120 FOR T=0 TO 10 STEP .1\n130 IF T=INT(T) THEN PRINT \"y(\";STR$(T);\") =\";Y;TAB(21);\"Error =\";((T^2+4)^2)/16-Y\n140 LET K1=T*SQR(Y)\n150 LET K2=(T+.05)*SQR(Y+.05*K1)\n160 LET K3=(T+.05)*SQR(Y+.05*K2)\n170 LET K4=(T+.1)*SQR(Y+.1*K3)\n180 LET Y=Y+.1*(K1+2*(K2+K3)+K4)/6\n190 NEXT\n","language":"IS-BASIC"},{"code":"NB.*rk4 a Solve function using Runge-Kutta method\nNB. y is: y(ta) , ta , tb , tstep\nNB. u is: function to solve\nNB. eg: fyp rk4 1 0 10 0.1\nrk4=: adverb define\n 'Y0 a b h'=. 4{. y\n T=. a + i.@>:&.(%&h) b - a\n Y=. Yt=. Y0\n for_t. }: T do.\n ty=. t,Yt\n k1=. h * u ty\n k2=. h * u ty + -: h,k1\n k3=. h * u ty + -: h,k2\n k4=. h * u ty + h,k3\n Y=. Y, Yt=. Yt + (%6) * 1 2 2 1 +/@:* k1, k2, k3, k4\n end.\nT ,. Y\n)\n","language":"J"},{"code":" fy=: (%16) * [: *: 4 + *: NB. f(t,y)\n fyp=: (* %:)/ NB. f'(t,y)\n report_whole=: (10 * i. >:10)&{ NB. report at whole-numbered t values\n report_err=: (, {: - [: fy {.)\"1 NB. report errors\n\n report_err report_whole fyp rk4 1 0 10 0.1\n 0 1 0\n 1 1.5625 _1.45722e_7\n 2 4 _9.19479e_7\n 3 10.5625 _2.90956e_6\n 4 25 _6.23491e_6\n 5 52.5625 _1.08197e_5\n 6 100 _1.65946e_5\n 7 175.562 _2.35177e_5\n 8 289 _3.15652e_5\n 9 451.562 _4.07232e_5\n10 676 _5.09833e_5\n","language":"J"},{"code":"rk4=: adverb define\n 'Y0 a b h'=. 4{. y\n T=. a + i.@>:&.(%&h) b-a\n (,. [: h&(u nextY)@,/\\. Y0 ,~ }.)&.|. T\n)\n\nNB. nextY a Calculate Yn+1 of a function using Runge-Kutta method\nNB. y is: 2-item numeric list of time t and y(t)\nNB. u is: function to use\nNB. x is: step size\nNB. eg: 0.001 fyp nextY 0 1\nnextY=: adverb define\n:\n tableau=. 1 0.5 0.5, x * u y\n ks=. (x * [: u y + (* x&,))/\\. tableau\n ({:y) + 6 %~ +/ 1 2 2 1 * ks\n)\n","language":"J"},{"code":"import static java.lang.Math.*;\nimport java.util.function.BiFunction;\n\npublic class RungeKutta {\n\n static void runge(BiFunction<Double, Double, Double> yp_func, double[] t,\n double[] y, double dt) {\n\n for (int n = 0; n < t.length - 1; n++) {\n double dy1 = dt * yp_func.apply(t[n], y[n]);\n double dy2 = dt * yp_func.apply(t[n] + dt / 2.0, y[n] + dy1 / 2.0);\n double dy3 = dt * yp_func.apply(t[n] + dt / 2.0, y[n] + dy2 / 2.0);\n double dy4 = dt * yp_func.apply(t[n] + dt, y[n] + dy3);\n t[n + 1] = t[n] + dt;\n y[n + 1] = y[n] + (dy1 + 2.0 * (dy2 + dy3) + dy4) / 6.0;\n }\n }\n\n static double calc_err(double t, double calc) {\n double actual = pow(pow(t, 2.0) + 4.0, 2) / 16.0;\n return abs(actual - calc);\n }\n\n public static void main(String[] args) {\n double dt = 0.10;\n double[] t_arr = new double[101];\n double[] y_arr = new double[101];\n y_arr[0] = 1.0;\n\n runge((t, y) -> t * sqrt(y), t_arr, y_arr, dt);\n\n for (int i = 0; i < t_arr.length; i++)\n if (i % 10 == 0)\n System.out.printf(\"y(%.1f) = %.8f Error: %.6f%n\",\n t_arr[i], y_arr[i],\n calc_err(t_arr[i], y_arr[i]));\n }\n}\n","language":"Java"},{"code":"function rk4(y, x, dx, f) {\n var k1 = dx * f(x, y),\n k2 = dx * f(x + dx / 2.0, +y + k1 / 2.0),\n k3 = dx * f(x + dx / 2.0, +y + k2 / 2.0),\n k4 = dx * f(x + dx, +y + k3);\n\n return y + (k1 + 2.0 * k2 + 2.0 * k3 + k4) / 6.0;\n}\n\nfunction f(x, y) {\n return x * Math.sqrt(y);\n}\n\nfunction actual(x) {\n return (1/16) * (x*x+4)*(x*x+4);\n}\n\nvar y = 1.0,\n x = 0.0,\n step = 0.1,\n steps = 0,\n maxSteps = 101,\n sampleEveryN = 10;\n\nwhile (steps < maxSteps) {\n if (steps%sampleEveryN === 0) {\n console.log(\"y(\" + x + \") = \\t\" + y + \"\\t ± \" + (actual(x) - y).toExponential());\n }\n\n y = rk4(y, x, step, f);\n\n // using integer math for the step addition\n // to prevent floating point errors as 0.2 + 0.1 != 0.3\n x = ((x * 10) + (step * 10)) / 10;\n steps += 1;\n}\n","language":"JavaScript"},{"code":"(() => {\n 'use strict';\n\n // rk4 :: (Double -> Double -> Double) ->\n // Double -> Double -> Double -> Double\n const rk4 = f => (y, x, dx) => {\n const\n k1 = dx * f(x, y),\n k2 = dx * f(x + dx / 2.0, y + k1 / 2.0),\n k3 = dx * f(x + dx / 2.0, y + k2 / 2.0),\n k4 = dx * f(x + dx, y + k3);\n return y + (k1 + 2.0 * k2 + 2.0 * k3 + k4) / 6.0;\n };\n\n // rk :: Double -> Double -> Double -> Double\n const rk = rk4((x, y) => x * Math.sqrt(y));\n\n // actual :: Double -> Double\n const actual = x => (1 / 16) * ((x * x) + 4) * ((x * x) + 4);\n\n\n // TEST -------------------------------------------------\n\n // main :: IO ()\n const main = () => {\n const\n step = 0.1,\n ixs = enumFromTo(0, 100),\n xys = scanl(\n xy => Tuple(\n ((xy[0] * 10) + (step * 10)) / 10, rk(xy[1], xy[0], step)\n ),\n Tuple(0.0, 1.0),\n ixs\n );\n\n // samples :: [(Double, Double, Double)]\n const samples = concatMap(\n tpl => 0 === tpl[0] % 10 ? (() => {\n const [x, y] = Array.from(tpl[1]);\n return [TupleN(x, y, actual(x) - y)];\n })() : [],\n zip(ixs, xys)\n );\n\n console.log(\n unlines(map(\n tpl => {\n const [x, y, v] = Array.from(tpl),\n [sn, sm] = splitOn('.', y.toString());\n return unwords([\n 'y' + justifyRight(3, ' ', '(' + Math.round(x).toString()) +\n ') =',\n justifyRight(3, ' ', sn) + '.' + justifyLeft(15, ' ', sm || '0'),\n '± ' + v.toExponential()\n ]);\n },\n samples\n ))\n );\n };\n\n\n // GENERIC FUNCTIONS ----------------------------\n\n // Tuple (,) :: a -> b -> (a, b)\n const Tuple = (a, b) => ({\n type: 'Tuple',\n '0': a,\n '1': b,\n length: 2\n });\n\n // TupleN :: a -> b ... -> (a, b ... )\n function TupleN() {\n const\n args = Array.from(arguments),\n lng = args.length;\n return lng > 1 ? Object.assign(\n args.reduce((a, x, i) => Object.assign(a, {\n [i]: x\n }), {\n type: 'Tuple' + (2 < lng ? lng.toString() : ''),\n length: lng\n })\n ) : args[0];\n };\n\n // concatMap :: (a -> [b]) -> [a] -> [b]\n const concatMap = (f, xs) =>\n xs.reduce((a, x) => a.concat(f(x)), []);\n\n // enumFromTo :: Int -> Int -> [Int]\n const enumFromTo = (m, n) =>\n Array.from({\n length: 1 + n - m\n }, (_, i) => m + i)\n\n // justifyLeft :: Int -> Char -> String -> String\n const justifyLeft = (n, cFiller, s) =>\n n > s.length ? (\n s.padEnd(n, cFiller)\n ) : s;\n\n // justifyRight :: Int -> Char -> String -> String\n const justifyRight = (n, cFiller, s) =>\n n > s.length ? (\n s.padStart(n, cFiller)\n ) : s;\n\n // Returns Infinity over objects without finite length\n // this enables zip and zipWith to choose the shorter\n // argument when one is non-finite, like cycle, repeat etc\n\n // length :: [a] -> Int\n const length = xs => xs.length || Infinity;\n\n // map :: (a -> b) -> [a] -> [b]\n const map = (f, xs) => xs.map(f);\n\n // scanl :: (b -> a -> b) -> b -> [a] -> [b]\n const scanl = (f, startValue, xs) =>\n xs.reduce((a, x) => {\n const v = f(a[0], x);\n return Tuple(v, a[1].concat(v));\n }, Tuple(startValue, [startValue]))[1];\n\n // splitOn :: String -> String -> [String]\n const splitOn = (pat, src) => src.split(pat);\n\n // take :: Int -> [a] -> [a]\n // take :: Int -> String -> String\n const take = (n, xs) =>\n xs.constructor.constructor.name !== 'GeneratorFunction' ? (\n xs.slice(0, n)\n ) : [].concat.apply([], Array.from({\n length: n\n }, () => {\n const x = xs.next();\n return x.done ? [] : [x.value];\n }));\n\n // unlines :: [String] -> String\n const unlines = xs => xs.join('\\n');\n\n // unwords :: [String] -> String\n const unwords = xs => xs.join(' ');\n\n // Use of `take` and `length` here allows for zipping with non-finite\n // lists - i.e. generators like cycle, repeat, iterate.\n\n // zip :: [a] -> [b] -> [(a, b)]\n const zip = (xs, ys) => {\n const lng = Math.min(length(xs), length(ys));\n return Infinity !== lng ? (() => {\n const bs = take(lng, ys);\n return take(lng, xs).map((x, i) => Tuple(x, bs[i]));\n })() : zipGen(xs, ys);\n };\n\n // MAIN ---\n return main();\n})();\n","language":"JavaScript"},{"code":"def until(cond; next):\n def _until: if cond then . else (next|_until) end;\n _until;\n\ndef while(cond; update):\n def _while: if cond then ., (update | _while) else empty end;\n _while;\n","language":"Jq"},{"code":"# yprime maps [t,y] to a number, i.e. t * sqrt(y)\ndef yprime: .[0] * (.[1] | sqrt);\n\n# The exact solution of yprime:\ndef actual:\n . as $t\n | (( $t*$t) + 4 )\n | . * . / 16;\n","language":"Jq"},{"code":"# n is the number of decimal places of precision\ndef round(n):\n (if . < 0 then -1 else 1 end) as $s\n | $s*10*.*n | if (floor % 10) > 4 then (.+5) else . end | ./10 | floor/n | .*$s;\n\ndef abs: if . < 0 then -. else . end;\n\n# Is the input an integer?\ndef integerq: ((. - ((.+.01) | floor)) | abs) < 0.01;\n","language":"Jq"},{"code":"def dt: 0.1;\n\n# Input: [t, y]; yp is a filter that accepts [t,y] as input\ndef runge_kutta(yp):\n .[0] as $t | .[1] as $y\n | (dt * yp) as $a\n | (dt * ([ ($t + (dt/2)), $y + ($a/2) ] | yp)) as $b\n | (dt * ([ ($t + (dt/2)), $y + ($b/2) ] | yp)) as $c\n | (dt * ([ ($t + dt) , $y + $c ] | yp)) as $d\n | ($a + (2*($b + $c)) + $d) / 6\n;\n\n# Input: [t,y]\ndef dy(f): runge_kutta(f);\n","language":"Jq"},{"code":"# state: [t,y]\n[0,1]\n| while( .[0] <= 10;\n .[0] as $t | .[1] as $y\n | [$t + dt, $y + dy(yprime) ] )\n| .[0] as $t | .[1] as $y\n| if $t | integerq then\n \"y(\\($t|round(1))) = \\($y|round(10000)) ± \\( ($t|actual) - $y | abs)\"\n else empty\n end\n","language":"Jq"},{"code":"$ time jq -r -n -f rk4.pl.jq\ny(0) = 1 ± 0\ny(1) = 1.5625 ± 1.4572189210859676e-07\ny(2) = 4 ± 9.194792029987298e-07\ny(3) = 10.5625 ± 2.9095624576314094e-06\ny(4) = 25 ± 6.234909392333066e-06\ny(5) = 52.5625 ± 1.081969734428867e-05\ny(6) = 100 ± 1.659459609015812e-05\ny(7) = 175.5625 ± 2.3517728038768837e-05\ny(8) = 289 ± 3.156520000402452e-05\ny(9) = 451.5625 ± 4.072315812209126e-05\ny(10) = 675.9999 ± 5.0983286655537086e-05\n\nreal\t0m0.048s\nuser\t0m0.013s\nsys\t0m0.006s\n","language":"Jq"},{"code":"# Input: [t, y, dt]\ndef newRK4Step(yp):\n .[0] as $t | .[1] as $y | .[2] as $dt\n | ($dt * ([$t, $y]|yp)) as $dy1\n | ($dt * ([$t+$dt/2, $y+$dy1/2]|yp)) as $dy2\n | ($dt * ([$t+$dt/2, $y+$dy2/2]|yp)) as $dy3\n | ($dt * ([$t+$dt, $y+$dy3] |yp)) as $dy4\n | $y + ($dy1+2*($dy2+$dy3)+$dy4)/6\n;\n\n\ndef printErr: # input: [t, y]\n def abs: if . < 0 then -. else . end;\n .[0] as $t | .[1] as $y\n | \"y(\\($t)) = \\($y) with error: \\( (($t|actual) - $y) | abs )\"\n;\n\ndef main(t0; y0; tFinal; dtPrint):\n\n def ypStep: newRK4Step(yprime) ;\n\n 0.1 as $dtStep # step value\n # [ t, y] is the state vector\n | [ t0, y0 ]\n | while( .[0] <= tFinal;\n .[0] as $t | .[1] as $y\n\t | ($t + dtPrint) as $t1\n\t | (((dtPrint/$dtStep) + 0.5) | floor) as $steps\n\t | [$steps, $t, $y] # state vector\n | until( .[0] <= 1;\n\t .[0] as $steps\n\t\t | .[1] as $t\n\t\t | .[2] as $y\n\t\t | [ ($steps - 1), ($t + $dtStep), ([$t, $y, $dtStep]|ypStep) ]\n )\n\t | .[1] as $t | .[2] as $y\n\t | [$t1, ([ $t, $y, ($t1-$t)] | ypStep)] # adjust step to integer time\n )\n | printErr # print results\n;\n\n# main(t0; y0; tFinal; dtPrint)\nmain(0; 1; 10; 1)\n","language":"Jq"},{"code":"$ time jq -n -r -f runge-kutta.jq\ny(0) = 1 with error: 0\ny(1) = 1.562499854278108 with error: 1.4572189210859676e-07\ny(2) = 3.9999990805207974 with error: 9.194792025546406e-07\ny(3) = 10.562497090437544 with error: 2.9095624558550526e-06\ny(4) = 24.999993765090615 with error: 6.234909385227638e-06\ny(5) = 52.562489180302656 with error: 1.081969734428867e-05\ny(6) = 99.99998340540387 with error: 1.6594596132790684e-05\ny(7) = 175.56247648227188 with error: 2.3517728124033965e-05\ny(8) = 288.9999684347997 with error: 3.156520028824161e-05\ny(9) = 451.56245927684154 with error: 4.0723158463151776e-05\ny(10) = 675.9999490167129 with error: 5.0983287110284436e-05\n\nreal\t0m0.023s\nuser\t0m0.014s\nsys\t0m0.006s\n","language":"Jq"},{"code":"f(x, y) = x * sqrt(y)\ntheoric(t) = (t ^ 2 + 4.0) ^ 2 / 16.0\n\nrk4(f) = (t, y, δt) -> # 1st (result) lambda\n ((δy1) -> # 2nd lambda\n ((δy2) -> # 3rd lambda\n ((δy3) -> # 4th lambda\n ((δy4) -> ( δy1 + 2δy2 + 2δy3 + δy4 ) / 6 # 5th and deepest lambda: calc y_{n+1}\n )(δt * f(t + δt, y + δy3)) # calc δy₄\n )(δt * f(t + δt / 2, y + δy2 / 2)) # calc δy₃\n )(δt * f(t + δt / 2, y + δy1 / 2)) # calc δy₂\n )(δt * f(t, y)) # calc δy₁\n\nδy = rk4(f)\nt₀, δt, tmax = 0.0, 0.1, 10.0\ny₀ = 1.0\n\nt, y = t₀, y₀\nwhile t ≤ tmax\n if t ≈ round(t) @printf(\"y(%4.1f) = %10.6f\\terror: %12.6e\\n\", t, y, abs(y - theoric(t))) end\n y += δy(t, y, δt)\n t += δt\nend\n","language":"Julia"},{"code":"function rk4(f::Function, x₀::Float64, y₀::Float64, x₁::Float64, n)\n vx = Vector{Float64}(undef, n + 1)\n vy = Vector{Float64}(undef, n + 1)\n vx[1] = x = x₀\n vy[1] = y = y₀\n h = (x₁ - x₀) / n\n for i in 1:n\n k₁ = h * f(x, y)\n k₂ = h * f(x + 0.5h, y + 0.5k₁)\n k₃ = h * f(x + 0.5h, y + 0.5k₂)\n k₄ = h * f(x + h, y + k₃)\n vx[i + 1] = x = x₀ + i * h\n vy[i + 1] = y = y + (k₁ + 2k₂ + 2k₃ + k₄) / 6\n end\n return vx, vy\nend\n\nvx, vy = rk4(f, 0.0, 1.0, 10.0, 100)\nfor (x, y) in Iterators.take(zip(vx, vy), 10)\n @printf(\"%4.1f %10.5f %+12.4e\\n\", x, y, y - theoric(x))\nend\n","language":"Julia"},{"code":"// version 1.1.2\n\ntypealias Y = (Double) -> Double\ntypealias Yd = (Double, Double) -> Double\n\nfun rungeKutta4(t0: Double, tz: Double, dt: Double, y: Y, yd: Yd) {\n var tn = t0\n var yn = y(tn)\n val z = ((tz - t0) / dt).toInt()\n for (i in 0..z) {\n if (i % 10 == 0) {\n val exact = y(tn)\n val error = yn - exact\n println(\"%4.1f %10f %10f %9f\".format(tn, yn, exact, error))\n }\n if (i == z) break\n val dy1 = dt * yd(tn, yn)\n val dy2 = dt * yd(tn + 0.5 * dt, yn + 0.5 * dy1)\n val dy3 = dt * yd(tn + 0.5 * dt, yn + 0.5 * dy2)\n val dy4 = dt * yd(tn + dt, yn + dy3)\n yn += (dy1 + 2.0 * dy2 + 2.0 * dy3 + dy4) / 6.0\n tn += dt\n }\n}\n\nfun main(args: Array<String>) {\n println(\" T RK4 Exact Error\")\n println(\"---- ---------- ---------- ---------\")\n val y = fun(t: Double): Double {\n val x = t * t + 4.0\n return x * x / 16.0\n }\n val yd = fun(t: Double, yt: Double) = t * Math.sqrt(yt)\n rungeKutta4(0.0, 10.0, 0.1, y, yd)\n}\n","language":"Kotlin"},{"code":"'[RC] Runge-Kutta method\n'initial conditions\nx0 = 0\ny0 = 1\n'step\nh = 0.1\n'number of points\nN=101\n\ny=y0\nFOR i = 0 TO N-1\n x = x0+ i*h\n IF x = INT(x) THEN\n actual = exactY(x)\n PRINT \"y(\"; x ;\") = \"; y; TAB(20); \"Error = \"; actual - y\n END IF\n\n k1 = h*dydx(x,y)\n k2 = h*dydx(x+h/2,y+k1/2)\n k3 = h*dydx(x+h/2,y+k2/2)\n k4 = h*dydx(x+h,y+k3)\n y = y + 1/6 * (k1 + 2*k2 + 2*k3 + k4)\nNEXT i\n\nfunction dydx(x,y)\n dydx=x*sqr(y)\nend function\n\nfunction exactY(x)\n exactY=(x^2 + 4)^2 / 16\nend function\n","language":"Liberty-BASIC"},{"code":"local df = function (t, y)\n-- derivative of function by value y at time t\n\treturn t*y^0.5\nend\n\nlocal dt = 0.1\nlocal y = 1\n\nprint (\"t\", \"realY\"..' ', \"y\", '\t\t'..\"error\")\nprint (\"---\", \"-------\"..' ', \"---------------\", '\t'..\"--------------------\")\n\nfor i = 0, 100 do\n\tlocal t = i*dt\n\tif t%1 == 0 then\n\t\tlocal realY = (t*t+4)^2/16\n\t\tprint (t, realY..' ', y, '\t'..realY-y)\n\tend\n\tlocal dy1 = df(t, y)\n\tlocal dy2 = df(t+dt/2, y+dt/2*dy1)\n\tlocal dy3 = df(t+dt/2, y+dt/2*dy2)\n\tlocal dy4 = df(t+dt, y+dt*dy3)\n\ty = y + dt*(dy1+2*dy2+2*dy3+dy4)/6\nend\n","language":"Lua"},{"code":"(* Symbolic solution *)\nDSolve[{y'[t] == t*Sqrt[y[t]], y[0] == 1}, y, t]\nTable[{t, 1/16 (4 + t^2)^2}, {t, 0, 10}]\n\n(* Numerical solution I (not RK4) *)\nTable[{t, y[t], Abs[y[t] - 1/16*(4 + t^2)^2]}, {t, 0, 10}] /.\n First@NDSolve[{y'[t] == t*Sqrt[y[t]], y[0] == 1}, y, {t, 0, 10}]\n\n(* Numerical solution II (RK4) *)\nf[{t_, y_}] := {1, t Sqrt[y]}\nh = 0.1;\nphi[y_] := Module[{k1, k2, k3, k4},\n k1 = h*f[y];\n k2 = h*f[y + 1/2 k1];\n k3 = h*f[y + 1/2 k2];\n k4 = h*f[y + k3];\n y + k1/6 + k2/3 + k3/3 + k4/6]\nsolution = NestList[phi, {0, 1}, 101];\nTable[{y[[1]], y[[2]], Abs[y[[2]] - 1/16 (y[[1]]^2 + 4)^2]},\n {y, solution[[1 ;; 101 ;; 10]]}]\n","language":"Mathematica"},{"code":"function testRK4Programs\n figure\n hold on\n t = 0:0.1:10;\n y = 0.0625.*(t.^2+4).^2;\n plot(t, y, '-k')\n [tode4, yode4] = testODE4(t);\n plot(tode4, yode4, '--b')\n [trk4, yrk4] = testRK4(t);\n plot(trk4, yrk4, ':r')\n legend('Exact', 'ODE4', 'RK4')\n hold off\n fprintf('Time\\tExactVal\\tODE4Val\\tODE4Error\\tRK4Val\\tRK4Error\\n')\n for k = 1:10:length(t)\n fprintf('%.f\\t\\t%7.3f\\t\\t%7.3f\\t%7.3g\\t%7.3f\\t%7.3g\\n', t(k), y(k), ...\n yode4(k), abs(y(k)-yode4(k)), yrk4(k), abs(y(k)-yrk4(k)))\n end\nend\n\nfunction [t, y] = testODE4(t)\n y0 = 1;\n y = ode4(@(tVal,yVal)tVal*sqrt(yVal), t, y0);\nend\n\nfunction [t, y] = testRK4(t)\n dydt = @(tVal,yVal)tVal*sqrt(yVal);\n y = zeros(size(t));\n y(1) = 1;\n for k = 1:length(t)-1\n dt = t(k+1)-t(k);\n dy1 = dt*dydt(t(k), y(k));\n dy2 = dt*dydt(t(k)+0.5*dt, y(k)+0.5*dy1);\n dy3 = dt*dydt(t(k)+0.5*dt, y(k)+0.5*dy2);\n dy4 = dt*dydt(t(k)+dt, y(k)+dy3);\n y(k+1) = y(k)+(dy1+2*dy2+2*dy3+dy4)/6;\n end\nend\n","language":"MATLAB"},{"code":"/* Here is how to solve a differential equation */\n'diff(y, x) = x * sqrt(y);\node2(%, y, x);\nic1(%, x = 0, y = 1);\nfactor(solve(%, y)); /* [y = (x^2 + 4)^2 / 16] */\n\n/* The Runge-Kutta solver is builtin */\n\nload(dynamics)$\nsol: rk(t * sqrt(y), y, 1, [t, 0, 10, 1.0])$\nplot2d([discrete, sol])$\n\n/* An implementation of RK4 for one equation */\n\nrk4(f, x0, y0, x1, n) := block([h, x, y, vx, vy, k1, k2, k3, k4],\n h: bfloat((x1 - x0) / (n - 1)),\n x: x0,\n y: y0,\n vx: makelist(0, n + 1),\n vy: makelist(0, n + 1),\n vx[1]: x0,\n vy[1]: y0,\n for i from 1 thru n do (\n k1: bfloat(h * f(x, y)),\n k2: bfloat(h * f(x + h / 2, y + k1 / 2)),\n k3: bfloat(h * f(x + h / 2, y + k2 / 2)),\n k4: bfloat(h * f(x + h, y + k3)),\n vy[i + 1]: y: y + (k1 + 2 * k2 + 2 * k3 + k4) / 6,\n vx[i + 1]: x: x + h\n ),\n [vx, vy]\n)$\n\n[x, y]: rk4(lambda([x, y], x * sqrt(y)), 0, 1, 10, 101)$\n\nplot2d([discrete, x, y])$\n\ns: map(lambda([x], (x^2 + 4)^2 / 16), x)$\n\nfor i from 1 step 10 thru 101 do print(x[i], \" \", y[i], \" \", y[i] - s[i]);\n","language":"Maxima"},{"code":"import math\n\nproc fn(t, y: float): float =\n result = t * math.sqrt(y)\n\nproc solution(t: float): float =\n result = (t^2 + 4)^2 / 16\n\nproc rk(start, stop, step: float) =\n let nsteps = int(round((stop - start) / step)) + 1\n let delta = (stop - start) / float(nsteps - 1)\n var cur_y = 1.0\n for i in 0..(nsteps - 1):\n let cur_t = start + delta * float(i)\n\n if abs(cur_t - math.round(cur_t)) < 1e-5:\n echo \"y(\", cur_t, \") = \", cur_y, \", error = \", solution(cur_t) - cur_y\n\n let dy1 = step * fn(cur_t, cur_y)\n let dy2 = step * fn(cur_t + 0.5 * step, cur_y + 0.5 * dy1)\n let dy3 = step * fn(cur_t + 0.5 * step, cur_y + 0.5 * dy2)\n let dy4 = step * fn(cur_t + step, cur_y + dy3)\nimport math, strformat\n\nproc fn(t, y: float): float =\n result = t * math.sqrt(y)\n\nproc solution(t: float): float =\n result = (t^2 + 4)^2 / 16\n\nproc rk(start, stop, step: float) =\n let nsteps = int(round((stop - start) / step)) + 1\n let delta = (stop - start) / float(nsteps - 1)\n var cur_y = 1.0\n for i in 0..<nsteps:\n let cur_t = start + delta * float(i)\n\n if abs(cur_t - math.round(cur_t)) < 1e-5:\n echo &\"y({cur_t}) = {cur_y}, error = {solution(cur_t) - cur_y}\"\n\n let dy1 = step * fn(cur_t, cur_y)\n let dy2 = step * fn(cur_t + 0.5 * step, cur_y + 0.5 * dy1)\n let dy3 = step * fn(cur_t + 0.5 * step, cur_y + 0.5 * dy2)\n let dy4 = step * fn(cur_t + step, cur_y + dy3)\n\n cur_y += (dy1 + 2 * (dy2 + dy3) + dy4) / 6\n\nrk(start = 0, stop = 10, step = 0.1)\n cur_y += (dy1 + 2.0 * (dy2 + dy3) + dy4)\n","language":"Nim"},{"code":"class RungeKuttaMethod {\n function : Main(args : String[]) ~ Nil {\n x0 := 0.0; x1 := 10.0; dx := .1;\n\n n := 1 + (x1 - x0)/dx;\n y := Float->New[n->As(Int)];\n\n y[0] := 1;\n for(i := 1; i < n; i++;) {\n y[i] := Rk4(Rate(Float, Float) ~ Float, dx, x0 + dx * (i - 1), y[i-1]);\n };\n\n for(i := 0; i < n; i += 10;) {\n x := x0 + dx * i;\n y2 := (x * x / 4 + 1)->Power(2.0);\n\n x_value := x->As(Int);\n y_value := y[i];\n rel_value := y_value/y2 - 1.0;\n \"y({$x_value})={$y_value}; error: {$rel_value}\"->PrintLine();\n };\n }\n\n function : native : Rk4(f : (Float, Float) ~ Float, dx : Float, x : Float, y : Float) ~ Float {\n k1 := dx * f(x, y);\n k2 := dx * f(x + dx / 2, y + k1 / 2);\n k3 := dx * f(x + dx / 2, y + k2 / 2);\n k4 := dx * f(x + dx, y + k3);\n\n return y + (k1 + 2 * k2 + 2 * k3 + k4) / 6;\n }\n\n function : native : Rate(x : Float, y : Float) ~ Float {\n return x * y->SquareRoot();\n }\n}\n","language":"Objeck"},{"code":"let y' t y = t *. sqrt y\nlet exact t = let u = 0.25*.t*.t +. 1.0 in u*.u\n\nlet rk4_step (y,t) h =\n let k1 = h *. y' t y in\n let k2 = h *. y' (t +. 0.5*.h) (y +. 0.5*.k1) in\n let k3 = h *. y' (t +. 0.5*.h) (y +. 0.5*.k2) in\n let k4 = h *. y' (t +. h) (y +. k3) in\n (y +. (k1+.k4)/.6.0 +. (k2+.k3)/.3.0, t +. h)\n\nlet rec loop h n (y,t) =\n if n mod 10 = 1 then\n Printf.printf \"t = %f,\\ty = %f,\\terr = %g\\n\" t y (abs_float (y -. exact t));\n if n < 102 then loop h (n+1) (rk4_step (y,t) h)\n\nlet _ = loop 0.1 1 (1.0, 0.0)\n","language":"OCaml"},{"code":"#Applying the Runge-Kutta method (This code must be implement on a different file than the main one).\n\nfunction temp = rk4(func,x,pvi,h)\n K1 = h*func(x,pvi);\n K2 = h*func(x+0.5*h,pvi+0.5*K1);\n K3 = h*func(x+0.5*h,pvi+0.5*K2);\n K4 = h*func(x+h,pvi+K3);\n temp = pvi + (K1 + 2*K2 + 2*K3 + K4)/6;\nendfunction\n\n#Main Program.\n\nf = @(t) (1/16)*((t.^2 + 4).^2);\ndf = @(t,y) t*sqrt(y);\n\npvi = 1.0;\nh = 0.1;\nYn = pvi;\n\nfor x = 0:h:10-h\n pvi = rk4(df,x,pvi,h);\n Yn = [Yn pvi];\nendfor\n\nfprintf('Time \\t Exact Value \\t ODE4 Value \\t Num. Error\\n');\n\nfor i=0:10\n fprintf('%d \\t %.5f \\t %.5f \\t %.4g \\n',i,f(i),Yn(1+i*10),f(i)-Yn(1+i*10));\nendfor\n","language":"Octave"},{"code":"rk4(f,dx,x,y)={\n my(k1=dx*f(x,y), k2=dx*f(x+dx/2,y+k1/2), k3=dx*f(x+dx/2,y+k2/2), k4=dx*f(x+dx,y+k3));\n y + (k1 + 2*k2 + 2*k3 + k4) / 6\n};\nrate(x,y)=x*sqrt(y);\ngo()={\n my(x0=0,x1=10,dx=.1,n=1+(x1-x0)\\dx,y=vector(n));\n y[1]=1;\n for(i=2,n,y[i]=rk4(rate, dx, x0 + dx * (i - 1), y[i-1]));\n print(\"x\\ty\\trel. err.\\n------------\");\n forstep(i=1,n,10,\n my(x=x0+dx*i,y2=(x^2/4+1)^2);\n print(x \"\\t\" y[i] \"\\t\" y[i]/y2 - 1)\n )\n};\ngo()\n","language":"PARI-GP"},{"code":"program RungeKuttaExample;\n\nuses sysutils;\n\ntype\n TDerivative = function (t, y : Real) : Real;\n\nprocedure RungeKutta(yDer : TDerivative;\n var t, y : array of Real;\n dt : Real);\nvar\n dy1, dy2, dy3, dy4 : Real;\n idx : Cardinal;\n\nbegin\n for idx := Low(t) to High(t) - 1 do\n begin\n dy1 := dt * yDer(t[idx], y[idx]);\n dy2 := dt * yDer(t[idx] + dt / 2.0, y[idx] + dy1 / 2.0);\n dy3 := dt * yDer(t[idx] + dt / 2.0, y[idx] + dy2 / 2.0);\n dy4 := dt * yDer(t[idx] + dt, y[idx] + dy3);\n\n t[idx + 1] := t[idx] + dt;\n y[idx + 1] := y[idx] + (dy1 + 2.0 * (dy2 + dy3) + dy4) / 6.0;\n end;\nend;\n\nfunction CalcError(t, y : Real) : Real;\nvar\n trueVal : Real;\n\nbegin\n trueVal := sqr(sqr(t) + 4.0) / 16.0;\n CalcError := abs(trueVal - y);\nend;\n\nprocedure Print(t, y : array of Real;\n modnum : Integer);\nvar\n idx : Cardinal;\n\nbegin\n for idx := Low(t) to High(t) do\n begin\n if idx mod modnum = 0 then\n begin\n WriteLn(Format('y(%4.1f) = %12.8f Error: %12.6e',\n [t[idx], y[idx], CalcError(t[idx], y[idx])]));\n end;\n end;\nend;\n\nfunction YPrime(t, y : Real) : Real;\nbegin\n YPrime := t * sqrt(y);\nend;\n\nconst\n dt = 0.10;\n N = 100;\n\nvar\n tArr, yArr : array [0..N] of Real;\n\nbegin\n tArr[0] := 0.0;\n yArr[0] := 1.0;\n\n RungeKutta(@YPrime, tArr, yArr, dt);\n Print(tArr, yArr, 10);\nend.\n","language":"Pascal"},{"code":"sub runge_kutta {\n my ($yp, $dt) = @_;\n sub {\n\tmy ($t, $y) = @_;\n\tmy @dy = $dt * $yp->( $t , $y );\n\tpush @dy, $dt * $yp->( $t + $dt/2, $y + $dy[0]/2 );\n\tpush @dy, $dt * $yp->( $t + $dt/2, $y + $dy[1]/2 );\n\tpush @dy, $dt * $yp->( $t + $dt , $y + $dy[2] );\n\treturn $t + $dt, $y + ($dy[0] + 2*$dy[1] + 2*$dy[2] + $dy[3]) / 6;\n }\n}\n\nmy $RK = runge_kutta sub { $_[0] * sqrt $_[1] }, .1;\n\nfor(\n my ($t, $y) = (0, 1);\n sprintf(\"%.0f\", $t) <= 10;\n ($t, $y) = $RK->($t, $y)\n) {\n printf \"y(%2.0f) = %12f ± %e\\n\", $t, $y, abs($y - ($t**2 + 4)**2 / 16)\n if sprintf(\"%.4f\", $t) =~ /0000$/;\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">dt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0.1</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">y</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1.0</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" x true/actual y calculated y relative error\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" --- ------------- ------------- --------------\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">100</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">dt</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #004080;\">integer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">act</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">16</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%4.1f %14.9f %14.9f %.9e\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">act</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">abs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">act</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">k1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #7060A8;\">sqrt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">k2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">dt</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #7060A8;\">sqrt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">dt</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">k1</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">k3</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">dt</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #7060A8;\">sqrt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">dt</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">k2</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">k4</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">dt</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #7060A8;\">sqrt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">dt</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">k3</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">y</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">dt</span><span style=\"color: #0000FF;\">*(</span><span style=\"color: #000000;\">k1</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*(</span><span style=\"color: #000000;\">k2</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">k3</span><span style=\"color: #0000FF;\">)+</span><span style=\"color: #000000;\">k4</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">6</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"Runge_Kutta: procedure options (main); /* 10 March 2014 */\n declare (y, dy1, dy2, dy3, dy4) float (18);\n declare t fixed decimal (10,1);\n declare dt float (18) static initial (0.1);\n\n y = 1;\n do t = 0 to 10 by 0.1;\n dy1 = dt * ydash(t, y);\n dy2 = dt * ydash(t + dt/2, y + dy1/2);\n dy3 = dt * ydash(t + dt/2, y + dy2/2);\n dy4 = dt * ydash(t + dt, y + dy3);\n\n if mod(t, 1.0) = 0 then\n put skip edit('y(', trim(t), ')=', y, ', error = ', abs(y - (t**2 + 4)**2 / 16 ))\n (3 a, column(9), f(16,10), a, f(13,10));\n y = y + (dy1 + 2*dy2 + 2*dy3 + dy4)/6;\n end;\n\n\nydash: procedure (t, y) returns (float(18));\n declare (t, y) float (18) nonassignable;\n return ( t*sqrt(y) );\nend ydash;\n\nend Runge_kutta;\n","language":"PL-I"},{"code":"function Runge-Kutta (${function:F}, ${function:y}, $y0, $t0, $dt, $tEnd) {\n function RK ($tn,$yn) {\n $y1 = $dt*(F -t $tn -y $yn)\n $y2 = $dt*(F -t ($tn + (1/2)*$dt) -y ($yn + (1/2)*$y1))\n $y3 = $dt*(F -t ($tn + (1/2)*$dt) -y ($yn + (1/2)*$y2))\n $y4 = $dt*(F -t ($tn + $dt) -y ($yn + $y3))\n $yn + (1/6)*($y1 + 2*$y2 + 2*$y3 + $y4)\n }\n function time ($t0, $dt, $tEnd) {\n $end = [MATH]::Floor(($tEnd - $t0)/$dt)\n foreach ($_ in 0..$end) { $_*$dt + $t0 }\n }\n $time, $yn, $t = (time $t0 $dt $tEnd), $y0, 0\n foreach ($tn in $time) {\n if($t -eq $tn) {\n [pscustomobject]@{\n t = \"$tn\"\n y = \"$yn\"\n error = \"$([MATH]::abs($yn - (y $tn)))\"\n }\n $t += 1\n }\n $yn = RK $tn $yn\n }\n}\nfunction F ($t,$y) {\n $t * [MATH]::Sqrt($y)\n}\nfunction y ($t) {\n (1/16) * [MATH]::Pow($t*$t + 4,2)\n}\n$y0 = 1\n$t0 = 0\n$dt = 0.1\n$tEnd = 10\nRunge-Kutta F y $y0 $t0 $dt $tEnd\n","language":"PowerShell"},{"code":"EnableExplicit\nDefine.i i\nDefine.d y=1.0, k1=0.0, k2=0.0, k3=0.0, k4=0.0, t=0.0\n\nIf OpenConsole()\n For i=0 To 100\n t=i/10\n If Not i%10\n PrintN(\"y(\"+RSet(StrF(t,0),2,\" \")+\") =\"+RSet(StrF(y,4),9,\" \")+#TAB$+\"Error =\"+RSet(StrF(Pow(Pow(t,2)+4,2)/16-y,10),14,\" \"))\n EndIf\n k1=t*Sqr(y)\n k2=(t+0.05)*Sqr(y+0.05*k1)\n k3=(t+0.05)*Sqr(y+0.05*k2)\n k4=(t+0.10)*Sqr(y+0.10*k3)\n y+0.1*(k1+2*(k2+k3)+k4)/6\n Next\n Print(\"Press return to exit...\") : Input()\nEndIf\nEnd\n","language":"PureBasic"},{"code":"from math import sqrt\n\ndef rk4(f, x0, y0, x1, n):\n vx = [0] * (n + 1)\n vy = [0] * (n + 1)\n h = (x1 - x0) / float(n)\n vx[0] = x = x0\n vy[0] = y = y0\n for i in range(1, n + 1):\n k1 = h * f(x, y)\n k2 = h * f(x + 0.5 * h, y + 0.5 * k1)\n k3 = h * f(x + 0.5 * h, y + 0.5 * k2)\n k4 = h * f(x + h, y + k3)\n vx[i] = x = x0 + i * h\n vy[i] = y = y + (k1 + k2 + k2 + k3 + k3 + k4) / 6\n return vx, vy\n\ndef f(x, y):\n return x * sqrt(y)\n\nvx, vy = rk4(f, 0, 1, 10, 100)\nfor x, y in list(zip(vx, vy))[::10]:\n print(\"%4.1f %10.5f %+12.4e\" % (x, y, y - (4 + x * x)**2 / 16))\n\n 0.0 1.00000 +0.0000e+00\n 1.0 1.56250 -1.4572e-07\n 2.0 4.00000 -9.1948e-07\n 3.0 10.56250 -2.9096e-06\n 4.0 24.99999 -6.2349e-06\n 5.0 52.56249 -1.0820e-05\n 6.0 99.99998 -1.6595e-05\n 7.0 175.56248 -2.3518e-05\n 8.0 288.99997 -3.1565e-05\n 9.0 451.56246 -4.0723e-05\n10.0 675.99995 -5.0983e-05\n","language":"Python"},{"code":"y! = 1\nFOR i = 0 TO 100\n t = i / 10\n\n IF t = INT(t) THEN\n actual! = ((t ^ 2 + 4) ^ 2) / 16\n PRINT USING \"y(##) = ###.###### Error = \"; t; y;\n PRINT actual - y\n END IF\n\n k1! = t * SQR(y)\n k2! = (t + .05) * SQR(y + .05 * k1)\n k3! = (t + .05) * SQR(y + .05 * k2)\n k4! = (t + .1) * SQR(y + .1 * k3)\n y = y + .1 * (k1 + 2 * (k2 + k3) + k4) / 6\nNEXT i\n","language":"QBasic"},{"code":"rk4 <- function(f, x0, y0, x1, n) {\n vx <- double(n + 1)\n vy <- double(n + 1)\n vx[1] <- x <- x0\n vy[1] <- y <- y0\n h <- (x1 - x0)/n\n for(i in 1:n) {\n k1 <- h*f(x, y)\n k2 <- h*f(x + 0.5*h, y + 0.5*k1)\n k3 <- h*f(x + 0.5*h, y + 0.5*k2)\n k4 <- h*f(x + h, y + k3)\n vx[i + 1] <- x <- x0 + i*h\n vy[i + 1] <- y <- y + (k1 + k2 + k2 + k3 + k3 + k4)/6\n }\n cbind(vx, vy)\n}\n\nsol <- rk4(function(x, y) x*sqrt(y), 0, 1, 10, 100)\ncbind(sol, sol[, 2] - (4 + sol[, 1]^2)^2/16)[seq(1, 101, 10), ]\n\n vx vy\n [1,] 0 1.000000 0.000000e+00\n [2,] 1 1.562500 -1.457219e-07\n [3,] 2 3.999999 -9.194792e-07\n [4,] 3 10.562497 -2.909562e-06\n [5,] 4 24.999994 -6.234909e-06\n [6,] 5 52.562489 -1.081970e-05\n [7,] 6 99.999983 -1.659460e-05\n [8,] 7 175.562476 -2.351773e-05\n [9,] 8 288.999968 -3.156520e-05\n[10,] 9 451.562459 -4.072316e-05\n[11,] 10 675.999949 -5.098329e-05\n","language":"R"},{"code":"(define (RK4 F δt)\n (λ (t y)\n (define δy1 (* δt (F t y)))\n (define δy2 (* δt (F (+ t (* 1/2 δt)) (+ y (* 1/2 δy1)))))\n (define δy3 (* δt (F (+ t (* 1/2 δt)) (+ y (* 1/2 δy2)))))\n (define δy4 (* δt (F (+ t δt) (+ y δy1))))\n (list (+ t δt)\n (+ y (* 1/6 (+ δy1 (* 2 δy2) (* 2 δy3) δy4))))))\n","language":"Racket"},{"code":"(define ((step-subdivision n method) F h)\n (λ (x . y) (last (ODE-solve F (cons x y)\n #:x-max (+ x h)\n #:step (/ h n)\n #:method method))))\n","language":"Racket"},{"code":"(define (F t y) (* t (sqrt y)))\n\n(define (exact-solution t) (* 1/16 (sqr (+ 4 (sqr t)))))\n\n(define numeric-solution\n (ODE-solve F '(0 1) #:x-max 10 #:step 1 #:method (step-subdivision 10 RK4)))\n\n(for ([s numeric-solution])\n (match-define (list t y) s)\n (printf \"t=~a\\ty=~a\\terror=~a\\n\" t y (- y (exact-solution t))))\n","language":"Racket"},{"code":"> (require plot)\n> (plot (list (function exact-solution 0 10 #:label \"Exact solution\")\n (points numeric-solution #:label \"Runge-Kutta method\"))\n #:x-label \"t\" #:y-label \"y(t)\")\n","language":"Racket"},{"code":"sub runge-kutta(&yp) {\n return -> \\t, \\y, \\δt {\n my $a = δt * yp( t, y );\n my $b = δt * yp( t + δt/2, y + $a/2 );\n my $c = δt * yp( t + δt/2, y + $b/2 );\n my $d = δt * yp( t + δt, y + $c );\n ($a + 2*($b + $c) + $d) / 6;\n }\n}\n\nconstant δt = .1;\nmy &δy = runge-kutta { $^t * sqrt($^y) };\n\nloop (\n my ($t, $y) = (0, 1);\n $t <= 10;\n ($t, $y) »+=« (δt, δy($t, $y, δt))\n) {\n printf \"y(%2d) = %12f ± %e\\n\", $t, $y, abs($y - ($t**2 + 4)**2 / 16)\n if $t %% 1;\n}\n","language":"Raku"},{"code":"/*REXX program uses the Runge─Kutta method to solve the equation: y'(t) = t² √[y(t)] */\nnumeric digits 40; f= digits() % 4 /*use 40 decimal digs, but only show 10*/\nx0= 0; x1= 10; dx= .1 /*define variables: X0 X1 DX */\nn=1 + (x1-x0) / dx\ny.=1; do m=1 for n-1; p= m - 1; y.m= RK4(dx, x0 + dx*p, y.p)\n end /*m*/ /* [↑] use 4th order Runge─Kutta. */\nw= digits() % 2 /*W: width used for displaying numbers.*/\nsay center('X', f, \"═\") center('Y', w+2, \"═\") center(\"relative error\", w+8, '═') /*hdr*/\n\n do i=0 to n-1 by 10; x= (x0 + dx*i) / 1; $= y.i / (x*x/4+1)**2 - 1\n say center(x, f) fmt(y.i) left('', 2 + ($>=0) ) fmt($)\n end /*i*/ /*└┴┴┴───◄─────── aligns positive #'s. */\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nfmt: parse arg z; z= right( format(z, w, f), w); hasE= pos('E', z)>0; has.= pos(., z)>0\n jus= has. & \\hasE; T= 'T'; if jus then z= left( strip( strip(z, T, 0), T, .), w)\n return translate( right(z, (z>=0) + w + 5*hasE + 2*(jus & (z<0) ) ), 'e', \"E\")\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nRK4: procedure; parse arg dx,x,y; dxH= dx/2; k1= dx * (x ) * sqrt(y )\n k2= dx * (x + dxH) * sqrt(y + k1/2)\n k3= dx * (x + dxH) * sqrt(y + k2/2)\n k4= dx * (x + dx ) * sqrt(y + k3 )\n return y + (k1 + k2*2 + k3*2 + k4) / 6\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nsqrt: procedure; parse arg x; if x=0 then return 0; d=digits(); m.=9; numeric form; h=d+6\n numeric digits; parse value format(x,2,1,,0) 'E0' with g 'E' _ .; g=g * .5'e'_ % 2\n do j=0 while h>9; m.j=h; h=h%2+1; end /*j*/\n do k=j+5 to 0 by -1; numeric digits m.k; g=(g+x/g)*.5; end /*k*/; return g\n","language":"REXX"},{"code":"decimals(8)\ny = 1.0\nfor i = 0 to 100\n t = i / 10\n if t = floor(t)\n actual = (pow((pow(t,2) + 4),2)) / 16\n see \"y(\" + t + \") = \" + y + \" error = \" + (actual - y) + nl ok\n k1 = t * sqrt(y)\n k2 = (t + 0.05) * sqrt(y + 0.05 * k1)\n k3 = (t + 0.05) * sqrt(y + 0.05 * k2)\n k4 = (t + 0.10) * sqrt(y + 0.10 * k3)\n y += 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\nnext\n","language":"Ring"},{"code":"def calc_rk4(f)\n return ->(t,y,dt){\n ->(dy1 ){\n ->(dy2 ){\n ->(dy3 ){\n ->(dy4 ){ ( dy1 + 2*dy2 + 2*dy3 + dy4 ) / 6 }.call(\n dt * f.call( t + dt , y + dy3 ))}.call(\n dt * f.call( t + dt/2, y + dy2/2 ))}.call(\n dt * f.call( t + dt/2, y + dy1/2 ))}.call(\n dt * f.call( t , y ))}\nend\n\nTIME_MAXIMUM, WHOLE_TOLERANCE = 10.0, 1.0e-5\nT_START, Y_START, DT = 0.0, 1.0, 0.10\n\ndef my_diff_eqn(t,y) ; t * Math.sqrt(y) ; end\ndef my_solution(t ) ; (t**2 + 4)**2 / 16 ; end\ndef find_error(t,y) ; (y - my_solution(t)).abs ; end\ndef is_whole?(t ) ; (t.round - t).abs < WHOLE_TOLERANCE ; end\n\ndy = calc_rk4( ->(t,y){my_diff_eqn(t,y)} )\n\nt, y = T_START, Y_START\nwhile t <= TIME_MAXIMUM\n printf(\"y(%4.1f)\\t= %12.6f \\t error: %12.6e\\n\",t,y,find_error(t,y)) if is_whole?(t)\n t, y = t + DT, y + dy.call(t,y,DT)\nend\n","language":"Ruby"},{"code":"y\t= 1\nwhile t <= 10\n k1\t= t * sqr(y)\n k2\t= (t + .05) * sqr(y + .05 * k1)\n k3\t= (t + .05) * sqr(y + .05 * k2)\n k4\t= (t + .1) * sqr(y + .1 * k3)\n\nif right$(using(\"##.#\",t),1) = \"0\" then print \"y(\";using(\"##\",t);\") =\"; using(\"####.#######\", y);chr$(9);\"Error =\"; (((t^2 + 4)^2) /16) -y\n y = y + .1 *(k1 + 2 * (k2 + k3) + k4) / 6\n t = t + .1\nwend\nend\n","language":"Run-BASIC"},{"code":"fn runge_kutta4(fx: &dyn Fn(f64, f64) -> f64, x: f64, y: f64, dx: f64) -> f64 {\n let k1 = dx * fx(x, y);\n let k2 = dx * fx(x + dx / 2.0, y + k1 / 2.0);\n let k3 = dx * fx(x + dx / 2.0, y + k2 / 2.0);\n let k4 = dx * fx(x + dx, y + k3);\n\n y + (k1 + 2.0 * k2 + 2.0 * k3 + k4) / 6.0\n}\n\nfn f(x: f64, y: f64) -> f64 {\n x * y.sqrt()\n}\n\nfn actual(x: f64) -> f64 {\n (1.0 / 16.0) * (x * x + 4.0).powi(2)\n}\n\nfn main() {\n let mut y = 1.0;\n let mut x = 0.0;\n let step = 0.1;\n let max_steps = 101;\n let sample_every_n = 10;\n\n for steps in 0..max_steps {\n if steps % sample_every_n == 0 {\n println!(\"y({}):\\t{:.10}\\t\\t {:E}\", x, y, actual(x) - y)\n }\n\n y = runge_kutta4(&f, x, y, step);\n\n x = ((x * 10.0) + (step * 10.0)) / 10.0;\n }\n}\n","language":"Rust"},{"code":"object Main extends App {\n val f = (t: Double, y: Double) => t * Math.sqrt(y) // Runge-Kutta solution\n val g = (t: Double) => Math.pow(t * t + 4, 2) / 16 // Exact solution\n new Calculator(f, Some(g)).compute(100, 0, .1, 1)\n}\n\nclass Calculator(f: (Double, Double) => Double, g: Option[Double => Double] = None) {\n def compute(counter: Int, tn: Double, dt: Double, yn: Double): Unit = {\n if (counter % 10 == 0) {\n val c = (x: Double => Double) => (t: Double) => {\n val err = Math.abs(x(t) - yn)\n f\" Error: $err%7.5e\"\n }\n val s = g.map(c(_)).getOrElse((x: Double) => \"\") // If we don't have exact solution, just print nothing\n println(f\"y($tn%4.1f) = $yn%12.8f${s(tn)}\") // Else, print Error estimation here\n }\n if (counter > 0) {\n val dy1 = dt * f(tn, yn)\n val dy2 = dt * f(tn + dt / 2, yn + dy1 / 2)\n val dy3 = dt * f(tn + dt / 2, yn + dy2 / 2)\n val dy4 = dt * f(tn + dt, yn + dy3)\n val y = yn + (dy1 + 2 * dy2 + 2 * dy3 + dy4) / 6\n val t = tn + dt\n compute(counter - 1, t, dt, y)\n }\n }\n}\n","language":"Scala"},{"code":"func runge_kutta(yp) {\n func (t, y, δt) {\n var a = (δt * yp(t, y));\n var b = (δt * yp(t + δt/2, y + a/2));\n var c = (δt * yp(t + δt/2, y + b/2));\n var d = (δt * yp(t + δt, y + c));\n (a + 2*(b + c) + d) / 6;\n }\n}\n\ndefine δt = 0.1;\nvar δy = runge_kutta(func(t, y) { t * y.sqrt });\n\nvar(t, y) = (0, 1);\nloop {\n t.is_int &&\n printf(\"y(%2d) = %12f ± %e\\n\", t, y, abs(y - ((t**2 + 4)**2 / 16)));\n t <= 10 || break;\n y += δy(t, y, δt);\n t += δt;\n}\n","language":"Sidef"},{"code":"fun step y' (tn,yn) dt =\n let\n val dy1 = dt * y'(tn,yn)\n val dy2 = dt * y'(tn + 0.5 * dt, yn + 0.5 * dy1)\n val dy3 = dt * y'(tn + 0.5 * dt, yn + 0.5 * dy2)\n val dy4 = dt * y'(tn + dt, yn + dy3)\n in\n (tn + dt, yn + (1.0 / 6.0) * (dy1 + 2.0*dy2 + 2.0*dy3 + dy4))\n end\n\n(* Suggested test case *)\nfun testy' (t,y) =\n t * Math.sqrt y\n\nfun testy t =\n (1.0 / 16.0) * Math.pow(Math.pow(t,2.0) + 4.0, 2.0)\n\n(* Test-runner that iterates the step function and prints the results. *)\nfun test t0 y0 dt steps print_freq y y' =\n let\n fun loop i (tn,yn) =\n if i = steps then ()\n else\n let\n val (t1,y1) = step y' (tn,yn) dt\n val y1' = y tn\n val () = if i mod print_freq = 0 then\n (print (\"Time: \" ^ Real.toString tn ^ \"\\n\");\n print (\"Exact: \" ^ Real.toString y1' ^ \"\\n\");\n print (\"Approx: \" ^ Real.toString yn ^ \"\\n\");\n print (\"Error: \" ^ Real.toString (y1' - yn) ^ \"\\n\\n\"))\n else ()\n in\n loop (i+1) (t1,y1)\n end\n in\n loop 0 (t0,y0)\n end\n\n(* Run the suggested test case *)\nval () = test 0.0 1.0 0.1 101 10 testy testy'\n","language":"Standard-ML"},{"code":"function rk4(f, t0, y0, t1, n) {\n\th = (t1-t0)/(n-1)\n\ta = J(n, 2, 0)\n\ta[1, 1] = t = t0\n\ta[1, 2] = y = y0\n\tfor (i=2; i<=n; i++) {\n\t\tk1 = h*(*f)(t, y)\n\t\tk2 = h*(*f)(t+0.5*h, y+0.5*k1)\n\t\tk3 = h*(*f)(t+0.5*h, y+0.5*k2)\n\t\tk4 = h*(*f)(t+h, y+k3)\n\t\tt = t+h\n\t\ty = y+(k1+2*k2+2*k3+k4)/6\n\t\ta[i, 1] = t\n\t\ta[i, 2] = y\n\t}\n\treturn(a)\n}\n\nfunction f(t, y) {\n\treturn(t*sqrt(y))\n}\n\na = rk4(&f(), 0, 1, 10, 101)\nt = a[., 1]\na = a, a[., 2]:-(t:^2:+4):^2:/16\na[range(1,101,10), .]\n\n 1 2 3\n +----------------------------------------------+\n 1 | 0 1 0 |\n 2 | 1 1.562499854 -1.45722e-07 |\n 3 | 2 3.999999081 -9.19479e-07 |\n 4 | 3 10.56249709 -2.90956e-06 |\n 5 | 4 24.99999377 -6.23491e-06 |\n 6 | 5 52.56248918 -.0000108197 |\n 7 | 6 99.99998341 -.0000165946 |\n 8 | 7 175.5624765 -.0000235177 |\n 9 | 8 288.9999684 -.0000315652 |\n 10 | 9 451.5624593 -.0000407232 |\n 11 | 10 675.999949 -.0000509833 |\n +----------------------------------------------+\n","language":"Stata"},{"code":"import Foundation\n\nfunc rk4(dx: Double, x: Double, y: Double, f: (Double, Double) -> Double) -> Double {\n let k1 = dx * f(x, y)\n let k2 = dx * f(x + dx / 2, y + k1 / 2)\n let k3 = dx * f(x + dx / 2, y + k2 / 2)\n let k4 = dx * f(x + dx, y + k3)\n\n return y + (k1 + 2 * k2 + 2 * k3 + k4) / 6\n}\n\nvar y = [Double]()\nvar x: Double = 0.0\nvar y2: Double = 0.0\n\nvar x0: Double = 0.0\nvar x1: Double = 10.0\nvar dx: Double = 0.1\n\nvar i = 0\nvar n = Int(1 + (x1 - x0) / dx)\n\ny.append(1)\nfor i in 1..<n {\n y.append(rk4(dx, x: x0 + dx * (Double(i) - 1), y: y[i - 1]) { (x: Double, y: Double) -> Double in\n return x * sqrt(y)\n })\n}\n\nprint(\" x y rel. err.\")\nprint(\"------------------------------\")\n\nfor (var i = 0; i < n; i += 10) {\n x = x0 + dx * Double(i)\n y2 = pow(x * x / 4 + 1, 2)\n\n print(String(format: \"%2g %11.6g %11.5g\", x, y[i], y[i]/y2 - 1))\n}\n","language":"Swift"},{"code":"package require Tcl 8.5\n\n# Hack to bring argument function into expression\nproc tcl::mathfunc::dy {t y} {upvar 1 dyFn dyFn; $dyFn $t $y}\n\nproc rk4step {dyFn y* t* dt} {\n upvar 1 ${y*} y ${t*} t\n set dy1 [expr {$dt * dy($t, $y)}]\n set dy2 [expr {$dt * dy($t+$dt/2, $y+$dy1/2)}]\n set dy3 [expr {$dt * dy($t+$dt/2, $y+$dy2/2)}]\n set dy4 [expr {$dt * dy($t+$dt, $y+$dy3)}]\n set y [expr {$y + ($dy1 + 2*$dy2 + 2*$dy3 + $dy4)/6.0}]\n set t [expr {$t + $dt}]\n}\n\nproc y {t} {expr {($t**2 + 4)**2 / 16}}\nproc δy {t y} {expr {$t * sqrt($y)}}\n\nproc printvals {t y} {\n set err [expr {abs($y - [y $t])}]\n puts [format \"y(%.1f) = %.8f\\tError: %.8e\" $t $y $err]\n}\n\nset t 0.0\nset y 1.0\nset dt 0.1\nprintvals $t $y\nfor {set i 1} {$i <= 101} {incr i} {\n rk4step δy y t $dt\n if {$i%10 == 0} {\n\tprintvals $t $y\n }\n}\n","language":"Tcl"},{"code":"LET y = 1\nFOR i = 0 TO 100\n LET t = i / 10\n\n IF t = INT(t) THEN\n LET actual = ((t ^ 2 + 4) ^ 2) / 16\n PRINT \"y(\"; STR$(t); \") =\"; y ; TAB(20); \"Error = \"; actual - y\n END IF\n\n LET k1 = t * SQR(y)\n LET k2 = (t + 0.05) * SQR(y + 0.05 * k1)\n LET k3 = (t + 0.05) * SQR(y + 0.05 * k2)\n LET k4 = (t + 0.10) * SQR(y + 0.10 * k3)\n LET Y = Y + 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\nNEXT i\nEND\n","language":"True-BASIC"},{"code":"import math\n\nfn main() {\n\tmut t, mut k1, mut k2, mut k3, mut k4, mut y := 0.0, 0.0, 0.0, 0.0, 0.0, 1.0\n\tfor i in 0..101 {\n\t\tt = i / 10.0\n\t\tif t == math.floor(t) {\n\t\t\tactual := math.pow((math.pow(t, 2) + 4), 2)/16\n\t\t\tprintln(\"y(${t:.0}) = ${y:.8f} error = ${(actual - y):.8f}\")\n\t\t}\n\t\tk1 = t * math.sqrt(y)\n\t\tk2 = (t + 0.05) * math.sqrt(y + 0.05 * k1)\n\t\tk3 = (t + 0.05) * math.sqrt(y + 0.05 * k2)\n\t\tk4 = (t + 0.10) * math.sqrt(y + 0.10 * k3)\n\t\ty += 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\n\t}\n}\n","language":"V-(Vlang)"},{"code":"import \"./fmt\" for Fmt\n\nvar rungeKutta4 = Fn.new { |t0, tz, dt, y, yd|\n var tn = t0\n var yn = y.call(tn)\n var z = ((tz - t0)/dt).truncate\n for (i in 0..z) {\n if (i % 10 == 0) {\n var exact = y.call(tn)\n var error = yn - exact\n Fmt.print(\"$4.1f $10f $10f $9f\", tn, yn, exact, error)\n }\n if (i == z) break\n var dy1 = dt * yd.call(tn, yn)\n var dy2 = dt * yd.call(tn + 0.5 * dt, yn + 0.5 * dy1)\n var dy3 = dt * yd.call(tn + 0.5 * dt, yn + 0.5 * dy2)\n var dy4 = dt * yd.call(tn + dt, yn + dy3)\n yn = yn + (dy1 + 2.0 * dy2 + 2.0 * dy3 + dy4) / 6.0\n tn = tn + dt\n }\n}\n\nSystem.print(\" T RK4 Exact Error\")\nSystem.print(\"---- --------- ---------- ---------\")\nvar y = Fn.new { |t|\n var x = t * t + 4.0\n return x * x / 16.0\n}\nvar yd = Fn.new { |t, yt| t * yt.sqrt }\nrungeKutta4.call(0, 10, 0.1, y, yd)\n","language":"Wren"},{"code":"func real Y_(T, Y);\nreal T, Y;\nreturn T*sqrt(Y);\n\ndef DT = 0.1;\nreal T, Y, Exact, DY1, DY2, DY3, DY4;\n[Text(0, \" T RK Exact Error^m^j\");\nT:= 0.; Y:= 1.;\nrepeat if Mod(T+.001, 1.) < .01 then\n [Format(2, 1);\n RlOut(0, T);\n Format(5, 7);\n RlOut(0, Y);\n Exact:= sq(T*T+4.)/16.;\n RlOut(0, Exact);\n RlOut(0, Y-Exact);\n CrLf(0);\n ];\n DY1:= DT * Y_(T, Y);\n DY2:= DT * Y_(T+DT/2., Y+DY1/2.);\n DY3:= DT * Y_(T+DT/2., Y+DY2/2.);\n DY4:= DT * Y_(T+DT, Y+DY3);\n Y:= Y + (DY1 + 2.*DY2 + 2.*DY3 + DY4) / 6.;\n T:= T + DT;\nuntil T > 10.;\n]\n","language":"XPL0"},{"code":"fcn yp(t,y) { t * y.sqrt() }\nfcn exact(t){ u:=0.25*t*t + 1.0; u*u }\n\nfcn rk4_step([(y,t)],h){\n k1:=h * yp(t,y);\n k2:=h * yp(t + 0.5*h, y + 0.5*k1);\n k3:=h * yp(t + 0.5*h, y + 0.5*k2);\n k4:=h * yp(t + h, y + k3);\n T(y + (k1+k4)/6.0 + (k2+k3)/3.0, t + h);\n}\n\nfcn loop(h,n,[(y,t)]){\n if(n % 10 == 1)\n print(\"t = %f,\\ty = %f,\\terr = %g\\n\".fmt(t,y,(y - exact(t)).abs()));\n if(n < 102) return(loop(h,(n+1),rk4_step(T(y,t),h))) //tail recursion\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Runge-Kutta_method\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Given the example Differential equation:\\n:<math>y'(t) = t \\\\times \\\\sqrt {y(t)}</math>\\nWith initial condition:\\n:<math>t_0 = 0</math> and <math>y_0 = y(t_0) = y(0) = 1</math>\\nThis equation has an exact solution:\\n:<math>y(t) = \\\\tfrac{1}{16}(t^2 +4)^2</math>\\n\\n\\n;Task\\nDemonstrate the commonly used explicit [[wp:Runge–Kutta_methods#Common_fourth-order_Runge.E2.80.93Kutta_method|fourth-order Runge–Kutta method]] to solve the above differential equation.\\n* Solve the given differential equation over the range <math>t = 0 \\\\ldots 10</math> with a step value of <math>\\\\delta t=0.1</math> (101 total points, the first being given)\\n* Print the calculated values of <math>y</math> at whole numbered <math>t</math>'s (<math>0.0, 1.0, \\\\ldots 10.0</math>) along with error as compared to the exact solution.\\n\\n\\n;Method summary\\nStarting with a given <math>y_n</math> and <math>t_n</math> calculate:\\n:<math>\\\\delta y_1 = \\\\delta t\\\\times y'(t_n, y_n)\\\\quad</math>\\n:<math>\\\\delta y_2 = \\\\delta t\\\\times y'(t_n + \\\\tfrac{1}{2}\\\\delta t , y_n + \\\\tfrac{1}{2}\\\\delta y_1)</math>\\n:<math>\\\\delta y_3 = \\\\delta t\\\\times y'(t_n + \\\\tfrac{1}{2}\\\\delta t , y_n + \\\\tfrac{1}{2}\\\\delta y_2)</math>\\n:<math>\\\\delta y_4 = \\\\delta t\\\\times y'(t_n + \\\\delta t , y_n + \\\\delta y_3)\\\\quad</math>\\nthen:\\n:<math>y_{n+1} = y_n + \\\\tfrac{1}{6} (\\\\delta y_1 + 2\\\\delta y_2 + 2\\\\delta y_3 + \\\\delta y_4)</math>\\n:<math>t_{n+1} = t_n + \\\\delta t\\\\quad</math>\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F rk4(f, x0, y0, x1, n)\\n V vx = [0.0] * (n + 1)\\n V vy = [0.0] * (n + 1)\\n V h = (x1 - x0) / Float(n)\\n V x = x0\\n V y = y0\\n vx[0] = x\\n vy[0] = y\\n L(i) 1..n\\n V k1 = h * f(x, y)\\n V k2 = h * f(x + 0.5 * h, y + 0.5 * k1)\\n V k3 = h * f(x + 0.5 * h, y + 0.5 * k2)\\n V k4 = h * f(x + h, y + k3)\\n vx[i] = x = x0 + i * h\\n vy[i] = y = y + (k1 + k2 + k2 + k3 + k3 + k4) / 6\\n R (vx, vy)\\n\\nF f(Float x, Float y) -> Float\\n R x * sqrt(y)\\n\\nV (vx, vy) = rk4(f, 0.0, 1.0, 10.0, 100)\\nL(x, y) zip(vx, vy)[(0..).step(10)]\\n print(‘#2.1 #4.5 #2.8’.format(x, y, y - (4 + x * x) ^ 2 / 16))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"INCLUDE \\\"D2:PRINTF.ACT\\\" ;from the Action! Tool Kit\\nINCLUDE \\\"H6:REALMATH.ACT\\\"\\n\\nDEFINE PTR=\\\"CARD\\\"\\n\\nREAL one,two,four,six\\n\\nPROC Init()\\n IntToReal(1,one)\\n IntToReal(2,two)\\n IntToReal(4,four)\\n IntToReal(6,six)\\nRETURN\\n\\nPROC Fun=*(REAL POINTER x,y,res)\\n DEFINE JSR=\\\"$20\\\"\\n DEFINE RTS=\\\"$60\\\"\\n [JSR $00 $00 ;JSR to address set by SetFun\\n RTS]\\n\\nPROC SetFun(PTR p)\\n PTR addr\\n\\n addr=Fun+1 ;location of address of JSR\\n PokeC(addr,p)\\nRETURN\\n\\nPROC Rate(REAL POINTER x,y,res)\\n REAL tmp\\n\\n Sqrt(y,tmp) ;tmp=sqrt(y)\\n RealMult(x,tmp,res) ;res=x*sqrt(y)\\nRETURN\\n\\nPROC RK4(PTR f REAL POINTER dx,x,y,res)\\n REAL k1,k2,k3,k4,dx2,k12,k22,tmp1,tmp2,tmp3\\n\\n SetFun(f)\\n Fun(x,y,tmp1) ;tmp1=f(x,y)\\n RealMult(dx,tmp1,k1) ;k1=dx*f(x,y)\\n\\n RealDiv(dx,two,dx2) ;dx2=dx/2\\n RealDiv(k1,two,k12) ;k12=k1/2\\n RealAdd(x,dx2,tmp1) ;tmp1=x+dx/2\\n RealAdd(y,k12,tmp2) ;tmp2=y+k1/2\\n Fun(tmp1,tmp2,tmp3) ;tmp3=f(x+dx/2,y+k1/2)\\n RealMult(dx,tmp3,k2) ;k2=dx*f(x+dx/2,y+k1/2)\\n\\n RealDiv(k2,two,k22) ;k22=k2/2\\n RealAdd(y,k22,tmp2) ;tmp2=y+k2/2\\n Fun(tmp1,tmp2,tmp3) ;tmp3=f(x+dx/2,y+k2/2)\\n RealMult(dx,tmp3,k3) ;k3=dx*f(x+dx/2,y+k2/2)\\n\\n RealAdd(x,dx,tmp1) ;tmp1=x+dx\\n RealAdd(y,k3,tmp2) ;tmp2=y+k3\\n Fun(tmp1,tmp2,tmp3) ;tmp3=f(x+dx,y+k3)\\n RealMult(dx,tmp3,k4) ;k4=dx*f(x+dx,y+k3)\\n\\n RealAdd(k2,k3,tmp1) ;tmp1=k2+k3\\n RealMult(two,tmp1,tmp2) ;tmp2=2*k2+2*k3\\n RealAdd(k1,tmp2,tmp1) ;tmp3=k1+2*k2+2*k3\\n RealAdd(tmp1,k4,tmp2) ;tmp2=k1+2*k2+2*k3+k4\\n RealDiv(tmp2,six,tmp1) ;tmp1=(k1+2*k2+2*k3+k4)/6\\n RealAdd(y,tmp1,res) ;res=y+(k1+2*k2+2*k3+k4)/6\\nRETURN\\n\\nPROC Calc(REAL POINTER x,res)\\n REAL tmp1,tmp2\\n\\n RealMult(x,x,tmp1) ;tmp1=x*x\\n RealDiv(tmp1,four,tmp2) ;tmp2=x*x/4\\n RealAdd(tmp2,one,tmp1) ;tmp1=x*x/4+1\\n Power(tmp1,two,res) ;res=(x*x/4+1)^2\\nRETURN\\n\\nPROC RelError(REAL POINTER a,b,res)\\n REAL tmp\\n\\n RealDiv(a,b,tmp) ;tmp=a/b\\n RealSub(tmp,one,res) ;res=a/b-1\\nRETURN\\n\\nPROC Main()\\n REAL x0,x1,x,dx,y,y2,err,tmp1,tmp2\\n CHAR ARRAY s(20)\\n INT i,n\\n\\n Put(125) PutE() ;clear the screen\\n MathInit()\\n Init()\\n PrintF(\\\"%-2S %-11S %-8S%E\\\",\\\"x\\\",\\\"y\\\",\\\"rel err\\\")\\n\\n IntToReal(0,x0)\\n IntToReal(10,x1)\\n ValR(\\\"0.1\\\",dx)\\n\\n RealSub(x1,x0,tmp1) ;tmp1=x1-x0\\n RealDiv(tmp1,dx,tmp2) ;tmp2=(x1-x0)/dx\\n n=RealToInt(tmp2) ;n=(x1-x0)/dx\\n i=0\\n IntToReal(1,y)\\n DO\\n IntToReal(i,tmp1) ;tmp1=i\\n RealMult(dx,tmp1,tmp2) ;tmp2=i*dx\\n RealAdd(x0,tmp2,x) ;x=x0+i*dx\\n\\n IF i MOD 10=0 THEN\\n Calc(x,y2)\\n RelError(y,y2,err)\\n StrR(x,s) PrintF(\\\"%-2S \\\",s)\\n StrR(y,s) PrintF(\\\"%-11S \\\",s)\\n StrR(err,s) PrintF(\\\"%-8S%E\\\",s)\\n FI\\n\\n i==+1\\n IF i>n THEN EXIT FI\\n\\n RK4(rate,dx,x,y,tmp1) ;tmp1=rk4(rate,dx,x0+dx*(i-1),y)\\n RealAssign(tmp1,y) ;y=rk4(rate,dx,x0+dx*(i-1),y)\\n OD\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\nwith Ada.Numerics.Generic_Elementary_Functions;\\nprocedure RungeKutta is\\n type Floaty is digits 15;\\n type Floaty_Array is array (Natural range <>) of Floaty;\\n package FIO is new Ada.Text_IO.Float_IO(Floaty); use FIO;\\n type Derivative is access function(t, y : Floaty) return Floaty;\\n package Math is new Ada.Numerics.Generic_Elementary_Functions (Floaty);\\n function calc_err (t, calc : Floaty) return Floaty;\\n\\n procedure Runge (yp_func : Derivative; t, y : in out Floaty_Array;\\n dt : Floaty) is\\n dy1, dy2, dy3, dy4 : Floaty;\\n begin\\n for n in t'First .. t'Last-1 loop\\n dy1 := dt * yp_func(t(n), y(n));\\n dy2 := dt * yp_func(t(n) + dt / 2.0, y(n) + dy1 / 2.0);\\n dy3 := dt * yp_func(t(n) + dt / 2.0, y(n) + dy2 / 2.0);\\n dy4 := dt * yp_func(t(n) + dt, y(n) + dy3);\\n t(n+1) := t(n) + dt;\\n y(n+1) := y(n) + (dy1 + 2.0 * (dy2 + dy3) + dy4) / 6.0;\\n end loop;\\n end Runge;\\n\\n procedure Print (t, y : Floaty_Array; modnum : Positive) is begin\\n for i in t'Range loop\\n if i mod modnum = 0 then\\n Put(\\\"y(\\\"); Put (t(i), Exp=>0, Fore=>0, Aft=>1);\\n Put(\\\") = \\\"); Put (y(i), Exp=>0, Fore=>0, Aft=>8);\\n Put(\\\" Error:\\\"); Put (calc_err(t(i),y(i)), Aft=>5);\\n New_Line;\\n end if;\\n end loop;\\n end Print;\\n\\n function yprime (t, y : Floaty) return Floaty is begin\\n return t * Math.Sqrt (y);\\n end yprime;\\n function calc_err (t, calc : Floaty) return Floaty is\\n actual : constant Floaty := (t**2 + 4.0)**2 / 16.0;\\n begin return abs(actual-calc);\\n end calc_err;\\n\\n dt : constant Floaty := 0.10;\\n N : constant Positive := 100;\\n t_arr, y_arr : Floaty_Array(0 .. N);\\nbegin\\n t_arr(0) := 0.0;\\n y_arr(0) := 1.0;\\n Runge (yprime'Access, t_arr, y_arr, dt);\\n Print (t_arr, y_arr, 10);\\nend RungeKutta;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"BEGIN\\n PROC rk4 = (PROC (REAL, REAL) REAL f, REAL y, x, dx) REAL :\\n BEGIN CO Fourth-order Runge-Kutta method CO\\n REAL dy1 = dx * f(x, y);\\n REAL dy2 = dx * f(x + dx / 2.0, y + dy1 / 2.0);\\n REAL dy3 = dx * f(x + dx / 2.0, y + dy2 / 2.0);\\n REAL dy4 = dx * f(x + dx, y + dy3);\\n y + (dy1 + 2.0 * dy2 + 2.0 * dy3 + dy4) / 6.0\\n END;\\n REAL x0 = 0, x1 = 10, y0 = 1.0;\\t\\t\\tCO Boundary conditions. CO\\n REAL dx = 0.1;\\t\\t\\t\\t\\tCO Step size. CO\\n INT num points = ENTIER ((x1 - x0) / dx + 0.5);\\tCO Add 0.5 for rounding errors. CO\\n [0:num points]REAL y; y[0] := y0;\\t\\t\\tCO Grid and starting point.CO\\n PROC dy by dx = (REAL x, y) REAL : x * sqrt(y);\\tCO Differential equation. CO\\n FOR i TO num points\\n DO\\n y[i] := rk4 (dy by dx, y[i-1], x0 + dx * (i - 1), dx)\\n OD;\\n print ((\\\" x true y calc y relative error\\\", newline));\\n FOR i FROM 0 BY 10 TO num points\\n DO\\n REAL x = x0 + dx * i;\\n REAL true y = (x * x + 4.0) ^ 2 / 16.0;\\n printf (($3(-zzd.7dxxx), -d.4de-ddl$, x, true y, y[i], y[i] / true y - 1.0))\\n OD\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin\\n real procedure rk4 ( real procedure f ; real value y, x, dx ) ;\\n begin % Fourth-order Runge-Kutta method %\\n real dy1, dy2, dy3, dy4;\\n dy1 := dx * f(x, y);\\n dy2 := dx * f(x + dx / 2.0, y + dy1 / 2.0);\\n dy3 := dx * f(x + dx / 2.0, y + dy2 / 2.0);\\n dy4 := dx * f(x + dx, y + dy3);\\n y + (dy1 + 2.0 * dy2 + 2.0 * dy3 + dy4) / 6.0\\n end rk4;\\n real x0, x1, y0, dx;\\n integer numPoints;\\n x0 := 0; x1 := 10; y0 := 1.0; % Boundary conditions. %\\n dx := 0.1; % Step size. %\\n numPoints := entier ((x1 - x0) / dx + 0.5); % Add 0.5 for rounding errors. %\\n begin\\n real procedure dyByDx ( real value x, y ) ; x * sqrt(y); % Differential equation. %\\n real array y ( 0 :: numPoints); y(0) := y0; % Grid and starting point. %\\n for i := 1 until numPoints do y(i) := rk4 (dyByDx, y(i-1), x0 + dx * (i - 1), dx);\\n write( \\\" x true y calc y relative error\\\" );\\n for i := 0 step 10 until numPoints do begin\\n real x, trueY;\\n x := x0 + dx * i;\\n trueY := (x * x + 4.0) ** 2 / 16.0;\\n write( r_format := \\\"A\\\", r_w := 12, r_d := 7, s_w := 3, x, trueY, y( i )\\n , r_format := \\\"S\\\", r_w := 12, y( i ) / trueY - 1\\n )\\n end for_i\\n end\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \" ∇RK4[⎕]∇\\n ∇\\n[0] Z←R(Y¯ RK4)Y;T;YN;TN;∆T;∆Y1;∆Y2;∆Y3;∆Y4\\n[1] (T R ∆T)←R\\n[2] LOOP:→(R≤TN←¯1↑T)/EXIT\\n[3] ∆Y1←∆T×TN Y¯ YN←¯1↑Y\\n[4] ∆Y2←∆T×(TN+∆T÷2)Y¯ YN+∆Y1÷2\\n[5] ∆Y3←∆T×(TN+∆T÷2)Y¯ YN+∆Y2÷2\\n[6] ∆Y4←∆T×(TN+∆T)Y¯ YN+∆Y3\\n[7] Y←Y,YN+(∆Y1+(2×∆Y2)+(2×∆Y3)+∆Y4)÷6\\n[8] T←T,TN+∆T\\n[9] →LOOP\\n[10] EXIT:Z←T,[⎕IO+.5]Y\\n ∇\\n\\n ∇PRINT[⎕]∇\\n ∇\\n[0] PRINT;TABLE\\n[1] TABLE←0 10 .1({⍺×⍵*.5}RK4)1\\n[2] ⎕←'T' 'RK4 Y' 'ERROR'⍪TABLE,TABLE[;2]-{((4+⍵*2)*2)÷16}TABLE[;1]\\n ∇\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"# syntax: GAWK -f RUNGE-KUTTA_METHOD.AWK\\n# converted from BBC BASIC\\nBEGIN {\\n print(\\\" t y error\\\")\\n y = 1\\n for (i=0; i<=100; i++) {\\n t = i / 10\\n if (t == int(t)) {\\n actual = ((t^2+4)^2) / 16\\n printf(\\\"%2d %12.7f %g\\\\n\\\",t,y,actual-y)\\n }\\n k1 = t * sqrt(y)\\n k2 = (t + 0.05) * sqrt(y + 0.05 * k1)\\n k3 = (t + 0.05) * sqrt(y + 0.05 * k2)\\n k4 = (t + 0.10) * sqrt(y + 0.10 * k3)\\n y += 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\\n }\\n exit(0)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"y = 1\\nfor i = 0 to 100\\n t = i / 10\\n\\n if t = int(t) then\\n\\tactual = ((t ^ 2 + 4) ^ 2) / 16\\n\\tprint \\\"y(\\\"; int(t); \\\") = \\\"; left(string(y), 13), \\\"Error = \\\"; left(string(actual - y), 13)\\n end if\\n\\n k1 = t * sqr(y)\\n k2 = (t + 0.05) * sqr(y + 0.05 * k1)\\n k3 = (t + 0.05) * sqr(y + 0.05 * k2)\\n k4 = (t + 0.10) * sqr(y + 0.10 * k3)\\n y = y + 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\\nnext i\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \" y = 1.0\\n FOR i% = 0 TO 100\\n t = i% / 10\\n\\n IF t = INT(t) THEN\\n actual = ((t^2 + 4)^2) / 16\\n PRINT \\\"y(\\\"; t \\\") = \\\"; y TAB(20) \\\"Error = \\\"; actual - y\\n ENDIF\\n\\n k1 = t * SQR(y)\\n k2 = (t + 0.05) * SQR(y + 0.05 * k1)\\n k3 = (t + 0.05) * SQR(y + 0.05 * k2)\\n k4 = (t + 0.10) * SQR(y + 0.10 * k3)\\n y += 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\\n NEXT i%\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <math.h>\\n\\ndouble rk4(double(*f)(double, double), double dx, double x, double y)\\n{\\n\\tdouble\\tk1 = dx * f(x, y),\\n\\t\\tk2 = dx * f(x + dx / 2, y + k1 / 2),\\n\\t\\tk3 = dx * f(x + dx / 2, y + k2 / 2),\\n\\t\\tk4 = dx * f(x + dx, y + k3);\\n\\treturn y + (k1 + 2 * k2 + 2 * k3 + k4) / 6;\\n}\\n\\ndouble rate(double x, double y)\\n{\\n\\treturn x * sqrt(y);\\n}\\n\\nint main(void)\\n{\\n\\tdouble *y, x, y2;\\n\\tdouble x0 = 0, x1 = 10, dx = .1;\\n\\tint i, n = 1 + (x1 - x0)/dx;\\n\\ty = (double *)malloc(sizeof(double) * n);\\n\\n\\tfor (y[0] = 1, i = 1; i < n; i++)\\n\\t\\ty[i] = rk4(rate, dx, x0 + dx * (i - 1), y[i-1]);\\n\\n\\tprintf(\\\"x\\\\ty\\\\trel. err.\\\\n------------\\\\n\\\");\\n\\tfor (i = 0; i < n; i += 10) {\\n\\t\\tx = x0 + dx * i;\\n\\t\\ty2 = pow(x * x / 4 + 1, 2);\\n\\t\\tprintf(\\\"%g\\\\t%g\\\\t%g\\\\n\\\", x, y[i], y[i]/y2 - 1);\\n\\t}\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"/*\\n * compiled with:\\n * g++ (Debian 8.3.0-6) 8.3.0\\n *\\n * g++ -std=c++14 -o rk4 %\\n *\\n */\\n# include <iostream>\\n# include <math.h>\\n\\nauto rk4(double f(double, double))\\n{\\n return [f](double t, double y, double dt) -> double {\\n double dy1 { dt * f( t , y ) },\\n dy2 { dt * f( t+dt/2, y+dy1/2 ) },\\n dy3 { dt * f( t+dt/2, y+dy2/2 ) },\\n dy4 { dt * f( t+dt , y+dy3 ) };\\n return ( dy1 + 2*dy2 + 2*dy3 + dy4 ) / 6;\\n };\\n}\\n\\nint main(void)\\n{\\n constexpr\\n double TIME_MAXIMUM { 10.0 },\\n T_START { 0.0 },\\n Y_START { 1.0 },\\n DT { 0.1 },\\n WHOLE_TOLERANCE { 1e-12 };\\n\\n auto dy = rk4( [](double t, double y) -> double { return t*sqrt(y); } ) ;\\n\\n for (\\n auto y { Y_START }, t { T_START };\\n t <= TIME_MAXIMUM;\\n y += dy(t,y,DT), t += DT\\n )\\n if (ceilf(t)-t < WHOLE_TOLERANCE)\\n printf(\\\"y(%4.1f)\\\\t=%12.6f \\\\t error: %12.6e\\\\n\\\", t, y, std::fabs(y - pow(t*t+4,2)/16));\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nnamespace RungeKutta\\n{\\n class Program\\n {\\n static void Main(string[] args)\\n {\\n //Incrementers to pass into the known solution\\n double t = 0.0;\\n double T = 10.0;\\n double dt = 0.1;\\n\\n // Assign the number of elements needed for the arrays\\n int n = (int)(((T - t) / dt)) + 1;\\n\\n // Initialize the arrays for the time index 's' and estimates 'y' at each index 'i'\\n double[] y = new double[n];\\n double[] s = new double[n];\\n\\n // RK4 Variables\\n double dy1;\\n double dy2;\\n double dy3;\\n double dy4;\\n\\n // RK4 Initializations\\n int i = 0;\\n s[i] = 0.0;\\n y[i] = 1.0;\\n\\n Console.WriteLine(\\\" ===================================== \\\");\\n Console.WriteLine(\\\" Beging 4th Order Runge Kutta Method \\\");\\n Console.WriteLine(\\\" ===================================== \\\");\\n\\n Console.WriteLine();\\n Console.WriteLine(\\\" Given the example Differential equation: \\\\n\\\");\\n Console.WriteLine(\\\" y' = t*sqrt(y) \\\\n\\\");\\n Console.WriteLine(\\\" With the initial conditions: \\\\n\\\");\\n Console.WriteLine(\\\" t0 = 0\\\" + \\\", y(0) = 1.0 \\\\n\\\");\\n Console.WriteLine(\\\" Whose exact solution is known to be: \\\\n\\\");\\n Console.WriteLine(\\\" y(t) = 1/16*(t^2 + 4)^2 \\\\n\\\");\\n Console.WriteLine(\\\" Solve the given equations over the range t = 0...10 with a step value dt = 0.1 \\\\n\\\");\\n Console.WriteLine(\\\" Print the calculated values of y at whole numbered t's (0.0,1.0,...10.0) along with the error \\\\n\\\");\\n Console.WriteLine();\\n\\n Console.WriteLine(\\\" y(t) \\\" +\\\"RK4\\\" + \\\" \\\".PadRight(18) + \\\"Absolute Error\\\");\\n Console.WriteLine(\\\" -------------------------------------------------\\\");\\n Console.WriteLine(\\\" y(0) \\\" + y[i] + \\\" \\\".PadRight(20) + (y[i] - solution(s[i])));\\n\\n // Iterate and implement the Rk4 Algorithm\\n while (i < y.Length - 1)\\n {\\n\\n dy1 = dt * equation(s[i], y[i]);\\n dy2 = dt * equation(s[i] + dt / 2, y[i] + dy1 / 2);\\n dy3 = dt * equation(s[i] + dt / 2, y[i] + dy2 / 2);\\n dy4 = dt * equation(s[i] + dt, y[i] + dy3);\\n\\n s[i + 1] = s[i] + dt;\\n y[i + 1] = y[i] + (dy1 + 2 * dy2 + 2 * dy3 + dy4) / 6;\\n\\n double error = Math.Abs(y[i + 1] - solution(s[i + 1]));\\n double t_rounded = Math.Round(t + dt, 2);\\n\\n if (t_rounded % 1 == 0)\\n {\\n Console.WriteLine(\\\" y(\\\" + t_rounded + \\\")\\\" + \\\" \\\" + y[i + 1] + \\\" \\\".PadRight(5) + (error));\\n }\\n\\n i++;\\n t += dt;\\n\\n };//End Rk4\\n\\n Console.ReadLine();\\n }\\n\\n // Differential Equation\\n public static double equation(double t, double y)\\n {\\n double y_prime;\\n return y_prime = t*Math.Sqrt(y);\\n }\\n\\n // Exact Solution\\n public static double solution(double t)\\n {\\n double actual;\\n actual = Math.Pow((Math.Pow(t, 2) + 4), 2)/16;\\n return actual;\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defun runge-kutta (f x y x-end n)\\n (let ((h (float (/ (- x-end x) n) 1d0))\\n k1 k2 k3 k4)\\n (setf x (float x 1d0)\\n y (float y 1d0))\\n (cons (cons x y)\\n (loop for i below n do\\n (setf k1 (* h (funcall f x y))\\n k2 (* h (funcall f (+ x (* 0.5d0 h)) (+ y (* 0.5d0 k1))))\\n k3 (* h (funcall f (+ x (* 0.5d0 h)) (+ y (* 0.5d0 k2))))\\n k4 (* h (funcall f (+ x h) (+ y k3)))\\n x (+ x h)\\n y (+ y (/ (+ k1 k2 k2 k3 k3 k4) 6)))\\n collect (cons x y)))))\\n\\n(let ((sol (runge-kutta (lambda (x y) (* x (sqrt y))) 0 1 10 100)))\\n (loop for n from 0\\n for (x . y) in sol\\n when (zerop (mod n 10))\\n collect (list x y (- y (/ (expt (+ 4 (* x x)) 2) 16)))))\\n\\n((0.0d0 1.0d0 0.0d0)\\n (0.9999999999999999d0 1.562499854278108d0 -1.4572189210859676d-7)\\n (2.0000000000000004d0 3.9999990805207988d0 -9.194792029987298d-7)\\n (3.0000000000000013d0 10.562497090437557d0 -2.9095624576314094d-6)\\n (4.000000000000002d0 24.999993765090643d0 -6.234909392333066d-6)\\n (4.999999999999998d0 52.56248918030259d0 -1.081969734428867d-5)\\n (5.999999999999995d0 99.9999834054036d0 -1.659459609015812d-5)\\n (6.999999999999991d0 175.56247648227117d0 -2.3517728038768837d-5)\\n (7.999999999999988d0 288.9999684347983d0 -3.156520000402452d-5)\\n (8.999999999999984d0 451.56245927683887d0 -4.072315812209126d-5)\\n (9.99999999999998d0 675.9999490167083d0 -5.0983286655537086d-5))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"y, t = 1, 0\\nwhile t <= 10\\n k1\\t= t * Math.sqrt(y)\\n k2\\t= (t + 0.05) * Math.sqrt(y + 0.05 * k1)\\n k3\\t= (t + 0.05) * Math.sqrt(y + 0.05 * k2)\\n k4\\t= (t + 0.1) * Math.sqrt(y + 0.1 * k3)\\n\\n printf(\\\"y(%4.1f)\\\\t= %12.6f \\\\t error: %12.6e\\\\n\\\", t, y, (((t**2 + 4)**2 / 16) - y )) if (t.round - t).abs < 1.0e-5\\n y += 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\\n t += 0.1\\nend\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio, std.math, std.typecons;\\n\\nalias FP = real;\\nalias FPs = Typedef!(FP[101]);\\n\\nvoid runge(in FP function(in FP, in FP)\\n pure nothrow @safe @nogc yp_func,\\n ref FPs t, ref FPs y, in FP dt) pure nothrow @safe @nogc {\\n foreach (immutable n; 0 .. t.length - 1) {\\n immutable FP\\n dy1 = dt * yp_func(t[n], y[n]),\\n dy2 = dt * yp_func(t[n] + dt / 2.0, y[n] + dy1 / 2.0),\\n dy3 = dt * yp_func(t[n] + dt / 2.0, y[n] + dy2 / 2.0),\\n dy4 = dt * yp_func(t[n] + dt, y[n] + dy3);\\n t[n + 1] = t[n] + dt;\\n y[n + 1] = y[n] + (dy1 + 2.0 * (dy2 + dy3) + dy4) / 6.0;\\n }\\n}\\n\\nFP calc_err(in FP t, in FP calc) pure nothrow @safe @nogc {\\n immutable FP actual = (t ^^ 2 + 4.0) ^^ 2 / 16.0;\\n return abs(actual - calc);\\n}\\n\\nvoid main() {\\n enum FP dt = 0.10;\\n FPs t_arr, y_arr;\\n\\n t_arr[0] = 0.0;\\n y_arr[0] = 1.0;\\n runge((t, y) => t * y.sqrt, t_arr, y_arr, dt);\\n\\n foreach (immutable i; 0 .. t_arr.length)\\n if (i % 10 == 0)\\n writefln(\\\"y(%.1f) = %.8f Error: %.6g\\\",\\n t_arr[i], y_arr[i],\\n calc_err(t_arr[i], y_arr[i]));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import 'dart:math' as Math;\\n\\nnum RungeKutta4(Function f, num t, num y, num dt){\\n num k1 = dt * f(t,y);\\n num k2 = dt * f(t+0.5*dt, y + 0.5*k1);\\n num k3 = dt * f(t+0.5*dt, y + 0.5*k2);\\n num k4 = dt * f(t + dt, y + k3);\\n return y + (1/6) * (k1 + 2*k2 + 2*k3 + k4);\\n}\\n\\nvoid main(){\\n num t = 0;\\n num dt = 0.1;\\n num tf = 10;\\n num totalPoints = ((tf-t)/dt).floor()+1;\\n num y = 1;\\n Function f = (num t, num y) => t * Math.sqrt(y);\\n Function actual = (num t) => (1/16) * (t*t+4)*(t*t+4);\\n for (num i = 0; i <= totalPoints; i++){\\n num relativeError = (actual(t) - y)/actual(t);\\n if (i%10 == 0){\\n print('y(${t.round().toStringAsPrecision(3)}) = ${y.toStringAsPrecision(11)} Error = ${relativeError.toStringAsPrecision(11)}');\\n }\\n y = RungeKutta4(f, t, y, dt);\\n t += dt;\\n }\\n}\\n\",\n \"language\": \"Dart\"\n },\n {\n \"code\": \"numfmt 6 0\\ny = 1\\nfor i = 0 to 100\\n t = i / 10\\n if t = floor t\\n h = t * t + 4\\n actual = h * h / 16\\n print \\\"y(\\\" & t & \\\") = \\\" & y & \\\" Error = \\\" & actual - y\\n .\\n k1 = t * sqrt y\\n k2 = (t + 0.05) * sqrt (y + 0.05 * k1)\\n k3 = (t + 0.05) * sqrt (y + 0.05 * k2)\\n k4 = (t + 0.10) * sqrt (y + 0.10 * k3)\\n y += 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \" [Demo of EDSAC library subroutine G1: Runge-Kutta solution of differential equations.\\n Full description is in Wilkes, Wheeler & Gill, 1951 edn, pages 32-34, 86-87, 132-134.\\n\\n Before using G1, we need to fix n, m, a, b, c, d, as defined in WWG pages 86-87:\\n n = number of equations (2 for the Rosetta Code example).\\n 2^m = multiplier for the hy', as large as possible without causing numeric overflow;\\n with the scaling chosen here, m = 5.\\n Variables y are stored in n consecutive long locations, the last of which is aD.\\n Scaled derivatives (2^m)hy' in n consecutive long locations, the last of which is bD.\\n G1 uses working variables in n consecutive long locations, the last of which is cD.\\n d = address of user-supplied auxiliary subroutine, which calculates the (2^m)hy'.\\n\\n For convenience, keep G1 and its storage together. Start at (say) 400 and place:\\n variables y at 400D, 402D;\\n scaled derivatives at 404D, 406D;\\n workspace for G1 at 408D, 410D;\\n G1 itself at 412.\\n If the base address is placed in location 51 at load time, all the above\\n addresses can be accessed via the G parameter:]\\n T 51 K\\n P 400 F\\n [Now set up the 6 preset parameters specified in WWG:]\\n T 45 K\\n P 2#G [H parameter: P a D]\\n P 4 F [N parameter: P 2n F]\\n P 4 F [M parameter: P (b-a) F, or V (2048-a+b) F if a > b]\\n P 4 F [& parameter: P (c-b) F, or V (2048-b+c) F if b > c]\\n P 8 F [L parameter: P 2^(m-2) F]\\n P 300 F [X parameter: P d F]\\n [For other addresses in the program we can optionally use some more parameters:]\\n T 52 K\\n P 120 F [A parameter: main routine]\\n P 56 F [B parameter: print subroutine P1 from EDSAC library]\\n P 350 F [C parameter: constants for Rosetta code example]\\n P 78 F [V parameter: square root subroutine]\\n\\n [Library subroutine to read constants; runs at load time and is then overwritten.\\n R5, for decimal fractions, seems to be unavailable (lost?), so the values are\\n here read in as 35-bit integers (i.e. times 2^34) by R2.\\n Values are: 0.001, initial value of y\\n (2^23)/(10^7) and 25/(2^10) for use in calculations\\n 0.5/(10^9) for rounding to 9 d.p. (print routine P1 doesn't do this)]\\n GKT20FVDL8FA40DUDTFI40FA40FS39FG@S2FG23FA5@T5@E4@E13Z\\n T#C\\n 17179869F14411518808F419430400F9#\\n TZ\\n\\n [Library subroutine M3; prints header at load time and is then overwritten.]\\n PFGKIFAFRDLFUFOFE@A6FG@E8FEZPF\\n *SCALED!FOR!EDSAC@&!!TIME!!!!!!!!!Y!VIA!RK!!!!!Y!DIRECT@&\\n ....PK [end text with some blank tape]\\n\\n [Runge-Kutta: auxiliary subroutine to calculate (2^m)*h*(dy1/dt) and (2^m)*h*(dy2/dt)\\n from y1, y2, where y1 is the function y in Rosetta Code (but scaled) and y2 = t.\\n For the Rosetta code example we're using m = 5, h = 2^(-7)]\\n E25K TX GK\\n A3F T20@ [set up return as usual]\\n H2#G V2#G TD [acc := t^2, temp store in 0D]\\n H#G VD LD YF TD [y1 times t^2, shift left, round, temp store in 0D]\\n H2#C VD YF T4D [times (2^23)/(10^7), round, to 4D for square root]\\n [14] A14@ GV A4D T4#G [call square root, result in 4D, copy to (2^m)hy']\\n A21@ T6#G [1/4, i.e. (2^m)h with m and h as above, to (2^m)ht']\\n [20] ZF [overwritten by jump back to caller]\\n [21] RF [constant 1/4]\\n\\n [Main routine, with two subroutines in the same address block as the main routine.]\\n E25K TA GK\\n [0] #F [figures shift on teleprinter]\\n [1] MF [decimal point (in figures mode)]\\n [2] !F @F &F [space, carriage return, line feed,]\\n [5] K4096F [null char]\\n [6] P100F [constant: nr of Runge-Kutta steps (in address field)]\\n [7] PF [negative count of Runge-Kutta steps]\\n [8] P10F [constant: number of steps between printed values]\\n [9] PF [negative count of steps between printed values]\\n [Enter with acc = 0]\\n [10] O@ [set teleprinter to figures]\\n S6@ T7@ [init negative count of R-K steps]\\n S8@ T9@ [init negative count of print steps]\\n [Before using library subroutine G1, clear its working registers (WWG page 33)]\\n T8#G T10#G\\n [Set up initial values of y1 and y2 (where y2 = t)]\\n A#C T#G [load 0.001 from constants section, store in y1]\\n T2#G [y2 = t = 0]\\n [20] A20@ G40@ [call subroutine to print initial values]\\n [Loop round Runge-Kutta steps]\\n [22] TF A23@ G12G [clear accumulator, call G1 for Runge-Kutta step]\\n A9@ A2F U9@ [update negative print count]\\n G33@ [skip printing if not reached 0]\\n S8@ T9@ [reset negative print count]\\n A31@ G40@ [call subroutine to print values]\\n [33] TF [clear accumulator]\\n A7@ A2F U7@ [increment negative count of Runge-Kutta steps]\\n G22@ [loop till count = 0]\\n O5@ ZF [flush teleprinter buffer; stop]\\n\\n [Subroutine to print y1 as calculated (1) by Runge-Kutta (2) direct from formula]\\n [40] A3F T71@ [set up return as usual]\\n A2#G TD [latest t (= y2) from Runge-Kutta, to 0D for printing]\\n [44] A44@ G72@ [call subroutine to print t]\\n O2@ O2@ [followed by 2 spaces]\\n A#G TD [latest y1 from Runge-Kutta, to 0D for printing]\\n [50] A50@ G72@ [call subroutine to print y1]\\n O2@ O2@ [followed by 2 spaces]\\n A 4#C [load constant 25/(2^10)]\\n H2#G V2#G TD [add t^2, temp store result in 0D]\\n HD VD LD YF TD [square, shift 1 left, round, result to 0D]\\n H2#C VD YF TD [times (2^23)/(10^7), round, to 0D for printing]\\n [67] A67@ G72@ [call subroutine to print y]\\n O3@ O4@ [print CR, LF]\\n [71] ZF [overwritten by jump back to caller]\\n\\n [Second-level subroutine to print number in 0D to 9 decimal places]\\n [72] A3F T82@ [set up return as usual]\\n AD A6#C TD [load number, add decimal rounding, to 0D for printing]\\n O81@ O1@ [print '0.' since P1 doesn't do so]\\n A79@ GB [call library subroutine P1 for printing]\\n [81] P9F [parameter for P1, 9 decimals]\\n [82] ZF [overwritten by jump back to caller]\\n\\n [Library subroutine G1 for Runge-Kutta process. 66 locations, even address.]\\n E25K T12G\\n GKT4#ZH682DT6#ZPNT12#Z!1405DT14#ZTHT16#ZT2HTZA3FT61@A31@G63@&FT6ZPN\\n T8ZMMO&H4@A20@E23@T14ZAHT16ZA2HT18ZH12#@S12#@T12#@E28@H4#@T4DUFS38@\\n A25@T38@S6#@A16#@U46#@A8@U37@A9@U55@A24@T39@ZFR1057#@ZFYFU6DV6DRLYF\\n UDZFZFADLDADLLS6DN4DYFZFA46#@S14#@G29@A65@S11@ZFA35@U65@GXZF\\n\\n [Replacement for library routine S2 (square root). 38 locations, even address.\\n Advantages: More accurate for small values of the argument.\\n Calculates sqrt(0) without going into an infinite loop.\\n Disadvantages: Longer and slower than S2 (calculates one bit at a time).]\\n E25K TV\\n GKA3FT31@A4DG32@A33@T36#@T4DA33@RDU34#@RDS4DS33@A36#@G22@T36#@A4DS34#@\\n T4DA36#@A33@G25@TFA36#@S33@A36#@T36#@A34#@RDYFG9@ZFZFK4096FPFPFPFPF\\n\\n [Library subroutine P1 - print a single positive number. 21 locations.\\n Prints number in 0D to n places of decimals, where\\n n is specified by 'P n F' pseudo-order after subroutine call.]\\n E25K TB\\n GKA18@U17@S20@T5@H19@PFT5@VDUFOFFFSFL4FTDA5@A2FG6@EFU3FJFM1F\\n\\n [Define entry point in main routine]\\n E25K TA GK\\n E10Z PF [enter at relative address 10 with accumulator = 0]\\n\",\n \"language\": \"EDSAC-order-code\"\n },\n {\n \"code\": \"PROGRAM RUNGE_KUTTA\\n\\nCONST DELTA_T=0.1\\n\\nFUNCTION Y1(T,Y)\\n Y1=T*SQR(Y)\\nEND FUNCTION\\n\\nBEGIN\\n Y=1.0\\n FOR I%=0 TO 100 DO\\n T=I%*DELTA_T\\n\\n IF T=INT(T) THEN ! print every tenth\\n ACTUAL=((T^2+4)^2)/16 ! exact solution\\n PRINT(\\\"Y(\\\";T;\\\")=\\\";Y;TAB(20);\\\"Error=\\\";ACTUAL-Y)\\n END IF\\n\\n K1=Y1(T,Y)\\n K2=Y1(T+DELTA_T/2,Y+DELTA_T/2*K1)\\n K3=Y1(T+DELTA_T/2,Y+DELTA_T/2*K2)\\n K4=Y1(T+DELTA_T,Y+DELTA_T*K3)\\n Y+=DELTA_T*(K1+2*(K2+K3)+K4)/6\\n END FOR\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"//Worksheet formula to manage looping\\n\\n=LET(\\n T₊, SEQUENCE(11, 1, 0, 1),\\n T, DROP(T₊, -1),\\n τ, SEQUENCE(1 / δt, 1, 0, δt),\\n calculated, SCAN(1, T, LAMBDA(y₀, t, REDUCE(y₀, t + τ, RungaKutta4λ(Dλ)))),\\n calcs, VSTACK(1, calculated),\\n exact, f(T₊),\\n HSTACK(T₊, calcs, exact, (exact - calcs) / exact)\\n)\\n\\n//Lambda function passed to RungaKutta4λ to evaluate derivatives\\n\\nDλ(y,t)\\n= LAMBDA(y,t, t * SQRT(y))\\n\\n//Curried Lambda function with derivative function D and y, t as parameters\\n\\nRungaKutta4λ(Dλ)\\n= LAMBDA(D,\\n LAMBDA(yᵣ, tᵣ,\\n LET(\\n δy₁, δt * D(yᵣ, tᵣ),\\n δy₂, δt * D(yᵣ + δy₁ / 2, tᵣ + δt / 2),\\n δy₃, δt * D(yᵣ + δy₂ / 2, tᵣ + δt / 2),\\n δy₄, δt * D(yᵣ + δy₃, tᵣ + δt),\\n yᵣ₊₁, yᵣ + (δy₁ + 2 * δy₂ + 2 * δy₃ + δy₄) / 6,\\n yᵣ₊₁\\n )\\n )\\n )\\n\\n//Lambda function returning the exact solution\\n\\nf(t)\\n= LAMBDA(t, (1/16) * (t^2 + 4)^2 )\\n\",\n \"language\": \"Excel\"\n },\n {\n \"code\": \"open System\\n\\nlet y'(t,y) = t * sqrt(y)\\n\\nlet RungeKutta4 t0 y0 t_max dt =\\n\\n let dy1(t,y) = dt * y'(t,y)\\n let dy2(t,y) = dt * y'(t+dt/2.0, y+dy1(t,y)/2.0)\\n let dy3(t,y) = dt * y'(t+dt/2.0, y+dy2(t,y)/2.0)\\n let dy4(t,y) = dt * y'(t+dt, y+dy3(t,y))\\n\\n (t0,y0) |> Seq.unfold (fun (t,y) ->\\n if ( t <= t_max) then Some((t,y), (Math.Round(t+dt, 6), y + ( dy1(t,y) + 2.0*dy2(t,y) + 2.0*dy3(t,y) + dy4(t,y))/6.0))\\n else None\\n )\\n\\nlet y_exact t = (pown (pown t 2 + 4.0) 2)/16.0\\n\\nRungeKutta4 0.0 1.0 10.0 0.1\\n |> Seq.filter (fun (t,y) -> t % 1.0 = 0.0 )\\n |> Seq.iter (fun (t,y) -> Console.WriteLine(\\\"y({0})={1}\\\\t(relative error:{2})\\\", t, y, (y / y_exact(t))-1.0) )\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"program rungekutta\\n implicit none\\n integer, parameter :: dp = kind(1d0)\\n real(dp) :: t, dt, tstart, tstop\\n real(dp) :: y, k1, k2, k3, k4\\n\\n tstart = 0.0d0\\n tstop = 10.0d0\\n dt = 0.1d0\\n y = 1.0d0\\n t = tstart\\n write (6, '(a,f4.1,a,f12.8,a,es13.6)') 'y(', t, ') = ', y, ' error = ', &\\n abs(y-(t**2+4)**2/16)\\n do while (t < tstop)\\n k1 = dt*f(t, y)\\n k2 = dt*f(t+dt/2, y+k1/2)\\n k3 = dt*f(t+dt/2, y+k2/2)\\n k4 = dt*f(t+dt, y+k3)\\n y = y+(k1+2*(k2+k3)+k4)/6\\n t = t+dt\\n if (abs(nint(t)-t) <= 1d-12) then\\n write (6, '(a,f4.1,a,f12.8,a,es13.6)') 'y(', t, ') = ', y, ' error = ', &\\n abs(y-(t**2+4)**2/16)\\n end if\\n end do\\ncontains\\n function f(t,y)\\n real(dp), intent(in) :: t, y\\n real(dp) :: f\\n\\n f = t*sqrt(y)\\n end function f\\nend program rungekutta\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' version 03-10-2015\\n' compile with: fbc -s console\\n' translation of BBC BASIC\\n\\nDim As Double y = 1, t, actual, k1, k2, k3, k4\\n\\nPrint\\n\\nFor i As Integer = 0 To 100\\n\\n t = i / 10\\n\\n If t = Int(t) Then\\n actual = ((t ^ 2 + 4) ^ 2) / 16\\n Print \\\"y(\\\"; Str(t); \\\") =\\\"; y ; Tab(27); \\\"Error = \\\"; actual - y\\n End If\\n\\n k1 = t * Sqr(y)\\n k2 = (t + 0.05) * Sqr(y + 0.05 * k1)\\n k3 = (t + 0.05) * Sqr(y + 0.05 * k2)\\n k4 = (t + 0.10) * Sqr(y + 0.10 * k3)\\n y += 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\\n\\nNext i\\n\\n\\n' empty keyboard buffer\\nWhile Inkey <> \\\"\\\" : Wend\\nPrint : Print \\\"hit any key to end program\\\"\\nSleep\\nEnd\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"window 1\\n\\ndef fn dydx( x as double, y as double ) as double = x * sqr(y)\\ndef fn exactY( x as long ) as double = ( x ^2 + 4 ) ^2 / 16\\n\\nlong i\\ndouble h, k1, k2, k3, k4, x, y, result\\n\\nh = 0.1\\ny = 1\\nfor i = 0 to 100\\n x = i * h\\n if x == int(x)\\n result = fn exactY( x )\\n print \\\"y(\\\"; mid$( str$(x), 2, len$(str$(x) )); \\\") = \\\"; y, \\\"Error = \\\"; result - y\\n end if\\n\\n k1 = h * fn dydx( x, y )\\n k2 = h * fn dydx( x + h / 2, y + k1 / 2 )\\n k3 = h * fn dydx( x + h / 2, y + k2 / 2 )\\n k4 = h * fn dydx( x + h, y + k3 )\\n\\n y = y + 1 / 6 * ( k1 + 2 * k2 + 2 * k3 + k4 )\\nnext\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n)\\n\\ntype ypFunc func(t, y float64) float64\\ntype ypStepFunc func(t, y, dt float64) float64\\n\\n// newRKStep takes a function representing a differential equation\\n// and returns a function that performs a single step of the forth-order\\n// Runge-Kutta method.\\nfunc newRK4Step(yp ypFunc) ypStepFunc {\\n return func(t, y, dt float64) float64 {\\n dy1 := dt * yp(t, y)\\n dy2 := dt * yp(t+dt/2, y+dy1/2)\\n dy3 := dt * yp(t+dt/2, y+dy2/2)\\n dy4 := dt * yp(t+dt, y+dy3)\\n return y + (dy1+2*(dy2+dy3)+dy4)/6\\n }\\n}\\n\\n// example differential equation\\nfunc yprime(t, y float64) float64 {\\n return t * math.Sqrt(y)\\n}\\n\\n// exact solution of example\\nfunc actual(t float64) float64 {\\n t = t*t + 4\\n return t * t / 16\\n}\\n\\nfunc main() {\\n t0, tFinal := 0, 10 // task specifies times as integers,\\n dtPrint := 1 // and to print at whole numbers.\\n y0 := 1. // initial y.\\n dtStep := .1 // step value.\\n\\n t, y := float64(t0), y0\\n ypStep := newRK4Step(yprime)\\n for t1 := t0 + dtPrint; t1 <= tFinal; t1 += dtPrint {\\n printErr(t, y) // print intermediate result\\n for steps := int(float64(dtPrint)/dtStep + .5); steps > 1; steps-- {\\n y = ypStep(t, y, dtStep)\\n t += dtStep\\n }\\n y = ypStep(t, y, float64(t1)-t) // adjust step to integer time\\n t = float64(t1)\\n }\\n printErr(t, y) // print final result\\n}\\n\\nfunc printErr(t, y float64) {\\n fmt.Printf(\\\"y(%.1f) = %f Error: %e\\\\n\\\", t, y, math.Abs(actual(t)-y))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"class Runge_Kutta{\\nstatic void main(String[] args){\\ndef y=1.0,t=0.0,counter=0;\\ndef dy1,dy2,dy3,dy4;\\ndef real;\\nwhile(t<=10)\\n{if(counter%10==0)\\n{real=(t*t+4)*(t*t+4)/16;\\nprintln(\\\"y(\\\"+t+\\\")=\\\"+ y+ \\\" Error:\\\"+ (real-y));\\n}\\n\\ndy1=dy(dery(y,t));\\ndy2=dy(dery(y+dy1/2,t+0.05));\\ndy3=dy(dery(y+dy2/2,t+0.05));\\ndy4=dy(dery(y+dy3,t+0.1));\\n\\ny=y+(dy1+2*dy2+2*dy3+dy4)/6;\\nt=t+0.1;\\ncounter++;\\n}\\n}\\nstatic def dery(def y,def t){return t*(Math.sqrt(y));}\\nstatic def dy(def x){return x*0.1;}\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"use fmt;\\nuse math;\\n\\nexport fn main() void = {\\n\\trk4_driver(&f, 0.0, 10.0, 1.0, 0.1);\\n};\\n\\nfn rk4_driver(func: *fn(_: f64, _: f64) f64, t_init: f64, t_final: f64, y_init: f64, h: f64) void = {\\n\\tlet n = ((t_final - t_init) / h): int;\\n\\tlet tn: f64 = t_init;\\n\\tlet yn: f64 = y_init;\\n\\tlet i: int = 1;\\n\\n\\tfmt::printfln(\\\"{: 2} {: 18} {: 21}\\\", \\\"t\\\", \\\"y(t)\\\", \\\"absolute error\\\")!;\\n\\tfmt::printfln(\\\"{: 2} {: 18} {: 21}\\\", tn, yn, math::absf64(exact(tn) - yn))!;\\n\\n\\tfor (i <= n; i += 1) {\\n\\t\\tyn = rk4(func, tn, yn, h);\\n\\t\\ttn = t_init + (i: f64)*h;\\n\\n\\t\\tif (i % 10 == 0) {\\n\\t\\t\\tfmt::printfln(\\\"{: 2} {: 18} {: 21}\\\\t\\\", tn, yn, math::absf64(exact(tn) - yn))!;\\n\\t\\t};\\n\\t};\\n};\\n\\nfn rk4(func: *fn(_: f64, _: f64) f64, t: f64, y: f64, h: f64) f64 = {\\n\\tconst k1 = func(t, y);\\n\\tconst k2 = func(t + 0.5*h, y + 0.5*h*k1);\\n\\tconst k3 = func(t + 0.5*h, y + 0.5*h*k2);\\n\\tconst k4 = func(t + h, y + h*k3);\\n\\treturn y + h/6.0 * (k1 + 2.0*k2 + 2.0*k3 + k4);\\n};\\n\\nfn f(t: f64, y: f64) f64 = {\\n\\treturn t * math::sqrtf64(y);\\n};\\n\\nfn exact(t: f64) f64 = {\\n\\treturn 1.0/16.0 * math::powf64(t*t + 4.0, 2.0);\\n};\\n\",\n \"language\": \"Hare\"\n },\n {\n \"code\": \"dv\\n :: Floating a\\n => a -> a -> a\\ndv = (. sqrt) . (*)\\n\\nfy t = 1 / 16 * (4 + t ^ 2) ^ 2\\n\\nrk4\\n :: (Enum a, Fractional a)\\n => (a -> a -> a) -> a -> a -> a -> [(a, a)]\\nrk4 fd y0 a h = zip ts $ scanl (flip fc) y0 ts\\n where\\n ts = [a,h ..]\\n fc t y =\\n sum . (y :) . zipWith (*) [1 / 6, 1 / 3, 1 / 3, 1 / 6] $\\n scanl\\n (\\\\k f -> h * fd (t + f * h) (y + f * k))\\n (h * fd t y)\\n [1 / 2, 1 / 2, 1]\\n\\ntask =\\n mapM_\\n (print . (\\\\(x, y) -> (truncate x, y, fy x - y)))\\n (filter (\\\\(x, _) -> 0 == mod (truncate $ 10 * x) 10) $\\n take 101 $ rk4 dv 1.0 0 0.1)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"*Main> task\\n(0,1.0,0.0)\\n(1,1.5624998542781088,1.4572189122041834e-7)\\n(2,3.9999990805208006,9.194792029987298e-7)\\n(3,10.562497090437557,2.909562461184123e-6)\\n(4,24.999993765090654,6.234909399438493e-6)\\n(5,52.56248918030265,1.0819697635611192e-5)\\n(6,99.99998340540378,1.6594596999652822e-5)\\n(7,175.56247648227165,2.3517730085131916e-5)\\n(8,288.99996843479926,3.1565204153594095e-5)\\n(9,451.562459276841,4.0723166534917254e-5)\\n(10,675.9999490167125,5.098330132113915e-5)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"rk4 :: Double -> Double -> Double -> Double\\nrk4 y x dx =\\n let f x y = x * sqrt y\\n k1 = dx * f x y\\n k2 = dx * f (x + dx / 2.0) (y + k1 / 2.0)\\n k3 = dx * f (x + dx / 2.0) (y + k2 / 2.0)\\n k4 = dx * f (x + dx) (y + k3)\\n in y + (k1 + 2.0 * k2 + 2.0 * k3 + k4) / 6.0\\n\\nactual :: Double -> Double\\nactual x = (1 / 16) * (x * x + 4) * (x * x + 4)\\n\\nstep :: Double\\nstep = 0.1\\n\\nixs :: [Int]\\nixs = [0 .. 100]\\n\\nxys :: [(Double, Double)]\\nxys =\\n scanl\\n (\\\\(x, y) _ -> (((x * 10) + (step * 10)) / 10, rk4 y x step))\\n (0.0, 1.0)\\n ixs\\n\\nsamples :: [(Double, Double, Double)]\\nsamples =\\n zip ixs xys >>=\\n (\\\\(i, (x, y)) ->\\n [ (x, y, actual x - y)\\n | 0 == mod i 10 ])\\n\\nmain :: IO ()\\nmain =\\n (putStrLn . unlines) $\\n (\\\\(x, y, v) ->\\n unwords\\n [ \\\"y\\\" ++ justifyRight 3 ' ' ('(' : show (round x)) ++ \\\") = \\\"\\n , justifyLeft 19 ' ' (show y)\\n , '±' : show v\\n ]) <$>\\n samples\\n where\\n justifyLeft n c s = take n (s ++ replicate n c)\\n justifyRight n c s = drop (length s) (replicate n c ++ s)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"100 PROGRAM \\\"Runge.bas\\\"\\n110 LET Y=1\\n120 FOR T=0 TO 10 STEP .1\\n130 IF T=INT(T) THEN PRINT \\\"y(\\\";STR$(T);\\\") =\\\";Y;TAB(21);\\\"Error =\\\";((T^2+4)^2)/16-Y\\n140 LET K1=T*SQR(Y)\\n150 LET K2=(T+.05)*SQR(Y+.05*K1)\\n160 LET K3=(T+.05)*SQR(Y+.05*K2)\\n170 LET K4=(T+.1)*SQR(Y+.1*K3)\\n180 LET Y=Y+.1*(K1+2*(K2+K3)+K4)/6\\n190 NEXT\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \"NB.*rk4 a Solve function using Runge-Kutta method\\nNB. y is: y(ta) , ta , tb , tstep\\nNB. u is: function to solve\\nNB. eg: fyp rk4 1 0 10 0.1\\nrk4=: adverb define\\n 'Y0 a b h'=. 4{. y\\n T=. a + i.@>:&.(%&h) b - a\\n Y=. Yt=. Y0\\n for_t. }: T do.\\n ty=. t,Yt\\n k1=. h * u ty\\n k2=. h * u ty + -: h,k1\\n k3=. h * u ty + -: h,k2\\n k4=. h * u ty + h,k3\\n Y=. Y, Yt=. Yt + (%6) * 1 2 2 1 +/@:* k1, k2, k3, k4\\n end.\\nT ,. Y\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" fy=: (%16) * [: *: 4 + *: NB. f(t,y)\\n fyp=: (* %:)/ NB. f'(t,y)\\n report_whole=: (10 * i. >:10)&{ NB. report at whole-numbered t values\\n report_err=: (, {: - [: fy {.)\\\"1 NB. report errors\\n\\n report_err report_whole fyp rk4 1 0 10 0.1\\n 0 1 0\\n 1 1.5625 _1.45722e_7\\n 2 4 _9.19479e_7\\n 3 10.5625 _2.90956e_6\\n 4 25 _6.23491e_6\\n 5 52.5625 _1.08197e_5\\n 6 100 _1.65946e_5\\n 7 175.562 _2.35177e_5\\n 8 289 _3.15652e_5\\n 9 451.562 _4.07232e_5\\n10 676 _5.09833e_5\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"rk4=: adverb define\\n 'Y0 a b h'=. 4{. y\\n T=. a + i.@>:&.(%&h) b-a\\n (,. [: h&(u nextY)@,/\\\\. Y0 ,~ }.)&.|. T\\n)\\n\\nNB. nextY a Calculate Yn+1 of a function using Runge-Kutta method\\nNB. y is: 2-item numeric list of time t and y(t)\\nNB. u is: function to use\\nNB. x is: step size\\nNB. eg: 0.001 fyp nextY 0 1\\nnextY=: adverb define\\n:\\n tableau=. 1 0.5 0.5, x * u y\\n ks=. (x * [: u y + (* x&,))/\\\\. tableau\\n ({:y) + 6 %~ +/ 1 2 2 1 * ks\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import static java.lang.Math.*;\\nimport java.util.function.BiFunction;\\n\\npublic class RungeKutta {\\n\\n static void runge(BiFunction<Double, Double, Double> yp_func, double[] t,\\n double[] y, double dt) {\\n\\n for (int n = 0; n < t.length - 1; n++) {\\n double dy1 = dt * yp_func.apply(t[n], y[n]);\\n double dy2 = dt * yp_func.apply(t[n] + dt / 2.0, y[n] + dy1 / 2.0);\\n double dy3 = dt * yp_func.apply(t[n] + dt / 2.0, y[n] + dy2 / 2.0);\\n double dy4 = dt * yp_func.apply(t[n] + dt, y[n] + dy3);\\n t[n + 1] = t[n] + dt;\\n y[n + 1] = y[n] + (dy1 + 2.0 * (dy2 + dy3) + dy4) / 6.0;\\n }\\n }\\n\\n static double calc_err(double t, double calc) {\\n double actual = pow(pow(t, 2.0) + 4.0, 2) / 16.0;\\n return abs(actual - calc);\\n }\\n\\n public static void main(String[] args) {\\n double dt = 0.10;\\n double[] t_arr = new double[101];\\n double[] y_arr = new double[101];\\n y_arr[0] = 1.0;\\n\\n runge((t, y) -> t * sqrt(y), t_arr, y_arr, dt);\\n\\n for (int i = 0; i < t_arr.length; i++)\\n if (i % 10 == 0)\\n System.out.printf(\\\"y(%.1f) = %.8f Error: %.6f%n\\\",\\n t_arr[i], y_arr[i],\\n calc_err(t_arr[i], y_arr[i]));\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function rk4(y, x, dx, f) {\\n var k1 = dx * f(x, y),\\n k2 = dx * f(x + dx / 2.0, +y + k1 / 2.0),\\n k3 = dx * f(x + dx / 2.0, +y + k2 / 2.0),\\n k4 = dx * f(x + dx, +y + k3);\\n\\n return y + (k1 + 2.0 * k2 + 2.0 * k3 + k4) / 6.0;\\n}\\n\\nfunction f(x, y) {\\n return x * Math.sqrt(y);\\n}\\n\\nfunction actual(x) {\\n return (1/16) * (x*x+4)*(x*x+4);\\n}\\n\\nvar y = 1.0,\\n x = 0.0,\\n step = 0.1,\\n steps = 0,\\n maxSteps = 101,\\n sampleEveryN = 10;\\n\\nwhile (steps < maxSteps) {\\n if (steps%sampleEveryN === 0) {\\n console.log(\\\"y(\\\" + x + \\\") = \\\\t\\\" + y + \\\"\\\\t ± \\\" + (actual(x) - y).toExponential());\\n }\\n\\n y = rk4(y, x, step, f);\\n\\n // using integer math for the step addition\\n // to prevent floating point errors as 0.2 + 0.1 != 0.3\\n x = ((x * 10) + (step * 10)) / 10;\\n steps += 1;\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n 'use strict';\\n\\n // rk4 :: (Double -> Double -> Double) ->\\n // Double -> Double -> Double -> Double\\n const rk4 = f => (y, x, dx) => {\\n const\\n k1 = dx * f(x, y),\\n k2 = dx * f(x + dx / 2.0, y + k1 / 2.0),\\n k3 = dx * f(x + dx / 2.0, y + k2 / 2.0),\\n k4 = dx * f(x + dx, y + k3);\\n return y + (k1 + 2.0 * k2 + 2.0 * k3 + k4) / 6.0;\\n };\\n\\n // rk :: Double -> Double -> Double -> Double\\n const rk = rk4((x, y) => x * Math.sqrt(y));\\n\\n // actual :: Double -> Double\\n const actual = x => (1 / 16) * ((x * x) + 4) * ((x * x) + 4);\\n\\n\\n // TEST -------------------------------------------------\\n\\n // main :: IO ()\\n const main = () => {\\n const\\n step = 0.1,\\n ixs = enumFromTo(0, 100),\\n xys = scanl(\\n xy => Tuple(\\n ((xy[0] * 10) + (step * 10)) / 10, rk(xy[1], xy[0], step)\\n ),\\n Tuple(0.0, 1.0),\\n ixs\\n );\\n\\n // samples :: [(Double, Double, Double)]\\n const samples = concatMap(\\n tpl => 0 === tpl[0] % 10 ? (() => {\\n const [x, y] = Array.from(tpl[1]);\\n return [TupleN(x, y, actual(x) - y)];\\n })() : [],\\n zip(ixs, xys)\\n );\\n\\n console.log(\\n unlines(map(\\n tpl => {\\n const [x, y, v] = Array.from(tpl),\\n [sn, sm] = splitOn('.', y.toString());\\n return unwords([\\n 'y' + justifyRight(3, ' ', '(' + Math.round(x).toString()) +\\n ') =',\\n justifyRight(3, ' ', sn) + '.' + justifyLeft(15, ' ', sm || '0'),\\n '± ' + v.toExponential()\\n ]);\\n },\\n samples\\n ))\\n );\\n };\\n\\n\\n // GENERIC FUNCTIONS ----------------------------\\n\\n // Tuple (,) :: a -> b -> (a, b)\\n const Tuple = (a, b) => ({\\n type: 'Tuple',\\n '0': a,\\n '1': b,\\n length: 2\\n });\\n\\n // TupleN :: a -> b ... -> (a, b ... )\\n function TupleN() {\\n const\\n args = Array.from(arguments),\\n lng = args.length;\\n return lng > 1 ? Object.assign(\\n args.reduce((a, x, i) => Object.assign(a, {\\n [i]: x\\n }), {\\n type: 'Tuple' + (2 < lng ? lng.toString() : ''),\\n length: lng\\n })\\n ) : args[0];\\n };\\n\\n // concatMap :: (a -> [b]) -> [a] -> [b]\\n const concatMap = (f, xs) =>\\n xs.reduce((a, x) => a.concat(f(x)), []);\\n\\n // enumFromTo :: Int -> Int -> [Int]\\n const enumFromTo = (m, n) =>\\n Array.from({\\n length: 1 + n - m\\n }, (_, i) => m + i)\\n\\n // justifyLeft :: Int -> Char -> String -> String\\n const justifyLeft = (n, cFiller, s) =>\\n n > s.length ? (\\n s.padEnd(n, cFiller)\\n ) : s;\\n\\n // justifyRight :: Int -> Char -> String -> String\\n const justifyRight = (n, cFiller, s) =>\\n n > s.length ? (\\n s.padStart(n, cFiller)\\n ) : s;\\n\\n // Returns Infinity over objects without finite length\\n // this enables zip and zipWith to choose the shorter\\n // argument when one is non-finite, like cycle, repeat etc\\n\\n // length :: [a] -> Int\\n const length = xs => xs.length || Infinity;\\n\\n // map :: (a -> b) -> [a] -> [b]\\n const map = (f, xs) => xs.map(f);\\n\\n // scanl :: (b -> a -> b) -> b -> [a] -> [b]\\n const scanl = (f, startValue, xs) =>\\n xs.reduce((a, x) => {\\n const v = f(a[0], x);\\n return Tuple(v, a[1].concat(v));\\n }, Tuple(startValue, [startValue]))[1];\\n\\n // splitOn :: String -> String -> [String]\\n const splitOn = (pat, src) => src.split(pat);\\n\\n // take :: Int -> [a] -> [a]\\n // take :: Int -> String -> String\\n const take = (n, xs) =>\\n xs.constructor.constructor.name !== 'GeneratorFunction' ? (\\n xs.slice(0, n)\\n ) : [].concat.apply([], Array.from({\\n length: n\\n }, () => {\\n const x = xs.next();\\n return x.done ? [] : [x.value];\\n }));\\n\\n // unlines :: [String] -> String\\n const unlines = xs => xs.join('\\\\n');\\n\\n // unwords :: [String] -> String\\n const unwords = xs => xs.join(' ');\\n\\n // Use of `take` and `length` here allows for zipping with non-finite\\n // lists - i.e. generators like cycle, repeat, iterate.\\n\\n // zip :: [a] -> [b] -> [(a, b)]\\n const zip = (xs, ys) => {\\n const lng = Math.min(length(xs), length(ys));\\n return Infinity !== lng ? (() => {\\n const bs = take(lng, ys);\\n return take(lng, xs).map((x, i) => Tuple(x, bs[i]));\\n })() : zipGen(xs, ys);\\n };\\n\\n // MAIN ---\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def until(cond; next):\\n def _until: if cond then . else (next|_until) end;\\n _until;\\n\\ndef while(cond; update):\\n def _while: if cond then ., (update | _while) else empty end;\\n _while;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# yprime maps [t,y] to a number, i.e. t * sqrt(y)\\ndef yprime: .[0] * (.[1] | sqrt);\\n\\n# The exact solution of yprime:\\ndef actual:\\n . as $t\\n | (( $t*$t) + 4 )\\n | . * . / 16;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# n is the number of decimal places of precision\\ndef round(n):\\n (if . < 0 then -1 else 1 end) as $s\\n | $s*10*.*n | if (floor % 10) > 4 then (.+5) else . end | ./10 | floor/n | .*$s;\\n\\ndef abs: if . < 0 then -. else . end;\\n\\n# Is the input an integer?\\ndef integerq: ((. - ((.+.01) | floor)) | abs) < 0.01;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def dt: 0.1;\\n\\n# Input: [t, y]; yp is a filter that accepts [t,y] as input\\ndef runge_kutta(yp):\\n .[0] as $t | .[1] as $y\\n | (dt * yp) as $a\\n | (dt * ([ ($t + (dt/2)), $y + ($a/2) ] | yp)) as $b\\n | (dt * ([ ($t + (dt/2)), $y + ($b/2) ] | yp)) as $c\\n | (dt * ([ ($t + dt) , $y + $c ] | yp)) as $d\\n | ($a + (2*($b + $c)) + $d) / 6\\n;\\n\\n# Input: [t,y]\\ndef dy(f): runge_kutta(f);\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# state: [t,y]\\n[0,1]\\n| while( .[0] <= 10;\\n .[0] as $t | .[1] as $y\\n | [$t + dt, $y + dy(yprime) ] )\\n| .[0] as $t | .[1] as $y\\n| if $t | integerq then\\n \\\"y(\\\\($t|round(1))) = \\\\($y|round(10000)) ± \\\\( ($t|actual) - $y | abs)\\\"\\n else empty\\n end\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ time jq -r -n -f rk4.pl.jq\\ny(0) = 1 ± 0\\ny(1) = 1.5625 ± 1.4572189210859676e-07\\ny(2) = 4 ± 9.194792029987298e-07\\ny(3) = 10.5625 ± 2.9095624576314094e-06\\ny(4) = 25 ± 6.234909392333066e-06\\ny(5) = 52.5625 ± 1.081969734428867e-05\\ny(6) = 100 ± 1.659459609015812e-05\\ny(7) = 175.5625 ± 2.3517728038768837e-05\\ny(8) = 289 ± 3.156520000402452e-05\\ny(9) = 451.5625 ± 4.072315812209126e-05\\ny(10) = 675.9999 ± 5.0983286655537086e-05\\n\\nreal\\t0m0.048s\\nuser\\t0m0.013s\\nsys\\t0m0.006s\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Input: [t, y, dt]\\ndef newRK4Step(yp):\\n .[0] as $t | .[1] as $y | .[2] as $dt\\n | ($dt * ([$t, $y]|yp)) as $dy1\\n | ($dt * ([$t+$dt/2, $y+$dy1/2]|yp)) as $dy2\\n | ($dt * ([$t+$dt/2, $y+$dy2/2]|yp)) as $dy3\\n | ($dt * ([$t+$dt, $y+$dy3] |yp)) as $dy4\\n | $y + ($dy1+2*($dy2+$dy3)+$dy4)/6\\n;\\n\\n\\ndef printErr: # input: [t, y]\\n def abs: if . < 0 then -. else . end;\\n .[0] as $t | .[1] as $y\\n | \\\"y(\\\\($t)) = \\\\($y) with error: \\\\( (($t|actual) - $y) | abs )\\\"\\n;\\n\\ndef main(t0; y0; tFinal; dtPrint):\\n\\n def ypStep: newRK4Step(yprime) ;\\n\\n 0.1 as $dtStep # step value\\n # [ t, y] is the state vector\\n | [ t0, y0 ]\\n | while( .[0] <= tFinal;\\n .[0] as $t | .[1] as $y\\n\\t | ($t + dtPrint) as $t1\\n\\t | (((dtPrint/$dtStep) + 0.5) | floor) as $steps\\n\\t | [$steps, $t, $y] # state vector\\n | until( .[0] <= 1;\\n\\t .[0] as $steps\\n\\t\\t | .[1] as $t\\n\\t\\t | .[2] as $y\\n\\t\\t | [ ($steps - 1), ($t + $dtStep), ([$t, $y, $dtStep]|ypStep) ]\\n )\\n\\t | .[1] as $t | .[2] as $y\\n\\t | [$t1, ([ $t, $y, ($t1-$t)] | ypStep)] # adjust step to integer time\\n )\\n | printErr # print results\\n;\\n\\n# main(t0; y0; tFinal; dtPrint)\\nmain(0; 1; 10; 1)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ time jq -n -r -f runge-kutta.jq\\ny(0) = 1 with error: 0\\ny(1) = 1.562499854278108 with error: 1.4572189210859676e-07\\ny(2) = 3.9999990805207974 with error: 9.194792025546406e-07\\ny(3) = 10.562497090437544 with error: 2.9095624558550526e-06\\ny(4) = 24.999993765090615 with error: 6.234909385227638e-06\\ny(5) = 52.562489180302656 with error: 1.081969734428867e-05\\ny(6) = 99.99998340540387 with error: 1.6594596132790684e-05\\ny(7) = 175.56247648227188 with error: 2.3517728124033965e-05\\ny(8) = 288.9999684347997 with error: 3.156520028824161e-05\\ny(9) = 451.56245927684154 with error: 4.0723158463151776e-05\\ny(10) = 675.9999490167129 with error: 5.0983287110284436e-05\\n\\nreal\\t0m0.023s\\nuser\\t0m0.014s\\nsys\\t0m0.006s\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"f(x, y) = x * sqrt(y)\\ntheoric(t) = (t ^ 2 + 4.0) ^ 2 / 16.0\\n\\nrk4(f) = (t, y, δt) -> # 1st (result) lambda\\n ((δy1) -> # 2nd lambda\\n ((δy2) -> # 3rd lambda\\n ((δy3) -> # 4th lambda\\n ((δy4) -> ( δy1 + 2δy2 + 2δy3 + δy4 ) / 6 # 5th and deepest lambda: calc y_{n+1}\\n )(δt * f(t + δt, y + δy3)) # calc δy₄\\n )(δt * f(t + δt / 2, y + δy2 / 2)) # calc δy₃\\n )(δt * f(t + δt / 2, y + δy1 / 2)) # calc δy₂\\n )(δt * f(t, y)) # calc δy₁\\n\\nδy = rk4(f)\\nt₀, δt, tmax = 0.0, 0.1, 10.0\\ny₀ = 1.0\\n\\nt, y = t₀, y₀\\nwhile t ≤ tmax\\n if t ≈ round(t) @printf(\\\"y(%4.1f) = %10.6f\\\\terror: %12.6e\\\\n\\\", t, y, abs(y - theoric(t))) end\\n y += δy(t, y, δt)\\n t += δt\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"function rk4(f::Function, x₀::Float64, y₀::Float64, x₁::Float64, n)\\n vx = Vector{Float64}(undef, n + 1)\\n vy = Vector{Float64}(undef, n + 1)\\n vx[1] = x = x₀\\n vy[1] = y = y₀\\n h = (x₁ - x₀) / n\\n for i in 1:n\\n k₁ = h * f(x, y)\\n k₂ = h * f(x + 0.5h, y + 0.5k₁)\\n k₃ = h * f(x + 0.5h, y + 0.5k₂)\\n k₄ = h * f(x + h, y + k₃)\\n vx[i + 1] = x = x₀ + i * h\\n vy[i + 1] = y = y + (k₁ + 2k₂ + 2k₃ + k₄) / 6\\n end\\n return vx, vy\\nend\\n\\nvx, vy = rk4(f, 0.0, 1.0, 10.0, 100)\\nfor (x, y) in Iterators.take(zip(vx, vy), 10)\\n @printf(\\\"%4.1f %10.5f %+12.4e\\\\n\\\", x, y, y - theoric(x))\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\ntypealias Y = (Double) -> Double\\ntypealias Yd = (Double, Double) -> Double\\n\\nfun rungeKutta4(t0: Double, tz: Double, dt: Double, y: Y, yd: Yd) {\\n var tn = t0\\n var yn = y(tn)\\n val z = ((tz - t0) / dt).toInt()\\n for (i in 0..z) {\\n if (i % 10 == 0) {\\n val exact = y(tn)\\n val error = yn - exact\\n println(\\\"%4.1f %10f %10f %9f\\\".format(tn, yn, exact, error))\\n }\\n if (i == z) break\\n val dy1 = dt * yd(tn, yn)\\n val dy2 = dt * yd(tn + 0.5 * dt, yn + 0.5 * dy1)\\n val dy3 = dt * yd(tn + 0.5 * dt, yn + 0.5 * dy2)\\n val dy4 = dt * yd(tn + dt, yn + dy3)\\n yn += (dy1 + 2.0 * dy2 + 2.0 * dy3 + dy4) / 6.0\\n tn += dt\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n println(\\\" T RK4 Exact Error\\\")\\n println(\\\"---- ---------- ---------- ---------\\\")\\n val y = fun(t: Double): Double {\\n val x = t * t + 4.0\\n return x * x / 16.0\\n }\\n val yd = fun(t: Double, yt: Double) = t * Math.sqrt(yt)\\n rungeKutta4(0.0, 10.0, 0.1, y, yd)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"'[RC] Runge-Kutta method\\n'initial conditions\\nx0 = 0\\ny0 = 1\\n'step\\nh = 0.1\\n'number of points\\nN=101\\n\\ny=y0\\nFOR i = 0 TO N-1\\n x = x0+ i*h\\n IF x = INT(x) THEN\\n actual = exactY(x)\\n PRINT \\\"y(\\\"; x ;\\\") = \\\"; y; TAB(20); \\\"Error = \\\"; actual - y\\n END IF\\n\\n k1 = h*dydx(x,y)\\n k2 = h*dydx(x+h/2,y+k1/2)\\n k3 = h*dydx(x+h/2,y+k2/2)\\n k4 = h*dydx(x+h,y+k3)\\n y = y + 1/6 * (k1 + 2*k2 + 2*k3 + k4)\\nNEXT i\\n\\nfunction dydx(x,y)\\n dydx=x*sqr(y)\\nend function\\n\\nfunction exactY(x)\\n exactY=(x^2 + 4)^2 / 16\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"local df = function (t, y)\\n-- derivative of function by value y at time t\\n\\treturn t*y^0.5\\nend\\n\\nlocal dt = 0.1\\nlocal y = 1\\n\\nprint (\\\"t\\\", \\\"realY\\\"..' ', \\\"y\\\", '\\t\\t'..\\\"error\\\")\\nprint (\\\"---\\\", \\\"-------\\\"..' ', \\\"---------------\\\", '\\t'..\\\"--------------------\\\")\\n\\nfor i = 0, 100 do\\n\\tlocal t = i*dt\\n\\tif t%1 == 0 then\\n\\t\\tlocal realY = (t*t+4)^2/16\\n\\t\\tprint (t, realY..' ', y, '\\t'..realY-y)\\n\\tend\\n\\tlocal dy1 = df(t, y)\\n\\tlocal dy2 = df(t+dt/2, y+dt/2*dy1)\\n\\tlocal dy3 = df(t+dt/2, y+dt/2*dy2)\\n\\tlocal dy4 = df(t+dt, y+dt*dy3)\\n\\ty = y + dt*(dy1+2*dy2+2*dy3+dy4)/6\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"(* Symbolic solution *)\\nDSolve[{y'[t] == t*Sqrt[y[t]], y[0] == 1}, y, t]\\nTable[{t, 1/16 (4 + t^2)^2}, {t, 0, 10}]\\n\\n(* Numerical solution I (not RK4) *)\\nTable[{t, y[t], Abs[y[t] - 1/16*(4 + t^2)^2]}, {t, 0, 10}] /.\\n First@NDSolve[{y'[t] == t*Sqrt[y[t]], y[0] == 1}, y, {t, 0, 10}]\\n\\n(* Numerical solution II (RK4) *)\\nf[{t_, y_}] := {1, t Sqrt[y]}\\nh = 0.1;\\nphi[y_] := Module[{k1, k2, k3, k4},\\n k1 = h*f[y];\\n k2 = h*f[y + 1/2 k1];\\n k3 = h*f[y + 1/2 k2];\\n k4 = h*f[y + k3];\\n y + k1/6 + k2/3 + k3/3 + k4/6]\\nsolution = NestList[phi, {0, 1}, 101];\\nTable[{y[[1]], y[[2]], Abs[y[[2]] - 1/16 (y[[1]]^2 + 4)^2]},\\n {y, solution[[1 ;; 101 ;; 10]]}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function testRK4Programs\\n figure\\n hold on\\n t = 0:0.1:10;\\n y = 0.0625.*(t.^2+4).^2;\\n plot(t, y, '-k')\\n [tode4, yode4] = testODE4(t);\\n plot(tode4, yode4, '--b')\\n [trk4, yrk4] = testRK4(t);\\n plot(trk4, yrk4, ':r')\\n legend('Exact', 'ODE4', 'RK4')\\n hold off\\n fprintf('Time\\\\tExactVal\\\\tODE4Val\\\\tODE4Error\\\\tRK4Val\\\\tRK4Error\\\\n')\\n for k = 1:10:length(t)\\n fprintf('%.f\\\\t\\\\t%7.3f\\\\t\\\\t%7.3f\\\\t%7.3g\\\\t%7.3f\\\\t%7.3g\\\\n', t(k), y(k), ...\\n yode4(k), abs(y(k)-yode4(k)), yrk4(k), abs(y(k)-yrk4(k)))\\n end\\nend\\n\\nfunction [t, y] = testODE4(t)\\n y0 = 1;\\n y = ode4(@(tVal,yVal)tVal*sqrt(yVal), t, y0);\\nend\\n\\nfunction [t, y] = testRK4(t)\\n dydt = @(tVal,yVal)tVal*sqrt(yVal);\\n y = zeros(size(t));\\n y(1) = 1;\\n for k = 1:length(t)-1\\n dt = t(k+1)-t(k);\\n dy1 = dt*dydt(t(k), y(k));\\n dy2 = dt*dydt(t(k)+0.5*dt, y(k)+0.5*dy1);\\n dy3 = dt*dydt(t(k)+0.5*dt, y(k)+0.5*dy2);\\n dy4 = dt*dydt(t(k)+dt, y(k)+dy3);\\n y(k+1) = y(k)+(dy1+2*dy2+2*dy3+dy4)/6;\\n end\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"/* Here is how to solve a differential equation */\\n'diff(y, x) = x * sqrt(y);\\node2(%, y, x);\\nic1(%, x = 0, y = 1);\\nfactor(solve(%, y)); /* [y = (x^2 + 4)^2 / 16] */\\n\\n/* The Runge-Kutta solver is builtin */\\n\\nload(dynamics)$\\nsol: rk(t * sqrt(y), y, 1, [t, 0, 10, 1.0])$\\nplot2d([discrete, sol])$\\n\\n/* An implementation of RK4 for one equation */\\n\\nrk4(f, x0, y0, x1, n) := block([h, x, y, vx, vy, k1, k2, k3, k4],\\n h: bfloat((x1 - x0) / (n - 1)),\\n x: x0,\\n y: y0,\\n vx: makelist(0, n + 1),\\n vy: makelist(0, n + 1),\\n vx[1]: x0,\\n vy[1]: y0,\\n for i from 1 thru n do (\\n k1: bfloat(h * f(x, y)),\\n k2: bfloat(h * f(x + h / 2, y + k1 / 2)),\\n k3: bfloat(h * f(x + h / 2, y + k2 / 2)),\\n k4: bfloat(h * f(x + h, y + k3)),\\n vy[i + 1]: y: y + (k1 + 2 * k2 + 2 * k3 + k4) / 6,\\n vx[i + 1]: x: x + h\\n ),\\n [vx, vy]\\n)$\\n\\n[x, y]: rk4(lambda([x, y], x * sqrt(y)), 0, 1, 10, 101)$\\n\\nplot2d([discrete, x, y])$\\n\\ns: map(lambda([x], (x^2 + 4)^2 / 16), x)$\\n\\nfor i from 1 step 10 thru 101 do print(x[i], \\\" \\\", y[i], \\\" \\\", y[i] - s[i]);\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"import math\\n\\nproc fn(t, y: float): float =\\n result = t * math.sqrt(y)\\n\\nproc solution(t: float): float =\\n result = (t^2 + 4)^2 / 16\\n\\nproc rk(start, stop, step: float) =\\n let nsteps = int(round((stop - start) / step)) + 1\\n let delta = (stop - start) / float(nsteps - 1)\\n var cur_y = 1.0\\n for i in 0..(nsteps - 1):\\n let cur_t = start + delta * float(i)\\n\\n if abs(cur_t - math.round(cur_t)) < 1e-5:\\n echo \\\"y(\\\", cur_t, \\\") = \\\", cur_y, \\\", error = \\\", solution(cur_t) - cur_y\\n\\n let dy1 = step * fn(cur_t, cur_y)\\n let dy2 = step * fn(cur_t + 0.5 * step, cur_y + 0.5 * dy1)\\n let dy3 = step * fn(cur_t + 0.5 * step, cur_y + 0.5 * dy2)\\n let dy4 = step * fn(cur_t + step, cur_y + dy3)\\nimport math, strformat\\n\\nproc fn(t, y: float): float =\\n result = t * math.sqrt(y)\\n\\nproc solution(t: float): float =\\n result = (t^2 + 4)^2 / 16\\n\\nproc rk(start, stop, step: float) =\\n let nsteps = int(round((stop - start) / step)) + 1\\n let delta = (stop - start) / float(nsteps - 1)\\n var cur_y = 1.0\\n for i in 0..<nsteps:\\n let cur_t = start + delta * float(i)\\n\\n if abs(cur_t - math.round(cur_t)) < 1e-5:\\n echo &\\\"y({cur_t}) = {cur_y}, error = {solution(cur_t) - cur_y}\\\"\\n\\n let dy1 = step * fn(cur_t, cur_y)\\n let dy2 = step * fn(cur_t + 0.5 * step, cur_y + 0.5 * dy1)\\n let dy3 = step * fn(cur_t + 0.5 * step, cur_y + 0.5 * dy2)\\n let dy4 = step * fn(cur_t + step, cur_y + dy3)\\n\\n cur_y += (dy1 + 2 * (dy2 + dy3) + dy4) / 6\\n\\nrk(start = 0, stop = 10, step = 0.1)\\n cur_y += (dy1 + 2.0 * (dy2 + dy3) + dy4)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"class RungeKuttaMethod {\\n function : Main(args : String[]) ~ Nil {\\n x0 := 0.0; x1 := 10.0; dx := .1;\\n\\n n := 1 + (x1 - x0)/dx;\\n y := Float->New[n->As(Int)];\\n\\n y[0] := 1;\\n for(i := 1; i < n; i++;) {\\n y[i] := Rk4(Rate(Float, Float) ~ Float, dx, x0 + dx * (i - 1), y[i-1]);\\n };\\n\\n for(i := 0; i < n; i += 10;) {\\n x := x0 + dx * i;\\n y2 := (x * x / 4 + 1)->Power(2.0);\\n\\n x_value := x->As(Int);\\n y_value := y[i];\\n rel_value := y_value/y2 - 1.0;\\n \\\"y({$x_value})={$y_value}; error: {$rel_value}\\\"->PrintLine();\\n };\\n }\\n\\n function : native : Rk4(f : (Float, Float) ~ Float, dx : Float, x : Float, y : Float) ~ Float {\\n k1 := dx * f(x, y);\\n k2 := dx * f(x + dx / 2, y + k1 / 2);\\n k3 := dx * f(x + dx / 2, y + k2 / 2);\\n k4 := dx * f(x + dx, y + k3);\\n\\n return y + (k1 + 2 * k2 + 2 * k3 + k4) / 6;\\n }\\n\\n function : native : Rate(x : Float, y : Float) ~ Float {\\n return x * y->SquareRoot();\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"let y' t y = t *. sqrt y\\nlet exact t = let u = 0.25*.t*.t +. 1.0 in u*.u\\n\\nlet rk4_step (y,t) h =\\n let k1 = h *. y' t y in\\n let k2 = h *. y' (t +. 0.5*.h) (y +. 0.5*.k1) in\\n let k3 = h *. y' (t +. 0.5*.h) (y +. 0.5*.k2) in\\n let k4 = h *. y' (t +. h) (y +. k3) in\\n (y +. (k1+.k4)/.6.0 +. (k2+.k3)/.3.0, t +. h)\\n\\nlet rec loop h n (y,t) =\\n if n mod 10 = 1 then\\n Printf.printf \\\"t = %f,\\\\ty = %f,\\\\terr = %g\\\\n\\\" t y (abs_float (y -. exact t));\\n if n < 102 then loop h (n+1) (rk4_step (y,t) h)\\n\\nlet _ = loop 0.1 1 (1.0, 0.0)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"#Applying the Runge-Kutta method (This code must be implement on a different file than the main one).\\n\\nfunction temp = rk4(func,x,pvi,h)\\n K1 = h*func(x,pvi);\\n K2 = h*func(x+0.5*h,pvi+0.5*K1);\\n K3 = h*func(x+0.5*h,pvi+0.5*K2);\\n K4 = h*func(x+h,pvi+K3);\\n temp = pvi + (K1 + 2*K2 + 2*K3 + K4)/6;\\nendfunction\\n\\n#Main Program.\\n\\nf = @(t) (1/16)*((t.^2 + 4).^2);\\ndf = @(t,y) t*sqrt(y);\\n\\npvi = 1.0;\\nh = 0.1;\\nYn = pvi;\\n\\nfor x = 0:h:10-h\\n pvi = rk4(df,x,pvi,h);\\n Yn = [Yn pvi];\\nendfor\\n\\nfprintf('Time \\\\t Exact Value \\\\t ODE4 Value \\\\t Num. Error\\\\n');\\n\\nfor i=0:10\\n fprintf('%d \\\\t %.5f \\\\t %.5f \\\\t %.4g \\\\n',i,f(i),Yn(1+i*10),f(i)-Yn(1+i*10));\\nendfor\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"rk4(f,dx,x,y)={\\n my(k1=dx*f(x,y), k2=dx*f(x+dx/2,y+k1/2), k3=dx*f(x+dx/2,y+k2/2), k4=dx*f(x+dx,y+k3));\\n y + (k1 + 2*k2 + 2*k3 + k4) / 6\\n};\\nrate(x,y)=x*sqrt(y);\\ngo()={\\n my(x0=0,x1=10,dx=.1,n=1+(x1-x0)\\\\dx,y=vector(n));\\n y[1]=1;\\n for(i=2,n,y[i]=rk4(rate, dx, x0 + dx * (i - 1), y[i-1]));\\n print(\\\"x\\\\ty\\\\trel. err.\\\\n------------\\\");\\n forstep(i=1,n,10,\\n my(x=x0+dx*i,y2=(x^2/4+1)^2);\\n print(x \\\"\\\\t\\\" y[i] \\\"\\\\t\\\" y[i]/y2 - 1)\\n )\\n};\\ngo()\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"program RungeKuttaExample;\\n\\nuses sysutils;\\n\\ntype\\n TDerivative = function (t, y : Real) : Real;\\n\\nprocedure RungeKutta(yDer : TDerivative;\\n var t, y : array of Real;\\n dt : Real);\\nvar\\n dy1, dy2, dy3, dy4 : Real;\\n idx : Cardinal;\\n\\nbegin\\n for idx := Low(t) to High(t) - 1 do\\n begin\\n dy1 := dt * yDer(t[idx], y[idx]);\\n dy2 := dt * yDer(t[idx] + dt / 2.0, y[idx] + dy1 / 2.0);\\n dy3 := dt * yDer(t[idx] + dt / 2.0, y[idx] + dy2 / 2.0);\\n dy4 := dt * yDer(t[idx] + dt, y[idx] + dy3);\\n\\n t[idx + 1] := t[idx] + dt;\\n y[idx + 1] := y[idx] + (dy1 + 2.0 * (dy2 + dy3) + dy4) / 6.0;\\n end;\\nend;\\n\\nfunction CalcError(t, y : Real) : Real;\\nvar\\n trueVal : Real;\\n\\nbegin\\n trueVal := sqr(sqr(t) + 4.0) / 16.0;\\n CalcError := abs(trueVal - y);\\nend;\\n\\nprocedure Print(t, y : array of Real;\\n modnum : Integer);\\nvar\\n idx : Cardinal;\\n\\nbegin\\n for idx := Low(t) to High(t) do\\n begin\\n if idx mod modnum = 0 then\\n begin\\n WriteLn(Format('y(%4.1f) = %12.8f Error: %12.6e',\\n [t[idx], y[idx], CalcError(t[idx], y[idx])]));\\n end;\\n end;\\nend;\\n\\nfunction YPrime(t, y : Real) : Real;\\nbegin\\n YPrime := t * sqrt(y);\\nend;\\n\\nconst\\n dt = 0.10;\\n N = 100;\\n\\nvar\\n tArr, yArr : array [0..N] of Real;\\n\\nbegin\\n tArr[0] := 0.0;\\n yArr[0] := 1.0;\\n\\n RungeKutta(@YPrime, tArr, yArr, dt);\\n Print(tArr, yArr, 10);\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"sub runge_kutta {\\n my ($yp, $dt) = @_;\\n sub {\\n\\tmy ($t, $y) = @_;\\n\\tmy @dy = $dt * $yp->( $t , $y );\\n\\tpush @dy, $dt * $yp->( $t + $dt/2, $y + $dy[0]/2 );\\n\\tpush @dy, $dt * $yp->( $t + $dt/2, $y + $dy[1]/2 );\\n\\tpush @dy, $dt * $yp->( $t + $dt , $y + $dy[2] );\\n\\treturn $t + $dt, $y + ($dy[0] + 2*$dy[1] + 2*$dy[2] + $dy[3]) / 6;\\n }\\n}\\n\\nmy $RK = runge_kutta sub { $_[0] * sqrt $_[1] }, .1;\\n\\nfor(\\n my ($t, $y) = (0, 1);\\n sprintf(\\\"%.0f\\\", $t) <= 10;\\n ($t, $y) = $RK->($t, $y)\\n) {\\n printf \\\"y(%2.0f) = %12f ± %e\\\\n\\\", $t, $y, abs($y - ($t**2 + 4)**2 / 16)\\n if sprintf(\\\"%.4f\\\", $t) =~ /0000$/;\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">dt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0.1</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1.0</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" x true/actual y calculated y relative error\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" --- ------------- ------------- --------------\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">100</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">dt</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #004080;\\\">integer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">act</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">16</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%4.1f %14.9f %14.9f %.9e\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">act</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">abs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">act</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">k1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #7060A8;\\\">sqrt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">k2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">dt</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #7060A8;\\\">sqrt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">dt</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">k1</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">k3</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">dt</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #7060A8;\\\">sqrt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">dt</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">k2</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">k4</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">dt</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #7060A8;\\\">sqrt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">dt</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">k3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">dt</span><span style=\\\"color: #0000FF;\\\">*(</span><span style=\\\"color: #000000;\\\">k1</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*(</span><span style=\\\"color: #000000;\\\">k2</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">k3</span><span style=\\\"color: #0000FF;\\\">)+</span><span style=\\\"color: #000000;\\\">k4</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">6</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"Runge_Kutta: procedure options (main); /* 10 March 2014 */\\n declare (y, dy1, dy2, dy3, dy4) float (18);\\n declare t fixed decimal (10,1);\\n declare dt float (18) static initial (0.1);\\n\\n y = 1;\\n do t = 0 to 10 by 0.1;\\n dy1 = dt * ydash(t, y);\\n dy2 = dt * ydash(t + dt/2, y + dy1/2);\\n dy3 = dt * ydash(t + dt/2, y + dy2/2);\\n dy4 = dt * ydash(t + dt, y + dy3);\\n\\n if mod(t, 1.0) = 0 then\\n put skip edit('y(', trim(t), ')=', y, ', error = ', abs(y - (t**2 + 4)**2 / 16 ))\\n (3 a, column(9), f(16,10), a, f(13,10));\\n y = y + (dy1 + 2*dy2 + 2*dy3 + dy4)/6;\\n end;\\n\\n\\nydash: procedure (t, y) returns (float(18));\\n declare (t, y) float (18) nonassignable;\\n return ( t*sqrt(y) );\\nend ydash;\\n\\nend Runge_kutta;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"function Runge-Kutta (${function:F}, ${function:y}, $y0, $t0, $dt, $tEnd) {\\n function RK ($tn,$yn) {\\n $y1 = $dt*(F -t $tn -y $yn)\\n $y2 = $dt*(F -t ($tn + (1/2)*$dt) -y ($yn + (1/2)*$y1))\\n $y3 = $dt*(F -t ($tn + (1/2)*$dt) -y ($yn + (1/2)*$y2))\\n $y4 = $dt*(F -t ($tn + $dt) -y ($yn + $y3))\\n $yn + (1/6)*($y1 + 2*$y2 + 2*$y3 + $y4)\\n }\\n function time ($t0, $dt, $tEnd) {\\n $end = [MATH]::Floor(($tEnd - $t0)/$dt)\\n foreach ($_ in 0..$end) { $_*$dt + $t0 }\\n }\\n $time, $yn, $t = (time $t0 $dt $tEnd), $y0, 0\\n foreach ($tn in $time) {\\n if($t -eq $tn) {\\n [pscustomobject]@{\\n t = \\\"$tn\\\"\\n y = \\\"$yn\\\"\\n error = \\\"$([MATH]::abs($yn - (y $tn)))\\\"\\n }\\n $t += 1\\n }\\n $yn = RK $tn $yn\\n }\\n}\\nfunction F ($t,$y) {\\n $t * [MATH]::Sqrt($y)\\n}\\nfunction y ($t) {\\n (1/16) * [MATH]::Pow($t*$t + 4,2)\\n}\\n$y0 = 1\\n$t0 = 0\\n$dt = 0.1\\n$tEnd = 10\\nRunge-Kutta F y $y0 $t0 $dt $tEnd\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"EnableExplicit\\nDefine.i i\\nDefine.d y=1.0, k1=0.0, k2=0.0, k3=0.0, k4=0.0, t=0.0\\n\\nIf OpenConsole()\\n For i=0 To 100\\n t=i/10\\n If Not i%10\\n PrintN(\\\"y(\\\"+RSet(StrF(t,0),2,\\\" \\\")+\\\") =\\\"+RSet(StrF(y,4),9,\\\" \\\")+#TAB$+\\\"Error =\\\"+RSet(StrF(Pow(Pow(t,2)+4,2)/16-y,10),14,\\\" \\\"))\\n EndIf\\n k1=t*Sqr(y)\\n k2=(t+0.05)*Sqr(y+0.05*k1)\\n k3=(t+0.05)*Sqr(y+0.05*k2)\\n k4=(t+0.10)*Sqr(y+0.10*k3)\\n y+0.1*(k1+2*(k2+k3)+k4)/6\\n Next\\n Print(\\\"Press return to exit...\\\") : Input()\\nEndIf\\nEnd\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"from math import sqrt\\n\\ndef rk4(f, x0, y0, x1, n):\\n vx = [0] * (n + 1)\\n vy = [0] * (n + 1)\\n h = (x1 - x0) / float(n)\\n vx[0] = x = x0\\n vy[0] = y = y0\\n for i in range(1, n + 1):\\n k1 = h * f(x, y)\\n k2 = h * f(x + 0.5 * h, y + 0.5 * k1)\\n k3 = h * f(x + 0.5 * h, y + 0.5 * k2)\\n k4 = h * f(x + h, y + k3)\\n vx[i] = x = x0 + i * h\\n vy[i] = y = y + (k1 + k2 + k2 + k3 + k3 + k4) / 6\\n return vx, vy\\n\\ndef f(x, y):\\n return x * sqrt(y)\\n\\nvx, vy = rk4(f, 0, 1, 10, 100)\\nfor x, y in list(zip(vx, vy))[::10]:\\n print(\\\"%4.1f %10.5f %+12.4e\\\" % (x, y, y - (4 + x * x)**2 / 16))\\n\\n 0.0 1.00000 +0.0000e+00\\n 1.0 1.56250 -1.4572e-07\\n 2.0 4.00000 -9.1948e-07\\n 3.0 10.56250 -2.9096e-06\\n 4.0 24.99999 -6.2349e-06\\n 5.0 52.56249 -1.0820e-05\\n 6.0 99.99998 -1.6595e-05\\n 7.0 175.56248 -2.3518e-05\\n 8.0 288.99997 -3.1565e-05\\n 9.0 451.56246 -4.0723e-05\\n10.0 675.99995 -5.0983e-05\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"y! = 1\\nFOR i = 0 TO 100\\n t = i / 10\\n\\n IF t = INT(t) THEN\\n actual! = ((t ^ 2 + 4) ^ 2) / 16\\n PRINT USING \\\"y(##) = ###.###### Error = \\\"; t; y;\\n PRINT actual - y\\n END IF\\n\\n k1! = t * SQR(y)\\n k2! = (t + .05) * SQR(y + .05 * k1)\\n k3! = (t + .05) * SQR(y + .05 * k2)\\n k4! = (t + .1) * SQR(y + .1 * k3)\\n y = y + .1 * (k1 + 2 * (k2 + k3) + k4) / 6\\nNEXT i\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \"rk4 <- function(f, x0, y0, x1, n) {\\n vx <- double(n + 1)\\n vy <- double(n + 1)\\n vx[1] <- x <- x0\\n vy[1] <- y <- y0\\n h <- (x1 - x0)/n\\n for(i in 1:n) {\\n k1 <- h*f(x, y)\\n k2 <- h*f(x + 0.5*h, y + 0.5*k1)\\n k3 <- h*f(x + 0.5*h, y + 0.5*k2)\\n k4 <- h*f(x + h, y + k3)\\n vx[i + 1] <- x <- x0 + i*h\\n vy[i + 1] <- y <- y + (k1 + k2 + k2 + k3 + k3 + k4)/6\\n }\\n cbind(vx, vy)\\n}\\n\\nsol <- rk4(function(x, y) x*sqrt(y), 0, 1, 10, 100)\\ncbind(sol, sol[, 2] - (4 + sol[, 1]^2)^2/16)[seq(1, 101, 10), ]\\n\\n vx vy\\n [1,] 0 1.000000 0.000000e+00\\n [2,] 1 1.562500 -1.457219e-07\\n [3,] 2 3.999999 -9.194792e-07\\n [4,] 3 10.562497 -2.909562e-06\\n [5,] 4 24.999994 -6.234909e-06\\n [6,] 5 52.562489 -1.081970e-05\\n [7,] 6 99.999983 -1.659460e-05\\n [8,] 7 175.562476 -2.351773e-05\\n [9,] 8 288.999968 -3.156520e-05\\n[10,] 9 451.562459 -4.072316e-05\\n[11,] 10 675.999949 -5.098329e-05\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"(define (RK4 F δt)\\n (λ (t y)\\n (define δy1 (* δt (F t y)))\\n (define δy2 (* δt (F (+ t (* 1/2 δt)) (+ y (* 1/2 δy1)))))\\n (define δy3 (* δt (F (+ t (* 1/2 δt)) (+ y (* 1/2 δy2)))))\\n (define δy4 (* δt (F (+ t δt) (+ y δy1))))\\n (list (+ t δt)\\n (+ y (* 1/6 (+ δy1 (* 2 δy2) (* 2 δy3) δy4))))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(define ((step-subdivision n method) F h)\\n (λ (x . y) (last (ODE-solve F (cons x y)\\n #:x-max (+ x h)\\n #:step (/ h n)\\n #:method method))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(define (F t y) (* t (sqrt y)))\\n\\n(define (exact-solution t) (* 1/16 (sqr (+ 4 (sqr t)))))\\n\\n(define numeric-solution\\n (ODE-solve F '(0 1) #:x-max 10 #:step 1 #:method (step-subdivision 10 RK4)))\\n\\n(for ([s numeric-solution])\\n (match-define (list t y) s)\\n (printf \\\"t=~a\\\\ty=~a\\\\terror=~a\\\\n\\\" t y (- y (exact-solution t))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"> (require plot)\\n> (plot (list (function exact-solution 0 10 #:label \\\"Exact solution\\\")\\n (points numeric-solution #:label \\\"Runge-Kutta method\\\"))\\n #:x-label \\\"t\\\" #:y-label \\\"y(t)\\\")\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub runge-kutta(&yp) {\\n return -> \\\\t, \\\\y, \\\\δt {\\n my $a = δt * yp( t, y );\\n my $b = δt * yp( t + δt/2, y + $a/2 );\\n my $c = δt * yp( t + δt/2, y + $b/2 );\\n my $d = δt * yp( t + δt, y + $c );\\n ($a + 2*($b + $c) + $d) / 6;\\n }\\n}\\n\\nconstant δt = .1;\\nmy &δy = runge-kutta { $^t * sqrt($^y) };\\n\\nloop (\\n my ($t, $y) = (0, 1);\\n $t <= 10;\\n ($t, $y) »+=« (δt, δy($t, $y, δt))\\n) {\\n printf \\\"y(%2d) = %12f ± %e\\\\n\\\", $t, $y, abs($y - ($t**2 + 4)**2 / 16)\\n if $t %% 1;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program uses the Runge─Kutta method to solve the equation: y'(t) = t² √[y(t)] */\\nnumeric digits 40; f= digits() % 4 /*use 40 decimal digs, but only show 10*/\\nx0= 0; x1= 10; dx= .1 /*define variables: X0 X1 DX */\\nn=1 + (x1-x0) / dx\\ny.=1; do m=1 for n-1; p= m - 1; y.m= RK4(dx, x0 + dx*p, y.p)\\n end /*m*/ /* [↑] use 4th order Runge─Kutta. */\\nw= digits() % 2 /*W: width used for displaying numbers.*/\\nsay center('X', f, \\\"═\\\") center('Y', w+2, \\\"═\\\") center(\\\"relative error\\\", w+8, '═') /*hdr*/\\n\\n do i=0 to n-1 by 10; x= (x0 + dx*i) / 1; $= y.i / (x*x/4+1)**2 - 1\\n say center(x, f) fmt(y.i) left('', 2 + ($>=0) ) fmt($)\\n end /*i*/ /*└┴┴┴───◄─────── aligns positive #'s. */\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nfmt: parse arg z; z= right( format(z, w, f), w); hasE= pos('E', z)>0; has.= pos(., z)>0\\n jus= has. & \\\\hasE; T= 'T'; if jus then z= left( strip( strip(z, T, 0), T, .), w)\\n return translate( right(z, (z>=0) + w + 5*hasE + 2*(jus & (z<0) ) ), 'e', \\\"E\\\")\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nRK4: procedure; parse arg dx,x,y; dxH= dx/2; k1= dx * (x ) * sqrt(y )\\n k2= dx * (x + dxH) * sqrt(y + k1/2)\\n k3= dx * (x + dxH) * sqrt(y + k2/2)\\n k4= dx * (x + dx ) * sqrt(y + k3 )\\n return y + (k1 + k2*2 + k3*2 + k4) / 6\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nsqrt: procedure; parse arg x; if x=0 then return 0; d=digits(); m.=9; numeric form; h=d+6\\n numeric digits; parse value format(x,2,1,,0) 'E0' with g 'E' _ .; g=g * .5'e'_ % 2\\n do j=0 while h>9; m.j=h; h=h%2+1; end /*j*/\\n do k=j+5 to 0 by -1; numeric digits m.k; g=(g+x/g)*.5; end /*k*/; return g\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"decimals(8)\\ny = 1.0\\nfor i = 0 to 100\\n t = i / 10\\n if t = floor(t)\\n actual = (pow((pow(t,2) + 4),2)) / 16\\n see \\\"y(\\\" + t + \\\") = \\\" + y + \\\" error = \\\" + (actual - y) + nl ok\\n k1 = t * sqrt(y)\\n k2 = (t + 0.05) * sqrt(y + 0.05 * k1)\\n k3 = (t + 0.05) * sqrt(y + 0.05 * k2)\\n k4 = (t + 0.10) * sqrt(y + 0.10 * k3)\\n y += 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\\nnext\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def calc_rk4(f)\\n return ->(t,y,dt){\\n ->(dy1 ){\\n ->(dy2 ){\\n ->(dy3 ){\\n ->(dy4 ){ ( dy1 + 2*dy2 + 2*dy3 + dy4 ) / 6 }.call(\\n dt * f.call( t + dt , y + dy3 ))}.call(\\n dt * f.call( t + dt/2, y + dy2/2 ))}.call(\\n dt * f.call( t + dt/2, y + dy1/2 ))}.call(\\n dt * f.call( t , y ))}\\nend\\n\\nTIME_MAXIMUM, WHOLE_TOLERANCE = 10.0, 1.0e-5\\nT_START, Y_START, DT = 0.0, 1.0, 0.10\\n\\ndef my_diff_eqn(t,y) ; t * Math.sqrt(y) ; end\\ndef my_solution(t ) ; (t**2 + 4)**2 / 16 ; end\\ndef find_error(t,y) ; (y - my_solution(t)).abs ; end\\ndef is_whole?(t ) ; (t.round - t).abs < WHOLE_TOLERANCE ; end\\n\\ndy = calc_rk4( ->(t,y){my_diff_eqn(t,y)} )\\n\\nt, y = T_START, Y_START\\nwhile t <= TIME_MAXIMUM\\n printf(\\\"y(%4.1f)\\\\t= %12.6f \\\\t error: %12.6e\\\\n\\\",t,y,find_error(t,y)) if is_whole?(t)\\n t, y = t + DT, y + dy.call(t,y,DT)\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"y\\t= 1\\nwhile t <= 10\\n k1\\t= t * sqr(y)\\n k2\\t= (t + .05) * sqr(y + .05 * k1)\\n k3\\t= (t + .05) * sqr(y + .05 * k2)\\n k4\\t= (t + .1) * sqr(y + .1 * k3)\\n\\nif right$(using(\\\"##.#\\\",t),1) = \\\"0\\\" then print \\\"y(\\\";using(\\\"##\\\",t);\\\") =\\\"; using(\\\"####.#######\\\", y);chr$(9);\\\"Error =\\\"; (((t^2 + 4)^2) /16) -y\\n y = y + .1 *(k1 + 2 * (k2 + k3) + k4) / 6\\n t = t + .1\\nwend\\nend\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"fn runge_kutta4(fx: &dyn Fn(f64, f64) -> f64, x: f64, y: f64, dx: f64) -> f64 {\\n let k1 = dx * fx(x, y);\\n let k2 = dx * fx(x + dx / 2.0, y + k1 / 2.0);\\n let k3 = dx * fx(x + dx / 2.0, y + k2 / 2.0);\\n let k4 = dx * fx(x + dx, y + k3);\\n\\n y + (k1 + 2.0 * k2 + 2.0 * k3 + k4) / 6.0\\n}\\n\\nfn f(x: f64, y: f64) -> f64 {\\n x * y.sqrt()\\n}\\n\\nfn actual(x: f64) -> f64 {\\n (1.0 / 16.0) * (x * x + 4.0).powi(2)\\n}\\n\\nfn main() {\\n let mut y = 1.0;\\n let mut x = 0.0;\\n let step = 0.1;\\n let max_steps = 101;\\n let sample_every_n = 10;\\n\\n for steps in 0..max_steps {\\n if steps % sample_every_n == 0 {\\n println!(\\\"y({}):\\\\t{:.10}\\\\t\\\\t {:E}\\\", x, y, actual(x) - y)\\n }\\n\\n y = runge_kutta4(&f, x, y, step);\\n\\n x = ((x * 10.0) + (step * 10.0)) / 10.0;\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object Main extends App {\\n val f = (t: Double, y: Double) => t * Math.sqrt(y) // Runge-Kutta solution\\n val g = (t: Double) => Math.pow(t * t + 4, 2) / 16 // Exact solution\\n new Calculator(f, Some(g)).compute(100, 0, .1, 1)\\n}\\n\\nclass Calculator(f: (Double, Double) => Double, g: Option[Double => Double] = None) {\\n def compute(counter: Int, tn: Double, dt: Double, yn: Double): Unit = {\\n if (counter % 10 == 0) {\\n val c = (x: Double => Double) => (t: Double) => {\\n val err = Math.abs(x(t) - yn)\\n f\\\" Error: $err%7.5e\\\"\\n }\\n val s = g.map(c(_)).getOrElse((x: Double) => \\\"\\\") // If we don't have exact solution, just print nothing\\n println(f\\\"y($tn%4.1f) = $yn%12.8f${s(tn)}\\\") // Else, print Error estimation here\\n }\\n if (counter > 0) {\\n val dy1 = dt * f(tn, yn)\\n val dy2 = dt * f(tn + dt / 2, yn + dy1 / 2)\\n val dy3 = dt * f(tn + dt / 2, yn + dy2 / 2)\\n val dy4 = dt * f(tn + dt, yn + dy3)\\n val y = yn + (dy1 + 2 * dy2 + 2 * dy3 + dy4) / 6\\n val t = tn + dt\\n compute(counter - 1, t, dt, y)\\n }\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"func runge_kutta(yp) {\\n func (t, y, δt) {\\n var a = (δt * yp(t, y));\\n var b = (δt * yp(t + δt/2, y + a/2));\\n var c = (δt * yp(t + δt/2, y + b/2));\\n var d = (δt * yp(t + δt, y + c));\\n (a + 2*(b + c) + d) / 6;\\n }\\n}\\n\\ndefine δt = 0.1;\\nvar δy = runge_kutta(func(t, y) { t * y.sqrt });\\n\\nvar(t, y) = (0, 1);\\nloop {\\n t.is_int &&\\n printf(\\\"y(%2d) = %12f ± %e\\\\n\\\", t, y, abs(y - ((t**2 + 4)**2 / 16)));\\n t <= 10 || break;\\n y += δy(t, y, δt);\\n t += δt;\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"fun step y' (tn,yn) dt =\\n let\\n val dy1 = dt * y'(tn,yn)\\n val dy2 = dt * y'(tn + 0.5 * dt, yn + 0.5 * dy1)\\n val dy3 = dt * y'(tn + 0.5 * dt, yn + 0.5 * dy2)\\n val dy4 = dt * y'(tn + dt, yn + dy3)\\n in\\n (tn + dt, yn + (1.0 / 6.0) * (dy1 + 2.0*dy2 + 2.0*dy3 + dy4))\\n end\\n\\n(* Suggested test case *)\\nfun testy' (t,y) =\\n t * Math.sqrt y\\n\\nfun testy t =\\n (1.0 / 16.0) * Math.pow(Math.pow(t,2.0) + 4.0, 2.0)\\n\\n(* Test-runner that iterates the step function and prints the results. *)\\nfun test t0 y0 dt steps print_freq y y' =\\n let\\n fun loop i (tn,yn) =\\n if i = steps then ()\\n else\\n let\\n val (t1,y1) = step y' (tn,yn) dt\\n val y1' = y tn\\n val () = if i mod print_freq = 0 then\\n (print (\\\"Time: \\\" ^ Real.toString tn ^ \\\"\\\\n\\\");\\n print (\\\"Exact: \\\" ^ Real.toString y1' ^ \\\"\\\\n\\\");\\n print (\\\"Approx: \\\" ^ Real.toString yn ^ \\\"\\\\n\\\");\\n print (\\\"Error: \\\" ^ Real.toString (y1' - yn) ^ \\\"\\\\n\\\\n\\\"))\\n else ()\\n in\\n loop (i+1) (t1,y1)\\n end\\n in\\n loop 0 (t0,y0)\\n end\\n\\n(* Run the suggested test case *)\\nval () = test 0.0 1.0 0.1 101 10 testy testy'\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"function rk4(f, t0, y0, t1, n) {\\n\\th = (t1-t0)/(n-1)\\n\\ta = J(n, 2, 0)\\n\\ta[1, 1] = t = t0\\n\\ta[1, 2] = y = y0\\n\\tfor (i=2; i<=n; i++) {\\n\\t\\tk1 = h*(*f)(t, y)\\n\\t\\tk2 = h*(*f)(t+0.5*h, y+0.5*k1)\\n\\t\\tk3 = h*(*f)(t+0.5*h, y+0.5*k2)\\n\\t\\tk4 = h*(*f)(t+h, y+k3)\\n\\t\\tt = t+h\\n\\t\\ty = y+(k1+2*k2+2*k3+k4)/6\\n\\t\\ta[i, 1] = t\\n\\t\\ta[i, 2] = y\\n\\t}\\n\\treturn(a)\\n}\\n\\nfunction f(t, y) {\\n\\treturn(t*sqrt(y))\\n}\\n\\na = rk4(&f(), 0, 1, 10, 101)\\nt = a[., 1]\\na = a, a[., 2]:-(t:^2:+4):^2:/16\\na[range(1,101,10), .]\\n\\n 1 2 3\\n +----------------------------------------------+\\n 1 | 0 1 0 |\\n 2 | 1 1.562499854 -1.45722e-07 |\\n 3 | 2 3.999999081 -9.19479e-07 |\\n 4 | 3 10.56249709 -2.90956e-06 |\\n 5 | 4 24.99999377 -6.23491e-06 |\\n 6 | 5 52.56248918 -.0000108197 |\\n 7 | 6 99.99998341 -.0000165946 |\\n 8 | 7 175.5624765 -.0000235177 |\\n 9 | 8 288.9999684 -.0000315652 |\\n 10 | 9 451.5624593 -.0000407232 |\\n 11 | 10 675.999949 -.0000509833 |\\n +----------------------------------------------+\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"import Foundation\\n\\nfunc rk4(dx: Double, x: Double, y: Double, f: (Double, Double) -> Double) -> Double {\\n let k1 = dx * f(x, y)\\n let k2 = dx * f(x + dx / 2, y + k1 / 2)\\n let k3 = dx * f(x + dx / 2, y + k2 / 2)\\n let k4 = dx * f(x + dx, y + k3)\\n\\n return y + (k1 + 2 * k2 + 2 * k3 + k4) / 6\\n}\\n\\nvar y = [Double]()\\nvar x: Double = 0.0\\nvar y2: Double = 0.0\\n\\nvar x0: Double = 0.0\\nvar x1: Double = 10.0\\nvar dx: Double = 0.1\\n\\nvar i = 0\\nvar n = Int(1 + (x1 - x0) / dx)\\n\\ny.append(1)\\nfor i in 1..<n {\\n y.append(rk4(dx, x: x0 + dx * (Double(i) - 1), y: y[i - 1]) { (x: Double, y: Double) -> Double in\\n return x * sqrt(y)\\n })\\n}\\n\\nprint(\\\" x y rel. err.\\\")\\nprint(\\\"------------------------------\\\")\\n\\nfor (var i = 0; i < n; i += 10) {\\n x = x0 + dx * Double(i)\\n y2 = pow(x * x / 4 + 1, 2)\\n\\n print(String(format: \\\"%2g %11.6g %11.5g\\\", x, y[i], y[i]/y2 - 1))\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"package require Tcl 8.5\\n\\n# Hack to bring argument function into expression\\nproc tcl::mathfunc::dy {t y} {upvar 1 dyFn dyFn; $dyFn $t $y}\\n\\nproc rk4step {dyFn y* t* dt} {\\n upvar 1 ${y*} y ${t*} t\\n set dy1 [expr {$dt * dy($t, $y)}]\\n set dy2 [expr {$dt * dy($t+$dt/2, $y+$dy1/2)}]\\n set dy3 [expr {$dt * dy($t+$dt/2, $y+$dy2/2)}]\\n set dy4 [expr {$dt * dy($t+$dt, $y+$dy3)}]\\n set y [expr {$y + ($dy1 + 2*$dy2 + 2*$dy3 + $dy4)/6.0}]\\n set t [expr {$t + $dt}]\\n}\\n\\nproc y {t} {expr {($t**2 + 4)**2 / 16}}\\nproc δy {t y} {expr {$t * sqrt($y)}}\\n\\nproc printvals {t y} {\\n set err [expr {abs($y - [y $t])}]\\n puts [format \\\"y(%.1f) = %.8f\\\\tError: %.8e\\\" $t $y $err]\\n}\\n\\nset t 0.0\\nset y 1.0\\nset dt 0.1\\nprintvals $t $y\\nfor {set i 1} {$i <= 101} {incr i} {\\n rk4step δy y t $dt\\n if {$i%10 == 0} {\\n\\tprintvals $t $y\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"LET y = 1\\nFOR i = 0 TO 100\\n LET t = i / 10\\n\\n IF t = INT(t) THEN\\n LET actual = ((t ^ 2 + 4) ^ 2) / 16\\n PRINT \\\"y(\\\"; STR$(t); \\\") =\\\"; y ; TAB(20); \\\"Error = \\\"; actual - y\\n END IF\\n\\n LET k1 = t * SQR(y)\\n LET k2 = (t + 0.05) * SQR(y + 0.05 * k1)\\n LET k3 = (t + 0.05) * SQR(y + 0.05 * k2)\\n LET k4 = (t + 0.10) * SQR(y + 0.10 * k3)\\n LET Y = Y + 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\\nNEXT i\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"import math\\n\\nfn main() {\\n\\tmut t, mut k1, mut k2, mut k3, mut k4, mut y := 0.0, 0.0, 0.0, 0.0, 0.0, 1.0\\n\\tfor i in 0..101 {\\n\\t\\tt = i / 10.0\\n\\t\\tif t == math.floor(t) {\\n\\t\\t\\tactual := math.pow((math.pow(t, 2) + 4), 2)/16\\n\\t\\t\\tprintln(\\\"y(${t:.0}) = ${y:.8f} error = ${(actual - y):.8f}\\\")\\n\\t\\t}\\n\\t\\tk1 = t * math.sqrt(y)\\n\\t\\tk2 = (t + 0.05) * math.sqrt(y + 0.05 * k1)\\n\\t\\tk3 = (t + 0.05) * math.sqrt(y + 0.05 * k2)\\n\\t\\tk4 = (t + 0.10) * math.sqrt(y + 0.10 * k3)\\n\\t\\ty += 0.1 * (k1 + 2 * (k2 + k3) + k4) / 6\\n\\t}\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar rungeKutta4 = Fn.new { |t0, tz, dt, y, yd|\\n var tn = t0\\n var yn = y.call(tn)\\n var z = ((tz - t0)/dt).truncate\\n for (i in 0..z) {\\n if (i % 10 == 0) {\\n var exact = y.call(tn)\\n var error = yn - exact\\n Fmt.print(\\\"$4.1f $10f $10f $9f\\\", tn, yn, exact, error)\\n }\\n if (i == z) break\\n var dy1 = dt * yd.call(tn, yn)\\n var dy2 = dt * yd.call(tn + 0.5 * dt, yn + 0.5 * dy1)\\n var dy3 = dt * yd.call(tn + 0.5 * dt, yn + 0.5 * dy2)\\n var dy4 = dt * yd.call(tn + dt, yn + dy3)\\n yn = yn + (dy1 + 2.0 * dy2 + 2.0 * dy3 + dy4) / 6.0\\n tn = tn + dt\\n }\\n}\\n\\nSystem.print(\\\" T RK4 Exact Error\\\")\\nSystem.print(\\\"---- --------- ---------- ---------\\\")\\nvar y = Fn.new { |t|\\n var x = t * t + 4.0\\n return x * x / 16.0\\n}\\nvar yd = Fn.new { |t, yt| t * yt.sqrt }\\nrungeKutta4.call(0, 10, 0.1, y, yd)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func real Y_(T, Y);\\nreal T, Y;\\nreturn T*sqrt(Y);\\n\\ndef DT = 0.1;\\nreal T, Y, Exact, DY1, DY2, DY3, DY4;\\n[Text(0, \\\" T RK Exact Error^m^j\\\");\\nT:= 0.; Y:= 1.;\\nrepeat if Mod(T+.001, 1.) < .01 then\\n [Format(2, 1);\\n RlOut(0, T);\\n Format(5, 7);\\n RlOut(0, Y);\\n Exact:= sq(T*T+4.)/16.;\\n RlOut(0, Exact);\\n RlOut(0, Y-Exact);\\n CrLf(0);\\n ];\\n DY1:= DT * Y_(T, Y);\\n DY2:= DT * Y_(T+DT/2., Y+DY1/2.);\\n DY3:= DT * Y_(T+DT/2., Y+DY2/2.);\\n DY4:= DT * Y_(T+DT, Y+DY3);\\n Y:= Y + (DY1 + 2.*DY2 + 2.*DY3 + DY4) / 6.;\\n T:= T + DT;\\nuntil T > 10.;\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"fcn yp(t,y) { t * y.sqrt() }\\nfcn exact(t){ u:=0.25*t*t + 1.0; u*u }\\n\\nfcn rk4_step([(y,t)],h){\\n k1:=h * yp(t,y);\\n k2:=h * yp(t + 0.5*h, y + 0.5*k1);\\n k3:=h * yp(t + 0.5*h, y + 0.5*k2);\\n k4:=h * yp(t + h, y + k3);\\n T(y + (k1+k4)/6.0 + (k2+k3)/3.0, t + h);\\n}\\n\\nfcn loop(h,n,[(y,t)]){\\n if(n % 10 == 1)\\n print(\\\"t = %f,\\\\ty = %f,\\\\terr = %g\\\\n\\\".fmt(t,y,(y - exact(t)).abs()));\\n if(n < 102) return(loop(h,(n+1),rk4_step(T(y,t),h))) //tail recursion\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Runge-Kutta-method"}}},{"rowIdx":1599,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Runtime_evaluation\n","language":"00-META"},{"code":";Task:\nDemonstrate a language's ability for programs to execute code written in the language provided at runtime. \n\nShow what kind of program fragments are permitted (e.g. expressions vs. statements), and how to get values in and out (e.g. environments, arguments, return values), if applicable what lexical/static environment the program is evaluated in, and what facilities for restricting (e.g. sandboxes, resource limits) or customizing (e.g. debugging facilities) the execution.\n\nYou may not invoke a separate evaluator program, or invoke a compiler and then its output, unless the interface of that program, and the syntax and means of executing it, are considered part of your language/library/platform.\n\nFor a more constrained task giving a specific program fragment to evaluate, see [[Eval in environment]].\n<br><br>\n","language":"00-TASK"},{"code":";Init Routine\n*=$0801\n\tdb $0E,$08,$0A,$00,$9E,$20,$28,$32,$30,$36,$34,$29,$00,$00,$00\n*=$0810\t;Start at $0810\n\n\t\n\tLDA #$A9\t\t;opcode for LDA immediate\n\tSTA smc_test\n\t\n\tLDA #'A'\n\tSTA smc_test+1\n\t\n\tlda #$20\t\t;opcode for JSR\n\tSTA smc_test+2\n\t\n\tlda #<CHROUT\n\tSTA smc_test+3\n\t\n\tlda #>CHROUT\n\tSTA smc_test+4\n\t\n\t\nsmc_test:\n\tnop\t\t\t\t;gets overwritten with LDA\n\tnop\t\t\t\t;gets overwritten with #$41\n\tnop\t\t\t\t;gets overwritten with JSR\n\tnop\t\t\t\t;gets overwritten with <CHROUT\n\tnop\t\t\t\t;gets overwritten with >CHROUT\n\t\n\n\trts\t\t\t\t;return to basic\n","language":"6502-Assembly"},{"code":"print(evaluate(\"4.0*arctan(1.0)\"))\n","language":"ALGOL-68"},{"code":"# procedure to call the Algol 68G evaluate procedure #\n# the environment of the evaluation will be the caller's environment #\n# with \"code\", \"x\" and \"y\" defined as the procedure parameters #\nPROC ev = ( STRING code, INT x, INT y )STRING: evaluate( code );\n\nBEGIN\n\n INT i := 1;\n INT j := 2;\n REAL x := 4.2;\n REAL y := 0.7164;\n\n # evaluates \"i + j\" in the current environment #\n print( ( evaluate( \"i + j\" ), newline ) );\n\n # evaluates \"x + y\" in the environment of the procedure body of ev #\n print( ( ev( \"x + y\", i, j ), newline ) );\n\n # evaluates \"x + y\" in the current environment, so shows a different #\n # result to the previous call #\n print( ( evaluate( \"x + y\" ), newline ) );\n\n # prints \"code\" because code is defined in the environment of the #\n # call to evaluate (in ev) although it is not defined in this #\n # environment #\n print( ( ev( \"code\", 1, 2 ), newline ) );\n\n # prints \"code + codecode + code\" - see above #\n print( ( ev( \"code + code\", 1, 2 ), newline ) )\n\nEND\n\n# if this next call was executed, a runtime error would occur as x and y #\n# do not exist anymore #\n# ;print( ( evaluate( \"x + y\" ), newline ) ) #\n","language":"ALGOL-68"},{"code":"a: {print [\"The result is:\" 2+3]}\ndo a\n\nuserCode: input \"Give me some code: \"\ndo userCode\n","language":"Arturo"},{"code":"; requires AutoHotkey_H or AutoHotkey.dll\nmsgbox % eval(\"3 + 4\")\nmsgbox % eval(\"4 + 4\")\nreturn\n\n\neval(expression)\n{\nglobal script\nscript =\n(\n expression(){\n return %expression%\n }\n)\nrenameFunction(\"expression\", \"\") ; remove any previous expressions\ngosub load ; cannot use addScript inside a function yet\nexp := \"expression\"\nreturn %exp%()\n}\n\nload:\nDllCall(A_AhkPath \"\\addScript\",\"Str\",script,\"Uchar\",0,\"Cdecl UInt\")\nreturn\n\nrenameFunction(funcName, newname){\nstatic\nx%newname% := newname ; store newname in a static variable so its memory is not freed\nstrput(newname, &x%newname%, strlen(newname) + 1)\nif fnp := FindFunc(funcName)\n numput(&x%newname%, fnp+0, 0, \"uint\")\n}\n","language":"AutoHotkey"},{"code":"10 REM load the next program\n20 LOAD \"PROG2\"\n","language":"BASIC"},{"code":"10 LET f$=CHR$ 187+\"(x)+\"+CHR$ 178+\"(x*3)/2\": REM LET f$=\"SQR (x)+SIN (x*3)/2\"\n20 FOR x=0 TO 2 STEP 0.2\n30 LET y=VAL f$\n40 PRINT y\n50 NEXT x\n","language":"BASIC"},{"code":"10 LET f= SQR (x)+SIN (x*3)/2\n","language":"BASIC"},{"code":"10 LET f$=\" SQR (x)+SIN (x*3)/2\"\n","language":"BASIC"},{"code":" expr$ = \"PI^2 + 1\"\n PRINT EVAL(expr$)\n","language":"BBC-BASIC"},{"code":" exec$ = \"PRINT \"\"Hello world!\"\"\"\n bbc$ = FNtokenise(exec$)\n\n tmpfile$ = @tmp$+\"temp.bbc\"\n tmpfile% = OPENOUT(tmpfile$)\n BPUT#tmpfile%, bbc$+CHR$0\n CLOSE #tmpfile%\n\n CALL tmpfile$\n END\n\n DEF FNtokenise(A$)\n LOCAL A%\n A% = EVAL(\"0:\"+A$)\n A$ = $(!332+2)\n = CHR$(LENA$+4) + CHR$0 + CHR$0 + A$ + CHR$13\n","language":"BBC-BASIC"},{"code":"blsq ) {5 5 .+}e!\n10\n","language":"Burlesque"},{"code":"blsq ) 1 10r@{5.+}m[\n{6 7 8 9 10 11 12 13 14 15}\nblsq ) 1 10r@{5.+}6 0sam[\n{7 8 9 10 11 12 13 14 15 16}\n","language":"Burlesque"},{"code":"blsq ) 1 10r@\"5.+\"psm[\n{6 7 8 9 10 11 12 13 14 15}\n","language":"Burlesque"},{"code":"blsq ) \"[m}+.5{@r01 1\"<-pe\n{6 7 8 9 10 11 12 13 14 15}\n","language":"Burlesque"},{"code":"blsq ) {3 2}(?*)[+e!\n6\n","language":"Burlesque"},{"code":"blsq ) ?+\nERROR: Burlesque: (.+) Invalid arguments!\nblsq ) ?+to\n\"Error\"\nblsq ) (?+)\n?+\nblsq ) (?+)to\n\"Ident\"\n","language":"Burlesque"},{"code":"(eval '(+ 4 5)) ; returns 9\n","language":"Common-Lisp"},{"code":"(defun add-four-complicated (a-number)\n (eval `(+ 4 ',a-number)))\n","language":"Common-Lisp"},{"code":"(defun add-four-by-function (a-number)\n (funcall (eval '(lambda (n) (+ 4 n)))) a-number)\n","language":"Common-Lisp"},{"code":"(eval (read-from-string \"(+ 4 5)\"))\n","language":"Common-Lisp"},{"code":"(let ((x 11) (y 22))\n ;; This is an error! Inside the eval, x and y are unbound!\n (format t \"~%x + y = ~a\" (eval '(+ x y))))\n","language":"Common-Lisp"},{"code":"(let ((x 11) (y 22))\n (format t \"~%x + y = ~a\" (eval `(+ ,x ,y))))\n","language":"Common-Lisp"},{"code":"(system:run-shell-command ...)\n","language":"Common-Lisp"},{"code":"(find-symbol \"FOO\" \"BAR\")\n","language":"Common-Lisp"},{"code":"? e`1 + 1`.eval(safeScope)\n# value: 2\n","language":"E"},{"code":"? def [value, env] := e`def x := 1 + 1`.evalToPair(safeScope)\n# value: [2, ...]\n\n? e`x`.eval(env)\n# value: 2\n","language":"E"},{"code":"? def prog := <elang:syntax.makeEParser>.run(\"1 + 1\")\n# value: e`1.add(1)`\n\n? prog.eval(safeScope)\n# value: 2\n","language":"E"},{"code":"(eval (list * 6 7))\n → 42\n(eval '(* 6 7)) ;; quoted argument\n → 42\n(eval (read-from-string \"(* 6 7)\"))\n → 42\n","language":"EchoLisp"},{"code":"import extensions'scripting;\n\npublic program()\n{\n lscript.interpretLine(\"system'console.writeLine(\"\"Hello World\"\")\");\n}\n","language":"Elena"},{"code":"iex(1)> Code.eval_string(\"x + 4 * Enum.sum([1,2,3,4])\", [x: 17])\n{57, [x: 17]}\niex(2)> Code.eval_string(\"c = a + b\", [a: 1, b: 2])\n{3, [a: 1, b: 2, c: 3]}\niex(3)> Code.eval_string(\"a = a + b\", [a: 1, b: 2])\n{3, [a: 3, b: 2]}\n","language":"Elixir"},{"code":"1> {ok, Tokens, _} = erl_scan:string(\"X + 4 * lists:sum([1,2,3,4]).\").\n...\n2> {ok, [Form]} = erl_parse:parse_exprs(Tokens).\n...\n3> Bindings = erl_eval:add_binding('X', 17, erl_eval:new_bindings()).\n[{'X',17}]\n4> {value, Value, _} = erl_eval:expr(Form, Bindings).\n{value,57,[{'X',17}]}\n5> Value.\n57\n","language":"Erlang"},{"code":"s\" variable foo 1e fatan 4e f*\" evaluate\n\nf. \\ 3.14159...\n1 foo !\n","language":"Forth"},{"code":"unused . \\ show how much dictionary space is available\nmarker restore\n\ncreate foo 30 allot\n: my-def 30 0 do cr i . .\" test\" loop ;\n\nunused . \\ lower than before\n\nrestore\nunused . \\ same as first unused; restore, foo, and my-def no longer defined\n","language":"Forth"},{"code":"#macro assign(sym, expr)\n __fb_unquote__(__fb_eval__(\"#undef \" + sym))\n __fb_unquote__(__fb_eval__(\"#define \" + sym + \" \" + __fb_quote__(__fb_eval__(expr))))\n#endmacro\n\n#define a, b, x\n\nassign(\"a\", 8)\nassign(\"b\", 7)\nassign(\"x\", Sqr(a) + (Sin(b*3)/2))\nPrint x\n\nassign(\"x\", \"goodbye\")\nPrint x\n\nSleep\n","language":"FreeBASIC"},{"code":"eval[\"length = 1234 feet + 2 inches\"]\n","language":"Frink"},{"code":"package main\nimport (\n\t\"fmt\"\n\t\"bitbucket.org/binet/go-eval/pkg/eval\"\n\t\"go/token\"\n)\n\nfunc main() {\n\tw := eval.NewWorld();\n\tfset := token.NewFileSet();\n\n\tcode, err := w.Compile(fset, \"1 + 2\")\n\tif err != nil {\n\t\tfmt.Println(\"Compile error\");\n\t\treturn\n\t}\n\n\tval, err := code.Run();\n\tif err != nil {\n\t\tfmt.Println(\"Run time error\");\n\t\treturn;\n\t}\n\tfmt.Println(\"Return value:\", val) //prints, well, 3\n\n}\n","language":"Go"},{"code":"def years1 = new GroovyShell().evaluate('''\n(2008..2121).findAll {\n Date.parse(\"yyyy-MM-dd\", \"${it}-12-25\").format(\"EEE\") == \"Sun\"\n}\n''')\n\nprintln years1\n","language":"Groovy"},{"code":"def startYear = 2008\ndef endYear = 2121\ndef years2 = new GroovyShell().evaluate(\"\"\"\n(${startYear}..${endYear}).findAll {\n Date.parse(\"yyyy-MM-dd\", \"\\${it}-12-25\").format(\"EEE\") == \"Sun\"\n}\n\"\"\")\n\nprintln years2\n","language":"Groovy"},{"code":"def context = new Binding()\ncontext.startYear = 2008\ncontext.endYear = 2121\ndef years3 = new GroovyShell(context).evaluate('''\n(startYear..endYear).findAll {\n Date.parse(\"yyyy-MM-dd\", \"${it}-12-25\").format(\"EEE\") == \"Sun\"\n}\n''')\n","language":"Groovy"},{"code":"def years4 = new GroovyShell( new Binding(startYear: 2008, endYear: 2121) ).evaluate('''\n(startYear..endYear).findAll {\n Date.parse(\"yyyy-MM-dd\", \"${it}-12-25\").format(\"EEE\") == \"Sun\"\n}\n''')\n\nprintln years4\n","language":"Groovy"},{"code":"def binding = new Binding(startYear: 2008, endYear: 2121)\nnew GroovyShell( binding ).evaluate('''\nyearList = (startYear..endYear).findAll {\n Date.parse(\"yyyy-MM-dd\", \"${it}-12-25\").format(\"EEE\") == \"Sun\"\n}\n''')\n\nprintln binding.yearList\n","language":"Groovy"},{"code":"def years5 = Eval.xy(2008, 2121, '''\n(x..y).findAll {\n Date.parse(\"yyyy-MM-dd\", \"${it}-12-25\").format(\"EEE\") == \"Sun\"\n}\n''')\n\nprintln years5\n","language":"Groovy"},{"code":"10 LINE INPUT \"Type an expression: \",A$\n20 OPEN \"CHAIN.TMP\" FOR OUTPUT AS #1\n30 PRINT #1, \"70 LET Y=(\"+A$+\")\"\n40 CLOSE #1\n50 CHAIN MERGE \"CHAIN.TMP\",60,ALL\n60 FOR X=0 TO 5\n70 REM\n80 PRINT X,Y\n90 NEXT X\n100 GOTO 10\n","language":"GW-BASIC"},{"code":"Procedure Main()\n local bAdd := {|Label,n1,n2| Qout( Label ), QQout( n1 + n2 )}\n Eval( bAdd, \"5+5 = \", 5, 5 )\n Eval( bAdd, \"5-5 = \", 5, -5 )\n return\n\nUpon execution you see:\n5+5 = 10\n5-5 = 0\n","language":"Harbour"},{"code":"value = XEQ( \" temp = 1 + 2 + 3 \") ! value is assigned 6\n! temp is undefined outside XEQ, if it was not defined before.\n\nXEQ(\" WRITE(Messagebox) 'Hello World !' \")\n\nOPEN(FIle=\"my_file.txt\")\nREAD(FIle=\"my_file.txt\", Row=6) string\nXEQ( string ) ! executes row 6 of my_file.txt\n","language":"HicEst"},{"code":"(var x 123)\n[\n (eval \"(var y 100) (+ x y)\")\n y\n]\n","language":"HicEst"},{"code":"\". 'a =: +/ 1 2 3' NB. execute a string to sum 1, 2 and 3 and assign to noun a\n","language":"J"},{"code":"monad :'+/y' 1 2 3\n","language":"J"},{"code":"import java.io.ByteArrayOutputStream;\nimport java.io.IOException;\nimport java.io.OutputStream;\nimport java.lang.reflect.InvocationTargetException;\nimport java.net.URI;\nimport java.util.HashMap;\nimport java.util.LinkedList;\nimport java.util.List;\nimport java.util.Map;\nimport javax.tools.FileObject;\nimport javax.tools.ForwardingJavaFileManager;\nimport javax.tools.JavaCompiler;\nimport javax.tools.JavaFileObject;\nimport javax.tools.SimpleJavaFileObject;\nimport javax.tools.StandardJavaFileManager;\nimport javax.tools.StandardLocation;\nimport javax.tools.ToolProvider;\n\npublic class Evaluator{\n public static void main(String[] args){\n new Evaluator().eval(\n \"SayHello\",\n \"public class SayHello{public void speak(){System.out.println(\\\"Hello world\\\");}}\",\n \"speak\"\n );\n }\n\n void eval(String className, String classCode, String methodName){\n Map<String, ByteArrayOutputStream> classCache = new HashMap<>();\n JavaCompiler compiler = ToolProvider.getSystemJavaCompiler();\n\n if ( null == compiler )\n throw new RuntimeException(\"Could not get a compiler.\");\n\n StandardJavaFileManager sfm = compiler.getStandardFileManager(null, null, null);\n ForwardingJavaFileManager<StandardJavaFileManager> fjfm = new ForwardingJavaFileManager<StandardJavaFileManager>(sfm){\n @Override\n public JavaFileObject getJavaFileForOutput(Location location, String className, JavaFileObject.Kind kind, FileObject sibling)\n throws IOException{\n if (StandardLocation.CLASS_OUTPUT == location && JavaFileObject.Kind.CLASS == kind)\n return new SimpleJavaFileObject(URI.create(\"mem:///\" + className + \".class\"), JavaFileObject.Kind.CLASS){\n @Override\n public OutputStream openOutputStream()\n throws IOException{\n ByteArrayOutputStream baos = new ByteArrayOutputStream();\n classCache.put(className, baos);\n return baos;\n }\n };\n else\n throw new IllegalArgumentException(\"Unexpected output file requested: \" + location + \", \" + className + \", \" + kind);\n }\n };\n List<JavaFileObject> files = new LinkedList<JavaFileObject>(){{\n add(\n new SimpleJavaFileObject(URI.create(\"string:///\" + className + \".java\"), JavaFileObject.Kind.SOURCE){\n @Override\n public CharSequence getCharContent(boolean ignoreEncodingErrors){\n return classCode;\n }\n }\n );\n }};\n\n // Now we can compile!\n compiler.getTask(null, fjfm, null, null, null, files).call();\n\n try{\n Class<?> clarse = new ClassLoader(){\n @Override\n public Class<?> findClass(String name){\n if (! name.startsWith(className))\n throw new IllegalArgumentException(\"This class loader is for \" + className + \" - could not handle \\\"\" + name + '\"');\n byte[] bytes = classCache.get(name).toByteArray();\n return defineClass(name, bytes, 0, bytes.length);\n }\n }.loadClass(className);\n\n // Invoke a method on the thing we compiled\n clarse.getMethod(methodName).invoke(clarse.newInstance());\n\n }catch(ClassNotFoundException | InstantiationException | IllegalAccessException | NoSuchMethodException | InvocationTargetException x){\n throw new RuntimeException(\"Run failed: \" + x, x);\n }\n }\n}\n","language":"Java"},{"code":"var foo = eval('{value: 42}');\neval('var bar = \"Hello, world!\";');\n\ntypeof foo; // 'object'\ntypeof bar; // 'string'\n","language":"JavaScript"},{"code":"/* Runtime evaluation, in Jsish */\nvar foo = eval('{value: 42}');\neval('var bar = \"Hello, world!\";');\n\n;typeof foo;\n;foo.value;\n;typeof bar;\n;bar;\n\n/*\n=!EXPECTSTART!=\ntypeof foo ==> object\nfoo.value ==> 42\ntypeof bar ==> string\nbar ==> Hello, world!\n=!EXPECTEND!=\n*/\n","language":"Jsish"},{"code":"include(\"myfile.jl\")\n","language":"Julia"},{"code":"include_string(\"\"\"\n x = sum([1, 2, 3])\n @show x\n \"\"\")\n\n@show typeof(x) # Int64\n","language":"Julia"},{"code":"# Simple assignements are used so that rvalues are parsed as TEXT values\n$code=fn.println(Hello World!)\n# Returns VOID unless return or throw is explicitly used\nfn.exec($code)\n\n$code=return Hello World!\nfn.println(fn.exec($code))\n\n$code=throw $LANG_ERROR_DIV_BY_ZERO\n# Will print \"Dividing by 0\" in the Standard Lang implementation (Error texts are not standardized)\nfn.println(fn.errorText(fn.exec($code)))\n\n$code=parser.op(20//0)\n# Will return VOID because no error was thrown explicitly\nfn.println(fn.exec($code))\n","language":"Lang"},{"code":"//code, fragment name, autocollect, inplaintext\nlocal(mycode = \"'Hello world, it is '+date\")\nsourcefile('['+#mycode+']','arbritraty_name', true, true)->invoke\n\n'\\r'\n\n\nvar(x = 100)\nlocal(mycode = \"Outside Lasso\\r['Hello world, var x is '+var(x)]\")\n// autocollect (3rd param): return any output generated\n// inplaintext (4th param): if true, assumes this is mixed Lasso and plain text,\n//\t\trequires Lasso code to be in square brackets or other supported code block demarkation.\nsourcefile(#mycode,'arbritraty_name', true, true)->invoke\n\n'\\r'\n\nvar(y = 2)\nlocal(mycode = \"'Hello world, is there output?\\r'\nvar(x) *= var(y)\")\n// autocollect (3rd param): as false, no output returned\n// inplaintext (4th param): as false, assumes this is Lasso code, no mixed-mode Lasso and text.\nsourcefile(#mycode,'arbritraty_name', false, false)->invoke\n'var x is now: '+$x\n\n'\\r'\n\nvar(z = 3)\nlocal(mycode = \"var(x) *= var(z)\")\nsourcefile(#mycode,'arbritraty_name', false, false)->invoke\n'var x is now: '+$x\n","language":"Lasso"},{"code":"'Dimension a numerical and string array\nDim myArray(5)\nDim myStringArray$(5)\n\n'Fill both arrays with the appropriate data\nFor i = 0 To 5\n myArray(i) = i\n myStringArray$(i) = \"String - \" + str$(i)\nNext i\n\n'Set two variables with the names of each array\nnumArrayName$ = \"myArray\"\nstrArrayName$ = \"myStringArray\"\n\n'Retrieve the array data by evaluating a string\n'that correlates to the array\nFor i = 0 To 5\n Print Eval$(numArrayName$ + \"(\" + str$(i) + \")\")\n Print Eval$(strArrayName$ + \"$(\" + str$(i) + \")\")\nNext i\n","language":"Liberty-BASIC"},{"code":"Struct myStruct, value As long, _\n string As ptr\nmyStruct.value.struct = 10\nmyStruct.string.struct = \"Hello World!\"\n\nstructName$ = \"myStruct\"\nnumElement$ = \"value\"\nstrElement$ = \"string\"\n\nPrint Eval$(structName$ + \".\" + numElement$ + \".\" + \"struct\")\n\n'Pay close attention that this is EVAL() because we are\n'retrieving the PTR to the string which is essentially a ulong\nPrint Winstring(Eval(structName$ + \".\" + strElement$ + \".\" + \"struct\"))\n","language":"Liberty-BASIC"},{"code":"f = loadstring(s) -- load a string as a function. Returns a function.\n\none = loadstring\"return 1\" -- one() returns 1\n\ntwo = loadstring\"return ...\" -- two() returns the arguments passed to it\n","language":"Lua"},{"code":"f = load(\"return 42\")\nf() --> returns 42\n","language":"Lua"},{"code":"> f = load(\"return 42\")\n> f()\n42\n> n = load(\"return 42\")()\n> n\n42\n","language":"Lua"},{"code":"Module checkit {\n Module dummy {\n i++\n Print Number\n }\n \\\\ using Stack New { } we open a new stack for values, and old one connected back at the end\n \\\\ using block For This {} we erase any new definition, so we erase i (which Local make a new one)\n a$={\n Stack New {\n For this {\n Local i\n for i=1 to 10 : print i : next i\n }\n }\n If valid(k) then print k\n }\n i=500\n k=600\n Push 1000\n inline a$\n Print i=500\n Print Number=1000\n \\\\ eval an expression\n Print Eval(\"i+k\")\n \\\\ eval a function\n Print Function(\"{read x : = x**2}\", 2)=4\n Dim k(10)=123\n \\\\ eval array only\n Print array(\"k()\", 2)=123\n Push 10, 10\n \\\\ call a module by make it inline first\n inline code dummy, dummy\n Print i=502\n}\nCheckIt\n","language":"M2000-Interpreter"},{"code":"Print[ToExpression[\"1 + 1\"]];\nPrint[ToExpression[\"Print[\\\"Hello, world!\\\"]; 10!\"]];\nx = 5;\nPrint[ToExpression[\"x!\"]];\nPrint[ToExpression[\"Module[{x = 8}, x!]\"]];\nPrint[MemoryConstrained[ToExpression[\"Range[5]\"], 10000, {}]];\nPrint[MemoryConstrained[ToExpression[\"Range[10^5]\"], 10000, {}]];\nPrint[TimeConstrained[ToExpression[\"Pause[1]; True\"], 2, False]];\nPrint[TimeConstrained[ToExpression[\"Pause[60]; True\"], 2, False]];\n","language":"Mathematica"},{"code":"function testEval\n fprintf('Expressions:\\n')\n x = eval('5+10^2')\n eval('y = (x-100).*[1 2 3]')\n eval('z = strcat(''my'', '' string'')')\n try\n w eval(' = 45')\n catch\n fprintf('Runtime error: interpretation of w is a function\\n\\n')\n end\n % eval('v') = 5\n % Invalid at compile-time as MATLAB interprets as using eval as a variable\n\n fprintf('Other Statements:\\n')\n nl = sprintf('\\n');\n eval(['for k = 1:20' nl ...\n 'fprintf(''%.3f\\n'', k)' nl ...\n 'if k == 3' nl ...\n 'break' nl ...\n 'end' nl ...\n 'end'])\n true == eval('1')\n try\n true eval(' == 1')\n catch\n fprintf('Runtime error: interpretation of == 1 is of input to true\\n\\n')\n end\n\n fprintf('Programming on the fly:\\n')\n userIn = true;\n codeBlock = '';\n while userIn\n userIn = input('Enter next line of code: ', 's');\n codeBlock = [codeBlock nl userIn];\n end\n eval(codeBlock)\nend\n","language":"MATLAB"},{"code":"/* Here is how to create a function and return a value at runtime. In the first example,\nthe function is made global, i.e. it still exists after the statement is run. In the second example, the function\nis declared local. The evaluated string may read or write any variable defined before eval_string is run. */\n\nkill(f)$\n\neval_string(\"block(f(x) := x^2 + 1, f(2))\");\n5\n\nfundef(f);\n/* f(x) := x^2 + 1 */\n\neval_string(\"block([f], local(f), f(x) := x^3 + 1, f(2))\");\n9\n\nfundef(f);\n/* f(x) := x^2 + 1 */\n","language":"Maxima"},{"code":"exec(\"println \\\"hello, world\\\"\")\nexec(\"a = 1\\nif a = 1\\nprintln \\\"a is 1\\\"\\nend\\nprintln \\\"test\\\"\")\n","language":"Nanoquery"},{"code":"import ../compiler/[nimeval, llstream, ast], strformat, os\n\nlet std = findNimStdLibCompileTime()\nlet modules = [std, std / \"pure\", std / \"std\", std / \"core\"]\nvar intr = createInterpreter(\"script\", modules)\n\n#dynamic variable\nlet varname = commandLineParams()[0]\nlet expr = commandLineParams()[1]\n\n#wrap the naked variable name and expression in a definition and proc,respectively to create valid code\n#for simplicity, the variable will always be an int, but one could of course define the type at runtime\n#globals and procs must be exported with * to be accessable\n#we also need to import any modules needed by the runtime code\nintr.evalScript(llStreamOpen(&\"import math,sugar; var {varname}*:int; proc output*():auto = {expr}\"))\n\nfor i in 0..2:\n #set 'varname' to a value\n intr.getGlobalValue(intr.selectUniqueSymbol(varname)).intval = i\n #evaluate the expression and get the result\n let output = intr.callRoutine(intr.selectRoutine(\"output\"), [])\n #depending on the expression, the result could be any type\n #as an example, here we check for int,float,or string\n case output.kind\n of nkIntLit:\n echo expr, \" = \", output.intval\n of nkFloatLit:\n echo expr, \" = \", output.floatval\n of nkStrLit:\n echo expr, \" = \", output.strval\n else:\n discard\n\ndestroyInterpreter(intr)\n","language":"Nim"},{"code":"\"[ [ $a, 12], [$b, 1.2], [ $c, [ $aaa, $bbb, $ccc ] ], [ $torun, #first ] ]\" perform .s\n[1] (List) [[a, 12], [b, 1.2], [c, [aaa, bbb, ccc]], [torun, #first]]\n\n\"12 13 +\" perform\n[1:interpreter] ExCompiler : Can't evaluate <+>\n","language":"Oforth"},{"code":"\"12 13 + println\" eval\n25\n\": newFunction(a) a + ; 12 10 newFunction println\" eval\n22\n","language":"Oforth"},{"code":" a = .array~of(1, 2, 3)\n ins = \"loop num over a; say num; end\"\n interpret ins\n","language":"OoRexx"},{"code":" function ExecSeries(string s,double b,e,i) as string\n '===================================================\n '\n sys a,p\n string v,u,tab,cr,er\n '\n 'PREPARE OUTPUT BUFFER\n '\n p=1\n cr=chr(13) chr(10)\n tab=chr(9)\n v=nuls 4096\n mid v,p,s+cr+cr\n p+=4+len s\n '\n double x,y,z 'shared variables\n '\n 'COMPILE\n '\n a=compile s\n er=error\n if er then\n print \"runtime error: \" er : exit function\n end if\n '\n 'EXECUTE\n '\n for x=b to e step i\n if p+128>=len v then\n v+=nuls len(v) 'extend buffer\n end if\n call a\n u=str(x) tab str(y) cr\n mid v,p,u : p+=len u\n next\n '\n freememory a 'release compiled code\n '\n return left v,p-1 'results\n '\n end function\n\n '=====\n 'TESTS\n '=====\n\n 'Expression, StartVal, EndVal stepVal, Increment\n\n print ExecSeries \"y=x*x*x\", 1, 10, 1\n print ExecSeries \"y=sqrt x\",1, 9 , 1\n","language":"OxygenBasic"},{"code":"declare\n %% simplest case: just evaluate expressions without bindings\n R1 = {Compiler.virtualStringToValue \"{Abs ~42}\"}\n {Show R1}\n\n %% eval expressions with additional bindings and\n %% the possibility to kill the evaluation by calling KillProc\n KillProc\n R2 = {Compiler.evalExpression \"{Abs A}\" unit('A':~42) ?KillProc}\n {Show R2}\n\n %% full control: add and remove bindings, eval expressions or\n %% statements, set compiler switches etc.\n Engine = {New Compiler.engine init}\n {Engine enqueue(setSwitch(expression false))} %% statements instead of expr.\n {Engine enqueue(mergeEnv(env('A':42 'System':System)))}\n {Engine enqueue(feedVirtualString(\"{System.show A}\"))}\n","language":"Oz"},{"code":"runme(f)={\n f()\n};\n\nrunme( ()->print(\"Hello world!\") )\n","language":"PARI-GP"},{"code":"my ($a, $b) = (-5, 7);\n$ans = eval 'abs($a * $b)'; # => 35\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">-- demo\\rosetta\\Runtime_evaluation.exw</span>\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #7060A8;\">requires</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1.0.1\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #7060A8;\">eval</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span> <span style=\"color: #000080;font-style:italic;\">-- (not an autoinclude, pulls in around 90% of the interpreter/compiler proper)</span>\n\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">code</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n integer i = 0\n bool r_init = false\n sequence r\n if not r_init then r = {} end if\n for k=1 to 4 do\n i += k\n r &= k\n end for\n \"\"\"</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">eval</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">code</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"i\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"r\"</span><span style=\"color: #0000FF;\">})</span> <span style=\"color: #000080;font-style:italic;\">-- prints {10,{1,2,3,4}}</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">eval</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">code</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"r\"</span><span style=\"color: #0000FF;\">},{{</span><span style=\"color: #008000;\">\"r_init\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #008000;\">\"r\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">}}})</span> <span style=\"color: #000080;font-style:italic;\">-- prints {5,1,2,3,4}</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">eval</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">code</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"i\"</span><span style=\"color: #0000FF;\">},{{</span><span style=\"color: #008000;\">\"i\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">15</span><span style=\"color: #0000FF;\">}})</span> <span style=\"color: #000080;font-style:italic;\">-- prints {25}</span>\n <span style=\"color: #0000FF;\">{}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">eval</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">`puts(1,\"Hello World\\n\")`</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- prints Hello World</span>\n<!--\n","language":"Phix"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">eval_expression</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">expr</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">eval</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"object x = %s\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">expr</span><span style=\"color: #0000FF;\">}),{</span><span style=\"color: #008000;\">\"x\"</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">eval_expression</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"3+4\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- prints 7</span>\n<!--\n","language":"Phix"},{"code":"<?php\n $code = 'echo \"hello world\"';\n eval($code);\n $code = 'return \"hello world\"';\n print eval($code);\n","language":"PHP"},{"code":"program demo = compile_string(#\"\n string name=\\\"demo\\\";\n string hello()\n {\n return(\\\"hello, i am \\\"+name);\n }\");\n\ndemo()->hello();\nResult: \"hello, i am demo\"\n","language":"Pike"},{"code":"$test2plus2 = '2 + 2 -eq 4'\nInvoke-Expression $test2plus2\n","language":"PowerShell"},{"code":"$say = {\"Hello, world!\"}\n& $say\n","language":"PowerShell"},{"code":"$say = {param ([string]$Subject) \"Hello, $Subject!\"}\n& $say -Subject \"my friend\"\n","language":"PowerShell"},{"code":"$say = {param ([string]$Exclamation, [string]$Subject) \"$Exclamation, $Subject!\"}\n& $say -Exclamation \"Goodbye\" -Subject \"cruel world\"\n","language":"PowerShell"},{"code":"$title = \"Dong Work For Yuda\"\n$scriptblock = {$title}\n$closedScriptblock = $scriptblock.GetNewClosure()\n\n& $scriptblock\n& $closedScriptblock\n","language":"PowerShell"},{"code":"$title = \"I'm Too Sexy\"\n& $scriptblock\n& $closedScriptblock\n","language":"PowerShell"},{"code":">>> exec '''\nx = sum([1,2,3,4])\nprint x\n'''\n10\n","language":"Python"},{"code":">>> exec('''\nx = sum([1,2,3,4])\nprint(x)\n''')\n10\n","language":"Python"},{"code":"10 $ \"1 swap times [ i 1+ * ]\" quackery echo\n","language":"Quackery"},{"code":"expr1 <- quote(a+b*c)\nexpr2 <- parse(text=\"a+b*c\")[[1]]\nexpr3 <- call(\"+\", quote(`a`), call(\"*\", quote(`b`), quote(`c`)))\n","language":"R"},{"code":"> a <- 1; b <- 2; c <- 3\n> eval(expr1)\n[1] 7\n","language":"R"},{"code":"> env <- as.environment(list(a=1, b=3, c=2))\n> evalq(a, env)\n[1] 1\n> eval(expr1, env) #this fails; env has only emptyenv() as a parent so can't find \"+\"\nError in eval(expr, envir, enclos) : could not find function \"+\"\n> parent.env(env) <- sys.frame()\n> eval(expr1, env) # eval in env, enclosed in the current context\n[1] 7\n> assign(\"b\", 5, env) # assign() can assign into environments\n> eval(expr1, env)\n[1] 11\n","language":"R"},{"code":"#lang racket\n(require racket/sandbox)\n(define e (make-evaluator 'racket))\n(e '(define + *))\n(e '(+ 10 20))\n(+ 10 20)\n;; (e '(delete-file \"/etc/passwd\"))\n;; --> delete-file: `delete' access denied for /etc/passwd\n","language":"Racket"},{"code":"use MONKEY-SEE-NO-EVAL;\n\nmy ($a, $b) = (-5, 7);\nmy $ans = EVAL 'abs($a * $b)'; # => 35\n","language":"Raku"},{"code":"a: -5\nb: 7\nanswer: do [abs a * b] ; => 35\n","language":"REBOL"},{"code":"/*REXX program illustrates the ability to execute code entered at runtime (from C.L.)*/\nnumeric digits 10000000 /*ten million digits should do it. */\nbee=51\nstuff= 'bee=min(-2,44); say 13*2 \"[from inside the box.]\"; abc=abs(bee)'\ninterpret stuff\nsay 'bee=' bee\nsay 'abc=' abc\nsay\n /* [↓] now, we hear from the user. */\nsay 'enter an expression:'\npull expression\nsay\nsay 'expression entered is:' expression\nsay\n\ninterpret '?='expression\n\nsay 'length of result='length(?)\nsay ' left 50 bytes of result='left(?,50)\"···\"\nsay 'right 50 bytes of result=···'right(?, 50) /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"Eval(\"nOutput = 5+2*5 \" )\nSee \"5+2*5 = \" + nOutput + nl\nEval(\"for x = 1 to 10 see x + nl next\")\nEval(\"func test see 'message from test!' \")\ntest()\n","language":"Ring"},{"code":"5+2*5 = 15\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\nmessage from test!\n","language":"Ring"},{"code":"while true\n see nl + \"code:> \"\n give cCode\n try\n eval(cCode)\n catch\n see cCatchError\n done\nend\n","language":"Ring"},{"code":"code:> see \"hello world\"\nhello world\ncode:> for x = 1 to 10 see x + nl next\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n\ncode:> func test see \"Hello from test\" + nl\n\ncode:> test()\nHello from test\n\ncode:> bye\n","language":"Ring"},{"code":"a, b = 5, -7\nans = eval \"(a * b).abs\" # => 35\n","language":"Ruby"},{"code":"def first(main_var, main_binding)\n foo = 42\n second [[main_var, main_binding], [\"foo\", binding]]\nend\n\ndef second(args)\n sqr = lambda {|x| x**2}\n deref(args << [\"sqr\", binding])\nend\n\ndef deref(stuff)\n stuff.each do |varname, context|\n puts \"value of #{varname} is #{eval varname, context}\"\n end\nend\n\nhello = \"world\"\nfirst \"hello\", binding\n","language":"Ruby"},{"code":"> (define x 37)\n> (eval '(+ x 5))\n42\n> (eval '(+ x 5) (interaction-environment))\n42\n> (eval '(+ x 5) (scheme-report-environment 5)) ;; provides R5RS definitions\n\nError: identifier not visible x.\nType (debug) to enter the debugger.\n> (display (eval (read)))\n(+ 4 5) ;; this is input from the user.\n9\n","language":"Scheme"},{"code":"var (a, b) = (-5, 7);\nsay eval '(a * b).abs'; # => 35\nsay (a * b -> abs); # => 35\n","language":"Sidef"},{"code":"`(4 + 5) evaluate.\n`(4 + 5) evaluateIn: prototypes.\n","language":"Slate"},{"code":"(Syntax Parser newOn: '4 + 5') upToEnd do: [| :each | print: each evaluate]\n","language":"Slate"},{"code":"define: #x -> 4.\n`(x `unquote + 5) evaluate.\n","language":"Slate"},{"code":"define: #x -> 4.\n(Syntax Parser newOn: x printString ; ' + 5')\n","language":"Slate"},{"code":"define: #x -> 4.\n[| x | x: 5. `(x `unquote + 5) evaluate] do.\n","language":"Slate"},{"code":"(eval (list '+ 1 2 3 4 5))\n","language":"Slope"},{"code":"(eval \"(+ 1 2 3 4 5)\" #t)\n","language":"Slope"},{"code":"[ 4 + 5 ] value.\n","language":"Smalltalk"},{"code":"e := ' 123 degreesToRadians sin '.\nTranscript show: (Compiler evaluate: e) .\n","language":"Smalltalk"},{"code":"e := '[ :x :y | (x*x + (y*y)) sqrt ]'.\nTranscript show: ((Compiler evaluate: e) value: 3 value: 4).\n","language":"Smalltalk"},{"code":" expression = \"' page ' (i + 1)\"\n i = 7\n output = eval(expression)\nend\n","language":"SNOBOL4"},{"code":" compiled = code(' output = \"Hello, world.\"') :s<compiled>\nend\n","language":"SNOBOL4"},{"code":"let fn = exprtofn(\"13 + 37\");\nfn() // -> 50\n","language":"Sparkling"},{"code":"let fn = exprtofn(\"#0 * #1\");\nfn(3, 4) // -> 12\n","language":"Sparkling"},{"code":"let fn = compile(\"for (var i = 0; i < 10; i++) { print(i); }\");\nfn(); // result: 0 1 2 3 4 5 6 7 8 9\n","language":"Sparkling"},{"code":"set four 4\nset result1 [eval \"expr {$four + 5}\"] ;# string input\n\nset result2 [eval [list expr [list $four + 5]]] ;# list input\n","language":"Tcl"},{"code":"# Create an interpreter with a default set of restrictions\ninterp create -safe restrictedContext\n\n# Our secret variable\nset v \"secret\"\n\n# Allow some guarded access to the secret from the restricted context.\ninterp alias restrictedContext doubleSecret {} example\nproc example {} {\n global v\n lappend v $v\n return [llength $v]\n}\n\n# Evaluate a script in the restricted context\nputs [restrictedContext eval {\n append v \" has been leaked\"\n catch {file delete yourCriticalFile.txt} ;# Will be denied!\n return \"there are [doubleSecret] words in the secret: the magic number is [expr {4 + 5}]\"\n}]; # --> there are 2 words in the secret: the magic number is 9\nputs $v; # --> secret secret\n","language":"Tcl"},{"code":"set i [interp create]\ninterp limit $i commands -value [expr [$i eval info cmdcount]+20] -granularity 1\ninterp eval $i {\n set x 0\n while {1} { # Infinite loop! Bwahahahaha!\n puts \"Counting up... [incr x]\"\n }\n}\n","language":"Tcl"},{"code":"#lang transd\n\nMainModule : {\n str: \"(textout \\\"eval output: \\\" (+ 1 1))\",\n\n _start: (λ\n (eval str)\n )\n}\n","language":"Transd"},{"code":"$ a=42\n$ b=a\n$ eval \"echo \\$$b\"\n42\n","language":"UNIX-Shell"},{"code":"# writes hello world to the console\neval \"out \\\"hello world\\\" endl console\" console\n","language":"Ursa"},{"code":"import \"meta\" for Meta\n\nvar s = \"for (i in 0..4) System.print(i)\"\nMeta.eval(s)\n","language":"Wren"},{"code":"Compiler.Compiler.compileText(\n \"fcn f(text){text.len()}\").f(\"foobar\")\n//-->6\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Runtime_evaluation\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nDemonstrate a language's ability for programs to execute code written in the language provided at runtime. \\n\\nShow what kind of program fragments are permitted (e.g. expressions vs. statements), and how to get values in and out (e.g. environments, arguments, return values), if applicable what lexical/static environment the program is evaluated in, and what facilities for restricting (e.g. sandboxes, resource limits) or customizing (e.g. debugging facilities) the execution.\\n\\nYou may not invoke a separate evaluator program, or invoke a compiler and then its output, unless the interface of that program, and the syntax and means of executing it, are considered part of your language/library/platform.\\n\\nFor a more constrained task giving a specific program fragment to evaluate, see [[Eval in environment]].\\n<br><br>\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \";Init Routine\\n*=$0801\\n\\tdb $0E,$08,$0A,$00,$9E,$20,$28,$32,$30,$36,$34,$29,$00,$00,$00\\n*=$0810\\t;Start at $0810\\n\\n\\t\\n\\tLDA #$A9\\t\\t;opcode for LDA immediate\\n\\tSTA smc_test\\n\\t\\n\\tLDA #'A'\\n\\tSTA smc_test+1\\n\\t\\n\\tlda #$20\\t\\t;opcode for JSR\\n\\tSTA smc_test+2\\n\\t\\n\\tlda #<CHROUT\\n\\tSTA smc_test+3\\n\\t\\n\\tlda #>CHROUT\\n\\tSTA smc_test+4\\n\\t\\n\\t\\nsmc_test:\\n\\tnop\\t\\t\\t\\t;gets overwritten with LDA\\n\\tnop\\t\\t\\t\\t;gets overwritten with #$41\\n\\tnop\\t\\t\\t\\t;gets overwritten with JSR\\n\\tnop\\t\\t\\t\\t;gets overwritten with <CHROUT\\n\\tnop\\t\\t\\t\\t;gets overwritten with >CHROUT\\n\\t\\n\\n\\trts\\t\\t\\t\\t;return to basic\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"print(evaluate(\\\"4.0*arctan(1.0)\\\"))\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"# procedure to call the Algol 68G evaluate procedure #\\n# the environment of the evaluation will be the caller's environment #\\n# with \\\"code\\\", \\\"x\\\" and \\\"y\\\" defined as the procedure parameters #\\nPROC ev = ( STRING code, INT x, INT y )STRING: evaluate( code );\\n\\nBEGIN\\n\\n INT i := 1;\\n INT j := 2;\\n REAL x := 4.2;\\n REAL y := 0.7164;\\n\\n # evaluates \\\"i + j\\\" in the current environment #\\n print( ( evaluate( \\\"i + j\\\" ), newline ) );\\n\\n # evaluates \\\"x + y\\\" in the environment of the procedure body of ev #\\n print( ( ev( \\\"x + y\\\", i, j ), newline ) );\\n\\n # evaluates \\\"x + y\\\" in the current environment, so shows a different #\\n # result to the previous call #\\n print( ( evaluate( \\\"x + y\\\" ), newline ) );\\n\\n # prints \\\"code\\\" because code is defined in the environment of the #\\n # call to evaluate (in ev) although it is not defined in this #\\n # environment #\\n print( ( ev( \\\"code\\\", 1, 2 ), newline ) );\\n\\n # prints \\\"code + codecode + code\\\" - see above #\\n print( ( ev( \\\"code + code\\\", 1, 2 ), newline ) )\\n\\nEND\\n\\n# if this next call was executed, a runtime error would occur as x and y #\\n# do not exist anymore #\\n# ;print( ( evaluate( \\\"x + y\\\" ), newline ) ) #\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"a: {print [\\\"The result is:\\\" 2+3]}\\ndo a\\n\\nuserCode: input \\\"Give me some code: \\\"\\ndo userCode\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"; requires AutoHotkey_H or AutoHotkey.dll\\nmsgbox % eval(\\\"3 + 4\\\")\\nmsgbox % eval(\\\"4 + 4\\\")\\nreturn\\n\\n\\neval(expression)\\n{\\nglobal script\\nscript =\\n(\\n expression(){\\n return %expression%\\n }\\n)\\nrenameFunction(\\\"expression\\\", \\\"\\\") ; remove any previous expressions\\ngosub load ; cannot use addScript inside a function yet\\nexp := \\\"expression\\\"\\nreturn %exp%()\\n}\\n\\nload:\\nDllCall(A_AhkPath \\\"\\\\addScript\\\",\\\"Str\\\",script,\\\"Uchar\\\",0,\\\"Cdecl UInt\\\")\\nreturn\\n\\nrenameFunction(funcName, newname){\\nstatic\\nx%newname% := newname ; store newname in a static variable so its memory is not freed\\nstrput(newname, &x%newname%, strlen(newname) + 1)\\nif fnp := FindFunc(funcName)\\n numput(&x%newname%, fnp+0, 0, \\\"uint\\\")\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"10 REM load the next program\\n20 LOAD \\\"PROG2\\\"\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"10 LET f$=CHR$ 187+\\\"(x)+\\\"+CHR$ 178+\\\"(x*3)/2\\\": REM LET f$=\\\"SQR (x)+SIN (x*3)/2\\\"\\n20 FOR x=0 TO 2 STEP 0.2\\n30 LET y=VAL f$\\n40 PRINT y\\n50 NEXT x\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"10 LET f= SQR (x)+SIN (x*3)/2\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"10 LET f$=\\\" SQR (x)+SIN (x*3)/2\\\"\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \" expr$ = \\\"PI^2 + 1\\\"\\n PRINT EVAL(expr$)\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \" exec$ = \\\"PRINT \\\"\\\"Hello world!\\\"\\\"\\\"\\n bbc$ = FNtokenise(exec$)\\n\\n tmpfile$ = @tmp$+\\\"temp.bbc\\\"\\n tmpfile% = OPENOUT(tmpfile$)\\n BPUT#tmpfile%, bbc$+CHR$0\\n CLOSE #tmpfile%\\n\\n CALL tmpfile$\\n END\\n\\n DEF FNtokenise(A$)\\n LOCAL A%\\n A% = EVAL(\\\"0:\\\"+A$)\\n A$ = $(!332+2)\\n = CHR$(LENA$+4) + CHR$0 + CHR$0 + A$ + CHR$13\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"blsq ) {5 5 .+}e!\\n10\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"blsq ) 1 10r@{5.+}m[\\n{6 7 8 9 10 11 12 13 14 15}\\nblsq ) 1 10r@{5.+}6 0sam[\\n{7 8 9 10 11 12 13 14 15 16}\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"blsq ) 1 10r@\\\"5.+\\\"psm[\\n{6 7 8 9 10 11 12 13 14 15}\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"blsq ) \\\"[m}+.5{@r01 1\\\"<-pe\\n{6 7 8 9 10 11 12 13 14 15}\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"blsq ) {3 2}(?*)[+e!\\n6\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"blsq ) ?+\\nERROR: Burlesque: (.+) Invalid arguments!\\nblsq ) ?+to\\n\\\"Error\\\"\\nblsq ) (?+)\\n?+\\nblsq ) (?+)to\\n\\\"Ident\\\"\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"(eval '(+ 4 5)) ; returns 9\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defun add-four-complicated (a-number)\\n (eval `(+ 4 ',a-number)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defun add-four-by-function (a-number)\\n (funcall (eval '(lambda (n) (+ 4 n)))) a-number)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(eval (read-from-string \\\"(+ 4 5)\\\"))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(let ((x 11) (y 22))\\n ;; This is an error! Inside the eval, x and y are unbound!\\n (format t \\\"~%x + y = ~a\\\" (eval '(+ x y))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(let ((x 11) (y 22))\\n (format t \\\"~%x + y = ~a\\\" (eval `(+ ,x ,y))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(system:run-shell-command ...)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(find-symbol \\\"FOO\\\" \\\"BAR\\\")\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"? e`1 + 1`.eval(safeScope)\\n# value: 2\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"? def [value, env] := e`def x := 1 + 1`.evalToPair(safeScope)\\n# value: [2, ...]\\n\\n? e`x`.eval(env)\\n# value: 2\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"? def prog := <elang:syntax.makeEParser>.run(\\\"1 + 1\\\")\\n# value: e`1.add(1)`\\n\\n? prog.eval(safeScope)\\n# value: 2\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"(eval (list * 6 7))\\n → 42\\n(eval '(* 6 7)) ;; quoted argument\\n → 42\\n(eval (read-from-string \\\"(* 6 7)\\\"))\\n → 42\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"import extensions'scripting;\\n\\npublic program()\\n{\\n lscript.interpretLine(\\\"system'console.writeLine(\\\"\\\"Hello World\\\"\\\")\\\");\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"iex(1)> Code.eval_string(\\\"x + 4 * Enum.sum([1,2,3,4])\\\", [x: 17])\\n{57, [x: 17]}\\niex(2)> Code.eval_string(\\\"c = a + b\\\", [a: 1, b: 2])\\n{3, [a: 1, b: 2, c: 3]}\\niex(3)> Code.eval_string(\\\"a = a + b\\\", [a: 1, b: 2])\\n{3, [a: 3, b: 2]}\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"1> {ok, Tokens, _} = erl_scan:string(\\\"X + 4 * lists:sum([1,2,3,4]).\\\").\\n...\\n2> {ok, [Form]} = erl_parse:parse_exprs(Tokens).\\n...\\n3> Bindings = erl_eval:add_binding('X', 17, erl_eval:new_bindings()).\\n[{'X',17}]\\n4> {value, Value, _} = erl_eval:expr(Form, Bindings).\\n{value,57,[{'X',17}]}\\n5> Value.\\n57\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"s\\\" variable foo 1e fatan 4e f*\\\" evaluate\\n\\nf. \\\\ 3.14159...\\n1 foo !\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"unused . \\\\ show how much dictionary space is available\\nmarker restore\\n\\ncreate foo 30 allot\\n: my-def 30 0 do cr i . .\\\" test\\\" loop ;\\n\\nunused . \\\\ lower than before\\n\\nrestore\\nunused . \\\\ same as first unused; restore, foo, and my-def no longer defined\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"#macro assign(sym, expr)\\n __fb_unquote__(__fb_eval__(\\\"#undef \\\" + sym))\\n __fb_unquote__(__fb_eval__(\\\"#define \\\" + sym + \\\" \\\" + __fb_quote__(__fb_eval__(expr))))\\n#endmacro\\n\\n#define a, b, x\\n\\nassign(\\\"a\\\", 8)\\nassign(\\\"b\\\", 7)\\nassign(\\\"x\\\", Sqr(a) + (Sin(b*3)/2))\\nPrint x\\n\\nassign(\\\"x\\\", \\\"goodbye\\\")\\nPrint x\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"eval[\\\"length = 1234 feet + 2 inches\\\"]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"package main\\nimport (\\n\\t\\\"fmt\\\"\\n\\t\\\"bitbucket.org/binet/go-eval/pkg/eval\\\"\\n\\t\\\"go/token\\\"\\n)\\n\\nfunc main() {\\n\\tw := eval.NewWorld();\\n\\tfset := token.NewFileSet();\\n\\n\\tcode, err := w.Compile(fset, \\\"1 + 2\\\")\\n\\tif err != nil {\\n\\t\\tfmt.Println(\\\"Compile error\\\");\\n\\t\\treturn\\n\\t}\\n\\n\\tval, err := code.Run();\\n\\tif err != nil {\\n\\t\\tfmt.Println(\\\"Run time error\\\");\\n\\t\\treturn;\\n\\t}\\n\\tfmt.Println(\\\"Return value:\\\", val) //prints, well, 3\\n\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def years1 = new GroovyShell().evaluate('''\\n(2008..2121).findAll {\\n Date.parse(\\\"yyyy-MM-dd\\\", \\\"${it}-12-25\\\").format(\\\"EEE\\\") == \\\"Sun\\\"\\n}\\n''')\\n\\nprintln years1\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def startYear = 2008\\ndef endYear = 2121\\ndef years2 = new GroovyShell().evaluate(\\\"\\\"\\\"\\n(${startYear}..${endYear}).findAll {\\n Date.parse(\\\"yyyy-MM-dd\\\", \\\"\\\\${it}-12-25\\\").format(\\\"EEE\\\") == \\\"Sun\\\"\\n}\\n\\\"\\\"\\\")\\n\\nprintln years2\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def context = new Binding()\\ncontext.startYear = 2008\\ncontext.endYear = 2121\\ndef years3 = new GroovyShell(context).evaluate('''\\n(startYear..endYear).findAll {\\n Date.parse(\\\"yyyy-MM-dd\\\", \\\"${it}-12-25\\\").format(\\\"EEE\\\") == \\\"Sun\\\"\\n}\\n''')\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def years4 = new GroovyShell( new Binding(startYear: 2008, endYear: 2121) ).evaluate('''\\n(startYear..endYear).findAll {\\n Date.parse(\\\"yyyy-MM-dd\\\", \\\"${it}-12-25\\\").format(\\\"EEE\\\") == \\\"Sun\\\"\\n}\\n''')\\n\\nprintln years4\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def binding = new Binding(startYear: 2008, endYear: 2121)\\nnew GroovyShell( binding ).evaluate('''\\nyearList = (startYear..endYear).findAll {\\n Date.parse(\\\"yyyy-MM-dd\\\", \\\"${it}-12-25\\\").format(\\\"EEE\\\") == \\\"Sun\\\"\\n}\\n''')\\n\\nprintln binding.yearList\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def years5 = Eval.xy(2008, 2121, '''\\n(x..y).findAll {\\n Date.parse(\\\"yyyy-MM-dd\\\", \\\"${it}-12-25\\\").format(\\\"EEE\\\") == \\\"Sun\\\"\\n}\\n''')\\n\\nprintln years5\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"10 LINE INPUT \\\"Type an expression: \\\",A$\\n20 OPEN \\\"CHAIN.TMP\\\" FOR OUTPUT AS #1\\n30 PRINT #1, \\\"70 LET Y=(\\\"+A$+\\\")\\\"\\n40 CLOSE #1\\n50 CHAIN MERGE \\\"CHAIN.TMP\\\",60,ALL\\n60 FOR X=0 TO 5\\n70 REM\\n80 PRINT X,Y\\n90 NEXT X\\n100 GOTO 10\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \"Procedure Main()\\n local bAdd := {|Label,n1,n2| Qout( Label ), QQout( n1 + n2 )}\\n Eval( bAdd, \\\"5+5 = \\\", 5, 5 )\\n Eval( bAdd, \\\"5-5 = \\\", 5, -5 )\\n return\\n\\nUpon execution you see:\\n5+5 = 10\\n5-5 = 0\\n\",\n \"language\": \"Harbour\"\n },\n {\n \"code\": \"value = XEQ( \\\" temp = 1 + 2 + 3 \\\") ! value is assigned 6\\n! temp is undefined outside XEQ, if it was not defined before.\\n\\nXEQ(\\\" WRITE(Messagebox) 'Hello World !' \\\")\\n\\nOPEN(FIle=\\\"my_file.txt\\\")\\nREAD(FIle=\\\"my_file.txt\\\", Row=6) string\\nXEQ( string ) ! executes row 6 of my_file.txt\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"(var x 123)\\n[\\n (eval \\\"(var y 100) (+ x y)\\\")\\n y\\n]\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"\\\". 'a =: +/ 1 2 3' NB. execute a string to sum 1, 2 and 3 and assign to noun a\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"monad :'+/y' 1 2 3\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.io.ByteArrayOutputStream;\\nimport java.io.IOException;\\nimport java.io.OutputStream;\\nimport java.lang.reflect.InvocationTargetException;\\nimport java.net.URI;\\nimport java.util.HashMap;\\nimport java.util.LinkedList;\\nimport java.util.List;\\nimport java.util.Map;\\nimport javax.tools.FileObject;\\nimport javax.tools.ForwardingJavaFileManager;\\nimport javax.tools.JavaCompiler;\\nimport javax.tools.JavaFileObject;\\nimport javax.tools.SimpleJavaFileObject;\\nimport javax.tools.StandardJavaFileManager;\\nimport javax.tools.StandardLocation;\\nimport javax.tools.ToolProvider;\\n\\npublic class Evaluator{\\n public static void main(String[] args){\\n new Evaluator().eval(\\n \\\"SayHello\\\",\\n \\\"public class SayHello{public void speak(){System.out.println(\\\\\\\"Hello world\\\\\\\");}}\\\",\\n \\\"speak\\\"\\n );\\n }\\n\\n void eval(String className, String classCode, String methodName){\\n Map<String, ByteArrayOutputStream> classCache = new HashMap<>();\\n JavaCompiler compiler = ToolProvider.getSystemJavaCompiler();\\n\\n if ( null == compiler )\\n throw new RuntimeException(\\\"Could not get a compiler.\\\");\\n\\n StandardJavaFileManager sfm = compiler.getStandardFileManager(null, null, null);\\n ForwardingJavaFileManager<StandardJavaFileManager> fjfm = new ForwardingJavaFileManager<StandardJavaFileManager>(sfm){\\n @Override\\n public JavaFileObject getJavaFileForOutput(Location location, String className, JavaFileObject.Kind kind, FileObject sibling)\\n throws IOException{\\n if (StandardLocation.CLASS_OUTPUT == location && JavaFileObject.Kind.CLASS == kind)\\n return new SimpleJavaFileObject(URI.create(\\\"mem:///\\\" + className + \\\".class\\\"), JavaFileObject.Kind.CLASS){\\n @Override\\n public OutputStream openOutputStream()\\n throws IOException{\\n ByteArrayOutputStream baos = new ByteArrayOutputStream();\\n classCache.put(className, baos);\\n return baos;\\n }\\n };\\n else\\n throw new IllegalArgumentException(\\\"Unexpected output file requested: \\\" + location + \\\", \\\" + className + \\\", \\\" + kind);\\n }\\n };\\n List<JavaFileObject> files = new LinkedList<JavaFileObject>(){{\\n add(\\n new SimpleJavaFileObject(URI.create(\\\"string:///\\\" + className + \\\".java\\\"), JavaFileObject.Kind.SOURCE){\\n @Override\\n public CharSequence getCharContent(boolean ignoreEncodingErrors){\\n return classCode;\\n }\\n }\\n );\\n }};\\n\\n // Now we can compile!\\n compiler.getTask(null, fjfm, null, null, null, files).call();\\n\\n try{\\n Class<?> clarse = new ClassLoader(){\\n @Override\\n public Class<?> findClass(String name){\\n if (! name.startsWith(className))\\n throw new IllegalArgumentException(\\\"This class loader is for \\\" + className + \\\" - could not handle \\\\\\\"\\\" + name + '\\\"');\\n byte[] bytes = classCache.get(name).toByteArray();\\n return defineClass(name, bytes, 0, bytes.length);\\n }\\n }.loadClass(className);\\n\\n // Invoke a method on the thing we compiled\\n clarse.getMethod(methodName).invoke(clarse.newInstance());\\n\\n }catch(ClassNotFoundException | InstantiationException | IllegalAccessException | NoSuchMethodException | InvocationTargetException x){\\n throw new RuntimeException(\\\"Run failed: \\\" + x, x);\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var foo = eval('{value: 42}');\\neval('var bar = \\\"Hello, world!\\\";');\\n\\ntypeof foo; // 'object'\\ntypeof bar; // 'string'\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"/* Runtime evaluation, in Jsish */\\nvar foo = eval('{value: 42}');\\neval('var bar = \\\"Hello, world!\\\";');\\n\\n;typeof foo;\\n;foo.value;\\n;typeof bar;\\n;bar;\\n\\n/*\\n=!EXPECTSTART!=\\ntypeof foo ==> object\\nfoo.value ==> 42\\ntypeof bar ==> string\\nbar ==> Hello, world!\\n=!EXPECTEND!=\\n*/\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"include(\\\"myfile.jl\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"include_string(\\\"\\\"\\\"\\n x = sum([1, 2, 3])\\n @show x\\n \\\"\\\"\\\")\\n\\n@show typeof(x) # Int64\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"# Simple assignements are used so that rvalues are parsed as TEXT values\\n$code=fn.println(Hello World!)\\n# Returns VOID unless return or throw is explicitly used\\nfn.exec($code)\\n\\n$code=return Hello World!\\nfn.println(fn.exec($code))\\n\\n$code=throw $LANG_ERROR_DIV_BY_ZERO\\n# Will print \\\"Dividing by 0\\\" in the Standard Lang implementation (Error texts are not standardized)\\nfn.println(fn.errorText(fn.exec($code)))\\n\\n$code=parser.op(20//0)\\n# Will return VOID because no error was thrown explicitly\\nfn.println(fn.exec($code))\\n\",\n \"language\": \"Lang\"\n },\n {\n \"code\": \"//code, fragment name, autocollect, inplaintext\\nlocal(mycode = \\\"'Hello world, it is '+date\\\")\\nsourcefile('['+#mycode+']','arbritraty_name', true, true)->invoke\\n\\n'\\\\r'\\n\\n\\nvar(x = 100)\\nlocal(mycode = \\\"Outside Lasso\\\\r['Hello world, var x is '+var(x)]\\\")\\n// autocollect (3rd param): return any output generated\\n// inplaintext (4th param): if true, assumes this is mixed Lasso and plain text,\\n//\\t\\trequires Lasso code to be in square brackets or other supported code block demarkation.\\nsourcefile(#mycode,'arbritraty_name', true, true)->invoke\\n\\n'\\\\r'\\n\\nvar(y = 2)\\nlocal(mycode = \\\"'Hello world, is there output?\\\\r'\\nvar(x) *= var(y)\\\")\\n// autocollect (3rd param): as false, no output returned\\n// inplaintext (4th param): as false, assumes this is Lasso code, no mixed-mode Lasso and text.\\nsourcefile(#mycode,'arbritraty_name', false, false)->invoke\\n'var x is now: '+$x\\n\\n'\\\\r'\\n\\nvar(z = 3)\\nlocal(mycode = \\\"var(x) *= var(z)\\\")\\nsourcefile(#mycode,'arbritraty_name', false, false)->invoke\\n'var x is now: '+$x\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"'Dimension a numerical and string array\\nDim myArray(5)\\nDim myStringArray$(5)\\n\\n'Fill both arrays with the appropriate data\\nFor i = 0 To 5\\n myArray(i) = i\\n myStringArray$(i) = \\\"String - \\\" + str$(i)\\nNext i\\n\\n'Set two variables with the names of each array\\nnumArrayName$ = \\\"myArray\\\"\\nstrArrayName$ = \\\"myStringArray\\\"\\n\\n'Retrieve the array data by evaluating a string\\n'that correlates to the array\\nFor i = 0 To 5\\n Print Eval$(numArrayName$ + \\\"(\\\" + str$(i) + \\\")\\\")\\n Print Eval$(strArrayName$ + \\\"$(\\\" + str$(i) + \\\")\\\")\\nNext i\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"Struct myStruct, value As long, _\\n string As ptr\\nmyStruct.value.struct = 10\\nmyStruct.string.struct = \\\"Hello World!\\\"\\n\\nstructName$ = \\\"myStruct\\\"\\nnumElement$ = \\\"value\\\"\\nstrElement$ = \\\"string\\\"\\n\\nPrint Eval$(structName$ + \\\".\\\" + numElement$ + \\\".\\\" + \\\"struct\\\")\\n\\n'Pay close attention that this is EVAL() because we are\\n'retrieving the PTR to the string which is essentially a ulong\\nPrint Winstring(Eval(structName$ + \\\".\\\" + strElement$ + \\\".\\\" + \\\"struct\\\"))\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"f = loadstring(s) -- load a string as a function. Returns a function.\\n\\none = loadstring\\\"return 1\\\" -- one() returns 1\\n\\ntwo = loadstring\\\"return ...\\\" -- two() returns the arguments passed to it\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"f = load(\\\"return 42\\\")\\nf() --> returns 42\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"> f = load(\\\"return 42\\\")\\n> f()\\n42\\n> n = load(\\\"return 42\\\")()\\n> n\\n42\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module checkit {\\n Module dummy {\\n i++\\n Print Number\\n }\\n \\\\\\\\ using Stack New { } we open a new stack for values, and old one connected back at the end\\n \\\\\\\\ using block For This {} we erase any new definition, so we erase i (which Local make a new one)\\n a$={\\n Stack New {\\n For this {\\n Local i\\n for i=1 to 10 : print i : next i\\n }\\n }\\n If valid(k) then print k\\n }\\n i=500\\n k=600\\n Push 1000\\n inline a$\\n Print i=500\\n Print Number=1000\\n \\\\\\\\ eval an expression\\n Print Eval(\\\"i+k\\\")\\n \\\\\\\\ eval a function\\n Print Function(\\\"{read x : = x**2}\\\", 2)=4\\n Dim k(10)=123\\n \\\\\\\\ eval array only\\n Print array(\\\"k()\\\", 2)=123\\n Push 10, 10\\n \\\\\\\\ call a module by make it inline first\\n inline code dummy, dummy\\n Print i=502\\n}\\nCheckIt\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Print[ToExpression[\\\"1 + 1\\\"]];\\nPrint[ToExpression[\\\"Print[\\\\\\\"Hello, world!\\\\\\\"]; 10!\\\"]];\\nx = 5;\\nPrint[ToExpression[\\\"x!\\\"]];\\nPrint[ToExpression[\\\"Module[{x = 8}, x!]\\\"]];\\nPrint[MemoryConstrained[ToExpression[\\\"Range[5]\\\"], 10000, {}]];\\nPrint[MemoryConstrained[ToExpression[\\\"Range[10^5]\\\"], 10000, {}]];\\nPrint[TimeConstrained[ToExpression[\\\"Pause[1]; True\\\"], 2, False]];\\nPrint[TimeConstrained[ToExpression[\\\"Pause[60]; True\\\"], 2, False]];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function testEval\\n fprintf('Expressions:\\\\n')\\n x = eval('5+10^2')\\n eval('y = (x-100).*[1 2 3]')\\n eval('z = strcat(''my'', '' string'')')\\n try\\n w eval(' = 45')\\n catch\\n fprintf('Runtime error: interpretation of w is a function\\\\n\\\\n')\\n end\\n % eval('v') = 5\\n % Invalid at compile-time as MATLAB interprets as using eval as a variable\\n\\n fprintf('Other Statements:\\\\n')\\n nl = sprintf('\\\\n');\\n eval(['for k = 1:20' nl ...\\n 'fprintf(''%.3f\\\\n'', k)' nl ...\\n 'if k == 3' nl ...\\n 'break' nl ...\\n 'end' nl ...\\n 'end'])\\n true == eval('1')\\n try\\n true eval(' == 1')\\n catch\\n fprintf('Runtime error: interpretation of == 1 is of input to true\\\\n\\\\n')\\n end\\n\\n fprintf('Programming on the fly:\\\\n')\\n userIn = true;\\n codeBlock = '';\\n while userIn\\n userIn = input('Enter next line of code: ', 's');\\n codeBlock = [codeBlock nl userIn];\\n end\\n eval(codeBlock)\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"/* Here is how to create a function and return a value at runtime. In the first example,\\nthe function is made global, i.e. it still exists after the statement is run. In the second example, the function\\nis declared local. The evaluated string may read or write any variable defined before eval_string is run. */\\n\\nkill(f)$\\n\\neval_string(\\\"block(f(x) := x^2 + 1, f(2))\\\");\\n5\\n\\nfundef(f);\\n/* f(x) := x^2 + 1 */\\n\\neval_string(\\\"block([f], local(f), f(x) := x^3 + 1, f(2))\\\");\\n9\\n\\nfundef(f);\\n/* f(x) := x^2 + 1 */\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"exec(\\\"println \\\\\\\"hello, world\\\\\\\"\\\")\\nexec(\\\"a = 1\\\\nif a = 1\\\\nprintln \\\\\\\"a is 1\\\\\\\"\\\\nend\\\\nprintln \\\\\\\"test\\\\\\\"\\\")\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"import ../compiler/[nimeval, llstream, ast], strformat, os\\n\\nlet std = findNimStdLibCompileTime()\\nlet modules = [std, std / \\\"pure\\\", std / \\\"std\\\", std / \\\"core\\\"]\\nvar intr = createInterpreter(\\\"script\\\", modules)\\n\\n#dynamic variable\\nlet varname = commandLineParams()[0]\\nlet expr = commandLineParams()[1]\\n\\n#wrap the naked variable name and expression in a definition and proc,respectively to create valid code\\n#for simplicity, the variable will always be an int, but one could of course define the type at runtime\\n#globals and procs must be exported with * to be accessable\\n#we also need to import any modules needed by the runtime code\\nintr.evalScript(llStreamOpen(&\\\"import math,sugar; var {varname}*:int; proc output*():auto = {expr}\\\"))\\n\\nfor i in 0..2:\\n #set 'varname' to a value\\n intr.getGlobalValue(intr.selectUniqueSymbol(varname)).intval = i\\n #evaluate the expression and get the result\\n let output = intr.callRoutine(intr.selectRoutine(\\\"output\\\"), [])\\n #depending on the expression, the result could be any type\\n #as an example, here we check for int,float,or string\\n case output.kind\\n of nkIntLit:\\n echo expr, \\\" = \\\", output.intval\\n of nkFloatLit:\\n echo expr, \\\" = \\\", output.floatval\\n of nkStrLit:\\n echo expr, \\\" = \\\", output.strval\\n else:\\n discard\\n\\ndestroyInterpreter(intr)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"\\\"[ [ $a, 12], [$b, 1.2], [ $c, [ $aaa, $bbb, $ccc ] ], [ $torun, #first ] ]\\\" perform .s\\n[1] (List) [[a, 12], [b, 1.2], [c, [aaa, bbb, ccc]], [torun, #first]]\\n\\n\\\"12 13 +\\\" perform\\n[1:interpreter] ExCompiler : Can't evaluate <+>\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"\\\"12 13 + println\\\" eval\\n25\\n\\\": newFunction(a) a + ; 12 10 newFunction println\\\" eval\\n22\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \" a = .array~of(1, 2, 3)\\n ins = \\\"loop num over a; say num; end\\\"\\n interpret ins\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \" function ExecSeries(string s,double b,e,i) as string\\n '===================================================\\n '\\n sys a,p\\n string v,u,tab,cr,er\\n '\\n 'PREPARE OUTPUT BUFFER\\n '\\n p=1\\n cr=chr(13) chr(10)\\n tab=chr(9)\\n v=nuls 4096\\n mid v,p,s+cr+cr\\n p+=4+len s\\n '\\n double x,y,z 'shared variables\\n '\\n 'COMPILE\\n '\\n a=compile s\\n er=error\\n if er then\\n print \\\"runtime error: \\\" er : exit function\\n end if\\n '\\n 'EXECUTE\\n '\\n for x=b to e step i\\n if p+128>=len v then\\n v+=nuls len(v) 'extend buffer\\n end if\\n call a\\n u=str(x) tab str(y) cr\\n mid v,p,u : p+=len u\\n next\\n '\\n freememory a 'release compiled code\\n '\\n return left v,p-1 'results\\n '\\n end function\\n\\n '=====\\n 'TESTS\\n '=====\\n\\n 'Expression, StartVal, EndVal stepVal, Increment\\n\\n print ExecSeries \\\"y=x*x*x\\\", 1, 10, 1\\n print ExecSeries \\\"y=sqrt x\\\",1, 9 , 1\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"declare\\n %% simplest case: just evaluate expressions without bindings\\n R1 = {Compiler.virtualStringToValue \\\"{Abs ~42}\\\"}\\n {Show R1}\\n\\n %% eval expressions with additional bindings and\\n %% the possibility to kill the evaluation by calling KillProc\\n KillProc\\n R2 = {Compiler.evalExpression \\\"{Abs A}\\\" unit('A':~42) ?KillProc}\\n {Show R2}\\n\\n %% full control: add and remove bindings, eval expressions or\\n %% statements, set compiler switches etc.\\n Engine = {New Compiler.engine init}\\n {Engine enqueue(setSwitch(expression false))} %% statements instead of expr.\\n {Engine enqueue(mergeEnv(env('A':42 'System':System)))}\\n {Engine enqueue(feedVirtualString(\\\"{System.show A}\\\"))}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"runme(f)={\\n f()\\n};\\n\\nrunme( ()->print(\\\"Hello world!\\\") )\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"my ($a, $b) = (-5, 7);\\n$ans = eval 'abs($a * $b)'; # => 35\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- demo\\\\rosetta\\\\Runtime_evaluation.exw</span>\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #7060A8;\\\">requires</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1.0.1\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #7060A8;\\\">eval</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (not an autoinclude, pulls in around 90% of the interpreter/compiler proper)</span>\\n\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">code</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n integer i = 0\\n bool r_init = false\\n sequence r\\n if not r_init then r = {} end if\\n for k=1 to 4 do\\n i += k\\n r &= k\\n end for\\n \\\"\\\"\\\"</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">eval</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">code</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"i\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"r\\\"</span><span style=\\\"color: #0000FF;\\\">})</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- prints {10,{1,2,3,4}}</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">eval</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">code</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"r\\\"</span><span style=\\\"color: #0000FF;\\\">},{{</span><span style=\\\"color: #008000;\\\">\\\"r_init\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #008000;\\\">\\\"r\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">}}})</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- prints {5,1,2,3,4}</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">eval</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">code</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"i\\\"</span><span style=\\\"color: #0000FF;\\\">},{{</span><span style=\\\"color: #008000;\\\">\\\"i\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">15</span><span style=\\\"color: #0000FF;\\\">}})</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- prints {25}</span>\\n <span style=\\\"color: #0000FF;\\\">{}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">eval</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">`puts(1,\\\"Hello World\\\\n\\\")`</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- prints Hello World</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">eval_expression</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">expr</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">eval</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"object x = %s\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">expr</span><span style=\\\"color: #0000FF;\\\">}),{</span><span style=\\\"color: #008000;\\\">\\\"x\\\"</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">eval_expression</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"3+4\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- prints 7</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\n $code = 'echo \\\"hello world\\\"';\\n eval($code);\\n $code = 'return \\\"hello world\\\"';\\n print eval($code);\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"program demo = compile_string(#\\\"\\n string name=\\\\\\\"demo\\\\\\\";\\n string hello()\\n {\\n return(\\\\\\\"hello, i am \\\\\\\"+name);\\n }\\\");\\n\\ndemo()->hello();\\nResult: \\\"hello, i am demo\\\"\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"$test2plus2 = '2 + 2 -eq 4'\\nInvoke-Expression $test2plus2\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$say = {\\\"Hello, world!\\\"}\\n& $say\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$say = {param ([string]$Subject) \\\"Hello, $Subject!\\\"}\\n& $say -Subject \\\"my friend\\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$say = {param ([string]$Exclamation, [string]$Subject) \\\"$Exclamation, $Subject!\\\"}\\n& $say -Exclamation \\\"Goodbye\\\" -Subject \\\"cruel world\\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$title = \\\"Dong Work For Yuda\\\"\\n$scriptblock = {$title}\\n$closedScriptblock = $scriptblock.GetNewClosure()\\n\\n& $scriptblock\\n& $closedScriptblock\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"$title = \\\"I'm Too Sexy\\\"\\n& $scriptblock\\n& $closedScriptblock\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \">>> exec '''\\nx = sum([1,2,3,4])\\nprint x\\n'''\\n10\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \">>> exec('''\\nx = sum([1,2,3,4])\\nprint(x)\\n''')\\n10\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"10 $ \\\"1 swap times [ i 1+ * ]\\\" quackery echo\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"expr1 <- quote(a+b*c)\\nexpr2 <- parse(text=\\\"a+b*c\\\")[[1]]\\nexpr3 <- call(\\\"+\\\", quote(`a`), call(\\\"*\\\", quote(`b`), quote(`c`)))\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"> a <- 1; b <- 2; c <- 3\\n> eval(expr1)\\n[1] 7\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"> env <- as.environment(list(a=1, b=3, c=2))\\n> evalq(a, env)\\n[1] 1\\n> eval(expr1, env) #this fails; env has only emptyenv() as a parent so can't find \\\"+\\\"\\nError in eval(expr, envir, enclos) : could not find function \\\"+\\\"\\n> parent.env(env) <- sys.frame()\\n> eval(expr1, env) # eval in env, enclosed in the current context\\n[1] 7\\n> assign(\\\"b\\\", 5, env) # assign() can assign into environments\\n> eval(expr1, env)\\n[1] 11\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(require racket/sandbox)\\n(define e (make-evaluator 'racket))\\n(e '(define + *))\\n(e '(+ 10 20))\\n(+ 10 20)\\n;; (e '(delete-file \\\"/etc/passwd\\\"))\\n;; --> delete-file: `delete' access denied for /etc/passwd\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use MONKEY-SEE-NO-EVAL;\\n\\nmy ($a, $b) = (-5, 7);\\nmy $ans = EVAL 'abs($a * $b)'; # => 35\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"a: -5\\nb: 7\\nanswer: do [abs a * b] ; => 35\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \"/*REXX program illustrates the ability to execute code entered at runtime (from C.L.)*/\\nnumeric digits 10000000 /*ten million digits should do it. */\\nbee=51\\nstuff= 'bee=min(-2,44); say 13*2 \\\"[from inside the box.]\\\"; abc=abs(bee)'\\ninterpret stuff\\nsay 'bee=' bee\\nsay 'abc=' abc\\nsay\\n /* [↓] now, we hear from the user. */\\nsay 'enter an expression:'\\npull expression\\nsay\\nsay 'expression entered is:' expression\\nsay\\n\\ninterpret '?='expression\\n\\nsay 'length of result='length(?)\\nsay ' left 50 bytes of result='left(?,50)\\\"···\\\"\\nsay 'right 50 bytes of result=···'right(?, 50) /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"Eval(\\\"nOutput = 5+2*5 \\\" )\\nSee \\\"5+2*5 = \\\" + nOutput + nl\\nEval(\\\"for x = 1 to 10 see x + nl next\\\")\\nEval(\\\"func test see 'message from test!' \\\")\\ntest()\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"5+2*5 = 15\\n1\\n2\\n3\\n4\\n5\\n6\\n7\\n8\\n9\\n10\\nmessage from test!\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"while true\\n see nl + \\\"code:> \\\"\\n give cCode\\n try\\n eval(cCode)\\n catch\\n see cCatchError\\n done\\nend\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"code:> see \\\"hello world\\\"\\nhello world\\ncode:> for x = 1 to 10 see x + nl next\\n1\\n2\\n3\\n4\\n5\\n6\\n7\\n8\\n9\\n10\\n\\ncode:> func test see \\\"Hello from test\\\" + nl\\n\\ncode:> test()\\nHello from test\\n\\ncode:> bye\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"a, b = 5, -7\\nans = eval \\\"(a * b).abs\\\" # => 35\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"def first(main_var, main_binding)\\n foo = 42\\n second [[main_var, main_binding], [\\\"foo\\\", binding]]\\nend\\n\\ndef second(args)\\n sqr = lambda {|x| x**2}\\n deref(args << [\\\"sqr\\\", binding])\\nend\\n\\ndef deref(stuff)\\n stuff.each do |varname, context|\\n puts \\\"value of #{varname} is #{eval varname, context}\\\"\\n end\\nend\\n\\nhello = \\\"world\\\"\\nfirst \\\"hello\\\", binding\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"> (define x 37)\\n> (eval '(+ x 5))\\n42\\n> (eval '(+ x 5) (interaction-environment))\\n42\\n> (eval '(+ x 5) (scheme-report-environment 5)) ;; provides R5RS definitions\\n\\nError: identifier not visible x.\\nType (debug) to enter the debugger.\\n> (display (eval (read)))\\n(+ 4 5) ;; this is input from the user.\\n9\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"var (a, b) = (-5, 7);\\nsay eval '(a * b).abs'; # => 35\\nsay (a * b -> abs); # => 35\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"`(4 + 5) evaluate.\\n`(4 + 5) evaluateIn: prototypes.\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"(Syntax Parser newOn: '4 + 5') upToEnd do: [| :each | print: each evaluate]\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"define: #x -> 4.\\n`(x `unquote + 5) evaluate.\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"define: #x -> 4.\\n(Syntax Parser newOn: x printString ; ' + 5')\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"define: #x -> 4.\\n[| x | x: 5. `(x `unquote + 5) evaluate] do.\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"(eval (list '+ 1 2 3 4 5))\\n\",\n \"language\": \"Slope\"\n },\n {\n \"code\": \"(eval \\\"(+ 1 2 3 4 5)\\\" #t)\\n\",\n \"language\": \"Slope\"\n },\n {\n \"code\": \"[ 4 + 5 ] value.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"e := ' 123 degreesToRadians sin '.\\nTranscript show: (Compiler evaluate: e) .\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"e := '[ :x :y | (x*x + (y*y)) sqrt ]'.\\nTranscript show: ((Compiler evaluate: e) value: 3 value: 4).\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \" expression = \\\"' page ' (i + 1)\\\"\\n i = 7\\n output = eval(expression)\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \" compiled = code(' output = \\\"Hello, world.\\\"') :s<compiled>\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"let fn = exprtofn(\\\"13 + 37\\\");\\nfn() // -> 50\\n\",\n \"language\": \"Sparkling\"\n },\n {\n \"code\": \"let fn = exprtofn(\\\"#0 * #1\\\");\\nfn(3, 4) // -> 12\\n\",\n \"language\": \"Sparkling\"\n },\n {\n \"code\": \"let fn = compile(\\\"for (var i = 0; i < 10; i++) { print(i); }\\\");\\nfn(); // result: 0 1 2 3 4 5 6 7 8 9\\n\",\n \"language\": \"Sparkling\"\n },\n {\n \"code\": \"set four 4\\nset result1 [eval \\\"expr {$four + 5}\\\"] ;# string input\\n\\nset result2 [eval [list expr [list $four + 5]]] ;# list input\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"# Create an interpreter with a default set of restrictions\\ninterp create -safe restrictedContext\\n\\n# Our secret variable\\nset v \\\"secret\\\"\\n\\n# Allow some guarded access to the secret from the restricted context.\\ninterp alias restrictedContext doubleSecret {} example\\nproc example {} {\\n global v\\n lappend v $v\\n return [llength $v]\\n}\\n\\n# Evaluate a script in the restricted context\\nputs [restrictedContext eval {\\n append v \\\" has been leaked\\\"\\n catch {file delete yourCriticalFile.txt} ;# Will be denied!\\n return \\\"there are [doubleSecret] words in the secret: the magic number is [expr {4 + 5}]\\\"\\n}]; # --> there are 2 words in the secret: the magic number is 9\\nputs $v; # --> secret secret\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"set i [interp create]\\ninterp limit $i commands -value [expr [$i eval info cmdcount]+20] -granularity 1\\ninterp eval $i {\\n set x 0\\n while {1} { # Infinite loop! Bwahahahaha!\\n puts \\\"Counting up... [incr x]\\\"\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#lang transd\\n\\nMainModule : {\\n str: \\\"(textout \\\\\\\"eval output: \\\\\\\" (+ 1 1))\\\",\\n\\n _start: (λ\\n (eval str)\\n )\\n}\\n\",\n \"language\": \"Transd\"\n },\n {\n \"code\": \"$ a=42\\n$ b=a\\n$ eval \\\"echo \\\\$$b\\\"\\n42\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"# writes hello world to the console\\neval \\\"out \\\\\\\"hello world\\\\\\\" endl console\\\" console\\n\",\n \"language\": \"Ursa\"\n },\n {\n \"code\": \"import \\\"meta\\\" for Meta\\n\\nvar s = \\\"for (i in 0..4) System.print(i)\\\"\\nMeta.eval(s)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"Compiler.Compiler.compileText(\\n \\\"fcn f(text){text.len()}\\\").f(\\\"foobar\\\")\\n//-->6\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Runtime-evaluation"}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":15,"numItemsPerPage":100,"numTotalItems":1840,"offset":1500,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6IjVHZDBvd0g5MTM2eDZjc1FvbE1zcktNWUZoRVFoUm5PVVVybEpjOUhaUEEifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc4OTY0MTU2OSwianRpIjoiOTE1ZTQ0MTgtZTljOS00ODZlLTkxMmEtOWQ0NTAyZjNmYTZlIiwic3ViIjoiL2RhdGFzZXRzL0d1eXRyb24vUm9zZXR0YUNvZGVEYXRhU2V0MSIsImV4cCI6MTc4OTY0NTE2OSwiaXNzIjoiaHR0cHM6Ly9odWdnaW5nZmFjZS5jbyJ9.7uF_SL-aLmGKIIWPijMnkIL2D-DeN61gtDDgdUPRTTVU-IU3FYR4ApBsuv6zxciY_pAWRVwDWo35HP4lyZzxCw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":1840,"numBytesParquet":69595962}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
solutions listlengths 2 791 | task_name stringlengths 2 86 |
|---|---|
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Percolation/Mean_cluster_density\nnote: Percolation Simulations\n",
"language": "00-META"
},
{
"code": "{{Percolation Simulation}}\nLet <math>c</math> be a 2D boolean square matrix of <math>n \\times n</math> values of either <tt>1</tt> or <tt>0</tt>... | Percolation-Mean-cluster-density |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Percolation/Mean_run_density\nnote: Percolation Simulations\n",
"language": "00-META"
},
{
"code": "{{Percolation Simulation}}\nLet <math>v</math> be a vector of <math>n</math> values of either <tt>1</tt> or <tt>0</tt> where the probability of any \n... | Percolation-Mean-run-density |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Perfect_numbers\n",
"language": "00-META"
},
{
"code": "[[category:Discrete math]]\n{{task|Prime Numbers}}\n\nWrite a function which says whether a number is perfect.\n\n<br>\n[[wp:Perfect_numbers|A perfect number]] is a positive integer that is the ... | Perfect-numbers |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Perfect_shuffle\n",
"language": "00-META"
},
{
"code": "A perfect shuffle (or [https://en.wikipedia.org/wiki/Faro_shuffle faro/weave shuffle]) means splitting a deck of cards into equal halves, and perfectly interleaving them - so that you end up wit... | Perfect-shuffle |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Perfect_totient_numbers\n",
"language": "00-META"
},
{
"code": "Generate and show here, the first twenty [https://en.wikipedia.org/wiki/Perfect_totient_number Perfect totient numbers].\n\n\n;Related task:\n::* [[Totient function]]\n\n\n;Also s... | Perfect-totient-numbers |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Peripheral_drift_illusion\n",
"language": "00-META"
},
{
"code": ";Task\nGenerate and display a Peripheral Drift Illusion\n\nThe image appears to be moving even though it is perfectly static.\n\nProvide a link to show the output, either by running th... | Peripheral-drift-illusion |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Perlin_noise\n",
"language": "00-META"
},
{
"code": "The '''[[wp:Perlin noise|Perlin noise]]''' is a kind of [[wp:gradient noise|gradient noise]] invented by [[wp:Ken Perlin|Ken Perlin]] around the end of the twentieth century and still currently hea... | Perlin-noise |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Permutation_test\nnote: Probability and statistics\n",
"language": "00-META"
},
{
"code": "A new medical treatment was tested on a population of <math>n + m</math>\nvolunteers, with each volunteer randomly assigned either to a group of\n<math>n</math... | Permutation-test |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Permutations_by_swapping\n",
"language": "00-META"
},
{
"code": ";Task:\nGenerate permutations of n items in which successive permutations differ from each other by the swapping of any two items. \n\nAlso generate the sign of the permutation which is... | Permutations-by-swapping |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Permutations/Derangements\n",
"language": "00-META"
},
{
"code": "A [http://mathworld.wolfram.com/Derangement.html derangement] is a permutation of the order of distinct items in which ''no item appears in its original place''.\n\nFor example, the on... | Permutations-Derangements |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Permutations/Rank_of_a_permutation\n",
"language": "00-META"
},
{
"code": "A particular ranking of a permutation associates an integer with a particular ordering of all the permutations of a set of distinct items. \nFor our purposes the ranking will ... | Permutations-Rank-of-a-permutation |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Phrase_reversals\n",
"language": "00-META"
},
{
"code": ";Task:\nGiven a string of space separated words containing the following phrase:\n rosetta code phrase reversal\n\n:# Reverse the characters of the string.\n:# Reverse the characters of each i... | Phrase-reversals |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pi\nnote: Irrational numbers\n",
"language": "00-META"
},
{
"code": "Create a program to continually calculate and output the next decimal digit of <big><big><math>\\pi</math></big></big> (pi). \n\nThe program should continue forever (u... | Pi |
[
{
"code": "---\ncategory:\n- Randomness\nfrom: http://rosettacode.org/wiki/Pick_random_element\nnote: Basic language learning\n",
"language": "00-META"
},
{
"code": "Demonstrate how to pick a random element from a list.\n<br><br>\n\n",
"language": "00-TASK"
},
{
"code": "print(random:cho... | Pick-random-element |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pig_the_dice_game\n",
"language": "00-META"
},
{
"code": "The [[wp:Pig (dice)|game of Pig]] is a multiplayer game played with a single six-sided die. The\nobject of the game is to reach '''100''' points or more. &nb... | Pig-the-dice-game |
[
{
"code": "---\ncategory:\n- Games\nfrom: http://rosettacode.org/wiki/Pig_the_dice_game/Player\n",
"language": "00-META"
},
{
"code": ";Task:\nCreate a dice simulator and scorer of [[Pig the dice game]] and add to it the ability to play the game to at least one strategy.\n* State here the play strat... | Pig-the-dice-game-Player |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pinstripe/Display\nnote: Test card\n",
"language": "00-META"
},
{
"code": "The task is to demonstrate the creation of a series of vertical pinstripes across '''the entire width of the display'''. \n* in the first quarter the pinstripes should alterna... | Pinstripe-Display |
[
{
"code": "---\ncategory:\n- Mathematics\nfrom: http://rosettacode.org/wiki/Pisano_period\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": "The [[wp:Fibonacci_Number|Fibonacci sequence]] taken modulo 2 is a periodic sequence of period 3 : 0, 1, 1, 0, 1, 1, ... \n\nFor any integer n, the F... | Pisano-period |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Plasma_effect\n",
"language": "00-META"
},
{
"code": "The [[wp:Plasma_effect|plasma effect]] is a visual effect created by applying various functions, notably sine and cosine, to the color values of screen pixels. When animated (not a task requiremen... | Plasma-effect |
[
{
"code": "---\ncategory:\n- Games\nfrom: http://rosettacode.org/wiki/Play_recorded_sounds\nnote: Temporal media\nrequires:\n- Sound\n",
"language": "00-META"
},
{
"code": "Load at least two prerecorded sounds, and demonstrate as many of these features as you can:\n* playing them individually and si... | Play-recorded-sounds |
[
{
"code": "---\ncategory:\n- Cards\nfrom: http://rosettacode.org/wiki/Playing_cards\nnote: Games\n",
"language": "00-META"
},
{
"code": ";Task:\nCreate a data structure and the associated methods to define and manipulate a deck of [[wp:Playing-cards#Anglo-American-French|playing cards]]. \n\n... | Playing-cards |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Plot_coordinate_pairs\n",
"language": "00-META"
},
{
"code": ";Task:\nPlot a function represented as <big><big> x, y </big></big> numerical arrays.\n\nPost the resulting image for the following input arrays (taken from... | Plot-coordinate-pairs |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pointers_and_references\nnote: Basic Data Operations\n",
"language": "00-META"
},
{
"code": "{{basic data operation}}In this task, the goal is to demonstrate common operations on pointers and references. These examples show pointer operations on the ... | Pointers-and-references |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Polymorphic_copy\nnote: Object oriented\n",
"language": "00-META"
},
{
"code": "An object is [[polymorphism|polymorphic]] when its specific type may vary. \nThe types a specific value may take, is called ''class''.\n\nIt is trivial to copy an object ... | Polymorphic-copy |
[
{
"code": "---\ncategory:\n- Object oriented\nfrom: http://rosettacode.org/wiki/Polymorphism\nnote: Basic language learning\n",
"language": "00-META"
},
{
"code": ";Task:\nCreate two classes Point(x,y) and Circle(x,y,r) with a polymorphic function print, accessors for (x,... | Polymorphism |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Polynomial_long_division\nnote: Classic CS problems and programs\n",
"language": "00-META"
},
{
"code": ":<cite>In algebra, [[wp:Polynomial long division|polynomial long division]] is an algorithm for dividing a polynomial by another polynomial of th... | Polynomial-long-division |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Polyspiral\n",
"language": "00-META"
},
{
"code": "A [http://www.otherwise.com/Jurtle/screenshots_win/assets/DisplayWindow_Full.png Polyspiral] is a spiral made of multiple line segments, whereby each segment is larger (or smaller) than the previous ... | Polyspiral |
[
{
"code": "---\ncategory:\n- Mathematics\nfrom: http://rosettacode.org/wiki/Population_count\n",
"language": "00-META"
},
{
"code": "The ''[[wp:Hamming weight|population count]]'' is the number of <big>'''1'''</big>s (ones) in the binary representation of a non-neg... | Population-count |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Power_set\nnote: Discrete math\n",
"language": "00-META"
},
{
"code": "A [[set]] is a collection (container) of certain values, \nwithout any particular order, and no repeated values. \n\nIt corresponds with a finite set in mathematics.... | Power-set |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Price_fraction\nnote: Financial operations\n",
"language": "00-META"
},
{
"code": "A friend of mine runs a pharmacy. He has a specialized function in his Dispensary application which receives a decimal value of currency and replaces it to a st... | Price-fraction |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Primality_by_trial_division\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": ";Task:\nWrite a boolean function that tells whether a given integer is prime. \n\n\nRemember that '''1''' and all non-positive numbers are not prim... | Primality-by-trial-division |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Primality_by_Wilson's_theorem\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": ";Task:\nWrite a boolean function that tells whether a given integer is prime using [http://www.cut-the-knot.org/blue/Wilson.shtml Wilson's theorem]. \n\nBy Wil... | Primality-by-Wilsons-theorem |
[
{
"code": "---\ncategory:\n- Arbitrary precision\nfrom: http://rosettacode.org/wiki/Prime_decomposition\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": "The prime decomposition of a number is defined as a list of prime numbers \nwhich when all multiplied together, are equal to that numbe... | Prime-decomposition |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Prime_numbers_whose_neighboring_pairs_are_tetraprimes\n",
"language": "00-META"
},
{
"code": ";Definitions\n\nThe following definitions are needed for this task.\n\nA '''tetraprime''' is a positive integer which is the product of four distinct primes... | Prime-numbers-whose-neighboring-pairs-are-tetraprimes |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Prime_triangle\n",
"language": "00-META"
},
{
"code": "You will require a function f which when given an integer S will return a list of the arrangements of the integers 1 to S such that g<sub>1</sub>=1 g<sub>S</sub>=S and generally for n=1 to n=S-1 ... | Prime-triangle |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Primorial_numbers\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": "Primorial numbers are those formed by multiplying successive prime numbers. \n\n\nThe primorial number series is:\n::* primorial(0) = 1 ... | Primorial-numbers |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Priority_queue\n",
"language": "00-META"
},
{
"code": "A [[wp:Priority queue|priority queue]] is somewhat similar to a [[Queue|queue]], with an important distinction: each item is added to a priority queue with a priority level, and will be later rem... | Priority-queue |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Probabilistic_choice\nnote: Probability and statistics\n",
"language": "00-META"
},
{
"code": "Given a mapping between items and their required probability of occurrence, generate a million items ''randomly'' subject to the given probabilities and co... | Probabilistic-choice |
[
{
"code": "---\ncategory:\n- Initialization\nfrom: http://rosettacode.org/wiki/Program_name\nnote: Basic language learning\n",
"language": "00-META"
},
{
"code": "The task is to programmatically obtain the name used to invoke the program. (For example determine whether the user ran \"python hello.py... | Program-name |
[
{
"code": "---\ncategory:\n- Simple\nfrom: http://rosettacode.org/wiki/Program_termination\nnote: Basic language learning\n",
"language": "00-META"
},
{
"code": ";Task:\nShow the syntax for a complete stoppage of a program inside a [[Conditional Structures|conditional]]. \n\nThis includes all... | Program-termination |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Proper_divisors\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": "The [http://planetmath.org/properdivisor proper divisors] of a positive integer '''N''' are those numbers, other than '''N''' itself, that divide '''N''' witho... | Proper-divisors |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pseudo-random_numbers/Middle-square_method\n",
"language": "00-META"
},
{
"code": "; The Method:\nTo generate a sequence of n-digit pseudorandom numbers, an n-digit starting value is created and squared, producing a 2n-digit number. If the result has... | Pseudo-random-numbers-Middle-square-method |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pseudo-random_numbers/PCG32\n",
"language": "00-META"
},
{
"code": ";Some definitions to help in the explanation:\n\n:Floor operation<br>\n::https://en.wikipedia.org/wiki/Floor_and_ceiling_functions<br>\n::Greatest integer less than or equal to a rea... | Pseudo-random-numbers-PCG32 |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pseudo-random_numbers/Splitmix64\nnote: PRNG\n",
"language": "00-META"
},
{
"code": "Splitmix64 is the default pseudo-random number generator algorithm in Java and is included / available in many other languages. It uses a fairly simple algorithm tha... | Pseudo-random-numbers-Splitmix64 |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pythagoras_tree\n",
"language": "00-META"
},
{
"code": "The [[wp:Pythagoras_tree_%28fractal%29|Pythagoras tree]] is a fractal tree constructed from squares. It is named after Pythagoras because each triple of touching squares encloses a right triang... | Pythagoras-tree |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pythagorean_quadruples\n",
"language": "00-META"
},
{
"code": "One form of '''Pythagorean quadruples''' is (for positive integers '''a''', '''b''', '''c''', and '''d'''): \n\n\n:::::::: <... | Pythagorean-quadruples |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pythagorean_triples\n",
"language": "00-META"
},
{
"code": "A [[wp:Pythagorean_triple|Pythagorean triple]] is defined as three positive integers <math>(a, b, c)</math> where <math>a < b < c</math>, and <math>a^2+b^2=c^2.</math>\n\nThey are called pri... | Pythagorean-triples |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Quaternion_type\n",
"language": "00-META"
},
{
"code": "[[wp:Quaternion|Quaternions]] are an extension of the idea of [[Arithmetic/Complex|complex numbers]].\n\nA complex number has a real and complex part, sometimes written as &... | Quaternion-type |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Queue/Definition\nnote: Data Structures\n",
"language": "00-META"
},
{
"code": "{{Data structure}}\n[[File:Fifo.gif|frame|right|Illustration of FIFO behavior]]\n\n;Task:\nImplement a FIFO queue. \n\nElements are added at one side and popped from the ... | Queue-Definition |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Queue/Usage\nnote: Data Structures\n",
"language": "00-META"
},
{
"code": "{{Data structure}}\n[[File:Fifo.gif|frame|right|Illustration of FIFO behavior]]\n\n;Task:\nCreate a queue data structure and demonstrate its operations. \n\n(For implementatio... | Queue-Usage |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Quine\n",
"language": "00-META"
},
{
"code": "A [[wp:Quine_%28computing%29|quine]] is a self-referential program that can, \nwithout any external access, output its own source. \n\n\nA '''quine''' (named after Willard Van Orman Quine) &... | Quine |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Quoting_constructs\n",
"language": "00-META"
},
{
"code": "Pretty much every programming language has some form of quoting construct to allow embedding of data in a program, be it literal strings, numeric data or some combination thereof.\n\nShow exa... | Quoting-constructs |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Radical_of_an_integer\n",
"language": "00-META"
},
{
"code": ";Definition\nThe '''radical''' of a positive integer is defined as the product of its distinct prime factors.\n\nAlthough the integer 1 has no prime factors, its radical is regarded as 1 b... | Radical-of-an-integer |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Ramanujan's_constant\n",
"language": "00-META"
},
{
"code": "Calculate Ramanujan's constant (as described on the [http://oeis.org/wiki/Ramanujan%27s_constant OEIS site]) with at least\n32 digits of precision, by the method of your choice. Optionally... | Ramanujans-constant |
[
{
"code": "---\ncategory:\n- Geometry\n- Recursion\nfrom: http://rosettacode.org/wiki/Ramer-Douglas-Peucker_line_simplification\n",
"language": "00-META"
},
{
"code": "The '''Ramer–Douglas–Peucker''' algorithm is a line simplification algorithm for reducing the number of points used to... | Ramer-Douglas-Peucker-line-simplification |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Random_Latin_squares\n",
"language": "00-META"
},
{
"code": "A Latin square of size <code>n</code> is an arrangement of <code>n</code> symbols in an <code>n-by-n</code> square in such a way that each row and column has each symbol appearing exactly ... | Random-Latin-squares |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Random_number_generator_(included)\n",
"language": "00-META"
},
{
"code": "The task is to:\n: State the type of random number generator algorithm used in a language's built-in random number generator. If the language or its immediate libraries don't ... | Random-number-generator-included- |
[
{
"code": "---\ncategory:\n- Probability and statistics\n- Randomness\nfrom: http://rosettacode.org/wiki/Random_numbers\nnote: Basic language learning\n",
"language": "00-META"
},
{
"code": ";Task:\nGenerate a collection filled with '''1000''' normally distributed random (or pseudo-ran... | Random-numbers |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Random_sentence_from_book\n",
"language": "00-META"
},
{
"code": "* Read in the book \"[http://www.gutenberg.org/files/36/36-0.txt The War of the Worlds]\", by H. G. Wells.\n* Skip to the start of the book, proper.\n* Remove extraneous punctuation, b... | Random-sentence-from-book |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Range_expansion\n",
"language": "00-META"
},
{
"code": "{{:Range extraction/Format}}\n\n\n;Task:\nExpand the range description: \n <big> -6,-3--1,3-5,7-11,14,15,17-20 </big>\n\n<small>Note that the second element above, \nis the '''range from minus ... | Range-expansion |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Range_extraction\n",
"language": "00-META"
},
{
"code": "{{:Range extraction/Format}}\n\n;Task:\n* Create a function that takes a list of integers in increasing order and returns a correctly formatted string in the range format. \n* Use the function ... | Range-extraction |
[
{
"code": "---\ncategory:\n- Sorting\nfrom: http://rosettacode.org/wiki/Ranking_methods\nnote: Sorting Algorithms\n",
"language": "00-META"
},
{
"code": "{{Sorting Algorithm}}\n\nThe numerical rank of competitors in a competition shows if one is better than, equal to, or worse than another based on ... | Ranking-methods |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Rate_counter\n",
"language": "00-META"
},
{
"code": "Counting the frequency at which something occurs is a common activity in measuring performance and managing resources. In this task, we assume that there is some job which we want to perform repeat... | Rate-counter |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Ray-casting_algorithm\nnote: Classic CS problems and programs\n",
"language": "00-META"
},
{
"code": "<br>\nGiven a point and a polygon, check if the point is inside or outside the polygon using the [[wp:Point in polygon#Ray casting algorithm|ray-cas... | Ray-casting-algorithm |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/RCRPG\nnote: Games\n",
"language": "00-META"
},
{
"code": "Create a simple interactive game which incorporates the following features:\n\n* room-based navigation in three integer dimensions (x,y,z)\n* player inventory\n* three types of item: sledge, ... | RCRPG |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Read_a_file_character_by_character/UTF8\nnote: File handling\n",
"language": "00-META"
},
{
"code": ";Task:\nRead a file one character at a time, as opposed to [[Read entire file|reading the entire file at once]].\n\nThe solution may be implemented a... | Read-a-file-character-by-character-UTF8 |
[
{
"code": "---\ncategory:\n- Simple\nfrom: http://rosettacode.org/wiki/Read_a_file_line_by_line\nnote: File handling\n",
"language": "00-META"
},
{
"code": "Read a file one line at a time, \nas opposed to [[Read entire file|reading the entire file at once]].\n\n\n;Related tasks:\n* [[Read a file cha... | Read-a-file-line-by-line |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Read_a_specific_line_from_a_file\n",
"language": "00-META"
},
{
"code": "Some languages have special semantics for obtaining a known line number from a file.\n\n\n;Task:\nDemonstrate how to obtain the contents of a specific line within a file. \n\nFo... | Read-a-specific-line-from-a-file |
[
{
"code": "---\ncategory:\n- Arithmetic operations\n- Simple\nfrom: http://rosettacode.org/wiki/Real_constants_and_functions\nnote: Basic language learning\n",
"language": "00-META"
},
{
"code": ";Task:\nShow how to use the following math constants and functions in your language (if not avail... | Real-constants-and-functions |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Recaman's_sequence\n",
"language": "00-META"
},
{
"code": "The '''[[wp:Recamán's sequence|Recamán's sequence]]''' generates Natural numbers.\n\nStarting from a(0)=0, the n'th term <code>a(n)</code>, where n>0, is the previous term minus <code>n</code... | Recamans-sequence |
[
{
"code": "---\ncategory:\n- Temporal media\nfrom: http://rosettacode.org/wiki/Record_sound\nnote: Sound\n",
"language": "00-META"
},
{
"code": "Record a monophonic 16-bit PCM sound into either memory space, a file or array.\n\n(This task neglects to specify the sample rate, and whether to use signe... | Record-sound |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Reflection/Get_source\nnote: Reflection\n",
"language": "00-META"
},
{
"code": ";Task:\nThe goal is to get the source code or file path and line number where a programming object (e.g. module, class, function, method) is defined.\n<br><br>\n",
"l... | Reflection-Get-source |
[
{
"code": "---\ncategory:\n- Programming Tasks\n- Object oriented\nfrom: http://rosettacode.org/wiki/Reflection/List_methods\nnote: Reflection\n",
"language": "00-META"
},
{
"code": ";Task:\nThe goal is to get the methods of an object, as names, values or both.\n\nSome languages offer [[Respond to a... | Reflection-List-methods |
[
{
"code": "---\ncategory:\n- Programming Tasks\n- Object oriented\nfrom: http://rosettacode.org/wiki/Reflection/List_properties\nnote: Reflection\n",
"language": "00-META"
},
{
"code": ";Task:\nThe goal is to get the properties of an object, as names, values or both.\n\nSome languages support dynami... | Reflection-List-properties |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Remove_duplicate_elements\nnote: Sorting Algorithms\n",
"language": "00-META"
},
{
"code": "{{Sorting Algorithm}}\n[[Category:Sorting]]\n\nGiven an Array, derive a sequence of elements in which all duplicates are removed.\n\nThere are basically three... | Remove-duplicate-elements |
[
{
"code": "---\ncategory:\n- File handling\nfrom: http://rosettacode.org/wiki/Remove_lines_from_a_file\n",
"language": "00-META"
},
{
"code": ";Task:\nRemove a specific line or a number of lines from a file. \n\nThis should be implemented as a routine that takes three parameters (filename, starting ... | Remove-lines-from-a-file |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Rename_a_file\nnote: File System Operations\n",
"language": "00-META"
},
{
"code": ";Task:\nRename:\n:::* a file called '''input.txt''' into '''output.txt''' and \n:::* a directory... | Rename-a-file |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Rep-string\n",
"language": "00-META"
},
{
"code": "Given a series of ones and zeroes in a string, define a repeated string or ''rep-string'' as a string which is created by repeating a substring of the ''first'' N characters of the string ''truncated... | Rep-string |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Repeat\n",
"language": "00-META"
},
{
"code": ";Task:\nWrite a procedure which accepts as arguments another procedure and a positive integer. \n\nThe latter procedure is executed a number of times equal to the accepted integer.\n<br><br>\n\n",
"l... | Repeat |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Repeat_a_string\nnote: String manipulation\n",
"language": "00-META"
},
{
"code": "Take a string and repeat it some number of times. \n\nExample: repeat(\"ha\", 5) => \"hahahahaha\"\n\nIf there is a simpler/more efficient way to repeat... | Repeat-a-string |
[
{
"code": "---\ncategory:\n- Electronics\nfrom: http://rosettacode.org/wiki/Resistor_mesh\n",
"language": "00-META"
},
{
"code": "[[image:resistor-mesh.svg|300px||right]]\n\n;Task:\nGiven <big> 10×10 </big> grid nodes (as shown in the image) interconnected by ... | Resistor-mesh |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Respond_to_an_unknown_method_call\nnote: Object oriented\n",
"language": "00-META"
},
{
"code": ";Task:\nDemonstrate how to make the object respond (sensibly/usefully) to an invocation of a method on it that it does not support through its class defi... | Respond-to-an-unknown-method-call |
[
{
"code": "---\ncategory:\n- Date and time\n- Networking and Web Interaction\n- Text processing\nfrom: http://rosettacode.org/wiki/Retrieve_and_search_chat_history\nnote: Programming environment operations\n",
"language": "00-META"
},
{
"code": ";Task:\n\n'''Summary:''' Find and print the mentions o... | Retrieve-and-search-chat-history |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Reverse_a_string\nnote: String manipulation\n",
"language": "00-META"
},
{
"code": ";Task:\nTake a string and reverse it.\n\nFor example, \"asdf\" becomes \"fdsa\".\n\n\n;Extra credit:\nPreserve Unicode combining characters. \n\nFor example, \"as⃝df̅... | Reverse-a-string |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Reverse_words_in_a_string\n",
"language": "00-META"
},
{
"code": ";Task:\nReverse the order of all tokens in each of a number of strings and display the result; the order of characters within a token should not be modified.\n\n\n;Example:\n<bi... | Reverse-words-in-a-string |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Rhonda_numbers\n",
"language": "00-META"
},
{
"code": "A positive integer '''''n''''' is said to be a Rhonda number to base '''''b''''' if the product of the base '''''b''''' digits of '''''n''''' is equal to '''''b''''' times the sum of '''''n''''''... | Rhonda-numbers |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Rock-paper-scissors\nnote: Games\n",
"language": "00-META"
},
{
"code": ";Task:\nImplement the classic children's game [[wp:Rock-paper-scissors|Rock-paper-scissors]], as well as a simple predictive '''AI''' (<u>a</u>rtificial <u>i</u>nt... | Rock-paper-scissors |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Roman_numerals/Decode\n",
"language": "00-META"
},
{
"code": ";Task:\nCreate a function that takes a Roman numeral as its argument and returns its value as a numeric decimal integer. \n\nYou don't need to validate the form of the Roman numeral.\n\nMo... | Roman-numerals-Decode |
[
{
"code": "---\ncategory:\n- String_manipulation\nfrom: http://rosettacode.org/wiki/Roman_numerals/Encode\n",
"language": "00-META"
},
{
"code": ";Task:\nCreate a function taking a positive integer as its parameter and returning a string containing the Roman numeral representation of that integer. M... | Roman-numerals-Encode |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Roots_of_a_quadratic_function\nnote: Arithmetic operations\n",
"language": "00-META"
},
{
"code": "Write a program to find the roots of a quadratic equation, i.e., solve the equation <math>ax^2 + bx + c = 0</math>. \nYour program must correctly handl... | Roots-of-a-quadratic-function |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Roots_of_unity\nnote: Arithmetic operations\n",
"language": "00-META"
},
{
"code": "The purpose of this task is to explore working with [https://en.wikipedia.org/wiki/Complex_number complex numbers].\n\n\n;Task:\nGiven <big>'''n'''</big... | Roots-of-unity |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Rosetta_Code/Count_examples\nnote: Rosetta Code related\n",
"language": "00-META"
},
{
"code": "Find the total number of programming examples for each [[:Category:Programming Tasks|task]] and the total for all tasks.\n\nEssentially, count the number ... | Rosetta-Code-Count-examples |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Rosetta_Code/Find_unimplemented_tasks\nnote: Rosetta Code related\n",
"language": "00-META"
},
{
"code": ";Task:\nGiven the name of a language on Rosetta Code, find all tasks which are not implemented in that language.\n\n\nNote: Implementations shou... | Rosetta-Code-Find-unimplemented-tasks |
[
{
"code": "---\ncategory:\n- Rosetta Code related\nfrom: http://rosettacode.org/wiki/Rosetta_Code/Fix_code_tags\nnote: Text processing\n",
"language": "00-META"
},
{
"code": ";; This task has been <em>revised</em> for the hosting change Rosetta Code has had in August 2022. \n;; See the Python exampl... | Rosetta-Code-Fix-code-tags |
[
{
"code": "---\ncategory:\n- Text processing\n- Networking and Web Interaction\n- Sorting\n- Rosetta Code related\nfrom: http://rosettacode.org/wiki/Rosetta_Code/Rank_languages_by_number_of_users\n",
"language": "00-META"
},
{
"code": ";Task:\nSort most popular programming languages based on the num... | Rosetta-Code-Rank-languages-by-number-of-users |
[
{
"code": "---\ncategory:\n- String_manipulation\nfrom: http://rosettacode.org/wiki/Rot-13\nnote: Encryption\n",
"language": "00-META"
},
{
"code": ";Task:\nImplement a '''rot-13''' function (or procedure, class, subroutine, or other \"callable\" object as appropriate to your pr... | Rot-13 |
[
{
"code": "---\ncategory:\n- Simple\nfrom: http://rosettacode.org/wiki/RPG_attributes_generator\n",
"language": "00-META"
},
{
"code": "'''RPG''' = <u>R</u>ole <u>P</u>laying <u>G</u>ame.\n\n\n\nYou're running a tabletop RPG, and your players are creating characters.\n\nEach character ... | RPG-attributes-generator |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/RSA_code\nnote: Encryption\n",
"language": "00-META"
},
{
"code": "Given an [[wp:RSA|RSA]] key (n,e,d), construct a program to encrypt and decrypt plaintext messages strings. \n\n'''Background'''\n\nRSA code is used to encode secret messages. It is n... | RSA-code |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Runge-Kutta_method\n",
"language": "00-META"
},
{
"code": "Given the example Differential equation:\n:<math>y'(t) = t \\times \\sqrt {y(t)}</math>\nWith initial condition:\n:<math>t_0 = 0</math> and <math>y_0 = y(t_0) = y(0) = 1</math>\nThis equation... | Runge-Kutta-method |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Runtime_evaluation\n",
"language": "00-META"
},
{
"code": ";Task:\nDemonstrate a language's ability for programs to execute code written in the language provided at runtime. \n\nShow what kind of program fragments are permitted (e.g. expressions vs. ... | Runtime-evaluation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.